There is an extra element at the head of the list called a ……….

Related MCQs

• public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; while(temp.getNext() != head) temp = temp.getNext(); if(temp == head) { var = head.getItem(); head = null; return var; } temp.setNext(head.getNext()); var = head.getItem(); head = head.getNext(); return var; } What is the functionality of the following code? Choose the most appropriate answer.
• 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; }
• 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.
• In ……………, search start at the beginning of the list and check every element in the list.
• In a linked list the _________field contains the address of next element in the list.
• 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?
• What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
• What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• What differentiates a circular linked list from a normal linked list?