How To Exam?

a knowledge trading engine...


Andhra University 2006 B.E Information Technology COMPUTER SCIENCE

Wednesday, 01 May 2013 08:05Web

(d) the large calculation overhead in the translation process



27. Which of the subsequent assertions is FALSE about the Internet Protocol (IP)?

(a) It is possible for a computer to have multiple IP addresses

(b) IP packets from the identical source to the identical destination can take various routes in

the network

(c) IP ensures that a packet is discarded if it is unable to reach its destination within a

provided number of hops

(d) The packet source cannot set the route of an outgoing packets; the route is determined

only by the routing tables in the routers on the way



28. Which of the subsequent functionalities must be implemented by a transport protocol over and above the network protocol?

(a) Recovery from packet losses

(b) Detection of duplicate packets

(c) Packet delivery in the accurate order

(d) End to end connectivity





29. Which of the subsequent scenarios may lead to an irrecoverable fault in a database system?
A transaction writes a data item after it is learn by an uncommitted transaction
A transaction reads a data item after it is learn by an uncommitted transaction
A transaction reads a data item after it is written by a committed transaction
A transaction reads a data item after it is written by an uncommitted transaction



30. Consider the subsequent SQL query

choose distinct a 1. a 2, ...... , a n

from r 1, r 2……….., r m

where P



For an arbitrary predicate P, this query is equivalent to which of the subsequent relational algebra expressions?

(a)

(b)

(c)

(d)

Q. 31-90 CARRY 2 MARKS every



31. Let (S, £ ) be a partial order with 2 minimal elements a and b, and a maximum element c. Let P : S ® {True, False} be a predicate described on S. Suppose that p(a) = True, P(b) = False and P(x) Þ P(y) for all x, y Î S satisfying x £ y, where Þ stands for logical implication. Which of the subsequent statements CANNOT be true?

(a) P(x) = actual for all X Î S such that x ¹ b

(b) P(x) = False for all X Î S such that x ¹ a and x ¹ c



( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Andhra University 2006 B.E Information Technology COMPUTER SCIENCE