Problem Detail: I have read that TSP and Subset Sum problems are NPC problems which are also NP Hard. There are also problems like Halting Problem which is NP Hard, but not NP Complete And Wikipedia defines this as A problem Read More …
Category: Uncategorized
[Solved]: What are the applications of Rose trees?
Problem Detail: I recently found out about the Rose tree data structure, but just going off of a Haskell data definition and the tiny Wikipedia description of it, I’ve got some trouble understanding what applications a Rose tree might have. For Read More …
[Solved]: Data structure to insert, update and sort indexes by frequency and query an index for a particular cumulative frequency
Problem Detail: Here is the description of the data structure I am looking for: Initial Original Data Index | Frequency | 1 3 2 1 3 7 4 2 5 6 Now it should be kept Sort-ed by their frequency inside Read More …
[Solved]: What is the expected number of nodes at depth d of a tree after i random insertions
Problem Detail: Suppose one wanted to build a tree at random. Let the first insertion at step $i = 1$ be the root node. From here, nodes are inserted into the tree at random one at a time. How would one Read More …
[Solved]: Finite automaton – language acceptance
Problem Detail: In the book “The New Turing Omnibus”, an excercise reads as the follows: “Show that no finite automaton can accept the language consisting of all words of the form $a^n b^n, n=1,2,3,…$ The formula represents $n$ a’s followed by Read More …
[Solved]: What is practical difference between NP and PSPACE-complete?
Problem Detail: Here’s something that has puzzled me lately, and perhaps someone can explain what I’m missing. Problems in NP are those that can be solved on a NDTM in polynomial time. Now assuming P$,neq,$NP, PSPACE$,neq,$NP etc. this means that there Read More …
[Solved]: Split-Find: maintaining dynamic graph connectivity information, under edge deletion
Problem Detail: Is there a data structure to keep track of the connected components of a dynamic graph, when the graph might by changing by deleting edges of the graph? Let $G$ be an undirected graph. I have two operations I’d Read More …
[Solved]: Big-O complexity of sqrt(n)
Problem Detail: I’m trying to backfill missing CS knowledge and going through the MIT 6.006 course. It asks me to rank functions by asymptotic complexity and I want to understand how they should be reduced rather than just guessing. The question Read More …
[Solved]: In computer science how is using passive voice regarded?
Problem Detail: A soft question, when I was in high school and in University I took scientific writing classes and people told me I should use passive voice as much as possible to sound objective, but when I entered grad school Read More …
[Solved]: Is there a correlation of zip compression ratio and density of information provided by a text?
Problem Detail: I’ll phrase my question using an intuitive and rather extreme example: Is the expected compression ratio (using zip compression) of a children’s book higher than that of a novel written for adults? I read somewhere that specifically the compression Read More …
