21. A variant of the linked list in which none of the node contains NULL pointer is?
a. Singly linked list
b. Doubly linked list
c. Circular linked list
d. None of the above
Answer: (c).Circular linked list

22. In circular linked list, insertion of node requires modification of?
a. One pointer
b. Two pointer
c. Three pointer
d. Requires no modification
Answer: (b).Two pointer

23. Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?
a. O (1)
b. O (log n)
c. O (n)
d. O (n log n)
Answer: (a).O (1)

24. In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is
a. 0 (1)
b. 0 (log n)
c. 0 (n)
d. 0 (n log n)
Answer: (a). 0 (1)

25. A linear collection of data elements where the linear node is given by means of pointer is called
a. linked list
b. node list
c. primitive list
d. None of these
Answer: (a).linked list

26. The time required to delete a node x from a doubly linked list having n nodes is
a. O (n)
b. O (log n)
c. O (1)
d. O (n log n)
Answer: (c).O (1)

27. A collection of data items of similar type arranged in a sequence is termed as?
a. Memory space
b. Static data structure
c. Data structure
d. List
Answer: (d).List

28. A linked list is a linear collection of homogeneous elements called______.
a. Runtime
b. Nodes
c. Pointers
d. None of the above
Answer: (b).Nodes

29. Depending on what on what can a linked list be classified into various other types?
a. The number of pointers in a node
b. The purpose for which the pointers are maintained
c. Both (a) and (b)
d. None of the above
Answer: (c).Both (a) and (b)

30. In a singly-linked list (linear linked list), how many fields does each node consists of?
a. One
b. Three
c. Two
d. Zero
Answer: (c).Two

Page 3 of 17