GITAM University 2007 B.E Information Technology computers - Question Paper

1 The address resolution protocol (ARP) is used for
A) Finding the
IP address from the DNS
B) Finding the IP address of the default
gateway
C) Finding the IP address that corresponds to a MAC address
D)
Finding the MAC address that corresponds to an IP address
ans :
(D)

2 Consider the subsequent relation schema pertaining to a
students database:
learner (rollno, name, address)
Enroll
(rollno, courseno, coursename)
where the primary keys are shown
underlined. The number of tuples in the learner and Enroll tables are 120 and 8
respectively. elaborate the maximum and minimum number of tuples that can be
current in (Student * Enroll), where ‘*’denotes natural join?
A) 8,
8
B) 120, 8
C) 960, 8
D) 960, 120
ans : (C)

3
Consider a direct mapped cache of size 32 KB with block size 32 bytes. The CPU
generates 32 bit addresses. The number of bits needed for cache indexing and the
number of tag bits are respectively
A) 10, 17
B) 10, 22
C) 15, 17

D) 5, 17
ans : (A)

4 The goal of structured
programming is to
A) have well indented programs
B) be able to infer
the flow of control from the compiled code
C) be able to infer the flow of
control from the program text
D) avoid the use of GOTO statements

ans : (C)

5 The tightest lower bound on the number of
comparisons, in the worst ease, for comparison-based sorting is of the order
of
A) n
B) n 2
C) n log n
D) n log2
n
ans : (B)

6 Let G be a simple graph with 20 vertices
and 100 edges. The size of the minimum vertex cover of G is 8. Then, the size of
the maximum independent set of G is
A) 12
B) 8
C) Less than 8

D) More than 12
ans : (A)

7 WA and B are the only two
stations on an Ethernet. every has a steady queue of frames to send. Both A and B
attempt to transmit a frame, collide, and A wins the 1st backoff race. At the
end of this successful transmission by A, both A and B attempt to transmit and
collide. The probability that A wins the 2nd backoff race is
A) 0.5

B) 0.625
C) 0.75
D) 1.0
ans : (A)

8 Let A be a
sequence of eight distinct integers sorted in ascending order. How many distinct
pairs of sequences, B and C are there such that (i) every is sorted in ascending
order, (ii) B has five and C has three elements, and (iii) the outcome of merging B and
C provide A?
A) 2
B) 30
C) 56
D) 256
ans :
(D)

9 In a network of LANs connected by bridges, packets are sent
from 1 LAN to a different through intermediate bridges. Since more than 1 path
may exist ranging from 2 LANs, packets may have to be routed through multiple
bridges.
Why is the spanning tree algorithm used for bridge-routing?

A) For shortest path routing ranging from LANs
B) For avoiding loops in
the routing paths
C) For fault tolerance
D) For minimizing
collisions
ans : (B)

10 A Priority-Queue is implemented
as a Max-Heap. Initially, it has five elements. The level-order traversal of the
heap is provided below: 10, 8,5,3,2 2 new elements one and seven are inserted in the
heap in that order. The level-order traversal of the heap after the insertion of
the elements is
A) 10,8,7,5,3,2,1
B) 10,8,7,2,3,1,5
C)
10,8,7,1,2,3,5
D) 10,8,7,3,2,1,5
ans : (D)

11 An
organization has a class B network and wishes to form subnets for 64
departments. The subnet mask would be
A) 255.255.0.0
B) 255.255.64.0

C) 255.255.128.0
D) 255.255.252.0
ans : (D)

12
Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit
jamming signal is 46.4 ms. The minimum frame size is:
A) 94
B)
416
C) 464
D) 512
ans : (C)

Earning:   Approval pending.