GATE 1999 CSE & IT

Consider the following program in a language that has dynamic scooping: var x: real; procedure show; begin print(x); end; procedure small; var x: real; begin x: = 0.125; show; end;...

Zero has two representations in:

RAID configurations of disks are used to provide

Which of the following actions is/are typically not performed by the operating system when switching context from process $$A$$ to process $$B$$ ?

A multi-user, multi-processing operating system cannot be implemented on hardware that does not support:

Which of the following is/are advantage of virtual memory?

The number of binary relations on a set with $$n$$ elements is:

Let $$\left( {\left\{ {p,\,q} \right\},\, * } \right)$$ be a semi group where $$p * p = q$$. Show that: (a) $$p * q = q * p,$$, and (b) $$q * q = q$$

Listed below are some operating system abstractions (in the left column) and the hardware components. Which matching pairs is correct? $$\,\,\,\,\,\,\,\,\,\,$$$$\,\,\,\,\,\,\,\,\,\...

Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then the maximum and minimum sizes of the join respectively are

Suppose that the expectation of a random variable X is 5. Which of the following statements is true?

Consider the set of relations EMP (Employee-no, Dept-no, Employee-name, Salary) DEPT (Dept-no, Dept-name, Location) Write an SQL query to: (a) Find all employee names who work in d...

(a) Show that the formula $$\left[ {\left( { \sim p \vee Q} \right) \Rightarrow \left( {q \Rightarrow p} \right)} \right]$$ is not a tautology. (b) Let $$A$$ be a tautology and $$B...

A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor?

The main difference (s) between a $$CISC$$ and a $$RISC$$ processor is/are that a $$RISC$$ processor typically:

Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?

The number of binary strings of $$n$$ zeros and $$k$$ ones such that no two ones are adjacent is:

Consider the following C function definition int Trial (int a, int b, int c) { if ((a > = b) && (c < b)) return b; else if (a > = b) return Trial (a,c,b); else return Trial (b,a,c)...

The relational algebra expression equivalent to the following tuple calculus expression: $$\left\{ {t|t \in r \wedge \left( {t\left[ A \right] = 10 \wedge t\left[ B \right] = 20} \...

Let X and Y be two exponentially distributed and independent random variables with mean $$\alpha $$ and $$\beta $$, respectively. If Z = min (X, Y), then the mean of Z is given by

Consider the schema $$R = \left( {S\,\,T\,\,U\,\,V} \right)$$ and the dependencies $$S \to T,\,\,T \to U,\,\,U \to V$$ and $$V \to S$$ let $$R =$$ $$(R1$$ and $$R2)$$ be a decompos...

System calls are usually invoked by using:

Which of the following is/are correct?

Booth’s coding in $$8$$ bits for the decimal number –$$57$$ is:

The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit number is

A sorting technique is called stable if:

If T 1 = O(1), give the correct matching for the following pairs: List - I (M) T n = T n - 1 + n (N) T n = T n/2 + n (O) T n = T n/2 + nlog n (P) T n = T n - 1 + log n List - II (U...

Let $$R=(A,B,C,D,E,F)$$ be a relation scheme with the following dependencies: $$C \to F,\,E \to A,\,EC \to D,\,A \to B.$$ Which of the following is a key for $$R?$$

Suppose we want to arrange the n numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is

If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements after the s...

Consider two events $${{E_1}}$$ and $${{E_2}}$$ such that probability of $${{E_1}}$$, Pr [$${{E_1}}$$] = 1/2, probability of $${{E_2}}$$, Pr[$${{E_2}}$$ = 1/3, and probability of $...

(a) Mr. X claims the following: If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof. "From xRy, using symmetry we get...

A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both virtual and physical address spaces contain $${2^{16}}$$ by...

The number of full and half-adders required to add 16-bit numbers is:

Two girls have picked 10 roses, 15 sunflowers and 14 daffodils. What is the number of ways they can divide the flowers among themselves?

The number of tokens in the Fortran statement DO 10 I = 1.25 is

Suppose that the expectation of a random variable X is 5. Which of the following statements is true?

Which of the following disk scheduling strategies is likely to give the best throughput?

Which of the following is correct?

Given the programming constructs: (i) assignment (ii) for loops where the loop parameter cannot be changed within the loop (iii) if-then-else (iv) forward go to (v) arbitrary go to...

The main memory of a computer has $$2$$ $$cm$$ blocks while the cache has $$2$$ $$c$$ blocks. If the cache uses the set associative mapping scheme with $$2$$ blocks per set, then b...

Let $${L_D}$$ be the set of all languages accepted by a $$PDA$$ by final state and $${L_E}$$ the set of all languages accepted by empty stack. Which of the following is true?

Context free languages are closed under:

Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the language represented by this regular expression contains:

If $${L_1}$$ is a context free language and $${L_2}$$ is a regular which of the following is/are false?