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   interview questions urls   External Links  Contact Us     Login  |  Sign Up                      
Do you have a collection of Interview Questions and interested to share with us!!
Please send that collection to along with your userid / name. ThanQ
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
Parenthesis are never needed in prefix or postfix
expressions. Why?
 Question Submitted By :: Guest
I also faced this Question!!     Rank Answer Posted By  
 
  Re: Parenthesis are never needed in prefix or postfix expressions. Why?
Answer
# 1
Basically Parenthesis indicate the operations which 
need to be carried out first ie according to the
BODMAS rule..SO in case of postfix or prefix expression
they are actualy conversions of the orginal standard 
equation.Where the brackets have already been taken
into consideration,,,and the formed prefix/postfix 
expression is the correct order of expansion of a given 
mathematical statement..
 
Is This Answer Correct ?    3 Yes 0 No
Jayanth
 
  Re: Parenthesis are never needed in prefix or postfix expressions. Why?
Answer
# 2
in a prefix or postfix notation there is not anything 
related to preority of operators and only we have to moov 
from one side to nother so brackets are not required.
 
Is This Answer Correct ?    1 Yes 1 No
Nishant
 
 
 
  Re: Parenthesis are never needed in prefix or postfix expressions. Why?
Answer
# 3
Evaluation of postfix or prefix notations are done with the
help of stacks. So there is no need for brackets.

In other words, infix notation is human-readable format,
which need brackets based on BODMAS rule to understand the
order of execution. The postfix or prefix are
machine-readable format. The conversion and evaluation of
postfix and prefix are applications of stack model.
 
Is This Answer Correct ?    2 Yes 0 No
Arnoldindia
 
  Re: Parenthesis are never needed in prefix or postfix expressions. Why?
Answer
# 4
Parenthesis are used to define the sequence or priority of 
execution of operations in given infix expression. When we 
write an espression in prefix or postfix format we have 
already considered the order of execution and only evaluate 
the expression starting from left towars right in the 
sequence the operators and operands are encountered.
 
Is This Answer Correct ?    2 Yes 0 No
Poonam Khandar
 
  Re: Parenthesis are never needed in prefix or postfix expressions. Why?
Answer
# 5
Parenthesis are used to define the sequence or priority of 
execution of operations which is useful  in infix notation. 
Whereas we have already taken 
the consideration of order of execution of operands during 
the time of conversion to 
prefix  or postfix form.These orders are maintained with 
the help of Stack
i.e. Last in First out. So we donot need parenthesis in 
prefix and postfix notions.
 
Is This Answer Correct ?    2 Yes 0 No
Mithilesh Kumar
 
  Re: Parenthesis are never needed in prefix or postfix expressions. Why?
Answer
# 6
In case of infix expression, the entry point of the
execution can be either left or right (forget about operator
priority). 
Evaluate 2+3*5 from left, it is 30; from right, it is 17.
Convert it to postfix, 235*+, no confusion about the entry
point (and the answer which is 30). If we made it mandatory
for infix expression also that the entry point of evaluation
will be from left, there will not be any need for
parentheses. 2+3*5 will always be 30, to make it 17 write it
as 3*5+2 (in postfix).
Unfortunately, this rule for infix expression is not
mandated when first human mathematicians started thinking
(in early days of civilization). And alas, no common man
will accept this rule if I go to thrust it upon them. So we
have to live with parentheses in infix, and thankfully, none
in prefix or postfix. Machines are more logical being than
human. Agree?
 
Is This Answer Correct ?    0 Yes 2 No
Soumya Kanti
 

 
 
 
Other Data Structures Interview Questions
 
  Question Asked @ Answers
 
What is the average number of comparisons in a sequential search?  2
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
What does abstract data type means? TCS6
Explain about the types of linked lists  4
Explain binary searching, Fibinocci search. IBM1
What is binary tree? BMC5
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? ABB10
What is B+ tree? BMC2
Write programs for Bubble Sort, Quick sort  2
sir plz. send me a bunch of questions related to this topic which may help me in campus selection ABC1
Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements. Syntel9
Write a Binary Search program  2
Write the programs for Linked List (Insertion and Deletion) operations  1
Evaluate the following prefix expression " ++ 26 + - 1324" Patni8
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?  8
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 are the parts of root node? BMC2
Parenthesis are never needed in prefix or postfix expressions. Why?  6
What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) Sasken8
What is a data structure? Keane-India-Ltd3
 
For more Data Structures Interview Questions Click Here 
 
 
 
 
 
   
Copyright Policy  |  Terms of Service  |  Help  |  Site Map 1  |  Articles  |  Site Map  |   Site Map  |  Contact Us
   
Copyright © 2007  ALLInterview.com.  All Rights Reserved.

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