ALLInterview.com :: Home Page KalAajKal.com
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
tip       Ask Questions on ANYTHING, that arise in your Daily Life at     FORUM9.COM
Google
 
Categories  >>  Software  >>  Operating Systems  >>  Data Structures
 
 


 

 
 Windows interview questions  Windows Interview Questions
 Linux interview questions  Linux Interview Questions
 Unix interview questions  Unix Interview Questions
 Solaris interview questions  Solaris Interview Questions
 RTOS interview questions  RTOS Interview Questions
 Bulnex interview questions  Bulnex Interview Questions
 Operating Systems General Concepts interview questions  Operating Systems General Concepts Interview Questions
 Data Structures interview questions  Data Structures Interview Questions
 Operating Systems AllOther interview questions  Operating Systems AllOther Interview Questions
Question 
Which data structure is needed to convert infix notations to
post fix notations?
 Question Submitted By :: Guest
I also faced this Question!!     Rank Answer Posted By  
 
  Re: Which data structure is needed to convert infix notations to post fix notations?
Answer
# 1		 
stack
 
Is This Answer Correct ?    6 Yes 3 No
Suhaani
 
  Re: Which data structure is needed to convert infix notations to post fix notations?
Answer
# 2		 
Stack
 
Is This Answer Correct ?    5 Yes 2 No
Pavan
 
 
 
  Re: Which data structure is needed to convert infix notations to post fix notations?
Answer
# 3		 
STACK
 
Is This Answer Correct ?    3 Yes 2 No
Selate
 
  Re: Which data structure is needed to convert infix notations to post fix notations?
Answer
# 4		 
stack.....
 
Is This Answer Correct ?    2 Yes 2 No
Swapna
 
  Re: Which data structure is needed to convert infix notations to post fix notations?
Answer
# 5		 
(A + B) * (C + D) / ((E - F) / (G + H)) =
 
Is This Answer Correct ?    5 Yes 3 No
Khater
 
  Re: Which data structure is needed to convert infix notations to post fix notations?
Answer
# 6		 
stack...since the operator last placed must be retrieved 
first.
 
Is This Answer Correct ?    4 Yes 1 No
Naresh
 
  Re: Which data structure is needed to convert infix notations to post fix notations?
Answer
# 7		 
i need c++  Reverse Polish Notation (RPN) calculator that
evaluates postfix expressions. The calculator will 
emphasize on the usage of a stack-like data
structure and stream I/O.
An Overview of RPN (postfix) evaluation
Consider the mathematical expression
(6 + 4) * 3 - 5
 
Is This Answer Correct ?    3 Yes 2 No
Hodan
 
  Re: Which data structure is needed to convert infix notations to post fix notations?
Answer
# 8		 
stack since conversion frm regular to postfix and similarly
frm regular to infix is based on stack concept so its a
stack aplication
 
Is This Answer Correct ?    2 Yes 0 No
Aditya
 

 
 
 
Other Data Structures Interview Questions
 
  Question Asked @ Answers
 
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?  4
How is it possible to insert different type of elements in stack?  5
Parenthesis are never needed in prefix or postfix expressions. Why?  6
What do you mean by: Syntax Error, Logical Error, Runtime Error?  2
What are the parts of root node? BMC2
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?  2
Evaluate the following prefix expression " ++ 26 + - 1324" Patni8
In which data structure, elements can be added or removed at either end, but not in the middle? Wipro19
Which data structure is needed to convert infix notations to post fix notations? Fidelity8
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?  2
How will inorder, preorder and postorder traversals print the elements of a tree?  6
The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? Morgan-Stanley7
Write programs for Bubble Sort, Quick sort  2
Which sort show the best average behavior?  6
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?  8
Write a Binary Search program  2
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? iGate9
What is the average number of comparisons in a sequential search?  2
Explain binary searching, Fibinocci search. IBM1
Write the programs for Linked List (Insertion and Deletion) operations  1
 
For more Data Structures Interview Questions Click Here 
 
 
 
 
 
   
Copyright Policy  |  Terms of Service  |  Help  |  Site Map 1  |  Articles  |  Site Map  |   Site Map  |  Contact Us |   interview questions urls   External Links 
   
Copyright © 2007  ALLInterview.com.  All Rights Reserved.

ALLInterview.com   ::  Forum9.com   ::  KalAajKal.com