download Mastguru Android App

Question Detail

Which of the languages is often translated to the pseudo code

  • PASCAL
  • FORTRAN
  • PL/I
  • BASIC
Similar Questions :

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

  • stack
  • queue
  • deque
  • tree

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

  • Insertion sort
  • Heap sort
  • Quick sort
  • Bubble sort

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

  • linear list
  • tree
  • stack
  • queue

4. Preorder is

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

5. The complexity of merge sort algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment