Consider Stack is implemented using the array.

   #define MAX 10

    struct STACK

     {

    int arr[MAX];

    int top = ___________;

    }

What will be the initial value with which top is initialized?

User perform following operations on stack of size 5 then -

push(1); pop(); push(2); push(3); pop(); push(4); pop(); pop(); push(5);

at the end of last operation, total number of elements present in the stack are –

User perform following operations on stack of size 5 then -

push(1); pop(); push(2); push(3); pop(); push(2); pop();

pop(); push(4); pop(); pop(); push(5);

Which of the following is correct statement for stack ?

The post fix form of the expression

 (A+B)*(C*D-E)*F/G is

In linked representation of stack the null pointer of the last node in the list signals ......

The five items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack.

The popped item is

Using Pop (S1,Item) ,Push(S1, Item),  Getlist(Item), Pop(S2,Item), and the variables S1,S2(stacks with Top1 and Top2) and Item and given the input file: A,B,C,D,E,F Which stack are possible?

Process of Removing element from the stack is called as __________.

What happens when you push a new node onto a stack?

The result of evaluating the post fix expression 10, 5, 4, +, *, 3, 9, 3, /,/ +  is?

In liked representation of stack ....... holds the elements of the stack.

How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?

Deletion operation is done using ......... in a queue.

If the elements “E”, “F”, “G” and “H” are placed in a queue and are deleted one at a time, in what order will they be removed?

In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

......... form of access is used to add and remove nodes from a queue.

New nodes are added to the ......... of the queue.

Deletion operation is done using ......... in a queue.

……………. Is a pile in which items are added at one end and removed from the other.

Which data structure allows deleting data elements at front and inserting at rear?

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

………… is not the operation that can be performed on queue.

Which of the following is not the type of queue?

In the array implementation of circular queue, which of the following operation take worst case linear time?

A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index.

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables,

respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

If the MAX_SIZE is the size of the array used in the implementation of circular queue.

How is rear manipulated while inserting an element in the queue?

If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index

start with 0, front point to the first element in the queue, and rear point to the last element in the queue.

Which of the following condition specify that circular queue is FULL?

If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0,

front point to the first element in the queue, and rear point to the last element in the queue.

Which of the following condition specify that circular queue is EMPTY?

Let the following circular queue can accommodate maximum six elements with the following data

front = 2 rear = 4 queue = _______; L, M, N, ___, ___

What will happen after ADD O operation takes place?

In a circular queue the value of r will be ..

A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The DELETION of next element takes place at the array index.

void main()

{

      char str1[] = "abcd";

      char str2[] = "abcd";

      if(str1==str2)

            printf("Equal");

      else

            printf("Unequal");

}

If the two strings are identical, then strcmp() function returns

Which of the following function is more appropriate for reading in a multi-word string?

What will be the output of the program ?

#include<stdio.h>

#include<string.h>

void main()

{

    char str1[20] = "Hello", str2[20] = " World";

    printf("%s", strcpy(str2, strcat(str1, str2)));

}

What will be the output of the program ?

#include<stdio.h>

void main()

{

    printf(5+"Good Morning");

}

What will be the output of the program ?

#include<stdio.h>

void main()

{

char str[] = "Exam\0Glau";

printf("%s", str);

}

Which of the following correctly accesses the seventh element stored in arr, an array with 100 elements?

What is the return value of the following statement if it is placed in C program? strcmp("ABC", "ABC");

String concatenation means -

"My salary was increased by 15%" Select the statement, which will EXACTLY reproduce the line of text above.

short testarray[4][3] = { {1}, {2,3}, {4,5,6}};

printf("%d", sizeof(testarray));

Assuming a short is two bytes long, what will be printed by the above code?