Data Structure MCQ - Stack

1. Create
2. Evaluation
3. Pop
4. Push

1. Pop
2. Create
3. Push
4. Evaluated

1. Underflow
2. User flow
3. Overflow
4. Crash

1. A collection of stacks is sortable
2. The entries are stored in a linked list
3. There is a Sequential entry that is one by one
4. Stack entries may be compared with the ‘<‘ operation

1. 1
2. 3
3. 2
4. 4 or more

1. AB+ CD*E – FG /**
2. AB+ CD*E – FG /**
3. AB + CDE * – * F *G /
4. AB + CD* E – F **G

1. Stack
2. Queue
3. Tree
4. Array

void fun(int n)
{
    Stack S;  // Say it creates an empty stack S
    while (n > 0)
    {
      // This line pushes the value of n%2 to stack S
      push(&S, n%2);
 
      n = n/2;
    }
 
    // Run while Stack S is not empty
    while (!isEmpty(&S))
      printf("%d ", pop(&S)); // pop an element from S and print it
}

1. Prints binary representation of n in reverse order
2. Prints binary representation of n
3. Prints the value of Logn
4. Prints the value of Logn in reverse order

1. Managing function calls
2. The stock span problem
3. Arithmetic expression evaluation
4. All of the above

1. Underflow
2. Empty collection
3. Overflow
4. Garbage Collection