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 ........
A. linked list
B. one way chain
C. two way chain
D. right link
3) 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
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
D. Quadratic equation
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 ..........
A. linked list
B. one way chain
C. two way chain
D. right link
9) The list that requires two pointer variables FIRST and LAST is called ........
A. Circular list
B. Header 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?
A. Grounded header list
B. Circular header list
C. Linked list with header and trailer nodes
D. None of the above
13) A .......... is a header list where the last node contains the null pointer.
A. grounded header list
B. bottom header list
C. down header list
D. dropped header list
14) RLINK is the pointer pointing to the ...
A. successor node
B. predecessor node
C. head node
D. last node
15) A ............. is a header list where the last node points back to the header node.
A. rounded header list
B. circular header list
C. common header list
D. forward header list
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
18) The disadvantage in using a circular linked list is .......
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 ........
A. singly linked list
B. circular linked list
C. doubly linked list
D. linear linked list
Answers:
1) B. Avail list
2) B. one way chain
3) A. Circular header
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
13) A. grounded header list
14) A. successor node
15) B. circular header list
16) D. all of the above
17) C. 3
18) A. it is possible to get into infinite loop
19) A. Avail=Null
20) C. doubly linked list
Related Posts
Solved MCQ on Stack and Queue in Data Structure set-1
Interview Questions on Stack and Queue in Data Structure set-2
Solved MCQ on Tree and Graph in Data Structure set-1
Objective Questions on Tree and Graph in Data Structure set-2
Solved MCQ of Data Structure Set - 1
Solved MCQ of Data Structure Set - 2
Solved Objective questions of computer data structure set-3
Solved MCQ of Data Structure and Algorithm set-4
MCQ of Data Structure and Algorithm with Answer set-5
Post a Comment