Question { Patni, 47372 }

Evaluate the following prefix expression " ++ 26 + - 1324"

Answer

:D I think the question is wrong.
It didnt define the token.

Question { TCS, 22095 }

Explain binary searching, Fibinocci search.

Answer

Hey guys its fibonacci search not fibonacci sequence.
Its is efficient when locality of reference is plays a
greater role.
Go here:
http://en.wikipedia.org/wiki/Fibonacci_search_technique

Question { TCS, 71200 }

How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?

Answer

Binary search trees care only about the inorder traversal of
the tree. And specifying inorder traversal of a tree doesnt
mean there is a unique representation of it.
5 Binary search trees are possible

Question { 27671 }

A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?

Answer

Quick sort's worst case is the one given in the question.
It exhibits selection sort type of procedure when the list
is sorted

Hence both :)

Question { KPIT, 17112 }

1) Program A and B are analyzed and found to have worst-
case running times no greater than 150nlog2n and n2
respectively.Answer the folloWing questions if possible..
i) which program has the better guarantee on the running
time,for larger values of n(n>10000) ?
ii) which program has the better guarantee on the running
time,for small values of n(n<100) ?
iii) which program will run faster on average for n =1000

2) wRite a program to compute the number of collisions
required in a long random sequence of
insertions using linear probing ,quadratic probing and
double hashing



3) what is the optimal way to compute A1 A2 A3 A4 A5 A6
where the dimensions of the matrices are
A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30
A6 : 30 X 15

Answer

Its clear
150nlog(base-2)n will have advantage on larger inputs
n^2 has advantage on large inputs
But without the exact function we cant estimate the exact
point at which the two graphs exchanges their advantages.

given n>2 log(base-2)n is greater than 1 where as n^2 > 150
only when n>10 so approx it crosses at may be at n=12(Taking
them as exact time complexity not as asymptotic notations)

at 1000 clearly n^2 is better as it is only 10^6 whereas
150nlogn is approx 150*10*10(approx)

Question { 16443 }

can we print any string in c language without using
semicolon(;)(terminator) in whole program.

Answer

#include
int main()
{
while(printf("Hai")&&0){}
}

Is This Answer Correct ?

42 Yes

15 No

Question { 4830 }

Q # 1 : in which graph algorithm do we start finding
vertices that should be first in the topological order and
then apploy the fact that every vertex must come before its
successors in the topolgical order.

Answer

To my understanding of the question it sounds like
topological sort