Register
Filter

Questions by BharathiCH

0 votes
0 answers
1
Best Fit and FCFS
Free Holes 4K;8K;20K;2K Program size 2K;14K;3K;6K;10K;20K;2K Time for Execution(B.T) 4 ; 10; 2; 1; 4; 1; 8 Using Best Fit Allocation Policy and FCFS CPU Scheduling Technique, FInd the time for Loading and Time of Completion of each program. The Burst times are in seconds..
Free Holes4K;8K;20K;2KProgram size2K;14K;3K;6K;10K;20K;2KTime for Execution(B.T)4 ; 10; 2; 1; 4; 1; 8Using Best Fit Allocation Policy and FCFS CPU Scheduling ...
0 votes
0 answers
2
Keneth Rosen
Determine whether each of these statements is true or false. 0 ∈ ∅ ∅ ∈ {0} {0} ⊂ ∅ ∅ ⊂ {0} {0} ∈ {0} {0} ⊂ {0} {∅} ⊆ {∅}
Determine whether each of these statements is true orfalse. 0 ∈ ∅ ∅ ∈ {0} {0} ⊂ ∅ ∅ ⊂ {0} {0} ∈ {0} {0} ⊂ {0} {∅} ⊆ {∅}
0 votes
1 answer
3
Kenneth Rosen Edition 6th Exercise 2.2 Question 8 (Page No. 120)
Determine whether these statements are true or false. ∅ ∈ {∅} ∅ ∈ {∅, {∅}} {∅} ∈ {∅} {∅} ∈ {{∅}} {∅} ⊂ {∅, {∅}} {{∅}} ⊂ {∅, {∅}} {{∅}} ⊂ {{∅}, {∅}}
Determine whether these statements are true or false. ∅ ∈ {∅} ∅ ∈ {∅, {∅}}{∅} ∈ {∅}{∅} ∈ {{∅}}{∅} ⊂ {∅, {∅}} {{∅}} ⊂ {∅, {∅}}{{�...
2 votes
1 answer
4
Identification of Regular
Identify weather the following language is regular? ∀m,n ∈ N 1)a^m b^n | LCM(m,n)=0 2)a^m b^n | LCM(m,n)=1 3)a^m b^n | LCM(m,n)<100 4)a^m b^n | GCD(m,n)=1
Identify weather the following language is regular?∀m,n ∈ N1)a^m b^n | LCM(m,n)=02)a^m b^n | LCM(m,n)=13)a^m b^n | LCM(m,n)<1004)a^m b^n | GCD(m,n)=1
0 votes
0 answers
5
Graph Theory
0 votes
0 answers
6
Transactions(Schedules)
Do recoverable schedules have inconsistency? If A=1000 then will be 936 after T1 and T2 completed its execution. But it should be (1040-100) to make it consistent. Correct me If Iam wrong with my inferences.
Do recoverable schedules have inconsistency?If A=1000 then will be 936 after T1 and T2 completed its execution. But it should be (1040-100) to make it consistent.Correct ...