WB JECA MCA Data Structures Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

WB JECA MCA
Previous Year Questions

WB JECA MCA
Previous Year Questions
WB JECA MCA

WB JECA MCA Previous Year Questions (PYQs)

WB JECA MCA Data Structures PYQ

Qus : 1 WB JECA MCA PYQ

Find out the wrong statement based on the characteristics of AVL tree data structure.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

AVL trees guarantee O(log n) search time, not O(n).

Qus : 2 WB JECA MCA PYQ

Example of non-linear data structure is __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Graphs and trees are non-linear data structures, while linked-list, queue, and stack are linear.

Qus : 3 WB JECA MCA PYQ

Bubble sort algorithm has a worst-case time complexity of __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Graphs and trees are non-linear data structures, while linked-list, queue, and stack are linear.

Qus : 4 WB JECA MCA PYQ

Insertion sort algorithm has a best-case time complexity of __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Insertion sort runs in O(n) time when the array is already sorted (best case).

Qus : 5 WB JECA MCA PYQ

__________ algorithm is used to find out the shortest path between two points in a connected weighted graph.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Kruskal’s algorithm (and Prim’s) are used in shortest path/minimum spanning tree problems.

Qus : 6 WB JECA MCA PYQ

Which of the given statement is the correct recurrence for the worst case of Binary Search?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2024 PYQ

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)

Qus : 7 WB JECA MCA PYQ

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
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2024 PYQ

Solution

Solution: Infix→postfix conversion (e.g., Shunting-yard) uses a stack to manage operators and parentheses.
Answer: (D) Stack

Qus : 8 WB JECA MCA PYQ

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
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2024 PYQ

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

Qus : 9 WB JECA MCA PYQ

Worst case time complexity of inserting into an empty linear linked list, if list must remain sorted?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2024 PYQ

Solution

Solution: To keep list sorted, insertion needs traversal O(n).
Answer: (A) Θ(n)

Qus : 10 WB JECA MCA PYQ

What is the worst case complexity of inserting a node in doubly linked list ?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2024 PYQ

Solution

Solution: Insertion in DLL is O(1) (given pointer to location).
Answer: (D)

Qus : 11 WB JECA MCA PYQ

Which sorting algorithm is most efficient if elements are already in sorted order ?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2024 PYQ

Solution

Solution: Insertion sort runs in O(n) when input is already sorted.
Answer: (C)

Qus : 12 WB JECA MCA PYQ

What is the prefix of expression A-B/(C*D^E) ?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2024 PYQ

Solution

Solution: Infix: A - B/(C*D^E). Precedence: ^ > * > /. Prefix = - A / B * C ^ D E.
Answer: (A)

Qus : 13 WB JECA MCA PYQ

41.In singly linked list, the time complexity for insertion at a particular node is:

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Insertion after a given node in a linked list takes constant time O(1) (if pointer to that node is already available).

Qus : 14 WB JECA MCA PYQ

42.In stack data structure, __________ operation is not permitted.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Enqueue is a queue operation, not allowed in stack.

Qus : 15 WB JECA MCA PYQ

43.In tree data structure, the in-degree of root node is always __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

The root node has no incoming edges, so its in-degree is always 0.

Qus : 16 WB JECA MCA PYQ

44.In binary tree data structure, using depth-first approach, preorder traversal means _______.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Preorder traversal visits root first, then left subtree, then right subtree.

WB JECA MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

WB JECA MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

Please provide more information - at least 10 characters

Feedback

Info.

Information

Aspire's Library

WB JECA MCA Previous Year Questions (PYQs)

WB JECA MCA Data Structures PYQ

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

WB JECA MCA

WB JECA MCA

Info.

Confirm Delete

Edit