IgnouGroup Social Campus
Problem Detail: Problem formulation I have implemented an interesting probability distribution data structure: having $n$ elements $a_1, a_2, dots, a_n$ in the data structure with respective positive weights $w_1, w_2, dots, w_n > 0$, upon request each $a_i$ may be returned Read More …
Problem Detail: I have an array $A[]$ of size $L$, which contains numbers in the range $1 ldots N$. Here $L>N$, so the array will contain repetitions. If $x,y$ are two numbers that are both present in the array, define the Read More …
Problem Detail: We have an array of integers $a[]$, with each $|a[i]| leq 10^{6}$, $size(a)leq10^{5}$, and $a[i]-a[i-1]leq100$. Then we define the term range as a subarray $[x,y]$ of the array $a[]$, $x lt y$. We need to find total number of Read More …
Problem Detail: I’m working through Elements of Programming Interviews as practice for finding a job. I’ve spent a ridiculous amount of time on Problem 18.7. In the gas-up problem, $n$ cities are arranged on a circular road. You need to visit Read More …
Problem Detail: This grew out of a discussion of deliberately bad algorithms; credit to benneh on the xkcd forums for the pseudocode algorithm, which I’ve translated to Python so you can actually run it: def sort(list): if len(list) < 2: return Read More …
Problem Detail: This is an extension of a previous question asked by a different user earlier: Let $x, u, v, w, y, x’, u’, v’, w’, y’$ be words satisfying $y’x’ = xy$. $y’u’x’ = xuy$. $y’v’x’ = xvy$. $y’w’x’ = Read More …
Problem Detail: $L={<!M,x!>, mid M’s text{ transition function can only move right and } Mtext{ halts on } x }$. I need to show that $L$ is recursive/decidable. I thought of checking the encoding of $M$ first and determine whether its Read More …
Problem Detail: I am studying some lecture notes on the complexity of algorithms. The notes give a proof that NP is not a proper subset of coNP. However, they still assert that NP is a subset of coNP (which I agree Read More …
Problem Detail: I was watching the video lecture from MIT on Prim’s algorithm for minimum spanning trees. Why do we need to do the swap step for proving the theorem that if we choose a set of vertices in minimum spanning Read More …
Problem Detail: If I have a system of N polynomial equations with N unknowns in GF(2): What are some good methods to solve them? What’s the highest value of N that can be reasonable solved? Now, my root interest isn’t GF, Read More …
