The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent activity by Mk Utkarsh
User Mk Utkarsh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Mk Utkarsh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
Kenneth Rosen Edition 7th Exercise 1.4 Question 6 (Page No. 53)
Let $N(x)$ be the statements “$x$ has visited North Dakota,” where the domain consists of the students in your school. Express each of these quantifications in English. $\exists x N(x)$ $\forall x N(x)$ $\sim \exists x N(x)$ $\exists x \sim N(x)$ $\sim \forall x N(x)$ $\forall x \sim N(x)$
answered
4 days
ago
in
Mathematical Logic

17
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
2
answers
2
Kenneth Rosen Edition 7th Exercise 1.3 Question 18 (Page No. 35)
show that $p \rightarrow q$ and $\sim q \rightarrow \sim p$ are logically equivalent.
answer selected
4 days
ago
in
Mathematical Logic

16
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
3
answers
3
Kenneth Rosen Edition 7th Exercise 1.4 Question 5 (Page No. 53)
Let $P(x)$ be the statement “x spends more than five hours every weekday in class.” where the domain for x consists of all students. Express each of these qualifications in English. $\exists x P(x)$ $\forall x P(x)$ $\exists x \sim p(x)$ $\forall x \sim P(x)$
answered
4 days
ago
in
Mathematical Logic

20
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
1
answer
4
Kenneth Rosen Edition 6th Exercise 6.4 Question 33 (Page No. 442)
Use generating function to solve the recurrence relation $a_k=3{a_{k1}} + 2$ with initial conditions $a_0=1 $.
edited
Mar 7
in
Combinatory

231
views
kennethrosen
discretemathematics
generatingfunctions
1
answer
5
Rosen 7e, Advance Counting techniques , Question 6.f
Find the generating function for the sequence $\left \{ a_n \right \} where $ $a_n = \Large \binom{10}{n+1} $ ... $\Large \color{red}{ \frac{( 1+x )^{10}  1}{x} }$ Please verify
commented
Mar 7
in
Combinatory

34
views
kennethrosen
discretemathematics
generatingfunctions
1
answer
6
Peter Linz Edition 4 Exercise 3.2 Question 10.b (Page No. 88)
What is the regular expression for this
commented
Feb 22
in
Theory of Computation

142
views
theoryofcomputation
peterlinz
finiteautomata
regularlanguages
regularexpressions
0
answers
7
TANCET 2016 SQL
commented
Feb 17
in
Databases

14
views
tancet
0
answers
8
ER Model. Please explain the answer.
Please explain the answer.
edited
Feb 17
in
Databases

44
views
er
erdiagram
relationalmodel
2
answers
9
counting
Three different numbers are selected from the set X = {1,2,3,4,…,10}. What is the probability that the product of two of the numbers is equal to the third? (a) 3/10 (b) 1/40 (c) 1/20 (d) 4/5
recategorized
Feb 8
in
Numerical Ability

581
views
generalaptitude
1
answer
10
GATE 2019 8
Q.8 Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to 1. (n1)!/2 2. 1 3.(n1)! 4. n!
commented
Feb 7
in
Graph Theory

289
views
usergate2019
usermod
discretemathematics
graphtheory
1
answer
11
Probability: Poisson distribution calculation vs normal probability calculation
In this question if we do simply probability calculation then it is 8/20 40% but when I am appling poisson distribution then it is 40.4%. why we are getting two different answers??
answered
Feb 2
in
Mathematical Logic

179
views
engineeringmathematics
probability
poissondistribution
0
answers
12
Arrangement
Number of ways we can arrange 5 books in 3 selves___________
commented
Jan 31
in
Combinatory

81
views
permutationsandcombinations
1
answer
13
MadeEasy Test Series: Databases  Database Normalization
Consider a database with the following relation: Shipping (ShipName, ShipType, TripId, Cargo, Port. Date) With the following functional dependencies: sorry for not typing ,i will type it later my doubt isisn’t partial dependency $ShipName\rightarrow ShipType$ present in new database??
answered
Jan 31
in
Databases

