Course file

of
Operating Systems

(KCS-401)

Session 2022-23

Submitted by:
Dr Jay Shankar Prasad
 INDEX FOR COURSE FILE

S. No. Contents Details Page

Institute Vision & Mission, Department
1 Vision, Mission, Program Educational
Objective, Program Outcome & Program
Specific Outcome, Academic Calendar
Course Details, Status of Paper B Tech (CSE)
2
(Compulsory/Elective) Subject: Operating System KCS-401
Compulsory Semester :IV, No of students:57
Course Plan Course description: (Few lines about course objectives or
prerequisite)
3 Course Outcomes Course Outcomes to cover whole syllabus
Mapping of Course Outcomes with POs/PSOs
4 Evaluation scheme, Syllabus, Course
Time Table, List of Students
Teaching Learning & Evaluation Process LECTURE Plan
(TLEP) TITLE
INSTRUCTIONAL OBJECTIVES:
5 TEACHING AIDS:
ASSIGNMENT / QUESTIONS

Test Papers: Internal: CT-I/CT-II & PUT papers with CO

At least 10 short questions and 10 long questions
6 Unit wise Question Bank:
External: At least previous 3 years
University Question Papers of Previous
Years:
Slow Learner →List of students & their Remedial Classes after each Sessional
7 Exam
→Report: Action Taken
→Impact observed: mention the improvement
Advance Learner →List of students
8 →Action Taken: Additional content provided/ Challenging
assignment/Mini Project etc.
→ Impact observed: mention the improvement
9 Content beyond the syllabus with CT/PUT/Assignments/Tutorials/Quizzes/Others
POs/PSOs mapping (if applicable)
Course Exit Survey For Indirect Assessment
10
11 Details of Marks obtained CT-I/CT-II, PUT and University Marks for Direct Assessment
CO Attainment → CO Attainment CT-I/CT-II & PUT Separately
12 → Overall CO Attainment
13 Attendance Register
14 Faculty Notes Hand Written Notes/ Handouts/PPTs/PDFS in a Separate File
15 Sample Sheets →Assignment/Tutorial submitted and obtained from students
→Answer Copies CT and PUT justifying each category weak,
medium & advance learners.
 INSTITUTE VISION AND MISSION
Vision of Institute
Be known globally for value-added Education Innovation Research at the intersection of disciplines
in service of humankind.

Mission of Institute
➢ Place a multidisciplinary engineering education ecosystem that transforms learners into future innovators, entrepreneurs,
and professional leaders.

➢ Create an ambiance of interdisciplinary research, innovation, and creativity to address regional and global challenges
for benefit of human life and the environment.

➢ Provide the environment for enhancing knowledge, and inculcating critical & design thinking, life skills through
quality learning Systems.

➢ Collaborate with globally renowned academic & research institutions and corporate for improving productivity
and economics.
DEPARTMENT VISION AND MISSION
Vision of the Department

To produce computer science and engineering graduates with problem solving abilities, research aptitude, teamwork, and

ethical values to meet the needs of industry and society.

Mission of the Department

✓ To prepare students with strong technical skills and analytical minds for real time industrial needs.

✓ To nurture the students to contribute in research and innovation for nation building.

✓ To develop students with leadership qualities to be entrepreneurs and contribute their services to society.

Program Educational Objectives

PEO 1: Prepare graduates to have knowledge and competency for careers in related to computer science.
PEO 2: Prepare graduates to become leader in fields related to computer Science.
PEO 3: Prepare graduates to pursue higher education in engineering or other professional fields.
PEO 4: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural
issues and the consequent responsibilities relevant to the professional engineering practice.
 PROGRAMME OUTCOMES
Program Statement
Outcom
e
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and
an engineering specialization to the solution of complex computer engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and analyze complex computer
engineering problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences.

