Register
Filter

Recent activity by shubham02

6 answers
3
ISRO2014-17
If each address space represents one byte of storage space, how many address lines are needed to access RAM chips arranged in a $4 \times 6$ array, where each chip is $8\;\text{K} \times 4$ bits? $13$ $15$ $16$ $17$
If each address space represents one byte of storage space, how many address lines are needed to access RAM chips arranged in a $4 \times 6$ array, where each chip is $8\...
5 answers
7
ISRO2018-31
A byte addressable computer has a memory capacity of $2$^{m}$KB$ ($k$ bytes) and can perform $2$^{n}$ operations. An instruction involving $3$ operands and one operator needs maximum of: $3m$ bits $3m + n$ bits $m + n$ bits none of the above
A byte addressable computer has a memory capacity of $2$$^{m}$$KB$ ($k$ bytes) and can perform $2$$^{n}$ operations. An instruction involving $3$ operands and one operato...
2 answers
10
made easy test series
1 answer
11
GATE 2015 SET-2 Q 29
Let the random variable X represent the number of times a fair coin needs to be tossed till two consecutive heads appear for the first time. The expectation of X is _______.
Let the random variable X represent the number of times a fair coin needs to be tossed till two consecutive heads appear for the first time. The expectation of X is _____...
1 answer
12
DBMS-Timestammp
Consider the following scenarios: The possible values of P and Q allowed under Thomas Write Rule but not under basic time stamp ordering protocol if TS(T2) > TS(T1) (a) W(B), W(C) (b) W(A), W(A) (c) Both (A) and (B) (d) None of these
Consider the following scenarios:The possible values of P and Q allowed under Thomas Write Rule but not under basic time stamp ordering protocol if TS(T2) TS(T1)(a) W(B)...
1 answer
15
Look-ahead buffer VS Look-aside buffer
What is the main difference between translation look aside buffer and translation look ahead buffer .
What is the main difference between translation look aside buffer and translation look ahead buffer .
0 answers
17
#self Doubt
Consider the below SDT: →+{(+)} → {(a)} What is/are the output(s) for the input string ++? (i) a+a+a (ii) aa+a+ (iii) aaa++ (iv) +a+aa (a) Only (i) (b) Only (ii) and (iii) (c) Only (ii) and (iv) (d) All Solution: Option (b) how 3 can be generated
Consider the below SDT:→+{(+)}→ {(a)}What is/are the output(s) for the input string ++?(i) a+a+a(ii) aa+a+(iii) aaa++(iv) +a+aa(a) Only (i) (b) Only (ii) and (iii) (c...
2 answers
18
grammer in compiler design
Which of the following grammars are not phase-structured? (a) regular (b) context-free (c) context-sensitive (d) none of the above
Which of the following grammars are not phase-structured?(a) regular (b) context-free(c) context-sensitive (d) none of the above
6 answers
24
GATE CSE 1996 | Question: 1.8
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string). $(00)^ * (\varepsilon +0)$ $(00)^*$ $0^*$ $0(00)^*$ (i) and (ii) (ii) and (iii) (i) and (iii) (iii) and (iv)
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string).$(00)^ * (\varepsilon +0)$$(00)^*$$0^*$$0(00)^*$(i) and (ii)(ii) a...