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 following is not a typical use of stacks?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

BFS uses queue, not stack.

Qus : 7 WB JECA MCA PYQ

In a circular queue of size n, when is the queue considered full?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Queue full when next position of rear is front.

Qus : 8 WB JECA MCA PYQ

Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Inorder traversal of BST gives sorted order.

Qus : 9 WB JECA MCA PYQ

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

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Linear recurrence → T(n)=O(n).

Qus : 10 WB JECA MCA PYQ

The order of an algorithm that finds whether a given Boolean function of n variables produces 1 is

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Worst case checks all combinations → O(2^n).

Qus : 11 WB JECA MCA PYQ

Which of the following can be done with Linked List?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

All listed implementations are possible.

Qus : 12 WB JECA MCA PYQ

What is the worst case time complexity to access an element in a binary search tree?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Unbalanced BST → O(n).

Qus : 13 WB JECA MCA PYQ

Which of the following represents postorder traversal of a binary tree?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Postorder = Left, Right, Root.

Qus : 14 WB JECA MCA PYQ

In a graph of n nodes and n edges, how many cycles will be present?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Graph with n edges has at most one cycle.

Qus : 15 WB JECA MCA PYQ

What is the value of the postfix expression 6 3 2 4 + - *?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

6*(3-(2+4))=6*(-3)=-18.

Qus : 16 WB JECA MCA PYQ

Which of the following points is/are not true about Linked List data structure when it is compared with an array?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Access in linked list is slower than arrays.

Qus : 17 WB JECA MCA PYQ

What is a dequeue?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Deque allows insertion/deletion at both ends.

Qus : 18 WB JECA MCA PYQ

What is the best case time complexity of deleting a node in a Singly Linked List?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Best case deletion is constant time.

Qus : 19 WB JECA MCA PYQ

Five elements P, Q, R, S, T are pushed onto a stack starting from P. The stack is then popped 4 times, and each popped element is inserted into a queue. Two elements are then deleted from the queue and pushed back onto the stack. Finally, one element is popped from the stack. What will be the popped element?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Final popped element becomes Q after operations.

Qus : 20 WB JECA MCA PYQ

Consider the following operations on a singly linked list initially containing the elements: 10 → 20 → 30 → 40

(i) Insert 15 after 10

(ii) Delete node containing 30

(iii) Insert 25 at end

(iv) Delete first node.

What will be the final sequence?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Final list: 20 → 15 → 25 → 40.

Qus : 21 WB JECA MCA PYQ

A complete binary tree has 63 nodes. How many leaf nodes does it have?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Leaves = (n+1)/2 = 32.

Qus : 22 WB JECA MCA PYQ

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

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Time ∝ n log n → approx 6.7 sec.

Qus : 23 WB JECA MCA PYQ

Which of the following are advantages of using a linked list over arrays?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2025 PYQ

Solution

Dynamic size + easy insertion; but random access not faster.

Qus : 24 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 : 25 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 : 26 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 : 27 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 : 28 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 : 29 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 : 30 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 : 31 WB JECA MCA PYQ

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 : 32 WB JECA MCA PYQ

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 : 33 WB JECA MCA PYQ

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 : 34 WB JECA MCA PYQ

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

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

WB JECA MCA

WB JECA MCA

Game Changer NIMCET Test Series 2026

Info.

Confirm Delete

Edit