Course Curriculum (w.e.f.

Session 2021-22)
B. Tech. Computer Science & Engineering

COURSE STRUCTURE
B.TECH.
COMPUTER SCIENCE & ENGINEERING

Under
Choice Based Credit System (CBCS)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Credits Distributions

Sr. No. Category No. of Credits

1 Humanities and Social Sciences (HS) 25
2 Basic Sciences (BS) 24
3 Engineering Sciences (ES) 24
4 Professional Core (PC) 48/50
5 Professional Elective (PE) 26
6 Open Elective (OE) 16
7 Project Work (PW) 17
8 Mandatory Non Credit Courses (MNC) (4 Courses) -
Total 180/182

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

First Semester
TEACHING
S. CONTACTS
CODE SUBJECT SCHEME CREDITS
NO. HRS/WK
L T P
1. BMAS0101 Engineering Mathematics I 3 1 0 4 4
BCHS0101/ Engineering Chemistry/
2. 3 1 0 4 4
BPHS0001 Engineering Physics
English Language Skills for
3. BELH0001 2 0 0 2 2
Communication I
BEEG0001/ Basic Electrical Engineering /
4. 3 1 0 4 4
BECG0001 Electronics Engineering
5. BCSG0002 Computer Programming 3 0 0 3 3
PRACTICALS
BCHS0801/ Engineering Chemistry Lab /
1. 0 0 2 1 2
BPHS0801 Engineering Physics Lab
2. BELH0801 English Language Lab I 0 0 2 1 2
BEEG0800/ Electrical Engineering Lab/
3. 0 0 2 1 2
BECG0800 Electronics Lab I
4. BMEG0801 Engineering Drawing Lab 0 0 2 1 2
5. BCSG0801 Computer Programming Lab 0 0 2 1 2
TOTAL 14 3 10 22 27

Second Semester
TEACHING
S. CONTACTS
CODE SUBJECT SCHEME CREDITS
NO. HRS/WK
L T P
1. BMAS0102 Engineering Mathematics II 3 1 0 4 4
BPHS0001/ Engineering Physics/
2. BCHS0101/ 3 1 0 4 4
Engineering Chemistry
English Language Skills for
3. BELH0002 2 0 0 2 2
Communication II
BECG0001/ Electronics Engineering/
4. 3 1 0 4 4
BEEG0001 Electrical Engineering
5. BMEG0001 Basic Mechanical Engineering 3 1 0 4 4
6. BCSG1001 Python Programming 3 0 0 3 3
PRACTICALS
BPHS0801/ Engineering Physics Lab/
1. 0 0 2 1 2
BCHS0801 Engineering Chemistry Lab
2. BELH0802 English Language Lab II 0 0 2 1 2
BECG0800/ Electronics Lab I/
3. 0 0 2 1 2
BEEG0800 Electrical Engineering Lab
Engineering Workshop Practice
4. BMEG0800 0 0 2 1 2
Lab
5. BCSG1800 Python Programming Lab 0 0 2 1 2

TOTAL 17 4 10 26 31

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Core
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME PRE-
CODE SUBJECT
NO. REQUISITES
L T P J

THEORY
1. BCSC0002 Object Oriented Programming 3 0 0 0 3 3 Programming

Database Management System/

BCSC0003/
2. Applied Database Management 3/4 0 0 0 3/4 3/4
BCSC0014
System
3. BCSC0004 Operating Systems 3 0 0 0 3 3
4. BCSC1005 Computer Organization 3 0 0 0 3 3
Data Structures and
BCSC0006/ Algorithms/
5. 3/4 1 0 0 4/5 4/5 Programming
BCSC0015 Applied Data Structures and
Algorithms
Introduction to Computer
6. BCSC0007 3 0 0 0 3 3 Organization
Microprocessors
7. BCSC0008 Computer Networks 3 1 0 0 4 4
8. BCSC0009 Software Engineering 3 0 0 0 3 3
9. BCSC1010 Discrete Mathematics 3 1 0 0 4 4
Theory of Automata and Formal
10. BCSC0011 3 1 0 0 4 4
Language
Design and Analysis of Programming,
11. BCSC0012 3 0 0 0 3 3 Data Structures
Algorithms
Mathematics,
12. BCSE0101 Digital Image Processing 3 0 0 0 3 3
Programming
PRACTICALS
Object Oriented Programming
1. BCSC0801 0 0 2 0 1 2 Programming Lab
Lab
Database Management System
BCSC0802/
2, Lab/ Applied Database 0 0 2 0 1 2
BCSC0808
Management System

3. BCSC0803 Operating Systems Lab 0 0 2 0 1 2

4. BCSC0804 Computer Organization Lab 0 0 2 0 1 2

Data Structures and Algorithms
BCSC0805/
5. Lab/ Applied Data Structures 0 0 2 0 1 2 Programming Lab
BCSC0809
and Algorithms
6. BCSC0806 Microprocessors Lab 0 0 2 0 1 2
Design and Analysis of Programming,
7. BCSC0807 0 0 2 0 1 2 Data Structures
Algorithms Lab

8. BCSE0131 Digital Image Processing Lab 0 0 2 0 1 2 Programming

36/ 48/ 56/

Total 38
4 16 0
50 58

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective

CONTACTS
TEACHING SCHEME

CREDITS

HR/WK
S.
CODE SUBJECT PRE- REQUISITES
NO.
L T P J

Bouquet: Computer Network and Security

THEORY
Network Programming and Computer
1. BCSE0001 3 0 0 0 3 3
Management Networks
Computer
2. BCSE0002 Principles of Mobile Computing 3 1 0 0 4 4
Networks
Computer
3. BCSE0003 Ad Hoc Networks 3 0 0 0 3 3
Networks
Cryptography and Network Computer
4. BCSE0004 3 0 0 0 3 3
Security Networks
Cyber security and Digital Computer
5. BCSE0005 3 0 0 0 3 3
Forensics Networks
Computer
6. BCSE0006 Information Coding Techniques 3 0 0 0 3 3
Networks
PRACTICALS
Network Programming and Computer
1. BCSE0070 0 0 2 0 1 2
Management Lab Networks
Cryptography and Network Computer
2. BCSE0071 0 0 2 0 1 2
Security Lab Networks
Information Coding Techniques Computer
3. BCSE0072 0 0 2 0 1 2
Lab Networks

Program Elective
TEACHING
CONTACTS
CREDITS

HR/WK

S. SCHEME PRE-
CODE SUBJECT
NO. REQUISITES
L T P J

Bouquet: Software Engineering

THEORY
Software
1. BCSE0051 Software Quality Engineering 3 0 0 0 3 3
Engineering
Software
2. BCSE0052 Service Oriented Architecture 3 0 0 0 3 3
Engineering
Software
3. BCSE0053 Agile Software Development 3 0 0 0 3 3
Engineering
Software
4. BCSE0054 Software Project Management 3 0 0 0 3 3
Engineering
Software
5. BCSE0055 Software Testing 3 0 0 0 3 3
Engineering
Theory of
6. BCSC0013 Compiler Design 3 1 0 0 4 4 Automata &
Formal Language

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
CODE SUBJECT PRE- REQUISITES
NO.
L T P J

Bouquet: Image Processing and Intelligent System

THEORY
Computer Graphics And Mathematics,
1. BCSE0102 3 1 0 0 4 4
Multimedia Programming
Discrete
2. BCSE0103 Soft Computing 3 0 0 0 3 3
Mathematics
3. BCSE0104 Artificial Intelligence 3 0 0 0 3 3 Data Structures
Mathematics,
4. BCSE0105 Machine Learning 3 0 0 0 3 3
Programming
Machine Learning And Its Mathematics,
5. BCSE0106 3 0 0 0 3 3
Applications Programming
PRACTICALS

1. BCSE0132 Soft Computing Lab 0 0 2 0 1 2 Programming

2. BCSE0133 Machine Learning Lab 0 0 2 0 1 2 Programming

PROJECTS

1. BCSE0141 Machine Learning Project 0 0 0 - 2 - Programming

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME PRE-
CODE SUBJECT
NO. REQUISITES
L T P J

Bouquet: Advanced Data Processing

THEORY
Advanced Concepts in Database
1. BCSE0151 3 0 0 0 3 3 DBMS
Systems
2. BCSE0152 Data Mining and Warehousing 3 0 0 0 3 3 DBMS

3. BCSE0153 Business Intelligence 3 0 0 0 3 3 DMW

4. BCSE0154 Information Retrieval System 3 0 0 0 3 3 Data Structure

Distributed and Parallel
5. BCSE0155 3 0 0 0 3 3 DBMS
Databases
TAFL/Compiler
6. BCSE0156 Natural Language Processing 3 0 0 0 3 3
Design
Introduction to Big Data
7. BCSE0157 3 0 0 0 3 3 DBMS
Analytics
8. BCSE0158 Big Data Analytics 3 0 0 0 3 3

PRACTICALS
Data Mining and Warehousing
1. BCSE0181 0 0 2 0 1 2
Lab
2. BCSE0182 Business Intelligence Lab 0 0 2 0 1 2

3. BCSE0183 Big Data Analytics Lab 0 0 2 0 1 2

PROJECTS

1. BCSE0191 Business Intelligence Project 0 0 0 - 2 -

2. BCSE0192 Big Data Analytics Project 0 0 0 - 2 - Programming

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
NO.
CODE SUBJECT PRE- REQUISITES
L T P J

Bouquet: High Performance Computing

THEORY

1. BCSE0201 Advanced Computer Architecture 3 0 0 0 3 3 Computer Organization

2. BCSE0202 Embedded System 3 0 0 0 3 3 Microprocessors

3. BCSE0203 Internet of Things 3 0 0 0 3 3 Microprocessors

Internet of Things And Its
4. BCSE0204 3 0 0 0 3 3
Applications
5. BCSE0205 Distributed System 3 0 0 0 3 3 CN /OS

6. BCSE0206 Parallel Algorithms 3 0 0 0 3 3 CO & Algorithms

7. BCSE0207 Cloud Computing 3 0 0 0 3 3

Cloud Computing and
8. BCSE0208 3 0 0 0 3 3
Virtualization
PRACTICALS

1. BCSE0231 Embedded System Lab 0 0 2 0 1 2

2. BCSE0232 Internet of Things Lab 0 0 2 0 1 2

3. BCSE0233 Parallel Algorithms Lab 0 0 2 0 1 2

4. BCSE0234 Cloud Computing lab 0 0 2 0 1 2

PROJECTS

1. BCSE0241 Internet of Things Project 0 0 0 - 2 -

Cloud Computing And
2. BCSE0242 0 0 0 - 2 -
Virtualization Project

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
NO.
CODE SUBJECT PRE- REQUISITES
L T P J

Bouquet: Development Tools and Technologies

THEORY
Full Stack Using Scripting
1. BCSE0251 3 0 0 0 3 3
Technologies
2. BCSE0252 Full Stack Using Node JS 3 0 0 0 3 3

3. BCSE0253 Full Stack Using C#.net 3 0 0 0 3 3

4. BCSE0254 PHP - Scripting Language 3 0 0 0 3 3

Digital Marketing And
5. BCSE0255 3 0 0 0 3 3
Transformation
PRACTICALS
Full Stack Using Scripting
1. BCSE0281 0 0 2 0 1 2
Technologies Lab
2. BCSE0282 Full Stack Using Node JS Lab 0 0 2 0 1 2

3. BCSE0283 Full Stack Using C#.net Lab 0 0 2 0 1 2

4. BCSE0284 PHP - Scripting Language Lab 0 0 2 0 1 2

PROJECTS
Full Stack Using Scripting
1. BCSE0291 0 0 0 0 2 -
Technologies Project
2. BCSE0292 Full Stack Using Node JS Project 0 0 0 0 2 -

3. BCSE0293 Full Stack Using C#.net Project 0 0 0 0 2 -

4. BCSE0294 PHP - Scripting Language Project 0 0 0 0 2 -

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Projects
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
NO.
CODE SUBJECT PRE- REQUISITES
L T P J

1. BCSJ0950 Mini Project – I 0 0 0 0 2 0

2. BCSJ0951 Mini Project – II 0 0 0 0 2 0

3. BCSJ0971 Project – Part I 0 0 0 0 3 0

4. BCSJ0972 Project – Part II 0 0 0 0 8 0

5. BCSJ0991 Industrial Training 0 0 0 0 2 0

TOTAL 0 0 0 0 17 0

Mandatory Non Graded Course

CONTACTS
TEACHING SCHEME

CREDITS

HR/WK
S.
CODE SUBJECT PRE- REQUISITES
NO.
L T P J

THEORY

1. BCSM0001 Introduction to Cyber Security 2 0 0 0 0 2

2. BCHM0101 Disaster Management 2 0 0 0 0 2

Basic Course in
3. MBAM0001 2 0 0 0 0 2
Entrepreneurship
Leadership And Organizational
4. MBAM0002 2 0 0 0 0 2
Behavior

5. BCHM0202 Environmental Studies 2 0 0 0 2 2

6. BELM0001 Introduction to Bhagavad Gita 2 0 0 0 2 2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Humanities and Social Sciences

CONTACTS
TEACHING SCHEME

CREDITS

HR/WK
S.
CODE SUBJECT PRE- REQUISITES
NO.
L T P J

THEORY
English Language Skills for
1. BELH0001 2 0 0 0 2 2
Communication – I
English Language Skills for
2. BELH0002 2 0 0 0 2 2
Communication – II
3. BELH0003 English for Professional Purposes – I 2 0 0 0 2 2

4. BELH0004 English for Professional Purposes – II 2 0 0 0 2 2

5. BELH0006 Ethics & Values 2 0 0 0 2 2

6. MBAH0005 Industrial Management 3 0 0 0 3 3

PRACTICALS

1. BELH0801 English Language Lab – I 0 0 2 0 1 2

2. BELH0802 English Language Lab – II 0 0 2 0 1 2

3. BTDH0301 Soft Skills – I 0 0 2 0 1 2

4. BTDH0302 Soft Skills – II 0 0 2 0 1 2

5. BTDH0303 Soft Skills – III 0 0 8 0 4 8

6. BTDH0304 Soft Skills – IV 0 0 8 0 4 8

TOTAL 13 0 24 0 25 37

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Basic Sciences

CONTACT
S HR/WK
CREDITS
TEACHING SCHEME
S.
CODE SUBJECT PRE- REQUISITES
NO.
L T P J

THEORY

1. BMAS0101 Engineering Mathematics I 3 1 0 0 4 4

2. BMAS0102 Engineering Mathematics II 3 1 0 0 4 4

3. BMAS0103 Engineering Mathematics III 3 1 0 0 4 4

4. BCHS0101 Engineering Chemistry 3 1 0 0 4 4

5. BPHS0001 Engineering Physics 3 1 0 0 4 4

6. BCHS0201 Environmental Studies 2 0 0 0 2 2

PRACTICALS

1. BCHS0801 Engineering Chemistry Lab 0 0 2 0 1 2

2. BPHS0801 Engineering Physics Lab 0 0 2 0 1 2

TOTAL 17 5 4 0 24 26

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Engineering Sciences

CONTACTS
TEACHING SCHEME

CREDITS

HR/WK
S.
CODE SUBJECT PRE- REQUISITES
NO.
L T P J

THEORY

1. BEEG0001 Basic Electrical Engineering 3 1 0 0 4 4

2. BECG0001 Electronics Engineering 3 1 0 0 4 4

3. BMEG0001 Basic Mechanical Engineering 3 1 0 0 4 4

4. BCSG1001 Python Programming 3 0 0 0 3 3

5. BCSG0002 Computer Programming 3 0 0 0 3 3

PRACTICALS

1. BEEG0800 Electrical Engineering Lab 0 0 2 0 1 2

2. BECG0800 Electronics Lab I 0 0 2 0 1 2

Engineering Workshop Practice
3. BMEG0800 0 0 2 0 1 2
Lab
4. BMEG0801 Engineering Drawing Lab 0 0 2 0 1 2

5. BCSG1800 Python Programming Lab 0 0 2 0 1 2

6. BCSG0801 Computer Programming Lab 0 0 2 0 1 2

Total 15 3 12 0 24 25

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Open Elective (Offer to other Departments)

TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
CODE SUBJECT PRE- REQUISITES
NO.
L T P J

THEORY
Data Structures and
1. BCSO0001 3 0 0 0 3 3 Programming
Applications
Introduction To Object Oriented
2. BCSO0002 3 0 0 0 3 3 Programming
Programming
Essentials of Information Object Oriented
3. BCSO0003 3 0 0 0 3 3
Technology Programming
4. BCSO0004 Elements of Soft Computing 3 0 0 0 3 3

5. BCSO0005 Fundamentals of Computer 2 0 0 0 2 2

6. BCSO0006 Introduction to Programming 2 0 0 0 2 2

PRACTICALS
Data Structures and Applications
1. BCSO0070 0 0 2 0 1 2 Programming
Lab
Introduction To Object Oriented
2. BCSO0071 0 0 2 0 1 2 Programming
Programming Lab
Essentials of Information Object Oriented
3. BCSO0072 0 0 2 0 1 2
Technology Lab Programming
4. BCSO0073 Elements of Soft Computing Lab 0 0 2 0 1 2

5. BCSO0074 Fundamentals of Computer Lab 0 0 2 0 1 2

6. BCSO0075 Programming Lab 0 0 2 0 1 2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSG1001: PYTHON PROGRAMMING

Objective: This course introduces the solving of mathematical problems using Python programming using
Object Oriented concepts and its connectivity with database.

Credits:05 L-T-P-J:4-1-0-0

Module Teaching
No. Content Hours

Introduction to Python: Introduction and Basics; Setting up path Python Data

Variables & Operators: Data Variables and its types, id () and type () functions,
Coding Standards;
Control Structures: if-else, elif, Nested if, Iteration Control structures, Break,
Continue & Pass;
I String Manipulation: Accessing Strings, Basic Operations, String slices Function 22
and Methods.
Lists: Introduction, accessing list, Operations, Working with lists, Function and
Methods.
Tuple: Introduction, accessing tuples, Operations, Working, Functions and Methods.
Dictionaries: Introduction, accessing values in dictionaries, Working with
dictionaries, Properties, Functions.

Functions: Defining & Calling a function, Passing arguments to functions – Mutable

& Immutable Data Types, Different types of arguments, Recursion, Scope of
variables;

Modules and Packages: User-defined modules and Standard Library: random,

numpy, scipy, sys, Math Module, String Module, List Module, Date & Time Module,
II Regular Expressions: match, search, replace; 22

Input-Output: Printing on screen, reading data from keyboard, Opening and closing
file, Reading and writing files, Functions.
Exception Handling: Exception, Exception Handling, except clause, try? finally
clause, User Defined Exceptions.
Basics of Python for Data Analysis, Introduction to series and data frames& Python
using Pandas.

Text Books:
 Paul Barry: “Head First Python “O’Reilly Media, Inc.", 2010.
Reference Books:
 Bret Slatkin: “Effective Python: 59 Specific ways to write better Python”, Addison Wesley, 2015.

Outcome: After completion of course, the student will be able to:

 CO1: Understand the basics of Python Programming.
 CO2: Apply the concepts of control structures and string manipulations of python programming.
 CO3: Understand the use of data structures available in Python List, Tuple and Dictionary.
 CO4: Experiment user-defined functions and access built-in functions.
 CO5: Experiment user-defined modules and access built-in modules- math, random, string, date,
time, date time.
 CO6: Develop the programs using the concept of File Handling.
 CO7: Develop programs based on Exceptional Handling.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO2/PSO4
CO2 PO4/PSO1
CO3 PO5/PSO4
CO4 PO5,PO7/PSO1
CO5 PO2,PO8/PSO4
CO6 PO3,PO10/PSO2
CO7 PO5,PO9/PSO1

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSG0002: COMPUTER PROGRAMMING

Objective: To impart adequate knowledge on the need of problem solving techniques and develop
programming skills to implements applications using the concepts of C Language. Also by learning the
programming constructs they can easily switch over to any other language in future.

Credits:05 L-T-P-J:4-1-0-0

Module Teaching
No. Content Hours
Generation of Programming Languages: Low, Assembly, High and 4GL.
Language Processors: Compiler, Interpreter, Assembler, Linker and Loader.
Algorithm: Introduction, Features, Different Ways of stating Algorithms.
Flow Chart: Introduction, Standard, Guidelines, Advantages and Limitations of using
Flowcharts.
Basics of C: Overview, Structure of a C program, Identifier, Keywords, Variables, Data
types, Formatted Input and output.
Operators and Expression: Assignment, Unary, Arithmetic, Relational, Logical, Bitwise,
Conditional, Special operators and their precedence & Associativity.
IEEE representation of data types like float & double, Lvalue and Rvalue
Type Conversion: Type Promotion in expression, Conversion by Assignment, Truncation
I and Casting Arithmetic expression. 25
Decision and Case Control Structure: if, if-else, nested if-else, Decisions using switch,
switch versus if-else ladder, goto.
Loop Control Structure: For loop, while loop, do-while loop, nesting of loops, break, and
continue.
Arrays: Introduction, one-dimensional and two-dimensional Array-Declaration,
Initialization, Address Calculation.
Operations on Arrays: Insertion, Deletion, Linear Search & Bubble Sort.
String: Introduction, One dimensional and two dimensional Array-Declarations,
Initialization
Operations on String: Length, Copy, Reverse, Concatenate, Compare with & without
built-in functions.
Functions: Declaration and Definition, Category of Functions, Parameter Passing
Techniques – Call by Value, Passing Arrays to Functions.
Introduction to Storage Classes: Auto, Static, Extern and Register.
Recursion: Mechanics of Recursive Call, Implementation of Recursion, Recursion vs.
Iteration.
The C Preprocessor: Introduction, Macro Expansion and File Inclusion, Conditional
Compilation and Miscellaneous Directives.
Pointers: Declaration and Initialization of Pointer Variables, Accessing a Variable
II through its Pointer, Arrays and Pointers, Pointer and Strings, Pointer Arithmetic, Pointers 25
to Pointers, Array of Pointers, Pointer to an Array, Two Dimensional Array and Pointers,
Pointers to Functions, Dynamic Memory Allocation, void Pointer and Null Pointer.
User Defined Types: enum, typedef, Union and Structure - Declaration, Initialization,
Nested Structures, Arrays of Structures, Structure and Pointer, Passing Structure
Through Function. Difference between Structures and Union.
File Handling: Data and Information, File Concepts, File Organization, File Operations:
Open, Read, and Close, Trouble in Opening a File. File Opening Modes, Working with Text
Files. Random Access to Files of Records.
Introduction to Command Line Arguments.

Text Books:
 Behrouz A. Forouzan and Richard F. Gilberg, “Computer Science – A Structured Programming
Approach Using C”, C Language Learning, 2007

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Reference Books:
 Herbert Schildt, “C: The Complete Reference”, 5th Edition, McGraw Hill Education
 K. N. King, “C Programming a Modern Approach”, W. W. Norton, 2nd Edition, 2008.
 Kernighan and Ritche, “The C Programming Language”, PHI, 2ndEdition, 2011.
 P. Dey and M. Ghosh, “Programming in C”, Oxford University Press 2nd Edition, 2013.

Outcome: After completion of course, the student will be able to:

 CO1: Understand the basic concepts of problem solving skills.
 CO2: Apply the basic principles of programming in C language.
 CO3: Understand the concepts of arrays and strings in C language.
 CO4: Apply the concepts of functions to solve real world problems.
 CO5: Illustrate the concepts of recursion.
 CO6: Understand the concepts of pointers in C language.
 CO7: Understand the basic concepts of file handling.
 CO8: Develop algorithmic solutions to simple computational problems.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO4,PO12/PSO1,PSO3
CO2 PO1,PO2,PO3,PO10/PSO1,PSO3
CO3 PO1,PO2,PO3,PO4/PSO1,PSO3
CO4 PO1,PO3, PO12/PSO1,PSO2
CO5 PO1,PO2,PO4 /PSO1,PSO3
CO6 PO1,PO2,PO3,PO4/PSO1,PSO2
CO7 PO1,PO3,PO6 /PSO1
CO8 PO1,PO2,PO4,PO10,PO12/PSO1,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0002: OBJECT ORIENTED PROGRAMMING

Objective: This course introduces the Object-Oriented programming paradigm to students. It also teaches
a student how to think objectively and model a Java program for solving real-world problems.

CREDITS: 3 L-T-P-J:3-0-0-0
Module Teaching
Content
No. Hours
Object-Oriented Programming: Features of Object-Oriented Programming,
Introduction to Object-Oriented Java Programming.
g Java Technology & Environment: Understanding the compilation process of
the JVM, JVM vs JDK vs JRE, Key Features of Java, Structure of a simple Java
program.
Working with Java Primitive Data Types: Strongly Typed nature of Java,
Primitive Data Types in Java, The new ‘var’ keyword, Scope of a variable.
Accepting User Input in Java Programs: using the Scanner class, using
command line arguments.
Programming Constructs: Sequence, Selection, Iteration & Transfer
Statements, For-Each Loop.
Working with Java Arrays: Declaring and Initializing One-Dimensional and
Two-Dimensional Arrays in Java, Introduction to java. util. Arrays class.
The String API: String Data Type, commonly used methods from the String API,
String Tokenizer, String Builder & String Buffer.
I 20
Creating and Using Methods: Signature of a method, Types of Methods,
Overloading methods in a class, Static and Non-Static Methods.
Describing and Using Objects & Classes: Declare the structure of a Java class,
declaring members of a class (fields and methods), declaring and using Java
Objects, lifecycle of an Object (creation, assignment, dereferencing and garbage
collection), Constructors of a class, Overloading Constructors, Constructor
chaining using ‘this’ and ‘super’ keyword.
Using Java Packages: create and import Java packages and static imports,
abstracting program logic to packages, creating executable main class, running
the executable class inside a package.
Applying Encapsulation: Using access modifiers with/in a class, principles of
encapsulation.
Programming Abstractly Through Interfaces: create and implement
Interfaces for programs, private and default methods in Interfaces, declaring
Abstract Classes, Constructors in Abstract Classes. Marker Interface, Functional
Interfaces, Lambda Expressions in Java.
Reusing Implementations using Inheritance: Declaring Subclasses and Super
classes, extend Abstract Classes, implementing Interfaces, exploring
polymorphic behavior by overriding methods, Object Types vs Reference Types,
differentiate overloading, overriding and hiding.
Exception Handling: Exception Hierarchy, Need of Exception Handling,
Checked Exceptions, Unchecked Exceptions and Errors, Try-Catch Blocks,
Finally, Throw & Throws Keywords, creating and handling Custom Exceptions.
Threads in Java: Life Cycle of a Thread, creating threads using Runnable and
Thread, ‘sleep ()’, Thread Priorities.
II Using Wrapper Classes: Wrapper Classes in Java, Boxing-Unboxing-Auto 18
Boxing-Auto Unboxing.
Generics & Collections: Creating Generic classes, Generic Methods, Diamond
Notation, Wildcards, Type Erasure, Collection Hierarchy, Base Interfaces, Lists,
Sets and Maps.
The Stream API: Introduction to the Stream API, using lambda expressions in
Streams.
Regular Expressions: Pattern and Matcher Class.
JDBC: JDBC Drivers, Connecting to a MySQL Database, Driver Manager,
Connection Interface, Statement Interface, Result Set Interface, Prepared
Statements.
Text Book:

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 Herbert Schildt, “The Complete Reference, Java Eleventh Edition”, Oracle Press.2019.

Reference Book:
 Cay S Hosrtmann, “Core Java Volume I—Fundamentals, Eleventh Edition”, Pearson,2018.
 Rogers Cadenhead, “Sams Teach Yourself Java in 21 Days (Covers Java 11/12), 8th Edition”,
Pearson,2020.

Outcomes: After completion of the course, students will be able to -

 CO1: Understand the basics of Object-Oriented Programming paradigm.
 CO2: Construct the logical flow of programs by using the sequence, selection, iterations and
transfer statements.
 CO3: Apply the concepts of Object-Oriented Programming to model programs in Classes, Abstract
Classes, Interfaces and Enums, and simplify program function by dissecting it into methods.
 CO4: Understand accessibility of members in a program unit and create packages to prevent
namespace collisions.
 CO5: Predict run-time errors in a program by examining program functioning.
 CO6: Show the parallel processing capabilities of a program using a multithreading concept.
 CO7: Experiment with the predefined classes and interfaces defined in the Collections
Framework.
 CO8: Develop a program using JDBC connectivity to demonstrate data persistence.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3/PSO1,PSO2
CO2 PO1,PO3/PSO1,PSO2
CO3 PO1,PO2/PSO1,PSO2
CO4 PO1/PSO2,PSO4
CO5 PO1,PO2,PO4/PSO4
CO6 PO1,PO2, PO3/PSO2
CO7 PO1,PO2,PO11/PSO2
CO8 PO1,PO2,PO3/PSO1,PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0003: DATABASE MANAGEMENT SYSTEM

Objective: The objective of the course is to enable students to understand and use a relational database&
NoSQL system. Students learn how to design and create a good database.

Credits: 03 L-T-P-J: 3-0-0-0

Module Teaching
Content
No. Hours
Introduction: An Overview of Database Management System, Database System
Vs File System, Database System Concept and Architecture, Data Model Schema
and Instances, Data Independence, Database Language and Interfaces (DDL,
DML, DCL), Database Development Life Cycle (DDLC) with Case Studies.
Data Modeling Using the Entity-Relationship Model: ER Model Concepts,
Notation for ER Diagram, Mapping Constraints, Keys, Specialization,
I Generalization, Aggregation, Reduction of an ER Diagram to Tables, Extended 20
ER Model.
Relational Data Model and Language: Relational Data Model Concepts, Integrity
Constraints, Entity Integrity, Referential Integrity, Keys Constraints, Domain
Constraints, Relational Algebra
Database Design & Normalization I: Functional Dependencies, Primary Key,
Foreign Key, Candidate Key, Super Key, Normal Forms, First, Second, Third
Normal Forms, BCNF, Non-Redundant Cover, Canonical Cover
Database Design & Normalization II: 4th Normal Form, 5th Normal Form,
Lossless Join Decompositions, MVD and JDs, Inclusion Dependence.
File Organization: Indexing, Structure of Index files and Types, Dense and
Sparse Indexing
Transaction Processing Concept: Transaction System, Testing of
Serializability, Serializability of Schedules, Conflict & View Serializable
II Schedule, Recoverability, Recovery from Transaction Failures, Log Based 20
Recovery, Deadlock Handling.
Concurrency Control Techniques: Concurrency Control, Locking Techniques
for Concurrency Control, 2PL, Time Stamping Protocols for Concurrency
Control, Validation Based Protocol.
Distributed Database: Introduction of Distributed Database, Data
Fragmentation and Replication.
Text Books:
 Elmasri and Navathe, “Fundamentals of Database Systems”, 6th Edition, Addison Wesley,2010.
 Sadalage, P. &Fowler, “NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot
Persistence”, Pearson Education,2012.

References Books:
 Date C J,” An Introduction to Database Systems”, 8th Edition, Addison Wesley.
 Korth, Silbertz and Sudarshan, “Database Concepts”, 5th Edition, TMH,1998.
 Redmond, E. & Wilson, “Seven Databases in Seven Weeks: A Guide to Modern Databases and the
NoSQL Movement”, 1st Edition.
Outcome: After the completion of the course, the student will:
 CO1: Understand the concept of database management systems and Relational database.
 CO2: Identify the various data model used in database design.
 CO3: Design conceptual models of a database using ER modeling for real life applications and
construct queries in Relational Algebra.
 CO4: Create and populate a RDBMS for a real life application, with constraints and keys using SQL.
 CO5: Select the information from a database by formulating complex queries in SQL.
 CO6: Analyze the existing design of a database schema and apply concepts of normalization to design
an optimal database.
 CO7: Discuss indexing mechanisms for efficient retrieval of information from a database.
 CO8: Discuss recovery system and be familiar with introduction to web database, distributed
databases.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1 /PSO1
CO2 PO2, PO3/ PSO2
CO3 PO2,PO3,PO6,PO11/PSO1,PSO2,PSO4
CO4 PO1,PO3/PSO1
CO5 PO1,PO5/PSO1
CO6 PO2,PO3,PO9/ PSO2
CO7 PO1,PO11 /PSO1
CO8 PO1,PO3,PO12/ PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0004: OPERATING SYSTEMS

Objective: This course aims to introducing the concept of computer organization. In particular, it focuses
on basic hardware architectural issues that affect the nature and performance of software.

Credits:03 L-T-P-J:3-0-0-0

Module Teaching
No. Content Hours

Introduction: Operating System and its Classification - Batch, Interactive,

Multiprogramming, Time sharing, Real Time System, Multiprocessor Systems,
Multithreaded Systems, System Protection, System Calls, Reentrant Kernels, Operating
System Structure- Layered structure, Monolithic and Microkernel Systems, Operating
System Components, Operating System Functions and Services.
Processes: Process Concept, Process States, Process State Transition Diagram, Process
Control Block (PCB), Process Scheduling Concepts, Threads and their management.
I 20
CPU Scheduling: Scheduling Concepts, Performance Criteria, Scheduling Algorithms,
Multiprocessor Scheduling.
Process Synchronization: Principle of Concurrency, Implementation of concurrency
through fork/join and parbegin/parend, Inter Process Communication models and
Schemes, Producer / Consumer Problem, Critical Section Problem, Dekker’s solution,
Peterson’s solution, Semaphores, Synchronization Hardware.
Classical Problem in Concurrency: Dining Philosopher Problem, Readers Writers
Problem.
Deadlock: System model, Deadlock characterization, Prevention, Avoidance and
detection, Recovery from deadlock, Combined Approach.
Memory Management: Multiprogramming with fixed partitions, Multiprogramming
with variable partitions, Paging, Segmentation, Paged segmentation.
II Virtual memory concepts: Demand paging, Performance of demand paging, Page 20
replacement algorithms, Thrashing, Locality of reference.
I/O Management and Disk Scheduling: I/O devices, I/O subsystems, I/O buffering,
Disk storage and disk scheduling.
File System: File concept, File organization and access mechanism, File directories, File
allocation methods, Free space management.

