Circular Linked List

1.    The _________node of a Circular Link List contains one links.

1. only middle
2. only first
3. only last
4. All

Ans)D

2.    In Circular Doubly Linked List a node contain how many fields.

1. 1
2. 3
3. 2
4. None

Ans)B

3.    Next pointer of last node in a circular linked list contains the address of.

1. Last node
2. Previous node
3. First Node
4. NULL

Ans)C

4. A linked list is called a circular list if

a.       There is a loop in a linked list

b.      If  the last node contains a null pointer

c.       If the last node contains the pointer to the first node

d.      All

Ans : c

5.  Null pointer represents

1. Empty stack
2. Empty queue
3. Empty circular list
4. Empty tree

Ans : c

6. A linked list is called a circular list if

e.       There is a loop in a linked list

f.       If  the last node contains a null pointer

g.      If the last node contains the pointer to the first node

h.      All

Ans : c

    

7. Null pointer represents

5. Empty stack
6. Empty queue
7. Empty circular list
8. Empty tree

Ans : c