Need EC2022 Operating Systems Important Questions ? You can collect here all important university questions of EC2022 Operating Systems . This is the subject in BE ECE 6th Semester 2008 Regulations Anna University Chennai.
Anna University , Chennai
Department of B.E ECE
Sixth Semester
EC2022 Operating Systems
November / December 2015 Exam Important Questions
(Regulation 2008)
IUQP Important Questions
Anna University, Chennai
Department of B.E-Electrical and Communication Engineering
B.E / B.TECH DEGREE EXAMINATION NOV Dec 2015
SIXTH SEMESTER
EC2022 Operating Systems
(REGULATION 2008)
1. Explain the various types of computer systems
2. Explain in detail about the threading issues
3. Write short notes about Process concept and process scheduling.
4. Explain in detail about Review of Computer Organization.
5. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary
semaphores
6. Explain about the methods used to prevent deadlocks
7. Explain the Banker’s algorithm for deadlock avoidance
8. Consider the following set of process, with the length of the CPU-burst time given in milliseconds:
Process Burst time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
9. Explain the various page replacement strategies
10. Write in detail about Virtual memory.
11. Explain in detail about swapping and thrashing.
12. Remember that frames are initially empty. (i) LRU replacement(ii) FlFO replacement(iii) optimal
replacement
13. Write notes about the protection strategies provided for files.
14. Write in detail about directory structure.
15. Write in detail about File-System Implementation.
16. Write in detail about Allocation methods.
17.Write notes about disk management and swap-space management.
18. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently serving the
request at cylinder 143,and the previous request was at cylinder 125. The status of the queue is as
follows
86, 1470, 913, 1774,948,1509,1022,1750,130
19.What is the total distance (in cylinders) that the disk arm moves to satisfy the entire pending
request for each of the following disk-scheduling algorithms?
(i)SSTF) (ii) FCFS (iii) SCAN (lV) C-SCAN
20. Explain in various RAID Level.
Anna University , Chennai
Department of B.E ECE
Sixth Semester
EC2022 Operating Systems
November / December 2015 Exam Important Questions
(Regulation 2008)
Anna University, Chennai
Department of B.E-Electrical and Communication Engineering
B.E / B.TECH DEGREE EXAMINATION NOV Dec 2015
SIXTH SEMESTER
EC2022 Operating Systems
(REGULATION 2008)
1. Explain the various types of computer systems
2. Explain in detail about the threading issues
3. Write short notes about Process concept and process scheduling.
4. Explain in detail about Review of Computer Organization.
5. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary
semaphores
6. Explain about the methods used to prevent deadlocks
7. Explain the Banker’s algorithm for deadlock avoidance
8. Consider the following set of process, with the length of the CPU-burst time given in milliseconds:
Process Burst time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
9. Explain the various page replacement strategies
10. Write in detail about Virtual memory.
11. Explain in detail about swapping and thrashing.
12. Remember that frames are initially empty. (i) LRU replacement(ii) FlFO replacement(iii) optimal
replacement
13. Write notes about the protection strategies provided for files.
14. Write in detail about directory structure.
15. Write in detail about File-System Implementation.
16. Write in detail about Allocation methods.
17.Write notes about disk management and swap-space management.
18. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently serving the
request at cylinder 143,and the previous request was at cylinder 125. The status of the queue is as
follows
86, 1470, 913, 1774,948,1509,1022,1750,130
19.What is the total distance (in cylinders) that the disk arm moves to satisfy the entire pending
request for each of the following disk-scheduling algorithms?
(i)SSTF) (ii) FCFS (iii) SCAN (lV) C-SCAN
20. Explain in various RAID Level.
0 comments:
Pen down your valuable important comments below