Other Data Structures Interview Questions

 
  Question Asked @ Answers
 
what is binary tree? BMC 11
Parenthesis are never needed in prefix or postfix
Microsoft 10
expressions. Why?
What is B+ tree? BMC 4
Explain about the types of linked lists   5
What does abstract data type means? TCS 14
Stack can be described as a pointer. Explain. Wipro 4
The element being searched for is not found in an
array of 100 elements. What is the average number
Morgan-
of comparisons needed in a sequential search to 9
Stanley
determine that the element is not there, if the
elements are completely unordered?
What data structure would you mostly likely see in a
non recursive implementation of a recursive CTS 3
algorithm?
What is the average number of comparisons needed
in a sequential search to determine the position of an
ABB 15
element in an array of 100 elements, if the elements
are ordered from largest to smallest?
Convert following infix expression to the prefix
Microsoft 25
expression. a - b + c * (d / e - (f + g))
Tell me real world example of polymorphism and
CybAge 2
encapsulation .
ple.. briefly describe the purpose of having a base
  1
case and a recursive case in a recursive algorithm
What are the parts of root node? BMC 7
what is a complexity of linear search,binery search?   1
A list is ordered from smaller to largest when a sort
is called. Which sort would take the longest time to   10
execute?
Which data structure is needed to convert infix
Fidelity 19
notations to post fix notations?
what is mean by d-queue?   6
How will inorder, preorder and postorder traversals
  11
print the elements of a tree?
difference between the run time polymorphism and
compile time poly morphism and about virtual CybAge 1
function.
Explain binary searching, Fibinocci search.
  Re: Parenthesis are never needed in prefix or postfix expressions. Why?
Answer Parenthesis are used to define the sequence or
# 5 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.

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.