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 …
Author: ignougroup
[Solved]: Why can’t we round results of linear programming to get integer programming?
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 …
[Solved]: Understanding hashtable performance in the worst-case
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 …
[Solved]: How can I prepare for CS in university
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 …
[Solved]: I know Binary Search is more efficient than Ternary search, but my results are opposite. Help interpreting results?
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 …
[Solved]: References on teaching introductory programming courses
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 …
[Solved]: Why it is said that LBA is a non deterministic Turing Machine
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 …
[Solved]: Why do puzzles like Masyu lie in NP?
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 …
[Solved]: Why don’t nodes carry as many pointers as possible in a skip list?
Problem Detail: From this main picture explaining how skip lists work from Wikipedia, we see that some nodes carry different amounts of pointers to other parts of the list: Wouldn’t it make more sense to have every node carry 4 pointers Read More …
[Solved]: Are there problems that are polynomial-time equivalent to factoring composites?
Problem Detail: It seems that factoring a number known to be composite is in its own interesting little complexity class, e.g. polynomial time using quantum computing even though no one has proved $mathsf{P} = mathsf{NP}$ for quantum computing. Are there interesting, Read More …
