| A. | 4*n |
| B. | 8*n |
| C. | 4*n-1 |
| D. | 8*n-1 |
|
Option: A Explanation : Click on Discuss to view users comments. |
The initial configuration of a queue is a, b, c, d, ('a' is in the front end). To get the configuration d, c, b, a, one needs a minimum of
| A. | 2 deletions and 3 additions |
| B. | 3 deletion and 2 additions |
| C. | 3 deletions and 3 additions |
| D. | 3 deletions and 4 additions |
|
Option: C Explanation : Click on Discuss to view users comments. Aamir said: (7:20pm on Thursday 10th November 2016)
queue is open from both the ends a,b,c are removed and inserted 3 times each, d remaining untouched
|
Queue can be used to implement
| A. | radix sort |
| B. | quick sort |
| C. | recursion |
| D. | depth first search |
|
Option: A Explanation : Click on Discuss to view users comments. |
Syllabus covered in this section is-
This Section covers Data Structures Questions Answers using C language .
Who can benefit -
Various Search Terms used for this section are
