Computer Science

Famous Question

 Famous Question
Question with 10,000 views. This badge can be awarded multiple times.
Awarded 884 times.
To prove the recurrence by substitution method $T(n) = 7T(n/2) + n^2$
Awarded Sep 20 at 17:46
Worst case $O(n \ln n)$ in place stable sort?
Awarded Sep 20 at 13:56
How is data written to RAM
Awarded Sep 17 at 15:25
Proving that language $ L = \{ a^{2n}: n \geq 1\}$ is regular
Awarded Sep 16 at 8:05
What happens when an internet connection is faster than the storage write speed?
Awarded Sep 13 at 7:35
Why do we need so many transistors in a chip, and how are they managed?
Awarded Sep 9 at 12:07
What is an optimal algorithm?
Awarded Sep 5 at 12:28
How many times is a for loop executed?
Awarded Sep 1 at 10:07
What are lattices used for?
Awarded Aug 28 at 12:56
How to solve recurrence T(n) = 2T(n/2) + n/log(n) using substitution method
Awarded Aug 26 at 18:16
Are there subexponential-time algorithms for NP-complete problems?
Awarded Aug 24 at 14:26
Does space complexity analysis usually include output space?
Awarded Aug 14 at 6:31
Are modern programming languages context-free?
Awarded Aug 12 at 21:03
Effect of increasing the capacity of an edge in a flow network with known max flow
Awarded Aug 11 at 12:38
Time complexity of base conversion
Awarded Jul 29 at 14:25
What is a 'Key' in computer science?
Awarded Jul 29 at 4:27
What are the simplest examples of programs that we do not know whether they terminate?
Awarded Jul 27 at 0:40
How to show that L*=(L*)*?
Awarded Jul 20 at 7:36
Difference between Lamport timestamps and Vector clocks
Awarded Jul 16 at 20:06
Can the human brain be considered Turing complete? [duplicate]
Awarded Jul 12 at 20:37
Proof that TAUT is coNP-complete (or that a problem is coNP-complete if its complement is NP-complete)
Awarded Jul 9 at 10:56
DFA which accepts all strings starting and ending with 'aa'
Awarded Jul 6 at 2:32
Which combinations of pre-, post- and in-order sequentialisation are unique?
Awarded Jul 3 at 2:15
Cross Edge and Back Edge when doing BFS
Awarded Jun 28 at 18:56
Construct a DFA with reduced states equivalent to 10 + (0 + 11)0*1
Awarded Jun 21 at 19:21
What is the name the class of functions described by O(n log n)?
Awarded Jun 21 at 15:46
How do computers perform operations on numbers that are larger than 64 bits?
Awarded Jun 13 at 2:25
Proving that the shortest simple path problem between two vertices $s$ and $t$ in a graph is NP-complete
Awarded Jun 10 at 8:11
Calculator for time complexity of recursive functions
Awarded Jun 4 at 21:56
Kleene star and Kleene plus
Awarded May 27 at 11:22
Minimum spanning tree with two minimum edge weights
Awarded May 20 at 10:06
Reduce Vertex cover to SAT
Awarded May 19 at 20:31
Are there any non-finite automata?
Awarded May 5 at 8:28
What is a "sentential form"?
Awarded May 4 at 6:51
Why is O(n log n) the best runtime there is?
Awarded Apr 26 at 20:07
Why are so many internet protocols text-based?
Awarded Apr 23 at 14:10
NP-complete proof from Dasgupta problem on Kite
Awarded Apr 23 at 3:25
Do system calls always means a context switch?
Awarded Apr 22 at 10:46
Intersection and union of a regular and a non-regular language
Awarded Apr 20 at 13:35
If A is mapping reducible to B then the complement of A is mapping reducible to the complement of B
Awarded Apr 17 at 23:25
Why do we need to run the bellman-ford algorithm for n-1 times?
Awarded Apr 13 at 18:37
How many rotations after AVL insertion and deletion
Awarded Apr 13 at 2:17
Min/max height of B-tree
Awarded Mar 30 at 23:31
What is the difference between decidability and computability?
Awarded Mar 28 at 4:04
Find non-overlapping scheduled jobs with maximum cost
Awarded Mar 15 at 21:47
How is the rule 110 Turing complete?
Awarded Mar 14 at 12:45
Why is $\Theta$ notation suitable to insertion sort to describe its worst case running time?
Awarded Mar 11 at 22:57
Is a balanced binary tree a complete binary tree?
Awarded Feb 25 at 18:05
Time complexity formula of nested loops
Awarded Feb 20 at 14:03
Sort array of 5 integers with a max of 7 compares
Awarded Feb 18 at 1:41
Destination-based vs source-based routing
Awarded Feb 15 at 20:14
Why is the optimal cut-off for switching from Quicksort to Insertion sort machine dependent?
Awarded Feb 15 at 7:10
LL(1) parsing table construction
Awarded Feb 14 at 19:16
What is the sequence of numbers for N = 6? [closed]
Awarded Feb 11 at 9:57
NFAs with more than one initial state
Awarded Feb 7 at 4:58
reduction from 3-SAT to Subset Sum problem
Awarded Feb 5 at 18:10
Difference between heuristic and approximation algorithm?
Awarded Feb 2 at 11:25
Changing variables in recurrence relations
Awarded Jan 28 at 7:15
Proof that the regular languages are closed under string homomorphism
Awarded Jan 25 at 5:36
A median of an AVL. How to take advantage of the AVL?
Awarded Jan 23 at 21:46
1
2 3 4 5
…
15

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.