IgnouGroup Social Campus
Problem Detail: I am given $n$ positive integers $x_1,x_2,cdots,x_n$ as input. These are the weights of the leaves in a full binary tree, $x_1$ being the leftmost leaf and $x_n$ the rightmost leaf. The weight of an internal node $v$ is Read More …
Problem Detail: I’m looking for a data structure / algorithm to store an unordered set S of binary strings of a fixed length n (i.e. all matching the following regular expression: [01]{n}). Insertion and lookup (“Is element x in the S?”) Read More …
Problem Detail: Just a basic question to ask Does the write through cache copies the whole block or just the byte which is updated? I went through the following question Array A contains 256 elements of 4 bytes each. Its first Read More …
Problem Detail: Let $L$ be a regular language. Prove that: $L_{+–}=left{w: exists_u |u|=2|w| wedge wuin Lright}$ $L_{++-}=left{w: exists_u 2|u|=|w| wedge wuin L right}$ $L_{-+-}=left{w:exists_{u,v} |u|=|w|=|v| wedge uwvin Lright}$ are regular and: $L_{+-+}=left{ uv:exists_w |u|=|w|=|v| wedge uwvin L right}$ is not Read More …
Problem Detail: is the following true $ (L^R)^* = (L^*)^R $ I tried the following to prove it true. let u,v belong to L then $ L^* = { u,v, uu, vv, uv, vu … } $ and $ (L^*)^R = Read More …
Problem Detail: According to a book I am reading, the unary representation of a number exponentially larger than a base k representation of it. I, however, feel that the unary representation should scale linearly with the input. After all, 1 is Read More …
Problem Detail: I have an assignment based on operating systems and the question is divided into two sub-questions. The first is: Prove any seating arrangement of lefties and righties, with at least one of each avoiding deadlock. The second: Prove any Read More …
Problem Detail: I’m a sucker for mathematical elegance and rigour, and now am looking for such literature on algorithms and algorithm analysis. Now, it doesn’t matter much to me what algorithms are covered, but very much how they are presented and Read More …
Problem Detail: I did not understand why unconditional transfer of control instruction is used in cpu.So if we already know we have to jump to an instruction and skip some instruction irrespective of any condition then why do we not avoid Read More …
Problem Detail: In 2009 Doron has published a paper stating “Using 3000 hours of CPU time on a CRAY machine, we settle the notorious P vs. NP problem in the affirmative, by presenting a “polynomial” time algorithm for the NP-complete subset Read More …
