Академический Документы
Профессиональный Документы
Культура Документы
Society’s
KLE College of Engg. & Technology, Chikodi FORM
ISO 9001: 2015 - KLECET
DEPT. ELECTRONICS & COMMUNICATION ENGG.
Since 1916
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302
COURSE PRE-REQUISITES
Basic knowledge about Computer Organization, the different parts of computer system, Basic functions
of Operating systems while handling computers.
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302
COURSE CONTENT
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302
MODULE WISEPLAN
MODULE NO. MODULE TITLE PLANNED HOURS
1 Introduction to Operating Systems 08
LECTURE SCHEDULE
REVIEW QUESTIONS
1. Explain Batch, interactive, Time-sharing, Real time, Distributed OS.
2. Define Operating system. Mention its types.
3. Explain Goals of OS..
4. Describe the Classes of OS in detail.
5. Differentiate between different Computing Environments.
6. With the help of an example, explain the concept of virtual machines.
7. Explain the Batch processing system and Multi programming system?
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302
8. List the components that an operating system must have. What are the services provided by
operating system?
9. What are advantages and disadvantages virtual machine?
10. Explain in details RTOS.
LECTURE SCHEDULE
REVIEW QUESTIONS
1. What is a process? With the help of a state-transition diagram, explain the various states of a
process.
2. Differentiate pre-emptive & non-preemptive scheduling with example.
3. What is cooperating Process? Explain.
4. What are the benefits offered by cooperating processes? Describe the direct and
indirectinterprocess communication.
5. What are threads? Distinguish between user level and Kernel level threads.
6. Explain a) Round robin scheduling b) Priority based scheduling.
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302
LECTURE SCHEDULE
8 Page sharing
REVIEW QUESTIONS
1. Explain memory allocation preliminaries.
2. Discuss contiguous allocation in detail.
3. Discuss Non-contiguous allocation in detail.
4. Explain the concept of Paging.
5. What is demand Paging. Explain it in detail.
6. Define a) Thrashing b) Belady’s anomaly c) Effective access time in demand paging.
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302
6. Define the term “Locality of reference” and explain its usefulness in preventing
thrashing.
7. Explain memory allocation preliminaries.
8. List Page replacement policies.
9. Explain virtual memory using paging.
10. What is demand Paging. Explain it in detail.
LECTURE SCHEDULE
REVIEW QUESTIONS
1. Explain the fields defined in a file control block with block diagram.
2. Explain the interfacing scheme between file system and IOCS.
3. With a diagram, explain linked allocation and indexed allocation of disk space.
4. Explain the constructional features of disk storage device.
5. Explain directory hierarchy and RAID structures.
6. With diagram, explain linked allocation and indexed allocation of disk space.
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302
LECTURE SCHEDULE
REVIEW QUESTIONS
1. Describe the issues in message passing, direct and indirect naming techniques.
2. Describe the delivery of interprocess messages along with algorithm for send and
receive operations. What are the advantages of mailboxes?
3. Explain interprocess message control box.
4. What are deadlocks? Mention the issues related to deadlocks.
5. Discuss Resource state modeling in deadlocks.
6. Explain Deadlock detection algorithm in detail.
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302
3 Memory Management 08 -- 2 2 2
4 File Systems 08 -- 2 -- 2
Message Passing 08
5 -- -- 2 2
andDeadlocks
Answer Answer Answer Answer any
any two any two any two 5 questions
questions questions questions choosing at
least one
from each
module.
FACULTY IN-CHARGE
Name: Prof.DarshankumarD.Billur
Location: Placement Cell
Building/Block Name: Library Block-Placement section
Document#:
Title: COURSE PLAN Rev: 1.1
FMTC0302