Question Detail

Which data structure is needed to convert infix notations to postfix notations

linear list
tree
stack
queue

Answer: Option C

Similar Questions :

1. Merge sort uses

Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach

Answer: Option A

2. Recursive problems are implemented by

queues
stacks
linked lists
strings

Answer: Option B

3. In C how many parameters can passed to a function

2
5
10
as many as defined in function definition

Answer: Option D

4. Which of the following data structure is linear data structure

Trees
Graphs
Array
None of above

Answer: Option C

5. The complexity of Bubble sort algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1