Home

The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

A. 3 additions and 2 deletions

B. 2 deletions and 3 additions

C. 3 deletions and 4 additions

D. 3 deletions and 3 additions

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

You can do it
  1. When determining the efficiency of algorithm, the space factor is measured by
  2. A variable P is called pointer if
  3. To represent hierarchical relationship between elements, Which data structure is suitable?
  4. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  5. When determining the efficiency of algorithm the time factor is measured by
  6. Which of the following data structure is not linear data structure?
  7. In linear search algorithm the Worst case occurs when
  8. ……………. Is a pile in which items are added at one end and removed from…
  9. The operation of processing each element in the list is known as
  10. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  11. Which of the following is not the required condition for binary search algorithm?
  12. The term push and pop is related to the
  13. Which of the following case does not exist in complexity theory
  14. The Average case occur in linear search algorithm
  15. Which of the following data structure is non linear type?
  16. The complexity of linear search algorithm is
  17. Which of the following data structure store the homogeneous data elements?
  18. The complexity of Bubble sort algorithm is
  19. Each array declaration need not give, implicitly or explicitly, the information about
  20. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  21. The memory address of fifth element of an array can be calculated by the formula
  22. Which of the following statement is false?
  23. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  24. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  25. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  26. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  27. Which of the following algorithm design technique is used in the quick sort algorithm?
  28. The difference between linear array and a record is
  29. Finding the location of the element with a given value is:
  30. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…