Department of Computer Science

Bachelor of Science in
Computer Science and Mathematics
Academic Year 2023-24

CHRIST (Deemed to be University) Bangalore

Hosur Main Road, Bengaluru, Karnataka 560029
Contents
I. Programme Details:............................................................................................................................. 2
II. Brief description about the Programme:......................................................................................... 2
III. Minimum Eligibility:........................................................................................................................ 2
IV. Programme Structure....................................................................................................................... 3
V. Summary of the Programme structure............................................................................................. 8
Programme Outcomes (PO)................................................................................................................... 9
I Semester............................................................................................................................................... 10
II Semester............................................................................................................................................. 18

2
 CHRIST (Deemed to be University)
SCHOOL OF SCIENCES

Bachelor of Science (Computer Science, Mathematics/Honours/Honours with Research)

Programme Structure 2023-24

I. Programme Details:
a. Name of the Programme: Bachelor of Science (Computer Science,
Mathematics/Honours/Honours with Research) (As updated in the spreadsheet mentioning
whether Honors / Honors with research is offered).
b. Previous programme title: Bachelor of Science in Computer Science and Mathematics, and
Electronics (BSc CME).

c. Offering Department: COMPUTER SCIENCE

d. Name of the School: SCHOOL OF SCIENCES

II. Brief description about the Programme:

The BSc (Computer Science, Mathematics) is a dual major graduate programme, to nurture the confidence
and skills of the students in Computer Science and Mathematics. It aims to impart sound fundamentals and
specialized aspects of computer science and mathematics. The curriculum includes various theoretical and
practical courses along with industry relevant software tools to prepare the young minds for the challenging
opportunities available in the IT industries and research organizations. Also, based on the latest NEP
guidelines, this programme offers a unique blend of flexible credit systems to support the individual
learning needs with a research bent.

III. Minimum Eligibility:

• Basic eligibility for the programme is a pass at the +2 level (Karnataka PUC / ISC / CBSE / NIOS /
State Boards) from any recognized Board in India.
• It is compulsory to have studied (Computer Science / Mathematics / Statistics) at Class XII level.
• Students pursuing International curriculum is according to AIU stipulations:
• Applicants pursuing IB curriculum must have 3 HL and 3 SL with 24 credits.
• Applicants pursuing GCE / Edexcel must have a minimum of 3 A levels, grade not less than C.
• Candidates writing their final year examinations in March-May are also eligible to apply.

Programme Outcomes:

PO1: Understand and apply the fundamental principles, concepts and methods in key areas of science and
multidisciplinary fields
PO2: Demonstrate problem solving, analytical and logical skills to provide solutions for the scientific
requirements
PO3: Develop the critical thinking with scientific temper
PO4: Communicate the subject effectively
PO5: Understand the importance and judicious use of technology for the sustainable growth of mankind in
synergy with nature.
PO6: Understand and apply fundamental principles, concepts and methods of mathematics.

3
PO7: Demonstrate problem solving skills using mathematical techniques.
PO8: Apply appropriate methods and tools for research and development in the chosen discipline.

IV. Programme Structure

Note: Kindly make suitable modifications to the below mentioned semester wise format as per the
proposed programme requirement.

BSC CM Semester - 01
Hours Per
Course Code Course Type Credits
Week
Digital Computer Fundamentals and C
CSC101-1 Major Core 6 (2+4) 4
Programming (CIA Only)
MAT101-1C Differential Calculus Major Core 5 4
PHY142-1C Analog and Digital Electronics Allied core 3 3
English AEC 2 2
Web Application Development (CIA
CSC161-1 SEC 3 3
Only)
Data analysis using Spreadsheet (CIA
CSC162-1 SEC 3 3
Only)
Holistic Education Development (HED) VAC 1 1
Environmental Science (EVS) VAC 1 1
26 21

