Question

Calculation of CPU Utilization Problem

score 23.3k · Answer 1 · 2019-04-07 18:01:33

23.3k

Views

Calculation of CPU Utilization Problem

Published on 07 Apr 2019 - 18:01

score 412 · Answer 2 · 2019-04-07 19:56:55

412

Views

How do you solve a linear recurrence relation for $a_{n}$ given the solution

Published on 07 Apr 2019 - 19:56

score 98 · Answer 3 · 2019-04-07 21:20:43

98

Views

Solve the recurrence relation $T(n) = c(T(n/c) + 1), T(1) = 1$, by finding an expression for $T(n)$ in big-Oh notation.

Published on 07 Apr 2019 - 21:20

score 96 · Answer 4 · 2019-04-08 20:31:36

96

Views

Understanding the recurrence relation T(n) = c(T(n/c) + 1)

Published on 08 Apr 2019 - 20:31

score 145 · Answer 5 · 2019-04-09 00:33:59

145

Views

How many ways are there to pick r objects from n objects when each object appears an odd number of times

Published on 09 Apr 2019 - 0:33

score 152 · Answer 6 · 2026-03-27 05:16:01

152

Views

How does this convolution algorithm work mathmatically

Published on 27 Mar 2026 - 5:16

score 497 · Answer 7 · 2026-02-23 03:57:38

497

Views

What's the minimum step size that can be used in Euler's method before it becomes unreliable?

Published on 23 Feb 2026 - 3:57

score 260 · Answer 8 · 2019-04-20 14:32:23

260

Views

Conjecture about reversal operations on strings (with duplicates)

Published on 20 Apr 2019 - 14:32

score 753 · Answer 9 · 2026-03-26 14:34:42

753

Views

What is the number of one-to-one functions f from the set {1, 2, . . . , n} to the set {1, 2, . . . , 2n − 1} so that f(x) $\neq$ 2x − 1 for all x?

Published on 26 Mar 2026 - 14:34

score 112 · Answer 10 · 2019-04-21 10:35:11

112

Views

Solve the recurrence relation: $T(n) = T(n - \sqrt{\mathstrut n}) + T(\sqrt{\mathstrut n}) + O(n)$

Published on 21 Apr 2019 - 10:35

score 39 · Answer 11 · 2026-03-28 02:42:48

39

Views

First-order logic task with limited clauses

Published on 28 Mar 2026 - 2:42

score 62 · Answer 12 · 2019-04-26 06:04:00

62

Views

Problem regards filling up a 2D grid with odd elements each

Published on 26 Apr 2019 - 6:04

score 24 · Answer 13 · 2026-03-27 15:35:40

24

Views

Computing number of subsets with bounded sum

Published on 27 Mar 2026 - 15:35

score 48 · Answer 14 · 2026-03-26 14:43:05

48

Views

If a length is 1 and then it's elevated to two then what is it?

Published on 26 Mar 2026 - 14:43

score 985 · Answer 15 · 2026-03-25 18:45:51

985

Views

Epsilon transition in NFA to DFA conversion

Published on 25 Mar 2026 - 18:45

List Question

Calculation of CPU Utilization Problem

How do you solve a linear recurrence relation for $a_{n}$ given the solution

Solve the recurrence relation $T(n) = c(T(n/c) + 1), T(1) = 1$, by finding an expression for $T(n)$ in big-Oh notation.

Understanding the recurrence relation T(n) = c(T(n/c) + 1)

How many ways are there to pick r objects from n objects when each object appears an odd number of times

How does this convolution algorithm work mathmatically

What's the minimum step size that can be used in Euler's method before it becomes unreliable?

Conjecture about reversal operations on strings (with duplicates)

What is the number of one-to-one functions f from the set {1, 2, . . . , n} to the set {1, 2, . . . , 2n − 1} so that f(x) $\neq$ 2x − 1 for all x?

Solve the recurrence relation: $T(n) = T(n - \sqrt{\mathstrut n}) + T(\sqrt{\mathstrut n}) + O(n)$

First-order logic task with limited clauses

Problem regards filling up a 2D grid with odd elements each

Computing number of subsets with bounded sum

If a length is 1 and then it's elevated to two then what is it?

Epsilon transition in NFA to DFA conversion

Trending Questions

Popular # Hahtags

Popular Questions