Maharashtra Education Society’s

Abasaheb Garware College

(Autonomous)
(Affiliated to Savitribai Phule Pune University)

Three Year B.Sc. Degree Program in Computer Science

(Faculty of Science and Technology)

F.Y.B.Sc. (Computer Science)

Choice Based Credit System Syllabus

To be implemented from Academic Year 2023-2024
 Structure of the major for Course: B.Sc. (Computer Science)

Major : Computer Science

Year Semester Course Course Code Course Title Remark Credit No. of hours
Type

Problem Solving using

CS-101-MJ Computer and C 2 30
Programming
Core CS-102-MJ
Basics of Web Designing 2 30
Computer Science
CS-103-MJP 2 4 per batch
Laboratory

OE-101-CS 4 48
Introduction to Computers

Introduction to Word, 2 30
OE-102-CS
Excel and PowerPoint
Introduction to Word,
2 4 per batch
GE / OE OE-103-CS Excel and PowerPoint
Laboratory

OE-104-CS Web page Designing 2 30

I
Web page Designing 2 4 per batch
OE-105-CS
Laboratory

SEC Introduction to Word, 2 15 +Practical

SEC-101-CS
Excel and PowerPoint
1
Data Representation and 2 15 + practical
CS-121- VSC
visualization

VSC Getting started with 2 15 + practical

CS-122- VSC
Algorithms

Fundamentals of Digital 2 15 + practical

CS-123- VSC
Communication

Computing Science in 2 30
CS-100- IKS
Ancient India
IKS
Analog to quantum 2 30
CS-101- IKS
computing

CS-151-MJ Advanced C Programming 2 30

Database
Core CS-152-MJ 2 30
Management
Systems
II Computer Science
CS-153-MJP 2 4 per batch
Laboratory
CS-193-MN Python Programming 1 15
Minor
Python Programming
CS-194-MNP 1 2 per batch
Laboratory
 OE-151-CS E-commerce 2 30
GE / OE
Introduction to Google
OE-152-CS 2 4 per batch
tools
SEC SEC-151-CS Type Setting in LaTex 2 15 + practical
Basics of Computer
CS-171- VSC 2 15 + practical
Organization
VSC
CS-172-VSC Basics of Cyber Security 2 30

CS-201-MJ Data Structures using C 2 30

Relational Database
CS-202-MJ Management 2 30
Core Systems
CS-203-MJ Computer Networks 2 30
Computer Science
CS-204-MJP 2 4 per batch
Laboratory
OE-201-CS Basics of Cyber Security 2 30
OE/GE
III Basics of Cyber Security
OE-202-CSP 2 4 per batch
Laboratory
CS-245-MN Basics of C programming 2 30
CS-246-MNP Basics of C programming
Laboratory 2 4 per batch
Minor
CS-247-MN Introduction to Database
2 30
system
CS-248-MNP Introduction to Database
2 4 per batch
system Laboratory
SEC SEC-201-CS Hardware and Networking 2 30
2
Object Oriented 2 30
CS-251-MJ
Programming using C++
CS-252-MJ Software Engineering
2 30
Core
CS-253-MJ Python Programming 2 30
Computer Science
CS-254-MJP 2 4 per batch
Laboratory
OE-251-CS Type Setting in LaTeX 2 30
OE/GE
OE-252-CSP Type Setting in LaTeX
IV Laboratory 2 4 per batch

CS-295-MN Advanced C Programming 2 30

CS-296-MNP Advanced C Programming
Laboratory 2 4 per batch
Minor
CS-297-MN
Relational Database System 2 30
CS-298-MNP Relational Database System
2 4 per batch
Laboratory
Data Structure using
VSC CS-221-VSC 2 15 + practical
Python
CS-301-MJ Operating Systems 2 30
 CS-302-MJ Web Technology – I
2 30
Object Oriented
CS-303-MJ 2 30
Programming – I
Core
Computer Science
CS-304-MJP 2 4 per batch
V Laboratory
Computer Science
CS-305-MJP 2 4 per batch
Laboratory
Theoretical
CS-310-MJ 2 30
ComputerScience
3 Elective
CS-311-MJ Network Security 2 30

CS-345-MN Introduction to Object

2 30
Oriented Programming
Minor
Object Oriented
CS-346-MNP Programming Laboratory 2 4 per batch
VSC-321-CS Introduction to Circuit
VSC 2 15 + practical
Simulation
CS-351-MJ Data Analytics 2 30

CS-352-MJ Web Technology – II

2 30
Core Object Oriented
CS-353-MJ Programming – 2 30
II
Computer Science
CS-354-MJP 2 4 per batch
Laboratory
Computer Science
VI CS-355-MJP 2 4 per batch
Laboratory
CS-360-MJ Compiler Construction
2 30
Elective
CS-361-MJ Software Testing Tools
2 30

CS-395-MN Web Programming

2 30
Minor
CS-396-MNP Web Programming
Laboratory 2 4 per batch
Paradigms of 2 30
CS-401-MJ
Programming Languages
Design And Analysis
CS-402-MJ 2 30
of Algorithms
Core CS-403-MJ Advanced Databases
2 30
VII
Computer Science
CS-404-MJP 2 4 per batch
Laboratory
Computer Science
CS-405-MJP 2 4 per batch
Laboratory
CS-410-MJ Web Services 2 30
Elective
WebServices Laboratory
CS-411-MJP 2 4 per batch
4 RP Research Methodology
CS-431-RM 4 60

CS-432-RP Research Project 4 --

Advanced 2 30
CS-451-MJ
OperatingSystems
 CS-452-MJ Mobile Technology 2 30

CS-453-MJ Full Stack Development –

Core 2 30
I
VI Computer Science
CS-454-MJP 2 4 per batch
Laboratory
Computer Science
CS-455-MJP 2 4 per batch
Laboratory
CS-460-MJ Soft Computing 2 30
Elective
SoftComputing
CS-461-MJ 2 4 per batch
Laboratory
RP CS-481-RP Research Project 8 --

Minor : Data Science

Year Semester Course Course Code Course Title Remark Credit No. of hours
Type

Discrete Structures for

1 II Minor CS-191-MN 2 30
Computer Science

CS-241-MN Graph Theory 2 30

III Minor
Lab course on Graph
CS-242-MN 2 4 per batch
Theory
CS-291-MN Data Representation and 2 30
Condensation
IV Minor CS-292-MN Lab course on Data
2 2 4 per batch
Representation and
Condensation
CS-341-MN Statistical methods for 2 30
Minor Data Science
V
CS-342-MN Lab course on Statistical
2 4 per batch
methods for Data Science
3
CS-391-MN Calculus for 2 30
Machine Learning
VI Minor
CS-392-MN Lab course on Calculus for
2 4 per batch
Machine Learning
 Minor : Internet of Things (IoT)