BSC CM Semester - 02
Hours Per
Course Code Course Type Credits
Week
CSC102-2 Data Structures (CIA Only) Major Core 5 4
CSC103-2 Operating systems (CIA Only) Major Core 4 4
MAT101-2C Introductory Algebra Major Core 3 3
MAT102-2C Differential Equations Major Core 5 4
Major Core
MAT111-2C Calculus using Python 2 1
(Practical)
PHY142-2C Microcontroller and Embedded Systems Allied core 3 3
English AEC 3 2
Holistic Education Development (HED) VAC 1 1

4
 Indian Constitution (IC) VAC 1 1
27 23

BSC CM Semester - 03 (Tentative)

Hours Per
Course Code Course Type Credits
Week
CSC201-3C Java Programming Major Core 5 4
MAT201-3C Real Analysis Major Core 5 4
Multidisciplinary Course MDC 3 3
Modern Indian Languages (MIL) AEC 3 2
CSC262-3C Data Analysis using Python SEC 4 3
Holistic Education Development (HED) VAC 1 1
Summer Internship Internship 4 4
25 21

BSC CM Semester - 04 (Tentative)

Hours Per
Course Code Course Type Credits
Week
Database Management System and
CSC202-4C Major Core 5 4
Software Engineering
CSC203-4C Mobile Application Major Core 5 4
MAT301-4C Abstract Algebra Major Core 5 4
MAT302-4C Numerical Methods Major Core 3 3
Major Core
MAT311-4C Mathematics Lab using Python-II 2 1
(Practical)
Modern Indian Languages (MIL) AEC 3 2
Holistic Education Development (HED) VAC 1 1
24 19

BSC CM Semester - 05 (Tentative)

Hours Per
Course Code Course Type Credits
Week
CSC301-5C Design and Analysis of Algorithms Major Core 4 4
CSC302-5C Computer Networks Major Core 5 4
CSC381-5C Computer Science Project – I Dissertation 8 4
MAT401-5 Linear Algebra Major Core 5 4

5
MAT402A-5 Discrete Mathematics Major Core 5 4
MAT403B-5 Calculus of Several Variables Major Core 5 4
32 24

BSC CM Semester - 06 (Tentative)

Hours Per
Course Code Course Type Credits
Week
CSC304-6C Artificial Intelligence Major Core 5 4
CSC305-6C Cloud Computing Major Core 5 4
CSC382-6C Computer Science Project – II Dissertation 8 4
MAT401-6C Complex Analysis Major Core 3 3
MAT402A-6C Advanced Numerical Methods
Major Core
MAT402B-6C Number Theory 5 4
(Electives)
MAT402C-6C Operations Research
MAT403A-6C Computational Linear Algebra
Major Core
MAT403B-6C Financial Mathematics 5 4
(Electives)
MAT403C-6C Mathematical Modeling
Major Core
MAT411-6C Mathematics Lab using Python-III 2 1
(Practical)
33 24
Fourth Year
BSC Computer Science Honours : Semester - 07
Hours Per
Course Code Course Type Credits
Week
CSC401-7C Data mining and data warehouse Major Core 5 4
CSC402-7C Research Methodology Major Core 5 4
CSC403-7C Machine Learning Major Core 5 4
CSC404-7C Internet of Things Major Core 5 4
CSC481-7C Specialization Project – I Dissertation 8 6
28 22

BSC Computer Science Honours : Semester - 08

Hours Per
Course Code Course Type Credits
Week
CSC405-8C Neural Networks and Deep Learning Major Core 5 4
CSC406-8C Computer Vision Major Core 5 4

6
 User Interface and Experience Design
CSC407-8C Major Core 5 4
(UI/UX)
CSC408-8C Data Analytics Major Core 5 4
Research /
CSC482-8C Specialization Project – II 8 6
Dissertation
28 22

BSC Computer Science - Honours with Research (Tentative)

