Index addressing is efficient for iterative operations.

Which operation adds an element to stack?

Stack follows which principle?

Time complexity of Push operation is:

In postfix expression, operator comes:

Postfix form of (A + B) is:

Postfix of (A + B) * C is:

Evaluate postfix: 3 4 + 2 *

In infix expression, operator is:

Which operation removes element from queue?

Queue follows which principle?

In linear queue, insertion happens at:

In linear queue, deletion happens at:

A singly linked list node contains:

Insertion at beginning of singly linked list takes:

Deleting last node in singly linked list takes:

Double linked list node contains:

Linked list elements are stored:

Big O notation describes:

If f(n) = n + 20, Big O is: