Data Structure - II BCA B - 21.7.25

1. The elements in an array are stored in:

• • Random memory locations

• • Contiguous memory locations

• • Linked manner

• • None of the above

void solve() {

stack<int> s;

s.push(10);

s.push(20);

s.push(30);

for(int i = 1; i <= 3; i++)

{ cout << s.top() << “ “;

s.pop();

}

}

• 10,20,30

• 30

• 10

• 30,20,10

Which of the following is a linear data structure?

• Array

• AVL Tree

• Binary Tree

• Graphs

When a pop() operation is called on an empty queue, what is the condition called?

• Overflow

• Underflow

• Syntax Error

• Garbage Value

23. Which of the following is correct about stack and queue?

• • Stack is LIFO, Queue is FIFO

• • Both are FIFO

• • Both are LIFO

• • Both are random access structures

18. What is the postfix form of: (A + B * C) / D ?

• • A + B C * / D

• • A B C + * D /

• • A B * C + D /

• • A B C * + D /

18. In postfix expression evaluation, what happens when an operator is read?

• • Push onto stack

• • Discard it

• • Pop two operands from stack, apply operator, push result

• • Push operands only

Which operation removes the top element of a stack?

• Push

• Pop

• Insert

• Peek

Which of the following is not an application of stack?

• Recursion

• Undo operation

• CPU scheduling

• Expression evaluation

If stack is implemented using an array of size N, what is the maximum number of elements it can store?

• N-1

• N+1

• N

• Infinite