menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Questions by nilamd

2 votes
1 answer
3
Verify whether 4-3-1-1 code is self complementing or nt?
Please provide codes for 0-9 decimal using 4311 code..i am little bit confused in it..I know the property that addition 9 makes it self complemetory..but how m nt understanding..plz help..
Please provide codes for 0-9 decimal using 4311 code..i am little bit confused in it..I know the property that addition 9 makes it self complemetory..but how m nt understanding..plz help..
asked Jan 12, 2016 in Digital Logic 726 views
3 votes
2 answers
4
Limits
Please give the answer with full solution.
Please give the answer with full solution.
asked Jan 5, 2016 in Calculus 304 views
2 votes
0 answers
5
For a length of string n,how many transactions will be there for acceptance of the string?
For a length of string n,how many transactions will be there for acceptance of the string? O(n) O(n^2) O(nlogn) O(n^3)
asked Dec 24, 2015 in Theory of Computation 154 views
16 votes
1 answer
6
How many recoverable schedules are possible from T1 and T2?
Consider the following Two Transactions. A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $51$ $52$ $55$ $56$ B) How many cascadeless recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $41$ $42$ $45$ $50$
Consider the following Two Transactions. A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $51$ $52$ $55$ $56$ B) How many cascadeless recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $41$ $42$ $45$ $50$
asked Dec 21, 2015 in Databases 2.2k views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...