adplus-dvertising
frame-decoration

Question

Well formed parenthesis can be checked using following data structure ?

a.

Queue

b.

Stack

c.

Hash Map

d.

List

Answer: (b).Stack

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Well formed parenthesis can be checked using following data structure ?

Similar Questions

Discover Related MCQs

Q. Post fix form of
A + (B * C)
is -

Q. Post fix form of -
(A + B) * C

Q. Consider following Scenario -

1. The five items : P,Q,R,S and T are inserted into stack A one after other starting from T in reverse order.

2. The stack is popped three times and each element is inserted into another stack B.

3. Then two elements are deleted from the stack B and pushed back onto the stack A.

What are the topmost elements of stack A and Stack B respectively?

Q. If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before stack overflow?

Q. Stack A has 3 Elements in it Say X,Y and Z with X on top.

1. Stack B is empty.
2. An Element popped out from Stack A can be printed immediately or pushed to stack B.
3. An Element popped out from Stack B can only be printed.

In this arrangement, which of the following permutations of X,Y,Z are not possible ?

Q. An item that is read as input can be either pushed to a stack and later popped and printed, or printed directly. Which of the following will be the output if the input is the sequence of items 1, 2, 3, 4, 5 ?

Q. Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed?

Q. A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DELETEMIN(Q)(Q). For a sequence of operations, the keys chosen are in

Q. Queues serve major role in

Q. Which of the following data structure may give overflow error,even though the current number of element in it is less than its size?

Q. Number of "ADD" and "REMOVE" operations required to access n/2th elements of a queue of "n" elements so that the original queue remain the same after the access is (take help of another queue.)

Q. The initial configuration of a queue is a, b, c, d, ('a' is in the front end). To get the configuration d, c, b, a, one needs a minimum of

Q. Queue can be used to implement

Q. The postfix form of the expression (A+B)∗(C∗D-E)∗F/G is

Q. What is the postfix form of the following prefix expression -A/B*C$DE

Q. Which of the following types of expressions does not require precedence rule when evaluated?

Q. If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before encounterring stack overflow?

Q. Using Pop(S1, Item) Push(S1,Item) Read(Item) Print(Item) the variables S1 represents (stack) and Item are given the input file: A,B,C,D,E,F Which stacks are possible:

Q. Using Pop (S1,Item) ,Push(S1, Item), Getlist(Item), Pop(S2,Item), and the variables S1,S2(stacks with Top1 and Top2) and Item and given the input file: A,B,C,D,E,F Which stack are possible?

Q. Following sequence of operations is performed on a stack push(1),push(2),pop, push(1),push(2)pop,pop,pop,push(2),pop.The sequence of poped out values are