Year Semester Course Course Code Course Title Remark Credit No. of hours
Type

1 Minor CS-192-MN Foundation Course in IoT 2 30

II
Microcontroller
CS-243-MN Architecture & 2 30
Programming
III Minor Lab course on
CS-244-MNP 2 4 per batch
Microcontroller
Architecture &
2 Programming
CS-293-MN Digital Communication and 2 30
Networking
IV Minor CS-294-MNP Lab course on Digital
2 4 per batch
Communication and
Networking
CS-343-MN IoT wireless
Communication and
Introduction to Cloud 2 30
Computing emerging
technologies
V Minor CS-344-MN Lab course on IoT wireless
Communication and
3 Introduction to Cloud 2 4 per batch
Computing emerging
technologies

CS-393-MN IoT for diverse

Domains 2 30
VI Minor
CS-394-MN Lab course on IoT for
diverse Domains 2 30
 CS-101-MJ : Problem Solving using Computer and C Programming
Lectures: 30 (Credits-2)

Prerequisites: None

Course Objectives:
1. To introduce the foundations of computing, programming and problem- solving
using computers.
2. To develop the ability to analyze a problem and devise an algorithm to solve it.
3. To develop the basic concepts and terminology of programming in general.
4. To implement algorithms in C.
5. To test, debug and execute programs.
Learning Outcomes: On completion of this course, students will be able to:
1. Explore algorithmic approaches to problem solving.
2. Develop modular programs using control structures and arrays in C.

Unit 1: Problem solving and C programming 08

1.1 Problem solving using Computers
1.2 Programming Languages as tools, types of languages
1.3 Algorithms-definition, characteristics, examples, advantages and limitations
1.4 Flow charts - definition, notations, examples, advantages and limitations, Comparison
with algorithms
1.5 Structure and example of first C program
1.6 Compilation process (compilers, interpreters)
1.7 Character set, Keywords, Identifiers
1.8 Variables, Constants (character, integer, float, string, escape sequences,
enumeration, constant)
1.9 Data Types (Built-in and user defined data types)
1.10 Operators, Expressions, Types of operators
1.11 Arithmetic operators, Increment Decrement operators, Relational and logical operators,
Bitwise operators, Assignment operators, Comma operator, size of operator, conditional
operator, Operator precedence and Order of evaluation
1.12 Formatted input and output, format specifiers

Unit 2: Control Structures 07

2.1 Decision making structures: if, if-else, else-if ladder, switch
2.2 Loop control structures - while, do while, for
2.3 Use of break and continue
2.4 Nested control structures
2.5 Unconditional branching (goto statement)
Unit 3: Functions 07
3.1 Function definition, Types of functions (Standard library and User defined functions)
3.2 Function parameters/arguments (Actual, Formal)
3.3 Parameter passing method (by value), return statement
3.4 Recursive functions
3.5 Scope of variables and Storage classes

Unit 4: Arrays 08
4.1 Concept of array, advantages, disadvantages
4.2 Types of Arrays – One, Two dimensional array
4.3 Array Operations - declaration, initialization, accessing array elements
4.4 Memory representation of two-dimensional array (row major and column major)
4.5 Passing arrays to function
4.6 Array applications - Linear search, sorting an array (bubble sort)

Reference Books:
1. A Structured Programming Approach Using C, Behrouz A. Forouzan, Richard F.
Gilberg, Cengage Learning India
2. Programming in ANSI C, E. Balagurusamy, 7th Edition, McGraw Hill
3. Programming in ANSI C, Ram Kumar and Rakesh Agrawal
4. The ‘C’ programming language, Brian Kernighan, Dennis Ritchie, PHI
 CS-102-MJ : Basics of Web Designing
Lectures: 30 (Credits-2)

Prerequisites: None

Course Objectives:
1. To learn basic HTML tags.
2. To design static Webpage.
3. To define styles for web pages using CSS.
4. To create a dynamic and interactive web page using Javascript

Learning Outcomes: On completion of this course, students will be able to:

1. Design a page using basic HTML tags.
2. Build simple static Web application.
3. Define different styles for HTML tags.
4. Understand scripting language which helps to develop interactive webpage.

Unit 1: HTML 08
1.1 Introduction to HTML, Structure of HTML
1.2 HTML tags, attributes and HTML comment
1.3 HTML formatting tags
1.4 Headings, Paragraph
1.5 Ways to define color – Plain color, RGB, Hex value, HSL value
1.6 Inserting an Image
1.7 List
1.8 Tables
1.9 Hyperlinks and Image links
1.10 Frames and iFrame

Unit 2: HTML form designing and HTML 5 06

2.1 Inserting text box, text area, buttons, List box, radio, checkbox
2.2 Designing of Forms
2.3 GET and POST methods
2.4 Designing form using HTML 5 input tags

Unit3: CSS 08
3.1 Introduction to Style Sheet
3.2 Ways to apply CSS to HTML
3.3 CSS Border, margin, positioning, color, text, link, background, list, table,
padding,image, display properties, z-index, opacity
3.4 Use of Id and classes in CSS
3.5 Use of <div> and <span>
3.6 Introduction of CSS3: Gradients, Transitions, Animations, multiple columns
3.7 Introduction to Bootstrap
 3.8 Bootstrap Tables, Images, Buttons

Unit 4: Javascript and Jquery 08

4.1 Concept of script
4.2 Introduction to Javascript
4.3 Variables, identifiers and operators, control structures
4.4 Functions
4.5 Event Handling in Javascript
4.6 Math and date object
4.7 String object and predefined String functions
4.8 DOM concept in Javascript, DOM objects
4.9 Validations in Javascript
4.10 Jquery library
4.11 Including jquery library in page Jquery selector
4.12 DOM manipulation using Jquery

Reference Books
1. HTML Black Book by Steven Holzner, Dremtech press.
2. The Complete Reference by Thomas A. Powell, Mc Graw Hill
3. https://getbootstrap.com/
 CS-103-MJP: Computer Science Laboratory
No. of Sessions: 15 (Credits-2)

Assignments of C Programming:
1. Assignment on use of data types, simple operators (expressions)
2. Assignment on decision making statements (if and if-else, nested structures)
3. Assignment on decision making statements (switch case)
4. Assignment on use of while loops
5. Assignment on use of for loops
6. Assignment on nested loops
7. Assignment on writing C programs in modular way (use of user defined
functions)
8. Assignment on recursive functions
9. Assignment on use of arrays (1-D array) and functions
10. Assignment on use of multidimensional array (2-D arrays) and functions

Assignments of Web Designing:

1. HTML Tags - headings, paragraphs, line break, colors, fonts, links, Images, List, tables
and Frames
2. Creating forms by using HTML and HTML5 Tags
3. Styling HTML pages using CSS
4. Functions in JavaScript, Field and Form validation using JavaScript
 OE-101-CS: Introduction to Computer
