Question

In a stack, if a user tries to remove an element from empty stack it is called

_______.

a) Underflow b) Empty collection

c) Overflow d) Garbage Collection


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

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

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

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

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


3) Which of the following application makes use of a circular linked list?

a) Undo operation in a text editor b) Recursive function calls

c) Allocating CPU to resources d) All of the mentioned


4) In a binary search tree, which of the following traversals would print the

numbers in the ascending order?

a) Level-order traversal b) Pre-order traversal

c) Post-order traversal d) In-order traversal


5) The quick sort algorithm exploit _______ design technique.

a) Greedy b) Dynamic programming

c) Divide and Conquer d) Backtracking


6) The type of expression in which operator succeeds its operands is?

a) Infix Expression b) Prefix Expression

c) Postfix Expression d) None of the mentioned


7) Tree is not a linear data structure.

a) True b) False


8) A normal queue, if implemented using an array of size MAX_SIZE, gets full

when _______.

a) Rear = MAX_SIZE – 1

b) Front = (rear + 1)mod MAX_SIZE

c) Front = rear + 1

d) Rear = front


9) The number of edges from the root to the node is called ______ of the tree.

a) Height b) Depth

c) Length d) None of the mentioned


10) The number of interchanges required to sort 5, 1, 6, 2, 4 in ascending order

using Bubble Sort is ______.

a) 6 b) 7

c) 5 d) 8​

Answer 1

Answer:

don't know...........