GATE 2002 CSE & IT
49 questions across 1 session
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
In the C language
Horizontal micro programming
Sign extension is the step in
In absolute addressing mode
Dynamic linking can cause security concerns because
Sign extension is the step in
The decimal value $$0.25$$
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
Which of the following scheduling algorithms is non-preemptive?
The optimal page replacement algorithm will select the page that.
Express the function $$f( x, y, z)= xy'+ yz'$$ with only one complement operation and one or more $$AND/OR$$ operations. Draw the logic circuit implementing the expression obtained...
The binary relation $$S = \phi $$ (emply set) on set A = {1, 2, 3} is
$$f\left( {A,B} \right) = A' + B$$ Simplified expression for function $$f((x+y,y),z)$$ is
In $$2’s$$ complement addition, the overflow
Determine whether each of the following is a tautology, a contradiction, or neither ("$$ \vee $$" is disjunction, "$$ \wedge $$" is conjuction, "$$ \to $$" is implication, "$$\neg...
Relation $$R$$ with an associated set of functional dependencies, $$F,$$ is decomposed into $$BCNF.$$ The redundancy (arising out of functional dependencies) in the resulting set o...
The rank of the matrix$$\left[ {\matrix{ 1 & 1 \cr 0 & 0 \cr } } \right]\,\,is$$
Which of the following is not a form of memory?
Which combination of the following features will suffice to characterize an $$OS$$ as a multi-programmed $$OS?$$ $$(a).$$ More than one program may be loaded into main memory at th...
Which of the following scheduling algorithms is non-preemptive?
Let $$A$$ be a set of $$n\left( { > 0} \right)$$ elements. Let $${N_r}$$ be the number of binary relations on $$A$$ and Let $${N_r}$$ be the number of functions from $$A$$ to $$A$$...
The running time of the following algorithm Procedure A(n) If n<=2 return (1) else return (A([$$\sqrt n $$])); is best described by
The solution to the recurrence equation T(2 k ) = 3 T(2 k-1 ) + 1, T (1) = 1, is:
Consider the following algorithm for searching for a given number x in an unsorted array A[1..n] having n distinct values: 1. Choose an i uniformly at random fro 1..n; 2. If A[i]=x...
Obtain the eigen values of the matrix $$$A = \left[ {\matrix{ 1 & 2 & {34} & {49} \cr 0 & 2 & {43} & {94} \cr 0 & 0 & { - 2} & {104} \cr 0 & 0 & 0 & { - 1} \cr } } \right]$$$
(a) $$S = \left\{ { < 1,2 > ,\, < 2,1 > } \right\}$$ is binary relation on set $$A = \left\{ {1,2,3} \right\}$$. Is it irreflexive? Add the minimumnumber of ordered pairs to $$S$$...
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:
Maximum number of edges in a n - node undirected graph without self loops is
The $$2's$$ compliment representation of the decimal value $$-15$$ is
The performance of a pipelined processor suffers if
The results returned by function under value-result and reference parameter passing conventions
The minimum number of colors required to color the vertices of a cycle with $$n$$ nodes in such a way that no two adjacent nodes have the same colour is:
Draw the process state transition diagram of an $$OS$$ in which (i) each process is in one of the five states: created, ready, running, blocked (i.e. sleep or wait), or terminated,...
The function $$f\left( {x,y} \right) = 2{x^2} + 2xy - {y^3}$$ has
Relation $$R$$ is decomposed using a set of functional dependencies, $$F,$$ and relation $$S$$ is decomposed using another set of functional dependencies, $$G.$$ One decomposition...
A computer system uses $$32$$-bit virtual address, and $$32$$-bit physical address. The physical memory is byte addressable, and the page size is $$4$$ kbytes. It is decided to use...
A B + - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk blocks are of size 512 bytes, and index p...
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on
With regard to the expressive power of the formal relational query languages, which of the following statements is true?
"If X then Y unless Z" is represented by which of the following formulas in propositional logic? (" $$\neg $$ " is negation, " $$ \wedge $$ " is conjunction, and " $$ \to $$ " is i...
In serial data transmission, every byte of data is padded with a $$‘0’$$ in the beginning and one or two $$‘1’s$$ at the end of byte because
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is
Consider the following declaration of a two-dimensional array in C: char a[100][100]; Assuming that the main memory is byte-addressable and that the array is stored starting from m...
Which of the following is not a form of memory?
The $$C$$ language is:
Which of the following is true?
The language accepted by a pushdown Automation in which the stack is limited to $$10$$ items is best described as
The smallest finite automaton which accepts the language $$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is divisible by $$\left. 3 \right\}$$ has