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
Answers by tusharp
User tusharp
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User tusharp
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
made easy test series  lossless join and dependency preserving
How is A answer?
answered
Apr 12, 2019
in
Databases

182
views
losslessdecomposition
databases
dependencypreserving
databasenormalization
+4
votes
2
Madeeasy Discrete Maths notes
How many 5 letter word possible having atleast 2 a's ?
answered
Apr 9, 2019
in
Combinatory

293
views
madeeasynotes
discretemathematics
combinatory
+3
votes
3
Kenneth Rosen Edition 7th Exercise 2.1 Question 9 (Page No. 125)
Determine whether each of these statements is true or false. $0$ $ \epsilon$ $\phi$ $\phi$ $\epsilon$ {$0$} {$0$} $ \subset$ {$ \phi$} $\phi$ $\subset$ {$0$} {$0$} $\epsilon$ {$0$} {$0$} $\subset$ {$0$} {$\phi$} $\subseteq$ {$\phi$}
answered
Apr 5, 2019
in
Mathematical Logic

87
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
0
votes
4
Kenneth Rosen Edition 7th Exercise 2.1 Question 10 (Page No. 125)
Determine whether each of these statements is true or false. $\phi$ $ \epsilon$ {$\phi$} $\phi$ $\epsilon$ {$\phi,$ { $\phi$}} {$\phi$} $ \epsilon$ {$ \phi$} {$\phi$} $\epsilon $ {{$\phi$}} {$\phi$} $\subset$ {$0$} {$0$} $\subset$ {$\phi$ , { $\phi$ }} {$\phi$} $\subset$ {{$\phi$ }, { $\phi$}}
answered
Apr 5, 2019
in
Set Theory & Algebra

33
views
kennethrosen
discretemathematics
settheory&algebra
0
votes
5
self doubtLONGEST MASK MATCHINGNETWORK LAYER
what is the intuition behing longest mask matching when different masks gives the same source ID for a given IP address??
answered
Apr 4, 2019
in
Computer Networks

43
views
+2
votes
6
Self doubt
Is CONVOY Effect possible in "Longest job first" non preemptive scheduling policy ?
answered
Apr 2, 2019
in
Operating System

98
views
operatingsystem
0
votes
7
Peter Linz Edition 4 Exercise 3.1 Question 1 (Page No. 75)
Find all strings in $L((a + b) b (a + ab)^*)$ of length less than four.
answered
Apr 1, 2019
in
Theory of Computation

44
views
peterlinz
peterlinzedition4
theoryofcomputation
regularexpressions
0
votes
8
MadeEasy Test Series: Theory Of Computation  Identify Class Language
$L = \left \{ x^{l}y^{m}z^{n}  \ l+m+n\ is\ divisible\ by\ 5\right \}$ Is it regular or CFL or CSL ?
answered
Mar 27, 2019
in
Theory of Computation

191
views
madeeasytestseries
theoryofcomputation
identifyclasslanguage
+1
vote
9
Proposition LogicRosen(7e)
Show that these statements are inconsistent: “If Miranda does not take a course in discrete mathematics, then she will not graduate.” “If Miranda does not graduate, then she is not qualified for the job.” “If Miranda reads this book, then she is qualified for the job.” “Miranda does not take a course in discrete mathematics but she reads this book.” how to approach?
answered
Mar 27, 2019
in
Mathematical Logic

202
views
mathematicallogic
discretemathematics
kennethrosen
propositionallogic
+5
votes
10
Virtual Gate Test Series: Theory Of Computation  Languages
If $L = \Bigl \{ x \mid x \in \{ a, b, c \}^*, \text{The length of $x$ is a square } \Bigr \}$ then $L$ is Regular Recursive but not context free Context Free but not regular None of the above
answered
Mar 25, 2019
in
Theory of Computation

154
views
theoryofcomputation
identifyclasslanguage
virtualgatetestseries
0
votes
11
Turing Machine Self Doubt
Can someone explain in details how set of all TM is countable?
answered
Mar 24, 2019
in
Theory of Computation

120
views
turingmachine
theoryofcomputation
counting
sets
0
votes
12
BITS HD ELIGIBLITY
I have graduated from Electrical engineering in 2018. Am I eligible for Bits HD exam for admission in MTech (CS)??
answered
Feb 11, 2019
in
Other Colleges

512
views
bits
bitshd
admissions
+6
votes
13
Common Careless Mistakes
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones. Missing the NOT in question  our eyes have a tendency to focus on important words and ... many calculation mistakes. In any formula you do, you must get the correct unit for the result Please add more as answers.
answered
Jan 26, 2019
in
Revision