BSC Computer Honours with Research : Semester - 07
Hours Per
Course Code Course Type Credits
Week
CSC401-7C Data Mining and Data warehouse Major Core 5 4
CSC403-7C Machine Learning Major Core 5 4
CSC411-7C Research Methodology Major Core 5 4
CSC412-7C Research – Problem Identification Major Core 5 4
RESEARCH PROJECT 01 Research /
CSC483-7C 8 6
Research – Data collection Dissertation
Total 28 22

BSC Computer Science Honours with Research : Semester - 08

Hours Per
Course Code Course Type Credits
Week
CSC408-8C Data Analytics Major Core 5 4
CSC405-8C Neural Networks and Deep Learning Major Core 5 4
CSC415-8C Research : Computational Modeling Major Core 5 4
CSC416-8C Research : Implementation Major Core 5 4
Research /
CSC484-8C RESEARCH PROJECT 02 8 6
Dissertation
Total 28 22

BSC Mathematics - Honours

BSc Mathematics Honours : Semester - 07
Hours Per
Course Code Course Type Credits
Week
MAT501-7 Real Analysis (-II) Major Core 5 4
MAT502-7 Abstract Algebra(-II) Major Core 5 4

7
 MAT503-7 Ordinary Differential Equations Major Core 5 4
MAT504-7 Linear Algebra(-II) Major Core 5 4
MAT505-7 Discrete Mathematics Major Core 5 4
Research Methodology and Python
MAT506-7 Major Core 5 4
Programming in Mathematics
Total 30 24

BSc Mathematics Honours : Semester - 08

Hours Per
Course Code Course Type Credits
Week
MAT501-8 General Topology Major Core 5 4
MAT502-8 Complex Analysis(-II) Major Core 5 4
MAT503-8 Partial Differential Equations Major Core 5 4
MAT504-8 Graph Theory Major Core 5 4
MAT508-8 Introduction to Fluid Mechanics Major Core 5 4
Total 25 20

BSC Mathematics - Honours with Research

BSC Mathematics Honours with Research : Semester - 07
Hours Per
Course Code Course Type Credits
Week
MAT501-7 Real Analysis (-II) Major Core 5 4
MAT502-7 Abstract Algebra(-II) Major Core 5 4
Ordinary and Partial Differential
MAT507-7 Major Core 5 4
Equations
MAT508A-7 Introduction to Fluid Mechanics
Major Core
MAT508B-7 Graph Theory 5 4
(Electives)
MAT508C-7 Principles of Data Science
Research Methodology and Python
MAT506-7 Major Core 5 4
Programming in Mathematics
Research
MAT581-8 Project / Dissertation 6 6
Project
Total 31 26

BSC Mathematics Honours with Research : Semester - 08

8
 Hours Per
Course Code Course Type Credits
Week
MAT501-8 General Topology Major Core 5 4
MAT502-8 Complex Analysis(-II) Major Core 5 4
MAT506A-8 Computational Fluid Mechanics
Major Core
MAT506B-8 Algebraic Graph Theory 5 4
(Electives)
MAT506C-8 Regression Analysis
MAT507A-8 Mathematical Modeling
Major Core
MAT507B-8 Applied Graph Theory 5 4
(Electives)
MAT507C-8 Design and Analysis of Algorithms
Research
MAT581-8 Project / Dissertation 6 6
Project
Total 26 22

V. Summary of the programme structure

Category of Course as per UGC Minimum Credit requirement

3 Year UG 4 Year UG

Major (Core) 96 96+32

Minor 6 6

Multidisciplinary 9 9

Ability Enhancement Course (AEC) 8 8

Skill Enhancement Courses (SEC) 9 9

Value Added Courses common for all UG 6 6

Summer Internship 4 4

Research Project / Dissertation 12

Total 135 179

9
 Minimum Credits to Graduate

Levels Minimum Credits

UG Certificate 43

UG Diploma 84

3-year UG Degree 132

4-year UG Degree (Honours) 172

4-year UG Degree (Honours with Research) 176

Programme Outcomes (PO)

