Home
You can do it
  1. When determining the efficiency of algorithm the time factor is measured by
  2. The elements of an array are stored successively in memory cells because
  3. The operation of processing each element in the list is known as
  4. When determining the efficiency of algorithm, the space factor is measured by
  5. To represent hierarchical relationship between elements, Which data structure is suitable?
  6. The complexity of Binary search algorithm is
  7. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  8. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  9. The complexity of Bubble sort algorithm is
  10. Which of the following is non-liner data structure?
  11. Two main measures for the efficiency of an algorithm are
  12. Linked lists are best suited
  13. Which of the following data structure is linear type?
  14. The number of possible ordered trees with three nodes A,B,C is?
  15. Which of the following data structure is not linear data structure?
  16. When new data are to be inserted into a data structure, but there is no available space; this situation…
  17. Which of the following is two way list?
  18. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  19. Which one of the following permutations can be obtained the output using stack assuming that the input…
  20. Herder node is used as sentinel in ____
  21. The memory address of the first element of an array is called
  22. Which of the following data structure is non linear type?
  23. Which of the following data structures are indexed structures?
  24. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  25. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  26. Which of the following is not a limitation of binary search algorithm?
  27. Which of the following is not the part of ADT description?
  28. In linear search algorithm the Worst case occurs when
  29. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  30. Which of the following data structure is linear data structure?