If FRONT = NULL then _________.

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; }
• Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
• The situation when in a linked list START=NULL is
• A _____________ list is a list where the last node contains null pointer.
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• __________________ is a header list where the last node contains the null pointer.
• The situation in linked list START = NULL is called_________
• The situation when in a linked list START=NULL is ….
• In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.