menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Recent Posts
Feedback to GATE Overflow Test Takers
GATE 2021 – Online registration portal
IIT Madras MS CS Interview Experience - 2020
JEST TCS (Theoretical Computer Science) EXAM || Gateway of IISc other than GATE exam
Divisibility language and Minimum Number of States in a DFA accepting a binary number divisible by 'n'
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(1k)
GATE
(466)
CBSE/UGC NET
(234)
CSIR NET
(2)
TIFR
(277)
CMI
(0)
ISI
(3)
ISRO
(34)
BARC
(6)
IIITH-PGEE
(8)
BITS-HD
(0)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(873)
Recent Blog Comments
In a hurry I took Ace and made easy test series...
What was you GATE score and rank? Did they ask...
Thanks for sharing this useful and informative...
hello mrinmoy brother , what was your rank in...
I got access to test series. Thank you.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Morge sort the array 9,6,5,0,8,2
–4
votes
107
views
asked
Nov 24, 2016
in
GATE
Amit parida
107
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
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 | IIIT-Hyderbad
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
digital-logic
flip-flop
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 >
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 .
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
algorithms
quicksort
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?
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
computer-networks
csma-cd
2
votes
3
answers
4
454
views
With quick sort The results after first partioning of the given array
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.
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
algorithms
quicksort
time-complexity
sorting
...