download Mastguru Android App

Question Detail

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

  • linear list
  • tree
  • stack
  • queue
Similar Questions :

1. Preorder is

  • depth first order
  • breadth first order
  • topological order
  • linear order

2. Repeated execution of simple computation may cause compounding of

  • round off errors
  • syntax errors
  • run time errors
  • logic errors

3. Which is problem oriented language

  • BASIC
  • PL/I
  • FORTRAN
  • none of above

4. Merge sort uses

  • Divide and conquer strategy
  • Backtracking approach
  • Heuristic search
  • Greedy approach

5. O log(n) can be conneted with

  • Selection sort
  • Insertion sort
  • Binary sort
  • Merge sort
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment