Top 150+ Solved Data Structure (DS) MCQ Questions Answer
Q. Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS.ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
a. (ii) and (iii) are true
b. (i) and (ii) are true
c. (iii) and (iv) are true
d. (ii) and (iv) are true
Q. Which of the following option is not correct?
a. if the queue is implemented with a linked list, keeping track of a front pointer, only rear pointer s will change during an insertion into an non-empty queue.
b. queue data structure can be used to implement least recently used (lru) page fault algorithm and quick short algorithm.
c. queue data structure can be used to implement quick short algorithm but not least recently used (lru) page fault algorithm.
d. both (a) and (c)
Q. Overflow condition in linked list may occur when attempting to .............
a. create a node when free space pool is empty
b. traverse the nodes when free space pool is empty
c. create a node when linked list is empty
d. none of these
Q. Which of the following is not a type of Linked List ?
a. doubly linked list
b. singly linked list
c. circular linked list
d. hybrid linked list
Q. Linked list is generally considered as an example of _________ type of memory allocation.
a. static
b. dynamic
c. compile time
d. none of these
Q. Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.
a. pointer to class
b. pointer to an integer
c. pointer to character
d. pointer to node
Q. If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
a. 1036
b. 1028
c. 1038
d. none of these
Q. Linked list uses
a. random memory allocation
b. static memory allocation
c. fixed memory allocation
d. dynamic memory allocation
Q. First link node of list is accessed from a pointer named
a. tail
b. head
c. terminator
d. initiator
Q. A linked list is made up of a set of objects known as
a. nodes
b. arrays
c. entities
d. instances
Q. How do you calculate the pointer difference in a memory efficient double linked list?
a. head xor tail
b. pointer to previous node xor pointer to next node
c. pointer to previous node – pointer to next node
d. pointer to next node – pointer to previous node