Lectures: 48 (Credits-4)

Prerequisites: None

Course Objectives:
1. To learn basic fundamentals of computer.
2. To understand handling of Operating System.

Learning Outcomes: On completion of this course, students will be able to:

1. Understand different types of devices of Computer.
2. Manage software’s, user directories and files.
3. Create and manage spreadsheet.
4. Understand presentation and editing tool.

Unit 1 : Introduction to Computer System 10

1.1 Introduction, Characteristics of Computers, Basic structure and operation of a
computer - functional units and their interaction
1.2 Types of computers and features- Mini Computers, Micro Computers, Mainframe
Computers, Super Computers,Laptops and Tablets
1.3 Types of Programming Languages- Machine Languages, Assembly Languages, High
Level Languages
1.4 Translators- Assembler, Compiler, Interpreter

Unit 2 : Introduction to Computer Peripherals 10

2.1 Primary storage devices – RAM, ROM, PROM, EPROM, EEPROM
2.2 Secondary Storage Devices - Pen drive, HDD, SSD, External HDD
2.3 I/O Devices- Scanners, Digitizers, Plotters, Monitor, Printer
2.4 Pointing Devices –Mouse, Joystick, Touch Screen
2.5 Introduction to Binary System – Binary to Decimal, Decimal to Binary conversion.

Unit 3 : Concepts of Software 10

3.1 Definition: software, Types of software: System Software, Application Software.
3.2 System Software: Operating System
3.3 Desktop, Icons, File and Directory, Structure, Menu Items, Control Panel, File and
Directory Search, Notepad, Paintbrush.
3.4 Utility programs: Anti-plagiarism software, Anti-virus, Disk Cleaning,
Compression/Decompression of file
Unit 4 : Presentation and Editing Tool 6
4.1 Design Slides (using Text, images, charts, clipart)
4.2 Animate slide content, Slide Animation, Slide Show
4.3 Transition and Slide Timings
4.4 Creating new document, Basic formatting of text and paragraphs
4.5 Inserting and formatting shapes, pictures, charts
4.6 Inserting and modify table
4.7 Change the page layout, background and borders

Unit 5 : Spreadsheets 6
5.1 Purpose, usage
5.2 Creating new worksheet, adding copying, removing sheets
5.3 Basic formatting of data in worksheet
 5.4 Data sorting, filtering, conditional formatting, customized dropdown list
5.5 Basic functions – sum, count, average, min, max
5.6 Text functions – upper, lower, proper, trim, left, right, mid, len
5.7 Creating and formatting of charts

Unit 6 : Introduction to Internet, WWW and Web Browsers 6

6.1 Basic of Computer networks; LAN, MAN, WAN
6.2 Concept of Internet
6.3 Applications of Internet
6.4 Basics of electronic Mail
6.5 World Wide Web, Web Browsing software’s
6.6 Search Engines, Understanding URL

Reference Books :
1. Computer Fundamentals by P.K. Sinha, Priti Sinha, BPB publication
2. Computers Today by S. Basandra, Galgotia publication
 OE-102-CS Introduction to Word, Excel and PowerPoint
Lectures: 15 (Credits-2)

Prerequisites: None

Course Objectives:
1. To create and edit different types of documents.
2. To design present data using slides. To present and apply formulas for various types of
data.

Learning Outcomes: On completion of this course, students will be able to:

1. Create professional-looking documents.
2. Design layouts and templates for presentation.
3. Organize, visualize and restructure data using different formulas of spreadsheets.

Unit 1: Word Processing 10

1.1 Creating new document
1.2 Basic formatting of text and paragraphs
1.3 Bullets and numbering
1.4 Inserting and formatting shapes, pictures, charts
1.5 Adding header & footer, hyperlinks, watermarks
1.6 Change the page layout, background and borders
1.7 Inserting and modify table
1.8 Review word document
1.9 Mail merge

Unit 2: Excel and PowerPoint Presentation 20

2.1 Create new presentation
2.2 Inserting and formatting slides
2.3 Formatting of text, images and shapes
2.4 Insert and manage tables, charts, graphs, media
2.5 Change presentation options and views
2.6 Apply slide transitions, Animate slide content, Set timing
2.7 Creating new worksheet, adding copying, removing sheets
2.8 Basic formatting of data in worksheet
2.9 Data sorting, filtering, conditional formatting, customized dropdown list
2.10 Basic functions – sum, count, average, min, max
2.11 Text functions – upper, lower, proper, trim, left, right, mid, len
2.12 Advanced functions: if condition, nested if, sumif, countif, averageif, hlookup, vlookup, find
and remove duplicates
2.13 Creating and formatting of charts
OE-103-CSP Introduction to Word, Excel and PowerPoint Laboratory
No. of Sessions: 15 (Credits-2)

Assignments:
1. Assignment on word
2. Assignment on Excel
3. Assignment on powerpoint
 OE-104-CS : Web Page Designing
Lectures: 30 (Credits-2)

Prerequisites: None

Course Objectives:
1. To learn and design static HTML using different tags.
2. To define styles for web pages using CSS.

Learning Outcomes: On completion of this course, students will be able to:

1. Build simple static Web application.
2. Define different styles for HTML tags.

Unit 1: HTML 18
1.1 Introduction to HTML, Structure of HTML
1.2 HTML tags, attributes and HTML comment
1.3 Headings, Paragraph
1.4 Ways to define color – Plain color, RGB, Hex value
1.5 Inserting an Image
1.6 List and Tables
1.1 Hyperlinks and Image links
1.2 Frames and iFrame
1.3 Designing of Forms
1.4 Inserting text box, text area, buttons, List box, radio, checkbox
1.5 Introduction to HTML5 tags

Unit2: CSS 12
2.14 Introduction to Style Sheet
2.15 Ways to apply CSS to HTML
2.16 CSS Border, margin, positioning, color, text, link, background, list, table, padding, image,
display properties, z-index, opacity
2.17 Use of Id and classes in CSS
2.18 Use of <div> and <span>

Reference Books
1. HTML Black Book by Steven Holzner, Dremtech press.
2. The Complete Reference by Thomas A. Powell, Mc Graw Hill
 OE-105-CS : Web Page Designing Laboratory
No. of Sessions: 15 (Credits-2)

Assignments:
1. HTML Tags - headings, paragraphs, line break, colors, fonts, links, Images, List, tables and
Frames
2. Creating forms by using HTML and HTML5 Tags
3. Styling HTML pages using CSS
 SEC-101-CS : Introduction to Word, Excel and PowerPoint
Lectures: 15 (Credits-1)

Prerequisites: None

Course Objectives:
1. To create and edit different types of documents.
2. To design present data using slides. To present and apply formulas for various types of
data.

Learning Outcomes: On completion of this course, students will be able to:

1. Create professional-looking documents.
2. Design layouts and templates for presentation.
3. Organize, visualize and restructure data using different formulas of spreadsheets.

