Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
BILLY
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by BILLY
6
answers
1
GATE CSE 1987 | Question: 10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
5.3k
views
answer edited
Mar 12, 2017
Theory of Computation
gate1987
theory-of-computation
regular-expression
descriptive
+
–
2
answers
2
Test by Bikram | Computer Networks | Test 1 | Question: 20
Two hosts $A$ and $B$ are connected via a Router $R$ with two links $L_1$ and $L_2.$ Each link is $125m$ long and has a bandwidth of $109 \;bps.$ If router queuing delay is $5$ microsec and propagation speed is $250,000$ km/sec the total transfer delay of $1$ kB packet from $A$ to $B$ is _______ microsec
Two hosts $A$ and $B$ are connected via a Router $R$ with two links $L_1$ and $L_2.$ Each link is $125m$ long and has a bandwidth of $109 \;bps.$ If router queuing delay...
1.1k
views
commented
Feb 7, 2017
Computer Networks
tbb-cn-1
numerical-answers
routing
+
–
3
answers
3
Test by Bikram | Mock GATE | Test 1 | Question: 6
What is the output of the following program? main( ) { int i=4, z=12; if( i=5 || z > 50) printf(“ Gate2017”); else printf(“ Gateoverflow”); } Gate2017 Gateoverflow syntax error Gate2017Gateoverflow
What is the output of the following program?main( ){int i=4, z=12;if( i=5 || z 50)printf(“ Gate2017”);elseprintf(“ Gateoverflow”);}Gate2017Gateoverflowsyntax err...
962
views
commented
Feb 6, 2017
GATE
tbb-mockgate-1
programming
programming-in-c
+
–
1
answer
4
Test by Bikram | Mock GATE | Test 1 | Question: 15
Let $R1, R2, R3$ be reader processes and let $W1$ and $W2$ be writer processes requesting shared data. If $R1$ is selected for access. Which of the statement is/are correct? Mutual exclusion is necessary for $R2$ and $R3$ No mutual exclusion is necessary for $R2$ ... $(iii)$ only $(ii)$ and $(iii)$ only $(iv)$ and $(iii)$ only $(i)$ and $(iv)$ only
Let $R1, R2, R3$ be reader processes and let $W1$ and $W2$ be writer processes requesting shared data. If $R1$ is selected for access. Which of the statement is/are corr...
334
views
commented
Feb 3, 2017
GATE
tbb-mockgate-1
process-synchronization
operating-system
+
–
7
answers
5
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is$\Theta(n)$$\Theta(\log n)...
36.3k
views
commented
Jan 30, 2017
Algorithms
gatecse-2008
normal
algorithms
time-complexity
+
–
3
answers
6
GATE CSE 2009 | Question: 46
In the RSA public key cryptosystem, the private and public keys are $(e, n)$ and $(d, n)$ respectively, where $n=p \times q$ and $p$ and $q$ are large primes. Besides, $n$ is public and $p$ and $q$ are private. Let $M$ be an integer ... Which of the above equations correctly represents RSA cryptosystem? I and II I and III II and IV III and IV
In the RSA public key cryptosystem, the private and public keys are $(e, n)$ and $(d, n)$ respectively, where $n=p \times q$ and $p$ and $q$ are large primes. Besides, $n...
7.3k
views
commented
Jan 28, 2017
Computer Networks
gatecse-2009
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
4
answers
7
GATE CSE 2012 | Question: 48
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += + ... $\begin{array}{lll} 3 & & 1 & \\ 5 & & 2 & \\ 5 & & 2 & \end{array}$
Consider the following C code segment.int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf(“ \n %d %d ”, a, ...
13.7k
views
commented
Jan 12, 2017
Programming in C
gatecse-2012
programming
programming-in-c
normal
+
–
2
answers
8
Virtual Gate Test Series: Algorithms - Matrix Chain Ordering
Consider the following chain of matrices $A_{1}$ to $A_{4}$ having dimensions given below $A_{1}\rightarrow 2\times 3$ $A_{2}\rightarrow 3\times 5$ $A_{3}\rightarrow 5\times 4$ $A_{4}\rightarrow 4\times 2$ The following table is filled ... of scalar multiplications$:$ What are the values of $P$ and $Q?$ $60,140$ $60,82$ $60,40$ $60,92$
Consider the following chain of matrices $A_{1}$ to $A_{4}$ having dimensions given below$A_{1}\rightarrow 2\times 3$$A_{2}\rightarrow 3\times 5$$A_{3}\rightarrow 5\times...
1.2k
views
answered
Jan 12, 2017
Algorithms
algorithms
dynamic-programming
matrix-chain-ordering
virtual-gate-test-series
+
–
3
answers
9
Two process critical section software solution
// a software solution for critical section problem bool flag[2]; int turn; void process(int id) { while(true) { flag[id] = true; while(turn != id) { while(flag[1-id]); turn = id; } < Critical Section > ... return 0; } Which of the following is false ? Mutual exclusion is satisfied. Progress is satisfied. Bounded waiting is satisfied. None.
// a software solution for critical section problem bool flag ; int turn; void process(int id) { while(true) { flag[id] = true; while(turn != id) { while(flag[1-id]); tur...
2.5k
views
commented
Jan 11, 2017
Operating System
operating-system
process-synchronization
critical-section
+
–
1
answer
10
Peterson Solution
How to check the bound waiting progress in Petersn Solution to Critical Problems
How to check thebound waitingprogressin Petersn Solution to Critical Problems
1.2k
views
commented
Jan 11, 2017
Operating System
operating-system
process-synchronization
+
–
1
answer
11
super key
for a relation R = ( A,B,C,D,E,F ) ,Candidate keys are AF, BF, CF, DF. how many super keys are possible?
for a relation R = ( A,B,C,D,E,F ) ,Candidate keys are AF, BF, CF, DF.how many super keys are possible?
387
views
answered
Jan 8, 2017
9
answers
12
GATE CSE 2012 | Question: 34, ISRO-DEC2017-32
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of a...
29.8k
views
commented
Jan 7, 2017
Computer Networks
gatecse-2012
computer-networks
subnetting
normal
isrodec2017
+
–
16
answers
13
GATE CSE 2012 | Question: 33
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of val...
21.7k
views
commented
Jan 7, 2017
Probability
gatecse-2012
probability
conditional-probability
normal
+
–
1
answer
14
Adder
872
views
commented
Jan 4, 2017
Digital Logic
digital-logic
adder
+
–
8
answers
15
GATE CSE 2015 Set 1 | Question: 39
Consider the operations $\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$ Which one of the following is correct? Both $\left\{\textit{f} \right\}$ and ... $\left\{ \textit{f}\right\}$ nor $\left\{\textit{g}\right\}$ is functionally complete
Consider the operations$\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$Which one of the following is correct?Both $\left\{\textit...
26.9k
views
commented
Jan 3, 2017
Digital Logic
gatecse-2015-set1
boolean-algebra
difficult
+
–
3
answers
16
TIFR CSE 2017 | Part A | Question: 4
Which of the following functions asymptotically grows the fastest as $n$ goes to infinity? $(\log \: \log \: n)!$ $(\log \: \log \: n)^ {\log \: n}$ $(\log \: \log \: n)^{\log \: \log \: \log \: n}$ $(\log \: n)^{\log \: \log \: n}$ $2^{\sqrt{\log \: \log \: n}}$
Which of the following functions asymptotically grows the fastest as $n$ goes to infinity?$(\log \: \log \: n)!$$(\log \: \log \: n)^ {\log \: n}$$(\log \: \log \: n)^{\l...
3.9k
views
commented
Dec 26, 2016
Algorithms
tifr2017
algorithms
asymptotic-notation
+
–
5
answers
17
GATE CSE 1987 | Question: 1-xviii
Let $P$ be a quicksort program to sort numbers in ascending order. Let $t_{1}$ and $t_{2}$ be the time taken by the program for the inputs $\left[1 \ 2 \ 3 \ 4\right]$ and $\left[5 \ 4 \ 3 \ 2 \ 1\right]$, respectively. Which of the following holds? $t_{1} = t_{2}$ $t_{1} > t_{2}$ $t_{1} < t_{2}$ $t_{1}=t_{2}+5 \log 5$
Let $P$ be a quicksort program to sort numbers in ascending order. Let $t_{1}$ and $t_{2}$ be the time taken by the program for the inputs $\left[1 \ 2 \ 3 \ 4\right]$ an...
14.9k
views
commented
Dec 25, 2016
Algorithms
gate1987
algorithms
sorting
quick-sort
+
–
11
answers
18
GATE CSE 2016 Set 1 | Question: 55
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ ... $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80\...
26.1k
views
commented
Dec 14, 2016
Computer Networks
gatecse-2016-set1
computer-networks
stop-and-wait
normal
numerical-answers
+
–
16
answers
19
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
53.6k
views
commented
Dec 14, 2016
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
+
–
5
answers
20
GATE CSE 2015 Set 3 | Question: 38
In the network $200.10.11.144/27$, the $\text{fourth}$ octet (in decimal) of the last $\text{IP}$ address of the network which can be assigned to a host is _______.
In the network $200.10.11.144/27$, the $\text{fourth}$ octet (in decimal) of the last $\text{IP}$ address of the network which can be assigned to a host is _______.
16.0k
views
commented
Dec 8, 2016
Computer Networks
gatecse-2015-set3
computer-networks
subnetting
normal
numerical-answers
+
–
18
answers
21
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...
48.1k
views
commented
Nov 26, 2016
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
6
answers
22
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.1k
views
commented
Nov 22, 2016
Theory of Computation
gatecse-2006
theory-of-computation
context-free-language
normal
+
–
2
answers
23
GATE CSE 1999 | Question: 7
Show that the language $L = \left\{ xcx \mid x \in \left\{0,1\right\}^* \text{ and }c\text{ is a terminal symbol}\right\}$ is not context free. $c$ is not $0$ or $1$.
Show that the language $$L = \left\{ xcx \mid x \in \left\{0,1\right\}^* \text{ and }c\text{ is a terminal symbol}\right\}$$ is not context free. $c$ is not $0$ or $1$.
5.0k
views
commented
Nov 22, 2016
Theory of Computation
gate1999
theory-of-computation
context-free-language
normal
proof
+
–
1
answer
24
ullman (toc)
design cfg for (i) {aibjck|i=j+k} (ii){aibj|i<=2j}
design cfg for(i) {aibjck|i=j+k}(ii){aibj|i<=2j}
542
views
asked
Nov 18, 2016
Theory of Computation
theory-of-computation
context-free-grammar
+
–
9
answers
25
GATE IT 2004 | Question: 31
Let $p, q, r$ and $s$ be four primitive statements. Consider the following arguments: $P: [(¬p\vee q) ∧ (r → s) ∧ (p \vee r)] → (¬s → q)$ $Q: [(¬p ∧q) ∧ [q → (p → r)]] → ¬r$ $R: [[(q ∧ r) → p] ∧ (¬q \vee p)] → r$ $S: [p ∧ (p → r) ∧ (q \vee ¬ r)] → q$ Which of the above arguments are valid? $P$ and $Q$ only $P$ and $R$ only $P$ and $S$ only $P, Q, R$ and $S$
Let $p, q, r$ and $s$ be four primitive statements. Consider the following arguments:$P: [(¬p\vee q) ∧ (r → s) ∧ (p \vee r)] → (¬s → q)$$Q: [(¬p ∧q) �...
11.7k
views
commented
Nov 7, 2016
Mathematical Logic
gateit-2004
mathematical-logic
normal
propositional-logic
+
–
2
answers
26
Self Doubt
Q : Each process Pi , i = 1 to 9 executes the following code : while (TRUE) { P(mutex); Critical section ; V(mutex); } The process P10 executes the following code : while(TRUE) { V(mutex); critical section ; P(mutex); } Initial value of binary semaphore "mutex" = ... at any instant of time? a) 2 b) 3 c) 9 d) 10 e) 1 Plz explain in details which one is true out of these options.
Q : Each process Pi , i = 1 to 9 executes the following code : while (TRUE) { P(mutex); Critical section ; V(mutex);}The process P10 executes the foll...
2.8k
views
commented
Oct 21, 2016
Operating System
operating-system
process-synchronization
binary-semaphore
+
–
2
answers
27
Doubt in some basic things synchronisation
I have some fundamental doubts regarding the conditions which need to be followed for a correct synchronisation solution i.e. about mutual exclusion , progress and bounded wait. I m asking these. Plz address to these doubts but give a ... for the fact whether the bounded wait condition is satisfied or not? Also plz support your answer with proper reason..
I have some fundamental doubts regarding the conditions which need to be followed for a correct synchronisation solution i.e. about mutual exclusion , progress and bounde...
1.3k
views
commented
Oct 21, 2016
Operating System
operating-system
process-synchronization
+
–
4
answers
28
ISRO2014-63
Consider the following table The table is in which normal form? First Normal Form Second Normal Form Third Normal Form but not BCNF Third Normal Form and BCNF
Consider the following tableThe table is in which normal form?First Normal FormSecond Normal FormThird Normal Form but not BCNFThird Normal Form and BCNF
8.3k
views
commented
Aug 29, 2016
Databases
isro2014
databases
database-normalization
+
–
6
answers
29
GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what ... of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512...
14.0k
views
commented
Aug 28, 2016
Databases
gatecse-2002
databases
b-tree
normal
ugcnetcse-june2012-paper2
+
–
1
answer
30
Find best choice for degree for B+ tree,
Consider a relation R(A B C) with attribute size of A as 8 bytes. Disk block size is 512 bytes and block pointer is 8 bytes. The best choice for degree (maximum value) for B+ tree, if B+ tree was used for creating indexing on R(A B C) is _________.
Consider a relation R(A B C) with attribute size of A as 8 bytes. Disk block size is 512 bytes and block pointer is 8 bytes. The best choice for degree (maximum value) fo...
2.3k
views
commented
Aug 28, 2016
Databases
databases
b-tree
indexing
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register