The Questions are follows^M
1. Number of null pointers in any binary tree = n+1^M
2. max(t1,t2,…tn) = pipelining^M
3. 50% -DBETXXXXXX – density^M
1) find the probability of getting a number with 7 between 100 and
999 (both inclusive).
ans:

2) There are 10 items in a box, out of which 3 are defective.
2 balls are taken one after the other. what is the probability
that both of them are defective?
Ans: 1/15 or 6/90

3) Context free grammar is accepted by
a) finite automata
b)push down automata
c) two way bounded automata
d) both b and c

4) which is not a memory management scheme?
a) buddy system
b) swapping
c) monitors
d) paging Ans : c

5) qn. on karnaugh map for simplifying boolean expressions

- 1 1 -
1 – - 1
1 – - 1
- 1 1 -
karnaugh map

6) qn. on nand gates .

7) context sensitive grammar

8) An identifier can start with a letter followed by any number of
letter
or digits .
ans: L.(LUD)*

9) 8MB total memory, 256 k cache , 4k is block size. direct mapping
how many different physical memory blocks can be mapped on to the
cache.
a) 64 b) 256 c) 128

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

11) In TCP/IP header , checksum contains
a) sum of all the words
b) ones complement of the data
c) ones complement of the sum of all the words
d) ones complement of the sum in ones complement
Ans : d

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

13) which is a good way of representing varaibles in recursion
a) local variables
b) static varaibles
c) global variables
d)

14) c programs
func() {
static int i = 10;
printf(”%d”,i);
i++;
}

what is the value of i if the function is called twice ?

Ans : 11

15) Qn. on pointers .

16) given page table,page size and offset find the corresponding
physical address ?
ans : a (3*1024+576) (pageno*pagesize+offset)

17) In a memory chip 4k size and 16bit words to be stored. No of
address and data lines reqd.
Ans) 16 data and 12 address

18) idetify in which pass of the 2 pass compiler
1) literals
2) address resolution
3) listing
4)

19) object code not requires
a) relocation bits
b) external names and place where they are located
c) absolute adress
d) all the object codes

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

21) Qn on Balanced tree ? A balanced tree is given and a node is
addded
at the leaf and asked to find the no of unbalanced nodes?

22) order of Hashing time
a) 0(1)
b) 0(n2)

4) parse tree
s – s + s ; s – s * s ; s – a
find the no of parse trees for a+a*a+a
a) 4
b) 5
c) 6
ans: 5

25) order of deleting an node from a linked list. (pointer is to an
arbitrary node)
a)0(1)
b)0(n)

26) 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

27) A directed graph is represented by adjacency list. To find the
complexity of indegree of the node. e – edge n- vertices
a) o(e+n)

28) No of leaf nodes given. find the no of nodes with degree 2.

29) AX = B . A is mXn and B is mX1 and several options given like
a) there is a unique solution if rank of A is same as rank of
augumented matrix [A b]
b) there are multiple solutions

30) LXI sp,2099h
LXI b, 2012h
push b
31) Which of the following are false (on complexities)

32) A,B are sets. A’s cardinality is m and B’s is n where m < n
how many one to one mappings can be obtained.
a) n ^ m
b) npm
c) mpn
d) mcn

33) In scduling algorithnms which are logically executed but suspended
a) preemptive
b) SJF
c)non preemptive
d) all the above
Ans : a

34) I/O redirection is
a) copying programs files through a pipe
b) input files are created
c) input file taken from existing ones
d) none

35) symmetric multiprocessing can be done in
a) snoopy protocols
b) cache coherence

36) dining philospheres problems to avoid dead locke
a) 1 person will take left one and all other will take right one
b) adjacent persons should not eat concurrently

36
) process states ? which is the correct order
a) timeout:ready – running
b) blocked : ready – running
c)
d)

37) for converting infix expression to postfix what
do we require
a) operand stack
b) operator stack
c)

38) 0 is reprented as both and negative and positive
a) ones complement
b) twos complement
c) two’s complement has extra negative number

39) Difference between c and c++?
a)In c++ we can define variables in the middle
b)dynamic scoping

40) Which of the following is correct

a) Synchronous tranmission needs more badwidth than Asychronous.
b) Inasychronous transmission , the time is associated with data itself.

there are three section . there are 44 question in all three section

.the time is 45 mainutes.it is suffucent.

section I -20 question.

section II-11 question . it is GRE resoning .you can easyly do these section.

section III-13 question

1. there is question on figure .it is easy.
ans d) correct

2. there are 1800 coins .one soin is defective in that .in how

many minimum times you can find that the coin is defective.
a)11

b)9

c)7

d)2

