Paper 11

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