Finding the location of the element with a given value is:

A. Traversal

B. Search

C. Sort

D. None of above

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

You can do it
  1. Which of the following algorithm design technique is used in the quick sort algorithm?
  2. Which of the following data structures are indexed structures?
  3. Which of the following is two way list?
  4. Which one of the following permutations can be obtained the output using stack assuming that the input…
  5. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  6. Linked lists are best suited
  7. Which of the following is not the required condition for binary search algorithm?
  8. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  9. Stack is also called as
  10. Two dimensional arrays are also called
  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. The Average case occur in linear search algorithm
  13. Which of the following statement is true ?
  14. Which of the following data structure is linear type?
  15. If the values of a variable in one module is indirectly changed by another module, this situation is…
  16. Which of the following data structure is non linear type?
  17. _______ level is where the model becomes compatible executable code
  18. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  19. Binary search algorithm can not be applied to
  20. The memory address of fifth element of an array can be calculated by the formula
  21. Which of the following is not a limitation of binary search algorithm?
  22. A variable P is called pointer if
  23. Which of the following data structure can't store the non-homogeneous data elements?
  24. The operation of processing each element in the list is known as
  25. _____ is not the component of data structure.
  26. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  27. For an algorithm the complexity of the average case is
  28. Which data structure allows deleting data elements from and inserting at rear?
  29. The elements of an array are stored successively in memory cells because
  30. When determining the efficiency of algorithm, the space factor is measured by