fade2black's user avatar
fade2black's user avatar
fade2black's user avatar
fade2black
  • Member for 6 years, 9 months
  • Last seen more than a week ago
  • Berlin, Germany
87 votes
Accepted

Why is the log in the big-O of binary search not base 2?

47 votes
Accepted

How can I multiply a binary representation by ten using logic gates?

24 votes

When are adjacency lists or matrices the better choice?

22 votes
Accepted

How to find 5 repeated values in O(n) time?

19 votes
Accepted

Is Python a context-free language?

17 votes
Accepted

What is meant by the term "prior" in machine learning

17 votes
Accepted

Are there any algorithms or data structures that need to find the median value of a set?

11 votes

Can the "divide" step in a merge sort be avoided?

9 votes
Accepted

Prove that Hitting Set is NP-Complete

9 votes

How are variables stored in and retrieved from the program stack?

9 votes
Accepted

Does DPDA accept all regular languages?

9 votes
Accepted

How does lexical analyzer remove white spaces from source file?

7 votes

Are there any countable sets that are not computably enumerable?

7 votes
Accepted

Meaning of $NL$ Complexity Class

7 votes
Accepted

How to prove that average complexity is N/2 for linear search in the unsorted array

7 votes
Accepted

Do NPDA work in parallel?

6 votes
Accepted

Why we can't use non-deterministic turing machines in this case?

6 votes
Accepted

Using backtracking to find all possible permutations in a string

6 votes
Accepted

Knight on a chessboard

6 votes
Accepted

Analyzing time complexity for change making algorithm (Brute force)

6 votes
Accepted

Finding $L^*$ when $L=\{a^nb^n | n \geq 1\}$

6 votes

What is a "sentential form"?

6 votes

Why are DCFL not closed under concatenation or Union whereas CFL is?

6 votes
Accepted

Decidability of whether a language described by Turing machine is regular

5 votes
Accepted

Solving the recurrence $T(n)=T(nāˆ’1)/T(nāˆ’2)$

5 votes
Accepted

The Church-Turing-Thesis in proofs

5 votes

Examples of sets $A$ and $B$ such that $A \leq_m B$ but not $B \leq_m A$

5 votes
Accepted

Algorithm to determine which vertices/edges would disconnect undirected graph if removed

5 votes

determining whether a program halts or not

5 votes

How does a nondeterministic Turing machine work?

1
2 3 4 5
ā€¦
9