Indira Gandhi University Meerpur Rewari

(A State University established under Haryana Act No.29 of 2013)

Examination Scheme & Syllabus for B.TECH (Computer Science and Engineering) Semester 3rd & 4th

OUTCOME BASED EDUCATION SYSTEM / LEARNING OUTCOME CURRICULUM FRAMEWORK

OBES / LOCF, CBCS CURRICULUM (w.e.f. 2019-20)

VISION AND MISSION OF THE DEPARTMENT

VISION

To train students to be highly effective instructors, researchers, developers and contributors to IT companies globally. Be regarded as a prestigious centre
of scholarly achievement worldwide.

MISSION

1. To foster advance research and best education in IT domain.

2. To create skilled employees for businesses and industries based on latest IT technologies like artificial intelligence, data science and IoT etc.
3. To offer learning environment that is centered on the needs of the students in order to help in their overall development.
Programme Outcomes (PO), B.Tech, Department of CSE, Indira Gandhi University, Meerpur, Rewari

PO1 Knowledge Capable of demonstrating comprehensive disciplinary knowledge gained during course of study.

PO2 Research Aptitude Capability to ask relevant/ appropriate questions for identifying, formulating and analyzing the research problems and to
draw conclusion from the analysis.

PO3 Communication Ability to communicate effectively on general and scientific topics with the scientific community and with society at
large.

PO4 Problem Solving Capability of applying knowledge to solve scientific and other problems.

PO5 Individual and Team Capable to learn and work effectively as an individual, and as a member or leader in diverse teams, multidisciplinary
Work settings.

PO6 Investigation of Ability of critical thinking, analytical reasoning and research based knowledge including design of experiments, analysis
Problems and interpretation of data to provide conclusions.

PO7 Modern Tool usage Ability to use and learn techniques, skills and modern tools for scientific practices.

PO8 Science and Society Ability to apply reasoning to assess the different issues related to society and the consequent responsibilities relevant to
the professional scientific practices.

PO9 Life-Long Learning Aptitude to apply knowledge and skills that are necessary for participating in learning activities throughout life.

PO10 Ethics Capability to identify and apply ethical issues related to one’s work; avoid unethical behaviour such as fabrication of data,
committing plagiarism and unbiased truthful actions in all aspects of work.

