WB JECA MCA Data Structures Previous Year Questions (PYQs) – Page 1 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
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 following is not a typical use of stacks?
1
2
3
4
Solution
BFS uses queue, not stack.
In a circular queue of size n, when is the queue considered full?
1
2
3
4
Solution
Queue full when next position of rear is front.
Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?
1
2
3
4
Solution
Inorder traversal of BST gives sorted order.
The running time T(n) of an algorithm is given as follows: T(n)=c+T(n-1), if n>1 and =d if n≤1. Here c and d are constants.
1
2
3
4
Solution
Linear recurrence → T(n)=O(n).
The order of an algorithm that finds whether a given Boolean function of n variables produces 1 is
1
2
3
4
Solution
Worst case checks all combinations → O(2^n).
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.
