Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Madhav
150
votes
18
answers
1
GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
Two transactions $T_1$ and $T_2$ are given as$T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$$T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$where $r_i(V)$ denotes a $\textit{read}$ operation by transaction...
72.7k
views
asked
Feb 14, 2017
Databases
gatecse-2017-set2
databases
transaction-and-concurrency
numerical-answers
conflict-serializable
+
–
47
votes
6
answers
2
GATE CSE 2017 Set 2 | Question: 30
Consider the recurrence function $T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$ Then $T(n)$ in terms of $\Theta$ notation is $\Theta(\log \log n)$ $\Theta( \log n)$ $\Theta (\sqrt{n})$ $\Theta(n)$
Consider the recurrence function$$T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$$Then $T(n)$ in terms of $\Theta$ notation is$\Theta(\log \l...
17.9k
views
asked
Feb 14, 2017
Algorithms
gatecse-2017-set2
algorithms
recurrence-relation
+
–
47
votes
8
answers
3
GATE CSE 2017 Set 2 | Question: 52
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is $2,$ then the largest among the absolute values of the eigenvalues of $M$ is _______
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \ma...
15.6k
views
asked
Feb 14, 2017
Linear Algebra
gatecse-2017-set2
engineering-mathematics
linear-algebra
numerical-answers
eigen-value
+
–
36
votes
4
answers
4
GATE CSE 2017 Set 2 | Question: 40
Consider the following languages. $L_1 = \{a^p \mid p \text{ is a prime number} \}$ $L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$ $L_3 = \{a^n b^n c^{2n} \mid n \geq 0 \}$ ... not context free $L_3$ is not context free but recursive $L_4$ is deterministic context free I, II and IV only II and III only I and IV only III and IV only
Consider the following languages.$L_1 = \{a^p \mid p \text{ is a prime number} \}$$L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$$L_3 = \{a^n b^n c^{2n} \mid n \geq 0 ...
9.0k
views
asked
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
identify-class-language
+
–
29
votes
8
answers
5
GATE CSE 2017 Set 2 | Question: 53
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size $32$ bytes. Assume that a direct mapped cache having $512$ cache lines is used with this machine. The size of the tag field in bits is _______
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size $32$ bytes. Assume that a direct mapped cache having $512$ cache line...
9.5k
views
asked
Feb 14, 2017
CO and Architecture
gatecse-2017-set2
co-and-architecture
cache-memory
numerical-answers
+
–
33
votes
3
answers
6
GATE CSE 2017 Set 2 | Question: 41
Let $L(R)$ be the language represented by regular expression $R$. Let $L(G)$ be the language generated by a context free grammar $G$. Let $L(M)$ be the language accepted by a Turing machine $M$. Which of the following decision problems are undecidable? Given a ... string $w$, is $w \in L(M)$? I and IV only II and III only II, III and IV only III and IV only
Let $L(R)$ be the language represented by regular expression $R$. Let $L(G)$ be the language generated by a context free grammar $G$. Let $L(M)$ be the language accepted ...
8.6k
views
asked
Feb 14, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
decidability
+
–
78
votes
5
answers
7
GATE CSE 2017 Set 2 | Question: 45
The read access times and the hit ratios for different caches in a memory hierarchy are as given below: ... and $40\%$ are for memory operand fetch. The average read access time in nanoseconds (up to $2$ decimal places) is _________
The read access times and the hit ratios for different caches in a memory hierarchy are as given below:$$\begin{array}{|l|c|c|} \hline \text {Cache} & \text{Read access ...
30.0k
views
asked
Feb 14, 2017
CO and Architecture
gatecse-2017-set2
co-and-architecture
cache-memory
numerical-answers
+
–
44
votes
9
answers
8
GATE CSE 2017 Set 2 | Question: 23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
17.6k
views
asked
Feb 14, 2017
Graph Theory
gatecse-2017-set2
graph-theory
numerical-answers
degree-of-graph
+
–
39
votes
5
answers
9
GATE CSE 2017 Set 2 | Question: 05
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it: ... $\text{P-iii; Q-iv; R-i; S-ii}$ $\text{P-i; Q-iv; R-ii; S-iii}$
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it:$$\begin{array}{|l|l|}\hline \text{P. Syntax t...
9.6k
views
asked
Feb 14, 2017
Compiler Design
gatecse-2017-set2
compiler-design
match-the-following
compilation-phases
easy
+
–
31
votes
5
answers
10
GATE CSE 2017 Set 2 | Question: 49
In a B+ Tree , if the search-key value is $8$ bytes long , the block size is $512$ bytes and the pointer size is $2\;\text{B}$ , then the maximum order of the B+ Tree is ____
In a B+ Tree , if the search-key value is $8$ bytes long , the block size is $512$ bytes and the pointer size is $2\;\text{B}$ , then the maximum order of the B+ Tree is ...
11.0k
views
asked
Feb 14, 2017
Databases
gatecse-2017-set2
databases
b-tree
numerical-answers
normal
+
–
36
votes
3
answers
11
GATE CSE 2017 Set 2 | Question: 51
Consider the set of process with arrival time (in milliseonds), CPU burst time (in millisecods) and priority ($0$ ... The average waiting time (in milli seconds) of all the process using premtive priority scheduling algorithm is ______
Consider the set of process with arrival time (in milliseonds), CPU burst time (in millisecods) and priority ($0$ is the highest priority) shown below. None of the proce...
13.1k
views
asked
Feb 14, 2017
Operating System
gatecse-2017-set2
operating-system
process-scheduling
numerical-answers
+
–
21
votes
5
answers
12
GATE CSE 2017 Set 2 | Question: 35
Consider two hosts $X$ and $Y$, connected by a single direct link of rate $10^6\; \text{bits/sec}$. The distance between the two hosts is $10,000\;\text{km}$ and the propagation speed along the link is $2 \times 10^8 \;\text{m/sec}$. Host $X$ ... $p$ and $q$ are $p=50$ and $q=100$ $p=50$ and $q=400$ $p=100$ and $q=50$ $p=400$ and $q=50$
Consider two hosts $X$ and $Y$, connected by a single direct link of rate $10^6\; \text{bits/sec}$. The distance between the two hosts is $10,000\;\text{km}$ and the prop...
8.1k
views
asked
Feb 14, 2017
Computer Networks
gatecse-2017-set2
computer-networks
network-flow
+
–
70
votes
13
answers
13
GATE CSE 2017 Set 2 | Question: 55
Consider the following C program. #include<stdio.h> #include<string.h> int main() { char* c="GATECSIT2017"; char* p=c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; } The output of the program is _______
Consider the following C program.#include<stdio.h #include<string.h int main() { char* c="GATECSIT2017"; char* p=c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; }T...
27.9k
views
asked
Feb 14, 2017
Programming in C
gatecse-2017-set2
programming-in-c
numerical-answers
array
pointers
+
–
50
votes
7
answers
14
GATE CSE 2017 Set 2 | Question: 38
Consider the following C function int fun(int n) { int i, j; for(i=1; i<=n; i++) { for (j=1; j<n; j+=i) { printf("%d %d", i, j); } } } Time complexity of $fun$ in terms of $\Theta$ notation is $\Theta(n \sqrt{n})$ $\Theta(n^2)$ $\Theta(n \: \log n)$ $\Theta(n^2 \log n)$
Consider the following C functionint fun(int n) { int i, j; for(i=1; i<=n; i++) { for (j=1; j<n; j+=i) { printf("%d %d", i, j); } } }Time complexity of $fun$ in terms of ...
24.8k
views
asked
Feb 14, 2017
Algorithms
gatecse-2017-set2
algorithms
time-complexity
+
–
25
votes
7
answers
15
GATE CSE 2017 Set 2 | Question: 54
Consider the following C program. #include<stdio.h> int main () { int m=10; int n, n1; n=++m; n1=m++; n--; --n1; n-=n1; printf(“%d”, n); return 0; } The output of the program is ______
Consider the following C program.#include<stdio.h int main () { int m=10; int n, n1; n=++m; n1=m++; n ; n1; n-=n1; printf(“%d”, n); return 0; }The output of the prog...
12.0k
views
asked
Feb 14, 2017
Programming in C
gatecse-2017-set2
programming-in-c
numerical-answers
easy
+
–
27
votes
2
answers
16
GATE CSE 2017 Set 2 | Question: 10
If $f(x) = R \: \sin ( \frac{\pi x}{2}) + S, f’\left(\frac{1}{2}\right) = \sqrt{2}$ and $\int_0^1 f(x) dx = \frac{2R}{\pi}$, then the constants $R$ and $S$ are $\frac{2}{\pi}$ and $\frac{16}{\pi}$ $\frac{2}{\pi}$ and 0 $\frac{4}{\pi}$ and 0 $\frac{4}{\pi}$ and $\frac{16}{\pi}$
If $f(x) = R \: \sin ( \frac{\pi x}{2}) + S, f’\left(\frac{1}{2}\right) = \sqrt{2}$ and $\int_0^1 f(x) dx = \frac{2R}{\pi}$, then the constants $R$ and $S$ are$\frac{2}...
8.6k
views
asked
Feb 14, 2017
Calculus
gatecse-2017-set2
engineering-mathematics
calculus
differentiation
+
–
35
votes
11
answers
17
GATE CSE 2017 Set 2 | Question: 13
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively ... to the front node. (I) only. (II) only. Both (I) and (II). Neither (I) nor (II).
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly t...
27.6k
views
asked
Feb 14, 2017
DS
gatecse-2017-set2
data-structures
queue
+
–
30
votes
11
answers
18
GATE CSE 2017 Set 2 | Question: 14
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking $printxy(1,1)$ is: $0, 0$ $0, 1$ $1, 0$ $1, 1$
Consider the following function implemented in C:void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); }The output of invoking $...
9.7k
views
asked
Feb 14, 2017
Programming in C
gatecse-2017-set2
programming-in-c
identify-function
pointers
+
–
30
votes
5
answers
19
GATE CSE 2017 Set 2 | Question: 07
Which of the following is/are shared by all the threads in a process? Program counter Stack Address space Registers (I) and (II) only (III) only (IV) only (III) and (IV) only
Which of the following is/are shared by all the threads in a process?Program counterStackAddress spaceRegisters(I) and (II) only(III) only(IV) only(III) and (IV) only
11.9k
views
asked
Feb 14, 2017
Operating System
gatecse-2017-set2
operating-system
threads
+
–
62
votes
6
answers
20
GATE CSE 2017 Set 2 | Question: 19
Consider the following tables $T1$ and $T2.$ ... delete record $\langle 3, 8 \rangle$ from the table $T1,$ the number of additional records that need to be deleted from table $T1$ is _______
Consider the following tables $T1$ and $T2.$$$\overset{T1}{\begin{array}{|c|c|c|} \hline \textbf {P} & \textbf {Q} \\\hline \text {2} & \text{2 }\\\hline \text{3} & \te...
18.4k
views
asked
Feb 14, 2017
Databases
gatecse-2017-set2
databases
numerical-answers
referential-integrity
normal
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register