Question

True False Question 2 (3 points) Given a singly linked list with more than two nodes, to remove the second node from a linked list with only head reference, assume curr - head, next, you do Set curr.next to head.next Oset head. next to curr.next Set head, next to curr Oset head to curr.next TL th Question 3 (3 points) Given the following singly linked list (a list with four nodes), what will be the value stored at the last node when the following operations are executed? head->|11||-|5||->|10||--12||| gu חי E Node curr head: al while(curr.next!-null) { LE curr.item-curritem+head.item; 83 F6 PrtScn F8 F7 Home F9 End F10 PgUp. F11 PgDn F12

Answer 1

1)curr=head.next so it points to second node. If we wnat to delete second node we have to point the first node to third node which is curr.next

head.next=curr.next (Option 2)

2)8 Option 1

whatever te reasons maybe but tatlast we are adding the node 8 to it so it becomes the last nodes and the previous nodes will be 22->27->32->34->8

3)Stack is last in first out and Queue will be First In First out s, whatever the value will be moved last into queue will be last one to be come out

3 8 2 4 6 are the values which are pushed to stack and top value is 6 as it is the last entered value and it will be the first to come ot of stack and the last value to come ot of stack is 3 and it will be the last to be added into queue

Otput is 3 (Option 3)

4)we have the string rotator

Here inside the function it satisfies 3rd elseif condition where first character and last character is equal so here it is equal so it calls the recursion by removing first and last chacter

otato Here also it is same we have first and last character same It removes them and calls again

tat Same like above.

a this is the last recursion where it's lenght is 1 so as per second if condition it returns TRUE

Option 1

5)The Option 1

Here it starts adding from 19 itself not less than 19 and also when it reaches to sum(1) using recursion it calls sum(1-2) which is sum(-1) which not equals to zero . It goes to recursive memory exhaustion.

It is false

6)As the m2 does not have mechanism to throw the errors it can't be caugfht.

It will terminate the program

Option 2

7)

It returns true if b contains more values otherwise false Because this is the only condition where it reaches to second if condition and 'b' and retrns true otherwise false

We may hve scenarios regarding false but according to these options it is correct

Option 2

8)In qeue the elements will come out in the same mannner as they enter

3 8 2 4 6 (3 is added first it will come out first)

In stack it will be last in first out and first in last out.

The value 3 will be pushed frst into the stack so it will be the lsat to come

Option 4

9)Option 4

Until last node it will traverse and adds the value

10)p(5)=p(4)+p(3)

p(4)=p(3)+p(2)

p(3)=p(2)+p(1)=3+2=5

p(4)=5+3=8

p(5)=8+5=13

Option 2