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
Questions by Sunil8860
–2
votes
0
answers
1
program output
360
views
asked
Sep 21, 2017
Programming in C
programming-in-c
bad-question
+
–
0
votes
1
answer
2
cogestion window
276
views
asked
Sep 19, 2017
Computer Networks
congestion-control
+
–
0
votes
1
answer
3
Virtual GATE test series
594
views
asked
Sep 19, 2017
Computer Networks
application-layer-protocols
+
–
2
votes
1
answer
4
split horizon
suppose C-D link is broken then what will be the vector of D instantaneously ??
suppose C-D link is broken then what will be the vector of D instantaneously ??
612
views
asked
Sep 16, 2017
Computer Networks
split-horizon
distance-vector-routing
+
–
0
votes
1
answer
5
doubts
The Token Bucket is filled at rate of 2 Mbps. Is this means that after one second 2Mb of data will be available at the bucket ready to be sent to the network ? what about the number of token produced?
The Token Bucket is filled at rate of 2 Mbps.Is this means that after one second 2Mb of data will be available at the bucket ready to be sent to the network ?what about t...
542
views
asked
Sep 5, 2017
Computer Networks
computer-networks
token-bucket
+
–
1
votes
0
answers
6
turing machine and language
235
views
asked
Sep 4, 2017
Theory of Computation
turing-machine
+
–
1
votes
1
answer
7
decidability
413
views
asked
Sep 4, 2017
Theory of Computation
theory-of-computation
decidability
+
–
1
votes
0
answers
8
languages
200
views
asked
Sep 4, 2017
Theory of Computation
theory-of-computation
regular-language
context-free-language
+
–
0
votes
0
answers
9
context free grammer
239
views
asked
Sep 4, 2017
Theory of Computation
regular
expression
+
–
3
votes
2
answers
10
regular expression
820
views
asked
Sep 4, 2017
Theory of Computation
regular
expression
+
–
2
votes
1
answer
11
doubts
I am not getting the question
I am not getting the question
283
views
asked
Sep 4, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
12
set-up time of flip flop
what is meant by set up time in this question?
what is meant by set up time in this question?
160
views
asked
Aug 31, 2017
Digital Logic
digital-logic
+
–
0
votes
1
answer
13
adder
This is binary to radix -12 circuit, how?
This is binary to radix -12 circuit, how?
671
views
asked
Aug 30, 2017
Digital Logic
digital-logic
adder
+
–
0
votes
0
answers
14
waveforms
Que:- You are given a free running clock with a duty cycle of 50% and a digital waveform f which changes only at the negative edge of the clock. Which one of the following circuits (using clocked D flip-flops) will delay the phase of f by 180°? I don't get what is duty cycle of 50% means and and what is meant by delay the phase by 180?
Que:-You are given a free running clock with a duty cycle of 50% and a digital waveform f which changes only at the negativeedge of the clock. Which one of the following ...
329
views
asked
Aug 29, 2017
Digital Logic
digital-logic
+
–
1
votes
2
answers
15
gate 2014
which is faster, synchronous circuits or asynchronous circuits and why?
which is faster, synchronous circuits or asynchronous circuits and why?
1.3k
views
asked
Aug 29, 2017
Digital Logic
digital-logic
synchronous-asynchronous-circuits
asynchronous-circuit
+
–
1
votes
2
answers
16
Decidability
True/False? The complement of every Turning decidable language is Turning decidable
True/False? The complement of every Turning decidable language is Turning decidable
752
views
asked
Aug 16, 2017
Theory of Computation
theory-of-computation
decidability
+
–
1
votes
0
answers
17
Doubt
Suppose there are two FA's F1 and F2 and given that L(F1) = L(F2) then it means F1 and F2 are same .
Suppose there are two FA's F1 and F2 and given that L(F1) = L(F2) then it means F1 and F2 are same .
345
views
asked
Aug 16, 2017
CO and Architecture
theory-of-computation
finite-automata
regular-language
+
–
1
votes
0
answers
18
Context free language
Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is stack alphabet, δ is the state transition ... : Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton? A 10110 B 10010 C 01010 D 01001
Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per usual convention) Q is the set of states, Σ is the input al...
564
views
asked
Aug 16, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
1
votes
1
answer
19
Closure
Context-free grammar is closed over intersection true/false.
Context-free grammar is closed over intersection true/false.
315
views
asked
Aug 16, 2017
CO and Architecture
theory-of-computation
closure-property
+
–
1
votes
1
answer
20
doubt
what is the RE of the above DFA?
what is the RE of the above DFA?
457
views
asked
Aug 15, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register