IgnouGroup Social Campus
Problem Detail: The puzzle is made up of (n x n) squares so when taking the problem the input size would be n. Rules of Masyu: The goal is to draw a single continuous non-intersecting loop that properly passes through Read More …
Problem Detail: I have read that linear bounded automaton is a Non deterministic Turing machine. Why is it so? Asked By : user5507 Answered By : Yuval Filmus The definition of LBA (for example given in Wikipedia) is a non-deterministic Turing machine which Read More …
Problem Detail: As the new semester starts soon, I am interested in research regarding the teaching of introductory programming courses. I would like to improve my university course and I am looking for scientific papers on that topic. One trend I Read More …
Problem Detail: I have a piece of code that applies recursive Binary and Ternary searches on sorted arrays of increasing size, i.e. 500, 1000, 2000, 4000, etc. The entire code segment is about 200 lines so I’ve been forced to upload Read More …
Problem Detail: How can I prepare for an introductory CS college course? I am currently in Grade 12 and next year I will be studying Computer Science at a university in South Africa (syllabus is here). However CS has a very Read More …
Problem Detail: Under assumption that the hash function is uniform, we have worst-case performance for the search operation in a separate-chaining (e.g. java.util.HashMap) hashtable $O(log n)$. Why? I cannot really understand this. If we have a uniformly-distributed hash values it should Read More …
Problem Detail: If linear programming suggests that we need $2.5$ trucks to deliver goods, why can’t we round up and say $3$ trucks are needed? If linear programming suggests we can afford only $3.7$ workers, then why can’t we just Read More …
Problem Detail: I am a computer science under graduation student, and was going through some Go Back N ARQ (Computer Networking) videos on YouTube, and got a doubt in a question, which according to me should have a different answer than Read More …
Problem Detail: I will state the problem: Suggest an algorithm that works in $O(|E| + |V|log|V|)$ time that checks if there are negative cycles in a graph. So, I saw the runtime, and I immediately said we need to use Dijsktra’s Read More …
Problem Detail: I was looking in here, and I noticed the best runtime for multiplication of two $n$-bits numbers is $O(ncdot log n cdot 2^{O(log^* n)}$, but I can easily notice an algorithm that runs in $O(ncdot log n)$. After all, Read More …
