Register

UGC NET CSE | June 2012 | Part 2 | Question: 1

• recategorized by
3,819 views
2 votes
2 votes

The postfix expression AB + CD -* can be evaluated using a

  1. stack
  2. tree
  3. queue
  4. linked list
• recategorized by
User Avatar

2 Answers

Best answer
4 votes
4 votes

This is a simple question. The postfix expression can be evaluated using a stack. First the operands are pushed into the stack and the moment a operator is encountered, operands are popped out, operation performed on the operands and the result once again pushed into the stack. This series of activities continue till the entire expression is not evaluated.

 

Hence,Option(A)Stack.

• selected by
User Avatar
0 votes
0 votes
It is straight forward Stack is used for postfix evaluation and also for infix to prefix infix to postfix
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Jul 5, 2016
22,763 views
UGC NET CSE | June 2012 | Part 2 | Question: 50
To represent hierarchical relationship between elements, which data structure is suitable? Dequeue Priority Tree All of the above
To represent hierarchical relationship between elements, which data structure is suitable?DequeuePriorityTreeAll of the above
User Avatar
2 votes
2 votes
2 answers
2
go_editor asked Jul 5, 2016
7,085 views
UGC NET CSE | June 2012 | Part 2 | Question: 49
Which of the following data structure is linear type? Strings Lists Queues All of the above
Which of the following data structure is linear type?StringsListsQueuesAll of the above
User Avatar
2 votes
2 votes
1 answer
3
go_editor asked Jul 5, 2016
4,279 views
UGC NET CSE | June 2012 | Part 2 | Question: 27
The Inorder traversal of the tree will yield a sorted listing of elements of tree in Binary tree Binary search tree Heaps None of the above
The Inorder traversal of the tree will yield a sorted listing of elements of tree inBinary treeBinary search treeHeapsNone of the above
User Avatar
3 votes
3 votes
1 answer
4
go_editor asked Jul 4, 2016
1,337 views
UGC NET CSE | June 2012 | Part 2 | Question: 8
A binary search tree is a binary tree in which All items in the left subtree are less than root All items in the right subtree are greater than or equal to root Each subtree is itself a binary search tree All of the above
A binary search tree is a binary tree in whichAll items in the left subtree are less than rootAll items in the right subtree are greater than or equal to rootEach subtree...
User Avatar
Link Copied!