search
Log In

Questions by Madhav

91 votes
16 answers
1
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 $\textit{write}$ operation 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 ______
asked Feb 14, 2017 in Databases 36k views
34 votes
7 answers
2
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)$
asked Feb 14, 2017 in Algorithms 9.2k views
32 votes
6 answers
3
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 _______
asked Feb 14, 2017 in Linear Algebra 6.7k views
27 votes
5 answers
4
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 \}$ $L_4 = \{ a^n b^n \mid n \geq 1\}$ Which of the ... $L_2$ is 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
asked Feb 14, 2017 in Theory of Computation 4.7k views
26 votes
9 answers
5
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 _______
asked Feb 14, 2017 in CO and Architecture 5.3k views
29 votes
4 answers
6
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 regular expression $R$ and a ... $w$, is $w \in L(M)$? I and IV only II and III only II, III and IV only III and IV only
asked Feb 14, 2017 in Theory of Computation 5.1k views
59 votes
2 answers
7
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 time (in nanoseconds)}& \text{Hit ratio} \\\hline \text{$ ... are for instruction fetch and $40$% are for memory operand fetch. The average read access time in nanoseconds (up to $2$ decimal places) is _________
asked Feb 14, 2017 in CO and Architecture 15.5k views
33 votes
8 answers
8
$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 _________ .
asked Feb 14, 2017 in Graph Theory 8.2k views
33 votes
5 answers
9
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}$
asked Feb 14, 2017 in Compiler Design 5.4k views
26 votes
5 answers
10
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$ B , then the maximum order of the B+ Tree is ____
asked Feb 14, 2017 in Databases 5.9k views
29 votes
3 answers
11
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 ______
asked Feb 14, 2017 in Operating System 6k views
21 votes
5 answers
12
Consider two hosts $X$ and $Y$, connected by a single direct link of rate $10^6 \hspace{0.1cm} bits/sec$. The distance between the two hosts is $10,000 \hspace{0.1cm} km$ and the propagation speed along the link is $2 \times 10^8 \hspace{0.1cm} m/sec$. Host $X$ ... value of $p$ and $q$ are $p=50$ and $q=100$ $p=50$ and $q=400$ $p=100$ and $q=50$ $p=400$ and $q=50$
asked Feb 14, 2017 in Computer Networks 4k views
51 votes
9 answers
13
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 _______
asked Feb 14, 2017 in Programming 13.8k views
35 votes
9 answers
14
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)$
asked Feb 14, 2017 in Algorithms 9.3k views
21 votes
7 answers
15
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 ______
asked Feb 14, 2017 in Programming 5.2k views
17 votes
2 answers
16
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}$
asked Feb 14, 2017 in Calculus 4k views
23 votes
9 answers
17
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. Which of the ... rear node points to the front node. (I) only. (II) only. Both (I) and (II). Neither (I) nor (II).
asked Feb 14, 2017 in DS 13.7k views
24 votes
13 answers
18
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$
asked Feb 14, 2017 in Programming 4.2k views
22 votes
6 answers
19
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
asked Feb 14, 2017 in Operating System 5.7k views
45 votes
5 answers
20
Consider the following tables $T1$ and $T2.$ ... cascade. In order to delete record $\langle 3, 8 \rangle$ from the table $T1,$ the number of additional records that need to be deleted from table $T1$ is _______
asked Feb 14, 2017 in Databases 9.5k views
...