Convert the following infix expressions into its equivalent postfix ex – McqOptions

MCQOPTIONS

1.	Convert the following infix expressions into its equivalent postfix expressions(A + B ⋀D)/(E – F)+G
A.	(A B D ⋀ + E F – / G +)
B.	(A B D +⋀ E F – / G +)
C.	(A B D ⋀ + E F/- G +)
D.	None of the mentioned
Answer» B. (A B D +⋀ E F – / G +)

Discussion

No Comment Found

Related MCQs

What does ‘stack overflow' refer to?
What happens when you pop from an empty stack while implementing using the Stack ADT in Java?
Entries in a stack are “ordered”. What is the meaning of this statement?
What is the space complexity of a linear queue having n elements?
A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What's the time complexity of performing addFront and addRear? (Assume ‘m' to be the size of the stack and ‘n' to be the number of elements)
A linear collection of data elements where the linear node is given by means of pointer is called?
What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?
What is the time complexity to insert a node based on position in a priority queue?