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
Recent activity by Ciado
18
answers
1
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.7k
views
comment edited
Jul 1, 2017
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
3
answers
2
ISRO2017-26
Advantage of synchronous sequential circuits over asynchronous one is : Lower hardware requirement Better noise immunity Faster operation All of the above
Advantage of synchronous sequential circuits over asynchronous one is :Lower hardware requirementBetter noise immunityFaster operationAll of the above
10.7k
views
commented
May 8, 2017
Digital Logic
isro2017
digital-logic
digital-circuits
bad-question
+
–
1
answer
3
Complexity
We have for Counting Sort, O(n+k), for a simple uniform hashing, search operation of O(1+alpha) etc. What is the meaning when we say n + k? Is it that counting sort will depend on either n or k? Because there are separate loops in counting sort running on O(n) and O(k) separately. What does O(n + k) mean? What kind of algorithms have this summation for their order, generally?
We have for Counting Sort, O(n+k), for a simple uniform hashing, search operation of O(1+alpha) etc. What is the meaning when we say n + k? Is it that counting sort will ...
524
views
asked
Apr 27, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
sorting
+
–
5
answers
4
GATE CSE 2015 Set 3 | Question: 27
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size of a problem that can be solved in $6$ minutes? $256$ $512$ $1024$ $2018$
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size ...
20.1k
views
answered
Apr 23, 2017
Algorithms
gatecse-2015-set3
algorithms
sorting
+
–
0
answers
5
Morris Mano Digital Design
a'b + a'c' + abc needs to be expressed in POS form. I tried to do without constructing truth table but by distributing '+' over '.'. How to express this as POS by distributing?
a'b + a'c' + abc needs to be expressed in POS form. I tried to do without constructing truth table but by distributing '+' over '.'. How to express this as POS by dist...
511
views
asked
Apr 20, 2017
Others
digital-logic
+
–
0
answers
6
PSU recruitment
Has IOCL published list of shortlisted candidates?
Has IOCL published list of shortlisted candidates?
382
views
asked
Apr 17, 2017
Job Queries
psu
+
–
2
answers
7
ISRO2015-59
Alpha and Beta testing are forms of Acceptance testing Integration testing System testing Unit testing
Alpha and Beta testing are forms ofAcceptance testingIntegration testingSystem testingUnit testing
6.5k
views
commented
Mar 28, 2017
IS&Software Engineering
isro2015
is&software-engineering
software-testing
+
–
1
answer
8
ISRO2015-66
Consider an uncompressed stereo audio signal of CD quality which is sampled at 44.1 kHz and quantized using 16 bits. What is required storage space if a compression ratio of 0.5 is achieved for 10 seconds of this audio? 172 KB 430 KB 860 KB 1720 KB
Consider an uncompressed stereo audio signal of CD quality which is sampled at 44.1 kHz and quantized using 16 bits. What is required storage space if a compression ratio...
4.7k
views
commented
Mar 28, 2017
Multimedia
isro2015
multimedia
non-gate
audio-compression
+
–
1
answer
9
Theory of Computation Study doubt
Are proofs in Theory of Computation required for Gate? Or will learning the theorems and skipping the proofs suffice? What about its consequences in Interviews to PSU?
Are proofs in Theory of Computation required for Gate? Or will learning the theorems and skipping the proofs suffice? What about its consequences in Interviews to PSU?
341
views
asked
Mar 26, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register