Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2008
1
votes
1
answer
61
GATE CSE 2008 | Question: 22
The Newton-Raphson iteration $x_{n+1} = \frac{1}{2}\left(x_n+\frac{R}{x_n}\right)$ can be used to compute the square of R reciprocal of R square root of R logarithm of R
The Newton-Raphson iteration $x_{n+1} = \frac{1}{2}\left(x_n+\frac{R}{x_n}\right)$ can be used to compute thesquare of R reciprocal of R square root of R l...
Kathleen
5.2k
views
Kathleen
asked
Sep 11, 2014
Numerical Methods
gatecse-2008
newton-raphson
normal
numerical-methods
out-of-syllabus-now
+
–
1
votes
3
answers
62
GATE CSE 2008 | Question: 21
The minimum number of equal length subintervals needed to approximate $\int_1^2 xe^x\,dx$ to an accuracy of at least $\frac{1}{3}\times10^{-6}$ using the trapezoidal rule is 1000e 1000 100e 100
The minimum number of equal length subintervals needed to approximate $\int_1^2 xe^x\,dx$ to an accuracy of at least $\frac{1}{3}\times10^{-6}$ using the trapezoidal rule...
Kathleen
3.0k
views
Kathleen
asked
Sep 11, 2014
Numerical Methods
gatecse-2008
normal
numerical-methods
trapezoidal-rule
non-gate
+
–
32
votes
2
answers
63
GATE CSE 2008 | Question: 20
The data blocks of a very large file in the Unix file system are allocated using continuous allocation linked allocation indexed allocation an extension of indexed allocation
The data blocks of a very large file in the Unix file system are allocated usingcontinuous allocationlinked allocationindexed allocationan extension of indexed allocation...
Kathleen
15.1k
views
Kathleen
asked
Sep 11, 2014
Operating System
gatecse-2008
file-system
operating-system
normal
+
–
31
votes
6
answers
64
GATE CSE 2008 | Question: 19
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is: $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNPRO}$ $\text{QMNPOR}$
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is:$\text{MNOPQR}$...
Kathleen
35.3k
views
Kathleen
asked
Sep 11, 2014
Algorithms
gatecse-2008
normal
algorithms
graph-algorithms
graph-search
+
–
26
votes
3
answers
65
GATE CSE 2008 | Question: 18
Which combination of the integer variables $x, y,$ and $z$ makes the variable $a$ get the value $4$ in the following expression? $a=(x > y)?((x > z) ?x:z): ((y > z) ?y:z)$ $x=3, y=4, z=2$ $x=6, y=5, z=3$ $x=6, y=3, z=5$ $x=5, y=4, z=5$
Which combination of the integer variables $x, y,$ and $z$ makes the variable $a$ get the value $4$ in the following expression?$$a=(x y)?((x z) ?x:z): ((y z) ?y:z)$$$...
Kathleen
12.4k
views
Kathleen
asked
Sep 11, 2014
Programming in C
gatecse-2008
programming
programming-in-c
easy
+
–
28
votes
4
answers
66
GATE CSE 2008 | Question: 17
Which of the following system calls results in the sending of SYN packets? $\textsf{socket}$ $\textsf{bind}$ $\textsf{listen}$ $\textsf{connect}$
Which of the following system calls results in the sending of SYN packets?$\textsf{socket}$$\textsf{bind}$$\textsf{listen}$$\textsf{connect}$
Kathleen
15.0k
views
Kathleen
asked
Sep 11, 2014
Computer Networks
gatecse-2008
normal
computer-networks
sockets
+
–
33
votes
4
answers
67
GATE CSE 2008 | Question: 16, ISRO2016-60
A clustering index is defined on the fields which are of type non-key and ordering non-key and non-ordering key and ordering key and non-ordering
A clustering index is defined on the fields which are of typenon-key and orderingnon-key and non-orderingkey and orderingkey and non-ordering
Kathleen
13.9k
views
Kathleen
asked
Sep 11, 2014
Databases
gatecse-2008
easy
databases
indexing
isro2016
+
–
43
votes
5
answers
68
GATE CSE 2008 | Question: 15
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$? $\neg \exists t \in r \left(P\left(t\right)\right)$ $\exists t \notin r \left(P\left(t\right)\right)$ ... $\exists t \notin r \left(\neg P\left(t\right)\right)$ I only II only III only III and IV only
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$?$\neg \exists t \in r \left(P\left(t\ri...
Kathleen
13.9k
views
Kathleen
asked
Sep 11, 2014
Databases
gatecse-2008
databases
relational-calculus
normal
+
–
37
votes
8
answers
69
GATE CSE 2008 | Question: 14, ISRO2016-74
What is the maximum size of data that the application layer can pass on to the TCP layer below? Any size $2^{16}$ bytes - size of TCP header $2^{16}$ bytes $1500$ bytes
What is the maximum size of data that the application layer can pass on to the TCP layer below?Any size$2^{16}$ bytes - size of TCP header$2^{16}$ bytes$1500$ bytes
Kathleen
17.6k
views
Kathleen
asked
Sep 11, 2014
Computer Networks
gatecse-2008
easy
computer-networks
application-layer-protocols
isro2016
+
–
33
votes
5
answers
70
GATE CSE 2008 | Question: 13, ISRO2016-36
If $L$ and $\overline{L}$ are recursively enumerable then $L$ is regular context-free context-sensitive recursive
If $L$ and $\overline{L}$ are recursively enumerable then $L$ isregularcontext-freecontext-sensitiverecursive
Kathleen
11.5k
views
Kathleen
asked
Sep 11, 2014
Theory of Computation
gatecse-2008
theory-of-computation
easy
isro2016
recursive-and-recursively-enumerable-languages
+
–
41
votes
6
answers
71
GATE CSE 2008 | Question: 12
Some code optimizations are carried out on the intermediate code because They enhance the portability of the compiler to the target processor Program analysis is more accurate on intermediate code than on machine code The information from ... analysis cannot otherwise be used for optimization The information from the front end cannot otherwise be used for optimization
Some code optimizations are carried out on the intermediate code becauseThey enhance the portability of the compiler to the target processorProgram analysis is more accur...
Kathleen
14.9k
views
Kathleen
asked
Sep 11, 2014
Compiler Design
gatecse-2008
normal
code-optimization
compiler-design
+
–
59
votes
3
answers
72
GATE CSE 2008 | Question: 11
Which of the following describes a handle (as applicable to LR-parsing) appropriately? It is the position in a sentential form where the next shift or reduce operation will occur It is non-terminal whose production will be used for reduction in the ... in the next step along with a position in the sentential form where the right hand side of the production may be found
Which of the following describes a handle (as applicable to LR-parsing) appropriately?It is the position in a sentential form where the next shift or reduce operation wil...
Kathleen
13.3k
views
Kathleen
asked
Sep 11, 2014
Compiler Design
gatecse-2008
compiler-design
parsing
normal
+
–
48
votes
3
answers
73
GATE CSE 2008 | Question: 10
Which of the following are decidable? Whether the intersection of two regular languages is infinite Whether a given context-free language is regular Whether two push-down automata accept the same language Whether a given grammar is context-free I and II I and IV II and III II and IV
Which of the following are decidable?Whether the intersection of two regular languages is infiniteWhether a given context-free language is regularWhether two push-down au...
Kathleen
13.5k
views
Kathleen
asked
Sep 11, 2014
Theory of Computation
gatecse-2008
theory-of-computation
decidability
easy
+
–
29
votes
3
answers
74
GATE CSE 2008 | Question: 9
Which of the following is true for the language $\left\{ a^p \mid p \text{ is a prime } \right \}?$ It is not accepted by a Turing Machine It is regular but not context-free It is context-free but not regular It is neither regular nor context-free, but accepted by a Turing machine
Which of the following is true for the language$$\left\{ a^p \mid p \text{ is a prime } \right \}?$$It is not accepted by a Turing MachineIt is regular but not context-fr...
Kathleen
8.1k
views
Kathleen
asked
Sep 11, 2014
Theory of Computation
gatecse-2008
theory-of-computation
easy
identify-class-language
+
–
37
votes
5
answers
75
GATE CSE 2008 | Question: 8
Given $f_1$, $f_3$ and $f$ in canonical sum of products form (in decimal) for the circuit $f_1 = \Sigma m(4, 5, 6, 7, 8)$ $f_3 = \Sigma m(1, 6, 15)$ $f = \Sigma m(1, 6, 8, 15)$ then $f_2$ is $\Sigma m(4, 6)$ $\Sigma m(4, 8)$ $\Sigma m(6, 8)$ $\Sigma m(4, 6, 8)$
Given $f_1$, $f_3$ and $f$ in canonical sum of products form (in decimal) for the circuit$f_1 = \Sigma m(4, 5, 6, 7, 8)$$f_3 = \Sigma m(1, 6, 15)$$f = \Sigma m(1, 6, 8, 1...
Kathleen
9.4k
views
Kathleen
asked
Sep 11, 2014
Digital Logic
gatecse-2008
digital-logic
canonical-normal-form
easy
+
–
28
votes
6
answers
76
GATE CSE 2008 | Question: 7
The most efficient algorithm for finding the number of connected components in an undirected graph on $n$ vertices and $m$ edges has time complexity $\Theta(n)$ $\Theta(m)$ $\Theta(m+n)$ $\Theta(mn)$
The most efficient algorithm for finding the number of connected components in an undirected graph on $n$ vertices and $m$ edges has time complexity$\Theta(n)$$\Theta(m)$...
Kathleen
13.2k
views
Kathleen
asked
Sep 11, 2014
Algorithms
gatecse-2008
algorithms
graph-algorithms
time-complexity
normal
+
–
29
votes
2
answers
77
GATE CSE 2008 | Question: 6
Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$ is/are decimal $10$ decimal $11$ decimal $10$ and $11$ any value $> 2$
Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$ is/aredecimal $10$decimal $11$decimal $10$ and $11$any value ...
Kathleen
11.7k
views
Kathleen
asked
Sep 11, 2014
Digital Logic
gatecse-2008
digital-logic
number-representation
normal
+
–
26
votes
4
answers
78
GATE CSE 2008 | Question: 5
In the Karnaugh map shown below, $X$ denotes a don’t care term. What is the minimal form of the function represented by the Karnaugh map? $\bar{b}.\bar{d} + \bar{a}.\bar{d}$ $\bar{a}.\bar{b} + \bar{b}.\bar{d} + \bar{a}.b.\bar{d}$ $\bar{b}.\bar{d} + \bar{a}.b.\bar{d}$ $\bar{a}.\bar{b} + \bar{b}.\bar{d} + \bar{a}.\bar{d}$
In the Karnaugh map shown below, $X$ denotes a don’t care term. What is the minimal form of the function represented by the Karnaugh map?$\bar{b}.\bar{d} + \bar{a}.\bar...
Kathleen
7.0k
views
Kathleen
asked
Sep 11, 2014
Digital Logic
gatecse-2008
digital-logic
k-map
easy
+
–
38
votes
2
answers
79
GATE CSE 2008 | Question: 4
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds to The normalized value $2^{-127}$ The normalized value $2^{-126}$ The normalized value $+0$ The special value $+0$
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds toThe normalized value $2^{-127}$The normalized value $2^{-126}$The normal...
Kathleen
12.7k
views
Kathleen
asked
Sep 11, 2014
Digital Logic
gatecse-2008
digital-logic
floating-point-representation
ieee-representation
easy
+
–
29
votes
6
answers
80
GATE CSE 2008 | Question: 3
The following system of equations $x_1 + x_2 + 2x_3 = 1$ $x_1 + 2x_2 + 3x_3 = 2$ $x_1 + 4x_2 + αx_3 = 4$ has a unique solution. The only possible value(s) for $α$ is/are $0$ either $0$ or $1$ one of $0, 1$, or $-1$ any real number
The following system of equations$x_1 + x_2 + 2x_3 = 1$$x_1 + 2x_2 + 3x_3 = 2$$x_1 + 4x_2 + αx_3 = 4$has a unique solution. The only possible value(s) for $α$ is/are$0$...
Kathleen
9.9k
views
Kathleen
asked
Sep 11, 2014
Linear Algebra
gatecse-2008
easy
linear-algebra
system-of-equations
+
–
28
votes
8
answers
81
GATE CSE 2008 | Question: 2
If $P, Q, R$ are subsets of the universal set U, then $(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$ is $Q^c \cup R^c$ $P \cup Q^c \cup R^c$ $P^c \cup Q^c \cup R^c$ U
If $P, Q, R$ are subsets of the universal set U, then $$(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$$ is$Q^c \cup R^c$$P \cup Q^c \cup R^c$$P^c \cup Q^c \c...
Kathleen
9.2k
views
Kathleen
asked
Sep 11, 2014
Set Theory & Algebra
gatecse-2008
normal
set-theory&algebra
set-theory
+
–
25
votes
9
answers
82
GATE CSE 2008 | Question: 1
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals $1$ $-1$ $\infty$ $-\infty$
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals$1$$-1$$\infty$$-\infty$
Kathleen
10.0k
views
Kathleen
asked
Sep 11, 2014
Calculus
gatecse-2008
calculus
limits
easy
+
–
58
votes
4
answers
83
GATE CSE 2008 | Question: 50
Which of the following statements are true? Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa All $\epsilon$-productions can be removed from any context-free grammar by suitable transformations The language generated by a context-free grammar all ... trees I, II, III and IV II, III and IV only I, III and IV only I, II and IV only
Which of the following statements are true?Every left-recursive grammar can be converted to a right-recursive grammar and vice-versaAll $\epsilon$-productions can be remo...
Kathleen
13.6k
views
Kathleen
asked
Sep 11, 2014
Compiler Design
gatecse-2008
normal
compiler-design
grammar
+
–
47
votes
5
answers
84
GATE CSE 2008 | Question: 84
Consider the following C program that attempts to locate an element $x$ in an array $Y[ \ ]$ using binary search. The program is erroneous. f (int Y[10] , int x) { int i, j, k; i= 0; j = 9; do { k = (i+ j) / 2; if( Y[k] < x) i = k;else j = k; } while (Y[k] != x ... $Y$ is $[2 \ 4 \ 6 \ 8 \ 10 \ 12 \ 14 \ 16 \ 18 \ 20]$ and $ 2 < x < 20$ and $x$ is even
Consider the following C program that attempts to locate an element $x$ in an array $Y[ \ ]$ using binary search. The program is erroneous. f (int Y[10] , int x) { int i,...
Kathleen
21.1k
views
Kathleen
asked
Sep 11, 2014
Algorithms
gatecse-2008
algorithms
searching
normal
+
–
64
votes
6
answers
85
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is$2$$3$$4$$5$
Kathleen
26.2k
views
Kathleen
asked
Sep 11, 2014
Databases
gatecse-2008
databases
er-diagram
normal
+
–
67
votes
5
answers
86
GATE CSE 2008 | Question: 70
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$ ... -level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$. The file is ordered on a non-key field, and the...
ABG
23.5k
views
ABG
asked
Sep 2, 2014
Databases
gatecse-2008
databases
indexing
normal
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register