QUIZ-STACK_QUEUE_Jan'24

In which algorithm takes less time or space is called

• Best case

• Worst case

• Average case

• None of the above

A FIFO structure implemented as a ring where the front and rear pointers can wrap around the end of the start of the array.

• Linear Queue

• Circular Queue

• Priority Queue

What is the disadvantage of array data structure?

• Elements of an array can be accessed in constant time

• Elements are stored in contiguous memory location

• The amount of memory to be allocated should be known beforehand

• Multiple other data structures can be implemented using Array

How can we describe an array in the best possible way?

• The Array shows a hierarchical structure.

• Arrays are immutable (Not Modifiable)

• Container that stores the elements of similar types

• The Array is not a data structure

____________data structures are those whose sizes and structures associated memory locations are fixed at compile time.

• linear

• homogeneous

• static

• dynamic

People have used the word ________ to mean computer information that is transmitted or stored.

• Beta

• Data

• Database

• None of above

Consider the usual algorithm for determining whether a sequence of parentheses is balanced.

Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order).

The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?

• 1

• 2

• 3

• 4 or more

User perform following operations on stack of size 5 then -

push(1);

pop();

push(2);

push(3);

pop();

push(2);

pop();

pop();

push(4);

pop();

pop();

push(5);

• Overflow Occurs

• Stack Operations will be performed Smoothly

• Underflow Occurs

• None of these

To evaluate an expression without any embedded function calls:

• One stack is enough

• Two stacks are needed

• As many stacks as the height of the expression tree are needed

• A Turing machine is needed in the general case

What will be the postfix form of the above expression -

(A+B)∗(C∗D-E)∗F/G

• None of these

• A B + C D ∗ E − F G ∗ / ∗

• A B + C D E ∗ − F G / ∗ ∗

• A B + C D ∗ E − F G / ∗ ∗