PO1: Understand and apply the fundamental principles, concepts and methods in key areas of
science and multidisciplinary fields
PO2: Demonstrate problem solving, analytical and logical skills to provide solutions for the
scientific requirements
PO3: Develop the critical thinking with scientific temper
PO4: Communicate the subject effectively
PO5: Understand the importance and judicious use of technology for the sustainable growth of
mankind in synergy with nature
PO6: Understand the professional, ethical and social responsibilities
PO7: Enhance the research culture and uphold the scientific integrity and objectivity
PO8: Engage in continuous reflective learning in the context of technological and scientific
advancements

10
 I Semester

CSM101-1 - Digital Computer Fundamentals and C Programming

Total Teaching Hours for Semester: 90 Max Marks: 100

Credits: 04

Course Objectives
The course provides the fundamentals of C programming, number systems, Boolean algebra
and logic gates. The C programming helps the students to solve problems through logical
thinking and basic digital logic helps the students to understand the concepts of number
systems and Boolean algebra.

Course Learning Outcomes

CO1: Understand the fundamentals of structured programming, number systems, Boolean algebra.
CO2: Learn to implement the concepts of arrays, functions and pointers.
CO3: Learn to implement the concepts of recursion and structures
CO4: To create programs with ethical coding standards.

Unit -1
Teaching Hours: 12
Introduction to Computers & Number systems
Different number systems and their conversions (Decimal, Binary, Octal and Hexadecimal) Binary
arithmetic - Addition, subtraction, multiplication and division of binary numbers, 1’s and 2’s complement,
Coding – BCD, Gray and ASCII. Boolean Algebra -Boolean operations and expressions, Laws and rules of
Boolean algebra, DE Morgan’s Theorem, Boolean expressions, Simplification of Boolean expression.

Unit-2
Teaching Hours: 18
Introduction to C and Control Structure
Data type Declaration. The Decision Control Structure - The if - if-else- Nested if-else statements.
Decisions Using switch - The Loop Control Structure While Loop - for Loop - break Statement - continue
Statement- do-while Loop.
Lab Exercises: -
Program to implement conditional statements.
Program to implement the concepts of while loop, for and do while loops.
Program to implement the switch and nested switch statements

Unit-3
Teaching Hours: 20
Arrays
A Simple Program Using Array - Array Initialization - Two Dimensional Arrays- Initializing a
2-Dimensional Array - Memory Map of a 2-Dimensional Array – Strings - Standard Library String

11
Functions - strlen( ) - strcpy( ) - strcat() - strcmp() - Two-Dimensional Array of Characters.
Lab Exercises: -
Program to implement 1D array concept and 2D array concepts
program to implement multidimensional array
Program based on string concepts.

Unit-4
Teaching Hours: 20
Functions & Pointers
Function - Passing Values between Functions - Scope Rule of Functions - Calling Convention - Return
Type of Function - Call by Value and Call by Reference - An Introduction to Pointers - Pointer Notation –
Recursion.
Lab Exercises: -
Program to implement functions.
Program demonstrating recursion functions.
Program to implement pointer expression

Unit-5
Teaching Hours: 20
Macros and Structures
Introduction to macros, Structures - Declaring a Structure - Accessing Structure Elements - Storing
structure elements and Unions.
Lab Exercises: -
Program to demonstrate call by value and call by reference.
Program to demonstrate structures and union.
Program to implement nested structures

Essential Reading
[1] Yashavant P. Kanetkar, Let Us C, 15th Edition, BPB Publications, 2012.

Recommended Reading
Byron Gottfried and Jitender Chhabra, Programming with C, 3rd Ed, Tata McGrawHill, 2010.
Balagurusamy E, Programming in ANSI C, 4th Edition, Tata-McGraw-Hill, 2007.
Deitel H M and Deitel P J, C - How to Program, 7th Edition, Prentice-Hall, 2012.
Susant K Rout, Cimple,C, Tata-McGraw-Hill Publishing Company Ltd., 2016.

Web Resources:
www.w3cschools.com
https://archive.ics.uci.edu
www.programiz.com

CO – PO Mapping

(please take up the strength mapping here, map your COs to POs at -, 1, 2, and 3)

12
 PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8
CO1 3 3 3 2 1 1 2 1
CO2 3 3 3 2 1 2 1 2
CO3 3 3 3 1 1 2 1 2
CO4 2 3 3 2 2 3 2 2

BCM 132 – WEB APPLICATION DEVELOPMENT

Total Teaching Hours for Semester: 45

Max Marks: 100 Credits: 03

Course Objectives

This course is designed to introduce the students to web technologies in Hyper Text Mark-up
Language, Cascade Style Sheet, JavaScript and XML for interactive web applications that use rich
user interfaces and also understand the server-side web technologies for creating dynamic web
applications. Students will learn the concepts of web site planning and hosting. This course will
help them to create an interactive website with great look and functionality.
Course Outcomes

CO1: Understand the World Wide Web and associated technologies.

CO2: Apply web development techniques for designing web pages.
CO3: Design an interactive website with web tools and scripting methods

Unit 1 Teaching Hours:09

Web Programming Introduction
Internet and web Technologies- Client/Server model -Web Search Engine-Web Services - Features
of Web 3.0 - HTML5- HTML Basic Tags - Attributes - Formatting - Comments - Images - Tables -
Lists - Text Links - Image links - Frames - Backgrounds - HTML Color codes / schemes - HTML
Forms
Lab Exercise:

1. HTML Program to Demonstrate basic web page with Headings, Paragraphs various
formatting options and background / text color code
2. HTML Program to Demonstrate Tables - Lists - Frames and HTML Forms

Unit 2 Teaching Hours:09

CSS – Introduction

13
Cascading style sheet –Benefits –CSS version History-Syntax-External-internal-inline-single
style-multiple style-value lengths and percentage-ID selector –Class Selector-group Selector –
universal selector- Color-background-cursor-list-Box model-display positioning-floats;
CSS - Backgrounds - Fonts - Text - Images - Links - Tables - Borders - Margin - Lists.

Lab Exercise:

3. Web Page to Demonstrate to Implement Various Types of CSS

4. Web Page to Demonstrate a web page for your curriculum vitae using CSS

Unit 3 Teaching Hours:09

JavaScript – Fundamentals
Java Script (JS Script)
Introduction to Java Script (Jscript) – Installation – Syntax – Variables – Operators – If else –
Switch case – Loop controls: for loop, do while loop; Functions – Events – Cookies – Page
redirect – JavaScript Objects: Arrays, Date HTML DOM;

Lab Exercises:
5. Program to demonstrate Jscript variables and operators
6. Program to demonstrate loop controls – decision controls and functions

Unit 4 Teaching Hours:09

Hypertext PreProcessor (PHP)
PHP Introduction – Installation version information – Environment setup – Variable types –
Constants – Operator Types – Decision Making – Loop controls : for, do while ; Arrays – Strings –
Web concepts – GET and POST methods – Functions – Cookies

Lab Exercises:
7. Program to demonstrate PHP variable types – operators Decision and loop controls
8. Program to demonstrate GET and POST methods

Unit 5 Teaching Hours:09

Database Connection with MySQL

Introduction to MySQL, Installation version information – Connecting to MySQL database –

Create a database – Delete a database – Insert data into MySQL Database : tables – Retrieve
database from the database: tables – Updating data into the existing tables – Deleting data from the
existing MySQL tables;

Lab Exercises:

14
 9. Program to demonstrate MySQL Database and Table creation and Insertion of data
10. Program to demonstrate Updating data into the existing tables

Essential Reading
[1] Internet and World Wide Web: How to Program, Paul Deitel , Harvey Deitel & Abbey Deitel,
Pearson Education, 5th Edition, 2018.
[2] HTML 5 Black Book (Covers CSS3, JavaScript, XML, XHTML, AJAX, PHP, jQuery), DT
Editorial Services, Dreamtech Press, 2nd Edition, 2016
[3] Jeremy McPeak and Paul Wilton, “Beginning JavaScript”, Wrox publication,

