GATE CSE 1999

## GATE CSE

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

View Question Suppose we want to arrange the n numbers stored in any array such that all
negative values occur before all positive one

View Question The number of articulation points of the following graph is

View Question A sorting technique is called stable if:

View Question If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4,

View Question If T1 = O(1), give the correct matching for the following pairs:
List - I
(M) Tn = Tn - 1 + n
(N) Tn = Tn/2 + n
(O) Tn =

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

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

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

View Question The main memory of a computer has $$2$$ $$cm$$ blocks while the cache has $$2$$ $$c$$ blocks. If the cache uses the set

View Question An instruction pipeline consists of $$4$$ stages: Fetch (F), Decode field (D), Execute (E), and Result-Write (W). The $$

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

View Question RAID configurations of disks are used to provide

View Question 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.$

View Question Consider the schema $$R = \left( {S\,\,T\,\,U\,\,V} \right)$$ and the dependencies $$S \to T,\,\,T \to U,\,\,U \to V$$ a

View Question Which of the following is/are correct?

View Question Consider the set of relations
EMP (Employee-no, Dept-no, Employee-name, Salary)
DEPT (Dept-no, Dept-name, Location)
Writ

View Question 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 s

View Question The relational algebra expression equivalent to the following tuple calculus expression:
$$\left\{ {t|t \in r \wedge \le

View Question For the schedule given below, which of the following is correct:

View Question Which of the following is correct?

View Question Zero has two representations in:

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

View Question Which of the following functions implements the Karnaugh map shown below?

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

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

View Question Let X and Y be two exponentially distributed and independent random variables with mean $$\alpha $$ and $$\beta $$, resp

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

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

View Question (a) Show that the formula $$\left[ {\left( { \sim p \vee Q} \right) \Rightarrow \left( {q \Rightarrow p} \right)} \right

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

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

View Question (a) Mr. X claims the following:
If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr.

View Question Two girls have picked 10 roses, 15 sunflowers and 14 daffodils. What is the number of ways they can divide the flowers a

View Question Let $$G$$ be a connected, undirected graph. A $$cut$$ in $$G$$ is a set of edges whose removal results in $$G$$ being br

View Question System calls are usually invoked by using:

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

View Question Which of the following actions is/are typically not performed by the operating system when switching context from proces

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

View Question A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both

View Question Listed below are some operating system abstractions (in the left column) and the hardware components. Which matching pai

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

View Question Given the programming constructs: (i) assignment (ii) for loops where the loop
parameter cannot be changed within the lo

View Question Consider the following program in a language that has dynamic scooping:
var x: real;
procedure show;
begin prin

View Question A certain processor supports only the immediate and the direct addressing
modes. Which of the following programming lang

View Question Consider the following C function definition
int Trial (int a, int b, int c)
{
if ((a > = b) && (c <

View Question Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the la

View Question Context free languages are closed under:

View Question Let $${L_D}$$ be the set of all languages accepted by a $$PDA$$ by final state and $${L_E}$$ the set of all languages ac

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

View Question