Model Course Structure for Bachelor of Science (Computer Science) Programme as Per NEP 2020

Semester Major Subject Additional/ Skill Course/ Vocational Course/ Languages-I Extracurricular Extracurricular Total
(Core Subject) Interdisciplinary Vocational Field Visit/ (2 Credits) Courses/Compulso Courses/CC Credits
(6 Credits) subject/ Course Entrepreneurship ry course (2 Credits)
Multidisciplinary (2 Credits) skills (2 Credits)
(4 Credits) (4 Credits)
I SOS/CSE/C101 Internet Fundamental of Not Applicable Not Applicable Not Applicable Understanding 20
OOPs using C ++ (4) Technologies (3) Information and connecting
+ + Technology-I with Environment
C++ Programming HTML Lab (1) (2) (2)
Lab (2)

II SOS/CSE/C201 E-Commerce (3) Fundamental of Not Applicable Not Applicable Not Applicable Life Skills and 20
Data Structures (4) + Information personality
+ Case Studies (1) Technology-II development (2)
Data Structures Lab (2)
(2)
Exit option with Certificate (40 Credits)
III SOS/CSE/C301 Introduction to Data Not Applicable Not Applicable Not Applicable Indian Knowledge 20
Database Management Cyber Security (3) Communication System-I (2)
Systems + and Devices
(4) Case Studies (1) (2)
+
DBMS Lab
(2)
IV SOS/CSE/C401 Cyber Security Computer Not Applicable Not Applicable Not Applicable Indian Knowledge 20
Design and Analysis Tools, Techniques Networks and System-II (2)
of Algorithms (4) and Security (2)
+ Countermeasures
ADA Lab (4)
(2)
Exit option with Diploma in a Particular Discipline (80 Credits)
V SOS/CSE/C501 Not Applicable Not Applicable Vocational course-I/ Indian, Modern, Culture, traditions 20
Operating System (4) Field Visit/ Regional Language-I and Moral Values
+ Entrepreneurship/Aca (2) (2)
OS Lab (2) demic-Industry
interface Course
(4)
VI SOS/CSE/DSE6 Not Applicable Not Applicable Vocational course-II/ Indian, Modern, Communication 20
(Elective) Field Visit/ Regional Language-II Skill Course
Entrepreneurship/Aca (2) (Based on
demic-Industry Developing soft
interface Course skills)
(4) (2)
Exit with Bachelor of Degree in a Particular Discipline (120 Credits)
*Compulsory Community connect Course
Student will have to qualify a Compulsory Community Connect/Social Service Program/ Minimum 16 hours of service within any semester (I to IV). This courses will be
based on community connect, Swachh Bharat Mission, NSS etc. It will be based on number of hours devoted under this course. Concerned department will verify the
fulfillment of minimum hours towards CCS.
Discipline Specific Elective Papers

1. JAVA Programming
2. Computer Graphics and Visualization
3. Software Engineering
4. Programming Using C# & .NET
5. Introduction to Python Programming

Vocational Courses-I

1. Python Programming
2. Data Analysis and Visualization
3. Digital Image Processing

Vocational Courses-II

1. Blockchain and its applications

2. Cloud Computing
3. Introduction to Data Science
 B.Sc. Computer Science 1st Year Syllabus
SEMESTER: I Core Course

Course Objective

This course is designed to develop structured as well as object-oriented programming skills using C++
programming language. The course provides a complete understanding of the object-oriented programming
features, namely Encapsulation, Abstraction, Inheritance and Polymorphism along with an in-depth knowledge
of C++ Constructs

Course Code: SOS/CSE/C101 Course Title: OOPs using C++

Course Outcomes (COs):
After learning the course, the students should be able to:
• Describe the important concepts of object-oriented programming like object and class, Encapsulation,
inheritance and polymorphism.
• Write the skeleton of C++ program.
• Write the simple C++ programs using the variables, operators, control structures, functions and I/O
objects cin and cout.
• Write the simple object-oriented programs in C++ using objects and classes.
• Use features of C++ like type conversion, inheritance, polymorphism, I/O streams and files to develop
programs for real life problems.
• Develop the applications using object-oriented programming with C++.

Course Content

Unit-1: Basic of C++

Introduction OOP, Procedural Vs. Object Oriented Programming, Principles of OOP, Benefits and applications
of OOP, Program structure, namespace, identifiers, variables, constants, enum, operators, typecasting, control
structures.
Unit-2: C++ Functions
Simple functions, Call and Return by reference, Inline functions, Macro Vs. Inline functions, Overloading of
functions, default arguments, friend functions, virtual functions.
Unit-3: Object and Classes
Basics of object and class in C++, Private and public members, static data and function members, constructors
and their types, destructors, operator overloading, type conversion.
Unit-4: Inheritance and Polymorphism
Concept of Inheritance, types of inheritance: single, multiple, multilevel, hierarchical, hybrid, protected
members, overriding, virtual base class, Pointers in C++, Pointers and Objects, this pointer, virtual and pure
virtual functions, Implementing polymorphism.
Unit-5: I/O, Templates and Exceptions
Concept of streams, cin and cout objects, C++ stream classes, Unformatted and formatted I/O, template,
function templates and class templates, Introduction to exception, try-catch- throw, multiple catch, Overview
and use of Standard Template Library

Recommended Books

Sr. Title Author Publication

1. Let us C Y. Kanitker TMH
2. The Compete Reference C++ E. Balaguruswamy TMH
3. C++: How to Program Deitel and Deitel PHI
4. Object Oriented Programming with ANSI and Turbo C++ Ashok Kamthane Pearson

Hemvati Nandan Bahuguna Garhwal University

 OOPs using C++ Lab
List of Practical’s:

1. Write a program for multiplication of two matrices using OOP.

2. Write a program to perform addition of two complex numbers using constructor overloading. Here the
first constructor which takes no argument is used to create objects which are not initialized, second which
takes one argument is used to initialize real and image parts to equal values and third which takes two
Argument is used to initialized real and image to two different values.
3. Write a program to find the greater of two given numbers in two different classes using friend function.
4. Implement a class string containing the following functions:
a. Overload + operator to carry out the concatenation of strings.
b. Overload = operator to carry out string copy.
c. Overload <= operator to carry out the comparison of strings.
d. Function to display the length of a string.
e. Function to lower () to convert upper case letters to lower case.
f. Function to upper () to convert lower case letters to upper case.
5. Write a program to demonstrate the use of special functions, constructor and destructor in the class
template. The program is used to find the bigger of two entered numbers.
6. Write a program to perform the deletion of white spaces such as horizontal tab, vertical tab, space, line
feed, new line and carriage return from a text file and store the contents of the file without whitespaces
on another file.
7. Write a program to read the class object of student info such as name, age, sex, height and weight from
the keyboard and to store them on a specified file using read() and write() functions. Again, the same file
is opened for reading and displaying the contents of the file on the screen.
8. Create a base class basic info with data members name, roll no, sex and two member functions getdata
and display. Derive a class physical fit from basic info which has data members height and weight and
member functions getdata and display. Display all the information using object of derived class.
9. Design three classes STUDENT, EXAM and RESULT. The STUDENT class has data members such as
rollno, name. Create a class EXAM by inheriting the STUDENT class. The EXAM class adds data
members representing the marks scored in six subjects. Derive the RESULT from the EXAM class and
has its own data members such as total marks. Write a program to model this relationship.
10. Write a function power to raise a number m to power n. The function takes a double value for m and int
value for Use default value for n to make the function to calculate squares when this argument is omitted.
11. Create a class TIME with members hours, minutes, seconds. Take input, add two-time objects passing
objects to function and display result.
12. Create a class Student which has data members as name, branch, roll no, age, sex, marks in five subjects.
Display the name of the student and his percentage that has more than 70%. Use array of objects.

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: I Additional/ Interdisciplinary/ Multidisciplinary Course

Course Objective

The objective of this course is to introduce students with the concept of world wide web and Internet. The course
emphasis on the common protocol, basic HTML programming, IoT fundamentals and services used for the
functionality of Internet technologies.

Course Code: SOS/CSE/AIMC101 Course Title: Internet Technologies

Course Outcomes (COs):
After learning the course, the students should be able to:
• Understand the basic working of Internet
• Differentiate between different functionality of HTML tags
• Describe the important features of IoT and Internet Protocols
• Understand the basics of PHP language.

Course Content

Unit-1 The Internet

Classification of Networks, Networking Models, what is Packet Switching, Accessing the Internet, Internet
Protocols, Internet Protocol (IP), Transmission Control Protocol (TCP), Internet Address, Structure of Internet
Servers Address, Address Space, how does the Internet work, Intranet & Extranet, Internet Infrastructure,
Unit-2 Introduction to HTML
What is HTML, Basic Tags of HTML, HTML Tag, TITLE Tag, BODY Tag, Formatting of Text, Headers,
Formatting Tags, PRE-Tag, FONT Tag, Special Characters, Working with Images, META Tag.
Unit-3 Protocols and Services on Internet
Domain Name System, SMTP and Electronic Mail, Http and World Wide Web, Usenet and Newgroups, FTP,
Telnet, Internet Tools, Search Engines
Unit-4 IoT
Understanding IoT fundamentals, IOT Architecture and protocols, Various Platforms for IoT, Real time
Examples of IoT
Unit-5 PHP
Fundamentals of PHP Development, Various Data Types, Advanced PHP Functions, Classes, Objects,
Advanced OOPS in PHP

Recommended Books

Sr. Title Author Publication

1. Learning PHP, MySQL, JavaScript, CSS & HTML5 Robert Nixon O′Reilly
2. Introduction to IoT Sudip Micra Cambridge University Press
3. Introduction to Computer Science ITL Pearson

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: I Skill Course

Course Objective

This course is designed to develop basic knowledge of computer system along with its history and architecture.
The course provides a complete understanding of computer memory, Operating system and its types.

Course Code: SOS/CSE/SEC101 Course Title: Fundament of Information Technology-I

Course Outcomes (COs):
After learning the course, the students should be able to:
• Understand the basic working of Computer system
• Differentiate between different type of Operating system
• Describe the important features of Internet
• Distinguish between different service of WWW.

Course Content

Unit-1: Knowing Computer

Basic Applications of Computer, Components of Computer System, Central Processing Unit, Keyboard, mouse
and VDU, Input devices, Output devices
Unit-2: Memory Organization
Computer Memory and its Types, Concept of Hardware and Software: Application software, Systems software
Unit-3: Basics of Operating System
Types of operating system (LINUX, WINDOWS, ANDROID), The User Interface: Task Bar, Icons, Menu,
running applications, Creating and renaming of files and directories
Unit-4: Internet
Internet: Concept of Internet, Basics of Internet Architecture, Applications of Internet, History of Internet,
Communication on Internet, Intranet vs Extranet
Unit-5: WWW AND Web Browser
World Wide Web (WWW), Web Browsing Software’s, Popular Web Browsing Software’s, Search Engines,
Popular Search Engines / Search for content, Accessing Web Browser, Using Favorites Folder, Understanding
URL, Surfing the web, Using e-governance website

Recommended Books

Sr. Title Author Publication

1. Computing Fundamentals: Introduction to Computers Faithe Wempen Sybex
2. Computer Fundamentals PK Sinha BPB
3. Introduction to Computers Peter Norton McGraw Hill Education

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: I Skill Course

Course Objective

The objective of this course is to: develop a foundation of set theory concepts and notation. This course
provides a variety of various mathematical structures by focusing on mathematical objects, operations,
and resulting properties.

