Register

Recent questions tagged gate1994

26 votes
5 answers
31
GATE CSE 1994 | Question: 3.11
State True or False with reason Logical data independence is easier to achieve than physical data independence.
State True or False with reasonLogical data independence is easier to achieve than physical data independence.
User Avatar
21 votes
5 answers
33
GATE CSE 1994 | Question: 3.9
Every subset of a countable set is countable. State whether the above statement is true or false with reason.
Every subset of a countable set is countable.State whether the above statement is true or false with reason.
User Avatar
26 votes
5 answers
34
GATE CSE 1994 | Question: 3.8
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
User Avatar
33 votes
4 answers
35
GATE CSE 1994 | Question: 3.7
An instance of a relational scheme $R(A, B, C)$ has distinct values for attribute $A$. Can you conclude that $A$ is a candidate key for $R?$
An instance of a relational scheme $R(A, B, C)$ has distinct values for attribute $A$. Can you conclude that $A$ is a candidate key for $R?$
User Avatar
29 votes
4 answers
36
GATE CSE 1994 | Question: 3.6
State True or False with reason There is always a decomposition into Boyce-Codd normal form (BCNF) that is lossless and dependency preserving.
State True or False with reasonThere is always a decomposition into Boyce-Codd normal form (BCNF) that is lossless and dependency preserving.
User Avatar
24 votes
4 answers
37
GATE CSE 1994 | Question: 3.5
Match the following items ...
Match the following items$$\begin{array}{ll|ll}\hline \text{(i)} & \text{Backus-Naur form} & \text{(a)} & \text{Regular expressions} \\\hline \text{(ii)} & \text{Lexical...
User Avatar
0 votes
3 answers
38
GATE CSE 1994 | Question: 3.4
Match the following items (i) Newton-Raphson (a) Integration (ii) Runge-Kutta (b) Root finding (iii) Gauss-Seidel (c) Ordinary Differential Equations (iv) Simpson's Rule (d) Solution of Systems of Linear Equations
Match the following items(i) Newton-Raphson(a) Integration(ii) Runge-Kutta(b) Root finding(iii) Gauss-Seidel(c) Ordinary Differential Equations(iv) Simpson's Rule(d) Solu...
User Avatar
70 votes
3 answers
39
GATE CSE 1994 | Question: 3.3
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
State True or False with one line explanationA FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
User Avatar
22 votes
2 answers
40
GATE CSE 1994 | Question: 3.2
State True or False with one line explanation Expanding opcode instruction formats are commonly employed in RISC. (Reduced Instruction Set Computers) machines.
State True or False with one line explanationExpanding opcode instruction formats are commonly employed in RISC. (Reduced Instruction Set Computers) machines.
User Avatar
33 votes
5 answers
42
GATE CSE 1994 | Question: 2.10
The regular expression for the language recognized by the finite state automaton of figure is ________
The regular expression for the language recognized by the finite state automaton of figure is ________
User Avatar
17 votes
4 answers
43
GATE CSE 1994 | Question: 2.9
The Hasse diagrams of all the lattices with up to four elements are ________ (write all the relevant Hasse diagrams)
The Hasse diagrams of all the lattices with up to four elements are ________ (write all the relevant Hasse diagrams)
User Avatar
25 votes
2 answers
44
GATE CSE 1994 | Question: 2.8
Let $A, B,$ and $C$ be independent events which occur with probabilities $0.8, 0.5,$ and $0.3$ respectively. The probability of occurrence of at least one of the event is _______
Let $A, B,$ and $C$ be independent events which occur with probabilities $0.8, 0.5,$ and $0.3$ respectively. The probability of occurrence of at least one of the event is...
User Avatar
21 votes
2 answers
45
GATE CSE 1994 | Question: 2.7
Consider $n$-bit (including sign bit) $2's$ complement representation of integer numbers. The range of integer values, $N$, that can be represented is ______ $\leq N \leq $______ .
Consider $n$-bit (including sign bit) $2's$ complement representation of integer numbers. The range of integer values, $N$, that can be represented is ______ $\leq N \leq...
User Avatar
19 votes
3 answers
47
GATE CSE 1994 | Question: 2.5
The number of edges in a regular graph of degree $d$ and $n$ vertices is ____________
The number of edges in a regular graph of degree $d$ and $n$ vertices is ____________
User Avatar
31 votes
4 answers
48
GATE CSE 1994 | Question: 2.4
The number of subsets $\left\{ 1,2, \dots, n\right\}$ with odd cardinality is ___________
The number of subsets $\left\{ 1,2, \dots, n\right\}$ with odd cardinality is ___________
User Avatar
23 votes
3 answers
49
GATE CSE 1994 | Question: 2.3
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________
User Avatar
39 votes
4 answers
50
GATE CSE 1994 | Question: 2.2
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
User Avatar
19 votes
1 answer
51
GATE CSE 1994 | Question: 2-1
The number of flip-flops required to construct a binary modulo $N$ counter is __________
The number of flip-flops required to construct a binary modulo $N$ counter is __________
User Avatar
21 votes
7 answers
56
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
User Avatar
36 votes
3 answers
57
GATE CSE 1994 | Question: 1.18
Which of the following features cannot be captured by context-free grammars? Syntax of if-then-else statements Syntax of recursive procedures Whether a variable has been declared before its use Variable names of arbitrary length
Which of the following features cannot be captured by context-free grammars?Syntax of if-then-else statementsSyntax of recursive proceduresWhether a variable has been dec...
User Avatar
35 votes
4 answers
58
GATE CSE 1994 | Question: 1.17, UGCNET-Sep2013-II: 32
Linked lists are not suitable data structures for which one of the following problems? Insertion sort Binary search Radix sort Polynomial manipulation
Linked lists are not suitable data structures for which one of the following problems?Insertion sortBinary searchRadix sortPolynomial manipulation
User Avatar
26 votes
5 answers
60
GATE CSE 1994 | Question: 1.15
The number of substrings (of all lengths inclusive) that can be formed from a character string of length $n$ is $n$ $n^2$ $\frac{n(n-1)}{2}$ $\frac{n(n+1)}{2}$
The number of substrings (of all lengths inclusive) that can be formed from a character string of length $n$ is$n$$n^2$$\frac{n(n-1)}{2}$$\frac{n(n+1)}{2}$
User Avatar
Page: