IgnouGroup Social Campus
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 …
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 …
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 …
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 …
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 …
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 …
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 …
Problem Detail: In terms of worst-case asymptotic runtime, which NP-complete problem has the fastest-known (exact) algorithm and what is the algorithm? Is there something known that is faster than $O(n^2*2^n)$? Asked By : Wuschelbeutel Kartoffelhuhn Answered By : Pål GD Vertex Cover has Read More …
Problem Detail: According to this article the following line of Lisp code prints “Hello world” to standard output. (format t “hello, world”) Lisp, which is a homoiconic language, can treat code as data in this way: Now imagine that we wrote Read More …
Problem Detail: Do programmers (in real life), always insert at the top node or somewhere else? Because in my text book CLRS it is not made very clear, so the insertion process can take a best case of O(1), if you Read More …
