What is the time complexity of the push operation in a stack implemented using an array?

• O(1)

• O(n

• O(log n)

• O(n^2)

A stack is a data structure that follows the principle of:

• LIFO (Last In First Out)

• FIFO (First In First Out)

• Priority based

• Random access

Which of the following operations is performed at the front of the queue?

• Enqueue

• Dequeue

• Peek

• All of the above

Which of the following operations is not supported by a deque?

• Insertion at the front

• Insertion at the rear

• Deletion from the front

• Random access of elements

In a circular queue of size 5, if the front is at index 2 and the rear is at index 4, how many elements are there in the queue?

• 2

• 3

• 4

• 5

Consider a queue with elements A, B, C, D (A is at the front). After two dequeue operations and one
enqueue operation of E, what will be the queue?

• C, D, E

• E, C, D

• D,E

• E,D

The primary advantage of postfix expressions over infix expressions is:

• Easier to evaluate

• Less memory usage

• Easier to parse

• All of the above

Which of the following is the correct order of growth for the following functions: log n, n, n log n,
n^2?
a)
b)
c)
d) n, n log n, log n, n^2

• log n, n, n log n, n^2

• log n, n log n, n, n^2

• n, log n, n log n, n^2

Convert the infix expression (A + B) * (C - D) to postfix.

• AB+CD-*

• AB+CD-

• A+B*C-D

• AB+CD-*

The time complexity of evaluating a postfix expression with n variable is:

• O(n)

• O(n^2)

• O(log n)

• O(n!)