What is the value of the postfix expression 6 3 2 4 + – *:

• 1

• 14

• 74

• -18

If the insertion and deletion happens from both the ends then the queue is called a______Queue

• a) Deque

• b) Header

• c) Queue

• d) Circular Queue

What does the following function do for a given Linked List with first node as head?

void fun1(struct node* head)

{

if(head == NULL)

return;

fun1(head->next);

printf("%d ", head->data);

}

• a) Prints all nodes of linked lists

• b) Prints all nodes of linked list in reverse order

• c) Prints alternate nodes of Linked List

• d) Prints alternate nodes in reverse order

If for an algorithm time complexity is given by O(n) then complexityof it is:

• A. constant

• B. linear

• C. exponential

• D. none of the mentioned

The number of elements in the adjacency matrix of a graph having 7 vertices is

• 7

• 14

• 49

• 34

What is the number of moves required to solve Tower of Hanoi problem for k disks?

• a) 2k – 1
  

• b) 2k + 1

• c) 2^k + 1

• d) 2^k – 1

In linked list implementation of a queue, where does a new element be inserted?

• a) At the head of link list

• b) At the tail of the link list

• c) At the centre position in the link list

• d) None

Consider the following definition in c programming language.

struct node { int data; struct node next; }

typedef struct node NODE;

NODE *ptr;

Which of the following c code is used to create new node?

• ptr = (NODE*)malloc(sizeof(NODE));

• ptr = (NODE*)malloc(NODE);

• ptr = (NODE*)malloc(sizeof(NODE*));

• ptr = (NODE)malloc(sizeof(NODE));

What is the way to increment the rear end of a circular queue?

• (Rear+1) mod MAX

• Rear mod MAX

• (Front+1) mod MAX

• (Rear-1) mod MAX

The algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order

• A. Insertion sort

• B. Quick sort

• C. Selection sort

• D. Bubble sort