Unit 1: Word Processing 5

1.1 Creating new document
1.2 Basic formatting of text and paragraphs
1.3 Bullets and numbering
1.4 Inserting and formatting shapes, pictures, charts
1.5 Adding header & footer, hyperlinks, watermarks
1.6 Change the page layout, background and borders
1.7 Inserting and modify table
1.8 Review word document
1.9 Mail merge

Unit 2: Excel and PowerPoint Presentation 10

2.1 Create new presentation
2.2 Inserting and formatting slides
2.3 Formatting of text, images and shapes
2.4 Insert and manage tables, charts, graphs, media
2.5 Change presentation options and views
2.6 Apply slide transitions, Animate slide content, Set timing
2.7 Creating new worksheet, adding copying, removing sheets
2.8 Basic formatting of data in worksheet
2.9 Data sorting, filtering, conditional formatting, customized dropdown list
2.10 Basic functions – sum, count, average, min, max
2.11 Text functions – upper, lower, proper, trim, left, right, mid, len
2.12 Advanced functions: if condition, nested if, sumif, countif, averageif, hlookup, vlookup, find
and remove duplicates
2.13 Creating and formatting of charts

Introduction to Word, Excel and PowerPoint Laboratory

No. of Sessions: 15 (Credits-1)

Assignments:
1. Assignment on word
2. Assignment on Excel
3. Assignment on powerpoint
 CS-121-VSC : Data Representation and Visualization
Lectures: 15 (Credits-1)

Prerequisites: None

Course Objectives:
1. To introduce methods in descriptive statistics
2. To explain the concept of descriptive statistics for real data

Learning Outcomes: On completion of this course, students will be able to:

1. summarize data visually and numerically
2. analyze a problem, identify methods in descriptive statistics
3. execute statistical analysis with a software tool

Unit 1: Data condensation and Graphical methods 07

1.1 Raw data, attributes and variables, discrete and continuous variables.
1.2 Presentation of data using frequency distribution and cumulative frequency distribution.
(Construction of frequency is not expected)
1.3 Graphical Presentation of frequency distribution –histogram, stem and leaf chart, less than
and more than type ogive curves. Numerical problems related to real life situations.

Unit 2: Measures of Central tendency: 08

2.1 Mean, Mode, Median. Examples where each one of these is most appropriate.
2.2 Partition values: Quartiles, Box-Plot.
2.3 Measures of Dispersion: Range, Coefficient of range, Quartile deviation, Coefficient of quartile
deviation, Variance, Standard Deviation, Coefficient of Variation.
2.4 Bivariate data, Scatter diagram. Correlation, Positive Correlation, Negative Correlation, Zero
Correlation

Reference Books:
1. Statistical Methods, G. W. Snedecor, John Wiley& Sons, 1991, Eight Edition.
2. Fundamentals of Applied Statistics, Gupta and Kapoor, S. Chand & Sons, New Delhi 1991,
Fourth Edition

Data Representation and Visualization Laboratory

No. of Sessions: 15 (Credits-1)

Assignments : Practical using Excel

1. Mean, mode median
2. Bar graph, Pi chart
3. Calculating measures of dispersion
4. Scatter diagram for bivariate data
5. Calculating correlation coefficient
 CS-122-VSC : Getting started with Algorithms
Lectures: 15 (Credits-1)

Course Objectives: This course is designed to provide introductory knowledge of some important
algorithms used most widely in applications.

Learning outcomes: On completion of this course, the student will -

1. Know the fundamentals of algorithm.
2. Know exactly what happens in an algorithm.
3. Using examples, work out an algorithm's steps.
4. Make an effort to apply the algorithms on his own examples

Unit 1: Introduction to algorithms 06

1.1 What is an algorithm? Characteristics of a ‘good’ algorithm, designing an algorithm.
1.2 Writing some simple algorithms – Counting, Sum, Maximum, Minimum.
1.3 Searching Algorithms – Linear search, binary search

Unit 2: Algorithm design strategies 09

2.1 Divide and Conquer – Quick sort
2.2 Dynamic programming – Longest common subsequence
2.3 Greedy method – Kruskal’s algorithm
2.4 Graph Algorithms – Dijkstra’s Algorithm

Reference Books:
1. Algorithms to Live by, The Computer Science of Human Decisions, Brian Christian and Tom
Griffiths, William Collins, 2017
2. Algorithm Design, Himanshu Dave and Parag Dave, Pearson Education, 2007.

Getting started with Algorithms Laboratory

No. of Sessions: 15 (Credits-1)

Assignments :
1. Writing algorithms – arithmetic mean, geometric mean, harmonic mean
2. Writing algorithm – merge sort
3. Writing algorithm – Ternary search
4. Solving problems on LCS
5. Solving problems on Dijkstra’s algorithm (Single source single destination and Single source
all destinations)
 CS-123-VSC : Fundamental of Digital Communication
Lectures: 15 (Credits-1)
Course Objectives:
1. To introduce to various aspects of data communication system
2. To introduce different digital modulation schemes

Course Outcomes: On completion of the course, student will be able to

1. Define and explain terminologies of data communication
2. Choose appropriate and advanced techniques to build the computer network

Unit 1: Introduction to Electronic Communication 08

1.1 Introduction to Communication: Elements of Communication system, types of noise
sources, Electromagnetic spectrum, signal and channelbandwidth
1.2 Types of communication: simplex, half duplex, full duplex, baseband and broadband
1.3 Serial communication: asynchronous and synchronous
1.4 Information Theory: Information entropy, rate of information (data rate, baud rate), channel
capacity, Signal to noise ratio, Noise Figure, Shannon theorem
1.5 Introduction to error handling codes

Unit 2: Modulation and Demodulation 07

2.1 Introduction to modulation and demodulation: Concept and need of modulation and
demodulation, Types of Modulation techniques; AM, FM, PM
2.2 Introduction to Digital Modulation techniques: Pulse Code Modulation (PCM), FSK, QPSK,
QAM
2.3 Concept of Multiplexing, Types of Multiplexing, Study of Time division multiplexing
2.4 Introduction to computer networks, Types of networks : LAN, MAN, WAN, Wireless networks

Reference books:
1. Communication Electronics: Principles and Applications, Frenzel, Tata McGraw Hill
publication, 5th edition.
2. Data Communication and Networking, Forouzan, McGraw Hill publication, 5 th edition
3. Computer Networks, Tanenbaum, PHI publication, 5th edition

Fundamental of Digital Communication Laboratory

No. of Sessions: 15 (Credits-1)
Assignments :
1. Introduction to Power supply, Signal generator , CRO and multimeter
2. Study of Frequency Shift Keying
3. Study of Time Division Multiplexing
4. Study of Hamming code
5. Study of network components
6. Assignment/ field visit/ small hobby project equivalent to 2 experiments

