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 Sona Barman
User Sona Barman
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sona Barman
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
7
answers
1
GATE201946
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
commented
Jan 9
in
DS

6.6k
views
gate2019
numericalanswers
datastructures
binarytree
12
answers
2
GATE200447
Consider a system with a twolevel 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. The ... instruction execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
commented
Aug 3, 2019
in
CO and Architecture

22.1k
views
gate2004
coandarchitecture
virtualmemory
normal
2
answers
3
GATE2017228
Given $f(w, x, y, z) = \Sigma_m(0,1, 2, 3, 7, 8, 10) + \Sigma_d(5, 6, 11, 15)$; where $d$ represents the 'don'tcare' condition in Karnaugh maps. Which of the following is a minimum productofsums (POS) form of $f(w, x, y, z)$? $f=(\bar{w}+\bar{z}) (\bar{x}+z)$ $f=(\bar{w}+z) (x+z)$ $f=(w+z) (\bar{x}+z)$ $f=(w+\bar{z}) (\bar{x}+z)$
commented
Jul 21, 2019
in
Digital Logic

3.7k
views
gate20172
digitallogic
minproductofsums
5
answers
4
GATE201230
What is the minimal form of the Karnaugh map shown below? Assume that $X$ denotes a don’t care term $\bar{b} \bar{d}$ $ \bar { b } \bar { d } + \bar{b} \bar{c} $ $ \bar{b} \bar{d} + {a} \bar{b} \bar{c} {d}$ $ \bar{b} \bar{d} + \bar{b} \bar{c} + \bar{c} \bar{d} $
commented
Jul 17, 2019
in
Digital Logic

1.9k
views
gate2012
digitallogic
kmap
easy
5
answers
5
GATE201436
If $\int \limits_0^{2 \pi} x \: \sin x dx=k\pi$, then the value of $k$ is equal to ______.
commented
Jun 10, 2019
in
Calculus

3.1k
views
gate20143
calculus
integration
limits
numericalanswers
easy
6
answers
6
GATE201816
The value of $\int^{\pi/4} _0 x \cos(x^2) dx$ correct to three decimal places (assuming that $\pi = 3.14$) is ____
commented
Jun 9, 2019
in
Calculus

4.8k
views
gate2018
calculus
integration
normal
numericalanswers
5
answers
7
GATE20001.1
The minimum number of cards to be dealt from an arbitrarily shuffled deck of $52$ cards to guarantee that three cards are from same suit is $3$ $8$ $9$ $12$
commented
Apr 14, 2019
in
Combinatory

3.3k
views
gate2000
easy
pigeonholeprinciple
permutationandcombination
6
answers
8
GATE2005IT31
Let $f$ be a function from a set $A$ to a set $B$, $g$ a function from $B$ to $C$, and $h$ a function from $A$ to $C$, such that $h(a) = g(f(a))$ for all $a ∈ A.$ Which of the following statements is always true for all such functions $f$ and $g$? $g$ is ... $h$ is onto $h$ is onto $\implies$ $f$ is onto $h$ is onto $\implies$ $g$ is onto $h$ is onto $\implies$ $f$ and $g$ are onto
commented
Apr 7, 2019
in
Set Theory & Algebra

2.6k
views
gate2005it
settheory&algebra
functions
normal
3
answers
9
GATE20002.5
A relation $R$ is defined on the set of integers as $xRy$ iff $(x + y)$ is even. Which of the following statements is true? $R$ is not an equivalence relation $R$ is an equivalence relation having 1 equivalence class $R$ is an equivalence relation having 2 equivalence classes $R$ is an equivalence relation having 3 equivalence classes
commented
Apr 6, 2019
in
Set Theory & Algebra

3.1k
views
gate2000
settheory&algebra
relations
normal
1
answer
10
GATE200538
Let $G(V,E)$ be an undirected graph with positive edge weights. Dijkstra’s single source shortest path algorithm can be implemented using the binary heap data structure with time complexity: $O\left(V^2\right)$ $O\left(E+V\log V\right)$ $O\left(V\logV\right)$ $O\left(\left(E+V\right)\logV\right)$
commented
Apr 4, 2019
in
Algorithms

4.6k
views
gate2005
algorithms
graphalgorithms
normal
3
answers
11
propositional logic
which of the following is tautology? (¬P^(P>q))>¬q ¬(p>q)>¬q [(¬p^q)^[q>(p>q)]]>¬r Both (B) and(C) please explain in detail how to check for especially for condition (C) Because “r” is only in RHS but not in LHS of this implication.
commented
Mar 19, 2019
in
Mathematical Logic

