GATE-CS-2005

Question 21

What is the swap space in the disk used for?

• Saving temporary html pages
• Saving process data
• Storing the super-block
• Storing device drivers

Question 22

Increasing the RAM of a computer typically improves performance because:

• Virtual memory increases
• Larger RAMs are faster
• Fewer page faults occur
• Fewer segmentation faults occur

Question 23

Packets of the same session may be routed through different paths in

• TCP, but not UDP

• TCP and UDP

• UDP, but not TCP

• Neither TCP, nor UDP

Question 24

The address resolution protocol (ARP) is used for

• Finding the IP address from the DNS
• Finding the IP address of the default gateway
• Finding the IP address that corresponds to a MAC address
• Finding the MAC address that corresponds to an IP address

Question 25

The maximum window size for data transmission using the selective reject protocol with n-bit frame sequence numbers is:

• 2^n
• 2^(n-1)
• 2^n – 1
• 2^(n-2)

Question 26

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

• For shortest path routing between LANs

• For avoiding loops in the routing paths

• For fault tolerance

• For minimizing collisions

Question 27

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

• 255.255.0.0

• 255.255.64.0

• 255.255.128.0

• 255.255.252.0

Question 28

Which one of the following is a key factor for preferring B+ -trees to binary search trees for indexing database relations?

• Database relations have a large number of records
• Database relations are sorted on the primary key
• B+ -trees require less memory than binary search trees
• Data transfer from disks is in blocks

Question 29

Which one of the following statements about normal forms is FALSE?

• BCNF is stricter than 3NF
• Lossless, dependency-preserving decomposi­tion into 3NF is always possible
• Lossless, dependency-preserving decomposi­tion into BCNF is always possible
• Any relation with two attributes is in BCNF

Question 30

Let r be a relation instance with schema R = (A, B, C, D). We define r₁ = Π_{A, B, C} (r) and r₂ = Π_A.D (r). Let s = r₁ * r₂ where * denotes natural join. Given that the decomposition of r into r₁ and r₂ is lossy, which one of the following is TRUE?

• s ⊂ r
• r ∪ s
• r ⊂ s
• r * s = s