Text Books:
 Silberschatz, Galvin and Gagne, “Operating Systems Concepts”,9th Edition, Wiley, 2012.

Reference Books:
 SibsankarHalder and Alex a Aravind,” Operating Systems”, 6th Edition, Pearson Education, 2009.
 Harvey M Dietel, “An Introduction to Operating System”, 2nd Edition, Pearson Education, 2002.
 D M Dhamdhere, “Operating Systems: A Concept Based Approach”, 2nd Edition, 2006.
 M. J. Bach, “Design of the Unix Operating System”, PHI, 1986.

Outcome: After completion of course, the student will be able to:

 CO1: Understand the classification of operating system environment.
 CO2: Understand the basic of process management.
 CO3: Apply the concept of CPU process scheduling for the given scenarios.
 CO4: Illustrate theprocess synchronization and concurrency process in operating system.
 CO5: Analyze the occurrence of deadlock in operating system.
 CO6: Describe and analyze the memory management and its allocation policies.
 CO7: Understand the concepts of disk scheduling.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO7/PSO1
CO2 PO1,PO2 /PSO1
CO3 PO1,PO4/PSO1,POS3
CO4 PO3,PO4,PO6/PSO3,PSO4
CO5 PO1,PO4/PSO1,PSO3
CO6 PO1,PO2/PSO1,PSO3
CO7 PO1,PO2,PO7/PSO1,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC1005: COMPUTER ORGANIZATION

Objective: This course aims to introducing the concept of computer organization. In particular, it focuses
on basic hardware architectural issues that affect the nature and performance of software.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Basic Organization: Basic organization of the computer and Block level
description of the functional units, Number representation; 1’s and 2’s
Complement, Integer Representation, Arithmetic Addition & Subtraction
with overflow. fixed and floating-point number representation, IEEE
standard floating point representation. Introduction to Combinational
Circuit- half adder, full adder, binary adder/subtractor, carry look ahead
I adders. Multiplexer and Demultiplexer, Register, bus and memory 20
transfer.
Central Processing Unit: Addition and subtraction of signed numbers,
Multiplication: Signed operand multiplication, Booths algorithm.
Processor organization, general registers organization, stack organization,
Three, Two, One & Zero address instruction. Addressing modes, Micro-
operations (Arithmetic, Logical & Shift) and its applications.

Multiprogramming and Multiprocessing: Flynn’s classification,

Introduction to pipelined operation. Instruction types, formats, Instruction
cycles.
Control Unit: Execution of a complete instruction. Hardwired and micro
programmed control unit. Unconditional and Conditional branching.
Microinstruction with next address field, pre-fetching microinstructions,
Concept of horizontal and vertical microprogramming.
Memory: Basic concept of Memory and its hierarchy, RAM memories, 2D,
II 20
2 & 1/2D memory organization. ROM memories. Cache memories: concept
and design issues, performance, address mapping and replacement.
Virtual memory: concept and implementation.
Input/Output: Peripheral devices, I/O interface, I/O ports, Interrupts:
interrupt hardware, types of interrupts and exceptions. Buses, bus
architecture, types of buses and bus arbitration. Modes of Data Transfer:
Programmed I/O, interrupt initiated I/O and Direct Memory Access., I/O
channels and processors. Standard communication interfaces.

Text Books:
 M. Mano, “Computer System Architecture”, 3rd Edition, PHI,1996

Reference Books:
 D.W. Patterson, “Computer Organization and Design”, 4thEdition, Elsevier Publication, 2008.
 William Stalling, “Computer Organization”,8th Edition, PHI, 2011.
 V. CarlHamacher, Zaky, “Computer Organization”,4th International Edition, TMH, 1996.
 John P Hays, “Computer Organization”, 2nd Edition, TMH.
 Tannenbaum , “Structured Computer Organization”, 5thEdition, PHI, 2005.
 P Pal Chaudhry, “Computer Organization & Design”, 2ndEdition, PHI, 2002.

Outcome: After completion of the course, the student will be able to:
 CO1: Understand the basics of digital computer system.
 CO2: Demonstrate the principle of arithmetic operations on unsigned, signed integers and
floating point numbers.
 CO3: Understand the concepts of Combinational and Sequential circuits and their applications.
 CO4: Understand the CPU architecture and organization.
 CO5: Explain the basic concepts of pipelining.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 CO6: Design the steps for the execution of the complete instruction for hardwired and micro-
programmed control unit.
 CO7: Explain the function of memory hierarchy.
 CO8: Determine the interface of CPU with input/output devices and their modes of transfer.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3/PSO1
CO2 PO1,PO3/PSO1
CO3 PO2,PO3,PO5/PSO2
CO4 PO2,PO3,PO4/PSO1,PSO3
CO5 PO2,PO3,PO4/PSO2
CO6 PO1,PO2,PO3/PSO1,PSO3
CO7 PO2,PO3,PO5/PSO2,PSO3
CO8 PO3,PO4/PSO1

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0006: DATA STRUCTURES AND ALGORITHMS

Objective: The objective of this course is that students will construct and application of various data
structures and abstract data types including lists, stacks, queues, trees and graphs.

Credits: 04 L–T–P-J: 3–1–0-0

Module Teaching
Content
No. Hours
Introduction: Basic Terminology, Elementary Data Organization, Properties of an
Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic
Notations – Big-Oh; Operations on Data Structure, Abstract Data Types (ADT).
Linked Lists: Implementation of Singly Linked Lists, Doubly Linked List, Circular
Linked List, Operations on a Linked List - Insertion, Deletion, Traversal; Generalized
Linked List, Polynomial Representation and Addition.
Stacks: Primitive Stack Operations - Push & Pop, Array and Linked Implementation of
Stack in C, Application of Stack: Prefix and Postfix Expressions, Evaluation of Postfix
I 20
Expression, conversion of Infix to Postfix expression, Recursion, Principles of
Recursion, Tail Recursion, Removal of Recursion, use of stack in Recursion, Tower of
Hanoi Problem.
Queues: Operations on Queue - Add, Delete operations, Implementation of Queue
Using Array and Linked List, Circular Queues, Deque and Priority Queue.
Trees: Basic Terminology, Array Representation and Dynamic Representation;
Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Tree Traversal
Algorithms - Inorder, Preorder and Postorder; Threaded Binary Trees, Traversing
Threaded Binary Trees.
Search Trees: Binary Search Trees (BST), Insertion and Deletion in BST, AVL Trees,
Introduction to M-Way Search Trees, B Trees.
Searching: Sequential Search, Binary Search.
Sorting: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Two Way Merge Sort,
and Heap Sort.
II 20
Graphs: Terminology, Adjacency Matrices, Adjacency List, Graph Traversal - Depth
First Search and Breadth First Search; Spanning Trees, Minimum Cost Spanning
Trees – Prim’s and Kruskal’s Algorithm; Shortest Path Algorithm – Bellman-Ford and
Dijkstra’s Algorithm.
Hashing & Indexing: Hash Function, Collision Resolution Strategies. Primary Indices,
Secondary Indices, Indexing and Hashing Comparisons.

Text Book:
 Aaron M. Tanenbaum, YedidyahLangsam and Moshe J. Augenstein, “Data Structures Using C and
C++”, 2nd Edition, PHI, 2009.

Reference Books:
 Horowitz and Sahani, “Fundamentals of Data Structures”, 3rd Edition, W H Freeman & Co, 2004-
05.
 Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with Applications”,
2nd Edition, TMH, 2007.
 R. Kruse, “Data Structures and Program Design in C”, 2nd Edition, Pearson Education, 2004.
 Lipschutz Schaum’s Outline Series, “Data Structures”, 12th Reprint, TMH, 2010.
 G A V Pai, “Data Structures and Algorithms”, TMH, 2009.

Outcome: After completion of course, student will be able to:

• CO1: Understand the basic concepts of the data structure and algorithms.
• CO2: Understand the complexity representation in terms of Big Oh, Theta and Omega notations.
• CO3: Apply the associated operations in linear data structure like stack, Queue and link list.
• CO4: Apply the associated operations in Binary Search Tree, AVL Tree and M- Way Search Tree.
• CO5: Understand the basic algorithms such as heap sort, graph traversal, quick sort, AVL
trees, and hashing.
• CO6: Select the appropriate data structure to solve the problem.
• CO7: Apply the shortest path algorithm to solve real life problem.
Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

COs POs/PSOs
CO1 PO1/PSO1,PSO2
CO2 PO1, PO2/PSO1,PSO2
CO3 PO1/PSO1
CO4 PO1,PO4/PSO1
CO5 PO1,PO4/PSO3
CO6 PO2/PSO4
CO7 PO2/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0007: INTRODUCTION TO MICROPROCESSORS

Objective: Objective of this subject is to introduce the basic concepts of microprocessor and assembly
language programming. Identify and explain the operation of the components of typical microprocessor: the
role of the ALU, registers, stack and the use of interrupts.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction: Microprocessors Evolution and Types, Basics of Pentium
Microprocessor, Microprocessor Application,
8-Bit Microprocessor:8085 Microprocessor and its Architecture, Addressing
Modes, The 8085 Programming Model, Instruction Classification, Instruction
Format, Overview of Instruction Set - Data Transfer Operation, Arithmetic
I 20
Operation, Logic Operations and Branch Operations; Introduction to
Assembly Language Program.
Programming Technique with Additional Instruction: Looping, Counting,
Indexing, Additional Data Transfer and 16-Bit Arithmetic Instruction,
Counters and Time Delays, Stack and Subroutine.
16 Bit Microprocessor: Architecture of 8086 – Register Organization,
Execution Unit, Bus Interface Unit, Signal Description, Physical Memory
Organization, Mode of Operation, I/O Addressing Capabilities.
Peripheral Interfacing: I/O Programming, Programmed I/O, Interrupt
II 18
Driven I/O, DMA I/O, Memory-Mapped I/Os.
Peripheral Devices: 8237 DMA Controller, 8255 Programmable Peripheral
Interface, 8253/8254 Programmable Timer/Counter, 8259 Programmable
Interrupt Controller.

Text Books:
 N Senthil Kumar, MSaravanan, and S Jeevananthan, “Microprocessors and Microcontrollers”,
Oxford University Press India, 2010.
Reference Books:
 Ramesh S. Gaonkar , “Microprocessor Architecture Programming and Applications with 8085”, 4th
Edition, Penram International Publishing, 2000.
 Ray A.K. Bhurchandi.K.M, “Advanced Microprocessor and Peripherals”, TMH, 2002.
 D. V. Hall, “Microprocessors and Interfacing: Programming and Hardware”, 2nd Edition, TMH,
1992.
 Y.C. Liu and G.A. Gibson, “Microcomputer Systems: The 8086/8088 Family Architecture
Programming and Design”, 2nd Edition, PHI, 2003.

Outcome: After the completion of the course, the student will be able to:
• CO1: Demonstrate the Microprocessor internal architecture and its operations.
• CO2: Develop programs based on 8085 microprocessor instruction set and addressing mode.
• CO3: Develop program using looping, counting, indexing, counter and time delays.
• CO4: Understand the concept of stack and subroutine for modular approach.
• CO5: Compare accepted standards and guidelines to select microprocessor (8085 & 8086) to
meet performance requirements.
• CO6: Analyze the concept of interfacing the processor to external device with I/O programming
& Interrupt Driven I/O.
• CO7: Understand the working of interfacing chips (8237, 8253/54, 8255 & 8259).

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO1
CO2 PO2,PO3/PSO1,PSO2
CO3 PO2,PO3/PSO1,PSO2
CO4 PO1,PO2,PO3/PSO1,PSO3
CO5 PO2,PO3,PO5/PSO1,PSO3
CO6 PO1,PO2/PSO3
CO7 PO1,PO2,PO4/PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC 0008: Computer Networks

Objective: The objective is to understand fundamental underlying principles of computer networking,
details and functionality of layered network architecture.

Credits: 03 Semester - IV L–T–P-J: 3–1–0-0

Module Teaching
Content
No. Hours
Introduction Concepts: Goals and Applications of Networks, Network
structure and architecture, The OSI reference model, services, Network
Topology Design, Physical Layer Transmission Media, Line coding scheme,
switching methods (circuit switching, Packet switching), TDM.
I Medium Access sub layer: Medium Access sub layer - Channel Allocations, 20
LAN protocols - ALOHA protocols, CSMA, CSMA/CD, Overview of IEEE
standards.
Data Link Layer: Error detection and correction, Flow control (sliding
window protocol)
Network Layer: Network Layer –IP addressing, subnet, CIDR, VLSM,
Internetworking, Address mapping, routing. Connecting devices.
Transport Layer: Transport Layer - Design issues, connection
management, Flow control, TCP window management, congestion control-
II slow start algorithm. 20
Application Layer: Data compression, Data Encryption, File Transfer, DNS,
HTTP, SMTP, TELNET
Introduction to IPv6, transition from IPv4 to IPv6.

Text Books:
• Forouzan B. A. , “Data Communication and Networking”, 4th Edition, McGrawHill ,2004.

References:
• Kurose, J.F. and Ross K.W., “Computer Networking: A Top-Down Approach Featuring the Internet”,
3rd Edition, Addison-Wesley,2005.
• A.S. Tanenbaum, “Computer Networks”, 2nd Edition, Prentice Hall India,2006.

Outcome: After the completion of the course, the student will be able to:
• CO1: Understand the concept of OSI and TCP/IP reference model.
• CO2: Understand the basics of data transmission at physical layer.
• CO3: Understand the channel allocation using ALOHA, CSMA and CSMA/CD.
• CO4: Apply error detection and correction technique to eliminate transmission error.
• CO5: Analyze the fixed and variable length address (IPv4) subneting for the given scenarios.
• CO6: Understand the design issues of the transport layer.
• CO7: Understand the mechanism of protocols at application layer such as FTP, HTTP, Telnet,
DNS.
• CO8: Understand IPv6 addressing and differentiate it from IPv4.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3,PO12/PSO1
CO2 PO1/PSO2
CO3 PO1,PO4/PSO1,PSO4
CO4 PO1,PO3/PSO1
CO5 PO1,PO3,PO4,PO6/PSO3
CO6 PO2,PO4/PSO1
CO7 PO5,PO12/PSO2
CO8 PO4,PO7/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0009: SOFTWARE ENGINEERING

Objective: Be employed in industry, government, or entrepreneurial endeavors to demonstrate professional

advancement through significant technical achievements and expanded leadership responsibility.

L–T–P-J: 3–0–0-0
Credits: 03
Module Teaching
Content
No. Hours
Introductory Concepts: The evolving role of software – characteristics,
components and applications.
Process Models: Waterfall Model, Prototyping, Incremental, Spiral.
Agile software Development: Introduction to Agile, Agile software
development framework.
Software Requirement Specification: Requirement Process, SRS
Components, Requirement Specifications with Use Cases Diagram.
I 20
Software Project Planning: Project Planning Objectives.
Software Metrics: Size, Function Point, Staffing, Project Estimation Methods–
COCOMO Model.
Function-Oriented Design: Problem Partitioning, Abstraction, Top Down
and Bottom Up Design.
Module-Level Concepts: Coupling, Cohesion, Design Notation and
Specification - Structure Charts; Structured Design Methodology - Data Flow
Diagram, Sequence Diagram.
OO Analysis and OO Design: OO Concepts, Introduction to UML Design
Patterns: Class Diagram, Activity Diagram, State Chart Diagram.
Coding: Coding Process, Verification – Code Inspections, Software Metrics.
Testing Fundamentals: Test Case Design, Black Box Testing Strategies,
White Box Testing, Unit Testing, Integration Testing, System Testing.
II Introduction to Automation Testing and Testing Tools: Automated 18
Testing Process, Framework for Automation Testing, Introduction to
Automation Testing Tool.
Software Quality: Models, ISO 9000 Certification for Software Industry, SEI
Capability Maturity Model.
Software Maintenance: Models Cost of Maintenance, Re-engineering,
Reverse Engineering.

Text Books:
 R. S. Pressman , “Software Engineering: A Practitioners Approach”, 7thEdition, McGraw Hill,2010.

Reference Books:
 K. K. Aggarwal and Yogesh Singh , “Software Engineering”, 3rd Edition, New Age International
Publishers,2008.
 Rajib Mall , “Fundamentals of Software Engineering”, 3rd Edition, PHI Publication,2009.
 R.E Fairley , “Software Engineering”, McGraw Hill,2004.
 Sommerville, “Software Engineering”, 9th Edition, Pearson Education,2010.

Outcome: After the completion of the course, the student will be able to:
• CO1: Understand the basic concepts of software engineering.
• CO2: Apply software processes to solve real world problems.
• CO3: Estimate the cost, effort and schedule of software using COCOMO Model.
• CO4: Analyze the software design techniques (structure chart, SDM, sequence diagram).
• CO5: Understand the basic concepts of OO analysis and design.
• CO6: Develop the test cases to validate the software.
• CO7: Understand the basic models of software Quality and maintenance.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO7/PSO1
CO2 PO2,PO3/PSO4
CO3 PO2,PO11/PSO3
CO4 PO3,PO10/PSO4
CO5 PO3,PO7/PSO1
CO6 PO5,PO12/PSO2
CO7 PO4,PO9,PO12/PSO1

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC1010: DISCRETE MATHEMATICS

Objective: The objective is to introduce students to language and methods of the area of Discrete
Mathematics. The focus of the module is on basic mathematical concepts in discrete mathematics and on
applications of discrete mathematics in computer science.

Credits: 4 L–T–P-J: 3–1–0-0

Module Teaching
Content
No. Hours
Sets, Relations and Functions: Introduction to Set Theory, Venn
diagrams, algebra of Sets, Inclusion-Exclusion Principle, Partitions,
Relations, Properties and their types, Function and their types.
I 20
Recurrence Relations and Generating Functions
Introduction to Counting Principle: Permutation, Combination,
Permutation with Repetition, Combination with Repetition, Pigeonhole
Principle.
Posets & Lattices: Definition, Properties of lattices – Bounded,
Complemented, Modular and Complete lattice.
Natural Numbers: Introduction, Mathematical Induction, Variants of
Induction, Induction with Nonzero Base cases. Proof Methods, Proof by
counter – example, Proof by contradiction.
Propositional Logic - Logical Connectives, Truth Tables, Normal Forms
(Conjunctive and Disjunctive), Validity;
II Predicate Logic - Quantifiers, Inference Theory 20
Algebra: Motivation of Algebraic Structures, Finite Groups, Subgroups and
Group Homomorphism; Lagrange’s Theorem; Commutative Rings and
Elementary Properties;
Graph Theory: Trees: Definition, Binary tree, Binary tree traversal, Binary
search tree. Introduction to Graphs, , Operations on Graphs, Representation
of graphs, Types: Planner, Directed, Complete, Bipartite Graph,
Isomorphism, Euler Graph, Hamiltonian Graph, Connectivity.

Text Book:
 Kenneth H Rosen , “Discrete Mathematics and Its Applications”, 7th edition, TMH,2012.

Reference Books:
 J.P. Tremblay , “Discrete Mathematical Structures with Applications to Computer Science”, TMH,
New Delhi,1997.
 V. Krishnamurthy , “Combinatorics: Theory and Applications”, East-West Press, New Delhi,1986.
 Ralph P. Grimaldi, “Discrete and Combinatorial Mathematics- An Applied Introduction”, 5th
Edition, Pearson Education,2004.
 C.L. Liu, “Elements of Discrete Mathematics”, 2nd Edition, TMH,2000.
Outcome: After the completion of the course, the student will be able to:
• CO1: Understand the notion of mathematical thinking and proofs to solve the problem.
• CO2: Apply the basics of discrete probability and number theory to solve the real world problem.
CO3: Analyze basic discrete structures and algorithms using effectively algebraic techniques.
• CO4: Analyze mathematical concepts like sets, reasoning, relational algebra and graph theory to
solve optimization problems.
• CO5. Analyze the validity of an argument using logical notation.
• CO6. Demonstrate the basic structures of proof techniques to write and evaluate the validity of
arguments.
• CO7. Understand the basic principles of sets, set equalities and operations in sets.
• CO8. Apply counting principles to determine probabilities.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO1,PSO3
CO2 PO1,PO3/PSO4
CO3 PO2,PO3/PSO3
CO4 PO2,PO3/PSO3
CO5 PO1,PO2/ PSO3
CO6 PO1,PO3/PSO2,PSO3
CO7 PO1,PO2/PSO1
CO8 PO1,PO3/PSO1,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0011: THEORY OF AUTOMATA & FORMALLANGUAGES

Objective: The objective of this course is that students will study and compare different models and views
of the abstract notion of computation and its various aspects.

Credits:04 Semester V L-T-P-J:3-1-0-0

Module Teaching
No. Content Hours
Introduction: Alphabets, Strings and Languages; Automata and Grammars,
Deterministic Finite Automata (DFA), Nondeterministic Finite Automata (NFA),
Equivalence of NFA and DFA, Minimization of Finite Automata, Myhill-Nerode
Theorem; FA with Output - Moore and Mealy machine, Applications and
Limitations of FA.
I 20
Regular expression (RE): Regular Expression to FA, DFA to Regular Expression,
Arden Theorem, Non Regular Languages, Pumping Lemma for Regular
Languages, Applications of Pumping Lemma, Closure Properties of Regular
Languages.
Push Down Automata (PDA): Introduction, Language of PDA, Acceptance by
Final State, Acceptance by Empty Stack, Deterministic PDA.
Context Free Grammar (CFG) and Context Free Languages (CFL):
Introduction, Derivation Trees, Ambiguity in Grammar, Ambiguous to
Unambiguous CFG, Simplification of CFGs, Normal Forms for CFGs - CNF and
GNF; Pumping lemma for CFLs, Equivalence of PDA and CFG.
II 20
Turing machines (TM): Basic Model, Definition and Representation, Variants of
Turing Machine and their equivalence, TM for Computing Integer Functions,
Universal TM, Church’s Thesis,
Recursive and Recursively Enumerable Languages, Halting Problem,
Introduction to Computational Complexity.

Text Books:
 K.L.P. Mishra and N. Chandrasekaran, “Theory of Computer Science: Automata, Languages and
Computation”, 3rd Edition, PHI,2006
Reference Books:
 Hopcroft, Ullman , “Introduction to Automata Theory, Languages and Computation”, 3rd Edition,
Pearson Education,2013.
 Martin J. C ,” Introduction to Languages and Theory of Computations”, 4th Edition, TMH,2011.

Outcome: After completion of course, the student will be able to:

• CO1: Understand the basic concepts of Context Free languages, Expression and Grammars.
• CO2: Analyze the conversion of NFA to DFA, Mealy to Moore and Moore to Mealy.
• CO3: Analyze the process to convert regular expression to DFA, DFA to regular expression, and
minimization of DFA.
• CO4: Develop the PDA for the context free language and context free grammar.
• CO5: Analyze that the grammar is ambiguous or unambiguous.
• CO6: Apply the process to convert CFG to CNF and GNF.
• CO7: Understand the concept of Turing machine and its variants.
• CO8: Design the Turing machine for the real world application.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1,PSO4
CO2 PO2,PO3/PSO3
CO3 PO2,PO3,PO9,PO12/PSO1,PSO3,PSO4
CO4 PO1,PO3,PO5,PO9/PSO3,PSO4
CO5 PO1,PO2,PO4/PSO3
CO6 PO2,PO3/PSO3
CO7 PO1,PO2/PSO1,PSO3
CO8 PO3,PO12/PSO1,PSO2,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0012: DESIGN & ANALYSIS OF ALGORITHMS

Objective: The objective of this course is that students will construct and application of various data
structures and concepts including Trees, Recursion & Dynamic programing.

Credits:03 L-T-P-J:3-0-0-0

Module Content Teaching

No. Hours
Introduction: Algorithms, analyzing algorithms, Complexity of algorithms, Growth of 20
functions, Performance measurements, Sorting and order Statistics - Shell sort, Quick
sort, Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear time.
I Advanced Data Structures: Red-Black trees, B – trees, Binomial Heaps, Fibonacci
Heaps.
Divide and Conquer with examples such as Sorting, Matrix Multiplication, Convex hull
and Searching.
Greedy methods with examples such as Optimal Reliability Allocation, Knapsack, 20
Minimum Spanning trees – Prim’s and Kruskal’s algorithms, Single source shortest
paths - Dijkstra’s and Bellman Ford algorithms.
II Backtracking, Branch and Bound with examples such as Travelling Salesman Problem,
Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of subsets
Dynamic programming with examples such as Knapsack. All pair shortest paths –
Warshal’s and Floyd’s algorithms, Resource allocation problem

Text Books:
 Thomas H. Coremen, Charles E. Leiserson and Ronald L. Rivest, Introduction to Algorithms,
Third edition, Prentice Hall of India,2008.
Reference Books:
 Gilles Brassard Paul Bratley,” Fundamentals of Algorithms”, Prentice Hall,1996.
 Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, “Fundamentals of Computer Algorithms”,
Orient Longman Pvt. Ltd,2008.
 Levitin , “An Introduction to Design and Analysis of Algorithms”, Pearson,2008.

Outcome: After completion of course, student will be able to:

• CO1: Understanding of complexity representation in terms of Big Oh, Theta and Omega
notations.
• CO2: Derive and solve recurrences describing the performance of divide-and-conquer algorithms
(quick sort and merge sort).
• CO3: Compare and analyze different data structures (RB Tree, B Tree, Binomial Heaps, Fibonacci
Heaps).
• CO4: Understand the major graph algorithms (DFS, BFS, Dijkstra’s Bellman Ford) and their
analyses.
• CO5: Understand the greedy paradigm and able to analyze when an algorithmic design situation
calls for it. Synthesize greedy algorithms (Optimal Reliability Allocation, Minimum Spanning
Trees, factorial Knapsack) and analyze them.
• CO6: Synthesize dynamic-programming algorithms (0/1 knapsack problem, Resource allocation
problem, Warshal’s and Floyd’s algorithms) and analyze them.
• CO7: Understand the backtracking paradigm and able to analysis when an algorithmic design
situation calls for it. Synthesize backtracking algorithms (N Queen Problem, TSP Problem, sum of
subsets problem, Graph Coloring) and analyze them.
• CO8: Understand the branch and bound paradigm and able to analysis when an algorithmic
design situation calls for it. Synthesize branch and bound algorithms (N Queen Problem, TSP
Problem, Hamiltonian Cycles, Graph Coloring) and analyze them.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3,PO4,PO12/PSO1,PSO3
CO2 PO1,PO3,PO4,PO5/PSO1,PSO3
CO3 PO1,PO3,PO6/PSO1,PSO3
CO4 PO1,PO2,PO3,/PSO1,PSO3
CO5 PO1,PO2/PSO1,PSO3
CO6 PO1,PO2,PO3, PO6/PSO1,PSO3
CO7 PO1,,PO4,PO12/PSO1,PSO3
CO8 PO1,PO2,PO3,PO4,PO12/PSO1,PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0101: DIGITAL IMAGE PROCESSING

Objective: The objective is to introduce students the Fundamentals of digital Image processing.
Students should study the basic of image operations and understand image analysis algorithm.
Students can have exposure to current applications in the field of digital image processing

Credits: 03 L–T–P-J:
L–T–P:
3–0–0-0
3–0–0
Module Teaching
Content
No. Hours
Introduction and Fundamentals: Motivation and Perspective,
Applications, Components of Image Processing System, Element of Visual
Perception, A Simple Image Model, Sampling and Quantization, Some Basic
Relationships between Pixels.
Intensity Transformations and Spatial Filtering: Introduction, Some
Basic Intensity Transformation Functions, Histogram Processing, Histogram
I 20
Equalization, Histogram Specification, Local Enhancement, Enhancement
using Arithmetic/Logic Operations – Image Subtraction, Image Averaging,
Basics of Spatial Filtering, Smoothing - Mean Filter, Order Statistics Filters,
Sharpening – The Laplacian.
Filtering in the Frequency Domain: Fourier Transform and the Frequency
Domain, Basis of Filtering in Frequency Domain
Morphological Image Processing: Introduction, Logical Operations
involving Binary Images, Dilation and Erosion, Opening and Closing, The Hit-
or-Miss Transformation, Morphological Algorithms – Boundary Extraction,
Region Filling, Extraction of Connected Components, Convex Hull, Thinning,
Thickening.
II Image Segmentation: Point, Line & Edge detection, Thresholding, Region- 20
based Segmentation, Region Extraction - Pixel Based Approach & Region
Based Approach, Edge and Line Detection - Basic Edge Detection, Canny
Edge Detection, Edge Linking - Hough Transform.
Representation & Description: Representation - Boundary Following,
Chain Codes; Boundary Descriptors – Shape Numbers.
Text Books:
 R.C.Gonzalez and R.E.Woods, “Digital Image Processing”, Prentice Hall, 3rd Edition,2011.
Reference Books:
 BhabatoshChanda and D. DuttaMajumder, “Digital Image Processing and Analysis”, PHI,2011.
 S. Sridhar , “Digital Image Processing”, Oxford University Press,2011

Outcome: After completion of course, student will be able to:

 CO1: Understand mathematical formulation of an image, its processing steps and relationship
between image pixels.
 CO2: Apply Image enhancement using intensity transformations and spatial filtering.
 CO3: Analyze image enhancement for frequency domain using Fourier transform.
 CO4: Formulate region of interest through morphological operations.
 CO5:Evaluate strongly co-related regions obtained through Segmentation using discontinuity and
homogeneity based segmentation techniques
 CO6: Describe an object of an image using Shape Number and Boundary descriptors.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO3/PSO1,PSO3
CO2 PO3,PO5,PO11,PO12/PSO3,PSO4
CO3 PO1,PO2,PO3,PO7/PSO2,PSO3
CO4 PO1,PO2,PO4/PSO1,PSO2,PSO4
CO5 PO4,PO5,PO3/PSO1,PSO2,PSO3
CO6 PO9,PO10,PO11,PO12/PSO1,PSO2,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0014: APPLIED DATABASE MANAGEMENT SYSTEM

Objective: The objective of the course is to enable students to understand and use a relational database&
NoSQL system. Students learn how to design and create a good database.

Credits:04 L-T-P-J:4-0-0-0

Module Teaching
Content
No. Hours
Introduction: An Overview of Database Management System, Database System
vs File System, Database System Concept and Architecture, Data Model Schema
and Instances, Data Independence, Database Language and Interfaces (DDL,
DML, DCL), Database Development Life Cycle (DDLC) with case studies.
Data Modeling Using the Entity-Relationship Model: ER Model Concepts,
Notation for ER Diagram, Mapping Constraints, Keys, Specialization,
Generalization, Aggregation, Reduction of an ER Diagram to Tables, Extended ER
I Model. 26
Relational Data Model and Language: Relational Data Model Concepts,
Integrity Constraints, Entity Integrity, Referential Integrity, Keys Constraints,
Domain Constraints, Relational Algebra
Database Design & Normalization: Functional Dependencies, Primary Key,
Foreign Key, Candidate Key, Super Key, Normal Forms, First, Second, Third
Normal Forms, BCNF, 4th Normal Form, 5th Normal Form, Lossless Join
Decompositions, Non Redundant Cover, Canonical Cover, MVD and JDs, Inclusion
Dependence.

Transaction Processing Concept: Transaction System, Testing of Serializability,

Serializability of Schedules, Conflict & View Serializable Schedule, Recoverability,
Recovery from Transaction Failures, Log Based Recovery, Deadlock Handling.
Concurrency Control Techniques: Concurrency Control, Locking Techniques
for Concurrency Control, 2PL, Time Stamping Protocols for Concurrency Control,
Validation Based Protocol.
II Distributed Database: Introduction of Distributed Database, Data 26
Fragmentation and Replication.
NoSQL System: RDBMS vs NoSQL, BASE properties, Key-value, Columnar,
Document and Graph-Based database, Introduction of MongoDB, Cassandra,
Neo4j and Risk.
Database Programming using Python: Database connectivity, Retrieving Data
from Database, Parameters Passing, Execute many Methods, Cursor Attributes,
Invoke Stored Procedures, Invoke Stored Functions.

Text Books:
 Elmasri and Navathe, “Fundamentals of Database Systems”, 6th Edition, Addison Wesley, 2010.
 Sadalage, P. & Fowler , “NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot
Persistence”, Pearson Education, 2012.

References Books:

Date C J,” An Introduction to Database Systems”, 8th Edition, Addison Wesley.

Korth, Silbertz and Sudarshan, “Database Concepts”, 5th Edition, TMH, 1998.

Redmond, E. &Wilson, “Seven Databases in Seven Weeks: A Guide to Modern Databases and
the NoSQL Movement”, 1st Edition.
Course Outcome: After completion of course, student will be able to:
 CO1: Understand the concept of database management systems and Relational database.
 CO2: Identify the various data model used in database design.
 CO3: Design conceptual models of a database using ER modeling for real life applications and
construct queries in Relational Algebra.
 CO4: Create and populate a RDBMS for a real life application, with constraints and keys, using
SQL.
 CO5: Select the information from a database by formulating complex queries in SQL.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 CO6: Analyze the existing design of a database schema and apply concepts of normalization to
design an optimal database.
 CO7: Discuss recovery system and be familiar with introduction to web database, distributed
databases.
 CO8: Explain the differences between RDBMS and No-SQL,BASE properties and No-SQL
databases.
 CO9:Design and implement the database system with the fundamental concepts of DBMS using
Python.

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO2,PO3/PSO2
CO3 PO2,PO3,PO6,PO11/PSO1,PSO1,PSO2,PSO4
CO4 PO1,PO3/PSO1
CO5 PO1,PO5/PSO1
CO6 PO2,PO3/PSO2
CO7 PO1,PO3/PSO2
CO8 PO1,PO2,PO3/PSO1,PSO4
CO9 PO1,PO2,PO3,PO5/PSO1,PSO2,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0015: APPLIED DATA STRUCTURES AND ALGORITHMS

Objective: The objective of this course is that students will construct and application of various data
structures and abstract data types including lists, stacks, queues, trees and graphs.

CREDITS: 05 L-T-P-J: 4-1-0-0

