List questions from computer-science

Published on 11 Apr 2026 - 18:07

108

Views

Method of Complements in Base 17 Given a base 10 number.

Published on 11 Apr 2026 - 22:55

263

Views

Fast Rational Bézier Surface Evaluation Problem

Published on 12 Apr 2026 - 10:41

62

Views

Prove that an upper bound is incorrect

Published on 13 Apr 2026 - 1:12

30

Views

If $1/2 ≤ p/q ≤ 2$ , then $p-q$ is representable exactly on the computer

Published on 26 Mar 2026 - 22:14

670

Views

(Un)countable set of regular language.

Published on 31 Mar 2016 - 10:30

102

Views

Prove that $(()())\in P$ (the set of balanced paranthesis) and $))(() \notin P$

Published on 27 Mar 2026 - 14:59

362

Views

Optimization of English Braille: Using the fewest dots

Published on 01 Apr 2016 - 18:03

290

Views

if f and g are monotonically increasing functions, such that f(g(n))=O(n) and f(n)=Ω(n) then g(n)=O(n)

Published on 01 Apr 2016 - 21:17

403

Views

What does leading $0s$ in a number in scientific notation mean?

Published on 26 Mar 2026 - 19:05

83

Views

How do we tell arithemetic addition or subtraction from floating point numbers?

Published on 10 Apr 2026 - 18:46

89

Views

Minimal Elements with respect to big Oh

Published on 12 Apr 2026 - 2:18

143

Views

Loop invariants in logic

Published on 09 Apr 2026 - 20:40

819

Views

Maximum number of strict binary trees that can be made, each having exactly n leaf nodes.

Published on 31 Mar 2026 - 21:33

196

Views

non-deterministic automaton and regular expression

Published on 26 Mar 2026 - 9:14

List Question

Finding a function to map from logical to physical addresses

Method of Complements in Base 17 Given a base 10 number.

Fast Rational Bézier Surface Evaluation Problem

Prove that an upper bound is incorrect

If $1/2 ≤ p/q ≤ 2$ , then $p-q$ is representable exactly on the computer

(Un)countable set of regular language.

Prove that $(()())\in P$ (the set of balanced paranthesis) and $))(() \notin P$

Optimization of English Braille: Using the fewest dots

if f and g are monotonically increasing functions, such that f(g(n))=O(n) and f(n)=Ω(n) then g(n)=O(n)

What does leading $0s$ in a number in scientific notation mean?

How do we tell arithemetic addition or subtraction from floating point numbers?

Minimal Elements with respect to big Oh

Loop invariants in logic

Maximum number of strict binary trees that can be made, each having exactly n leaf nodes.

non-deterministic automaton and regular expression

Trending Questions

Popular # Hahtags

Popular Questions