Data Structure Questions Answers - Chapter 1 Online Quiz Test

• 1. Preorder is

  1. depth first order
  2. breadth first order
  3. topological order
  4. linear order

• 2. Information about an array used in a program will be stored in

  1. symbol table
  2. activation record
  3. dope vector
  4. system table

• 3. ++i is equivalent to

  1. i = i + 2
  2. i = i + 1
  3. i = i + i
  4. i = i - 1

• 4. Repeated execution of simple computation may cause compounding of

  1. round off errors
  2. syntax errors
  3. run time errors
  4. logic errors

• 5. Deletion from one end and insertion from other end is

  1. stack
  2. branch
  3. tree
  4. queue

• 6. Which statement we should ignore in structure programming

  1. WHILE-DO
  2. GO-TO
  3. IT-ELSE
  4. SWITCH

• 7. In C how many parameters can passed to a function

  1. 2
  2. 5
  3. 10
  4. as many as defined in function definition

• 8. minimum number of stacks of size n required to implement a queue of size n

  1. One
  2. Two
  3. Three
  4. Four

• 9. Which is problem oriented language

  1. BASIC
  2. PL/I
  3. FORTRAN
  4. none of above

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

  1. Insertion sort
  2. Heap sort
  3. Quick sort
  4. Bubble sort

• 11. Recursive problems are implemented by

  1. queues
  2. stacks
  3. linked lists
  4. strings

• 12. Recursive problems are implemented by

  1. queues
  2. stacks
  3. linked lists
  4. strings

• 13. A linear list from which elements can be added or removed from either end is called

  1. stack
  2. queue
  3. deque
  4. tree

• 14. Which is ALGOL based simulation language

  1. FORTRAN
  2. SIMSCRIPT
  3. GASP IV
  4. none of above

• 15. How many divisions are there in COBOL language

  1. Two
  2. Three
  3. Four
  4. Five

• 16. O log(n) can be conneted with

  1. Selection sort
  2. Insertion sort
  3. Binary sort
  4. Merge sort

• 17. Which of the languages is often translated to the pseudo code

  1. PASCAL
  2. FORTRAN
  3. PL/I
  4. BASIC

• 18. Merge sort uses

  1. Divide and conquer strategy
  2. Backtracking approach
  3. Heuristic search
  4. Greedy approach

• 19. Which is having highest precedence in C

  1. relational operators
  2. equality operator
  3. logical operator
  4. arithmetic operator

• 20. Which sorting method is slowest

  1. Quick sort
  2. Heap sort
  3. Shell sort
  4. Bubble sort