PO3 Design/development of solutions: Design solutions for complex computer engineering problems and
design system components or processes that meet the specific needs with appropriate considerations for
the public health and safety, and the cultural, societal, and environmental considerations.
PO4 Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide conclusions
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering
and IT tools including prediction and modeling to complex engineering activities with an understanding
of the limitations
PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent relevant to the professional engineering
practices
PO7 Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norm of the
engineering practices
PO9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse
teams, and in multidisciplinary settings
PO10 Communications: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports and
design documentation, make effective presentations, and give and receive clear instructions
PO11 Project management and finance: Demonstrate knowledge and understanding of the engineering and
management principles and apply these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life learning in the broadest context of technological change.

PROGRAMME SPECIFIC OUTCOMES (PSOs)

On completion of the B.Tech (Computer Science & Engineering), the graduates will be able to

PSO-1: Professional Skill: will be able to understand the concepts of Computer Science & Engineering and its application in databases,
system software, web designing, big data analytics, and machine learning techniques, artificial intelligence and networking, for efficient
design of computer-based systems of varying complexity.

PSO-2: Problem-Solving Skills: will be able to understand, apply standard practices, techniques & tools for development of software
projects using open-ended programming environments, which support higher order cognitive skills like data interpretation, formulation
of hypothesis and experimentation, to deliver a quality product.

PSO-3: Successful Career and Entrepreneurship: will be able to employ the best programming skills, environments, and platforms, to
identify and build innovative career options, and enthusiasm for higher studies.
Academic Calender 2022-23 Even Sem
 Course Plan and outcome
Operating systems course is intended as a general introduced to the techniques used to implement operating
systems and related kinds of systems software. The topics covered will be functions and structure of operating
systems, process management (creation, synchronization, and communication); processor scheduling; deadlock
prevention, avoidance, and recovery; main-memory management; virtual memory management (swapping,
paging, segmentation and page-replacement algorithms); control of disks and other input/output devices; file-
system structure and implementation; and protection and security.
OUTCOMES:
At the end of the course students will be able to:
1. Outline various concepts and features of Operating systems.
2. Compare various operating systems with respect to characteristics and features
3. Implement algorithm of CPU Scheduling, Memory Scheduling and disk scheduling.

COURSE OUTCOME
CO 1: Understand the structure and functions of OS.
CO 2: Learn about Processes, Threads and Scheduling Algorithms.
CO 3: Understand the principles of Concurrency and Deadlocks
CO 4: Learn Various Memory Management Scheme
CO 5: Study I/O Management and File Systems

CO-PO and CO-PSO MAPPING

CO PO PO PO PO PO PO PO PO PO PO P P PS PS PS
1 2 3 4 5 6 7 8 9 10 O O O O O
11 12 1 2 3
CO1 2 3 1 1 1 1 2 2 1
CO2 1 2 3 1 1 1 1 1 2 2 2 2
CO3 1 2 3 2 1 1 1 2 2 2
CO4 2 2 3 2 2 1 1 2 2 2 2
CO5 2 3 1 1 1 1 2 2 1
AV 1.6 2.4 3 1.8 1.5 1 1 1 1 2 2 2 1.6
G

JUSTIFICATION CO-PO MAPPING

 EVALUATION SCHEME

PROGRAM: B. Tech SEMESTER: IV

SUB SUB NAME: INTERNAL
CODE: OPERATING
L T P EXTERNAL MARKS
MARKS
3 0 2 (50) (100)
KCS 401 SYSTEM
Teaching Aids: White board and Black Board
 Understand the structure and functions of OS.
 Learn about Processes, Threads and Scheduling Algorithms.
 Understand the principles of Concurrency and Deadlocks
 Learn Various Memory Management Scheme
 Study I/O Management and File Systems

METHOD OF INTERNAL ASSESSMENT (As Per AKTU, Lucknow)

S.No. CRITERIA MARKS
1 Class Test 30
2 Individual presentation/ Assignment/Viva-voce 10
3 Attendance of Student 10
Syllabus
 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SESSION 2022-23
B.TECH. CSE 2 :: Section : A :: IV SEM (Student List )
S.No. I.D. No. AICTE Enrollment No Name
1 200654 2001320100017 ADITYA RAJ SINGH
2 200725 2001320100050 DHRUV RAJPUT
3 200056 2001320100054 GAURAV KARMAKAR
4 2100914 2101320100001 ABHAY GYAN
5 2100453 2101320100002 ABHISHEK KUMAR
6 2100909 2101320100003 ABHISHEK KUMAR
7 2100943 2101320100004 ABHISHEK KUMAR JHA
8 2100859 2101320100005 ABHISHEK PRATAP MALL
9 2100567 2101320100007 ABU HANZALA
10 2100793 2101320100008 ACHYUT ANAND
11 2100961 2101320100010 ADARSH GAUTAM
12 2100844 2101320100011 ADARSH KUMAR SINGH
13 2100500 2101320100012 ADARSH TIWARI
14 2100708 2101320100013 ADITYA KUMAR
15 2100741 2101320100014 ADITYA KUMAR JAISWAL
16 2100829 2101320100015 ADITYA YADAV
17 2100553 2101320100017 AKASH KUMAR
18 2100947 2101320100018 AKASH RAJ
19 2100856 2101320100019 AKASH RAJ VERMA
20 2100391 2101320100020 AKASH YADAV
21 2100872 2101320100022 AKSHIT SHARMA
22 2100805 2101320100023 AMAN KUMAR
23 2100838 2101320100024 AMAN KUMAR
24 2100772 2101320100026 AMAN KUMAR DUBEY
25 2100773 2101320100027 AMAN KUMAR YADAV
26 2100738 2101320100028 AMAN NAEEM
27 2100841 2101320100029 AMAN SINGH
28 2100794 2101320100030 AMIT KUMAR
29 2100736 2101320100031 AMIT KUMAR YADAV
30 2100837 2101320100034 ANGAD YADAV
31 2100906 2101320100035 ANIKET KUMAR NIRALA
32 2100721 2101320100037 ANKITA SINGH
33 2100869 2101320100038 ANSHUMAN
34 2100936 2101320100039 ANUJ TRIPATHI
35 2100372 2101320100041 ARVIND KUMAR
36 2100570 2101320100042 ARYAN MITTAL
37 2100854 2101320100045 ATHARV AGGARWAL
38 2100867 2101320100046 ATHARV GOSWAMI
39 2100878 2101320100047 AVINASH TRIPATHI
40 2100887 2101320100048 AVINISH KUMAR
41 2100915 2101320100050 AYUSH MISHRA
42 2100443 2101320100051 AYUSH SHARMA
43 2100705 2101320100052 AYUSH YADAV
44 2100786 2101320100053 AYUSHI GOEL
45 2100874 2101320100056 CHITRESH GYANANI
46 2100225 2101320100057 DEEPANSHI TOMAR
47 2100592 2101320100058 DEEPENDRA SINGH
48 2100748 2101320100059 DHEERAJ KUMAR
49 2100771 2101320100060 DIPENDRA ANAND
50 2100720 2101320100061 DIVYA SHREYASH
51 2200052 2201320109001 ADITYA KUMAR
52 2200136 2201320109002 AKRITI KUMARI RAJBHAR
53 2200108 2201320109003 AMAN RAJ
54 2200155 2201320109004 ANAM
55 2200017 2201320109005 ANUP YADAV
56 2200125 2201320109006 ASHISH UPADHYAY
57 2200079 2201320109013 MD SHAFEEQUE HAIDER
 LECTURE PLAN

LECTURE DATE DATE

DESCRIPTION *PEDAGOGY (SCHEDULED) (EXCUTED) REMARK
NO.
UNIT I:
Operating system and
1 Lecture/PPT/PDF
functions
Classification of
Operating systems-
2 Lecture/PPT/PDF
Batch, Interactive,
Time sharing,
Real Time System,
3 Multiprocessor Lecture/PPT/PDF
Systems,
Multiprocess Systems,
4 Multiuser Systems
Lecture/PPT/PDF
Multithreaded Systems,
5 Operating System Lecture/PPT/PDF
Structure
Layered structure,
6 System Components
Lecture/PPT/PDF
Operating System
7 services, Reentrant Lecture/PPT/PDF
Kernels
Monolithic and
8 Microkernel Systems.
Lecture/PPT/PDF
UNIT II:
Process Concept,
9 Principle of Lecture/PPT/PDF
Concurrency,
Producer / Consumer
10 Problem, Mutual Lecture/PPT/PDF
Exclusion,
 Critical Section
11 Problem, Dekker’s Lecture/PPT/PDF
solution,
Peterson’s solution,
12 Semaphores,
Lecture/PPT/PDF

Test and Set operation;

13 Classical Problem in Lecture/PPT/PDF
Concurrency
Dining Philosopher
14 Problem, Sleeping Lecture/PPT/PDF
Barber Problem;
Inter Process
15 Communication Lecture/PPT/PDF
models and Schemes
16 Process generation. Lecture/PPT/PDF
UNIT III:
Scheduling Concepts,
17 Performance Criteria,
Lecture/PPT/PDF
Process States, Process
18 Transition Diagram,
Lecture/PPT/PDF
Schedulers, Process
19 Control Block (PCB),
Lecture/PPT/PDF

Process address space,

20 Process identification Lecture/PPT/PDF
information,
Threads and their
21 management
Lecture/PPT/PDF
Scheduling
22 Algorithms,
Lecture/PPT/PDF
Scheduling
23 Algorithms,
Lecture/PPT/PDF
Multiprocessor
24 Scheduling.
Lecture/PPT/PDF
UNIT IV:
Deadlock: System
25 model, Deadlock Lecture/PPT/PDF
characterization,
Prevention, Avoidance
26 and detection,
Lecture/PPT/PDF
Recovery from
27 deadlock.
Lecture/PPT/PDF
Numericals on
28 Scheduling Algorithms
Lecture/PPT/PDF
Basic bare machine,
29 Resident monitor,
Lecture/PPT/PDF
Multiprogramming
30 with fixed partitions
Lecture/PPT/PDF
Multiprogramming
31 with variable partitions, Lecture/PPT/PDF
Protection schemes
32 Paging, Segmentation Lecture/PPT/PDF
 Paged segmentation,
33 Virtual memory Lecture/PPT/PDF
concepts,
Demand paging,
34 Performance of Lecture/PPT/PDF
demand paging
Page replacement
35 algorithms,
Lecture/PPT/PDF
UNIT V:
Thrashing, Cache
36 memory organization, Lecture/PPT/PDF
Locality of reference.
I/O devices, and I/O
37 subsystems, I/O Lecture/PPT/PDF
buffering,
 Disk storage and disk
38 scheduling,
Lecture/PPT/PDF
RAID. File System:
39 File concept
Lecture/PPT/PDF
File organization and
40 access mechanism
Lecture/PPT/PDF
File directories, and
41 File sharing,
Lecture/PPT/PDF
File system
42 implementation issues
Lecture/PPT/PDF
File system protection
43 and security.
Lecture/PPT/PDF

HOD Sign Faculty Sign

Text books:
1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
2. SibsankarHalder and Alex A Aravind, “Operating Systems”, Pearson Education
3. Harvey M Dietel, “ An Introduction to Operating System”, Pearson Education
4. D M Dhamdhere, “Operating Systems : A Concept based Approach”, 2nd Edition,
5. TMH 5. William Stallings, “Operating Systems: Internals and Design Principles ”, 6th Edition,
Pearson Education
 LIST OF SLOW LEARNER STUDENTS ( CT1 )
SNO I. D. No. Roll No. Name
1 2100906 2101320100035 ANIKET KUMAR NIRALA
2 2100708 2101320100013 ADITYA KUMAR
3 2100837 2101320100034 ANGAD YADAV
4 2100391 2101320100020 AKASH YADAV
5 2100372 2101320100041 ARVIND KUMAR
6 2100878 2101320100047 AVINASH TRIPATHI
7 200654 2001320100017 ADITYA RAJ SINGH
8 200725 2001320100050 DHRUV RAJPUT
9 200056 2001320100054 GAURAV KARMAKAR
10 2100909 2101320100003 ABHISHEK KUMAR
11 2100859 2101320100005 ABHISHEK PRATAP MALL
12 2100567 2101320100007 ABU HANZALA
13 2100793 2101320100008 ACHYUT ANAND
14 2100961 2101320100010 ADARSH GAUTAM
15 2100844 2101320100011 ADARSH KUMAR SINGH
16 2100741 2101320100014 ADITYA KUMAR JAISWAL
17 2100829 2101320100015 ADITYA YADAV
18 2100553 2101320100017 AKASH KUMAR
19 2100947 2101320100018 AKASH RAJ
20 2100856 2101320100019 AKASH RAJ VERMA
21 2100838 2101320100024 AMAN KUMAR
22 2100772 2101320100026 AMAN KUMAR DUBEY
23 2100773 2101320100027 AMAN KUMAR YADAV
24 2100841 2101320100029 AMAN SINGH
25 2100794 2101320100030 AMIT KUMAR
26 2100736 2101320100031 AMIT KUMAR YADAV
27 2100570 2101320100042 ARYAN MITTAL
28 2100887 2101320100048 AVINISH KUMAR
29 2100915 2101320100050 AYUSH MISHRA
30 2100592 2101320100058 DEEPENDRA SINGH
31 2100720 2101320100061 DIVYA SHREYASH
32 2200052 2201320109001 ADITYA KUMAR
33 2200136 2201320109002 AKRITI KUMARI RAJBHAR
34 2200108 2201320109003 AMAN RAJ
35 2200017 2201320109005 ANUP YADAV
36 2200079 2201320109013 MD SHAFEEQUE HAIDER

Faculty Sign
 REMEDIAL CLASSES FOR SLOW LEARNER

LECTURE DATE TIME

NO.
after 1st sessional
1 Assignments, extra class
2
3
4
after 2nd sessional
1
2
3
4
after PUT
1
2
3
4

HOD Sign Faculty Sign

 LIST OF ADVANCE LEARNER

S.No. ID No. UPTU ROLL NO. STUDENT NAME

1 2100500
2 2100869
3 2100748
4 2100453
5 2100805
6 2100225
7 2100721
8 2100786
9 2100771
10 2200155
11 2100943
2101320100012ADARSH TIWARI
2101320100038ANSHUMAN
2101320100059DHEERAJ KUMAR
2101320100002ABHISHEK KUMAR
2101320100023AMAN KUMAR
2101320100057DEEPANSHI TOMAR
2101320100037ANKITA SINGH
2101320100053AYUSHI GOEL
2101320100060DIPENDRA ANAND
2201320109004ANAM
2101320100004ABHISHEK KUMAR JHA

HOD Sign Faculty Sign

ADDITIONAL CONTENT PROVIDED TO ADVANCE LEARNER

CONTENT NO. CONTENT TYPE DATE REMARK
1 Gate questions
2
3

CT1 Marks
 SESSION 2022-23
B.TECH. CSE 2 :: Section : A :: IV SEM (Students List )
S.No. I.D. No. AICTE Enrollment No Name Obtained Marks (30)

1 2100906 2101320100035 ANIKET KUMAR NIRALA 0

2 2100708 2101320100013 ADITYA KUMAR 6
3 2100837 2101320100034 ANGAD YADAV 7
4 2100391 2101320100020 AKASH YADAV 11
5 2100372 2101320100041 ARVIND KUMAR 11
6 2100878 2101320100047 AVINASH TRIPATHI 11
7 2100914 2101320100001 ABHAY GYAN 12
8 2200125 2201320109006 ASHISH UPADHYAY 14
9 2100936 2101320100039 ANUJ TRIPATHI 15
10 2100854 2101320100045 ATHARV AGGARWAL 15
11 2100874 2101320100056 CHITRESH GYANANI 15
12 2100872 2101320100022 AKSHIT SHARMA 16
13 2100867 2101320100046 ATHARV GOSWAMI 16
14 2100443 2101320100051 AYUSH SHARMA 18
15 2100738 2101320100028 AMAN NAEEM 20
16 2100705 2101320100052 AYUSH YADAV 20
17 2100500 2101320100012 ADARSH TIWARI 21
18 2100869 2101320100038 ANSHUMAN 22
19 2100748 2101320100059 DHEERAJ KUMAR 22
20 2100453 2101320100002 ABHISHEK KUMAR 23
21 2100805 2101320100023 AMAN KUMAR 23
22 2100225 2101320100057 DEEPANSHI TOMAR 23
23 2100721 2101320100037 ANKITA SINGH 24
24 2100786 2101320100053 AYUSHI GOEL 24
25 2100771 2101320100060 DIPENDRA ANAND 25
26 2200155 2201320109004 ANAM 25
27 2100943 2101320100004 ABHISHEK KUMAR JHA 27
28 200654 2001320100017 ADITYA RAJ SINGH A
29 200725 2001320100050 DHRUV RAJPUT A
30 200056 2001320100054 GAURAV KARMAKAR A
31 2100909 2101320100003 ABHISHEK KUMAR A

32 2100859 2101320100005 ABHISHEK PRATAP MALL A

33 2100567 2101320100007 ABU HANZALA A
34 2100793 2101320100008 ACHYUT ANAND A
35 2100961 2101320100010 ADARSH GAUTAM A
36 2100844 2101320100011 ADARSH KUMAR SINGH A

37 2100741 2101320100014 ADITYA KUMAR JAISWAL A

38 2100829 2101320100015 ADITYA YADAV A
39 2100553 2101320100017 AKASH KUMAR A
40 2100947 2101320100018 AKASH RAJ A
41 2100856 2101320100019 AKASH RAJ VERMA A
42 2100838 2101320100024 AMAN KUMAR A
43 2100772 2101320100026 AMAN KUMAR DUBEY A
44 2100773 2101320100027 AMAN KUMAR YADAV A
45 2100841 2101320100029 AMAN SINGH A
46 2100794 2101320100030 AMIT KUMAR A
47 2100736 2101320100031 AMIT KUMAR YADAV A
48 2100570 2101320100042 ARYAN MITTAL A
49 2100887 2101320100048 AVINISH KUMAR A
50 2100915 2101320100050 AYUSH MISHRA A
51 2100592 2101320100058 DEEPENDRA SINGH A
52 2100720 2101320100061 DIVYA SHREYASH A
53 2200052 2201320109001 ADITYA KUMAR A

54 2200136 2201320109002 AKRITI KUMARI RAJBHAR A

55 2200108 2201320109003 AMAN RAJ A
56 2200017 2201320109005 ANUP YADAV A

57 2200079 2201320109013 MD SHAFEEQUE HAIDER A

 02 Copy of Advance 02 Copy of Medium 01 Copy of
Each Sessional
Learner Learner Slow Learner

Each 02 Copy of Advance 02 Copy of Medium 01 Copy of

Assignment Learner Learner Slow Learner

02 Copy of Advance 02 Copy of Medium 01 Copy of

Each PUT
Learner Learner Slow Learner

HOD Sign Faculty Sign

 QUESTION BANK

UNIT 1

1. Define essential properties of the following types of Operating system:

i) Batch operating system
ii) Interactive operating system
iii) Time sharing operating system
iv) Real time operating system
2. Define a virtual machine (VM). With a neat diagram, explain the working of a VM. What are the
benefits of a VM?
3. Distinguish among the following terminologies associated with the operating system and explain
eachof them in detail. Multiprogramming systems, Multitasking systems, Multiprocessor systems.
4. What are system calls? Explain the different categories of the system calls.
5. Justify the statement “Operating System can be viewed as a government, resource allocator and a
control program”.
6. Explain different sub components of an operating system.
7. Write a brief note on different operating system structures
8. What is the purpose of command interpreter? Why is it usually separate from the Kernel?
9. What is distributed operating system? What are the advantages of distributed operating system?
10. Define cache memory
11. What is an interrupt.
12. Explain operating system functions and services in detail.
13. Explain User Operating-System Interface in detail
14. Explain essential features of following structure of O.S
a. Monolithic System
b. Layered Systems
c. Micro Kernels

15. Define user mode and kernel mode. Why two modes are required?
16. Distinguish between the client-server and peer-to-peer models of distributed system
17. List any four process management system call.
18. What are the requirements of hard real time and soft real time system?
19. Explain the termParallel System
20. Describe the difference between symmetric and asymmetric multiprocessing?
 UNIT 2

1. Explain and differentiate between user level and kernel level thread.
2. Explain the following term related to IPC - Race condition
3. Explain Peterson’s solution for achieving mutual exclusion
4. What is semaphore?
5. Discuss product-consumer problem with semaphore.
6. Write short note on Dining philosopher problem
7. Write short on message passing
8. Write short notes on Starvation
9. Why mutual exclusion required? Explain any 2 methods of achieving mutual exclusion in detail.
10. Explain in detail the following solutions for achieving mutual exclusion TSL instruction
11. What are critical sections?
12. What are Monitors?
13. What is Principle of Concurrency?
14. Explain Sleeping Barbers Problem.
15. Explain Process Generation.
16. Explain the ways in which inter process communication can be achieved.
17. Define the actions taken by a kernel to context switch: a. Among threads b. Among processes
18. What are co-operating processes?
19. Write short on shell
20. Illustrate the use of fork and exec system calls
 UNIT 3

1. What are various criteria for a good process scheduling algorithm? Explain any two preemptive
scheduling algorithms in brief.
2. Explain the following process scheduling algorithm
a)Priority scheduling b) Shortest job first scheduling
3. Consider following processes with length of CPU burst time in milliseconds Process Burst time
P1 5
P2 10
P3 2
P4 1
All process arrived in order p1, p2, p3, p4 all time zero
a) Draw Gantt charts illustrating execution of these processes for SJF and round robin (quantum=1)
b) Calculate waiting time for each process for each scheduling algorithm
c) Calculate average waiting time for each scheduling algorithm
4.

Consider following processes with length of CPU brust time in millisecond

Process Brust time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
All processes arrived in order p1, p2, p3, p4, p5 all at time zero.

1) Draw Gant charts illustrating execution of these processes for SJF,

non preemptive priority (smaller priority number implies a higher priority)
& round robin(quantum=1)
2) Calculate turnaround time for each process for scheduling algorithm in part (1)
3) Calculate waiting time for each scheduling algorithm in part (1)

5. What are the conditions for deadlock? Explain deadlock detection and recovery in detail.
6. Explain deadlock prevention in detail.
7. Explain deadlock avoidance using banker’s algorithm in details
8. Consider the following snapshot
Allocated Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P40 0 1 4 0 6 5 6
Answer the following questions using banker’s algorithm: a) What are contents of matrix end?
b) Is the system in safe state? c) If request for process p1 arrives for (0,4,2,0) .Can the request be
granted immediately?
9. A system has three types of resources R1 R2 R3 and their number of units are 3, 2, 2 respectively. Four
processes P1 P2 P3 p4 are currently competing for these resources in following number.
a) P1 is holding one unit of R1 and is requesting for one unit of R2.

b) P2 is holding two units of R2 and is requesting for one unit each of R1 and R3.
c) P3 is holding one unit of R1 and is requesting for one unit of R2.
d) P4 is holding two units of R3 and requesting for one unit of R1.
Determine which if any of the processes are deadlock in this state.

10. Differentiate Pre-emptive and Non-preemptive scheduling giving the application of each of them.

11. What is the criterion used to select the time quantum in case of round-robin scheduling algorithm?
Explain it with a suitable example.

12. Explain FCFS scheduling algorithm. Find the average turnaround time and average waiting time for
the processes given in the table below.

Process CPU burst time(in ms)

P1 24
P2 3
P3 3

13. Explain the resource allocation graph

14. Explain about process scheduling? Explain different types of schedulers?
15. Define process and Explain process states in details with diagram
16. Explain process states and process control block in details
17. Describe the fields in a process control block (PCB)
18. Explain threads in detail
19. List the main difference and similarities between threads and process.
20. What is a dispatcher?
 Unit 4
1. Explain multiprogramming with fixed partition
2. Explain multiprogramming with dynamic partition.
3. Explain static partitioned allocation with partition sizes 300,150, 100, 200, 20. Assuming first
fit method indicate the memory status after memory request for sizes 80, 180, 280, 380, 30.
4. Explain following allocation algorithm. a. First fit b. Best fit c. Worst fit
5. Explain the difference between logical and physical addresses?
6. What is paging? Discuss basic paging technique in details.
7. Explain Segmentation in detail.
8. What is demand paging? Explain it with address translation mechanism used
9. How a page table is implemented?
10. What is virtual memory? How it is implemented.
11. Write short note on: a. Compaction b. TLBc. fragmentation
12. Explain following page replacement algorithm in detail. i. LRU ii. FIFO
13. Explain the following page replacement algorithm. a) Optimal page replacement
14. Explain difference between internal external fragmentations in detail.
15. Consider the following page reference string. 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2How many page
faults would occur for the following replacement algorithm, assuming four and six frames
respectively?
a. page replacement. b. FIFO page replacement.
16. Describe the term page fault frequency. What is thrashing? How is it controlled by OS?
17. Free memory holes of sizes 15K, 10K, 5K, 25K, 30K, 40K are available. The processes of size 12K,
2K, 25K, 20K is to be allocated. How processes are placed in first fit, best fit, worst fit. Calculate
internal as well as external fragmentation.
18. On a simple paging system with 2^24 bytes of physical memory, 256 pages of logical address Space,
and a, page size of 2^10 bytes, how many bits are in logical address?
19. Calculate page faults for (LRU, FIFO, OPT) for following sequences where page frame is three.
0,1,2,1,4,2,3,7,2,1,3,5,1,2,5.
20. Explain Paged Segmentation.
 Unit 4
1. Discuss briefly the following issues related to device independent i/o software. a. Uniform
interfacing for device drivers. b. Buffering.
2. Discuss in details devices drivers.
3. Write short notes on: a. Devices independent I/O software b. Goals of I/O software c. Interrupt handler
d. I/O Devices. e. Device drivers f. Device controllers g. Disk space management h. Disk arm
scheduling algorithm
4. Discuss the following: a) Magnetic disk b) CDs c) RAID d) DVDs e) Formatting Disk
5. Discuss the following related to disk space management a) Block size b) Keeping track of free blocks
6. Suppose a disk drive has 400 cylinders , numbered 0 to 399.The driver is currently serving a request
at cylinder 143 and previous request was at cylinder 125 .The queue of pending request in FIFO order
is: 86,147,312,91,177,48,309,222,175,130. Starting from the current head position what is the total
distance in cylinders that the disk to satisfy all the pending request for each of the following disk
scheduling algorithms? SSTS
7. Do Question 6 with SCAN
8. Do Question 6 with C-SCAN
9. What criteria are important in choosing a file organization?
10. Explain briefly file system architecture & file management function
11. Which are the typical information elements of a file directory?
12. Which are the typical operations performed on directory?
13. What are the typical access rights that may be granted or denied to a particular user for a particular file?
14. Explain the following file allocation methods a) Contiguous allocation b) i-node
15. Suppose the head of a moving- head disk with 200 tracks, numbered 0 to 199, is Currently serving a
request at track 143 and has just finished a request at track 125. If the queue of requests is kept in FIFO
order: 86, 147, 91, 177, 94, 150, 102, 175, 130. What is the total head movement to satisfy these
requests for the following Disk scheduling algorithms. (a)FCFS (b) Random (d) SCAN (e) SSTF (f) C-
SCAN
16. Explain Disk scheduling algorithm C-LOOK
17. Explain about single-level, two-level directory structure?
18. Explain about file system mounting, file sharing?
19. What is Access Control List.
20. Explain file system reliability & performance in detail.