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
Recent activity by done
8
answers
1
GATE CSE 2009 | Question: 55
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... of all suppliers who have supplied only non-blue part. Find the names of all suppliers who have not supplied only blue parts.
Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...
38.6k
views
commented
Jan 14, 2016
Databases
gatecse-2009
databases
sql
normal
+
–
8
answers
2
GATE CSE 1999 | Question: 2.21
If $T_1 = O(1)$, give the correct matching for the following pairs: $\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(N) $T_n = T_{n/2} + n$} & \text{(V) $T_n = O(n \log n)$ ... $\text{M-W, N-U, O-X, P-V}$ $\text{M-V, N-W, O-X, P-U}$ $\text{M-W, N-U, O-V, P-X}$
If $T_1 = O(1)$, give the correct matching for the following pairs:$$\begin{array}{l|l}\hline \text{(M) $T_n = T_{n-1} + n$} & \text{(U) $T_n = O(n)$} \\\hline \text{(...
15.1k
views
commented
Dec 3, 2015
Algorithms
gate1999
algorithms
recurrence-relation
asymptotic-notation
normal
match-the-following
+
–
2
answers
3
GATE CSE 2009 | Question: 53
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the ... $\text{expr2} = \max\left(l\left(i-1, j-1\right), l\left(i,j\right)\right)$
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths ...
9.3k
views
commented
Dec 2, 2015
Algorithms
gatecse-2009
algorithms
normal
dynamic-programming
recursion
+
–
1
answer
4
GATE IT 2004 | Question: 33
Let $X$ and $Y$ be two exponentially distributed and independent random variables with mean $α$ and $β$, respectively. If $Z$ = min $(X, Y)$, then the mean of $Z$ is given by $\left(\dfrac{1}{\alpha + \beta}\right)$ $\min (\alpha, \beta)$ $\left(\dfrac{\alpha\beta}{\alpha + \beta}\right)$ $\alpha + \beta$
Let $X$ and $Y$ be two exponentially distributed and independent random variables with mean $α$ and $β$, respectively. If $Z$ = min $(X, Y)$, then the mean of $Z$ is gi...
17.0k
views
commented
Nov 3, 2015
Probability
gateit-2004
probability
exponential-distribution
random-variable
normal
+
–
2
answers
5
Find the number of minimal candidate keys of R?
1.8k
views
comment edited
Feb 19, 2015
Databases
databases
+
–
5
answers
6
GATE CSE 2015 Set 2 | Question: 13
Which of the following statements is NOT correct about HTTP cookies? A cookie is a piece of code that has the potential to compromise the security of an Internet user A cookie gains entry to the user's work area through an HTTP header A cookie has an expiry date and time Cookies can be used to track the browsing pattern of a user at a particular site
Which of the following statements is NOT correct about HTTP cookies?A cookie is a piece of code that has the potential to compromise the security of an Internet userA coo...
8.1k
views
commented
Feb 12, 2015
Web Technologies
gatecse-2015-set2
web-technologies
easy
+
–
11
answers
7
GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true?There exis...
21.1k
views
commented
Feb 5, 2015
Calculus
gatecse-2014-set1
calculus
continuity
normal
+
–
14
answers
8
GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level...
76.7k
views
comment edited
Jan 29, 2015
Operating System
gatecse-2008
operating-system
virtual-memory
normal
+
–
3
answers
9
Consider 3 transactions T1, T2 and T3 having 2, 3 and 4 operations respectively.
Consider $3$ transactions $T_1, T_2$ and $T_3$ having $2, 3$ and $4$ operations respectively. Find the number of concurrent schedules?
Consider $3$ transactions $T_1, T_2$ and $T_3$ having $2, 3$ and $4$ operations respectively. Find the number of concurrent schedules?
18.1k
views
answered
Jan 29, 2015
Databases
transaction-and-concurrency
databases
+
–
8
answers
10
GATE CSE 2010 | Question: 48
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ ... $L1$ cache. What is the time taken for this transfer? $2$ nanoseconds $20$ nanoseconds $22$ nanoseconds $88$ nanoseconds
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cac...
42.7k
views
commented
Jan 24, 2015
CO and Architecture
gatecse-2010
co-and-architecture
cache-memory
normal
barc2017
+
–
19
answers
11
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...
63.8k
views
commented
Jan 22, 2015
CO and Architecture
gatecse-2004
co-and-architecture
virtual-memory
normal
+
–
1
answer
12
plz answer..
848
views
commented
Dec 10, 2014
2
answers
13
Minimum no of states
Minimal finite automata that accepts all strings of a and b where the nth input symbol from right hand side is 'a' a) 2n b)2n c) n d) n+2
Minimal finite automata that accepts all strings of a and b where the nth input symbol from right hand side is 'a'a) 2n b)2n c) n d) n+2
604
views
comment edited
Dec 9, 2014
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register