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 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
1
answer
1
Kenneth Rosen Edition 6th Exercise 5.6 Question 37 (Page No. 390)
How many solutions are there to the equation x1+x2+x3=17 with x1<6, x3>5?
commented
Mar 18
in
Combinatory

388
views
kennethrosen
discretemathematics
combinatory
0
answers
2
Introduction to Linear Algebra 4th edition Problem Set 1.1
How many corner does a cube have in 4 dimensions? How many 3D faces? Now by observation we can tell that, an ndimensional cube has $2^n$ corners. 1D cube which is a line have $2^1$ corners 2D cube which is a square have $2^2$ ... . but this is the question i'm not able to answer. How every Ncube have $2n$ cubes of dimension (N1)?
commented
Feb 26
in
Linear Algebra

111
views
linearalgebra
2
answers
3
ISRO202040
Which of the following classes of languages can validate an $\text{IPv4}$ address in dotted decimal format? It is to be ensured that the decimal values lie between $0$ and $255$. RE and higher CFG and higher CSG and higher Recursively enumerable language
commented
Feb 22
in
Theory of Computation

316
views
isro2020
theoryofcomputation
normal
6
answers
4
GATE2020CS26
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M. $L_1 = \{\left \langle M \right \rangle \mid L(M) = \varnothing \}$ ... $L_1$, $L_3$, and $L_4$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_2$, $L_3$, and $L_4$ only
answer edited
Feb 12
in
Theory of Computation

1.2k
views
gate2020cs
theoryofcomputation
decidability
8
answers
5
GATE201210
The protocol data unit (PDU) for the application layer in the Internet stack is: Segment Datagram Message Frame
answered
Jan 10
in
Computer Networks

5.8k
views
gate2012
computernetworks
applicationlayerprotocols
easy
5
answers
6
GATE200559
Consider the grammar: $E \rightarrow E + n \mid E \times n \mid n$ For a sentence $n + n \times n$, the handles in the rightsentential form of the reduction are: $n, E + n$ and $E + n \times n$ $n, E + n$ and $E + E \times n$ $n, n + n$ and $n + n \times n$ $n, E + n$ and $E \times n$
commented
Jan 7
in
Compiler Design

3.9k
views
gate2005
compilerdesign
grammar
normal
4
answers
7
TIFR2010A18
Let $X$ be a set of size $n$. How many pairs of sets (A, B) are there that satisfy the condition $A\subseteq B \subseteq X$ ? $2^{n+1}$ $2^{2n}$ $3^{n}$ $2^{n} + 1$ $3^{n + 1}$
commented
Jan 3
in
Set Theory & Algebra

989
views
tifr2010
sets
2
answers
8
Left linear grammar
Consider the following right linear grammar. S>aA/abc A>aA/bB/a B>bB/cC/b C>cC/c Find left linear grammar is equivalent to the above right linear grammar?
answered
Dec 30, 2019
in
Theory of Computation

346
views
theoryofcomputation
7
answers
9
GATE201821
Consider the following $\text{C}$ program: #include<stdio.h> int counter=0; int calc (int a, int b) { int c; counter++; if(b==3) return (a*a*a); else { c = calc(a, b/3); return (c*c*c); } } int main() { calc(4, 81); printf("%d", counter); } The output of this program is ______.
commented
Dec 29, 2019
in
Programming

3.5k
views
gate2018
programminginc
numericalanswers
recursion
programming
1
answer
10
Post correspondence problem
commented
Dec 26, 2019
in
Theory of Computation

373
views
theoryofcomputation
4
answers
11
GATE2014243
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block size implies a ... block size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty
commented
Dec 22, 2019
in
CO and Architecture

7.4k
views
gate20142
coandarchitecture
cachememory
normal
4
answers
12
GATE200877
Delayed branching can help in the handling of control hazards The following code is to run on a pipelined processor with one branch delay slot: I1: ADD $R2 \leftarrow R7 + R8$ I2: Sub $R4 \leftarrow R5 – R6$ I3: ADD $R1 \leftarrow R2 + R3$ ... Which of the instructions I1, I2, I3 or I4 can legitimately occupy the delay slot without any program modification? I1 I2 I3 I4
commented
Dec 22, 2019
in
CO and Architecture

4.9k
views
gate2008
coandarchitecture
pipelining
normal
2
answers
13
Sum of Data dependencies
$I_1 : MUL \ \ \ \ \ R_1, R_2, R_3$ // $R_1 \leftarrow R_2 \times R_3$ $I_2 : ADD \ \ \ \ \ R_4, R_4, R_1$ $I_3 : MUL \ \ \ \ \ R_1, R_5, R_6$ $I_4 : SUB \ \ \ \ \ R_4, R_4, R_1$ Sum of RAW, WAR and WAW dependencies is _____.
edited
Dec 20, 2019
in
CO and Architecture

132
views
datahazards
datadependences
coandarchitecture
11
answers
14
GATE2007IT28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
commented
Dec 11, 2019
in
DS

7.6k
views
gate2007it
datastructures
hashing
probability
normal
1
answer
15
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 3 (Page No. 317)
Suppose that we have a production $A\rightarrow BCD$. Each of the four nonterminals $A, B, C,$ and $D$ have two attributes: $s$ is a synthesized attribute, and $i$ is an inherited attribute. For each of the sets of rules below, tell whether the rules are consistent ... $A.s=D.i,B.i=A.s+C.s,C.i=B.s,$ and $D.i=B.i+C.i.$
commented
Dec 8, 2019
in
Compiler Design

