info@avatto.com
+91-9920808017
6. Number of "ADD" and "REMOVE" operations required to access n/2th elements of a queue of "n" elements so that the original queue remain the same after the access is (take help of another queue.)
4*n
8*n
4*n-1
8*n-1
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
7. 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
2 deletions and 3 additions
3 deletion and 2 additions
3 deletions and 3 additions
3 deletions and 4 additions
8. A queue can be used to implement
radix sort
quick sort
recursion
depth-first search
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
