StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

Patrick87

Rating
1505.77 (126,713th)

Reputation
18,928 (7,301st)

Page: 1 ... 10 11 12 13 14 ... 24

Title	Δ
In a Binary Search Tree what is the base of the log for Big O	-0.53
Find the value of f(n) in the master theorem	0.00
which data structure to use to implement phone book which can be se...	+0.47
How to convert to Chomsky Normal Form quickly?	0.00
Formal languages - regular expression	0.00
NFA with k states to accept strings of length <=k	-0.03
Algorithm to find how many times a string A needs to be stated such...	+1.13
Finding Context Free grammar(CFG)	0.00
Context-Free Grammar suggestions for unary subtraction?	-1.14
Choice of optimization algorithm for distributing lines inside a sh...	0.00
If statement for inclusive permission check	0.00
Going from a language to a context free grammar	0.00
How do I determine the Big O of a recursive algorithm that includes...	-2.15
algorithm that finds the element ai in a sequence	-0.53
C++ understand copy constructor	-0.49
Detecting Conflicts on a Scheduler Timeline (Algorithm)	0.00
How to read logic sentences with scanf() "input can vary, only...	-2.31
What is the number of combinations of 3 binary inputs given number...	0.00
Finding these three algorithm's run time	0.00
Is this language decidable	0.00
What are alternatives to using numerous boolean switches	+0.13
Worst scenario for shell sort: Θ(N^3/2) or O((NlogN)^2)?	0.00
Building a DFA from an alphabet {a,b,c}	0.00
Prooving by induction that a function gets called n-1 times	0.00
Construct DFA for L = {(na(w)-nb(w)) mod 3>0}	0.00
log(n) vs log(k) in runtime of an algorithm with k < n	+1.09
Explaining Computation of a Turing Machine	0.00
How to remove ambiguity in the following grammar?	0.00
Kleene Star Undecidability	0.00
O(1) and O(log n), are they same thing?	+1.43
Which part of the pumping lemma theorem for reg languages indicate...	0.00
Prove or disprove: If you got pre-order traversal of a binary searc...	0.00
Convert the following expression to use only NAND gates	+2.38
a finite automaton only rejects a finite number of strings	0.00
Logical reduction to one line of code	-2.15
Let A,B, C be fad. Consider the equation X = AX + BX + C. Must a so...	0.00
Big O Notation for two code fragments	0.00
A mod B function Turing machine	0.00
Turing machines for equation with modulo	0.00
Prove any DFA with k<2^n states does not accept the strings with...	+0.47
Pair of Zeros separated by 1's NFA?	0.00
Big o notation for a while-loop which use random# generator as a co...	+0.46
Induction coming up with a proposition	0.00
I'm trying to solve DFA	0.00
How is Turing Machine which accepts nothing is not Recursively Enum...	0.00
Why does this multithreaded code overrun its while condition?	0.00
Need to convert this sentence into FOPL "Only healthy people c...	0.00
Number of Turing Machines?	0.00
Relation of pumping lengths between related regular languages	0.00
How can I find a logically equivalent formula without "implica...	-0.03