CS3451 INTRODUCTION TO OPERATING SYSTEMS L T P C

3003
COURSE OBJECTIVES:
 To understand the basics and functions of operating systems.
 To understand processes and threads
 Toanalyze scheduling algorithms and process synchronization.
 To understand the concept of deadlocks.
 Toanalyze various memory management schemes.
 To be familiar with I/O management and file systems.
 To be familiar with the basics of virtual machines and Mobile OS like iOS and Android.

UNIT I INTRODUCTION 7
Computer System - Elements and organization; Operating System Overview - Objectives and Functions - Evolution of
Operating System; Operating System Structures – Operating System Services - User Operating System Interface -
System Calls – System Programs - Design and Implementation - Structuring methods

UNIT II PROCESS MANAGEMENT 11

Processes - Process Concept - Process Scheduling - Operations on Processes - Inter-
process Communication; CPU Scheduling - Scheduling criteria - Scheduling algorithms:
Threads - Multithread Models – Threading issues; Process Synchronization - The Critical-
Section problem - Synchronization hardware – Semaphores – Mutex - Classical problems of
synchronization - Monitors; Deadlock - Methods for handling deadlocks, Deadlock
prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock.
UNIT III MEMORY MANAGEMENT 10
Main Memory - Swapping - Contiguous Memory Allocation – Paging - Structure of the Page
Table - Segmentation, Segmentation with paging; Virtual Memory - Demand Paging – Copy
on Write - Page Replacement - Allocation of Frames –Thrashing.
UNIT IV STORAGE MANAGEMENT 10
Mass Storage system – Disk Structure - Disk Scheduling and Management; File-System
Interface - File concept - Access methods - Directory Structure - Directory organization - File
system mounting - File Sharing and Protection; File System Implementation - File System
Structure - Directory implementation - Allocation Methods - Free Space Management; I/O
Systems – I/O Hardware, Application I/O interface, Kernel I/O subsystem.
UNIT V VIRTUAL MACHINES AND MOBILE OS 7
Virtual Machines – History, Benefits and Features, Building Blocks, Types of Virtual
Machines and their Implementations, Virtualization and Operating-System Components;
Mobile OS - iOS and Android.
TOTAL 45 periods

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1 :Analyze various scheduling algorithms and process synchronization.
CO2 :Explain deadlock prevention and avoidance algorithms.
CO3 :Compare and contrast various memory management schemes.
CO4 :Explain the functionality of file systems, I/O systems, and Virtualization
CO5 :Compare iOS and Android Operating Systems.
TEXT BOOKS:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System
Concepts”‖, 10th Edition, John Wiley and Sons Inc., 2018.
2. Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 5th Edition, 2022 New
Delhi.

REFERENCES:
1. RamazElmasri, A. Gil Carrick, David Levine, “ Operating Systems – A Spiral Approach”,
Tata McGraw Hill Edition, 2010.
2. William Stallings, "Operating Systems: Internals and Design Principles", 7th Edition,
Prentice Hall, 2018.
3. AchyutS.Godbole, AtulKahate, “Operating Systems”, McGraw Hill Educatio

TOTAL: 45 PERIODS
CS3461 OPERATING SYSTEMS LABORATORY L T P C
0 0 3 1.5
COURSE OBJECTIVES:
 To install windows operating systems.
 To understand the basics of Unix command and shell programming.
 To implement various CPU scheduling algorithms.
 To implement Deadlock Avoidance and Deadlock Detection Algorithms
 To implement Page Replacement Algorithms
 To implement various memory allocation methods.
 To be familiar with File Organization and File Allocation Strategies.
91

LIST OF EXPERIMENTS:
1. Installation of windows operating system
2. Illustrate UNIX commands and Shell Programming
3. Process Management using System Calls : Fork, Exit, Getpid, Wait, Close
4. Write C programs to implement the various CPU Scheduling Algorithms
5. Illustrate the inter process communication strategy
6. Implement mutual exclusion by Semaphore
7. Write C programs to avoid Deadlock using Banker's Algorithm
8. Write a C program to Implement Deadlock Detection Algorithm
9. Write C program to implement Threading
10. Implement the paging Technique using C program
11. Write C programs to implement the following Memory Allocation Methods

a. First Fit b. Worst Fit c. Best Fit

12. Write C programs to implement the various Page Replacement Algorithms
13. Write C programs to Implement the various File Organization Techniques
14. Implement the following File Allocation Strategies using C programs

a. Sequential b. Indexed c. Linked