Course Code: SOS/CSE/SEC102 Course Title: Discrete Mathematics-I

Course Outcomes (COs):
On successful completion of the course, students will be able to:
• Relate mathematical concepts and terminology to examples in the domain of Computer Science
• Model real world problems using various mathematical constructs

Course Content

Unit-1 Sets
Sets: Set Operations, Computer Representation of Sets, Countable and Uncountable Sets, Principle of
Inclusion and Exclusion, Multisets
Unit-2 Functions
Functions: One-to-one and Onto Functions, Inverse Functions and Compositions of Functions, Graphs of
Functions; Sequences and Summations: Sequences, Special Integer Sequences, Summations
Unit-3 Relations
Relations: Properties of Binary Relations, Equivalence relations and Partitions, Partial Ordering Relation
Unit-4 Logic
Propositional Logic, Propositional Equivalences, Use of first-order logic to express natural language
predicates, Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs, Proof Methods and
Strategies, Mathematical Induction

Recommended Books

Sr. Title Author Publication

1. Schaum's Outline of Discrete Mathematics Seymour Lipschutz McGraw Hill Education
2. Introductory discrete mathematics V. Balakrishnan Dover
3. Discrete Mathematics and Its Applications Kenneth H. Rosen McGrwa Hill Education

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: I Skill Course

Course Objective

The purpose of the course is to provide students with solid grounding in business uses of information technology
in a rapidly changing environment, and to provide discussion of critical issues surrounding the use of IT in
organizations

Course Code: SOS/CSE/SEC103 Course Title: Information System for Business-I

Course Outcomes (COs):
On completion of the course, the student will be able to:
• Remember the role of Information System in an organization.
• Understand terminologies related to Information System.
• Analyze the development process of an Information System.
• Understand ethics and responsibilities of a person and organization in a Digital Age.

Course Content

Unit-1 Introduction
What is an Information System, Components of Information System, Role of Information System, System
hardware, Moore’s Law, Role of Software in an organization, Types of Software
Unit-2 Database
Data and Databases, Types of Databases, Big Data, Data Warehouse
Unit-3 Tools of Information System
Networking and Communication, Organizational Networking, Information System Security Triad, Tools of
Information Security, Personnel Information Security
Unit-4 DSS
Why IT matters, Collaborative Systems, Decision Support Systems

Recommended Books

Sr. Title Author Publication

1. Information Systems for Business and Beyond David T. Bourgeois Saylor Academy
2. Business Information Systems Paul Bocji Pearson
3. Principle of Information System Ralph Stair Cengage Learning

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: II Core Course

Course Objective

The course aims at developing the ability to use basic data structures like arrays, stacks, queues, lists, trees to
solve problems. C++ is chosen as the language to understand implementation of these data structures.

Course Code: SOS/CSE/C201 Course Title: Data Structures

Course Outcomes (COs):
After learning the course, the students should be able to:
• Differentiate primitive and non-primitive data structures
• Design and apply appropriate data structures for solving computing problems
• Apply sorting and searching algorithms to the small and large data sets

Course Content

Unit-1 Introduction to Data Structure

Data Management concepts, Data types: primitive and non-primitive, Performance Analysis and Measurement,
Types of Data Structures: Linear & Non-Linear Data Structures.
Unit-2 Linear Data Structure
Array: Representation of arrays, Applications of arrays, sparse matrix and its representation.
Stack: Definitions & Concepts, Operations on Stacks, Applications of Stacks, Polish Expression, Reverse Polish
Expression and Their Compilation, Recursion, Tower of Hanoi
Queue: Representation of Queue, Operations on Queue, Circular Queue, Priority Queue, Array representation
of Priority Queue, Double Ended Queue, Applications of Queue,
Linked List: Singly Linked List, Doubly Linked list, Circular linked list, linked implementation of Stack, Linked
implementation of Queue, Applications of linked list
Unit-3 Nonlinear Data Structure
Tree: Definitions and Concepts, Representation of binary tree, Binary tree traversal (Inorder, postorder,
preorder), Binary search trees, Conversion of General Trees to Binary Trees, Applications of Trees, AVL trees,
2-3 trees, Height Balanced, Weight Balance.
Graph: Matrix Representation of Graphs, Elementary Graph operations, (Breadth First Search, Depth First
Search, Spanning Trees, Shortest path, Minimal spanning tree)
Unit-4 Hashing and File Structures
Hashing: The symbol table, Hashing Functions, Collision Resolution Techniques.
File Structure: Concepts of fields, records and files, Sequential, Indexed and Relative/Random File Organization
Unit-5 Sorting & Searching
Sorting: Bubble Sort, Selection Sort, Quick Sort, Merge Sort, Searching: Linear Search and Binary Search

Recommended Books:

Sr. Title Author Publication

1. Data structures using C Tanenbaum Pearson
2. Introduction to Data structures Kamathane Pearson
3. Data structures with C Seymour Lipschutz McGraw Hill Education

Hemvati Nandan Bahuguna Garhwal University

 Data Structures Lab
List of Practical’s:

1. Implement a program for stack that performs following operations using array.
(a) PUSH (b) POP (c) PEEP (d) CHANGE (e) DISPLAY
2. Implement a program to convert infix notation to postfix notation using stack.
3. Write a program to implement QUEUE using arrays that performs following operations
(a) INSERT (b) DELETE (c) DISPLAY
4. Write a program to implement Queue using arrays that performs following operations.
(a) INSERT (b) DELETE (c) DISPLAY
5. Write a menu driven program to implement following operations on the singly linked list.
a. Insert a node at the front of the linked list.
b. Insert a node at the end of the linked list.
c. Insert a node such that linked list is in ascending order.
d. Delete a first node of the linked list.
e. Delete a node before specified position.
f. Delete a node after specified position.
6. Write a program to implement stack using linked list.
7. Write a program to implement queue using linked list.
8. Write a program which create binary search tree.
9. Implement recursive and non-recursive tree traversing methods inorder, preorder and postorder traversal.
10. Write a program to implement Queue Sort
11. Write a program to implement Merge Sort
12. Write a program to implement Bubble Sort
13. Write a program to implement Linear Search
14. Write a program to implement Binary Search

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: II Additional/ Interdisciplinary/ Multidisciplinary Course

Course Objective

E-Commerce Technologies, is designed for Undergraduate students to present a managerial perspective of the
broad study on the introduction of e-commerce and the underlying used technologies involved in the sharing of
business information, maintaining business relationships and transactions by means of telecommunications
networks.

Course Code: SOS/CSE/AIMC201 Course Title: E-commerce

Course Outcomes (COs):
After learning the course, the students should be able to:
• Learn the E-Commerce Platform and its concepts
• Understand the Technology, infrastructure and Business in E-Commerce
• Understand the Security and Challenges in E-Commerce

Course Content

Unit-1 Introduction to E-Commerce

Introduction: History of E-Commerce, E-Commerce Vs Traditional Commerce, E-Commerce Terminologies
and Fundamentals, E- Commerce Framework, Elements of E-Commerce Application, Benefits and Limitation
of E-Commerce, m-commerce
Unit-2 Types of E-Commerce or Business Models of E-Commerce
Introduction; Basic understanding of E-Commerce Business: Models of E-Commerce Business: Business to
Business (B2B): Business to Consumer (B2C): Consumer to Business (C2B): Consumer to Consumer (C2C):
Business to Government (B2G); Government to Business (G2B): Business Applications of E-Commerce
Unit-3 Internet and Commerce
E-Commerce and the Internet: Benefits of E-Commerce using Internet; Issues to Internet based E-Commerce;
IT Infrastructure: Internet, Intranet, Extranet; Introduction to Broadband Technology, Introduction to TCP/IP
Protocol Suit: World Wide Web(www): E-mail: Communication Channels: Network Security and Firewalls;
Unit-4 Electronic Payment System
Introduction; Emergence of Electronic Payment System: Meaning of Electronic Payment System;
Characteristics of E-payment System, Advantages of E-payment System: Electronic Payment
Mechanism/Process: Payment Gateways: Electronic Payment Methods: Types of Payment Methods for E-
Commerce: Electronic payment issues; Security Properties of Electronic Payments: Electronic Payment and
Website: Tools for Promoting Websites
Unit-5 Electronic Data Interchange
Basic Concepts, Type of Data to be interchanged, EDI Vs. E-mail, EDI Benefits, How EDI works, EDI
Application in various field, Security and Privacy issues of EDI, EDI for E-Commerce

Recommended Books:

Sr. Title Author Publication

1. E-Commerce: Fundamentals and Applications Henry Chan Wiley
2. E-Commerce C. Kenneth Pearson
3. E-COMMERCE: An Indian Perspective S. Joseph PHI

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: II Skill Course

Course Objective

The objective of this course is to introduce student with the concept of information technology. The course
includes creating spreadsheets, understanding word processing as well as making small presentations.

Course Code: SOS/CSE/SEC201 Course Title: Fundamental of Information Technology-II

Course Outcomes (COs):
• On successful completion of this course, a student will be able to:
• create and refine documents using text formatting, tables and graphics.
• use mail merge.
• create macros and templates in documents.
• protect documents.
• create presentations containing transitions and animations. learn advanced presentation features like
custom slide show, call outs and action buttons.
• use referencing and functions for data handling

Course Content

Unit-1 Introduction to Excel

Formatting excels work book, Perform Calculations with Functions, Sort and Filter Data with Excel, Create
Effective Charts to Present Data Visually, Analyze Data Using PivotTables and Pivot Charts
Unit-2: Understanding Word Processing
Creating, opening and saving a document, text formatting, header and footer, creating and editing of tables,
importing graphics, insert picture, using word processor's drawing features
Unit-3 Making Small Presentations
Creating presentations, using blank presentation option, using design template option, adding slides, deleting a
slide, importing images from the outside world, deleting a slide, numbering a slide, saving presentation
transition and animations, adding notes to slides, customize slideshow
Unit-4 Advanced Features
Creating macros, watermarks, templates, reviewing documents, comparing and combining documents,
protection of documents-using passwords. Mail merge concept
Unit-5 Data Handling using spreadsheets
Relative, absolute and mixed referencing, mathematical and statistical functions, nested functions

Recommended Books:

Sr. Title Author Publication

1. Computer Basics with Office Automation Archana Kumar Wiley
2. Office 2019 For Dummies Wallace Wang Wiley
3. PowerPoint for Beginners M L Humphrey M.L. Humphrey

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: II Skill Course

Course Objective

The objective of this course is to: develop a foundation of set theory concepts and notation. This course
provides a variety of various mathematical structures by focusing on mathematical objects, operations,
and resulting properties.
Course Code: SOS/CSE/SEC202 Course Title: Discrete Mathematics-II
Course Outcomes (COs):
On successful completion of the course, students will be able to:
• Use different proofing techniques; construct simple mathematical proofs using logical arguments.
• Formulate mathematical claims and construct counterexamples.
• Describe the concept of graph and tree.

Course Content

Unit-1 Recurrence
Recurrence Relations, Generating Functions, Linear Recurrence Relations with Constant Coefficients and
their solution.
Unit-2 Combinatorics/Counting
The Pigeonhole Principle, Permutations and Combinations, Binomial Coefficients, Generalized Permutations
and Combinations, Generating Permutations and Combinations.
Unit-3 Graphs
Graphs: Basic Terminology, Multigraphs and Weighted Graphs, Paths and Circuits, Eulerian Paths and
Circuits, Hamiltonian paths and Circuits, Shortest Paths, Spanning Trees, Graph Isomorphism, Planar Graphs;
Unit-4 Trees
Trees, Rooted Trees, Path Lengths in Rooted Trees.

Recommended Books:

Sr. Title Author Publication

1. Schaum's Outline of Discrete Mathematics Seymour Lipschutz McGraw Hill Education
2. Introductory discrete mathematics V. Balakrishnan Dover
3. Discrete Mathematics and Its Applications Kenneth H. Rosen McGrwa Hill Education

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: II Skill Course

Course Objective

The purpose of the course is to provide students with solid grounding in business uses of information technology
in a rapidly changing environment, and to provide discussion of critical issues surrounding the use of IT in
organizations

Course Code: SOS/CSE/SEC203 Course Title: Information System for Business-II

Course Outcomes (COs):
On successful completion of the course, students will be able to:
• Remember the role of Information System in an organization.
• Understand terminologies related to Information System.
• Analyze the development process of an Information System.
• Understand ethics and responsibilities of a person and organization in a Digital Age.

Course Content

Unit-1 Business Process

Business process, role of Information System in Business process, ERP Systems, People in Information
System, emerging roles
Unit-2 SDLC
Information System Development, System Development Lifecycle, Types of Programming Languages
Unit-3 Globalization
What is Globalization, Impact of Internet on Globalization, what is digital divide, Steps to alleviate Digital
Divide
Unit-4 Ethics in Information System
Ethics in Information System, Intellectual Property and Copyright, Patent, Responsibilities of individual,
organization and government in Information Age, Future Trends in Information System.

Recommended Books:

Sr. Title Author Publication

1. Information Systems for Business and Beyond David T. Bourgeois Saylor Academy
2. Business Information Systems Paul Bocji Pearson
3. Principle of Information System Ralph Stair Cengage Learning

Hemvati Nandan Bahuguna Garhwal University

 B.Sc. Computer Science 2nd Year Syllabus
SEMESTER: III Core Course

Course objectives

The course introduces the students to the fundamentals of database management system and its architecture.
Emphasis is given on the popular relational database system including data models and data manipulation.
Students will learn about the importance of database structure and its designing using conceptual approach using
Entity Relationship Model and formal approach using Normalization. The importance of file indexing and
controlled execution of transactions will be taught. The course would give students hands-on practice of structured
query language in a relational database management system and glimpse of basic database administration
commands

Course Code: SOS/CSE/C301 Course Title: Database Management Systems

Course Outcomes (COs):
• On successful completion of this course, a student will be able to:
• Understand the importance of a database system and its difference from the traditional file system
processing.
• Create conceptual data models using entity relationship diagrams for modeling real-life situations and
map it to corresponding relational database schema.
• Construct relational database and formulate queries for data retrieval and data update using SQL.
• Normalize a database up to 3NF to make it free from update anomalies.

Course Content

Unit-1 Introduction to Database

Introduction to database and DBMS, architecture of DBMS, data independence, components of database
systems, difference between traditional file system and database management system
Unit-2 E-R Model
Entity types, types of attributes and key, relationships types, constraints on relationship, modeling ER diagram,
Database design using ER diagrams
Unit-3 Relational Data Model
Relational model concepts, relation characteristics, relational integrity constraints, types of keys, update
anomalies
Unit-4 Normalization
Functional dependencies, Use of normalization, First, Second and Third normal forms, BCNF
Unit-5 SQL
Overview of SQL query language, Data definition and manipulation languages, set operations. DDL: to
construct the database and alter its contents, DML: Querying in SQL to retrieve data from the database, use of
join and simple aggregate functions

Text Books:

Sr. Title Author Publication

1. Database System Concepts S. Abraham McGraw Hill Education
2. Introduction to Database Management Systems Atul Kahate Pearson
3. Learning SQL Alan Beaulieu O’Reilly

Hemvati Nandan Bahuguna Garhwal University

 DBMS LAB
List of Practical’s

Suggestive list of database schemes and corresponding queries:

1. Create a database having the following three tables to store the details of students of the Computer Department
in a college.
Student (Rollno, Name, DOB, Address, Phoneno)
Paper Details (Paper_code, Paper_Name)
Academic details (Rollno, Paper_code, Attendance, Marks)
i. Identify primary and foreign keys. Create the tables with keys and insert at least 5 records in each table.
ii. Design a query that will return the records (from the second table) along with the name of the student
from the first table, related to students who have attendance more than 75 and marks more than 60 in
paper P2.
iii. List all students who live in “Delhi” and have marks greater than 60 in paper with code P1.
iv. Find the total attendance and total marks obtained by each student.
v. List the names of the students who have got the highest marks in paper P2.
vi. Find the average marks obtained by each student
vii. Update the name of the paper with Paper code P1 from “Introduction to Computers” to “Computer
Science Fundamentals”.
viii. List the names of the students who have got the lowest marks in paper “Computer Science
Fundamentals”.
ix. List the names of all the students whose name ends with ‘sh’.
x. List the total number of students who have secured above 90 in paper P4.
xi. Add another column ‘Email’ in the Student table.
xii. Update the phone number of the student with Roll number 34 to ‘9888812345’.

2. Create the following tables with primary key and foreign keys, enter at least 5 records in each table and
answer the queries given below.
Suppliers (SNo, Sname, Status, SCity)
Parts (PNo, Pname, Colour, Weight, City)
Project (JNo, Jname, Jcity)
Shipment (Sno, Pno, Jno, Quantity)

i. Get supplier numbers for suppliers in Guwahati with status greater than 20.
ii. Get supplier details for suppliers who supply part P2. Display the supplier list in increasing order of
supplier numbers.
iii. Get suppliers names for suppliers who do not supply part P2.
iv. For each shipment get full shipment details, including total shipment weights computed Weight*Quantity
of corresponding parts.
v. Get all the shipments where the quantity is in the range 300 to 750 inclusive.
vi. Get part nos. for parts that either weigh more than 1Kg or are supplied by suppliers S2 or both.
vii. Get the names of cities that store more than two red parts.
viii. Update the city of S1 supplier to “Delhi”.
ix. Get part numbers for parts supplied by a supplier in Allahabad to a project in Chennai.
x. Find the names of all parts whose color starts with the letter b.
xi. Change the datatype of the weight attribute in the Parts table from int to float.
xii. Find the number of parts of each color.

3. E-R diagrams
4. SQL Queries

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: III Additional/ Interdisciplinary/ Multidisciplinary

Course Objectives

This course is geared towards generating and enhancing awareness about cyber security challenges and the
concepts of cyber security and cyber ethics among the students to help them become responsible cyber citizens
and participate safely and securely in the rapidly evolving information-age society.

Course Code: SOS/CSE/AIMC301 Course Title: Introduction to Cyber Security

Course Outcomes (COs):
After successful completion of course the student will be able to:
• Remember the broad set of technical, social & political aspects of Cyber Security.
• Understand the importance of ethical hacking, its tool and ethical hacking process.
• Analyze security principles to system design.
• Understand the methods for authentication, access control, intrusion detection and prevention in Cyber
Security.

Course Content

Unit-1 Introduction to Cyber Security

Importance and challenges in Cyber Security, Cyberspace, and Cyber threats, Cyber warfare, CIA Triad, Cyber
Terrorism, Cyber Security of Critical Infrastructure
Unit-2 Hackers and Cyber Crimes
Types of Hackers - Hackers and Crackers, Cyber-Attacks and Vulnerabilities, Malware threats, Sniffing,
Gaining Access - Escalating Privileges, Executing Applications, Hiding Files, Covering Tracks. Worms,
Trojans, Viruses, Backdoors
Unit-3 Ethical Hacking
Ethical Hacking Concepts and Scopes, Threats and Attack Vectors, Information Assurance, Threat Modeling,
Enterprise Information Security Architecture, Vulnerability Assessment and Penetration Testing
Unit-4 Social Engineering
Types of Social Engineering - Insider Attack - Preventing Insider Threats - Social engineering Targets and
Defence Strategies
Unit-5 IT Security Act & Cyber Security Initiatives in India
IT Act, Hackers-Attacker-Countermeasures, Web Application Security, Counter Cyber Security Initiatives in
India, Cyber Security Incident Handling, Cyber Security Assurance

Text Books:

Sr. Title Author Publication

1. Cyber Security and Cyber Laws Nilakshi Jain Wiley
2. Cyber Security Nina Godbole Wiley
3. Beginners Guide to Ethical Hacking and Abhinav Ojha Notion Press
Cyber Security

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: III Skill Course

Course objective

The objectives of this course are to: understand the concepts behind computer networks and data communication.
Learn the use of different layers in standard reference models used for communication. Learn the main features
of protocols used at various layers. Understand the utility of different networking devices.

Course Code: SOS/CSE/SEC301 Course Title: Data Communication and Networking-I

Course Outcomes (COs):
On successful completion of the course, the student will be able to:
• Describe the hardware and software components used in a network.
• Compare OSI and TCP/IP reference models at various layers.
• Describe, analyze and compare different data link,

Course Content

Unit-1 Introduction
Components of data communication, Types of Computer Network, Internet, Intranet, Network Topologies,
Layered Architecture Approach, OSI Reference Model, TCP/IP Reference Model.
Unit-2 Physical Layer
Analog Signal, Digital signal, digital modulation techniques (ASK, PSK, QAM), encoding techniques, the
maximum data rate of a channel
Unit-3 Transmission Media
Transmission media (guided transmission media, wireless transmission, satellite communication), multiplexing
(frequency division multiplexing, time-division multiplexing, wavelength division multiplexing)
Unit-4 Data Link Layer
Data link layer services, error detection and correction techniques, error recovery protocols (stop and wait, go
back n, selective repeat), multiple access protocols with collision detection, MAC addressing, Ethernet, data
link layer switching, point-to-point protocol.

Text Books:

Sr. Title Author Publication

1. Data Communications and Networking A. Forouzan McGraw Hill Education
2. Computer Networking Kurose Pearson
3. Computer Networks Andrew S. Tanenbaum Pearson

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: III Skill Course

Course objective

The primary objective of the course is to develop the basic understanding of numerical algorithms and skills to
implement algorithms to solve mathematical problems on the computer.

Course Code: SOS/CSE/SEC302 Course Title: Numerical Computing-I

Course Outcomes (COs):
Upon completion of the course students shall be able to:
• Recognize the error in the number generated by the solution.
• Compute solution of algebraic and transcendental equation by numerical methods like Bisection
method and Newton Raphson method.
• Apply method of interpolation and extrapolation for prediction. Recognize elements and variable in
statistics and summarize qualitative and quantitative data

Course Content

Unit-1 Introduction
Numbers and their accuracy, Computer Arithmetic, Mathematical preliminaries, Errors and their
Computation, General error formula, Error in a series approximation.
Unit-2 Solution of Algebraic and Transcendental Equation
Bisection Method, Iteration method, Method of false position, Newton-Raphson method, Methods of finding
complex roots, Muller’s method, Rate of convergence of Iterative methods.
Unit-3 Interpolation
Differences, Difference tables Polynomial Interpolation: Newton’s forward and backward formula Central
Difference Formulae: Gauss forward and backward formula, Stirling’s, Bessel’s, Everett’s formula.
Unit-4 Interpolation with Unequal Intervals
Lagrange’s Interpolation, Newton Divided difference formula, Hermite’s Interpolation,

Recommended Books

Sr. Title Author Publication

1. Computer-Based Numerical & Statistical Techniques M. Goyal Infinity Science Press LLC
2. Numerical Methods M.K. Jain New Age
3. Introductory Methods of Numerical Analysis S.S. Sastry PHI Learning

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: III Skill Course

Course Objective

This course introduces the students to the fundamental concepts of digital computer organization, design and
architecture. It aims to develop a basic understanding of the building blocks of the computer system and highlights
how these blocks are organized together to architect a digital computer system

Course Code: SOS/CSE/SEC303 Course Title: Computer System Architecture-I

Course Outcomes (COs):
Upon completion of the course students shall be able to:
• Differentiate between logic gate and compute truth tables
• Analyze circuits and flip-flops
• Design basic combinatorial circuit and manage its components
• Understand various data representation methods.

Course Content

Unit-1 Digital Logic Circuits

Logic Gates, Truth Tables, Boolean Algebra, Digital Circuits, Combinational Circuits
Unit-2 Sequential Circuits
Circuit Simplification using Karnaugh Map, Don’t Care Conditions, Flip-Flops, Characteristic Tables,
Excitation Table
Unit-3 Digital Components
Designing of combinational circuits- Half Adder, Full Adder, Decoders, Encoders, Multiplexers, Registers
and Memory (RAM, ROM and their types), Arithmetic Microoperations, Binary Adder
Unit-4 Data Representation and Basic Computer Arithmetic
Number System, r and (r-1)’s Complements, data representation and arithmetic operations.

Recommended Books

Sr. Title Author Publication

1. Digital Design Morris Mano Pearson Education
2. Computer System Architecture Morris Mano Pearson Education
3. Computer Organization and Architecture W. Stallings Prentice Hall of India

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: IV Core Course

Course objective

The course is designed to develop understanding of different algorithm design techniques and use them for
problem solving. The course shall also enable the students to verify correctness of algorithms and analyze their
time complexity.

Course Code: SOS/CSE/C401 Course Title: Design and Analysis of Algorithms

Course Outcomes (COs):
On successful completion of this course, the student will be able to:
• Compute and compare the asymptotic time complexity of algorithms.
• Use appropriate algorithm design technique(s) for solving a given problem.
• Appreciate the difference between tractable and intractable problems.

Course Content

Unit-1 Introduction to Algorithm + Sorting

Asymptotic analysis: Big-O, Big-Theta, Insertion Sort, Selection Sort, Bubble Sort, Heapsort, Linear Time
Sorting, Selection Problem, Analysis of time complexity of all algorithms
Unit-2 Graphs
Representation of graphs, Traversal of graphs (BFS and DFS), Directed graphs, Directed Acyclic Graphs and
Topological Ordering
Unit-3 Divide and Conquer
Introduction to divide and conquer technique, Merge Sort, Quick Sort with analysis of time complexity.
Maximum Sub-array problem, Strassen’s algorithm for matrix multiplication.
Unit-4 Greedy Algorithms
Introduction to the Greedy algorithm design approach, application to minimum spanning trees, fractional
knapsack problem, shortest path problem with analysis of time complexity.
Unit-5 Dynamic Programming & Intractability
Introduction to the Dynamic Programming approach, application to weighted interval scheduling, integer
knapsack problem with analysis of time complexity, Introduction to NP, NP-hard and NP-complete classes.

Text Books:

Sr. Title Author Publication

1. Introduction to Algorithms Cormen MIT Press
2. Introduction to the Design and Analysis of Algorithms Levitin Addison Wesley
3. Design and Analysis of Algorithms Sandeep Sen Cambridge University Press

Hemvati Nandan Bahuguna Garhwal University

 Design and Analysis of Algorithms LAB
List of Practical’s
1. Write a program to sort the elements of an array using Insertion Sort (The program should report the
number of comparisons).
2. Write a program to sort the elements of an array using Merge Sort (The program should report the number
of comparisons).
3. Write a program to sort the elements of an array using Heap Sort (The program should report the number
of comparisons).
4. Write a program to multiply two matrices using the Strassen’s algorithm for matrix multiplication.
5. Write a program to sort the elements of an array using Radix Sort.
6. Write a program to sort the elements of an array using Bucket Sort.
7. Display the data stored in a given graph using the Breadth-First Search algorithm.
8. Display the data stored in a given graph using the Depth-First Search algorithm.
9. Write a program to determine a minimum spanning tree of a graph using the Prim’s algorithm.
10. Write a program to implement Dijkstra's algorithm to find the shortest paths from a given source node to
all other nodes in a graph.
11. Write a program to solve the weighted interval scheduling problem.
12. Write a program to solve the 0-1 knapsack

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: IV Additional/ Interdisciplinary/ Multidisciplinary Course

Course objective

The course focuses on covering all cyber security landscapes theoretically and practically. This course provides a
range of career opportunities in Cyber Security Sectors as Network/Application Security Analyst, Cyber Security
Analyst, Security Automation, Cyber Security Practitioner, Cyber Defense Analyst, Penetration Tester,
Information Security Engineer in leading IT Industries and to act as Cyber Security Experts in in Governmental
Organizations. Cyber Security, Tools, Techniques and Counter Measures course teaches learners to protect the
confidentiality, availability and integrity of information and information systems.

Course Code: SOS/CSE/AIMC401 Course Title: Cyber Security Tools, Techniques and Countermeasures
Course Outcomes (COs):
On successful completion of this course, the student will be able to:
• compare the various encryption techniques.
• identify the Intrusion and execute prevention methods.
• describe various tools related to cyber security.

Course Content

Unit-1 Cryptography
Cryptography in Practice, Historical Perspectives - Algorithms - Hashing Functions - Symmetric Encryption,
Asymmetric Encryption, Quantum Cryptography, Cryptography Algorithm Uses.
Unit-2 Intrusion Detection Systems
History of Intrusion Detection Systems, IDS Overview, Network-Based IDSs, Host-Based IDSs, Intrusion
Prevention Systems, Honeypots and Honeynets - Tools.
Unit-3 Online Banking, Credit Card and UPI Security
Online Banking Security, Mobile Banking Security, Security of Debit and Credit Card, UPI Security.
Unit-4 Information Destroying and Recovery Tools
Recovering from Information Loss, Destroying Sensitive Information

Text Books:

Sr. Title Author Publication

1. Cyber Security and Cyber Laws Nilakshi Jain Wiley
2. Cyber Security Nina Godbole Wiley
3. Beginners Guide to Ethical Hacking and Abhinav Ojha Notion Press
Cyber Security

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: IV Skill Course

Course objective

The objectives of this course are to: understand the concepts behind computer networks and data communication.
Learn the use of different layers in standard reference models used for communication. Learn the main features
of protocols used at various layers. Understand the utility of different networking devices.

Course Code: SOS/CSE/SEC401 Course Title: Data Communication and Networking-II

Course Outcomes (COs):
On successful completion of the course, the student will be able to:
• describe, analyze and compare different data link, network, transport and application layer protocols.
• design/implement transport and network layer protocols in a simulated networking environment.
• describe application layer protocols.

Course Content

Unit-1 Networking Devices

NIC, Hub Switch Router Bridge Gateway Modem Repeater Access Point
Unit-2 Network Layer
Networks and Internetworks, virtual circuits and datagrams, addressing, subnetting, Routing algorithm
(Distance vector and Dijkstra routing), Network Layer protocol- (ARP, IPV4, ICMP, IPV6).
Unit-3 Transport Layer
Process to process Delivery- (client-server paradigm, connectionless versus connection-oriented service,
reliable versus unreliable); User Datagram Protocols, TCP/IP protocol, Flow Control
Unit-4 Application Layer
FTP (File Transfer Protocol), SMTP (Simple Mail Transfer Protocol), Telnet (Remote login protocol), WWW
(World Wide Web), HTTP (HyperText Transfer Protocol)

Text Books:

Sr. Title Author Publication

1. Data Communications and Networking A. Forouzan McGraw Hill Education
2. Computer Networking Kurose Pearson
3. Computer Networks Andrew S. Tanenbaum Pearson

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: IV Skill Course

Course objective

The primary objective of the course is to develop the basic understanding of numerical algorithms and skills to
implement algorithms to solve mathematical problems on the computer.

Course Code: SOS/CSE/SEC402 Course Title: Numerical Computing-II

Course Outcomes (COs):
Upon completion of the course students shall be able to:
• Use various methods for numerical integration and differentiation summarize qualitative and
quantitative data.
• Calculate solution of differential equations.
• Outline properties of curve fitting and compute coefficient of regression.

Course Content

Unit-1 Numerical Integration and Differentiation

Introduction, Numerical differentiation, Numerical Integration: Trapezoidal rule, Simpson’s 1/3 and 3/8 rule,
Boole’s rule, Weddle’s rule
Unit-2 Solution of differential Equations
Picard’s Method, Euler’s Method, Taylor’s Method, Runge-Kutta Methods, Predictor Corrector Methods,
Automatic Error Monitoring and Stability of solution.
Unit-3 Linear System of Algebraic Equations
Gauss Elimination method, Gauss Jordan method, LU decomposition method, Gauss-Jacobi method, Gauss-
Seidel Method
Unit-4 Curve fitting
B-spline and Approximation, Fitting linear and non-linear curves, weighted least square approximation,
method of least square for continuous functions, Regression Analysis: Linear and Non-Linear

Recommended Books

Sr. Title Author Publication

1. Computer-Based Numerical & Statistical Techniques M. Goyal Infinity Science Press LLC
2. Numerical Methods M.K. Jain New Age
3. Introductory Methods of Numerical Analysis S.S. Sastry PHI Learning

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: IV Skill Course

Course Objective

This course introduces the students to the fundamental concepts of digital computer organization, design and
architecture. It aims to develop a basic understanding of the building blocks of the computer system and highlights
how these blocks are organized together to architect a digital computer system

Course Code: SOS/CSE/SEC403 Course Title: Computer System Architecture-II

Course Outcomes (COs):
Upon completion of the course students shall be able to:
• Outline the basic organization of computer Bus.
• Differentiate between different types of memory available in computer system & their functions.
• Explain the process of the Direct Memory Access.

Course Content

Unit-1 Basic Computer Organization and Design

Bus organization, Micro programmed vs Hardwired Control, Instruction Codes, Instruction Format,
Instruction Cycle, Instruction pipelining, Memory Reference, Register Reference and Input Output
Instructions, Program Interrupt and Interrupt Cycle.
Unit-2 Processors
General register organization, Stack Organization, Addressing Modes, Overview of Reduced Instruction Set
Computer (RISC), Complex Instruction Set Computer (CISC), Multicore processor and Graphics Processing
Unit (GPU)
Unit-3 Memory and Input-Output Organization
Memory hierarchy (main, cache and auxiliary memory), Input-Output Interface.
Unit-4 Modes of Transfer
Programmed I/O, Interrupt initiated I/O, Direct memory access.

Recommended Books

Sr. Title Author Publication

1. Digital Design Morris Mano Pearson Education
2. Computer System Architecture Morris Mano Pearson Education
3. Computer Organization and Architecture W. Stallings Prentice Hall of India

Hemvati Nandan Bahuguna Garhwal University

 B.Sc. Computer Science 3rd Year Syllabus
SEMESTER: V Core Course

Course Objective

The course is designed to explain the need and structure of an operating system using its common services such
as process management (creation, termination etc.), CPU Scheduling, Process Synchronization, Handling
Deadlocks, main memory management, virtual memory,

Course Code: SOS/CSE/C501 Course Title: Operating System

Course Outcomes (COs):
On successful completion of the course, students will be able to:
• Understand the need of an Operating System & Define Multiprogramming and Multithreading
concepts.
• Implement Process Synchronization service (Critical Section, Semaphores), CPU scheduling service
with various algorithms.
• Learn Main memory Management (Paging, Segmentation) algorithms, Handling of Deadlocks.

