Home

Linked lists are best suited

A. for relatively permanent collections of data

B. for the size of the structure and the data in the structure are constantly changing

C. for both of above situation

D. for none of above situation

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  2. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  3. Binary search algorithm can not be applied to
  4. The elements of an array are stored successively in memory cells because
  5. In linear search algorithm the Worst case occurs when
  6. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  7. Two dimensional arrays are also called
  8. A variable P is called pointer if
  9. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  10. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  11. The complexity of Binary search algorithm is
  12. Which of the following data structures are indexed structures?
  13. When new data are to be inserted into a data structure, but there is no available space; this situation…
  14. Which of the following is not the part of ADT description?
  15. Which data structure is used in breadth first search of a graph to hold nodes?
  16. Which if the following is/are the levels of implementation of data structure
  17. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  18. Arrays are best data structures
  19. ……………. Is a pile in which items are added at one end and removed from…
  20. _____ is not the component of data structure.
  21. Which of the following data structure can't store the non-homogeneous data elements?
  22. Each array declaration need not give, implicitly or explicitly, the information about
  23. The operation of processing each element in the list is known as
  24. For an algorithm the complexity of the average case is
  25. If the values of a variable in one module is indirectly changed by another module, this situation is…
  26. Which of the following name does not relate to stacks?
  27. Which one of the following permutations can be obtained the output using stack assuming that the input…
  28. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  29. Which of the following is not the required condition for binary search algorithm?
  30. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…