Technical Quiz DSA

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

Which of the following applications may use a stack?

• a) A parentheses balancing program

• b) Tracking of local variables at run time

• c) Compiler Syntax Analyzer

• d) Data Transfer between two asynchronous process

Which of the following applications may use a stack?

• a) A parentheses balancing program

• b) Tracking of local variables at run time

• c) Compiler Syntax Analyzer

• d) Data Transfer between two asynchronous process

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

• 1

• 14

• 74

• -18

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

Match the following.

a) Completeness i) How long does it take to find a solution

b) Time Complexity ii) How much memory need to perform the search.

c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.

• a-iii, b-ii, c-i

• a-i, b-ii, c-iii

• a-iii, b-i, c-ii

• a-i, b-iii, c-ii

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

• A. constant

• B. polynomial

• C. exponential

• D. none of the mentioned

What is the output of the following code snippet for a binary tree traversal?

void inorder(struct node* root)

{

if(root == NULL)

return;

inorder(root->left);

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

inorder(root->right);

}

• d) Prints nodes in level-order

• a) Prints nodes in pre-order

• c) Prints nodes in in-order

• b) Prints nodes in post-order

What is the time complexity of searching for an element in a balanced binary search tree?

• A. O(n)

• D. O(1)

• B. O(log n)

• C. O(n log n)

What is the output of the following code snippet for a post-order traversal of a binary tree?

void postorder(struct node* root)

{

if(root == NULL)

return;

postorder(root->left);

postorder(root->right);

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

}

• a) Prints nodes in pre-order

• b) Prints nodes in in-order

• d) Prints nodes in level-order

• c) Prints nodes in post-order