Module Teaching
Content
No. Hours
Introduction: Basic Terminologies, Elementary Data Organization with Arrays.
Algorithm: Definition, Characteristics of an Algorithm, Time and Space
Complexity.
Introduction to Asymptotic Notations: Big-Oh, Big-Omega, Big-Theta
Operations on Data Structures: Insertion, Deletion, Searching, Sorting,
Traversing and Merging.
Abstract Data Types (ADT).
Linked Lists: Implementation of Singly Linked Lists, Doubly Linked List,
Circular Linked List, Operations on a Linked List - Insertion, Deletion, Traversal;
Polynomial Representation and Addition.
Stacks: Primitive Stack Operations - Push & Pop, Array and Linked List
Implementation of Stack, Applications of Stack: Prefix and Postfix Expressions,
Evaluation of Postfix Expression, conversion of Infix to Postfix expression.
I
Recursion: Principles of Recursion, Head & Tail Recursion, Removal of
20
Recursion, Use of stack in Recursion, Tower of Hanoi Problem, Nth Term of a
Fibonacci Series.
Queues: Operations on Queue – Enqueue & Dequeue operations,
Implementation of Queue using Array and Linked List, Circular Queues,
DEQueue.
Trees: Basic Terminology, Array Representation and Linked Representation;
Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Tree
Traversal Algorithms - Inorder, Preorder and Postorder;
Search Trees: Binary search trees, search efficiency, insertion and deletion
operations, importance of balancing, AVL trees, searching, insertion and
deletions in AVL trees, Tries, Red-Black Trees.

Heaps: Heaps as priority queues, heap implementation, insertion and deletion

operations, binary heaps, binomial and Fibonacci heaps, heapsort, heaps in
Huffman coding.
Hashing: Search efficiency in lists and skip lists, hashing as a search structure,
hash table, collision resolution.
Searching: Sequential Search, Binary Search.
Sorting: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Radix
Sort, Bucket Sort.
II Graphs: Terminology, Adjacency Matrices, Adjacency List, Graph Traversal -
Depth First Search and Breadth First Search; Spanning Trees, Minimum Cost 20
Spanning Trees – Prim’s and Kruskal’s Algorithm; Shortest Path Algorithm –
Bellman-Ford and Dijkstra’s Algorithm.
Basic Algorithmic Techniques: Greedy Algorithms, Divide & Conquer, Dynamic
Programming. Backtracking.
Collections Framework: Implementation of Collections Framework as Data
Structures (Queue, Stack, List, Map, Set, Deque, PriorityQueue, Vector,
Hashtable)

Text Books:
● Robert Lafore, “Data Structures And Algorithms in Java”, 2nd Edition, Pearson SAMS,2003.
References Books:
 Elliot B. Koffman, Paul A. T. Wolfgang , “Data Structures: Abstraction and Design Using Java”, 3rd
Edition, Wiley,2016.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 Michael T. Goodrich, RobertoTamassia, Michael H. Goldwasser, “Data Structures and Algorithms in

Java”, 6th Edition, Wiley,2014.
 Horowitz and Sahani, “Fundamentals of Data Structures”, 3rd Edition, W H Freeman & Co,2004-05.

Outcome: After completion of course, the student will be able to:

• CO1: Understand the basic concepts of the data structure and algorithms.
• CO2: Understand the complexity representation in terms of Big Oh, Theta and Omega notations.
• CO3: Apply the associated operations in linear data structure like stack, Queue and link list.
• CO4: Apply the associated operations in Binary Search Tree, AVL Tree and M- Way Search Tree.
• CO5: Understand the basic algorithms such as heap sort, graph traversal, quick sort, AVL
trees, and hashing.
• CO6: Select the appropriate data structure to solve the problem.
• CO7: Apply the shortest path algorithm to solve real life problem.
• CO8: Understand the concepts of greedy approach, divide & conquer and dynamic programming.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO4/PSO3
CO2 PO1,PO2,PO4/PSO3
CO3 PO1,PO2,PO3/PSO1,PSO4
CO4 PO1,PO2,PO3/PSO1,PSO2,PSO4
CO5 PO1,PO2,PO3,PO4,PO5/PSO1,PSO4
CO6 PO2,PO3/PSO1,PSO2
CO7 PO3,PO6,PO12/PSO1,PSO2
CO8 PO2,PO4/PSO3,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSG0800: PYTHON PROGRAMMING LAB

Objective: This course introduces the solving of problems using Python programming using OO concepts
and its connectivity with database.

Credits:01 L-T-P-J:0-0-2-0

Module Lab
No. Content Hours
Programs based on the concepts of:
 Building Python Modules
 Obtaining user Data
 Printing desired output
Programs based on the concepts of:
 Conditional if statements
 Nested if statements
 Using else if and elif
Programs based on the concepts of Iteration using different kinds of loops
Usage of Data Structures
I & II  Strings 26
 Lists
 Tuples
 Sets
 Dictionary
Program based on the concepts of User-defined modules and Standard Library
(random, numpy, scipy, sys, Math Module, String Module, List Module).
Program based on Input Output.
Program based on exception Handling.
Program based on Simple Data analysis.
Program based on Pandas.

Text Books:
 Paul Barry: “Head First Python “O’Reilly Media, Inc.", 2010.

Reference Books:
 Bret Slatkin: “Effective Python: 59 Specific ways to write better Python”, Addison Wesley, 2015.

Outcome: By the end of the course, students will learn to:

 CO1: Apply OO concepts using Python programming.
 CO2: Apply in-built packages defined in Python.
 CO3: Apply front-end as Python Programming to connect with any back-end.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO2/PSO1
CO2 PO3/PSO4
CO3 PO5/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0800: COMPUTER PROGRAMMING LAB

Objective: The objective is to provide a comprehensive study of the C programming language. It stress the
strengths of C, which provide students with the means of writing efficient, maintainable, and portable code.

Credits:01 L-T-P-J:0-0-2-0

Module Lab
No. Content Hours
 Mapping of flow chart, Algorithm, Language
 Simple C-program execution
 Programs based on various operators
 Programs based on Decision and case Control Structure
 Programs based on Loop Control Structure
 Program based on special control statement
 break
 continue
 Programs based on Array Insertion, Deletion, Linear Search & Bubble Sort
 Programs based on String
 Length, Copy, Reverse, Concatenate, Compare with & without built-in
functions
 Programs based on Functions.
 Programs based on Storage Class.
I & II
 Programs based on Recursion.
52
 Programs based on Preprocessor.
 Programs based on Pointers
 Programs based on array
 Programs based on string
 Programs based on call by value and call by reference
 Programs based on Dynamic Memory Allocation
 Programs based on User Defined Data types
 Structure and Union
 Enum and Typedef
 Programs based on File handling
 Opening a file
 Reading, writing and appending a file
 Closing file
 Random Access to Files of Records
 Programs based on Command Line Argument.

Reference Books:
 Herbert Schildt, “C: The Complete Reference”, 5th Edition, McGraw Hill Education
 K. N. King, “C Programming a Modern Approach”, W. W. Norton, 2nd Edition, 2008.
 Kernighan and Ritche, “The C Programming Language”, PHI, 2ndEdition, 2011.
 P. Dey and M. Ghosh, “Programming in C”, Oxford University Press 2nd Edition, 2013.

Outcome: On Completion of this course, students are able to:

• CO1: Design programs involving decision structures, loops and functions.
• CO2: Understand the concepts of functions, recursion, pointers and file handling.
• CO3: Design programs involving structures, union and functions.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3/PSO1,PSO2
CO2 PO3,PO4/PSO1
CO3 PO3/PSO2,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0801: OBJECT ORIENTED PROGRAMMING LAB

Objective: The objective of this course is that students will study and learn Object Oriented Modeling and
programming.

Credits:01 L-T-P-J:0-0-2-0

Module Teaching
No. Content Hours

Programs in Java and python based on the concepts of:

 Classes, Constructors, Polymorphism and Keyword Static.
Programs based on the concepts of:
 Inheritance, Multithreading Using Thread Class & Interface Runnable, String
Handling, Generic Classes.
Programs based on the concepts of:
 Handling Database Connectivity.
I& II 24
 Implementation of Collection Framework.
Programs based on the concepts of:
 Database Connectivity.
 Retrieving Data from Database.
 Parameters Passing, Execute many Method.
 Cursor Attributes.
 Invoke Stored Procedures.
 Invoke Stored Functions.

Reference Books:
 Naughton, Schildt, “The Complete Reference JAVA2”, 9 th Edition, Oracle Press.
 Bhave&Patekar, “Programming with Java”, Pearson Education
 Bret Slatkin: “Effective Python: 59 Specific ways to write better Python”, Addison Wesley, 2015.

Outcome: After completion of course, the student will be able to:

• CO1: Implement object oriented language features.
• CO2: Design GUIs and Graphical programming.
• CO3: Design object oriented solutions for small systems involving database and event handling
concepts.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO1
CO2 PO3,PO5/PSO2
CO3 PO3,PO5/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0802: DATABASE MANAGEMENT SYSTEM LAB

Objective: The lab aims to develop an understanding of different applications and constructs of SQL, PL/SQL.

Credits:01 L-T-P-J:0-0-2-0

Module Teaching
No. Content Hours

 Write the SQL queries for data definition and data manipulation language.
 To implement various operations on a table.
 To implement various functions in SQL.
 To implement restrictions on the table.
I & II  To implement the concept of the grouping of Data. 24
 To implement the concept of Joins in SQL.
 To implement the concept of sub-queries.
 To implement the concept of views, sequence.
 To implement the concept of PL/SQL using a cursor.
 To implement the concept of Procedure function and Triggers.

References Books:
 Date C J,” An Introduction to Database Systems”, 8th Edition, Addison Wesley.
 Korth, Silbertz and Sudarshan, “Database Concepts”, 5th Edition, TMH, 1998.
 Majumdar& Bhattacharya, “Database Management System”, TMH

Outcome:After the completion of the course, the student will be able to:
• CO1: Apply SQL queries for DML and DDL.
• CO2: Develop the SQL queries for real life scenarios.
• CO3: Implement the procedural language (PL/SQL) and Triggers.

.
Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO1,PSO4
CO2 PO1,PO2/PSO1,PSO4
CO3 PO2,PO3,PO5/PSO2,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0803: OPERATING SYSTEMS LAB

Objective: The lab aims to develop understanding the operation of UNIX operating system.

Credits:01 L-T-P-J:0-0-2-0

Module Teaching
No. Content Hours

 Implement the following basic commands (with options) used in

UNIX/LINUX OS.
 Write and implement the basic vi editor commands.
 Shell scripts that use simple commands.
 Decision based Shell scripts.
I & II 24
 Shell scripts related to strings.
 Shell scripts using pipes.
 Shell scripts with loop statements.
 Demonstration and solution for race condition.
 Demonstration and use of System Calls.
 Implement the basics of IPC in UNIX.

Reference Books:
 SibsankarHalder and Alex a Aravind,” Operating Systems”, 6th Edition, Pearson Education, 2009.
 Harvey M Dietel, “An Introduction to Operating System”, 2nd Edition, Pearson Education, 2002.
 D M Dhamdhere, “Operating Systems: A Concept Based Approach”, 2nd Edition, 2006.
 M. J. Bach. , “Design of the Unix Operating System”, PHI, 1986.
Outcome: After completion of course, the student will be able to:
• CO1: Implement the basic operations on UNIX operating systems.
• CO2: Demonstrate the working of systems calls.
• CO3: Demonstrate message passing in Unix operating system.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3,PO4/PSO1
CO2 PO1,PO2/PSO1
CO3 PO1,PO4,PO5/PSO1,PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0804: COMPUTER ORGANIZATION LAB

Objective: The aim of the lab is to better understand the design of sequential Circuits such as Flip-Flops,
Registers, and Counters.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours
 Bread Board Implementation of Flip-Flops.
 Experiments with clocked Flip-Flops.
 Design of Counters.
I & II  Bread Board implementation of Counters &Shift Registers.
 Implementation of Arithmetic Algorithms. 24
 Bread Board implementation of Adder/Subtraction (Half, Full).
 Bread Board implementation of Binary Adder.
 Bread Board implementation of Seven Segment Display.
 Small Project based on combinational and sequential circuit.

Reference Books:
 D.W. Patterson , “Computer Organization and Design”, 4thEdition, Elsevier Publication, 2008.
 William Stalling , “Computer Organization”,8th Edition, PHI, 2011.
 M. Mano , “Computer System Architecture”, 3rd Edition, PHI.

Outcome: After the completion of the course, the student will be able to:
• CO1: Implement the Combinational and Sequential Circuit.
• CO2: Demonstrate the working of counter and shift register.
• CO3: Demonstrate the working of ALU and seven segment displays.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO2,PO3,PO5/PSO2
CO2 PO3,PO4/PSO2
CO3 PO3,PO5/PSO1,PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0805: DATA STRUCTURES & ALGORITHMS LAB

Objective: The objective of this course is that students will understand and implement simple data
structures, able demonstrate different sorting and searching techniques. and will be familiar with graphs
and their applications.

Credits:01 L-T-P-J:0-0-2-0

Module Content Lab

No.  Content in a singly linked list.
Program to implement various operations Hours
 Program to implement insertion, deletion and traversal in a doubly linked
List.
 Program to implement polynomial addition using linked list.
 Program to demonstrate the various operations on stack.
 Program to convert an infix expression into postfix expression.
 Program to evaluate a given postfix expression.
I &II  Program to implement Tower of Hanoi problem using Recursion.
 Program to demonstrate the implementation of various operations on linear 24
and circular queue.
 Program to demonstrate the implementation of insertion and traversals on a
binary search tree.
 Program to implement Dijkstra’s Algorithm to find the shortest path
between source and destination.
 Program to search a given element as entered by the user using sequential
and binary search to search a given element as entered by the user.
 Implementation of various sorting algorithms like Selection Sort, Bubble
Sort, Insertion Sort, Merge Sort, Quick Sort and Heap Sort.

Note: All Code must be done in Java as well as Python

Outcome: After completion of course, student will be able to:

• CO1: Demonstrate the associated operations in linear data structure like stack, Queue and link
list.
• CO2: Demonstrate the associated operations in Binary Search Tree and Dijkstra’s Algorithm.
• CO3: Implementation the sorting algorithms like Selection Sort, Bubble Sort, Insertion Sort,
Merge Sort, Quick Sort and Heap Sort.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO4/PSO1,PSO3
CO3 PO2/PSO3,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0806: MICROPROCESSORS LAB

Objective: The objective is to introduce the Architecture and programming of the microprocessor and
learning about interfacing and various applications of microprocessor.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours
 To study 8085 microprocessor System.
 To study 8086 microprocessor System.
 To develop and run basic programs in 8085 ALP.
I & II  To develop and run programs in 8085 ALP related to the concept of looping,
counting and indexing. 24
 To perform interfacing of RAM chip to 8085/8086.
 To perform interfacing of keyboard controller.
 To perform interfacing of DMA controller.
 To perform interfacing of UART/USART.

Reference Books:
 Ramesh S. Gaonkar, “Microprocessor Architecture Programming and Applications with 8085”,
4th Edition, Penram International Publishing, 2000.
 D. V. Hall , “Microprocessors and Interfacing: Programming and Hardware”, 2nd Edition, TMH,
1992.

Outcome: After completion of course, student will be able to:

• CO1: Demonstrate the arithmetic and logical operations using assembly language programming
(8085).
• CO2: Demonstrate the memory operations using assembly language programming (8085).
• CO3: Demonstrate the interfacing of Keyboard, DMA and UART controller.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3/PSO1,PSO2
CO2 PO1,PO2/PSO1,PSO2
CO3 PO1,PO3,PO5/ PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0807: DESIGN & ANALYSIS OF ALGORITHMS LAB

Objective: The objective of this course is that students will understand and implement simple data
structures, able demonstrate different sorting and searching techniques. and will be familiar with graphs
and their applications.

Credits:01 L-T-P-J:0-0-2-0
Module Content Teaching
No. Hours
 Implementation of sorting algorithms:
o Insertion Sort
o Bubble Sort
o Selection Sort
o Divide and conquer approach:
 Quick Sort
 Merge Sort
o Heap Sort
o Counting Sort
 Implementation of Searching Techniques:
o Linear Search
o Binary Search
 Implementation of Matrix Multiplication
 Implementation of Convex Hull
I& II  Implementation of Breadth First Search 32
 Implementation of Depth First Search
 Implementation of Greedy approaches:
o Optimal Reliability Allocation.
o Knapsack. Minimum
o Minimum Spanning trees:
 Prim’s and Kruskal’s algorithms.
o Single source shortest paths –
 Dijkstra’s and Bellman Ford algorithms.
 Implementation of Dynamic Programming:
o Longest Increasing Subsequence.
o Finding best path in maze.
o Matrix Chain Multiplication
o 0/1 Knapsack Problem
o Resource Allocation Problem

Note: All Code must be done in Java as well as Python

Outcome: After completion of course, student will be able to:

• CO1: Implementation the sorting algorithms like Selection Sort, Bubble Sort, Insertion Sort,
Merge Sort, Quick Sort and Heap Sort.
• CO2: Demonstrate and use the appropriate data structures for a given problem
• CO3: Implement the algorithms based on Greedy approach and Dynamic Programming.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO4/PSO1,PSO2,PSO4
CO2 PO1,PO3,PO4/PSO1,PSO2,PSO3
CO3 PO2,PO3,PO5/PSO1,PSO2,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0131: DIGITAL IMAGE PROCESSING LAB

Objective: The objective of this Lab is to develop hands-on experience to write programs using
MATLAB/Python language for digital manipulation of images in both spatial and frequency domains.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours
 Basic commands to familiarize with MATLAB & perform the various
Matrix operations.
 Understanding image basic “image resize, image type conversion,
extraction of color band, creating a synthesic image, pseudocolor
image”
 Perform various arithmetic operation (image addition, subtraction&
complement) & logical operation (NOT, OR and XOR) on images
 Perform various Image Enhancement operations: Image Negation
function, Logarithmic Transformation, Power Law Transformation,
Histogram Equalization, contrast stretching, plot histogram without
using imhist function
 Perform smoothing using linear (average filter) and order statistics
filters (min, max & median) of varying sizes
I/II  Sharpen an image using Laplacian filter. 12*2=24
 Perform various Fast Fourier transform (FFT) and frequency
domain filtering on images using MATLAB.
 Perform various Image Enhancement operation in frequency
domain
 Perform various Morphological operation dilation, erosion, internal
& external boundary Extraction, Thinning,thickening of image
&Perform Dilation, erosion, boundary Extraction without using
direct function
 Perform various thresholding segmentation (Simple, Multiple, and
Adaptive thresholding)
 Perform the various Edge Detection Operators (Ordinary, Roberts,
Prewit, Sobeland Canny Operator)
 Minor Application Assignment.

Reference Books:
 R.C. Gonzalez and R.E. Woods, “Digital Image Processing Using MATLAB”, PHI, 2ndEdition,2010.
 Hands-On Image Processing with Python by SandipanDey, November 2018, Packt
 https://www.pyimagesearch.com/
Outcome: After studying the subject, the students will be able to:
 CO1: Implement digital image processing operations for image manipulation and Enhancement.
 CO2: Test the source code for Morphological and Segmentation algorithms.
 CO3: Apply image processing algorithms in real-life problems as Minor Application Assignment.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO6,PO9/PSO1,PSO2
CO2 PO5,PO7,PO8,PO10/PSO1,PSO4
CO3 PO1,PO3,PO11,PO12/PSO3,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0808: APPLIED DATABASE MANAGEMENT SYSTEM LAB

Objective: The lab aims to develop an understanding of different applications and constructs of SQL, PL/SQL
and NoSQL databases.

Credits:01 L-T-P-J:0-0-2-0

Module Teaching
Content
No. Hours

 Write the SQL queries for data definition and data manipulation language.
 To implement various operations on a table.
 To implement various functions in SQL.
 To implement restrictions on the table.
 To implement the concept of the grouping of Data.
 To implement the concept of Joins in SQL.
I & II
 To implement the concept of sub-queries.
24
 To implement the concept of views, sequence.
 To implement the concept of PL/SQL using a cursor.
 To implement the concept of Procedure function and Triggers.
 Introduction to MongoDB and its Installation on Windows or Linux,
Description of mongo Shell, create database and show database,
Commands for MongoDB and To study operations in MongoDB – Insert,
Query, Update, Delete and Projection
 To implement Database connectivity using Python

References Books:
 Date C J,” An Introduction to Database Systems”, 8th Edition, Addison Wesley.
 Korth, Silbertz and Sudarshan, “Database Concepts”, 5th Edition, TMH, 1998.
 Majumdar& Bhattacharya, “Database Management System”, TMH
 Sadalage, P. & Fowler , “NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot
Persistence”, Pearson Education, 2012.

Outcome:After the completion of the course, the student will be able to:
• CO1: Apply SQL queries for DML and DDL.
• CO2: Implement the procedural language (PL/SQL) and Triggers.
• CO3: Apply NoSQL queries in MongoDB.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO1,PSO4
CO2 PO2,PO3,PO5/PSO2,PSO3
CO3 PO5/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0809: APPLIED DATA STRUCTURES & ALGORITHMS LAB

Objective: The objective of this course is that students will understand and implement simple data
structures, able demonstrate different sorting and searching techniques. and will be familiar with graphs
and their applications.

Credits:01 L-T-P-J:0-0-2-0

Teaching
Module No. Content
Hours
 Program to implement various operations in a singly linked list.
 Program to implement insertion, deletion and traversal in a doubly
linked List.
 Program to demonstrate the various operations on stack.
 Program to implement Tower of Hanoi problem using Recursion.
 Program to demonstrate the implementation of various operations on
linear and a
 circular queue.
 Program to implement Dijkstra’s Algorithm to find the shortest path
between source and
 destination.
I&II  Program to search a given element as entered by the user using binary
search (divide and 24
 conquer approach) to search a given element as entered by the user.
 Implementation of various sorting algorithms like Selection Sort, Bubble
Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort, Radix Sort, Bucket
Sort.
 Program to implement AVL Trees.
 Program to implement Red-Black Trees.
 Program to implement Binary Heaps.
 Program to implement Priority Queues.
 Program to implement Huffman Character Length Encoding.
 Program to implement tree traversal using Backtracking.
 Project to create a LogBook to generate a Calendar Display.
 Project to create a Hangman game using String Lexical Analysis.

Note: All Code must be done in Java as well as Python

Outcome: After completion of course, student will be able to:

• CO1: Demonstrate the associated operations in linear data structure like stack, Queue and link
list.
• CO2: Demonstrate the associated operations in Binary Search Tree AVL Tree, Red- Black, and
Dijkstra’s Algorithm.
• CO3: Implementation the sorting algorithms like Selection Sort, Bubble Sort, Insertion Sort,
Merge Sort, Quick Sort and Heap Sort.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO4/PSO1,PSO3
CO3 PO2/PSO3,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

SYLLABUS
OF
PROGRAM ELECTIVE
BOUQUET: COMPUTER NETWORK &
SECURITY

DEPARTMENT OF COMPUTER ENGINEERING &

APPLICATIONS

Under
Choice Based Credit System (CBCS)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
NO.
CODE SUBJECT PRE- REQUISITES
L T P J

Bouquet 1:Computer Network & Security

THEORY
Network Programming and
1. BCSE0001 3 0 0 0 3 3 Computer Networks
Management
2. BCSE0002 Principles of Mobile Computing 3 1 0 0 4 4 Computer Networks

3. BCSE0003 Ad Hoc Networks 3 0 0 0 3 3 Computer Networks

Cryptography & Network
4. BCSE0004 3 0 0 0 3 3 Computer Networks
Security
Cyber security and Digital
5. BCSE0005 3 0 0 0 3 3
Forensics
6. BCSE0006 Information Coding Techniques 3 0 0 0 3 3 Computer Networks

PRACTICALS
Network Programming and
1. BCSE0070 0 0 2 0 1 2 Computer Networks
Management Lab
Cryptography & Network
2. BCSE0071 0 0 2 0 1 2 Computer Networks
Security Lab
Cyber security and Digital
3. BCSE0072 0 0 2 0 1 2
Forensics Lab
Information Coding Techniques
4. BCSE0073 0 0 2 0 1 2 Computer Networks
Lab
PROJECTS
Cyber security and Digital
1. BCSE0081 0 0 0 - 2 0
Forensics Project

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0001: NETWORK PROGRAMMING AND MANAGEMENT

Objective: To learn the basics of socket programming using TCP Sockets and UDP sockets. To develop
knowledge of threads for developing high performance scalable applications. To learn about raw sockets.
To understand simple network management protocols & practical issues.

Credits:03 L-T-P-J:3-0-0-0

Module Teaching
Content
No. Hours
Introduction to Socket Programming-Overview of TCP/IP Protocols, Introduction
to Sockets, Socket address Structures, Byte ordering functions, address conversion
functions, Elementary TCP Sockets, socket, connect, bind, listen, accept, read, write,
close functions, Iterative Server, Concurrent Server.
I 20
Application development: TCP Echo Server, TCP Echo Client, Posix Signal handling,
Server with multiple clients, boundary conditions: Server process Crashes, Server host
Crashes, Server Crashes and reboots, Server Shutdown, I/O multiplexing, I/O Models,
select function, shutdown function TCP echo Server (with multiplexing) - poll function
- TCP echo Client (with Multiplexing).
Socket options: Socket options, get socket and set socket functions - generic socket
options - IP socket options -ICMP socket options - TCP socket options.
Elementary UDP sockets:
Elementary UDP sockets - UDP echo Server - UDP echo Client - Multiplexing TCP and
II UDPsockets - Domain name system - gethostbyname function - Ipv6 support in DNS - 20
gethostbyadr function - getservbyname and getservbyport functions.
Advanced sockets: Ipv4 and Ipv6 interoperability - threaded servers - thread
creation andtermination - TCP echoserver using threads - Mutexes - condition
variables - raw sockets - raw socket creation - raw socket output - raw socket input -
ping program - trace route program.

Text Books:
 Unix Network Programming Volume 1: The Sockets Networking API by W. Richard Stevens, Bill
Fenner and Andrew M. Rudoff, Pearson Education
Reference Books:
 The Definitive Guide to Linux Network Programming by Keir Davis, John Turner and Nathan
Yocom,
 TCP/IP Sockets in C: Practical Guide for Programmers by Michael J. Donahoo and Kenneth L.
Calvert, Morgan Kaufmann
Outcome: After completion of course, the student will be able to:
 CO1: Understand the basic Concepts of socket programming.
 CO2: Apply the socket constructs for application development.
 CO3: Understand the basics of get socket set socket, generic socket options.
 CO4: Understand the concepts of elementary UDP sockets.
 CO5: Demonstrate the working of threaded servers.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO4/PSO1,PSO3
CO2 PO1,PO3/PSO2
CO3 PO1,PO3/PSO1
CO4 PO1,PO3/PSO1
CO5 PO1,PO4/ PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0070: NETWORK PROGRAMMING AND MANAGEMENT LAB

Objective: To understand the use of client/server architecture in application development, to understand

and use elementary socket system calls, advanced socket system calls and how to use TCP and UDP based
sockets to implement network routing algorithms and application layer protocols.

Credits: 01 L–T–P-J: 0–0–2-0

Module Teaching
Content
No. Hours
 Understanding and using of commands like ifconfig, netstat, ping, arp,
telnet, ftp, finger, traceroute, whoisetc.
 Usage of elementary socket system calls (socket (), bind (), listen (),
accept (), connect (), send (), recv (), send to (), recvfrom ()).
 Implementation of Connection oriented concurrent service (TCP).
 Implementation of Connectionless Iterative time service (UDP).
 Implementation of Select system call.
I& II  Implementation of gesockopt (), setsockopt () system calls. 24
 Implementation of getpeername () system call.
 Implementation of remote command execution using socket system
calls.
 Implementation of Distance Vector Routing Algorithm.
 Implementation of SMTP.
 Implementation of FTP.
 Implementation of HTTP.

Reference Books:
 W. Richard Stevens, “Unix Network Programming”, Prentice Hall, Pearson Education, 2009.
 Douglas E. Comer, “Hands-on Networking with Internet Technologies”, Pearson Education.

Outcome: By the end of the class, students will learn to:

• CO1: Apply network-programming concepts to develop and implement distributed applications.
• CO2: Develop and implement next generation protocols required for emerging applications.
• CO3: Evaluate the performance of networking systems.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3,PO5,PO6/PSO1,PSO4
CO2 PO1,PO3,PO5,PO6/PSO1,PSO4
CO3 PO2,PO3 /PSO3,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0002: PRINCIPLES OF MOBILE COMPUTING

Objective: To learn the cellular concepts and to know about the radio wave propagation along with
various wireless techniques.

Credits: 04 L–T–P-J: 3–1–0-0

Module
Content Hours
No.
Introduction to Mobile Communications and Computing: Introduction
to Mobile Computing, novel applications, limitations, and architecture - GSM
Mobile services, System architecture, Radio interface, Protocols, Localization
and calling, Handover, Security, and New data services.
Introduction to wireless communication: Evolution of mobile
communications, mobile radio systems- Examples, trends in cellular radio and
I 20
personal communications. Cellular Concept: Frequency reuse, channel
assignment, hand off, Interference and system capacity, tracking and grade of
service, Improving Coverage and capacity in Cellular systems.
Wireless radio propagation: Free space propagation model, reflection,
diffraction, scattering, link budget design, Outdoor Propagation models, Indoor
propagation models.
Wireless radio propagation: Small scale Multipath propagation, Impulse
model, Small scale Multipath measurements, parameters of Mobile multipath
channels, types of small scale fading, statistical models for multipath fading
channels., Interference, DSSS, FHSS.
II Medium access control: (Wireless) Medium Access Control: Motivation for a 20
specialized MAC (Hidden and exposed terminals, Near and far terminals),
SDMA, FDMA, TDMA, CDMA.
Wireless LAN standards: Wireless LAN, IEEE 802.11, Architecture, services
MAC Physical layer, IEEE 802.11a, 802.11b standards, HIPERLAN, Bluetooth.

Text Books:
 Mobile Communications, 2nd Edition by Jochen Schiller, Pearson Education
 Handbook of Wireless Networks and Mobile Computing Edited by Ivan Stojmenović, John Wiley
& Sons, Inc.
Reference Books:
 Mobile Computing Principles: Designing and Developing Mobile Applications with UML and XML by
Reza B'Far, Cambridge University Press
 Fundamentals of Mobile and Pervasive Computing by Frank Adelstein, Sandeep KS Gupta, Golden
Richard III and Loren Schwiebert, McGraw-Hill Professional
 802.11 Wireless Networks: The Definitive Guide, 2nd Edition by Matthew Gast, O'Reilly Media

Outcome: By the end of the class, students will learn to:

 CO1: Understand the basic concepts of mobile communication.
 CO2: Explain the concepts of mobile radio system and cellular system.
 CO3: Discuss the Free space, reflection and diffraction, propagation model.
 CO4: Explain the different fading models.
 CO5: Understand the different medium access techniques.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO7,PO10/PSO1,PSO4
CO2 PO1,PO7,PO10/PSO1,PSO4
CO3 PO1,PO6,PO7/PSO1,PSO4
CO4 PO1,PO4,PO7/PSO1,PSO4
CO5 PO1,PO2,PO6/PSO1,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0003: AD HOC NETWORKS

Objective: This course is offered for those who are interested in understanding and building systems support
mechanisms for mobile computing systems including client-server web/database/file systems, and mobile ad
hoc and sensor networks for achieving the goal of anytime, anywhere computing in wireless mobile
environments.

Credits:03 L-T-P-J:3-0-0-0

Module Content Teaching

No. Hours
Introduction to Ad Hoc Wireless Networks: Characteristics of MANETS,
Applications of MANETS, Challenges.
Routing in MANETS: Topology based versus position-based approaches, Topology
based routing protocols, and position-based routing, other routing protocols.
I Data Transmission in MANETS:The broadcast storm, Multicasting, Geocasting. 20
TCP Over Ad Hoc Networks:TCP protocol overview, TCP and MANETS, Solutions
for TCP over Ad Hoc networks.
Basics of Wireless Sensors and Applications: The Mica Mote, Sensing and
Communication Range, Design Issues, Energy Consumption, Clustering of Sensors,
Applications.
Data Retrieval in Sensor Networks: Classification of WSNs, MAC Layer, Routing
Layer, High Level ApplicationLayer Support, Adapting to the Inherent Dynamic
Nature of WSNs.
Introduction: Basic principles and challenges, past and ongoing VANET activities.
Cooperative Vehicular Safety Applications Enabling technologies, cooperative
II system architecture, safety applications. Vehicular Mobility Modeling Random 20
models. MAC Layer of Vehicular Communication Networks Proposed MAC
approaches and standards, IEEE 802.11p.
VANET Routing protocols: Opportunistic packet forwarding, topology-based
routing, geographic routing. Standards and Regulations Protocol Stack,
DSRCregulations and standards.

Text Books:
 Ad Hoc and Sensor Networks: Theory and Applications, Carlos de MoraisCordeiro and Dharma
PrakashAgrawal, World Scientific Publications / Cambridge University Press,2006.
 Wireless Sensor Networks: An Information Processing Approach, Feng Zhao, Leonidas Guibas,
Elsevier Science Imprint, Morgan Kauffman Publishers, 2005
Reference Books:
 Ad Hoc Wireless Networks: Architectures and Protocols, C. Siva Ram Murthy and B. S. Manoj,
Pearson Education, 2004.
 Guide to Wireless Sensor Networks, SudipMisra, Isaac Woungang, and Subhas Chandra Misra,
Springer International Edition, 2012.
 Wireless Mesh Networking, Thomas Krag and SebastinBuettrich, O’Reilly Publishers,2007.
 Wireless Sensor Networks – Principles and Practice, Fei Hu, Xiaojun Cao, An Auerbach book, CRC
Press, 2010.
 Wireless Ad hoc Mobile Wireless Networks-Principles, Protocols and Applications, Subir Kumar
Sarkar, et al., Auerbach Publications, Taylor & Francis Group, 2008.
 Wireless Ad hoc Networking, Shih-Lin Wu, Yu-Chee Tseng, Auerbach Publications, 2007
 Wireless Ad hoc and Sensor Networks–Protocols, Performance and Control,
JagannathanSarangapani, CRC Press, 2007.

