Question

1.

static int function(int n){
     
        return n * function(n + 1);
}

If you call the method function(2), the expected output is 3.

True

False

2.

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

3.

A ________ list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes.

Single-linked

doubly-linked

Recursion

4.

Which one of the following statements about stacks is incorrect?

Stacks can be implemented using linked lists.

Stacks are first-in, first-out (FIFO) data structures.

New nodes can only be added to the top of the stack.

The last node (at the bottom) of a stack has a null (0) link.

5.

In general, linked lists allow:

Insertions and removals anywhere.

Insertions and removals only at one end.

Insertions at the back and removals from the front.

None of the above.

6.

How many pointers are contained as data members in the nodes of a circular, doubly linked list of integers with five nodes?

3

15

8

10

Answer 1

1)  False
2)  True
3)  doubly-linked
4)  Stacks are first-in, first-out (FIFO) data structures.
5)  Insertions and removals anywhere.
6)  10