WB JECA MCA Data Structures Previous Year Questions (PYQs) – Page 1 of 2
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Find out the wrong statement based on the characteristics of AVL tree data structure.
1
2
3
4
Solution
AVL trees guarantee O(log n) search time, not O(n).
Example of non-linear data structure is __________.
1
2
3
4
Solution
Graphs and trees are non-linear data structures, while linked-list, queue, and stack are linear.
Bubble sort algorithm has a worst-case time complexity of __________.
1
2
3
4
Solution
Graphs and trees are non-linear data structures, while linked-list, queue, and stack are linear.
Insertion sort algorithm has a best-case time complexity of __________.
1
2
3
4
Solution
Insertion sort runs in O(n) time when the array is already sorted (best case).
__________ algorithm is used to find out the shortest path between two points in a connected weighted graph.
1
2
3
4
Solution
Kruskal’s algorithm (and Prim’s) are used in shortest path/minimum spanning tree problems.
Which of the given statement is the correct recurrence for the worst case of Binary Search?
1
2
3
4
Solution
Solution: Binary search recurrence is T(n) = T(n/2) + O(1). Base case T(1)=O(1).
Answer: (C) T(n) = T(n/2) + O(1)
Answer: (C) T(n) = T(n/2) + O(1)
Which of the following data structure is required to convert an arithmetic expression in infix form to its equivalent postfix form ?
1
2
3
4
Solution
Solution: Infix→postfix conversion (e.g., Shunting-yard) uses a stack to manage operators and parentheses.
Answer: (D) Stack
Answer: (D) Stack
Numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The tree uses usual ordering. What is the in-order traversal sequence?
1
2
3
4
Solution
Solution: In-order traversal of a BST gives the sorted order of keys ⇒ 0 to 9 ascending.
Answer: (C) 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
Answer: (C) 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
Worst case time complexity of inserting into an empty linear linked list, if list must remain sorted?
1
2
3
4
Solution
Solution: To keep list sorted, insertion needs traversal O(n).
Answer: (A) Θ(n)
Answer: (A) Θ(n)
What is the worst case complexity of inserting a node in doubly linked list ?
1
2
3
4
Solution
Solution: Insertion in DLL is O(1) (given pointer to location).
Answer: (D)
Answer: (D)
WB JECA MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
WB JECA MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
