WB JECA MCA Data Structures Previous Year Questions (PYQs) – Page 4 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
In singly linked list, the time complexity for insertion at a particular node is:
1
2
3
4
Solution
Insertion after a given node in a linked list takes constant time
O(1)(if pointer to that node is already available).
In stack data structure, __________ operation is not permitted.
1
2
3
4
Solution
Enqueue is a queue operation, not allowed in stack.
In tree data structure, the in-degree of root node is always __________.
1
2
3
4
Solution
The root node has no incoming edges, so its in-degree is always 0.
In binary tree data structure, using depth-first approach, preorder traversal means _______.
1
2
3
4
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.
View More
WB JECA MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