3. there are two kind of professonal in a company software & personal.if

the personal are 15% of the total .a party is going .in a party if 50% of the total

professonal left and all are s/w then what is the ratio of the

s/w professonal left to total software professonal.

ans b) 10/17

4. what is the probebility of the talking out two card one king and one quene of black in a card packet.
ans d) 1/663 (ckeck)

5.1 1 2 3 5 … 13
ans 8

6.there are two more question of series .they are easy.

7.there are two question of coding and decoding.they are also easy.

8.how many word are be formed by by a 5 alphbet ward in which one

word is twice.(I don’t rembere the exact word)

ans 60 (correct0

9.there is one question on price rise and fall .

ans 1% decrese in price.

10. 1,7,17,31,–,71

ans 49

section II

1:a machine A wants to set it’s time same as a a machine B
so it sends a packet to B and b sends reply.but the time on packet is over by the timete packet reached A.A has to

a1:set the time on packet
b2:increment its time slowly so as to reduce deifference
c:send packets repeatedly till it gets a packet with time less tan the current time
d:….

2.which of the following protocols does not find mac address given internet address
aarp
b.rarp
c….
d…

3.when an java applet get’s downloaded what happens
a.the byte verifier checks the magic number
b…
c…
d…

4.when A wants to send a mesg to B using Public key cryptography he uses
a.A’s public key
b.A’s private key
c.B’s public
d.B’s private

5.how does a string in java differ from that of c/c++
a1.java strings are mutable
b.java strings does not have a \0
c.
d.

6.given str”AaBbCc”and a small c program
something like

a:b )

the program actually reverses the string recursively

7.some protocol SHDC

8.NFS server is similar to
a.provides similar sevices as unix
b.a file trans fer…..
c.just gets the file for reading..
d.

9.an address 202.15.46.45 is to be located.the machine does not have
info about 202.0.0.0 or 202.15.0.0 0r 202.15.46.0
so the DNS server willl now

a.discard the packet
b.send the mesg to a default server if available
c.send mesg to a DNS server if available
d……

10.verification:”are u building the right product”
validation:”are we building the product right”

a.both are wrong(ans)
b.both are correct
c.first wrong second correct
d.first correct second wrong

11.A:”cohesion is a desirable property”
B:”cohesion means the property that the entire unit is one……”

a.both are correct
b.both are wrong
c.first wrong second correct
d.first correct second wrong

12:definition of functional dependency.

13:which of the following does not use extra memory
a…..
b.insertion sort
c.shell sort
d.both b and c.

14:which of the following is better for ten elements

a.bubble sort
b.selection sort
c.quick sort
d……

15.the memory reference time for cache is 100 ms and for memory is 1000ms
.the probalility of a hot is .9.the average memory access time is
a:100
b:200(ans)
c:500
d:1000

16.a question on socket numbers

17there is an ordered binary tree and an index structure
a.we can use ordbintree without ordering
b.orb are used with ordering where as indexing canbe done without ordering
c.indexing uses extra memory
d……

18.there is ethernet protocol and ethernetIPstack in MAC sublayer
when an address has to be found which is used

1. a processor has two level cache.Their access time (level1

and level2) is 100ns and 300ns respect.Memeory access time is 1000ns$

ans is 140 (b)

2.diskless server uses

a rarp

b arp

c ftp

d.telnet

ans rarp

3.which one of them is not a client server

e-mail

telephone

webserver

and one more

ans is e-mail or telephone.

4.Which one is used to represent operations

infix

postfix

binarytree

and one more

ans binary tree

5.one qustion was on private key and public key.The quest. was

if a wants to send a message to b that no one other that b should $

A private key

A public key

B private key

B public key

6.compliers maintain

ans is symbol table

1) what a java interface not have ?

ans – instance variables

2) what is done with java code on a web-page

ans – downloaded and executed on ur pc

3) what is the order of deleting a node from a linked list given a ptr

to it

ans O(n) ( since u have to traverse the list to reach the prev.

node)

3) what is RSA

4) how can A send a messageto B so that B knows its from A

ans A uses his private key so that B can use A’s public key

5) what is the best sort in worst case

ans heap sort

6) what is the given sorting

ans selection ( check it )

7) what can access protected memebers of a class

ans other classes of that program

8) what protocol is used by a machine to map an ip to hardware address

ans arp

9) what is the size of ipv6

ans 128 bits

10) what protocol has ping

ans icmp

11) how many keys are needed in symmetric and asymmetric crptography?

ans – i dont know

12) one on a right threaded tree

13) very easy k-map

ans i think its b)

14) very easy ckt

ans choice which has option : a&c are equivalent

15) what in unix doesnt have a fd

ans process