WB JECA MCA Data Structures Previous Year Questions (PYQs) – Page 3 of 4
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Showing 34 questions
A complete binary tree has 63 nodes. How many leaf nodes does it have?
1
2
3
4
Solution
Leaves = (n+1)/2 = 32.
A machine needs a minimum of 100 second to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately
1
2
3
4
Solution
Time ∝ n log n → approx 6.7 sec.
Which of the following are advantages of using a linked list over arrays?
1
2
3
4
Solution
Dynamic size + easy insertion; but random access not faster.
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)
Which sorting algorithm is most efficient if elements are already in sorted order ?
1
2
3
4
Solution
Solution: Insertion sort runs in O(n) when input is already sorted.
Answer: (C)
Answer: (C)
What is the prefix of expression A-B/(C*D^E) ?
1
2
3
4
Solution
Solution: Infix: A - B/(C*D^E). Precedence: ^ > * > /. Prefix = - A / B * C ^ D E.
Answer: (A)
Answer: (A)
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.