Recommended Reading
[1]. Faithe Wempen, Microsoft,” Start Here! Learn HTML5" , 2012
[2] David McFarland, O’REILLY , “CSS 3 Missing Manual”, 2nd edition , 2014
CO – PO Mapping

(please take up the strength mapping here, map your COs to POs at -, 1, 2, and 3)

PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO1 1 3 2 1 1 1 1
CO2 3 1 1 2 3 2 1
CO3 2 1 1 3 2 1 3

15
 BCM133 – DATA ANALYSIS USING SPREADSHEET

Total Teaching Hours for Semester: 45

Max Marks: 50 Credits: 2

Course Objectives
This course will provide students with hands-on experience and skills with a spreadsheet. Students
will learn the various functions and commands of the spreadsheet as well as how to plan, create,
and program spreadsheets for common business applications. It is appropriate for accounting and
business majors, programmers and spreadsheet application developers.

Course Outcomes
CO1: To use and leverage on the functionalities of spreadsheet
CO2: To familiarize the students with process and techniques of data analysis with the use of
spreadsheet
CO3: To enable students to apply and take logical decisions

Unit-1 Teaching Hours: 8

BASICS OF EXCEL
Exploring Data Types - Number Formatting - Working with Rows and Columns - Cells and
Ranges - Working with Tables - Sorting and filtering a table - Applying a theme - Using
AutoRecover - Password-Protection - Exploring Excel Templates
Lab Exercises:
1. Simple arithmetic
2. Text functions, Date and Time functions

Unit-2 Teaching Hours: 8

FORMULAS AND FUNCTIONS
Using operators in formulas - Using functions in formulas - Using Formulas in Tables - Text
Functions - Advanced Text Formulas - Date-Related Worksheet Functions - Time-Related
Worksheet Functions - Working with Single-Cell Array Formulas
Lab Exercises:
0. Logical operations
0. Decision making conditional statements

Unit-3 Teaching Hours: 9

VISUALIZATION
Creating and Customizing a Chart - Choosing a chart type - Experimenting with different styles -
Experimenting with different layouts - Line charts - Pie charts - XY (scatter) charts - Bubble charts
- Radar charts - Histogram charts - Pareto charts - Waterfall charts - Box & whisker charts -
Treemap charts

16
 Lab Exercises:
0. Look up functions
0. Working with arrays

Unit-4 Teaching Hours: 10

ANALYSING DATA WITH EXCEL
Importing Data - Data Cleanup Techniques - Exporting Data - Creating a Pivot Table
Automatically Creating a Pivot Table - Manually Working with Nonnumeric Data - Creating Pivot
Charts - Types of What-If Analyses - Data Sources for Get & Transform
Lab Exercises:
0. Exploring different types of charts
0. Working with Pivot table

Unit-5 Teaching Hours: 10

PROGRAMMING EXCEL WITH VBA
Introducing VBA Macros - Creating VBA Macros - Recording VBA macros - Examining the
macro - Testing the macro - Editing the macro - Writing VBA code - How VBA works - Objects
and collections - Properties - Methods - Variables
Lab Exercises:
0. Data analysis for a use case
0. Creation of VBA Macro

Text Book
1. Excel 2016 Bible, John Walkenbac, Wiley, 1st Edition, 2015.

Recommended Reading

1. Excel 2019 All-in-One for Dummies, Greg Harvey, For Dummies, 1st edition, 2018.
2. Slaying Excel Dragons, Mike Girvin, Holy Macro! Books, 1st edition, 2016.

Web Resources:
1. https://www.pdfdrive.com/excel-2019-bible-e184084426.html
2. https://web.spcollege.edu/instructors/uploads/481c6941b2/CGS1515_Syllabus_Section_01
65.pdf
3. https://www.srcc.edu/sites/default/files/SEC_26922.pdf

CO – PO Mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8

