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. minimum number of stacks of size n required to implement a queue of size n

One
Two
Three
Four

Answer: Option B

3. Which of the languages is often translated to the pseudo code

PASCAL
FORTRAN
PL/I
BASIC

Answer: Option A

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

Trees
Graphs
Array
None of above

Answer: Option C

5. Sort which compares adjacent elements in a list and switches where necessary is

Insertion sort
Heap sort
Quick sort
Bubble sort

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1