The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
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 Doraemon
User Doraemon
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Doraemon
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
GATE2006IT65
In the $4B/5B$ encoding scheme, every $4$ bits of data are encoded in a $5$bit codeword. It is required that the codewords have at most $1$ leading and at most $1$ trailing zero. How many are such codewords possible? $14$ $16$ $18$ $20$
answered
Nov 21, 2019
in
Computer Networks

3.3k
views
gate2006it
computernetworks
encoding
permutationandcombination
normal
0
votes
2
GATE200447
Consider a system with a twolevel paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. The ... instruction execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
answered
Nov 18, 2019
in
CO and Architecture

22.1k
views
gate2004
coandarchitecture
virtualmemory
normal
+1
vote
3
TIFR2019B10
Let the language $D$ be defined in the binary alphabet $\{0,1\}$ as follows: $D:= \{ w \in \{0,1\}^* \mid \text{ substrings 01 and 10 occur an equal number of times in w} \}$ For example , $101 \in D$ while $1010 \notin D$. Which of the ... ? $D$ is regular $D$ is contextfree but not regular $D$ is decidable but not contextfree $D$ is decidable but not in NP $D$ is undecidable
answered
Nov 11, 2019
in
Theory of Computation

319
views
tifr2019
theoryofcomputation
identifyclasslanguage
0
votes
4
GATE19992.10
A multiuser, multiprocessing operating system cannot be implemented on hardware that does not support Address translation DMA for disk transfer At least two modes of CPU execution (privileged and nonprivileged) Demand paging
answered
Nov 5, 2019
in
Operating System

4.5k
views
gate1999
operatingsystem
normal
virtualmemory
0
votes
5
GATE2005IT42
Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$, as shown below. $\begin{array}{ll}\hline \textbf{P1} & \textbf{P2} \\ \text{Compute: } & \text{Compute;} \\ \text{Use $ ... If only binary semaphores are used to enforce the above scheduling constraints, what is the minimum number of binary semaphores needed? $1$ $2$ $3$ $4$
answered
Sep 18, 2019
in
Operating System

3.8k
views
gate2005it
operatingsystem
processsynchronization
normal
0
votes
6
GATE200619
Let $L_1=\{0^{n+m}1^n0^m\mid n,m\geq 0 \}$, $L_2=\{0^{n+m}1^{n+m}0^m\mid n,m\geq 0\}$ and $L_3=\{0^{n+m}1^{n+m}0^{n+m}\mid n,m\geq 0\} $. Which of these languages are NOT context free? $L_1$ only $L_3$ only $L_1$ and $L_2$ $L_2$ and $L_3$
answered
Aug 31, 2019
in
Theory of Computation

3.3k
views
gate2006
theoryofcomputation
contextfreelanguages
normal
0
votes
7
GATE20033
Let $P(E)$ denote the probability of the event $E$. Given $P(A) = 1$, $P(B) =\dfrac{1}{2}$, the values of $P(A\mid B)$ and $P(B\mid A)$ respectively are $\left(\dfrac{1}{4}\right),\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{2}\right),\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{2}\right),{1}$ ${1},\left(\dfrac{1}{2}\right)$
answered
Aug 28, 2019
in
Probability

2.6k
views
gate2003
probability
easy
conditionalprobability
0
votes
8
GATE200552
A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is: $\frac{1}{2^n}$ $1  \frac{1}{n}$ $\frac{1}{n!}$ $1  \frac{1}{2^n}$
answered
Aug 28, 2019
in
Probability

2k
views
gate2005
probability
binomialdistribution
easy
+6
votes
9
GATE201837
A lexical analyzer uses the following patterns to recognize three tokens $T_1$, $T_2$, and $T_3$ over the alphabet $\{a, b, c\}$. $T_1$: $a?(b \mid c)^*a$ $T_2$: $b?(a \mid c)^*b$ $T_3$: $c?(b \mid a)^*c$ Note that ... prefix. If the string bbaacabc is processes by the analyzer, which one of the following is the sequence of tokens it outputs? $T_1T_2T_3$ $T_1T_1T_3$ $T_2T_1T_3$ $T_3T_3$
answered
Aug 17, 2019
in
Compiler Design

5.4k
views
gate2018
compilerdesign
lexicalanalysis
normal
0
votes
10
GATE201039
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$
answered
Aug 1, 2019
in
Theory of Computation

4.9k
views
gate2010
theoryofcomputation
regularexpressions
normal
+1
vote
11
self doubt
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
answered
Mar 26, 2019
in
Algorithms

133
views
algorithms
dynamicprogramming
matrixchainordering
50,737
questions
57,300
answers
198,282
comments
104,993
users