Problem Detail: I want to compress file size through making my own numbering system which is 80-based number, I do really want to know whether this even possible ? I learnt that Hexadecimal uses symbols like A, B, C, D, E, F to represent 10,11,12,13,14,15 — Read More …
Category: Uncategorized
Problem understanding DFA & NFA equivalence in Theory of Computation
Problem Detail: Before asking this question,I had gone through Equivalence of NFA and DFA – proof by construction but my question is a bit different from that. I was reading Michael Sipser’s Introduction to Theory of Computation and I came to Read More …
What is “memory coalescing”?
Problem Detail: I came to know that the graphic processing unit have something called memory coalescing. On reading on it I was not clear on the topic. Is this any way related to Memory Level Parallelism. I have searched in Google Read More …
Visual programming tools, why don’t they work with the AST directly?
Problem Detail: I’ve found several open source visual programing tools like Blockly and friends, and other projects hosted at Github, but could’t find any that work directly with the abstract syntax tree. Why is that? I’m asking because once I discovered Read More …
What makes type inference for dependent types undecidable?
Problem Detail: I have seen it mentioned that dependent type systems are not inferable, but are checkable. I was wondering if there is a simple explanation of why that is so, and whether or not there is there a limit of Read More …
Prove NP-completeness of deciding satisfiability of monotone boolean formula
Problem Detail: I am trying to solve this problem and I am really struggling. A monotone boolean formula is a formula in propositional logic where all the literals are positive. For example, $qquad (x_1 lor x_2) land (x_1 lor x_3) land Read More …
What is the time complexity of calling successor $n$ times during tree traversal?
Problem Detail: According to some sources, the time complexity of finding the successor of a node in a tree is $O(h)$. So, if the tree is well balanced, the height $h=log n$, and the successor function takes time $O(log n)$. Yet, Read More …
Fastest mode of data transfer
Problem Detail: Which of the following modes of data transfer is the fastest? a. DMA b. Interrupt-based c. Polling d. All are equally fast I do not have the answer, so I cannot check, that’s why I am posting here. I Read More …
Most efficient algorithm to print 1-100 using a given random number generator
Problem Detail: We are given a random number generator RandNum50 which generates a random integer uniformly in the range 1–50. We may use only this random number generator to generate and print all integers from 1 to 100 in a random Read More …
Which of the following regular expressions generate(s) no string with two consecutive 1’s?
Problem Detail: This is a GRE practice question. Which of the following regular expressions generate(s) no string with two consecutive 1’s? (Note that ε denotes the empty string.) I. (1 + ε)(01 + 0)* II. (01+10)* III. (0+1)*(0+ε) (A) I only Read More …
