Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. To insert a new node in linked list free node will be available in ___________.
a. Available list.
b. Avail list.
c. Free node list.
d. Memory space list.
Q. A ______________ list is a header list where the node points back to the header node.
a. Circular header.
b. Grounded header.
c. Two way header.
d. One way header.
Q. How many pointers are necessarily changed for the insertion in a Linked List?
a. 1.
b. 2.
c. 3.
d. 5.
Q. An algorithm that calls itself directly or indirectly is known as ____________.
a. Sub algorithm. .
b. Recursion.
c. Polish notation.
d. Traversal algorithm.
Q. What would be the asymptotic time complexity to insert an element at the front of the linked list(head is known)?
a. O(1)
b. O(n)
c. O(n2)
d. O(n3)
Q. What would be the asymptotic time complexity to find an element in the linked list?
a. O(1)
b. O(n)
c. O(n2)
d. O(n4)
Q. What would be the asymptotic time complexity to insert an element at the second position in thelinked list?
a. O(1)
b. O(n)
c. O(n2)
d. O(n3)
Q. The concatenation of two list can performed in O(1) time. Which of the following variation oflinked list can be used?
a. Singly linked list
b. Doubly linked list
c. Circular doubly linked list
d. Array implementation of list
Q. Which of the following c code is used to create new node?
a. ptr = (NODE*)malloc(sizeof(NODE));
b. ptr = (NODE*)malloc(NODE);
c. ptr = (NODE*)malloc(sizeof(NODE*));
d. ptr = (NODE)malloc(sizeof(NODE));
Q. In a stack, if a user tries to remove an element from empty stack it is called
a. Underflow
b. Empty collection
c. Overflow
d. Garbage Collection
Q. Pushing an element into stack already having five elements and stack size of 5, then stack becomes
a. Overflow
b. Crash
c. Underflow
d. User flow
Q. Entries in a stack are “ordered”. What is the meaning of this statement?
a. A collection of stacks is sortable
b. Stack entries may be compared with the ‘<‘ operation
c. The entries are stored in a linked list
d. There is a Sequential entry that is one by one
Q. Which of the following is not the application of stack?
a. A parentheses balancing program
b. Tracking of local variables at run time
c. Compiler Syntax Analyzer
d. Data Transfer between two asynchronous process