Home

Each array declaration need not give, implicitly or explicitly, the information about

A. the name of array

B. the data type of array

C. the index set of the array

D. the first data from the set to be stored

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

You can do it
  1. The complexity of linear search algorithm is
  2. The complexity of Binary search algorithm is
  3. Which one of the following permutations can be obtained the output using stack assuming that the input…
  4. Linked lists are best suited
  5. _____ is not the component of data structure.
  6. Which of the following data structure cant store the non-homogeneous data elements?
  7. Which data structure allows deleting data elements from and inserting at rear?
  8. The memory address of the first element of an array is called
  9. The memory address of fifth element of an array can be calculated by the formula
  10. Merge sort uses ?
  11. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  12. Binary search algorithm can not be applied to
  13. The operation of processing each element in the list is known as
  14. The complexity of Bubble sort algorithm is
  15. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  16. Which of the following data structure can't store the non-homogeneous data elements?
  17. Which if the following is/are the levels of implementation of data structure
  18. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  19. Which of the following case does not exist in complexity theory
  20. Two main measures for the efficiency of an algorithm are
  21. ……………. Is a pile in which items are added at one end and removed from…
  22. The situation when in a linked list START=NULL is
  23. Which of the following is two way list?
  24. Each array declaration need not give, implicitly or explicitly, the information about
  25. The term push and pop is related to the
  26. Which of the following is not the required condition for binary search algorithm?
  27. Which of the following statement is true ?
  28. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  29. _______ level is where the model becomes compatible executable code
  30. Which of the following data structure is linear data structure?