Category: Uncategorized

Problem Detail: A homework problem in my current CS class asks us to produce a comparison-based procedure for taking (essentially—there are some poorly-specified rules about duplicates) the set intersection of $k$ unsorted arrays of at most $n$ elements each. For full Read More …

Problem Detail: I want to know what is algorithm and time complexity of Hanoi tower with forbidden direct move from source to destination (it means you cannot move disk from source to destination directly and you instead of that should first Read More …

Problem Detail: In all computer architecture books we study that Cache memory could be divided into 3 levels (L1,L2 and L3) and its very beneficial to do so. Why don’t we use the same approach in case of main memory (RAM). Read More …

Problem Detail: I have read that OSes like Android and iOS are somehow optimised to improve battery life. My understanding is that a CPU executes a certain number of operations in a certain time, so I would think that you can Read More …

Problem Detail: Can anyone give me a proof as to why Any range over a unviverse {1…n} can be reduced to at most $2log_2n$ disjoint dyadic ranges? Where a dyadic range is a range of the form $[x2^y+1….(x+1)2^y]$. This is in Read More …

Problem Detail: In all the exampls of the greedy algorithms I’ve seen so far, such as activity selection problem and unit-sized set coverage problem, the algorithm is usually very simple and intuitive and returns the first set that satisfies the constrain Read More …

Problem Detail: I want to prove that the following program is correct. The code takes an array i of length N and a number x. At the end, the value of found should be true if the array contains x and Read More …

Problem Detail: I am doing supervised learning on speech audio files using neural networks. For this purpose, I’ll have to extract features from the audio file. But since an audio file is a time varying signal, it is generally divided into Read More …

Problem Detail: Let $Sigma = { sigma_1 , …, sigma_t }$ and let $S$ be a string from $Sigma^*$. Denote: $n=|S|$, that is $S$ has $n$ letters. I’d like to find the shortest prefix $T$ of $S$ such that $S$ is Read More …

Problem Detail: My approach Let L ∈ P $exists$ Turing Machine $M_1$ which decides L. We can easily construct $M_2$ which decides $bar{L}$ $bar{L}$ ∈ CO-NP $implies$ P ⊆ Co-NP I’m not sure whether its a correct way to prove this Read More …