Problem Detail: If the frame buffer has 8 bits per pixel and 8 bits are allocated for each of the R, G, B components, what would be the size of the lookup table? a) 24 bytes b) 1024 bytes c) Read More …
Author: ignougroup
What is a linearization point?
Problem Detail: With respect concurrent programming, what is a linearization point? They seem to occur at a compare-and-swap instruction apparently. The best definition I could find is here. All function calls have a linearization point at some instant between their invocation Read More …
Compressing two integers disregarding order
Problem Detail: Comparing an ordered pair (x,y) to an unordered pair {x, y} (set), then information theoretically, the difference is only one bit, as whether x comes first or y requires exactly a single bit to represent. So, if we’re given Read More …
What is the optimal solution of the 1962 Procter and Gamble’s TSP Contest?
Problem Detail: In 1962, you could win a prize of $ 10 000 (about $ 80 000 in today’s money) if you found the solution to an Euclidean travelling salesman problem defined on 33 cities. http://www.math.uwaterloo.ca/tsp/history/pictorial/car54.html Looking at the picture, the Read More …
Why is the dynamic programming algorithm of the knapsack problem not polynomial?
Problem Detail: The dynamic programming algorithm for the knapsack problem has a time complexity of $O(nW)$ where $n$ is the number of items and $W$ is the capacity of the knapsack. Why is this not a polynomial-time algorithm? I have read Read More …
why are deterministic PDAs not closed under concatenation?
Problem Detail: I can understand that they are not closed under concatenation because without non determinism, PDA cannot decide whether to loop in the first PDA or jump to the next one. But can someone prove this with an example. Also Read More …
Deterministic vs. Non-Deterministic PDA?
Problem Detail: The following is an example of language $a^nb^n$ where $n geq 1$ From what I have heard that in finite state machines if you see epsilon moves, then it is NFA otherwise it is DFA. But in this case, Read More …
Modifying Dijkstra’s algorithm to favor the path with least amount of edges
Problem Detail: I need to modify the Dijkstra’s algorithm to get the shortest path in a directed graph and get the one with the least amount of edges if there are equal paths. I am thinking to add another data field Read More …
Types of reductions and associated definitions of hardness
Problem Detail: Let A be reducible to B, i.e., $A leq B$. Hence, the Turing machine accepting $A$ has access to an oracle for $B$. Let the Turing machine accepting $A$ be $M_{A}$ and the oracle for $B$ be $O_{B}$. The Read More …
Is an infinite union of context-free languages always context-free?
Problem Detail: Let $L_1$, $L_2$, $L_3$, $dots$ be an infinite sequence of context-free languages, each of which is defined over a common alphabet $Σ$. Let $L$ be the infinite union of $L_1$, $L_2$, $L_3$, $dots $; i.e., $L = L_1 cup Read More …
