Navigate

Question Detail

Preorder is

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

Answer: Option A

Similar Questions :

1. The complexity of linear search algorithm is

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

Answer: Option A

2. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

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 is problem oriented language

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

Answer: Option D

5. Repeated execution of simple computation may cause compounding of

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

Answer: Option A

Read more from - Data Structure Questions Answers - Chapter 1