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 itsvkp1
10
answers
1
GATE CSE 2016 Set 1 | Question: 27
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
29.3k
views
commented
Apr 3, 2018
Combinatory
gatecse-2016-set1
combinatory
recurrence-relation
normal
numerical-answers
+
–
8
answers
2
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.5k
views
commented
Dec 21, 2017
Databases
gatecse-2009
databases
sql
normal
+
–
4
answers
3
GATE CSE 2015 Set 2 | Question: 44
Consider the sequence of machine instruction given below: ... forwarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the above sequence of instruction is _________.
Consider the sequence of machine instruction given below:$$\begin{array}{ll} \text{MUL} & \text{R5, R0, R1} \\ \text{DIV} & \text{R6, R2, R3} \\ \text{ADD} & \text{R7,...
26.4k
views
commented
Dec 5, 2017
CO and Architecture
gatecse-2015-set2
co-and-architecture
pipelining
normal
numerical-answers
+
–
2
answers
4
GATE CSE 2008 | Question: 36
Which of the following are NOT true in a pipelined processor? Bypassing can handle all RAW hazards Register renaming can eliminate all register carried WAR hazards Control hazard penalties can be eliminated by dynamic branch prediction I and II only I and III only II and III only I, II and III
Which of the following are NOT true in a pipelined processor?Bypassing can handle all RAW hazardsRegister renaming can eliminate all register carried WAR hazardsControl h...
22.1k
views
commented
Dec 5, 2017
CO and Architecture
gatecse-2008
pipelining
co-and-architecture
normal
+
–
5
answers
5
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
commented
Dec 4, 2017
CO and Architecture
gatecse-2017-set2
co-and-architecture
cache-memory
numerical-answers
+
–
0
answers
6
cache
what is cache hit time and what is cache hit latency ? are they both same ?
what is cache hit time and what is cache hit latency ? are they both same ?
293
views
commented
Dec 3, 2017
CO and Architecture
cache-memory
co-and-architecture
+
–
5
answers
7
GATE CSE 2001 | Question: 1.7, ISRO2008-18
More than one word are put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the above
More than one word are put in one cache block to:exploit the temporal locality of reference in a programexploit the spatial locality of reference in a programreduce the m...
17.0k
views
commented
Dec 3, 2017
CO and Architecture
gatecse-2001
co-and-architecture
easy
cache-memory
isro2008
+
–
3
answers
8
TIFR CSE 2012 | Part B | Question: 10
Consider the blocked-set semaphore where the signaling process awakens any one of the suspended process; i.e., Wait (S): If $S>0$ then $S\leftarrow S - 1$, else suspend the execution of this process. Signal (S): If there are ... exclusion, but allows starvation for any $N\geq 2$ The program achieves mutual exclusion and starvation freedom for any $N\geq 1$
Consider the blocked-set semaphore where the signaling process awakens any one of the suspended process; i.e.,Wait (S): If $S>0$ then $S\leftarrow S - 1$, else suspend th...
3.6k
views
comment edited
Nov 19, 2017
Operating System
tifr2012
operating-system
process-synchronization
semaphore
+
–
6
answers
9
GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...
13.4k
views
commented
Nov 19, 2017
Operating System
gateit-2004
operating-system
normal
deadlock-prevention-avoidance-detection
+
–
5
answers
10
GATE CSE 2000 | Question: 2.22
Suppose the time to service a page fault is on the average $10$ milliseconds, while a memory access takes $1$ microsecond. Then a $99.99\%$ hit ratio results in average memory access time of $1.9999$ milliseconds $1$ millisecond $9.999$ microseconds $1.9999$ microseconds
Suppose the time to service a page fault is on the average $10$ milliseconds, while a memory access takes $1$ microsecond. Then a $99.99\%$ hit ratio results in average m...
18.3k
views
commented
Nov 14, 2017
Operating System
gatecse-2000
operating-system
easy
virtual-memory
+
–
2
answers
11
GATE CSE 2012 | Question: 41
A file system with $300$ GByte disk uses a file descriptor with $8$ direct block addresses, $1$ indirect block address and $1$ doubly indirect block address. The size of each disk block is $128$ Bytes and the size of each disk block address is $8$ Bytes. ... file size in this file system is $3$ KBytes $35$ KBytes $280$ KBytes dependent on the size of the disk
A file system with $300$ GByte disk uses a file descriptor with $8$ direct block addresses, $1$ indirect block address and $1$ doubly indirect block address. The size of ...
21.0k
views
commented
Nov 14, 2017
Operating System
gatecse-2012
operating-system
disk
normal
+
–
2
answers
12
GATE CSE 2001 | Question: 1.22
Which of the following requires a device driver? Register Cache Main memory Disk
Which of the following requires a device driver?RegisterCacheMain memoryDisk
10.5k
views
commented
Nov 13, 2017
Operating System
gatecse-2001
operating-system
disk
easy
+
–
0
answers
13
#PROBABILITY
Is there any relation between independent events and mutually exclusive events?
Is there any relation between independent events and mutually exclusive events?
291
views
commented
Nov 13, 2017
Probability
probability
+
–
2
answers
14
GATE CSE 1996 | Question: 1.21
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is $256 \times 16$ $64 K \times 8$ $4 K \times 16$ $64 K \times 16$
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is$256 \times 16$$64 K \times 8$$4 K \times 16$$64 K \times...
18.6k
views
commented
Nov 8, 2017
Digital Logic
gate1996
digital-logic
normal
rom
+
–
3
answers
15
GATE CSE 1993 | Question: 6.5
Convert the following numbers in the given bases into their equivalents in the desired bases: $(110.101)_{2} = (x)_{10} $ $(1118)_{10} = (y)_{H}$
Convert the following numbers in the given bases into their equivalents in the desired bases:$(110.101)_{2} = (x)_{10} $$(1118)_{10} = (y)_{H}$
3.0k
views
commented
Nov 7, 2017
Digital Logic
gate1993
digital-logic
number-representation
normal
descriptive
+
–
4
answers
16
lexical error
if there is miss spelling in some keyword in a program then this misspelled keyword will be treated as lexical errors or it will be treated as a new identifier and accepted as a token ?? ex - whiel (1) ; here while is misspelled as whiel
if there is miss spelling in some keyword in a program then this misspelled keyword will be treated as lexical errors or it will be treated as a new identifier and accept...
3.3k
views
commented
Nov 2, 2017
Compiler Design
lexical-analysis
compiler-design
compiler-tokenization
+
–
5
answers
17
TIFR CSE 2015 | Part B | Question: 15
Consider the following grammar (the start symbol is $E$) for generating expressions. $E \rightarrow T - E \mid T + E \mid T$ $T \rightarrow T * F \mid F$ $F \rightarrow 0 \mid1\mid 2\mid 3\mid 4\mid 5\mid 6\mid 7\mid 8\mid 9$ With respect to this grammar, which of the following trees is the valid evaluation tree for the expression $2*3*4 - 5*6+7$?
Consider the following grammar (the start symbol is $E$) for generating expressions.$E \rightarrow T - E \mid T + E \mid T$$T \rightarrow T * F \mid F$$F \rightarrow 0 \m...
3.0k
views
commented
Nov 1, 2017
Compiler Design
tifr2015
parsing
expression-evaluation
+
–
3
answers
18
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$
Consider a grammar with the following productions$S \rightarrow a \alpha b \mid b \alpha c \mid aB$$S \rightarrow \alpha S\mid b$$S \rightarrow \alpha b b\mid ab$$...
18.2k
views
commented
Oct 30, 2017
Compiler Design
gate1995
compiler-design
grammar
normal
+
–
5
answers
19
GATE CSE 1997 | Question: 4.7
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by the implementation. POP is implemented as ... For a sequence of operations, the keys chosen are in non-increasing order non-decreasing order strictly increasing order strictly decreasing order
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by ...
24.5k
views
commented
Oct 28, 2017
DS
gate1997
data-structures
stack
normal
priority-queue
+
–
6
answers
20
GATE CSE 2012 | Question: 35
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, $REAR = FRONT = 0$. The conditions to detect ... : $(REAR+1) \mod n == FRONT$ full: $(FRONT+1) \mod n == REAR$ empty: $REAR == FRONT$
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out u...
24.2k
views
commented
Oct 27, 2017
DS
gatecse-2012
data-structures
queue
normal
+
–
4
answers
21
TIFR CSE 2015 | Part B | Question: 4
First, consider the tree on the left. On the right, the nine nodes of the tree have been assigned numbers from the set $\left\{1, 2,\ldots,9\right\}$ so that for every node, the numbers in its left subtree and right subtree lie in disjoint intervals (that is, all numbers in one subtree ... $2^{4}.3^{2}.5.9=6480$ $2^{3}.3.5.9=1080$ $2^{4}=16$ $2^{3}.3^{3}=216$
First, consider the tree on the left. On the right, the nine nodes of the tree have been assigned numbers from the set $\left\{1, 2,\ldots,9\right\}$ so that for every ...
4.1k
views
answered
Oct 26, 2017
DS
tifr2015
binary-tree
combinatory
+
–
2
answers
22
GATE CSE 1991 | Question: 14,c
Consider the binary tree in the figure below: Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the structures. What is the worst-case time complexity of your procedure?
Consider the binary tree in the figure below:Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the stru...
3.0k
views
commented
Oct 25, 2017
DS
gate1991
normal
data-structures
binary-tree
time-complexity
descriptive
+
–
3
answers
23
GATE CSE 1991 | Question: 14,b
Consider the binary tree in the figure below: Give different steps for deleting the node with key $5$ so that the structure is preserved.
Consider the binary tree in the figure below:Give different steps for deleting the node with key $5$ so that the structure is preserved.
3.5k
views
commented
Oct 25, 2017
DS
gate1991
data-structures
binary-tree
normal
descriptive
+
–
2
answers
24
GATE CSE 2011 | Question: 22
What does the following fragment of C program print? char c[] = "GATE2011"; char *p = c; printf("%s", p + p[3] - p[1]); $\text{GATE2011}$ $\text{E2011}$ $2011$ $011$
What does the following fragment of C program print?char c[] = "GATE2011"; char *p = c; printf("%s", p + p[3] - p );$\text{GATE2011}$$\text{E2011}$$2011$$011$
20.4k
views
commented
Oct 23, 2017
Programming in C
gatecse-2011
programming
programming-in-c
normal
array
+
–
6
answers
25
GATE IT 2006 | Question: 49
Which one of the choices given below would be printed when the following program is executed ? #include <stdio.h> struct test { int i; char *c; }st[] = {5, "become", 4, "better", 6, "jungle", 8, "ancestor", 7, " ... $\text{etter, u, 6, ungle}$ $\text{cetter, k, 6, jungle}$ $\text{etter, u, 8, ncestor}$
Which one of the choices given below would be printed when the following program is executed ?#include <stdio.h struct test { int i; char *c; }st[] = {5, "become", 4, "be...
27.1k
views
commented
Oct 23, 2017
Programming in C
gateit-2006
programming
programming-in-c
normal
structure
+
–
4
answers
26
TIFR CSE 2011 | Part A | Question: 6
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for the first time is. $4$ $3$ $6$ $10$ $5$
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for...
5.9k
views
commented
Sep 27, 2017
Probability
tifr2011
probability
expectation
+
–
7
answers
27
GATE CSE 2016 Set 2 | Question: 04
Consider the systems, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. ... $\text{II}$ and $\text{III}$ are true. Only $\text{III}$ is true. None of them is true.
Consider the systems, each consisting of $m$ linear equations in $n$ variables.If $m < n$, then all such systems have a solution.If $m n$, then none of these systems has...
15.8k
views
commented
Sep 26, 2017
Linear Algebra
gatecse-2016-set2
linear-algebra
system-of-equations
normal
+
–
3
answers
28
GATE CSE 2002 | Question: 1.1
The rank of the matrix $\begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix}$ is $4$ $2$ $1$ $0$
The rank of the matrix $\begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix}$ is$4$$2$$1$$0$
4.0k
views
commented
Sep 26, 2017
Linear Algebra
gatecse-2002
linear-algebra
easy
matrix
+
–
8
answers
29
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
The product of the non-zero eigenvalues of the matrix is ____$\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & ...
37.3k
views
commented
Sep 24, 2017
Linear Algebra
gatecse-2014-set2
linear-algebra
eigen-value
normal
numerical-answers
+
–
3
answers
30
Mathematics: GATE 2013 EC-A-27
Let A be an mxn matrix and B an nxm matrix. It is given that determinant ( Im + AB ) = determinant ( In + BA ) , where Ik is the k k identity matrix. Using the above property, the determinant of the matrix given below is ... A) 2 B) 5 C) 8 D) 16
Let A be an mxn matrix and B an nxm matrix.It is given that determinant ( Im + AB ) = determinant ( In + BA ) , where Ik is the k×k identity matrix. Using the above prop...
5.9k
views
commented
Sep 24, 2017
Linear Algebra
gate2013-ec
linear-algebra
engineering-mathematics
normal
determinant
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register