15. Write C programs for the implementation of various disk scheduling algorithms
16. Install any guest operating system like Linux using VMware.

TOTAL:45 PERIODS
COURSE OUTCOMES:
At th end of this course, the students will be able to:
CO1 :Define and implement UNIX Commands.
CO2 :Compare the performance of various CPU Scheduling Algorithms.
CO3 :Compare and contrast various Memory Allocation Methods.
CO4 :Define File Organization and File Allocation Strategies.
CO5 :Implement various Disk Scheduling Algorithms.
CO’s-PO’s & PSO’s PO’s PSO’s
MAPPING CO’s

CCS375 WEB TECHNOLOGIES LTPC

2023
COURSE OBJECTIVES:
 To understand different Internet Technologies
 To learn java-specific web services architecture
 To Develop web applications using frameworks
UNIT I WEBSITE BASICS, HTML 5, CSS 3, WEB 2.0 7
Web Essentials: Clients, Servers and Communication – The Internet – World wide web –
HTTP Request Message – HTTP Response Message – Web Clients – Web Servers –
HTML5 – Tables – Lists – Image – HTML5 control elements – Drag and Drop – Audio –
Video controls - CSS3 – Inline, embedded and external style sheets – Rule cascading –
Inheritance – Backgrounds – Border Images – Colors – Shadows – Text – Transformations –
Transitions – Animations. Bootstrap Framework
UNIT II CLIENT SIDE PROGRAMMING 6
Java Script: An introduction to JavaScript–JavaScript DOM Model-Exception Handling-
Validation- Built-in objects-Event Handling- DHTML with JavaScript- JSON introduction –
Syntax – Function Files.
UNIT III SERVER SIDE PROGRAMMING 5
Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions-
Session Handling- Understanding Cookies- DATABASE CONNECTIVITY: JDBC.
UNIT IV PHP and XML 6
An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions-
Form Validation. XML: Basic XML- Document Type Definition- XML Schema, XML Parsers
and Validation, XSL ,
UNIT V INTRODUCTION TO ANGULAR and WEB APPLICATIONS FRAMEWORKS 6
Introduction to AngularJS, MVC Architecture, Understanding ng attributes, Expressions and
data binding, Conditional Directives, Style Directives, Controllers, Filters, Forms, Routers,
Modules, Services; Web Applications Frameworks and Tools – Firebase- Docker- Node JS-
React- Django- UI & UX.
COURSE OUTCOMES:
CO1: Construct a basic website using HTML and Cascading Style Sheets

CO2: Build dynamic web page with validation using Java Script objects and by applying
different event handling mechanisms.
CO3: Develop server side programs using Servlets and JSP.
CO4: Construct simple web pages in PHP and to represent data in XML format.
CO5: Develop interactive web applications.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
List Of Experiments:
1. Create a web page with the following using HTML.
• To embed an image map in a web page.
• To fix the hot spots.
• Show all the related information when the hot spots are clicked.
2. Create a web page with all types of Cascading style sheets.
3. Client Side Scripts for Validating Web Form Controls using DHTML.
4. Installation of Apache Tomcat web server.
5. Write programs in Java using Servlets:
● To invoke servlets from HTML forms.
● Session Tracking.
6. Write programs in Java to create three-tier applications using JSP and Databases
● For conducting on-line examination.
● For displaying student mark list. Assume that student information is available in a database
which has been stored in a database server.
7. Programs using XML – Schema – XSLT/XSL.
TOTAL:60 PERIODS
TEXTBOOKS
1. Deitel and Deitel and Nieto, Internet and World Wide Web - How to Program, Prentice
Hall, 5th Edition, 2011.
2. Jeffrey C and Jackson, Web Technologies A Computer Science Perspective, Pearson
Education, 2011.
3. Angular 6 for Enterprise-Ready Web Applications, DoguhanUluca, 1st edition, Packt
Publishing
REFERENCES:
1. Stephen Wynkoop and John Burke “Running a Perfect Website”, QUE, 2nd Edition,1999.
2. Chris Bates, Web Programming – Building Intranet Applications, 3rd Edition, Wiley
Publications, 2009.
3. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of India, 2011.
4. UttamK.Roy, “Web Technologies”, Oxford University Press, 2011.
5. Angular: Up and Running: Learning Angular, Step by Step, ShyamSeshadri, 1st edition, O
′Reilly
CO’s-PO’s & PSO’s PO’s PSO’s
MAPPING CO’s
1 2 3 4 5 6 7