Datastructures | Stack | The Inquisitive

Datastructures - Stack

page 1 out of 3

Question 1

Stack is shortly referred as

Question 2

What are the operations can be done in stack?

Question 3

Processs of inserting an element in stack is

Question 4

Process of deleting an element from stack is

Question 5

Pushing an element after completing all its size(memory) in stack, The termonology used is

overflow

underflow

Question 6

Which one of the following is an application of Stack Data Structure?

Managing function calls

The stock span problem

Arithmetic expression evaluation

All the above

Question 7

Which of the following is true about linked list implementation of stack?

In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

Both of the above

None of the above

Question 8

How many stacks are required to form Queue Data Structure.

Cannot Form

None of the above

Question 9

Which Data Structure is used to check wheather the string(parenthesis) is balanced or not.

Question 10

Removing an element from empty stack is called as

overflow

underflow

page 1 out of 3

Forgot Password

Password must be strong.Eg:@TheInquisitive123

Oops!!

To view the solution need to Login

Score : 0 / 0

THE INQUISITIVE

THE INQUISITIVE

Forgot Password