Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
sdshubham6
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sdshubham6
0
answers
1
Admission
With gate score of 770 and rank 350 is there any chances of getting direct admission in iit guwahati or roorkee or hyderabad? Someone please answer this.
With gate score of 770 and rank 350 is there any chances of getting direct admission in iit guwahati or roorkee or hyderabad?Someone please answer this.
940
views
commented
Apr 6, 2019
IISc/IITs
admissions
mtech
iit
+
–
1
answer
2
gate admission
What should i prefer for mtech? iiitb or iit hyd?
What should i prefer for mtech? iiitb or iit hyd?
851
views
asked
Mar 27, 2019
IISc/IITs
admissions
iit
iiit
getting-to-iits
+
–
1
answer
3
GATE ADMISSIONS
Is it true that mtech seats in iits are increased this year? Please someone tell me this as it’ll be very helpful in deciding college for admission
Is it true that mtech seats in iits are increased this year?Please someone tell me this as it’ll be very helpful in deciding college for admission
728
views
asked
Mar 18, 2019
IISc/IITs
gate-2019
mtech
career-advice
+
–
11
answers
4
GATE CSE 2019 | Question: 50
What is the minimum number of $2$-input NOR gates required to implement a $4$ -variable function expressed in sum-of-minterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
What is the minimum number of $2$-input NOR gates required to implement a $4$ -variable function expressed in sum-of-minterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ ...
30.0k
views
commented
Mar 15, 2019
Digital Logic
gatecse-2019
numerical-answers
digital-logic
canonical-normal-form
2-marks
+
–
10
answers
5
GATE CSE 2019 | Question: 35
Consider the first order predicate formula $\varphi$: $\forall x [ ( \forall z \: z | x \Rightarrow (( z=x) \vee (z=1))) \rightarrow \exists w ( w > x) \wedge (\forall z \: z | w \Rightarrow ((w=z) \vee (z=1)))]$ Here $a \mid b$ denotes ... of all integers Which of the above sets satisfy $\varphi$? $S_1$ and $S_2$ $S_1$ and $S_3$ $S_2$ and $S_3$ $S_1, S_2$ and $S_3$
Consider the first order predicate formula $\varphi$:$\forall x [ ( \forall z \: z | x \Rightarrow (( z=x) \vee (z=1))) \rightarrow \exists w ( w x) \wedge (\forall z \:...
19.8k
views
comment reshown
Feb 10, 2019
Mathematical Logic
gatecse-2019
engineering-mathematics
discrete-mathematics
mathematical-logic
first-order-logic
2-marks
+
–
10
answers
6
GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that ord...
28.3k
views
commented
Jan 24, 2019
Operating System
gatecse-2014-set2
operating-system
page-replacement
ambiguous
+
–
2
answers
7
Chip Select
Ans. C
Ans. C
384
views
answered
Jan 23, 2019
CO and Architecture
co-and-architecture
+
–
6
answers
8
GATE CSE 2001 | Question: 2.15
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices? $\frac{n(n-1)} {2}$ $2^n$ $n!$ $2^\frac{n(n-1)} {2} $
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices?$\frac{n(n-1)} {2}$$2^n$$n!$$2^\f...
14.0k
views
commented
Jan 20, 2019
Graph Theory
gatecse-2001
graph-theory
normal
counting
+
–
2
answers
9
DFS , how to slove it?
1.4k
views
commented
Dec 28, 2018
DS
depth-first-search
algorithms
graph-algorithm
+
–
4
answers
10
GATE CSE 2008 | Question: 26
If $P, Q, R$ are Boolean variables, then $(P + \bar{Q}) (P.\bar{Q} + P.R) (\bar{P}.\bar{R} + \bar{Q})$ simplifies to $P.\bar{Q}$ $P.\bar{R}$ $P.\bar{Q} + R$ $P.\bar{R} + Q$
If $P, Q, R$ are Boolean variables, then$(P + \bar{Q}) (P.\bar{Q} + P.R) (\bar{P}.\bar{R} + \bar{Q})$ simplifies to$P.\bar{Q}$$P.\bar{R}$$P.\bar{Q} + R$$P.\bar{R} + Q$
10.4k
views
commented
Oct 26, 2018
Digital Logic
gatecse-2008
easy
digital-logic
boolean-algebra
+
–
6
answers
11
GATE IT 2004 | Question: 75
A relation $\text{Empdtl}$ ... and $\textsf{1NF}$ $\textsf{BCNF}$ and hence also in $\textsf{3NF}$, $\textsf{2NF}$ and $\textsf{1NF}$
A relation $\text{Empdtl}$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, fo...
17.5k
views
commented
Oct 5, 2018
Databases
gateit-2004
databases
database-normalization
normal
+
–
2
answers
12
GATE CSE 2015 Set 3 | Question: 32
Which of the following languages are context-free? $L_1: \left\{a^mb^na^nb^m \mid m, n \geq 1\right\}$ $L_2: \left\{a^mb^na^mb^n \mid m, n \geq 1\right\}$ $L_3: \left\{a^mb^n \mid m = 2n +1 \right\}$ $L_1$ and $L_2$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_3$ only
Which of the following languages are context-free?$L_1: \left\{a^mb^na^nb^m \mid m, n \geq 1\right\}$$L_2: \left\{a^mb^na^mb^n \mid m, n \geq 1\right\}$$L_3: \left\{a^mb^...
14.9k
views
commented
Aug 24, 2018
Theory of Computation
gatecse-2015-set3
theory-of-computation
context-free-language
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register