The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by kunal goswami
User kunal goswami
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User kunal goswami
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
MadeEasy Test Series: Databases  Transactions
Consider the following schedule : S:r1(A);w1(B);r2(A);w2(B);r3(A);w3(B); Here ri(X) denotes read on data item X and wi(X) denoted write on data item X .The total number of schedules that are view equivalent to S are _______
answered
Dec 26, 2019
in
Databases

255
views
madeeasytestseries
databases
transactions
0
votes
2
MadeEasy Test Series 2018: Databases  Transactions
Consider the following schedule: S: W1(A) W1(B) R2(A) W2(B) R3(A) W3(B) The number schedules conflict equivalent are ______________________.
answered
Dec 26, 2019
in
Databases

247
views
madeeasytestseries
databases
conflictserializable
transactions
0
votes
3
GATE20022.10
Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1..n]$ having $n$ distinct values: Choose an $i$ at random from $1..n$ If $A[i] = x$, then Stop else Goto 1; Assuming that $x$ is present in $A$, what is the expected number of comparisons made by the algorithm before it terminates? $n$ $n1$ $2n$ $\frac{n}{2}$
answered
Dec 12, 2019
in
Algorithms

6.7k
views
gate2002
searching
normal
0
votes
4
MadeEasy Test Series: CO & Architecture  Cache Memory
Consider the following statements: (i) Accessing of data in a column wise fashion maintains spatial locality only when the block size is equal to the total size of the elements in the row (ii) Coherence in write through protocol never occurs even cache memory is organized in multilevel. Which of the above is true?
answered
Dec 4, 2019
in
CO and Architecture

77
views
madeeasytestseries
coandarchitecture
multilevelcache
0
votes
5
MadeEasy Test Series: Digital Logic  Decoder
A $3 \times 8$ decoder with two enables inputs is to be used to address 8 blocks of memory. What will be the size of each memory block when addressed from a sixteenbit bus with two MSBs used to enable the decoder? $i)2k$ $ii)4k$ $iii)16k$ $iv) 64k$ What does “two enable inputs is to be used” mean? I am not able to visualize the circuit.
answered
Nov 22, 2019
in
Digital Logic

287
views
madeeasytestseries
decoder
digitallogic
0
votes
6
Multiple Overlapping candidate keys
answered
Nov 13, 2019
in
Databases

364
views
0
votes
7
GATE201936
Consider the following grammar and the semantic actions to support that inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the nonterminals $D, T, L$ or $L_1$ ... $X_1=L, \: X_2=L, \: X_3=L_1, \: X_4 = T$ $X_1=T, \: X_2=L, \: X_3=T, \: X_4 = L_1$
answered
Nov 7, 2019
in
Compiler Design

2.8k
views
gate2019
compilerdesign
syntaxdirectedtranslation
0
votes
8
MadeEasy Test Series: Combinatory  Permutations And Combinations
MY SOLUTION : Fix the root then next level 2 elements ( 2! possibilities) next level 4 elements( 4! possibilities) last level 2 elements ( 2! possibilities) total possibility = 2! * 4! * 2! = 2 * 24 * 2 = 96 what ... that if node of above graph is filled with these elements it satisfies max heap property a)96 b)896 c)2688 d) none
answered
Nov 4, 2019
in
Combinatory

1.1k
views
permutationandcombination
madeeasytestseries
+1
vote
9
proof
how the b and b+ tree formulae computed can u explain with the proof
answered
Nov 2, 2019
in
Databases

