There were two papers one was aptitude ( 36 questions) and other was
technical(20 questions)

1: given an expression tree and asked us to write the in fix of that expression
four choices2:
global variables in different files are
a:at compiletime
b) loading time
c) linking time
d)execution time
3)size of(int)
a) always 2 bytes
b) depends on compiler that is being used
c) always 32 bits
d) can’t tell
4)which one will over flow given two programs
2
prog 1: prog2:
main() main()
{ {
int fact; int fact=0
long int x; for(i=1;i1) return(x*factorial(x-1);
}
a) program 1;
b) program 2;
c) both 1 &2
d) none
}
5) variables of fuction call are allocated in
a) registers and stack
b) registers and heap
c) stack and heap
d)
6)
avg and worst case time of sorted binary tree7) data structure used for proority queue
a) linked list b) double linkedd list c)array d) tree

main(){
char str[5]=”hello”;
if(str==NULL) printf(”string null”);
else printf(”string not null”);
}
what is out put of the program?
a) string is null b) string is not null c) error in program d) it executes but p
rint nothing

9)there are 0ne 5 pipe line and another 12 pipe line sates are there and flushed
time taken to execute five instructions
a) 10,17
b) 9,16
c)25,144
d)10)
for hashing which is best on terms of buckets
a)100 b)50 c)21 d)32 ans 32
11)void f(int value){
for (i=0;i>1) printf(”1″)
else printf(”0″);
}
}
what is printed?
a) bineray value of argument b)bcd value c) hex value d) octal value
12)void f(int *p){
static val=100;
val=&p;
}
main(){
int a=10;
printf(”%d “,a);
f(&a);
printf(”%d “,a);
}
what will be out put?
a)10,10
13)
struck a{
int x;
float y;
char c[10];
}
union b{
int x;
float y;
char c[10];
}
which is true?
a) size of(a)!=sizeof(b);
b)
c)
d)
14)# define f(a,b) a+b
#defiune g(c,d) c*d
find valueof f(4,g(5,6))
a)26 b)51 c) d)
15)
find avg access time of cache
a)tc*h+(1-h)*tm b)tcH+tmH
c) d) tc is time to access cache tm is time to access when miss occure
16)
main()
{
char a[10]=”hello”;
strcpy(a,”);
printf(”%s”,a);
}
out put of the program?
a) string is null b) string is not null c) program error d)
17)
simplyfy k map
1 x x 0
1 x 0 1
18)
int f(int a)
{
a=+b;
//some stuff}
main()
{
x=fn(a);
y=&fn;
what are x & y types
a) x is int y is pointer to afunction which takes integer value

19) char a[5][15];
int b[5][15];
address of a 0×1000 and b is 0×2000 find address of a[3][4] and b[3][4]
assume char is 8 bits and int is 32 bits
a) b) c) d)
there are 20 questions all in techinical paper and 36 questions in appititude te
st
in appititude thay have given all diagrams and asked to find what comes next
thay are quite easy and i hope if u practice r.s aggraval u can do it easily
for tecnical thay have given 1 hr for 20 questions and for not technical thay ha
ve given only 40 min
and 36 questions
this is the paper i have right now
1. main()
{
fork();
fork();
fork();
printf(”\n hello”);
}
How many times print command is executed?
2.main()
{
int i,*j;
i=5;
j=&i;
printf(”\ni= %d”,i);
f(j);
printf(”\n i= %d”,i);
}
void f(int*j)
{
int k=10;
j= &k;
}
output is
a 5 10
b 10 5
c 5 5
d none
3.
some question on pipeline like you have to findout the total time
by which execution is completed for a pipeline of 5 stages.
4.
main()
{
int *s = “”;
if(strcmp(s,NULL)== 0)
printf(”\n s is null”)p
else
printf(”\n s is not null”);
}
5.
some syntax which returns a pointer to function
6. size of integer is
a. 2 bytes
b 4 bytes
c. machine dependant
d compiler dependent.
7.max and avg. height of sorted binary tree
a. logn n
b n logn
8.
some question. like the number was shifted everytime by one and bitwise and with 10000000.
one was supposed to find what the code was doing.
I feel the answer was most probably finding decimal value.
9. int a[5][4]
int is 2 bytes base address for array is 4000(Hexa)
what will be addr for a[3][4]?
int is 4 bytes same question.
10.
implementation of priority queue
a. tree
b linked list
c doubly linked list.

HUGHES

No. of nodes of degree 2 in a binary tree with n leaf nodes.
Ans. n-1

9. To sorting array of 10 elements which sorting is best
a)slection
b)bubble
c)tree sort
d)….
ans:a

10 To saving space point of view which sort is best
a)selection
b)insertion
c)both a & b
d)…

11Which statement is wrong on heap
a)Any two childs should not same
b)..
c)..
d)…
ans:a

12) cyclometric complexity..

13) how many null pointer are there in N number binary tree
ans:N+1

14) Two sorted list of size n what are the maximum comparison in merge
ANs:2n-1

15) two sorted lists of n elements will take at least
fine the order of complexity?
a. 2n
b. n/2
c. square(n)

16)if there are n nodes in a binary tree, how many null pointers are
there
ans:n+1;

17). if heap sort contains n elements, no of comparsions required are
a. log(n)
b. height of heap sort
c.
d.

18) which of the following is efficient in terms of space
a. insertion sort
b. quick sort
c. selection
d. both a and c

