# Objective Questions on List and Linked List in Data Structure set-2

1) 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

2) A singly linked list is also called as ……..
B. one way chain
C. two way chain

3) A ….. list is a header list where the node points back to the header node.

4) A doubly linked list has ………. pointers with each node.
A. 0
B. 1
C. 2
D. 3

5) Header linked lists are frequently used for maintaining …….. in memory.
A. Polynomials
B. Binomial
C. Trinomial

6) The pointer that points to the first node in the list is ……..
A. FIRST
B. AVAIL
C. TOP
D. REAR

7) Two-way list may be maintained in memory by means of ………….
A. Queues
B. Linear arrays
C. Non linear arrays
D. Stacks

8) A doubly linked list is also called as ……….
B. one way chain
C. two way chain

9) The list that requires two pointer variables FIRST and LAST is called ……..
A. Circular list
C. One way list
D. Two way list

10) If the availability list is null, then the condition is said to be ………
A. nil block
B. availability list underflow
C. availability list overflow
D. memory loss

11) The list which has its own pointer is called ……..
A. pointer list
B. self pointer
C. free pool
D. own pointer

12) Which of the following is two way lists?
D. None of the above

13) A ………. is a header list where the last node contains the null pointer.

14) RLINK is the pointer pointing to the …
A. successor node
B. predecessor node
D. last node

15) A …………. is a header list where the last node points back to the header node.

16) In a linked list, insertion can be done as ………
A. beginning
B. end
C. middle
D. all of the above

17) In a two-way lists each node is divided into …….parts.
A. 1
B. 2
C. 3
D. 4

A. it is possible to get into infinite loop
B. last node points to fist node.
C. time consuming
D. requires more memory space.

19) Which of the following conditions checks available free space in avail list?
A. Avail=Null
B. Null=Avail
C. Avail=Max stack
D. Avail=Top

20) A linear list in which each node has point to the predecessor and successors nodes is called ……..

1) B. Avail list
2) B. one way chain
4) C. 2
5) A. Polynomials
6) A. FIRST
7) B. Linear arrays
8) C. two way chain
9) D. Two way list
10) B. availability list underflow
11) C. free pool
12) D. None of the above