Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Previous GATE Questions
106
votes
7
answers
3181
GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...
kanikool
37.1k
views
kanikool
asked
Sep 10, 2014
Operating System
gatecse-2013
operating-system
virtual-memory
normal
+
–
57
votes
1
answer
3182
GATE CSE 1999 | Question: 1.6
Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true? $L_1 = L_2$ $L_1 \supset L_2$ $L_1 \subset L_2$ None
Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true?$L_1 = L...
Keith Kr
21.8k
views
Keith Kr
asked
Sep 10, 2014
Theory of Computation
normal
theory-of-computation
gate1999
pushdown-automata
+
–
45
votes
3
answers
3183
GATE CSE 2003 | Question: 52
Consider two languages $L_1$ and $L_2$ each on the alphabet $\Sigma$. Let $f : \Sigma^* \to \Sigma^*$ be a polynomial time computable bijection such that $(\forall x) [ x\in L_1$ iff $f(x) \in L_2]$. Further, let $f^{-1}$ be also polynomial ... $\in NP$ and $L_2$ $\in P$ $L_1$ is undecidable and $L_2$ is decidable $L_1$ is recursively enumerable and $L_2$ is recursive
Consider two languages $L_1$ and $L_2$ each on the alphabet $\Sigma$. Let $f : \Sigma^* \to \Sigma^*$ be a polynomial time computable bijection such that $(\forall x) [ x...
Arjun
8.4k
views
Arjun
asked
Sep 8, 2014
Theory of Computation
gatecse-2003
theory-of-computation
normal
decidability
+
–
70
votes
4
answers
3184
GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
Define languages $L_0$ and $L_1$ as follows :$L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $$L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts o...
Arjun
23.9k
views
Arjun
asked
Sep 8, 2014
Theory of Computation
theory-of-computation
turing-machine
gatecse-2003
difficult
+
–
96
votes
9
answers
3185
GATE CSE 2013 | Question: 45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
Consider an instruction pipeline with five stages without any branch prediction:Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (...
Kriss Singh
47.5k
views
Kriss Singh
asked
Sep 5, 2014
CO and Architecture
gatecse-2013
normal
co-and-architecture
pipelining
+
–
129
votes
19
answers
3186
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...
gatecse
62.9k
views
gatecse
asked
Sep 5, 2014
CO and Architecture
gatecse-2004
co-and-architecture
virtual-memory
normal
+
–
26
votes
2
answers
3187
GATE CSE 1994 | Question: 1.20
In which of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods? Passing a constant value as a parameter Passing the address of an array as a parameter Passing an array element as a parameter Passing an array
In which of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods?Passing a constant value as a ...
Keith Kr
10.0k
views
Keith Kr
asked
Sep 4, 2014
Programming in C
gate1994
programming
parameter-passing
easy
+
–
58
votes
3
answers
3188
GATE CSE 2005 | Question: 62
Consider the following circuit involving a positive edge triggered D FF. Consider the following timing diagram. Let $A_{i}$ represents the logic level on the line $A$ in the $i$-th clock period. Let $A'$ represent the complement of $A$. The correct output sequence on $Y$ over the ... $A_{1} A_{2}' A_{3} A_{4} A_{5}'$
Consider the following circuit involving a positive edge triggered D FF.Consider the following timing diagram. Let $A_{i}$ represents the logic level on the line $A$ in t...
Isha Karn
17.0k
views
Isha Karn
asked
Sep 3, 2014
Digital Logic
gatecse-2005
digital-logic
circuit-output
normal
+
–
1
votes
1
answer
3189
GATE CSE 1993 | Question: 01.5
Fourier series of the periodic function (period 2π) defined by ... $\frac{{\pi }^2 }{4}$ $\frac{{\pi }^2 }{6}$ $\frac{{\pi }^2 }{8}$ $\frac{{\pi }^2 }{12}$
Fourier series of the periodic function (period 2π) defined by$$f(x) = \begin{cases} 0, -p < x < 0\\x, 0 < x < p \end{cases} \text { is }\\ \frac{\pi}{4} + \sum \left [ ...
srinath
2.7k
views
srinath
asked
Sep 2, 2014
Calculus
gate1993
calculus
normal
out-of-gate-syllabus
multiple-selects
+
–
67
votes
5
answers
3190
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
+
–
106
votes
8
answers
3191
GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...
Nishant T-rex
23.9k
views
Nishant T-rex
asked
Sep 2, 2014
Algorithms
gatecse-2003
algorithms
time-complexity
normal
+
–
78
votes
6
answers
3192
GATE CSE 1992 | Question: 92,xv
Which of the following predicate calculus statements is/are valid? $(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$ $(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x))$ ... $(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x)$
Which of the following predicate calculus statements is/are valid?$(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$$(\exists (x)) P(x) \w...
Arjun
16.3k
views
Arjun
asked
Sep 2, 2014
Mathematical Logic
gate1992
mathematical-logic
normal
first-order-logic
+
–
79
votes
5
answers
3193
GATE CSE 2007 | Question: 25
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $I$ is the $4 \times 4$ identity matrix? $-5$ $-7$ $2$ $1$
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $...
priya
16.5k
views
priya
asked
Sep 2, 2014
Linear Algebra
gatecse-2007
eigen-value
linear-algebra
difficult
+
–
57
votes
4
answers
3194
GATE CSE 2003 | Question: 15
If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true? $L$ is necessarily finite $L$ is regular but not necessarily finite $L$ is context free but not necessarily regular $L$ is recursive but not necessarily context-free
If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true?$L$ is necessarily fin...
gauravsachan9188
15.4k
views
gauravsachan9188
asked
Aug 24, 2014
Theory of Computation
theory-of-computation
gatecse-2003
normal
recursive-and-recursively-enumerable-languages
+
–
45
votes
3
answers
3195
GATE CSE 2013 | Question: 47
Which one of the following is NOT logically equivalent to $¬∃x(∀ y (α)∧∀z(β ))$ ? $∀ x(∃ z(¬β )→∀ y(α))$ $∀x(∀ z(β )→∃ y(¬α))$ $∀x(∀ y(α)→∃z(¬β ))$ $∀x(∃ y(¬α)→∃z(¬β ))$
Which one of the following is NOT logically equivalent to $¬∃x(∀ y (α)∧∀z(β ))$ ?$∀ x(∃ z(¬β )→∀ y(α))$$∀x(∀ z(β )→∃ y(¬α))$$∀x(∀ y(�...
gatecse
11.8k
views
gatecse
asked
Aug 21, 2014
Mathematical Logic
mathematical-logic
normal
marks-to-all
gatecse-2013
first-order-logic
+
–
31
votes
2
answers
3196
GATE CSE 2013 | Question: 2
Suppose $p$ is the number of cars per minute passing through a certain road junction between $5$ PM and $6$ PM, and $p$ has a Poisson distribution with mean $3$. What is the probability of observing fewer than $3$ cars during any given minute in this interval? $\dfrac{8}{(2e^{3})}$ $\dfrac{9}{(2e^{3})}$ $\dfrac{17}{(2e^{3})}$ $\dfrac{26}{(2e^{3})}$
Suppose $p$ is the number of cars per minute passing through a certain road junction between $5$ PM and $6$ PM, and $p$ has a Poisson distribution with mean $3$. What is ...
gatecse
8.9k
views
gatecse
asked
Aug 7, 2014
Probability
gatecse-2013
probability
poisson-distribution
normal
+
–
80
votes
9
answers
3197
GATE CSE 2013 | Question: 44
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter.MultiDequeue(Q){ m = k while (Q is not empty) and (m...
gatecse
31.0k
views
gatecse
asked
Aug 7, 2014
DS
gatecse-2013
data-structures
algorithms
normal
queue
+
–
73
votes
2
answers
3198
GATE CSE 2013 | Question: 42
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x,c) * x; }
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second ...
gatecse
21.0k
views
gatecse
asked
Aug 7, 2014
Programming in C
gatecse-2013
compiler-design
normal
marks-to-all
numerical-answers
parameter-passing
runtime-environment
+
–
33
votes
3
answers
3199
GATE CSE 2013 | Question: 1
A binary operation $\oplus$ on a set of integers is defined as $x \oplus y = x^{2}+y^{2}$. Which one of the following statements is TRUE about $\oplus$? Commutative but not associative Both commutative and associative Associative but not commutative Neither commutative nor associative
A binary operation $\oplus$ on a set of integers is defined as $x \oplus y = x^{2}+y^{2}$. Which one of the following statements is TRUE about $\oplus$?Commutative but no...
gatecse
7.5k
views
gatecse
asked
Aug 7, 2014
Set Theory & Algebra
gatecse-2013
set-theory&algebra
easy
binary-operation
+
–
12
votes
3
answers
3200
GATE CSE 2014 Set 1 | Question: GA-1
Which of the following options is the closest in meaning to the phrase in bold in the sentence below? It is fascinating to see life forms cope with varied environmental conditions. Adopt to Adapt to Adept in Accept with
Which of the following options is the closest in meaning to the phrase in bold in thesentence below?It is fascinating to see life forms cope with varied environmental con...
gatecse
3.1k
views
gatecse
asked
Aug 6, 2014
Verbal Aptitude
verbal-aptitude
gatecse-2014-set1
meaning
easy
+
–
Page:
« prev
1
...
150
151
152
153
154
155
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register