Problem Detail: I am getting confused with the solution to this recurrence – $T(n) = T(n/2) + n^2$ Recursion tree – T(n) Height lg n + 1 | T(n/2) | T(n/4) So it turns out to be – $T(n) = n^2(1 Read More …
Author: ignougroup
[Solved]: Real world applications for Steiner Tree Problem?
Problem Detail: Are there real-world applications of the Steiner Tree Problem (STP)? I understand that VSLI chip design is a good application of the STP. Are there any other examples of real world problems that people can suggest of that could Read More …
[Solved]: Height of a full binary tree
Problem Detail: A full binary tree seems to be a binary tree in which every node is either a leaf or has 2 children. I have been trying to prove that its height is O(logn) unsuccessfully. Here is my work so Read More …
[Solved]: Why is O(n log n) the best runtime there is?
Problem Detail: I am taking a course on Coursera about algorithm design. The course said that a time of $O(n log n)$ is considered to be good. However, there are faster runtimes such as (from now on just assume it is Read More …
[Solved]: r-regular graph and hamiltonian path
Problem Detail: I am having some issues proving a problem I am working on. I have been sketching out examples but the proof is not jumping out at me. Question: Let $G = (V,E)$ be an undirected $r$-regular graph (that is Read More …
[Solved]: Neural Network weight selection using Genetic Algorithm
Problem Detail: Hi I want to ask about weight selection in neural network using genetic algorithm. Right now what I understand is Initialize population Encode the weight of the neural network to the chromosome Calculating the error and fitness crossover and Read More …
[Solved]: What type of formal notation is being used here to represent functional algorithms?
Problem Detail: Interested in learning more about algorithm design in functional programming, I picked up Andrew Bird’s Pearls of Functional Algorithm Design. I have experience with a number of programming languages, but my only experience with functional programming is in Scala. Read More …
[Solved]: reducing subset-sum to partition
Problem Detail: Subset-sum: Given a list of numbers, find if a non-empty sublist has sum 0 (there’s a variation where we want sum=k instead of 0, but 0 is easier for analysis) Partition: Given a list, can it be partitioned Read More …
[Solved]: How does Grover’s Quantum Sorting avoid reading the list?
Problem Detail: It is well known now that Grover’s quantum algorithm can SORT a database of $N$ entries in $O(sqrt{N})$ time. How can an algorithm work without reading through the list of entries which needs $O(N)$ operation. How does Grover’s algorithm Read More …
[Solved]: Deciding if a Turing machine has made a left move
Problem Detail: In writing a decider for a machine to see if it has made a left move or not on an input of w, it is said that if we continue the computation for $|w|+N+1$ ($N$ : number of states) Read More …
