What data structure can be used to check if a syntax has balanced pare – McqOptions

MCQOPTIONS

1.	What data structure can be used to check if a syntax has balanced parenthesis ?
A.	queue
B.	tree
C.	list
D.	stack
Answer» E.

Discussion

No Comment Found

Related MCQs

What does ‘stack underflow’ refer to?
If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before stack overflow?
Expression1 * 2 ^ 3 * 4 ^ 5 * 6is evaluated as -
Which of the following permutations can be obtained in the output(in the same order),using a stack assuming that the input is the sequence 1,2,3,4,5 in that order?
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 ?
The postfix equivalent of the prefix * + a b - c d is
After performing these set of operations, what does the final list look contain?InsertFront(10);InsertFront(20);InsertRear(30);DeleteFront();InsertRear(40);InsertRear(10);DeleteRear();InsertRear(15);display();
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?
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
What will be the postfix form of the above expression -(A+B)∗(C∗D-E)∗F/G