List questions from computer-science

Published on 25 Mar 2026 - 5:59

1.6k

Views

Find tight asymptotic upper bound for T(n)

Published on 25 Mar 2026 - 15:46

450

Views

Question in proving a recurrence relation for Catalan numbers

Published on 20 Mar 2026 - 8:26

446

Views

When is a planar embedding unique?

Published on 04 Apr 2018 - 20:22

32

Views

How many ways are there to get the number with the sum of $n$ nonnegative integers with constraints?

Published on 06 Apr 2018 - 0:14

1.1k

Views

Is the regular expression: $(\lambda + a)^$ equivalent to $a^$?

Published on 07 Apr 2018 - 22:14

370

Views

How to unify a pair of atomic formulas?

Published on 23 Feb 2026 - 8:24

540

Views

Converting NFA to DFA using TG and RE

Published on 25 Mar 2026 - 1:21

272

Views

How to represent a directed acyclic graph in a way that makes it easy to conduct an inductive proof?

Published on 26 Mar 2026 - 14:20

218

Views

How one can define rigorously the time and space complexities of algorithms?

Published on 25 Mar 2026 - 22:23

673

Views

computing $n^{th}$ Schröder number

Published on 25 Mar 2026 - 5:59

91

Views

proof 0 (f (n)) = 0 (g(n)) if and only if f (n) E 0 (g(n)) and g(n) E O (f (n))

Published on 25 Mar 2026 - 15:37

392

Views

Given a byte in 2’s complement What is 0x56 in decimal?

Published on 12 Apr 2018 - 21:45

6.2k

Views

Let G be the language of all string over {0,1} that do not contain a pair of 1s that are separated by a odd number of symbols.

Published on 25 Mar 2026 - 3:04

226

Views

Turing machine - Reducible

Published on 26 Mar 2026 - 23:50

List Question

Show that Skolemization preserves satisfiability

Find tight asymptotic upper bound for T(n)

Question in proving a recurrence relation for Catalan numbers

When is a planar embedding unique?

How many ways are there to get the number with the sum of $n$ nonnegative integers with constraints?

Is the regular expression: $(\lambda + a)^$ equivalent to $a^$?

How to unify a pair of atomic formulas?

Converting NFA to DFA using TG and RE

How to represent a directed acyclic graph in a way that makes it easy to conduct an inductive proof?

How one can define rigorously the time and space complexities of algorithms?

computing $n^{th}$ Schröder number

proof 0 (f (n)) = 0 (g(n)) if and only if f (n) E 0 (g(n)) and g(n) E O (f (n))

Given a byte in 2’s complement What is 0x56 in decimal?

Let G be the language of all string over {0,1} that do not contain a pair of 1s that are separated by a odd number of symbols.

Turing machine - Reducible

Trending Questions

Popular # Hahtags

Popular Questions