A data structure that follows the First-In-First-Out (FIFO) principle.

What is the time complexity of finding the factorial of a number using recursion?

Which of the following data structures can be used to check for balanced parentheses?

Which of the following concepts make extensive use of arrays?

For the given array arr = {2, 6, 1}, what is the pivot that is returned as a result of partitioning?

Which of the following properties does a simple graph not hold?

Which of the following statements about the stack data structure is NOT correct?

Which of the following statements about the infix to postfix conversion algorithm is incorrect?

Consider the following C function.

int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0; for (j = n; j > 1; j = j/2) ++p; for (k = 1; k < p; k = k*2) ++q; } return q; }

Which one of the following most closely approximates the return value of the function fun1?