Uttar Pradesh Technical University (UPTU) 2006 B.Tech Computer Science Information Technology GATE - Question Paper
Wednesday, 27 March 2013 07:45Web
Page 8 of 14
255.255.192.0. which 1 of the subsequent statements is true?
(A) Cl and C2 both presume they are on the identical network
(B) C2 assumes Cl is on identical network, but Cl assumes C2 is on a various network
(C) Cl assumes C2 is on identical network, but C2 assumes Cl is on a various network
(D) Cl and C2 both presume they are on various networks.
46. Station A needs to send a message consisting of nine packets to Station B using a sliding
window (window size 3) and go-back-n fault control strategy. All packets are ready and
immediately available for transmission. If every fifth packet that A transmits gets lost (but no
acks from B ever get lost), then what is the number of packets that A will transmit for sending
the message to B?
(A) 12
(B) 14
(C) 16
(D) 18
47. Consider the subsequent graph:
Which 1 of the subsequent cannot be the sequence of edges added, in that
order, to a minimum spanning tree using Kruskal’s algorithm?
(A) (a—b),(d—f),(b—f),(d—c),(d—e)
(B) (a—b),(d—f),(d—c),(b—f),(d—e)
(C) (d—f),(a—b),(d—c),(b—f),(d—e)
(D) (d—f),(a—b),(b—f),(d—e),(d—c)
48. Let T be a depth 1st search tree in an undirected graph G. Vertices u and v are leaves of
this tree T. The degrees of both u and v in G are at lowest 2. which 1 of the subsequent
statements is true?
(A) There must exist a vertex w adjacent to both u and v in G
(B) There must exist a vertex w whose removal disconnects u and v in G
(C) There must exist a cycle in G containing u and v
(D) There must exist a cycle in G containing uand all its neighbours in G.
49. An implementation of a queue Q, using 2 stacks Si and S2, is provided below:
void insert (Q, x)
push (Si, x);
void delete (Q)
if (stack—empty(52)) then
if (stack—empty(Si)) then
print(”Q is empty”);
return;
else while (! (stack—empty (Si)))
x=pop (Si);
push(52,x)
x=pop (S2);
Let flinsert and m( n)delete operations be performed in an arbitrary order on an empty queue
Q. Let x and y be the number of push and pop operations performed respectively in the
process. Which 1 of the subsequent is actual for all m and n?
| Earning: Approval pending. |
