15CS43T: Operating System Information Sci 3rd Sem Syllabus for Diploma DTE Karnataka C15 Scheme

Operating System detail DTE Kar Diploma syllabus for Information Science And Engineering (IS), C15 scheme is extracted from DTE Karnataka official website and presented for diploma students. The course code (15CS43T), and for exam duration, Teaching Hr/week, Practical Hr/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below. The syllabus PDFs can be downloaded from official website.

For all other information sci 3rd sem syllabus for diploma c15 scheme dte karnataka you can visit Information Sci 3rd Sem Syllabus for Diploma C15 Scheme DTE Karnataka Subjects. The detail syllabus for operating system is as follows.

Pre-requisites:

Basic Computer Concepts

Course Objectives:

1. Understand the services of an operating system provides to its users and system itself.
2. Apply various CPU scheduling algorithms and recognize the classic synchronization problems.
3. Compare methods for handling deadlocks and apply various memory management techniques.
4. Describe file systems.

Course Outcomes:

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

UNIT I: Introduction to Operating System 08 Hrs

What operating systems do? Computer System architecture, Operating System structure, Operating System operations, Process management, Memory management, Storage management, Protection and security, Distributed system, Special-purpose systems, Computing environments, Open-source Operating Systems.

UNIT II: Process Management 12 Hrs

Process concept, Process scheduling, Operations on processes, Inter-process communication, Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms.

UNIT III: Synchronization & Deadlocks 08 Hrs

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

UNIT IV:Memory Management Strategies 08 Hrs

Background, Swapping, Contiguous memory allocation, Paging, Structure of page table, Segmentation

UNIT V: Virtual Memory Management 08 Hrs

Background, Demand paging, Copy-on-write, Page replacement, Allocation of frames.

UNIT VI: File System 08 Hrs

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

Text Books:

1. Operating System Principles – Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 8th edition, Wiley-India. (Chapters-1, 3, 5, 6, 7, 8, 9, 10 and 11)

ISBN- 9788126520510

Reference Books:

1. Operating Systems, I. Chandra Mohan, PHI, 2013, ISBN – 9788120347267
2. http://www.tutorialspoint.com/operating_system/
3. http://courses.cs.vt.edu/~csonline/OS/Lessons/index.html
4. http://www.nptel.ac.in

Suggested List of Student Activities:

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)

Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5 students.

1. Each group should do any one of the following type activity or any other similar activity related to the course and before conduction, get it approved from concerned course coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur

1. How to install and Uninstall an Operating System on a New Computer
2. How to Remove a Second Operating System from a PC
3. A Survey of recent Operating System
4. Case study on real time deadlock situation
5. A case study on real time process synchronization
6. Comparison of OS working in single core and multi core environment
7. Comparison of 32 bits and 64 bits OS
8. Operating system is responsible for following activities in connection with management of memory:
• Allocation and de allocation of memory as and when needed
• Keeping track of used and unused memory space.
• Deciding what process to be loaded into memory in case space becomes available.
9. For secondary space management:
• Swap space and free space management
• Disk scheduling
• Allocating space to the data and programs onto the secondary storage device.
10. For process management:
• Creation, deletion of both user and system process.
• Handling process synchronization.
• Deadlock handling.

Course Delivery:

The course will be delivered through lectures and Power point presentations/ Video

Model Question Paper:

(CIE)

1. Explain OS in user’s view and system’s view. (5)
2. Explain the computer system architecture (5)
3. Consider the following set of process with the length of the CPU burst time given in milliseconds

[Process Burst time Priority]

1. P1 9 3
2. P2 11 1
3. P3 3 3

The processes are assumed to have arrived in the order P1, P2, P3 all at time

4. What is the waiting time and turnaround time of each process for FCFS & PRIORITY scheduling algorithms? (5)
5. What is a process? Draw and explain the state transition diagram of a process.

Model Question Paper:

PART-A

Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks

1. Write a note on client/server computing.
2. Explain the contents of PCB with neat diagram.
3. Explain the different scheduling criteria.
4. Write a note on critical-section problem and the solution to solve it.
5. How deadlock can be avoided using resource allocation graph? Explain
6. What is fragmentation? Differentiate between internal and external fragmentation.
7. Explain swapping technique with a neat diagram
8. Write a note on Copy-on-write.
9. Discuss briefly client-server model of file sharing

PART-B

Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks

1. What are the different operating system operations.
2. Different activities in connection with process management, memory management and storage management
3. Consider the following set of process with the length of the CPU burst time given in milliseconds

[Process Burst Time Priority]

1. Pi 10 3
2. P2 13 1
3. P3 3 3
4. P4 8 4

The processes are assumed to have arrived in the order P1, P2, P3 & P4 all at time 0

1. Draw the Gantt chart for FCFS and PRIORITY scheduling algorithms.
2. What is the waiting time and turnaround time of each process for FCFS & PRIORITY scheduling algorithms.
3. Calculate the average waiting time and average turnaround time for FCFS & PRIORITY scheduling algorithms.
4. Explain the different operations on processes.
5. Explain the banker’s algorithm.
6. List and explain different structure of the page table with a neat diagram
7. Explain the contiguous memory allocation.
8. Consider the following reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults would occur for the following page replacement algorithm assuming 3 page frames:
1. LRU
2. FIFO
3. Optimal Page Replacement.
9. List out common file types with their extension and functions
10. Explain Tree-structured directory and Acyclic-graph directory with a neat diagrams

For detail syllabus of all other subjects of BE Information Sci, C15 scheme do visit Information Sci 3rd Sem syllabus for C15 scheme.

Dont forget to download iStudy Syllabus App for latest syllabus and results, class timetable and more.