Top 350+ Solved Data Structure and Algorithms (DSA) MCQ Questions Answer
Q. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?i) Insertion at the front of the linked listii) Insertion at the end of the linked listiii) Deletion of the front node of the linked listiv) Deletion of the last node of the linked list
a. i and ii
b. i and iii
c. i,ii and iii
d. i,ii and iv
Q. Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?i) Insertion at the front of the linked listii) Insertion at the end of the linked listiii) Deletion of the front node of the linked listiv) Deletion of the end node of the linked list
a. i and ii
b. i and iii
c. i,ii and iii
d. i,ii,iii and iv
Q. In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
a. pointer to character
b. pointer to integer
c. pointer to node
d. node
Q. What would be the asymptotic time complexity to add an element in the linked list?
a. o(1)
b. o(n)
c. o(n2)
d. none
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. none
Q. What would be the asymptotic time complexity to insert an element at the second position in the linked list?
a. o(1)
b. o(n)
c. o(n2)
d. none
Q. The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
a. singly linked list
b. doubly linked list
c. circular doubly linked list
d. array implementation of list
Q. Consider the following definition in c programming languagestruct node{int data;struct node * next;}typedef struct node NODE;NODE *ptr;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. A variant of linked list in which last node of the list points to the first node of the list is?
a. singly linked list
b. doubly linked list
c. circular linked list
d. multiply linked list
Q. In doubly linked lists, traversal can be performed?
a. only in forward direction
b. only in reverse direction
c. in both directions
d. none
Q. What kind of linked list is best to answer question like “What is the item at position n?”
a. singly linked list
b. doubly linked list
c. circular linked list
d. array implementation of linked list
Q. A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?
a. it waste memory space since the pointer head already points to the first node and thus the list node does not need to point to the first node.
b. it is not possible to add a node at the end of the list.
c. it is difficult to traverse the list as the pointer of the last node is now not null
d. all of above
Q. A variant of the linked list in which none of the node contains NULL pointer is?
a. singly linked list
b. doubly linked list
c. circular linked list
d. none
Q. In circular linked list, insertion of node requires modification of?
a. one pointer
b. two pointer
c. three pointer
d. none
Q. Which of the following statements about linked list data structure is/are TRUE?
a. addition and deletion of an item to/ from the linked list require modification of the existing pointers
b. the linked list pointers do not provide an efficient way to search an item in the linked list
c. linked list pointers always maintain the list in ascending order
d. the linked list data structure provides an efficient way to find kth element in the list