Outcome: After completion of course, the student will be able to:

• CO1: Understand the concept of mobile ad hoc networks and their design and implementation
issues.
• CO2: Demonstrate the proactive, on-demand, and hybridrouting mechanisms.
• CO3: Explain sensor networks and their characteristics.
• CO4: Understand the mechanism of data retrieval in wireless sensor networks.
• CO5: Understand the characteristics of VANETs.
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

• CO6: Understand the differences in routing mechanism in MANETs and VANETs

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3/PSO1,PSO2
CO2 PO1,PO3/PSO1,PSO4
CO3 PO1,PO5,PO6/PSO1,PSO2
CO4 PO1,PO4/PSO2,PSO4
CO5 PO1,PO2/PSO1,PSO4
CO6 PO1,PO5/PSO2,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0004: CRYPTOGRAPHY & NETWORK SECURITY

Objective: This Course focuses towards the introduction of network security using various cryptographic
algorithms and understanding network security applications and practical applications that have been
implemented and are in use to provide email and web security.

Credits:03 L-T-P-J:3-0-0-0

Module Teaching
No. Content Hours
Introduction: Introduction to Security Attacks, Services and Mechanism, Classical
Encryption Techniques-Substitution Ciphers and Transposition Ciphers,
Steganography, Stream and Block Ciphers, Cryptanalysis.
I Symmetric Key Cryptosystems: Block Cipher Principles, Shannon’s Theory of 20
Confusion and Diffusion, Data Encryption Standard(DES), Strength of DES, Triple DES,
Advance Encryption Standard (AES), Linear and Differential Cryptanalysis, Block
Ciphers Modes of Operation.
Introduction to Number Theory: Modular Arithmetic, Prime and Relative Prime
Numbers, Primitive Roots, Fermat’s and Euler’s Theorem, Extended Euclidean
Algorithm, Chinese Remainder Theorem.
Algebraic Structures: Introduction to Group, Ring & Field of the Form GF(P).
Asymmetric Key Cryptosystems: RSA Cryptosystem, Attacks on RSA, Security of RSA,
Discrete Logarithm Problem, Elgamal Encryption Algorithm.
Hash Functions and Macs: Authentication Functions, Message Authentication Code,
Hash Functions, Birthday Attacks, Security of Hash Functions, Secure Hash Algorithm
(SHA-512).
Digital Signature: Digital Signatures, RSA Digital Signature Scheme, Elgamal Digital
Signature Techniques, Digital Signature Standards(DSS).
Key Management: Symmetric Key Distribution, Diffie Hellman Key Exchange
II Algorithm. 22
Public Key Distribution: X.509 Certificates, Public Key Infrastructure.
Authentication Applications and E-Mail Security: Kerberos, Pretty Good Privacy
(PGP), S/MIME.
IP Security and Web Security: IP Sec Architecture, Authentication Header,
Encapsulating Security Payloads, Combining Security Associations, Key Management,
Introduction to Secure Socket Layer, Transport Layer Security, Secure Electronic
Transaction (SET).
System Security: Introductory Idea of Intrusion, Intrusion Detection, Malicious
Programs, Firewalls.
Text Books:
 W. Stallings , "Cryptography and Network Security: Principles and Practices",5th Edition,
Pearson Education,2010.
Reference Books:

B. A. Forouzan, "Cryptography & Network Security", 3rd Edition, Tata McGraw Hill,2003.

Wenbo Mao , “Modern Cryptography: Theory and Practice”, Prentice Hall,2003.

Douglas Stinson, "Cryptography Theory and Practice", 2nd Edition, Chapman& Hall/CRC.
Outcome: After completion of course, the student will be able to:
• CO1: Understands the basic concepts of cryptography.
• CO2: Apply the symmetric key concepts of DES and AES for securing data.
• CO3: Apply the concepts of number theory of Asymmetric key cryptosystem.
• CO4: Understand the concepts of hash function, MAC and digital signature for data integrity.
• CO5: Explain the symmetric and asymmetric key distribution techniques.
• CO6: Understand the concepts of security mechanism at TCP/IP layer.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO5,PO12/PSO2,PSO3
CO2 PO1,PO2,PO3,PO12/PSO1,PSO2
CO3 PO1,PO2,PO4,PO5,PO6/PSO1,PSO4
CO4 PO1,PO2,PO3,PO5,PO6/PSO1,PSO3
CO5 PO1,PO2,PO6,PO12/PSO1,PSO4
CO6 PO1,PO2,PO6,PO12/PSO1,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0071: CRYPTOGRAPHY & NETWORK SECURITY LAB

Objective: The objective of this lab is that to understand the principles of encryption algorithms,
conventional and public key cryptography practically with real time applications.

Credits: 01 L–T–P-J: 0–0–2-0

Module
Content Hours
No.
 Write a program in ‘C’ to implement Additive and VignereCipher.
 Write a program in ‘C’ to implement Autokey Cipher.
 Write a program in ‘C’ to find out the Multiplicative inverse of a given
number.
 Write a program in ‘C’ to implement RSA Cryptosystem.
 Write a program in ‘C’ to implement Elgamal Cryptosystem.
I& II  Write a program in ‘C’ to implement Rabin Miller Primality Test. 24
 Write a program in ‘C’ to find out the Primitive roots.
 Write a program in ‘C’ to implement Euclidean Algorithm.
 Write a program in ‘C’ to implement Extended Euclidean Algorithm.
 Write a program in ‘C’ to implement Diffie-Hellman key exchange
Algorithm.
 Write a program in ‘C’ to implement Random Number Generator.

Textbooks:
 W. Stallings , "Cryptography and Network Security: Principles and Practices",5th Edition,
Pearson Education,2010.
Reference Books:
 B. A. Forouzan, "Cryptography & Network Security", 3rd Edition, Tata McGraw Hill,2003.
 Douglas Stinson, "Cryptography Theory and Practice", 2nd Edition, Chapman& Hall/CRC.
 K. N. King, “C Programming a Modern Approach”, W. W. Norton, 2nd Edition, 2008.
 Kernighan and Ritche, “The C Programming Language”, PHI, 2nd Edition, 2011.
 P.DeyandM.Ghosh, “ProgramminginC”, OxfordUniversityPress1stEdition,2000.

Outcome: After completion of this course students will be able to:

• CO1: Implement symmetric key encryption algorithms.
• CO2: Implement Asymmetric key encryption algorithms.
• CO3: Implement the concepts of number theoryAsymmetric key cryptosystem.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO6,PO12/PSO1,PSO4
CO2 PO1,PO2,PO6,PO12/PSO1,PSO4
CO3 PO1,PO3,PO4,PO6,PO12/PSO1,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0005: CYBERSECURITY AND DIGITAL FORENSICS

Objective: To give knowledge of constitutional and case law to search and capture digital evidence,
determine the most effective and appropriate forensic response strategies to digital evidence, and provide
effective proof in a case involving digital evidence.

Credits:03 L-T-P-J:3-0-0-0

Module Teaching
No. Content Hours
Introduction: Introduction and Overview of Cyber Crime, Nature and Scope of Cyber
Crime, Types of Cyber Crime: Social Engineering, Categories of Cyber Crime, Property
Cyber Crime.
Cyber Security issues:
Unauthorized Access to Computers, Computer Intrusions, White Collar Crimes, Viruses
and
I Malicious Code ,Security Engineering ,Network Security ,Information Security, Web 24
Security, Database Security, Malware Security, Biometric Security, Security in Cloud
Computing and Mobile Computing. Software Piracy, Intellectual Property, Digital laws
and legislation, Law Enforcement Roles and Responses.
Investigation:
Introduction to Cyber Crime Investigation - Investigation Tools Discovery - Digital
Evidence Collection, Evidence Preservation, E-Mail Investigation
Tracking - IP Tracking, E-Mail Recovery, Hands on Case Studies, Encryption and
Decryption Methods, Search and Seizure of Computers, Recovering Deleted Evidences,
Password Cracking.
Digital forensics:
Introduction to Digital Forensics, Forensic Software and Hardware, Analysis and
II Advanced Tools, Forensic Technology and Practices, Forensic Ballistics and Photography, 24
Face, Iris and Fingerprint Recognition, Audio Video Analysis, Windows System Forensics,
Linux System Forensics, Network Forensics.
Laws and acts:
Laws and Ethics, Digital Evidence Controls, Evidence Handling Procedures, Basics of
Indian Evidence ACT IPC and CrPC, Electronic Communication Privacy ACT, Legal
Policies.

Text Books:
 Guide to Computer Forensics and Investigations 6th Edition by Bill Nelson, Amelia Phillips and
Christopher Steuart, Cengage Publication
 Incident Response & Computer Forensics, Second edition by Chris Prosise and Kevin Mandia,
McGraw-Hill Education
Reference Books:
 Computer Forensics and Digital Investigation with EnCase Forensic v7 1st Edition by Suzanne
Widup, McGraw-Hill Education
 Forensic Computer Crime Investigation by Thomas A. Johnson, CRC Press
 Software Forensics: Collecting Evidence from the Scene of a Digital Crime 1st Edition by Robert
Slade, McGraw-Hill Education
Outcome: After completion of course, the student will be able to:
 CO1: Understand the basics of cyber security.
 CO2: Explain the basic concepts of System security.
 CO3: Understand the different investigation mechanism of cyber security.
 CO4: Explain the digital forensics in system security.
 CO5: Illustrate the laws and acts in cyber domain.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

COs POs/PSOs
CO1 PO1,PO2,PO3,PO6,PO12/PSO1,PSO3
CO2 PO1,PO2,PO3,PO4,PO5/PSO1,PSO4
CO3 PO1,PO3,PO4,PO6/PSO1,PSO3,PSO4
CO4 PO1,PO2,PO5/PSO1,PSO3
CO5 PO1,PO3,PO5/PSO1,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0072: CYBER SECURITY AND DIGITAL FORENSICS LAB

Objective: To give knowledge of constitutional and case law to search and capture digital evidence,
determine the most effective and appropriate forensic response strategies to digital evidence, and provide
effective proof in a case involving digital evidence.

Credits: 01 L–T–P-J: 0–0–2-0

Module
Content Hours
No.
 Working on footprinting and Reconnaissance of a network and server.
 Enumeration for network resources and enumerating local machines.
 Scanning Networks and finding vulnerabilities and exploit cases.
 Working on System Hacking and bypassing first line of security
(passwords /Encryption)
 Password hacking techniques like Brute force and Rainbow Attack.
 Working with viruses and malware.
 Packet Sniffing and network traffic analysis using wireshark.
I& II 24
 Manipulating person mindset using Social Engineering and its detection
techniques.
 Attacking web applications and servers using various Denial-of-Service
attacks.
 Vulnerability Assessment of web applications using Nikto /
Nessus/WPScanner
 Vulnerability Assessment of wireless networks using Fluxion / Aircrack-ng

Textbooks:
 “Gray Hat Hacking the Ethical Hackers Handbook, 3rd Edition” by Allen Harper and Shon Harris
Reference Books:
 “The Unrevealed Secrets of Hacking and Cracking – Hack Before You Get Cracked” by Prateek
Shukla and NavneetMehra
 “How to Unblock Everything on the Internet” by Ankit Fadia
 “The Web Application Hacker’s Handbook: Finding and Exploiting Security Flaws, 2ed” by
DafyddStuttard and Marcus Pinto
Outcome: After completion of this course students will be able to:
 CO1: Implement the reconnaissance attacks of cyber security.
 CO2: Implement the access attacks of cyber security.
 CO3: Identify vulnerability of web applications and wireless networks.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO3,PO5/PSO1,PSO4
CO2 PO1,PO2,PO3,PO5/PSO1,PSO4
CO3 PO1,PO2,PO3,PO5/PSO1,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0006: INFORMATION CODING TECHNIQUES

Objective: To introduce the fundamental concepts of information theory: data compaction, data
compression, data transmission, error detection and correction.

Credits:03 L-T-P-J:3-0-0-0

Module Teaching
No. Content Hours
Information entropy fundamentals
Uncertainty, Information and Entropy - Source Coding Theorem - Huffman coding –
Shannon Fano coding - Discrete Memory less channels - channel capacity - channel
coding Theorem - Channel Capacity Theorem.
Data and voice coding
I Differential Pulse Code Modulation - Adaptive Differential Pulse Code Modulation - 20
Adaptive sub band coding - Delta Modulation - Adaptive Delta Modulation - Coding of
speech signal at low bit rates (Vocoders, LPC).
Error control coding
Linear Block codes - Syndrome Decoding - Minimum distance consideration - cyclic codes
-Generator Polynomial - Parity check polynomial - Encoder for cyclic codes - calculation
of syndrome - Convolutional codes.
Compression techniques - text
Principles - Text compression - Static Huffman Coding - Dynamic Huffman coding -
Arithmetic coding.
Compression techniques - multimedia
Image Compression - Graphics Interchange format - Tagged Image File Format - Digitized 20
II documents - Introduction to JPEG standards.
Audio and video coding
Linear Predictive coding - code excited LPC - Perceptual coding, MPEG audio coders –
Dolby audio coders - Video compression - Principles - Introduction to H.261 & MPEG
Video standards.

Text Books:
 Communication Systems, 5th Edition by Simon Haykin and Michael Moher, Willey
 Multimedia Communications: Applications, Networks, Protocols and Standards by Fred Haskell,
Pearson Education India
Reference Books:
 Multimedia Communications: Directions and Innovations, 1st Edition, by Jerry Gibson, Academic
Press
 Information Theory and Network Coding by Raymond W. Yeung, Springer
 Fundamentals of Information Theory and Coding Design by Roberto Togneri and Christopher J.S
deSilva, Chapman and Hall/CRC
Outcome: After completion of course, the student will be able to:
 CO1: Understand the fundamentals of information coding techniques.
 CO2: Apply the modulation technique for encoding data and voice.
 CO3: Apply the error detection and correction techniques for error elimination.
 CO4: Apply the compression techniques for multimedia data.
 CO5: Understand the audio and video coding standards for data representations.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO5/PSO1,PSO4
CO2 PO1,PO2,PO3,PO4,PO5/PSO1,PSO4
CO3 PO1,PO3,PO12/PSO1,PSO4
CO4 PO1,PO2,PO3,PO4,PO5/PSO1,PSO4
CO5 PO1,PO5,PO6,PO12/PSO1,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0073: INFORMATION CODING TECHNIQUES LAB

Objective: To understand and implement the fundamental concepts of information theory: data
compaction, data compression, data transmission, error detection and correction .

Credits: 01 L–T–P-J: 0–0–2-0

Module
Content Hours
No.
 Write a program for determination of various entropies and mutual
information of a given channel. Test various types of channel such as
a) Noise free channel.
b) Error free channel
c) Binary symmetric channel
d) Noisy channel
Compare channel capacity of above channels.
 Write a program for generation and evaluation of variable length source
coding (Any two)
a) Shannon Fano coding and decoding
b) Huffman Coding and decoding
I& II 24
c) Lempel Ziv Coding and decoding
 Write a Program for coding & decoding of Linear block codes.
 Write a Program for coding & decoding of Cyclic codes.
 Write a program for coding and decoding of convolutional codes.
 Write a program for coding and decoding of BCH and RS codes.
 Write a program to study performance of a coded and uncoded
communication system (Calculate the error probability).
 Write a simulation program to implement source coding and channel
coding for transmitting a text file.
 Implementation of any compression algorithm for either audio, image or
video data.

Reference Books:
 Ranjan Bose, “Information Theory coding and Cryptography”, McGraw-Hill Publication,
2ndEdition
 C Moreira, P G Farrell, “Essentials of Error-Control Coding”, Wiley Student Edition
 BernadSklar, “Digital Communication Fundamentals & applications”, 2ndEd. Pearson Education.
 Shu lin and Daniel j, Cistellojr., “Error control Coding” Pearson, 2nd Edition.
 Todd Moon, “Error Correction Coding: Mathematical Methods and Algorithms”, Wiley Publication
 Khalid Sayood, “Introduction to data compression”, Morgan Kaufmann Publishers

Outcome: By the end of the class, students will learn to:

 CO1: Implement the coding and decoding techniques of multimedia data.
 CO2: Implement the error detection and correction technique for multimedia data.
 CO3: Implement the compression algorithms for image audio and video.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3,PO5,PO6/PSO1,PSO4
CO2 PO1,PO3,PO5,PO6/PSO1,PSO4
CO3 PO1,PO3,PO5 /PSO1,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0086: CYBERSECURITY AND DIGITAL FORENSICS PROJECT

Objective: To provide students with a comprehensive overview of collecting, investigating, preserving,

and presenting evidence of cybercrime left in digital storage devices.

Credits: 02 L–T–P-J: 0–0–0-0

1. Data Forensics:
Objective: Find and analyze hiddendata from slack, swap and dead spaces on small devices (PDAs,
phones ,USB sticks, etc.)
2. Honeypots:
Objective: Configure a honeypot and analyze the collected target data with and from honeypots.
3. Malware analysis:
Objective:Analyze of malware using static and dynamic/behavioral methods and use it for
malware detection, mitigation, the development of countermeasures
4. Dynamic Binary Instrumentation:
Objective:Use of software testing measures such as code coverage, Function callhooking, control flow
analysis, dynamic binary instrumentation helps ensure that an adequate slice of the program’s set of
possible behaviors has been observed.
5. Steganalysis:
Objective: Perform Steganalysison a JPEG Image Using Variation Techniques. Find and analyze hidden
data from the image.
6. Mobile Forensics:
Objective: Investigate into a Factory Reset of Android Device. Find and analyze hidden data from the
device.
7. Network Forensics:
Objective: Find different logs on the network and analyze to close the defined problem.
8. Capturing volatile and non-volatile information:
Objective: Capture information from different files systems. Simple and extended attributes, erased
data, file reassembly.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

SYLLABUS
OF
PROGRAM ELECTIVE
BOUQUET: SOFTWARE ENGINEERING

DEPARTMENT OF COMPUTER ENGINEERING &

APPLICATIONS

Under
Choice Based Credit System (CBCS)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
NO.
CODE SUBJECT PRE- REQUISITES
L T P J

Bouquet:Software Engineering
THEORY

1. BCSE0051 Software Quality Engineering 3 0 0 0 3 3 Software Engineering

2. BCSE0052 Service Oriented Architecture 3 0 0 0 3 3 Software Engineering

3. BCSE0053 Agile Software Development 3 0 0 0 3 3 Software Engineering

4. BCSE0054 Software Project Management 3 0 0 0 3 3 Software Engineering

5. BCSE0055 Software Testing 3 0 0 0 3 3 Software Engineering

6. BCSC0013 Compiler Design 3 1 0 0 4 4 TAFL

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0051: SOFTWAREQUALITY ENGINEERING

Prerequisite: Exposure to basic concepts of software engineering

Credits: 03 L–T–P-J: 3–0–0-

Module Teaching 0
Content
No. Hours
Software Quality: Software Quality Attributes and Specification, Total Quality
Management, ISO 9126 Quality Standards; Defects, Faults, Failures, Defect Rate
and Reliability, Defect Prevention, Reduction, and Containment, Overview of
Different Types of Software Review.
Software Quality Metrics: Product Quality Metrics- Defect Density, Customer
Problems Metric, Customer Satisfaction Metrics, Function Points; In-Process
I Quality Metrics- Defect Arrival Pattern, Phase-Based Defect Removal Pattern, 20
Defect Removal Effectiveness; Metrics for Software Maintenance- Backlog
Management Index, Fix Response Time, Fix Quality, Software Quality
Indicators.
Software Quality Assurance: Quality Planning and Control, Quality
Improvement Process, Evolution of Software Quality Assurance (SQA), Major
SQA Activities/Issues, Zero Defect Software.
Software Testing: Functional Testing - Boundary Value Testing, Equivalence
Class Testing, Decision Table Based Testing, Cause Effect Graphing Techniques;
Structural Testing- Path Testing, Data Flow Testing.
Test Selection & Minimization for Regression Testing: Regression Testing,
Regression Test Process, Initial Smoke or Sanity Test, Selection of Regression
II Tests, Classifying Test Cases, Methodology for Selecting Test Cases, Resetting 19
the Test Cases for Regression Testing; Introduction to Ad-Hoc Testing.
Testing Web Applications: Web testing, Functional Testing, User Interface
Testing, Usability Testing, Configuration and Compatibility Testing, Security
Testing, Performance Testing, Database Testing, Post-Deployment Testing,
Web Metrics; Introduction to Automated Test Data Generation.
Text Book:

 Stephen H. Kan, “Metrics and Models in Software Quality Engineering”, 2nd Edition, Pearson
Education,2000.
 Yogesh Singh , “Software Testing”, Cambridge University Press,2011.
Reference Books:

 Jeff Tian , “Software Quality Engineering (SQE)”, Wiley-Interscience,2005

 S. Desikan and G. Ramesh , “Software Testing: Principles and Practices”, Pearson Education,2008
 Aditya P. Mathur, “Fundamentals of Software Testing”, Pearson Education,2011
 NareshChauhan, “Software Testing: Principles and Practices”, 1st Edition, Oxford University
Press,2010.
 Naik and Tripathy, “Software Testing and Quality Assurance”, Wiley India,2008.

Outcome: After the completion of this syllabus, the student will be able to:
 CO1: Evaluate alternative standards, models and techniques aimed for quality software to
achieve the satisfaction of the client as well as developer.
 CO2: Propose the innovative solutions for the software quality assurance and measurement
problems in the context of various software development environments.
 CO3: Evaluate software quality assurance issues in software development and propose the
quality framework for an organization.
 CO4: Write the software test scenarios, test cases, test plans and various metrics of different
applications.
 CO5: Perform the testing of web based projects in team.
 CO6: Apply the suitable methodology to perform regression testing in projects.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO4,PO6/PSO4
CO2 PO2,PO3/PSO1,PSO4
CO3 PO11,PO12/PSO4
CO4 PO1,PO5,PO6/PSO1
CO5 PO1,PO5/PSO2
CO6 PO1,PO6/PSO1,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0052: SERVICE ORIENTED ARCHITECTURE

Prerequisite: Exposure of distributed systems

Credits: 03 L–T–P-J: 3–0–0-

Module Teaching 0
Content
No. Hours
Introduction: Introduction to Web 1.0, 2.0, Web Services (WS), Characteristics
of Web Services, WS Modeling Web Service Activities, WS Management, WS
Composition, Service Descriptions; Introduction to Service Oriented
Architecture (SOA), Characteristics Of SOA, Principles of SOA, Comparison of
Service and Object Orientation, SOA Interaction Cycle (SIC), Comparing SOA to
Client Server and Distributed Internet Architectures, Components of SOA;
I 20
Patterns Coordination, Atomic Transactions, Business Activities, Orchestration,
Choreography, Service Layer Abstraction, Application Service Layer, Business
Service Layer, Orchestration Service Layer.
Service Oriented Analysis: Business Centric SOA, Deriving Business Services,
Service Oriented Design, WSDL Basics, SOAP Basics, Messaging with SOAP,
Message Exchange.
SOA Composition, Guidelines: Entity Centric Business Service Design,
Application Service Design, Task Centric Business Service Design, SOA
Platforms - SOA Support in J2EE, Java API for XML Based Web Services
(JAX,WS).
II WS Integration concepts: Concepts of Enterprise Service Bus (ESB), Web 19
Services Interoperability Technologies (WSIT), SOA Support in .NET, Common
Language Runtime, ASP.NET Web Forms, ASP.NET Web Services, Web Services
Enhancements (WSE), Concepts of Business Process Execution Language
(BPEL).
Text Book:

 Thomas Erl, “SOA Principles of Service Design” The Prentice Hall Service Oriented Computing
Series, Prentice Hall India, 2008.
Reference Books:
 Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson Education, 2005.
 Sandeep Chatterjee, James Webber , “Developing Enterprise Web Services: An Architect’s Guide”,
Pearson Education, 2005.
 Munindar P. Singh, Michael N. Huhns, “Service-Oriented Computing: Semantics, Processes Agents”,
Wiley, 2010.
 Dan Woods and Thomas Mattern, “Enterprise SOA Designing IT for Business Innovation”, 1st Edition,
O’Reilly, 2006.
Outcome:After completion of the course, students will be able to:
 CO1: Understand the concept of service oriented architecture.
 Co2:Compare service oriented architecture with client server, and distributed internet architectures.
 CO3: Understand the concept of service oriented analysis.
 CO4: Understand the SOA Composition and Guidelines.
 CO5: Demonstrate the use of java API for XML based services.
 CO6: Understand the WS Integration concepts.
Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO2/PSO3
CO3 PO2/PSO3
CO4 PO3/PSO1
CO5 PO3,PO5/PSO4
CO6 PO4,PO5/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0053: AGILE SOFTWARE DEVELOPMENT

Prerequisite: Exposure of Software Engineering Principles

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Fundamentals of Agile: The Genesis of Agile, Introduction and background,
Agile Manifesto and Principles, Overview of Scrum, Extreme Programming,
Feature Driven development, Lean Software Development, Agile project
management, Design and development practices in Agile projects, Test Driven
Development, Continuous Integration, Refactoring, Pair Programming, Simple
Design, User Stories, Agile Testing, Agile Tools
I Agile Scrum Framework: 26
Introduction to Scrum, Project phases, Agile Estimation, Planning game,
Product backlog, Sprint backlog, Iteration planning, User story definition,
Characteristics and content of user stories, Acceptance tests and Verifying
stories, Project velocity, Burn down chart, Sprint planning and retrospective,
Daily scrum, Scrum roles – Product Owner, Scrum Master, Scrum Team, Scrum
case study, Tools for Agile project management
Agile Software Design:
Agile design practices, Role of design Principles including Single Responsibility
Principle, Open Closed Principle, Liskov Substitution Principle, Interface
Segregation Principles, Dependency Inversion Principle in Agile Design,
Agile Software Development:
Need and significance of Refactoring, Refactoring Techniques, Continuous
Integration, Automated build tools, Version control.
Current researches in Agile software development
II Agile Testing: The Agile lifecycle and its impact on testing, Test-Driven 26
Development (TDD), xUnit framework and tools for TDD, testing user stories -
acceptance tests and scenarios, Planning and managing testing cycle,
Exploratory testing, Risk based testing, Regression tests, Test Automation,
Tools to support the Agiletester
Industry Trends: Market scenario and adoption of Agile, Agile ALM, Roles in
an Agile project, Agile applicability, Agile in Distributed teams, Business
benefits, Challenges in Agile, Risks and Mitigation, Agile projects on Cloud,
Balancing Agility with Discipline, Agile rapid development technologies
Text Book:

 Ken Schawber& Mike Beedle, Agile Software Development with Scrum, Pearson, 2008
Reference Books:
 KenSchawber & MikeBeedle, AgileSoftware Development with Scrum,Pearson,2008
 RobertC.Martin , Agile Software Development ,Principles, Patterns and Practices,
Prentice Hall,2002
 Lisa Crispin & JanetGregory, AgileTesting: A Practical Guide for Testers and Agile
Teams, Addison Wesley,2008
 Alistair Cockburn, Agile Software Development: The Cooperative Game ,Addison Wesley ,2006
Outcome:After completion of the course, students will be able to:
 CO1: UnderstandthesignificanceofAgileMethodologiesinsoftwaredevelopment.
 CO2: Compare and contrast the different agile methods.
 CO3: Determine the suitability of agile methods for a particular Project.
 CO4:Evaluate how well a project is following agile principles, and assist the project to
become moreagile (where appropriate).
 CO5: Understand the relationship between the customer and the development team in agile
projects and the responsibilities of both communities.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO3,PO5,PO7,PO10/PSO1,PSO4
CO2 PO2,PO4,PO9/PSO2,PSO4
CO3 PO2,PO6,PO11/PSO1,PSO4
CO4 PO1,PO2,PO4/PSO1,PSO3
CO5 PO8,PO9,PO10,PO11/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0054: SOFTWARE PROJECT MANAGEMENT

Prerequisite: Exposure of Software Engineering Principles.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction to Project Management: The characteristics of software
projects, Objectives of project management: time, cost and quality, Basics of
Project Management, Feasibility Study, Cost-benefit Analysis, Planning, Project
Execution, Project and Product Life Cycles, Project Management Knowledge
areas, Project Management Tools & Techniques.
Project Management & Planning: System view of project management,
Understanding organizations, stakeholder’s management, project phases &
project life cycles. Introduction to Agile software, why planning is necessary,
I 20
Iterative steps for planning, Project Plan documentation methods, Software
Requirement Specification.
Measurement and Control: Measurements for project monitoring, what and
when to measure, Plan versus Control, managing the plan, Deadline Effect.
Reviews, feedback and reporting mechanisms, revisiting the plan.
Project Scope Management: Scope Planning & Scope management plans,
Function point calculation, Scope definitions & project scope statement, Work
Breakdown Structure (WBS)
Time Management: Project time management, activities sequencing, network
diagrams, activity recourse estimation, activity duration estimation, schedule
development, Gantt Charts, Critical path method, Program evaluation & review
technique (PERT) and CPM.
Project Cost management: Basis principles of cost management, Cost
estimating, type of cost estimate, cost estimate tools & techniques, COCOMO,
Putnam/ SLIM model Estimating by Analogy, cost budgeting, cost control,
earned value management, project portfolio management
II 19
Project Quality Management: Quality Planning, quality Assurance, Quality
control, Tool &techniques for quality control, Pareto Analysis, Six Sigma, CMM
Project Communication Management: Communication Planning,
Performance reporting, managing stakeholders, improving project
communication
Project risk management: Risk Management planning, common sources of
risk, risk identification, risk register, qualitative risk analysis, using probability
impact matrixes, risk monitoring & control.
Text Book:

 Bob Hughes and Mike Cotterell, “Software Project Management”, Tata McGraw Hill ,2009.
 Daniel Galin, “Software Quality Assurance: from Theory to Implementation”, Addison-Wesley,
2003.
Reference Books:

 Roger Pressman, A practitioner’s Guide to Software Engineering, Tata McGraw Hill ,2014
 Andrew Stellman; Jennifer Greene, Applied Software Project Management, O’Reilly Media, Inc.
2000.
 Ramesh Gopalaswamy, “Managing and global Software Projects”, Tata McGraw Hill Tenth
Reprint, 2011.
Outcome: After completion of the course, students will be able to:

 CO1: Understand the basics of software project management.

 CO2: Understand the concept behind the planning, scope and feasibility of a project.
 CO3: Identify the theoretical and methodological issues involved in modern software engineering
project management.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 CO4: Analyze various project estimation techniques, especially size estimation (FP), effort
estimation (COCOMO models), schedule estimation (GANTT charts), and cost estimation.
 CO5: Understand the concept of time and cost Management in a project life cycle
 CO6: Understand Project Communication Management and Project Risk Management.

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO1/PSO1,PSO4
CO3 PO2/PSO3
CO4 PO1,PO2/PSO3
CO5 PO1,PO2/PSO1,PSO4
CO6 PO1/PSO1

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0055: SOFTWARE TESTING

Prerequisite: Exposure to basic concepts of software engineering

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Testing Basics
Testing as an Engineering Activity – Role of Process in Software Quality –
Testing as a Process – Basic Definitions – Software Testing Principles – The
Tester’s Role in A Software Development Organization – Origins of Defects –
Defect Classes – The Defect Repository and Test Design – Defect Examples –
Developer / Tester Support for Developing a Defect Repository.
Test Case Design
Introduction To Testing Design Strategies – The Smarter Tester – Test Case
Design Strategies – Using Black Box Approach To Test Case Design – Random
Testing – Equivalence Class Partitioning – Boundary Value Analysis – Other
Black Box Test Design Approaches – Black Box Testing And Cots – Using White
I 20
Box Approach To Test Design – Test Adequacy Criteria – Coverage And Control
Flow Graphs – Covering Code Logic – Paths – Their Role In White Box Based
Test Design – Additional White Box Test Design Approaches – Evaluating Test
Adequacy Criteria.
Levels of Testing
The Need for Levels of Testing – Unit Test – Unit Test Planning – Designing The
Unit Tests – The Class as A Testable Unit – The Test Harness – Running The
Unit Tests and Recording Results – Integration Tests – Designing Integration
Tests – Integration Test Planning – System Test – The Different Types –
Regression Testing – Alpha, Beta and Acceptance Tests.

Test Management
Basic Concepts – Testing, Debugging Goals, Policies – Test Planning – Test Plan
Components – Test Plan Attachments – Locating Test Items – Reporting Test
Results – The Role Of Three Groups In Test Planning And Policy Development –
Process And The Engineering Disciplines – Introducing The Test Specialist –
Skills Needed By A Test Specialist – Building A Testing Group.
System Testing
Integration Testing, System Testing, Interaction Testing, Performance Testing,
II Mutation Testing, Regression Testing, Error Seeding 19
Object Oriented Testing
Issues In Object Oriented Testing, Test Case Design By Object Oriented
Software, Fault Based Testing, Test Cases And Class Hierarchy, Scenario Based
Test Design, Testing Surface Structure And Deep Structure, Class Testing:
Random Testing For Object Oriented Classes, Partition Testing At The Class
Level; Inter Class Test Case Design: Multiple Class Testing, Tests Derived From
Behavior Models, Test Case Generation Using Uml Diagrams, Gui Testing,
Object Oriented System Testing.
Text Book:

 SrinivasanDesikan, Gopalaswamy Ramesh, “Software Testing: Principles andPractices”, Pearson

2012
 C. J. Paul, Software testing: A craftsmen’s approach, CRC Press, 2nd Ed, 2002.
 R. Gopalswamy, Software testing, Pearson, 2005.
Reference Books:

 Aditya P. Mathur, “Foundations of Software Testing”, Pearson, 2008

 Paul Ammann, Jeff Offutt, “Introduction to Software Testing”, CambridgeUniversity Press, 2008
 G. J. Myers, the art of software testing, Wiley Interscience New York, 2005.
 R. S. Pressman, Software Engineering a Practitioner’s approach, McGraw Hill, 4th Ed, 1982.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 R. Mall, Fundamentals of Software Engineering, Prentice Hall of India, 2nd Ed, 2003.
