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 ankitron
0
votes
1
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
The regular expression $0^*(10^*)^*$ denotes the same set as$(1^*0)^*1^*$$0+(0+10)^*$$(0+1)^*10(0+1)^*$None of the above
19.3k
views
answered
Nov 22, 2019
Theory of Computation
gatecse-2003
theory-of-computation
regular-expression
easy
+
–
1
votes
2
IES 2018_Digital Logic_Counter
For what minimum value of propagation delay in each filp-flop will a 10 bit ripple counter skip a count, when it is clocked at 10 MHz? a) 5 ns b) 10 ns c) 20 ns d) 40 ns
For what minimum value of propagation delay in each filp-flop will a 10 bit ripple counter skip a count, when it is clocked at 10 MHz?a) 5 nsb) 10 nsc) 20 nsd) 40 ns
2.6k
views
answered
Nov 12, 2019
Digital Logic
digital-logic
ies
ies-2018
+
–
4
votes
3
GATE CSE 2010 | Question: 46
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: $\text{if} (i\%2==0) \{$ $\quad\text{if} (i<n) \text{ request } R_i;$ ... which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as fol...
29.3k
views
answered
Nov 11, 2019
Operating System
gatecse-2010
operating-system
resource-allocation
normal
+
–
1
votes
4
Heap..
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________. -------------------------------------------------------------------------------------------------------------------------- 2)The number of min heap trees are possible with 15 elements_________________
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________. 2)The...
7.5k
views
answered
Oct 19, 2019
Programming in C
binary-heap
+
–
0
votes
5
Heap..
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________. -------------------------------------------------------------------------------------------------------------------------- 2)The number of min heap trees are possible with 15 elements_________________
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________. 2)The...
7.5k
views
answered
Oct 19, 2019
Programming in C
binary-heap
+
–
2
votes
6
testS
The round trip delay between X and Y is given as 60 ms and bottle neck bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and channel is full duplex
The round trip delay between X and Y is given as 60 ms and bottle neck bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the ...
1.8k
views
answered
May 10, 2019
0
votes
7
algorithms
374
views
answered
Jul 12, 2018
Algorithms
algorithms
time-complexity
test-series
+
–
0
votes
8
Asymptotic notation
2.0k
views
answered
Jul 12, 2018
Algorithms
asymptotic-notation
test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register