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 thor
0
votes
0
answers
211
Explain following lines
Turing machine model of computation are: 1. A finite amount of internal state. 2. An infinite amount of external data storage. 3. A program specified by a finite number of instructions in a predefined language. 4. Self-reference: the programming language is expressive enough to write an interpreter for its own programs.
Turing machine model of computation are:1. A finite amount of internal state.2. An infinite amount of external data storage.3. A program specified by a finite number of i...
210
views
asked
Nov 14, 2016
Theory of Computation
theory-of-computation
turing-machine
+
–
–1
votes
0
answers
212
Explain
128
views
asked
Nov 14, 2016
0
votes
0
answers
213
FSM :
Please explain
Please explain
192
views
asked
Nov 14, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
1
votes
2
answers
214
ACE test series :
359
views
asked
Oct 6, 2016
Operating System
test-series
operating-system
+
–
2
votes
1
answer
215
digital question
A J.K. flip flop can be made from an S.R. flip flop by using $2$ additional a). AND gates b). OR gates c). NAND gates d). NOT gates Please explain it clearly ?
A J.K. flip flop can be made from an S.R. flip flop by using $2$ additionala). AND gatesb). OR gatesc). NAND gatesd). NOT gatesPlease explain it clearly ?
1.9k
views
asked
Oct 5, 2016
Digital Logic
digital-logic
syllabus
+
–
4
votes
1
answer
216
MadeEasy Test Series: Operating System - Process Synchronization
966
views
asked
Sep 25, 2016
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
0
votes
2
answers
217
OS:
1.5k
views
asked
Sep 25, 2016
Operating System
test-series
operating-system
process-scheduling
+
–
1
votes
1
answer
218
Mutual exclusion :
Can Mutual exclusion can be enforced with a general semaphore initial value is greater than 1 ? I think yes. Consider a semaphore $S = 2$, and following code segment for both processes. P(S); P(S); <Critical Section> V(S); V(S);
Can Mutual exclusion can be enforced with a general semaphore initial value is greater than 1 ?I think yes. Consider a semaphore $S = 2$, and following code segment for b...
1.2k
views
asked
Sep 25, 2016
Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
semaphore
+
–
1
votes
0
answers
219
OS
193
views
asked
Sep 22, 2016
Operating System
operating-system
+
–
4
votes
1
answer
220
OS :
Assume memory access time is 10 μs and reading a page from disk takes 10 ms. If page fault occur in 0.5% of the memory references then what is the average memory access time (in μsec)?
Assume memory access time is 10 μs and reading a page from disk takes 10 ms. If page fault occur in 0.5% of the memory references then what is the average memory access ...
795
views
asked
Sep 22, 2016
Operating System
operating-system
test-series
+
–
0
votes
0
answers
221
I think my answer is correct: (OS-III)
274
views
asked
Sep 22, 2016
1
votes
0
answers
222
doubt
How do we calculate throughput of a scheduling algorithm? Throughput = no. of processes completed/schedule length [Ace] OR throughput = no. of processes completed/(time at which first process started - time at which last process ended) [MadeEasy] Both are same when there is no context switching overhead but which formula to use when there is context overhead.
How do we calculate throughput of a scheduling algorithm?Throughput = no. of processes completed/schedule length [Ace]ORthroughput = no. of processes completed/(time at w...
198
views
asked
Sep 21, 2016
1
votes
1
answer
223
ACE test series 2017 #digital
I think answer is wrong.
I think answer is wrong.
632
views
asked
Sep 9, 2016
Digital Logic
test-series
+
–
3
votes
1
answer
224
Convert Binary to excess-3
Someone help me out.
Someone help me out.
5.0k
views
asked
Sep 8, 2016
Digital Logic
digital-logic
+
–
Page:
« prev
1
...
6
7
8
9
10
11
12
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register