Scribd
Upload
4 views

OS Syllabus

Syllabus of Operating System BCA

Uploaded by

vinod.pq
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

OS Syllabus

Syllabus of Operating System BCA

Uploaded by

vinod.pq
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

OPERATING SYSTEMS

Course Outcomes
CO1 To analyze the memory management and its allocation policies
CO2 To understand synchronization and deadlock conditions and their possible
solutions
CO3 To discuss the storage management policies with respect to different storage
CO4 To evaluate the concept of the operating system with respect to Linux
architecture and commands

UNIT 1 [11Hours ]
Introduction: Computer System Organization, Architecture, Structure, Operations, Process
Management, Memory Management, Storage Management. Operating System Structures: Services,
System Calls, Types, Operating System Structure, System Boot. Processes: Process Concept,
Scheduling, Operations, Inter-process Communication. Multithreaded Programming:
Multithreading Models
UNIT-II [12Hours]
Process Synchronization: The Critical-Section Problem, Peterson's Solution, Synchronization
Hardware, Mutex Locks, Semaphores, Classic Problems of Synchronization, Monitors,
Synchronization Examples. Process Scheduling: Criteria, Scheduling Algorithms, Multi-Processor
Scheduling, Real-time CPU Scheduling. Deadlocks: System model, Characterization, Methods for
handling deadlocks, Deadlock Prevention, Avoidance, Detection and Recovery from deadlock.

UNIT III [11 Hours]

Memory Management Strategies: Background, Swapping, Contiguous Memory Allocation,


Segmentation, Paging, Structure of the Page Table. Virtual Memory Management: Demand Paging;
Copy-on-Write, Page Replacement; Allocation of Frames, File System: File Concept, Access
Methods, Directory and Disk Structure, Protection. File-system Implementation: Structure, File-
System and Directory Implementation, Allocation Methods, Free Space Management. Mass-Storage
Structure: Overview, Disk Scheduling, Disk Management.

.
UNIT IV [11Hours]
Introduction to Linux Programming: Linux system Architecture, Linux Command format, Linux
Internal and External Commands, Directory Commands, File related commands, Disk related
commands, General Utilities

Text Books

1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne; Systems Concepts 9th
Edition, 201 6 India, Wiley.
2. William Stallings, "Operating Systems and Design Principles", Pearson, thEdition,2018

Reference Books
1. D M Dhamdhere; operating systems - A concept Based Approach, 3'd Edition, Tata McGraw
- Hill.
2. Sumitabha Das: "I-INIX Concepts and Applications", 4th Edition,TataMcGraw Hill' 2006
3. MGVenkateshmurthy,"uNlXandShellProgramming",Pearson Edition Asia'2005

Course Articulation Matrix: Mapping of Course Outcomes(COs) with Program Outcomes(POs1-12)

Course Outcome(COs) Program


Outcomes(POs)

1 2 3 4 5 6 7 8 9 10 11 12

CO1 4 3 4 2 4 2

CO2 4 2 3 2 3 2 2

CO3 3 3 4 2 2 2

CO4 3 2 2 2 4 2

DATA STRUCTURE LAB

NOTE: For all the programs write the output, flowchart and number of basic operations performed.

1. Write a program to search for an element in an array using binary and linear search.
2. Write a program to sort list of n numbers using Bubble Sort algorithms.
3. Perform the Insertion and Selection Sort on the input {75,8,1,16,48,3,7,0} and display the
output in descending order.
4. Write a program to insert the elements {61,16,8,27} into singly linked list and delete 8,61,27
from the list. Display your list after each insertion and deletion.
5. Write a program to insert the elements {45, 34, 10, 63,3} into linear queue and delete three
elements from the list. Display your list after each insertion and deletion.
6. Write a program to simulate the working of Circular queue using an array.
7. Write a program to insert the elements {61,16,8,27} into ordered singly linked list and delete
8,61,27 from the list. Display your list after each insertion and deletion.
8. Write a program for Tower of Honoi problem using recursion.
9. Write recursive program to find GCD of 3 numbers.
10. Write a program to demonstrate working of stack using linked list.
11. Write a program to convert an infix expression x^y/(5*z)+2 to its postfix expression
12. Write a program to evaluate a postfix expression 5 3+8 2 - *.

You might also like