149
views
btree
btree
tree
+1
vote
10
Linked List
Consider the following function in a single linked list int fun(struct node *P, struct node *Q) { if(P==NULL && Q == NULL) return 0; else if(P==NULL  Q==NULL) return 1; else if(P→data!=Q→data) return 1; if(fun(P→ left, ... returns 0, when both trees are same recursively. It compares two given binary trees but return value cannot be used to differentiate the trees None of these
answered
Oct 27, 2019
in
Programming

89
views
+3
votes
11
GATE201927
Consider the following C program: #include <stdio.h> int r() { static int num=7; return num; } int main() { for (r();r();r()) printf(“%d”,r()); return 0; } Which one of the following values will be displayed on execution of the programs? $41$ $52$ $63$ $630$
answered
Sep 28, 2019
in
Programming

4.6k
views
gate2019
programminginc
programming
0
votes
12
GATE201822
Consider the sequential circuit shown in the figure, where both flipflops used are positive edgetriggered D flipflops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "in" is ____
answered
Jul 5, 2019
in
Digital Logic

5.7k
views
gate2018
digitallogic
flipflop
numericalanswers
normal
+1
vote
13
GATE201831
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the product of $n$ matrices $G_1G_2G_3 \dots G_n$ can be done by parenthesizing in different ... , the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_1F_2$ and $F_4F_5$ only
answered
Jan 29, 2019
in
Algorithms

5.3k
views
gate2018
algorithms
dynamicprogramming
+3
votes
14
GATE2017136
Consider the C functions foo and bar given below: int foo(int val) { int x=0; while(val > 0) { x = x + foo(val); } return val; } int bar(int val) { int x = 0; while(val > 0) { x= x + bar( ... will result in: Return of $6$ and $6$ respectively. Infinite loop and abnormal termination respectively. Abnormal termination and infinite loop respectively. Both terminating abnormally.
answered
Dec 9, 2018
in
Programming

8.7k
views
gate20171
programminginc
programming
normal
+1
vote
15
GATE2016235
The following function computes $X^{Y}$ for positive integers $X$ and $Y$. int exp (int X, int Y) { int res =1, a = X, b = Y; while (b != 0) { if (b % 2 == 0) {a = a * a; b = b/2; } else {res = res * a; b = b  1; } } return res; } Which one of the following conditions is TRUE ... loop? $X^{Y} = a^{b}$ $(res * a)^{Y} = (res * X)^{b}$ $X^{Y} = res * a^{b}$ $X^{Y} = (res * a)^{b}$
answered
Jun 15, 2018
in
Programming

3.4k
views
gate20162
programming
loopinvariants
normal
+12
votes
16
GATE2016136
What will be the output of the following pseudocode when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; print (x); } void m(y) { a = 1 ; a = y  a; n(a); print (a); } void main () { m(a); } $6,2$ $6,6$ $4,2$ $4,4$
answered
Jun 14, 2018
in
Compiler Design

8.8k
views
gate20161
parameterpassing
normal
+3
votes
17
GATE2015349
Suppose $c = \langle c[0], \dots, c[k1]\rangle$ is an array of length $k$, where all the entries are from the set $\{0, 1\}$. For any positive integers $a \text{ and } n$, consider the following pseudocode. DOSOMETHING (c, a, n) $z \leftarrow 1$ ... , then the output of DOSOMETHING(c, a, n) is _______.
answered
Jun 14, 2018
in
Algorithms

2.3k
views
gate20153
algorithms
identifyfunction
normal
numericalanswers
+5
votes
18
GATE2016230
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement the computation $F(G(X_{i}))$ for $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.
answered
Jun 7, 2018
in
CO and Architecture

8.4k
views
gate20162
coandarchitecture
datapath
normal
numericalanswers
0
votes
19
GATE2016230
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement the computation $F(G(X_{i}))$ for $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.
answered
Jun 7, 2018
in
CO and Architecture

8.4k
views
gate20162
coandarchitecture
datapath
normal
numericalanswers
+6
votes
20
GATE2017151
Consider a $2$way set associative cache with $256$ blocks and uses $LRU$ replacement. Initially the cache is empty. Conflict misses are those misses which occur due to the contention of multiple blocks for the same cache set. Compulsory misses occur due to first ... $10$ times. The number of conflict misses experienced by the cache is _________ .
answered
Jun 6, 2018
in
CO and Architecture

13k
views
gate20171
coandarchitecture
cachememory
conflictmisses
normal
numericalanswers
50,737
questions
57,324
answers
198,408
comments
105,173
users