19) in sorted table contains elements , which of the searching is
false
a. hash table
b. binary searching

20) in associated memory for fast accessing
which one is used
a. single linked list
b. double ”
c. hash table

21) for hashing which is best on terms of buckets
a)100 b)50 c)21 d)32 ans 32

22) max and avg. height of sorted binary tree
a. logn n
b n logn

23) implementation of priority queue
a. tree
b linked list
c doubly linked list

24) For a binary tree with n nodes, How many nodes are there which
has got both a parent and a child?

25) Bubble sort : Given sequence of numbers what will be order of sequences
after two iterations.
Ans: very trivial, but you should know what bubble sort
does.

26)Bubble sort : how many swap operations has been done in the above
process?

27)What data structures you should use for dictionary searching and it
should be capable of doing spell check also ?
Ans: Hashing

28)Which is the best scheduling algo. (given five of them)
Ans.: Shortest Job First with Pre-emption

29) Bubble sort is given ., No of times it executes
ans . n(n-1)/2

30) The appriximate ratio for no of internal nodes to total no

31) precedence order from high to low ( ( ) ++ / )

32) preorder of A*(B+C)/D-G (*+ABC/-DG)

33) B-tree (failure nodes at same level)
of nodes in k-ary tree of depth n.
ans. 1/k

34) merge sort time complexity ( O(n log n) )

35) while following sorting algorithem has average sorting behavior (heap
sort )

36)in binary search tree which traversal is used for getting ascending
order values (inorder )

37) fun(n)
{
if(nS+S; s->s*s; s->a
how many parse trees possible : a+a*a+a Ans. 5

51) order of Hashing time

52) A choclate of size nXn is given and is to be made into pices of size 1×1. At a time both horizontal and a vertical cut is done. Find the order of complexity
a) 0(n2)
b) o(nlogn)
c) o(logn)
Ans : a

53) comparison between hashtable and binary tree

9 16 bit mantissa and 8 bit exponent can present what maximum value?
104bit window size in sliding window protocol, how many acknowledements can be held?
CSMA/Cd protocol used in
Ans

11 Checksum in IP packet is
Sum of the bits and 9’s complement of sum

12) TCP/IP hdr checksum : what method is used ?
Ans. one’s complement of sum of one’s complement (CRC)

13) CSMA/Cd is used in which lan Ans. Ethernet

14) One question on synchronous transmission :
ans. Timing info is embedded in data itself
ATM : Asynchronous transfer mode
telephone : Synchronous transfer

15) 4bit seq no in sliding window protocol with selective repeat.
what is the max no. of acks that can be held at transmitter
ans. 8

16) CSMA/CD is used in
a) token ring
b) FDDI
d) ethernet
Ans : d

17) Max no of Acknowledgements for a 4 bit sequence number in a
sliding window protocol.

18) ARP
a) MAC to IP
b) IP to MAC
c)
Ans : b

19) NSF

20) If A sends a message to B with encryption then key is
a)A public key
b)B public key
c)A private key
d)B private key
ans:b

21) if even parity is used for parity generation, what is the
hamming distance

22) the code set is {00000,00111,11100,11011}
what is the error detecting and correcting capability?
ans:2,1

23) IEEE 802.5 is
ans: TOKEN RING

24) bit stuffing used in HDLC Protocol for

25) which is not suitable to find out IP address
ans:ARP

26) IP AND IPX

27) execution phase can be
a. pipelined
b. no parallelism is possible
c. vector processing
d.

28)In public key algorithm , A wants to send message to B …..
which key is used
a. A public key
b. A private key
c. B public key
d. B private key

29) to prevent replay attacks in transmission
a. symmetric encoding
b. Asymmetric encoding
c. for every exchange, key should be changed

30) flow control is used for
a. congestion at receiver
b.
c.
d.

31)If you type in the command
nohup sort employees > list 2 > error out &
and log off ,the next time you log in . the output
will be
a). in a file called list and the error will de typed in
a file error out
b). there will be no file called list or error out
c). error will be logged in a file called list and o/p
will be in error out
d). you will not be allowed to log in
e). none of the above

32) 202.141.65.62 type of IP address belong to which class. Ans:class B

33)What are the funs. of transport layer? What is TCP, UDP, their
differences …..

34) About ARP and RARP.

section A 30m (Compulsary)
section B or C 20 m(changed )m
Attempt either B or C sec B contains CST
C E&C
Better to attempt Electronics paper
(Those who are having electronics background)
—————————————————————————-
SECTION A

1. Which of the folowing is not correct
a. (x+y)’=x’.y’ b. (x’+y’)'=x.y
c. (x’.y’)'=x+y d. (x’+y’)'=x’.y’ [d]

2. Question on logic ckt. U have to find the output
ans. AB’+CD’+EF’

3. Output of MUX
_________
c—–| |
c’—-| |——-Y
c’—-| | ans. A xor B xor C
c—–| |
———
| |
A B (select lines)

4.If X and Y are two sets. |X| and |Y| are corresponding
coordinates and exact no.of functions from X to Y is 97
then
a. |X|=97 |Y|=1 b. |X|=1 |Y|=97
c. |X|=97 |Y|=97 d. …..

5. If two dies are thrown simultaneously what is the prob.
of one of the dice getting face 6 ?
a. 11/36 b. 1/3 c. 12/35 d. 1/36 [a]

6. The relation , O(log n) .. likewise