- Computer Science Engineering (CSE)
- Data Structure (DS)
- Each node in a linked list has two pairs...

Q. |
## Each node in a linked list has two pairs of ………….. and ………………. |

A. | link field and information field |

B. | link field and avail field |

C. | avail field and information field |

D. | address field and link field |

Answer» A. link field and information field |

View all MCQs in:
Data Structure (DS)

- 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.
- If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
- What differentiates a circular linked list from a normal linked list?
- Minimum number of fields in each node of a doubly linked list is____
- In Circular Linked List insertion of a node involves the modification of ____ links.
- In linked list implementation, a node carries information regarding
- A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
- A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
- 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?
- Any node is the path from the root to the node is called

Login to Continue

It will take less than 2 minutes

Report MCQ