Outcome:After completion of the course, students will be able to:

 CO1: Understand the basics of software Testing.

 CO2: Design various test cases for quality improvement.
 CO3: Understand different levels of software testing.
 CO4: understand the management process behind testing.
 CO5: understand concept of system testing.
 CO6: understand concept of Object Oriented System Testing.

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO11/PSO1
CO2 PO3,PO5/PSO1,PSO2
CO3 PO1,PO2/PSO1,PSO3
CO4 PO1,PO2/PSO1,PSO3
CO5 PO1,PO2/PSO2,PSO3
CO6 PO1,PO2,PO4/PSO1,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSC0013: COMPILER DESIGN

Objective: The course objective is to introduce the major concept areas of language translation and
compiler design and to enrich the knowledge in various phases of compiler ant its use, code optimization
techniques, machine code generation, and use of symbol table.

Credits:04 L–T–P-J: 3–1–0-0

Module Teaching
Content
No. Hours
Introduction to Compiler: Phases and passes, bootstrapping, Optimization of
DFA-Based Pattern Matchers implementation of lexical analyzers, lexical
analyzer generator, LEX-compiler, YACC, Context free grammars, derivation
and parse trees, capabilities of CFG.
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator
precedence parsing, top down parsing, predictive parsers Automatic
I 20
Construction of efficient Parsers: LR parsers, the canonical Collection of LR(0)
items, constructing SLR parsing tables.
Advance Parser: Constructing Canonical LR parsing tables, Constructing
LALR parsing tables, using ambiguous grammars, an automatic parser
generator, implementation of LR parsing tables.

Syntax-directed Translation: Syntax-directed Translation schemes,

Implementation of Syntax directed Translators, Intermediate code, postfix
notation, Parse trees & syntax trees, three address code, quadruple & triples,
translation of assignment statements, Boolean expressions, statements that
alter the flow of control, postfix translation, translation with a top down
parser. More about translation: Array Reference, Cases: in arithmetic
expressions, procedures call, declarations and case statements.
Symbol Tables: Data structure for symbols tables, representing scope
information. Run-Time Administration: Implementation of simple stack
allocation scheme, Storage allocation in block structured language.
II 20
Error Detection & Recovery: Lexical Phase errors, Syntactic phase errors,
semantic errors.
Code optimization: Machine-Independent Optimizations, Loop optimization,
DAG representation of basic blocks, Value numbers and algebraic laws, Global
Data-Flow analysis.
Code Generation: Design Issues, Target Language. Addresses in the Target
Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, Code
Generator.

Text Book:
 Aho, Sethi& Ullman , “Compilers: Principles, Techniques and Tools”, 2nd Edition, Pearson
Education, 2008.
Reference Books:
 V Raghvan, “Principles of Compiler Design”, 2nd Edition, TMH, 2010.
 Kenneth Louden , “Compiler Construction”, 1st Edition, Cengage Learning, 1997.
 Charles Fischer and Ricard LeBlanc , “Crafting a Compiler with C”, Pearson Education, 2005
Outcome: After the completion of the course, the student will be able to:
 CO1: Understand basics of Compilers and its phases.
 CO2: Design top-down and bottom-up parsers and will be able to solve problems related to
predictive parser, Shift reduce parsing, compute FIRST and FOLLOW sets, LR(0), LR(1) and
LALR sets of items and parse table for a given grammar.
 CO3: Demonstrate the ability to write syntax directed translations of simple statements and
understand the working of procedure calls.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 CO4: Demonstrate the ability to write intermediate code for a given high level programming
language (preferably C or FORTRAN) and be able to represent the intermediate code as
Quadruples, Triples and Indirect Triples
 CO5: Identify the basic blocks for three address code, draw flow graphs and represent directed
acyclic graphs for the identified basic blocks.
 CO6: Write the target optimized code (assembly code) for the given three-address code.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO3,PO4/PSO1,PSO2,PSO3
CO2 PO1,PO2,PO3,PO4,PO5/PSO1,PSO2,PSO3
CO3 PO1,PO2,PO3,PO4/PSO1,PSO2,PSO3
CO4 PO1,PO2,PO3,PO5/PSO1,PSO2,PSO3
CO5 PO1,PO2,PO3,PO4,PO5/PSO1,PSO2,PSO3
CO6 PO1,PO2,PO3,PO4,PSO5/PSO1,PSO2,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

SYLLABUS
OF
PROGRAM ELECTIVE
BOUQUET: IMAGE PROCESSING AND
INTELLIGENT SYSTEM

DEPARTMENT OF COMPUTER ENGINEERING &

APPLICATIONS

Under
Choice Based Credit System (CBCS)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
NO.
CODE SUBJECT PRE- REQUISITES
L T P J

Bouquet: Image Processing and Intelligent System

THEORY
Computer Graphics and Mathematics,
1. BCSE0102 3 1 0 0 4 4
Multimedia Programming
2. BCSE0103 Soft Computing 3 0 0 0 3 3 Discrete Mathematics

3. BCSE0104 Artificial Intelligence 3 0 0 0 3 3 Data Structures

Mathematics,
4. BCSE0105 Machine Learning 3 0 0 0 3 3
Programming
Machine Learningand Its Mathematics,
5. BCSE0106 3 0 0 0 3 3
Applications Programming
PRACTICALS

1. BCSE0132 Soft Computing Lab 0 0 2 0 1 2 Programming

2. BCSE0133 Machine Learning Lab 0 0 2 0 1 2 Programming

PROJECTS

1. BCSE0141 Machine Learning Project 0 0 0 - 2 - Programming

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0102: COMPUTER GRAPHICS & MULTIMEDIA

Objective:

Credits: 04 L–T–P: 3–1–0

Module Teaching
Content
No. Hours
Line clipping algorithms: Cohen Sutherland line clipping algorithm, Liang
Barsky Algorithms. Polygon clipping algorithms: Sutherland Hodgeman,
Weiler Atherton algorithms.
2DTransformation:Translation, Rotation, Scaling, Mirror Images,
transformations about an arbitrary point.
3D- Transformation: Translation, Rotation, Scaling, Rotation about an
I arbitrary axis, reflection about arbitrary planes. 20
Projection: parallel and perspective projections; orthographic Projections,
Axonometric, oblique, Multiple Views, Isometric Projection, Perspective
Projections (one, two and three vanishing points).
Quadric surfaces: spline representation, spline specification. Bezier curves,
B-splines.

Multimedia: Multimedia Architecture, Multimedia File formats.

Compression – lossy and lossless compression,
Text compression- Run length encoding (RLE), Shannon- Fano Algorithm,
Huffman Algorithm. Dictionary Methods-LZW Algorithms.
Image Compression- JPEG, MPEG.
II Audio Compression; WAVE, MPEG-1/2 Audio Layers. MIDI-File format, MIDI 20
and digital audio.
Illumination and Color Models: basic illumination models- Ambient light,
Diffuse and Specular, Shading- Flat, Gouraud, Phong.
Color Models: RGB color model, YIQ color model, CMY color models.
Graphics Standards: GKS, PHIGS.
Text Books:
 D.Hearn and M.P.Baker, Computer Graphics, PHI, 1996.

Reference Books:
 W.K. Gilloi , Interactive Computer Graphics, PHI.
 D.F. Rogers, Procedural Elements for Computer Graphics, TMH .
 J.D. Foley and A.D. Van, Fundamentals of Interactive Computer Graphic
 Rogers and Adam, Mathematical Elements for Computer Graphics, TMH
 R.Steinmetz and K. Nahstedt, Multimedia: Computing, Communications and Applications
PHI,PTR,1995
 Salomon, D., Motta, G. Handbook of Data Compression , Springer.2010.

Outcome: At the end of the course, students will be able to understand:

 CO1: Understand and demonstration of basic concepts of 2D and 3D Geometrical
Transformations.
 CO2: Understand the concept of vewing, viewport, window and curves and surfaces.
 CO3: Implement of clipping on different objects as line, point and polygon.
 CO4: Identify the projections of a given object in 2D environment.
 CO5: Understand the concepts of Illumination and Shading.
 CO6: Discuss and solve simple problems in the basic representation and handling of multimedia
data (images, audio and animation).
 CO7: Demonstrate and implementation of compression techniques of Text, image, Audio, video.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO1,PO3/PSO1,PSO3
CO3 PO1,PO5/PSO1
CO4 PO1,PO5/PSO1,PSO2
CO5 PO1,PO3/PSO1,PSO3
CO6 PO1,PO6/PSO1,PSO2
CO7 PO1,PO10/PSO1,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0103: SOFT COMPUTING

Objective: Students will get an insight of the intelligent computational approaches. Providing students, the
mathematical background to carry out optimization.

Credits: 03 L–T–P-J: 3–0–0-

Module 0 Teaching
Content
No. Hours
Neural Networks: Introduction to Soft Computing & Neural Computing,
Fundamentals of Artificial Neural Network(ANN), Models of ANN, ANN
models: Rosenblatt’s Perception, McCulloch & Pitts Model, Single Layer
Perceptron, Learning Methods in Perceptron, Linearly Separable Task and
XOR Problem, Multi-Layer Perceptron, Back Propagation Learning Algorithm,
I.
Associative Memory: Hopfield network, Auto Associative Memory, 20
Bidirectional Hetro-Associative Memory, ADALINE, MADALINE Network,
Applications of Neural Network.
Fuzzy Logic: Introduction to Fuzzy Sets & Crisp Sets, Fuzzy Membership and
Fuzzy Operations, Properties of Fuzzy Sets- Linguistic Hedges, Fuzzy Logic –
T-norms and other aggregation operators, Crisp Relations.
Fuzzy Logic: Fuzzy Relations, Fuzzy System, Crisp Logic, Propositional Logic
and its Laws, Inference in Propositional Logic, Fuzzy Logic, Inference in Fuzzy
Logic (GMP and GMT), Fuzzy Rule Based System, Fuzzyfication &
Defuzzification, Applications of Fuzzy Logic.
II. Genetic Algorithm(GA):Introduction to GA, Search optimization Method,
20
Evolutionary Algorithm Working Principle, Biological Background of GA,
Working Principles of GA, Encoding(Binary, Value, Permutation, Tree),
Operators of GA(Random Population, Reproduction or Selection), Crossover
and Mutation, Basics of Genetic Algorithm with Examples, Introduction to
Genetic programming

Text Books:
 S. Rajsekaran& G.A. VijayalakshmiPai, “Neural Networks, Fuzzy Logic and Genetic Algorithm:
Synthesis and Applications”, 4th Edition, Prentice Hall of India,2003.

Reference Books:
 Timothy J Ross ,"Fuzzy Logic with Engineering Applications", 3rd Edition, John Wiley and
Sons,2016.
 David E. Goldberg ,"Genetic Algorithm in Search Optimization and Machine Learning "Adission-
Wesley,2009.
 Karray, “Soft Computing and Intelligent Systems Design: Theory, Tools and Applications”, 1 st
Edition, Pearson Education,2009.

Outcome: After completion of course, student will be able to:

 CO1: Understand basics of Soft Computing including Artificial Neural Networks, Fuzzy Logic and
Genetic Algorithms.
 CO2: Demonstrate the ability to develop some familiarity with current research problems and
research methods in Soft Computing by working on a research or design project.
 CO3: Understand about the fundamental theory and concepts of neural networks, neuro
modeling, several neural networks paradigms and its applications.
 CO4: Design and implement the concepts of knowledge using fuzzy inference systems and other
machine intelligence applications.
 CO5: Identify an evolutionary computing paradigm known as genetic algorithms and its
applications to engineering optimization problems.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO3/PSO3
CO2 PO2,PO3, PO4/PSO2
CO3 PO2,PO3, PO5/PSO4
CO4 PO1,PO12/PSO4
CO5 PO2,PO5,PO12/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0132: SOFT COMPUTING LAB

Credits: 01 L–T–P-J: 0–0–2-0
Module Lab
Content
No. Hours
 Plot different types of activation functions.
 Program to create a perceptron network using command 'newp'
 Program for single perceptron
 To implement AND function using ADALINE with bipolar inputs and
outputs.
 To construct and test auto associative network for input vector using
HEBB rule
 Create a multilayer perceptron network and write a Program for
Backpropagation network.
I/II 12*2=24
 Program for fuzzy set with properties and operations
 Program for composition on Fuzzy and Crisp relations
 Program to find a relation using Max-Min Composition, enter the two
vectors whose relation is to be find
 Method of Defuzzification
 Write a program for design an inference system using membership
function
 Write a program for all types of crossover methods.
 Write a program for complete Genetic Algorithm cycle.

Text Books:
 N P Padhy, "Soft Computing: With MATLAB Programming”, Oxford Publication,2015.

Outcome: After completion of Lab, student will be able to:

 CO1: Understand about the existing software tools to solve real problems using a soft computing
approach.
 CO2: Design and implement the concepts of knowledge using fuzzy inference systems and other
machine intelligence applications.
 CO3: Implement the concepts of crossover and genetic algorithms.

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO5/PSO1
CO2 PO2,PO12/PSO2
CO3 PO3,PO4/PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0104: ARTIFICIAL INTELLIGENCE

Objective: The objective of the course is to present an overview of artificial intelligence (AI) principles and
approaches.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction: Introduction to Artificial Intelligence, Foundations of Artificial
Intelligence, Applications of Artificial Intelligence, Turing Test.
Introduction to Intelligent Agents: Agents and Environment, Concept of
rationality. Nature of environments, Knowledge based Agents, Structure of
Intelligent Agents.
Problem solving: Searching for solutions, Uninformed search strategies,
I Informed search strategies, Heuristic versus Solution Guaranteed Algorithm, 22
Hill Climbing, Simulated Annealing, Best First Search (A*), Problem Reduction
(AO*).
Knowledge & Reasoning: Propositional logic, First order predicate logic, Horn
Clause, Inference in First order logic, Unification, Forward& Backward chaining,
Resolution, Probabilistic reasoning, Bayesian Networks.

Knowledge Representation: Semantic nets,Partition net, Minskey Frames,

Case Grammar Theory, Transition Nets , Augmented Transition Net
Game Playing: Adversarial Search, Search for games, Alpha - Beta pruning,
Min-Max algorithm, Example of Games.
Introduction to Expert System: Rule based System, Architecture of expert
II 22
system, description of DENDRAL and MYCIN, Domain exploration, Meta
Knowledge, Fuzzy Expert System, Self-Explaining System.
Introduction to Machine Learning: Introduction, Supervised and
unsupervised learning, Decision trees, Introduction to Statistical learning
models, Reinforcement learning.
Text Book:
 S. Russell and P. Norvig, “Artificial Intelligence: AModern Approach”, 3rdEditionPrentice Hall

Reference Books:
 Elaine Rich and Kevin Knight, “Artificial Intelligence”, McGraw-Hill
 Dan W. Patterson, “Artificial Intelligence and Expert Systems”, Prentice Hall of India,
 E Charniak and D McDermott, “Introduction to Artificial Intelligence”, Pearson Education

Outcome: After completion of Lab, student will be able to:

 CO1: Apply the concepts of artificial intelligence.
 CO2: Formulate the complex problem using heuristic methods.
 CO3: Apply and design knowledge base.
 CO4: Formulate probability based AI Systems.
 CO5: Applydecision tree and statistical learning.
 CO6: Formulate models for Expert Systems.
Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO3,PSO4
CO2 PO2/PSO3
CO3 PO1,PO3/PSO2,PSO3
CO4 PO2/PSO2,PSO3
CO5 PO1 /PSO3
CO6 PO2/PSO3,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0105: MACHINE LEARNING

Objective: To introduce students to the basic concepts and techniques of Machine Learning. To develop
skills of using recent machine learning software for solving practical problems. To gain experience of doing
independent study and research.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction: Machine Learning basics, Hypothesis space and inductive bias,
training and test set, and cross-validation.
Introduction to Statistical Learning: Bayesian Method.
Machine Learning: Supervised (Regression, Classification) vs. Unsupervised
(Clustering) Learning.
I 20
Data Preprocessing: Imputation, Outlier management, One hot encoding,
Dimensionality Reduction- feature extraction, Principal Component Analysis
(PCA), Singular Value Decomposition
Supervised Learning: Regression- Linear regression, Polynomial regression,
Classification- Logistic regression, k-nearest neighbor classifier,

Supervised Learning: Decision tree classifier, Naïve Bayes classifier

Support Vector Machine (SVM)Classifier,
Unsupervised Learning: k-means clustering, Hierarchical clustering
II 20
Underfitting vs Overfitting: Regularization and Bias/Variance.
Ensemble methods: Bagging, Boosting, Improving classification with Ada-
Boost algorithm.

Text Book:
 Tom M. Mitchell, Machine Learning. Tata McGraw-Hill Education, 2013.
 Alpaydin, E. . Introduction to machine learning. MIT press, 2009.

Reference Books:
 Harrington, P. , “ Machine learning in action”, Shelter Island, NY: Manning Publications Co, 2012.
 Bishop, C. M. . Pattern recognition and machine learning (information science and statistics)
springer-verlag new york. Inc. Secaucus, NJ, USA. 2006

Outcome: After completion of Lab, student will be able to:

 CO1: Apply the basic concepts of machine learning.
 CO2: Apply the concepts of regression and re-sampling methods.
 CO3: Design supervised and re-enforcement learning based solution.
 CO4: Apply the ensemble methods for improving classification.
 CO5: Identify the ways of feature extraction, reduction and selection.
 CO6: Design the applications of machine learning algorithms.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO3,PSO4
CO2 PO1,PO2/PSO1,PSO3
CO3 PO1,PO3,PO5/PSO1,PSO3
CO4 PO1 /PSO1
CO5 PO2/PSO3
CO6 PO1,PO2,PO3/PSO1,PSO2,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0106: MACHINE LEARNING AND ITS APPLICATIONS

Objective: To introduce students to the basic concepts and techniques of Machine Learning. To develop
skills of using recent machine learning software for solving practical problems. To gain experience of doing
independent study and research.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction: Machine Learning basics, Applications, Type of Learning
Algorithm
Hypothesis space and inductive bias: Concept-Learning, Hypotheses
Representation, Find-S Algorithm
Machine Learning: Training, Testing, Evaluation: Cross-validation,
Confusion Matrix, Precision, Recall, F1-score, ROC curve, Overfitting, Bias,
I Variance Trade off 20
Supervised Learning: Regression- Linear regression, Polynomial regression,
Gradient Descent Algorithm
Data Preprocessing: Imputation, Outlier management, One hot encoding,
Feature selection, Filter and Wrapper approach
Supervised Learning: Classification- Logistic regression, k-nearest neighbor
classifier, Decision tree classifier, Naïve Bayes classifier,

Supervised Learning:Support vector machine classifier

Feature Extraction: Principal Component Analysis (PCA)
Unsupervised Learning: k-means clustering, Hierarchical clustering
Ensemble methods: Bagging, Boosting, Improving classification with
Random forest, Ada-Boost algorithm.
II 20
Artificial Neural Network - Introduction, Model Representation, Gradient
Descent, Stochastic Gradient Descent, Multilayer Perceptron, Multiclass
Representation, Backpropagation Algorithm.
Deep Learning: Introduction, Convolutional neural network and Recurrent
neural network

Text Book:
 Tom M. Mitchell, “Machine Learning”. Tata McGraw-Hill Education, 2013.
 Alpaydin, E. , “ Introduction to machine learning”. MIT press, 2009.

Reference Books:
 Harrington, P., .” Machine learning in action”. Shelter Islan”, NY: Manning Publications Co, 2012.
 Bishop, C. M. . Pattern recognition and machine learning (information science and statistics)
springer-verlag new york. Inc. Secaucus, NJ, USA, 2006.

Outcome:After completion of Lab, student will be able to:

 CO1: Apply the basic concepts of machine learning.
 CO2: Analyze the concepts of regression and re-sampling methods.
 CO3: Design supervised and re-enforcement learning based solutions.
 CO4: Apply the ensemble methods for improving classification.
 CO5: Identify the ways of feature extraction, reduction and selection.
 CO6: Design the applications of machine learning algorithms.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO3,PSO4
CO2 PO1,PO2/PSO1,PSO3
CO3 PO1,PO3,PO5/PSO1,PSO3
CO4 PO1 /PSO1
CO5 PO2/PSO3
CO6 PO1,PO2,PO3/PSO1,PSO2,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0133: MACHINE LEARNING LAB

Credits: 01 L–T–P-J: 0–0-2-0

S.No PROGRAM

1 Estimate parameters of a model based on Linear Regression method using a given set of
training data set.

2 Estimate parameters of a model based on maximum likelihood estimation method using

a given set of training data set.

3 Compute weights of ANN based on back propagation method using a given training
dataset.

4 Compute probability of a person to be diabetic based on a given dataset of diabetic

persons using Naïve Bayesian classifier.

5 Classify a person as male or female based on a given dataset using naïve Bayesian
Classifier, and calculate accuracy, precision, and recall for your data set.

6 Write a program to implement k-Nearest Neighbour method to classify the iris data set.
Print both correct and wrong predictions. Use Java/Python ML library classes

7 Predicts whether the bank should approve the loan of an applicant, based on his profile
using Ensemble learning method.

Apply Ensemble learning to cluster a set of data stored in a .CSV file. Use the same
8 dataset for clustering using k-Means method. Compare the results of these two
algorithms and comment on the quality of clustering. You can add Java/Python ML
library classes/API in the program.

9 The stock prediction data is used to predict, whether the stock will go up or down.
Perform the task of feature selection with the help of wrapper method.

10 Identify principal components of Big Mart sales data using Principal component analysis
(PCA). Also plot the result of PCA, and give inferences.

Outcome: After studying the subject, the students will be able to:
 CO1: Applythe machine learning algorithms in the area of text, audio and image processing.
 CO2: Apply classification algorithms to design complex problems.
 CO3: Design solution to societal issues using machine learning algorithms.
 CO4: Analyze the view problem in the perspective of machine learning.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

CO PO/PSO
CO1 PO3,PO5/PSO4
CO2 PO1,PO5/PSO1,PSO3,PSO4
CO3 PO3 /PSO1,PSO2,PSO4
CO4 PO2,PO3/PSO1,PSO2,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0141: MACHINE LEARNING PROJECT

Credits: 02 L–T–P-J: 0–0–0-0

1. Iris Flowers Classification ML Project: Learn about Supervised Machine Learning Algorithms
Objective: The goal of this machine learning project is to classify the flowers into among the three
species – virginica, setosa, or versicolor based on length and width of petals and sepals.
2. BigMart Sales Prediction ML Project: Learn about Unsupervised Machine Learning Algorithms
Objective: The goal of the BigMart sales prediction ML project is to build a regression model to predict
the sales of each of 1559 products for the following year in each of the 10 different BigMart outlets.
3. Social Media Sentiment Analysis using Twitter Dataset
Objective: Working with the twitter dataset will help you understand the challenges associated with
social media data mining and also learn about classifiers in depth.
4. Sales Forecasting using Walmart Dataset
Objective: The goal of this machine learning project is to forecast sales for each department in each
outlet to help them make better data driven decisions for channel optimization and inventory planning.
5. Learn to build Recommender Systems with MovieLens Dataset
Objective: The goal of this machine learning project is to start working with this dataset by building a
world-cloud visualization of movie titles to build a movie recommender system.
6. Stock Prices Predictor
Objective: Stock prices predictor is a system that learns about the performance of a company and
predicts future stock prices.
7. Boston Housing Price Prediction ML Project
Objective: The goal of this machine learning project is to predict the selling price of a new home by
applying basic machine learning concepts on the housing prices data.
8. MNIST Handwritten Digit Classification
Objective: The goal of this machine learning project is study, analyze and recognize elements in the
images.
9. Human Activity Recognition using Smartphone Dataset
Objective: The goal of this machine learning project is to build a classification model that can precisely
identify human fitness activities. Working on this machine learning project will help you understand how
to solve multi-classification problems.
10. Use classification and clustering techniques to deal with the Turkiye Student Evaluation Data
Set
Objective: This dataset is based on an evaluation form filled out by students for different courses. It has
different attributes including attendance, difficulty, score for each evaluation question, among others.
This is an unsupervised learning problem.
11. Predict height and weight from Heights and Weights dataset.
Objective: The goal of this project is to learn the concept of Regression.
12. Text Mining Data Set
Objective: The goal of this project is classify the documents according to their labels.
13. Predict the income class of any country population
Objective: The goal of this project is to work with imbalanced classification problem.
14. Classify the type of sound from the audio.
Objective: The goal of this project is to introduce the student to audio processing in the usual
classification scenario.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

SYLLABUS
OF
PROGRAM ELECTIVE

BOUQUET: ADVANCED DATA PROCESSING

DEPARTMENT OF COMPUTER ENGINEERING &

APPLICATIONS

Under
Choice Based Credit System (CBCS)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME PRE-
CODE SUBJECT
NO. REQUISITES
L T P J

Bouquet: Advanced Data Processing

THEORY
Advanced Concepts in Database
1. BCSE0151 3 0 0 0 3 3 DBMS
Systems
2. BCSE0152 Data Mining and Warehousing 3 0 0 0 3 3 DBMS

3. BCSE0153 Business Intelligence 3 0 0 0 3 3 DMW

DATA
4. BCSE0154 Information Retrieval System 3 0 0 0 3 3
STRUCTURE
Distributed and Parallel
5. BCSE0155 3 0 0 0 3 3 DBMS
Databases
TAFL/Compiler
6. BCSE0156 Natural Language Processing 3 0 0 0 3 3
Design
Introduction to Big Data
7. BCSE0157 3 0 0 0 3 3 DBMS
Analytics
8. BCSE0158 Big Data Analytics 3 0 0 0 3 3

PRACTICALS
Data Mining and Warehousing
1. BCSE0181 0 0 2 0 1 2
Lab
2. BCSE0182 Business Intelligence Lab 0 0 2 0 1 2

3. BCSE0183 Big Data Analytics Lab 0 0 2 0 1 2

PROJECTS

1. BCSE0191 Business Intelligence Project 0 0 0 - 2 -

2. BCSE0192 Big Data Analytics Project 0 0 0 - 2 - Programming

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE 0151: ADVANCED CONCEPTS IN DATABASE SYSTEMS

Objective: This course aims to give students in depth information about query processing and
optimization, advanced query processing techniques, and advanced databases.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Query Processing and Optimization: Concept of High-level Query
Processing, Algorithms for Executing Query Operations. Heuristics for Query
Optimizations, Estimations of Query Processing Cost, Query Evaluation
Plans, Pipelined Evaluations, Query Processing using Join, Group by and Sub
I Queries. 20
Advanced Query Processing: Advanced Query Processing using Records,
Cursors, Stored Procedures. Advanced PL/SQL Functions: Parameters in
Procedure and Functions, Exception Handling, Types of PL/SQL Triggers:
Row level Triggers, Statement level Triggers, Cyclic Cascading in Triggers.
Enhanced Data Model for Advanced Applications: Introduction to
Temporal Database Concepts, Spatial and Multimedia Databases, Active
Database System, Deductive Databases, Main Memory Database, And
Evolutionary Database.
II 20
Introduction to Expert Database and Fuzzy Database System: Expert
Databases - Use of Rules of Deduction in Databases, Recursive Rules. Fuzzy
Databases – Fuzzy Set & Fuzzy Logic, Use of Fuzzy Techniques to Define
Inexact and Incomplete Databases.
Text Books:
th
 Elmasri, Navathe, “Fundamentals of Database Systems”, 7 Edition, Pearson,2016.
Reference Books:
 Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Wisdom , “Database Systems: The Complete
Book",2ND Edition, Pearson,2008.
 Korth, Silbertz, Sudarshan, “Database Concepts”, 6thEdition, McGraw Hill,2011.
 Ramakrishnan, Gehrke, “Database Management System”, 3rd.Edition, McGraw Hill,2007.

Outcome: After completion of course, student will be able to:

 CO 1: Design high-level query using Join, Group by and sub queries.
 CO 2: Understand query optimization and query evaluation using different techniques.
 CO 3: Implement advanced queries as series of primitive operations.
 CO 4: Implement PL/SQL triggers in different applications.
 CO 5: Understand functioning of advance databases.
 CO 6: Apply expert databases in designing fuzzy logic based applications.

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO3/PSO2
CO2 PO4/PSO4
CO3 PO1/PSO1
CO4 PO2,PO3/PSO4
CO5 PO5/PSO1
CO6 PO3/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE 0152: DATA MINING & WAREHOUSING

Credits: 03 L–T–P-J: 3–0–0-0

Objective: The Objective of this course is to introduce the basic concepts of Data Warehouse and Data
Mining techniques.

Module Teaching
Content
No. Hours
Data Warehousing: Overview, Difference between Database System and Data
Warehouse, Multi-dimensional Data Model: Concept Hierarchy, Three-Tier
Architecture, Meta Repository, Data Warehouse & OLAP Technology, Types of
OLAP Servers. Data Cubes Computations & Data Generalization.
Data Pre Processing: Data Cleaning, Data Integration and Data
Transformation, Data Reduction
I 13
Mapping the Data Warehouse to a Multiprocessor Architecture, Multi-
Dimensional Data Model.
Introduction: Basics of Data Mining, Issues and Applications of Data Mining
Techniques. Mining frequent Patterns: Basic Concepts of Association Rules
Mining, Apriori Algorithm, FP-Growth. Multilevel Association Rules, Multi-
Dimensional Association Rules.

Classification and Predictions: Classification & Prediction, Issues Regarding

Classification and Prediction, Decision Tree, Bayesian Classification, Back
Propagation, Neural Network, Nearest Neighbour Classifiers, Support Vector
Machines, Prediction.
Data Mining Cluster Analysis: Data Types in Cluster Analysis, Categories of
II 13
Clustering Methods, Partitioning Methods.
Hierarchical Clustering- CURE and Chameleon.
Density Based Methods-DBSCAN, OPTICS. Grid Based Methods STING,
CLIQUE. Model Based Method –Statistical Approach, Outlier Analysis, Mining
Multimedia Data, Text Mining, Web Data Mining, Spatial Data Mining,
Temporal Data Mining, Data Visualization.

Text Books:
 Jiawei Han, MichelineKamber,” Data Mining Concepts& Techniques”, 3rdEdition, Morgan
Kauffmann,2013.
Reference Books:
 M. H. Dunham , “Data Mining: Introductory and Advanced Topics”, 1 st Edition, Pearson
Education,2003.
 Sam Anahory, Dennis Murray , “Data Warehousing in the Real World: A Practical Guide for
Building Decision Support Systems”, 4th Edition, Pearson Education,2009.
 Pang-Ning Tan, Michael Steinbach, Vipin Kumar , “Introduction to Data Mining”, 2ndEdition,
Addison-Wesley,2006.
 Aggarwal, , “Data Mining: The Textbook”, Springer,2015.
Outcome: After the completion of this course, student will be able to:
 CO1: Understand and apply the concept of data warehouse and mining in real-life applications.
 CO2: Apply the principle algorithms used in modern machine learning.
 CO3: Apply the information theory and probability theory to get the basic theoretical results in
Data Mining.
 CO4: Apply Data mining algorithms to real datasets, evaluate their performance and appreciate
the practical issues involved.
 CO5: Implement clustering using various clustering methods on data set.


DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO1
CO2 PO1,PO3,PO4/PSO1,PSO3
CO3 PO1 /PSO1
CO4 PO1 /PSO2
CO5 PO3/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0181: DATA MINING & WAREHOUSING LAB

Credits: 01 L–T–P-J: 0–0–2-0

Objective: The Objective of this course is to implement and run the programme based on the basic concepts of
Data Warehouse and Data Mining techniques

Module
Content Lab Hours
No.
 Demonstration of pre-processing on different dataset
 Demonstration of Association rule process on different dataset using
apriori algorithm
 Demonstration of classification rule process on different dataset using FP
Tree algorithm
 Demonstration of classification rule process on different dataset using
id3 algorithm
 Demonstration of classification rule process on different dataset using
naïve bayes algorithm
 Demonstration of clustering rule process on different dataset using
simple k-means
 Demonstration of clustering rule process on different dataset using
simple k-mediods
24
 Demonstration of clustering rule process on different dataset using
simple k-mode.
I/II  Demonstration of clustering rule process on different dataset using
DBSCAN.
 Demonstration of clustering rule process on different dataset using
simple Hieratical based algorithm.
 Implementation of K-NN Algorithms on different data sets.
 Implementation of Sequential pattern SPADE algorithm on sequence data
set.
 Implementation of Sequential pattern GSP algorithm on sequence data
set.
 Implementation of SVM on a two dimensional data set.
 Demonstration of Decision Tree on Weka Tool.

Text Books:
 Toby Segaran, Programming Collective Intelligence Building Smart Web 2.0 Applications, O'Reilly
Media,2015.
Reference Books:
 Mark Hall, Eibe Frank, Geoffrey Holmes, Bernhard Pfahringer, Peter Reutemann, and Ian H.
Witten (2009). The WEKA Data Mining Software: An Update. SIGKDD Explorations, Volume 11,
Issue 1.
 https://www.cs.waikato.ac.nz/ml/weka/Witten_et_al_2016_appendix.pdf
Outcome: After completion of this course students will be able to:
 CO1: Implement the clustering technique like DBSCAN, K-NN, K Mean.
 CO2: Implement SVM on two dimensional data set.

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO3/PSO3
CO2 PO1,PO3/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0153: BUSINESS INTELLIGENCE

Objective: The objective of this course is for the students to achieve a profound understanding of Business
Intelligence (BI) systems in terms of its tools, current practices and impacts.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction to Business Intelligence: BI Definitions & Concepts, BI
Framework, Data Warehousing Concepts and Its Role in BI; BI Infrastructure
Components – BI Process, BI Technology, BI Roles & Responsibilities, Business
Applications of BI, BI Best Practices. Effective and timely decisions – Data,
information and knowledge – Role of mathematical models – Business
I intelligence architectures: Cycle of a business intelligence analysis – Enabling
20
factors in business intelligence projects – Development of a business
intelligence system – Ethics and business intelligence.
Basics of Data Integration: Concepts of Data Integration, Needs and
Advantages of using Data Integration, Introduction to Common Data
Integration Approaches; Meta Data - Types and Sources, Introduction to Data
Quality
Data Profiling Concepts and Applications, Introduction to ETL using Kettle.
Marketing models – Logistic and Production models – Case studies. Efficiency
Measures and Metrics: Efficiency measures – The CCR model: Definition of
target objectives- Peer groups – Identification of good operating practices;
cross efficiency analysis – virtual inputs and outputs – Other models.
II Introduction to Business Metrics and KPIS, Creating Cubes using Microsoft 20
Excel.
Basics of Enterprise Reporting: A Typical Enterprise, Malcolm Bridge -
Quality Performance Framework, Balanced Scorecard, Enterprise Dashboard,
Balanced Scorecard vs. Enterprise Dashboard, Enterprise Reporting using MS
Access / MS Excel, Best Practices in the Design of Enterprise Dashboards.
Text Books:
 RN Prasad and Seema Acharya , “Fundamentals of Business Analytics”, Wiley India, 2nd
