Register
Filter

Questions by SeemaTanwar

0 votes
0 answers
1
Doubt -OS process scheduling
If arrival time of a process is same as the end time of quantum slice for a process in round robin schedule then in what order we must place the processes in ready queue?
If arrival time of a process is same as the end time of quantum slice for a process in round robin schedule then in what order we must place the processes in ready queue?...
0 votes
0 answers
2
avl tree-AAI exam
0 votes
1 answer
3
Leaky Bucket
0 votes
0 answers
4
Made Easy test series
1 votes
0 answers
5
clock cycles to access ALU and Register in Base Index addressing mOde
How many cycles will be required to fetch an operand if we are using "BASE INDEX' addressing mode, and ALU computation takes 2 cycles, register reference takes 1 cycle and memory reference takes 4 cycles each respectively ?
How many cycles will be required to fetch an operand if we are using "BASE INDEX' addressing mode, and ALU computation takes 2 cycles, register reference takes 1 cycle an...
1 votes
0 answers
6
shift register
0 votes
0 answers
8
cache hit latency computation
Consider 32 KB 4-way set associative cache with 32 byte block size. CPU generates 32 bits physical address . A 4 to1 multiplexer has a latency of 1 ns while a k bit comparator has a latency of 2k ns. The hit latency of the cache organization is?
Consider 32 KB 4-way set associative cache with 32 byte block size. CPU generates 32 bits physical address . A 4 to1multiplexer has a latency of 1 ns while a k bit compar...
0 votes
0 answers
10
hit ratio computation
Consider a 4-way set associative cache that has 8 lines,with perfect LRU cache replacement and supports a block size of 16 bytes. For the following memory access pattern (shown as byte addresses), find the hit ratio? 3, 5, 6, 21, 32, 14, 5, 10, 11, 12 ?
Consider a 4-way set associative cache that has 8 lines,with perfect LRU cache replacement and supports a block size of16 bytes.For the following memory access pattern (s...
1 votes
0 answers
11
pre-emptive scheduling
22. Given the jobs with the following characteristics: job A: 5ms CPU , 25 ms IO , 5 ms CPU job B: 20ms CPU, 15 ms IO job C: 40 ms cpu Determine the turnaround time, waiting time and response time of Job B while the CPU runs these jobs. Assume the schedule is preemptive and the CPU quantum is 5 ms
22. Given the jobs with the following characteristics:job A: 5ms CPU , 25 ms IO , 5 ms CPUjob B: 20ms CPU, 15 ms IOjob C: 40 ms cpuDetermine the turnaround time, waiting ...
0 votes
0 answers
12
Round Robin scheduling policy
The I/O wait percentage p of a process is the percentage of time the process wait for an IO to completion when executed in a monoprogramming environment . on a system using round robin with n process ,all having same IO . what percentage of time cpu will be idle in term of (p) ?
The I/O wait percentage p of a process is the percentage of time theprocess wait for an IO to completion when executed in amonoprogramming environment . on a system using...
0 votes
0 answers
13
Ace test series question on scheduling policy
which scheduling policy is starvation free? A) LIFO B) FIFO C) SJF D)PRIORITY
which scheduling policy is starvation free?A) LIFOB) FIFOC) SJFD)PRIORITY
0 votes
1 answer
15
Test series question............
In a 6 bit ripple counter the MOD of up counting is 14, then MOD of down counting is?
In a 6 bit ripple counter the MOD of up counting is 14, then MOD of down counting is?
0 votes
0 answers
16
MP481 Review Problems Turing Machines and (Un)Decidability Luay K. Nakhleh
L1={<M>|M is a TM and |L(M)|<=3} L2={<M>|M is a TM and |L(M)|>=3} L3={<M>|M is a TM and L(M) is finite} How can we judge which language is rec, R. E or not R. E?
L1={<M>|M is a TM and |L(M)|<=3}L2={<M>|M is a TM and |L(M)|>=3}L3={<M>|M is a TM and L(M) is finite}How can we judge which language is rec, R. E or not R. E?