Question

1.

public int function(int x, int n) {
if (n == 0)
return 1;
return x * function(x, n -1);
}

function(3,3) - What is the expected output?

3

12

9

27

2.

int fun(int x)
{
    if(x == 0)
        return 1;
    else
        return fun(x - 1);
}

fun(4)

18

1

24

4

3.

Which one of the following calls results 6?
int mystery(int n){
    if (n == 1)
        return 1;
    else
        return n * mystery(n - 1);
}

mystery(3)

mystery(2)

mystery(1)

mystery(6)

4.

public void push(int new_data)
{
    Node new_Node = new Node(new_data);

    new_Node.next = head;
    new_Node.prev = null;

    if (head != null)
        head.prev = new_Node;

    head = new_Node;
}

The code snippet depicts stack implementation

True

False

5.

public int function(int x, int n) {
if (n == 0)
return 1;
return x * function(x, n -1);
}

function(3,3) - What is the expected output?

3

12

9

27

6.

What is the output of the doubly-linked list example below?

Node end = head;

while(end.next != null) {

System.out.println(node.name);

}

This code will result in an error.

Looping to find the first node of the list.

Looping until the last node is found.

Endless loop

Answer 1

1)  D.  27
2)  B.  1
3)  A.  mystery(3)
4)  True
5)  D.  27
6)  D.  Endless loop