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 Doraemon
14
votes
1
GATE CSE 2004 | Question: 20
Which of the following addressing modes are suitable for program relocation at run time? Absolute addressing Based addressing Relative addressing Indirect addressing I and IV I and II II and III I, II and IV
Which of the following addressing modes are suitable for program relocation at run time?Absolute addressingBased addressingRelative addressingIndirect addressingI and IVI...
12.2k
views
answered
Jun 2, 2020
CO and Architecture
gatecse-2004
co-and-architecture
addressing-modes
easy
+
–
4
votes
2
GATE IT 2006 | Question: 65
In the $\text{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$
In the $\text{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...
10.1k
views
answered
Nov 21, 2019
Computer Networks
gateit-2006
computer-networks
encoding
combinatory
normal
out-of-gate-syllabus
+
–
0
votes
3
GATE CSE 2004 | Question: 47
Consider a system with a two-level 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. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...
63.9k
views
answered
Nov 17, 2019
CO and Architecture
gatecse-2004
co-and-architecture
virtual-memory
normal
+
–
1
votes
4
TIFR CSE 2019 | Part B | Question: 10
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$ ... $D$ is context-free but not regular $D$ is decidable but not context-free $D$ is decidable but not in NP $D$ is undecidable
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}...
2.0k
views
answered
Nov 11, 2019
Theory of Computation
tifr2019
theory-of-computation
identify-class-language
+
–
1
votes
5
GATE CSE 1999 | Question: 2.10
A multi-user, multi-processing 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 non-privileged) Demand paging
A multi-user, multi-processing operating system cannot be implemented on hardware that does not supportAddress translationDMA for disk transferAt least two modes of CPU e...
12.8k
views
answered
Nov 5, 2019
Operating System
gate1999
operating-system
normal
virtual-memory
+
–
0
votes
6
GATE IT 2005 | Question: 42
Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$ ... binary semaphores are used to enforce the above scheduling constraints, what is the minimum number of binary semaphores needed? $1$ $2$ $3$ $4$
Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$, as shown below.$$\begin{array}{|l|l|}\hline \textbf{P1} & \textbf{P2} \\ \text...
12.9k
views
answered
Sep 18, 2019
Operating System
gateit-2005
operating-system
process-synchronization
normal
+
–
0
votes
7
GATE CSE 2006 | Question: 19
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$
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 c...
15.5k
views
answered
Aug 31, 2019
Theory of Computation
gatecse-2006
theory-of-computation
context-free-language
normal
+
–
0
votes
8
GATE CSE 2003 | Question: 3
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)$
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...
11.8k
views
answered
Aug 28, 2019
Probability
gatecse-2003
probability
easy
conditional-probability
+
–
0
votes
9
GATE CSE 2005 | Question: 52
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}$
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 probabili...
8.7k
views
answered
Aug 28, 2019
Probability
gatecse-2005
probability
binomial-distribution
easy
+
–
40
votes
10
GATE CSE 2018 | Question: 37
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)^\ast a$ $T_2: b?(a \mid c)^\ast b$ ... the string $bbaacabc$ is processed 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$
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)^\ast a$$T_2: b?(a \mid c...
21.4k
views
answered
Aug 17, 2019
Compiler Design
gatecse-2018
compiler-design
lexical-analysis
normal
2-marks
+
–
1
votes
11
GATE CSE 2010 | Question: 39
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^*$
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 express...
22.4k
views
answered
Aug 1, 2019
Theory of Computation
gatecse-2010
theory-of-computation
regular-expression
normal
+
–
2
votes
12
self doubt
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
1.5k
views
answered
Mar 26, 2019
Algorithms
algorithms
dynamic-programming
matrix-chain-ordering
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
