Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by tusharp
5
votes
1
made easy test series - lossless join and dependency preserving
How is A answer?
How is A answer?
1.0k
views
answered
Apr 12, 2019
Databases
lossless-decomposition
databases
dependency-preserving
database-normalization
+
–
5
votes
2
Madeeasy Discrete Maths notes
How many 5 letter word possible having atleast 2 a's ?
How many 5 letter word possible having atleast 2 a's ?
931
views
answered
Apr 9, 2019
Combinatory
madeeasy-notes
discrete-mathematics
combinatory
+
–
3
votes
3
Kenneth Rosen Edition 7 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$}
Determine whether each of these statements is true or false.$0$ $ \epsilon$ $\phi$$\phi$ $\epsilon$ {$0$}{$0$} $ \subset$ {$ \phi$}$\phi$ $\subset$ {$0$}{$0$} $\epsilon$ ...
472
views
answered
Apr 5, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
votes
4
Kenneth Rosen Edition 7 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$}}
Determine whether each of these statements is true or false.$\phi$ $ \epsilon$ {$\phi$}$\phi$ $\epsilon$ {$\phi,$ { $\phi$}}{$\phi$} $ \epsilon$ {$ \phi$}{$\phi$} $\epsil...
439
views
answered
Apr 5, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
0
votes
5
self doubt-LONGEST MASK MATCHING-NETWORK LAYER
what is the intuition behing longest mask matching when different masks gives the same source ID for a given IP address??
what is the intuition behing longest mask matching when different masks gives the same source ID for a given IP address??
429
views
answered
Apr 4, 2019
2
votes
6
Self doubt
Is CONVOY Effect possible in "Longest job first" non preemptive scheduling policy ?
Is CONVOY Effect possible in "Longest job first" non preemptive scheduling policy ?
691
views
answered
Apr 1, 2019
Operating System
operating-system
+
–
1
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.
Find all strings in $L((a + b) b (a + ab)^*)$ of length less than four.
698
views
answered
Apr 1, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-expression
+
–
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 ?
$L = \left \{ x^{l}y^{m}z^{n} | \ l+m+n\ is\ divisible\ by\ 5\right \}$Is it regular or CFL or CSL ?
709
views
answered
Mar 27, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
1
votes
9
Proposition Logic-Rosen(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?
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,...
2.6k
views
answered
Mar 27, 2019
Mathematical Logic
mathematical-logic
discrete-mathematics
kenneth-rosen
propositional-logic
+
–
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
If $L = \Bigl \{ x \mid x \in \{ a, b, c \}^*, \text{The length of $x$ is a square } \Bigr \}$ then $L$ isRegularRecursive but not context freeContext Free but not regula...
620
views
answered
Mar 25, 2019
Theory of Computation
theory-of-computation
identify-class-language
virtual-gate-test-series
+
–
0
votes
11
Turing Machine Self Doubt
Can someone explain in details how set of all TM is countable?
Can someone explain in details how set of all TM is countable?
612
views
answered
Mar 24, 2019
Theory of Computation
turing-machine
theory-of-computation
counting
set-theory
+
–
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)??
I have graduated from Electrical engineering in 2018. Am I eligible for Bits HD exam for admission in MTech (CS)??
1.4k
views
answered
Feb 11, 2019
Other Colleges
bits
bits-hd
admissions
+
–
9
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.
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 “...
4.1k
views
answered
Jan 26, 2019
Revision
mistakes
preparation
+
–
0
votes
14
Gateforum booklet
Please tell me that why BW is satisfied here I m facing problem in these topic
Please tell me that why BW is satisfied here I m facing problem in these topic
572
views
answered
Jan 15, 2019
Operating System
gateforum-test-series
mutual-exclusion
+
–
0
votes
15
previous
https://gateoverflow.in/17235/gate1993-6-2 Explanation is not provided in the answer. Can anyone please give explanation for the answer.
https://gateoverflow.in/17235/gate1993-6-2Explanation is not provided in the answer. Can anyone please give explanation for the answer.
321
views
answered
Dec 15, 2018
Digital Logic
digital-logic
+
–
2
votes
16
Context free grammars
Any left factored Context-Free Grammar is both unambiguous and non-left-recursive. True or false?
Any left factored Context-Free Grammar is both unambiguous and non-left-recursive. True or false?
432
views
answered
Dec 12, 2018
Compiler Design
compiler-design
context-free-grammar
ambiguous-grammar
true-false
+
–
0
votes
17
How comes 2^23-1????? In floating point representation
372
views
answered
Dec 3, 2018
1
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!
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!
343
views
answered
Nov 26, 2018
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?
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 whic...
1.7k
views
answered
Nov 20, 2018
2
votes
20
Decidability
481
views
answered
Nov 15, 2018
Theory of Computation
theory-of-computation
decidability
+
–
2
votes
21
GATE CSE 1987 | Question: 2l
State whether the following statement are TRUE or FALSE. $A$ is recursive if both $A$ and its complement are accepted by Turing machines.
State whether the following statement are TRUE or FALSE.$A$ is recursive if both $A$ and its complement are accepted by Turing machines.
3.5k
views
answered
Nov 15, 2018
Theory of Computation
gate1987
theory-of-computation
turing-machine
decidability
true-false
+
–
20
votes
22
GATE CSE 2013 | Question: 39
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 ... EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }
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 decompo...
28.4k
views
answered
Oct 27, 2018
Operating System
gatecse-2013
operating-system
process-synchronization
normal
+
–
2
votes
23
GATE CSE 2004 | Question: 48
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 ... $P(S_X), P(S_X); P(S_Y), P(S_Y)$ $P(S_X), P(S_Y); P(S_X), P(S_Y)$
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. ...
11.7k
views
answered
Oct 26, 2018
Operating System
gatecse-2004
operating-system
process-synchronization
normal
+
–
0
votes
24
Context Free Language
Is L = { $a^{n}b^{n}c^{2n}$ | n>=0 } a context free language?
Is L = { $a^{n}b^{n}c^{2n}$ | n>=0 } a context free language?
623
views
answered
Oct 24, 2018
1
votes
25
GATE IT 2008 | Question: 41
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 ... $1, 2, 3, 4$ $7$ and $1, 2, 4, 5$ $8$ and $1, 2, 4, 5$ $9$ and $1, 2, 3, 5$
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 Re...
23.8k
views
answered
Oct 23, 2018
Operating System
gateit-2008
operating-system
page-replacement
normal
+
–
1
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 .?
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 m...
1.3k
views
answered
Oct 22, 2018
Theory of Computation
context-free-language
regular-language
theory-of-computation
+
–
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?
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?
531
views
answered
Oct 21, 2018
Theory of Computation
finite-automata
regular-expression
+
–
11
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 ?
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 ?
6.4k
views
answered
Sep 30, 2018
Databases
databases
b-tree
tree
+
–
2
votes
29
GATE CSE 2005 | Question: 44
What is the minimum number of ordered pairs of non-negative 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$
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such th...
13.5k
views
answered
Jul 17, 2018
Combinatory
gatecse-2005
set-theory&algebra
normal
pigeonhole-principle
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
