Author: ignougroup

Problem Detail: I’m reading Cormen’s Introduction to Algorithms 3rd edition, and in examples of Master Method recursion solving Cormen gives two examples $3T( frac{n}{4} ) + nlog(n)$ $2T( frac{n}{2} ) + nlog(n)$ For the first example we have $a=3$ and $b=4$ Read More …

Problem Detail: Which of the following interrupts has the highest priority in 8086 micro-processor: Overflow, NMI or Type 255? The book I read suggests that type 255 has highest priority. But most of the searches on google showed that it is Read More …

Problem Detail: So, as is known, ILP’s 0-1 decision problem is NP-complete. Showing it’s in NP is easy, and the original reduction was from SAT; since then, many other NP-Complete problems have been shown to have ILP formulations (which function as Read More …

Problem Detail: I have a question asking for the minimum and maximum height $h$ of a B-Tree with 1000 elements under following conditions: each block can save 1 to 4 records, the number of internal nodes is between 3 and 5 and Read More …

Problem Detail: When do we say that a artificial neural network is a multilayer Perceptron? And when do we say that a artificial neural network is a multilayer? Is the term perceptron related to learning rule to update the weights? Or Read More …

Problem Detail: A $k$-sorted array is one in which every element is at most distance $k$ from its position when the array is sorted. The complexity of sorting such array is $O(nlog k)$. But if $k=1$, then $log k=0$ so what Read More …

Problem Detail: I have an Euclidean graph: each vertex is a point on the 2D plane, so the weight of each edge is the Euclidean distance between the vertices. I am randomly creating a path thru all the vertices and I Read More …

Problem Detail: Why is it that Iterative-deepening A* is optimal, even without monotonicity? How can I be sure that the first goal reached is the optimal one? Asked By : Lieven Cardoen Answered By : Carlos Linares López In a nutshell: IDA* traverses Read More …