Course Content

Unit-1 Introduction
Operating Systems (OS) definition and its purpose, Multiprogramming and Time-Sharing Systems, OS
Structure, OS Operations: Dual and Multi-mode, OS as resource manager.
Unit-2 Operating System Structures
OS Services, System Calls: Process Control, File Management, Device Management, and Information
Maintenance, Inter-process Communication, and Protection, System programs, OS structure- Simple, Layered,
Microkernel and Modular
Unit-3 Process Management
Process Concept, States. Process Control Block, Context Switch, Process scheduling, Schedulers, Overview of
threads and Scheduling Algorithms: First Come First Served, Shortest-Job-First, Priority & Round-Robin,
Process Synchronization: The critical-section problem and Peterson’s Solution, Deadlock characterization,
Deadlock handling
Unit-4 Memory Management
Physical and Logical address space, Swapping, Contiguous memory allocation strategies - fixed and variable
partitions, Segmentation, Paging, virtual memory: Demand Paging, Page Replacement algorithms: FIFO Page
Replacement, Optimal Page replacement, LRU page replacement
Unit-5 File System and Disk Scheduling
File Concepts, File Attributes, File Access Methods, Directory Structure: Single-Level, Two-Level, Tree-
Structured, and Acyclic-Graph Directories. Mass Storage Structure: Magnetic Disks, Solid-State Disks,
Magnetic Tapes, Disk Scheduling algorithms: FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOk Scheduling

Text Books:

Sr. Title Author Publication

1. Operating System Concepts Galvin Wiley
2. Operating Systems: A Concept-based Dhamdhere McGraw Hill Education
Approach
3. Operating Systems: Internals and Design W. Stallings Pearson Education
Principles
4. Modern Operating Systems Andrew S. Tanenbaum Pearson Education

Hemvati Nandan Bahuguna Garhwal University

 Operating System LAB
List of Practical’s

1. Study and explain the types of operating systems (their types with structure, functionality, dependencies,
application software with their differences).
2. Installation of any one of the operating system.
3. Implement any file allocation technique (Linked, Indexed or Contiguous).
4. Present the output of following CPU Scheduling algorithm:
i. FCFS
ii. SJF
iii. Priority
iv. Round Robin
5. Present the output of following Page Replacement Algorithm:
i. FIFO
ii. LRU
iii. OPTIMAL
6. To implement first fit, best fit and worst fit algorithm for memory management.
7. Present the output for Producer – Consumer problem concept.
8. Simulate Bankers algorithm.
9. Implementation of Disk Scheduling Algorithms

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: V Vocational Course

Course Objective

The objectives of this course are to: Understand the foundations, basic concepts and techniques of Artificial
Intelligence (AI). Apply informed search techniques for different applications. Impart knowledge about the use
of core AI techniques having applicability to a wide range of real-world problems. Learn about various knowledge
representation techniques and writing Prolog programs. Learn about the latest techniques for developing AI
system

Course Code: SOS/CSE/VO501 Course Title: Artificial Intelligence

Course Outcomes (COs):
On completion of the course, the student will be able to:
• Understand the basics of Artificial Intelligence and gain knowledge of the learning process and its
models.
• Understand different types of search techniques.
• Understand different knowledge representation schemes.
• Understand the AI applications in the design of expert systems.
• Understand basic concepts of machine learning, ANN, SVM and fuzzy logic

Course Content

Unit-1
Introduction: Introduction to Artificial Intelligence, Background and Applications, AI techniques, Tic Tac-
Toe problem, Problem Characteristics.
Unit-2
Problem Solving and Searching Techniques: Problem Characteristics, Production Systems, Water Jug
Problem, Control Strategies, Breadth First Search, Depth First Search, Hill climbing and its Variations,
Heuristics Search Techniques: Best First Search. 8-Puzzle Problem.
Unit-3
Knowledge Representation: Definition of Knowledge, Knowledge Based Systems, Representation of
Knowledge. Introduction to First Order Predicate Logic, Conversion to clausal form, Unification, Resolution
Principle
Unit-4
Expert Systems: Introduction to Expert Systems, Characteristic Features of Expert Systems, Applications of
Expert Systems, Components and Working of Expert Systems
Unit-5s
Introduction to Machine Learning Techniques: Fuzzy Logic, Fuzzy Set, Membership Function, Union,
intersection and complement of a fuzzy set, Introduction to Artificial Neural Network, Introduction to Support
Vector Machine.

Text Books:

Sr. Title Author Publication

1. Introduction to A.I and Expert Systems DAN.W. Patterson PHI
2. Artificial Intelligence-A Modern Approach Russell & Norvig Pearson
3. Artificial Intelligence Rich & Knight McGraw Hill Education

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: V Vocational Course

Course Objective

This course will provide fundamental approaches and techniques used to develop good quality software. This
includes learning of various software development process frameworks, requirement analysis, design modeling,
qualitative and quantitative software metrics, risk management, and testing techniques.

Course Code: SOS/CSE/VO502 Course Title: Software Engineering

Course Outcomes (COs):
After successful completion of course the students will be able to:
• Familiarize Software and Software Engineering.
• Evaluate the Software Requirement Analysis.
• Design about the Structured Analysis.
• Identify the Software Design.
• Appropriate about the Software Testing methods

Course Content

Unit-1
Introduction: The Evolving Role of Software, Software characteristics, Software Engineering as a Layered
Technology, Software Process Framework and Umbrella Activities, Process Models.
Unit-2
Requirement Analysis: Software Requirement Analysis, Initiating Requirement Engineering Process,
Requirement Analysis and Modelling Techniques, Flow Oriented Modelling, Need for SRS, Characteristics
and Components of SRS
Unit-3
Software Project Management: Estimation in Project Planning Process, Project Scheduling. Risk
Management: Software Risks, Risk Identification, Risk Projection and Risk Refinement
Unit-4
Software Engineering Principles &Tools: Tools of Design (Data Flow Diagrams, Data Dictionary, Decision
Tree, Decision Tables), Modularization (Coupling).
Unit-5
Testing Strategies & Tactics: Software Testing Fundamentals, Test Strategies for Conventional Software,
Validation Testing, System testing, Black-Box Testing, White-Box Testing and their type, Basis Path Testing

Text Books:

Sr. Title Author Publication

1. Software Engineering Concepts R.F.Fairley McGraw Hill Education
2. Software Engineering: A Practitioners R.S.Press Man McGraw Hill Education
Approach
3. Fundamentals of Software Engineering Rajib Mall PHI

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: V Vocational Course

Course Objective

This course is designed to introduce the students to real-world data analysis problems, use of statistics to get a
deterministic view of data and interpret results in the field of exploratory data science using Python.

Course Code: SOS/CSE/VO503 Course Title: Data Analysis and Visualization

Course Outcomes (COs):
On successful completion of the course, students will be able to:
• Apply descriptive statistics to obtain a deterministic view of data
• Perform data handling using Numpy arrays
• Load, clean, transform, merge and reshape data using Pandas
• Visualize data using Pandas and matplot libraries
• Solve real world data analysis problems

Course Content

Unit-1
Introduction to basic statistics and analysis: Fundamentals of Data Analysis, Statistical foundations for Data
Analysis, Types of data, Descriptive Statistics, Correlation and covariance, Linear Regression, Statistical
Hypothesis Generation and Testing, Python Libraries: NumPy, Pandas, Matplotlib
Unit-2
Array manipulation using NumPy: NumPy array: Creating NumPy arrays; various data types of NumPy
arrays, indexing and slicing, swapping axes, transposing arrays, data processing using NumPy arrays.
Unit-3
Data Manipulation using Pandas: Data Structures in Pandas: Series, DataFrame, Index objects, loading data
into Panda’s data frame, Working with DataFrames: Arithmetic’s, Statistics, Binning, Indexing, Reindexing,
Filtering, handling missing data, Hierarchical indexing, Data wrangling: Data cleaning, transforming, merging
and reshaping
Unit-4
Plotting and Visualization: Using Matplotlib to plot data: figures, subplots, markings, color and line styles,
labels and legends, plotting functions in Pandas: Line, bar, Scatter plots, histograms, stacked bars, Heatmap
Unit-5
Data Aggregation and Group operations: Group by Mechanics, Data aggregation, General split-apply-
combine, Pivot tables and cross tabulation

Text Books:

Sr. Title Author Publication

1. Data Analysis: Data Wrangling with Pandas, W. McKinney O’Reilly
NumPy and IPython
2. Hands-On Data Analysis with Pandas Molin S Packt
3. Fundamentals of Mathematical Statistics Gupta S.C S. Chand

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: VI Core Course (Elective)

Course Objective

This course is designed to develop understanding of object-oriented programming concepts like Classes, Objects,
Inheritance and Polymorphism using Java. The course provides understanding of multithreading and exception
handling in Java. It also introduces how to create Java applications with graphical user interface (GUI).

Course Code: SOS/CSE/DSEC601 Course Title: JAVA Programming

Course Outcomes (COs):
On completion of the course, the student will be able to:
• Use the syntax and semantics of java programming language and basic concepts of OOP.
• Develop reusable programs using the concepts of inheritance, polymorphism, interfaces and packages.
• Apply the concepts of Multi-threading and Exception handling to develop efficient and error free
codes.
• Create & Maintain MYSQL Databases using JAVA
• Design event driven GUI Applications

Course Content

Unit-1 Introductory Concepts

Program, identifiers, variables, constants, primitive datatypes, expressions, Naming Conventions, Type
casting, operators, control statements, structured data types, arrays, functions.
Unit-2 Object Oriented Concepts
Abstraction, encapsulation, objects, classes, methods, constructors, inheritance, polymorphism, static and
dynamic binding, Anonymous block, Static Data members, overloading and overriding, Usage of super and
this keyword, Abstract classes, Interfaces and Packages, Access modifiers, object class.
Unit-3 Database Programming
Database Programming, The Design of JDBC. The Structured Query Language, JDBC Installation, Basic
JDBC Programming Concepts, Query Execution, Scrollable and Updatable Result Sets, Metadata, Row Sets,
Transactions.
Unit-4 AWT
AWT: Components and container used in AWT, Layout managers, Listeners and Adapter classes, Event
Delegation model, Swing: Introduction to Swing Component and Container Classes

Text Books:

Sr. Title Author Publication

1. The Complete Reference Naughton, Schildt TMH
2. Programming in JAVA Balagurusamy E TMH
3. Java2 Black book Steven Holzner Dreamtech

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: VI Core Course (Elective)

Course Objective

This course introduces fundamental concepts of Computer Graphics with focus on modeling, rendering and
interaction aspects of computer graphics. The course emphasizes the basic principles needed to design, use and
understand computer graphics system

Course Code: SOS/CSE/DSEC602 Course Title: Computer Graphics

Course Outcomes (COs):
On successful completion of the course, students will be able to:
• Describe Standard raster and vector scan devices as well as Graphical Input and output devices
• Implement algorithms for drawing basic primitives such as line, circle and ellipse.
• Implement algorithms for line clipping, polygon clipping and polygon filling.
• Implement a 3D object representation scheme, carryout 2D and 3D transformation, 3D projections
• Implement visible surface determination algorithms, Illumination models and surface rendering
methods

Course Content

