The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 Rounak Agarwal
User Rounak Agarwal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Rounak Agarwal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
Kenneth Rosen Edition 7th Exercise 1.2 Question 35 (Page No. 24)
A detective has interviewed four witnesses to a crime. From the stories of the witnesses the detective has concluded that if the butler is telling the truth then so is the cook; the cook and the gardener cannot ... four persons can the detective determine whether that person is telling the truth or lying ? Explain your reasoning.
commented
Jun 2, 2017
in
Mathematical Logic

372
views
kennethrosen
discretemathematics
propositionallogic
4
answers
2
Kenneth Rosen Edition 6th Exercise 5.3 Question 35 (Page No. 362)
How many bit strings contain exactly eight 0s and 10 1s if every 0 must be immediately followed by a 1 ?
answer selected
May 27, 2017
in
Mathematical Logic

239
views
kennethrosen
discretemathematics
combinatory
counting
0
answers
3
Probbility puzzles
Three men  conveniently named A, B, and C  are fighting a duel with pistols. It's A's turn to shoot. The rules of this duel are rather peculiar: the duelists do not all shoot simultaneously, but instead take turns. A fires at B, B fires at C, ... that B is a better shot, and hits with probability 0.75  all shots are independent. What's the probability that A wins the duel?
commented
May 24, 2017
in
Probability

480
views
probability
conditionalprobability
5
answers
4
Meta: Suggestions to improve GATE Overflow
Mention your dislikes about the site and suggest improvements if any
answered
Apr 18, 2017
in
Others

329
views
meta
siteimprovement
gateoverflow
9
answers
5
GATE2017108
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p>next != NULL) { p = p>next; } p>next = m; } Assuming that m and n point to valid NULL ... or append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
commented
Apr 17, 2017
in
DS

9.9k
views
gate20171
datastructures
linkedlists
normal
0
answers
6
gate 2017 admission
I had applied for Mtech(res) in IISC in CSA with a gate rank of 797 and score 689. However, i still havent received an interview call letter. Is there any chance that il still receive a call letter gor interview? Also, has anyone else who has applied for mtech iisc in research received a call letter yet?
commented
Apr 17, 2017
in
IISc/IITs

508
views
gate2017addmission
gettingtoiits
admissiongate2017
2
answers
7
Test Series
Consider a 4way set associative cache that has 8lines, with perfect LRU cache replacement and supports a block size of 16bytes. For the following memory access pattern (shown as byte addresses), find the hit ratio? 3, 5, 6, 21, 32, 14, 5, 10, 11, 12
commented
Feb 9, 2017
in
CO and Architecture

214
views
coandarchitecture
cachememory
3
answers
8
Kenneth Rosen Edition 6th Exercise 6.1 Question 9d (Page No. 401)
Solve the recurrence relation $a_n = a_{n1} + 2n + 3, a_0 = 4$
commented
Dec 30, 2016
in
Combinatory

288
views
kennethrosen
discretemathematics
combinatory
recurrencerelations
1
answer
9
Kenneth Rosen Edition 6th Exercise 5.1 Question 5 (Page No. 344)
Question: Six different airlines fly from New York to Denver and seven fly from Denver to San Francisco. How many different pairs of airlines can you choose on which to book a trip from New York to San Francisco via ... an airline for the continuation flight to San Francisco ? How many of these pairs involve more than one airline ?
asked
Dec 19, 2016
in
Combinatory

821
views
kennethrosen
combinatory
discretemathematics
counting
8
answers
10
GATE19982.11
A complete $n$ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$ary tree, the number of leaves in it is given by $x(n1) +1$ $xn1$ $xn +1$ $x(n+1)$
answered
Dec 13, 2016
in
DS

3.5k
views
gate1998
datastructures
trees
normal
4
answers
11
GATE201243
Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a foreign key that refers to $C$ in $R_{2}$. If data in $r_{1}$ and $r_{2}$ satisfy referential integrity ... $\prod_{B}(r_{1}) = \prod _{C}(r_{2})$ $\prod_{B}(r_{1})  \prod _{C}(r_{2}) \neq \varnothing$
commented
Oct 3, 2016
in
Databases

3.1k
views
gate2012
databases
relationalalgebra
normal
1
answer
12
Checking for losslessjoin property
The decomposition of relation R with FD set F into R1 and R2 has lossless join property iff R1 $\cap$ R2 $\rightarrow$ R1 $\in$ F$^+$ OR R1 $\cap$ R2 $\rightarrow$ R2 $\in$ F$^+$ If R is decomposed into more than 2 ... ? Or is that table drawing thing the only way to check for lossless join property ? Answers with reference(s) will be much appreciated. Thanks.
answer selected
Sep 29, 2016
in
Databases

618
views
decomposition
databases
losslessjoin
1
answer
13
Regular Language
Alphabet : {a, b} Language : Set of all strings which start and end with same symbol Doubt : Can $\epsilon$ be considered as part of the language ? Edit: I can see several people have answered my question in the comments. Perhaps I should have ... present at the beginning and end of "ab" or even between a and b. If you disagree with me please give some explanation.
commented
Aug 14, 2016
in
Theory of Computation

1.1k
views
theoryofcomputation
regularlanguages
52,215
questions
60,013
answers
201,242
comments
94,699
users