IgnouGroup Social Campus
Problem Detail: Let $G$ be a context-free grammar. A string of terminals and nonterminals of $G$ is said to be a sentential form of $G$ if you can obtain it by applying productions of $G$ zero or more times to the Read More …
Problem Detail: I am trying to get better in proofs and deep understanding of concept of computational complexity. Unfortunately, so far, with no success. In order to get more intuition, I decided to do more exercises, but most of them are Read More …
Problem Detail: I understood what amortized analysis does, but can anyone tell me what is the main purpose of this kind of analysis? What I understood: Let say we have 3 three operations a,b,c used 1,2 and 3 times to achieve Read More …
Problem Detail: Let L be the language of all arithmetic expressions written in Reverse Polish Notation, containing only binary operators. $Sigma(L) = {n, o}$, n := number, o := operator. Is there an LL grammar G so that L(G) = L? Read More …
Problem Detail: Here is the problem. Given $k, n, T_1, ldots, T_m$, where each $T_i subseteq {1, ldots, n}$. Is there a subset $S subseteq {1, ldots, n}$ with size at most $k$ such that $S cap T_i neq emptyset$ for Read More …
Problem Detail: From Computer Organisation and Architecture: The IAS operates by repetitively performing an instruction cycle. Each instruction cycle consists of two sub cycles. During a fetch cycle, the opcode of the next instruction is loaded into the IR and the Read More …
Problem Detail: In the slides given by my teacher, the third automaton is the product of the first two: I tried to do the product myself by doing the transition table of both automata at the same time. I got stuck Read More …
Problem Detail: Andrew S. Tanenbaum in his book “Modern Operating Systems 3rd Edition” states that the distinction between operating system software and normal (user mode) software can sometimes be blurred in embedded systems(which may not have kernel mode) Can someone please Read More …
Problem Detail: I’m looking to work out the big-O notation for the following: $$frac{n^{s + 1} – 1}{n – 1} – 1$$ I have a feeling the result is $Oleft( n^s right)$ but I’m not sure how to prove it. Any Read More …
Problem Detail: A set of numbers is stored in a max-heap. We want to find an algorithm with $O(k)$ time complexity to check if $k^{th}$ smallest element is greater than an arbitrary given number. Asked By : Pooria Kaviani Answered By : Merbs Read More …