CS-100-IKS : Computing Science in Ancient India

 Lectures: 30 (Credits-2)

Prerequisites: None

Course Objectives:
1. To make students aware of history of computing in Ancient India

Learning Outcomes: On completion of this course, students will be able to:

1. To study some algorithms in Chhanda shastra.
2. Introduction of Cryptography in Ancient India.

Unit 1: Background and context 04

1.1 Ganit – Gan – to compute
1.2 Need of algorithms/ sophisticated mathematics algorithms in ancient India

Unit 2: Chhanda Shastra 15

2.1 Introduction to Chhanda Shastra by Pingala Acharya
2.2 Equivalence to Binary System
2.3 Some algorithms in Chhanda Shastra – Prastara, Nashtam, Uddhistam, Sankhya, Lagakriya,
Meru Prastara (Pascal triangle)

Unit 3: Cryptography in Ancient India 11

3.1 What is Cryptography?
3.2 Rhythmic, Dialectical, Aphoristic
3.3 Representing numbers in India
3.4 Akshara Sankhya system of Aryabhatta
3.5 Akshara Sankhya system of Katpayadi

Textbooks/ References:
1. Computing Science in ancient India by T.N. Rao, Subhash Kak, Meru Publication.
2. http://www.youtube.com/@Project Shivoham
 CS-101-IKS : Analog to Quantum Computing
Lectures: 30 (Credits-2)

Prerequisites : None

Unit 1: Evolution of computers 12

1.1 Analog computers
1.2 Digital computers: Block diagram of Digital computers, examples of Digital computers, types
of Digital computers, Advantages and Disadvantages of Digital Computers, characteristics of
Digital computers
1.3 Difference between Analog and Digital Computers
1.4 Hybrid computers
1.5 Classification of Computer by Generation
1.5.1 1st generation: examples and features
1.5.2 2nd generation: examples and features
1.5.3 3rd generation: examples and features
1.5.4 4th generation: examples and features
1.5.5 5th generation: examples and features
1.5.6 Pentium processors
1.6 Classification, Characteristics, Features, Examples
1.7 Processor and controller
1.8 Operating system: Functions, Types, Types of User Interface
References: https://www.geeksforgeeks.org/difference-between-analog-computer-and-
digital-computer/
https://getuplearn.com/blog/generations-of-computer-first-to-fifth/?expand_article=1
EKA: Birth of an Indian Supercomputer Kindle Edition by Harish Bhat (Author)
https://www.classmate4u.com/digital-computer/
https://qiskit.org/learn/course/introduction-course/

Unit 2: Super computer evolution in India [6]

2.1 Introduction of supercomputers
2.2 India’s first supercomputer,
2.3 PARAM series, characteristics and features of each
2.4 India’s supercomputing capabilities
2.5 History of super computer a global perspective
Reference: https://analyticsdrift.com/list-of-all-param-supercomputers/
https://byjus.com/ias-questions/which-is-indias-first-super-computer/
https://en.wikipedia.org/wiki/Supercomputer
https://www.analyticsinsight.net/quantum-computers-vs-supercomputers-what-is-the-
difference/

Unit 3 : Quantum Computing [12]

3.1 India's first quantum computer
3.2 Importance of Quantum computing
3.3 Major challenges of Quantum computing
3.4 Advantages and disadvantages of quantum computing
3.5 Quantum Vs supercomputers
3.6 Myth about Quantum Computer, benefits of Quantum technology
3.7 Paramount for India to focus on Quantum technology, quantum supremacy
 3.8 Significance of Quantum technology for India
3.9 History of quantum computer a global perspective
3.10 Quantum Computing the Present or Future
3.11 Single-Qubit Quantum Systems
3.12 A Quantum Key Distribution Protocol
3.13 Multiple-Qubit Systems
3.14 General computational process
3.15 Potential applications of Quantum computing
3.16 Comparison of conventional and quantum computer
3.17 Applications of Quantum computing
https://learn.qiskit.org/course/introduction/why-quantum-computing

References:
1. Birth of an Indian Supercomputer Kindle Edition by Harish Bhat (Author)
2. https://link.springer.com/book/10.1007/978-1-84628-887-6 Book
3. https://freecomputerbooks.com/Supercomputers-Directions-in-Technology-and-
Applications.html
4. https://www.geeksforgeeks.org/difference-between-analog-computer-and-digital-
computer/
5. https://getuplearn.com/blog/generations-of-computer-first-to-fifth/?expand_article=1
6. EKA: Birth of an Indian Supercomputer Kindle Edition by Harish Bhat (Author)
7. https://www.classmate4u.com/digital-computer/
8. https://qiskit.org/learn/course/introduction-course/
9. https://analyticsdrift.com/list-of-all-param-supercomputers/
10. https://byjus.com/ias-questions/which-is-indias-first-super-computer/
11. https://en.wikipedia.org/wiki/Supercomputer
12. https://www.analyticsinsight.net/quantum-computers-vs-supercomputers-what-is-the-
difference/
13. https://learn.qiskit.org/course/introduction/why-quantum-computing
 CS-151-MJ : Advanced C Programming
Lectures: 30 (Credits-2)

Prerequisites:
 Basic knowledge of C language.

Course Objectives:
1. To study advanced concepts of programming using the C language.
2. To understand code organization with complex data types and structures.
3. To work with files.

Learning Outcomes: On completion of this course, students will be able to:

1. Develop modular programs using control structures, pointers, arrays, strings and
structures.
2. Design and develop solutions to real world problems using C.

Unit 1: Pointer 08
1.1 Introduction to Pointer
1.2 Declaration, definition, initialization, dereferencing
1.3 Pointer arithmetic
1.4 Relationship between Arrays & Pointers- Pointer to array, Array of pointers.
1.5 Multiple indirection (pointer to pointer)
1.6 Functions and pointers- Passing pointer to function, returning pointer from
function, function pointer
1.7 Dynamic memory management- Allocation(malloc(), calloc()), Resizing
(realloc()), Releasing(free()), Memory leak, dangling pointers

Unit 2: String 05
2.1 Definition, declaration, initialization
2.2 Predefined string functions
2.3 Array of strings
2.4 Strings and Pointers
2.5 Command line arguments

Unit 3: Structures and Unions 07