CO1 3 3 - 3 1 2 - -
CO2 3 3 2 2 2 2 - 1
CO3 2 3 3 3 2 2 1 1

17
 II Semester
BCM231 - Data Structures

Total Teaching Hours for Semester: 75

Max Marks: 100 Credits: 4

Course Objectives
The course is designed to develop skills to design and analyze simple linear and nonlinear data
structures. It strengthens the ability to identify and apply the suitable data structure for the given
real-world problem. It enables students to gain knowledge in practical applications of data
structures.

Course Learning Outcome

CO1: To understand fundamentals of data structures and their applications essential for
programming and problem solving.
CO2: To demonstrate linear representation of data structures: Stack, Queues, Lists, Trees and
Graphs.
CO3: To demonstrate sorting and searching algorithms
CO4: To analyze and decide suitable data structure during application development and
Problem Solving.

Unit-1 Teaching Hours: 9+6

ARRAYS
Introduction to data structures- Abstract Data Type - Arrays – Introduction -Array Operations,
Linear Search - Iterative Binary Search – Recursions - Recursive Binary Search.
Lab Exercises:
1. Menu driven program for Inserting, deleting an element into one dimensional array
2. Menu driven program to implement linear search (sentinel) and binary search

Unit-2 Teaching Hours: 9+6

Linked List
Introduction: Pointers - Using Dynamically Allocated Storage - Singly Linked Lists - Polynomials,
Representing Polynomials as Singly Linked Lists - Circularly Linked Lists - Doubly Linked Lists.
Lab Exercises:
1. Menu driven program to implement singly linked list insertion.
2. Menu driven program to implement singly linked list deletion.

Unit-3 Teaching Hours: 9+6

Stack & Queue
Introduction: Stack Operations using arrays and linked lists - Infix to Prefix - Queue
Operations using array and linked list.

18
Applications: Evaluation of Expressions, Evaluating Postfix Expressions, Infix to Postfix.
Lab Exercises:
1. Menu driven program to implement stack operations using an array and linked list
2. Menu driven program to implement queue operations using an array and linked list

Unit-4 Teaching Hours: 9+6

Trees
Introduction - Binary Trees- Properties of Binary Trees - Binary Tree Representations - Binary
Tree Traversals.
Binary Search Trees: Introduction - Searching a Binary Search Tree - Inserting, Deleting an
Element - Limitations of Binary Search Tree.
Lab Exercises:
1. Menu driven program for Binary Tree creation and Traversals

Unit-5 Teaching Hours: 9+6

Sorting techniques and Graphs
Sorting: Bubble Sort – Selection Sort – Insertion Sort – Quick Sort.
Graphs: Introduction – Definitions and terminology – Graph representations – Depth First Search
– Breadth First Search
Lab Exercises:
1. Menu driven program to implement bubble sort and Selection sort.
2. Menu driven program to implement Insertion sort
3. Menu driven program to implement Quick sort.

Essential Reading
[1] Yashwant Kanetkar, Data Structures through C, BPB Publication, 2 edition, reprint 2016.
nd

Recommended Reading
[1] Horowitz Sahni Anderson-Freed, Fundamental of Data Structures in C, Universities Press,
Reprint 2009.
[2] Seymour Lipschultz: Data Structures, Schaum series TMH, 2010.

Web Resources:
https://www.programiz.com/dsa
https://in.coursera.org/specializations/data-structures-algorithms

CO – PO Mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8

CO1 3 3 1 1 1 2 3 3
CO2 2 2 2 2 2 1 2 2
CO3 3 3 3 1 1 2 3 3
CO4 2 2 1 1 3 3 3 3

19
 BCM232 – OPERATING SYSTEMS

Total Teaching Hours for Semester: 75

Max Marks:100 Credits: 4

Course Objectives

The objective of this course is to provide a comprehensive knowledge of operating system

concepts, System structure, Process management, Deadlock, Memory management and File
system along with the practical exposure by using C – Programming language for the working
principles of operating system.

Course Outcomes

