How many stacks are required to evaluate an infix expression?

What is the time complexity to find an element in a linked list?

The maximum number of binary trees that can be formed with three unlabeled nodes is:

A graph with all vertices having equal degree is known as a __________ graph.

Which of the following examples represents the worst-case input for an insertion sort algorithm?

There is a bucket that doubles its volume every second until it is full. The time required for the bucket to become full is 40 seconds. Find the time when the bucket is half full.

Given two vertices in a graph, a and b, which of the two traversal methods (Breadth-First Search (BFS) and Depth-First Search (DFS)) can be used to determine if there is a path from a to b?

What does the following function check for?

#define MAX 10

typedef struct stack

{

    int top;

    int item[MAX];

} stack;

int function(stack *s)

{

    if(s->top == -1)

      return 1;

    else return 0;

}

Why is the implementation of stack operations on queues not feasible for a large dataset (Assume the number of elements in the stack to be n)?

In a competition, four different for loops are observed. All the loops execute the same set of statements within the loop body. Consider the following for loops:

A) for(i = 0; i < n; i++)

B) for(i = 0; i < n; i += 2)

C) for(i = 1; i < n; i *= 2)

D) for(i = n; i > -1; i /= 2)