PO11 Project Management Ability to demonstrate knowledge and understanding of the latest IT technologies and apply these to manage projects.
Programme Educational Objectives (PEOs):
The Department of CSE has formulated the Programme Educational Objectives (PEO's) with those in fields. The Programme educational objectives
(PEO) are the statement that describes the career and professional achievement after receiving the degree. The PEO's of the Bachelor degree in Computer
Science & Engineering are as follows:
PEO1: To have fundamental as well as advanced knowledge of the Information Technologies.
PEO2: To provide the professional services to IT industries, Research organization, in the domain of super specialization.
PEO3: To opt for higher education, disciplinary & multi-disciplinary research and to be a life-long learner.

Programme Specific Outcomes (PSO’s):

The Programme outcomes (PSO) are the statement of competencies/ abilities. PSOs are the statement that describes the knowledge and the abilities
the post-graduate will have by the end of Programme studies.
PSO1: The detailed functional knowledge of theoretical concepts and experimental aspects of computer science.
PSO2: To integrate the gained knowledge with various contemporary and evolving areas in computer sciences like Artificial Intelligence, Machine
Learning, Data Science etc.
PSO3: To understand, analyze, plan and implement qualitative as well as quantitative problems in computer science.
PSO4: Provide opportunities to excel in academics, research or Industry.

Mapping of PEO’s with PO’s and PSO’s

S. Programme Educational Objectives

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
No.

1 To have fundamental as well as advanced

√ √ √ √ √ √ √ √ √ √ √ √ √ √ √
knowledge of IT.

2 To provide the professional services to

industries, Research organization, in the √ √ √ √ √ √ √ √ √ √ √ √ √ √ √
domain of super specialization.

3 To opt for higher education, disciplinary &

multi-disciplinary research and to be a life- √ √ √ √ √ √ √ √ √ √ √ √ √ √ √
long learner.
 COURSE CODE AND DEFINITIONS
Course Code Definition
L Lecture
T Tutorial
P Practical
BSC Basic Science Courses
ESC Engineering Science Courses
HSMC Humanities and Social Sciences including Management courses
PCC Professional Core Courses
LC Laboratory Courses
MC Mandatory Courses
PT Practical Training
S Seminar
Seminar

Max.Marks-25
Every candidate will have to deliver a seminar of 30 minutes duration on a topic (not from the syllabus) which will be chosen by him / her in consultation with the
teacher of the department. The seminar will be delivered before the students and teachers of the department. A three member committee (one coordinator and two
teachers of the department of different branches) duly approved by the departmental council will be constituted to evaluate the seminar. The following factors will
be taken into consideration whileevaluating the candidate.
Distribution of marks will be as follows:
1. Presentation 10 marks
2. Depth of the subject matter 10 marks
3. Answers to the questions 05 marks
 B.Tech (Computer Science and Engineering) Scheme of Studies/Examination w.e.f. 2019-20
Semester-3

Hours per week Examination Schedule(Marks)

Total Hrs. Duration
Sr. of Exam
Course Code Course Title per week Credit Mark of
No. L T P Theory Practical Total (Hours)
Class work

1 PCC-CSE-201 Database Management Systems 3 0 0 3 3 25 75 100 3

2 PCC-CSE-203 Data Structures &Algorithms 3 0 0 3 3 25 75 100 3

3 PCC-CSE-205 Digital Electronics 3 0 0 3 3 25 75 100 3

4 PCC-CSE-207 Python Programming 2 0 0 2 2 25 75 100 3

Mathematics - III (Multivariable
5 BSC-MATH- Calculus and Differential 2 0 0 2 2 25 75 100 3
203 Equations)
6 HSMC-01 Economics for Engineers 3 0 0 3 3 25 75 100 3

7 LC-CSE-209 Database Management Systems 0 0 4 4 2 25 25 50 3

LAB

8 LC-CSE-211 Digital Electronics LAB 0 0 4 4 2 25 25 50 3

9 LC-CSE-213 Data Structures &Algorithms LAB 0 0 4 4 2 25 25 50 3

Using C

10 LC-CSE-215 Python Programming LAB 0 0 2 2 1 25 25 50 3

11 Seminar - - - - 1 - - - 25 -

Total 24 825
 B.Tech. (Computer Science and Engineering) Scheme of Studies/Examination w.e.f. 2019-20
Semester-4

Hours per week Examination Schedule(Marks) Duration

Total
Sr. of Exam
Hrs. per Mark of
Course Code Course Title Credit (Hours)
No. week Class Total
L T P Theory Practical
work
1 PCC-CSE-202 Discrete Mathematics 3 1 0 3 4 25 75 100 3

2 PCC-CSE-204 Computer Organization & 3 0 0 3 3 25 75 100 3

Architecture
3 PCC-CSE-206 Operating System 3 0 0 3 3 25 75 100 3
4 PCC-CSE-208G Object Oriented Programming 3 0 0 3 3 25 75 100 3
5 HSMC-02 Organizational Behavior 3 0 0 3 3 25 75 100 3
6 *MC-106 Environmental Sciences 3 0 1 4 0 25 75 - - 3

7 PCC-CSE-210 Web Technologies 2 0 0 2 1 25 75 100 3

8 LC-CSE-212 Operating System LAB 0 0 4 4 2 25 25 50 3

9 LC-CSE-214 Object Oriented Programming LAB 0 0 4 4 2 25 25 50 3

Using C++

10. LC-CSE-216 Web Technologies Lab 0 0 2 2 1 25 25 50 3

Seminar - - - - 1 - - - 25 -
11

Total 23 775
*
MC-106 is a mandatory non –credit course in which the students will be required passing marks in theory.NOTE: At the end of 4th semester each student has to undergo
Practical Training of 4/6 weeks in an Industry/ Institute/ Professional Organization/ Research Laboratory/ training centre etc. and submit typed report along with a certificate from the organization
& its evaluation shall be carried out in the 5th Semester.
 Database Management System

Course code PCC-CSE-201

Category Professional Core Course
Course title Database Management System
L T P Credits
Scheme and Credits
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Objectives of the course

a. To understand the different issues involved in the design and implementation of a database system.
b. To study the physical and logical database designs, database modeling, relational, hierarchical, and network models
c. To understand and use data manipulation language to query, update, and manage a database
d. To develop an understanding of essential DBMS concepts such as: database security, integrity, concurrency, distributed database,
and intelligent database, Client/Server (Database Server), Data Warehousing.
e. To design and build a simple database system and demonstrate competence with the fundamental tasks involved with modeling,
designing, and implementing a DBMS.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Unit: 1
Database system architecture: Data Abstraction, Data Independence, Data Definition Language (DDL), Data Manipulation Language
(DML).Data models: Entity-relationship model, network model, relational and object oriented data models, integrity constraints, data
manipulation operations.
 Unit: 2
Relational query languages: Relational algebra, Tuple and domain relational calculus,SQL3, DDL and DML constructs, Open source
and Commercial DBMS - MYSQL, ORACLE, DB2, SQL server.
Relational database design: Domain and data dependency, Armstrong's axioms, Normal forms, Dependency preservation, Lossless
design.
Query processing and optimization: Evaluation of relational algebra expressions, Query equivalence, Join strategies,
Query optimization algorithms.
Unit: 3
Storage strategies: Indices, B-trees, hashing,
Transaction processing: Concurrency control, ACID property, Serializability of scheduling, Locking and timestamp based
schedulers, Multi-version and optimistic Concurrency Control schemes, Database recovery.

Unit: 4
Database Security: Authentication, Authorization and access control, DAC, MAC and RBAC models, Intrusion detection,
SQL injection.
Advanced topics: Object oriented and object relational databases, Logical databases, Web databases, Distributed databases, Data
warehousing and data mining.

Course Outcomes:
CO1 To introduce the concept of Data Abstraction & Data Independence.
CO2 To describe the factors various Data base Models.
CO3 To apply the concept of Relational query Languages.
CO4 To impart knowledge of Query Processing optimization with the help of Algorithms.
CO5 To know about the storage strategies including Hashing.
CO6 To instruct about the Transaction Processing.
CO7 To explain the mechanism of Database Security & Authentication.
CO8 Gained knowledge about Object oriented and object relational databases
Mapping of Paper No. PCC-CSE-201

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S M S S S S S S S M S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S M S S S S S S S S S S
CO4 S S S S M S S S S S S S S S S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S M S S M S S S S S S S S
CO8 S S S M S S M S S S S S S S S

S=Strong M=Medium W=Weak

Suggested books:
1. “Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F. Korth, S. Sudarshan, McGraw-Hill.
2. Introduction to Database Management System, Satinder Bal Gupta, AdityaMittal, University Science Press, New
Delhi.

Suggested reference books

1. “Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D. Ullman, Computer Science Press.
2. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S. Navathe, Pearson Education
3. “Foundations of Databases”, Reprint by Serge Abiteboul, Richard Hull, Victor Vianu, Addison-Wesley
 Data Structure & Algorithms

Course code PCC-CSE-203

Category Professional Core Course

Course title Data Structure & Algorithms
L T P Credits
Scheme and Credits
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Objectives of the course:

1. To impart the basic concepts of data structures and algorithms.
2. To understand concepts about searching and sorting techniques
3. To understand basic concepts about stacks, queues, lists trees and graphs.
4. To enable them to write algorithms for solving problems with the help of fundamental data structures
Unit 1:
Introduction: Basic Terminologies: Concept of Data Structure, Choice of right Data Structure, Algorithms, how to design and
develop algorithm, Complexity of algorithm. Operations: insertion, deletion, traversal etc.; Analysis of an Algorithm, Searching:
Linear Search and Binary Search Techniques and their complexity analysis.

Unit 2:
Stacks and Queues: Stack and its operations: Algorithms and their complexity analysis, Applications of Stacks: Expression
Conversion and evaluation -corresponding algorithms and complexity analysis. Queue, Types of Queue: Simple Queue, Circular
Queue, Priority Queue; Operations on each types of Queues: Algorithms and their analysis.
 Unit 3:
Linked Lists: Singly linked lists: Representation in memory, Algorithms of several operations: Traversing, Searching, Insertion into,
Deletion from linked list; Linked representation of Stack and Queue, Header nodes, Doubly linked list: operations on it and
algorithmic analysis; Circular Linked Lists: all operations their algorithms and the complexity analysis.
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree;
Tree operations on each of the trees and their algorithms with Complexity analysis. Applications of Binary Trees. B Tree, B+
Tree: definitions, algorithms and analysis.
Unit 4:
Sorting and Hashing: Objective and properties of different sorting algorithms: Selection Sort, Bubble Sort, Insertion Sort,
Selection Sort Quick Sort, Merge Sort, Heap Sort; Performance and Comparison among all the methods.
Graph: Basic Terminologies and Representations, Graph search and traversal algorithms and complexity analysis.

Course Outcomes:
CO1 To introduce the concept of Choice of right Data Structure, Algorithms.
CO2 To describe the factors Linear Search and Binary Search Techniques.
CO3 To apply the concept Algorithms and their complexity analysis.
CO4 To impart knowledge of Priority Queue; Operations on each type of Queues.
CO5 To know about the operations their algorithms and the complexity analysis.
CO6 To instruct about the Applications of Binary Trees.
CO7 To explain the mechanism Selection Sort, Bubble Sort.
CO8 Gained knowledge about traversal algorithms and complexity analysis.

Mapping of Paper No – PCC-CSE-203

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M M S S S S S S S M
CO3 M S S M S S S M S M S S S S S
CO4 S S S M M S S M S M S S S S S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M M S S S S S S S M
CO7 S M S S S S S S S S M S S S S
CO8 S M S S S S S S S S M S S S S
S=Strong M=Medium W=Weak
Suggested books:
1. Data Structures using C & C++: by Shukla, Wiley India Ltd.
2. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, Sartaj Sahni, and Computer Science Press.
3. Data Structures, 2ed by Venkatesan, Wiley India Ltd.

Suggested reference books:

1. Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark Allen Weiss, Addison-Wesley
Publishing Company
2. Data Structures & Algorithms in Java, 6ed by Goodrich, Wiley India Ltd.
3. “How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson Education.
4. C & Data Structures by Deshpande, Wiley India Ltd.
 DIGITAL ELECTRONICS

Course code PCC-CSE-205

Category Professional Core Course

Course title Digital Electronics
L T P Credits
Scheme and Credits Semester 3
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Objectives of the course:

1. To impart the basic concepts of Digital signals, digital circuits, AND, OR, NOT, NAND, NOR gate.
2. To understand concepts about simplification functions using K-map & Don’t care conditions,
3. To understand basic concepts about the circuit properties of Bi stable latch, the clocked SR flip flop.
4. To understand weighted resistor/converter, R-2RLadder D/A converter,specifications for D/A converters.

UNIT1:
FUNDAMENTALS OF DIGITAL SYSTEMS AND LOGIC FAMILIES
Digital signals, digital circuits, AND, OR, NOT, NAND, NOR and Exclusive-OR operations, Boolean algebra, examples of IC gates,
number systems-binary, signed binary, octal hexadecimal number, binary arithmetic, one’s and two’s complements arithmetic, codes,
error detecting and correcting codes.
UNIT2:
COMBINATIONAL DIGITAL CIRCUITS
Standard representation for ,K- ,and simplification functions using K-map, .Don’t care conditions, Multiplexer, De-
 Multiplexer/Decoders, Adders, Subtractors, carry look ,serial adder, ALU, elementary ALU design, popular MSI chips, digital
comparator, parity checker/generator,codeconverters,priorityencoders,decoders/drivers for display devices, Q-M method of function
realization.

UNIT3:
SEQUENTIAL CIRCUITS AND SYSTEMS
A1-bit memory, the circuit properties of Bi stable latch, the clocked SR flip flop, J-K-T and D types flip flops, applications of flip
flops, shift registers, applications of shift registers, serial to parallel converter, parallel to serial converter, ring counter, sequence
generator, ripple (Asynchronous) counters, synchronous counters, counters design using flip flops, special counter IC’s,
asynchronous sequential counters, applications of counters.

UNIT4:
A/D AND D/A CONVERTERS
Digital to analog converters: weighted resistor/converter,R-2RLadderD/A converter, specifications for D/A converters,
examples of D/A converter lC`s, sample and hold circuit, Analog to digital converters: quantization and encoding,
parallel comparator A/D converter, successive approximation A/D converter, counting A/D converter, dual slope A/D converter,
SEMICONDUCTOR MEMORIES AND PROGRAMMABLE LOGIC DEVICES
Memory organization and operation, expanding memory size, classification and characteristics of memories, sequential memory, read
only memory (ROM), read and write memory(RAM), content addressable memory (CAM),ROM as a PLD, Programmable logic
array, Programmable array logic, complex Programmable logic devices (CPLDS), Field Programmable Gate Array(FPGA).

Course Outcomes:
CO1 To introduce the concept Boolean algebra, examples of IC gates, number.
CO2 To describe the arithmetic, codes, error detecting and correcting codes.
CO3 To apply the concept of Standard representation for, K- , and simplification functions using K-map.
CO4 To impart knowledge of checker/generator, codeconverters, priorityencoders, decoders/drivers for display devices.
CO5 To know about the ripple (Asynchronous) counters, synchronous counters.
CO6 To instruct about synchronous sequential counters, applications of counters.
CO7 To explain the mechanism of A/D converter, successive approximation A/D converter.
CO8 Gained a knowledge about Programmable logic devices (CPLDS), Field Programmable Gate Array(FPGA).
Mapping of Paper No – PCC-CSE-205

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S M S S S S S S S S S S S S S
CO4 S M S S M S S S S S S S S S S
CO5 M S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 S S S S S S M S S S M S S S S
S=Strong M=Medium W=Weak

REFERENCES:
1. Digital Electronics: Principles and Integrated Circuits: by Maini, Wiley India Ltd.
2. R. P. Jain, "Modern Digital Electronics", McGraw Hill Education, 2009.
3. M. M. Mano, "Digital logic and Computer design", Pearson Education India, 2016.
4. A. Kumar," Fundamentals of Digital Circuits”, Prentice Hall India, 2016.
 Python Programming

Course code PCC-CSE-207

Category Professional Core Course

Course title Python Programming
L T P Credits
Scheme and Credits Semester 3
2 0 0 2
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Objectives of the course:

 To impart the basic concepts of Python programming.

 To understand syntax of Python language
 To create dynamic applications in Python language.
 To implement object oriented concepts using Python language

Detailed contents:
Unit 1:
Introduction: Fundamental ideas in computer science; modern computer systems, installing Python; basic syntax, interactive shell,
editing, saving, and running a script; The concept of data types; variables, assignments; numerical types; arithmetic operators and
expressions; comments in the program; understanding error messages; Control statements: if-else, loops (for, while)
 Unit 2:
Strings, text files: String manipulations: subscript operator, indexing, slicing a string; strings and number system: converting strings to
numbers and vice versa. Binary, octal, hexadecimal numbers; text files: reading/writing text and numbers from/to a file; creating and
reading a formatted file (csv or tab-separated).
Unit 3:
Lists, dictionary and Design with functions: Basic list operators, replacing, inserting, removing an element; searching and sorting
lists; dictionary literals, adding, and removing keys, accessing and replacing values; traversing dictionaries. Hiding redundancy,
complexity; arguments and return values; Program structure and design. Recursive functions.
Unit 4:
Object Oriented concepts: Classes and OOP: classes, objects, attributes and methods; defining classes; design with classes, data
modelling; persistent storage of objects, Inheritance, polymorphism, operator overloading; abstract classes; exception handling, try
block.

Course Outcomes:
CO1 To introduce the concept of modern computer systems, installing Python; basic syntax.
CO2 To describe understanding error messages; Control statements: if-else, loops (for, while).
CO3 To apply the concept of String manipulations: subscript operator, indexing.
CO4 To impart knowledge of text files: reading/writing text.
CO5 To know about the replacing, inserting, removing an element.
CO6 To instruct about the Program structure and design.
CO7 To explain the mechanism of defining classes; design with classes.
CO8 Gained knowledge about polymorphism, operator overloading; abstract classes.

Mapping of Paper No – PCC-CSE-207

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S M S S S S S S S M S M S S M
CO3 S S S S S S S M S S S S S S S
CO4 S S S S S S S S S S S S S S S
CO5 M M S S S S S S M S S S S S S
 CO6 S S S S S S S S S M S S S S M
CO7 S S S S M S M S S S S S S S S
CO8 S S S S S S M S S S M S S S S
S=Strong M=Medium W=Weak

Suggested books:
1. “Fundamentals of Python: First Programs” Kenneth Lambert, Course Technology, Cengage Learning, 2012

Suggested reference books:

1. “Introduction to Computer Science Using Python: A Computational Problem-Solving Focus”,By Charles Dierbach, John Wiley &
Sons, December 2012,
 Mathematics-III (Multivariable Calculus and Differential Equations)

Course code BSC-MATH-203

Category Basic Science Course

Course title Mathematics-III (Multivariable Calculus and Differential Equations)
Scheme and Credits L T P Credits Semester 3
2 0 2
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Objectives of the course:

 To impart the basic concepts of Homogeneous functions

 To understand Double integral &Change of order of integration.
 To understand Ordinary Differential Equations of first order.
 To implement applications of linear differential equations to oscillatory electric circuits.

Unit-I
Multivariable Differential Calculus: Limit, Continuity and Partial derivatives, Homogeneous functions, Euler’s Theorem, Total
derivative, Maxima, Minima and Saddle points, Lagrange’s method of undetermined multipliers
 Unit-II
Multivariable Integral Calculus: Double integral, Change of order of integration, Change of variables, Applications of double
integral to find area enclosed by plane curves, Triple integral

Unit-III
Ordinary Differential Equations of first order: Linear and Bernoulli’s equations, Exact differential equations, Equations reducible to
exact differential equations, Applications of differential equations of first order and first degree to simple electric circuits, Newton’s
law of cooling, Heat flow and Orthogonal trajectories

Unit-IV
Ordinary Differential equations of second and higher order: Linear differential equations of second and higher order, Complete
solution, Complementary function and Particular integral, Method of variation of parameters to find particular integral, Cauchy’s and
Legendre’s linear equations, Simultaneous linear differential equations with constant coefficients, Applications of linear differential
equations to oscillatory electric circuits

Course Outcomes:
CO1 To introduce the concept of Limit, Continuity and Partial derivatives.
CO2 To describe the factors various Minima and Saddle points.
CO3 To apply the concept of Change of variables, Applications of double integral.
CO4 To impart knowledge of Applications of double integral to find area enclosed by plane curves.
CO5 To know about the equations, Exact differential equations.
CO6 To know about the Heat flow and Orthogonal trajectories.
CO7 To explain the Complementary function and Particular integral.
CO8 Gained a knowledge about Cauchy’s and Legendre’s linear equations.
Mapping of Paper No – BSC-MATH-203

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S M S S M
CO3 S M S S S S S M S S S S S M S
CO4 S S S S S S S S S S S S S S S
CO5 S S S S S S S S M S S S S S S
CO6 S S S S S M S S S S S S S S S
CO7 S S S M S S M S S S S S S S S
CO8 S S S S S S S S S S M S S S S
S=Strong M=Medium W=Weak

Reference Books:
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, Pearson Education.
2. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons.
3. B. V. Ramana, Higher Engineering Mathematics, Tata McGraw-Hill Publishing Company Limited.
4. N. P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications.
5. B. S. Grewal, Higher Engineering Mathematics, Khanna Publishers.
6. W. E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value Problems,Wiley India.
7. S. L. Ross, Differential Equations, Wiley India.
8. E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall India.
9. E. L. Ince, Ordinary Differential Equations, Dover Publications
 ECONOMICS FOR ENGINEERS
Course code HSMC- 01
Category Humanities/ Social Sciences/ Management
Course title Economics For Engineers
L T P Credits
Scheme and Credits
3 0 0 3
Branches (B. Tech.) Common For All Branches

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours
Course Objectives:
1. Acquaintthestudentstobasicconceptsofeconomicsandtheiroperationalsignificance.
2. To stimulate the students to think systematically and objectively about contemporary economicproblems.
UNIT-1
Definition of Economics- Various definitions, types of economics- Micro and Macro Economics, nature of economic problem,
Production Possibility Curve, Economic laws and their nature, Relationship between Science, Engineering, Technology and Economic
Development. Demand- Meaning of Demand, Law of Demand, Elasticity of Demand- meaning, factors effecting it, its practical
application and importance
UNIT 2
Production- Meaning of Production and factors of production, Law of variable proportions, and Returns to scale, internal external
economies and diseconomies of scale. Various concepts of cost of production- Fixed cost, Variable cost, Money cost, Real cost,
Accounting cost, Marginal cost, Opportunity cost. Shape of Average cost, Marginal cost, Total cost etc. in short run and long run.
UNIT-3
Market- Meaning of Market, Types of Market- Perfect Competition, Monopoly, Monopolistic Competition and Oligopoly (main
features).Supply- Supply and law of supply, Role of demand & supply in price determination and effect of changes in demand and
supply on prices.
 UNIT-4

Indian Economy- Nature and characteristics of Indian economy as under developed, developing and mixed economy (brief and elementary
introduction), Privatization - meaning, merits and demerits. Globalization of Indian economy – merits and demerits. Banking- Concept of a
Bank, Commercial Bank- functions, Central Bank- functions, Difference between Commercial & Central Bank.

Course Outcomes:
CO1 To introduce the concept of Data Abstraction & Data Independence.
CO2 To describe the factors various Data base Models.
CO3 To apply the concept of Relational query Languages.
CO4 To impart knowledge of Query Processing optimization with the help of Algorithms.
CO5 To know about the storage strategies including Hashing.
CO6 To instruct about the Transaction Processing.
CO7 To explain the mechanism of Database Security & Authentication.
CO8 Gained knowledge about Object oriented and object relational databases.

Mapping of Paper No – HSMC- 01

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S S S S S S S S S S M
CO3 S M S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 M S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S M S S M S S S M S S S S
CO8 S S S S S S M S S S M S S S S
S=Strong M=Medium W=Weak
REFERENCES:
1. JainT.R. EconomicsforEngineers, VKPublication.
2. Fundamentals of Engineering Economics by Kumar, Wiley India Pvt. Ltd.
3. Chopra P.N., PrincipleofEconomics, KalyaniPublishers.
4. Dewett K.K., Moderneconomictheory, S.Chand.
5. H. L. Abuja., Modern economic theory, S.Chand.
6. Dutt Rudar & Sundhram K.P.M., Indian Economy.
7. Mishra S. K., Modern Micro Economics, PragatiPublications.
8. Singh Jaswinder, Managerial Economics, dream tech press.
9. A Text Book of Economic Theory Stonier and Hague(Longman’sLandon).
10. Micro Economic Theory–M.L. Jhingan (S.Chand).
11. Micro Economic Theory-H.L.Ahuja (S.Chand).
12. Modern Micro Economics: S.K.Mishra (PragatiPublications).
13. Economic Theory-A.B.N.Kulkarni & A.B.Kalkundrikar(R.Chand& Co).
 Database Management System Lab
Course code LC-CSE-209
Category Professional Core Course
Course title Database Management System Lab
L T P Credits
Scheme and Credits
0 0 4 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours
Course Objectives:
1. Keep abreast of current developments to continue their own professional development
2. To engage themselves in lifelong learning of Database management systems theories and technologies this enables them to purse higher
studies.
3. To interact professionally with colleagues or clients located abroad and the ability to overcome challenges that arises from geographic
distance, cultural differences, and multiple languages in the context of computing.
4. Develop team spirit, effective work habits, and professional attitude in written and oral forms, towards the development of database
applications.
Contents:
i. Creation of a database and writing SQL queries to retrieve information from the database.
ii. Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records based on conditions.
iii. Creation of Views, Synonyms, Sequence, Indexes, Save point.
iv. Creating an Employee database to set various constraints.
v. Creating relationship between the databases.
vi. Study of PL/SQL block.
vii. Write a PL/SQL block to satisfy some conditions by accepting input from the user.
viii. Write a PL/SQL block that handles all types of exceptions.
ix. Creation of Procedures.
x. Creation of database triggers and functions
xi. Mini project (Application Development using Oracle/ MySQL)
 a) Inventory Control System
b) Material Requirement Processing.
c) Hospital Management System.
d) Railway Reservation System.
e) Personal Information System.
f) Web Based User Identification System.
g) Time Table Management System.
h) Hotel Management

Course Outcomes:
CO1 To introduce the concept of Data Abstraction & Data Independence.
CO2 To describe the factors various Data base Models.
CO3 To apply the concept of Relational query Languages.
CO4 To impart knowledge of Query Processing optimization with the help of Algorithms.
CO5 To know about the storage strategies including Hashing.
CO6 To instruct about the Transaction Processing.
CO7 To explain the mechanism of Database Security & Authentication.
CO8 Gained a knowledge about Object oriented and object relational databases.

Mapping of Paper No. LC-CSE-209

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S M M S S S S
CO2 M S S S S M S S S S S S S S M
CO3 S S S S M S S M S S S S S S S
CO4 S S S S M S S S S S S S S S S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S S S S S S S S S S M
CO7 S M S M S S M S S S S S S S S
CO8 S S S M S S M S S S S S S S S
S=Strong M=Medium W=Weak
 Digital Electronics Lab
Course code LC-CSE-211
Category Professional Core Course
Course title Digital Electronics Lab
L T P Credits
Scheme and Credits 4 Semester-3
0 0 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Objectives of the course:

1. To impart the basic concepts of Digital signals, digital circuits, AND, OR, NOT, NAND, NOR gate.
2. To understand basic concepts about the circuit properties of Bi stable latch, the clocked SR flip flop.

Implementation all experiments with help of Bread- Board.

1. Study of Logic Gates: Truth-table verification of OR, AND, NOT, XOR, NAND and NOR gates; Realization of OR, AND, NOT
and XOR functions using universal gates.
2. Half Adder / Full Adder: Realization using basic and XOR gates.
3. Half Subtractor / Full Subtractor: Realization using NAND gates.
4. 4-Bit Binary-to-Gray & Gray-to-Binary Code Converter: Realization using XOR gates.
5. 4-Bit and 8-Bit Comparator: Implementation using IC7485 magnitude comparator chips.
6. Multiplexer: Truth-table verification and realization of Half adder and Full adder.
7. Demultiplexer: Truth-table verification and realization of Half subtractor and Full subtractor.
8. Flip Flops: Truth-table verification of JK Master Slave FF, T-type and D-type FF.
9. Asynchronous Counter: Realization of 4-bit up counter and Mod-N counter.
10. Synchronous Counter: Realization of 4-bit up/down counter and Mod-N counter.
11. Shift Register: Study of shift right, SIPO, SISO, PIPO, PISO & Shift left operations.
 12. DAC Operation: Study of 8-bit DAC, obtain staircase waveform.
13. ADC Operations: Study of 8-bit ADC

Course Outcomes:
CO1 To introduce the concept Boolean algebra, examples of IC gates, number.
CO2 To describe the arithmetic, codes, error detecting and correcting codes.
CO3 To apply the concept of Standard representation for, K- , and simplification functions using K-map.
CO4 To impart knowledge of checker/generator, codeconverters, priorityencoders, decoders/drivers for display devices.
CO5 To know about the ripple (Asynchronous) counters, synchronous counters.
CO6 To instruct about synchronous sequential counters, applications of counters.
CO7 To explain the mechanism of A/D converter, successive approximation A/D converter.
CO8 Gained a knowledge about Programmable logic devices (CPLDS), Field Programmable Gate Array(FPGA).

Mapping of Paper No – LC-CSE-211

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 S S S S S S M S S S M S S S S
S= Strong M=Medium W=Weak
 Data Structures and Algorithms Lab Using C

Course code LC-CSE-213

Category Professional Core Course
Course title Data Structures and Algorithms Lab Using C
L T P Credits
Scheme and Credits Semester-3
0 0 4 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Objectives of the course:

1. To impart the basic concepts of data structures and algorithms.
2. To understand concepts about searching and sorting techniques

Data Structures Lab List of practical exercises, to be implemented using object-oriented approach in C++ Language.
1. Write a menu driven program that implements following operations (using separate functions) on a linear array:
 Insert a new element at end as well as at a given position
 Delete an element from a given whose value is given or whose position is given
 To find the location of a given element
 To display the elements of the linear array
2. Write a menu driven program that maintains a linear linked list whose elements are stored in on ascending order and implements
the following operations (using separate functions):
 Insert a new element
 Delete an existing element
  Search an element
 Display all the elements
3. Write a program to demonstrate the use of stack (implemented using linear array) in converting arithmetic expression from
infix notation to postfix notation.
4. Program to demonstrate the use of stack (implemented using linear linked lists) in evaluating arithmetic expression in
postfix notation.
5. Program to demonstration the implementation of various operations on a linear queue represented using a linear array.
6. Program to demonstration the implementation of various operations on a circular queue represented using a linear array.
7. Program to demonstration the implementation of various operations on a queue represented using a linear linked list
(linked queue).
8. Program to illustrate the implementation of different operations on a binary search tree.
9. Program to illustrate the traversal of graph using breadth-first search
10. Program to illustrate the traversal of graph using depth-first search.
11. Program to sort an array of integers in ascending order using bubble sort.
12. Program to sort an array of integers in ascending order using selection sort.
13. Program to sort an array of integers in ascending order using insertion sort.
14. Program to sort an array of integers in ascending order using radix sort.
15. Program to sort an array of integers in ascending order using merge sort.
16. Program to sort an array of integers in ascending order using quick sort.
17. Program to sort an array of integers in ascending order using heap sort.
18. Program to sort an array of integers in ascending order using shell sort.
19. Program to demonstrate the use of linear search to search a given element in an array.
20. Program to demonstrate the use of binary search to search a given element in a sorted array in ascending order.

Course Outcomes:
CO1 To introduce the concept of Choice of right Data Structure, Algorithms.
CO2 To describe the factors Linear Search and Binary Search Techniques.
CO3 To apply the concept Algorithms and their complexity analysis.
CO4 To impart knowledge of Priority Queue; Operations on each types of Queues.
CO5 To know about the operations their algorithms and the complexity analysis.
CO6 To instruct about the Applications of Binary Trees.
CO7 To explain the mechanism Selection Sort, Bubble Sort.
CO8 Gained a knowledge about traversal algorithms and complexity analysis.

Mapping of Paper No – LC-CSE-213

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S M S S S S S M S S S M S
CO4 M S S S M S S S S M S S S S S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S S S S S S S S S S S
CO7 S S S S S S S S S S M S S S S
CO8 S M S S S S M S S S M S S S S
S=Strong M=Medium W=Weak
 Python Programming Lab
Course code LC-CSE-215
Category Professional Core Course
Course title Python Programming Lab
L T P Credits
Scheme and Credits Semester-3
0 0 2 1
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Objectives
 To write, test, and debug simple Python programs.
 To implement Python programs with conditionals and loops.
 Use functions for structuring Python programs.
 Represent compound data using Python lists, tuples, and dictionaries.
 Read and write data from/to files in Python.
List of Programs
1. Compute the GCD of two numbers.
2. Find the square root of a number (Newton‘s method)
3. Exponentiation (power of a number)
4. Find the maximum of a list of numbers
5. Linear search and Binary search
6. Selection sort, Insertion sort
7. Merge sort
8. First n prime numbers
9. Multiply matrices
 10. Programs that take command line arguments (word count)
11. Find the most frequent words in a text read from a file
12. Simulate elliptical orbits in Pygame
13. Simulate bouncing ball using Pygame

Course Outcomes:
CO1 To introduce the concept of modern computer systems, installing Python; basic syntax.
CO2 To describe understanding error messages; Control statements: if-else, loops (for, while).
CO3 To apply the concept of String manipulations: subscript operator, indexing.
CO4 To impart knowledge of text files: reading/writing text.
CO5 To know about the replacing, inserting, removing an element.
CO6 To instruct about the Program structure and design.
CO7 To explain the mechanism of defining classes; design with classes.
CO8 Gained knowledge about polymorphism, operator overloading; abstract classes.

Mapping of Paper No – LC-CSE-215

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S M S S S S S S S S M S S S M
CO3 S S S M S S S M S S S S S S S
CO4 M S S S S S S S S S S S S S S
CO5 S M S S S S S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 S S S S S S M S S S S S S S S
S=Strong M=Medium W=Weak
 Discrete Mathematics

Course code PCC-CSE-202

Category Professional Core Course
Course title Discrete Mathematics
Scheme and Credits L T P Credits Semester - 4
3 1 4
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Objectives of the course:

 To impart the basic concepts of Sets, Relation, Function and Propositional Logic
 To understand Basic Counting Techniques and Recurrence Relation
 To Understand Definitions and examples of Algebraic Structures with one Binary Operation.
 To implement Graphs and their properties, Degree, Connectivity.

Unit-I
Sets, Relation, Function and Propositional Logic: Operations and Laws of Sets, Cartesian Products, Representation of relations,
Binary Relation, Equivalence Relation, Partial Ordering Relation, POSET, Hasse Diagram, Lattices and its types, Function, Bijective
functions, Inverse and Composite Function, Finite and infinite Sets, Countable and Uncountable Sets, Cantor's diagonal argument and
 The Power Set theorem, Schroeder-Bernstein theorem, Propositions, Logical operations, Conditional Statements, Tautologies,
Contradictions, Logical Equivalence, The use of Quantifiers

Unit-II
Basic Counting Techniques and Recurrence Relation: Pigeon-hole principle, Permutation and Combination, the Division algorithm:
Prime Numbers, The GCD: Euclidean Algorithm, The Fundamental Theorem of Arithmetic., Linear recurrence relation with constant
coefficients, Homogenous Solutions, Particular Solutions, Total Solutions, Solving recurrence relation using generating functions

Unit-III
Algebraic Structures: Definitions and examples of Algebraic Structures with one Binary Operation: Semi Groups, Monoids, Groups;
Congruence Relation and Quotient Structures, Permutation Groups, Cyclic groups, Normal Subgroups, Definitions and examples of
Algebraic Structures with two Binary Operation: Rings, Integral Domain, Fields; Boolean Algebra and Boolean Ring, Identities of
Boolean Algebra, Duality, Representation of Boolean Function, Disjunctive and Conjunctive Normal Form
Unit-IV
Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub Graph, Bi- connected component and
Articulation Points, Isomorphism, Multigraph and Weighted graph, Shortest path in Weighted graphs, Eulerian paths and circuits,
Hamiltonian path and circuits, Planar Graphs, Euler’s formulae, Graph Colouring, Trees, Binary trees and its traversals, Trees Sorting,
Spanning tree, Minimal Spanning tree

Course Outcomes:
CO1 To understand the concept of Partial OrderingRelation, POSET, Lattices and its types.
CO2 To describe the factors Contradictions, Logical Equivalence, The use of Quantifiers.
CO3 To apply the concept of , Permutation and Combination, the Division algorithm.
CO4 To impart knowledge of Homogenous Solutions, Particular Solutions, Total Solutions.
CO5 To know about the Structures with one Binary Operation.
CO6 To instruct about the Boolean Function, Disjunctive and Conjunctive Normal Form.
CO7 To explain the mechanism of Connectivity, Path, Cycle, Sub Graph.
CO8 Gained a knowledge about PlanarGraphs, Euler’s formulae, Graph Colouring,
Mapping of Paper No – PCC-CSE-202

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S S S M S S S
CO2 S M S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S S S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S S S S S S S S S S M
CO7 M S S S S S M S S S M S S S S
CO8 S S S M S S S S S S M S S S S
S=Strong M=Medium W=Weak

Reference Books:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
2. Satinder Bal Gupta: A Text Book of Discrete Mathematics and Structures, University Science Press, Delhi.
3. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics A Computer Oriented Approach, Tata McGraw – Hill.
4. J.P. Tremblay and R. Manohar, Discrete mathematical structures with applications tocomputer science, TMG Edition,
TataMcgraw-Hill
5. Discrete Mathematics, SemyourLipschutz and Marc Lipson, Schaum’s outline
 Computer Organization & Architecture
Course code PCC-CSE-204
Category Professional Core Course
Course title Computer Organization & Architecture
L T P Credits
Scheme and Credits Semester-IV
3 0 0 3
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Objectives of the course:

To expose the students to the following:
 How Computer Systems work & the basic principles
 Instruction Level Architecture and Instruction Execution
 The current state of art in memory system design
 How I/O devices are accessed and its principles.
 To provide the knowledge on Instruction Level Parallelism
 To impart the knowledge on micro programming
 Concepts of advanced pipelining techniques.
Unit 1
Functional blocks of a computer: CPU, memory, input-output subsystems, control unit. Instruction set architecture of a CPU–
registers, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set. Case study – instruction sets
 of some common CPUs.
Data representation: signed number representation, fixed and floating point representations, character representation. Computer
arithmetic – integer addition and subtraction, ripple carry adder, carry look-ahead adder, etc. multiplication – shift-and add, Booth
multiplier, carry save multiplier, etc. Division restoring and non-restoring techniques, floating point arithmetic.

Unit 2
Introduction to x86 architecture.
CPU control unit design: hardwired and micro-programmed design approaches, Case study – design of a simple hypothetical CPU.
Memory system design: semiconductor memory technologies, memory organization.
Peripheral devices and their characteristics: Input-output subsystems, I/O device interface, I/O transfers–program controlled,
interrupt driven and DMA, privileged and non-privileged instructions, software interrupts and exceptions. Programs and processes–role
of interrupts in process state transitions, I/O device interfaces – SCII, USB
Unit 3
Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards.
Parallel Processors: Introduction to parallel processors, Concurrent access to memory and cache coherency.
Unit 4
Memory organization: Memory interleaving, concept of hierarchical memory organization, cache memory, cache size vs. block size,
mapping functions, replacement algorithms, write policies.

Course Outcomes:
CO1 Learned the concept of RTL interpretation of instructions, addressing modes.
CO2 Know the factors of instruction set, Case study – instruction sets of some common CPUs.
CO3 To apply the concept of memory technologies, memory organization.
CO4 To impart knowledge of Programs and processes–role of interrupts in process state transitions.
CO5 To know about the speedup, pipeline hazards.
CO6 To instruct about the Introduction to parallel processors.
CO7 To explain the mechanism of concept of hierarchical memory organization,.
CO8 Gained knowledge about hierarchical memory organization, cache memory.
Mapping of Paper No – PCC-CSE-204

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S M S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S M S S S S S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S S S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 M S S S S S M S S S S S S S S
S=Strong M=Medium W=Weak

Suggested books:
1) “Computer System Architecture”, 3rd Edition by M. Morris Mano, Pearson.
2) Computer System Architecture and Organization: by Usha, Wiley India Ltd.
3) “Computer Organization and Design: The Hardware/Software Interface”, 5th Edition by David
A. Patterson and John L. Hennessy, Elsevier.
4) “Computer Organization and Embedded Systems”, 6th Edition by Carl Hamacher, McGrawHill Higher Education.
Suggested reference books:
1) “Computer Architecture and Organization”, 3rd Edition by John P. Hayes, WCB/McGraw-Hill
2) “Computer Organization and Architecture: Designing for Performance”, 10th Edition byWilliam Stallings, Pearson Education.
3) “Computer System Design and Architecture”, 2nd Edition by Vincent P. Heuring and Harry
F. Jordan, Pearson Education.
 Operating System
Course code PCC-CSE-206

Category Professional Core Course

Course title Principles of Operating System
L T P Credits
Scheme and Credits Semester-4
3 0 0 3
Branches (B. Tech.) Computer Science and Engineering

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.

Objectives of the course:

To expose the students to the following:
 How Computer Operating Systems, Generations of Operating systems works.
 Benefits of threads, Types of threads, Multithreading.
 The current state of Mutual Exclusion, The Producer\Consumer Problem.
 How Basic concept, Logical and Physical address map works.

UNIT 1:
Introduction: Concept of Operating Systems, Generations of Operating systems, Types of Operating Systems, OS Services, System
Calls, Structure of an OS-Layered, Monolithic, Microkernel Operating Systems, Concept of Virtual Machine.
Processes: Definition, Process Relationship, Different states of a Process, Process State transitions, Process Control Block (PCB),
Context switching. Thread: Definition, Various states, Benefits of threads, Types of threads, Multithreading.
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers, Scheduling criteria: CPU utilization, Throughput,
 Turnaround Time, Waiting Time, Response Time; Scheduling algorithms: Pre-emptive and Non-pre-emptive, FCFS, SJF, SRTF, RR
Scheduling.

UNIT 2:
Inter-process Communication: Critical Section, Race Conditions, Mutual Exclusion, The Producer\ Consumer Problem, Semaphores,
Event Counters, Monitors, Message Passing, Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem etc.
Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock Prevention, and Deadlock Avoidance:
Banker’s algorithm, Deadlock detection and Recovery.

UNIT 3:
Memory Management: Basic concept, Logical and Physical address map, Memory allocation: Contiguous Memory allocation
– Fixed and variable partition–Internal and External fragmentation and Compaction; Paging: Principle of operation – Page allocation
– Hardwaresupport for paging, Protection and sharing, Disadvantages of paging.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of reference, Page fault,
Working Set, Dirty page/Dirty bit – Demand paging, Page Replacement algorithms: Optimal, First in First out (FIFO), Optimal Page
Replacement and Least Recently used (LRU).
UNIT 4:
I/O Hardware: I/O devices, Device controllers, Direct memory access Principles of I/O Software: Goals of Interrupt handlers, Device
drivers, Device independent I/O software, Secondary-Storage Structure: Disk structure, Disk scheduling algorithms
File Management: Concept of File, Access methods, File types, File operation, Directory structure, File System structure, Allocation
methods (contiguous, linked, indexed), efficiency and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk reliability, Disk formatting, Boot-block,
Bad blocks. Case study on UNIX and WINDOWS Operating System.

Course Outcomes:
CO1 To introduce the concept of Operating Systems, Concept of Virtual Machine.
CO2 To describe Scheduling algorithms: Pre-emptive and Non-pre-emptive.
CO3 To apply the concept of Event Counters, Monitors, Message Passing.
CO4 To impart knowledge of Locality of reference, Page fault.
CO5 To know about the Memory allocation: Contiguous Memory.
CO6 To instruct about the Demand paging, Page Replacement algorithms.
CO7 To explain the mechanism of I/O devices, Device controllers.
CO8 Gained knowledge about File operation, Directory structure.
Mapping of Paper No – PCC-CSE-206

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 S S S S S S M S S S M S S S S
S=Strong M=Medium W=Weak

Suggested books:
1. Operating System Concepts Essentials, 9th Edition by AviSilberschatz, Peter Galvin, Greg Gagne, Wiley Asia Student
Edition.
2. Operating Systems: Internals and Design Principles, 5th Edition, William Stallings, Prentice Hall of India.
Suggested reference books:
1. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin Publishing
2. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-Wesley
3. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of India
4. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati, O'Reilly and Associates
 Object Oriented Programming
Course code PCC-CSE-208

Category Professional Core Course

Course title Object Oriented Programming
L T P Credits
Scheme and Credits Semester-4
3 0 0 3
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.
Objectives of the course:
To expose the students to the following:
 How Object-Oriented Programming Concepts works.
 Creating class objects, accessing class members.
 Concept of binding - early binding and late binding.

Unit - I
Object-Oriented Programming Concepts: Introduction, comparison between procedural programming paradigm and object-oriented
programming paradigm, basic concepts of object- oriented programming — concepts of an object and a class, interface and
implementation of a class, operations on objects, relationship among objects, abstraction, encapsulation, data hiding, inheritance,
overloading, polymorphism, messaging.
Classes and Objects: Specifying a class, creating class objects, accessing class members, access specifiers, static members, use of
const keyword, friends of a class, empty classes, nested classes, local classes, abstract classes, container classes, bit fields and classes.
 Unit - II
Inheritance: Introduction, defining derived classes, forms of inheritance, ambiguity in multiple and multipath inheritance, virtual base
class, object slicing, overriding member functions, object composition and delegation, order of execution of constructors and
destructors.
Pointers and Dynamic Memory Management: Declaring and initializing pointers, accessing data through pointers, pointer arithmetic,
memory allocation (static and dynamic), dynamic memory management using new and delete operators, pointer to an object, this
pointer, pointer related problems - dangling/wild pointers, null pointer assignment, memory leak and allocation failures.

Unit - III
Constructors and Destructors: Need for constructors and destructors, copy constructor, dynamic constructors, explicit constructors,
destructors, constructors and destructors with static members, initializer lists.
Operator Overloading and Type Conversion: Overloading operators, rules for overloading operators, overloading of various
operators, type conversion - basic type to class type, class type to basic type, class type to another class type.
Virtual functions & Polymorphism: Concept of binding - early binding and late binding, virtual functions, pure virtual functions,
abstract classes, virtual destructors.
Unit - IV
Exception Handling: Review of traditional error handling, basics of exception handling, exception handling mechanism, throwing
mechanism, catching mechanism, rethrowing an exception, specifying exceptions.
Templates and Generic Programming: Template concepts, Function templates, class templates, illustrative examples.

Course Outcomes:
CO1 To introduce the concept of interface and implementation of a class.
CO2 To describe the nested classes, local classes, abstract classes.
CO3 To apply the concept of ambiguity in multiple and multipath inheritance.
CO4 To impart knowledge of accessing data through pointers.
CO5 To know about the copy constructor, dynamic constructors.
CO6 To instruct about the basic type to class type, class type to basic type.
CO7 To explain the mechanism of, basics of exception handling.
CO8 Gained a knowledge about Function templates, class templates.
Mapping of Paper No – PCC-CSE-206

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 M S S S S S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 S S M S S S S S S S M S S S S
S=Strong M=Medium W=Weak
TEXT BOOKS, AND/OR REFERENCE MATERIAL:
1. Bjrane Stroustrup, “C++ Programming language”,3rd edition, Pearson education Asia(1997)
2. Object-Oriented Programming in C++, by Shukla, Wiley India Ltd.
3. LaforeR.”Object oriented Programming in C++”, 4th Ed. Tech media, New Delhi (2002).
4. Yashwant Kenetkar,” Let us C++”,1stEd.,Oxford University Press(2006)
5. B.A. Forouzan and R.F. Gilberg, Compiler Science, ”A structured approach using C++” Cengage Learning, New Delhi
 ORGANIZATIONAL BEHAVIOUR
Course code HSMC-02
Category
Course title ORGANIZATIONAL BEHAVIOUR
Scheme and Credits L T P Credits
3 0 0 3
Branches (B. Tech.)

Class work 25
Exam 75
Total 100 Marks
Duration of Exam 03 Hours

The objective of this course is to expose the students to basic concepts of management and provide insights necessary to understand
behavioral processes at individual, team and organizational level.
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to
attempt five questions in total, first being compulsory and selecting one from each unit.
Objectives of the course:
To expose the students to the following:
 Defining scope of management & Importance of management.
 Concept of Meaning and process of Organization.
 Concept of Interpersonal Processes- Teams and Groups.
UNIT - 1
Introduction of Management- Meaning, definitions, nature of management; Managerial levels, skills and roles in an organization;
Functions of Management: Planning, Organizing, staffing, Directing & Controlling, Interrelationship of managerial functions, scope
of management & Importance of management. Difference between management and administration.
 UNIT - 2
Introduction of organization:-Meaning and process of Organization, Management v/s Organization; Fundamentals of
Organizational Behavior: Concepts, evolution, importance and relationship with other Fields; Contemporary challenges and
opportunities of OB. Individual Processes and Behavior-Personality- Concept, determinants and applications; Perception- Concept,
process and applications, Learning- Concept (Brief Introduction) ; Motivation- Concept, techniques and importance
UNIT - 3
Interpersonal Processes- Teams and Groups- Definition of Group, Stages of group development, Types of groups, meaning of
team, merits and demerits of team; difference between team and group, Conflict- Concept, sources, types, management of
conflict; Leadership: Concept, function, styles & qualities of leadership.

Communication – Meaning, process, channels of communication, importance and barriers of communication.

UNIT 4
Organizational Processes: Organizational structure - Meaning and types oforganizational structure and their effect on human
behavior; Organizational culture - Elements, types and factors affecting organizational culture. Organizational change:
Concept, types & factors affecting organizational change, Resistance to Change.

Course Outcomes:
CO1 To introduce the concept Functions of Management: Planning, Organizing
CO2 To describe process of Organization, Management v/s Organization.
CO3 To apply the concept of Individual Processes and Behavior-Personality.
CO4 To impart knowledge of Motivation- Concept, techniques and importance
CO5 To know about the Definition of Group, Stages of groupdevelopment
CO6 To instruct Leadership: Concept, function, styles & qualities of leadership.
CO7 To explain the Meaning and types oforganizational structure
CO8 Gained a knowledge about : Concept, types & factors affecting organizational change
Mapping of Paper No – HSMC-02

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S M S S S M S S S M S S S S M
CO3 S S S S S S S M S S S S S S S
CO4 S S S S S S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S S S S S S S S S S M
CO7 M S S S S S M S S S M S S S S
CO8 S S S S M S M S S S M S S S S

S=Strong M=Medium W=Weak

Suggested Books:
1. Robbins, S.P. and Decenzo, D.A. Fundamentals of Management, Pearson Education Asia, NewDelhi.
2. Organizational Behavior, 12ed, by Schermhorn, Wiley India Ltd
3. Stoner, J et. al, Management, New Delhi, PHI, New Delhi.
4. Satya Raju, Management – Text & Cases, PHI, New Delhi.
5. Organizational Behaviour: Design, Structure and Culture, 2ed by Gupta, Wiley India Ltd.
6. Kavita Singh, OrganisationalBehaviour: Text and cases. New Delhi: Pearson Education.
7. Pareek, Udai, Understanding Organisational Behaviour, Oxford University Press, New Delhi.
8. Robbins, S.P. & Judge, T.A., Organisational Behaviour, Prentice Hall of India, New Delhi.
9. Ghuman Karminder, Aswathappa K., Management concept practice and cases, Mc Graw Hilleducation.
10. Chhabra T. N., Fundamental of Management, Sun India Publications-New Delhi.
 Web Technologies
Course code LC-CSE-210

Category Professional Core Course

Course title Web Technologies
L T P Credits
Scheme and Credits
2 0 0 1

Branches (B. Tech.) Computer Science and Engineering

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each
from all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have
to attempt five questions in total, first being compulsory and selecting one from each unit.
Objectives of the course:
 To impart the basic concepts of Web Technologies
 To understand various client side technologies
 To create web pages
 To create dynamic applications on web through server side technologies

Detailed contents:

Unit 1:
Introduction: Concept of Internet- History of Internet, Protocols of Internet, World Wide Web, URL, Web Server, Web Browser,
HTML, HTTP, SMTP, POP3, MIME, IMAP.
Web site design principles, planning the site and navigation,
 Unit 2:
HTML and CSS: History of HTML, Structure of HTML Document: Text Basics, Document: Images and Multimedia, Links and
webs, Document Layout, Cascading Style Sheet: 4 Need for CSS, introduction to CSS, basic syntax and structure, using CSS,
background images, colors and properties, manipulating texts, using fonts, borders and boxes, margins, padding lists, positioning
using CSS,

Unit 3:
XML: Introduction of XML- Some current applications of XML, Features of XML, Anatomy of XML document, The XML
Declaration, Element Tags- Nesting and structure, XML text and text formatting element, Table element, Mark-up Element and
Attributes, Document Type Definition (DTD), types. XML Objects, Checking Validity, Understanding XLinks, XPointer, Event-
driven Programming, XML Scripting.

Unit 4:
PHP: PHP Introduction, Structure of PHP, PHP Functions, AJAX with PHP, PHP Code and the Complete AJAX Example. AJAX
Database, Working of AJAX with PHP, Ajax PHP Database Form, AJAX PHP MySQL Select Query.

Course Outcomes:
CO1 To know Protocols of Internet, World Wide Web
CO2 To describe the planning the site and navigation.
CO3 To apply the concept Text Basics, Document: Images and Multimedia
CO4 To impart the Need for CSS, introduction to CSS,
CO5 To know about the current applications of XML, Features of XML
CO6 To instruct about the Mark-up Element and Attributes, Document.
CO7 To explain the mechanism of Structure of PHP, PHP Functions.
CO8 Gained knowledge Database Form, AJAX PHP MySQL Select Query.

Mapping of Paper No – LC-CSE-210

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S M S S S M S S S S S S S S M
 CO3 S S S S S S S M S S S S S M S
CO4 S S S M M S S S S S S S S M S
CO5 S S S S S S S S M S S S S S S
CO6 S S S S S S S S S S S S S S M
CO7 S S S S S S S S S S M S S S S
CO8 M S S S M S S S S S M S S S S
S=Strong M=Medium W=Weak

Suggested books:

1. Steven Holzner,”HTML Black Book”, Dremtech press.

2. Developing Web Applications, 2ed by Savaliya, Wiley India Ltd
3. Web Technologies, Black Book, Dreamtech Press
4. Web Applications : Concepts and Real World Design, Knuckles, Wiley-India
5. Web Technologies: HTML, JAVASCRIPT, PHP, JAVA, JSP, ASP.NET, XML and Ajax, Black Book by Kogent, Wiley India
Ltd.
6. Internet and World Wide Web How to program, P.J. Deitel& H.M. Deitel Pearson.

Suggested reference books:

1. Paul Deitel , Harvey Deitel, Abbey Deitel ,“Internet and world wide web – How to Program”, Prentice Hall
 Operating System Lab

Course code LC-CSE-212

Category Professional Core Course
Course title Operating System Lab
L T P Credits
Scheme and Credits
0 0 4 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours
Objectives of the course:
To expose the students to the following:
 How Computer Operating Systems, Generations of Operating systems works.
 Benefits of threads, Types of threads, Multithreading.

Contents:
1. 1 Introduction to UNIX File System.
2. File and Directory Related Commands in UNIX.
3. Essential UNIX Commands for working in UNIX environment.
4. I/O Redirection and Piping
5. Introduction to VI Editors.
6. Introduction of Processes in UNIX
7. Communication in UNIX and AWK.
8. Introduction of the concept of Shell Scripting.
9. Decision and Iterative Statements in Shell Scripting.
10. Writing the Shall Scripts for unknown problems.
 Course Outcomes:
CO1 To introduce the concept of Operating Systems, Concept of Virtual Machine.
CO2 To describe Scheduling algorithms: Pre-emptive and Non-pre-emptive.
CO3 To apply the concept of Event Counters, Monitors, Message Passing.
CO4 To impart knowledge of Locality of reference, Page fault.
CO5 To know about the Memory allocation: Contiguous Memory.
CO6 To instruct about the Demand paging, Page Replacement algorithms.
CO7 To explain the mechanism of I/O devices, Device controllers.
CO8 Gained knowledge about File operation, Directory structure.

Mapping of Paper No – LC-CSE-212

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 S S S S S S M S S S M S S S S
S=Strong M=Medium W=Weak

Suggested Books:
1. UNIX Shell Programming by YashavantKanetkar.
2. UNIX Concepts and Applications by Sumitabha Das
 Object Oriented Programming Lab Using C++
Course code LC-CSE-214
Category Professional Core Course
Course title Object Oriented Programming Lab Using C++
L T P Credits
Scheme and Credits
0 0 4 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours
Objectives of the course:
To expose the students to the following:
 How Object-Oriented Programming Concepts works.
 Concept of binding - early binding and late binding.

Contents:
1. [Classes and Objects] Write a program that uses a class where the member functions are defined inside a class.
2. [Classes and Objects] Write a program that uses a class where the member functions are defined outside a class.
3. [Classes and Objects] Write a program to demonstrate the use of static data members.
4. [Classes and Objects] Write a program to demonstrate the use of const data members.
5. [Constructors and Destructors] Write a program to demonstrate the use of zero argument and parameterized constructors.
6. [Constructors and Destructors] Write a program to demonstrate the use of dynamic constructor.
7. [Constructors and Destructors] Write a program to demonstrate the use of explicit constructor.
8. [Initializer Lists] Write a program to demonstrate the use of initializer list.
9. [Operator Overloading] Write a program to demonstrate the overloading of increment and decrement operators.
10. [Operator Overloading] Write a program to demonstrate the overloading of binary arithmetic operators.
11. [Operator Overloading] Write a program to demonstrate the overloading of memory management operators.
12. [Inheritance] Write a program to demonstrate the multilevel inheritance.
13. [Inheritance] Write a program to demonstrate the multiple inheritance.
 14. [Inheritance] Write a program to demonstrate the virtual derivation of a class.
15. [Polymorphism] Write a program to demonstrate the runtime polymorphism.
16. [Exception Handling] Write a program to demonstrate the exception handling.
17. [Templates and Generic Programming] Write a program to demonstrate the use of function template.
18. [Templates and Generic Programming] Write a program to demonstrate the use of class template.

Course Outcomes:
CO1 To introduce the concept of interface and implementation of a class.
CO2 To describe the nested classes, local classes, abstract classes.
CO3 To apply the concept of ambiguity in multiple and multipath inheritance.
CO4 To impart knowledge of accessing data through pointers.
CO5 To know about the copy constructor, dynamic constructors.
CO6 To instruct about the basic type to class type, class type to basic type.
CO7 To explain the mechanism of , basics of exception handling.
CO8 Gained knowledge about Function templates, class templates.

Mapping of Paper No – LC-CSE-214

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 S S S S S S M S S S M S S S S
S=Strong M=Medium W=Weak
 Web Technologies Lab

Course code LC-CSE-216

Category Professional Core Course
Course title Web Technologies Lab
L T P Credits
Scheme and Credits
0 0 2 1
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Objectives of the course:

 To impart the basic concepts of Web Technologies
 To understand various client side technologies
 To create web pages

Contents:
HTML :
1. Simple HTML using
a. Heading elements
b. Text Elements
c. Logical Styles
d. Physical Styles
e. Ordered , Unordered and Definition list
2. Hyper Links
a. Image Link → Link to page containing Images and Videos
b. File Link
 c. Single Page Link
3. Using Frames
a. Navigation Frame
b. Floating Frame
c. Inline Frame
4. Registration Form with Table
CSS:
Inline Style, Internal Style, and External Style Sheets
XML:
1. Create a any catalog
2. Display the catalog created using CSS or XSL
PHP:
1. File operation
2. Regular Expression, Array, Math, String, Date functions

Course Outcomes:
CO1 To know Protocols of Internet, World Wide Web
CO2 To describe the planning the site and navigation.
CO3 To apply the concept Text Basics, Document: Images and Multimedia
CO4 To impart the Need for CSS, introduction to CSS,
CO5 To know about the current applications of XML, Features of XML
CO6 To instruct about the Mark-up Element and Attributes, Document.
CO7 To explain the mechanism of Structure of PHP, PHP Functions.
CO8 Gained knowledge Database Form, AJAX PHP MySQL Select Query.

Mapping of Paper No – LC-CSE-216

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 S S M S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
 CO6 S S S S S M S S S S S S S S M
CO7 S M S S S S M S S S M S S S S
CO8 S S S S S S M S S S M S S S S
S=Strong M=Medium W=Weak
 ENVIRONMENTALSCIENCE
MC-106

L T P Credits Class Work : 25 Marks

3 0 1 - Theory : 75 Marks
Duration of Exam: 3 Hrs.
Theory 75 Marks Field Work 25 Marks (Practical/Field visit)
Objectives of the course:

 To impart the knowledge of environment studies.

 To understand Basic Renewable and non-renewable resources.
 To Understand Definitions Ecosystems: Producers, consumers and decomposers.
 To know about Human population and the Environment

Unit-1 The Multidisciplinary nature of environment studies. Definition, scope and importance.
Unit-2 Natural Resources:
Renewable and non-renewable resources: Natural resources and associated problems.
a) Forest resources: Use and over-exploitation: deforestation, case studies. Timberextraction, mining dams and their
effects on forests and tribal people.
b) Water resources: Use and over-utilization of surface and ground water, floods,drought, conflicts over water,
dams-benefits and problems.
c) Mineral resources: Use and exploitation, environmental effects of extracting and usingmineral resources, case studies.
d) Food resources: World food problems, changes, caused by agriculture and overgrazing, effects of modern agriculture,
fertilizer-pesticide problems, Water logging, salinity, case studies.
e) Energy resources: Growing energy needs; renewable and non-renewable energy sources, use of alternate energy
sources, case studies.
f) Land resources: Land as a resource, land degradation, man induced landslides, soilerosion and desertification.
 * Role of an individual in conservation of natural resources.
* Equitable use of resources for sustainable lifestyles.

Unit-3 Ecosystems:
* Producers, consumers and decomposers.
* Energy flow in the ecosystem.
* Ecological succession.
* Food chains, food webs and ecological pyramids.
* Introduction, types, characteristic features, structure and function of the followingeco-system :
a. Forest ecosystem.
b. Grassland ecosystem.
c. Desert ecosystem.
d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) (6 lectures)

Unit-4 Biodiversity and its conservation

* Introduction - Definition: Genetic, Species and ecosystem diversity.
* Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic andoption values.
* Biodiversity at global, National and local levels.
* India as a mega-diversity nation.
* Hot-spots of biodiversity.
* Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts.
* Endangered and endemic species of India.
* Conservation of biodiversity : In-situ and ex-situ conservation of biodiversity.
Unit-5 Environmental pollution:
Definition, causes, effects and control measures of :
a) Air pollution.
b) Water pollution
 c) Soil pollution
d) Marine pollution
e) Noise pollution
f) Thermal pollution
g) Nuclear hazards
* Solids waste management: causes, effects and control measures of urban andindustrial wastes.
* Role of an individual in prevention of pollution.
* Pollution case studies.
* Disaster management: floods, earthquake, cyclone and landslides.
(8 lectures)
Unit-6 Social issues and the Environment:
* From unsustainable to sustainable development.
* Urban problems related to energy.
* Water conservation, rain water harvesting, watershed management.
* Resettlement and rehabilitation of people: its problems and concerns casestudies.
* Environmental ethics: Issues and possible solutions.
* Climate change, global warming, acid rain, ozone layer depletion, nuclear accidentsand holocaust. Case studies.
* Wasteland reclamation.
* Consumerism and waste products.
* Environment Protection Act.
* Air (Prevention and Control of pollution) Act.
* Water (Prevention and Control of pollution) Act.
* Wildlife Protection Act.
* Forest Conservation Act.
* Issues involved in enforcement of environmental legislation.
* Public awareness. (7 lectures)
 Unit-7 Human population and the Environment. Population growth, variation among
nations. Population explosion- Family Welfare Programme.Environment and human
health.
Human Rights.
Value Education.
HIV/AIDS.
Woman and Child Welfare
Role of Information Technology in Environment and human health.Case Studies. (6 lectures)
Unit-8 Field Work:
* Visit to a local area to document environmental assets -
river/forest/grassland/hill/mountain.
* Visit to a local polluted site-urban/Rural/ Industrial/ Agricultural.
* Study of common plants, insects, birds.
Study of simple ecosystems- pond, river, hill slopes, etc. (Field work equal to 10 lecture hours)

Course Outcomes:
CO1 To introduce the concepts of Multidisciplinary nature of environment studies.
CO2 To describe the Role of an individual in conservation of natural resources.
CO3 To apply the concept of Food chains, food webs and ecological pyramids.
CO4 To impart knowledge and control measures of urban andindustrial wastes.
CO5 To know about the Social issues and the Environment.
CO6 To instruct Issues involved in enforcement of environmental legislation.
CO7 To explain In-situ and ex-situ conservation of biodiversity.
CO8 Gained knowledge about ozone layer depletion, nuclear accidents and holocaust.

Mapping of Paper No – MC-106

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
 CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
CO7 S S S S S S M S S S M S S S S
CO8 S S S S S S M S S S M S S S S
S=Strong M=Medium W=Weak

References
1. Agarwal, K.C. 2001 Environmental Biology, Nidi Pub. Ltd. Bikaner.
2. Bharucha, Frach, The Biodiversity of India, MApin Publishing Pvt. Ltd. Ahmedabad-380013, India,
3. Brunner R.C. 1989, Hazardous Waste Incineration, Mc. Graw Hill Inc. 480p.
4. Clark R.S., Marine pollution, Slanderson Press Oxford (TB).
5. Cunningham, W.P. Cooper, T.H. Gorhani, E & Hepworth, M.T. 2001,Environmental Encyclopedia,
Jaico Pub. House, Mumbai 1196 p.
6. De A.K., Environmental Chemistry, WileyEastern Ltd.
7. Down to Earth, Centre for Science and Environment (R).
8. Gleick, H.P., 1993. Water in crisis, Pacific Institute for Studies in Dev. Environment& Security Stockholm Env.
Institute, Oxford Univ. Press, 473p.
9. Hawkins R.E. Encyclopedia of Indian Natural History, Bombay NaturalHistorySociety, Bombay(R).

10. Heywood, V.H. & Watson, R.T. 1995. Global Biodiversity Assessment, CambridgeUni. Press 1140p.
11. Jadhav, H & Bhosale, V.M. 1995. Environmental Protection and Laws. HimalayaPub. House, Delhi 284p.
12. Mackinney, M.L. & Schoch, RM 1996, Environmental Science systems & solutions,Web enhanced edition. 639p.
13. Mhaskar A.K., Mayyer Hazardous, Tekchno-Science Publications (TB).
14. Miller T.G. Jr. Environmental Science, Wadsworth Publishing
15. Odum, E.P. 1971, Fundamentals of Ecology. W.B. Saunders Co. USA, 574p.
16. Rao M.N. & Datta, A.K. 1987 Waste Water Treatment. Oxford & TBH Publ. Co. Pvt. Ltd.345p.
17. Sharma, B.K. 2001, Environmental Chemistry, Goal Publ. House, Meerut.
18. Survey of the Environment, The Hindu (M).
19. Townsend C., Harper J. and Michael Begon. Essentials of Ecology, Blackwell Science(TB).
20. Trivedi R.K., Handbook of Environmental Laws, Rules, Guidelines, Comliances andStandards, Vol. I and II Enviro Media
(R).
21. Tridevi R.K. and P.K. Goal, Introduction to air pollution, Techno Science Publications(TR).
22. Wagner K.D., 1998, Environmental Management, W.B. Saunders co. Philadelphia, USA499p.
23. Atext book environmental education G.V.S. Publishers byDr. J.P. Yadav.

The scheme of the paper will be under :

The subject of Environmental Studies will be included as a qualifying paper in all UG Courses and the students will be required to
qualify the same otherwise the final result will not be declared and degree will not be awarded.

The duration of the course will be 40 lectures. The examination will be conducted along with thesemester examinations.
Exam. Pattern: In case of awarding the marks, the paper will carry 100 marks. Theory: 75 marks,Practical/ Field visit : 25 marks.
The structure of the question paper will be :
Part- A: Short Answer Pattern : 15marks

Part- B: Essay Type with inbuilt choice : 60marks

Part-C : Field Work (Practical) : 25marksInstructions for Examiners :

Part- A : Question No. 1 is compulsory and will contain five short- answer type question of 3 marks each covering the entire
syllabus.
Part-B : Eight essay type questions (with inbuilt choice) will be set from the entire syllabus and the candidate will be required
to answer any four of them. Each essay type question will be of 15 marks.

The examination of the regular students will be conducted by the concerned college/Institute. Eachstudent will be required to
score minimum 40% marks separately in theory and practical/Field visit.The marks in this qualifying paper will not be included
in determining the percentage of marks obtained for the award of degree.
However, these marks will be shown in the detailed marks certificate of the students.
 Indira Gandhi University Meerpur Rewari
(A State University established under Haryana Act No.29 of 2013)

Examination Scheme & Syllabus for Bachelor of Technology (Semester- V & VI)

OUTCOME BASED EDUCATION SYSTEM /

LEARNING OUTCOME CURRICULUM FRAMEWORK

OBES / LOCF, CBCS CURRICULUM (w.e.f. 2020-21)

VISION AND MISSION OF THE DEPARTMENT

VISION

To train students to be highly effective instructors, researchers, developers and contributors to IT companies globally. Be regarded as a
prestigious centre of scholarly achievement worldwide.

MISSION

1. To foster advance research and best education in IT domain.

2. To create skilled employees for businesses and industries based on latest IT technologies like artificial intelligence, data science and IoT etc.
3. To offer learning environment that is centered on the needs of the students in order to help in their overall development.
 Scheme of Studies and Examination
B.TECH (Computer Science & Engineering) – 5th Semester
w.e.f. 2020-21

Hours per Total Duration

Examination Schedule (Marks)
week Contac t of Exam
Sr.
Category Course Code Course Title Hrs. Credit (Hours)
No. Marks of
L T P per Theory Practical Tot al
Class work
week
Engineering ESC-CSE- Microprocessor
1 Science Course 301 3 0 0 3 3 25 75 100 3
Professional Core PCC-CSE- Computer Networks
2 Course 303 3 0 0 3 3 25 75 100 3
Professional Core PCC-CSE- Formal Languages &
3 Course 305 Automata 3 0 0 3 3 25 75 100 3
Professional Core PCC-CSE- Design & Analysis
4 Course 307 of Algorithms 3 0 0 3 3 25 75 100 3
Professional Core PCC-CSE- Programming in Java
5 Course 309 3 0 0 3 3 25 75 100 3
Professional Refer to
6 Elective Annexure I Elective–I 3 0 0 3 3 25 75 100 3
Course
Engineering LC-ESC-321 Microprocessor Lab
7 Science 0 0 2 2 1 25 - 25 50 3
Course
Professional Core LC-CSE-323 Computer Networks
8 Course Lab 0 0 3 3 1.5 25 - 25 50 3
Professional Core LC-CSE-325 Design & Analysis
9 Course of Algorithms 0 0 3 3 1.5 25 - 25 50 3
Using C++
Professional Core LC-CSE-327 Programming in Java
10 Course Lab 0 0 3 3 1.5 25 - 25 50 3
Training PT-CSE-329 Practical Training- 1
11 - - - 2 - - - * Refer Note 1
TOTAL CREDIT 23.5 800

Note: The evaluation of Practical Training-I will be based on seminar, viva-voce, report submitted by the students. According to
performance, the students are awarded grades A, B, C, F. A student who is awarded ‘F’ grade is required to repeat Practical Training.
Excellent: A; Good: B; Satisfactory: C; Not Satisfactory: F.
 Scheme of Studies and Examination
B.TECH (Computer Science & Engineering) – 6th Semester
w.e.f. 2020-21
Sr. Category Course Code Course Title Hours per Total Credit Examination Schedule (Marks) Duration
No. week Hrs. per of Exam
L T P week Marks of Theory Practic Tot al (Hours)
Class work al
Professional Core PCC-CSE-302 Compiler Design
1 Course 3 0 0 3 3 25 75 100 3
Professional Core PCC-CSE-304 Artificial Intelligence
2 Course 3 0 0 3 3 25 75 100 3
Professional Core PCC-CSE-306 Advanced Java
3 Course 3 0 0 3 3 25 75 100 3
Engineering Science ESC-CSE-308 Data Science
4 Course 3 0 0 3 3 25 75 100 3

Professional Elective Refer to Elective-II

5 Course Annexure II 3 0 0 3 3 25 75 100 3

Professional Elective Refer to Elective-III

6 Course Annexure III 3 0 0 3 3 25 75 100 3
PROJ-CSE- Project-I
7 Project 322 0 0 4 4 2 25 25 50 3
Professional Core LC-CSE-324 Compiler Design Lab
8 Course 0 0 3 3 1.5 25 25 50 3
Professional Core LC-CSE-326 Artificial Intelligence
9 Course Lab 0 0 3 3 1.5 25 25 50 3
using python
Professional Core LC-CSE-328 Advanced Java Lab
10 Course 0 0 2 2 1 25 25 50 3
Mandatory Courses MC-317 Constitution of India
11. 2 0 0
TOTAL 24 800
*
MC-317 is a mandatory non –credit course in which the students will be required passing marks in theory.
NOTE: At the end of 6th semester each student has to undergo Practical Training of 4/6 weeks in an Industry/ Institute/ Professional
Organization/ Research Laboratory/ training centre etc. and submit typed report along with a certificate from the organization & its
evaluation shall be carried out in the 7th Semester.
 Annexure I
Elective –I (Professional Elective Course)
1. PEC-CSE-311:Software Engineering
2. PEC-CSE-313 : System Programming and System Administration
3. PEC-CSE-315 :Digital Image Processing

Annexure II
Elective –II (Professional Elective Course)
1. PEC-CSE-310:Advanced Database Management System
2. PEC-CSE-312 :Mobile Application Development
3. PEC-CSE-314:Computer Graphics
4. PEC-CSE-330 :Communication Engineering

Annexure III
Elective –III (Professional Elective Course)
1. PEC-CSE-316: Distributed System
2. PEC-CSE-318 :Information Technology & Industry Business Skills
3. PEC-CSE-320 : Mobile and Wireless Communication
 MICROPROCESSOR

Course code ESC-CSE-301

Category Engineering Science Course
Course title Microprocessor
L T P Credits
Scheme and Credits Semester 5
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. To make understand architecture and working of Intel 8085 microprocessor in depth.
2. To make understand architecture and working of Intel 8086 microprocessor in depth.
3. Familiarization with the assembly language programming.
4. Familiarization with various peripheral operations
Unit: 1
THE 8085 PROCESSOR: Introduction to microprocessor, 8085 microprocessor: Architecture, instruction set, interrupt structure, and
Assembly language programming.

Unit: 2
THE 8086 MICROPROCESSOR ARCHITECTURE: Architecture, block diagram of 8086, details of sub-blocks such as EU, BIU;
memory segmentation and physical address computations, program relocation, addressing modes, instruction formats, pin diagram and
description of various signals.

Unit: 3
INSTRUCTION SET OF 8086: Instruction execution timing, assembler instruction format, data transfer instructions, arithmetic
instructions, branch instructions, looping instructions, NOP and HLT instructions, flag manipulation instructions, logical instructions,
shift and rotate instructions, directives and operators, programming examples.
 Unit: 4
INTERFACING DEVICE: 8255 Programmable peripheral interface, interfacing keyboard and seven segment display, 8254 (8253)
programmable interval timer, 8259A programmable interrupt controller, Direct Memory Access and 8237 DMA controller.

Course Outcomes:

CO1: Understand the operation and architecture of Intel 8085 microprocessor including Instruction Set Architecture.
CO2: Learn the operation of circuits for user interaction through switches, keyboard and display devices.
CO3: Understand the motivation and need for peripheral operations circuits for digital data exchange, timer, serial communication.
CO4: Write programs using 8086 and 8051
CO5: Distinguish between the different modules of operation of microprocessors.
CO6: Evaluate the appropriateness of a memory expansion interface based on the address reference with particular application.

Mapping of Paper No. ESC-CSE-301

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Microprocessor Architecture, Programming & Applications with 8085: Ramesh S Gaonkar; Wiley Eastern Ltd.
2. Intel Microprocessors 8086- Pentium processor: Brey; PHI
3. Microprocessors and interfacing: D V Hall; TMH
4. The 8088 & 8086 Microprocessors-Programming, interfacing, Hardware & Applications: Triebel & Singh; PHI
5. Microcomputer systems: the 8086/8088 Family: architecture, Programming & Design: Yu-Chang Liu & Glenn A Gibson; PHI.
6. Advanced Microprocessors and Interfacing: Badri Ram; TMH
 COMPUTER NETWORKS

Course code PCC-CSE-303

Category Professional Core Course
Course title Computer Networks
L T P Credits
Scheme and Credits 0 Semester 5
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. To develop an understanding of modern network architectures from a design and
2. Performance perspective.
3. To introduce the student to the major concepts involved in wide-area networks (WANs), local area networks (LANs) and
Wireless LANs (WLANs).
4. To provide an opportunity to do Network programming
5. To provide a WLAN measurement idea.

Unit: 1
Introduction: Data communication, Components, Computer networks and its historical development, distributed processing, Internet
Network Models: OSI model and TCP/IP Model
Physical Layer – physical layer functions, Data Representation, Simplex, Half Duplex and Full Duplex Transmission, Modulation and
Multiplexing, Packet and circuit switching, Transmission media, Topologies, connectionless and connection-oriented services.
Data Link Layer: Data link layer functions and services, MAC Addressing, Framing, Stop and Wait, Go back – N ARQ, Selective
Repeat ARQ, Sliding Window Protocol.
Unit: 2
Medium Access Control: MAC layer functions, Random access, Controlled Access and channelization protocols.
Network Layer: Network layer functions and services, Logical addressing, IPv4 classful and classless addressing, subnetting, NAT,
IPv4, ICMPv4, ARP, RARP and BOOTP, IPv6, IPv6 addressing, DHCP.
Network Devices: Repeater, hub, switch, router and gateway.
 Unit: 3
Routing Algorithms: introduction to routing, Shortest Path Algorithm, Flooding, Hierarchical Routing, Link State and Distance Vector
Routing
Transport Layer: Transport layer functions and services, Process to Process Communication, User Datagram Protocol (UDP),
Transmission Control Protocol (TCP), TCP connection management
Application Layer: Application layer functions and services, Domain Name Space (DNS), EMAIL, File Transfer Protocol (FTP),
HTTP, SNMP
Unit: 4
Congestion Control, Quality of Service, QoS Improving techniques. LAN: Ethernet, Token Bus, Token Ring, MAN Architecture-
DQDB, WAN Architectures- Frame Relay, ATM, SONET/SDH
Network Security: Firewalls, security goals, types of attack, Introduction to cryptography, Types of ciphers: symmetric and asymmetric
key ciphers.

Course Outcomes:
CO1: Explain the functions of the different layer of the OSI Protocol.
CO2: Draw the functional block diagram of wide-area networks (WANs), local area networks (LANs) and Wireless LANs
(WLANs) and describe the function of each.
CO3: Identify and connect various connecting components of a computer network.
CO4: Understand Wireless LANs & Wireless Sensor Networks Operation.
CO5: Understand fundamental concepts in Routing, Addressing & working of Transport Protocols.
CO6: Gain familiarity with common networking & Application Protocols.

Mapping of Paper No. PCC-CSE-303

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S S S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S S S S M M S S S S S M S S S
CO4 S S S S S S S S M S S S S S M
CO5 S S S S S S S M S S S S S S S
CO6 S S S S S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
References:
1. Data Communication and Networking, 4th Edition, Behrouz A. Forouzan, McGraw- Hill.
2. Data and Computer Communication, 8th Edition, William Stallings, Pearson Prentice Hall India.
3. Computer Networks, 8th Edition, Andrew S. Tanenbaum, Pearson New International Edition.
4. Internetworking with TCP/IP, Volume 1, 6th Edition Douglas Comer, Prentice Hall of India.
5. TCP/IP Illustrated, Volume 1, W. Richard Stevens, Addison-Wesley, United States of America.
 FORMAL LANGUAGES AND AUTOMATA

Course code PCC-CSE-305

Category Professional Core Course
Course title Formal Languages & Automata
L T P Credits
Scheme and Credits Semester 5
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. To understand basic concepts of formal languages and automata theory.
2. To study the types of Automata i.e. NFA, DFA, NFA with ϵ-transition and their inter conversion methods and importance.
3. To Study formal languages of different kinds, such as regular and context-free languages. Understand the concept of grammar
and its types. Removal of ambiguity and reduced form and Normal forms of grammar.
4. To develop the concepts and design of higher-level automata to accept the language not accepted by finite automata such as PDA
&Turing machine.
5. To study the various properties of turing machine and their designing.

Unit 1:
Finite Automata: Introduction: Set, Power Set, Super Set, languages and grammars, productions and derivation, Deterministic finite
automata (DFA), Non- Deterministic finite automata (NDFA), Equivalence of DFA and NDFA, Conversion of NDFA to DFA ,
minimization of finite automata, Finite automata with ϵ- moves, Acceptability of a string by a finite Automata.
Introduction to Machines: Properties and limitations of Finite Automata, Mealy and Moore Machines, Equivalence of Mealy and Moore
machines.
Unit 2:
Regular Expression: State and prove Arden’s Method, Regular Expressions, Recursive definition of regular expression, Regular
expression conversion to Finite Automata and vice versa.
Properties of regular languages: Regular language, pumping lemma for regular sets/languages, Application of regular languages.
 Unit 3:
Grammars: Chomsky hierarchy of languages, Relation between different types of grammars, Context-free grammar, Derivation tree /
Parse tree, Ambiguity in regular grammar and their removal, Reduced Forms: Removal of useless symbols, null and unit productions,
Normal Form: Chomsky Normal form(CNF) and Greibach Normal Form(GNF),
Push Down Automata: Introduction to PDA, Deterministic and Non-Deterministic PDA, Design of PDA: Transition table, Transition
diagram and acceptability of strings by designed PDA, Pushdown automata (PDA) and equivalence with CFG.
Unit 4:
Turing machines: The basic model for Turing machines (TM), Deterministic and Non- Deterministic Turing machines and their
equivalence, Design of Turing Machines: Transition table, Transition diagram and acceptability of strings by designed turing machine.
Variants of Turing machines, Halting problem of Turing machine, PCP Problem of Turing Machine, Linear Bounded Automata, TMs as
enumerators.
Undecidability: universal Turing machine, the universal and diagonalization languages, reduction between languages, undecidable
problems about languages.

Course Outcomes:
CO1: To use basic concepts of formal languages of finite automata techniques.
CO2: To Design Finite Automata’s for different Regular Expressions and Languages.
CO3: To Construct context free grammar for various languages.
CO4: To solve various problems of applying normal form techniques, push down automata and Turing Machines.
CO5: Understand the basic properties of formal languages and grammars.
CO6: Make grammars to produce strings from a specific language.

Mapping of Paper No. PCC-CSE-305

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S S S S S S S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S M S S S S S S S S S S S S
CO6 S S S M S S S M S S S S M S S
S = Strong, M = Medium, W = Weak
References:

1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John

2. E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
3. Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.
4. K. L. P Mishra, N. Chandrashekaran (2003), Theory of Computer Science-Automata Languages and Computation, 2nd edition,
Prentice Hall of India, India.
5. Raymond Greenlaw, H. James Hoover, Fundamentals of the Theory of Computation, Principles and Practice, Morgan
Kaufmann, 1998.
6. John C. Martin: Introduction to Languages and Automata Theory, 3rd edition, Tata Mcgraw-Hill, 2007
 DESIGN AND ANALYSIS OF ALGORITHMS

Course code PCC-CSE-307

Category Professional Core Course
Course title Design and Analysis of Algorithms
L T P Credits
Scheme and Credits Semester 5
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. Analyze the asymptotic performance of algorithms.
2. Write rigorous correctness proofs for algorithms.
3. Demonstrate a familiarity with major algorithms and data structures.
4. Apply important algorithmic design paradigms and methods of analysis.
5. Synthesize efficient algorithms in common engineering design situations.

Unit 1:
Introduction to Algorithms: Algorithm, Performance Analysis (Time and Space complexity), Asymptotic Notation (Big OH, Omega and Theta)-
best, average and worst-case behaviour. Elementary Data Structures (Basic terminology of Stacks and Queues, Tree, Graph), Sets and Disjoint Set
Union.
Divide and Conquer: General method, Binary Search, Merge Sort, Quick Sort, and other sorting algorithms with divide and conquer strategy,
Strassen’s Matrix Multiplication algorithms and analysis of these problems.
Unit 2:
Greedy Method: General method, Fractional Knapsack problem, Job Sequencing with Deadlines, Minimum Cost Spanning Trees, Single source
shortest paths.
Dynamic Programming: General method, Optimal Binary Search Trees, 0/1 knapsack, The Traveling Salesperson problem.
Unit 3:
Back Tracking: General method, The 8-Queen’s problem, Sum of subsets, Graph Colouring, Hamiltonian Cycles.
Branch and Bound: The method, 0/1 knapsack problem, Traveling Salesperson problem, Efficiency considerations.
 Unit 4:
NP Hard and NP Complete Problems: Basic concepts, Cook’s theorem, NP hard graph problems, NP hard scheduling problems, NP hard code
generation problems, and some simplified NP hard problems.

Course Outcomes:
CO1: To identify and justify correctness of algorithms and to analyse running time of algorithms based on asymptotic analysis.
CO2: To understand when an algorithmic design situation calls for the divide-and-conquer paradigm.
CO3: To Synthesize divide-and-conquer algorithms.
CO4: Describe the greedy paradigm and dynamic-programming paradigm. Explain when an algorithmic design situation calls for
it.
CO5: Developing greedy algorithms/dynamic programming algorithms, and analyze it to determine its computational complexity.
CO6: To write the algorithm using Backtracking and Branch and Bound strategy to solve the problems for any given model
engineering problem.

Mapping of Paper No. PCC-CSE-307

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S M S S S S S
CO2 M S S S S S S S S S M S S M M
CO3 S M S S M M S S S S S M S S S
CO4 S S S S S S S S M S S S S S M
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S S S S
S = Strong, M = Medium, W = Weak

References:

1. Fundamental of Computer algorithms, Ellis Horowitz and Sartaj Sahni, 1978, Galgotia Publication
2. Introduction to Algorithms, Thomas H Cormen, Charles E Leiserson and Ronald L Rivest: 1990, TMH
3. The Design and Analysis of Computer Algorithm, Aho A.V. Hopcroft J.E., 1974, Addison Wesley.
4. Algorithms-The Construction, Proof and Analysis of Programs, Berlion, P.Bizard, P., 1986. Johan Wiley & Sons,
5. Writing Efficient Programs, Bentley, J.L., PHI
6. Introduction to Design and Analysis of Algorithm, Goodman, S.E. &Hedetnieni, 1997, MGH.
7. Introduction to Computers Science- An algorithms approach, Jean Paul Trembley, Richard B.Bunt, 2002, T.M.H.
8. Fundamentals of Algorithms: The Art of Computer Programming Vol Knuth, D.E.: 1985, Naresh Publication.
 PROGRAMMING IN JAVA

Course code PCC-CSE-309

Category Professional Core Course
Course title Programming in JAVA
L T P Credits
Scheme and Credits 0 Semester 5
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. Programming in the Java programming language.
2. Knowledge of object-oriented paradigm in the Java programming language.
3. The use of Java in a variety of technologies and on different platforms.

Unit 1:
Introduction to Java: Evolution of Java, Object Oriented Programming Structure, Overview and characteristics of Java, Java program
Compilation and Execution Process, Organization of the Java Virtual Machine, Client side Programming, Platform Independency &
Portability, Security, Relation b/w JVM, JRE and JDK, Introduction to JAR format, Naming Conventions, Data types & Type casting,
operators, Security Promises of the JVM, Security Architecture and Security Policy, security aspects, sandbox model

Unit 2:
OOPS Implementation: Classes, Objects, attributes, methods, data encapsulation, reference variables, Constructors, Anonymous block,
Method Overloading, Static Data members, Block & methods;Memory Structure: Stack, Heap, Class & Method area Class loading &
Execution flow: Static vs Dynamic Class loading, implicit vs explicit class loading, class loading operations; Argument Passing
Mechanism: Passing primitive arguments, passing objects, Wrapper Classes; This keyword: Referencing instance members, Intra class
constructor chaining, Method chaining; Inheritance & code reusability: Extending classes for code reusability, Usage of super keyword,
Method Overriding, Object class
Inheritance & Runtime Polymorphism: Static & Dynamic binding, Inheritance and Is-A relation, Runtime Polymorphism and
Generalization, Abstract classes & methods, Final Keyword; Interfaces and Role based Inheritance: Feature & Role based Inheritance,
Static & Dynamic classing Environment, classes & interfaces, interface applications in real scenarios; Has-A relation: Aggregation &
Composition, Nested classes, Inner classes, Anonymous Inner classes, String Buffer Class, tokenizer, applets, Life cycle of applet and
Security concerns

Unit 3:
Threads: Creating Threads, Thread Priority, Blocked States, Extending Thread Class, Runnable Interface, Starting Threads, Thread
Synchronization, Synchronize Threads, Sync Code Block, Overriding Synced Methods, Thread Communication, wait, notify and notify
all. Swing & AWT: Swing class hierarchy, containers, user interface components, graphics context, AWT Components, Component Class,
Container Class, Layout Manager Interface Default Layouts, Insets and Dimensions, Border Layout, Flow Layout, Grid Layout, Card
Layout Grid Bag Layout AWT Events, Event Models, Listeners, Class Listener, Adapters, Action Event Methods Focus Event Key
Event, Mouse Events, Window Event
Package & Scopes: Need of Packages, associating classes to Packages, Class path environment variable, Import Keyword and Feature
of static import, Public, protected, private & default scope, Private Inheritance;
Exception Handling: exception and error, Exception Handling & Robustness, Common Exceptions and Errors, Try and catch block,
Exception handlers, throw keyword, Checked and Unchecked Exceptions, Role of finally, User defined Exceptions;

Unit 4:
Collection Framework: Role and Importance of Collection Framework, List & Set based collection, Iterator & List Iterator, Maps,
Searching elements in List, Hash and Tree based collections, Role of equals and hashCode() methods, Comparable and Comparator
Interfaces, Thread Safety and Vector, Difference b/w Enumeration and Iterator, Type safety and Generics, Common algorithms and
Collections class, Using Properties class for managing properties files; Database Connectivity Using JDBC: Overview of native and
ODBC Drives, Introduction to JDBC, Type of JDBC drivers, Usage of drivers, Defining properties-based Connection Factory; Basic
database operations: Insert, Delete, Update, and Select; Prepared Statement: Statement, Prepared Statement, Setting Query parameters,
Executing Queries;
Callable Statement: Creating PL/SQL Stored procedures and functions, Creating Callable statements, Executing procedures & functions,
Batch Updation, Transacting Queries, Programmatic initialization of database, ResultSetMetaData, DatabaseMetaData; Input/Output
Stream, Stream Filters, Buffered Streams, Data input and Output Stream, Print Stream Random Access File,
Reflection: reflection API, newInstance()method, javap tool, creating javap tool, creating applet viewer, call private method, java 9
features;

Course Outcomes:
CO1: Knowledge of the structure and model of the Java programming language, (knowledge)
CO2: Use the Java programming language for various programming technologies (understanding)
CO3: Develop software in the Java programming language
CO4: Read and make elementary modifications to Java programs that solve real-world problems.
CO5: Validate input in a Java program.
CO6: Identify and fix defects and common security issues in code.
Mapping of Paper No. PCC-CSE-309

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S S S S M S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S S S S M M S S S S S M S S S
CO4 S S S S S S S S M S S S S S M
CO5 S S S S S S S S S S S S S S S
CO6 S M S S S S M S S S S S M S S
S = Strong, M = Medium, W = Weak

References:

1. Patrick Naughton and HerbertzSchidt, “Java-2 the complete Reference”,TMH

2. Sierra & bates, “Head First Java”, O’Reilly.
3. E. Balaguruswamy, “Programming with Java”, TMH
4. Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley.
5. Decker &Hirshfield, “Programming.Java”, Vikas Publication.
 MICROPROCESSOR LAB

Course code LC-ESC-321

Category Engineering Science Course
Course title Microprocessor Lab
L T P Credits
Scheme and Credits 2 Semester 5
0 0 1
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Hands-on experiments related to the course contents of ESC-CSE-301.

Course Outcomes:
CO1: Demonstrate ability to handle arithmetic operations using assembly language programming.
CO2: Demonstrate ability to handle logical operations using assembly language programming.
CO3: Develop testing and experimental procedures on Microprocessor and analyze their operation under different cases.
CO4: Demonstrate ability to handle sorting operations and using assembly language programming.
CO5: Identify relevant information to supplement to the Microprocessor course. S
CO6: Set up programming strategies and select proper mnemonics and run their program on the training boards.

Mapping of Paper No. LC-ESC-321

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S S S S S S S
CO2 M S S S S S S S S S S S S M S
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S S S S S S S M
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
 COMPUTER NETWORKS LAB

Course code LC-CSE-323

Category Professional Core Course
Course title Computer Networks Lab
L T P Credits
Scheme and Credits 2 Semester 5
0 0 1.5
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Hands-on experiments related to the course contents of PCC-CSE-303 using hardware resources and using simulation tool.

Course Outcomes:
CO1: Understand fundamental underlying principles of computer networking
CO2: Understand details and functionality of layered network architecture.
CO3: Apply mathematical foundations to solve computational problems in computer networking
CO4: Analyze performance of various communication protocols.
CO5: Compare routing algorithms
CO6: Practice packet /file transmission between nodes.

Mapping of Paper No. LC-CSE-323

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S S S S M S S S S S
CO2 M S S S S S S S S S M S S S S
CO3 S S S S M M S S S S S S S M S
CO4 S S S S S S S S M S S S S S M
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
 DESIGN & ANALYSIS OFALGORITHMS USING C++

Course code LC-CSE-325

Category Professional Core Course
Course title Design & Analysis of Algorithms Using C++
L T P Credits
Scheme and Credits 3 Semester 5
0 0 1.5
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Course Objectives:
1. Implementation of various algorithms and to analyze the performance of algorithms.
2. Demonstrate a familiarity with major algorithms and data structures.
3. Apply important algorithmic design paradigms and methods of analysis.
4. Synthesize efficient algorithms in common engineering design situations.

List of programs:
1. Write a Program for iterative and recursive Binary Search.
2. Write a Program to sort a given set of elements using the Quick Sort/Merge Sort/Selection Sort method and determine the time
required to sort the elements.
3. Write a Program for implementation of Fractional Knapsack problem using Greedy Method and 0/1 Knapsack problem using
Dynamic Programming.
4. Write a Program to find the shortest path from a given vertex to other vertices in a weighted connected graph using Dijkstra’s
algorithm.
5. Write a Program to find the minimum cost spanning tree (MST) of a given undirected graph using Kruskal’s algorithm/Prim’s
Algorithms.
6. Write a Program to implement N-Queens problem using back tracking.
7. Write a Program to check whether a given graph is connected or not using DFS method.
8. Write a program to implement the Travelling Salesman Problem (TSP).
Note: At least 5 to 10 more exercises to be given by the teacher concerned.
 Course Outcomes:

CO1: Improving the programming skills of the students.

CO2: The design of algorithms for any problem will inculcate structured thinking process in the students and improve the
analytical power.
CO3: Argue the correctness of algorithms using inductive proofs and invariants.
CO4: Analyze worst-case running times of algorithms using asymptotic analysis.
CO5: Describe the divide-and-conquer paradigm and explain when an algorithmic design situation calls for it.
CO6: Explain the major graph algorithms and their analyses. Employ graphs to model engineering problems, when appropriate.

Mapping of Paper No. LC-CSE-325

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M M
CO3 S S S S M S S S S S S S S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
 PROGRAMMING IN JAVA LAB

Course code LC-CSE-327

Category Professional Core Course

Course title Java Programming Lab
L T P Credits Semester 5
Scheme and Credits 0 0 3 1.5
Class work 25Marks
Exam 25Marks
Total 50Marks
Duration of Exam 03Hours

List of Experiments:
1. Create a java program to implement stack and queue concept.
2. Write a java package to show dynamic polymorphism and interfaces.
3. Write a java program to show multithreaded producer and consumer application.
4. Create a customized exception and also make use of all the 5 exception keywords.
5. Convert the content of a given file into the upper case content of the same file.
6. Develop an analog clock using applet.
7. Develop a scientific calculator using swings.
8. Create an editor like MS-word using swings.
9. Create a servlet that uses Cookies to store the number of times a user has visited your servlet.
10. Create a simple java bean having bound and constrained properties.

Course Outcomes:
CO1: Use an integrated development environment to write, compile, run, and test simple object-oriented Java programs.
CO2: Read and make elementary modifications to Java programs that solve real-world problems.
CO3: Validate input in a Java program.
CO4: Identify and fix defects and common security issues in code.
CO5: Document a Java program using Javadoc.
CO6: Use a version control system to track source code in a project.
Mapping of Paper No. LC-CSE-327

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S S
CO2 S S S S S S S S S S S S S M M
CO3 S M S S S M S S S S S S S S S
CO4 S S S M S S S S S S S S S S M
CO5 S S S S S S S S S S S M S S S
CO6 S S S S S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
 PRACTICAL TRAINING 1

Course code PT-CSE-329

Category Professional Core Course

Course title PRACTICAL TRAINING 1
L T P Credits Semester 5
Scheme and Credits
0 0 0
Class work -
Exam -
Total -
Duration of Exam -

The evaluation of Practical Training-I will be based on seminar, viva-voce, report submitted by the students. According to
performance, the students are awarded grades A, B, C, F. A student who is awarded ‘F’ grade is required to repeat Practical Training.
Excellent: A; Good: B; Satisfactory: C; Not Satisfactory: F.

Course Outcomes:
CO 1: Participate in the projects in industries during his or her industrial training.
CO 2: Describe use of advanced tools and techniques encountered during industrial training and visit.
CO 3: Interact with industrial personnel and follow engineering practices and discipline prescribed in industry.
CO 4: Develop awareness about general workplace behavior and build interpersonal and team skills.
CO 5: Prepare professional work reports.
CO6: Prepare presentations.

Mapping of Paper No. PT-CSE-329

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S S S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S S S S M S S S S S S S S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
 SOFTWARE ENGINEERING

Course code PEC CSE-311

Category Professional Elective Course
Course title Software Engineering
L T P Credits
Scheme and Credits 0 Semester 5
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:

1. Be successful professionals in the field with solid fundamental knowledge of software engineering
2. Utilize and exhibit strong communication and interpersonal skills, as well as professional and ethical principles when
functioning as members and leaders of multi- disciplinary teams
3. Apply their foundations in software engineering to adapt to readily changing environments using the appropriate theory,
principles and processes

Unit: 1
Introduction: The process, software products, emergence of software engineering, evolving role of software, software life cycle models,
Software Characteristics, Applications, Software crisis.
Software project management: Project management concepts, software process and project metrics Project planning, project size
estimation metrics, project estimation Techniques, empirical estimation techniques, COCOMO- A Heuristic estimation techniques,
staffing level estimation, team structures, staffing, risk analysis and management, project scheduling and tracking

Unit: 2
Requirements Analysis and specification requirements engineering, system modeling and simulation Analysis principles modeling,
partitioning Software, prototyping: , Prototyping methods and tools; Specification principles, Representation, the software requirements
specification and reviews Analysis Modeling: Data Modeling, Functional modeling and information flow: Data flow diagrams,
Behavioral Modeling; The mechanics of structured analysis: Creating entity/ relationship diagram, data flow model, control flow model,
the control and process specification; The data dictionary; Other classical analysis methods.
System Design: Design concepts and principles: the design process: Design and software quality, design principles; Design concepts:
Abstraction, refinement, modularity, software architecture, control hierarchy, structural partitioning, data structure, software procedure,
information hiding; Effective modular design: Functional independence, Cohesion, Coupling;
Unit: 3
Architectural Design: Software architecture, Data Design: Data modeling, data structures, databases and the data warehouse, Analyzing
alternative Architectural Designs, architectural complexity; Mapping requirements Into software architecture; Transform flow,
Transaction flow; Transform mapping: Refining the architectural design.
Testing and maintenance: Software Testing Techniques, software testing fundamentals: objectives, principles, testability; Test case
design, white box testing, basis path testing: Control structure testing: Black box testing, testing for specialized environments,
architectures and applications. Software Testing Strategies: Verification and validation, Unit testing, Integration testing, Validation
testing, alpha and beta testing; System testing: Recovery testing, security testing, stress testing, performance testing; The art of
debugging, the debugging process debugging approaches. Software re-engineering, reverse engineering, restructuring, forward
engineering.

Unit: 4
Software Reliability and Quality Assurance :Quality concepts, Software quality assurance , SQA activities; Software reviews: cost
impact of software defects, defect amplification and removal; formal technical reviews: The review meeting, review reporting and
record keeping, review guidelines; Formal approaches to SQA; Statistical software quality assurance; software reliability: Measures of
reliability and availability ,The ISO 9000 Quality standards: The ISO approach to quality assurance systems, The ISO 9001 standard,
Software Configuration Management. Computer Aided software Engineering: CASE, building blocks, integrated case environments and
architecture, repository.

Course Outcomes
CO1: Basic knowledge and understanding of the analysis and design of complex systems.
CO2: Ability to apply software engineering principles and techniques.
CO3: Ability to develop, maintain and evaluate large-scale software systems.
CO4: To produce efficient, reliable, robust and cost-effective software solutions.
CO5: Ability to perform independent research and analysis.
CO6: Ability to work as an effective member or leader of software engineering teams.
Mapping of Paper No. PEC CSE-311

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S M S S S M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S S S S S S S M
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:

1. Software Engineering – A Practitioner’s Approach, Roger S. Pressman, 1996, MGH.

2. Fundamentals of software Engineering, Rajib Mall, PHI
3. Software Engineering by Ian Somerville, Pearson Edu, 5 edition, 1999, AW,
4. Software Engineering – David Gustafson, 2002, T.M.H
5. Software Engineering Fundamentals Oxford University, Ali Behforooz and Frederick J. Hudson 1995 JW&S,
6. An Integrated Approach to software engineering by Pankaj jalote , 1991 Narosa,
 SYSTEM PROGAMMING AND SYSTEM ADMINISTRATION

Course code PEC CSE-313

Category Professional Elective Course
Course title System Programming and System Administration
L T P Credits
Scheme and Credits Semester 5
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. Evolution of the components of system programming.
2. To learn working and different stages of compilation process.
3. To learn basic of assembler and loading schemes.
4. To learn basics of file structure.
5. To know about filters and pipeline.
6. To learn shell programming

Unit: 1
Evolution of Components Systems Programming, Assemblers, Loaders, Linkers, Macros, Compilers. software tools, Text editors,
Interpreters and program generators, Debug Monitors, Programming environment.
Compiler: Brief overview of compilation process, Incremental compiler, Assembler: Problem statement, symbol table; Loader schemes,
compile and go Loader, general loader schemes, absolute loader, Reallocating loader, Direct linkage Loader, Binders, overlays.

Unit: 2
Theoretical Concept of Unix Operating System: Basic features of operating system; File structure: CPU scheduling; Memory
management: swapping, demand paging; file system: block and fragments, inodes, directory structure; User to user communication
 Unit: 3
Getting Started with Unix: User names and groups, logging in; Format of Unix commands; Changing your password; Characters with
special meaning; Unix documentation; Files and directories; Current directory, looking at the directory contents, absolute and relative
pathnames, some Unix directories and files; Looking at the file contents; File permissions; basic operation on files; changing permission
modes; Standard files, standard output; Standard input, standard error; filters and pipelines; Processes; finding out about processes;
Stopping background process; Unix editor vi.
Unit-4
Shell Programming: Programming in the Borne and C-Shell; Wild cards; Simple shell programs; Shell variables; interactive shell
scripts; Advanced features. System Administration: Definition of system administration; Booting the system; Maintaining user
accounts; File systems and special files; Backups and restoration; Role and functions of a system manager. Overview of the Linux
operating system

Course Outcomes
CO1: To understand various file statistics.
CO2: Understand the basics of system programs like editors, compiler, assembler, linker, loader, interpreter and debugger.
CO3: Describe the various concepts of assemblers and macroprocessors.
CO4: To understand the various phases of compiler and compare its working with assembler.
CO5: To understand how linker and loader create an executable program from an object module created by assembler and compiler.
CO6: To know various editors and debugging techniques.

Mapping of Paper No. PEC CSE-313

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S M S S M S S S S S S M S S S
CO4 S S S S S S S S S S S S S S S
CO5 S S S S S S S S S S S S S S M
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
References:
1. Systems Programming by Donovan, TMH.
2. The unix programming environment by Brain Kernighen& Rob Pike, 1984, PHI & Rob Pike.
3. Design of the Unix operating system by Maurich Bach, 1986, PHI.
4. Introduction to UNIX and LINUX by John Muster, 2003, TMH.
5. Advanced Unix programmer’s Guide by Stephen Prato, BPB
6. Unix- Concept and applications by Sumitabha Das, 2002, T.M.H
 Digital Image Processing

Course Code PEC-CSE-315

Category Professional Elective Course
Course title Digital Image Processing
L T P Credits
Scheme and Credits 0 Semester 5
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. To become familiar with digital image fundamentals
2. To get exposed to simple image enhancement techniques in Spatial and Frequency domain.
3. To learn concepts of degradation function and restoration techniques.
4. To study the image segmentation and representation techniques.
5. To become familiar with image compression and recognition method

Unit: 1
Introduction to Image Processing: Digital Image representation, Sampling & Quantization, Steps in image Processing, Image acquisition,
color image representation.
Unit: 2
Image Transformation & Filtering: Intensity transform functions, histogram processing, Spatial filtering, Fourier transforms and its
properties, frequency domain filters, colour models, Pseudo colouring, colour transforms, Basics of Wavelet Transforms.
Image Restoration: Image degradation and restoration process, Noise Models, Noise Filters, degradation function, Inverse Filtering,
Homomorphism Filtering
Unit: 3
Image Compression: Coding redundancy, Interpixel redundancy, Psychovisual redundancy, Huffman Coding, Arithmetic coding, Lossy
compression techniques, JPEG Compression.
 Unit-4
Image Segmentation & Representation: Point, Line and Edge Detection, Thresholding, Edge and Boundary linking, Hough transforms,
Region Based Segmentation, Boundary representation, Boundary Descriptors.
Course Outcomes
CO1: Explain the fundamentals of digital image and its processing
CO2: Perform image enhancement techniques in spatial and frequency domain.
CO3: Elucidate the mathematical modelling of image restoration and compression
CO4: Apply the concept of image segmentation.
CO5: Describe object detection and recognition techniques.
CO6: Understand the restoration concepts and filtering techniques

Mapping of Paper No. PEC CSE-315

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S M S S S M S S S S S S S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S M S S S S S S S S S S
CO6 S S S M S S S S S S S M M S S
S = Strong, M = Medium, W = Weak

References:

1. Rafael C. Gonzalez, Richard E. Woods,Digital Image Processing Pearson, Third Edition,2010.

2. Anil K. Jain,Fundamentals of Digital Image Processing Pearson, 2002.
3. Kenneth R. Castleman,Digital Image Processing Pearson, 2006.
4. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins,Digital Image Processing using MATLAB Pearson Education, Inc., 2011.
5. D,E. Dudgeon and RM. Mersereau,Multidimensional Digital Signal Processing Prentice Hall Professional Technical Reference,
1990.
6. William K. Pratt,Digital Image Processing John Wiley, New York, 2002
 COMPILER DESIGN

Course code PCC-CSE-302

Category Professional Core Course
Course title Compiler Design
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. To understand and list the different stages in the process of compilation.
2. Identify different methods of lexical analysis.
3. Design top-down and bottom-up parsers.
4. Identify synthesized and inherited attributes.
5. Develop syntax directed translation schemes.

Unit: 1
Introduction to Compilers: Language Processors, The Structure of compiler: its different phases, Compiler Construction Tools,
Applications of Compiler Technology.
Lexical Analysis: Role of lexical analyzer, Input Buffering, Specification and recognition of tokens, design of lexical analyzer, regular
expressions, A language specifying lexical analyzer, Finite automata, conversion from regular expression to finite automata, and vice
versa, minimizing number of states of DFA, Implementation of lexical analyzer.
Unit: 2
Syntax Analysis: Role of parsers, context free grammars.
Parsing Technique: Shift-reduce parsing, Operator precedence parsing, Top down parsing, Predictive parsing.
Unit: 3
LR parsers, SLR, LALR and Canonical LR parser.
Syntax Directed Translations: Syntax directed definitions, construction of syntax trees, syntax directed translation scheme,
implementation of syntax directed translation, Intermediate-Code Generation: three address code, quadruples and triples.
 Unit: 4
Symbol Table & Error Detection and Recovery: Symbol tables: its contents and data structure for symbol tables; trees, arrays, linked
lists, hash tables. Errors, lexical phase error, syntactic phase error, Semantic error.
Code Optimization & Code Generation: Code generation, forms of objects code, machine dependent code, optimization, register
allocation for temporary and user defined variables.

Course Outcomes:
CO1: To develop syntax directed translation schemes.
CO2: Discuss the major phases of compilers and use the knowledge of the Lex tool
CO3: Develop the parsers and experiment with the knowledge of different parsers design without automated tools.
CO4: Describe intermediate code representations using syntax trees and DAG’s as well as use this knowledge to generate
intermediate code in the form of three address code representations.
CO5: Classify various storage allocation strategies and explain various data structures used in symbol tables
CO6: Summarize various optimization techniques used for dataflow analysis and generate machine code from the source code.

Mapping of Paper No. PCC-CSE-302

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S M S S S S M S S S S S
CO2 M S S S S S S S S S M S S S S
CO3 S M S S S M S S S S S S S S S
CO4 S S S M S S S S M S S S S S M
CO5 S S S S S S S S S S S S S S S
CO6 S S S S S S S S S S S S M M S
S = Strong, M = Medium, W = Weak

References:
1. Compilers Principle, Techniques & Tools - Alfread V. AHO, Ravi Sethi& J.D. Ullman; 1998 Addison Wesley.
2. Theory and practice of compiler writing, Tremblay & Sorenson, 1985, Mc. Graw Hill.
3. System software by Dhamdere, 1986, MGH.
4. Principles of compiler Design, Narosa Publication
5. Elements compiler Design, Dr. M. Joseph, University Science Press
 ARTIFICIAL INTELLIGENCE

Course code PCC-CSE-304

Category Professional Core Course
Course title Artificial Intelligence
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. To provide historical perspective of AI and its foundation.
2. To provide the most fundamental knowledge to the students so that they become familiar with basic principles of AI towards
problem solving, inference, knowledge representation and learning.
3. Explore application of AI techniques in Expert systems, Neural Networks.
4. Explore the current trends, potential, limitations, and implications of AI.

Unit: 1
Introduction: Definition of AI, History of AI, nature of AI problems, examples of AI problems. Problem solving by search: Uninformed
Search: Depth First Search (DFS), Breadth First Search (BFS). Informed Search: Best First Search, A*. Local Search: Hill Climbing.
Problem Reduction Search: AO*. Population Based Search: Ant Colony Optimization, Genetic Algorithm. Game Playing:MinMax
Algorithm, Alpha-Beta Pruning.
Unit: 2
Knowledge Representation: Types of Knowledge, Knowledge Representation Techniques/schemes: Propositional Logic, Predicate
Logic, Semantic nets, Frames. Knowledge representation issues. Rule based systems.

Unit: 3
Reasoning under Uncertainty: Basics of Probability Theory, Probabilistic Reasoning, Bayesian Reasoning, Dempster-Shafer Theory.
Planning: Introduction to Planning, Representation of Planning, Partial-order Planning.
 Unit: 4
Learning: Introduction to Learning, Types of Learning: Learning by Induction, Rote Learning, Symbol Based Learning, Identification
Trees, Explanation Based Learning, Transformational Analogy, Introduction to Neural Networks, Expert Systems, Current trends in
Artificial Intelligence

Course Outcomes:
CO1: Display the understanding of the historical perspective of AI and its foundation.
CO2: Apply basic principles of AI in solutions that require problem solving, inference, knowledge representation and learning.
CO3: Demonstrate fundamental understanding of various application of AI techniques in Expert systems, Neural Networks.
CO4: Demonstrate an ability to share in discussion of AI, it’s the current trends, limitations, and implications of AI.
CO5: Design user interfaces to improve human–AI interaction and real-time decision-making.
CO6: Evaluate the advantages, disadvantages, challenges, and ramifications of human–AI augmentation.

Mapping of Paper No. PCC-CSE-304

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S S S S M S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S M S S S M S S S S S S S S S
CO4 S S S S S S S S M S S S M S M
CO5 S S S S M S S S S S S S S S S
CO6 S S S S S S S S S S S S S S S
S = Strong, M = Medium, W = Weak

References:
1. Artificial Intelligence: A Modern Approach Third Edition Stuart Russell and Peter Norvig, 2010, Pearson Education.
2. Elaine Rich, Kevin Knight, & Shivashankar B Nair, Artificial Intelligence, McGraw Hill, 3rd ed.,2009.
3. Introduction to Artificial Intelligence & Expert Systems, Dan W Patterson, PHI.,2010.
4. Artificial intelligence, Patrick Henry Winston, 1992, Addition Wesley 3 Ed.
 ADVANCED JAVA

Course code PCC-CSE-306

Category Professional Course Code

Course title Advanced Java
L T P Credits Semester 6
Scheme and Credits
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. Programming in the Java programming language,
2. Knowledge of object-oriented paradigm in the Java programming language,
3. The use of Java in a variety of technologies and on different platforms.

Unit: 1
Servlet: Servlet introduction, web terminology, servlet API, servlet Interface, generic servlet, Http servlet, servlet lifecycle, servlet with
IDE (eclipse, Myeclipse, Netbeans), servlet request, servlet collaboration, servlet configuration, context, attribute in servlet, session
technique in servlet, event and listener, servlet filter, CRUD, pagination, input output stream, annotation, single thread model, SSI;
JSP: Life cycle of JSP, JSP API, scripting elements, Implicit Objects, directive elements, Exceptions, action elements, expression
language, MVC in JSP, JSTL, custom tags, pagination, CRUD, JSTL function, formatting, XML, SQL tags.
Unit: 2
Struts: Introduction, features, models, components, struts2 architecture, action, configuration, interceptors, validation method, aware
Interfaces, zero configuration, struts 2 with tiles, hibernate with struts 2, spring with struts 2, UI tags.
Mail API: java mail introduction, methods of sending email, sending mail by Gmail, receiving email, sending attachment, receiving
attachment, sending html, forwarding, deleting email;
Unit: 3
Hibernate(HB): Introduction, architecture, HB with IDE, HB Log 4j, inheritance mapping, HB mapping, transaction management, HB
query language, HB criteria query language, named query, HB caching, integration, HB lifecycle.
 Spring: Introduction, modules, spring with IDE, dependency injection methods, spring AOP, spring Jdbc template, spring ORM, SPEL,
MVC tag library, applications, spring remoting, spring OXM, spring web, security models, spring boot, spring with angular;
Unit: 4
Android: Introduction, history & versions, architecture, building blocks, emulator, android widgets, activity and intents, android
fragments, android menu, android service, SQLite, XML & JSON, android speech, multimedia, telephony, maps.
Design Pattern: java design pattern, creational, structural, behavioral, J2EE patterns, presentation layers,
Course Outcome:
CO1: Knowledge of the structure and model of the Java programming language, (knowledge)
CO2: Design GUI using AWT and Swing.
CO3: Develop program using event handling.
CO4: Use network concepts (client/server, socket) in the program.
CO5: Develop program using JDBC connectivity to access data from database and execute different queries to get required result.
CO6: Develop web based program using servlet and JSPVisit for more Learning Resources

Mapping of Paper No. PCC-CSE-306

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M M
CO3 S M S S S M S S S S S S S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Patrick Naughton and HerbertzSchidt, “Java-2 the completeReference”,TMH
2. Sierra&bates, “Head FirstJava”, O’Reilly.
3. E. Balaguruswamy, “Programming with Java”,TMH
4. Horstmann, “Computing Conceptswith Java2 Essentials”, John Wiley.
5. Decker&Hirshfield, “Programming.Java”, VikasPublication.
 DATA SCIENCE

Course code ESC-CSE-308

Category Engineering Science Course
Course title Data Science
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. The objective of this course is to impart necessary knowledge of the basic foundations needed for understanding data science
domain and develop programming skills required to build data science applications.
2. To introduce the conceptual knowledge of the area of data science domain, feature and scope of applications.
3. To impart programming knowledge needed for data sciences.
4. To understand the different issues involved in the design and implementation of a data science applications.
5. To understand case studies of essential Data sciences applications.

Unit: 1
Introduction to Data Science: Concept of Data Science, Traits of Big data, Web Scraping, Analysis vs Reporting, Collection, storing,
processing, describing and modelling, statistical modelling and algorithm modelling, AI and data science, Myths of Data science

Unit: 2
Introduction to Programming Tools for Data Science: Toolkits using Python: Matplotlib, NumPy, Scikit-learn, NLTK, Visualizing
Data: Bar Charts, Line Charts, Scatterplots, Working with data: Reading Files, Scraping the Web,

Unit: 3
Data Science Methodology: Business Understanding, Analytic Approach, Data Requirements, Data Collection, Data Understanding,
data Preparation, Modeling, Evaluation, Deployment, feedback
 Unit: 4
Data Science Application: Prediction and elections, Recommendations and business analytics, clustering and text analytics

Course Outcomes:
CO1: Understand the value of data science and the process behind using it.
CO2: Use Python to gather, store, clean, analyse, and visualise data-sets.
CO3: Apply toolkits to formulate and test data hypotheses and uncover relationships within data-sets
CO4: Understand the data science methodology in the data science pipeline
CO5: Understand real-world challenges with several case studies
CO6: Gain experience in using the tools and techniques of data science to structure and complete projects focused on obtaining
actionable insights from complex data

Mapping of Paper No. ESC-CSE-308

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M M
CO3 S S S S M M S S S S S M S S S
CO4 S S S S S S S S S S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S S S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Joel Grus, "Data Science from Scratch: First Principles with Python", O'Reilly Media
2. AurélienGéron, "Hands-On Machine Learning with Scikit-Learn and Tensor Flow: Concepts, Tools, and Techniques to Build
Intelligent Systems", 1st Edition, O'Reilly Media
3. Jain V.K., “Data Sciences”, Khanna Publishing House, Delhi.
4. Jain V.K., “Big Data and Hadoop”, Khanna Publishing House, Delhi.
5. Data Science Workflow: Overview and Challenges by Philip Guo
6. Python for Data Analysis, O’Reilly Media.
7. Ian Goodfellow, YoshuaBengio and Aaron Courville, "Deep Learning", MIT Press
8. http://www.deeplearningbook.org
9. Jiawei Han and Jian Pei, "Data Mining Concepts and Techniques", Third Edition, Morgan Kaufmann Publishers
 PROJECT - I

Course code PROJ-CSE-322

Category Professional Core Course
Course title PROJECT- I
L T P Credits
Scheme and Credits 4 Semester 6
0 0 2
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Students will be assigned projects individually or in a group of not more than 3 students depending on the efforts required for
completion of project.

The project will have 4 stages:

(*Marks for internal evaluation are given in brackets)

1. Synopsis submission (5 marks),

2. 1stmid term progress evaluation (5 marks)
3. 2nd mid term progress evaluation (5 marks)
4. Final submission evaluation (10 marks).

The external examiner will evaluate the project on the basis of idea/quality of project, implementation of the project, project report and
viva.
 COMPILER DESIGN LAB

Course code LC-CSE-324

Category Professional Core Course
Course title CompilerDesign Lab
L T P Credits
Scheme and Credits 3 Semester 6
0 0 1.5
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Course Objectives:
1. Implementation of different concepts of lexical analysis.
2. Implementation of parsers.
3. Study and use of compiler design tools.

List of programs:
1. Write a Program for Token separation with a given expression.
2. Write a Program for Token separation with a given file.
3. Write a Program for Lexical analysis using LEX tools.
4. Write a Program to identify whether a given line is a comment or not.
5. Write a Program to check whether a given identifier is valid or not.
6. Write a Program to recognize strings under ‘a’, ‘a*b+’, ‘abb’.
7. Write a Program to simulate lexical analyser for validating operators.
8. Write a Program for implementation of Operator Precedence Parser.
9. Study of LEX and YACC tools:
10. Write a Program for implementation of calculator using YACC tool.
11. Write a Program for implementation of Recursive Descent Parser using LEX tool.
12. Write a Program for implementation of LL (1) Parser.
13. Write a Program for implementation of LALR Parser

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

 Course Outcomes:
CO1: The course will help in improving the programming skills of the students.
CO2: The implementation of different parsers will help in understanding of compiler designing.
CO3: Apply client-server principles to develop scalable and enterprise web applications.
CO4: Ability to design, develop, and implement a compiler for any language.
CO5: Able to use lex and yacc tools for developing a scanner and a parser.
CO6: Able to design and implement LL and LR parsers.

Mapping of Paper No. LC-CSE-324

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S M S S S S S S S S S S S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S M S S S S S S M S S
S = Strong, M = Medium, W = Weak
 ARTIFICIAL INTELLIGENCE LAB USING PYTHON

Course code LC-CSE-326

Category Professional Core Course
Course title Artificial Intelligence Lab Using Python
L T P Credits
Scheme and Credits 3 Semester 6
0 0 1.5
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

List of Program:

1. Write a Program to Implement Breadth First Search using Python.

2. Write a Program to Implement Depth First Search using Python.
3. Write a Program to Implement Tic-Tac-Toe game using Python.
4. Write a Program to Implement 8-Puzzle problem using Python.
5. Write a Program to Implement Water-Jug problem using Python.
6. Write a Program to Implement Travelling Salesman Problem using Python.
7. Write a Program to Implement Tower of Hanoi using Python.
8. Write a Program to Implement Monkey Banana Problem using Python.
9. Write a Program to Implement Missionaries-Cannibals Problems using Python.
10. Write a Program to Implement 8-Queens Problem using Python.

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

Course Outcomes:
CO1: Describe the Python language syntax including control statements, loops and functions to write programs for a wide variety
problem in mathematics, science, and games.
CO2: Examine the core data structures like lists, dictionaries, tuples and sets in Python to store, process and sort the data. L3
CO3: Interpret the concepts of Object-oriented programming as used in Python using encapsulation, polymorphism and
inheritance.
 CO4: Discover the capabilities of Python regular expression for data verification and utilize matrices for building performance
efficient Python programs.
CO5: Identify the external modules for creating and writing data to excel files and inspect the file operations to navigate the file
systems. CO6: Utilize advanced package like NLTK for implementing artificial intelligence.

Mapping of Paper No. LC-CSE-326

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S M S S
CO2 M S S S S S S S S S S S S M S
CO3 S M S S M M S S S S S S S S S
CO4 S S S S S S S S M S S S S S M
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S S S S
S = Strong, M = Medium, W = Weak
 ADVANCED JAVA LAB

Course code LC-CSE-328

Category Professional Core Course
Course title Advanced Java Lab
L T P Credits
Scheme and Credits 2 Semester 6
0 0 1
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

Students have to write at list 15 programs based on the course PCC-CSE-306

Course Outcome:
CO1: demonstrate a high degree of proficiency in programming enabling them for careers in software engineering with competencies to
design, develop, implement and integrate software applications and computer systems.
CO2: Design GUI using AWT and Swing.
CO3: Develop program using event handling.
CO4: Use network concepts (client/server, socket) in the program.
CO5: Develop program using JDBC connectivity to access data from database and execute different queries to get required result.
CO6: Develop web based program using servlet and JSPVisit for more Learning Resources

Mapping of Paper No. LC-CSE-328

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S S S S M S S S S S
CO2 M S S S S S S S S S M S S M M
CO3 S M S S M S S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S M S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
 Constitution of India

Course code MC-317

Category Mandatory Course
Course title Constitution of India
Scheme and credits L T P Credits
2 0 0 0

Course Objectives:
1. Understand the premises informing the twin themes of liberty and freedom from a civil rights perspective.
2. To address the growth of Indian opinion regarding modern Indian intellectuals’ constitutional role and entitlement to civil and
economic rights as well as the emergence of nationhood in the early years of Indian nationalism.
3. To address the role of socialism in India after the commencement of the Bolshevik Revolution in 1917 and its impact on the initial
drafting of the Indian Constitution.

Unit: I
Philosophy of Indian Constitution: Salient features of Indian Constitution, Preamble, and Nature of Indian Constitution, Procedure for
amendment of the Constitution.
Unit: II
Federal structure and distribution of legislative and financial powers between the Union and the States
Unit: III
Organs of Governance: President – Qualification and Powers of the President, Governor- Qualification and Powers of Governor,
Parliament: Composition, Qualifications and Disqualifications, Judiciary: Appointment, Tenure and Removal of Judges.

Unit: IV
Fundamental Rights: Origin and development of Fundamental rights, Need for fundamental rights. Introduction to Right to equality ,
Right to freedom, Right against exploitation, Right to freedom of religion, Cultural and Education rights and Fundamental duties.
 Course Outcomes:
CO1: Discuss the growth of the demand for civil rights in India for the bulk of Indians beforethe arrival of Gandhi in Indian politics.
CO2: Discuss the intellectual origins of the framework of argument that informed the conceptualization of social reforms leading to
revolution in India.
CO3: Discuss the circumstances surrounding the foundation of the Congress Socialist Party [CSP] under the leadership of Jawaharlal
Nehru.
C O 4 : T o d i s c u s s the eventual failure of the proposal of direct elections through adult suffrage in the Indian Constitution.
CO5: Discuss the passage of the Hindu Code Bill of 1956.
CO6: To discuss and understand fundamental rights.

References:
1. The Constitution of India, 1950 (Bare Act), Government Publication.
2. Dr. S.N. Busi, Dr. B.R. Ambedkar framing of Indian Constitution, latest Edition
3. M.P. Jain, Indian Constitution Law, Lexis Nexis, latest edition
4. D.D. Basu, Introduction to Constitution of India, Lexis Nexis, latest edition.

The examination of the regular students will be conducted by the concerned college/Institute internally. Each student will be required to
score minimum 40% marks to qualify in the paper. The marks will not be included in determining the percentage of marks
obtained forthe award of degree. However, these marks will be shown in the detailed marks certificate of the students.
 ADVANCED DATABASE MANAGEMENT SYSTEM

Course code PEC-CSE-310

Category Professional Elective Course
Course title Advanced Database Management System
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objective:
1. To understand DBMS Components, Advantages and Disadvantages.
2. Understanding Data modeling: ER, EER, Network, Hierarchical and Relational data models.
3. Understanding normalization, general strategies for query processing, query processor, syntax analyzer, Query
decomposition, Heuristic Query optimization.
4. To understand transaction concept, schedules, serializability, locking and concurrency control protocols.
Unit: 1
Introduction: Architecture, Advantages, Disadvantages, Data models, relational algebra, SQL, Normal forms.
Query Processing: General strategies for query processing, transformations, expected size, statistics in estimation, query improvement.
Query evaluation, view processing, query processor.
Unit: 2
Recovery: Reliability, Transactions, recovery in centralized DBMS, reflecting updates, Buffer management logging schemes, disaster
recovery.
Concurrency: Introduction, Serializability, Concurrency control, Locking schemes, Timestamp based ordering, Optimistic, Scheduling,
Multiversion techniques, Deadlocks.
Unit: 3
Parallel and Distributed Databases: Distributed Data Storage – Fragmentation & Replication, Location and Fragment. Transparency
Distributed Query Processing and Optimization, Distributed Transaction Modeling and concurrency Control, Distributed Deadlock,
Commit Protocols, Design of Parallel Databases, Parallel Query Evaluation.
 Unit: 4
Objected Oriented and Object Relational Databases: Modeling Complex Data Semantics, Specialization, Generalization, Aggregation
and Association, Objects, Object Identity, Equality and Object Reference, Architecture of Object Oriented and Object Relational
Databases

Course Outcomes:
CO1: Students will get understanding of DBMS Components, Its advantages and disadvantages.
CO2: Understanding about various types of Data modeling: ER, EER, Network, Hierarchical and Relational data models.
CO3: Understanding normalization, general strategies for query processing, query processor, syntax analyzer, Query
decomposition, Heuristic Query optimization.
CO4: Describe the fundamental elements of relational database management systems
CO5: Design ER-models to represent simple database application scenarios
CO6: Convert the ER-model to relational tables, populate relational database and formulate SQL queries on data

Mapping of Paper No. PEC-CSE-310

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S S S S M S S S S S
CO2 M S S S S S S S M S S S S M M
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S S S S S S S S
CO5 S S S S M S S S S S S S S S S
CO6 S S S S S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Elmarsi, Navathe, Somayajulu, Gupta, “Fundamentals of Database Systems”, 4th Edition, Pearson Education,2007
2. Garcia, Ullman, Widom, “Database Systems, The complete book”, Pearson Education, 2007
3. R. Ramakrishnan, “Database Management Systems”, McGraw Hill International Editions, 1998
4. Date, Kannan, Swaminathan, “An Introduction to Database Systems”, 8th Edition Pearson Education, 2007
5. Singh S.K., “Database System Concepts, design and application”, Pearson Education, 2006.
6. Silberscatz, Korth, Sudarshan, “Database System Concepts”, Mcgraw Hill, 6th Edition, 2006
7. W. Kim, “Modern Database Systems”, 1995, ACM Press, Addision Wesley.
 MOBILE APPLICATIONS DEVELOPMENT

Course code PEC-CSE-312

Category Professional Elective Course
Course title Mobile applications development
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. Introduce the students with the various “Next Generation Technologies” in the area of mobile computing
2. Assist students understand the various Mobile operating Systems
3. Explore the findings using Android Technologies

Unit: 1
Introduction: Mobile operating system, Operating system structure, Constraints and Restrictions, Hardware configuration with mobile
operating system, Features: Multitasking Scheduling, Memory Allocation, File System Interface, Keypad Interface, I/O Interface,
Protection and Security, Multimedia features

Unit: 2
Introduction to Mobile development IDE's, Introduction to Worklight basics, Optimization, pages and fragments , Writing a basic
program- in Worklight Studio, Client technologies, Client side debugging, Creating adapters, Invoking adapters from Worklight Client
application, Common Controls, Using Java in adapters, Programming exercise with Skins, Understanding Apache Cordova.

Unit: 3
Understanding Apple iOS development, Android development, Shell Development, Creating Java ME application, Exploring the
Worklight Server, Working with UI frameworks, Authentication, Push notification, SMS Notifications, Globalization.
 Unit: 4
Android: Introduction to Android, Architecture, memory managemnt, communication protocols, application development methods,
deployment.
iOS: Introduction to iOS, Architecture, memory management, communication protocols, application development methods, deployment

Course Outcomes:
CO1: Build enterprise level mobile applications with Kotlin on Android
CO2: Understand both the basic and advanced concepts of Kotlin
CO3: Understand why use Kotlin over Java
CO4: Install and configure Android Studio
CO5: Explain and use key Android programming concepts
CO6: Deploy the application on Google Play

Mapping of Paper No. PEC-CSE-312

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S S S S S M S S S S S M S S S
CO4 S S S S S S S S S S S S S S M
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Anubhav Pradhan, Anil V Deshpande, “ Mobile Apps Development” Edition:
2. Jeff McWherter, Scott Gowell “Professional Mobile Application Development”, John Wiley & Sons, 2012.
3. Barry Burd, “Android Application Development All in one for Dummies”, Edition: I
4. Teach Yourself Android Application Development In 24 Hours, Edition: I, Publication: SAMS
5. Neal Goldstein, Tony Bove, “iPhone Application Development All-In-One For Dummies”, John Wiley & Sons
6. Henry Lee, Eugene Chuvyrov, “Beginning Windows Phone App Development”, Apress, 2012.
7. Jochen Schiller,“Mobile Communications”, Addison-Wesley, 2nd edition, 2004.
8. Stojmenovic and Cacute, “Handbook of Wireless Networks and Mobile Computing”, Wiley, 2002, ISBN 0471419028.
 COMPUTER GRAPHICS

Course code PEC-CSE-314

Category Professional Elective Course
Course title Computer Graphics
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. To have basic understanding of the core concepts of Computer Graphics.
2. Understand scan conversion, 2D, 3D – transformation and viewing.
3. To be able to create interactive computer Graphics with understanding of shading, image processing and illumination model.

Unit: 1
Introduction to Computer Graphics: What is Computer Graphics, Computer Graphics Applications, Computer Graphics Hardware and
software; Two dimensional Graphics Primitives: Points and Lines, Scan Conversion: Point, Line, Circle; Region Filling: Scanline
algorithm, Polygon filling algorithm, boundary filled algorithm.
Unit: 2
Two dimensional transformations: Geometric, Coordinate and, composite transformation. Two Dimensional Viewing: window to
view port mapping; Clipping: point, line, polygon, curve and text clipping
Unit: 3
Three-dimensional transformations: Three dimensional graphics concept, Geometric and Coordinate transformations, Viewing in 3D:
Projection, Taxonomy of projection,
Hidden surface removal: Introduction to hidden surface removal, The Z- buffer algorithm, The painter’s algorithm, Scanline algorithm,
Sub-division algorithm.
Unit: 4
Representing Curves and Surfaces: Parametric representation of curves: Bezier curves, B- Spline curves. Parametric representation of
surfaces; Interpolation method.
 Illumination, shading, image manipulation: Illumination models, shading models for polygons, shadows, transparency, image
processing.
Course Outcomes:
CO1: To be able to implement picture on screen using projection, shading, image processing and illumination model.
CO2: Understand the basics of computer graphics, different graphics systems and applications of computer graphics.
CO3: Discuss various algorithms for scan conversion and filling of basic objects and their comparative analysis.
CO4: Use of geometric transformations on graphics objects and their application in composite form.
CO5: Extract scene with different clipping methods and its transformation to graphics display device.
CO6: Explore projections and visible surface detection techniques for display of 3D scene on 2D screen.

Mapping of Paper No. PEC-CSE-314

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M M
CO3 S M S S M S S S S S S M S S S
CO4 S S S M S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S S S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Computer Graphics Principles and Practices second edition by James D. Foley, Andeies van Dam, Stevan K. Feiner and Johb F.
Hughes, 2000, Addision Wesley.
2. Computer Graphics by Donald Hearn and M.Pauline Baker, 2 Edition, 1999, PHI
3. Computer Graphics by Z. Xiang, R. Plastock, 2nd Edition, TMH Education.
4. Procedural Elements for Computer Graphics – David F. Rogers, 2001, T.M.H Second Edition
5. Fundamentals of 3-Dimensional Computer Graphics by Alan Watt, 1999, Addision Wesley.
6. Computer Graphics: Secrets and Solutions by Corrign John, BPB
7. Graphics, GUI, Games & Multimedia Projects in C by Pilania&Mahendra, Standard Publ.
8. Computer Graphics Secrets and solutions by Corrign John, 1994, BPV
9. Introduction to Computer Graphics by N. Krishanmurthy T.M.H 2002
 COMMUNICATION ENGINEERING

Course code PEC-CSE-330 (Common with ECE)

Category Program Elective Course
Course title Communication Engineering
L T P Credits
Scheme and Credits 0
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objective:
1. The course will give students about depth knowledge of the communication system.
2. To introduce students to random process and fundamental theorems
3. To make awareness of information theory and coding techniques

Unit:1
SPECTRAL ANALYSIS:
Fourier series, Fourier transforms, Convolution Theorem, Correlation, Cross-Correlation and autocorrelation.
Unit: 2
INFORMATION THEORY:
Introduction to information and entropy, channel capacity for discrete and continuous channels, Shannon’s Theorem, Shannon-Hartley
Theorem, Noisy channels, coding theory : Shannon-Fano coding, minimum redundance coding, maximization of entropy of a
continuous message transmission rate, effect of medium on the information, selection of channels ,effect of noise and its minimization.
Unit:3
RANDOM SIGNAL THEORY:
Representation of random signals, concept of probability, probability of joint occurrence, conditional probability, discrete probability
theory, continuous random variables, probability distribution function, probability density function, joint probability density functions.
Unit:4
RANDOM SIGNAL THEORY:
Statistical average and moments, Ergodic processes, correlation Function, power spectral density, central limit theory, response of linear
 system to random signals. Error function Covariance relation among the spectral densities of the two input-output random processes.
Cross spectral densities, optimum filters. Introduction to Linear Block Code abd cyclic Codes

Course Outcomes:
CO1: To Study and Derive equations for entropy mutual information and channel capacity for all types of channels.
CO2: To acquire the knowledge about Fourier series and Fourier transform signal analysis tool.
CO3: Design a digital communication system by selecting an appropriate error correcting codes for a particular application.
CO4: To learn about Probabilityof Random signal theory and process.
CO5: Formulate the basic equations of linear block codes and a cyclic code.
CO6: Compare the performance of digital communication system by evaluating the probability of error for different error
correcting codes

Mapping of Paper No. PEC-CSE-330

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S M S S M S S S S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S M S S S M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S M
CO6 S S S S S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Principles of Communication Systems: Taub Schiling; TMH
2. Communication Systems: Singh and Sapre ; TMH
3. Communication Systems: A Bruce Carlson; TMH
 DISTRIBUTED SYSTEM

Course code PEC-CSE-316

Category Professional Elective Course
Course title Distributed System
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. To examine the fundamental principles of distributed systems, and provide students hands-on experience in developing
distributed protocols.
2. Analyze the issues in distributed operating systems and to address these distributed systems issues in a broader sense. Emphasis
will be placed on communication, process, naming, synchronization and fault tolerance.

Unit: 1
Introduction: Distributed Operating Systems Definition and goals, Hardware and Software concepts, Design issues.
Communication in Distributed System: Computer Network and Layered protocols, Message passing and related issues,
synchronization, Client Server model & its implementation, remote procedure call and implementation issues, Case Studies: SUN RPC,
DEC RPC
Unit: 2
Synchronization in Distributed System: Clock synchronization and related algorithms, mutual exclusion, Deadlock in distributed
systems. Processes and processors in Distributed systems: Threads, system model, processor allocation, scheduling in distributed
systems: Load balancing and sharing approach, fault tolerance, real time distributed systems, Process migration and related issues
 Unit: 3
Distributed File systems: Introduction, features & goal of distributed file system, file models, file accessing models, file sharing
semantics, file caching scheme, file replication, fault tolerance, trends in distributed file system, case study.
Distributed Shared Memory: Introduction, general architecture of DSM systems, design and implementation issues of DSM,
granularity, structure of shared memory space, consistency models, replacement strategy, thrashing
Unit: 4
Security Issues: Introduction of Security in Distributed OS, Overview of security techniques, features, Need, Access Control, Security
Management
Distributed Web-based Systems: Architecture, Processes, Communication, Naming, Synchronization
Case Studies: JAVA RMI, Sun Network File System, Google Case Study

Course Outcomes:
CO1: List the principles of distributed systems and describe the problems and challenges associated with these principles.
CO2: Understand Distributed Computing techniques, Synchronous and Processes.
CO3: Apply Shared Data access and Files concepts.
CO4: Design distributed system that fulfills requirements with regards to key distributed systems properties.
CO5: Understand Distributed File Systems and Distributed Shared Memory.
CO6: Apply Distributed web-based system and understand the importance of security in distributed system

Mapping of Paper No. PEC-CSE-316

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S S
CO2 M S S S S S S S S S M S S M S
CO3 S M S S M S S S S S S M S S S
CO4 S S M S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak
References:
1. Distributed Operating Systems by Andrew S Tannebaum, Pearson
2. Distributed Operating Systems Concepts and Design, Pradeep K. Sinha, PHI
3. Distributed Systems:Concepts and Design by George Coulouris, Jean Dollimore, Tim Kindberg, Pearson
4. Distributed Computing by Sunita Mahajan & Seema Shah OXFORD
5. Distributed Systems: Principles and Paradigms by Andrew S Tanebaum, Maarten Van Steen, PHI
6. Distributed Computing, Fundamentals, Simulations and Advanced topics, 2nd Edition, HagitAttiya and Jennifer Welch, Wiley
India
 INFORMATION TECHNOLOGY & INDUSTRY BUSINESS SKILLS

Course code PEC-CSE-318

Category Professional Core Course
Course title Information Technology & Industry Business Skills
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
1. To understand the novel information technology techniques and industry business skills.
2. To study about the concept of amazon web services.
3. To understand the use of cloud in web services and their different application.
4. To study business models used in industry and their implementation.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Unit: 1
Web Services: History and Introduction to cloud computing, Introduction to AWS, Instances creation methods in AWS, Scalable
Computing in AWS, Storage in AWS, Persistence in AWS, Routing from AWS, Delivering strategies with AWS, Messaging management
inside AWS, Communicating technique with AWS, AWS Free Tier, Identity Access Management, Security Assertion Markup language,
Simple Storage Service, introduction to Google APP Engine, Azure computing method, service models, deployments models of cloud
computing, difference between AWS, AZURE, Google Cloud;
Unit: 2
Cloud: Amazon Elastic Compute Cloud, Elastic Block Store, Security Group management, Amazon Machine Images, Storing data in
the cloud, storing your objects: S3 and Glacier, ELB and SQS, auto-scaling and Cloud Watch, Cloud Formation, Elastic Beanstalk, and
Ops Works, RDS, fault-tolerance, scaling, AZURE architecture and services, Google cloud applications.
Unit: 3
Business: Business models, Building blocks of Sales force, Understand the Security model, Understand the Data model, Configure and
 manage Sales and Service Cloud, Learn about Sales force Objects, create, rename or modify objects, validation rules, Create different
field types and validation rules, Sales Cloud and Service Cloud modules, reports and dashboard, Sales force A Chatter, and Social
features, chatter, application lifecycle, visual workflow;
Unit: 4
Security & Applications: security group, NACL, difference between security group and NACL, AWS-Data pipeline, Simple queue
services, Simple workflow services, Simple notification Services, Elastic Transcoder.

Course Outcomes:
CO1: For a given region the availability of resources and cost management.
CO2: For a given application scalable model and selection of services.
CO3: Identify and describe the key environmental influences and constraints on how the business operates in general.
CO4: Recognize the principles of authority, leadership, behaviour of individual and team, motivation of team in pursuit of wider
departmental and organizational aims and objectives.
CO5: Understand management and organizational behaviour, concepts associated with continuous improvement in individual and
group processes.
CO6: Translate management and organizational behaviour theories into practice that will result in organizational effectiveness,
efficiency, and human resource development.

Mapping of Paper No. PEC-CSE-318

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S S S S M S S S S S
CO2 M S S S S S S S S S M S S S M
CO3 S M S S M M S S S S S M S S S
CO4 S S S S S S S S M S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Amazon Web Services in Action by Michael Wittig and Andreas Wittig, Manning Publications;
2. AWS Certified Solutions Architect by Joe Baron, Hisham Baz, Tim Bixler, Biff Gaut, Kevin E. Kelly, Wiley publication;
 MOBILE AND WIRELESS COMMUNICATION

Course code PCC-CSE-320

Category Professional Core Course
Course title Mobile and wireless communication
L T P Credits
Scheme and Credits 0 Semester 6
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Course Objectives:
1. Understand the wireless/cellular radio concepts such as frequency reuse, handoff and interference between mobiles and base
stations.
2. Identify the techno-political aspects of wireless and mobile communications such as the allocation of the limited wireless
spectrum by regulatory agencies.
3. Understand the information theoretical aspects such as channel capacity, propagation effects, modeling the impact of signal
bandwidth and motion in mobile systems.
4. Describe the current and future Mobile Communication Systems, GSM, Satellite, Broadcasting, Bluetooth, Wireless LANs,
Mobile Adhoc Networks.
5. Describe the mobility support mechanism, WWW and WAPs.

Unit: 1
Introduction: Application, History, Market Scenario, Reference Model and Overview, Wireless Local Loop and Cellular system.
Wireless Transmission: Frequencies, Signals, Antennae, Signal Propagation, Multiplexing, Modulation, Spread Spectrum.
MAC Layer: Specialized MAC, SDMA, FDMA, TDMA – Fixed TDM, Classical ALOHA, Slotted, ALOHA, CSMA, DAMA, PKMA,
Reservation TDMA. Collision Avoidance, Polling, Inhibit Sense Multiple Access, CDMA.
Broadcasting: Unidirectional Distribution Systems, Digital Audio Broadcasting, Digital Video Broadcasting, Convergence of Mobile and
Broadcasting Techniques.
Unit: 2
GSM: Mobile Services, Architecture Radio, Interface, Protocol, Localization, Calling Handover, Security, New data services.
Wireless LAN: IEEE 802 11- System and Protocol Architecture, Physical Layer, MAC Layered Management.
Bluetooth: User scenarios, Physical layer, MAC Layer, Networking, Security and Link Management, Wimax
Unit: 3
Mobile Network Layer: Mobile IP-Goals, Assumptions, Requirement, Entities, Terminology, IP Packet delivery, Agent
Advertisement and Discovery, Registration, Tunneling, Encapsulation, Optimization, Reserve Tunneling, Security, IPv6 , DHCP.
Mobile Adhoc Networks: Routing, Destination Sequence Distance Vector, Dynamic Source Routing, Hierarchical algorithms,
Performance Metrics.
Mobile Transport Layer: Traditional TCP, Indirect TCP, Snooping, TCP, Mobile TCP, Fast- retransmission TCP, Transaction oriented
TCP.
Unit: 4
Satellite Systems: History, Applications, GEO, LEO, MEO, Routing, Localization, Handover in Satellite System.
Support for Mobility: File System, WWW, HTML, System Architecture.
WAP: Architecture, Wireless Datagram, Protocol, Wireless Transport Layer Security, Wireless Transaction Protocol, Application
Environment, Telephony Applications.

Course Outcomes:
CO1: Explain the principles and theories of mobile computing technologies.
CO2: Describe infrastructures and technologies of mobile computing technologies.
CO3: List applications in different domains that mobile computing offers to the public, employees, and businesses.
CO4: Describe the possible future of mobile computing technologies and applications.
CO5: Effectively communicate course work through written and oral presentations
CO6: Utilize mobile computing nomenclature to describe and analyze existing mobile computing frameworks and architectures.
Mapping of Paper No. PCC-CSE-320

PSO1

PSO2

PSO3

PSO4
PO10

PO11
Course

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Outcomes
CO1 S S S S S S M S S M S S S S S
CO2 M S S S S S S S S S S S S S M
CO3 S M S S M M S S S S S M S S S
CO4 S S S S S S S M S S S S S S S
CO5 S S S S S S S S S S S S S S S
CO6 S S S M S S S S S S S S M S S
S = Strong, M = Medium, W = Weak

References:
1. Jochen Schiller, “MobileCommunication”, Pearson Education, 2002
2. LEE, “Mobile Cellular Telecommunications”, McGRAW-Hill, 2nd Edition.
3. Theodore S Rappaport, “Wireless Communications”, Pearson Education.
 Indira Gandhi University Meerpur Rewari
(A State University established under Haryana Act No.29 of 2013)

Examination Scheme & Syllabus for Bachelor of Technology (Semester- VII & VIII)

OUTCOME BASED EDUCATION SYSTEM /

LEARNING OUTCOME CURRICULUM FRAMEWORK

OBES / LOCF, CBCS CURRICULUM (w.e.f. 2020-21)

VISION AND MISSION OF THE DEPARTMENT

VISION

To train students to be highly effective instructors, researchers, developers and contributors to IT companies globally. Be regarded as a
prestigious centre of scholarly achievement worldwide.

MISSION

1. To foster advance research and best education in IT domain.

2. To create skilled employees for businesses and industries based on latest IT technologies like artificial intelligence, data science and
IoT etc.
3. To offer learning environment that is centered on the needs of the students in order to help in their overall development.
 COURSE CODE AND DEFINITIONS

Course Code Definition

L Lecture
T Tutorial
P Practical
BSC Basic Science Courses
ESC Engineering Science Courses
HSMC Humanities and Social Sciences including Management courses
PCC Professional Core Courses
LC Laboratory Courses
MC Mandatory Courses
PT Practical Training
S Seminar
INTPR Industrial Training Project

General Notes:
1. Students will be allowed to use non programmable scientific calculator. However, sharing of calculator will not be permitted
in the examination.
2. Students will be permitted to opt for any elective course run by the department. However, the department shall offer those electives
for which they have expertise. The choice of the students for any elective shall not be binding for the department to offer, if the
department does not have expertise. To run the elective course a minimum of 1/3rd students of the class should opt for it.
 B.Tech (COMPUTER SCIENCE & ENGINEERING)
Scheme of Studies/Examination Semester 7th
w.e.f. 2021-2022

Hours per Duration

Examination Schedule (Marks)
week Total of Exam
Sr. Contac t (Hours)
Category Course Code Course Title Credit Marks
No. Hrs. per L
of Theory Practical Tot al
L T P week
Class
work
Professional
1 PCC-CSE- Neural 3 0 0 3 3 25 75 100 3
Core
401 Networks
Course
Professional
2 PCC-CSE- Machine 3 0 0 3 3 25 75 100 3
Core
403 Learning
Course
Professional
Refer to Professional
3 Elective 3 0 0 3 3 25 75 100 3
Annexure IV Elective–IV
Course
Professional
Refer to Professional
3 Elective 3 0 0 3 3 25 75 100 3
Annexure V Elective–V
Course
Open Refer to
4 Elective Annexure Open 3 0 0 3 3 25 75 100 3
Course OEC-I Elective–I

Professional Neural
5 LC-CSE-421 0 0 2 2 1 25 - 25 50 3
Core Networks
Course Lab
Professional Machine
6 LC-CSE-423 0 0 2 2 1 25 25 50 3
Core Learning
Course with Python
Lab
Professional Practical
7 PT-CSE-425 0 0 0 1 - - - - - -
Core Training- II
Course
TOTAL CREDIT 17 175 375 50 600
 NOTE:
1. Practical Training II: The evaluation of Practical Training-II will be based on seminar, viva-voce, report submitted by the
students. According to performance, the students will be awarded grades A, B, C, F. A student who is awarded ‘F’ grade is
required to repeat Practical Training.
2. Choose one subject from each Professional Elective–IV, Professional Elective–V and Open Elective– I. List of elective subjects is
attached as annexure.
3. An elective paper will be offered to the students when at least 15 students will choose that subject and the expertise of the same is
available in the Department/Institute.
Annexure IV: Professional Elective -IV
1. PEC-CSE-403: Software Project Management
2. PEC-CSE-405: Web Mining
3. PEC-CSE-407: Predictive Analysis
4. PEC-CSE-409: Big Data Analytics
Annexure V: Professional Elective -V
1. PEC-CSE-411: Network Security and cryptography
2. PEC-CSE-413: Software Testing
3. PEC-CSE-415: Cyber Security Threats
4. PEC-CSE-417: Advanced Computer Architecture
Annexure OEC-I: Open Elective-I
1. OEC-ECE-451: Electronic Principles
2. HSMC-08: Fundamentals of Management
3. OEC-CE-451: Disaster Management
4. HSMC-10: English for Professionals
 B.Tech ( COMPUTER SCIENCE & ENGINEERING )
Scheme of Studies/Examination Semester 8th
w.e.f. 2021-2022

Hours per
Examination Schedule (Marks)
week Duration
Total
of Exam
Sr. Contac t
Category Course Code Course Title Credit (Hours)
No. Hrs. per Internal
L T P L
week Assessment Theory Practical Tot al

Industrial
Professional Training/
1 Core Course INTPR-CSE-402 Institutional 0 0 6 6 10 200 - 300 500 3
Project
TOTAL CREDIT 10 200 - 300 500

2 Hours per week per batch for one teacher and batch size will be decided by theHOD/Chairperson of the department.

Procedure for Examination and continuous Assessment

(A) External Exam Marks
1. Project Evaluation 100 Marks
2. Project Seminar 100 Marks
3. Project Viva 100 marks

(B) Continuous Assessment Marks

1. Assessment by Internal Examiner and Viva 150 Marks
(Before the Committee Constituted by
Chairman of the Department)
2. Assessment by Industrial Guide/Chairperson 50 Marks

NOTE: It is Optional. A student can earn at most 6 credits during the duration of the8th semester subject to the passing of
at least two MOOC/NPTEL courses (carrying minimum 2/3 credits). The MOOC/NPTEL chosen by the student should not be on
offer/scheme of the degree. These credits will be considered in the Final Mark sheet of the students.
 NEURAL NETWORK

Course code PCC-CSE-401

Category Professional Core Course

Course title Neural Networks
L T P Credits
Scheme and Credits Semester 7
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
1. To understand the different issues involved in the design and implementation of a Neural Networks.
2. To study the basic of neural network and its activation functions.
3. To understand and use of perceptron and its application in real world
4. To develop an understanding of essential NN concepts such as: learning, feed forward and feed backward
5. To design and build a simple NN model to solve a problem

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

UNIT1
Overview of biological neurons: Structure of biological neuron, neurobiological analogy, Biological neuron equivalencies to artificial
neuron model, Evolution of neural network.
Activation Functions: Threshold functions, Signum function, Sigmoid function, Tan- hyperbolic function, Stochastic function, Ramp
function, Linear function, Identity function.
ANN Architecture: Feed forward network, Feed backward network, single and multilayer network, fully recurrent network,
UNIT2
McCulloch and Pits Neural Network (MCP Model): Architecture, Solution of AND, OR function using MCP model, Hebb Model:
Architecture, training and testing, Hebb networkfor AND function.
Perceptron Network: Architecture, training, Testing, single and multi-output model, Perceptron for AND function
Linear function, application of linear model, linear seperatablity, solution of OR function using liner seperatablity model.
 UNIT3
Learning: Supervised, Unsupervised, reinforcement learning, Gradient Decent algorithm, generalized delta learning rule, Hebbian
learning, Competitive learning, Back propogation Network: Architecture, training and testing,
UNIT4
Associative memory: Auto associative and Hetro associative memory and their architecture, training (insertion) and testing (Retrieval)
algorithm using Hebb rule and Outer Product rule. Storage capacity, Testing of associative memory for missing and mistaken data,
Bidirectional memory

Course Outcomes:
CO1. For a given conceptual problem student will able to analyze the problem and able to visualize in NN
CO2. Students will be familiar with different NN models.
CO3. Students will be able to understand the concept of learning in NN.
CO4. Grasping the use of neural nets for pattern recognition problems.
CO5. Understand the application areas of neural networks
CO6. Understand building blocks of Neural Networks.
Mapping of Paper No. PCC-CSE-401

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S S S S S S S S S S S S S
CO2 S S M S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 M S S S M S S S S S S S S S S
CO5 S S S S S S S S S M S S S S M
CO6 S S S S S M S S S S S S S S M
S = Strong, M = Medium, W = Weak
Text Books:
1. Introduction to artificial Neural systems by Jacek M. Zurada, 1994, Jaico Publ. House.
2. Principles of Soft Computing by S.N. Deepa, S.N. Sivanandam., Weley publication

Reference Books:
1. “Neural Networks :A Comprehensive formulation”, Simon Haykin, 1998, AW
2. “Neural Networks”, Kosko, 1992, PHI.
3. “Neural Network Fundamentals” – N.K. Bose , P. Liang, 2002, T.M.H
4. Neural Network , T.N.Shankar, University Science Press
5. Neuro Fuzzy Systems, Lamba, V.K., University Science Press
 MACHINE LEARNING

Coursecode PCC-CSE-403

Category Professional Core Course

Coursetitle Machine Learning
L T P Credi
Scheme and Credits ts Semester-7
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Objectives of the course

1. To learn the basic concept of machine learning and types of machine learning.
2. To design and analyze various machine learning algorithms and techniques with a modern outlook focusing on recent advances.
3. Explore supervised and unsupervised learning paradigms of machine learning.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Unit-1
Introduction: Machine Learning: Definition, History, Need, Features, Block diagrammatic representation of learning machines,
Classification of Machine Learning: Supervised learning, Unsupervised learning, Reinforcement Learning, Machine Learning life cycle,
Applications of Machine Learning.
Unit-2
Dimensionality Reduction- Dimensionality reduction: Definition,Row vector and Column vector,how to represent a dataset, how to
represent a dataset as a Matrix, Data preprocessing in Machine Learning: Feature Normalization, Mean of a data matrix, Column
Standardization, Co-variance of a Data Matrix, Principal Component Analysis for Dimensionality reduction.
Unit-3
Supervised Learning- Supervised Learning: Definition, how it works. Types of Supervised learning algorithms k- Nearest Neighbours,
Naïve Bayes, Decision Trees, Naive Bayes, Linear Regression, Logistic Regression, Support Vector Machines.
Unit-4
Unsupervised Learning -Unsupervised Learning: Clustering: K-means. Ensemble Methods: Boosting, Bagging, Random Forests.
Evaluation: Performance measurement of models in terms of accuracy, confusion matrix, precision & recall, F1-score, receiver Operating
Characteristic Curve (ROC) curve and AUC, Median absolute deviation (MAD), Distribution of errors
 Course Outcomes
CO1. Learn the basics of learning problems with hypothesis and version spaces.
CO2. Understand the features of machine learning to apply on real world problems .
CO3. Characterize the machine learning algorithms as supervised learning and unsupervised learning and Apply and analyzethe various algorithms of
supervised and unsupervised learning.
CO4 . Analyze the concept of neural networks for learning linear and non-linear activation functions.
CO5. Learn the concepts in Bayesian analysis from probability models and methods.
CO6. Understand the fundamental concepts of Genetic Algorithm and Analyze and design the genetic algorithms for optimization engineering
problems.

Mapping of Paper No. PCC-CSE-403

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S M S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M M
CO4 M S S S M S S S S S S S S S S
CO5 S S S S S S S M M S S S S S S
CO6 S S S S S M S S S S S S S S S
S = Strong, M = Medium, W = Weak

Text books:
1. E. Alpaydin, Introduction to Machine Learning, Prentice Hall of India, 2006.
2. T Hastie, R Tibshirani and J Friedman, The Elements of Statistical Learning Data Mining, Inference, and Prediction, 2nd Edition,
Springer, 2009.
3. C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2010.

Reference books:
1. R. O. Duda, P. E. Hart, and D.G. Stork, Pattern Classification, John Wiley and Sons, 2012.
2. Simon O. Haykin, Neural Networks and Learning Machines, Pearson Education, 2016
 NEURAL NETWORKS LAB

Coursecode LC-CSE-421

Category Professional Core Course

Coursetitle Neural Networks Lab
L T P Credi
Scheme and Credits ts Semester 7
0 0 2 1
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam

Objectives of the course

1. To understand the different issues involved in the design and implementation of a Neural Networks.
2. To implement the basic of neural network and its activation functions.
3. To develop an understanding of essential NN concepts such as: learning, feed forward and feed backward
4. To design and implement a simple NN model to solve a problem

Practical problems:
1. Introduction to Matlab in context with NN.
2. Plotting of Activation Functions: Threshold functions, Signum function, Sigmoid function, Tan-hyperbolic function, Ramp function,
Identity function using matlab
3. Implementation of some basic model like MCP with suitable example.
4. Implementation of Hebb model with suitable example.
5. How the weights and bias values affect the output of a neuron.
6. How the choice of activation function (or transfer function) affects the output of a neuron. Experiment with
7. Implementation of linearly separable concept for a problem.
8. To study some basic neuron models and learning algorithms by using Matlab’s neural network toolbox.

Outcomes of the course

Co1. For a given conceptual problem student will be able to analyze the problem and ableto visualize using NN
CO2. Students will be familiar with different NN models and its implementation.
CO3. Students will be able to understand the concept of learning in NN and its implementation.
CO4. Apply Artificial Neural Network models to handle uncertainty and solve engineering problems.
CO5. Recognize the feasibility of applying a Neuro model for a particular problem.
CO6. Identify and describe Artificial Neural Network techniques in building intelligent machines.
 Mapping of Paper No. LC-CSE-421

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S M S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 M S S S M S S S S S S S S S S
CO5 S S S S S S S S M S S S S M S
CO6 S S S S S M S S M S S S S S S
S = Strong, M = Medium, W = Weak
 MACHINE LEARNING WITH PYTHON

Coursecode LC-CSE-423

Category MACHINE LEARNING WITH PYTHON

Course title MACHINE LEARNING WITH PYTHON LAB
L T P Cre
Scheme and Credits dits Semester 7
3 0 3
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Duration of Exam 03 Hours

A student has to attempt 12-15 practicals based on theory on an open-source tool.

Outcomes of the course

CO1. Effectively use the various machine learning tools.

CO2. Understand and implement the procedures for machine learning algorithms.
CO3 . Design Python programs for various machine learning algorithms.
CO4 . Apply appropriate datasets to the Machine Learning algorithms.
CO5 . Analyze the graphical outcomes of learning algorithms with specific datasets.

Mapping of Paper No. LC-CSE-423

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S M S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S S M S M S S S S S S M S
CO5 S S S S S M S S M S S M S S S
CO6 S S S S S M S S S S S S S S S
S = Strong, M = Medium, W = Weak
 PRACTICAL TRAINING-II

Coursecode PT-CSE-425

Category Professional Core Course

Coursetitle Practical Training-II
L T P Credi
Scheme and Credits ts Semester 7
0 0 1
Class work
Exam
Total
Duration of Exam

Practical Training II: The evaluation of Practical Training-II will be based on seminar, viva- voce, report submitted by the students.
According to performance, the students are awarded grades A, B, C, F. A student who is awarded ‘F’ grade is required to repeat
Practical Training.
 SOFTWARE PROJECT MANAGEMENT

Coursecode PEC-CSE-403

Category Professional Elective Course

Coursetitle Software Project Management
L T P Credi
Scheme and Credits ts Semester 7
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
By the end of this course the students will be able to:
1. Identify different stages of Project Management and able to manage scope & objectives defined by project stakeholders at the same time
as focussing on project success.
2. Analyse cost benefit evaluation, different risk associated with project, and techniques used to evaluate & mitigate risk.
3. Manage the resources, monitoring the progress of project using different techniques and managing contracts & peoples associated with the
project.
4. Understand the importance of software quality and techniques to enhance software quality.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

UNIT 1
Introduction to Software Project Management (SPM): Definition of a Software Project (SP), SP Vs. other types of projects activities
covered by SPM, categorizing SPs, project as a system, management control, requirement specification, information and control in
organization.
Stepwise Project planning: Introduction, selecting a project, identifying project scope and objectives, identifying project infrastructure,
analyzing project characteristics, identifying project products and activities, estimate efforts each activity, identifying activity risk,
allocate resources, review/ publicize plan.
UNIT 2
Project Evaluation & Estimation: Cost benefit analysis, cash flow forecasting, cost benefit evaluation techniques, risk evaluation.
Selection of an appropriate project report; Choosing technologies, choice of process model, structured methods, rapid application
development,waterfall, V-process model, spiral models, Prototyping, delivery. Albrecht function point analysis.
Activity planning & Risk Management: Objectives of activity planning, project schedule, projects and activities, sequencing and
scheduling activities, network planning model, representation of lagged activities, adding the time dimension, backward and forward pass,
identifying critical path, activity throat, shortening project, precedence networks.
Risk Management: Introduction, the nature of risk, managing risk, risk identification, risk analysis, reducing the risks, evaluating risks to
the schedule, calculating the z values.
UNIT 3
Resource allocation & monitoring the control: Introduction, the nature of resources, identifying resource requirements, scheduling
resources creating critical paths, counting the cost, being specific, publishing the resource schedule, cost schedules, the scheduling
sequence.
Monitoring the control: Introduction, creating the frame work, collecting the data, visualizing progress, cost monitoring, earned value,
prioritizing monitoring, getting the project back to target, change control.
Managing contracts and people: Introduction, types of contracts, stages in contract, placement, typical terms of a contract, contract
management, acceptance, Managing people and organizing terms: Introduction, understanding behaviour, organizational behaviour: a
back ground, selecting the right person for the job, instruction in the best methods, motivation, working in groups, becoming a team,
decision making, leadership, organizational structures.
UNIT 4
Software quality: Introduction, the place of software quality in project planning, the importance of software quality, defining software
quality, ISO 9126, Practical software quality measures, product versus process quality management, external standards, techniques to
help enhance software quality.

COURSE OUTCOMES:
CO1. Develop the model from the conventional software product to the modern.
CO2. Analyze and design the software architecture.
CO3. Have an exposure for organizing and managing a software project.
CO4. Apply, analyze, design and develop the software project.
CO5. Design various estimation levels of cost and effort.
CO6. Acquire the knowledge of managing, economics for conventional, modern and future software projects.
 Mapping of Paper No. PEC-CSE-403

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S M S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S M S S S S S S S S S S S
CO5 S S S S S S S S M S S S M S M
CO6 S S S S S M S S S S S S S S M
S = Strong, M = Medium, W = Weak

Text Book:
1. Software Project Management (2nd Edition), by Bob Hughes and Mike Cotterell, 1999,TMH

Reference Books:
1. Software Engineering – A Practitioner’s approach, Roger S. Pressman (5th edi), 2001, MGH
2. Software Project Management, Walker Royce, 1998, Addison Wesley.
3. Project Management 2/c. Maylor
4. Managing Global software Projects, Ramesh, 2001, TMH.
 Web Mining

Coursecode PEC-CSE-405
Category Professional Elective Course
Coursetitle Web Mining
L T P Credi
Scheme and Credits ts Semester 7
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
1. To understand the architecture of web, mining the data, issues, challenges.
2. To study the methods of extracting knowledge from web data, text and unusual data.
3. To understand and use data mining language like R, Python etc.
4. To understand the optimization of web and its applications.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Unit: 1
Data Mining Foundations: Basic concepts in data Mining, Web mining versus Data mining, Discovering knowledge from
Hypertext data; An overview of web mining : What is Web mining, Web mining taxonomy, Web mining subtasks,
issues, challenges

Unit: 2
Web Search and Information Retrieval: Information Retrieval Models, Web Search and IR, Text Mining, , Latent Semantic
Indexing, Web Spamming, Clustering and Classification of Web Pages, Information Extraction , Web Content Mining;

Unit: 3
Optimization : Introduction to Models and Concept of Computational Intelligence, Social Behavior as Optimization: Discrete and
Continuous Optimization Problems, Classification of Optimization Algorithms, Evolutionary Computation Theory and Paradigm,
Swarm and Collective intelligence

Unit: 4
 Swarm Intelligence Techniques: Particle Swarm Optimization, Ant Colony Optimization, Artificial Bees and Firefly
Algorithm etc., Hybridization and Comparisons of Swarm Techniques, Application of Swarm Techniques in Different Domains and
Real World Problems

COURSE OUTCOMES:
CO1. Analyse the characteristics of a data sets and their attributes, investigate what transformations and statistical operations can be carried out on each
and identify factors that impact on data quality.
CO2. Investigate a variety of data mining techniques, and identifying their practical applicability to various problem domains.
CO3. Independently research current trends and developments in knowledge discovery related technologies and use this skill to critically analyse
publications to assess the relative merits of various technologies.
CO4. Investigate how web search engines crawl, index, rank web content, how the web is structured.
CO5. Develop an in-depth knowledge of the fundamental web data mining concepts and techniques, and how previously acquired knowledge of data
mining applies to the web.
CO6. Making judgments being able to choose the most appropriate method to a given problem and to evaluate its performance.

Mapping of Paper No. PEC-CSE-405

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S M S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S S S
CO5 S S S S S M S S M S S S S S M
CO6 S S S S S M S S S S S S S S M
S = Strong, M = Medium, W = Weak

Reference books:
1. Witton Frank, Data Mining , Morgan Kauffan Publishers.
2. Kennedy,J.and Eberhart,R.C.,Swarm Intelligence,Morgan Kaufmann Publishers, 2001
3. Bonabeau, E., Dorigo, M. and Theraulaz, G., Swarm Intelligence: From Natural to Artifical Systems, Oxford University Press,
1999
4. Dorigo, M., Stutzle, T., Ant Colony Optimization, MIT Press, 2004
5. Parsopoulos, K.E., Vrahatis, M.N., Particle Swarm Optimization and Intelligence: Advances and Applications, Information Science
Reference, IGI Global, 2010
6. Clerc, M., ParticleSwarm Optimization, ISTE, 2006
7. Nature Inspired Metaheuristic Algorithms, Xin-She Yang, Luniver Press, 2010
 PREDICTIVE ANALYTICS

Course code PEC-CSE-407

Category Professional Elective Course

Course title Predictive Analytics
L T P Cred
Scheme and its Semester 7
Credits 3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
1. To provide the knowledge of various quantitative and classification predictive models based on various regression and decision tree
methods.
2. To provide the knowledge to select the appropriate method for predictive analysis
3. To provide the understanding of how to search, identify, gather and pre-process data for the analysis.
4. To provide the understanding of how to formulate predictive analytics questions.
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from all
units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt five
questions in total, first being compulsory and selecting one from each unit.

Unit1
Introduction: The Analytics Life Cycle, Introduction to Predictive Analytics, Matrix Notation, Basic Foundations, Model, Method and
Feature Selection
Regression: Covariance, Correlation and ANOVA review; Simple Linear Regression, OLS Model Diagnostics, Dummy Variables,
Multivariate Regression, OLS Assumptions ,Weighted Least Squares (WLS), Generalized Linear Models (GLM).

Unit2
Classification Models: Introduction, Binomial Logistic Regression, Multinomial Logistic Regression, Linear Discriminant Analysis,
Quadratic Discriminant Analysis.
Decision Trees: Introduction Regression Trees, Regression Tree Issues, Classification Trees, Pruning Trees, Bootstrap Aggregation
(Bagging), Random Forest Models.

Unit 3
Data Pre-Processing: Overview, Variable Types, Introduction to Data Transformations, Data Transformations: Categorical to Dummy Variables,
 Polynomials, Box-Cox Transformation, Log & Elasticity Models, Logic Transformation, Count Data Models, Centering, Standardization, Rank
Transformations, Lagging Data (Causal Models), Data Reduction.

Unit-4
Variable Selection: Dimensionality Issues, Multi-Collinearity, Variable Selection Methods, Step Methods.
Dimensionality: Regularization (Penalized or Shrinkage Models, Ridge Regression, LASSO, Dimension Reduction Models, Principal
Components Regression (PCR), Partial Least Squares (PLS).
Machine Learning: Machine Learning Overview, Bias vs. Variance Trade-off, Error Measures, Cross-Validation.

Course Outcomes:
CO1. Ability to develop and use various quantitative and classification predictive models based on various regression and decision tree
methods.
CO2. Ability to select the appropriate method for predictive analysis
CO3. Ability to search, identify, gather and pre-process data for the analysis.
CO4. Ability to formulate predictive analytics questions.
CO5. Apply the concept of linear regression to simple prediction problems, residual analysis, confidence and prediction intervals.
CO6. Apply the concept of logistic regression to find simple solutions for classification problems and evaluate the models.

Mapping of Paper No. PEC-CSE-407

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S M S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S S S
CO5 S S S S S S S S M S S S S S M
CO6 S S S S S M S S S S S S S S M
S = Strong, M = Medium, W = Weak
Text books:
1. “An Introduction to Statistical Learning: with Applications in R” by James, Witten, Hastie and Tibshirani, Springer, 1st. Edition, 2013.
Reference books:
1. “The Elements of Statistical Learning-Data Mining, Inference, and Prediction “ by Trevor Hastie, Robert Tibshirani, Jerome Friedman ,
Second Edition , Springer Verlag, 2009.
2. Predictive & Advanced Analytics (IBM ICE Publication)
 BIG DATA ANALYTICS

Coursecode PEC-CSE-409

Category Professional Elective Course

Coursetitle Big Data Analytics
L T P Credi
Scheme and Credits ts Semester 7
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Objectives of the course

1. To Provide an explanation of the architectural components and programming models used for scalable big data analysis.
2. To Identify the frequent data operations required for various types of data and Applytechniques to handle streaming data
3. To describe the connections between data management operations and the big data processing patterns needed to utilize them in large-
scale analytical applications
4. To Identify describe and differentiate between relational and non-relational database and how Data Warehouses, Data Marts, Data
Lakes, and Data Pipelines work.
5. Explain how the Extract, Transform, and Load process works to make raw data ready for analysis.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Unit: 1
Introduction to Big Data: Big Data: Why and Where, Application and Challenges, Characteristics of Big Data and Dimensions of
Scalability, The Six V, Data Science: Getting Value out of Big Data, Steps in the Data science process, Foundations for Big Data
Systems and Programming, Distributed file systems

Unit: 2
Data Repositories and Big Data Platforms: RDBMS, NoSQL, Data Marts, Data Lakes, ETL, and Data Pipelines, Foundations of Big
Data, Big Data Processing Tools, Modern Data Ecosystem, Key Players, Types of Data, Understanding Different Types of File
Formats, Sources of Data Using Service Bindings

Unit: 3
 Introduction to Big Data Modeling and Management: Data Storage, Data Quality, Data Operations, Data Ingestion, Scalability and Security
Traditional DBMS and Big Data Management Systems, Real Life Applications, Data Model: Structure, Operations, Constraints, Types of Big Data
Model.

Unit: 4
Big Data Integration and processing: Big Data Processing, Retrieving: Data Query and retrieval, Information Integration, Big Data
Processing pipelines, Analytical operations, Aggregation operation, High level Operation, Tools and Systems: Big Data workflow
Management.

Course Outcomes:
CO1. Understand Hadoop Distributed File System and examine Map Reduce Programming..
CO2. Understand Hadoop tools and manage Hadoop with Ambari.
CO3. Understand Business Intelligence Concepts, Data Warehousing, Data Mining, Data Visualization.
CO4. For a given specification select a data model to suit the characteristics of your data
CO5. For a given problem one will be able to Retrieve data from example database and big data management systems and identify
when a big data problem needs data integration
CO6. For a given problem one will be able to design an approach to leverage data using the steps in the machine learning process and
apply them to explore and prepare data for modelling.

Mapping of Paper No. PEC-CSE-409

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S M S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S M S S S M S S S S S S S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S M
CO6 S S S S S M S S S S S S S S S
S = Strong, M = Medium, W = Weak

Text books:

1. Seema Acharya, Subhasini Chellappan, "Big Data Analytics" Wiley 2015.

Reference books:

1. Jay Liebowitz, “Big Data and Business Analytics” Auerbach Publications, CRC press (2013)
2. Tom Plunkett, Mark Hornick, “Using R to Unlock the Value of Big Data: Big Data Analytics with Oracle R Enterprise and Oracle R
 Connector for Hadoop”, McGraw- Hill/Osborne Media (2013), Oracle press.
3. Anand Rajaraman and Jef rey David Ulman, “Mining of Massive Datasets”, Cambridge University Press, 2012.
4. Glen J. Myat, “Making Sense of Data”, John Wiley & Sons, 2007
5. Michael Mineli, Michele Chambers, Ambiga Dhiraj, "Big Data, Big Analytics: Emerging Business Intelligence and Analytic Trends for
Today's Businesses", Wiley Publications, 2013.
6. Paul Zikopoulos ,Dirk DeRoos , Krishnan Parasuraman , Thomas Deutsch , James Giles , David Corigan , "Harness the Power of Big Data
The IBM Big Data Platform ", Tata McGraw Hill Publications, 2012.
 NETWORK SECURITY AND CRYPTOGRAPHY

Course code PEC-CSE-411

Category Professional Elective Course

Course title Network Security and Cryptography
L T P Cre
Scheme and Credits dits Semester 7
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.
Course Objectives:
1. To understand cryptography theories; algorithms & systems.
2. To understand the symmetric and asymmetric key algorithms.
3. To understand necessary approaches & techniques to build protection mechanisms in order to secure Computer Networks.
4. Acquire fundamental knowledge on the concepts of different security layers.

UNIT- I
Introduction: Plain text and cipher text, substitution techniques, transposition techniques, encryption and decryption, symmetric and
asymmetric key cryptography.
UNIT- II
Symmetric Key Algorithms:- Introduction, algorithms types and modes, DES, AES. Asymmetric Key Algorithms: Introduction,
history of asymmetric key cryptography, RSAsymmetric and asymmetric key cryptography together, Digital signature.
UNIT- III
Internet Security Protocols: Basic concepts, Secure Socket Layer (SSL), Transport Layer Security (TLS),Secure Hyper Text Transfer
protocol (SHTTP), Time Stamping Protocol (TSP), Secure Electronic Transaction (SET), S SL versus SET, Electronic Money, Email
Security.
UNIT- IV
User Authentication And Kerberos:- Introduction, Authentication basics, Passwords, authentication tokens, certificate based
authentication, biometric based authentication, Kerberos, key distribution center( KDC), Security handshake pitfalls, single Sign on(SSO)
approach.
 Course Outcomes:
After completing the course the student will be able to
CO1. Understand the most common type of cryptographic algorithm ·
CO2. Understand the Public-Key Infrastructure ·
CO3. Understand security protocols for protecting data on networks ·
CO4. Be able to digitally sign emails and files ·
CO5. Understand vulnerability assessments and the weakness of using passwords for authentication ·
CO6.Be able to configure simple firewall architectures ·
Mapping of Paper No. PEC-CSE-411

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
S = Strong, M = Medium, W = Weak

TEXT/ REFERENCE BOOKS:

1. Cryptography and Network Security, 2nd Edition by Atul Kahate, TMH
2. Network Management Principles & Practices by Subramanian, Mani (AWL)
3. SNMP, Stalling, Willian (AWL)
4.SNMP: A Guide to Network Management (MGH)
5.Telecom Network Management by H.H. Wang (MGH)
6.Network Management by U. Dlack (MGH)
 SOFTWARE TESTING

Coursecode PEC-CSE-413
Category Professional Elective Course
Coursetitle Software Testing
L T P Credi
Scheme and Credits ts Semester 7
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
1. To study fundamental concepts of software testing including software testing objectives, process, criteria, strategies, and methods.
2. To learn how to plan a test project, design test cases and data, conduct testingoperations, manage software problems and defects,
generate a testing report.
3. To gain an insight into techniques and skills on how to use modern software testing tools to support software testing projects.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Unit1
Introduction: Overview of Software Development Life Cycle (SDLC), Significance of Software Testing in SDLC, Objectives and
Limitations of software testing. Difference between an Error, Fault and Failure (Software Bug), Software Testing Life Cycle (STLC) and
Seven Principles of Software Testing, Role of Software Testing in Software Quality
Unit 2
Test Case Design: Test Cases and Test Suite, Test Case Planning and Designing, Characteristics of Good Test Case Design, Format of
test case.
Testing Activities: Levels of Testing- Unit, Integration Testing and System Testing. V Model for Software Testing.
Unit 3
Types of Software Testing: Black box testing, White Box and Gray Box Testing.
Reporting and Analyzing bugs: Problem reports, Content and Characteristics of Problem Report, analysis and Tactics for analyzing a
reproducible bug. Making a bug reproducible, Problem/Bug Reporting tools
Unit4
Test Case Selection: Need of Regression Testing, Non-feasibility of Exhaustive Testing, Selection, Minimization and Prioritization of test
cases in regression testing.
 Testing Tools: Manual vs Automated Testing, Types of Testing Tools, Automated Test Case Generation
Course Outcomes:
CO1. Understand software testing and quality as a fundamental component of software development life cycle
CO2. Understand and design the test cases for a given problem
CO3. Understand the process of Reporting of software failures(bugs) using tools like Bugzilla
CO4. Distinguish characteristics of structural testing methods.
CO5. Demonstrate the integration testing which aims to uncover interaction and compatibility problems as early as possible.
CO6. Discuss about the functional and system testing methods.
Mapping of Paper No. PEC-CSE-413

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S M S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S S
S = Strong, M = Medium, W = Weak

Text books:
1. “Software Testing: Principles and Practices”, by Naresh Chauhan. Oxford UniversityPress

Reference books
1. “William Perry, Effective Methods for Software Testing, John Wiley & Sons, New York, 1995.
2. Boris Beizer, Software Testing Techniques , Second Volume, Second Edition, Van Nostrand Reinhold, New York, 1990.
3. Louise Tamres, Software Testing , Pearson Education Asia, 2002
4. Roger S. Pressman, Software Engineering – A Practitioner’s Approach , Fifth Edition, McGraw-Hill International Edition, New Delhi,
2001.
5. Boris Beizer, Black-Box Testing – Techniques for Functional Testing of Software and Systems , John Wiley & Sons Inc., New York,
1995.
6. K.K. Aggarwal & Yogesh Singh, Software Engineering , New Age International Publishers, New Delhi, 2003.
 CYBER SECURITY THREATS

Coursecode PEC-CSE-415

Category Professional Elective Course

Coursetitle Cyber Security Threats

L T P Cre
Scheme and Credits dits SEMESTER 7
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
1. The learner will gain knowledge about securing both clean and corrupted systems, protect personal data, and secure computer networks.
2. The learner will understand key terms and concepts in cyber law, intellectual property and cybercrimes, trademarks and domain theft.
3. The learner will be able to examine secure software development practices.
4. The learner will understand principles of web security.
5. The learner will be able to incorporate approaches for risk management and best practices.
6. The learner will gain an understanding of cryptography, how it has evolved, and some key encryption techniques used today.
7. The learner will develop an understanding of security policies (such as confidentiality, integrity, and availability), as well as protocols to
implement such policies.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

UNIT 1
Introduction: Security threats - Sources of security threats- Motives - Target Assets and vulnerabilities – Consequences of threats- E-mail
threats - Web-threats - Intruders and Hackers, Insider threats, Cyber crimes. Network Threats: Active/ Passive – Interference –
Interception –Impersonation – Worms –Virus – Spam’s – Ad ware - Spy ware – Trojans and covert channels –Backdoors – Bots – IP,
Spoofing - ARP spoofing - Session Hijacking - Sabotage-Internal treats Environmental threats - Threats to Server security.
 UNIT 2
Security Threat Management: Risk Assessment - Forensic Analysis - Security threat correlation –Threat awareness - Vulnerability
sources and assessment- Vulnerability assessment tools –Threat identification - Threat Analysis - Threat Modelling - Model for
Information Security Planning.

UNIT 3
Security Elements: Authorization and Authentication - types, policies and techniques – Security certification - Security monitoring and
Auditing - Security Requirements Specifications – Security Policies and Procedures, Firewalls, IDS, Log Files, Honey Pots

UNIT 4
Access control, Trusted Computing and multilevel security - Security models, Trusted Systems, Software security issues, Physical and
infrastructure security, Human factors – Security awareness, training, Email and Internet use policies.

Course Outcomes:
CO1. Analyze and resolve security issues in networks and computer systems to secure an IT infrastructure.
CO2. Design, develop, test and evaluate secure software.
CO3. Develop policies and procedures to manage enterprise security risks.
CO4. Evaluate and communicate the human role in security systems with an emphasis on ethics, social engineering vulnerabilities
and training.
CO5. Interpret and forensically investigate security incidents.
CO6. Understand Security, Compliance, Auditing, And Protection

Mapping of Paper No. PEC-CSE-415

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S M S
CO5 S S S S S M S S M S S S S S S
CO6 S S S S S M S S S S S S S S M
S = Strong, M = Medium, W = Weak
 Reference Books:
1. Swiderski, Frank and Syndex, “Threat Modeling”, Microsoft Press, 2004.
2. William Stallings and Lawrie Brown, “Computer Security: Principles and Practice”, Prentice Hall, 2008.
3. Joseph M Kizza, “Computer Network Security”, Springer Verlag, 2005
4. Thomas Calabres and Tom Calabrese, “Information Security Intelligence: Cryptographic Principles & Application”, Thomson Delmar
Learning, 2004.
 ADVANCED COMPUTER ARCHITECTURE

Coursecode PCC-CSE-417

Category Professional Elective Course

Coursetitle Advanced Computer Architecture
L T P Credi
Scheme and Credits ts
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
1. To make students know about the Parallelism concepts in Programming.
2. To give the students an elaborate idea about the different memory systems and buses.
3. To introduce the advanced processor architectures to the students.
4. To make the students know about the importance of multiprocessor and multicomputer.
5. To study about data flow computer architectures.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Unit 1
Architecture And Machines: Some definition and terms, interpretation and microprogramming. The instruction set, Basic data types,
Instructions, Addressing and Memory. Virtual to real mapping. Basic Instruction Timing.

Unit 2
Cache Memory Notion: Basic Notion, Cache Organization, Cache Data, adjusting the data for cache organization, write policies,
strategies for line replacement at miss time, Cache Environment, other types of Cache. Split I and D-Caches, on chip caches, Two level
Caches, write assembly Cache, Cache references per instruction, technology dependent Cache considerations, virtual to real translation,
overlapping the Tcycle in V-R Translation, studies. Design summary.
Unit 3
Memory System Design: The physical memory, models of simple processor memory interaction, processor memory modeling using
queuing theory, open, closed and mixed- queue models, waiting time, performance, and buffer size, review and selection of queuing
models, processors with cache.
Unit 4
Concurrent Processors: Vector Processors, Vector Memory, Multiple Issue Machines, Comparing vector and Multiple Issue processors.
Shared Memory Multiprocessors: Basic issues, partitioning, synchronization and coherency, Type of shared Memory multiprocessors,
Memory Coherence in shared Memory Multiprocessors.

Course Outcomes:

CO1: Demonstrate concepts of parallelism in hardware/software.

CO2: Discuss memory organization and mapping techniques.
CO3: Describe architectural features of advanced processors.
CO4: Interpret performance of different pipelined processors.
CO5: Explain data flow in arithmetic algorithms
CO6: Development of software to solve computationally intensive problems.

Mapping of Paper No. PCC-CSE-417

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S M S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 M S S S M S S S S S S S S S S
CO5 S S S S S S S S M S S S S S M
CO6 S S S S S M S S S S S S S S S
S = Strong, M = Medium, W = Weak

Text Book:
Advance computer architecture by Hwang & Briggs, 1993, TMH.

Reference Books:
Pipelined and Parallel processor design by Michael J. Fiynn – 1995, Narosa
 ELECTRONIC PRINCIPLES

Course code OEC-ECE-451

Category Open Elective Course

Course title Electronic Principles
L T P Credit
Scheme and s Semester 7th
Credits
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 3 Hours

Course Objective:
1. Study the basic principles of electronic systems.
2. Understand working of Digital electronics.
3. Understand the working of Display devices.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

UNIT 1
SEMICONDUCTOR DIODE: P-N junction and its V-I Characteristics, P-N junction as a rectifier, Switching characteristics of Diode.
Diode as a circuit element, the load-line concept, half - wave and full wave rectifiers, clipping circuits, clamping circuits, filter circuits,
peak to peak detector and voltage multiplier circuits.
UNIT 2
ELECTRONIC DEVICES: LED, Zener Diode as voltage regulator, BJT, UJT, MOSFET, Thyristor, DIAC, TRIAC.
UNIT 3
DISPLAY DEVICES: LED, LCD, Seven Segment, Sixteen Segment.
UNIT 4
DIGITAL ELECTRONICS: Binary, Octal and Hexadecimal number system and conversions, Boolean Algebra, Truth tables of logic gates
(AND, OR, NOT) NAND, NOR as universal gates, Difference between combinational circuits and sequential circuits, Introduction to
flipflops (S-R & J-K).
 Course Outcomes:
At the end of the course, students will demonstrate the ability to:

CO1. To give knowledge of some basic electronic components and circuits.

CO2. To introduce basics of diode and transistor circuits
CO3. To understand working of some I C based circuits
CO4. To study logic gates and their usage in digital circuit s.
CO5. To expose the students to working of some power electronic dev ices, transducers and application of transducers.
CO6. To introduce basic aspect of electronic communication systems.

Mapping of Paper No. OEC-ECE-451

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S M S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S S S
CO5 S S S S S M S M M S S S S S M
CO6 S S S S S S S S S S S S S S S
S = Strong, M = Medium, W = Weak

TEXT BOOK :
1. Integrated Electronics: Millman & Halkias ; McGrawHill 2.Modren Digital Electronics: R.P. Jain;
McGraw-Hill

REFERENCE BOOKS:
1. Electronics Principles: Malvino ; McGrawHill
2. Electronics Circuits: Donald L. Schilling & Charles Belove ; McGrawHill
3. Electronics Devices & Circuits: Boylestad & Nashelsky ; Pearson.
 FUNDAMENTALS OF MANAGEMENT

Course code HSMC-08

Category Open Elective Course

Course title Fundamentals of Management

Scheme and Credits L T P Credi

ts
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Course Objectives:
Students will be able to understand:
1. Evolution of Management and contribution of Management thinkers.
2. The importance of staffing and training
3. The concept of material management and inventory control
4. The components of marketing and advertising, various sources of finance and capital structure.

UNIT 1
Meaning of management, Definitions of Management, Characteristics of management, Managementvs. Administration. Management-Art,
Science and Profession. Importance of Management.
Development of Management thoughts. Principles of Management. The Management Functions,Inter-relationship of Managerial
functions. Nature and Significance of staffing, Personnel management, Functions of personnel management, Manpower planning,
Process of manpower planning, Recruitment, Selection; Promotion - Seniority Vs. Merit. Training - objectives and types of training.
UNIT 2

Production Management: Definition, Objectives, Functions and Scope, Production Planning and Control; its significance, stages in
production planning and control. Brief introduction to the concepts of material management, inventory control; its importance and
various methods.
UNIT 3
Marketing Management - Definition of marketing, marketing concept, objectives & Functions of marketing. Marketing Research -
Meaning; Definition; objectives; Importance; Limitations; Process. Advertising - meaning of advertising, objectives, functions, criticism.
UNIT 4

Introduction of Financial Management, Objectives of Financial Management, Functions and Importance of Financial Management. Brief
Introduction to the concept of capital structure and various sources of finance.
Course outcomes:
 Students will be able to understand.
CO1. Evolution of Management and contribution of Management thinkers.
CO2. Upon completion of the course, students will be able to have clear understanding of managerial functions like planning, and have same basic
knowledge on international aspect of management
CO3. To understand the planning process in the organization
CO4. To understand the concept of organization
CO5. Demonstrate the ability to directing ,leadership and communicate effectively
CO6. To analysis isolate issues and formulate best control methods.

Mapping of Paper No. HSMC-08

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S M S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S S S M S S S S S S S S S
CO5 S S S S S S S S M S S S S S M
CO6 S S S S S M S S S S S S S S M
S = Strong, M = Medium, W = Weak
Suggested Books:
1. Principles and Practice of Management - R.S. Gupta, B.D.Sharma, N.S.Bhalla.(Kalyani Publishers)
2. Organisation and Management - R.D. Aggarwal (Tata Mc Graw Hill)

Suggested Reference Books:

1. Principles & Practices of Management – L.M. Prasad (Sultan Chand & Sons)
2. Management – Harold, Koontz and Cyrilo Donell (Mc.Graw Hill).
3. Marketing Management – S.A. Sherlikar (Himalaya Publishing House, Bombay).
4. Financial Management - I.M. Pandey (Vikas Publishing House, New Delhi)
5. Management - James A.F. Stoner & R.Edward Freeman, PHI.
 DISASTER MANAGEMENT

Course code OEC-CE-451

Category Open elective courses

Course title Disaster Management
L T P Credit
Scheme and s
Credits
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 3 Hours

Course objectives:

1. To provide basic conceptual understanding of disasters and its relationships with development.
2. Provide an understanding of the social nature of natural hazards and disasters
3. Increase awareness of hazards and disasters around the world and the unequal social consequences stemming from disaster events.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

Unit-1
Introduction: Definition of Disaster, hazard, Global and Indian scenario, role of engineer, importance of study in human life, long term
effects of disaster. Geological Mass Movement and land disasters, Atmospheric disasters, Disaster Mitigation

Unit-2
Natural Disaster: Meaning and nature of natural disaster, Flood, Flash flood, drought, cloud burst, Earthquake, Landslides, Avalanches,
Volcanic eruptions, Mudflow, Cyclone, Storm, Storm Surge, climate change, global warming, sea level rise, ozone depletion

Man-made Disasters: Chemical, Industrial, Nuclear and Fire Hazards. Role of growing population and subsequent industrialization,
urbanization and changing lifestyle of human beings in frequent occurrences of manmade disasters.

Unit -3
 Case Studies: Damage profile analysis- Uttarkashi/Bhuj/Latur earthquakes, Kedarnath landslide, Kerala floods, cyclone Fani and
Amphan, Bihar floods, Covid 19, Forest Related disasters, Mining disasters, Atmospheric disasters.

Unit 4
Disaster Management: Importance of public awareness, Preparation and execution of emergency management programme. Scope and
responsibilities of National Institute of Disaster Management (NIDM) and National disaster management authority (NDMA) in India.
Use of Internet and software for effective disaster management. Applications of GIS, Remote sensing and GPS in this regard.

Course Outcomes:

After completing this course, students should be able:

CO1. To know natural as well as manmade disaster and their extent and possible effects on the economy.
CO2. To Plan national importance structures based upon the previous history.
CO3. To acquaint with government policies, acts and various organizational structures associated with an emergency.
CO4. To know the simple dos and don’ts in such extreme events and act accordingly.
CO5. Explain disaster management theory (cycle, phases, risk, crisis, emergency, disasters, resilience)
CO6. Capacity to manage the Public Health aspects of the disasters.

Mapping of Paper No. OEC-CE-451

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S M S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 M S S S S S S M S S S S S M S
CO4 S S S M M S S S S S S S S S M
CO5 S S S S S S S S M S S S S S S
CO6 S S S S S S S S M S S S S S S
S = Strong, M = Medium, W = Weak

Reference Books
1. Singhal J.P. Disaster Management, Laxmi Publications, 2010. ISBN-10: 9380386427 ISBN-13: 978-9380386423
2. Tushar Bhattacharya, Disaster Science and Management, McGraw Hill India Education Pvt. Ltd., 2012. ISBN-10: 1259007367, ISBN-
13: 978-1259007361]
3. Gupta Anil K, Sreeja S. Nair. Environmental Knowledge for Disaster Risk Management, NIDM, New Delhi, 2011
 ENGLISH FOR PROFESSIONALS
Course code HSMC-10

Category Open Elective Course

Course title English For Professionals
Scheme and L T P Cred
Credits its
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of 03 Hours
Exam

Course Objectives:
The course aims at developing the desired language (English) skills of students of engineering and technology so that they become
proficient in communication to excel in their professional lives. The course aims at developing competence for report writing with a
focus on its complex writing techniques and procedures.

Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will have 6 parts of 2.5 marks each from
all units and remaining eight questions of 15 marks each to be set by taking two questions from each unit. The students have to attempt
five questions in total, first being compulsory and selecting one from each unit.

UNIT1
Communication ProcessTypes and Levels, Scopes and significance, Technical and Tools of Effective communication
UNIT2
Speaking files and Personality Development Oral Presentation, Body Language, Voice Modulation, Negotiation, Group Discussion,
Interview techniques
UNIT3
Advanced Technical Writing Job Application, CV writing, Business Letters, Memos, Minutes, Notices, Report Writing and structure,
Blog writing.
UNIT 4
Communication and Media Recent Developments in Media, Context of Communication
Course Outcomes:
CO1. Students will heighten their awareness of correct usage of English grammar in writing and speaking
CO2. Students will improve their speaking ability in English both in terms of fluency and
comprehensibility
CO3. Students will give oral presentations and receive feedback on their performance
CO4. Students will increase their reading speed and comprehension of academic articles
CO5. Students will improve their reading fluency skills through extensive reading
CO6. Students will enlarge their vocabulary by keeping a vocabulary journal

Mapping of Paper No. HSMC-10

PSO1

PSO2

PSO3

PSO4
PO10

PO11
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
Course
Outcomes

CO1 S S S S S S S S S S S S S S S
CO2 S S S S S M S S S S S S S S M
CO3 S S S S S S S M S S S S S M S
CO4 S S S S M S S S S S S S S S S
CO5 S S S S M S S M S S S S S S M
CO6 S S S S S M S S S S S S S S S
S = Strong, M = Medium, W = Weak

SUGGESTED READING
1. Borowick, Jerome. N. Technical Communication and its Applications. New Delhi: PHI, 2000
2. Guffey, Mary Ellen. Business Communication: Process & Product. USA: South western College Publishing, 2000.
3. Kumar, Sanjay and Pushp Lata. Communication Skills. Delhi: OUP, 2011
 Industrial Training

Hours per week Tot al Examination Schedule Dur

Con tact (Marks) atio n
Hrs. per Inte of Exa
Sr. Category Course Code Course Title wee Cre dit rnal Pra ctic m (Ho
No. L T P k Ass The ory al Tot al urs)
esm ent

Professional Core Industrial Training 3

1 Course INTPR-CSE-422 0 0 6 6 10 200 - 300 500 Hou rs

TOTAL CREDIT 10 200 - 300 500

2 Hours per week per batch for one teacher and batch size will be decided by theHOD/Chairperson of the department.

Procedure for Examination and continuous Assessment

(A) External Exam Marks
1. Project Evaluation 100 Marks
2. Project Seminar 100 Marks
3. Project Viva 100 marks

(B) Continuous Assessment Marks

1. Assessment by Internal Examiner and Viva 150 Marks(Before the Committee
Constituted by
Chairman of the Department)
2. Assessment by Industrial Guide 50 Marks