Edition,2018.
Reference Books:
 U Dinesh Kumar , “Business Analytics: The Science of Data - Driven Decision Making”, Wiley
India, 1st Edition,2017.
 David Loshin, “Business Intelligence”, 2nd Edition, Elsevier Science & Technology,2012.
 Mike Biere, “Business Intelligence for the Enterprise”, Pearson,2010.
 IBM , “An Introduction to Building Data Warehouse”, Prentice Hall of India,2004.
 Larissa Terpeluk Moss &ShakuAtre, “Business Intelligence Roadmap”, Pearson,2003
Outcome: At the end of this course, student will be able to
 CO1: Identify the major frameworks of computerized decision support: decision support systems
(DSS), data analytics and business intelligence (BI).
 CO2: Explain the foundations, definitions, and capabilities of DSS, data analytics and BI.
 CO3: Design tested and effective advanced analytics models and simulations for decision
making.
 CO4: Understand the methodology of engineering legacy databases for business intelligence to
derive business rules for decision support systems.
 CO5: Articulate assumptions, analyses, and interpretations of data in an oral formatApply big
data technologies in business intelligence using geospatial data, location-based analytics, social
networking, Web 2.0, reality mining, and cloud computing.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO5/PSO1
CO2 PO1,PO2/PSO3
CO3 PO1/PSO1,PSO3
CO4 PO3,PO6/PSO1,PSO4
CO5 PO2,PO3/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0182: BUSINESS INTELLIGENCE LAB

Objective: This course introduces students to Business Intelligence, Students will learn to create multiple
reports and analyze data using various methods and generate Business reports. Student will also learn data
representation in dimensional Modeling

Credits: 01 L-T–P-J: 0–0–2-0

Module
Content Lab Hours
No.

Introduction to Cognos Studio(Framework Manager, Report Studio,

Query Studio)
I& II
 Overview of BI Tool-Cognos Report Studio
 Installation of Cognos with IBM DB2
 Authoring Reports

Generation of Sample Reports

 List, Crosstab and Charts Reports

 Grouping and Summarizing Data
24
Various Operation on Reports

 Filtering on Reports
 Sorting and calculation on Reports
 Adding Prompt in Reports
 Creation of Miscellaneous Reports
 Scenario/ Objective Based Reports

Reference Books:

 Paul Teetor. R Cookbook: Proven recipes for data analysis, statistics, and
graphics. O'Reilly Media, Inc.,2011.
 Norman Matloff. Theart of R programming: A tour of statistical software design.
No Starch Press, 2011.
 Winston Chang. R graphics cookbook. O'Reilly Media, Inc., 2012.
 Hadley Wickham and Garrett Grolemund. R for data science. 2016.
 Phil Spector. Data manipulation with R. Springer Science& Business Media, 2008.

Outcome: At the end of the course, student is able to:

 CO1: Apply R-Studio, read R documentation, and write R scripts.
 CO2: Analyse the data using data analytics latest tools based on HDFS like Pig, Hive.
 CO3: Implement the aggregation projection on data set using Cassandra, MongoDB.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO4,PO5/PSO2
CO2 PO2,PO3/PSO4
CO3 PO1,PO2/PSO1

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0154: INFORMATION RETRIEVAL SYSTEMS

Objective: This course aims to give students an understanding of the fundamental techniques for hyper-
media architectures, design and usability, document management and retrieval, meta data management,
and searching the web.

Credits: 03 L–T–P: 3–0–0

Module Teaching
Content
No. Hours
Introduction to IR: IR Concepts, Boolean Retrievals- An Example
Information Retrieval Problem, A First Take at Building an Inverted Index,
Processing Boolean Queries.
The Term Vocabulary and Postings Lists: Document Delineation and
Character Sequence Decoding, Determining the Vocabulary of Terms.
I Dictionaries and Tolerant Retrieval: Search Structures for Dictionaries, 22
Wildcard Queries, Spelling Correction, Phonetic Correction.
Index Construction: Hardware Basics Blocked Sort-Based Indexing.Scoring,
Term Weighting and the Vector Space Model: Parametric and Zone Indexes,
Term Frequency and Weighting, The Vector Space Model for Scoring.

Evaluation in Information Retrieval: Information Retrieval System

Evaluation, Standard Test Collections, Evaluation of Unranked Retrieval Sets,
Evaluation of Ranked Retrieval Results.
XML Retrieval: Basic XML Concepts, Challenges in XML Retrieval, A Vector
Space Model for XML Retrieval, Evaluation of XML Retrieval, Text-Centric vs.
Data-Centric XML Retrieval.
II 20
Web Search Basics: Web Characteristics, Advertising as the Economic
Model, The Search User Experience, Index Size and Estimation, Near-
Duplicates and Shingling.
Web Crawling and Indexes: Overview, Crawling, Distributing Indexes,
Connectivity Servers.
Link Analysis: The Web as a Graph, Page Rank, Hubs and Authorities.
Textbook:
 Christopher D. Manning, Prabhakar Raghavan and HinrichSchütze , “Introduction
to Information Retrieval”, Cambridge University Press,2009.
Reference Books:
 Ricardo Baeza-Yate, Berthier Ribeiro-Neto,“Modern Information
Retrieval”,2 Edition, Addison Wesley,2011.
nd

 SoumenChakrabarti, “Mining the Web: discovering knowledge from hypertext

data”, 2 Edition, Morgan Kaufmann,2002
nd

 David A. Grossman, Ophir Frieder , “Information Retrieval: Algorithms, and

Heuristics”,2 Edition, Springer,2004.
nd

Outcome: After successful completion of this course, students should be able to:
 CO1: Apply different information retrieval techniques in real life application.
 CO2: Analyze indexing and pre-processing of textual documents for IR system.
 CO3: Apply IR principles into Spelling Correction, Phonetic Correction.
 CO4: Analyze performance of retrieval systems.
 CO5: Apply IR techniques to XML Retrieval.
 CO6: Develop retrieval systems for web search tasks.
 CO7: Demonstrate similarity computation for document.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2,PO4/PSO3
CO2 PO2,PO4/PSO4
CO3 PO1,PO3,PO4/PSO4
CO4 PO3,PO4/PSO1,PSO4
CO5 PO1,PO2,PO5/PSO1
CO6 PO3,PO5 /PSO1,PSO4
CO7 PO2,PO3,PO5/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0155: DISTRIBUTED AND PARALLEL DATABASE

Objective: The course introduces the types of parallelism in database systems, architecture of parallel and
distributed database systems; parallel query processing; data partitioning.

Credits: 03 L-T–P: 3–0–0

Module Teaching
Content
No. Hours
Introduction: Introduction to Databases, Overview of Relational DBMS,
Relational Database concepts, Normalization.
Distributed Database: Introduction, Comparison of Distributed and
I CentralizedDatabaseSystems,DistributedDatabaseArchitecture,Distributed 20
DataBaseDesign,TypesofDataFragmentations,FragmentationandAllocation of
Fragments, Distributed Catalog Management.
Transactions Management in Distributed Database: Properties and Goals of
Transaction Management, Distributed Transactions, Two Phase Commit
Protocol, Recovery Mechanism in case of Transaction Failures, Log Based
Recovery, Communication and Site Failures.

Concurrency Control in Distributed Database: Serializability, Locking and

Timestamp Based Concurrency Control Approach in Distributed Databases.
Optimistic Concurrency Control Approach, Introduction to Distributed
Deadlocks, Local and Global Wait-For-Graphs, Deadlock Detection and
Prevention of Deadlocks.
II 20
Parallel Database: Database Server Approach, Parallel Architectures, Parallel
DBMS Techniques- Data Placement, Query Parallelism, Parallel Database
Processing, Parallel Query Optimization; Parallel Execution Problems-
Initialization, Interferences and Convoy Effect, Load Balancing, Parallel
Execution for Hierarchical Architecture – Basic Concept, Load Balancing
Strategy, Performance Evaluation.

Text Books:
 M. Tamer Oezsu, Patrick Valduriez. “Principles of Distributed DatabaseSystems”,2ndEdition,
Prentice Hall,2011.
Reference Books:
 Elmasri, Navathe, “FundamentalsofDatabaseSystems”,5 Edition, Pearson,2011.
th

 Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom, ,"Database Systems: The

CompleteBook",2ndEdition, Pearson,2008.
 Philip A. Bernstein, VassosHadzilacos, Nathan Goodman , "Concurrency Control and
Recovery in Database Systems", Addison-Wesley.1987.
 Jim Gray, Andreas Reuter,"Transaction Processing: Concepts and Techniques", Morgan
Kaufmann,1993.
Outcome: At the end of the course, student will able to:
 CO1: Understand the concepts of distributed database and its structures.
 CO2: Apply queries for effective, noiseless data retrieval in distributed database environment.
 CO3: Implement various concurrency control approaches to ensure recovery of Database.
 CO4: Apply primitive operations concurrently.
 CO5: Understand parallel computing environments, their implications, cost benefits and services.
 CO6: Apply design techniques, middleware and development tools for tuning an application
environment.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO5/PSO1
CO2 PO5/PSO4
CO3 PO5/PSO4
CO4 PO2/PSO4
CO5 PO1/PSO1
CO6 PO3/PSO2, PSO1

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BSCE0156: NATURAL LANGUAGE PROCESSING

Objective: The objective of this course is to introduce to the students the leading trends and system in
natural language processing and make them understand the concepts of morphology, syntax, semantics and
pragmatics of the language.
Credits: 03 L-T–P: 3–0–0

Module Content Teaching

No. Hours
Introduction to Natural Language Understanding: The study of Language,
Applications of NLP, Evaluating Language Understanding Systems, Different
levels of Language Analysis, Representations and Understanding, Organization
of Natural Language Understanding Systems, Linguistic Background: An
outline of English syntax.
Applications: Named entity recognition and relation extraction- IE using
I sequence labelling-Machine Translation (MT) - Basic issues in MT-Statistical 20
translation-word alignment- phrase-based translation – Question Answering
Grammars and Parsing: Grammars and sentence Structure, Top-Down and
Bottom-Up Parsers, Transition Network Grammars, Top-Down Chart Parsing.
Feature Systems and Augmented Grammars: Basic Feature system for English,
Morphological Analysis and the Lexicon, Parsing with Features, Augmented
Transition Networks.

Grammars for Natural Language: Auxiliary Verbs and Verb Phrases,

Movement Phenomenon in Language, Handling questions in Context-Free
Grammars. Human preferences in Parsing, Encoding uncertainty,
Deterministic Parser.
II 20
Ambiguity Resolution: Statistical Methods, Probabilistic Language Processing,
Estimating Probabilities, Part of speech Tagging - Rule-Based Part of Speech
Tagging - Markov Models - Hidden Markov Models, Obtaining Lexical
Probabilities, Probabilistic Context-Free Grammars, Best First Parsing.
Semantics and Logical Form, Word senses and Ambiguity, Encoding Ambiguity
in Logical Form.
Text Book:
1. James Allen, Natural Language Understanding, 2/e, Pearson Education, 2003

Reference Books:
1. Akshar Bharti, Vineet Chaitanya and Rajeev Sangal, NLP: A Paninian Perspective, Prentice Hall,
New Delhi
2. D. Jurafsky, J. H. Martin, Speech and Language Processing, Pearson Education, 2002
3. L.M. Ivansca, S. C. Shapiro, Natural Language Processing and Language Representation
4. T. Winograd, Language as a Cognitive Process, Addison-Wesley

Outcomes: After the completion of the course, the student will be able to:
 CO1: Understand the core tasks in NLP and its applications in real problems.
 CO2: Understand the human languages, be familiar with the most mainstream descriptive and
theoretical frameworks for handling their properties.
 CO3: Understand the basics of knowledge representation, inference, and relations to the artificial
intelligence.
 CO4: Understand the algorithmic description of the main language levels: morphology, syntax,
semantics, and pragmatics.
 CO5: Understand the various translation strategies and techniques of maintaining balance among
the three basic criteria of translation: accuracy, clarity and naturalness.
 CO6: Apply the Markov Models and it’s variants to do the Part of Speech Tagging.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO2/PSO1
CO3 PO2,PO5/PSO5
CO4 PO3/PSO3
CO5 PO1/PSO1
CO6 PO5/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0157: INTRODUCTION TO BIG DATA ANALYTICS

Objective: The objective of this course is to introduce the Big Data Platform and to understand an overview
of Hadoop and apply analytics on structured, unstructured data.

Credits: 03 L-T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Big Data Technology Landscape: Types of Digital Data (Structured, Semi-
Structured, Unstructured), Concept, importance and characteristics of data,
Challenges with big data, Big data stack, Big Data 1.0, 2.0 and 3.0, Traditional BI vs.
Big Data Environment, NoSQL Databases, NoSQL Vs. RDBMS, New SQL,
Introduction to Data Science/Scientist
HADOOP 1.0: Introducing Hadoop 1.0, Limitations of RDBMS, Hadoop
Components, High Level Architecture of Hadoop, History of Hadoop, Special
Features of Hadoop, Introduction to HDFS 1.0, Architecture, Daemons, working
with HDFS Command, Introduction to Map-Reduce
I 20
1.0, Architecture, Daemons
HADOOP 2.0: Introducing Hadoop 2.0, Limitations of 1.0, Introduction to HDFS
2.0, Architecture, Daemons, Introduction to Map-Reduce 2.0, YARN, Architecture,
Daemons, Word Count Example using Java, Introduction to Hadoop 3.0, Difference
among Hadoop1.0, Hadoop2.0, Hadoop3.0
Introduction to Mongo DB: RDBMS vs. MongoDB, JSON, Unique Key, Dynamic
Queries, Sharding, Replication, MongoDB QL: Create, Drop Database and
Collections, CRUD: Create, Insert, Find, Update, Delete, Map Reduce Programming,
Aggregations
Introduction to Cassandra DB: Features of Cassandra, CQL Data Types, CQLSH:
CRUD, Counter, TTL, List, Set, Map, Tracing, Import Export csv files
HADOOP Ecosystem and Flume: Introduction to Hadoop Ecosystem, Sqoop,
Zookeeper, Plug-in Components: Impala, Hue, Flume: Introduction, Application,
Advantage, Features.
Introduction to HIVE: Hive Architecture, Hive Data types, Hive Collection Types,
II Hive File Formats, Hive Query Language, Hive Partitions, Bucketing, Views, RCFile
20
Implementation, Hive User Defined Function, SerDe, UDF
Introduction to Pig: History and Anatomy of Pig, Pig on Hadoop, Use Case for Pig,
Pig Primitive Data Types, Pig Latin Overview, Execution Modes of Pig, Field, Tuple,
Bag, User Defined Function, Parameters in Pig, Piggy Bank, Word count example
using Pig, Pig vs Hive, When to use Pig.
Text Book:
 Seema Acharya and SubhashiniChellappan, “Big Data and Analytics”, 1st Edition, 2015, Wiley,
India.
 Jure Leskovec, AnandRajaraman, Jeff Ullman, “Mining of Massive Datasets”, 2nd Edition, 2014,
Cambridge University Press.
Reference Books:
 Chuck Lam, “Hadoop in Action”, 2nd Edition, 2014, Manning Publications.
Outcome: At the end of the course, student will be able to
 CO 1: Understand the concepts and challenges of big data.
 CO 2: Apply existing technology to collect, manage, store, query, and analyze the big data.
 CO 3: Apply job scheduling of various applications and resource management using Hadoop and
Yarn.
 CO 4: Apply the data summarization, query, and analysis of big data using pig and hive.
 CO 5: Design the regression model, cluster and decision tree of big data.
 CO 6: Experiment with hands-on experience in large-scale analytics tools to solve big data
problems.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO5/PSO5
CO2 PO3/PSO4
CO3 PO3,PO5/PSO4
CO4 PO3,PO5/PSO4
CO5 PO3/PSO2
CO6 PO2/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0158: BIG DATA AND ANALYTICS

Objective: Exposure to any object oriented programming language (such as Java) and basic operational
knowledge of any RDBMS (such as MySQL)

Credits: 03 L-T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Big Data technology Landscape: Types of Digital Data (Structured,
Semi-Structured, Unstructured),Concept, importance and
characteristics of data, Challenges with big data, Big data stack, Big
Data 1.0, 2.0 and 3.0, Traditional BI vs. Big Data Environment, NoSQL
Databases, NoSQL Vs. RDBMS, New SQL, Introduction to Data
Science/Scientist.
HADOOP 1.0: Introducing Hadoop 1.0, Limitations of RDBMS, Hadoop
Components, High Level Architecture of Hadoop, History of Hadoop,
Special Features of Hadoop, Introduction to HDFS 1.0, Architecture,
Daemons, Working with HDFS Command, Introduction to Map-Reduce
1.0, Architecture, Daemons
I HADOOP 2.0: Introducing Hadoop 2.0, Limitations of 1.0, Introduction 19
to HDFS 2.0, Architecture, Daemons, Introduction to Map-Reduce 2.0,
YARN, Architecture, Daemons, Word Count Example using Java,
Introduction to Hadoop 3.0, Difference among Hadoop1.0, Hadoop2.0,
Hadoop3.0
Apache Spark: Introduction, Introduction to Spark & functional
programming, Spark Concepts, RDD Fault Tolerance
Introduction to HBase: What is HBase? HBase Architecture, HBase
Components, Data model, HBase Storage Hierarchy, Cross-Datacenter
Replication, Auto Sharding
Introduction to Cassandra DB: Features of Cassandra, CQL Data
Types, CQLSH: CRUD, Counter, TTL, List, Set, Map, Tracing, Import
Export csv files
HADOOP Ecosystem and Flume: Introduction to Hadoop Ecosystem,
Sqoop, Zookeeper, Plug-in Components: Impala, Hue, Flume:
Introduction, Application, Advantage, Features.
Introduction to Mongo DB: RDBMS vs. MongoDB, JSON, Unique Key,
Dynamic Queries, Sharding, Replication, MongoDB QL: Create, Drop
Database and Collections, CRUD: Create, Insert, Find, Update, Delete,
Map Reduce Programming, Aggregations
Introduction to HIVE: Hive Architecture, Hive Data types, Hive
Collection Types, Hive File Formats, Hive Query Language, Hive
II Partitions, Bucketing, Views, RCFile Implementation, Hive User Defined 19
Function, SerDe, UDF
Introduction to Pig: History and Anatomy of Pig, Pig on Hadoop, Use
Case for Pig, Pig Primitive Data Types, Pig Latin Overview, Execution
Modes of Pig, Field, Tuple, Bag, User Defined Function, Parameters in
Pig, Piggy Bank, Word count example using Pig, Pig vs Hive, when to
use Pig.
Machine Learning: Linear Regression, Logistic Regression,
Association Rule

Text Book:
 Seema Acharya and Subhashini Chellappan, “Big Data and Analytics”, 1st Edition, 2015,
Wiley, India.
 Jure Leskovec, Anand Rajaraman, Jeff Ullman, “Mining of Massive Datasets”, 2nd Edition,
2014, Cambridge University Press.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Reference Books:
 Chuck Lam, “Hadoop in Action”, 2nd Edition, 2014, Manning Publications.

Outcome: At the end of the course, student will be able to

 CO 1: Understand the concepts and challenges of big data.
 CO 2: Apply existing technology to collect, manage, store, query, and analyze the big data.
 CO 3: Apply job scheduling of various applications and resource management using Hadoop and
Yarn.
 CO 4: Apply the data summarization, query, and analysis of big data using pig and hive.
 CO 5: Design the regression model, cluster and decision tree of big data.
 CO 6: Experiment with hands-on experience in large-scale analytics tools to solve big data
problems.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO3/PSO4
CO3 PO3,PO5/PSO4
CO4 PO3,PO5/PSO4
CO5 PO3/PSO2
CO6 PO2/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0183: BIG DATA AND ANALYTICS LAB

Objective: This course introduces students to R, a widely used statistical programming language.
Students will learn to manipulate data objects, produce graphics, analyse data using common statistical
methods, and generate reproducible statistical reports. Student will also learn data mangling.

Credits: 01 L-T–P-J: 0–0–2-0

Module
Content Lab Hours
No.
Module 1: Introduction to R

 Introduction and installation of R and RStudio

I  Data types, vectors, multidimensional array.
 Functions and their use
 Visualization using ggplot2.
 Word-Count program using Java
 Installation of VM-Ware and Cloudera

Module 2: Hands-On MongoDB, Cassandra

 Hands-On Mongo DB: CRUD, Where, Aggregation

II  Hands-On Mongo DB: Projection, Aggregation
24
 Hands-On Cassandra DB: CRUD, Projection

Hands-On PIG & HIVE

 Hands-On PIG
 Hands-On HIVE
 Twitter Data Fetching using Flume

Reference Books:

 Paul Teetor. R Cookbook: Proven recipes for data analysis, statistics, and
graphics. O'Reilly Media, Inc.,2011.
 Norman Matloff. Theart of R programming: A tour of statistical software design.
No Starch Press, 2011.
 Winston Chang. R graphics cookbook. O'Reilly Media, Inc., 2012.
 Hadley Wickham and Garrett Grolemund. R for data science. 2016.
 Phil Spector. Data manipulation with R. Springer Science& Business Media, 2008.
Outcome: At the end of the course, student is able to:
 CO1: Apply R-Studio, read R documentation, and write R scripts.
 CO2: Analyse the data using data analytics latest tools based on HDFS like Pig, Hive.
 CO3: Implement the aggregation projection on data set using Cassandra, MongoDB.
 CO4: Implement the concept of PIG & HIVE Using QVERIESON real world data

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO2,PO5/PSO4
CO2 PO1,PO5/PSO3
CO3 PO2,PO5/PSO3
CO4 PO5/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0191: BUSINESS INTELLIGENCE PROJECT

Credits: 02 L–T–P: 0–0–0

Project No.11. Air-Traffic arrival as well as departure Visualization Project in Business

Intelligence
Objective: Create a visual panel (report) with multiple prompts and filters to show
multiple stages of Aeroplane Movement

Project No.12. University Placement Activity Visualization Project

Objective: Create multiple reports to visualize all kinds of placement activity such as
placed students with unplaced students, company wise placed students, visited
companies, upcoming companies etc. with filters and prompts

Project No.13. Presentation of Wal-Mart sales (region and product wise)

Objective: Create Dashboard for displaying multiple products and their sales analysis
using multiple report types such as gauge chart, crosstab, pie chart etc and also
represent it by colours such as high selling product in green, low selling product in red
in same way for different region as well.

Project No. 14. Country Crime Statistics Reporting Project in Business Intelligence

Objective: Display multiple crime reports with drill down feature like from country to
state and state to district and district to city...with filtering capability for various reasons
such as display of city or state which had highest number of crimes.

Project No.15. Stock Market Statistics reporting Project in Business Intelligence

Objective: Display trends of various companies’ shares with drill down as well as drill
up feature on date basis

Project No.16. Company’s Revenue Report Project in Business Intelligence

Objective: compares how different order methods are performing for each product line.
This report should display the revenue that individual order methods generate for each
product line and the average revenue all order methods generate for each product line.

Project No. Sales Performance Reporting Project

Objective: The Vice President of Sales has requested a report that shows sales
performance in each country for 2012. He wants to see the performance for
representatives in Southern Europe so he can present an award to the top seller when
he visits next month

Project No.18.Create a Report Focused on Top Performing Product Types and Product Lines

Objective: create a report that displays revenue by product line and product type. The
report must show the product types that generated revenue greater than $100 million
and product lines that generated revenue greater than $400 million with various charts
and colouring scheme

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Project No.19. Designing of Dashboard for various aspects

Objective: create a dashboard report that contains a gauge chart that compares the
gross profit of each product line by region, a combination chart that shows revenue
earned by each product line by retailer type and region on separate axis, and finally a
crosstab report that shows the gross margin of each product line by year and region.

Project No.20. Sales Titled reporting (with multiple perspectives) Project

Objective: You have been asked for a report that displays the quantity of products sold
for each order year. You also need to display all product lines in uppercase. The
report should contain an optional prompt that lets users view data by sales region. Add a
report title that indicates which sales region users select in the prompt. It should also
indicate if they do not select a region as well. You will use a layout calculation to display
the report title

Project No. 21. Employee Development Program Reporting Project

Objective: HR would like a report that outlines the courses each employee has
completed. They want to see the number of course days that each employee has
accumulated to date and the cost of those courses. They would also like to be able to
drill-through to specific information on each employee for each year.

Project No.22.Production analysis and it Planning Reporting Project

Objective: prepare a report that shows the quantity of products sold in each month of
2012 for all product lines, to help estimate production requirements for next year.
The report must be broken into separate sections for each product line so that products
from each line can be analyzed separately. The report name and logo must appear at the
top and bottom of each page of the report.

Project No.23. Bollywood Movies trends reporting Project

Objective: This is to create Bollywood Movies reports with filter and prompts to let
user to find out list of movies based on different users’ taste (e.g. emotional, scary ..Etc)
and also show other report to show most/least user rated movie

Project No.24. Analysis of Profit reporting Project in Business Intelligence

Objective: create a list report where users can review the gross profit generated by
retailer types for each region gained by XYZ (product wise) providing multiple filter and
prompts and also name the report

Project No.25. Analysis on various income class of any country population

Objective: Create a dashboard where a manager can visualize various Income class of
people based on region (country, state, district and so on...) providing multiple prompts
and filter to drill down in reporting levels

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0192: BIG DATA ANALYTICS PROJECTS

Credits: 2 L–T–P-J: 0–0–0-0

Project No. 1.House Price Prediction

Objective: Floor area, River view many factor affect the house price. Predict price of
houses.

Project No. 2.Predict Customer Churn

Objective: Companies invest significantly to acquire new customers. So, after
acquisition, companies would like these customers to stay long and be loyal.
Companies also make investments to keep engaging with these customers
continuously and ensure they are happy and satisfied with their offerings. Losing
customers mean loss of investment and loss of possible future revenue. So, it is
important for companies to infer early signs of a customer about to churn and engage
or offer incentives to retain them. But as targeting each customer is not possible,
companies can take advantage of analytics to predict if a customer high probability of
churning. A possible intervention can be made to retain the customer.

Project No. 3.Predict Coronary Heart Disease

Objective: There are many factors which affect heart so take most prominent of
them and predict whether the patient may have risk of heart disease

Project No. 4.Twitter Trends Analysis

Objective: The community of users participating in social media tends to share
about common interests at the same time, giving rise to what are known as social
trends. A social trend reflects the voice of a large number of users which, for some
reason, becomes popular in a specific moment. Through social trends, users therefore
suggest that some occurrence of wide interest is taking place and subsequently
triggering the trend. In this work, we explore the types of triggers that spark trends
on the micro blogging site Twitter, and introduce a typology that includes the
following four types: news, ongoing events, memes, and commemoratives. The user
will be allowed to search for the latest trends by inputting a keyword into search
field. Based on user provided keyword, the system will search for similar keywords
in database and summarize the total count to provide the trending tweets on twitter.
The trending tweets with hashtag (#) will be displayed first and then the rest words
will be displayed. By clicking on every trending tweet, the user commented tweets
will be displayed. User can view all the tweets from the searched keyword.

Project No. 5.Stock Price Prediction

Objective: Predict the price stocks based on current trending factors.

Project No. 6.Movielens: Top 20 best rated movies

Objective: Find out 20 worst rated movies. But only consider those movies which
are rated by at least 100 users. Find out best 10 and worst 10 movies in each
category - Categories are tags given in the movies.

Project No. 7.Sales Performance Prediction

Objective: predict sales performance based on factors such as marketing
expenditure, advertisement and others

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Project No. 8.Recommending movies to users using Collaborative Filtering

Objective: Knowing "What customers are most likely to buy in future" is key to
personalized marketing for most of the businesses. Understanding customers past
purchase behavior or customer demographics could be key to make future buy
predictions. But how to use the customer behavior data, depends on many different
algorithms or techniques. Some algorithms may use demographic information to
make these predictions. But most of the times, the organizations may not have these
kind of information about customers at all. All that organization will have been what
customers bought in past or if the liked it or not. Recommendation systems use
techniques to leverage this information and make recommendation, which has been
proved to be very successful. For examples, Amazon.com's most popular feature of
"Customers who bought this also buys this?"

Project No. 9.Detect Emotion in Text

Objective: When you read, "Why don't you ever text me", does it conveys an angry
emotion or sad emotion?
Understanding Emotions in Textual Conversations is a hard problem in absence of
voice modulations and facial expressions.

Project No. 10.Identify your Digits

Objective: Study, analyze and recognize elements in the images. That’s exactly how
your camera detects your face, using image recognition! It’s your turn to build and
test that technique. It’s a digit recognition problem.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

SYLLABUS
OF
PROGRAM ELECTIVE
BOUQUET: HIGH PERFORMANCE
COMPUTING
DEPARTMENT OF COMPUTER ENGINEERING &
APPLICATIONS

Under
Choice Based Credit System (CBCS)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
NO.
CODE SUBJECT PRE- REQUISITES
L T P J

Bouquet: High Performance Computing

THEORY

1. BCSE0201 Advanced Computer Architecture 3 0 0 0 3 3 Computer Organization

2. BCSE0202 Embedded System 3 0 0 0 3 3 Microprocessors

3. BCSE0203 Internet of Things 3 0 0 0 3 3 Microprocessors

Internet of Things and Its
4. BCSE0204 3 0 0 0 3 3
Applications
5. BCSE0205 Distributed System 3 0 0 0 3 3 CN /OS

6. BCSE0206 Parallel Algorithms 3 0 0 0 3 3 CO& Algorithms

7. BCSE0207 Cloud Computing 3 0 0 0 3 3

Cloud Computing and
8. BCSE0208 3 0 0 0 3 3
Virtualization
PRACTICALS

1. BCSE0231 Embedded System Lab 0 0 2 0 1 2

2. BCSE0232 Internet of Things Lab 0 0 2 0 1 2

3. BCSE0233 Parallel Algorithms Lab 0 0 2 0 1 2

4. BCSE0234 Cloud Computing lab 0 0 2 0 1 2

PROJECTS

1. BCSE0241 Internet of Things Project 0 0 0 - 2 -

Cloud Computing and
2. BCSE0242 0 0 0 - 2 -
Virtualization Project

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0201: ADVANCE COMPUTER ARCHITECTURE

Objective: The objective is to describe the operation of modern and high performance computers and
ability to undertake performance comparisons of modern and high performance computers.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Review of Traditional Architectures: Evolution of Computer Architecture,
Review of Fundamentals of CPU, Memory & IO, Classes Of Computers & Trends
In Architecture & Technology.
Introduction to High Performance Computing: Need for Parallel Computing,
Introduction to Parallel Computer Models, Parallel Architectural Classification
Schemes, Speedup Performance Laws.
Program and Network Properties: Condition of Parallelism, data and
I 21
resource dependence, Grain Size and Latency, System interconnect
architecture- Mesh, cube, butterfly, hypercube, PM2I, Bus system.
Pipelining Techniques: Introduction to Pipelining, Instruction Pipeline,
Arithmetic Pipeline, Hazards, Hazards Detections and Resolution, Instruction
Prefetching, Branch Handling Techniques. Scheduling of Static & Dynamic
Pipelines.

Memory: Memory Hierarchy Technology, Cache Memory Organization,

Memory Replacement Policies, Cache Coherence, Inclusion and Locality.
Shared Memory Organization: Memory Interleaving, Bandwidth and Fault
Tolerance, Memory Allocation Schemes.
II Parallel and Scalable Architectures: Multiprocessor and Multicomputer, 19
System Interconnects, Cache Coherence and Synchronization, Message Passing
Mechanism.
Different Architectures: Superscalar and Vector Processor, VLIW
Architecture, Data flow Computer, Multicore Architecture
Text Books:
 Kai Hwang, Naresh Jotwani, “Advanced Computer Architecture”, 2ndEdition, Tata McGraw-
Hill,2011.
Reference Books:
 John L. Hennessy , “Computer architecture: A Quantitative Approach”, 5th Edition, Elsevier,2011.
 AnanthGrama, George Karypis, Vipin Kumar, Anshul Gupta , “Introduction to Parallel
Computing”, 2ndEdition, Addison Wesley,2003.
 Bhujade, “Parallel Computing”, 2ndEdition, New Age International,2011.

Outcome: After completion of course, student will be able to:

 CO1: understand the fundamental knowledge in architecture design.
 CO2: Understand the concept of parallelism and pipelined processor design.
 different processor architectures and system-level design processes.
 CO3: Classify different Hazards Detections and their Resolution.
 CO4: Understand the components and operation of a memory hierarchy and the range of
performance issues influencing its design.
 CO5: Understand the organization and operation of current generation parallel computer
systems, including multiprocessor and Multicore systems.
 CO6: Understand the principles Superscalar and Vector Processor.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO2,PO3/PSO2
CO2 PO1,PO5/PSO1
CO3 PO3,PO4/PSO3
CO4 PO5,PO7/PSO1
CO5 PO4 /PSO2
CO6 PO2,PO3/PSO1,PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0202: EMBEDDED SYSTEM

Objective: To acquaint students with methods of executive device control and to give them opportunity to
apply and test those methods in practice.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction: Introduction to Embedded Systems, Hardware Needs Challenges
and Design Process of Embedded System, Processor Architectures, Memory
Organization, Embedded Devices and Its Network.
I. Architecture of Embedded System: CPUs, Bus Based Computer Systems,
20
Programming Design and Analysis, Model of Program, Basic Compilation
Techniques, Program Optimization and Performance.
OS for Embedded Systems: Real Time Operating System, ISR in RTOS, Basic
Design Using an RTOS, RTOS Task Scheduling Models, RTOS Programming.
Software Architectures: Processes and Operating Systems, Multiple Task and
Multiple Processes, Preemptive RTOS, Priority Based Scheduling, Inter-process
Communication Mechanism, Multiprocessors.
Program Modeling Concepts: Program Model, DFG Models, Modeling of
II.
Multiprocessor Systems, UML Modeling, Embedded Software Development 20
Process and Tools.
Networks &System Design Techniques: Networks for Embedded and its
Design, Internet Enabled System, Introduction to Sensor Network, Design
Methodologies, Requirement Analysis, System Analysis and Quality Assurance.

Text Books:

 Wolf, Wayne , “Computers as Components - Principles of Embedded Computing System

Design”, Elsevier,2008.

Reference Books:

 Raj Kamal , “Embedded Systems–Architecture, Programming & Design”, Tata McGraw Hill,2011.
 David A. Simon , “An Embedded Software Primer”, Pearson Education,1999.
 DanielW.Lewis, “Fundamentals of Embedded Software Where C and Assembly Meet”, 2nd Edition,
Pearson College Division,2012.
 James K. Peckol, “Embedded Systems: A Contemporary Design Tool”, Wiley India,2012.

Outcome: After completion of course, student will be able to:

 CO1: understand the Process of Embedded System.
 CO2: Understand different Model of Program.
 CO3: Understand the concept behind the RTOS and its scheduling.
 CO4: Classify the software architecture into Multiple Task and Multiple Processes.
 CO5: Understand different Program Modeling Concepts.
 CO6: Apply knowledge of embedded systems along with some specialization in any area of
computer engineering.

Mapping of Course Outcomes (COs) withProgram Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO4,PO5/PSO2
CO2 PO3 /PSO1
CO3 PO5/PSO2
CO4 PO4,PO5/PSO1
CO5 PO2,PO3/PSO2
CO6 PO3,PO10/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0231: EMBEDDED SYSTEM LAB

Objective: To enable the students to program, simulate and test the 8085, 8051, PIC 18 and ARM processor
based circuits and their interfaces.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours

 ASCII to fixed-point output to LCD

 Debugging, oscilloscope fundamentals, logic analyzer, dump profile

 Alarm clock, LCD, edge-triggered input interrupts, and SysTick periodic

interrupts

 IEE802.11Wi-Fi communication, TCP, client-server, IoT

 12-bit DAC, SPI, Music player, audio amp

 Introduction to PCB Layout, PCB Artist (paper design only)

I/II 12*2=24
 Design and Layout of an Embedded System

 Software Drivers for an Embedded System

 Temperature measurement, ADC, LCD

 DC motor control, timer interrupts, PWM output, input capture, integral

control

 Final Design and Evaluation of Embedded System

Text Books:

 Raj Kamal , “Embedded Systems–Architecture, Programming & Design”, Tata McGraw Hill.2011.

Outcome: After completion of Lab, student will be able to:

 CO1: Visualize and analyze the design and behavior of the hardware components.
 CO2: Apply knowledge of embedded systems along with some specialization in any area of
computer engineering.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO5,PO7/PSO3
CO2 PO2,PO3/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0203: INTERNET OF THINGS

Objective: To Implement Data and Knowledge Management and use of Devices in IoT Technology.

Credits: 03 L–T–P-J: 3–0–0-0

Module Content Teaching
No. Hours
Introduction to IoT and Sensor:
Introduction to IoT- Sensing, Actuation, Logical design of IoT, Functional
blocks/pillars/components of IoT, Communication models, IoT& M2M:
Machine to Machine, Difference between IoT and M2M,
Introduction to Sensors:
About sensor, Properties of Sensors Basic physical principles of sensing,
I Categorization of Sensor, PIR Sensor, Temperature Sensor, Ultrasonic Sensor, 20
IR Sensor, MQ2/MQ3
Implementing IoT:
Introduction to Arduino Programming. Integration of Sensors and Actuators
with Arduino.
Implementation of IoT with Arduino, Node MCU.
Mini project Statement using Node MCU.
IoT Over Network:
IOT Networking Protocols: TCP/IP, 6LowPan, Routing Protocols, Thread.
Communication Protocol: CoAP, SMCP, SMTP, HTTP, HTTPS, MQTT, MQTT-S
II SDN for IoT, Data Handling and Analytics. Cloud Computing, Fog Computing,
20
Introduction to different IoT Tools.
Implementation of IoT with Raspberry Pi.

Books for reference:

1. "The Internet of Things: Enabling Technologies, Platforms, and Use Cases", by Pethuru Raj and
Anupama C. Raman (CRC Press)
2. "Internet of Things: A Hands-on Approach", by ArshdeepBahga and Vijay Madisetti (Universities
Press)

Outcome:
 CO1: Understand the concepts of Internet of Things.
 CO2: Understand difference between Sensors and Actuators and their working principles.
 CO3: Design IoT applications using different sensors and actuators.
 CO4: Understand different protocols used in IoT over network.
 CO5: Understand different communication protocols.
 CO6: Explain the concept of cloud computing and fog computing.
 CO7: Implement IoT application using Raspberry Pi.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3/PSO1
CO2 PO2 /PSO4
CO3 PO5/PSO2
CO4 PO11/PSO2
CO5 PO1,PO3/PSO4
CO6 PO2/PSO1
CO7 PO5/PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0204: INTERNET OF THINGS AND ITS APPLICATIONS

Objective: This course introduces the various types of advance technology related to IoT, and their
applications, also introduces the methods of interfacing sensors to electronic systems.

Credits: 03 Semester II L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Developing IoTs
Introduction to Python, Introduction to different IoT tools, developing
applications through IoT tools, developing sensor based application through
embedded system platform, Implementing IoT concepts with python
Challenges in IoT
Design challenges, Development challenges, Security challenges, Other
I 20
challenges.

Advance Technology in IoT and its application

IoT with Big data and advanced Analytics-Big Data Metadata Management in
Smart Grids: semantic inconsistencies role of metadata, Sensor deployment &
Node discovery, Data aggregation & dissemination

Cloud Computing: AWS Cloud, Sensor-Cloud, Connected Vehicles.

Introduction & Application to Industrial IoT.
How to handle IoT devices using voice interface like Alexa/Goggle Home
Fog Computing: A Platform for Internet of Things and Analytics,
Definition-Characteristics-Application Scenarios -Issues -Fog Computing and
II
Internet of Things-Pros and Cons-Myths of Fog Computing -Need and 20
Reasons for Fog Computing Fog Computing and Edge Computing-IoT, FOG,
Cloud-Benefits
Case study: Agriculture, Healthcare, Activity Monitoring, Wearable Sensing,
Smart Cities and Smart Homes.
Security Of IoT devices

Text Books:

 Perry Lea , "Internet of Things for Architects: Architecting IoT solutions by implementing
sensors, communication infrastructure, edge computing, analytics, and security", Packt
Publishing,2018

Outcome: After completion of Lab, student will be able to:

 CO1: Understand the concepts of Internet of Things.

 CO2: Understand difference between Sensors and Actuators and their working principles.
 CO3: Design IoT applications using different sensors and actuators.
 CO4: Understand the concept of cloud computing.
 CO5: Understand the concept of Fog computing.
 CO6: Understand the concept of Edge computing.
 CO7: Implement IoT application using Raspberry Pi.
 CO8: Understand the concept of security in IoT.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3/PSO1
CO2 PO2/PSO4
CO3 PO5/PSO2
CO4 PO10/PSO1
CO5 PO10/PSO4
CO6 PO10/PSO1
CO7 PO2,PO3/PSO2
CO8 PO5/PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0232: INTERNET OF THINGS LAB

Objective: Coordinate and help to increase and optimize the utilization of results and value creation in the
area of IoT.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours
 WAP to interface and blink the LED using Arduino UNO.
 WAP to interface for different sensors (Like DHT11, temperature, IR,
Ultrasonic etc) to Arduino UNO.
 WAP to interface temperature sensor to ESP8266. Turn on the LED if
temperature value met threshold value.
 WAP to interface in between Bluetooth module and Arduino UNO.
I/II/III  Write a python program for Gateway to store sensor data on local 12*2=24
MySQL database.
 WAP to transmit the data wirelessly for longer distance using multi-hop
technique.
 Configure the gateway as local MQTT broker (Mosquito), configure one
ESP8266 as sender (Publisher), and receive the data on the Smartphone
(MQTT Dashboard).

Text Books:

 Upskill Learning , “ESP8266: Programming NodeMCU Using Arduino IDE - Get Started With
ESP8266 (Internet Of Things, IOT, Projects In Internet Of Things, Internet Of Things for
Beginners, NodeMCU Programming, ESP8266”,2018.

Outcome: After completion of course, student will be able to:

 CO1: Design IoT applications using different sensors and actuators.

 CO2: Design IoT applications in different domain and be able to analyze their performance.
 CO3: Implement basic IoT applications on embedded platform.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO3,PO5/PSO1
CO2 PO4/PSO1
CO3 PO1/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0241: IOT BASED PROJECT

Objective: Identify research opportunities in IoT technology, applications and services, focusing on the
context.

Credits: 02 L–T–P-J: 0–0–0-0

1. IoT Weather reporting system using Raspberry pi:
Objective: This project helps you in weather reporting. We used many sensors that can help in sensing
all-weather monitoring parameters and RaspberryPi gathers all the information from them and uploads
it to the Things peak cloud, which is a wonderful application platform for IoT, where you can see the
report that sensors send you.

2. IoT Connected Healthcare Applications:

Objective: The aim of developing this project is to monitor the health condition of a person anywhere
and send the information to a specialized doctor to check up. Using this frequency of visiting doctor
decreases. We developed a project using Wearable sensors with solar harvesting and Bluetooth low
energy transmission that creates a wireless body area network (WBAN). Using this project, you can
detect the heartbeat, Blood pressure, hemoglobin content etc., All these reports can be used for analyzing
a person’s health.

3. IoT Based Intelligent Traffic Management System:

Objective: As the population increases, the effort on Traffic is also increasing. In many metropolitan
cities, it is being difficult for traffic Management team to control it. So, IoT can help the traffic system to
be automated and monitor the traffic status using the internet.

4. IoT Based Smart Parking System Using RFID:

Objective: With the increase in usage of vehicles, Parking space is very difficult to find. We need to use
the human effort to check where to park our vehicle. To overcome this problem, we developed Smart
Parking system that shows you space to park your vehicle.

5. Smart Irrigation System Using IoT:

Objective: We have developed a Smart Irrigation system using the concept of IoT. As we know, farming
has different stages, to help these farmers in understanding the climatic conditions, moisture content in
the soil and to make their decisions easy we have developed Smart Irrigation System using IoT.

6. IoT Based Baby Monitoring System Using Raspberry Pi:

Objective: This project is to develop a smart umbrella system using IOT, which can measure rainfall and
it can predict the weather condition with the notion in your smart phone. It is about the real-time
weather condition and it can be design using Raspberry Pi.

7. IoT Based Fire Detection System Using FPGA:

Objective: Building a cloud based Fire monitoring system is very important to reduce the cost of
maintaining servers, to avoid data losses and to make the access easy with multiple internet connected
devices (computer, tablet, mobile phone) at the same time anywhere in the world. Using IOT. Here, we
are going to design a fire detection system and data to be upload it to a Thing Speak cloud using FPGA

8. Cloud based Smart Energy meter using FPGA:

Objective: Efficient use of energy becomes more crucial when increase in the cost of energy is observed.
Since energy management is required to define the amount of consumed energy in a specific period,
utilization of Energy Meters is essential. It is possible to measure the consumed energy by using a simple
energy meter. But sometimes the limited functionality of these meters restricts their area of application;
especially in inaccessible positions or in the situations where visibility of the meter is poor, it is not
possible to use such an appliance.
9. Data logger of Brain parameters in Google sheets using Mind wave mobile with Raspberry Pi:

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Objective: Brain-Computer Interface technology is innovated to the analysis of the brain to predict the
human thoughts or to control applications using the brain. As the next stage of analysis based on Machine
Learning to our Brain, we need data logs of our Brain parameters, so we need the logs of data, which
should contain Brain values. This can be done by using Raspberry Pi to take values from the Brain and to
uploading the Brain values in Raspberry Pi.

10. MQTT based Monitoring System for Coal Mine using Raspberry Pi:
Objective: Due to global warming and climate, changes there are challenging situations in coalmine. To
reduce the cost as well as to improve the productivity along with product quality the automation in the
field of coalmine is necessary, which will also reduce the mine worker’s efforts. This project proposes a
design of a IOT system with MQTT protocol, by the help of Raspberry pi controller which is able to
monitor the temperature, humidity, gas and status of smoke in an underground mine.

11. Industry Monitoring with data logger in Google sheet using Raspberry Pi:
Objective: This Raspberry Pi industry monitoring system which having some sensors, taking sensor
values and converting using Analog to Digital, then for data logging which will be helpful to review the
industry parameter, instead of data log manually, every data values will be uploaded to Google sheets
which already get authenticated and by generating JSON file for every individual.

12. IoT Based Transmission Line Monitoring System Using Raspberry Pi:
Objective: The aim of this project is to decrease power consumption for delay sensitive and delay
insensitive traffic. A fuzzy rule table is constructed with prediction of average inter arrival time of frame
based on outcome sleep time and power is evaluated. Proposed method offer effective power efficiency
than previous inter arrival time method using Raspberry Pi.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0205: DISTRIBUTED SYSTEMS

Objective: The objective is to study the fundamental principles of distributed system and protocols. This
course addresses communication, process, naming, synchronization, replication, and fault tolerance in
distributed system.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction: Overview to Distributed Systems, Characteristics, Examples of
Distributed Systems, Issues and Challenges, System Models.
Theoretical Foundation: Limitation of DS, Introduction to Time and Global
States, Clocks, Events and Process States, Synchronizing Physical Clocks, Logical
Time and Logical Clocks, Global States, Introduction to Distributed Operating
System – Layered Architecture.
Distributed Deadlock Detection: Distributed Mutual Exclusion – Introduction,
Classification, Algorithms and their performances, Deadlock Prevention,
I Avoidance, Detection and Resolution, Deadlock Detection (Centralized & 20
Distributed) Algorithms and their performances.
Agreement Protocols: Introduction, Classification, Solution to Byzantine
Agreement Problem and Applications.
Distributed Objects: Introduction to Interprocess Communications, Client
Server Communication, Group Communication, Communication between
Distributed Objects, Remote Procedure Call, Events and Notifications, Case
Studies – Java RMI and CORBA.

Distributed File System: Introduction to DFS, File Service Architecture, Sun

Network File System, Andrew File System, Name Services, DNS, Directory and
Directory Services.
Fault Tolerance: Issues in Fault Tolerance, Commit Protocols, Voting Protocols,
Dynamic Voting Protocols.
Failure Recovery in Distributed Systems: Concepts in Backward and
Forward Recovery, Recovery in Concurrent Systems, Recovery in Distributed
II 20
Database Systems.
Load Balancing: Introduction, Issues, Components and load distributing
algorithms – Sender – Initiated, Receiver – initiated, symmetrically – initiated
and Adaptive algorithm.
Overview of Security Techniques: Introduction to Cryptographic Algorithms,
Digital Signatures, Replication, System Model and Group Communications,
Active and Passive Transactions with Replicated Data.
Text Book:
 MukeshSinghal and Niranjan Shivaratri, “Advanced Concepts in Operating Systems”, McGraw-Hill
Series in Computer Science,2017.

Reference Books:
 A.S. Tanenbaum and M. Van Steen , “Distributed Systems”, Pearson Education,2004.
 George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems Concepts and Design”,
5th Edition, Pearson Education Asia,2011.

Outcome: After completion of Lab, student will be able to:

 CO1: Understand basic elements and concepts related to distributed system technologies; and
core architectural aspects of distributed systems.
 CO2: Identify the advantages and challenges in designing distributed algorithms for different
primitives like mutual exclusion, deadlock detection, and agreement.
 CO3: Understand principle behind IPC and use various interposes communication techniques,
such as remote method invocation, remote events for building distributed systems.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 CO4: Introduce the concepts of distributed file system with its architecture and components
along with case studies.
 CO5: Distinguish the main failure types in a Distributed System and specify algorithms for
achieving fault tolerance and error recovery within such a system.
 CO6: Understand how balancing of resources is done; issues, components and algorithms for
load balancing in distributed environment.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO1,PO2/PSO1
CO3 PO1,PO2,PO3/PSO1,PSO2
CO4 PO1,PO2/PSO1,PSO2
CO5 PO1,PO2/PSO1
CO6 PO1,PO2,PO4/PSO1

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0206: PARALLEL ALGORITHM

Objective: This course aims to introduce the concept of designing algorithms suitable for implementation
on parallel computers. The focus will be on the algorithmic side. In particular, the emphasis will be on
studying different parallel techniques and using them to design scalable parallel algorithms for a variety of
problems and architectures.

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
Introduction: Need for parallel computers, Models of computation, analyzing
parallel algorithms, Expressing parallel algorithms
Algorithm Models:
Sequential model, need of alternative model, parallel computational models
such as PRAM, LMCC, Hypercube, Cube Connected Cycle, Butterfly, Perfect
I Shuffle Computers, Tree model, Pyramid model,Fully Connected model, CRCW- 20
CREW, EREW models
Performance Measures of Parallel Algorithms:
Speed-upandefficiency of PA, Cost- optimality, an example to illustrate Cost-
optimal algorithms- such as summation, Min/Max on various models.

Decomposition& Mapping techniques:

Database query processing, 15-puzzle problem, Parallel discrete event
simulation.
Sorting:
Hyper quick sort, Bitonic merge sort, Enumeration sort (sorting on the CRCW
II model, CREW model and EREWmodel) 20
Searching and selection:
Searching on a sorted sequence (EREW, CREW, CRCW), Sequential selection
algorithm, Parallel selection algorithm (EREW parallel solution)
Graph algorithms:
Graph coloring, Minimal spanning tree, Shortest path algorithm

Text Books:

 M.J. Quinn, “Designing Efficient Algorithms for Parallel Computer”, McGraw-Hill, Inc, ISBN:0-07-
051071-7,1987.

Reference Books:

 S.G. Akl, “Design and Analysis of Parallel Algorithms”. Prentice-Hall, Inc., ISBN:0-13-200056-
3,1989.
 S.G. Akl,” Parallel Sorting Algorithm” by Academic Press,1985.
 AnanthGrama, Anshul Gupta, George Karypis, Vipin Kumar, "Introduction to Parallel Computing",
Second Edition, Addison Wesley, ISBN: 0-201-64865,2003.

Outcome: After completion of course, student will be able to:

 CO1: understand the requirement for parallel computers.

 CO2: understand different Sequential and parallel computational models.
 CO3: Analyze the performance of Parallel Algorithms.
 CO4: Understand the system for parallel Database query processing.
 CO5: Understand the system for parallel searching and sorting algorithms.
 CO6: Understand the system for parallel graph algorithms.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO2,PO10/PSO2
CO2 PO5/PSO1
CO3 PO4/PSO2
CO4 PO1/PSO3
CO5 PO2 /PSO2
CO6 PO1,PO4/PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0233: PARALLEL ALGORITHM LAB

Objective: The goal of the course is to study the mathematical models, methods and technologies of
parallel programming for multiprocessor systems.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours
 Parallel Programming with MPI
 Parallel Programming with OpenMP
 Lab for estimating the parallel method efficiency with the use of the
ParaLab system

I/II/III  Lab for developing the parallel algorithms and programs 12*2=24
 Lab works for parallel solving partial differential equations
 Lab works for studying the parallel method libraries
 Lab works for parallel solving the problem of multidimensional
multiextremal optimization

Text Books:

 M.J. Quinn, “Designing Efficient Algorithms for Parallel Computer”, McGraw-Hill, Inc, ISBN:0-07-
051071-7,1987.

Outcome: After completion of course, student will be able to:

 CO1: Understand the concept of MPI

 CO2: Design parallel software for solving the problems of sufficiently high level of complexity.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO2/PSO3
CO2 PO5/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0207: CLOUD COMPUTING

Objective: This course covers aims to explain various technologies related to Cloud Computing and their
practical implementations, discuss different architectural models of cloud computing, the concepts of
virtualization and cloud orchestration.

Credits: 03 Semester - VI L–T–P-J: 3–0–1-0

Teaching
Module No. Content
Hours
Overview of Cloud Computing - Brief history and Evolution of Cloud
Computing, Traditional vs. Cloud Computing, Importance of Cloud
Computing, Benefits and Challenges of Cloud Computing, Cloud computing
vs. Cluster computing vs. Grid computing, Role of Open Standards Cloud
Computing Architecture: Cloud computing stack Comparison with
traditional computing architecture (client/server), Services provided at
various levels, How Cloud Computing Works, Role of Networks in Cloud
computing, protocols used, Role of Web services Service Models (XaaS)
Infrastructure as a Service(IaaS), Platform as a Service(PaaS), Software as a
Service(SaaS) Deployment Models Public cloud, Private cloud, Hybrid cloud,
I Community cloud. 20
Infrastructure as a Service(IaaS): Introduction to virtualization, Different
approaches to virtualization, Hypervisors, Machine Image, Virtual
Machine(VM) Resource Virtualization Server, Storage, Network Virtual
Machine (resource) provisioning and manageability, storage as a service,
Data storage in cloud computing (storage as a service) Case Study: Amazon
EC2.
Platform as a Service(PaaS): Introduction to PaaS What is PaaS, Service
Oriented Architecture (SOA) Cloud Platform and Management Computation
Storage, Case study: Microsoft Azure as PaaS, Introduction, Service Offered,
Creation of DB instance.
Software as a Service (SaaS): Introduction to SaaS, Web services, Web 2.0,
Web OS, Open SaaS, SaaS with SOA Overview of Multi-Cloud Management
Systems - Explain concept of multicloud management, Challenges in
managing heterogeneous clouds, benefits of multi-cloud management
systems.
Overview of Cloud Security - Security concerns in Traditional IT,
Challenges in Cloud Computing in terms of Application, Server, and Network
Security. Security Concepts in VM, Abuse and Nefarious Use of Cloud
Computing, Insecure Interfaces and APIs (Malicious Insiders, Shared
Technology Issues, Data Loss or Leakage, Account or Service Hijacking,
II Unknown Risk Profile), Attacks in Cloud Computing 20
Cloud Security: Infrastructure Security, Network level security, Host level
security, Application level security Data security and Storage Data privacy
and security Issues, Jurisdictional issues raised by Data Location Identity &
Access Management, Access Control, Trust, Reputation, Risk, Authentication
in cloud computing, IAM User, Groups and their Roles. Service
Management in Cloud Computing: Service Level Agreements(SLAs),
Billing & Accounting, Comparing Scaling Hardware: Traditional vs. Cloud,
Economics of scaling: Benefitting enormously Managing Data Looking at
Data, Scalability & Cloud Services Database & Data Stores in Cloud Large
Scale Data Processing.

TextBooks:

 Raj Kumar Buyya, James Broberg, Andrezei M. Goscinski, “Cloud Computing”: Principles and
paradigms,2011.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Reference Book:

 Anthony T. Velte, Toby J. Velte, and Robert Elsenpeter Cloud Computing: A Practical
Approach,2010.
 McGraw Hill. Rittinghouse, John, W, Cloud computing: Implementation, management and
security.
 Barrie Sosinsky, Cloud Computing Bible, Wiley.2011.
 Rhoton, John, Cloud Computing Architected: Solution Design Handbook.
 Krutz, Ronald L.; Vines, Russell Dean, Cloud Security, A comprehensive Guide to Secure Cloud
Computing.

Outcome: After successful completion of this student will be able to:

 CO1: Describe importance of virtualization along with their technologies like system, network,
and storage virtualizations.
 CO2: Identify the architecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS,
XaaS, Public Cloud, Private Cloud, Hybrid Cloud and the core issues of cloud computing such as
security, privacy, and interoperability.
 CO3: Justify the need of new technology of Virtualization & Cloud Computing and its ecological
impact.
 CO4: Identify the known threats, risks, vulnerabilities and privacy issues associated with Cloud
based IT services
 CO5: Apply fundamental concepts in cloud infrastructures to understand the tradeoffs in power,
efficiency and cost
 CO6: Identify the Challenges in managing heterogeneous clouds.
 CO7: Analyze various cloud programming models and apply them to solve problems on the
cloud.
 CO8: Describe the key components of Amazon web Service

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3,PO5,PO7/PSO2
CO2 PO1,PO3,PO7/PSO1
CO3 PO1,PO7/PSO1
CO4 PO1,PO3,PO5/PSO4
CO5 PO1,PO3,PO5,PO7/PSO4
CO6 PO1,PO3,PO5 /PSO2
CO7 PO1,PO3,PO5/PSO1
CO8 PO1,PO3,PO5,PO7/PSO1,PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0208: CLOUD COMPUTING AND VIRTUALIZATION

Objective: This course covers aims to explain various technologies related to Cloud Computing and their
practical implementations, discuss different architectural models of cloud computing, the concepts of
virtualization and cloud orchestration.

Credits: 03 Semester III L–T–P-J :3–0–0-0

Module Teaching
Content
No. Hours
Overview of Cloud Computing - Brief history and Evolution of Cloud
Computing, Traditional vs. Cloud Computing, Importance of Cloud Computing,
Benefits and Challenges of Cloud Computing, Cloud computing vs. Cluster
computing and Grid computing
Cloud Computing Architecture: Cloud computing stack Comparison with
traditional computing architecture (client/server), Services provided at
various levels, How Cloud Computing Works, Role of Networks in Cloud
computing, Role of Web services, Service Models (XaaS), Infrastructure as a
Service(IaaS) , Platform as a Service(PaaS), Software as a Service(SaaS),
Deployment Models, Public Cloud, Private Cloud, Hybrid Cloud, Community
I Cloud. 19
Infrastructure as a Service (IaaS): Introduction to virtualization, Different
approaches to virtualization, Hypervisors and its types, Virtual Machine(VM),
Resource Virtualization, Server Virtualization, Storage Virtualization, Network
Virtualization, Virtual Machine Resource Provisioning and Manageability, Data
storage in cloud computing (storage as a service), VM migration techniques, -
Case Study: Amazon EC2.
Platform as a Service(PaaS): Introduction to PaaS, Service Oriented
Architecture (SOA), Cloud Platform and Management Computation Storage.
Software as a Service (SaaS:) Introduction to SaaS, Web services, Web 2.0,
Web OS, Open SaaS, SaaS with SOA.
Load balancing: Types of Load Balancing Scenarios in Cloud Computing
Environment, Static, Dynamic and Centralized algorithms, Introduction to
Open Stack, Horizon Web Interface, Using Keystone Identity Service, Swift
Object Storage Service, Glance Image Service, Cinder Block Storage Service,
Neutron Networking Service, and Nova Compute and Controller.
Overview of Cloud Security - Security concerns in Traditional IT, Challenges
in Cloud Computing in terms of Application, Server, and Network Security.
Security Concepts in VM, Abuse and Nefarious Use of Cloud Computing,
Insecure Interfaces and APIs (Malicious Insiders, Shared Technology Issues,
II Data Loss or Leakage, Account or Service Hijacking, Unknown Risk Profile), 20
Attacks in Cloud Computing.
Cloud Security: Infrastructure Security, Network level security, Host level
security, Application level security Data security and Storage Data privacy and
security Issues,
Energy Efficiency in Clouds: Data Center Power Consumption, Green Data
Centers.
Overview of Multi-Cloud Management Systems - Explain concept of multi-
cloud management, Challenges in managing heterogeneous clouds, benefits of
multi-cloud management systems.
Text Book:
 Raj Kumar Buyya, James Broberg, Andrezei M. Goscinski, “Cloud Computing”: Principles and
paradigms,2011.

Reference Books:
 Anthony T. Velte, Toby J. Velte, and Robert Elsenpeter ,” Cloud Computing”: A Practical Approach,
McGraw Hill,2010.
 Rittinghouse, John, W, “Cloud computing” : Implementation, management and security.
 Barrie Sosinsky,” Cloud Computing Bible”, Wiley. 2011
 Rhoton, John, “Cloud Computing Architected”: Solution Design Handbook.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 Krutz, Ronald L.; Vines, Russell Dean, Cloud Security, A comprehensive Guide to Secure Cloud
Computing.

Outcome: After completion of Lab, student will be able to:

 CO1: Identify the architecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS,
XaaS, Public Cloud, Private Cloud, Hybrid Cloud and the core issues of cloud computing such as
security, privacy, and interoperability.
 CO2: Describe importance of virtualization along with their technologies like system, network,
and storage virtualizations.
 CO3: Understand the concept of VM migration.
 Co4: Understand the concept of web services and SOA.
 CO5: Understand the concept of load balancing in cloud environment.
 CO6: Apply fundamental concepts in cloud infrastructures to understand the tradeoffs in power,
efficiency and cost.
 CO7: Understand the concept of multi cloud management.
 CO8: Explain the key components of Amazon web Service and Microsoft Azure.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO3,PO5,PO7/PSO1
CO2 PO1,PO3,PO5,PO7/PSO2
CO3 PO1,PO5/PSO1
CO4 PO1,PO3/PSO1
CO5 PO1,PO3,PO5/PSO1,PSO4
CO6 PO1,PO3,PO5,PO7/PSO4
CO7 PO1,PO3,PO5/PSO2
CO8 PO1,PO3,PO5,PO7/PSO1,PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0234: CLOUD COMPUTING LAB

Objective: This lab aims to understand the concept of cloud and virtualization by the help of VMware.

Credits: 01 L–T–P: 0–0–2

Module Lab
Content
No. Hours
 1. a) Introduction to Packet Tracer.
 b) Network Topologies. (Including explanation of Simple PDU &
Complex PDU.)
 2. Connecting 3 netwoks using routers. Also, configure DHCP and DNS
server.
 3. Configuration of different Application services (SMTP, FTP, HTTP,
TFTP, DHCP & DNS)
 4. Configuration of Vlan and Inter- Vlan Routing.
 5. Configure GRE over IP tunnel (VPN).
 6. Static NAT configuration.
 7. Configure Wireless network.
 8. Configure different IoT devices.
 9. Management of cloud resources using Cloud Analyst.
I/II  10. Simulation of large scale Cloud computing data centers with Cloud 12*2=24
Analyst
 11. Study on VMware
 a. Creating a VM
 b. Networking on VM
 c. Merging and splitting disk on VM
 d. Cloning the guest OS
 e. Deploying VM with template
 f. Creating Snapshots
 g. Managing Users, Groups, Permissions and Roles
 12. Crating a EC2 instance on AWS
 13. Configuration of db in AWS.
 14. Creation of S3 bucket with single IAM user in AWS.
 14. Creating a AWS infrastructure for an organization on cloudcraft

Reference Book:
 Raj Kumar Buyya, James Broberg, Andrezei, M. Goscinski,” Cloud Computing”: Principles and
paradigms,2011.

Outcome: After completion of Lab, student will be able to:

 CO1: Understanding about the virtualization by the help of VMware.
 CO2: Understanding of CISCO packet tracer to build a cloud network infrastructure.
 CO3: Explain the key components of Amazon web Service and Microsoft Azure.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO5/PSO1
CO2 PO1,PO3,PO5/PSO1
CO3 PO1,PO3,PO5,PO7/PSO2

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0242: CLOUD COMPUTING PROJECT

Credits: 02 L–T–P: 0–0–-
1. Developing a warehouse application using force.com cloud platform:
Objective: Force.com platform is a cloud service fits in the Platform as a Service model. Developers can
leverage the runtime time environment and develop scalable web applications using Force.com platform.
Design a warehouse application using Multi-Tenant MVC architecture of Force.com. The application
should consist of all modules required to automate the warehouse and also it be able to accessible via
android mobile.

2. Performance benchmarking of Type I Hypervisors:

Objective: The virtualization is carried out by the software layer called as the Hypervisor or Virtual
Machine Monitor (VMM). Hypervisor is widely used in cloud datacenters. Benchmark is the measurement
of best practice performance. Benchmarking is very essential term for the discovery of the best
performance given by the particular system. Benchmarking can provide you the external references and
the best practices on which to base your evaluations and to design your system processes which can be
very useful in finding the gaps in the system to achieve the desired performance. Your target hypervisors
are Xen, VMwareEsxi (Free edition) and Hyper V (Community Edition). Performance analysis of network,
cuprum, I/O need to carried out.

3. AgriERP: Agriculture Enterprise resource planning on cloud:

Objective: Agriculture management is complex, requires intimacy with the environment supporting the
farm and must meet the specific needs of the farm family it supports in the community where they live.
So this project is based on carrying and management of farming activities. By this project you are
intended to reduce management worries and regular information of paper written form. Also you
provide provision to farmers which give information regarding market update, weather report, and
equipment information. Your ultimate goal is to enhance use of farming resource by using modern
technology. Application can be developed using Force.com cloud platform.

4. Performance benchmarking of Type II Hypervisors:

Objective: The virtualization is carried out by the software layer called as the Hypervisor or Virtual
Machine Monitor (VMM). Hypervisor is widely used in cloud datacenters. Benchmark is the measurement
of best practice performance. Benchmarking is very essential term for the discovery of the best
performance given by the particular system. Benchmarking can provide you the external references and
the best practices on which to base your evaluations and to design your system processes which can be
very useful in finding the gaps in the system to achieve the desired performance. Your target hypervisors
are Virtual Box, VMWare workstation as a hosted hypervisors and KVM. Performance analysis of
network, cuprum, I/O need to carried out.

5. Configure a devstack environment in personal computer and create a image with LAMP stack
and deploy web an application:
Objective:DevStack is an opinionated script to quickly create an OpenStack development environment. It
can also be used to demonstrate starting/running OpenStack services and provide examples of using
them from a command line. Your objective is to deploy private cloud using devstack and create a
necessary network components and projects. Than configure an image with (LAMP), Linux-Apache-
MySQL-PHP. Develop a web application using html, PHP and MySQL database and deploy it on devstack.

6. Develop a three-tier web application using Web 3.0 Technologies and deploy it on AWS EC2
service with auto scaling property:
Objective: Amazon web services is a Public cloud provider consists of many services like storage,
database, compute and container services. It also consists of advanced services like AI, Image voice
recognition and other allied services. The high end three tier applications are with huge complex
structure like e-commerce sites, social media sites and other variety of application where quality of user
experience is most important. These types of applications can leverage the clouds on the fly based on the

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

resource demands. Your objective is to create a web application using latest web technologies. Deploy the
application by provisioning the EC2 instances of type micro. Perform auto scaling by generating high http
network traffic using http-perf.

7. Performance benchmarking of Type I Hypervisors and containers:

Objective: The virtualization is carried out by the software layer called as the Hypervisor or Virtual
Machine Monitor (VMM). Hypervisor is widely used in cloud datacenters. Benchmark is the measurement
of best practice performance. Benchmarking is very essential term for the discovery of the best
performance given by the particular system. Benchmarking can provide you the external references and
the best practices on which to base your evaluations and to design your system processes which can be
very useful in finding the gaps in the system to achieve the desired performance. Your target hypervisors
are Virtual Box, VMWare workstation as a hosted hypervisors and KVM. Performance analysis of
network, CPU, RAM I/O need to carried out.

8. Design and deploying of web application in Docker container:

Objective: Docker is an open-source project that automates the deployment of applications inside
software containers. Docker containers wrap up a piece of software in a complete file system that
contains everything it needs to run: code, runtime, system tools, and system libraries – anything you can
install on a server. Docker provides an additional layer of abstraction and automation of operating-
system-level virtualization on Windows and Linux. Docker uses the resource isolation features of the
Linux kernel such as cgroups and kernel namespaces, and a union-capable file system such as Overlays
and others to allow independent "containers" to run within a single Linux instance, avoiding the
overhead of starting and maintaining virtual machines. The objective of proposed study is to deploy the
containers on Docker. In that one container is a web server which has a web application which may be of
any language such as java, python etc. and another containers consists of database of application. We had
to connect these two containers and access the application of first container in third container with
database connectivity.

9. Minisat: Open source provisioning, managing and monitoring tool for virtual machines:
Objective: The web interface allows the user to interact with the underlying infrastructure to manage its
provisions. Technologies, which can be used to do so, are HTML, CSS, and Django. Application Server,
which is the master node, will be used to provision the requirements of a user by using libvirt API. It will
be able to monitor the status of VMs. Worker Node is the physical machines on which the VM will be
provisioned.

10. Develop a three-tier web application using Web 3.0 Technologies and deploy it on Google
compute service with auto scaling property:
Objective: Google compute services is a Public cloud provider consists of many services like storage,
database, compute and container services. It also consists of advanced services like AI, Image voice
recognition and other allied services. The high end three tier applications are with huge complex
structure like e-commerce sites, social media sites and other variety of application where quality of user
experience is most important. These type of applications can leverage the clouds on the fly based on the
resource demands. Your objective is to create a web application using latest web technologies. Deploy the
application by provisioning the EC2 instances of type micro. Perform auto scaling by generating high http
network traffic using http-perf.

11. Performance analysis of load balancing algorithms in cloud heterogeneous environment:

Objective: The pervasiveness and power of cloud computing alleviates some of the problem’s application
administrators face in their existing hardware and software environments. However, the rapid increase
in scale, dynamicity, heterogeneity, and diversity of cloud resources necessitates having expert
knowledge about the way resources are scheduled. The project gives an insight on key resource types of
cloud, its resource orchestration along with the analysis of the performance of algorithms.

12. Cloud Log Forensics: Foundations, State of the Art, and Future Directions:
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Objective: Cloud log forensics (CLF) mitigates the investigation process by identifying the malicious
behavior of attackers through profound cloud log analysis. However, the accessibility attributes of cloud
logs obstruct accomplishment of the goal to investigate cloud logs for various susceptibilities.
Accessibility involves the issues of cloud log access, selection of proper cloud log file, cloud log data
integrity, and trustworthiness of cloud logs. Therefore, forensic investigators of cloud log files are
dependent on cloud service providers (CSPs) to get access of different cloud logs.

13. Adaptive Threshold-Based Approach for Energy-Efficient Consolidation of Virtual Machines in

Cloud Data Centers:
Objective: The rapid growth in demand for computational power driven by modern service applications
combined with the shift to the Cloud computing model have led to the establishment of large-scale
virtualized data centers. Such data centers consume enormous amounts of electrical energy resulting in
high operating costs and carbon dioxide emissions. Dynamic consolidation of virtual machines (VMs) and
switching idle nodes off allow Cloud providers to optimize resource usage and reduce energy
consumption. However, the obligation of providing high quality of service to customers leads to the
necessity in dealing with the energy-performance trade-off. A novel technique for dynamic consolidation
of VMs based on adaptive utilization thresholds, which ensures a high level of meeting the Service Level
Agreements (SLA). We validate the high efficiency of the proposed technique across different kinds of
workloads using workload traces from more than a thousand Planet Lab servers.

14. An SLA-based Admission Control for a Software-as-a-service Provider in Cloud Computing

Environments:
Objective: Software as a Service (SaaS) provides access to applications to end users over the Internet
without upfront investment in infrastructure and software. To serve their customers, SaaS providers
utilize resources of internal data centres or rent resources from a public Infrastructure as a Service (IaaS)
provider. In-house hosting can increase administration and maintenance costs whereas renting from an
IaaS provider can affect the service quality due to its variable performance. To overcome these
limitations, we propose innovative admission control and scheduling algorithms for SaaS providers to
effectively utilize public Cloud resources to maximize profit by minimizing cost and improving customer
satisfaction level.

15. The Aneka Platform and Qos-driven Resource Provisioning for Elastic Applications on Hybrid
Cloud:
Objective: How Aneka, a platform for developing scalable applications on the Cloud, supports a vision of
QOS by provisioning resources from different sources and supporting different application models. We
highlight the key concepts and features of Aneka that support the integration between Desktop Grids and
Clouds and present an experiment showing the performance of this integration.

16. Data Leakage Detection Using Cloud Computing:

Objective: This project presents a data leakage detection system using various allocation strategies and
which assess the likelihood that the leaked data came from one or more agents. For secure transactions,
allowing only authorized users to access sensitive data through access control policies shall prevent data
leakage by sharing information only with trusted parties and also the data should be detected from
leaking by means of adding fake record`s in the data set and which improves probability of identifying
leakages in the system. Then, finally it is decided to implement this mechanism on a cloud server.

17. Suboptimal Mechanism for load balancing in cloud:

Objective: Load balancing is important and major issue for cloud networks due to its elastic nature,
user’s unpredictable behavior and difficulty faced to foresee the request issued to the server. In order to
efficiently utilize cloud resources, a new methodology for dynamic resource allocation based on the
suboptimal mechanism of aggregation i.e. GIT (greedy incremental tree) is needed. The proposed
technique improves path sharing at time of migration during load balance process. A cloud workload
network is constructed based on-Greedy heuristics having the characteristics to build incrementally
diverse set, selecting one compute node at a time to maximize diversity measure. The virtual machine
DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology
 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

manager can rely on the rules and can make efficient decision for optimal provisioning of virtual machine
based on the aggregated route.

18. Towards Many-Core Processor Simulation on Cloud Computing Platforms:

Objective: There is a need for a many-core simulator that can be simple to use and learn from for
students, dynamic and capable of emulating large systems for researchers, and flexible with fast turnover
for industry designers. At the same time, as many-core systems have been becoming popular and
complex, and hence their design, the long-standing field of Cloud Computing has become more prevalent
and feasible to use. Therefore, the projects deal with the designing of many core processors on simulator.

19. Consumer Acceptance of Cloud Computing Based Gaming:

Objective: There is a lack of understanding on how the users perceive cloud gaming. Investigating the
factors that affect the users’ acceptance of cloud gaming is crucial in deter-mining the future of this new
platform. A lack of awareness regarding these factors may lead to the users‟ rejecting the new
technology. This is a research-based project, conducted through an inductive approach, using a survey as
a research method, where the primary data comes from a structured interview. A descriptive study is
conducted in order to obtain the full set of user-related features of cloud gaming. After that, the
technology acceptance model is utilized in order to find out the user perception of these features.

20. Application performance Isolation in Cloud:

Objective: Performance isolation is the desirable thing in virtual machine based infrastructure to meet
Service Level Objectives. Many experiments in this area measure the performance of applications while
running the applications in different domains, which gives an insight into the problem of isolation. We
run different kind of benchmark s simultaneously in virtual environment to evaluate the isolation
strategy provided by the hypervisor.

21. Optimistic Synchronization of Parallel Simulations in Cloud Computing Environments:

Objective: Cloud computing offers the potential to make parallel discrete event simulation capabilities
more widely accessible to users who are not experts in this technology and do not have ready access to
high performance computing equipment. Services hosted within the cloud and can potentially incur
processing delays due to load sharing among other active services, and can cause optimistic simulation
protocols to perform poorly. This project proposes a mechanism termed the Time Warp Straggler
Message Identification Protocol (TW-SMIP) to address optimistic synchronization and performance
issues associated with executing parallel discrete event simulation in cloud computing environments

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

SYLLABUS
OF
PROGRAM ELECTIVE
BOUQUET: DEVELOPMENT TOOLS AND
TECHNOLOGIES

DEPARTMENT OF COMPUTER ENGINEERING &

APPLICATIONS

Under
Choice Based Credit System (CBCS)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Program Elective
TEACHING

CONTACTS
CREDITS

HR/WK
S. SCHEME
NO.
CODE SUBJECT PRE- REQUISITES
L T P J

Bouquet: Bouquet Development Tools and Technologies

THEORY
Full Stack Using Scripting
1. BCSE0251 3 0 0 0 3 3
Technologies
2. BCSE0252 Full Stack using Node JS 3 0 0 0 3 3

3. BCSE0253 Full Stack using C#.net 3 0 0 0 3 3

4. BCSE0254 PHP - Scripting Language 3 0 0 0 3 3

Digital Marketing and
5. BCSE0255 3 0 0 0 3 3
Transformation
PRACTICALS
Full Stack Using Scripting
1. BCSE0281 0 0 2 0 1 2
Technologies Lab
2. BCSE0282 Full Stack using Node JS Lab 0 0 2 0 1 2

3. BCSE0283 Full Stack using C#.net Lab 0 0 2 0 1 2

4. BCSE0284 PHP - Scripting Language Lab 0 0 2 0 1 2

PROJECTS
Full Stack Using Scripting
1. BCSE0291 0 0 0 - 2 -
Technologies Project
2. BCSE0292 Full Stack using Node JS Project 0 0 0 - 2 -

3. BCSE0293 Full Stack using C#.net 0 0 0 - 2 -

4. BCSE0294 PHP - Scripting Language Project 0 0 0 - 2 -

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0251: FULL STACK USING SCRIPTING TECHNOLOGIES

Objective: The objective is to provide a comprehensive study of the frontend. It stresses the strengths of
Web, which provide students with the means of writing efficient, maintainable, and portable code.
Credits: 03 L–T–P-J: 3–0–0-0
Module Teaching
No. Content Hours
Hyper Text Mark-up Language (HTML5): Introduction HTML, HTML Basics, HTML Elements,
HTML5 Semantic, HTML Attributes, HTML Headings, HTML Paragraph, HTML Styles, HTML
Formatting, HTML Quotations, HTML Computer Code, HTML Comments &Colours, HTML
CSS, Links and Images, HTML Lists, HTML Blocks, HTML Classes, HTML Layout, HTML
Responsive, HTML iframes, HTML JavaScript, HTML Head, HTML Entities and URI Code,
HTML Symbols and XHTML, HTML Charset and Forms

I Cascading Style Sheets (CSS3): Introduction CSS3, CSS3 Syntax, CSS3 How To, CSS3 Colours, 35
CSS3 Backgrounds, CSS3 Boarders, CSS Padding, CSS Height/Width, CSS3 Gradients, CSS3
Shadows, CSS3 Text, CSS3 Fonts, CSS3 2D Transforms, CSS3 3D Transforms, CSS Links, CSS
Lists, CSS Tables, CSS Box Model, CSS Outline, CSS Display, CSS Max-width, CSS Position, CSS
Float, CSS Inline-block, CSS Align, CSS Combinators, CSS Pseudo-class, CSS Pseudo-element,
CSS Navigation Bar, CSS Dropdowns, CSS Tooltips, CSS3 Images, CSS Attr Selectors, CSS
Forms, CSS Counters, CSS3 , CSS3 Button, CSS3 Pagination, CSS3 Multiple Columns, CSS3
User Interface, CSS3 Box Sizing, CSS3 Filters, CSS3 Media Queries, CSS3 Responsive

JavaScript: JavaScript Scope, JavaScript Events, JavaScript Strings, JavaScript Numbers,

JavaScript Math, JavaScript Arrays, JavaScript Boolean, JavaScript Comparisons, JavaScript
Conditions, JavaScript Switch, JavaScript Loops, JavaScript Type Conversion, JavaScript
RegExp, JavaScript Errors, JavaScript Debugging, JavaScript Hoisting, JavaScript Strict Mode,
JavaScript Functions, JavaScript Objects, JavaScript Forms, JavaScript HTML DOM.
II 30
Bootstrap: Introduction to Bootstrap, Bootstrap Basics, Bootstrap Grids, Bootstrap Themes,
Bootstrap CSS, Bootstrap JS

jQuery: Introduction to jQuery, jQuery Syntax, jQuery Selectors, jQuery Events, jQuery
Effects, jQuery HTML, jQuery Traversing, jQuery AJAX

Text Books:
 HTML 5 Black Book (Covers CSS3, JavaScript, XML, XHTML, AJAX, PHP, jQuery) by DT Editorial
Services, 2016
 Learning Web Development with Bootstrap and AngularJS by Stephen Radford,

Outcome: After completion of course, student will be able to:

 CO1: Summarize the basics of web development using HTML5, CSS3 and JavaScript.
 CO2: Develop a web page with paragraphs ,divs, images, links, and lists.
 CO3: Develop a web page using CSS IDs and classes
 CO4: Develop JavaScript functions to implement real life problem.
 CO5: Understand the basic concepts of boot strap including grids, themes, CSS and JS.
 CO6: Apply the concepts of jQueries to implement Java Script functions.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO3/PSO2
CO2 PO3/PSO2
CO3 PO5/PSO2
CO4 PO4/PSO1
CO5 PO5/PSO4
CO6 PO4/PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0281: FULL STACK USING SCRIPTING TECHNOLOGIES LAB

Objective: The objective is to provide a comprehensive study of the frontend. It stresses the strengths of
Web, which provide students with the means of writing efficient, maintainable, and portable code.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours
 Implements Basic HTML Tags
 Implementation of Table Tag.
 Implementation Text Formation
 Implementation of Links
 Implementation of CSS (All 4 Types)
 DHTML(Layer/DIV),
 Creating Classes in CSS
 Use of Selectors,
 Implementation of Menu.
I/II  Implement of JavaScript Events. 12*2=24
 Implement of JavaScript Control Statements.
 Implement of JavaScript Function.
 Implementation of Responsive Page.
 Implementation of Bootstrap Grid.
 Implementation of Bootstrap theme.
 Implementation of Bootstrap CSS & JS.
 Implementation and use JQuery Selectors.
 Implementation and use JQuery Events.
 Implementation and use JQuery Effects.

Reference Books:
 HTML 5 Black Book (Covers CSS3, JavaScript, XML, XHTML, AJAX, PHP, jQuery) by DT Editorial
Services, 2016
 Learning Web Development with Bootstrap and AngularJS by Stephen Radford

Outcome: After studying the subject, the students will be able to:
 CO1: Implement interactive web page(s) using HTML, CSS and JavaScript.
 CO2: Design a responsive web site using HTML5 and CSS3.
 CO3: Demonstrate Rich Web Applications.
 CO4: Use newer HTML5 tags with associated CSS instructions to organize information and
content.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO3/PSO1
CO2 PO3/PSO2
CO3 PO1/PSO1
CO4 PO5/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0291: FULL STACK USING SCRIPTING TECHNOLOGIES PROJECT

Objective: The objective is to provide a comprehensive study of the frontend. It stresses the strengths of
Web, which provide students with the means of writing efficient, maintainable, and portable code.

Credits: 02 L–T–P-J: 0–0–0–0

Module Lab
Content
No. Hours
Students Have to develop one Project of Interactive Web Templates.

 Ecommerce Template.
 E-Learning Template.
 Uni. Template.
 Photography shop Templates
 Service provider Template.
I/II -
 Event planner Template
 Model Portfolio Template
 Resume Based template
 Property Site Template
 Educational Site Template
 Industry approved and relevant projects

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0252: FULL STACK USING NODE JS

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web (Full Stack), which provide students with the means of writing efficient, maintainable, and portable
Website.
Credits: 03 L–T–P:J: 3–0–0-0
Module Teaching
Content
No. Hours
MongoDB: Introduction to MongoDB, MongoDB Environment, MongoDB
Create Database, MongoDB Drop Database, MongoDB Create Collection,
MongoDB Drop Collection, MongoDB Read Operations, MongoDB Write
Operations, MongoDB Data Modelling, MongoDB Administration.
Angular JS: Introduction to AngularJS, AngularJS Expressions, AngularJS
I Modules, AngularJS Data Binding, AngularJS Scopes, AngularJS Directives & 20
Events, AngularJS Controllers, AngularJS Filters, AngularJS Services,
AngularJS HTTP, AngularJS Tables, AngularJS Select, Fetching Data from
MySQL, AngularJS Validation, AngularJS API.
Express Framework: Introduction to Express Framework, Introduction to
Nodejs, what is Nodejs, Getting Started with Express, Express Routing,
Express Framework: Implementing MVC in Express, Middleware, Using
Template Engines, Error Handling, API Handling, Debugging, Developing
Template Engines, Using Process Managers, Security & Deployment.
Node.js: Introduction to Node JS, Setup Dev Environment, Node Core, Node
II Modules, Creating Web server, File System, Debugging Node JS Application, 20
Automation and Deployment, Events & Database connectivity.
React.js: Welcome to Starting with React, React Components, React State
and Props, React Event Handling, Routing in React React flux, &. Styling
React
Text Books:
 Node.js, MongoDB and Angular Web Development: The definitive guide to using the MEAN stack
to build web applications by Brad Dayley, Brendan Dayley, Caleb Dayley
 Express.js: Guide Book on Web framework for Node.js by Rick L.
 Introduction to React by Cory Gackenheimer,

Outcome: After completion of course, student will be able to:

 CO1: Apply programming concepts using Node.Js.
 CO2: Develop web application using MongoDB and AngularJs.
 CO3: Develop web application based on MongoDB.
 CO4: Understand project management and code.
 CO5: Develop RESTful and MVC based web application.
 CO6: Understand the basic concepts of React.js.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO1
CO2 PO3/PSO2
CO3 PO3/PSO3
CO4 PO2/PSO3
CO5 PO3/PSO2
CO6 PO2/PSO1

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0282: FULL STACK USING NODE JSLAB

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web (Full Stack), which provide students with the means of writing efficient, maintainable, and portable
Website.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours
 Installing and Managing MogoDB.
 Create & Manage Database.
 Create & Manage collections
 Implementation of Modeling.
 Create your first AngularJS application in Visual Studio.
 Build a shopping cart using AngularJS
 Implementation AngularJS Expressions
 Implementation AngularJS Modules
I/II  Implementation AngularJS Events 12*2=24
 Implementation AngularJS Filters & Services
 Node JS- Setup Dev Environment.
 Express Routing
 Implementing MVC in Express.
 Implementing Template Engines.
 Implementing Node Modules,
 Implementing React Components,
 Implementing React Event.

Reference Books:
 Node.js, MongoDB and Angular Web Development: The definitive guide to using the MEAN stack
to build web applications by Brad Dayley, Brendan Dayley, Caleb Dayley
 Express.js: Guide Book on Web framework for Node.js by Rick L.
 Introduction to React by Cory Gackenheimer,

Outcome: After studying the subject, the students will be able to:
 CO1: Implement web application using MongoDB and Angular.Js.
 CO2: Develop web application using NodeJs.
 CO3: Develop RESTful and MVC based web application.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO5/PSO2
CO2 PO3/PSO2
CO3 PO5/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0292: FULL STACK USING NODE JS PROJECT

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web (Full Stack), which provide students with the means of writing efficient, maintainable, and portable
Website.

Credits: 02 L–T–P-J: 0–0–0–0

Module Lab
Content
No. Hours

Students Have to develop one Project of Interactive Web Templates.

 Ecommerce Template.
 E-Learning Template.
 Uni. Template.
 Photography shop Templates
 Service provider Template.
I/II -
 Event planner Template
 Model Portfolio Template
 Resume Based template
 Property Site Template
 Educational Site Template
 Industry approved and relevant projects

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0253: FULL STACK USING C#.NET

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web (Full Stack), which provide students with the means of writing efficient, maintainable, and portable
Website.
Credits: 03 L–T–P-J: 3–0–0-0
Module Teaching
Content
No. Hours
.NET Framework & C#: Expressions & Primitive Types, Non-Primitive
Types, Control Flow, Arrays & Lists, Date & Time, Text, File System, Debug
Application, Classes, Association, between Classes, Inheritance - Second
Pillar of OOP, Polymorphism: Third Pillar of OOP, Interfaces, C# Advanced
Topics & ADO.net.
Collections and Generics: Introducing Collections, Benefits of Collection
Classes, Understanding and using commonly used collections, Generics,
Advantages of Generics, Generic Collections
I 20
ASP.NET Core: Introduction to ASP.NET Core, ASP.NET Core First Application,
- Controllers & Action Methods, Views, Helpers, Model Binding, - Validations &
Data Annotations, State management Techniques, Security, MVC and Entity
Framework Core, ASP.NET Core - Web Caching, Routing, Module Development
& Web API and JQuery Ajax, Creating a Layout Using Master Pages&, Data
bound Controls.

Microsoft SQL Server: Introduction to Basic Database Concepts, Introduction

to SQL, Introduction to SQL, Joins and Set Operations, working with Stored
Procedures and Functions, Transaction Control Language (TCL) &
Backup/Restore.
Angular JS: Introduction to AngularJS, AngularJS Expressions, AngularJS
II Modules, AngularJS Data Binding, AngularJS Scopes, AngularJS Directives & 20
Events, AngularJS Controllers, AngularJS Filters, AngularJS Services, AngularJS
HTTP, AngularJS Tables, AngularJS Select, Fetching Data from MySQL,
AngularJS Validation, AngularJS API.
React.js: Starting with React, React Components, React State and Props, React
Event Handling, Routing in React flux, &. Styling React

Text Books:
 Learning Angular for .NET Developers by Rajesh Gunasundaram
 ASP.NET Core Application Development - Building an Application in Four Sprints by James
Chambers, David Paquette, Simon Timms
 Querying Microsoft SQL Server 2012 Exam 70-461 Training Kit by Gan B.I
 Introduction to React by Cory Gackenheimer,

Outcome: After completion of course, student will be able to:

 CO1: Understand the basic programming concepts of C#.
 CO2: Develop web application using Asp.Net Core.
 CO3: Understand the basic concepts of SQL server.
 CO4: Develop web application Using Angular JS.
 CO5: Develop RESTful and MVC based web application.
 CO6: Understand the basic concepts of React.js.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO3
CO2 PO3/PSO4
CO3 PO5/PSO1
CO4 PO3/PSO4
CO5 PO3/PSO4
CO6 PO5/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0283: FULL STACK USING C#.NET LAB

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web (Full Stack), which provide students with the means of writing efficient, maintainable, and portable
Website.
.
Credits: 01 L–T–P: 0–0–2
Module Lab
Content
No. Hours
 WAP to Implement Types in C#
 WAP to Illustrate Control Flow Statements
 Implements Array and lists
 WAP to Read write in files.
 Implements Inheritance
 Implements Interface
 Create a data access layer with Entity Framework Core 2
 Initialize data for testing with EF Core 2
 Build a website with ASP.NET Core 2
 Configure the HTTP pipeline and routing
I/II 12*2=24
 Creating Tag Helpers
 Create and use View Components
 create your first AngularJS application in Visual Studio.
 Build a shopping cart using AngularJS
 Implementation AngularJS Expressions
 Implementation AngularJS Modules
 Implementation AngularJS Events
 Implementation AngularJS Filters & Services
 Implementing React Components,
 Implementing React Event.

Reference Books:
 Learning Angular for .NET Developers by Rajesh Gunasundaram
 ASP.NET Core Application Development - Building an Application in Four Sprints by James
Chambers, David Paquette, Simon Timms
 Querying Microsoft SQL Server 2012 Exam 70-461 Training Kit by Gan B.I
 Introduction to React by Cory Gackenheimer,

Outcome: After studying the subject, the students will be able to:
 CO1: Implement the basic programming concepts of C#.
 CO2: Develop web application using Asp.Net Core.
 CO3: Develop web application using Angular.JS.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1/PSO3
CO2 PO3/PSO4
CO3 PO3/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0293: FULL STACK USING C#.NET PROJECT

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web (Full Stack), which provide students with the means of writing efficient, maintainable, and portable
Website.

Credits: 02 L–T–P-J: 0–0–0–0

Module Lab
Content
No. Hours

Students Have to develop one Project of Interactive Web Templates.

 Ecommerce Template.
 E-Learning Template.
 Uni. Template.
 Photography shop Templates
 Service provider Template.
I/II -
 Event planner Template
 Model Portfolio Template
 Resume Based template
 Property Site Template
 Educational Site Template
 Industry approved and relevant projects

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0254: PHP - SCRIPTING LANGUAGE

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web, which provide students with the means of writing efficient, maintainable, and portable Website

Credits: 03 L–T–P-J: 3–0–0-0

Module Teaching
Content
No. Hours
PHP Basics: Introduction to PHP, Basic Syntax of PHP, Embedding PHP in
HTML, Comments, Variables, Constants, Managing Variables, Operators and
Operator Precedence and String Manipulation functions.
Conditional Control Structures: If statement, If- else statement, If- else if
statement, Nested If, Switch statement.
Functions in PHP: Functions, User-Defined function, Call by value and call by
references, Understanding variable scope, Global Variables, Static Variables,
I Include and Require, Built-in functions in PHP. 20

Arrays: Arrays and its types in PHP, Accessing Elements of an Array,

Modifying Elements of an Array, Functions in array, Array Sorting,
Multidimensional Array.
PHP File Handling: Introduction, File Open, File Creation, writing to files,
reading from File, searching a record from a file, Closing a File.

Class and Object: Introduction, Object, Class, Defining Class in PHP, Object in
PHP, Usage of this variable, Constructor, Constructor with Parameters.
Exception Handling: Introduction to Exception, Exception Handling
mechanisms, Creating Custom Exceptions, Multiple Catch Blocks, Exception
Propagation, Error Handling in PHP.
Form Handling and Session Management in PHP: Accessing and displaying
Form data from different Form components, Differences among $_GET, $_POST
and $_REQUEST variables, Session management, Session operations, Session
II 20
tracking mechanism, Clearing/Modifying data from session, destroying a
session, Setting and Retrieving Cookies, uploading a file, displaying its details,
restricting various details of a file during upload, checking for errors and
reading Error code table.
Database Management: Introduction to DBMS, SQL Basics, Database
connectivity in PHP with MySQL, Executing Queries from frontend.
XML: Introduction to XML, Parsing XML document using DOM parser, Various
operations on XML document using PHP.
Text Books:
 PHP Reference Beginner to Intermediate PHP 5 By Mario Lurig
 PHP and MySQL by Mike McGrath,

Outcome: After completion of course, student will be able to:

 CO1: Explain the basics of web development using PHP and HTML.
 CO2: Develop a program using control structures and array.
 CO3: Develop the PHP programs based on functions, and file handling.
 CO4: Demonstrate the concepts of object and exception handling in PHP.
 CO5: Demonstrate web application using PHP, CSS and MYSQL on XAMPP/WAMP framework.
 CO6: Develop a dynamic/ static websites with server side programming.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

COs POs/PSOs
CO1 PO1,PO2,PO7/PSO1
CO2 PO4,PO12/PSO1
CO3 PO1,PO3,PO8/PSO1
CO4 PO4,PO7,PO8/PSO3
CO5 PO2,PO3,PO7,PO9/PSO3
CO6 PO6,PO9,PO11,PO12/PSO3,PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0284: PHP - SCRIPTING LANGUAGE LAB

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web, which provide students with the means of writing efficient, maintainable, and portable Website.

Credits: 01 L–T–P-J: 0–0–2-0

Module Lab
Content
No. Hours
 Creating simple webpage using PHP
 Use of conditional statements in PHP
 Use of looping statements in PHP
 Creating different types of arrays
 Usage of array functions
 Creating user defined functions
 Creation of files
 File manipulation using PHP
I/II  Creation of sessions 12*2=24
 Creation of cookies
 Creating simple table with constraints
 Insertion, Updating and Deletion of rows in MYSQL tables
 Searching of data by different criteria
 Usage of aggregate functions
 Working with string, numeric and date functions
 Database connectivity in PHP with MySQL
 Validating Input

Reference Books:
 PHP Reference Beginner to Intermediate PHP 5 By Mario Lurig
 PHP and MySQL by Mike McGrath,

Outcome: After studying the subject, the students will be able to:
 CO1: Implement the basic constructs using PHP.
 CO2: Develop web application using PHP.
 CO3: Develop RESTful and MVC based web applications.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO2,PO3,PO6/PSO1,PSO2
CO2 PO5,PO7,PO8/PSO3,PSO4
CO3 PO3,PO11,PO12/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0294: PHP - SCRIPTING LANGUAGE PROJECT

Objective: The objective is to provide a comprehensive study of the Backend. It stresses the strengths of
Web, which provide students with the means of writing efficient, maintainable, and portable Website.

Credits: 02 L–T–P-J: 0–0–0–0

Module Lab
Content
No. Hours

Students Have to develop one Project of Interactive Web Templates.

 Ecommerce Template.
 E-Learning Template.
 Uni. Template.
 Photography shop Templates
 Service provider Template.
I/II -
 Event planner Template
 Model Portfolio Template
 Resume Based template
 Property Site Template
 Educational Site Template
 Industry approved and relevant projects

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

BCSE0255: DIGITAL MARKETING AND TRANSFORMATION

Objective: The objective of this course is to provide knowledge about the digital marketing and the
industry trends correspondence to the concepts.

Credits: 03 L–T–P-J: 3–0–0-0

Module Lab
Content
No. Hours
Introduction Digital Marketing
Modern Marketing- How Marketing Works, Fundamentals Channels- Awareness,
Consideration & Decision Making, Building Integrated Marketing Plan, Lead
Journey- From Prospect to Sales.
Website and Blogging
The Power of Storytelling, Know Your Customer - Market and Content Research,
Construct Prospective Buyer Personas & Journeys, Establishing The Content
Ideation & Creation Framework, Creative Design Principles, Linking Blogs To
Social Network (Conversation Blogs), Measuring And Optimizing Blog
Performance, Importance Of Responsive Design, Leverage Landing Pages And
I Forms To Accelerate Conversion. 20
Content Promotion
SEO as an Art and as a Science, Ranking Algorithms, Website Audit, Optimizing
Digital Assets & Metadata, Decoding Common Paid Media Platforms, Influencer
Marketing, Black Hat, White Hat and Grey Hat SEO
Email Marketing
Types of Email (Promo/Trans/NL), ESP Setup & On-boarding, Permission
Marketing, Subscriber welcome plan and journey, List segmentation and
Management, Personalization and Responsive design, Multivariate Testing, E-
commerce Integration, Deliverability and System Reputation Management, System
Integrations & Automations.

Social Media Marketing

Social Ads Type and their Design Structure, targeting strategy and planning –
Laser/Broad, Effective targeting and custom audience set-up, Campaign setup and
reporting on various social platforms, Social Split Advertising, Content Calendar,
Peremptory traits for Social Advertising PPE, WC and CTW campaigns.

Mobile Marketing
II Mobile landscapes for Marketing and Monetization, Conventional Advertising, 20
Millennial Mobile Advertising, Versatile Promotions, Alternative focusing and
promotions on Mobile, Push App and Game based promotions, Location evolution
with mobile
Marketing Analytics & ROI
Key marketing engagement & ROI metrics, Primer on data science and analytics
concepts, Web Traffic nuances, Multi-channel Analytics, Decoding CLV and RFM,
Deciphering conversion and goal metrics, implement conjoint analysis & decision
tree tactics, Avoiding common analytical pitfalls.

Text Book:
 Puneet Singh Bhatia, Fundamentals of Digital Marketing First Edition, Publication Pearson.

Reference Books:
 Ian Dodson, The Art of Digital Marketing: The Definitive Guide to Creating Strategic, Targeted
and Measurable Online Campaigns, Publication Wiley India Pvt Ltd.
 Philip Kotler, Hermawan Kartajaya, Iwan Setiawan, Marketing 4.0: Moving from Traditional to
Digital, , Publication Wiley India Pvt Ltd.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

 Course Curriculum (w.e.f. Session 2021-22)
B. Tech. Computer Science & Engineering

 Vandana Ahuja, Digital Marketing 1st Edition, Publication Oxford.

 Rohan Yamagishi, Digital Marketing in Asia: A Start-Up Guide for Search Engine Marketing in
APAC, Publication R. R. Bowker

Outcome: After learning the course the students should be able to:
 CO1: Understanding the basics of digital marketing.
 CO2: Explain the measurement techniques used in evaluating digital marketing efforts.
 CO3: Understand the use of digital marketing for multiple goals within a larger marketing and
media strategy.
 CO4: Understand the major digital marketing channels - online advertising: Digital display, video,
mobile, search engine, and social media.
 CO5: Explore the latest digital ad technologies.
 CO6: Learn to develop, evaluate, and execute a comprehensive digital marketing strategy and
plan.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/PSOs
CO1 PO1,PO4,PO7,PO8/PSO1
CO2 PO1,PO4,PO7,PO8/PSO1
CO3 PO1,PO7,PO8/PSO1
CO4 PO1,PO7,PO8/PSO1
CO5 PO1,PO7,PO8/PSO3
CO6 PO1,PO4,PO7,PO8/PSO4

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology