Download accounting for managers - Pailan College of Management and

Pailan College of Management and Technology
Computer Application Department
Lessons Plan
3rd Semester (Section - MCA)
2013 – 2014
OPERATING SYSTEMS AND SYSTEMS SOFTWARE
Faculty
Nilanjan Sen
Course Title
M. C. A.
Subject Code
MCA - 301
Objective of the
subject
Operating system is one of the most important things in computer science. Starting
from desktop to hand held cellular phone, without operating system everything is
useless. It not only helps us to use the computers or laptops etc. properly, but it acts as
a good resource manager also. In this subject, we will learn various types and features
of Operating system as well as the internal working principle of it.
Teaching
Black board, Transparent slides, Class exercises, Assignments, and Practical.
Methodology
Assessment of the Students will be on the basis of the following weightage :-
1. WBUT Semester Exam 70
2. Attendance
5
3. Assignment
5
4. Mid Term. I Exam
20
5. Mid Term. II Exam
20
Total
Best of two
100 Marks
Text Books
Operating System Concepts – Silberschatz, Galvin, Gagne, John Wiley
Reference books
Modern Operating system – Andrew S. Tanenbaum, PHI
Course Duration
40 lectures.
1. Del net connect
2. Wikipedia website (www.wikipedia.org)
3. Bjarne Strustrup website (http://www.stroustrup.com/bs_faq2.html)
50 minutes each
Webs Resources
Time per Lecture
1
Module
Topic
1
Basics of Operating
system





Detailed of
Course to be covered
Importance of OS
Basic concepts and terminologies
Types of OS
Different views, journey of a command execution
Design and implementation of OS
Assignment
No. of
Lectures.
2
Questions
1. Compare multitasking, multiprocessing and multiprogramming OS.
2. What is real time system?
3. Explain how UNIX executes the command “rm” internally.
Module
2
Topic
Process
Management
Detailed of
Course to be covered
2.1 Process basics:
 Concept and views
 OS view of processes
 OS services for process management
 Various scheduling algorithms and their
performance evaluation
2.2 Inter process communication
 Concept
 Mutual exclusion, semaphores
 Hardware support for mutual exclusion
 Queuing implementation of semaphores
 Classical problems of concurrent programming
 Critical region and conditional critical region
 Monitors, messages
2.3 Thread
2.4 Deadlocks
 Causes of deadlock
 Deadlock prevention
 Deadlock avoidance: Banker’s algorithm
 Deadlock detection & recovery
Assignment
Questions
1. Describe the states of the process.
2. What are the three schedulers? Explain their working principles.
3. Describe all the CPU scheduling algorithms with suitable examples.
4. What is critical section? Explain how semaphore is used for process synchronization?
5. Explain the dining philosophers’ problem with algorithm.
6. What are the causes of deadlock?
7. Explain banker’s algorithm.
2
No. of
Lectures
3
6
1
3
Module
3
Topic
Memory
management
Detailed of
Course to be covered
3.1. Static memory management
 Static partition
 Dynamic partition
 Overlay
 Swapping
3.2. Dynamic memory management
 Paging
 Hardware support for paging, TLB
 Design issues for paging system
 Segmentation
 Virtual memory
 Various page replacement algorithms
No. of
Lectures
3
5
Assignment
Questions
1. What problem occurs during static partition? How the problem can be solved?
2. What is external fragmentation? How it can be solved?
3. Describe with a suitable diagram the concept of paging.
4. Write the working principle of virtual memory.
5. Explain FIFO and LRU algorithm.
Module
Topic
4
File management
Detailed of
Course to be covered
4.1 Types of secondary memory
4.2 File & Directory
 Basic concepts
 Types of files and directories
 Mount point
 Various disk scheduling algorithms
No. of
Lectures
1
3
Assignment
Questions
1. Discuss different types of directory structures.
2. What is mount point? How it is used in a file system. What are the file systems of Windows, Unix
and Linux OS?
3. Discuss different disk scheduling algorithms with suitable pictures.
3
Module
5
Topic
Security &
Protection
Detailed of
Course to be covered
7.1 Basic concepts of security
 Different kinds of threats
 Security principle
 Types of authentication
 Formal models of protection
 worms and viruses
7.2 Cryptography
 Symmetric key cryptography
 Asymmetric key cryptography
 Digital signature
No. of
Lectures
3
3
Assignment
Questions
1. What are the threats of a computer system?
2. Discuss the four models of protection.
3. What is the difference between symmetric and asymmetric key?
4. Discuss RSA algorithm.
5. What is digital signature? Explain.
Module
6
Topic
Advanced topic
Detailed of
Course to be covered
6.1 Multiprocessor system
 Classification and types
 OS functions and requirements
6.2 Parallel computing
 Introduction
 multiprocessor interconnection synchronization
6.3 Distributes OS
 Rationales
 Algorithms for distributed processing
 In-process communication & synchronization
 File systems
 Security and protection mechanism
 Input/output systems
 Processes and processors in distributed system
 Performance measurement, monitoring and
evaluation
Assignment
Questions
1. Describe Flynn’s classification.
2. What is distributed system? How it is different from conventional system?
4
No. of
Lectures
1
1
2
Module
7
Topic
Other system
softwares
Detailed of
Course to be covered
7.1 Different system softwares
 Linker
 Loader
 Assembler
 Compiler
Assignment
No. of
Lectures
2
Questions
1. What is the difference between one-pass and two-pass assembler?
2. Describe all the phases of a compiler.
3. What are the jobs of linker and loader?
Module
8
Topic
Case study
Detailed of
Course to be covered
8.1 UNIX OS
 File system
 CPU management
 Memory management
Assignment
No. of
Lectures
1
Questions
1. Describe the file system of UNIX with a suitable diagram.
2. Compare how CPU and memory was managed by previous version of Unix than current version.
5