119
views
propositionallogic
discretemathematics
mathematicallogic
firstorderlogic
engineeringmathematics
2
answers
12
Kenneth Rosen Edition 7th Exercise 1.3 Question 15 (Page No. 34)
Determine whether $(\sim q \wedge (p \rightarrow q)) \rightarrow \sim p$ is a tautology.
commented
Mar 18, 2019
in
Mathematical Logic

41
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
1
answer
13
Kenneth Rosen Edition 7th Exercise 1.3 Question 33 (Page No. 35)
Show that $(p \rightarrow q) \rightarrow (r \rightarrow s) $ and $(p \rightarrow r) \rightarrow (q \rightarrow s)$ are not logically equivalent.
commented
Mar 18, 2019
in
Mathematical Logic

26
views
kennethrosen
discretemathematics
propositionallogic
mathematicallogic
1
answer
14
General Topic Doubt Set Theory & Algebra: Relations
How to check a relation is transitive or not from its matrix representation? Please help me with an example.
commented
Mar 9, 2019
in
Set Theory & Algebra

107
views
settheory&algebra
discretemathematics
relations
generaltopicdoubt
4
answers
15
GATE19952.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
commented
Sep 10, 2018
in
DS

4k
views
gate1995
datastructures
stack
easy
4
answers
16
GATE200530
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE? $s \subset r$ $r \cup s =r$ $r \subset s$ $r*s=s$
commented
Aug 27, 2018
in
Databases

3.6k
views
gate2005
databases
relationalalgebra
naturaljoin
normal
1
answer
17
Gate_2019_Mock_Paper
Please explained in detail
commented
Jul 4, 2018
in
Algorithms

76
views
algorithms
datastructures
hashing
1
answer
18
madeeeasy work book hashing
WHICH OF THE FOLLOWING IS THE BEST CHOICE AS $m$ IN THE HASH FUNCTION $h(k)=k \mod m$?? $61$ $701$ $81$ answer is given as $701$ but how??
commented
Jul 4, 2018
in
Programming

629
views
datastructures
hashing
1
answer
19
LRU page replacement policy
Self doubt: What is the rule or keyb point we should keep in mind while solving problems on LRU page replacement algorithm? Please explain with examples.
answer selected
May 24, 2018
in
Operating System

135
views
operatingsystem
pagereplacement
lru
pagefault
2
answers
20
Gradup topicwise question doubt
Identify the language generated by the following grammar: $S>AB$ $A>aAb\epsilon$ $B>bBb$ (A)$\{a^m b^nn≥m, m>0\}$ (B)$\{a^m b^nn≥m, m≥0\}$ (C)$\{a^m b^nn>m, m>0\}$ (D)$\{a^m b^nn>m, m≥0\}$ I select option C but it is wrong, correct answer is option D. I could not understand Gradup answer explanation.Please help me to rectify my fault.
answer selected
May 24, 2018
in
Theory of Computation

112
views
theoryofcomputation
language
of
grammar
3
answers
21
Made easy ots dbms 2 for gate2019
$T1:w(A);w(B);R(C);C;$ $T2:w(B);R(B);C$ The number schedule of $T1$ and $T2$ are recoverable ________.
commented
May 23, 2018
in
Databases

640
views
databases
recoverableschedule
2
answers
22
Gradup topicwise question
Consider the vales of bst $11,22,33,44,55,66,77,88$. Which of the following is a valid sequence of preorder traversal? $55,33,11,22,44,77,66,88$ $55,33,22,44,11,66,77,88$ $55,33,11,44,22,66,77,88$ $55,33,11,44,22,66,77,88$ Given answer is option A But how?
answer selected
May 22, 2018
in
Programming

269
views
datastructures
binarysearchtree
7
answers
23
GATE200940
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
commented
May 9, 2018
in
Theory of Computation

3.3k
views
gate2009
theoryofcomputation
easy
identifyclasslanguage
2
answers
24
Grade up topicwise questions
L1={a^n b^n c ^mm>=0 and n>=0} L2={a^m b^ n c^ nn>=0 and m>=0} If L3=L1UL2 then how many of L1,L2,L3 are context free languages? A)1 (B)2 (C)3 (D) none Answer given option C. Please explain?
commented
May 9, 2018
in
Theory of Computation