93
views
databases
databasenormalization
madeeasytestseries
1
answer
14
#madeeasy testseries
Caption
closed
Jan 31
in
Databases

42
views
2
answers
15
Databases Multiple granularity
commented
Jan 31
in
Databases

98
views
databases
multiplegranularity
0
answers
16
Databases Multiple granularity
closed
Jan 31
in
Databases

120
views
databases
1
answer
17
B+ tree maximum and minimum height
commented
Jan 30
in
Databases

404
views
btree
indexing
databases
0
answers
18
ME FLT5
Consider the following POSETs: Which of the above POSETs are isomorphic to (P (S), ⊆), where S = {a, b, c}?
recategorized
Jan 30
in
Set Theory & Algebra

71
views
engineeringmathematics
5
answers
19
GATE19973.1
Let $\left(Z, *\right)$ be an algebraic structure where $Z$ is the set of integers and the operation $*$ is defined by $n*m = \max(n,m)$. Which of the following statements is true for $\left(Z, *\right)$? $\left(Z, *\right)$ is a monoid $\left(Z, *\right)$ is an Abelian group $\left(Z, *\right)$ is a group None of the above
edited
Jan 30
in
Set Theory & Algebra

1.6k
views
gate1997
settheory&algebra
groups
normal
0
answers
20
Arrangement Problem
The number of ways, we can arrange 5 books in 3 shelves ________. Given answer 2520 n=3 r=5 so answer is 31+5 P5= 7p5= 2520 My answer 3*3*3*3*3= 243 Where am I doing wrong? please help
closed
Jan 29
in
Combinatory

41
views
permutationsandcombinations
1
answer
21
congestion window
Let the size of congestion window of a TCP connection be 32 KB. When the timeout occurs maximum segment size used is 2 KB. If the time taken by TCP connection to get 32 KB congestion window is 480 msec then the RTT of connection is _________ (in msec).
commented
Jan 29
in
Computer Networks

170
views
congestioncontrol
computernetworks
0
answers
22
Applied Course mocktest
Consider the effect of using slow start on a line with a 10msec roundtrip time and no congestion. The receive window is 28 KB and the maximum segment size is 2KB. How long does it take before the first full window can be sent? ______(milli seconds)
commented
Jan 28
in
Computer Networks

51
views
3
answers
23
GATE200823
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertexcover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
answer edited
Jan 28
in
Graph Theory

2.5k
views
gate2008
graphtheory
normal
graphplanarity
1
answer
24
array
Consider a 2 dimensional array A[40 ..... 95, 40 ..... 95] in lower triangular matrix representation. The size of each element in the array is 1 byte. If the array is implemented in the memory in the form of row major order and base address of the array is 1000, the address of A[66] [50] will be
closed
Jan 28
in
DS

90
views
arrays
datastructure
programminginc
1
answer
25
2DArray
Consider a 2 dimensional array A[40 ..... 95, 40 ..... 95] in lower triangular matrix representation. The size of each element in the array is 1 byte. If the array is implemented in the memory in the form of row major order and base address of the array is 1000, the address of A[66] [50] will be ________.
closed
Jan 28
in
DS

111
views
programminginc
arrays
pointers
datastructure
1
answer
26
Ace Test Series: Compilers  Parsers
commented
Jan 26
in
Compiler Design

235
views
compilerdesign
lrparser
acetestseries
1
answer
27
GOCompiler1: Parsing13
Match the following: ... iic; iiia; ivd id; iia; iiic; ivd ic; iib; iiid; iva ia; iic; iiib; ivd
commented
Jan 26
in
Compiler Design