Unit-1 Introduction
Introduction to Graphics systems, Basic elements of Computer graphics, Applications of computer graphics.
Architecture of Raster and Random scan display devices, input/output devices
Unit-2 Drawing and clipping primitives
Raster scan line, circle and ellipse drawing algorithms, Polygon filling, line clipping and polygon clipping
algorithms
Unit-3 Transformation and Viewing
2D and 3D Geometric Transformations, 2D and 3D Viewing transformations (Projections- Parallel and
Perspective), Vanishing points
Unit-4 Visible Surface determination and Surface Rendering
Z-buffer algorithm, List-priority algorithm and area subdivision algorithm for visible surface determination.
Illumination and shading models, RGB Color model and Basics of Computer Animation

Text Books:

Sr. Title Author Publication

1. Computer Graphics Hearn, D & Baker, Prentice Hall of India
2. Computer Graphics: Principles and Practice in C Foley Pearson Education
3. Mathematical Elements for Computer Graphics, D.F. Rogers McGraw Hill Education

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: VI Core Course (Elective)

Course Objective

This course is designed to provide the knowledge of Dot Net Frameworks along with C#. The course emphasis
on basic concepts of C# and general introduction of C# Libraries.

Course Code: SOS/CSE/DSEC603 Course Title: Programming using C# & .NET

Course Outcomes (COs):
On completion of the course, the student will be able to:
• Acquire the knowledge of the structure and model of the programming language C #
• Understand the use of programming language C # for various programming technologies
• Evaluate user requirements for software functionality required to decide whether the programming
language C # can meet user requirements

Course Content

Unit-1 The .NET Framework

Introduction, Common Language Runtime, Common Type System, Common Language specification, The
Base Class Library, The .Net class library Intermediate language, Just-in time Compilation, Garbage
Collection, Application Installation and Assemblies, Web services, Unified classes
Unit-2 C# Basics
Introduction, Data Types, Identifiers, Variables and constants, C# statements, Object Oriented Concept,
Object and Classes, Arrays and Strings, System collections, Delegates and Events, Indexes, Attributes,
versioning
Unit-3 C# Using Libraries
Namespace- System, Input Output, Multi-Threading, Networking and Sockets, Data Handling, Windows
Forms, C# in web application, Error Handling
Unit-4 Advanced Features Using C#
Web services, Windows services, messaging, Reflection, COM, Localization.

Text Books:

Sr. Title Author Publication

1. Programming with C# E. Balagurusamy TMH
2. Beginning Visual C# Wiley Wrox
3. Applied Microsoft .NET Framework Programming Jeffrey Richter Microsoft

Note:

1. Vocational Courses for V and VI Semester are in preparation

2. Elective Papers (Fourth Year – with Research) for VII and VIII semesters are in preparation
3. Major Elective Papers (Fourth Year - Honours) for VII and VIII semesters are in preparation.

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: VI Vocational Course

Course Objective

This course covers the basic concepts behind blockchain and presents Bitcoin and other cryptocurrencies as the
motivation for blockchain technologies. It provides a substantive discussion about different technologies behind
blockchain and cryptocurrencies

Course Code: SOS/CSE/VO601 Course Title: Blockchain and its Applications

Course Outcomes (COs):
On successful completion of the course, students will be able to:
• understand the applications of blockchain in different domains
• learn the practical applications of cryptocurrency such as Bitcoin and Ethereum
• understand basic technologies like cryptographic hash functions, blocks, Merkel trees, elliptic curve
cryptography and digital signatures.
• to have knowledge of decentralized consensus algorithms like proof of work, proof of stack, proof of
capacity etc.
• to learn how to record transactions in blockchain, computing bitcoin address etc.
• to learn about smart contracts and their applications
• to learn about permissioned and permission less blockchain and Hyperledger’s.
• to gain knowledge of real-world aspects of Bitcoin, such as wallets and mining techniques

Course Content

Unit-1
Introduction: History of money, Digital Currencies, Ledgers, Cryptography, Centralized and Decentralized
systems, peer to peer systems, the purpose of Blockchain, types of blockchain (public, private and semi-private
blockchain), application of blockchain (in government, healthcare, real estate, voting, insurance, non-fungible
tokens, metaverse, Web 3.0).
Unit-2
Cryptocurrency and Design: Concept of cryptocurrency, History of Bitcoin, concept of mining, challenges of
blockchain/bitcoin design (performance, scalability, efficiency, security, governance, public policy and legal
framework).
Unit-3
Blockchain Technology: Properties of hash functions, Cryptographic hash functions, hashes (as names,
references and commitments), Blocks, Block Headers, Merkel Trees, chain forks, Asymmetric Cryptography,
Digital signatures
Unit-4
Blockchain and Money Transactions: Satoshi and Bitcoin, Recording of transactions in blockchain,
transaction inputs, outputs and format, Bitcoin address. Smart contracts (Ethereum and other currencies):
Overview of smart contracts, tokens and Ethereum as a platform for smart contracts, blockchain technology
as regulatory authority

Text Books:

Sr. Title Author Publication

1. Mastering blockchain Distributed ledger technology, Imran Bashir Packt
decentralization, and smart contracts explained
2. Mastering Blockchain Lorne Lantz
3. Introducing Ethereum and Solidity Foundations of Chris Dannen Apress
Cryptocurrency and Blockchain Programming for beginners

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: VI Vocational Course

Course Objective

The objective of this course is to provide graduate students with the comprehensive and in-depth knowledge of
Cloud Computing concepts, technologies, architecture and applications by introducing and researching state-of-
the-art in Cloud Computing fundamental issues, technologies, applications and implementations.

Course Code: SOS/CSE/VO602 Course Title: Cloud Computing

Course Outcomes (COs):
After successful completion of course the student will be able to:
• Understand the key dimensions of the challenges and benefits of Cloud Computing.
• Describe the principles of Parallel and Distributed Computing and evolution of cloud computing from
existing technologies
• Implement different types of Virtualization technologies and Service Oriented Architecture systems.
• Choose among various cloud technologies for implementing applications.
• Install and use current cloud technologies.

Course Content

Unit-1
Introduction: Cloud-definition, benefits, usage scenarios, History of Cloud Computing, Cloud Architecture,
Types of Clouds, Players in Cloud Computing, issues in Clouds
Unit-2
Types of Cloud services, Software as a Service, Platform as a Service, Infrastructure as a Service, Database
as a Service, Monitoring as a Service, Communication as services. Service Providers- Google, Amazon,
Microsoft Azure, IBM, Sales force.
Unit-3
Collaborating Using Cloud Services Email Communication over the Cloud, CRM Management, Project
Management, Event Management, Task Management, Calendar, Schedules, Word Processing, Presentation,
Spreadsheet, Databases, Desktop, Social Networks and Groupware
Unit-4
Virtualization for Cloud Need for Virtualization, Pros and cons of Virtualization, Types of Virtualizations,
System VM, Process VM, Virtual Machine monitor, Virtual machine properties, HLL VM, Hypervisors,
Xen, KVM, VMWare, Virtual Box, Hyper-V
Unit-5
Cloud Security: Infrastructure Security- Network level security, Host level security, Application-level
security, Data security, Authentication in cloud computing, Cloud security challenges.

Text Books:

Sr. Title Author Publication

1. Cloud Computing Bible Barrie Sosinsky Wil;ey
2. Cloud Computing: Concepts, Technology & Thomas Erl Prentice Hall
Architecture
3. Virtual Machines James E Smith Morgan Kaufmann

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: VI Vocational Course

Course Objective

The course covers the basic concepts and techniques of Machine Learning from both theoretical and practical
perspective. The material includes classical ML approaches as Version Spaces and Decision Trees, new
approaches as Inductive Logic Programming and Minimum Description Length Principle (MLD) as well as "hot"
topics as SVM and Clustering.

Course Code: SOS/CSE/VO603 Course Title: Machine Learning

Course Outcomes (COs):
On successful completion of this course, the student will be able to:
• Differentiate between supervised and unsupervised learning tasks.
• Appreciate the need of preprocessing, feature scaling and feature selection.
• Understand the fundamentals of classification, regression and clustering
• Implement various machine learning algorithms learnt in the course.

Course Content

Unit-1
Introduction: Basic definitions and concepts, key elements, supervised and unsupervised learning,
introduction to reinforcement learning, applications of ML
Unit-2
Preprocessing: Feature scaling, feature selection methods. dimensionality reduction (Principal Component
Analysis).
Unit-3
Regression: Linear regression with one variable, linear regression with multiple variables, gradient descent,
over-fitting, regularization. Regression evaluation metrics.
Unit-4
Classification: Decision trees, Naive Bayes classifier, logistic regression, k-nearest neighbor classifier,
perceptron, multilayer perceptron, neural networks, back-propagation algorithm, Support Vector Machine
(SVM). Classification Evaluation metrics
Unit-5
Clustering: Approaches for clustering, distance metrics, K-means clustering, hierarchical clustering

Text Books:

Sr. Title Author Publication

1. Machine Learning Mitchell, T.M McGraw Hill Education
2. An Introduction to Statistical Learning with James, G Springer
Applications in R
3. Introduction to Machine Learning Alpaydin, E. MIT

Hemvati Nandan Bahuguna Garhwal University

 B.Sc. Computer Science 4th Year Syllabus
SEMESTER: VII Core Course

Course Objective

This course is designed as the first course that introduces programming concepts using Python to Computer
Science students. The course focuses on the development of Python programming to solve problems of different
domains. It also introduces the concept of object- oriented programming

Course Code: SOS/CSE/CR701 or CH701 Course Title: Introduction to Python Programming

Course Outcomes (COs):
On successful completion of the course, students will be able to:
• Understand the basics of programming language
• Develop, document, and debug modular Python programs.
• Apply suitable programming constructs and built-in data structures to solve a problem.
• Use and apply various data objects in Python.
• Use classes and objects in application programs and handle files.

Course Content

Unit-1 Introduction to Programming

Problem solving strategies; Structure of a Python program; Syntax and semantics; Executing simple programs
in Python.
Unit-2 Creating Python Programs
Identifiers and keywords; Literals, numbers, and strings; Operators; Expressions; Input/output statements;
Defining functions; Control structures (conditional statements, loop control statements, break, continue and
pass, exit function), default arguments.
Unit-3 Built-in data structures
Mutable and immutable objects; Strings, built-in functions for string, string traversal, string operators and
operations; Lists creation, traversal, slicing and splitting operations, passing list to a function; Tuples, sets,
dictionaries and their operations.
Unit-4 Object Oriented Programming
Introduction to classes, objects and methods; Standard libraries
Unit 5 File and exception handling
File handling through libraries; Errors and exception handling.

Text Books:

Sr. Title Author Publication

1. Python Programming Taneja, S Pearson Education
2. Introduction to Computing and Problem- Balaguruswamy E. McGraw Hill Education
Solving using Python

Hemvati Nandan Bahuguna Garhwal University

 PYTHON PROGRAMMING LAB

List of Practical’s

1. Write a program to demonstrate different number datatypes in python.

2. Write a program to perform different arithmetic operations on numbers in python.
3. Write a program to create, concatenate and print a string and accessing sub-string from a given string.
4. Write a python script to print the current date in following format “Sun May 29 02:26:23 IST 2017”.
5. Write a python program to create, append and remove lists in python.
6. Write a program to demonstrate working with tuples in python.
7. Write a program to demonstrate working with dictionaries in python.
8. Write a python program to find largest of three numbers.
9. Write a python program to convert temperature to and from Celsius to Fahrenheit.
10. Write a python program to construct the following pattern using nested for loop.
11. Write a python program to print prim numbers less than 20.
12. Write a python program to define a module and import a specific function in that module to another
program.
13. Write a script named copyfile.py. This script should prompt the user for the names of two text files. The
contents of the first the second file.
14. Write a program that inputs a text file. The program should print all of the unique words in the file in
alphabetical order.
15. Write a Python class to convert an integer to a roman numeral.

