C-Dynamic Memory Allocation and Data Structure - Practice Questions

Question 1

Queue works on the principle of

Accepted Answer

Question 2

Consider the following C function :
int f(int n)
{
static int r=0;
if(n<=0)
return 1;
if (n>3)
{
r=n;
return (f(n-1)+2;
}
return f(n-1)+8;
}
What is the value of f(1)?

Accepted Answer

Question 3

Which of the following method is implemented in stack

Accepted Answer

Question 4

the postfx notation is also called

Accepted Answer

Question 5

In the circular array version  of the queue class (with a fixed-sized array), which operations require linear time for their worst-case behavior/

Accepted Answer

Question 6

Which is not true about queue/

Accepted Answer

Question 7

I have implemented the queue with a linked list, keeping trck of a front pointer nd a rear pointer. Which of these pointers will change during tan insertion into a NONEMPTY queue?

Accepted Answer

Question 8

What is the value of the postfix expression 6 3 2 4 + -*:

Accepted Answer

Question 9

give the infix implementation of post fix: a b + c *d e - -f g + $:

Accepted Answer

Question 10

The TOP of the stack is increased

Accepted Answer