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
Recent activity 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
4
answers
1
GATE20036
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements. Then $T(n) = \sum_{k=1}^{n} T(k1)T(x)$, where $x$ is $nk+1$ $nk$ $nk1$ $nk2$
commented
Jan 4
in
DS

5.2k
views
gate2003
normal
binarysearchtree
1
answer
2
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

250
views
madeeasytestseries
databases
transactions
3
answers
3
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

246
views
madeeasytestseries
databases
conflictserializable
transactions
1
answer
4
graph theory
commented
Dec 12, 2019
in
Graph Theory

211
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
8
answers
5
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.6k
views
gate2002
searching
normal
1
answer
6
SETS:Refinement Relation
Q. Over the set A={1,2,3,4,5} two partitions a and b are defined as a={{1,2,3},{4},{5}} and b={{1},{2,3},{4,5}}.The MEET and JOIN(under refinement relations between partitions ) are respectively. A) {(1),(2,3),(4),(5)} and {(1,2,3),(4,5)} B){(1,2,3)(4,5)} and{(1,2),(3),(4,5)} C){(1,2),(3,4)(5)} and {(1,2),(3,4),(5)} D){(1,2,3,4,5)} and {(1),(2),(3),(4),(5)}
commented
Dec 8, 2019
in
Set Theory & Algebra

509
views
discretemathematics
4
answers
7
GATE 2019
Let U = {1, 2, ..., n} and A = {(x, X), x ∈ X and X ⊆ U}. Consider the following two statements for A. (i) A = n*$\small 2^{n1}$ (ii) A= Sigma(k=1 to n) k.(nCk) Which of the following is correct? (a) (i) only (b) (ii) only (c) Both (i) and (ii) (d) None of the above
commented
Dec 6, 2019
in
Set Theory & Algebra

1.3k
views
1
answer
8
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
1
answer
9
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

281
views
madeeasytestseries
decoder
digitallogic
1
answer
10
View Serializability
Consider following Schedule S with data item x : S : W1(X) R2(X) W3(X) R4(X) W5(X) R6(X) W7(X) R8(X) W9(X) R10(X) The number of schedule view equivalent to Schedule S but not conflict equivalent to Schedule S ?
commented
Nov 16, 2019
in
Databases

161
views
databases
view_serializable
transactions
2
answers
11
#MadeEasyTestSeries
S: If a relation R is in 3NF but not in BCNF then relation R must consist atleast 2 overlapped candidate keys. True/False
commented
Nov 13, 2019
in
Databases

190
views
databasenormalization
databases
database
1
answer
12
Multiple Overlapping candidate keys
answered
Nov 13, 2019
in
Databases

362
views
6
answers
13
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$
answer edited
Nov 7, 2019
in
Compiler Design

2.7k
views
gate2019
compilerdesign
syntaxdirectedtranslation
5
answers
14
GATE2017205
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it: ... $\text{Piii; Qiv; Ri; Sii}$ $\text{Pi; Qiv; Rii; Siii}$
commented
Nov 5, 2019
in
Compiler Design

3.1k
views
gate20172
compilerdesign
compilationphases
easy
4
answers
15
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
2
answers
16
proof
how the b and b+ tree formulae computed can u explain with the proof
answered
Nov 2, 2019
in
Databases

147
views
btree
btree
tree
2
answers
17
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

87
views
1
answer
18
GATE19991.19
The relational algebra expression equivalent to the following tuple calculus expression: $\left\{t \mid t \in r \land \left(t[A] = 10 \land t[B]=20\right)\right\}$ is $\sigma_{(A=10 \lor B=20)} (r)$ $\sigma_{(A=10)} (r) \cup \sigma_{(B=20)} (r)$ $\sigma_{(A=10)} (r) \cap \sigma_{(B=20)} (r)$ $\sigma_{(A=10)} (r)  \sigma_{(B=20)} (r)$
commented
Oct 22, 2019
in
Databases

1.9k
views
gate1999
databases
relationalcalculus
normal
6
answers
19
GATE200667
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank 1. Ties are not broke but ranks are skipped: if ... assigning ranks using ODBC. Which two of the above statements are correct? 2 and 5 1 and 3 1 and 4 3 and 5
commented
Oct 21, 2019
in
Databases

7k
views
gate2006
databases
sql
normal
4
answers
20
GATE200440
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ will be the slowest? $\text{union}$ only $\text{intersection, membership}$ $\text{membership, cardinality}$ $\text{union, intersection}$
commented
Sep 29, 2019
in
DS

4.3k
views
gate2004
datastructures
linkedlists
normal
9
answers
21
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.5k
views
gate2019
programminginc
programming
0
answers
22
DECIDABILITY
WHICH OF THE FOLLOWING IS DECIDABLE? 1.WHEATHER AN ARBITRARY TURING MACHINE PRINTS SOME NON BLANK CHARACTER 2.WHEATHER A TURING MACHINE PRINTS A SPECIFIC CHARACTER 3.THE SET OF CODES FOR TURING MACHINE THAT NEVER MAKE A LEFT MOVE. 4. WHEATHER T.M EVER MOVES ITS HEAD TO ... STATE Q WHEN STARTED WITH INPUT W FROM ITS INITIAL STATE 6.T.M VISITS STATE Q ON SOME INPUT WITHIN 10 STEPS. 7.
commented
Sep 17, 2019
in
Theory of Computation

284
views
6
answers
23
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.6k
views
gate2018
digitallogic
flipflop
numericalanswers
normal
0
answers
24
PGEE Sample paper
More than one option can be correct
commented
Feb 5, 2019
in
Mathematical Logic

585
views
iiithpgee
propositionallogic
5
answers
25
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.2k
views
gate2018
algorithms
dynamicprogramming
6
answers
26
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.6k
views
gate20171
programminginc
programming
normal
1
answer
27
Gate forum Exam
In two level cache first level cache minimizes cache miss ratio , second level minimizes cache hit ratio . Explain .
asked
Nov 17, 2018
in
CO and Architecture

26
views
3
answers
28
GATE2017229
In a twolevel cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average memory access time ( ... $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$
commented
Nov 17, 2018
in
CO and Architecture

9.1k
views
gate20172
cachememory
coandarchitecture
normal
1
answer
29
Find the predicate logic for the following statement.
Find the predicate logic for the following statement. There are at most two cars. None of these please explain each one of them
commented
Oct 18, 2018
in
Mathematical Logic

274
views
engineeringmathematics
mathematicallogic
1
answer
30
Gate academy test series
Plz try
commented
Jul 28, 2018
in
Operating System

42
views
1
answer
31
Gate 2018
This is another form of gate 2018 matrixchain question
asked
Jun 28, 2018
in
Algorithms

102
views
1
answer
32
gate test series
asked
Jun 19, 2018
in
Programming

63
views
pointers
7
answers
33
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
8
answers
34
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.7k
views
gate20161
parameterpassing
normal
7
answers
35
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
10
answers
36
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.3k
views
gate20162
coandarchitecture
datapath
normal
numericalanswers
6
answers
37
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

12.8k
views
gate20171
coandarchitecture
cachememory
conflictmisses
normal
numericalanswers
10
answers
38
GATE2015240
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
commented
Dec 28, 2017
in
Set Theory & Algebra

8.1k
views
gate20152
settheory&algebra
functions
normal
numericalanswers
50,737
questions
57,275
answers
198,154
comments
104,820
users