348
views
ullman
compilerdesign
syntaxdirectedtranslation
1
answer
16
Left Recursion Removal
Remove Left Recursion from the following Context Free Grammar. $S \rightarrow Aa Sac$ $A \rightarrow AbSde$
answered
Dec 5, 2019
in
Compiler Design

289
views
leftrecursion
compilerdesign
0
answers
17
Left linear grammar to regular expression
edited
Nov 29, 2019
in
Theory of Computation

116
views
1
answer
18
Probability Gravner 79.c
A random variable $X$ has the density function $f(x)= \begin{Bmatrix} c(x+\sqrt{x}) & x\epsilon [0,1]\\ 0& otherwise \end{Bmatrix}.$ (c) Determine the probability density function of $Y$ $=$ $X^2$
answer edited
Nov 28, 2019
in
Probability

75
views
probability
gravner
engineeringmathematics
randomvariable
1
answer
19
Probability  Gravner69.b
$f(x) = \begin{Bmatrix} cx & if (0<x<4) \\ 0 & otherwise \end{Bmatrix}$ (c) Determine EX and Var(X).
commented
Nov 27, 2019
in
Probability

53
views
probability
gravner
engineeringmathematics
randomvariable
1
answer
20
Probability  Gravner69.b
$f(x) = \begin{Bmatrix} cx & if (0<x<4) \\ 0 & otherwise \end{Bmatrix}$ (b) Compute $P(1\leqslant X\leqslant 2)$
commented
Nov 27, 2019
in
Probability

55
views
probability
gravner
engineeringmathematics
randomvariable
1
answer
21
Probability  Gravner69.a
$f(x) = \begin{Bmatrix} cx & if (0<x<4) \\ 0 & otherwise \end{Bmatrix}$ (a) Determine $c$.
commented
Nov 27, 2019
in
Probability

42
views
gravner
probability
engineeringmathematics
randomvariable
4
answers
22
How many solutions are there to the equation x+y+z=17 ?They are nonnegative integers
commented
Nov 27, 2019
in
Combinatory

1.5k
views
combinatory
1
answer
23
X and Y are two independent random variables
X and Y are two independent random variables with variances 1 and 2 respectively. Let Z=XY. The variance of Z is _____.
commented
Nov 27, 2019
in
Probability

535
views
probability
4
answers
24
GATE2006IT22
When a coin is tossed, the probability of getting a Head is $p, 0 < p < 1$. Let $N$ be the random variable denoting the number of tosses till the first Head appears, including the toss where the Head appears. Assuming that successive tosses are independent, the expected value of $N$ is $\dfrac{1}{p}$ $\dfrac{1}{(1  p)}$ $\dfrac{1}{p^{2}}$ $\dfrac{1}{(1  p^{2})}$
answered
Nov 26, 2019
in
Probability

2.9k
views
gate2006it
probability
binomialdistribution
expectation
normal
3
answers
25
MadeEasy Test Series: Operating System  Memory Management
Consider a machine with byte addressable memory 32 bits virtual addresses, 32 bits physical addresses and 4 KB page size. If a twolevel page table system is used where each page table occupies one page and page table entries of 4 B each, then the memory overhead for this machine is ________ KB please explain.
commented
Nov 23, 2019
in
Operating System

514
views
madeeasytestseries
operatingsystem
memorymanagement
1
answer
26
GATE20002.23
Which of the following is not a valid deadlock prevention scheme? Release all resources before requesting a new resource. Number the resources uniquely and never request a lower numbered resource than the last one requested. Never request a resource after releasing any resource. Request and all required resources be allocated before execution.
commented
Nov 17, 2019
in
Operating System

4.4k
views
gate2000
operatingsystem
resourceallocation
normal
1
answer
27
Data communication and networking by forouzan 12.7 Exercise Qn 16
16. In a CDMA/CD network with a data rate of 10 Mbps, the maximum distance between any station pair is found to be 2500 m for the correct operation of the collision detection process. What should be the maximum distance if we increase the data rate to 100 Mbps? To 1 Gbps? To 10 Gbps?
answered
Nov 7, 2019
in
Computer Networks

244
views
computernetworks
pure_aloha
slotted_aloha
1
answer
28
Data communication and networking by forouzan 12.7 Exercise Qn 15
15. In a CDMA/CD network with a data rate of 10 Mbps, the minimum frame size is found to be 512 bits for the correct operation of the collision detection process. What should be the minimum frame size if we increase the data rate to 100 Mbps? To 1 Gbps? To 10 Gbps?
answered
Nov 7, 2019
in
Computer Networks

145
views
computernetworks
pure_aloha
slotted_aloha
1
answer
29
Data communication and networking by forouzan 12.7 Exercise
11. We have a pure ALOHA network with 100 stations. If $T_{fr} = 1 \mu s$, what is the number of frames each station can send to achieve the maximum efficiency. 12. Repeat Exercise 11 for slotted ALOHA.
edited
Nov 7, 2019
in
Computer Networks

196
views
computernetworks
slotted_aloha
pure_aloha
4
answers
30
GATE199102iv
Match the pairs in the following questions by writing the corresponding letters only. ...
edited
Oct 17, 2019
in
Combinatory

1.6k
views
gate1991
combinatory
normal
matchthefollowing
52,217
questions
59,907
answers
201,098
comments
118,145
users