GATE CSE 2002

## GATE CSE

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

View Question Consider the following algorithm for searching for a given number x in an unsorted array A[1..n] having n distinct value

View Question The running time of the following algorithm Procedure A(n)
If n<=2 return (1) else return (A([$$\sqrt n $$]));
is bes

View Question The solution to the recurrence equation T(2k) = 3 T(2k-1) + 1, T (1) = 1, is:

View Question In $$2’s$$ complement addition, the overflow

View Question Sign extension is the step in

View Question The performance of a pipelined processor suffers if

View Question Which of the following is not a form of memory?

View Question In absolute addressing mode

View Question Horizontal micro programming

View Question In serial data transmission, every byte of data is padded with a $$‘0’$$ in the beginning and one or two $$‘1’s$$ at the

View Question In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

View Question The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:

View Question Relation $$R$$ with an associated set of functional dependencies, $$F,$$ is decomposed into $$BCNF.$$ The redundancy (ar

View Question From the following instance of a relation schema $$R(A, B, C),$$ we can conclude that:

View Question Relation $$R$$ is decomposed using a set of functional dependencies, $$F,$$ and relation $$S$$ is decomposed using anoth

View Question With regard to the expressive power of the formal relational query languages, which of the following statements is true?

View Question A B+ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of len

View Question The decimal value $$0.25$$

View Question Sign extension is the step in

View Question The $$2's$$ compliment representation of the decimal value $$-15$$ is

View Question Transform the following logic circuit (without expressing its switching function) into an equivalent logic circuit that

View Question Consider the following logic circuit whose inputs are functions $${f_1},$$ $${f_2},$$ $${f_3},$$ and output is $$f.$$

View Question $$f\left( {A,B} \right) = A' + B$$ Simplified expression for function $$f((x+y,y),z)$$ is

View Question Express the function $$f( x, y, z)= xy'+ yz'$$ with only one complement operation and one or more $$AND/OR$$ operations.

View Question Minimum $$SOP$$ for $$f(w, x, y, z)$$ shown in karnaugh $$-$$ map below is

View Question Consider the following multiplexer where $$10, 11, 12, 13$$ are four data input lines selected by two address line combi

View Question "If X then Y unless Z" is represented by which of the following formulas in propositional logic? (" $$\neg $$ " is negat

View Question Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is

View Question The binary relation $$S = \phi $$ (emply set) on set A = {1, 2, 3} is

View Question Determine whether each of the following is a tautology, a contradiction, or neither ("$$ \vee $$" is disjunction, "$$ \w

View Question The minimum number of colors required to color the vertices of a cycle with $$n$$ nodes in such a way that no two adjace

View Question The rank of the matrix$$\left[ {\matrix{
1 & 1 \cr
0 & 0 \cr
} } \right]\,\,is$$

View Question Maximum number of edges in a n - node undirected graph without self loops is

View Question (a) $$S = \left\{ { < 1,2 > ,\, < 2,1 > } \right\}$$ is binary relation on set $$A = \left\{ {1,2,3} \right\

View Question Let $$A$$ be a set of $$n\left( { > 0} \right)$$ elements. Let $${N_r}$$ be the number of binary relations on $$A$$ a

View Question Obtain the eigen values of the matrix
$$$A = \left[ {\matrix{
1 & 2 & {34} & {49} \cr
0 & 2 &

View Question The function $$f\left( {x,y} \right) = 2{x^2} + 2xy - {y^3}$$ has

View Question Which of the following scheduling algorithms is non-preemptive?

View Question Draw the process state transition diagram of an $$OS$$ in which
(i) each process is in one of the five states: created,

View Question Which combination of the following features will suffice to characterize an $$OS$$ as a multi-programmed $$OS?$$ $$(a).$

View Question Which of the following scheduling algorithms is non-preemptive?

View Question Which of the following is not a form of memory?

View Question The optimal page replacement algorithm will select the page that.

View Question Dynamic linking can cause security concerns because

View Question A computer system uses $$32$$-bit virtual address, and $$32$$-bit physical address. The physical memory is byte addressa

View Question In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on

View Question The results returned by function under value-result and reference parameter
passing conventions

View Question In the C language

View Question Consider the following declaration of a two-dimensional array in C:
char a[100][100];
Assuming that the main memory is b

View Question The smallest finite automaton which accepts the language
$$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is

View Question The Finite state machine described by the following state diagram with $$A$$ as starting state, where an arc label is $$

View Question The language accepted by a pushdown Automation in which the stack is limited to $$10$$ items is best described as

View Question Which of the following is true?

View Question The $$C$$ language is:

View Question