Question

1)Given a singly linked list contains four nodes and simply show as 4->3->2->1, where the head reference refers to the first node contains an Integer with value 4. If Node curr = head; curr= curr.next; are applied to this list, what is the number you can find in the first node?

2)

Given a singly linked list contains 6 nodes, which is simply shown as 1->2->3->4->5->6. Assume head refers to the first node (contains 1) on the list. How many nodes remain on the list if the following statements are applied?

Node curr = head.next;

while(curr!=null)

{

if(curr. element % 2==0) curr = curr.next;

else curr.element++;

}

head = curr;

3)

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;

Answer 1

1)Given a singly linked list contains four nodes and simply show as 4->3->2->1, where the head reference refers to the first node contains an Integer with value 4. If Node curr = head; curr= curr.next; are applied to this list, what is the number you can find in the first node?

Ans:

let start node address is 100, and the next node address is 200, and so on.

4->3->2->1

4 is address 100, 3 at address 200, 2 at address 300.

head=100

curr=head //100

curr=curr.next //200

here we have changed the curr to the next location. but the head is not changed.

so head points to 1st node that is 4, and curr points to second node that is 3.

============================================================================================

2)

Given a singly linked list contains 6 nodes, which is simply shown as 1->2->3->4->5->6. Assume head refers to the first node (contains 1) on the list. How many nodes remain on the list if the following statements are applied?

Node curr = head.next;

while(curr!=null)

{

if(curr. element % 2==0) curr = curr.next;

else curr.element++;

}

head = curr;

Ans:

so head=null

there will be node in the list.

============================================================================================

3)

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;

Ans: