Course Structure & Syllabus for

[Link]
Computer Science & Engineering –
ARTIFICIAL INTELLIGENCE
(2020 Admission Batch)

GITA AUTONOMOUS COLLEGE

 Affiliated to BPUT, Odisha

GITA AUTONOMOUS COLLEGE,

BHUBANESWAR
Affiliated to BPUT, Odisha

Vision
To foster prosperity through technological development by means of
quality education, innovation and collaborative research and emerge
as a premier technical institution in India.

Mission

1. To impart quality professional education to students from around

the country, so as to nurture innovations, technological advances,
discipline and moral ethics.
2. To provide broad based education where students are urged to
develop their professional skills.
3. To draw best expertise in science, technology and management to
impart overall training to students in visualizing, synthesizing and
executing projects.
4. To incubate a spirit of entrepreneurship and innovation in our
students.
5. To undertake sponsored research and provide consultancy services
industrial, educational and other relevant areas.
6. To promote healthy practices such as community service,
Extension Activities and Innovative Project for the benefit of the
society.
 COMPUTER SCIENCE & ENGINEERING
DEPARTMENT
GITA AUTONOMOUS COLLEGE, BHUBANESWAR
Affiliated to BPUT, Odisha

Vision
To empower students of Computer Science & Technology Department to be
technologically adapt, innovative, self-motivated and responsible global citizens
possessing human values and enable them to contribute in industrial development
innovation, high quality technical education and research with the ever-changing world.

Mission

The Department of Computer Science and Engineering strives to prepare the students:

• For a challenging professional career and nurture their entrepreneurship ability by

grooming their leadership skills and innovative ability, thereby enabling them to serve
the engineering profession and society.

• To accomplish higher studies by providing conducive, teaching - leaning, research

environment.

Program Educational Objectives (PEOs)

PEO 1: The graduates will utilize their expertise in engineering to solve industrial and
technological problems.

PEO 2: Graduates will be innovator and professionals in technology deployment and

system implementation.

PEO 3: Graduates will function in their profession with their social awareness and
responsibility.

PEO 4: Graduate will interact with their peers in industry and society as engineering
professionals and leaders.
 PEO 5: Graduates will succeed in achieving innovative kills in the field of research and
computer application.

Program Specific Outcomes (PSOs)

PSO 1: The graduates will have the ability to design, develop and innovate software
product or process in a systematic way by applying algorithm design, artificial
intelligence, soft computing and programming skills.

PSO 2: The graduate will have the ability to take up higher studies, collaborative
research and entrepreneurship in the modern computing environment.

PSO3: Graduate will have the ability to achieve additional expertise through add-on
programs in machine learning, deep learning, IoTetc and life long learning.

List of Program Outcomes(POs)

PO1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and Computer Science & Engineering to the solution of complex
engineering problems.

PO2. Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.

PO3. Design/development of solutions: Design solutions for complex engineering

problems and design system components or processes that meet the specified needs
with appropriate consideration for the public health and safety, and the cultural,
societal, and environmental considerations.

PO4. Conduct investigations of complex problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid conclusions.

PO5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modelling to complex
engineering activities with an understanding of the limitations.
PO6. The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.

PO7. Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.

PO8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.

PO9. Individual and team work: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.

PO10. Communication: Communicate effectively on complex engineering activities with

the Engineering community and with society at large, such as, being able to
comprehend and write effective reports and design documentation, make effective
presentations, and give and receive clear instructions.

PO11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects and in multidisciplinary
environments.

PO12. Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
 COURSE STRUCTURE
Credit Break-up Semester-wise
Semester
Category Total
1st 2nd 3rd 4th 5th 6th 7th 8th
HS / MS
Humanities and Social
3 2 4 2 3 14
Sciences Including
Management Courses
BS
(Basic Science 7 7 3 3 20
Courses)
ES
(Engineering Science 8 16 4 28
Courses)
PC
(Professional Core 9 13 13 9 44
Courses)
PE
(Professional Elective
Courses Relevant to 3 3 6 6 18
Chosen
Specialization/Branch)
OE
(Open Electives from
Other Technical 3 3 9 15
and/or Emerging
Subjects)
Project/Seminar
/Internship * 1 2 2 6 18 29
*4-6 Weeks
MC (Mandatory
0 0 0 0 0 0 0 0 0
Courses)
Total 18 25 20 22 21 20 24 18 168
HS (HUMANITIES AND SOCIAL-SCIENCES INCLUDING MANAGEMENT COURSES)
S. No. Course Code Course Title L-T-P Credit Semester

Theory
1 20BTTHS101 Communicative English 2-0-0 2 1st
2 Business Communication and
20BTTHS202 3-0-0 2 2nd
Life Skills
3 20BTTHS403 Organisational Behaviour 2-0-0 2 4th
4 Engineering Economics and
20BTTHS304 2-0-0 2 3rd
Costing
5 20BTTHS705 Entrepreneurship Development 2-0-0 3 7th
6 20BTTHS306 Universal Human Value 2-0-0 2 3rd
Practical
1 20BTPHS101 English Language Lab 0-0-2 1 1st
Total Credit 14

BS (BASIC SCIENCE COURSES)

S. Course Code Course Title
L-T-P Credit Semester
No.

Theory
1 20BTTBS101 3-0-0 3 1st
Engineering Mathematics-I
2 20BTTBS102 3-0-0 3 1st/2nd
/ Engineering Physics
20BTTBS202
3 20BTTBS103 1st/2nd
/ Engineering Chemistry 3-0-0 3
20BTTBS203
4 20BTTBS204 Engineering Mathematics-II 3-0-0 3 2nd
5 20BTTBS305 Engineering Mathematics-III 3-0-0 3 3rd
6 20BTTBS406 Discrete Mathematical Structure 3-0-0 3 4th

Practical
1 20BTPBS101
/ Engineering Physics Lab 0-0-2 1 1st/2nd
20BTPBS201
2 20BTPBS102
/ Engineering Chemistry Lab 0-0-2 1 1st/2nd
20BTPBS202
Total Credits 20
ES (ENGINEERING SCIENCE COURSES)
S. No. Course Code Course Title L-T-P Credit Semester

Theory
20BTTES101
1 1st /
/ Basic Electrical Engineering 3-0-0 2
2nd
20BTTES201
20BTTES102
2 1st /
/ Basic Electronics Engineering 3-0-0 2
2nd
20BTTES202
20BTTES103
3 1st /
/ Basic Mechanical Engineering 3-0-0 2
2nd
20BTTES203
20BTTES104
4 1st /
/ Basic Civil Engineering 3-0-0 2
2nd
20BTTES204
5 Programming for Problem Solving
20BTTES205 2-0-0 3 2nd
using C
6 20BTTES206 Engineering Mechanics 3-0-0 3 2nd
7 20BTTES307 Data Structure Using ‘C’ 3-0-0 3 3rd
Practical
1 20BTPES101 /
Basic Electrical Engineering Lab 0-0-2 1 1st/ 2nd
20BTPES201
2 20BTPES102 /
Basic Electronics Engineering Lab 0-0-2 1 1st/ 2nd
20BTPES202
3 20BTPES103 /
Basic Mechanical Engineering Lab 0-0-2 1 1st/ 2nd
20BTPES203
4 20BTPES104 /
Basic Civil Engineering Lab 0-0-2 1 1st/ 2nd
20BTPES204
5 20BTPES105 / Engineering Graphics & Design
0-0-2 2 1st/ 2nd
20BTPES205 Lab
6 20BTPES106 /
Workshop Practice Lab 0-0-2 2 1st/ 2nd
20BTPES206
7 Programming for Problem Solving
20BTPES207 0-0-2 2 2nd
using C Lab
8 20BTPES308 Data Structure Lab 0-0-2 1 3rd
Total Credits 28

PC (PROFESSIONAL CORE COURSES)

S. Course Code Course Title
L-T-P Credit Semester
No.
Theory
1 Object Oriented Programming
20BTCAITPC301 3-0-0 3 3rd
Using JAVA
2 Computer Organization &
20BTCAITPC302 3-0-0 3 3rd
Architecture
 3 20BTCAITPC403 Design & Analysis of Algorithms 3-0-0 3 4th
4 20BTCAITPC404 Data Base Engineering 3-0-0 3 4th
5 20BTCAITPC405 Python Programming 3-0-0 3 4th
6 20BTCAITPC506 Operating System 3-0-0 3 5th

7 Formal Language & Automata 3-0-0 3 5th

20BTCAITPC507
Theory
8 20BTCAITPC508 Advanced Python Programming 3-0-0 3 5th
9 20BTCAITPC609 Software Engineering 3-0-0 3 6th
10 20BTCAITPC610 Compiler Design 3-0-0 3 6th
Practical
1 Object Oriented Programming 0-0-2 1
20BTCAIPPC301 3rd
Using JAVA Lab
2 Computer Organization & 0-0-2 1
20BTCAIPPC302 3rd
Architecture Lab
3 20BTCAIPPC303 Employability Skill-I 0-0-3 1 3rd

4 Design & Analysis of Algorithms 4th

20BTCAIPPC404 0-0-2 1
Lab
5 20BTCAIPPC405 Database Engineering Lab 0-0-2 1 4th
6 20BTCAIPPC406 Programming in Python Lab 0-0-2 1 4th
7 20BTCAIPPC407 Employability Skill-II 0-0-3 1 4th
8 20BTCAIPPC508 Operating System lab 0-0-2 1 5th
9 20BTCAIPPC509 Advanced Python Lab 0-0-2 1 5th
10 20BTCAIPPC510 Web Technology Lab 0-0-2 1 5th
11 20BTCAIPPC511 Employability Skill-III 0-0-3 1 5th
12 20BTCAIPPC612 Software Engineering Lab 0-0-2 1 6th
13 20BTCAIPPC613 Compiler Design Lab 0-0-2 1 6th
14 Java & Python Programming
20BTCAIPPC614 0-0-2 1 6th
Practice Lab
Total Credits 44

PE (PROFESSIONAL ELECTIVE COURSES RELEVANT TO CHOSEN BRANCH)

S. Course Code Course Title (Theory)
L-T-P Credit Semester
No.

1 20BTCAITPE401 Advanced Computer Architecture

2 20BTCAITPE402 Graph Theory 3-0-0 3 4th
3 20BTCAITPE403 Digital Electronics
4 20BTCAITPE504 Machine Learning
5 20BTCAITPE505 High Performance Computing 3-0-0 3 5th
6 20BTCAITPE506 Cyber security and Law
7 20BTCAITPE607 Artificial Intelligence
8 20BTCAITPE608 Blockchain Technology 3-0-0 3 6th
9 20BTCAITPE609 Bioinformatics
10 20BTCAITPE610 Cloud Computing
11 20BTCAITPE611 Database Security 3-0-0 3 6th
12 20BTCAITPE612 Wireless Sensor Network
13 20BTCAITPE713 Cryptography & Network Security
14 20BTCAITPE714 Web Services and SOA 3-0-0 3 7th
15 20BTCAITPE715 Professional Practice, Law and Ethics
16 20BTCAITPE716 Soft Computing
17 20BTCAITPE717 Natural Language Processing 3-0-0 3 7th
18 20BTCAITPE718 Software Testing
Total Credits 18

OE (OPEN ELECTIVES COURSES FROM OTHER TECHNICAL BRANCHES)

S. No. Course Code Course Title (Theory) L-T-P Credit Semester
1 20BTCAITOE501 Micro Processor and Micro Controller
2 20BTCAITOE502 Statistical inference 3-0-0 3 5th
3 20BTCAITOE503 Digital Image Processing
20BTCAITOE604 Data Communication & Computer
4
Networks
3-0-0 3 6th
5 20BTCAITOE605 Computer Graphics
6 20BTCAITOE606 Human Computer Interface
7 20BTCAITOE707 IoT
8 20BTCAITOE708 Data Analytics using Python 3-0-0 3 7th
9 20BTCAITOE709 Robotics
10 20BTCAITOE710 Deep Learning
11 20BTCAITOE711 Ethical Hacking 3-0-0 3 7th
12 20BTCAITOE712 Data Mining & Data Warehousing
13 20BTCAITOE713 Real Time System
14 20BTCAITOE714 Cloud Security 3-0-0 3 7th
15 20BTCAITOE715 Digital Signal Processing
Total Credits 15

PSI(Project/Seminar/Internship *)
S. No. Course Code Course Title (Practicals) L-T-P Credit Semester
1 20BTCAIPSI401 Mini Project I 0-0-2 1 4th
2 20BTCAIPSI502 Evaluation of Summer Internship-I 0-0-2 1 5th
3 20BTCAIPSI503 Mini Project II 0-0-2 1 5th
4 20BTCAIPSI604 Seminar-I 0-0-2 2 6th
5 20BTCAIPSI705 Minor PROJECT 0-0-6 3 7th
6 20BTCAIPSI706 Evaluation of Summer Internship-II 0-0-2 1 7th
7 20BTCAIPSI707 Industrial Lecture & Visit 0-0-2 1 7th
8 20BTCAIPSI708 Grand Viva 0-0-2 1 7th
9 20BTCAIPSI809 Internship(Evaluation by External
8 8th
Examiner)
10 20BTCAIPSI810 Grand Viva(Evaluation by External 2 8th
 Examiner)
11 20BTCAIPSI811 Major PROJECT(Evaluation by External 8 8th
Examiner)
Total Credits 29

MC (MANDATORY COURSES)
THEORY
S. No. Course Code Course Title L-T-P Credit Semester

0 3rd
1 20BTTMC301 Environmental Science
2 0 4th
20BTTMC402 Constitution of India
3 Essence of Indian Knowledge 0 6th
20BTTMC603
Tradition
Practicals

S. No. Course Code Course Title L-T-P Credit Semester

0 1st
1 20BTPMC101 Induction Training (21 Days)
0 2nd
2 20BTPMC202 NSS / NCC / Yoga
Total Credits 0
 First Semester
Theory
Sl. Course
Category Course Title L-T-P Credit
No. Code
1 BS 20BTTBS101 Engineering Mathematics-I 3-0-0 3
20BTTBS102 Engineering Physics
2 BS / / 3-0-0 3
20BTTBS103 Engineering Chemistry
20BTTES101 Basic Electrical Engineering
3 ES / / 3-0-0 2
20BTTES102 Basic Electronics Engineering
20BTTES103 Basic Mechanical Engineering
4 ES / / 3-0-0 2
20BTTES104 Basic Civil Engineering
5 HS 20BTTHS101 Communicative English 2-0-0 2
6 MC 20BTPMC101 Induction Training (21 Days) 0
Total Credit (Theory) 12
Practical
20BTPBS101 Engineering Physics Lab
1 BS / / 0-0-2 1
20BTPBS102 Engineering Chemistry Lab
20BTPES101 Basic Electrical Engineering Lab
2 ES / / 0-0-2 1
20BTPES102 Basic Electronics Engineering
20BTPES103 Basic Mechanical Engineering Lab
3 ES / / 0-0-2 1
20BTPES104 Basic Civil Engineering
20BTPES105 Engineering Graphics & Design Lab
4 ES / / 0-0-2 2
20BTPES106 Workshop Practice Lab
5 HS 20BTPHS101 English Language Lab 0-0-2 1
Total Credit (Practical) 6
Total Semester Credit 18
 Second Semester
Theory
Sl.
Category Course Code Course Title L-T-P Credit
No.
1 BS 20BTTBS204 Engineering Mathematics-II 3-0-0 3
20BTTBS203 Engineering Chemistry
2 BS / / 3-0-0 3
20BTTBS202 Engineering Physics
20BTTES202 Basic Electronics Engineering
3 ES / / 3-0-0 2
20BTTES201 Basic Electrical Engineering
20BTTES204 Basic Civil Engineering
4 ES / / 3-0-0 2
20BTTES203 Basic Mechanical Engineering
5 ES 20BTTES206 Engineering Mechanics 2-0-0 3
Programming for Problem Solving
6 ES 20BTTES205 3-0-0 3
using C
Business Communication and Life
7 HS 20BTTHS202 3-0-0 2
Skills
8 MC 20BTPMC202 NSS / NCC / Yoga 0
Total Credit (Theory) 18
Practical
Engineering Chemistry Lab
20BTTBS203/
1 BS / 0-0-2 1
20BTTBS202
Engineering Physics Lab
20BTPES202 Basic Electronics Engineering Lab
2 ES / / 0-0-2 1
20BTPES201 Basic Electrical Engineering Lab
20BTPES204 Basic Civil Engineering Lab
3 ES / / 0-0-2 1
20BTPES203 Basic Mechanical Engineering Lab
20BTPES206 Workshop Practice Lab
4 ES / / 0-0-2 2
20BTPES205 Engineering Graphics & Design Lab
P Programming for Problem Solving using
5 ES 20BTPES207 0-0-2 2
C Lab
Total Credit (Practical) 7
Total Semester Credit 25
SUMMER INTERNSHIP TRAINING for 30 Days
 Third Semester
Theory
Sl.
No Category Course Code Course Title L-T-P Credit
.
1 BS 20BTTBS305 Engineering Mathematics-III 3-0-0 3
2 HS 20BTTHS304 Engineering Economics and Costing 3-0-0 2
3 HS 20BTTHS306 Universal Human Value 2-0-0 2
4 ES 20BTTES307 Data Structure Using ‘C’ 2-0-0 3
Object Oriented Programming Using
5 PC 20BTCAITPC301 3-0-0 3
JAVA
6 PC 20BTCAITPC302 Computer Organization & Architecture 3-0-0 3
7 MC 20BTTMC301 Environmental Science 2-0-0 0
Total Credit (Theory) 16
Practical
1 ES 20BTPES308 Data Structure Lab 0-0-2 1
Object Oriented Programming Using
2 PC 20BTCAIPPC301 0-0-2 1
JAVA Lab
Computer Organization & Architecture
3 PC 20BTCAIPPC302 0-0-2 1
Lab
4 PC 20BTCAIPPC303 Employability Skill-I 0-0-3 1
Total Credit (Practical) 4
Total Semester Credit 20
 Fourth Semester
Theory
Sl.
Category Course Code Course Title L-T-P Credit
No.
1 BS 20BTTBS406 Discrete Mathematical Structure 3-0-0 3
2 HS 20BTTHS403 Organisational Behaviour 2-0-0 2
3 PC 20BTCAITPC403 Design & Analysis of Algorithms 3-0-0 3
4 PC 20BTCAITPC404 Data Base Engineering 3-0-0 3
5 PC 20BTCAITPC405 Python Programming 3-0-0 3
20BTCAITPE401 Advanced Computer Architecture
6 PE 20BTCAITPE402 Graph Theory 3-0-0 3
20BTCAITPE403 Digital Electronics
7 MC 20BTTMC402 Constitution of India 1-0-0 0
Total Credit (Theory) 17
Practical
1 PC 20BTCAIPPC404 Design & Analysis of Algorithms Lab 0-0-2 1
2 PC 20BTCAIPPC405 Database Engineering Lab 0-0-2 1
3 PC 20BTCAIPPC406 Programming in Python Lab 0-0-2 1
4 PC 20BTCAIPPC407 Employability Skill-II 0-0-3 1
5 PSI 20BTCAIPSI401 Mini Project I 0-0-2 1
Total Credit (Practical) 5
Total Semester Credit 22
SUMMER INTERNSHIP TRAINING for 45 Days
*Mandatory Non-Credit Courses (MC) result will be reflected with Pass (P) / Fail (F) grade. Thus the
grade obtained will not be affecting the grade point average. However, it shall appear on the grade
sheet as per AICTE rule.

Fifth Semester
Theory
Sl.
Category Course Code Course Title L-T-P Credit
No.
1 PC 20BTCAITPC506 Operating System 3-0-0 3
Formal Language & Automata
2 PC 20BTCAITPC507 3-0-0 3
Theory
3 PC 20BTCAITPC508 Advanced Python Programming 3-0-0 3
20BTCAITPE504 Machine Learning 3-0-0
4 PE 20BTCAITPE505 High Performance Computing 3-0-0 3
20BTCAITPE506 Cyber security and Law 3-0-0
Micro Processor and Micro
20BTCAITOE501 3-0-0
Controller
5 OE 20BTCAITOE502 Statistical inferencing 3-0-0 3
20BTCAITOE503 Digital Image Processing 3-0-0
Total Credit (Theory) 15
 Practical
1 PC 20BTCAIPPC508 Operating System lab 0-0-2 1
2 PC 20BTCAIPPC509 Advanced Python Lab 0-0-2 1
3 PC 20BTCAIPPC510 Web Technology Lab 0-0-2 1
4 PSI 20BTCAIPSI502 Evaluation of Summer Internship-I 0-0-2 1
5 PC 20BTCAIPPC511 Employability Skill-III 0-0-3 1
6 PSI 20BTCAIPSI503 Mini Project II 0-0-2 1
Total Credit (Practical) 6
Total Semester Credit 21

Sixth Semester
Theory
Sl.
Category Course Code Course Title L-T-P Credit
No.
1 PC 20BTCAITPC609 Software Engineering 3-0-0 3
2 PC 20BTCAITPC610 Compiler Design 3-0-0 3
20BTCAITPE607 Artificial Intelligence

3 PE 20BTCAITPE608 Blockchain Technology 3-0-0 3

20BTCAITPE609 Bioinformatics

20BTCAITPE610 Cloud Computing

PE 20BTCAITPE611 Database Security 3-0-0 3

4
20BTCAITPE612 Wireless Sensor Network
Data Communication & Computer
20BTCAITOE604
Networks
OE 3-0-0 3
5 20BTCAITOE605 Computer Graphics

20BTCAITOE606 Human Computer Interface

Essence of Indian Knowledge
6 MC 20BTTMC603 0
Tradition
Total Credit (Theory) 15
Practical
1 PC 20BTCAIPPC612 Software Engineering Lab 0-0-2 1
2 PC 20BTCAIPPC613 Compiler Design Lab 0-0-2 1
Java & Python Programming
3 PC 20BTCAIPPC614 0-0-3 1
Practice Lab
4 PSI 20BTCAIPSI604 Seminar 0-0-2 2
Total Credit (Practical) 5
Total Semester Credit 20
SUMMER INTERNSHIP TRAINING for 45 Days
 Seventh Semester
Theory
Sl.
Category Course Code Course Title L-T-P Credit
No.
1 HS 20BTTHS705 Entrepreneurship Development 3-0-0 3
20BTCAITPE713 Cryptography & Network Security
2 PE 20BTCAITPE714 Web Services and SOA 3-0-0 3
20BTCAITPE715 Professional Practice, Law and Ethics
20BTCAITPE716 Soft Computing
3 PE 20BTCAITPE717 Natural Language Processing 3-0-0 3
20BTCAITPE718 Software Testing
20BTCAITOE707 IoT
4 OE 20BTCAITOE708 Data Analytics Using Python 3-0-0 3
20BTCAITOE709 Robotics
20BTCAITOE710 Deep Learning
5 OE 20BTCAITOE711 Ethical Hacking 3-0-0 3
20BTCAITOE712 Data Mining & Data Warehousing
20BTCAITOE713 Real Time System
6 OE 20BTCAITOE714 Cloud Security 3-0-0 3
20BTCAITOE715 Digital Signal Processing
Total Credit (Theory) 18
Practical
1 PSI 20BTCAIPSI705 Minor PROJECT 0-0-6 3
2 PSI 20BTCAIPSI706 Evaluation of Summer Internship-II 0-0-2 1
3 PSI 20BTCAIPSI707 Grand Viva 0-0-2 1
4 PSI 20BTCAIPSI708 Industrial Lecture & Visit 0-0-2 1
Total Credit (Practical) 6
Total Semester Credit 24

Eighth Semester
Theory
Sl.
Category Course Code Course Title L-T-P Credit
No.
Total Credit (Theory) 0
Practical
1 PSI 20BTCAIPSI809 Internship(Evaluation by External Examiner) 8
2 PSI 20BTCAIPSI810 Grand Viva(Evaluation by External Examiner) 2
3 PSI 20BTCAIPSI811 Major PROJECT(Evaluation by External 8
Examiner)
Total Credit (Practical) 18
Total Semester Credit 18
Total Credit=168
Apart from the above 168 Credits students can opt for Honors courses or Minor courses from
other branches from SWAYAM /NPTEL/ MOOCs for 20 credits (5 Courses and 4 credits
 each to be offered from 3rd semester onwards) These list separately for Honors and Minors
will be notified by the University.

DETAILED SYLLABUS
Semester-2
Second Semester
Theory
Sl. Course
Category Course Title L-T-P Credit
No. Code
1 BS Engineering Mathematics-II 3-0-0 3
2 BS Engineering Chemistry 3-0-0 3
3 ES Basic Electronics Engineering 3-0-0 2
4 ES Basic Civil Engineering 3-0-0 2
5 ES Engineering Mechanics 2-0-0 3
6 ES Programming for Problem Solving using C 3-0-0 3
7 HS Business Communication and Life Skills 3-0-0 2
8 MC NSS / NCC / Yoga 0
Total Credit (Theory) 18
Practical
1 BS Engineering Chemistry Lab 0-0-2 1
2 ES Basic Electronics Engineering Lab 0-0-2 1
3 ES Basic Civil Engineering Lab 0-0-2 1
4 ES Engineering Graphics & Design Lab 0-0-2 2
P Programming for Problem Solving using
5 ES 0-0-2 2
C Lab
Total Credit (Practical) 7
Total Semester Credit 25
SUMMER INTERNSHIP TRAINING for 30 Days

Theory
Course Name: Programming for Problem Solving using C
Course Code : ******
L T P Category
Contact Hrs./Week 3 0 2 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 2 Exam Hours 3
Course objectives: The course aims to provide exposure to problem-solving through programming. It
aims to train the student to the basic concepts of the C-programming language. This course involves a lab
component which is designed to give the student hands-on experience with the concepts.
• To understand the various steps in Program development.
• To understand the basic concepts in C Programming Language.
• To learn how to write modular and readable C Programs
 • To learn to write programs (using structured programming approach) in C to solve problems.
• To introduce the students to basic data structures. To make the student understand simple sorting
and searching method

Prerequisites: Fundamental of computer

Units Teaching
Hours
Unit-1 Basic of Computer and Introduction to the C Language
Components of a computer system, Fundamentals of Computing, Computer
Languages, Problems, Algorithms, flowcharts, Pseudo-code. Compiler and interpreter. 7
Output statements, Literals, Identifiers, Variables, Datatypes, Number Systems &
Conversion, Format specifiers, Input statements, Escape sequences, Constant,
Operators(Arithmetic, relational, logical, bitwise etc.), Expressions, Precedence and
Associativity, Expression Evaluation, Type conversions, Comments
Unit-2 Control Statements and Array
Decision making: if, if-else, nested if, else if ladder, switch, break statement, goto. 10
Loop: while, do-while, for, continue, infinite loop, nesting of loops. Array: 1-D array
creation and memory representation, Manipulating array elements, Linear Search,
Binary Search, Bubble sort. 2-D array creation and memory representation, Programs
on 2-D array.
Unit -3 Pointer, Function and String
Pointer: Declaring and initializing Pointer, dereferencing pointer, Pointer and Array,
Pointer Arithmetic, sizeof() operator, constant pointer, pointer to constant, void pointer,
Null Pointer, Array of pointers and pointer to array. 10
Functions: Types of functions, Parts of function, User defined functions,
Call by value and call by reference, Passing array to function, pointer to function,
function returning pointer.
Recursion, programs on recursion.
C Strings, String Input / Output functions, arrays of strings, string manipulation
functions.
Unit-4 Dynamic memory allocation, Structure and Union
Dynamic memory allocation concept, heap area, malloc, calloc, free. Advantage of
dynamic memory allocation wrt static allocation, Programs on dynamic memory 7
allocation.
Structure and Union: Need of structure, creating a structure, typedef, array of
structures, pointer to structure, passing structure to function, returning structure from
function, self-referential structure. Creating a union, difference between structure and
union.
Enum creation, assigning value to enum variables.
Unit-5 Macro, Storage Class and File Handling
Macro: Macro expansion process, programs on Macro. 6
Storage class: auto, extern, static, register.
Command Line Argument.
File Handling: File opening modes, read and write text in file, file copy, reading and
writing structure variables in a file, fseek, ftell.
Course outcomes:
CO1: To formulate simple algorithms for arithmetic and logical problems
CO2: To translate the algorithms to programs (in C language).
CO3: To test and execute the programs and correct syntax and logical errors.
CO4: To implement conditional branching, iteration and recursion.
CO5: To decompose a problem into functions and synthesize a complete program using divide and
conquer approach.
CO6: To use arrays, pointers and structures to formulate algorithms and programs.
CO7: To apply programming to solve simple numerical method problems, differentiation of
function and simple integration.
Text Books:
T1: E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill
T2: Computer Science: A Structured Programming Approach Using C, [Link] and R.F. Gilberg,
Third Edition, Cengage Learning.
Reference Books:
R1: Programming in C. P. Dey and M Ghosh, Oxford University Press.
R2: ReemaThareja, Introduction to C Programming, 2nd Edition, Oxford University Press.
R3: Programming with C, [Link], 3rd edition, Schaum’s outlines, TMH.
R4: Problem solving with C, [Link], PHI
R5: C Programming with problem solving, J.A. Jones & K. Harrow, Dreamtech Press.
Online Resources:
[Link]
[Link]

Industry Expert Talk: 3

Mapping with Program Outcomes (POs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 3 2
CO2 3
CO3 3
CO4 3 2
CO5 2 3 2
CO6 3 1
CO7 2 2 2 1

Sessional
Course Name: Programming for problem solving Lab using c
Course Code : ******
Category
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 25
Course objectives:
• To write, test, and debug simple C programs.
• To implement C programs with conditionals and loops.
• Use functions for structuring C programs.
• To understand and implement pointer and user defined data types
• To understand file concept and dynamic memory application
• To develop logic to solve problems using the programming
Experiment-# Assignment/Experiment
1 Editing, compiling, executing, and debugging of simple C programs
2 Programs using operators and formatted input/output statements.
3 Decision making using if, if-else, else-if ladder, nested if
4 Decision making using switch-case construct.
5 Loop control structure (while, do-while, for) with jump statements
6 Nested loops (printing various formats)
7 1-D arrays including operation like searching, sorting, merging etc.
8 Handling 2-D arrays such as matrix operations
9 Programs on strings using various string handling functions (library functions)
10 Designing user-defined functions.
11 Programs on recursion.
12 Designing user defined functions for string manipulation.
13 Passing arrays (both 1D and 2D) to functions
14 Structure, array of structure, nested structure.
15 Dynamic memory management.
16 Self-referential structure (create and display operation of single linked list)
17 File handling - reading from and writing to files.
18 Command-line argument, pre-processor directives.
CO1: Read, understand and trace the execution of programs written in C language.
CO2: Develop programs using the basic elements like control statements, Arrays and String
CO3: Implement Programs with pointers, and learn to use the pre-processors, command line
arguments etc.
CO4: Write the C code for a given algorithm
CO5: Write programs that perform operations using derived data types.
CO6: Write programs that perform various operations on files

Mapping with Program Outcomes (POs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 3 2
CO2 3
CO3 3
CO4 3 2
CO5 2 3 2
CO6 3 1
 Semester-3
Theory
Third Semester
Theory
Sl. Course
Category Course Title L-T-P Credit
No. Code
1 BS Engineering Mathematics-III 3-0-0 3
2 ES Object Oriented Programming Using JAVA 3-0-0 3
3 HS Engineering Economics and Costing 2-0-0 2
4 PC Data Structure Using ‘C’ 3-0-0 3
5 PC Computer Organization & Architecture 3-0-0 3
6 HS Universal Human Value 2-0-0 2
7 MC Environmental Science 2-0-0 0
Total Credit (Theory) 16
Practical
1 PC Data Structure Lab using C 0-0-2 1
2 PC Computer Organization & Architecture Lab 0-0-2 1
Object Oriented Programming Using JAVA
3 ES 0-0-2 1
Lab
4 PC Employability Skill-I 0-0-3 1
Total Credit (Practical) 5
Total Semester Credit 20

Course Name: Object Oriented Programming Using Java

Course Code:
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
• Understand the basic object-oriented programming concepts and apply them in problem solving.
• Illustrate inheritance concepts for reusing the program.
• Demonstrate on the multi-tasking by using multiple threads.
• Understand the basics of java console and GUI based programming.
Prerequisites: Basic programming knowledge
Units Teaching
Hours
Unit-1
Chapter 1-: An introduction to programming. Different types of programming
languages, Description of Compiler and Interpreter, Advantage of Object-Oriented
Programming.
Chapter 2-: Introduction to Java. what is Java? why Java? history behind Java,
different versions of Java, difference between C/C++ and Java, features of Java, first
Java Program, prerequisites Before start writing a java program, writing the program,
compiling the program, executing the program, what is JVM and its significance in
8
executing a program? architecture of JVM.
Chapter 3-: Understanding First Program and a step forward, understanding every
term of the program, java tokens, datatypes, operators, what are operators? different
types of operators, typecasting, control structures, conditional statements, loops,
jumping statements, java arrays, multidimensional arrays, taking input from keyboard-
command line arguments using Scanner, using BufferedReader .
Unit-2
Chapter 1-: Introduction to classes and objects, classes, methods, objects, description
of data hiding and data encapsulation, constructors, use of static keyword in java, use
of this keyword in java, array of objects, concept of access modifiers (public, private,
protected, default).
Chapter 2-: Understanding inheritance, types of inheritance and java supported
7
inheritance,significance of inheritance, constructor call in inheritance, use of super
keyword in java, polymorphism, understanding polymorphism, types of polymorphism,
method overloading, constructor overloading, method overriding, dynamic method
dispatching.
Unit-3
Chapter 1-: Introduction to different classes-String, StringBuffer, StringBuilder, String
Tokenizer, concept of wrapper classes, different predefined wrapper classes, predefined
constructors for the wrapper classes, conversion of types from one type (object) to
another type (primitive) and vice versa, concept of auto boxing and auto unboxing.
Chapter 2-: -Basics of data abstraction, understanding abstract classes, understanding
interfaces, multiple inheritance using interfaces, introduction to packages, java API
9
packages, user-defined packages, accessing packages, error and exception handling,
introduction to error and exception, types of exceptions and difference between the
types, runtime stack mechanism, hierarchy of Exception classes, default exception
handling in java, user defined/customized exception handling, understanding different
keywords (try, catch, finally, throw, throws), user defined exception classes, commonly
used exceptions and their details.

Unit-4
Chapter 1-: Introduction of multithreading/multitasking, ways to define a thread in
java, thread naming and priorities, thread execution/prevention methods (yield (), join
(), sleep ()), concept of synchronisation, inter thread communication, basics of
deadlock, demon thread, improvement in multithreading, inner classes-member inner 8
class, static inner class, local inner class, anonymous inner class.
Chapter 2-: IO Streams ([Link] package), introduction to byte stream and character
stream, files and random-access files, serialization.
Unit-5
Chapter 1-: Introduction to java collections framework, util package interfaces-list,
set, map etc, List interfaces and its classes, Setter interfaces and its classes.
Chapter 2-: Life cycle of an applet, GUI with an applet,Swing (JFC), difference 8
between AWT and Swing, individual swings Components - JLabel, JButton,
JTextField, JTextArea, exploring javax package.

Course outcomes:
CO1: Knowledge of the structure and model of the Java programming language, (knowledge)
CO2: Use the Java programming language for various programming technologies (understanding)
CO3: Develop software in the Java programming language, (application)
CO4: Evaluate user requirements for software functionality required to decide whether the Java
programming language can meet user requirements (analysis)
CO5: Propose the use of certain technologies by implementing them in the Java programming
language
to solve the given problem (synthesis).
CO6: Choose an engineering approach to solving problems, starting from the acquired knowledge of
programming and knowledge of operating systems. (evaluation)
Text Books:
T1: Java 8 Programming Black Book Paperback by D.T. Editorial Services [John Wiley]
T2: Java Complete Reference by Herbert Schildt [11th Edition] [McGraw-Hill Education]
Reference Books:

R1: Head First Java by Kathy Sierra, Bert Bates [2nd Edition] [O'Reilly Media, Inc.]
Online Resources:
1-[Link]
2-[Link]
Number of Assignment: 10

Industry Expert Talk:03

Mapping with Program Outcomes (POs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3
CO2 2 2
CO3 2 3 2
CO4 3 3
CO5 2 3
CO6 2 3
 Course Name: Data Structures Using ‘C’
Course Code : ******
L T P Category
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
• To understand the concept of algorithms and step by step approach in solving problems.
• To Understand basic concepts data structures like array, stacks, queues, linked lists, trees,
graphs, searching and sorting techniques, hashing and solve problems using these data
structures and writing programs for these solutions.
Prerequisites: For implementation, knowledge of “ C” language specifically on structures, pointers,
functions, recursion etc., are required.
Units Teaching
Hours
Unit-1
Introduction to algorithm, characteristics of algorithm, algorithm vs pseudocode,
complexity of algorithms, asymptotic notations(Briefly), Introduction to data 7
structures, classification of data structures, abstract data types.
Arrays: Introduction, representation of arrays, basic operations on arrays (traverse,
insert, delete, linear search, Binary search)
Sparse matrix: Introduction to Sparse matrix, types of sparse matrix, representation of
sparse matrix in triplet form, operations on sparse matrix (addition, transpose)

Unit-2
Stack:
Introduction to stack, representation of stack using array, basic operations on 8
stack(PUSH, POP, traverse etc.), Infix, prefix and postfix expression, Application of
stacks:- use in recursion, conversion of infix to post fix expression using stack,
evaluation of postfix expression.
Queue:
Introduction to queue, representation using array, basic operations with analysis,
circular queue, double ended queue, introduction to priority queue, Some applications
areas of Queue.

Unit 3
Linked list:
Introduction to Linked List, types of linked list (single, double, circular),
representation in memory, operations on linked list (creation, insertion of node at 8
various positions, deletion of nodes from various positions, traversal, search, sort,
merge) in each type with analysis.
Representation of polynomial and its operations (addition, multiplication),
implementation of stack and queue using linked list.
Unit-4
Tree
Terminologies, representation, binary tree - tree traversal algorithms with and without 8
recursion.
Binary search tree, Operations on Binary Search Tree with analysis, threaded binary
tree, general tree, Height balanced tree(AVL tree), m-way search trees, B-trees.
Graph
Terminologies, representation (adjacency matrix, incidence matrix, path matrix, linked
representation), graph traversal (BFS, DFS), Dijkstra’s single source shortest path
algorithm, Warshall’s all pair shortest path algorithm, topological sort.

Unit 5
Sorting 8
Introduction to sorting, idea of internal and external sorting, bubble sort, selection sort,
insertion sort, quick sort, merge sort, radix sort, heap sort.
Hashing-
Introduction to hashing, hash functions and hashing techniques, collision resolution
techniques- linear probing, quadratic probing, chaining.

Course outcomes:
CO1: Analyze performance of algorithms and implement various operations on array and sparse
matrix.
CO2: Apply the basic operations of stacks and queues to solve real world problems.
CO3: Implement different types of linked list operations and their applications.
CO4: Represent data using trees & graphs to use them in various real life applications.
CO5: Analyze various sorting algorithms and explore different hashing techniques.
Text Books:
T1. E. Horowitz, S. Sahni, S. Anderson-Freed, Fundamentals of Data Structures in C, 2nd Edition,
Universities Press, 2008.
T2. M. A. Weiss, Data Structures and Algorithm Analysis in C, 2ndEdition, Pearson Education, 2002.
Reference Books:
R1: A. M. Tenenbaum, Y. Langsam, and M. J. Augenstein, Data Structures Using C, 3rdEdition,
Pearson Education, 2007.
R2: J. P. Tremblay and P. G. Sorenson, An Introduction to Data Structures with Applications, 2nd
Edition, McGraw Education, 2017.
R3: S. Lipschutz, Data Structures, 1stRevised Edition, McGraw Education, 2014.
R4: A. K. Rath and A. K. Jagadev, “Data Structures Using C”
Online Resources:
1. [Link] By Prof. H. A. Murthy, Prof. S. Balachandran,
andDr. N. S. Narayanaswamy, IIT Madras
2. [Link] By Prof. N. Garg, IIT Delhi
3. [Link] By Dr. N. S. Narayanaswamy, IIT Madras4.
[Link]
Number of Assignment:7

Industry Expert Talk: 3

Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 3
CO2 1 3
CO3 3 2 2
CO4 3 1
CO5 2 3

Course Name: Computer Organization & Architecture

Course Code:
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
• To know the basic working principles of a computer system.
• To gain knowledge on working of a Control unit and ALU operations.
• To know the current state of art in memory system design and working.
• To know the principles and working of I/O devices along with I/O interface unit.
• To gain knowledge on the working of a Cache memory.
• To provide the knowledge on Instruction Level Parallelism
• To know the Concepts of advanced pipelining techniques.
Prerequisites: Basic electronics, Computer fundamentals, Basic Programming knowledge
Units Teaching
Hours
Unit-1: Functional blocks of a computer
CPU, memory, input-output subsystems, control unit. Instruction set architecture of a
CPU–registers, instruction execution cycle, RTL interpretation of instructions, 8
addressing modes, types of instructions, instruction set, CISC & RISC, Big-endian &
Little-endian representation.

Unit-2: CPU control unit design& ALU operations.

Single bus organization, Multi bus organization, hardwired and micro-programmed
design approaches, 10
Computer arithmetic – integer addition and subtraction, ripple carry adder, carry look-
ahead adder, multiplication – shift-and addition approach, Booth multiplier, Division-
restoring and non-restoring techniques, floating point arithmetic, IEEE floating point
representation

Unit-3: Memory organization

Semiconductor memory technologies, Memory interleaving, concept of hierarchical 8
memory organization, Cache memory, Cache size vs. block size, Cache mapping
functions, Cache replacement algorithms, Cache write policies, Cache Performance,
Secondary memory
Unit-4 : Peripheral devices and their characteristics
Input-output subsystems, I/O device interface, I/O transfers–program controlled, 6
interrupt driven and DMA, software interrupts and exceptions.

Unit-5 : Pipelining
Basic concepts of pipelining, efficiency, throughput and speedup, pipeline hazards and 6
types, Approaches to overcome pipeline hazards.
Parallel Processors: Introduction to parallel processors, FLYNN’s classification,
Cache Coherence problem, Multiprocessors, Multi-Core system.

Course outcomes:
CO1: To draw the functional block diagram of single bus architecture of a computer.
CO2: To describe the function of the instruction execution cycle, RTL interpretation of
instructions, addressing modes, instruction set.
CO3: To know the design concept of Control unit and operation of ALU.
CO4: To Analyze cache performance, cache optimizations, memory technologies, Protection
via virtual memory and virtual machine
CO5: To assess the performance of a given CPU organization, and apply design techniques to
enhance performance using pipelining and parallelism.
Text / Reference Books:
T1: Computer Organization: Carl Hamacher, Zvonkovranesic, SafwatZaky, McGraw Hill
T2:Computer Architecture and Organization, 3rd Edition by John P. Hayes,
WCB/McGraw-Hill
T3: Computer Organization and Design: The Hardware/Software Interface, 5th Edition by
David A. Patterson and John L. Hennessy, Elsevier
T4: Computer Organization and Architecture: Designing for Performance, 10th Edition by
William Stallings, Pearson Education.
Online Resources:
[Link]
Number of Assignment:5

Industry Expert Talk:03

Mapping with Program Outcomes (POs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2
CO2 2 3 1
CO3 2 3 1
CO4 2 3
CO5 2 3

Sessional
 Course Name: Object Oriented Programming Using Java Lab
Course Code:
Category PC
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 10
Course objectives:
[Link] teach fundamentals of object-oriented programming in Java. Understand various concepts of Java.
2. To familiarize Java environment to create, debug and run simple Java programs.
3. To demonstrate java compiler and eclipse platform and learn how to use Net Beans
IDE/Eclipse/Atom/Visual Studio Code to create Java Application.
Experiment-# Experiment
1 Write a Java program that prints all real solutions to the quadratic equation ax2 +bx
+ c = 0. Read in a, b, c and use the quadratic formula. If the discriminate b 2 -4ac is
negative, display a message stating that there are no real solutions.
2 The Fibonacci sequence is defined by the following rule: The first two values in the
sequence are 1 and 1. Every subsequent value is the sum of the two values preceding
it. Write a Java program that uses both recursive and non-recursive functions to print
the nth value in the Fibonacci sequence.
3 Write a Java program that prompts the user for an integer and then prints out all
prime numbers up to that integer. (Use Scanner class to read input)
4 Write a Java program that checks whether a given string is a palindrome or not. Ex:
MADAM is a palindrome.
5 Write a Java program for sorting list of names. Read input from command line.
6 Write a Java program to make frequency count of words in a given text.
7 Write a Java program to create a Student class with following fields i. Hall ticket
number ii. Student Name iii. Department Create ‘n’ number of Student objects
where ‘n’ value is passed as input to constructor.
8 Write a Java program that creates three threads. First thread displays “Good
Morning” everyone second, the second thread displays “Hello” every two seconds
and the third thread displays “Welcome” every three seconds
9 Write a Java program that reads a file name from the user, and then displays
information about whether the file exists, whether the file is readable, whether the
file is writable, the type of file and the length of the file in bytes.
10 Develop simple calculator using Swings
Course Outcomes:
CO1: Implement Object oriented features using Java
CO2: Apply the concept of polymorphism and inheritance.
CO3: Implement exception handling
CO4: Develop window-based application using Swing.
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2
CO2 2 3
CO3 3 3
CO4 1 2 2 3
 Course Name: Data Structures Lab
Course Code : ******
Category
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 14
Course objectives:
• To understand the principles of linear and non-linear datastucture
• Study the basic operations of array, stack and queue
• To understand the operations of linked list
• To Know the application of tree and graph
• Study the sorting and searching techniques and hashing mechanisms.
Experiment 1: Write a menu driven program to perform various operation like insertion, deletion ,
merging on an array.
Experiment 2: Write a menu driven program to create a stack using an array and perform push pop
and display operation.
Experiment 3: i) Write a menu driven program to create linear queue using an array and perform
insertion, deletion and traversal operation.
ii) Write a menu driven program to create circular queue using an array and perform insertion deletion
and traversal operation.
Experiment 4: Write a menu driven program to create a single linked list and perform insertion,
deletion at desired place of the list.
Experiment 5: Write a menu driven program to create a stack and queue using linked list and perform
various operation on it.
Experiment 6: i)Write a menu driven program to create a double linked list and perform insertion,
deletion at the desired place.
ii) Write a program to implement circular linked list
Experiment 7: Write a program for Polynomial addition using linked-list.
Experiment 8: Write a menu driven program to create a BST and display it.
Experiment 9: Write a menu driven program to perform selection, bubble, insertion sort and Merge
Sort.
Experiment 10: Write a program to perform
i) Binary Search
ii) Quick Sort
Experiment 11: Write a program to implement BFS and DFS graph traversals.
Experiment 12: Write a program to implement Dijkstra's algorithm.
Experiment 13: Write a program to implement evaluation of postfix expression using stack
Experiment 14:Write a program to implement conversion of infix expression to
postfix expression using stack.

Course Outcomes:
CO1: Implement array operations to solve problems
CO2: Understand stack operations using programming
CO3: Implementation of queue and its operations
CO4: Apply Liked list to solve problems
CO5: Apply tree concept to design the model
CO6: Implement graph to solve routing problems.
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 3
CO2 1 3
CO3 3 2 2
CO4 3 1
CO5 2 3
CO6 2 2 3

Course Name: Computer Organization and Architecture Lab

Course Code:
Category PC
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 10
Course objectives:
1. To know the detail hardware components of a computer system with their specifications.
[Link] disassemble and assemble a computer system.
[Link] study the different types of error occur in a PC and troubleshoot them.
[Link] study different types of simulator and implement assembly programming.
[Link] study cache memory organization and implement cache performance using simulator.
Experiment-# Experiment
1 Study and Identification of different components of a PC.
2 Assembling & disassembling of a PC.
3 Study of the functions of SMPS using SMPS Trainer Kit.
Study of SMPS with Single Output under Load Regulation.
4 Study of different troubleshooting of CPU using CPU Trainer Module.
5 Familiarization of different types of byte addressing instruction using 8085 simulator
6 Study of Direct Cache mapping technique using Cache_Sim simulator.
7 Study of Associative Cache mapping technique using Cache_Sim simulator.
8 Study of Set Associative Cache mapping technique using Cache_Sim Aimulator

9 Design of Half Adder & Full Adder Circuit using ALU simulator.
10 Design of Ripple Carry adder and Carry look ahead adder Circuit using ALU
simulator.
11 Write a C program to perform signed bit multiplication using Booth’s algorithm
12 Write a C program for IEEE-754 floating point representation and perform
Addition/Subtraction.
Course Outcomes:
1. Ability to demonstrate an understanding of the design of the functional units of a digital
computer system.
2. Ability to Assemble a new computer system and dis assemble it.
3. To learn about SMPS and gain knowledge about power system of a computer system.
4. To gain knowledge on assembly programming with simulation approach.
5. To gain knowledge on different errors created in a computer system and approaches to resolve.
6. To understand the cache memory organization using simulator.
7. To understand ALU operation using simulator..
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 2 1
CO2 3 1 2 1
CO3 2 2 1
CO4 3 3 2 2
CO5 2 2 2
CO6 2 2 2 1
CO7 2 2 1

Semester-4
Fourth Semester
Theory
Sl. Course
Category Course Title L-T-P Credit
No. Code
1 BS Discrete Mathematical Structure 3-0-0 3
2 HS Organisational Behaviour 2-0-0 2
3 PC Design & Analysis of Algorithms 3-0-0 3
4 PC Data Base Engineering 3-0-0 3
5 PC Python Programming 3-0-0 3
Advanced Computer Architecture
6 PE Graph Theory 3-0-0 3
Digital Electronics
7 MC Constitution of India 1-0-0 0
Total Credit (Theory) 17
Practical
1 PC Design & Analysis of Algorithms Lab 0-0-2 1
2 PC Database Engineering Lab 0-0-2 1
3 PC Programming in Python Lab 0-0-2 1
4 PC Employability Skill-II 0-0-3 1
5 PSI Mini Project I 0-0-2 1
Total Credit (Practical) 5
Total Semester Credit 22
SUMMER INTERNSHIP TRAINING for 45 Days

Theory

Course Name: Database Engineering

Course Code:
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
• To introduce database systems
• To learn the techniques of data modelling
• Structure of relational database design
• Design of relational data base
• Access data retrieval
• To manage database
Prerequisites: Computer Programming and File structure
Units Teaching
Hours
Unit-1
Introduction to database systems: Basic concepts and definitions, Disadvantages of
conventional file system and advantages of data base approach, Terms: Metadata, 8
Data Dictionary, Database Management System, Database System, Characteristics of the
Database Approach, database users ,Three schema architecture, data independence,
Concept of data models, types of data models, database languages, integrity, ER and
Relational Data Model, Introduction to Object Oriented and Object Relational Models.
ER Model: Entity, Entity Set, Attributes, Primary Key, Relationship, Types and
Attributes of Relationship, Role, Cardinality Ratio, Participation Constraint, Weak Entity
Set, EER Features.

Unit-2
Relational Data Model: Terms: Relation, Schema, Attributes, Tuples, Domains, Relation
Degree (or Arity) and Cardinality, Relation Intention and Extension, Super Key, 8
Candidate Key, Primary Key and Foreign Key, Relational Model Constraints, Schema
Diagram.
ER to Relation Mapping, Detailed storage architecture, Magnetic disk RAID Storage
Access, File & Record Organization Indexing and order indices (B, B+ Tree).

Unit-3
Query languages: Relational Algebra and its Operations: Set Theoretic Operators 7
(Union, Intersection, Cartesian product, Division), Relational Algebra operators
(Projection, Selection, Join, Rename.
Database Language: SQL (DDL, DML, DCL).

Unit-4
Normalization: Anomalies of un-Normalized Relation, Need of Normalization, Pros and 9
Cons of Normalization, Functional Dependency: Trivial, Full, Partial, Transitive,
Multivalued, Join, Inclusion Dependency, Dependency Diagram, Inference Rules for
Functional Dependencies, Closure of Functional Dependencies, Algorithms to find: 1.
Candidate Key, 2. Closure of Attribute Set, 3. Minimal Cover of Functional
Dependencies, Normal Forms: Checking of Lossless Join Decomposition and
Dependency Preservation, Normal Forms: 1NF, 2NF, 3NF, BCNF, 4NF.

Unit-5
 Transaction: Concept, ACID properties, Transaction States; Schedule: Definition, 8
Types of Schedule, Serializability, Conflict and View Serializability, Precedence Graph,
Recoverable Schedule, Cascade less Schedule, Deadlock,
Concurrency Control Protocols: Lock Based, Timestamp Based Protocol,
Recovery System: Log based Recovery, Checkpoint, Shadow paging.

Course outcomes:
CO1: Differentiate the database concepts from conventional file storage system and describe DBMS
architecture, relational, hierarchical and network database models
CO2:Analyse application data using E-R modelling and describe the logical and physical database
designs.
CO3:Understand relational algebra, calculus and apply structured query language (SQL) for database
definition and manipulation.
CO4:Demonstrate an understanding of normalization theory and apply such knowledge to the
normalization of a database.
CO5: Use transaction management systems and recover methods.
Text Books:
T1: Database System Concepts, Silberschatz, Korth, Sudarshan, McGraw HillInternational Edition,
ISBN- 0-07-228363-7, 4th Edition.
T2: Fundamentals of Database Systems, Elmasri and Navathe, Pearson Education,ISBN 81-297-0228-
2, 4th Edition.
Reference Books:
R1: Database Systems, Thomas Connolly and Carolyn Begg, Pearson Education,ISBN 81-7808-861-4,
3rd Edition.
R2: Database Management Systems, Ramakrishnan and Gehrke, McGraw-HillInternational Edition,
ISBN 0-07-115110-9, 3rd Edition.
R3: An introduction to Database System – Bipin Desai, Galgotia Publications.
Online Resources:
[Link]
Number of Assignment:5

Industry Expert Talk:03

Mapping with Program Outcomes (POs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 1 3 2
CO3 3 2
CO4 2 2
CO5 2 2 1

Course Name: Design Algorithm and Analysis

Course Code : ******
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives: The course covers main approaches to design and analysis of algorithms including
important algorithms and data structures, and results in complexity and computability. Different algorithms
for a given computational task are presented and their relative merits evaluated based on performance
measures.
Prerequisite(s): Programming, Data Structures
Units Teaching Hours
Unit-1 Analysis Techniques
Introduction: Characteristics of algorithm. Analysis of algorithm: Asymptotic analysis
of complexity bounds – best, average and worst-case behavior; Performance
measurements of Algorithm, Time and space trade-offs, summations, Analysis of 10
recursive algorithms through recurrence relations: Substitution method, Recursion tree
method and Masters’ theorem, searching and their analysis.

Unit-2 Fundamental Algorithmic Strategies

Divide and conquer- merge sort, quick sort and their analysis, Priority queue, Greedy:
Huffman coding, Knapasack problem, Activity selection Problem; Dynamic
7
Programming: matrix chain multiplication, Longest common subsequence, Travelling
Salesman Problem.

Unit-3 Fundamental Algorithmic Strategies

Branch- and-Bound – knapsack and TSP,Backtracking- Knapsack, Travelling
Salesman Problem and N-Queen methodologies for the design of algorithms; 7

Unit 3 Elementary Graph algorithms

Graph and Tree Algorithms: Traversal algorithms: Depth First Search (DFS) and
Breadth First Search (BFS); Shortest path algorithms: Single source shortest path, All
pair shortest path, Transitive closure, Minimum Spanning Tree, Topological sorting, 8
Network Flow Algorithm.

Unit-4 NP-Completeness
Tractable and Intractable Problems: Computability of Algorithms, Computability
classes – P, NP, NP-complete and NP-hard. Cook’s theorem, Standard NP-complete
problems (Clique Decision, Node cover Decision and Chromatic Number Decision 8
problem).

Course Outcomes: At the end of the course, the students will be able to:
CO1: Analyze the asymptotic performance of algorithms
CO2: Understand different algorithm design techniques
CO3: Apply important algorithmic design paradigms and methods of analysis
CO4: Demonstrate familiarity with major algorithms and data structures
CO5: Evaluate different classes of problems: P, NP , NP Complete and NP Hard
CO6: Develop algorithms to apply in common engineering design situations
Text Books:
T1: Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, ,Printice Hall
of
India,4th Edition.
T2: Fundamentals of Computer Algorithms by E. Horowitz & S Sahni, ,Galgotial publication; Second
edition.
Reference Books:
R1: Algorithm Design: Foundations, Analysis, and Internet Examples by Michael T Goodrich and Roberto
Tamassia, Wiley, Students Edition.
R2: Design and Analysis of Algorithms, [Link], PHI Learning
Online Resources:
1. [Link]
2. [Link]
3. [Link]
4. [Link]
Number of Assignment: 03

Expert Talk:03

Mapping with Program Outcomes (POs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 2
CO2 3 2 2 1
CO3 2 3 2 1
CO4 1 2 2
CO5 1 1
CO6 2 2 3 2

Course Name: Programming for Problem Solving using Python

Course Code :
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
• To read and write simple Python programs.
• To develop Python programs with conditionals and loops.
• To define Python functions and call them.
• To use Python data structures –- lists, tuples, dictionaries.
• To do input/output with files in Python.
 • To use OOP concept such as class, object, inheritance in Python.

Prerequisites: Basic knowledge of programming

Units Teaching Hours
Unit-1
Data, Expressions, Statements: Python interpreter and interactive mode; values and
types: int, float, boolean, string, and list; variables, expressions, statements, tuple
assignment, precedence of operators, comments;
Control Flow: Conditionals: Boolean values and operators, conditional (if), alternative 8
(if-else), chained conditional (if-elif-else); Iteration: state, while, for, break, continue,
pass;

Unit-2
Functions: modules and functions, function definition and use, flow of execution,
parameters and arguments; Fruitful functions: return values, parameters, local and
global scope, function composition, recursion;
Lists, Tuples, Dictionaries: Lists: list operations, list slices, list methods, list loop,
9
mutability, aliasing, cloning lists, list parameters; Tuples: tuple assignment, tuple as
return value; Dictionaries: operations and methods; advanced list processing - list
comprehension;

Unit 3
Strings: string slices, immutability, string functions and methods, string module; Lists
as arrays.
Files, Modules, Packages: Files and exception: text files, reading and writing files, 8
format operator; command line arguments, errors and exceptions, handling exceptions,
modules, packages

Unit-4
OOP Concepts: Basic Concepts of Object-Oriented Programming, Class, Objects and
object instantiation, Class constructor, Class methods, creating more than one object of 7
a class, Inheritance in Python Class.

Unit-5
Python Standard Library: Use of libraries in Python, How do Python libraries
work,installation, some commonly used Python libraries- Matplotlib, Pandas, Requests, 8
NumPy, SQLAlchemy, Pyglet, PyGame, Python Twisted
 Course outcomes:
CO1: To get familiar with python environment.
CO2: To implement control structures and user defined functions in python
CO3: To understand the use of tuples, lists or maps.
CO4: To implement file and exception handling in python programs
CO5: To implement basic OOP concepts in python
CO6: To understand the use of standard library in python
Text Books:
T1: Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist’’, 2nd edition, Updated
for
Python 3, Shroff/O’Reilly Publishers, 2016 ([Link] python/)
T2: Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and updated for
Python
3.2, Network Theory Ltd., 2011.
Reference Books:
R1: Charles Dierbach, “Introduction to Computer Science using Python: A Computational Problem-
Solving
Focus, Wiley India Edition, 2013.
R2: John V Guttag, “Introduction to Computation and Programming Using Python’’, Revised and
expanded
Edition, MIT Press , 2013
R3: Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE Learning, 2012.
R4: Paul Gries, Jennifer Campbell and Jason Montojo, “Practical Programming: An Introduction to
Computer Science using Python 3”, Second edition, Pragmatic Programmers,LLC,2013.
Online Resources:
[Link]
[Link]

Number of Assignment: 7

Industry Expert Talk-3

Mapping with Program Outcomes (POs)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 2 2
CO3 2 2
CO4 2 2
CO5 2 2
CO6 2 2

Course Name: Advanced Computer Architecture

Course Code : ******
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 42 0 0 Semester 60
 Marks
Credits. 3 0 0 Exam Hours 3
Course objectives:
• To gain basic knowledge required to design and analyze high performance computer
systems.

• To understand the Concept of pipelining system, Parallel Processing and performance

measure of a computer system.
• To make the students know about the importance of multiprocessor and multi computers.
• You will learn how to evaluate and analyze cost and performance of multi processor
systems.
• You will learn various type of interconnection networks used to achieve high performance in
modern systems.
• You will learn how various types of memories are used in parallel architecture to achieve
data parallelism.
• To learn the applications of parallel computing and cloud computing.
Prerequisites: Computer Architecture, Operating system concept, Micro Processor, Assembly
programming, Computer networking
Units Teaching
Hours
Unit-1:Introduction
Review of Basic Computer Architecture, Architecture and function of general
computer system, ,Quantitative techniques in computer design, Performance, 6
Measuring and reporting performance, Instruction Set Architecture, CISC Vs CISC
Unit-2: Instruction Level Parallelism
Arithmetic and Instruction Pipelining, Techniques of increasing ILP, Pipeline Hazards,
Techniques for handling hazards, Pipeline Optimization Techniques, Super Scalar
Architecture, 10

Unit-3: Basic Multiprocessor Architecture

Flynn’s Classification, UMA, NUMA, Loosely Coupled and Tightly Coupled System,
Centralized Shared Memory Architecture, Distributed Shared Memory Architecture,
Array Processor, Vector Processor, 06

Unit 4: Hierarchical memory technology

Cache Memory, Data cache and instruction Cache, Cache memory mapping policies,
Cache updating scheme, cache Coherence problem and solution, Cache performance,
Cache optimization, Virtual Memory concept, Paging Technique, Page replacement
12
Techniques,
Unit-5: Data flow Computer Architecture
Parallel Interconnection Networks, Static and Dynamic Networks, Network topologies,
Data Routing function, Cluster Computers, Introduction to Cloud Computing.
08
Course Outcomes:
CO1: Understand the cost, performance, Trends in Technology, power in Integrated
Circuits and Principles of computer design.
CO2: Analyze the working of pipelining, exploring instruction level parallelism
using static, dynamic & advanced techniques of scheduling and analyze the techniques to explore
Instruction level parallelism and reducing the cost & hazards using dynamic scheduling.
CO3: Analyze multiprocessors & thread level parallelism using shared, distributed and directory based
memory models.
CO4: Analyze cache performance, cache optimizations, memory technologies, Protection via virtual
memory and virtual machine.

CO5: Understand the networking and routing for parallel system with study of distributed computing
and cloud computing architecture.
Text / Reference Books:
1. John L. Hennessy and David A. Patterson, Computer Architecture: A Quantitative Approach,
Morgan Kaufmann
2. Kai Hwang, Adva
nced Computer Architecture: Parallelism, Scalability, Programmability, McGraw-Hill.
3. Computer Organization: Carl Hamacher, Zvonkovranesic, Safwat Zaky, McGraw Hill
4. Introduction to Parallel Computing, 2nd Edition, Pearson Education by Ananth Grama, Anshul
Gupta, George Karypis, Vipin Kumar.
(Separate sections for each Text/Reference Books, if applicable)
Online Resources:
[Link]

Number of Assignment: 10

Mapping with Program Outcomes (POs)

COs PO PO PO3 PO4 PO PO6 PO7 PO8 PO9 PO10 PO11 PO12
1 2 5
CO1 3 2 3 2 3 2 2 1 1 1
CO2 3 3 2 2 2 1 2 1 1
CO3 2 2 3 2 3 1 1
CO4 3 3 3 2 3 1 1 1 1
CO5 2 3 3 2 3 1 1 2 1

Course Name: Digital Electronics

Course Code : ******
L T P Category PE
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:The objective of this course is to introduce the concept of digital and binary systems, to
design and analyze combinational logic circuits and to design and analyze sequential logic circuits

Prerequisites: Knowledge of Basic Electronics and fundamentals of Number Systems is required

Units Teaching Hours
Unit-1
Introduction: Logic Design, transistors as switches, CMOS gates, sequential circuits
with examples. Digital Systems: Representation of numbers, binary code, gray code, 09
error detecting and error correcting codes, registers, binary logic, basic logic gates.

Unit-2
Boolean Algebra: Boolean operations, Boolean functions, algebraic manipulations,
minterms and maxterms, sum-of-products and product-of-sum representations, two- 08
input logic gates, functional completeness
Unit-3
Minimization of Boolean Functions: Karnaugh map, don’t-care condition, Logic
gates, NAND/NOR gates, Universal gates
07
Unit-4
Combinational Circuits: Adder, subtractor, multiplier, comparator, decoders,
encoders, multiplexers, demultiplexers, MUX realization of switching functions, parity 08
bit generator, code converters, hazards and hazard free realizations
Unit-5
Synchronous Sequential Circuits: Finite state machines, latches and flip-flops (SR, 08
D, JK, T). Design of modulo-N ring & shift counters, serial binary adder. Registers
and Counters: Registers and shift registers, sequential adders, binary and BCD ripple
counters, synchronous counters
Course outcomes: At the end of this course, the students will be able to:
CO1:Become familiar with various number systems, codes and Boolean algebra.
CO2:Design and analyze combinational logic circuits.
CO3:Design & analyze various sequential logic circuits.
CO4: Be familiar with register and counter design

Text Books:
1. Digital Design by Morris Mano, PHI, 3rd Edition, 2006.
2. Digital Electronics by G.K. Kharate, Oxford University Press.

Reference Books:
1. An Engineering Approach to Digital Design by Fletcher, PHI.
2. Switching & Finite Automata theory by Z. Kohavi, TMH, 2nd Edition.
Modern Digital Electronics by R. P. Jain, McGraw-Hill Education, 4th Edition.
Online Resources:
[Link]
[Link]
Number of Assignment: 10

Expert Talk: 03

Mapping with Program Outcomes (POs) : (1: Low, 2: Medium, 3: High)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1
CO2 1 2 3
CO3 1 2 3 1
CO4 1 1 1

Course Name: Graph Theory

Course Code : ******
L T P Category PE
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives: The objective of this course is to be familiar with the most fundamental Graph Theory
topics and results and will be exposed to the techniques of proofs and analysis.

Prerequisites: Discrete Structure, Algorithm, Relation and function , Logic , Set theory
Units Teaching Hours
Unit-1
Introduction to graph, Isomorphism , Sub graphs ,Walks, Paths, Circuits :
Connectedness, Components, Euler graphs, Hamiltonian paths and circuits . Trees: 08
Properties of trees, Distance and centers in tree, Rooted trees and binary trees.

Unit-2
Spanning trees , Fundamental circuits , Spanning trees in a weighted graph,Kruskal’s 10
algorithm, Prim’s algorithm. Cut sets : Properties of cut set ,All cut sets . Fundamental
circuits and cut sets :Connectivity and separability ,Network flows ,Graph
Isomorphism ,Combinational and geometric graphs , Planer graphs : Different
representation of a planer graph.
Unit-3
Chromatic number , Chromatic partitioning , Chromatic polynomial , Matching
,Covering : Four color problem , Directed graphs : Types of directed graphs , Digraphs
and binary relations , Directed paths and connectedness , Euler graphs. 08

Unit-4
Fundamental principles of counting : Permutations and combinations , Binomial 08
theorem , combinations with repetition , Combinatorial numbers , Principle of
inclusion and exclusion , Derangement , Arrangements with forbidden positions
Unit-5
Generating functions : Partitions of integers , Exponential generating function , 10
Summation operator ,Recurrence relations : First order and second order , Non-
homogeneous recurrence relations , Method of generating functions
Course outcomes: At the end of this course, the students will be able to:
CO1:Write precise and accurate mathematical definitions of objects in graph theory.
CO2:Use mathematical definitions to identify and construct examples and to distinguish examples from non-
examples.
CO3:Validate and critically assess a mathematical proof.
CO4: Use a combination of theoretical knowledge and independent mathematical thinking in creative
investigation of questions in graph theory.
CO5:Reason from definitions to construct mathematical proofs
Text Books:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”,
Prentice Hall of India, 2003.
2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison
Wesley, 1994.
3. Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists and
Mathematicians” , Prentice Hall of India, 1996.
Reference Books:
1. D. B. West, Introduction to Graph Theory, 2nd Ed, Prentice Hall of India, 2007
2. R. Diestel, Advanced Graph Theory, Springer Verlag Heidelberg, New York, 2005.
3. N. Alon and J. Spenser, "Probabilistic Methods", John Wiley and Sons, 2nd edition, 2000.
4. Rosen K.H., “Discrete Mathematics and Its Applications”, Mc Graw Hill, 2007
Online Resources:
[Link]
[Link]
[Link]
Number of Assignment:10

Expert Talk: 03

Mapping with Program Outcomes (POs) : (1: Low, 2: Medium, 3: High)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2
CO2 2 3
CO3 1 3
CO4 2 3
CO5 1 1

Sessional
Course Name: Database Engineering
 Course Code:
Category PC
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 10
Course objectives:
1 To implement queries by using Structured Query Language.
Experiment-# Experiment
1 Use of DDL commands.
2 Use DML commands.
3 Use of DQL commands.
4 Programs using Relational Operators such as JOIN, PROJECT etc
5 Programs using PL/SQL.
6 Programs on Database Triggers.
7 Programs on Packages.
8 Development of an example program using Check Point Technique
9 Development of an example Concurrent Program and Serialization using Locking
Protocol.
10 Development of connection to the front end
Course Outcomes:
CO1: Apply the concept for database design, create database, and develop queries
CO2: Implement different database programs using procedures, function, and cursor.
CO3: Implement database features such as triggers, packages etc.
CO4: Implement ODBC/JDBC connectivity with programming languages and write programs to
store and retrieve data by using queries.
CO5: Use transaction management systems and recovery methods.
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 1 3 2
CO3 3 2
CO4 2 2
CO5 2 2 1

Course Name: DAA Lab

Course Code : ******
Category PC
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 10
Course objectives: The course should enable the students to: Learn how to analyse a problem and design
the solution for the problem.
• Design and implement efficient algorithms for a specified application.
• Strengthen the ability to identify and apply the suitable algorithm for the given real world problem.
Experiment-# Assignment/Experiment
 1 Evaluation of postfix expression using stack
2 Conversion of infix string to postfix string using stack
3 Implement insertion, deletion, searching of a BST.
4 Implementation of Quick, merge sort and Radix sort
Implementation of dynamic programming algorithms
5 (a) Matrix chain multiplication
(b) Longest common Sub-sequence
6 Implementation of Traveling salesman problem.
7 Implementation of knapsack problem.
Implementation of graph traversal algorithms
8 (a) BFS
(b) DFS
Implementation of minimum spanning tree problem
9 (a) Prim’s algorithm
(b) Krushkal’s algorithm
Implementation of Shortest path algorithms.
10 (a) Dijkstra’s algorithm
(b) Floyd-warshal’s algorithm
Course Outcomes
CO1: Design algorithms using appropriate design techniques (brute-force, greedy, dynamic programming,
etc.)
CO2: Implement a variety of algorithms such assorting, graph related, combinatorial, etc., in a high level
language.
C03: Analyse and compare the performance of algorithms using language features.
CO4: Apply and implement learned algorithm design techniques and data structures to solve real-world
problems.
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 3 1
CO2 2 3 3
CO3 1 3 2 1
CO4 2 3 3 1

Course Name: Python Programming Lab

Course Code : ******
Category ES
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 10
Course objectives:
• To write, test, and debug simple Python programs.
• To implement Python programs with conditionals and loops.
• Use functions for structuring Python programs.
• Represent compound data using Python lists, tuples, and dictionaries.
 • Read and write data from/to files in Python.
• To use OOP concept such as class, object, inheritance in Python.

Experiment-# Assignment/Experiment
1 Editing, compiling, executing, and debugging of simple Python programs
2 Programs on decision control and iterative control
3 Programs on user defines functions
4 Programs of String manipulations and to use list, tuples & dictionary
5 Programs to read/write files and use command line arguments
6 Programs to create modules and packages
7 Programs to create classes and corresponding objects
8 Programs to implement inheritance
9 Developing applications using Python Standard Library – I
10 Developing applications using Python Standard Library – II
Course Outcomes:
CO1: Understand the basic concept of programming
CO2: Apply programming concept to solve problem
CO3: Develop logic for problem solving
CO4: Remember the python programming approach for problem solving
CO5: Design various model to handle and process data.
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 2 2
CO3 2 2
CO4 2 2
CO5 2 2
CO6 2 2

Semester-5
Fifth Semester
 Theory
Sl.
Category Course Code Course Title L-T-P Credit
No.
1 PC Operating System 3-0-0 3
2 PC Formal Language & Automata Theory 3-0-0 3
3 PC Advanced Java 3-0-0 3
Machine Learning 3-0-0
4 PE High Performance Computing 3-0-0 3
Cyber security and Law 3-0-0
Micro Processor and Micro Controller 3-0-0
5 OE Statistical Inference 3-0-0 3
Digital Image Processing 3-0-0
6 MC 0
Total Credit (Theory) 15
Practical
1 PC Operating System lab 0-0-2 1
2 PC Advanced Java Lab 0-0-2 1
3 PC Web Technology Lab 0-0-2 1
4 PSI Evaluation of Summer Internship-I 0-0-2 1
5 PC Employability Skill-III 0-0-3 1
6 PSI Mini Project II 0-0-2 1
Total Credit (Practical) 6
Total Semester Credit 21

Theory
Course Name: Operating Systems
Course Code : ******
L T P Category
Contact Hrs./Week 3 0 2 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 0 Exam Hours 3
Course objectives:
1. To provide knowledge about the services rendered by operating systems
2. To learn Scheduling and Process Synchronization.
3. To study Deadlock and Storage management.
4. To provide a detailed discussion of the various memory management techniques
5. To discuss the various file-system design and implementation issues

Prerequisites: Programming languages, Data Structures, Microprocessor peripherals and interfacing

Units Teaching
Hours
Unit-1 :- INTRODUCTION TO OPERATING SYSTEMS
Overview: Need of operating systems, Computer System architecture, Operating
System structure, Types of Operating system. 9

System structure: Operating System Services, User- Operating System interface,

System calls, Types of system calls, System programs, Operating System design and
implementation, Operating System structure, Virtual machines.

Process concepts: Overview,Processes-States , Process Control Block

Unit-2:- PROCESS MANAGEMENT
Process Concepts:-Scheduling Queues,Schedulers, Context Switching, Process 8
Creation and Termination,operations on processes.

CPU Scheduling:-Scheduling Criteria, Scheduling Algorithms.

Inter Process Communication: Shared Memory, Message Passing

Multi-Threaded Programming: Overview;types, Multithreading models; Thread

Libraries, thread life cycle,Threading issues

Unit -3:- PROCESS SYNCHRONIZATION AND DEADLOCK

Synchronization: Background, The Critical section problem, Peterson’s solution,
Synchronization hardware, Semaphores, Classical problems of synchronization-
10
Producer Consumer, Dining Philosophers and Readers-Writers Problems, Monitors

Deadlock: Deadlocks: System model, Deadlock characterization, Methods for handling

deadlocks, Deadlock prevention, Deadlock avoidance, Deadlock detection and
recovery from deadlock.

Unit-4:- MEMORY MANAGEMENT

Memory Management Strategies: Background, Swapping, Contiguous memory
allocation, Paging, Structure of page table, Segmentation. Virtual Memory 7
Management: Background, Demand paging, Thrashing.

Unit-5:- STORAGE MANAGEMENT AND FILE SYSTEM

Secondary storage structures: Mass storage structures, Disk structure, Disk 6
attachment, Disk scheduling, Disk management, Swap space management.

File system: File concept, Access methods, Directory structure.

Implementing File System: File system structure, File system implementation.

Course outcomes:
Students will be able to:
CO1:-Explain the types of operating system and ability to create threads.
CO2:- Understand CPU scheduling and and perform interprocess communication.
CO3 :-Understand issues surrounding deadlock handling and able to solve process synchronization
problems
CO4:- Explain paging and segmentation methods suitable for virtual memory.
CO5:- Be able to recover and manage disk spaces. Ability to manage files and directory Knowledge of
 files systems.

Text Books:
1. Operating System Principles – Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 9th edition,
Wiley-India, 2012.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, 4/E, Pearson Publications, 2015
Reference Books:
1. Andrew S. Tanenbaum, “Modern Operating Systems”, Pearson Education, 2004, Second Edition
2. Gary Nutt, “Operating Systems”, Pearson Education, 2004 ,Third Edition.
3. Harvey M. Deitel, “Operating Systems”, Pearson Education, 2004, Third Edition.
4. Operating Systems: A Concept Based Approach – D.M Dhamdhere, 2nd Edition, Tata McGraw-
Hill, 2006.
Online Resources:
1. [Link]
2. [Link]
No of Assignment: 10
Industry Expert Talk: 3
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 2 1 1 1
CO2 1 1 1 2 1
CO3 1 2 3 1
CO4 1 1 2 2
CO5 1 2 2 2

Course Name: Formal Language & Automata Theory

Course Code:
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 43 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives: The objective of this course is to study the mathematical foundations & abstract models
of computation consisting of automata theory, formal languages & grammars, computability and concept of
Turing machines.
Prerequisites:Basic knowledge of discrete mathematics is required.
Units Teaching Hours
Unit-1
Introduction: Automata theory, Computability theory, Complexity theory,
Mathematical preliminaries: Alphabet, String, Languages, Grammars, Strings and 10
operations on strings.
Finite Automata (Deterministic): Formal definition, Transition function, Extended
transition function, Language of DFA, Design of DFA, Minimization of DFA,
Finite Automata (Non-deterministic): Formal definition, Language of NFA,
Equivalence of DFA & NFA.
NFA with Epsilon Transition: Eliminating ε-transitions from NFA, Conversion from
Epsilon-NFA to DFA

Unit-2
FA with output: Introduction to Moore Machines, Mealy Machines and Moore and 08
Mealy machine and their Conversion.
Regular Expressions: Operators in Regular expressions, Kleen’s Theorem, Building
Finite Automata from Regular expression, Arden’s theorem, Building Regular
expression from Finite Automata, Pumping Lemma for Regular languages, Properties
of Regular languages.
Unit-3
Introduction to Grammars: Definition, Chomsky classification of grammar.
Context Free Grammars: Definition, Derivation of string, Language from CFG, Parse
Tree, Left Recursion, Right Recursion, Ambiguity in grammar. 10
Normal forms of CFG: Chomsky and Greibach normal forms, Converting CFG to
CNF, and CFG to GNF.
Properties of context free languages, Cook, Younger, Kasami Algorithm, Pumping
Lemma for CFL.
Unit-4
Push Down Automata: Basic Model, Components, moves of a PDA, ID of a PDA,
Design of a PDA, CFG to PDA conversion. 08
Turing Machines: Model, Components, ID of TM, Design of a TM, Variation of TM
model, Universal Turing Machine.
Unit-5
Recursively Enumerable Languages and Undecidable problems, Undecidability of Post 07
correspondence problem, Halting problem, Church Turing hypothesis.
Primitive Recursive functions, µ- Recursive functions, Cantor and Godel numbering,
Ackermann's function, Recursive and Recursively Enumerable sets.

NP Completeness: P and NP, NP complete and NP Hard problems

Course outcomes:
At the end of this course, the students will be able to:
CO 1: Develop and implement mathematical models with DFA, NFA for regular languages and grammar for
real life applications.
CO 2: Examine the properties of formal language and automata, their equivalence and conversion
techniques
CO 3: Classify and construct grammars for different languages and vice-versa.
CO 4: Construct Turing machines for context sensitive and un-restricted languages.
CO 5: Illustrate the relevance of the Church-Turing thesis, explain the concept of decidability & recursive
enumerability, and classify a given language to the P, NP or NPC complexity classes.
Text Books:
T1: J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages and
Computation, 3rd Edition, Pearson Education, 2007.
T2: [Link], Introduction to the Theory of Computation, 3rd Edition, Cengage Learning, 2012
T3: Introduction to Formal Languages, Automata Theory and Computation, [Link], Rama R,
Pearson
Education.
Reference Books:
R1: P. Linz, An Introduction to Formal Languages and Automata, 4th Edition, Jones & Bartlett Learning,
2006.
R2: K. L. P. Mishra, and N. Chandrasekaran, Theory of Computer Science: Automata, Languages and
Computation, 3rd Edition, PHI, 2012.
R3: J. C. Martin, Introduction to Languages and the Theory of Computation, 4th Edition, Tata McGraw-Hill,
2010
Online Resources:
1.[Link] by Dr. K.V. Krishna and Dr. D. Goswami, IIT Guwahati 2.
2.[Link] by Prof. K. Krithivasan, IIT Madras
3.[Link] by Prof. S. Mukhopadhyay, IIT Kharagpur
4.[Link] by Prof. M. T. Goodrich, University of California,
Irvine, USA
Number of Assignment:7

Expert Talk: 03

Mapping with Program Outcomes (POs): (1: Low, 2: Medium, 3: High)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 1 2
CO2 3 2 3 1 3 2
CO3 3 3 3 2 3 2
CO4 2 3 2 2 2
CO5 2 2 2 3 1

Course Name: ADVANCED JAVA PROGRAMING

Course Code :
L T P Category PC/PE/AC (any one)
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
The main Objective of the course is to enable students to understand the concepts underlying technologies in
JAVA Enterprise edition with JDBC technology, configuring Apache tomcat server, implement Server-Side
Programming using Servlets and Java Server Pages and to acquire knowledge of Modern JAVA Frameworks
like Spring, Hibernate etc.
Prerequisites: Core Java Programming
Units Teaching Hours
Unit-1 :
An introduction to Network Programming: Basics of Networking, Introduction to
Socket Programming, Remote Method Invocation, Java Mail API, A small chatting
application using Network Programming. 7

Unit-2 :
Basics of JDBC: Introduction to JDBC, Need of JDBC, JDBC Drivers (4 types),
Architecture of JDBC, Components of JDBC (Classes and Interfaces).
Programming with JDBC: Creating a DATABASE (MS-
ACCESS/ORACLE/MySQL (for Type-3 and Type-4 connection), First Program to
connect to the DATABASE created, Loading the Driver, Establishing the Connection,
Creating Statements (Statement/ PreparedStatement /CallableStatement), Executing a
SQL Query, Different types of SQL Queries, Simple Statement, Pre-Compiled 10
Statement, SQL Statements for stored Procedures.
JDBC Program to retrieve data from DATABASE: Introduction to Result Set,
Result Set with Statement Interface, Result Set with PreparedStatment Interface,
Bidirectional Result Set, Result Set Scroll ability Type, Result Set Updatability Type,
Updating data to the Database using Result Set, Result Set Metadata, Executing Stored
Procedures Using Callable Statement.
Unit 3 :
Introduction to Web Application and its programming: Description about Web
application and its Architecture, Client-Server Architecture, An Introduction to HTML5
, Basics of HTTP protocol
Introduction to Servlets: What is Servlet, Strengths of Servlet, Web Servers and its
Containers(Tomcat), Role of servlet in Web application development.
Getting Deep to Servlets: Understanding servlet-api, Types of Servlet class, Difference
between HttpServlet and GenericServlet , Life cycle of Servlets and different life cycle
methods, Difference between doGet() and doPost(), Servlet Generating Html output,
Collecting Client submitted data.
Servlet [Link] to DBMS communication using type-4 connection, 10
Servlet to DBMS communication using JDBC connection pooling, Servlet
communication with other
servlets (Servlet Chaining), Servlet communication with HTML page(sendRedirect(),
Difference between sendRedirect() and RequestDispatcher forward()),Understanding
ServletConfig.
Additional features to Servlets: Servlet Filters, Session Tracking using HTML hidden
form filed element, Cookies, HttpSession, URL rewriting, Annotation based servlet
programs.

Unit- 4 :
Java Server Pages: -Introduction to JSP, Scope of JSP, Anatomy of a JSP program,
Execution of a JSP program, Significance of JSP Engine, Built in objects of JSP,
Significance of JSP Elements, Scripting Elements, Scriptlets, Declaration, Expression
language, Directives and Action Elements, PageDirective, Include Directive, Taglib
Directive, JSP action Tags: Forward action element, Include, Param, useBean with 7
introduction to beans, setProperty, getProperty.
An introduction to JSTL(Core, Formatting only).

Unit-5 :
Introduction to Distributed Application Development : An Introduction to
XML/JSON.
Introduction to web services (SOAP/SOA), Rest API.
Modern JAVA Frameworks: Hibernate: Introduction to ORM with Hibernate, 6
Architecture of Hibernate, Hibernate mapping(one-to-one, many-to-one only). Spring:
Introduction to Spring, Dependency Injection, Architecture of Spring framework,
Introduction to Spring Core and Spring MVC module only.
 Course Outcomes:
CO1: Design a desktop application which can used for many kind of clients.
CO2: Develop an application which can also be connected with the database.
CO3: To learn Server-Side Programming using Servlets and Java Server Pages.
CO4: Design a web application which can work as a dynamic web with the help of JDBC.
CO5: To learn the operations perform on data among web applications.
Text Books:
1. Advanced Java Programming, Uttam K. Roy, Oxford University Press.
2. Black book, Kogent Learning Solution Inc.
Reference Books:
1. The Complete Reference by Herbert Schildt
Online Resources:
1. [Link]

Number of Assignment: 10

Mapping with Program Outcomes (POs) Low = 1, Medium = 2 , High =3

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 3 1 1 1 2
CO2 2 2 3 2 1 1 2
CO3 3 2 3 2 2 1 2
CO4 2 1 3 2 3 2 2 2
CO5 2 3 3 3 3 3 3 1 1 3

Course Name: Introduction to Machine Learning

Course Code : ******
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
1. Ability to comprehend the concept of supervised and unsupervised learning techniques.
2. Differentiate regression, classification and clustering techniques and to implement their
Algorithms.
3. To analyse the performance of various machine learning techniques and to select appropriate features
for training machine learning algorithms.
4. Apply and understand the necessity of machine learning to solve design the business solutions
• Prerequisites: Probability and statistics, Data base Engineering, Python programming
Units Teaching Hours
Unit-1 :
Introduction to Machine Learning, Examples of Various Learning Paradigms,
Perspectives and Issues, Version Spaces, Finite and Infinite Hypothesis Spaces,
Applications of Machine Learning in different fields (Medical science, Agriculture,
8
Automobile, mining and many more), Supervised vs Unsupervised Learning based on
problem Definition, Concept of Bias, Variance, and model complexity Understanding
the problem and its possible solutions using IRIS datasets.
Unit-2 :
Supervised Learning: Linear Regression, Non-linear Regression, Model Evaluation in
Regression, Evaluation Metrics in Regression Models, Multiple Linear Regression,
Multiple Linear Regression, Logistic Regression, Mathematical formulation of K-
Nearest Neighbour Algorithm for binary classification, Implementation of K-Nearest 9
Neighbour Algorithm, Decision tree, Construction of decision trees based on entropy,
Implementation of Decision Trees, Random Forest, Classification using Support Vector
Machines, SVM for Binary classification, SVM for multi-class classification.
Unit 3 :
Unsupervised Learning: Defining clustering and its application in ML, Mathematical
formulation of K-Means Clustering, Defining K value and its importance in K-Means
9
Clustering, KMode Clustering, Self-Organizing Map, DBSCAN Clustering, Feature
Reduction using PCA, LDA.
Unit- 4 :
Reinforcement Learning: Introduction to Reinforcement learning, Single State Case:
K-Armed Bandit, Elements of Reinforcement Learning, Model-Based Learning (Value 6
Iteration, Policy Iteration).
Unit-5 :
Recent Learning Techniques: Introduction of Neural Network, Deep Learning, CNN,
RNN, Ensemble Classifier, Main Challenge for Developing Ensemble Models, Types of
Ensemble Classifier: Bagging, Boosting, Stacking. 8

Course Outcomes:
CO1 Apply supervised learning to solve related real-life problems.
CO2 Analyse a problem and select the most suitable supervised model for the same.
CO3 Apply classification & regression models such as SVM and decision models.
CO4 Preform clustering of given data with extraction of important features.
CO5 Apply the concepts of reinforcement learning to solve relevant real-life problems
Text Books:
1. Ethem Alpaydin, Introduction to Machine Learning, MIT Press, Prentice Hall of India, Third Edition
2014.
2. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning - Data Mining,
Inference, and Prediction, 2nd Edition, Springer, 2009.
3. T2. S. Haykin, Neural Networks and Learning Machines, 3rd Edition, Pearson Education, 2009.

Reference Books:
1. R1. Y. G. James, D. Witten, T. Hastie, and R. Tibshirani, An Introduction to Statistical Learning with
Applications in R, 1st Edition, Springer, 2013.
2. R2. T. M. Mitchell, Machine Learning, 1st Edition, McGraw Hill Education, 2013.
3. R3. C. M. Bishop, Pattern Recognition and Machine Learning, 1st Edition, Springer, 2006.
Online Resources:
1. [Link] by Prof. S. Sarkar, IIT Kharagpur.
2. [Link] by Prof. B. Ravindran, IIT Madras.
3. [Link] by Prof. C. G. Jansson, IIT Madras.

Number of Assignment: 10

Mapping with Program Outcomes (POs) Low = 1, Medium = 2 , High =3

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 1
CO2 2 3 2 1
CO3 3 2
CO4 2 1 2
CO5 2 1 1 2

Course Name: HIGH PERFORMANCE COMPUTING

Course Code : ******
L T P Category ES
Contact Hrs./Week 3 0 2 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 2 Exam Hours 3
Course objectives: The course aims to provide exposure to the modern processors and its functionality ,
new computing like cluster computing, grid computing, and cloud computing etc.

Prerequisites: Computer Organization and architecture

Units Teaching
Hours
Unit-1 modern processors
Introduction to modern processors: Stored Program Computer Architecture- General
purpose cache- based microprocessor-Performance based metrics and benchmarks- 7
Moore's Law- Pipelining-Superscalarity-SIMD- Memory Hierarchies Cache- mapping-
prefetch- Multicore processors- Mutithreaded processors- Vector Processors- Design
Principles- Maximum performance estimates- Programming for vector architecture.
Unit-2 Cluster Computing
Introduction to Cluster Computing, Scalable Parallel Computer Architectures, Cluster 10
Computer and its Architecture, Classifications, Components for Clusters, Cluster
Middleware and Single System Image, Resource Management and Scheduling,
Programming Environments and Tools, Applications, Representative Cluster
Systems,Heterogeneous Clusters, Security, Resource Sharing, Locality, Dependability,
Cluster Architectures, Detecting and Masking Faults, Recovering from Faults, Condor,
Evolution of Metacomputing.

Unit -3 Load Sharing and Balancing

Evolution, Job and Resource Management Systems, State-of-the-Art in RMS and Job,
Rigid Jobs with Process Migration, Communication-Based Scheduling, Batch
Scheduling, Fault Tolerance, Scheduling Problem for Network Computing, Algorithm 10
-ISH, MCP and ETF, Dynamic Load Balancing, Mapping and Scheduling, Task
Granularity and Partitioning, Static and Dynamic Scheduling
Unit-4 Grid Computing
Introduction to Grid Computing, Virtual Organizations, Architecture, Applications,
Computational, Data, Desktop and Enterprise Grids, Data-intensive Applications, 7
High-Performance Commodity Computing, High-Performance Schedulers, Grid
Middleware: Connectivity, Resource and Collective Layer, Globus Toolkit, GSI,
GRAM, LDAP, GridFTP, GIIS, Heterogeneous Computing Systems, Mapping
Heuristics: Immediate and Batch Mode, Immediate: MCT, MET, Switching Algorithm,
KPB and OLB, Batch: Min-Min, Max-Min,Sufferage, Duplex, GA, SA, GSA, Tabu
and A*, Expected Time to Compute Matrix, Makespan,
Unit- Cloud Computing
Introduction to Cloud Computing, Types: Deployment and Service Models, 6
Characteristics, Applications, Service-Level Agreement, Virtualization, High-
Throughput Computing: Task Computing and Task-based Application Models,
Market-Based Management of Clouds, Energy-Efficient and Green Cloud Computing
Architecture, Resource Allocation, Leases, Task Scheduling: RR, CLS and CMMS,
Workflow Scheduling, Montage, Epigenomics, SIPHT, LIGO, CyberShake, Task
Consolidation, Introduction to CloudSim, Cloudlet, Virtual Machine and its
Provisioning,

Course outcomes:
Students will be able to:
CO1: understand the modern processors functionality
CO2: Understand the concepts of Cluster Computing and use it for solving problem.
CO3: Understand the concepts of Load Sharing and Balancing and Apply it to solve problems.
CO4: Understand the concepts of Grid Computing use it.
CO5: Understand the concept of Cloud Computing and Apply it to solve problems.
Text Books
1. Georg Hager, Gerhard Wellein, Introduction to High Performance Computing for Scientists and
Engineers, Chapman & Hall / CRC Computational Science series, 2011.

2. R. Buyya, High Performance Cluster Computing: Architectures and Systems, Volume 1, Pearson
Education, 2008.
3. (Edited By) I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure,
Morgan Kaufmann, Elsevier, 2004.
4. D. Janakiram, Grid Computing, Tata McGraw-Hill, 2005.
5. R. Buyya, C. Vecchiola and S. T. Selvi, Mastering Cloud Computing Foundations and
Applications Programming, Morgan Kaufmann, Elsevier, 2013.
Reference Books
1. Chakrabarti, Grid Computing Security, Springer, 2007.
2. Wilkinson, Grid Computing: Techniques and Applications, CRC Press, 2009.
3. S. R. Prabhu, Grid and Cluster Computing, PHI, 2008.
4. Sosinsky, Cloud Computing Bible, Wiley, 2011.
5. Charles Severance, Kevin Dowd, High Performance Computing, O'Reilly Media, 2nd Edition,
1998.
6. Kai Hwang, Faye Alaye Briggs, Computer Architecture and Parallel Processing, McGraw Hill,
1984
Online Resources:
[Link]
No of Assignment: 5
Industry Expert Talk: 3
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 3 2
CO2 3
CO3 3
CO4 3 2
CO5 2 3 2
Course Name: Cyber security and Law
Course Code : ******
L T P Category ES
Contact Hrs./Week 3 0 2 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 2 Exam Hours 3
Course objectives: The course aims to provide the students a good understanding of Cyber Security and
Cyber Law currently prevailed in India and abroad.

Prerequisites: NA
Units Teaching
Hours
Unit 1
Introduction to Cybercrime: Cybercrime definition and origins of the world, 6
Cybercrime and information security, Classifications of cybercrime, Cybercrime and
the Indian ITA 2000, A global Perspective on cybercrimes.

Unit2 Introduction to Cyber Law

Evolution of computer technology, emergence of cyber space. Cyber Jurisprudence, 7
Jurisprudence and law, Doctrinal approach, Consensual approach, Real Approach,
Cyber Ethics, Cyber Jurisdiction, Hierarchy of courts, Civil and criminal
jurisdictions, Cyberspace-Web space, Web hosting and web Development
agreement, Legal and Technological Significance of domain Names, Internet as a
tool for global access.

Unit-3 Information Technology Act

Overview of IT Act, 2000, Amendments and Limitations of IT Act, Digital 10
Signatures, Cryptographic Algorithm, Public Cryptography, Private Cryptography,
Electronic Governance, Legal Recognition of Electronic Records, Legal Recognition
of Digital Signature, Certifying Authorities, Cyber Crime and Offences, Network
Service Providers Liability, Cyber Regulations Appellate Tribunal, Penalties and
Adjudication.
Unit -4 Cyber Law and Related Legislation
Patent Law, Trademark Law, Copyright, Software – Copyright or Patented, Domain
Names and Copyright disputes, Electronic Data Base and its Protection, IT Act and
Civil Procedure Code, IT Act and Criminal Procedural Code, Relevant Sections of 10
Indian Evidence Act, Relevant Sections of Bankers Book Evidence Act, Relevant
Sections of Indian Penal Code, Relevant Sections of Reserve Bank of India Act, Law
Relating To Employees And Internet, Alternative Dispute Resolution , Online
Dispute Resolution (ODR).
Unit-5 Electronic Business and Legal Issues
Evolution and development in E-commerce, paper vs paper less contracts E-Commerce
models- B2B, B2C, E security. Business, taxation, electronic payments, supply chain, 7
EDI, E-markets, Emerging Trends.
Course outcomes:
Students will be able to:
CO1: Understand the concept of cybercrime and its effect on outside world
CO2: Understand and interpret the various aspects of Cyber Laws
CO3: Understand the Information Technology Act and apply IT law in various legal issues.
CO4: Understand the Cyber Law and Related Legislation and Apply it.
CO5: Understand the Electronic Business and Legal Issues apply it when necessary to solve the problem.
Books
1. Cyber Laws: Intellectual property & E Commerce, Security- Kumar K, Dominant Publisher
2. Cyber Ethics 4.0, Christoph Stuckelberger, Pavan Duggal, by Globethic
3. Information Security policy & Implementation Issues, NIIT, PHI
4. Computers, Internet and New Technology Laws, Karnika Seth, Lexis Nexis Butterworths Wadhwa
Nagpur.
5. Legal Dimensions of Cyber Space, Verma S, K, Mittal Raman, Indian Law Institute, New Delhi,
6. Cyber Law, Jonthan Rosenoer, Springer, New York, (1997).

Online Resources:

No of Assignment: 5
Industry Expert Talk: 3
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 3 2
CO2 3
CO3 3
CO4 3 2
CO5 2 3 2

Course Name: Micro Processor and Micro Controller

Course Code : ******
L T P Category OE
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 42 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:The objective of this course is to study various microprocessors & microcontrollers,
Develop assembly-level programs, and interface with other external devices as per the requirements.
• To understand the various Micro-processors.
• To understand the basic concepts of 8051 Microcontroller.
• To learn how to write Assembly language program to solve problems.
• To learn how to interface peripheral devices for real-time applications.
Prerequisites: Basic knowledge of Digital Electronics Circuit
Units Teaching
Hours
Unit-1 Intel 8085 microprocessor
Introduction to 8085 microprocessor & its organization, general architecture, Bus
organization, Memory concepts, Pins and Signals, Instruction execution, Timing
diagram, Instruction Set & programming, Addressing modes, interrupts, memory & I/O 7
interfacing.
Unit-2 Intel 8086 microprocessor
Intel 8086 Microprocessor, Bus Interface unit, Execution Unit, Register Organization,
Memory Segmentation, Pin architecture, Minimum and Maximum mode system
configuration, Physical Memory Organization, Interrupts, Addressing Modes, 8
Instructions.

Unit -3 8-bit microcontroller

Introduction to 8051 Micro-Controllers, Architecture; Memory Organization; Special
Function register; Port Operation; Memory Interfacing, I/O Interfacing; Programming 10
8051 resources, interrupts; Programmer’s model of 8051; Operand types, Operand
addressing; Data transfer instructions, Arithmetic instructions, Logic instructions,
Control transfer instructions; Programming.
Unit-4 Interfacing with 8051
Interfacing with keyboards, LEDs, 7 segment LEDs, LCDs, Interfacing with ADCs.
Interfacing with DACs, etc. 8

Unit-5 Interfacing with Peripheral ICs

Interfacing with Peripheral ICs: System level interfacing design with various ICs like
8255 Programmable Peripheral Interface, 8257 DMA Controller, 8259 Programmable
Interrupt Controller, 8251 Programmable Communication Interface. 9

Course outcomes:
Students will be able to:
CO1:Explain the architecture, pins & signals, programming model, instruction execution of 8085
Micro-processor and its interfacing with memory and I/O devices.
CO2: Explain the architecture, pins & signals, programming model, instruction execution of 8086
Micro-processor and its interfacing with memory and I/O devices.
CO3:Explain the concepts of embedded ICs, RISC and CISC processors and 8051 Micro-controller to
solve simple problems using assembly language programming.
CO4: Design Micro-controller based interfacing for different applications.
CO5:Demonstrate peripheral interfacing with advanced programming of Micro-processors and
Micro-controllers for real-time applications.
Text Books:
1. Microprocessor Architecture, Programming and application with 8085, R.S. Gaonkar, PRI
Penram International publishing PVT. Ltd., 5th Edition.
2. The 8051 Microcontroller and Embedded Systems, Muhammad Ali Mazidi, Janice Gillispie
Mazidi, Rolin D.M C Kinlay, Pearson Education, Second Edition, 2008.
Reference Books:
1. Microprocessors and Interfacing, N. Senthil Kumar, M. Saravanan, S. Jeevananthan and S.K.
Shah,
Oxford University Press.
2. Advanced Microprocessors and Peripherals, A.K. Ray, K M Bhurchandi, TMH Publication, 2007.
3. Microprocessors and Microcontrollers Architecture, programming and system design using 8085,
8086, 8051 and 8096, Krishna Kant, PHI Publication, 2007.
4. B. Ram, Fundamentals of Microprocessors and Microcontrollers, 9th Edition, Dhanpat Rai
Publications, 2019.
Online Resources:
[Link] by Dr. P. Agarwal, IIT
Roorkee[Link] by Prof. K. Kumar, IISc Bangalore
No of Assignment: 5
Industry Expert Talk: 2
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2
CO2 3 2 2 2
CO3 3 3 2
CO4 2 3 3 1 1
CO5 2 3 3 1 1

Course Name: Statistical Inference

 Course Code : ******
L T P Category ES
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 42 0 0 Semester Marks 60
Credits. 3 0 2 Exam Hours 3
Course objectives The objective this course is exercise statistical thinking in designing data
collection, derive insights from visualizing data, obtain supporting evidence for
data-based decisions and construct models for predicting future trends from data.
Additionally, this course prepares the foundation to recognize the importance of
data collection, identify limitations in data collection methods, and determine
how they affect the scope of inference.
Prerequisites: Basic UG level knowledge of probability and statistics is required
Units Teaching
Hours
Unit-1
Axioms of Probability: Sample space and events, axioms of probability, some simple
proposition, sample spaces having equally likely outcomes. 8
Conditional Probability & Independence: Conditional probabilities, Bayes’ formula,
independent events.
Random Variables: Random variables, discrete random variables, expected value,
expectation of function of random variable, variance, Bernoulli and binomial random
variables, Poisson random variable, properties of cumulative distribution function.
Unit-2
Continuous Random Variables: Expectation and variance of continuous random 8
variables, uniform random variable, Normal random variables, exponential random
variables, distribution of a function of a random variable.
Properties of Expectation: Expectation of sums of random variables, covariance,
variance of sums and correlations, conditional expectation, conditional expectation and
prediction, Moment generating function.
Distributions Derived from the Normal Distribution: _2, t, and F distributions, The
sample mean and the sample variance.
Unit -3
Survey Sampling: Population parameters, simple random sampling (The expectation
and variance of the sample mean, estimation of the population variance, The normal
approximation to the sampling distribution of _X ), estimation of a ratio. 9
Estimation of Parameters & Fitting of Probability Distributions: Fitting the
Poisson distribution, parameter estimation, the method of moments, and maximum
likelihood (Large sample theory for maximum likelihood estimates, confidence
intervals from maximum likelihood estimates), the Bayesian approach to parameter
estimation(large sample normal approximation to the posterior, computational aspects)
Unit-4
Testing Hypotheses & Assessing Goodness of Fit: The Neyman-Person paradigm
(specification of the significance level and the concept of a p-value, The null 9
hypothesis, uniformly most powerful tests), the duality of confidence intervals and
hypothesis tests, generalized likelihood ratio test, probability plots, tests for normality;
Large scale hypothesis testing and false discovery rates.
Comparing Two Samples: Comparing two independent sample (methods based on the
normal distribution, power, a non-parametric method - the Mann-Whitney test,
Bayesian approach), comparing paired samples (methods based on the normal
distribution, The signed rank test).
Unit-5
The Analysis of Variance: The one-way layout (normal theory, F test, problem of 8
multiple comparisons, KruskalWallis test).
The Analysis of Categorical Data: Fisher’s exact test, the Chi-square test of
homogeneity and independence, matched pairs designs, odds ratios.
Course outcomes:
Students will be able to:
CO1 Apply sampling distributions such as _2, t, and F distribution in real life problems.
CO2 Estimation the parameters and fitting of probability distributions.
CO3 Apply methods of tests of hypothesis and goodness of fit.
CO4 Conduct hypothesis tests, make decisions using p-value, and draw appropriate conclusions.
CO5 Analyze categorical data, formulate and use linear regression for the given data sets.
Program Outcomes Relevant to the Course:
PO1: Apply knowledge of mathematics, computing, analytics, and domain knowledge
appropriate for creating computational models for defined problems and requirements.
PO2: Develop efficient applications to analyze data and make predictions for taking timely
business decisions.
PO3: Design solutions for analysis of huge data with considerations towards societal and
environmental aspects.
PO4: Assess the security & privacy aspects in storage, transmission, and analysis of large
amounts of critical business information.
PO5: Integrate diverse IT tools and apply them efficiently for real-world data analysis
applications.
PO6: Function effectively both as a leader and team member on multi disciplinary projects to
demonstrate computing and management skills.
PO7: Review research literature and conduct independent research in data science to develop
advanced algorithms, techniques and tools.
PO8: Recognize the need for and engage in continuous lifelong learning to enhance the
knowledge & skills in data science.
Text Books:
Text Books:
T1. S. Ross, A First Course in Probability, 8th Edition, Pearson Education, 2010.
T2. J. A. Rice, Mathematical Statistics and Data Analytics, 3rd Edition, Cengage Learning,
2013.
Reference Books:
R1. L. Wasserman, All of Statistics: A Concise Course in Statistical Inference, Springer, 2004.
R2. B. Efron and T. Hastie, Computer Age Statistical Inference: Algorithms, Evidence, and
Data Science,
1st Edition, Cambridge University Press, 2016.
1.
Online Resources:
1. [Link] By Prof. S. Kumar, IIT Kharagpur
2. [Link] By Prof. N. Chaterjee, IIT Delhi.
No of Assignment: 10
Industry Expert Talk: 3
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2 PSO3
CO1 3 3 3 2 2 1 3 2 2
CO2 3 2 3 2 2 1 1 3 2 2
CO3 3 3 3 1 2 2 1 1 3 2 2
CO4 3 3 3 1 2 2 1 1 3 3 2
CO5 3 3 3 1 2 2 1 1 2 3 2
 Sessional
Course Name: Operating system Lab
Course Code : ******
Category ES
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 10
Course objectives:
• To learn Unix commands
• To learn shell programming
• To implement various CPU Scheduling Algorithms
• To implement Memory allocation Methods
• To implement page replacement algorithms

Experiment-# Assignment/Experiment
1 Introduction To Unix- Basic Unix Commands
2 Unix Editors , Programs Using The Some System Calls Of Unix Operating
System
3 C Programs To Simulate Unix Commands Like Cp, Ls, Grep
4 Simple Shell Programs
5 Shell Programs Using Loop
6 Cpu Scheduling Algorithms:- Sjf Scheduling Algorithm
7 Cpu Scheduling Algorithms:- Round Robin Scheduling Algorithm
8 Memory Allocation Methods For Fixed Partition- Worst Fit
9 Memory Allocation Methods For Fixed Partition- Best Fit
10 Page Replacement Algorithms.
CO1:Read, understand and trace the execution of various unix commands and editors.
CO2:Develop programs using Shell Programming.
CO3: Analyze the performance of various CPU Scheduling Algorithms.
CO4: Implement various memory allocation methods.
CO5:- Analyze the performance of the various Page Replacement Algorithms.

Mapping with Program Outcomes (POs)

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1 3 1 1
CO2 2 3 3 2 1
CO3 3 2 3 1 1
CO4 3 2 2 1 1
CO5 2 3 3 2 1

Course Name: Advanced JAVA Programming Lab

Course Code:
Category PC
Contact Hrs./Week Sessional Marks 100
Contact Hrs./Sem. No Of Experiments 10
Course objectives:
The main Objective of the course is to enable students to understand the concepts underlying technologies in
JAVA Enterprise edition with JDBC technology, configuring Apache tomcat server, implement Server-Side
Programming using Servlets and Java Server Pages
Experiment-# Experiment
1 JAVA program to demonstrating multithreading.
2 Write a set of two JAVA programs for communicating between them using socket
3 JDBC Program to insert data into Student DATA BASE and update data in Student
database using Statement and PreparedStatement interface.
4 JDBC Program to retrieve info from Student DATA BASE based on particular queries.
5 JDBC program to invoke database stored procedure using CallableStatement interface.
6 A JAVA Servlet Program to implement and demonstrate get() and Post
methods(Using HTTP Servlet Class).
7 Program on Servlet-database communication using JDBC type-4 driver.
8 A JAVA Servlet Program to demonstrate different modes of Servlet communication.
Implementation of different Session tracking mechanisms in Servlet.
9 Write a JAVA JSP Program to implement verification of a particular user login
and display a Welcome page.
10 Using JSP develop a project to implement ONLINE EXAMINATION SYSTEM.(Use of
JAVA bean, Expression language, action elements and JSTL)
Course Outcomes:
1. Develop an application which can also be connected with the database.
2. To learn Server-Side Programming using Servlets and Java Server Pages.
3. Design a web application which can work as a dynamic web with the help of JDBC.
4. To learn the operations perform on data among web applications.
Mention the modified / newly topics added in the syllabus:
NIL
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 3 2 1 1 2
CO2 3 2 3 2 2 1 2
CO3 2 1 3 2 3 2 2 2
CO4 2 3 3 3 3 3 3 1 1 3

Course Name: Web Technology

Course Code : ******
Category ES
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 30 No Of Experiments 25
Course objectives:
• Demonstrate the role of languages like HTML, DHTML, CSS, XML, Javascript, PHP and
protocols in the workings of the web and web applications.
Experiment-# Assignment/Experiment
1 Create a HTML page, which has properly aligned paragraphs with image along
with it.
2 Create a HTML page, with Tables and Frames, Create your class timetable using
table tag, Create a web page using frame. Divide the page into two parts with
Navigation links on left hand side of page (width=20%) and content page on right
 hand side of page (width = 80%). On clicking the navigation Links corresponding
content must be shown on the right hand side.
3,4 Create a HTML page, with Forms and different types of Lists , Create user
Student feedback form (use textbox, text area , checkbox, radio button, select box
etc.)
5 Create your resume using HTML tags also experiment with colours , text , link ,
size and also other tags you studied.
6,7 Design a web page of your home town with an attractive background colour, text
colour, an Image, font etc. (use internal CSS).
8 Use External, Internal, and Inline CSS to format college web page that you
created.
9,10 Develop simple calculator for addition, subtraction, multiplication and division
operation using JavaScript
11 Create HTML Page that contains form with fields Name, Email, Mobile No ,
Gender , Favourite Colour and a button now write a JavaScript code to combine
and display the information in textbox when the button is clicked. Implement
Validation in above Feedback Form
12 , 13 Create XML file to store student information like Enrolment Number, Name ,
Mobile Number , Email Id.
14, 15 Create DTD and Schema for above XML File.
16 Write a php program to display today’s date in dd-mm-yyyy format.
17 Write a php program to check if number is prime or not
18 Write a php program to print first 10 Fibonacci Numbers.
19 , 20 Create HTML page that contain textbox, submit / reset button. Write php program
to display this information and also store into text file.
21 Write a php script to read data from txt file and display it in html table (the file
contains info in format Name: Password: Email )
22 Write a PHP Script for login authentication. Design an html form which takes
username and password from user and validate against stored username and
password in file.
23 , 24 Write PHP Script for storing and retrieving user information from MySql table. 1.
Design A HTML page which takes Name, Address, Email and Mobile No. From
user ( [Link] ) 2. Store this data in Mysql database / text file. 3. Next page
display all user in html table using PHP ( [Link] )
25 Write a PHP script for user authentication using PHP-MYSQL. Use session for
storing username.
CO1: Develop web pages using HTML, DHTML and Cascading Styles sheets
CO2: Develop web pages using HTML, DHTML and Cascading Styles sheets.
CO3 :Develop a dynamic web pages using JavaScript (client side programming).
CO4 :Develop an interactive web applications using [Link].
CO5 :Build and consume web services.
CO6 :Develop a Program using XML.

Mapping with Program Outcomes (POs)

Cos PO1 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 2 3 2 2
CO3 3
CO4 3 2
CO5 2 3
CO6 1 2 2 2

Semester-6
Sixth Semester
Theory
Sl.
Category Course Code Course Title L-T-P Credit
No.
1 PC Software Engineering 3-0-0 3
PC Data Communication & Computer
2 3-0-0 3
Networks
PE IoT
3 Blockchain Technology 3-0-0 3
Bioinformatics
Cloud Computing 3-0-0
PE Database Security 3-0-0 3
4
Wireless Sensor Network 3-0-0
Deep Learning 3-0-0
OE Human Computer Interface 3-0-0 3
5
Compiler Design 3-0-0
6 MC Essence of Indian Knowledge Tradition-1 0
Total Credit (Theory) 15
Practical
1 PC Software Engineering Lab 0-0-2 1
2 PC Computer Networking Lab 0-0-2 1
3 PC Java & Python Programming Practice Lab 0-0-3 1
4 PSI Seminar-I 0-0-2 2
5 PSI Evaluation of Internship-II 0-0-2 1
Total Credit (Practical) 6
Total Semester Credit 21
SUMMER INTERNSHIP TRAINING for 45 Days

Theory
Course Name: Software Engineering
Course Code : ******
 L T P Category ES
Contact Hrs./Week 3 0 2 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 2 Exam Hours 3
Course objectives:The objective of this course is to provide fundamentals of software
engineering,software development life cycle & project management, object-oriented software design,
development, testing and quality assurance.
• Ability to relate practical problems to software engineering concepts
• Ability to model problems using standard software development models
• Ability to apply software engineering skills in real-world problem solving
Prerequisites: Knowledge of computers, logical & analytical ability, exposure to procedural and
object oriented programming languages is required.
Units Teaching
Hours
Unit-1 Software Process Model
Introduction to Software Engineering: Evolution and Emergence of Software
Engineering; Software Life Cycle Models: Classical Waterfall Model, Iterative 8
Waterfall Model, V-Model, Prototyping Model, Incremental Development Model,
Evolutionary Model, RAD model, Agile development models & Spiral model.
Unit-2 Software Requirement Engineering
Requirement Gathering and Analysis, Functional and Non-functional requirements, 10
Software Requirement Specification (SRS), IEEE 830 guidelines, Decision tables and
trees. Structured Analysis & Design: Overview of design process, High-level and
detailed design, Cohesion and coupling, Modularity and layering, Function–Oriented
software design: Structured Analysis using DFD Structured Design using Structure
Chart, Basic concepts of Object Oriented Analysis & Design. User interface design,
Command language, menu and iconic interfaces.

Unit -3 Software Design

Software Design: Overview of the Design Process, Cohesion and Coupling,
Layered Arrangement of Modules, Approaches to Software Design; FOD:SA/SD
Methodology, DFD, Structured Design and Detailed Design. Implementing. 8
Unit-4 Coding & Testing
Coding and Software Testing Techniques: Coding, Code Review, documentation.
Testing: - Unit testing, Black-box Testing, White-box testing, Cyclomatic complexity 7
measure, coverage analysis, mutation testing, Debugging techniques, Integration
testing, System testing, Regression testing. Software Reliability and Software

Unit-5 Software Quality and Maintenance

Software quality: SEI CMM and ISO-9001. Software reliability and fault-tolerance, 6
software project planning, monitoring, and control. Computer-aided software
engineering (CASE), Component model of software development, Software
[Link] Reliability, Software Quality, QMS, SEI CMM, Six Sigma; CASE,
Software Maintenance, Emerging Trends.
Course outcomes:
Students will be able to:
CO1:Describe fundamentals of software engineering and life cycle models and building of software
products based on their characteristics.
CO2: Apply various requirement analysis tools for the requirement engineering process
CO3:Create high-level & detail-level design of a software using various design methodologies..
CO4:Code, review, test and maintain software products confirming to quality standards
CO5: Maintain software products confirming to quality standards

Text Books:

1. Mall Rajib, Fundamentals of Software Engineering, PHI.

2. Pressman, Software Engineering Practitioner’s Approach, TMH.
Reference Books:
1. Mall Rajib, Fundamentals of Software Engineering, PHI.
2. Pressman, Software Engineering Practitioner’s Approach, TMH.
3. Somerville, Software Engineering, 9th Edition, Pearson Education
4. [Link], Software Engineering - A Practitioner’s Approach, 7th Edition,
McGraw HillEducation
Online Resources:
[Link] by Prof. Rajib Mall, IIT Kharagpur.
[Link] by Prof. N. L. Sharda, IIT Bombay.
[Link] engineering/software engineering [Link]
No of Assignment: 10
Industry Expert Talk: 3
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 1 2 1 2 1
CO2 3 2 2 2 3 3 2
CO3 2 3 2 2 2 2 2
CO4 2 3 3 2 2 2 2
CO5 2 3 3 2 1 2 1

Course Name: Data Communication and Computer Networks

Course Code : ******
L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 44 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:The objective is to analyze the concepts of networks, types and architectures, identify
error free transmission of data and analyzes data collision with various protocols, apply various routing
algorithms over a network to provide optimal path, illustrate the real time applications of networks, and
examine the addressing entities of a network with implementation of TCP, UDP protocols.
• To understand various types of signals, transmissions, multiplexing and networks.
• To understand about error detection and error correction techniques.
• To learn about IPv4 and IPv6 and various transport layer protocols.
• To learn about Email and protocols used to transfer data.
Prerequisites: Basic knowledge of Computer Architecture, Operating System, Computer System and
Internet is required
Units Teaching
Hours
Unit-1
Overview of the Internet: Introduction to data communication, computer networks,
Protocol, Layering Scenario, TCP/IP Protocol Suite: The OSI Model, Internet history,
standards and administration; Comparison of the OSI and TCP/IP reference model.
Physical Layer: Data and signals: analog and digital, periodic analog signals, digital
signals, transmission impairments, data rate limit. Digital Transmission: Digital-to-
Digital & Analog-to- Digital conversion. Analog Transmission: Digital-to-Analog &
10
Analog-to-Analog conversion. Multiplexing: FDM, TDM, WDM; Transmission
Media: Guided Media(Twisted-Pair Cable, Coaxial Cable and Fiber-Optic Cable),
Unguided media(wireless).Switching: Circuit Switched Network, Datagram Network,
Virtual-Circuit Network , Telephone Network, Dial-up Modems and Digital Subscriber
Lines.
Unit-2
Error Detection and correction: Types of Errors, Error Detection mechanism (Linear
codes, CRC, Checksum), Error Correction mechanism: Hamming Encoding. Data
Link Control and Protocols: Flow and Error Control, Stop-and-Wait ARQ. Go-Back-
N ARQ, Selective Repeat ARQ, HDLC and Point-to-Point Protocol. Multiple Access:
9
Random Access (ALOHA, CSMA, CSMA/CD, CSMA/CA), Controlled Access
(Polling, Reservation, Token Passing), Channelization (FDMA, TDMA, CDMA).
Wired LANs (Ethernet): Traditional Ethernet, Fast Ethernet, Gigabit Ethernet.
Unit -3
Connecting devices: learning bridges, spanning tree bridges, repeaters, hubs, bridges,
switches, routers and gateways. Network Layer: IPV4 & IPV6 addresses, Subnets, 8
Supernetting ; Internet Protocol: Internetworking, IPV4 & IPV6 datagram format.
Unit-4
Network Layer Protocols: ARP, RARP, IGMP, ICMP and DHCP; Routing: Unicast
and Multicast Routing Protocols; Transport Layer: Process to Process Delivery, User
9
Datagram Protocol (UDP) and Transmission Control Protocol (TCP), TCP and UDP
segments and Flow Control.
Unit-5
Domain Name System (DNS): Name Space, Domain Name Space, DNS in Internet,
Resolution and Dynamic Domain Name System (DDNS), Remote logging, Electronic
Mail (SMTP) and file transfer (FTP), WWW: Architecture & Web document, HTTP: 8
Transaction & Persistent vs. Non-persistent connection. Introduction to Wi-Fi and Li-
Fi Technology.
Course outcomes:
Students will be able to:
CO1: Analyze the concepts of networks, types and architectures
CO2:Explain various techniques and modes of transmission (Analog and Digital).
CO3: Identify error free transmission of data and analyse data collision with various protocols.
CO4: Describe IPv4 & IPv6 addressing schemes, subnets, routing principles and algorithms used in the
network layer.
CO5:Explain the protocols of transport & application layers and understand the working principlesof
Internet & the World Wide Web.
Text Books:
1. Data Communications and Networking: Behrouz A. Forouzan, Tata McGraw-Hill, 4th Ed.
2. Computer Networks: A. S. Tannenbum, D. Wetherall, Prentice Hall, Imprint of Pearson 5th Ed.

Reference Books:
1. Data communication & Computer Networks: Gupta, Prentice Hall of India.
 2. Data and Computer Communications: William Stallings, Prentice Hall, Imprint of Pearson, 9th
Ed.
3. Computer Networks A system Approach, Larry L, Peterson and Bruce S. Davie, Elsevier.
4. Network for Computer Scientists & Engineers: Zheng, Oxford University Press
Online Resources:
1. [Link] Data Communicatin by Prof. A. Pal , IIT
Kharagpur
2. [Link] by Prof. S. Ghosh, IIT Kharagpur
No of Assignment: 5
Industry Expert Talk: 2
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2
CO2 3 2 2 2
CO3 3 2 1 1
CO4 3 1 2 1
CO5 3 2 1 1 1

Course Name: Internet Of Things

Course Code : ******
L T P Category PE
Contact Hrs./Week 3 0 2 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
1. To apprise students with basic knowledge of IoT that paves a platform to understand physical, logical
design and business models
2. To teach a student how to analyze requirements of various communication models and protocols for
cost-effective design of IoT applications on different IoT platforms.
3. To explain the students how to code for an IoT application and deploy for real-time scenario.
Prerequisites: Fundamental of computer
Units Teaching
Hours
Module-1 Introduction To Internet of Things
Definition & Characteristics of IoT - Challenges and Issues - Physical Design of IoT,
Logical Design of IoT - IoT Functional Blocks, Security. 8
Domain Specific IOTs: Home Automation, Cities, Environment, Energy, Retail,
Logistics, Agriculture, Industry, Health & Life Style.
Module-2 Components In Internet of Things
Control Units Communication modules Bluetooth Zigbee Wifi GPS- IOT Protocols 8
(IPv6,
6LoWPAN, RPL, CoAP etc), MQTT, Wired Communication, Power Sources.
Module -3 Technologies Behind IoT
Four pillars of IOT paradigm, - RFID, Wireless Sensor Networks, SCADA
(Supervisory Control and Data Acquisition), M2M - IOT Enabling Technologies -
BigData Analytics, Cloud Computing, Embedded Systems. 8
Module-4 Developing Internet of Things & Logical Design using Python
 : Introduction, IOT Design Methodology, Installing Python, Python Data Types & Data
Structures, Control Flow, Functions, Modules, Packages, File Handling, Date/ Time 8
Operations, Classes, Python Packages
Module- 5 Programming The Microcontroller For IoT
Working principles of sensors IOT deployment for Raspberry Pi /Arduino /Equivalent 8
platform Reading from Sensors, Communication: Connecting microcontroller with
mobile devices, communication through Bluetooth, wifi and USB - Contiki OS- Cooja
Simulator.
Course outcomes:
Students will be able to:
CO1. Describe various layers of IoT protocol stack and describe protocol functionalities.
CO2. Evaluate efficiency trade-offs among alternative communication models for an efficient IoT
application design.
CO3. Comprehend advanced IoT applications and technologies from the basics of IoT.
CO4. Understand working principles of various sensor for different IoT platforms.
CO5. Estimate the cost of hardware and software for low cost design IoT applications.
Text Books:
[Link] Uckelmann [Link], Architecting the Internet of Things, Springer, 2011
2, Arshdeep Bahga and Vijay Madisetti, Internet of Things A Hand-on Approach, Universities press, 2015
Reference Books:
1. Charalampos Doukas , Building Internet of Things with the Arduino, Create space, April 2002

2. Dr. Ovidiu Vermesan and Dr. Peter Friess, Internet of Things: From research and innovation to market
deployment, River Publishers 2014.

3. AdrianMcEwen, “Designing the Internet of Things”, Wiley Publishers, 2013, ISBN:978-1-118-43062-

0

Online Resources:

No of Assignment: 10
Industry Expert Talk: 3
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 3 2
CO2 2 3 3 3
CO3 3 2
CO4 2 3 3
CO5 2 3 2

Course Name: Blockchain Technology

Course Code:
L T P Category PE
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
This course is intended to study the basics of Blockchain technology. During this course learner will explore
various aspects of Blockchain technology like application in various domains.
Prerequisites:
Units Teaching Hours
Unit-1
Introduction of Cryptography and Blockchain:
What is Blockchain, Blockchain Technology Mechanisms & Networks, Blockchain 08
Origins, Objective of Blockchain, Blockchain Challenges, Transactions and Blocks,
P2P Systems, Keys as Identity, Digital Signatures, Hashing, and public key
cryptosystems, private vs. public Blockchain.

Unit-2
Bitcoin and Cryptocurrency: 08
What is Bitcoin, The Bitcoin Network, The Bitcoin Mining Process, Mining
Developments, Bitcoin Wallets, Decentralization and Hard Forks, Ethereum Virtual
Machine (EVM), Merkle Tree, Double-Spend Problem, Blockchain and Digital
Currency, Transactional Blocks, Impact of Blockchain Technology on Cryptocurrency.
Unit-3
Ethereum basics:
Ethereum and Smart Contracts, The Turing Completeness of Smart Contract
Languages and verification challenges, using smart contracts to enforce legal contracts, 08
comparing Bitcoin scripting vs. Ethereum Smart Contracts, writing smart contracts
using Solidity & JavaScript
Unit-4
Privacy, Security issues in Blockchain:
Pseudo-anonymity vs. anonymity, Zcash and Zk-SNARKS for anonymity preservation, 08
attacks on Blockchains: Sybil attacks, selfish mining, 51% attacks advent of algor and
Shading based consensus algorithms to prevent these attack
Unit-5
Case Studies: 08
Block chain in Financial Service, Supply Chain Management and Government Services
Blockchain Applications:
Internet of Things, Medical Record Management System, Do-main Name Service and
future of Blockchain.
Course outcomes:
At the end of this course, the students will be able to:
CO 1: Describe the basic concepts and technology used for blockchain.
CO 2: Illustrate the concepts of Bitcoin and their usage.
CO 3: Implement Ethereum block chain contract.
CO 4: Apply security features in blockchain technologies.
CO 5Use smart contract in real world applications.
Text Books:
T1: Lorne Lantz,Daniel Cawry , ‘Mastering Blockchain: Unlocking the Power of Cryptocurrencies,
Smart Contracts, and Decentralized Applications’, O′Reilly (31 October 2020)
T2: Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder,
‘Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction’, Princeton
University Press (July 19, 2016).
T3: Josh Thompson, ‘Blockchain: The Blockchain for Beginnings, Guild to Blockchain Technology
and Blockchain Programming’, Create Space Independent Publishing Platform, 2017.

Reference Books:
R1: Imran Bashir, “Mastering Blockchain: Distributed ledger technology, decentralization, ansmart
contracts explained”, Packt Publishing
R2: Narayanan, Bonneau, Felten, Miller and Goldfeder, “Bitcoin and Cryptocurrency Technologies
- A Comprehensive Introduction”, Princeton University Press.
R3: Merunas Grincalaitis, “Mastering Ethereum: Implement Advanced Blockchain Applications
Using Ethereum-supported Tools, Services, and Protocols”, Packt Publishing
Online Resources:
[Link] online course: [Link]
[Link]: [Link]
[Link] Online training: [Link]
curriculum
Number of Assignment: 05

Expert Talk: 03

Mapping with Program Outcomes (POs) : (1: Low, 2: Medium, 3: High)

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 2 3
CO2 3 2 3 1 3
CO3 2 3 3 2 2
CO4 2 2 2 2 1
CO5 2 2 2 3 3

Course Name: Bioinformatics

Course Code : ******
L T P Category PE
Contact Hrs./Week 3 0 2 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
1. Adapt basic knowledge on various techniques and areas of applications in bioinformatics.
2. Analyse common problem in bioinformatics, alignment techniques, ethical issues, public data sources,
and evolutionary modelling.
3. Discover the practical use of tools for specific bioinformatics areas.
Prerequisites: Fundamental of computer
Units Teaching
Hours
Module-1 Introduction to bioinformatics
Scope and applications of bioinformatics, Alignment of pairs of sequences;
Introduction- Definition of sequence alignment, Methods ‐ Dot matrix sequence 8
comparison

Module-2 Pairwise sequence alignment

Dynamic programming algorithm for sequence alignment – Global Alignment: 8
Needleman- Wunsch, Local Alignment: Smith-Waterman , Gap penalty, Assessing the
significance of an alignment
Module -3 Multiple sequence alignment
Dynamic programming, progressive methods, Iterative methods, MSA using
CLUSTAL W, PILEUP and CLUSTAL X, purpose and applications of multiple
sequence alignment 8
Module-4 Scoring matrices
Similarity searches ‐ PAM and BlOSUM matrix, Dayhoff mutation matrix,
construction of PAM and BLOSUM matrix. Differences between PAM & BLOSUM 8
Module- Database search methods
Database searching for similar sequences. Sequence similarity search, FASTA 8
sequence database similarity search, BLAST sequence database similarity search, other
methods of comparing database of sequences and patterns.

Course outcomes:
Students will be able to:
CO1. Apply knowledge of bioinformatics in a practical project.
CO2. Develop the ability for critical assessment of scientific research publications in bioinformatics.
CO3. Build an understanding of the research process in general, such as research methods, scientific
writing, and research ethics.
CO4. Evaluate the main databases at the NCBI and EBI resources
CO5. Compare the databases, tools, repositories and be able to use each one to extract specific information
CO6. Demonstrate the selected tools at NCBI and EBI to run simple analyses on genomic sequences.
function and simple integration.
Text Books:
[Link]: Sequence and Genome Analysis David W. Mount, David Mount
2,Bioinformatics: the Machine Learning Approach – Pierre Baldi and Søren Brunak Publisher: MIT Press.
Reference Books:
1. Hooman H Rashidi, Lukas K Buehler. Bioinformatics Basics ‐2000.
2. Per Jambeck, Cynthia Gibas. Developing Bioinformatics Computer Skills. Computers – 2001.
3. Bioinformatics Methods and Protocols: Methods and Protocols. edited by Stephen Misener, Stephen A
Krawetz ‐ Science – 1999.
Online Resources:

No of Assignment: 10
Industry Expert Talk: 3
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 3 2 3 3 3
CO2 3
CO3 3 2 3
CO4 3 2
CO5 2 3 2
CO6 3 1 3 2

Course Name: Cloud Computing

Course Code : ******
 L T P Category PC
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
1. To provide an in-depth and comprehensive knowledge of the Cloud Computing fundamental issues,
technologies, applications and implementations.
2. To expose the students to the frontier areas of Cloud Computing
3. To motivate students to do programming and experiment with the various cloud computing
environments
4. To shed light on the Security issues in Cloud Computing
5. To introduce about the Cloud Standards
• Prerequisites: Basics of Networking,Programming [Link] of Security and Privacy.
Units Teaching Hours
Unit-1 :
History of Centralized and Distributed Computing - Overview of Distributed
Computing, Cluster computing, Grid computing. Technologies for Network based
systems- System models for Distributed and cloud computing- Software environments 6
for distributed systems and clouds.
Unit-2 :
Introduction to Cloud Computing - Characteristics - Cloud issues and challenges-
Service models, Deployment models. Cloud resources: Network and API - Virtual and
Physical computational resources - Data-storage. Virtualization concepts - Types of 10
Virtualization- Introduction to Various Hypervisors
Unit 3 :
A Classification of Cloud Implementations- Amazon Web Services - IaaS, The Elastic
Compute Cloud (EC2), The Simple Storage Service (S3), The Simple Queuing Services
8
(SQS), VMware vCloud - IaaS, vCloud Express, Google AppEngine - PaaS, The Java
Runtime Environment
Unit- 4 :
The Python Runtime Environment- The Datastore, Development Workflow, Windows
Azure Platform - PaaS, Windows Azure, SQL Azure, Windows Azure AppFabric,
[Link] - SaaS / PaaS, [Link], Force Database - the persistency layer, 10
Microsoft Office Live - SaaS, Google Apps - SaaS, A Comparison of Cloud Computing
Platforms.
Unit-5 :
Cloud Security – Infrastructure security – Data security – Cloud Access: authentication,
authorization and accounting, Identity and access management Privacy, Audit and
Compliance, Cloud federation: interoperability and standards. 6

Course Outcomes:
CO1: Articulate the main concepts, key technologies, strengths, and limitations of cloud computing
CO2: Discuss several applications for state-of-the-art cloud computing
CO3: Identify the architecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS, public
cloud, private cloud, hybrid cloud, etc.
CO4: Explain the core issues of cloud computing such as security, privacy, and interoperability.
CO5: Provide the appropriate cloud computing solutions and recommendations according to the applications
used.
Text Books:
1. Kai Hwang, Geoffrey C. Fox and Jack J. Dongarra, “Distributed and cloud computing from Parallel
Processing to the Internet of Things”, Morgan Kaufmann, Elsevier – 2012
2. R. Buyya, C. Vecchiola and S. Thamarai Selvi, Mastering Cloud Computing: Foundations and
Applications Programming, Morgan Kaufmann, Elsevier, 2013.
Reference Books:
1. Barrie Sosinsky, “ Cloud Computing Bible” John Wiley & Sons, 2010
2. Tim Mather, Subra Kumaraswamy, and Shahed Latif, Cloud Security and Privacy An Enterprise
Perspective on Risks and Compliance, O'Reilly 2009
3. P. K. Pattnaik, M. R. Kabat and S. Pal, Fundamentals of Cloud Computing, Vikas Publishing House
Pvt. Ltd., 2015.
Online Resources:
2. [Link]
3. [Link]
Number of Assignment: 10

Mapping with Program Outcomes (POs) Low = 1, Medium = 2 , High =3

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 1 2 1 2
CO2 2 3 2 2 1 2 1
CO3 3 3 2 1
CO4 2 1 2 2 1 2
CO5 2 1 1 1 1 2

Course Name: Database Security

Course Code : ******
L T P Category PE
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
• To learn the security of databases
• To learn the design techniques of database security
• To learn the secure software design
Prerequisites: Students should have an understanding of basic database concepts and security
Units Teaching Hours
Unit-1 :
Database security – Introduction includes threats, vulnerabilities and breaches, Basics of
database design, DB security – concepts, approaches and challenges, types of access
controls, Goals of Database Security, database security levels, and menaces to 10
databases. Database security methods and methodologies, Security controls: flow
control, inference control and access control
Unit-2 :
Database Application Security models – Types of users, access matrix model, access
modes model, commonly used application types. Classes of access control:
Discretionary access control (DAC), Mandatory access control (MAC) and Role based 10
Access control (RBAC); Discretionary Access Control (DAC) mechanisms such as
capabilities, profiles, access control lists, passwords, and permission bits.
Unit 3 :
RBAC based security models features like User role assignment, Support for role
relationships and Constraints , Assignable privileges. MAC based security models.
8
Implementing Fine Grained access controls with views , Virtual Private databases: need
for VPDs, Implementing VPD using views,
Unit- 4 :
The Database Security Design includes the controls that will be implemented to restrict
users from accessing information, based on how the information is classified and the 6
security model.
Unit-5 :
HTML Injection and Cross- Site Scripting, Cross-Site Request, Forgery, SQL Injection
and Data Store Manipulation, Breaking Authentication Schemes, Abusing Design
6
Deficiencies, Leveraging Platform Weaknesses, Statistical database security; Database
privacy – Hippocratic databases
Course Outcomes:
CO1: Identify access control methods for secure web & database application development
CO2: Analyse vulnerabilities in the Web and Database applications.
CO3: Design & Evaluate methods for web & database intrusion detection
CO4: Design Secure Database schema
CO5: Apply security audit methods
Text and Reference Books:
1. SilvanoCastano, Fugini, Martella, Samarati, Database Security, Addison Wesley, 1994.
2. M. Gertz, S. Jajodia, Handbook of Database Security, Springer, 2008
3. Ben-Natan, R. B., Implementing Database Security and Auditing: Includes Examples for Oracle,
SQL Server, Db2 Udb, Sybase, Digital Press, 2005
4. Mike Shema, Hacking Web Apps Detecting and Preventing Web Application Security Problems,
Syngress publications- Elsevier, 2012
Online Resources:
4. [Link]
5. [Link]
Number of Assignment: 10

Mapping with Program Outcomes (POs) Low = 1, Medium = 2 , High =3

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1 1 1 1 1 2
CO2 1 1 1 1 1
CO3 1 2 2 1 2
CO4 2
CO5 1 2 2 1 1

Course Name: Wireless Sensor Network

Course Code : ******
L T P Category ES
Contact Hrs./Week 3 0 2 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 2 Exam Hours 3
Course objectives:The objective of this course is to provide concepts & unique design challenges
presented by wireless sensor networks (WSNs), and introduction to programming
for WSNs at the system, network, and application levels.
• To learn fundamentals and application of WSN
• To learn various protocols of WSN
• To understand security issues in WSN
Prerequisites: Knowledge of computer networks and wireless communication is required.
Units Teaching
Hours
Unit-1 Introduction
Overview ofWSN& its technology, motivation & applications,Taxonomy of WSN
technologies, Traditional layered stack, Cross-layer designs, Sensor network 6
architecture.

Unit-2 Sensor Node Technology

Overview, Hardware & software, Sensor taxonomy, Wireless network trends, Wireless 10
transmission technology & systems, Radio technology primer, Available wireless
technologies, Medium access control protocols for WSN, Fundamentals of MAC
protocols, MAC protocols for WSNs, Sensor-MAC case study, IEEE 802.15.4 LR-
WPANs
Standard case study, MAC protocols analysis using Markov Chain.
Unit -3 Routing Protocols
Data dissemination & gathering, Routing challenges, design issues, and strategies;
Transport Control Protocols: Design issues, Resource aware routing, Data-centric
routing, Geographic routing, Opportunistic routing. 10
Unit-4 WSN Middleware
Principles, Architecture, Existing middleware, Network management - requirements,
traditional models, design issues; Security issues of WSN: Possible attacks, 7
Countermeasures, Static & dynamic key distribution.
Unit-5 WSN Platforms & Tools
Sensor node Hardware, Berkeley Motes, Programming challenges, Node-level software 6
platforms, Node-level simulators, State-centric programming; Applications of WSNs:
Ultra wide band radio communication, Wireless fidelity systems, Future directions,
Home automation, Smart metering applications.
Course outcomes:
Students will be able to:
CO1: Describe different types of wireless networks, their architecture and supporting protocols.
CO2:Explain the hardware & software of WSNs and MAC layer protocols to address media accessing.
CO3:Analyze the network & transport layer protocols to address issues like addressing, route
optimization, handover, and reliability.
CO4:Explain architecture of WSN middleware, identify security issues and apply necessary
countermeasures.
CO5 :Apply various WSN platforms and tools to design real world applications
Text Books:

1. W. Dargie and C. Poellabauer, Fundamentals ofWireless Sensor Networks - Theory and Practice,
1stEdition,Wiley, 2010.
2. K. Sohraby, D. Minoli, and T. Znati, Wireless Sensor Networks - Technology, Protocols, and
Reference Books:
1. T. Hara, V. I. Zadorozhny, and E. Buchmann, Wireless Sensor Network - Technologies for the
Information Explosion Era, 1st Edition, Springer, 2010.
 2. B. Krishnamachari, NetworkingWireless Sensors, 1st Edition, Cambridge University Press, 2005.

Online Resources:
[Link] by Prof. S. Misra, IIT Kharagpur
[Link] hy439 sensor nets [Link]
[Link] Lecture slides by Prof. K. M. Sivalingam,
University of Maryland, Baltimore, USA
No of Assignment: 10
Industry Expert Talk: 3
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 1
CO2 2 2 2 3 3 1
CO3 2 2 2 3 2 1
CO4 2 2 3 3 3 1
CO5 2 2 3 1 2 1

Course Name: Deep Learning

Course Code : ******
L T P Category OE
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
The objectives of this course is to learn the concepts behind regularization of parameters, deep
neural networks, probabilistic graphical models, reinforcement learning etc., and use them to solve
various machine learning problems.
Prerequisites: The first course in machine learning taught in previous semester, along with knowledge of
probability, optimization, and linear algebra are required.
Units Teaching Hours
Unit-1 Regularization for Deep Learning and Training Deep Models
: Parameter Norm Penalties, Norm Penalities as Constrained Optimization,
Regularization and UnderConstrained Problems, Dataset Augmentation, Noise 10
Robustness, Early Stopping, Parameter Tying and Parameter Sharing, Sparse
Representations, Bagging and Other Ensemble Methods, Dropout. Optimization for
Training Deep Models: How learning differs from optimization. Challenges in Neural
Network Optimization, Basic Algorithms (SGD, momentum, Nesterov momentum),
Parameter Initialization Strategies, Algorithms with Adaptive Learning Rates (AdaGrad,
RMSProp, Adam), Approximate Second-order Methods (Newton, Congugradient,
BFGS), Optimization Strategies.
Unit-2 Convolutional Networks
The Convolution Operation, Convolution ideas (sparse interaction, parameter sharing, 9
and equivalent representation), Pooling, Variants of the Basic Convolution Function,
Structured Outputs, Data Types, Efficient Convolution Algorithms, Random or
Unsupervised Features, The Neuroscientific Basis for Convolutional Networks,
Applications.
Unit -3 Sequence Modeling
Recurrent and Recursive Nets – Unfolding Computational Graphs, Recurrent Neural
Networks, Bidirectional RNNs, Encoder-Decoder Sequence-to-Sequence Architecture, 8
Deep Recurrent Networks, Recursive Neural Networks, The Challenge of Long-Term
Dependencies, Echo State Networks, Leaky Units and Other Strategies for Multiple
Time Scales, The Long Short-Term Memory and Other Gated RNNs, Optimization for
Long-Term Dependencies, Practical methodologies of Deep Learning, Autoencoders,
Applications.
Unit-4 Directed Graphical Models
Conditional independence, representing joint, marginal, and conditional distributions,
Bayesian Networks, D-separation, inference, learning, Hidden Markov Models; 6
Undirected Graphical Models – Markov Random Fields, Spectral Clustering; Advanced
SVM – Multiclass SVM, Multiple Kernels, Kernels for texts and strings.
Unit-5 Reinforcement Learning and Control
Elements of Reinforcement Learning, Model based Decision Making – Markov 7
processes, Markov reward process (MRP), Computing value function of a MRP, Markov
decision process (MDP), Value function, Bellman equations, MDP control, Optimal
value function, Policy iteration, Value iteration; Model Free Prediction and Control –
SARSA, Q-Learning
Course outcomes:
At the end of this course, the students will be able to: CO1 Explain and apply knowledge of regularization
and efficient optimization techniques to improve the performance of deep learning methods. CO2 Explore
the concepts of CNN and apply this to solve related problems. CO3 Apply RNN and Autoencoder
techniques to solve real world machine learning problems. CO4 Explore the representation, learning and
inference of some graphical models. CO5 Aquire the concepts & methods of reinforcement learning and
apply them in decision making.
Text Books:
T1. I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning, The MIT Press, 2016.
T2. K. P. Murphy, Machine Learning : A Probabilistic Perspective, The MIT Press, 2012.
T3. R. S. Sutton and A. G. Barto, Reinforcement Learning : An Introduction, 2nd Edition, The MIT Press,
2018.
T4. J. S. Taylor, M. Mitchell, and N. Cristianini, Kernel Methods for Pattern Analysis, Cambridge
University Press, 2004.
Reference Books:
R1. D. Koller and N. Friedman, Probabilistic Graphical Models : Principles and Techniques, The MIT Press,
2009.
R2. D. Barber, Bayesian Reasoning and Machine Learning, Cambridge University Press, 2012.
R3. C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.
R4. T. M. Mitchell, Machine Learning, McGraw Hill Education, 2013.
Online Resources:
[Link] by Prof. P. K. Biswas, IIT Kharagpur 2.
[Link] by Prof. S. Iyengar and Prof. Padmavati, IIT Ropar 3.
[Link] by Prof. M. Khapra, IIT Madras 4.
[Link]
No of Assignment: 10
Industry Expert Talk: 3
Mapping of COs to POs and PSOs (1: Low, 2: Medium, 3: High)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 3
CO2 3 3 3 2 3
CO3 3 3 3 2 3
CO4 3 3 3 2 3
CO5 3 3 3 2 3

Course Name: HUMAN COMPUTER INTERFACE

Course Code :
L T P Category PC/PE/AC (any one)
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 40 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
To gain an overview of Computer Human Interface, with an understanding of user interface design in general,
and alternatives to traditional "keyboard and mouse" computing; become familiar with the vocabulary
associated with sensory and cognitive systems as relevant to task performance by humans; be able to apply
models from cognitive psychology to predicting user performance in various human-computer interaction
tasks and recognize the limits of human performance as they apply to computer operation; appreciate the
importance of a design and evaluation methodology that begins with and maintains a focus on the user; be
familiar with a variety of both conventional and non-traditional user interface paradigms, the latter including
virtual and augmented reality, mobile and wearable computing, and ubiquitous computing; and understand
the social implications of technology and their ethical responsibilities as engineers in the design of
technological systems. Finally, working in small groups on a product design from start to finish will provide
you with invaluable team-work experience.
Prerequisites: None
Units Teaching Hours
Unit-1 :
Introduction: Importance of user Interface – definition, importance of good design.
Benefits of good design. A brief history of Screen design. The graphical user interface –
popularity of graphics, the concept of direct manipulation, graphical system, 6
Characteristics, Web user – Interface popularity, characteristics- Principles of user
interface.
Unit-2 :
Design process – Human interaction with computers, importance of human
characteristics human consideration, Human interaction speeds, understanding business
junctions. Screen Designing: Design goals – Screen planning and purpose, organizing
screen elements, ordering of screen data and content – screen navigation and flow – 10
Visually pleasing composition – amount of information – focus and emphasis –
presentation information simply and meaningfully – information retrieval on web –
statistical graphics – Technological consideration in interface design.
Unit 3 :
Windows – New and Navigation schemes selection of window, selection of devices
based and screen based controls. Components – text and messages, Icons and increases 6
– Multimedia, colors, uses problems, choosing colors.
Unit- 4 :
HCI in the software process, The software life cycle Usability engineering Iterative
design and prototyping Design Focus: Prototyping in practice Design rationale Design
rules Principles to support usability Standards Golden rules and heuristics HCI patterns
8
Evaluation techniques, Goals of evaluation, Evaluation through expert analysis,
Evaluation through user participation, Choosing an evaluation method. Universal
design, Universal design principles Multi-modal interaction
Unit-5 :
Cognitive models Goal and task hierarchies Design Focus: GOMS saves money
Linguistic models The challenge of display-based systems Physical and device models
Cognitive architectures Ubiquitous computing and augmented realities Ubiquitous 10
computing applications research Design Focus: Ambient Wood – augmenting the
physical Virtual and augmented reality Design Focus: Shared experience Design Focus:
 Applications of augmented reality Information and data visualization Design Focus:
Getting the size right.

Course Outcomes:
CO1: Learn the foundations of Human Computer Interaction.
CO2: Understanding of design technologies for individuals and persons with disabilities.
CO3: Awareness of mobile HCI.
CO4: To learn the guidelines for user interface.
CO5: Ability to apply HCI and principles to interaction design.
Text Books:
1. The essential guide to user interface design, Wilbert O Galitz, Wiley Dream Tech.
2. . Human – Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg, Pearson
Education
Reference Books:
1. the user interface. 3rd Edition Ben Shneidermann, Pearson Education Asia.
2. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech.
3. User Interface Design, Soren Lauesen , Pearson Education.
Online Resources:
6. [Link]

Number of Assignment: 10

Mapping with Program Outcomes (POs) Low = 1, Medium = 2 , High =3

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 2 1 3 3 1 2 2 2
CO2 1 2 1 2 3 1 3 2 2
CO3 2 2 2 3 2 1 2 2 1
CO4 2 3 2 3 3 2 2 2 2
CO5 2 2 3 3 3 1 3 3 2

Course Name: Compiler Design

Course Code : ******
L T P Category PE
Contact Hrs./Week 3 0 0 Internal Marks 40
Contact Hrs./Sem. 36 0 0 Semester Marks 60
Credits. 3 0 0 Exam Hours 3
Course objectives:
• To apply the fundamental of formal attributed grammars for writing the syntax and semantics of
programming languages
• To introduce the concepts underlying the design and implementation of language processors
Prerequisites: Theory of Computation
Units Teaching Hours
Unit-1 : Introduction to Compiler, Lexical analysis
Overview of Compiler, Phases and Passes, Bootstrapping, Cross Compiler.
Lexical Analysis: Role of a Lexical Analyzer, Specification and Recognition of
Tokens, Design of a lexical analyzer as a DFA, lexical analyzer generator, Converting 7
regular expression directly to a DFA, Regular expressions and regular languages, Non-
deterministic and deterministic finite automata (NFA & DFA).

Unit-2
: Syntax Analysis
Role of a parser, Top Down Parsing: LL (1) grammars, predictive parsing.
Bottom Up Parsing: Handle pruning and shift reduce parsing, Operator precedence
parsing, SLR parsers and construction of SLR parsing tables, LR(1) parsers and
construction of LR(1) parsing tables, LALR parsers and construction of efficient LALR 12
parsing tables, parsing using ambiguous grammars, Context free grammars (CFG) and
Context free languages.
Unit 3 : Syntax Directed Translation, Error recovery and Intermediate code generation
Syntax-Directed Definitions (SDD), Semantic Rules, Evaluation of SDD using syntax
tree. Error Detection & Recovery: Lexical Phase errors, syntactic phase errors, semantic
errors. Intermediate Code Generation: Three address codes - quadruples and triples,
types and declarations, translation of expressions, array references, translation of
7
Boolean expressions and control flow statements, Back patching, intermediate code
generation for procedures.
Unit-4 : Code Generation
Issues in Code Generation, Basic Blocks and Flow Graphs, DAG representation of
Basic Blocks, Generating code from DAG. 5
Unit-5 : Code Optimization
Introduction, Principal Sources of Optimization, Optimization of basic Blocks,
5
Introduction to Global Data Flow Analysis, Peephole optimization.
Course Outcomes:
Upon completion of the course, graduates will be able to –
CO1: Review different phases and passes of compiler and its underlying formal models such as finite
state
automata, and their connection to language definition through regular expressions and grammars.
CO2: Differentiate various parser construction techniques.
CO3: Able to use formal attributed grammars for specifying the syntax and semantics of programming
languages and able to generate intermediate code generation.
CO4: Able to generate the code for the target machine.
CO5: Use code optimization techniques to improve the performance of a program in terms of speed &
space.
Text Books:
T1. “Compilers: Principles, Techniques and Tools”, A. V. Aho, M. S. Lam, R. Sethi, J. D. Ullman, Pearson
Education, ISBN 978-81317-2101-8, Second Edition, 2007.
T2. “Engineering a Compiler”, K. Cooper, L. Torozon, Morgan Kaufmann, ISBN 1-55860-698-X, First
Edition, 2003.
Reference Books:
R1. “Lex &Yacc”, J. R. Levine, T. Mason, D. Brown, “Lex &Yacc”, J. R. Levine, T. Mason, D. Brown,
O‟Reilly,
ISBN 1-56592-000-7, Second Edition, 1992.
R2. “Compiler Construction: Principles and Practice”, K. Louden, Course Technology, ISBN 0-534-93972-
4,
First Edition, 1997 (Separate sections for each Text/Reference Books, if applicable)

Online Resources:
[Link]
Number of Assignment:07
Expert Talk: 03
Mapping with Program Outcomes (POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2
CO2 1 2
CO3 2 1 3 2 2
CO4 2 2 2 2 3
CO5 2 2 2 1

Sessional
Course Name: Software Engineering Lab
Course Code : ******
Category ES
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 25
Course objectives:
• Perform requirement analysis and prepare SRS document for a software product.
• Design a software using FOD methodology and create the Structure Charts & DFDs.
• Design a software using OOD methodology and create UML models using a CASE tool.
• Develop the design of User Interfaces of a software using principles of a good design.
• Develop a software using a high-level programming language or tool and test the product.

Experiment-# Assignment/Experiment
1 Introduction to the complete objectives of the course & CASE tool. Assignment of
case study projects to student groups.
2 Requirement Analysis of the assigned case study project.
3 Requirement Specification of the assigned case study project.
4 Function Oriented Design Phase: Creation of structure chart and Level-0 DFD.
5 Function Oriented Design Phase: Creation of DFD Level-1, 2 etc.
6 Object Oriented Design Phase: Creation of Use Case UML model.
7 Object Oriented Design Phase: Creation of Class UML diagram.
8 Object Oriented Design Phase: Creation of Activity and Sequence UML diagrams
9 Object Oriented Design Phase: Creation of Collaboration, Statechart UML
diagrams.
10 Object Oriented Design Phase: Creation of Component and Deployment UML
 diagrams.
11 Development of User Interface of the case study project.
12 Development and Unit testing of the case study project using programming
language of choice (Java, C++, .NET etc.) - Part 1.
13 Development and Unit testing of the case study project using programming
language of choice (Java, C++, .NET etc.) - Part 2.
14 Testing of the case study project (Integration, System test ,Performnce Test).
CO1:Perform requirement analysis and prepare SRS document for a software product.
CO2: Design a software using FOD methodology and create the Structure Charts & DFDs.
CO3: Design a software using OOD methodology and create UML models using a CASE tool.
CO4: Develop the design of User Interfaces of a software using principles of a good design.
CO5: Develop a software using a high-level programming language or tool and test the product

Mapping with Program Outcomes (POs)

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 1 2 2 3
CO2 2 3 2 2 2 3
CO3 2 3 2 3 2 3
CO4 2 3 2 3 2 3
CO5 2 3 3 3 2 1

Course Name: Data Communication and Computer Networks Lab

Course Code : ******
Category PC
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 24 No Of Experiments 25
Course objectives: The objective of this laboratory course is to implement various computer
networking protocols in a high-level programming language and become acquainted with socket
programming & GUI based Network Simulation tools like NetSim/NS3.
• To understand the working principle of various communication protocols.
• To analyze the various routing algorithms.
• To know the concept of data transfer between nodes.

Experiment-# Assignment/Experiment
1 Introduction to Network Hardware and Software, Network Command like Netstat,
Tracert, Ping, Pathping, Telnet, FTP.
2 Basic idea about IPv4 addressing and programming to find the IP address of a
machine and Ethernet address.
3 To study various types of connector devices: Router, Hub, Switch, Bridge and
verification of standard Network topologies: Star, Bus, Ring etc.
4 Introduction to Socket Programming: TCP and UDP sockets.
5 Socket Programming for Echo Client and Echo Server using TCP socket.
6 Socket Programming for Chatting between two Machines using TCP socket.
7 Socket Programming for Echo Client and Echo Server using UDP socket.
8 Socket Programming for communicating between two Machines using UDP
socket.
9 Socket Programming for HTTP web page upload and download.
10 C Program to implement ARP/RARP Protocols.
 11 Introduction to Network Simulator details (NetSim/NS3).
12 Simulation of different MAC Protocols: ALOHA, CSMA etc.
CO1: Experiment with transmission media, connector, Hubs, Switches and installation of NIC.
CO2: Implement client server applications with TCP/UDP Socket Programming in a standalone
machine and over a network.
CO3: Apply HTTP over TCP/UDP connection with help of a Browser.
CO4: Simulate Data link layer protocols using NetSim/NS3.
CO5: Develop applications to communicate over heterogeneous networks (Internet).

Mapping with Program Outcomes (POs)

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 1 2 2
CO2 3 2 3 2 2 2
CO3 2 2 3 2 3 2
CO4 2 3 3 3
CO5 2 2 2 2

Course Name: JAVA and Python Practice Lab

Course Code : ******
Category PC
Contact Hrs./Week 2 Sessional Marks 100
Contact Hrs./Sem. 28 No Of Experiments 25
Course objectives:The objective of this laboratory course is to implement various computer
programming language to increase programming skill using Java and Python. It can prepare the
students for industry ready and reduce the industry requirements.
• To understand the basic business logic to solve the problem
• Explore the advance feature of programming languages
• Solve industry related problems using programming
• Preparing students to meet industry requirements
Experiment-# Assignment/Experiment
1 Experiments on Logic building.
2 Experiments on programming fundamentals
3 Explore basic array operations
4 Explore sorting and searching techniques
5 Experiments on string manipulation
6 Explore string class
7 Explore different packages of Java
8 Create muti-threading programs
9 Experiments on Database connectivity
10 String manipulation using python
11 Implementation of different libraries of python
12 Explore Python connectivity
13 Understand test case-based program
14 Experiments on Dynamic programming
CO1: Understand and trace the execution of programs written in java and python language.
CO2: Develop the business logic and solve the complex problem
CO3: Explore and understand the features of OOP
CO4: Design and implement test case based solutions
CO5: Study the industry requirements and scope

Mapping with Program Outcomes (POs)

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 3
CO2 1 2 2 1
CO3 2 1 3 1
CO4 2 2 2
CO5 2 3 1 1