Computer Science

Help Center > Badges > Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 4484 times.
Grokking pseudo-code for solution to gas station problem
Awarded yesterday
Understanding addition overflows when performing full, signed multiplication of two 64-bit numbers
Awarded yesterday
How to detect number of specific object in an image and it's diameter(size)?
Awarded yesterday
Is “represents” a symmetric relation in the provided answer to TAOCP exercise 1.1.9?
Awarded yesterday
How does one simulate continuous gravity using a discrete timestep?
Awarded 2 days ago
What is the definition of P, NP, NP-complete and NP-hard?
Awarded 2 days ago
The upper bound on a Nondeterministic Finite Automata's configurations number
Awarded Oct 15 at 9:10
What are the purposes of Reply messages in Lamport Algorithm for Mutual Exclusion?
Awarded Oct 15 at 6:10
Is L2 = {a^n| n is a product of one or more primes} regular?
Awarded Oct 15 at 1:05
Does the Kleene star distribute over each element? (0+1)* = 0* + 1*?
Awarded Oct 13 at 23:05
Formal program verification in practice
Awarded Oct 13 at 22:10
Remove x last elements of an array and reinsert them before position y
Awarded Oct 13 at 21:50
Does the Kleene star distribute over each element? (0+1)* = 0* + 1*?
Awarded Oct 13 at 15:25
What will be the pictorial diagram of this transition table?
Awarded Oct 12 at 12:05
Recurrence problem T(n) = 2T(n − 1) + 1
Awarded Oct 11 at 14:45
Finite / Infinite Languages True/False and why?
Awarded Oct 11 at 8:30
Forward edges in undirected graph using BFS
Awarded Oct 10 at 6:20
Is it NP complete to decide whether a graph has $k$ disjoint triangles?
Awarded Oct 10 at 3:45
How to Implement a reversible OR operator with a Fredkin gate (controlled swap)?
Awarded Oct 9 at 10:50
Time complexity of linear iteration bounded by logarithmic iteration?
Awarded Oct 9 at 5:15
Two Generals Problems - What's wrong with my approach?
Awarded Oct 8 at 18:05
How to show that A is not regular?
Awarded Oct 7 at 22:20
Prove or disprove that $log^{k}(n) \in O(\sqrt{n}) \forall k > 0$
Awarded Oct 7 at 21:10
reverse string to pattern matching
Awarded Oct 7 at 18:00
3-heap max heap
Awarded Oct 7 at 14:20
lambda-calc program which halts on only one input
Awarded Oct 6 at 23:00
Difference between Image Analysis and Computer Vision
Awarded Oct 5 at 9:30
Is the $k$P$k$N-3SAT problem NP-complete?
Awarded Oct 3 at 7:15
Time-complexity for basic multiplication and division algorithms
Awarded Oct 2 at 22:00
Typesetting LTL in Unicode?
Awarded Oct 2 at 5:50
Euclidean Models
Awarded Oct 1 at 21:45
Optimal Page Replacement Algorithm - If more than one frame will not be used again, which one gets replaced?
Awarded Oct 1 at 21:35
What are the elements of the modular ring mod 7?
Awarded Oct 1 at 8:35
Need help Understanding Concept of Pumping Lemma & Regular Languages
Awarded Sep 30 at 16:15
How can I prove that a Regular Language is closed under Union given two languages with different alphabets?
Awarded Sep 30 at 16:15
Dealing with test condition '=' for a while loop when determining a bound function/loop variant
Awarded Sep 30 at 11:50
Is it possible to use “and”, “or” “not” as relation/predicate in an ontology? In order to represent causality?
Awarded Sep 29 at 22:55
confused with Time Complexity
Awarded Sep 27 at 9:30
What is an efficient data structure for prefix matching?
Awarded Sep 26 at 21:00
Category theory structures to describe topics and queues
Awarded Sep 25 at 10:45
Baker, Gill, Solovay - construction of oracle B such that P^B != NP^B
Awarded Sep 24 at 22:20
Minimum time to assemble multipart object
Awarded Sep 24 at 7:45
Is there some theoretical verification or explanation of why KDTree gets slower when the dimensionality gets higher?
Awarded Sep 24 at 6:05
If you have a DFA M, how do you construct a new NFA that accepts L(M) and {e}?
Awarded Sep 24 at 3:15
Is it true that for every genetic algorithm there exists a non-genetic algorithm that achieves the same results more efficiently?
Awarded Sep 22 at 20:40
Reducing from NPC to Co-NPC => NP = Co-NP?
Awarded Sep 21 at 13:40
Descriptive complexity: 3-colorability example
Awarded Sep 20 at 18:10
If a convex optimization problem can be NP-Hard, in what sense are convex problems easier than non-convex problems?
Awarded Sep 20 at 8:50
Time complexity for balancing an unbalanced binary tree
Awarded Sep 20 at 7:10
Deadlocks in operating System
Awarded Sep 19 at 13:40
What is the difference between modulo and modulus?
Awarded Sep 18 at 20:55
Algorithm to find longest path in a tree that is smaller than x
Awarded Sep 18 at 6:40
Runtime-Analysis for single loop incremented by a factor of 3
Awarded Sep 17 at 23:45
How do we translate first order logic's universal quantifier (the $\forall$) and the existential quantifier (the $\exists$) to Prolog?
Awarded Sep 16 at 7:45
How do we determine whether a heuristic is better than another in A* search Algorithm?
Awarded Sep 15 at 22:55
Where is the original literature for the specification of an Associative Array ADT?
Awarded Sep 13 at 20:40
How can I embed a Knowledge Graph in a vector space?
Awarded Sep 13 at 8:30
What are some decidable problems which cannot be solved in real life(due to time and memory constraints)?
Awarded Sep 13 at 6:45
Prove that a language is bounded if and only if it's finite
Awarded Sep 11 at 18:05
Are entities in a many-to-many relation related individually?
Awarded Sep 10 at 21:25
1 2 3 4 5 … 75