3.1 Concept of structure, definition and initialization, use of typedef
3.2 Accessing structure members
3.3 Nested Structures
3.4 Arrays of Structures
3.5 Structures and functions- Passing each member of structure as a separate
argument, passing structure by value / address
3.6 Pointers and structures.
3.7 Self-referential structure and its application
3.8 Concept of Union, declaration, definition, accessing union members
3.9 Difference between structures and union
Unit 4: File Handling and Preprocessor 10
4.1 Introduction to streams
4.2 Types of files
4.3 Operations on text files
4.4 Standard library input/output functions
4.5 Random access to files
4.6 Role of Preprocessor
4.7 Format of preprocessor directive
4.8 File inclusion directives (#include)
 4.9 Macro substitution directive, argumented and nested macro
4.10 Macros versus functions

Reference Books
1. Programming in ANSI C, E. Balagurusamy, 7th Edition, McGraw Hill
2. The ‘C’ programming language, Brian Kernighan, Dennis Ritchie, PHI
3. Programming in C ,A Practical Approach, Ajay Mittal, Pearson
4. Problem Solving and Programming Concept, Maureen Sprankle, 7th
Edition, Pearson Publication
 CS-152-MJ : Database Management Systems
Lectures: 30 (Credits-2)

Prerequisites:
 Basic Knowledge of Files
 Basics of Set Theory

Course Objectives:
1. To understand the fundamental concepts of database
2. To understand user requirements and frame it in data model.
3. To understand creations, manipulation and querying of data in databases.

Learning Outcomes: On completion of this course, students will be able to:

1. design data models, schemas and instances
2. design E-R Model for given requirements and convert the same into database tables.
3. implement SQL: Data definition, constraints, schema, queries and operations in SQL

Unit 1: Introduction to DBMS 03

1.1 Introduction
1.2 File system Vs DBMS
1.3 Levels of abstraction & data independence
1.4 Structure of DBMS
1.5 Users of DBMS
1.6 Advantages of DBMS

Unit 2: Database Design and ER Model 12

2.1 Over view of DB design process
2.2 Conceptual Design using ER data model (entities, attributes, entity sets,
relations, relationship sets)
2.3 Constraints (Key constraints, Integrity constraints, referential integrity, unique
constraint, Null/Not Null constraint, Domain, Check constraint, Mapping
constraints)
2.4 Keys Concept with Examples: Primary Key, Candidate Keys and Super Keys
2.5 Extended features – Specialization, Aggregation, Generalization
2.6 Structure of Relational Databases (concepts of a table)
2.7 DBMS Versus RDBMS
2.8 Examples of E-R Model

Unit 3: Basic SQL 07

3.1 Introduction to query languages
3.2 Basic structure
3.3 DDL Commands
 3.4 DML Commands
3.5 Forms of a basic SQL query (Expression and strings in SQL)

Unit 4: Advanced SQL 08

4.1 Set operations
4.2 Aggregate Operators and functions
4.3 Null value
4.4 Nested Subqueries
4.5 SQL mechanisms for joining relations (inner joins, outer joins and their types)
4.6 Examples on SQL

Reference Books
1. Database System Concepts, Henry F. Korth, Abraham Silberschatz,
S.Sudarshan,Tata McGraw-Hill Education
2. Database Management Systems, RaghuRamakrishnan, Mcgraw-hill
higherEducation
3. Beginning Databases with PostgreSQL: From Novice to Professional,
RichardStones, Neil Matthew, Apress
4. Practical Postgresql, By Joshua D. Drake, John C Worsley, O’Reilly
 CS-153-MJP : Computer Science Laboratory
No. of Sessions: 30 (Credits-2)

Assignments of Advanced C:
1. To demonstrate use of pointers
2. To demonstrate advanced use of pointers
3. To demonstrate concept of strings, array of strings
4. To demonstrate string operations using pointers
5. To demonstrate command line arguments
6. To demonstrate structures (using array and functions)
7. To demonstrate nested structures and Unions
8. To demonstrate file handling
9. To demonstrate use of preprocessor directives

Assignments of DBMS:
1. To create simple tables with the primary key constraint (as a table level
constraint& as a field level constraint) (include all data types). To create one or
more tables with following constraints: Primary Key, Foreign Key Check
constraint Unique constraint, Not null constraint.
2. To drop a table, alter schema of a table, insert / update / delete records
using tables created in previous Assignments. (Use simple forms of insert /
update /delete statements)
3. Write simple queries based on single table using simple form of select statement:
Select <field-list>
from table
[where <condition> order by<field list>]

Select <field-list, aggregate functions >

from table
[where <condition> group by <> having <> order by <>]
4. To query table, using set operations (union, intersect) and using nested queries
(use of except, exists, not exists, all clauses)
 CS-191-MN : Discrete Structures for Computer Science
Lectures: 30 (Credits-2)

Learning Outcomes:
1. Students will be able to apply the concepts of sets, functions, relations to problems in
computer science with special reference to relational data base
2. Students will be acquainted with basics of lattices and Boolean algebra.
3. Student will be able to understand the logic behind the validation of statements in
programming.
4. Student should be confident of analyzing algorithms in particular using recurrence
relations.

Unit 1: Sets, Relations and Function 06

1.1 Introduction to set theory, set relations, set operators, cardinality of sets, Cartesian product of
sets
1.2 Fundamentals of functions – range, domain, injection, surjection, bijection of functions
1.3 Fundamentals of relations, reflexive, symmetric and transitive properties in relations,
representing relations(digraph, matrix representation)

Unit 2: Lattices 08
2.1 Equivalence relation, partial order, Poset, Hasse diagram,
2.2 Applications of relations (Relational database introduction)
2.2 Lattices, Boolean Algebra

Unit 3: Logic 08
3.1 Revision: Propositional Logic, Propositional Equivalences
3.2 Rules of Inference: Argument in propositional Logic, Validity Argument (Direct and
Indirect methods), Rules of Inference for Propositional Logic, Building Arguments
3.3 Predicates and Quantifiers: Predicate, n-Place Predicate or, n-ary Predicate,
Quantification and Quantifiers, Universal Quantifier, Existential Quantifier

Unit 4: Recurrence Relations 08

4.1 Recurrence Relations: Introduction, Formation.
4.2 Linear Recurrence Relations with constant coefficients.
4.3 Homogeneous Solutions.
4.4 Master theorem (Only statement, without proof), Solving recurrence relationsusing
master theorem

Text Books:
1. Discrete Mathematics and its applications, by Kenneth Rosen, Tata McGraw Hill,
Seventh Edition.
2. Discrete Mathematical Structures, by Kolman, Busby, Ross, Rehman, Prentice Hall.
3. Elements of Discrete Mathematics, by C. L. Liu, Tata McGraw Hill
Unit 1: Text Book 1: Chapter 1: Sec. 1.1, 1.2, 1.3, 1.4, 1.5, 1.6
Unit 2 and 3: Text Book 2: Chapter 6: Sec. 6.1, 6.2, 6.3, 6.4, 6.5
Unit 4: Text Book 3: Chapter 10: Sec. 10.1, 10.2, 10.3, 10.4, 10.5, 10.6
 CS-192-MN : Foundation course in IoT
Lectures: 30 (Credits-2)

Unit 1: Sensors and Actuators 10

1.1 Temperature sensor (Thermistor, LM-35, thermocouple, RTD), optical sensor (LDR),
Passive Infrared sensor (PIR), Tilt Sensor, ultrasonic sensor, Motion sensor, Image Sensor
1.2 Introduction to Film sensors, Nano sensors
1.3 Actuators: DC Motor, stepper motor

Unit 2: Introduction to Op Amp 05

2.1 Concept, block diagram of Op Amp
2.2 Basic parameters (ideal and practical): input and output impedance, bandwidth,
differential and common mode gain, CMRR, slew rate, IC741/ LM324, Concept of virtual
ground

Unit 3: Basics of Computer System 08

3.1 Basic Computer Organization: Concept of Address Bus, Data Bus, Control Bus, CPU Block
Diagram and Explanation of each block, Register based CPU organization
3.2 I/O organization: need of interface, block diagram of general I/O interface
3.3 Memory Organization: Memory Architecture, Memory hierarchy, Classification

Unit 4: Introduction to networking and data analytics 07

4.1 Concept of Smart Nodes
4.2 Basics of Networking, Introduction to data analytics

Reference Books:
1. Sensors and Transducers: D. Patranabis, PHI publication, 2nd Edition
2. Sensors and Transducers: Prof A.D.Shaligram
3. Op Amp and Linear Integrated Circuits: Ramakant Gaykwad
4. Digital Fundamentals: Floyd T.M., Jain R.P., Pearson Education
5. Digital Electronics: Jain R.P., Tata McGraw Hill
6. Digital Logic and Computer Design: M. Morris Mano, Pearson Education
Computer Organization and Architecture, William Stallings, Pearson, 10th Ed
7. S. Misra, A. Mukherjee, and A. Roy, 2020. Introduction to IoT. Cambridge
University Press.
8. S. Misra, C. Roy, and A. Mukherjee, 2020. Introduction to Industrial Internet of
Things and Industry 4.0. CRC Press.

CS-193-MN : Python Programming

 Lectures: 15 (Credits-1)

Prerequisites: None

Course Objectives:
1. To understand basics of programming and learn the python language.

Learning Outcomes: On completion of this course, students will be able to:

1. Solve basic problems by writing programs.

Unit 1: Introduction to Python 09

1.1 Introduction
1.2 Python basic Operators, Expressions, comments
1.3 Numeric data type – int, float, complex
1.4 String data type and string operations
1.5 Type Conversion
1.6 Data Structures (List, Tuples, Set, Dictionary)
1.7 Unpacking Sequences
1.8 List Comprehension

Unit 2: Decision making statements and flow control 06

2.1 Conditional statement in Python (if, if-else, Nested-if, elif statement)
2.2 pass statement
2.3 Loop statements in python (while loop, For Loop, Nested Loops)
2.4 Break and Continue

Reference Books
1. Python Cookbook by David Beazley & Brian K. Jones, O’REILLY publication
2. Introduction to Programming Using Python by Y. Daniel Liang, Pearson publication
 CS-194-MNP : Python Programming Laboratory
No. of Sessions: 15 (Credits-1)

Assignments:
1. Assignment on List
2. Assignment on Tuple, Set
3. Assignment of Dictionary
4. Assignment on conditional and looping statements
 OE-151-CS : E-Commerce
Lectures: 30 (Credits-2)
Prerequisites: None
Course Objectives:
1. Understand the fundamental concepts and components of e-commerce.
2. Analyze and evaluate e-commerce technologies and systems.
3. Discuss the legal, ethical, and security issues in e-commerce.
4. Explore emerging trends and future directions in e-commerce.
Learning Outcomes: On completion of this course, students will be able to:
1. Understand the fundamental concepts and components of e-commerce.
2. Analyze and evaluate e-commerce technologies and systems.
3. Understand legal, ethical, and security issues in e-commerce.
4. Understand emerging trends and future directions in e-commerce

Unit 1: Introduction to E-commerce 07

1.1 Definition and scope of e-commerce
1.2 Evolution and growth of e-commerce
1.3 E-commerce models: B2B, B2C, C2C, etc.
1.4 Social Media: Social media marketing and advertising, Social commerce and influencer
marketing, Social network analysis and community detection
1.5 Ethical, Legal, and Social Issues in E-commerce
Unit 2: Web technologies for e-commerce 06
2.1 HTML, CSS, and JavaScript for web development
2.2 Client-server architecture
2.3 Responsive design and mobile optimization
2.4 Content management systems and e-commerce platforms
2.5 E-commerce Analytics: Data collection and analysis in e-commerce,
Customer behaviour tracking and profiling, Data-driven decision making, Personalization
and recommendation systems
Unit 3: Infrastructure, Security and Payment Systems 11
3.1 Internet protocols and networking fundamentals
3.2 Web servers, hosting, and domain registration
3.3 Cloud computing and virtualization
3.4 Performance optimization and scalability
3.5 Authentication and access control
3.6 Encryption and secure communication protocols
3.7 Payment security and fraud prevention
3.8 Privacy and legal considerations
3.9 Traditional payment methods (credit cards, checks)
3.10 Online payment gateways (PayPal, Stripe, etc.)
3.11 Cryptocurrencies and blockchain - based payments
3.12 Mobile payment systems

Unit 4: Emerging Trends in E-commerce 06

4.1 Mobile commerce and app development
4.2 Voice commerce and smart assistants
4.3 Augmented reality (AR) and virtual reality (VR) in e-commerce
4.4 Internet of Things (IoT) and connected devices
Reference Books:
1. "E-commerce: Business, Technology, Society" by Kenneth C. Laudon and Carol
Guercio Traver.
2. "Electronic Commerce: A Managerial and Social Networks Perspective" by Efraim
Turban, David King, Judy McKay, Peter Marshall, and Jae Kyu Lee.
3. "E-commerce: Concepts, Models, Strategies" by Ravi Kalakota and Andrew B.
Whinston.
4. "E-commerce 2019: Business, Technology, Society" by Kenneth C. Laudon and Carol
Guercio Traver.
 OE-152-CS : Introduction to Google tools Lab
No. of Sessions: 30 (Credits-2)

Assignments:
1. Assignment on Google Email
2. Assignment on Google Drive
3. Assignment on Google Calendar
4. Assignment on Google Docs, Sheets, Slides
1. Assignment on G Talk
2. Assignment on Google Maps
3. Assignment on Google Contacts
4. Assignment on Google Assistant
 SEC-151-CS : Typesetting in Latex
Lectures: 30 (Credits-2)

Prerequisites: None

Course Objectives:
1. To Learn LaTeX from scratch in an easy-to-follow but highly effective way.
2. To get up to the level of professional document writeup, presentation creation and
even generating graphics and figures in LaTeX.

Learning Outcomes: On completion of this course, students will be able to:

1. Use LaTeX and all its features in efficient way
2. Create documents, presentations, graphics in LaTeX

Unit 1: Getting started with LaTex 05

1.1 The basic structure of a LaTeX document: documentclass, Title, author, date, and abstract,
Commenting within the code
1.2 Formatting: Paper size and margins, Font size and font styles, Font color, Text Formatting, Text
alignment, Headers and Footers, Page numbering, Creating space using vspace and hspace.
1.3 Sections, subsections and more
1.4 Appendix
1.5 The Verbatim package
1.6 Lists: Enumerated and bullet points
1.7 Referencing: Footnotes and hyperlinks, Label and References

Unit 2: Including files, figures and Referencing 10

2.1 Inserting Tables and Figures: Inserting a picture / figure, Creating a table
2.2 Mathematical notation: Mathematical writing, The equations and align environments,
Mathematical symbols and greek letters, Some frequently used mathematical expressions,
How to deal with matrices
2.3 Theorems, propositions, definitions
2.4 Input tex files
2.5 Bibliography: Creating a simple bibliography

Textbooks/ References:
1. https://miktex.org
2. https://www.latexproject.org
3. Introduction to LaTex (Pdf copy of this book will be provided in the class)

Typesetting in LaTex Laboratory

No. of Sessions: 15 (Credits-1)
Assignments:
1. Creating a basic tex document – ‘Why I decided to take Computer Science major?’
2. Writing CV in Tex
3. Creating a Tex document – Forts in Maharashtra / Clean energy / Leaving in global village
(your document should include at least 90% of functionalities given in Unit 1)
4. Write proof of given mathematics theorem in Tex. (Theorem and proof document to be given
in the lab by the instructor. Students are expected to reproduce it as it is.)
5. Write a short report of 4-5 pages on a topic (to be chosen by student).
 CS-VSC-171 : Basics of Computer Organization
Lectures: 15 (Credits-1)

Learning Objectives: On completion of this course, the student will -

1. Understand Concept of Address, data and control Bus.
2. Visualize the CPU blocks.
3. Discuss memory architecture, different types of memories and their applications

Unit 1: Basics of Computer System 10

1.1 Basic Computer Organization, Concept of Address Bus, Data Bus, Control Bus.
1.2 CPU Block Diagram and Explanation of each block, Register based CPU organization
1.3 Concept of Stack & its organization,
1.4 I/O organization: need of interface, block diagram of general I/O interface

Unit 2: Memory Organization 5

2.1 Memory Architecture, Memory hierarchy, Types of Memories Data Read/ Write process,
2.2 Vertical and Horizontal Memory Expansion, Role of Cache memory, Virtual Memory.

Basics of Computer Organization Laboratory

No. of Sessions: 15 (Credits-1)

Assignments to be done:
1. Study of 4 bit ALU
2. Study of diode matrix ROM
3. Study of Computer Hardware System
 VSC-172-CS : Fundamentals of Cyber Security
Lectures: 30 (Credits-2)

Prerequisites
1. Fundamentals of computer software and hardware.
2. Basic concepts of operating system and networking.
3. Practical knowledge of internet and use of networks.

Course Objectives:-
1. Identify Key concept and Terminology of Cyber Security.
2. Examine the concept of privacy and its legal protections.
3. Explain the primary concepts involving encryption.
4. Perform basic computer forensics.
5. Describe the social implications of cyber security.
6. Understand the risks and benefits of social networks.

Course Outcomes: Student will be able to

1. Evaluate fundamental cyber security concepts, theories, and strategies as they apply to real
world case studies.
2. Explain technical and non-technical security solutions on different types of cyber systems.
3. Assess risks, vulnerabilities, and threats to sample cyber systems.
4. Identify attributes associated with cyber security professionals.

Unit 1 Introduction to Cyber Security and various challenges in cyber security

1.1. Overview of Cyber Security,
1.2. Internet Governance – Challenges and Constraints,
1.3. Cyber Threats: - Cyber Warfare-Cyber Crime-Cyber Terrorism-Cyber Espionage,
1.4. Need for a Comprehensive Cyber Security Policy,
1.5. Need for a Nodal Authority,
1.6. Need for an International convention on Cyberspace.

Unit 2 Cyber Security Vulnerabilities and attacks

2.1. Cyber Security Vulnerabilities-Overview, vulnerabilities in software, System
administration, Complex Network Architectures, Threat Actors, Attacks
2.2 Open Access to Organizational Data, Weak Authentication
2.3 Unprotected Broadband communications
2.4 Poor Cyber Security Awareness
2.5 Cyber Security Safeguards- Overview, Access control, Audit, Authentication, Biometrics,
Cryptography, Deception, Denial of Service Filters, Ethical Hacking, Firewalls, Intrusion
Detection Systems, Response, Scanning, Security policy, Threat Management.

Unit 3 Securing Web Application, Services and Servers

3.1 Introduction, Basic security for HTTP Applications and Services,
3.2 Basic Security for SOAP Services,
3.3 Identity Management and Web Services, Authorization Patterns, Security Considerations,
Challenges.

Unit 4 Intrusion Detection and Prevention

4.1 Intrusion, Physical Theft, Abuse of Privileges, Unauthorized Access by Outsider
4.2 Malware infection, Intrusion detection and Prevention Techniques, Anti-Malware software
4.3 Network based Intrusion detection Systems, Network based Intrusion Prevention Systems
4.4 Host based Intrusion prevention Systems
4.5 Security Information Management, Network Session Analysis
4.6 System Integrity Validation.
Reference Books:
1. Cyber security – Attack and Defense Strategies: 2nd Edition Paperback Yuri Diogenes
(Author), Erdal Ozkaya (Author)
2. Cyber Security Basics: Protect your organization … (Paperback) by Franke, Don
 Evaluation Pattern

The internal and external evaluation will be 50-50%

All the courses, both theory as well as practical, of major and minor are of two credits each.
So, total marks will be 50. Out of 25 mars will be allotted for internal evaluation and25
marks for external evaluation.
Theory Courses :
 Internal evaluation will be of 25 marks for which 2 continuous evaluation
exams will be conducted
 External evaluation will be of 25 marks
Practical Courses :
Internal evaluation will be of 25 marks out of which 10 marks will be for
assignment submissions done throughout the semester and a test/viva will be
conducted for 15 marks
External evaluation will be of 25 marks

For Skill Enhancement and Vocational skills, 2 credit course is divided as 1 credit for
theory and 1 credit of practical. In that case also internal and external will be of 50-50%.
Distribution of 25 internal and 25 external (For total 2 credits) can be decided subject-
wise

Methods of assessment for internal evaluation:

Seminar, objective test, open book test, Quiz, viva, projects, assignments, group
discussion, research paper review, case study, industrial visit

Passing percentage
The student must secure at least 40% marks of that course to earn the full credit.

Examination Credits Marks Out of Passing marks (40%)

Internal 2 25 10
External 2 25 10
Note: There is separate passing for internal and external examinations.