Questions with Complete Solutions - Hamro CSIT

Find the GCD of 12 and 16 using Extended Euclidean Algorithm.

Not Answered Discrete Structure Asked on 2081 Exam

How do you think deadlock can be avoided? Explain.

Not Answered Fourth Semester Asked on 2081 Exam

Consider a swapping system in which memory consists of the following hole sizes in memory order:
15 MB, 2 MB, 10 MB, 6 MB, 8 MB and 20 MB.
Which hole is taken for successive segment requests of:

(a) 10 MB
(b) 10 MB
For first fit, next fit and best fit.

Not Answered Fourth Semester Asked on 2081 Exam

Explain Inter-Process Communication in Linux.

Not Answered Fourth Semester Asked on 2081 Exam

Write short notes on:

Virtual Memory

Race Condition

Not Answered No Subject Asked on 2081 Exam

Explain the Sleeping Barber problem. Illustrate on how it can be solved.

Not Answered No Subject Asked on 2081 Exam

Explain memory-mapped I/O.

Not Answered No Subject Asked on 2081 Exam

List different file structures and explain them.

Not Answered No Subject Asked on 2081 Exam

Calculate the average waiting time and turnaround time using priority algorithm (Priority 1 being the highest) for the given scenario:

PID Brust Time Arrival Time Priority

A 3 0 3

B 2 2 3

C 4 3 2

D 2 3 1

Not Answered No Subject Asked on 2081 Exam

Find the seek time using SCAN, C-SCAN, Look and C-Look disk scheduling algorithms for processing the following request queue:
35, 70, 45, 15, 65, 20, 80, 90, 75, 130.
Suppose the disk has tracks numbered from 0 to 150 and assume the disk arm to be at 30 and moving outward.

Not Answered No Subject Asked on 2081 Exam

HAMROCSIT.COM

Copyright 2024 | HAMROCSIT.COM | All Right Reserved - Nymna Technology