Download Solution Ignou MCA Solved Question Paper
Category: Uncategorized
Draw the Gantt charts illustrating the execution of these processes using the FCFS, SJF, Round Robin (with quantum = 1) and Priority Based Scheduling algorithms.
Download Solution Ignou MCA Solved Question Paper
Consider the following set of processes with arrival times and CPU execution times given in milliseconds. A process with a larger priority number has a higher priority. If any assumptions made by you, state them.
Download Solution Ignou MCA Solved Question Paper
[Solved]: Are regex crosswords NP-hard?
Problem Detail: I was fooling around the other day on this website: http://regexcrossword.com/ and it got me wondering what the best way to solve it was. Can you solve the following problem in polynomial time or is it NP-hard? Given an Read More …
[Solved]: Is finding if a graph has k isolated nodes a NP-Complete problem?
Problem Detail: I was wondering if finding if a graph has k or more isolated nodes is a NP-Complete problem. I found the following problem: Prove that the following problem is NP-Complete. Given a set of T transactions: $T = {t_1,t_2,dots,t_m}$ Read More …
[Solved]: Turing complete and computational power
Problem Detail: In a lecture a professor mentioned that modern computers don’t have as much computational power as a Turing machine because they don’t have infinite memory, and since no computer can have infinite memory the Turing machine is therefore unattainable Read More …
[Solved]: Counting an integer’s divisors without just enumerating them (or estimating if not possible)?
Problem Detail: I’m trying to count the number of divisors an integer $n$ has. The simple way to do this is to just enumerate all integers from 1 to $sqrt{n}$, and count how many integers evenly divide $n$. For example, 28 Read More …
[Solved]: A programming language that can only implement computable bijective functions?
Problem Detail: Are there programming languages(or logic) that can implement(or express) a function $f:mathbb{N}to mathbb{N}$ if and only if $f$ is a computable bijective functions? Asked By : Chao Xu Answered By : Andrej Bauer There is no such language. However, have a Read More …
[Solved]: Distinct variables for different clauses
Problem Detail: In resolution theorem proving, it is normally assumed variables in different clauses are distinct. This is not something that happens automatically; it requires significant extra code and computation to implement. Given that, I’m looking for a test case for Read More …
[Solved]: Pushdown Automata: CFG to PDA
Problem Detail: I have the following grammar for a context-free language: $G = ({S,A,B}, {x,y,z}, P, S)$ with $P = {S rightarrow A, A rightarrow xAz, A rightarrow xBz, B rightarrow y}$ My question is: How to construct a pushdown automaton Read More …