Hemvati Nandan Bahuguna Garhwal University

SEMESTER: VIII Core Course

Course Objective

This course is intended to provide an introduction into the field of Data Science. Students will develop skills in
appropriate technology and basic statistical methods by completing hands-on projects focused on real-world data
and addresses the social consequences of data analysis and application

Course Code: SOS/CSE/CR801 or CH801 Course Title: Introduction to Data Science

Course Outcomes (COs):
Upon course completion, a student will be able to:
• Identify and describe the methods and techniques commonly used in data science.
• Demonstrate proficiency with the methods and techniques for obtaining, organizing, exploring, and
analyzing data.
• Recognize how data analysis, inferential statistics, modeling, machine learning, and statistical
computing can be utilized in an integrated capacity.
• Create and modify customizable tools for data analysis and visualization per the evaluation of
characteristics of the data and the nature of the analysis.
• Demonstrate the ability to clean and prepare data for analysis and assemble data from a variety of
sources.

Course Content

Unit-1
Introduction to Data Science – Evolution of Data Science – Data Science Roles – Stages in a Data Science
Project – Applications of Data Science in various fields – Data Security Issue
Unit-2
Data Collection and Data Pre-Processing Data Collection Strategies – Data Pre-Processing Overview – Data
Cleaning – Data Integration and Transformation – Data Reduction – Data Discretization.
Unit-3
Exploratory Data Analytics Descriptive Statistics – Mean, Standard Deviation, Skewness and Kurtosis – Box
Plots – Pivot Table – Heat Map – Correlation Statistics – ANOVA.
Unit-4
Model Development Simple and Multiple Regression – Model Evaluation using Visualization – Residual Plot
– Distribution Plot – Polynomial Regression and Pipelines – Measures for In-sample Evaluation – Prediction
and Decision Making.
Unit-5
Model Evaluation Generalization Error – Out-of-Sample Evaluation Metrics – Cross Validation – Overfitting
– Under Fitting and Model Selection – Prediction by using Ridge Regression – Testing Multiple Parameters
by using Grid Search

Text Books:

Sr. Title Author Publication

1. Doing Data Science Cathy O’Neil O'Reilly
2. Data Science and Big data Analytics David Dietrich EMC
3. The Intersection of IoT and Data Science Jojo Moolayil PACKT

Hemvati Nandan Bahuguna Garhwal University

 DATA SCIENCE LAB

List of Practical’s

1. R As Calculator Application
2. Descriptive Statistics In R
3. Reading And Writing Different Types of Datasets
4. Visualizations
5. Correlation And Covariance
6. Regression Model
7. Multiple Regression Model
8. Regression Model for Prediction
9. Classification Model
10. Clustering Model

Hemvati Nandan Bahuguna Garhwal University

 Discipline Specific Elective Papers – VII Semester (B.Sc. with Research) ****
&
Discipline Major Elective Papers – VII Semester (B.Sc. Honours) ****

SEMESTER: VII DSE/DME (Elective)

Course Objective
The course introduces the students to the basic concept in the field of satellite communication. This will enable the
students to know how to place a satellite in an orbit and about the earth & space segment. The satellite services like
broadcasting are also studied thoroughly.

Course Code: SOS/CSE/CE701 Course Title: Satellite Communications

Course Outcomes (COs):
After learning the course, the students should be able to:
• To prepare the student to excel in basic knowledge of satellite communication principles.
• To provide students with solid foundation in orbital mechanics and launches for the satellite
communication
• To train the students with the basic knowledge of link design of satellite with a design examples.
• To provide the better understanding of multiple access systems and earth station technology.
• To prepare the students with knowledge in satellite navigation and GPS and satellite packet
communication

Course Content
Unit-1: Communication Satellite: Orbit and Description: A Brief history of satellite Communication, satellite
Frequency Bands, Satellite Systems, Applications, Orbital Period and Velocity, effects of orbital Inclination,
Azimuth and Elevation, Coverage angle and slant Range, Eclipse, Orbital Perturbations, Placement of a Satellite in
a Geo-Stationary orbit
Unit-2: Satellite Sub-Systems: Attitude and Orbit Control system, TT&C subsystem, Attitude Control subsystem,
Power systems, Communication subsystems, Satellite Antenna Equipment. Satellite Link: Basic Transmission
Theory, System Noise Temperature and G/T ratio, Basic Link Analysis, Interference Analysis, Design of satellite
Links for a specified C/N, (With and without frequency Re-use), Link Budget.
Unit-3: Propagation Effects: Introduction, Atmospheric Absorption, Cloud Attenuation, Tropospheric and
Ionospeheric Scintillation and Low angle fading, Rain induced attenuation, rain induced cross polarization
interference. Multiple Access: Frequency Division Multiple Access (FDMA) - Intermodulation, Calculation of
C/N, Time Division Multiple Access (TDMA) -Frame Structure, Burst Structure, Satellite switched TDMA
Unit-4: Earth Station Technology: Transmitters, Receivers, Antennas, Tracking Systems, Terrestrial Interface,
Power Test Methods, Lower Orbit Considerations. Satellite Navigation and Global Positioning Systems: Radio and
Satellite Navigation, GPS Position Location Principles, GPS Receivers, GPS C/A Code Accuracy
Unit-5: Satellite Packet Communications: Message Transmission by FDMA: M/G/1 Queue, Message
Transmission by TDMA, PURE ALOHA-Satellite Packet Switching, Slotted Aloha, Packet Reservation, Tree
Algorithm.

Recommended Books

Sr. Title Author Publication

1. Satellite Communications Timothy Pratt Wiley
2. Satellite Communications Engineering L. Pritchand Pearson
3. 3Digital Satellite Communications T. Ha McGraw
SEMESTER: VII DSE/DME (Elective)

Course Objective
This course introduces students to the fundamentals of information retrieval extending into image retrieval. It lays
the theoretical foundation of various essential concepts related to image searches, together with examples of natural
and texture image types. It will provide an insight to content-based image retrieval, understanding of the
technologies, and solutions of content-based image retrieval.

Course Code: SOS/CSE/CE702 Course Title: Information and Image Retrieval

Course Outcomes (COs):
After learning the course, the students should be able to:
• On the successful completion of the course, the student would be able to:
• Understand the concept of information retrieval and the information retrieval models.
• Understand the working of Text based and content-based image retrieval systems.
• Identify and evaluate the use of content-based features in indexing and retrieval of various types of media
content
• Extract different visual features from images
• Understand indexing and the semantics of visual data
• Understand query specification and evaluate the retrieval

Course Content
Unit-1: An example information retrieval problem, the extended Boolean model versus ranked retrieval, the term
vocabulary and postings lists: Tokenization, stop words, Normalization (equivalence classing of terms), Stemming
and lemmatization, term weighting model: Inverse document frequency, Information retrieval system evaluation
Unit-2: CBIR and feature extraction: Image Retrieval: Multimedia Information retrieval, Text Based Image
Retrieval (TBIR), Content Based Image Retrieval (CBIR), Hybrid systems. Architecture of a typical CBIR system,
Low-level features of an image: Color – color space, color moments, color histogram, color coherence vector
(CCV), color correlogram, invariant color features. Texture – Tamura features, coarseness, contrast, SAR Model,
Wavelet transform feature. Shape- Moment invariants, turning angles, Fourier descriptors.
Unit-3: Similarity measures and Performance evaluation: Similarity measures used in content-based image
retrieval: Minkowski-form distance, Mahalanobis distance, Canberra distance, Earth Mover distance, Quadratic
form distance Performance evaluation used in content-based image retrieval: user Comparison, precision and
recall, P-R graph, Average Precision, F-measure, Average Normalized Modified Retrieval Rank
Unit-4: CBIR systems: QBIC: Query by Image Content, VIR, VisualSEEK, WebSEEK, NeTRA, MARS:
Multimedia Analysis and Retrieval System, SIMPLIcity.

Recommended Books
Sr. Title Author Publication
1. Introduction to Information Retrieval C. Manning Cambridge
2. Content-Based Image Retrieval: Ideas, Influences, and Vipin Tyagi Springer
Current Trends
SEMESTER: VII DSE/DME (Elective)

Course Objective

The objective of this course is to introduce students to deep learning algorithms and their applications in order to
solve real problems.

Course Code: SOS/CSE/CE703 Course Title: Deep Learning

Course Outcomes (COs):
After learning the course, the students should be able to:
• Describe the feed-forward and deep networks.
• Design single and multi-layer feed-forward deep networks and tune various hyper-parameters.
• Implement deep neural networks to solve a problem
• Analyze performance of deep networks.
• Use pre-trained models to solve a problem.

Course Content
Unit-1: Introduction to neural networks: Artificial neurons, perceptron, computational models of neurons,
Structure of neural networks, Multilayer feedforward neural networks (MLFFNN), Backpropagation learning,
Empirical risk minimization, bias-variance trade-off, Regularization, output units: linear, SoftMax.
Unit-2: Deep neural networks: Difficulty of training DNNs, Greedy layer wise training, Optimization for training
DNN’s, Newer optimization methods for neural networks (AdaGrad, RMSProp, Adam), Regularization methods
(dropout, drop connect, batch normalization).
Unit-3: Convolution neural networks (CNNs): Introduction to CNN - convolution, pooling, Deep CNNs - LeNet,
AlexNet. Training CNNs, weights initialization, batch normalization, hyperparameter optimization, Understanding
and visualizing CNNs, using a pre trained convnet
Unit-4: Recurrent neural networks (RNNs): Sequence modeling using RNNs, Backpropagation through time,
LongShort Term Memory (LSTM), Bidirectional RNN, Bidirectional LSTM

Recommended Books
Sr. Title Author Publication
1. Deep Learning Yodhua Bengio MIT
2. Deep Learning with python Francois Chollet Meaning
SEMESTER: VII DSE/DME (Elective)

Course Objective

This course aims to introduce data mining techniques and their application on real-life datasets. The students will
learn to pre-process the dataset and make it ready for application of data mining techniques. The course will focus
on three main techniques of data mining i.e., Classification, Clustering and Association Rule Mining. Different
algorithms for these techniques will be discussed along with appropriate evaluation metrics to judge the performance
of the results delivered.

Course Code: SOS/CSE/CE704 Course Title: Data Mining-I

Course Outcomes (COs):
After learning the course, the students should be able to:
• Pre-process the data for subsequent data mining tasks
• Apply a suitable classification algorithm to train the classifier and evaluate its performance.
• Apply appropriate clustering algorithm to cluster the data and evaluate clustering quality
• Use association rule mining algorithms and generate frequent item-sets and association rules

Course Content
Unit-1: Introduction to Data Mining: Motivation and challenges for data mining, Types of data mining tasks,
Applications of data mining, Data measurements, Data quality, Supervised vs. unsupervised techniques
Unit-2: Data Pre-processing: Data aggregation, sampling, dimensionality reduction, feature subset selection,
feature creation, variable transformation.
Unit-3: Cluster Analysis: Basic concepts of clustering, measure of similarity, types of clusters and clustering
methods, K-means algorithm, measures for cluster validation, determine optimal number of clusters
Unit-4: Association rule mining: Transaction data-set, frequent itemset, support measure, rule generation,
confidence of association rule, Apriori algorithm, Apriori principle
Unit-5: Classification: Naive Bayes classifier, Nearest Neighbour classifier, decision tree, overfitting, confusion
matrix, evaluation metrics and model evaluation.

