Question

Given a singly linked list contains 5 nodes, which simply shows as 5->4->3->2->1, what is the value that you can find in the second node of the remaining list if the following statements are applied? Assume head reference refers the first node of the list.

Node prev = head;

Node curr = head. next;

while(curr.next!=null)

{

if(prev.element > 3)

{

prev = curr;

curr = curr.next;

}

else break;

}

head = prev.next;

Question 3 options:

	3
	2
	4
	1

Which of the following is the code to insert a new node, referenced by newNode, into an empty queue implemented by a SinglyLinkedList with a head and tail references?

Question 5 options:

	A) newNode.setNext(tail); newNode = tail; newNode = head;
	B) tail. setNext(tail); tail = newNode; head = newNode;
	C) head. setNext(newNode); tail= newNode;
	D) newNode.setNext(tail); head = newNode; tail = newNode; Which of the following code fragments is used to delete the item at the front of a queue represented by a circular array? Question 6 options: A) front = MAX_QUEUE - front; --count; B) front = (back+1) % MAX_QUEUE; --count; C) front = (front+1) % MAX_QUEUE; --count; D) front = front - back; --count; What values are returned during the following series of stack operations, if executed upon an initially empty stack? push(21), push(19), pop(), push(2), push(8), pop(), pop(), push(9), push(1), pop(), push(7), push(6), pop(), pop(), push(4), pop(), pop(). (Please provide the returned values in the format "value1, value2, value3...")

Answer 1

1.
1

2.
B)tail.setNext(newNode);
tail = newNode;
head = newNode;

3.
C) front = (front+1) % MAX_QUEUE;
--count;

4.
19, 8, 2, 1, 6, 7, 4, 9

Answer 2

The value found in the second node of the remaining list after executing the given code is 2.

To insert a new node referenced by newNode into an empty queue implemented by a SinglyLinkedList with a head and tail references, the code fragment D) is used:

bashCopy codenewNode.setNext(tail);head = newNode;tail = newNode;

To delete the item at the front of a queue represented by a circular array, the code fragment C) is used:

scssCopy codefront = (front+1) % MAX_QUEUE;--count;

The values returned during the given series of stack operations are:

Copy code
21, 8, 2, 1