96
views
go2019cd1
parsing
1
answer
28
made easy test series dout
A logical function is given as F(A, B, C, D) = Σm (0, 4, 5, 10, 11, 13, 15). The number of Essential Prime Implicants in the given function will be _________.
commented
Jan 26
in
Digital Logic

58
views
2
answers
29
#toc How to make DFA for this.
How to draw a DFA for the below language. $L$ = {$W  W \in$ $ (0, 1)^* $}; $W$ ends with 0 and contains the substring 100 } No. of states in minimal DFA.
answered
Jan 26
in
Theory of Computation

68
views
theoryofcomputation
finiteautomata
2
answers
30
GATEBOOK2019 Mock Test128
If the expression $((2 + 3) * 4 + 5 * (6 + 7) * 8) + 9$ is evaluated with $*$ having precedence over $+$, then the value obtained is the same as the value of which of the following prefix expressions? $+ + * + 2 3 4 * * 5 + 6 7 8 9$ $+ * + + 2 3 4 * * 5 + 6 7 8 9$ $* + + 2 3 4 * * 5 + + 6 7 8 9$ $* + + + 2 3 4 * * 5 + 6 7 8 9$
answered
Jan 26
in
DS

138
views
gb2019mock1
stack
prefixnotation
0
answers
31
#india
closed
Jan 26
in
Others

29
views
0
answers
32
ME_FLT_CD
The minimum no of node and edges in DAG Representation. is it enough to derive only final expression i.e expression for ‘e’ or all intermmediate sub exp should also be expressed?please draw it.
commented
Jan 25
in
Compiler Design

64
views
0
answers
33
me adv test
Consider the following schedule: S:R2(A), W1(B), W1(C), R3(B), R2(B), R1 (A), commit_1, R2(C), commit_2, W3(A), commit_3 How many given statements true about schedule(S)____. (i) Schedule(S) is conflict serializable schedule. (ii) Schedule(S) is ... strict recoverable schedule. (iv) Schedule(S) is allowed by strict 2PL. only 1 is correct as per my answer but in answer they have given 3
closed
Jan 25
in
Databases

52
views
madeeasytestseries
databases
strictschedule
conflictserializable
2pl
0
answers
34
i need urgent help
i became relaxed and thinking for the next year preparation can someone motivate me so that i can focus again on study you can also motivate me in private message help as soon as possible ……
commented
Jan 25
in
GATE

102
views
0
answers
35
fork() system call
commented
Jan 25
in
Operating System

85
views
unix
1
answer
36
Poisson distribution
The second moment of a poisson distributed random variable is 2 the mean of the random variable is?
recategorized
Jan 24
in
Probability

144
views
poissondistribution
0
answers
37
Applied Course Mock Test 4
Q32 [Mock 4]. Naveen's coin box contains 8 fair standard coins (heads and tails) and 1 coin which has heads on both sides. He selects a coin randomly and flips it 4 times, getting all heads. If he flips this coin again, what is the probability it ... )+(1/9)*(1) Probability of choosing fair coin and P(heads)+ P(unfair)*P(heads). Please help me understand this question.
commented
Jan 24
in
Probability

103
views
conditionalprobability
probability
discretemathematics
1
answer
38
modified question
Each Process Pi, i = 1....91....9 is coded as follows while(TRUE) { P(mutex) {Critical section} V(mutex) } The code for P10 is while (TRUE) { v(mutex) {Critical section} p(mutex) } . What is the largest number of processes that can be inside the critical section at any moment? 1 2 3 10
commented
Jan 23
in
Operating System

23
views
0
answers
39
Compiler Question
Which of the following is correct?
edited
Jan 22
in
Compiler Design

69
views
compilerdesign
syntaxdirectedtranslation
1
answer
40
Self Doubt
Consider the following relation: R (A1, A2, ….An) and every (n2) attributes of R forms a candidate key. How many super keys are there in R?
commented
Jan 22
in
Databases

71
views
databases
superkeys
48,515
questions
52,763
answers
183,377
comments
68,234
users