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
–4 votes
107 views
in GATE 107 views

Please log in or register to answer this question.

Related questions

8 votes
2 answers
1
14.1k views
Design a counter for the following binary sequence: 0,4,5,3,1,6,2,7 and repeat.Use JK flip-flops
asked Apr 7, 2016 in Digital Logic pC 14.1k views
0 votes
2 answers
2
552 views
A list of elements are given A - <3,1,4,1,5,9,2,6,5,3,5,8,9 > Show Howw the "Pivot" and quick sort algorithm work. finally show the Best Case analysis for quick sort .
asked Apr 15, 2017 in Algorithms LavTheRawkstar 552 views
4 votes
2 answers
3
1.5k views
In P-persistent CSMA network there are 5 systems in a slot. The probability of station not transmitting the data is 0.6. Only two stations should transmit the data to avoid collision. What is the probability that channel is collision free? My answer is 0.6825 and answer given is 0.34 - 0.35. I solved this as P (no collision) = either 2 stations are transmitting or 1 station or none.
asked Jan 29, 2015 in Computer Networks Vikrant Singh 1.5k views
2 votes
3 answers
4
454 views
With quick sort The results after first partioning of the given array. A = (2,8,7,1,3,5,6,4,9). Analysis the time complexity of Quick sort in the best case.
asked Apr 15, 2017 in Algorithms LavTheRawkstar 454 views
...