User fade2black

87 votes

Accepted

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

answered Jul 19, 2017 at 1:05

48 votes

Accepted

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

answered Aug 31, 2017 at 17:09

24 votes

When are adjacency lists or matrices the better choice?

answered Jul 25, 2017 at 17:55

22 votes

Accepted

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

answered Oct 8, 2017 at 11:35

19 votes

Accepted

Is Python a context-free language?

answered Jul 16, 2017 at 10:29

17 votes

Accepted

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

answered Jun 11, 2017 at 20:51

17 votes

Accepted

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

answered Oct 1, 2017 at 22:16

11 votes

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

answered Aug 11, 2017 at 12:48

9 votes

Accepted

Prove that Hitting Set is NP-Complete

answered Sep 2, 2017 at 18:15

9 votes

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

answered Jun 16, 2017 at 10:41

9 votes

Accepted

Does DPDA accept all regular languages?

answered Sep 17, 2017 at 15:17

9 votes

Accepted

How does lexical analyzer remove white spaces from source file?

answered Oct 10, 2017 at 6:43

7 votes

Are there any countable sets that are not computably enumerable?

answered Sep 22, 2017 at 17:13

7 votes

Accepted

Meaning of $NL$ Complexity Class

answered Jul 9, 2017 at 12:13

7 votes

Accepted

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

answered Aug 17, 2017 at 9:12

7 votes

Accepted

Do NPDA work in parallel?

answered Aug 2, 2017 at 17:18

6 votes

Accepted

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

answered Aug 3, 2017 at 22:59

6 votes

Accepted

Using backtracking to find all possible permutations in a string

answered Aug 19, 2017 at 17:53

6 votes

Accepted

Knight on a chessboard

answered Aug 21, 2017 at 18:06

6 votes

Accepted

Analyzing time complexity for change making algorithm (Brute force)

answered Sep 10, 2017 at 4:50

6 votes

How does a nondeterministic Turing machine work?

answered Aug 29, 2017 at 19:28

6 votes

Accepted

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

answered Jul 27, 2017 at 19:18

6 votes

What is a "sentential form"?

answered Oct 10, 2017 at 17:41

6 votes

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

answered Oct 12, 2017 at 8:30

6 votes

Accepted

Decidability of whether a language described by Turing machine is regular

answered Dec 9, 2017 at 18:52

5 votes

Accepted

Solving the recurrence $T(n)=T(n−1)/T(n−2)$

answered Nov 4, 2017 at 11:20

5 votes

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

answered Sep 14, 2017 at 3:01

5 votes

Accepted

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

answered Jul 16, 2017 at 23:25

5 votes

determining whether a program halts or not

answered Jun 16, 2017 at 22:16

5 votes

Accepted

The Church-Turing-Thesis in proofs

answered Sep 10, 2017 at 22:31

Stack Exchange Network

270 Answers

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

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

When are adjacency lists or matrices the better choice?

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

Is Python a context-free language?

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

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

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

Prove that Hitting Set is NP-Complete

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

Does DPDA accept all regular languages?

How does lexical analyzer remove white spaces from source file?

Are there any countable sets that are not computably enumerable?

Meaning of $NL$ Complexity Class

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

Do NPDA work in parallel?

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

Using backtracking to find all possible permutations in a string

Knight on a chessboard

Analyzing time complexity for change making algorithm (Brute force)

How does a nondeterministic Turing machine work?

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

What is a "sentential form"?

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

Decidability of whether a language described by Turing machine is regular

Solving the recurrence $T(n)=T(n−1)/T(n−2)$

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

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

determining whether a program halts or not

The Church-Turing-Thesis in proofs