Dark Mode

Answers by Vegeta

1 vote

1

CPU utilization
If the waiting time for a process is p and there are n processes in the memory then the CPU utilization is given by, a. $\frac{p}{n}$ b. $p^{n}$ c. $1-p^{n}$ d. $n-p^{n}$

answered in Operating System Oct 22, 2018

3.8k views

0 votes

2

Scheduling Overheads
Consider three processes that require 10, 20, 30 units and arrive at time 0, 2, 4. The number of scheduling overheads needed using S.R.T.F. scheduling is I think answer is 1 at time t = 10

answered in Operating System Oct 17, 2018

3.9k views

0 votes

3

answered in Computer Networks Oct 10, 2018

367 views

0 votes

4

Tokens, Lexeme and Pattern
There are 40 tokens in this question. But I have doubt that what should be the wording of the question "The number of LEXEMES generated by the Lexical Analyzer in the above program is _______ " OR "The number of ... - Keyword, Operators, Identifiers, Constant, Punctuation Symbol and String Constants. How token and lexeme are different from each other?

answered in Compiler Design Sep 15, 2018

5.4k views

0 votes

5

Token
How many tokens are there? 1) int a /*b 2) printf ("%

answered in Compiler Design Sep 15, 2018

1.8k views

2 votes

6

doubt in logarithm
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?

answered in Algorithms Aug 16, 2018

406 views

0 votes

7

Random_Doubt
if it is given -> "Every satisfiable propositional formula is not tautology" then what will it corresponds to? i am writing its hindi, which among below two are correct? "har ek satisfiable formula tautology nahi hota hai" // it is indeed truth. "koi bhi satisfiable formula hua, to wo tautology nahii hoga" // this is false.

answered in Mathematical Logic Jun 16, 2018

478 views