CO1: Understand the fundamental principles of operating system and system structure.
CO2: To evaluate the process scheduling, deadlock system and effective memory management.
CO3: To analyse the file structure, directory structure, allocation methods and system security.
CO4: Implement the Operating System concepts by using C – Programming.

Unit-1 Teaching Hours:9+6

INTRODUCTION
Introduction - What Operating Systems - Computer-System Organization - Computer-System
Architecture - Operating-System Operations - Resource Management - Security and Protection -
Virtualization - Distributed Systems - Kernel Data Structures - Computing Environments - Free
and Open -Source Operating Systems
OPERATING – SYSTEM STRUCTURES
Operating-System Services - User and Operating-System Interface - System Calls - System
Services - Linkers and Loaders - Why Applications Are Operating-System Specific -
Operating-System Design and Implementation - Operating-System Structure - Building and
Booting an Operating System - Operating-System Debugging

Lab Exercises:
1. Basic system calls.
2. Inter-process communication using pipes.

Unit-2 Teaching Hours: 9+6

PROCESS MANAGEMENT
Process Concept - Process Scheduling - Operations on Processes – Inter process Communication -
IPC in Shared-Memory Systems - IPC in Message-Passing Systems - Examples of IPC Systems -
Communication in Client – Server Systems

20
CPU SCHEDULING
Basic Concepts - Scheduling Criteria - Scheduling Algorithms - Thread Scheduling -
Multi-Processor Scheduling - Real-Time CPU Scheduling - Operating-System Examples -
Algorithm Evaluation
Lab Exercises:
3. First-Come, First-Served (FCFS) Scheduling
4. Shortest-Job-Next (SJN) Scheduling

Unit-3 Teaching Hours: 9+6

PROCESS SYNCHRONIZATION
Synchronization Tools: Background - The Critical-Section Problem - Peterson’s Solution -
Hardware Support for Synchronization - Mutex Locks – Semaphores
Deadlocks: System Model - Deadlock in Multithreaded Applications - Deadlock Characterization -
Methods for Handling Deadlocks - Deadlock Prevention - Deadlock Avoidance - Deadlock
Detection - Recovery from Deadlock
Lab Exercises:

5. Priority Scheduling
6. Shortest Remaining Time

Unit-4 Teaching Hours:9+6

MEMORY MANAGEMENT
Main memory: Background - Contiguous Memory Allocation - Paging - Structure of the Page
Table - Swapping
Virtual Memory: Background - Demand Paging - Copy-on-Write - Page Replacement - Allocation
of Frames – Thrashing - Memory Compression
Lab Exercises:
7. Round Robin(RR) Scheduling
8. Critical Section problem – Process synchronization

Unit-5 Teaching Hours: 9+6

FILE SYSTEM AND SECURITY
File-System Interface: File Concept - Access Methods - Directory Structure
File-System Implementation: File-System Structure - File-System Operations - Directory
Implementation - Allocation Methods - Free-Space Management - Efficiency and Performance
Security: The Security Problem - Program Threats - System and Network Threats Cryptography as
a Security Tool - User Authentication

9. Memory Management
10. File system
Text Books and Reference Books

Essential Reading

21
 1. Operating System Concepts, Silberschatz, P.B. Galvin and G. Gagne, Wiley India, New
Delhi, 10th Edition, 2018.
Recommended Reading
1. Operating system Internals and Design Principles, William Stallings, Prentice Hall, 7th
Edition, 2017.
2. Modern Operating Systems, Andrew S. Tanenbaum and Herbert Bos, Pearson Education,
4th Edition, 2014.
3. Operating Systems, H.M. Deitel, P. J. Deitel, D. R. Choffnes, Pearson Education,
3rd Edition, 2007
CO – PO Mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO PO

7 8
CO1 3 2 2 2 1 1 1 1
CO2 2 2 1 1 1 1 1 1
CO3 1 2 2 3 3 1 3 1
CO4 1 1 2 2 3 3 2 2

22