GATE IT 2006 (original) (raw)

In the working-set strategy, which of the following is done by the operating system to prevent thrashing?

1. It initiates another process if there are enough extra frames.
2. It selects a process to suspend if the sum of the sizes of the working-sets exceeds the total number of available frames.

A problem in NP is NP-complete if

• It can be reduced to the 3-SAT problem in polynomial time
• The 3-SAT problem can be reduced to it in polynomial time
• It can be reduced to any other problem in NP in polynomial time
• Some problem in NP can be reduced to it in polynomial time

The characters a to h have the set of frequencies based on the first 8 Fibonacci numbers as follows

a : 1, b : 1, c : 2, d : 3, e : 5, f : 8, g : 13, h : 21/

A Huffman code is used to represent the characters. What is the sequence of characters corresponding to the following code? 110111100111010

Given a boolean function f (x1, x2, ..., xn), which of the following equations is NOT true

• f(x1​, x2​, …, xn​) = x1'f(x1​, x2​, …, xn​) + x1​f(x1​, x2​, …, xn​)
• f(x1, x2, ..., xn) = x2f(x1, x2, …, xn) + x2'f(x1, x2, …, xn)
• f(x1, x2, ..., xn) = xn'f(x1, x2, …, 0) + xnf(x1, x2, …,1)
• f(x1, x2, ..., xn) = f(0, x2, …, xn) + f(1, x2, ..., xn)

A class of 24 students occupies a classroom containing 4 rows of seats, with 7 seats in each row. If the students seat themselves randomly, what is the probability that the 5th seat in the 4th row is empty?

Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width?

• Transparent DMA and Polling interrupts
• Cycle-stealing and Vectored interrupts
• Block transfer and Vectored interrupts
• Block transfer and Polling interrupts

Which of the following relational query languages have the same expressive power?

1. Relational algebra
2. Tuple relational calculus restricted to safe expressions
3. Domain relational calculus restricted to safe expressions

Consider the relations r1(P, Q, R) and r2(R, S, T) with primary keys P and R respectively. The relation r1 contains 2000 tuples and r2 contains 2500 tuples. The maximum size of the join r1⋈ r2 is :

For the set N of natural numbers and a binary operation f : N x N → N, an element z ∊ N is called an identity for f, if f (a, z) = a = f(z, a), for all a ∊ N. Which of the following binary operations have an identity?

1. f (x, y) = x + y - 3
2. f (x, y) = max(x, y)
3. f (x, y) = xy

What is the cardinality of the set of integers X defined below? X = {n | 1 ≤ n ≤ 123, n is not divisible by either 2, 3 or 5}

There are 85 questions to complete.

Take a part in the ongoing discussion