313
views
theoryofcomputation
contextfreelanguages
4
answers
25
Determine the highest possible normal form of the given relation?
Given R(ABCD) and AB → C ; ABD → C ; ABC → D ; AC → D which the highest possible normal form for the above relation ?
commented
Apr 10, 2018
in
Databases

1.3k
views
databasenormalization
databases
3
answers
26
Lossy or Lossless
Consider the relation $R(ABCDEG)$ and $FD's$ are $\{AB \rightarrow C,AC \rightarrow B,AD \rightarrow E,B \rightarrow D,BC \rightarrow A,E \rightarrow G\}$ then the decomposition$\{ABC,ACDE,ADG\}$ is lossless and not dependency preserving is not lossless and dependency preserving is lossless and dependency preserving is not lossless and not dependency preserving
commented
Apr 10, 2018
in
Databases

218
views
databases
databasenormalization
1
answer
27
MadeEasy Test Series 2019: Databases  Functional Dependencies
Consider a relation R(A,B,C,D,E) with following functional dependencies: A>BC C>E B>D E>A Total number of super key present in the relation are ______________. Given answer is 28. Please explain how?
answer selected
Apr 7, 2018
in
Databases

207
views
madeeasytestseries
databases
superkeys
databasenormalization
2
answers
28
Tautology of contingency
answer edited
Feb 18, 2018
in
Mathematical Logic

281
views
propositionallogic
mathematicallogic
1
answer
29
Basic doubt in B+ Tree Indexing
Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible..
commented
Jan 22, 2018
in
Databases

421
views
databases
btree
indexing
15
answers
30
GATE2017244
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 ______
commented
Jan 21, 2018
in
Databases

21.2k
views
gate20172
databases
transactions
numericalanswers
conflictserializable
1
answer
31
Transaction
How many concurrent schedules are conflict serializable of given transactions T1 and T2: T1 = r1(A) W1(A)R1(B)W1(B) T2 = R2(B)W2(B)R2(A)W2(A)
commented
Jan 21, 2018
in
Databases

163
views
transactions
databases
1
answer
32
Spannig trees
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
commented
Jan 20, 2018
in
Graph Theory

505
views
spanningtree
graphtheory
4
answers
33
fork
#include <stdio.h> #include <unistd.h> int main() { int i; for(i=1;i<=3;i++) { fork(); printf("*"); } return 0; } how many times * will be printed ?...is it 11?
commented
Jan 19, 2018
in
Operating System

1.8k
views
fork
3
answers
34
fork()
1)Consider the following pseudo code: for(i=1;i<=4;i++) { fork(); printf("X"); } How many times “X” is printed? 2) Consider the following pseudo code: void main() { fork(); fork(); fork(); fork(); printf("X"); } How many times “X” is printed?
commented
Jan 19, 2018
in
Operating System

338
views
fork
operatingsystem
0
answers
35
Operating system
Please explain in detail
commented
Jan 19, 2018
in
Operating System

123
views
operatingsystem
memorymanagement
1
answer
36
operating system disk scheduling
any shortcut method for this??
answered
Jan 19, 2018
in
Operating System

252
views
operatingsystem
diskscheduling
disks
1
answer
37
Calculation of number of states in dfa without drwing dfa
Self doubt: Is there any method to calculate number of states in dfa e.g."x mod y" type of question without drawing dfa? Because in Gate time is vital factor.
answer selected
Jan 18, 2018
in
Theory of Computation

223
views
theoryofcomputation
finiteautomata
numberofstates
1
answer
38
difference among Critical Section ,Mutual Exclusion and Semaphore
difference in following: [i] mutual exclusion [ii] critical section [iii] semaphore
commented
Jan 17, 2018
in
CO and Architecture

1.1k
views
operatingsystem
processsynchronization
criticalsection
deadlock
semaphore
coandarchitecture
1
answer
39
Context Free Language
Is B context free? Please explain in detail.
commented
Jan 17, 2018
in
Theory of Computation

235
views
contextfreelanguages
theoryofcomputation
identifyclasslanguage
regularlanguages
grammar
2
answers
40
Number of states in a minimal DFA construction
Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting language L, then what is the number of states in M ? Is it nm or (n+1)(m+1) ?
commented
Jan 13, 2018
in
Theory of Computation

284
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
50,737
questions
57,313
answers
198,349
comments
105,052
users