1.5k
views
mistakes
preparation
0
votes
14
Gateforum booklet
Please tell me that why BW is satisfied here I m facing problem in these topic
answered
Jan 15, 2019
in
Operating System

78
views
gateforumtestseries
mutualexclusion
0
votes
15
previous
https://gateoverflow.in/17235/gate199362 Explanation is not provided in the answer. Can anyone please give explanation for the answer.
answered
Dec 15, 2018
in
Digital Logic

59
views
digitallogic
+1
vote
16
Context free grammars
Any left factored ContextFree Grammar is both unambiguous and nonleftrecursive. True or false?
answered
Dec 13, 2018
in
Compiler Design

50
views
0
votes
17
How comes 2^231????? In floating point representation
answered
Dec 4, 2018
in
CO and Architecture

49
views
0
votes
18
#Self doubt Rosen
In the Rosen it is mentioned that P → Q is same as Q unless (negation P). Can someone please explain this...I m not getting the intuition behind this!
answered
Nov 26, 2018
in
Mathematical Logic

64
views
0
votes
19
Rosen
How many partial functions are there from a set with m elements to a set with n elements, where m and n are positive integers? My try : Partial functions are the ones which are undefined for some elements of domain. Now we will have to find cases like at least one element of ... on. from total possible functions from m to n if we do total  (all are mapped) it will be 0. How to approach it?
answered
Nov 20, 2018
in
Combinatory

228
views
+2
votes
20
Decidability
answered
Nov 16, 2018
in
Theory of Computation

155
views
theoryofcomputation
decidability
0
votes
21
GATE19872l
State whether the following statement are TRUE or FALSE. $A$ is recursive if both $A$ and its complement are accepted by Turing machines.
answered
Nov 15, 2018
in
Theory of Computation

965
views
gate1987
decidability
+10
votes
22
GATE201339
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the array $b$. The ... ); } EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }
answered
Oct 27, 2018
in
Operating System

12.1k
views
gate2013
operatingsystem
processsynchronization
normal
+2
votes
23
GATE200448
Consider two processes $P_1$ and $P_2$ accessing the shared variables $X$ and $Y$ protected by two binary semaphores $S_X$ and $S_Y$ respectively, both initialized to 1. $P$ and $V$ denote the usual semaphore operators, where $P$ decrements the semaphore value, and $V$ increments the semaphore value. The ... $P(S_X), P(S_X); P(S_Y), P(S_Y)$ $P(S_X), P(S_Y); P(S_X), P(S_Y)$
answered
Oct 26, 2018
in
Operating System

4.2k
views
gate2004
operatingsystem
processsynchronization
normal
0
votes
24
Context Free Language
Is L = { $a^{n}b^{n}c^{2n}$  n>=0 } a context free language?
answered
Oct 24, 2018
in
Theory of Computation

99
views
0
votes
25
GATE2008IT41
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Recently Used (LRU) page replacement policy. $\text{0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92}$ How many page faults ... $1, 2, 3, 4$ $7$ and $1, 2, 4, 5$ $8$ and $1, 2, 4, 5$ $9$ and $1, 2, 3, 5$
answered
Oct 23, 2018
in
Operating System

7.6k
views
gate2008it
operatingsystem
pagereplacement
normal
0
votes
26
Ace book
The minimal finite automata accepting the set of all strings over {0,1} starting with a 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states. The ans is 7 but according to me modulo n has 5 states .?
answered
Oct 22, 2018
in
Theory of Computation

163
views
contextfreelanguages
regularlanguages
theoryofcomputation
0
votes
27
Acebook
The minimal finite automata accepting the strings in r=0*1* has ________ states? for DFA its 3 states and for NFA its 2 states which one should i go with?
answered
Oct 22, 2018
in
Theory of Computation

90
views
finiteautomata
regularexpressions
+5
votes
28
left biasing and right biasing in B+ tree insertion
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
answered
Sep 30, 2018
in
Databases

1.5k
views
databases
btree
tree
+1
vote
29
GATE200544
What is the minimum number of ordered pairs of nonnegative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such that, $a \equiv c\mod 3$ and $b \equiv d \mod 5$ $4$ $6$ $16$ $24$
answered
Jul 17, 2018
in
Combinatory

5.4k
views
gate2005
settheory&algebra
normal
pigeonholeprinciple
Page:
1
2
next »
52,375
questions
60,554
answers
201,952
comments
95,375
users