Recommended Books
Sr. Title Author Publication
1. Introduction to Data Mining Tan P.N Pearson
2. Data Mining: Concepts and Techniques Han J Morgan
3. Data Mining and Machine Learning: Fundamental Zaki M. Cambridge
Concepts and Algorithms
SEMESTER: VII DSE/DME (Elective)

Course Objective

This course is designed to provide exposure to more sophisticated algorithms for some tractable problems, some
advanced topics in algorithms such as NP Completeness and how to handle NP hard problems in practice.

Course Code: SOS/CSE/CE705 Course Title: Advanced Algorithms

Course Outcomes (COs):
After learning the course, the students should be able to:
• Understand and develop more sophisticated algorithms using some of the known design techniques.
• Identify NP hard problems.
• Use polynomial time reductions to prove NP hardness of problems.
• Design approximation algorithms for NP hard problems and find their approximation ratio.

Course Content
Unit-1: More applications of Divide and Conquer, Greedy and Dynamic Programming approaches: Counting
Inversions, Closest pair of points, Integer Multiplication, Huffman Code, Segmented Least Squares etc.
Unit-2: Network Flows: Ford Fulkerson algorithm for max flow problem.
Unit-3: Backtracking: Constructing All Subsets, Constructing All Permutations, Constructing all paths in a graph
Unit-4: Polynomial time reductions via gadgets: SAT and 3-SAT problems; Reducing 3-SAT to Independent set,
Clique and Vertex cover. Proving NP completeness: Circuit satisfiability, 3-SAT, Sequencing Problems, Graph
coloring, Subset sum.
Unit-5: Introduction to Approximation Algorithms: Definition, Concept of approximation factor, Bounding the
optimal solution, concept of tight example. Combinatorial Approximation Algorithms: Set cover, Minimizing
makespan, k-center. LP based Approximation Algorithms: Approximation algorithms for Vertex cover/Set cover
via LP rounding

Recommended Books
Sr. Title Author Publication
1. Algorithm Design T.H Cormen Prentice Hall of India
2. The Design of Approximation Algorithms D.P. Williamson Cambridge
 Discipline Specific Elective Papers – VIII Semester (B.Sc. with Research) ****
&
Discipline Major Elective Papers – VIII Semester (B.Sc. Honours) ****

SEMESTER: VIII DSE/DME (Elective)

Course Objective

Internet of Things plays an important role in connecting the things i.e., variety of devices through the Internet. The
IoT has emerged as a cutting-edge technology with applications in manufacturing, healthcare, Agriculture, transport,
mining, smart cities and many more. This course covers the fundamentals of IoT with its architecture, protocols and
Applications. It also covers the overview and programming of two widely used IoT platforms Arduino and
Raspberry Pi

Course Code: SOS/CSE/CE801 Course Title: IoT and its Application

Course Outcomes (COs):
After learning the course, the students should be able to:
• Demonstrate the architecture and functioning of IoT systems including the sensors and
microcontrollers with their interfacing and software need considering application areas.
• Diagnose the various IoT protocols with detailing of their elements and overall functioning within
IoT systems for efficient communication
• Develop the software components of IoT system using Arduino/Raspberry Pi Programming.
• Design an IoT system to take the benefit of the Clouds for computing and storage considering
security issues.

Course Content
Unit-1: Introduction to Internet of Things: Application areas of IoT, Characteristics of IoT, Things in IoT, IoT
stack, Enabling technologies, IoT challenges, IoT levels, IoT and cyber physical system, IoT and WSN
Unit-2: Sensors, Microcontrollers, and Their Interfacing: Sensor interfacing, Types of sensors, Controlling
sensors, Microcontrollers, ARM
Unit-3: Protocols for IoT: Messaging protocols, Transport protocols, IPv4, IPv6, URI, Cloud for IoT: IoT and
cloud, Fog computing, Security in cloud, Case study
Unit-4: Application Building with IoT: Various application of IoT: Food, Healthcare, Lavatory maintenance,
Water quality, Warehouse, Retail, Driver Assistance, Collision impact
Unit-5: Arduino and Raspberry Pi: Arduino: Architecture, Programming and Application Raspberry Pi:
Architecture, Programming and Application, IoT Security: Various security issues and need, architecture,
requirement, challenges and algorithms

Recommended Books
Sr. Title Author Publication
1. Internet of Things Vasudevans and Sundaram Wiley
2. IoT Fundamentals D. Hence Cisco Press
3. Internet of Things with ARDUINO and BOLT Ashwin Pajankar BPB
SEMESTER: VIII DSE/DME (Elective)

Course Objective

The course introduces the students to distributed algorithms in synchronous and asynchronous network models. The
course would give the students hands-on practice to write programs for distributed algorithms using Remote
Procedure Call (RPC) or Message Passing Interface (MPI)

Course Code: SOS/CSE/CE802 Course Title: Distributed Algorithms

Course Outcomes (COs):
After learning the course, the students should be able to:
• Describe Network Models for distributed Algorithms
• Develop elementary synchronous distributed algorithms
• Develop elementary asynchronous distributed algorithms Syllabus

Course Content
Unit-1: System Model/Network Models: Synchronous Network Model, Asynchronous System Model,
Asynchronous Network Model
Unit-2: Synchronous Network Algorithms: Distributed problems in Synchronous Networks such as Leader
Election in a Synchronous Ring. Algorithms in General Synchronous Networks (for example Leader Election in
a General Network, Breadth-First Search, Maximal Independent Set etc). Problems of reaching consensus in a
distributed network namely, distributed consensus with link failures coordinated Attack Problem (Deterministic
Version and Randomized Version) and distributed consensus with link failures (Stopping failures, Introduction to
Byzantine Failures). More Consensus Problems such as the k-Agreement etc.
Unit-3: Asynchronous Network Algorithms: Basic Asynchronous Network Algorithms such as Leader Election
in a Ring, Leader Election in an Arbitrary Network etc. Logical Time Asynchronous Networks, Adding Logical
Time to Asynchronous Algorithms, Applications such as Banking System etc. Basics of Network Resource
Allocation (mutual Exclusion, resource allocation etc) and Basics of Asynchronous Networks with Process
Failures such as k-Agreement etc.

Recommended Books
Sr. Title Author Publication
1. Distributed Algorithms Lynch, N Morgan Kaufmann Publishers
2. Elements of Distributed Computing Garg, V Wiley
SEMESTER: VIII DSE/DME (Elective)

Course Objective

The objective of this course is to learn about creativity and imagination for making them self- motivated artists with
strength in creative vision and concept development

Course Code: SOS/CSE/CE803 Course Title: Multimedia and its Applications

Course Outcomes (COs):
After learning the course, the students should be able to:
• understand multimedia with the fundamentals of Art and Design
• understand Graphic Design for creating effective visual communication and web Design for global
communication through a website

Course Content
Unit-1: Introduction: Definition Multimedia and uses, applications, Hardware and Software requirements,
multimedia presentation and authoring tools, LAN and multimedia, multimedia servers and database: vector
graphics, 3-D graphics program, animation techniques, shading, anti-aliasing, morphing: video on demand.
Unit-2: Text and Graphics: Uses of text in multimedia, families and faces of fonts, outline fonts, bitmap fonts,
international characters sets and hypertext digital font techniques. Graphics- Introduction, types, color and color
models, color palettes, vector drawing, 3-D drawing and rendering, making still images, editing and capturing
images.
Unit-3: Audio and Video: Digital representation of sound, MIDI audio, MIDI vs. Digital Audio, Audio file
formats, adding sound to your multimedia project, Audio software and hardware, Video basic, how video works,
broadcast video standard, Analog video, Digital video, shooting and editing video, video compression and file
format.
Unit-4: Animation and multimedia authoring: Introduction, principles, types and uses, cell animation, computer
animations, morphing, Animation software compression techniques: need and types of compression- lossy and
lossless, CODECs, authoring basic, types of authoring tools.
Unit-5: Multimedia on the web: Introduction, Bandwidth, text on the web- Dynamic and embedded font
technology, Audio and video on the web, buffering and streaming, webcasting, video conferencing

Recommended Books
Sr. Title Author Publication
1. Multimedia: Making It Work Tay Vaughan McGraw Hill
2. Computer Graphics and Multimedia A. P. Godse Technical Publication
3. Sound and Video Lozano PHI
SEMESTER: VIII DSE/DME (Elective)

Course Objective

The course introduces the students to the important supervised and unsupervised learning techniques. Students will
learn about the importance of ensemble methods, cluster analysis, anomaly detection and their applicability in
mining patterns in real applications. At the end students will be exposed to two advanced topics: text mining and
time-series mining. Students will use the learned topics in solving real applications using Open-source software’s.

Course Code: SOS/CSE/CE804 Course Title: Data Mining-II

Course Outcomes (COs):
After learning the course, the students should be able to:
• Differentiate between partition-based, density-based and hierarchical clustering
• Build ensemble models to improve predictive performance of the classifier
• Identify anomalies and outliers using supervised and unsupervised techniques
• Analyze time-series data and extract patterns from the stamped data
• Mine textual data and do topic modelling.

Course Content
Unit-1: Clustering: Partitioning Methods, Hierarchical Methods, Density-Based Methods, Comparison of
different methods
Unit-2: Ensemble Methods: Need of ensemble, Random Forests, Bagging and Boosting.
Unit-3: Anomaly Detection: Outliers and Outlier Analysis, Outlier Detection Methods, Statistical Approaches,
Proximity-based and density-based outlier detection, Clustering-based approaches
Unit-4: Mining Text Data: Document Preparation and Similarity, Clustering Methods for Text, Topic Modeling
Unit-5: Stream Mining: Time series basics, Date Ranges, Frequencies, and Shifting, Resampling and moving
windows functions, Decay function, Clustering stamped data: STREAM and CluStream

Recommended Books
Sr. Title Author Publication
1. Introduction to Data Mining Tan P.N. Pearson
2. Data Mining: The Textbook, Agarwal C. Springer
3. Data Mining: Introductory and Advanced Topics Dunham M. Pearson
SEMESTER: VIII DSE/DME (Elective)

Course Objective

The course introduces basic graph theory and draws distinction between graph as an abstract structure and real-life
situation modeled as network. This course aims to expose the students to the strengths and capabilities of network
analysis and their applications through the use of open-source software’s.

Course Code: SOS/CSE/CE805 Course Title: Social Network Analysis

Course Outcomes (COs):
After learning the course, the students should be able to:
• Model real life situation as networks
• Identify and apply quantitative network measures to characterize social networks at the local and global
level
• Generate synthetic networks that satisfy properties of real-world networks
• Discover, analyze and evaluate the intrinsic community structure of networks
• Model an information diffusion process for predictive analysis of networks

Course Content
Unit-1: Introduction to Social Network Analysis: Graph theory, random walk, degree distribution, mapping of
real-world situation into networks and applications of social network analysis, types of networks
Unit-2: Network Measures: Centrality measures, Page Rank, Hubs and Authority, Assortativity, Transitivity and
Reciprocity, Similarity and Structural Equivalence
Unit-3: Network Models: Properties of Real-World Networks, Random Network Model, Small World Network
Model, Preferential Attachment Model
Unit-4: Community Structure in Networks: Types of Communities, Community Detection algorithms and
evaluation of communities obtained
Unit-5: Information Diffusion in social media: Information Cascades, Diffusion of Innovations, Basic Epidemic
Models

Recommended Books
Sr. Title Author Publication
1. Social Network Analysis Chakraborty T Wiley
2. Social Media Mining: An Introduction Zafarani R Cambridge
3. Network Science Barabási A. L. Cambridge