McqMate

Q. |
## Each node in a singly linked lists have ______ fields |

A. | 2 |

B. | 3 |

C. | 4 |

D. | 5 |

Answer» A. 2 |

1.8k

0

Do you find this helpful?

3

View all MCQs in

Data Structures (DS)No comments yet

- Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
- What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
- In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
- Minimum number of fields in each node of a doubly linked list is____
- If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
- A linked list whose last node points back to the list node instead of containing the null pointer________.
- A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
- To insert a new node in linked list free node will be available in ___________.
- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.