MCQ On List And Linked List In Data Structure Set-1

Here is the collection of MCQ on the list and the linked list includes the collection of multiple-choice questions on the list and linked list in the data structure. It includes MCQ on two-way lists, singly linked list and circular linked list, list traversal, and dequeue included on the list and linked list in the data structure.

1) Linked lists are best suited …..
A. for relatively permanent collections of data.
B. the size of the structure and the data in the structure are constantly changing.
C. data structure
D. for none of the above situation

2) The operation of processing each element in the list is known as ……
A. sorting
B. merging
C. inserting
D. traversal

3) The situation when in a linked list START=NULL is ….
A. Underflow
B. Overflow
C. Houseful
D. Saturated

4) Each node in singly linked list has …….. fields.
A. 2
B. 3
C. 1
D. 4

5) Which of the following are two-way lists?
A. Grounded header list
B. Circular header list
C. Linked list with header and trailer nodes
D. List traversed in two directions

6) Which is the pointer associated with the availability list?
A. FIRST
B. AVAIL
C. TOP
D. REAR

7) Value of first linked list index is ….
A. 0
B. 1
C. -1
D. 2

8) In linked lists, there are no NULL links in
A. single linked list
B. linear doubly linked list
C. circular linked list
D. linked list

9) Each node in a linked list must contain at least …..
A. Three fields
B. Two fields
C. Four fields
D. Five fields

10) The dummy header in linked list contain …..
A. first record of the actual data
B. last record of the actual data
C. pointer to the last record of the actual data
D. middle record of the actual data

11) In a linked list the ………. field contains the address of next element in the list.
A. Link field
B. Next element field
C. Start field
D. Info field

Table of Contents

Read Also: MCQ on Searching, Merging and Sorting Methods in Data Structure

12) LLINK is the pointer pointing to the …
A. successor node
B. predecessor node
C. head node
D. last node

13) ………. refers to a linear collection of data items.
A. List
B. Tree
C. Graph
D. Edge

14) A run list is ……
A. small batches of records from a file
B. number of elements having same value
C. number of records
D. number of files in external storage

15) A …… indicates the end of the list.
A. Guard
B. Sentinel
C. End pointer
D. Last pointer

16) A …….. is a linear list in which insertions and deletions are made to from either end of the structure.
A. circular queue
B. random of queue
C. priority
D. dequeue

17) Indexing the …….. element in the list is not possible in linked lists.
A. middle
B. first
C. last
D. any where in between

18) A linear list in which the pointer points only to the successive node is ……
A. singly linked list
B. circular linked list
C. doubly linked list
D. none of the above

19) ………. may take place only when there is some minimum amount(or) no space left in free storage list.
A. Memory management
B. Garbage collection
C. Recycle bin
D. Memory management

20) A linear list in which the last node points to the first node is ……..
A. singly linked list
B. circular linked list
C. doubly linked list
D. none of the above

Answers:

1) B. the size of the structure and the data in the structure are constantly changing.
2) D. traversal
3) A. Underflow
4) A. 2
5) D. List traversed in two directions
6) B. AVAIL
7) A. 0
8) C. circular linked list
9) B. Two fields
10) A. first record of the actual data
11) A. Link field
12) B. predecessor node
13) A. List
14) A. small batches of records from a file
15) B. Sentinel
16) D. dequeue
17) A. middle
18) A. singly linked list
19) B. Garbage collection
20) B. circular linked list