When linear queue of size MAXQUEUE were implemented in C, underflow occurs at

Let the getnode function is called when a node is required for insertion in a linked list. The overflow occurs when

When linear queue of size MAXQUEUE were implemented in C, overflow occurs at

In a circular queue of size MAXQUEUE, overflow occurs at

Which among the following is not the correct difference between array and linked lists?

Which among the following algorithms requires the reverse of input string before processing through stacks?

Let the binary heap has depth equal to d. What is the minimum number of nodes in the heap?

What is the value of A(5, 3)?

The operation decrease-key(H,x,k) is an operation that decreases the key of node x by k (if k<key(x) ) in a binary heap. What is the maximum effort required for this operation?

Let multipop (S, k) is an operation that removes k items form the stack S. In which of the following algorithms, does the multipop() function can be applied?

What is the value of A(15, 2)?

Gcd (18,60) = ?

Gcd (20, 28) = ?

A descending priority queue is implemented by using linked list. Which of the following operations is the cheapest?

An ascending priority queue is implemented by using linked list. Which of the following operations is the cheapest?

What is the total number of possible binary search tree with keys 20, 25 and 5?

Let there be a stack of integer values. How many elements does the stack contain after following operations? PUSH(S,1), PUSH(S,2), … , PUSH(S,10) Multipop(S,5) PUSH(S,11), PUSH(S,12), … , PUSH(S, 30) Multipop(S,10)

Let m and n be the integers and A(m,n) be a recursively defined function A(m,n)= 5
if m<n = A(m-n, n+2) if m ≥ n What is the value of A (2, 7)?

Let the binary heap has depth equal to d. What is the minimum number of nodes in the heap?

Let Gcd (m,n) be a recursively defined function as given below Gcd (n,m) m<n Gcd (m,n) = m n=0 Gcd(n,m%n) otherwise Gcd (6,15) = ?

In a circular queue of size MAXQUEUE, overflow occurs at

Given a linear queu |||||||| |---|---|---|---|---|---|---| | | | Front | | Rear | | | | 1 | 2 | 3 | 4 | 5 | 6 | 7 | | | | A | B | C | | | After the following operations, what will be the positions of front and rear? Insert(Q,D) Remove(Q) Insert(Q,E)

Given a linear queu |||||||| |---|---|---|---|---|---|---| | | | Front | | Rear | | | | 1 | 2 | 3 | 4 | 5 | 6 | 7 | | | | A | B | C | | | After the following operations, what will be the positions of front and rear? Insert(Q,D) Insert(Q,E) Remove() Insert(Q,F)

Given a circular queu |||||||| |---|---|---|---|---|---|---| | | | Rear | | | | Front | | 1 | 2 | 3 | 4 | 5 | 6 | 7 | | A | B | C | | | | | After the following operations, what will be the positions of front and rear? Insert(Q,X), Insert(Q,Y), Remove(Q), Insert(Q,Z) Insert(Q,D), Insert(Q,E)

Given a circular queu |||||||| |---|---|---|---|---|---|---| | | | Rear | | | | Front | | 1 | 2 | 3 | 4 | 5 | 6 | 7 | | A | B | C | | | | | After the following operations, what will be the positions of front and rear? Insert(Q,X), Insert(Q,Y), Remove(Q), Insert(Q,Z)