Ignou free assignments

Question Detail: Let $\Sigma=\{0,1\}$. What is the regular expression for the language of all strings with an even number of $0$'s and...Read More

Which queue does the long-term scheduler maintain?

Question Detail: There are different queues of processes (in an operating system): Job Queue: Each new process goes into the job queue....Read More

Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?

Question Detail: Most of today's encryption, such as the RSA, relies on the integer factorization, which is not believed to be a NP-ha...Read More

Are there minimum criteria for a programming language being Turing complete?

Question Detail: Does there exist a set of programming language constructs in a programming language in order for it to be considered Turi...Read More

Data Types

How does a computer determine the data type of a byte?

Question Detail: For example, if the computer has 10111100 stored on one particular byte of RAM, how does the computer know to interpret ...Read More

Why is the Kleene star operator also called the Kleene 'closure' operator?

Question Detail: I've found that if I don't understand the etymology behind a cs/programming term, it usually means that I've ...Read More

How to implement a prolog interpreter in a purely functional language?

Question Detail: Is there a clear reference, with pseudo-code, on how to go about implementing a Prolog interpreter in a purely functional...Read More

What is the difference between halting, accepting, and deciding in the context of Turing machines?

Question Detail: Does accepting mean that the TM will read and recognize a char from the cell it's currently reading from? And is it t...Read More

"For small values of n, O(n) can be treated as if it's O(1)"

Question Detail: I've heard several times that for sufficiently small values of n, O(n) can be thought about/treated as if it's O(...Read More

Finding the path of a negative weight cycle using Bellman-Ford

Question Detail: I wrote a program which implements Bellman-Ford, and identifies when negative weight cycles are present in a graph. Howev...Read More

Why is encrypting with the same one-time-pad not good?

Question Detail: To encrypt a message $m_1$ with a one-time-pad key $k$ you do $Enc(m_1,k) = m_1 \oplus k$. If you use the same $k$ to e...Read More

Does an Operating System inject its own machine code when you open a program?

Question Detail: I'm studying CPU's and I know how it reads a program from the memory and execute its instructions. I also underst...Read More

Is this intersection of DFAs correct?

Question Detail: I'm constructing a deterministic finite automata (DFA) for a language of all strings defined over $\{0,1\}$ whose le...Read More

What would be the real-world implications of a constructive $P=NP$ proof?

Question Detail: I have a high-level understanding of the $P=NP$ problem and I understand that if it were absolutely "proven" to...Read More

Hierarchical Paging

Question Detail: Suppose I have a system with 32-bit logical and 16-bit physical address spaces, and the page size is 512 bytes. For simpl...Read More

What determines the "speed" of a programming language?

Question Detail: Suppose a program was written in two distinct languages, let them be language X and language Y, if their compilers genera...Read More

Proving a binary heap has $\lceil n/2 \rceil$ leaves

Question Detail: I'm trying to prove that a binary heap with $n$ nodes has exactly $\left\lceil \frac{n}{2} \right\rceil$ leaves, giv...Read More

Is a universal assembly language for all computers possible?

Question Detail: I would like to ask a few questions about Assembly language. My understanding is that it's very close to machine lang...Read More

Circle Intersection with Sweep Line Algorithm

Question Detail: Unfortunately I am still not so strong in understanding Sweep Line Algorithm . All papers and textbooks on the topic are ...Read More

Which combinations of pre-, post- and in-order sequentialisation are unique?

Question Detail: We know post-order, post L(x) => [x] post N(x,l,r) => (post l) ++ (post r) ++ [x] and pre-order pre L(x) ...Read More

Are all Integer Linear Programming problems NP-Hard?

Question Detail: As I understand, the assignment problem is in P as the Hungarian algorithm can solve it in polynomial time - O(n 3 ). I ...Read More

How do computers remember where they store things?

Question Detail: When a computer stores a variable, when a program needs to get the variable's value, how does the computer know where...Read More

CLRS 4.4-3 Height of recursion tree for T(N) = 4T(n/2 +2) + n

Question Detail: I'm having a hard time with the following question: Use a recursion tree to determine a good asymptotic upper bound...Read More

Calculating Floating point Operations Per Second(FLOPS) and Integer Operations Per Second(IOPS)

Question Detail: I am trying to learn some basic benchmarking. I have a loop in my Java program like, float a=6.5f; int b=3; for(lon...Read More

Are there any problems that get easier as they increase in size?

Question Detail: This may be a ridiculous question, but is it possible to have a problem that actually gets easier as the inputs grow in s...Read More

If the speed of electrical charge hasn't changed, how have computers become faster?