SUDHAN'S WEBSITE - Allumnus

Allumnus Questions

Selection Process
=================
1st >> Pure Technical Knowledge Test
(Lebel of difficulty : Standard/Normal)

2nd >> Pure Technical Interview
(Lebel of difficulty : Very Tough)

3rd >> HR
(Lebel of difficulty : OK)

===================================
ALUMNUS SOFTWARE(www.alumnux.com)
===================================

1) find the locus of the point
whose sum of distance from 2
fixed points is constant.

2) [-infinity to +infinity]integration(exp(-x*x))

3) the product of any 3 consequtive nos is
always divisible by _ ? options[12/6/10/24]

4) int i=0,j=50
while(i<j)
{
if(<some condtn>)
{
  <body of the loop>
  i++
}
elseif(<some condtn>)
  <body of the loop>
  j--
}
else(<some condtn>)
  <body of the loop>
  j--
}
}
How many times the body of the loop
is going to be executed?
options[unknown/25/50/depends on the given condtn]

5) How can you include a library code
written in C++ in a source code written in C?
(Options are there)
Ans. Some cross-linked platform(compiler)
is required for this.

6)
int a[20],i
for(i=0;i<20;i++)
{
a[i]=i;
}
for(i=0;i<20;i++)
{
a[i]=a[20-i]
}
What is the final content of the
program.

7)
Which data structure should be used
for searching an element in an array
in constant time in case of average case?
Ans. Hash table(not sure)

8)
One question on ISO OSI model.
easy one(not remembered)

9)
Another question abt. a protocol
Ans. Token/Ring

10)
If we want to connect two systems
to form a network which leyer(OSI) is
of most interest to us?
Ans. Physical layer.

11)
1-1/4+1/16-1/64+1/128--------- infinity
Ans. 0.8

12)
One question on C's structure & pointer.

Rest I can't remember.
If anybody can remember the rest of the
ques. plz append those and post it to
the group.