DSA Basic Quiz

1. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

  
  

1. How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

• 1

• 2

• 3

• 4

1. The following postfix expression with single digit operands is evaluated using a stack:  8 2 3 ^ / 2 3 + 5 1 -

Note that ^ is the exponentiation operator. The result is:

• 3

• 4

• 12

• 2

1. If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values

• 2,2,1,1,2

  
  

• 2,2,1,2,2

• 2,1,2,2,1

• 2,1,2,2,2

1. What will be the postfix form of the above expression -

(A+B)∗(C∗D-E)∗F/G

• A B + C  ∗ D  E − F G ∗ / ∗

  
  

• A B + C D ∗ E − F G ∗ / ∗

• A B + C D E ∗ − F G / ∗ ∗

• A B + C D ∗ E - ∗ F ∗ G /

1. What is the value in the head -> next -> next below?

• 12

  
  

• 4600

• 1600

• 88

1. What is the operation of the below statements?

2. newNode--->link = head;

3. head = newNode;

• Create a new node for a linked list

  
  

• Insert a new node to the front of a linked list

• Delete a new node from a linked list

• Insert a new node to the end of the linked list

1. _________________ is a collection of elements used to store the same type of data.

• Array

  
  

• Switch

• Case

• Loop

1. int nums[ ] = {2, 3, 5, 8, 9, 11};

How would you access the fourth element in nums

• nums[8]
  

• nums[3]

• nums[4]

• nums(3)

1. What kind of Data structure would you expect to find utilised to store operations in a CPU?

• Queue

  
  

• List

• Stack

• Tree