- Computer Science Engineering (CSE)
- Data Structure (DS)
- In linked list implementation, a node ca...

Q. |
## In linked list implementation, a node carries information regarding |

A. | the data |

B. | the link |

C. | both a & b |

D. | none of these |

Answer» C. both a & b |

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?
- Each node in a linked list has two pairs of ………….. and ……………….
- In Circular Linked List insertion of a node involves the modification of ____ links.
- Minimum number of fields in each node of a doubly linked list is____
- Any node is the path from the root to the node is called
- node.next -> node.next.next; will make
- What is the functionality of the following code? Choose the most appropriate answer. public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; Node cur; while(temp.getNext() != head) { cur = temp; temp = temp.getNext(); } if(temp == head) { var = head.getItem(); head = null; return var; } var = temp.getItem(); cur.setNext(head); return var; }
- Standard approach for implementation of a list is/are of

Login to Continue

It will take less than 2 minutes

Report MCQ