M.D.

UNIVERSITY, ROHTAK
SCHEME OF STUDIES AND EXAMINATION
B.TECH (Computer Science and Engineering)
Common with
B.Tech. (Information Technology)
&
B.Tech. (Computer Science and Information Technology)
SEMESTER 3rd& 4th
Scheme effective from 2019-20

COURSE CODE ANDDEFINITIONS

Course Code Definition
L Lecture s
T Tutorial
P Practical
BSC Basic ScienceCourses
ESC EngineeringScienceCourses
HSMC Humanities and Social Sciences includingManagementcourses
PCC Professional Core Courses
LC Laboratory Courses
MC Mandatory Courses
PT Practical Training
S Seminar
 B.Tech. (Computer Science and Engineering)
Common with B.Tech. (Information Technology) &
B.Tech. (Computer Science and Information Technology)
Scheme ofStudies/Examination w.e.f. 2019-20
Semester-3

Tot Examination Schedule

Hours per week Dur
al (Marks)
atio
Con Mar
n of
Sr. tact Cre k of
Course Code Course Title Pra Exa
No. Hrs. dit Clas The Tot
L T P ctic m
per s ory al
al (Ho
wee wor
urs)
k k
Database
1 PCC-CSE-201G Management 3 0 0 3 3 25 75 100 3
Systems

Data Structures &

2 PCC-CSE-203G 3 0 0 3 3 25 75 100 3
Algorithms

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

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

Mathematics - III
(Multivariable
BSC-MATH-
5 Calculus and 2 0 0 2 2 25 75 100 3
203G
Differential
Equations)

Economics for
6 HSMC-01G 3 0 0 3 3 25 75 100 3
Engineers

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

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

Data Structures &

9 LC-CSE-213G Algorithms LAB 0 0 4 4 2 25 25 50 3
Using C

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

Total 23 800
 B.Tech. (Computer Science and Engineering)
Common with B.Tech. (Information Technology) &
B.Tech. (Computer Science and Information Technology)
Scheme ofStudies/Examination w.e.f. 2019-20
Semester-4

Tot Examination Schedule

Hours per week Dur
al (Marks)
atio
Con Mar
n of
Sr. tact Cre k of
Course Code Course Title Pra Exa
No. Hrs. dit Clas The Tot
L T P ctic m
per s ory al
al (Ho
wee wor
urs)
k k

1 PCC-CSE-202G Discrete 3 4 25 75 100 3

3 1 0
Mathematics

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

3 PCC-CSE-206G OperatingSystem 3 0 0 3 3 25 75 100 3

ObjectOriented
4 PCC-CSE-208G 3 0 0 3 3 25 75 100 3
Programming

5 HSMC-02G Organizational 3 3 25 75 100 3

3 0 0
Behaviour

6 *MC-106G Environmental 4 0 - - - - 3
3 0 1
Sciences

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

8 LC-CSE-212G OperatingSystem 4 2 25 25 50 3
0 0 4
LAB

ObjectOriented
9 LC-CSE-214G Programming LAB 0 0 4 4 2 25 25 50 3
Using C++

LC-CSE-216G Web Technologies 2 1 25 25 50 3

10. 0 0 2
Lab

Total 22 750
*MC-106G 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

Coursecode PCC-CSE-201G
Category Professional Core Course
Coursetitle 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),DataManipulationLanguage(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 andRBAC
models, Intrusion detection, SQL injection.
Advanced topics: Object oriented and object relational databases, Logical databases, Web
databases, Distributed databases, Data warehousing and data mining.

Suggested books:
“Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F. Korth, S.
Sudarshan, McGraw-Hill.

Suggested reference books

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

Course Outcomes
1. For a given query write relational algebra expressions for that query and optimize the
developed expressions
2. For a given specification of the requirement, design the databases using E R method and
normalization.
3. For a given specification, construct the SQL queries for Open source and Commercial
DBMS -MYSQL, ORACLE, and DB2.
4. For a given query optimize its execution using Query optimization algorithms
5. For a given transaction-processing system, determine the transaction atomicity,
consistency, isolation, and durability.
6. Implement the isolation property, including locking, time stamping based on
concurrency control and Serializability of scheduling.
 Data Structure & Algorithms

Coursecode PCC-CSE-203G

Category Professional Core Course

Coursetitle 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.

To understand concepts about searching and sorting techniques
To understand basic concepts about stacks, queues, lists, trees and graphs.
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 BinaryTree,
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
andcomplexity analysis.

Suggested books:

“Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, Sartaj Sahni,

Computer Science Press.

Suggested reference books:

Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark
Allen Weiss, Addison-Wesley Publishing Company
“How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson Education.

Course outcomes

1. For a given algorithm student will able to analyze the algorithms to determine the
time and computation complexity and justify the correctness.
2. For a given Search problem (Linear Search and Binary Search) student will able to
implement it.
3. For a given problem of Stacks, Queues and linked list student will able to implement
it and analyze the same to determine the time and computation complexity.
4. Student will able to write an algorithm Selection Sort, Bubble Sort, Insertion Sort,
Quick Sort, Merge Sort, Heap Sort and compare their performance in term of Space
and Time complexity.
5. Student will able to implement Graph search and traversal algorithms and determine
the time and computation complexity.
 DIGITAL ELECTRONICS

Coursecode PCC-CSE-205G

Category Professional Core Course

Coursetitle 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.

UNIT1:
FUNDAMENTALSOFDIGITAL SYSTEMSAND LOGICFAMILIES
Digitalsignals,digital circuits,AND, OR,NOT, NAND, NORand Exclusive-ORoperations,
Booleanalgebra,examples ofICgates,numbersystems-binary, signed binary, octal hexadecimal
number,binary arithmetic,one’sandtwo’scomplementsarithmetic,codes,error detectingand
correctingcodes.

UNIT2:
COMBINATIONAL DIGITALCIRCUITS
Standardrepresentationfor logicfunctions,K-maprepresentation,and simplificationoflogic
functionsusingK-map,minimizationoflogicalfunctions.Don’tcareconditions,Multiplexer, De-
Multiplexer/Decoders,Adders,Subtractors,BCDarithmetic,carry lookaheadadder,serial
adder,ALU,elementaryALUdesign,popularMSI chips,digitalcomparator,parity
checker/generator,codeconverters,priorityencoders,decoders/drivers fordisplay devices,Q-M
method of function realization.

UNIT3:
SEQUENTIAL CIRCUITSAND SYSTEMS
A1-bitmemory,thecircuitpropertiesofBistablelatch,theclockedSRflipflop, J-K-TandD
typesflipflops,applicationsof flipflops,shift registers,applicationsof shiftregisters, serialto
parallelconverter, paralleltoserialconverter,ringcounter, sequencegenerator,ripple
(Asynchronous)counters, synchronouscounters,counters design using flipflops, specialcounter
IC’s,asynchronous sequential counters, applications of counters.

UNIT4:
A/D ANDD/A CONVERTERS
Digitaltoanalog converters: weightedresistor/converter,R-2RLadderD/Aconverter,
specificationsforD/Aconverters,examplesofD/AconverterlCs,sampleandholdcircuit, Analogto
digital converters: quantization and encoding, parallel comparator A/Dconverter,
successiveapproximationA/Dconverter,countingA/Dconverter,dualslopeA/Dconverter,
SEMICONDUCTOR MEMORIESAND PROGRAMMABLE LOGIC DEVICES
Memoryorganization and operation, expandingmemorysize, classificationand characteristics of
memories, sequentialmemory, read only memory (ROM), read and write memory(RAM),
contentaddressablememory (CAM),ROMasaPLD,Programmablelogicarray,Programmablearray
logic,complex Programmable logic devices (CPLDS), Field Programmable GateArray(FPGA).

CourseOutcomes:

At the end ofthis course,students will demonstrate the abilityto

1. Understand workingof logic families andlogicgates.
2. Designand implement Combinational and Sequential logic circuits.
3. Understand theprocess of Analog to Digital conversion and Digital to Analog conversion.
4. Use PLDs to implement the given logical problem.

REFERENCES:

1. R. P. Jain, "Modern DigitalElectronics",McGrawHillEducation, 2009.

2. M. M.Mano, "Digital logic and Computerdesign",Pearson Education India,2016.
3. A. Kumar,"Fundamentals ofDigitalCircuits",Prentice HallIndia, 2016.
4. Nasib Singh Gill and J B Dixit, “Digital Design and Computer Organization”, University
Science Press, New Delhi
 Python Programming

Coursecode PCC-CSE-207G

Category Professional Core Course

Coursetitle 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

• For a given conceptual problem student will able to analyze the problem and write a
program in python with basic concepts.
• For a given problem of Strings and texts, student will able to analyze the problem and
write a program in python with basic concepts involving strings and texts.
• The knowledge of list and dictionary will enable student to implement in python language
and analyze the same.
• Student will able to write a program using functions to implement the basic concepts of
object oriented programming language

Suggested books:

“Fundamentals of Python: First Programs” Kenneth Lambert, Course Technology, Cengage

Learning, 2012

Suggested reference books:

“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)

Coursecode BSC-MATH-203G

Category Basic Science Course

Coursetitle 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.

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
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

Course Outcomes
The students will learn:
1. To deal with functions of several variables and evaluate partial derivative.
2. The mathematical tools needed in evaluating multiple integrals and their usage.
3. The effective mathematical tools for the solutions of ordinary differential equations that
model physical processes.
 ECONOMICSFORENGINEERS

Course code HSMC- 01G

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

CourseObjectives:
1.Acquaintthestudentstobasicconceptsofeconomicsandtheiroperationalsignificance.
2.Tostimulatethestudentstothinksystematicallyandobjectivelyabout contemporary
economicproblems.

UNIT-1

Definition of Economics- Various definitions, types of economics- Micro and MacroEconomics,

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, Realcost, 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 andeffect 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.

COURSEOUTCOMES:
1.Thestudentswillabletounderstandthebasicconceptofeconomics.
2.Thestudentwillabletounderstandtheconceptofproductionandcost.
3.Thestudentwillabletounderstandtheconceptofmarket.
4.Thestudentwillabletounderstandtheconceptofprivatization,globalizationandbanks.

REFERENCES:
1.JainT.R.,EconomicsforEngineers,VKPublication.
2.ChopraP.N.,PrincipleofEconomics,KalyaniPublishers.
3.DewettK.K.,Moderneconomictheory,S.Chand.
4.H.L.Ahuja.,Moderneconomictheory,S.Chand.
5.DuttRudar&SundhramK.P.M.,IndianEconomy.
6.MishraS.K.,ModernMicroEconomics,PragatiPublications.
7.SinghJaswinder,ManagerialEconomics,dreamtechpress.
8.ATextBookofEconomicTheoryStonierandHague(Longman’sLandon).
9.MicroEconomicTheory–M.L.Jhingan(S.Chand).
10.MicroEconomicTheory-H.L.Ahuja(S.Chand).
11.ModernMicroEconomics:S.K.Mishra(PragatiPublications).
12.EconomicTheory-A.B.N.Kulkarni&A.B.Kalkundrikar(R.Chand& Co).
 Database Management System Lab

Course code LC-CSE-209G

Category Professional Core Course
Course title Database Management System Lab
L T P Credits
Scheme and Credits 4
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

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
 Digital Electronics Lab

Course code LC-CSE-211G

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

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
 Data Structures and Algorithms Lab Using C

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.
 Python Programming Lab

Course code LC-CSE-215G

Category Professional Core Course
Course title Python Programming Lab
L T P Credits
Scheme and Credits 2 Semester-3
0 0 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

Outcome:
• Write, test, and debug simple Python programs.
• Implement Python programs with conditionals and loops
• Develop Python programs step-wise by defining functions and calling them.
• Use Python lists, tuples, dictionaries for representing compound data.
• Read and write data from/to files in Python.
 Discrete Mathematics

Coursecode PCC-CSE-202G
Category Professional Core Course
Coursetitle 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.

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,
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

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 to
computer science, TMG Edition, TataMcgraw-Hill
5. Discrete Mathematics, Babu Ram, Pearson Publication
6. Discrete Mathematics, SemyourLipschutz and Marc Lipson, Schaum’s outline
Course Outcomes
The students will learn
1. To solve mathematical problems based on concepts of set theory, relations, functions and
lattices.
2. To express logic sentence in terms of quantifiers and logical connectives.
3. To apply basic counting techniques to solve permutation and combination problems.
4. To solve recurrence relations.
5. To classify algebraic structure of any given mathematical problem.
6. To evaluate Boolean functions and simplify expressions using the properties of Boolean
algebra
7. To develop the given problem as graph networks and solve with techniques of graph
theory.
 Computer Organization & Architecture

Course code PCC-CSE-204G

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
Data representation: Data Types, Complements, Fixed-Point Representation, Conversion of
Fractions, Floating-Point Representation, Gray codes, Decimal codes, Alphanumeric codes, Error
Detection Codes.
Register Transfer and Microoperations :Register Transfer Language, Register Transfer, Bus and
Memory Transfers, Arithmetic Microoperations, Logic Microoperations, Shift Microoperations,
Arithmetic Logic Shift Unit.
Unit 2
Basic Computer Organization and Design :Instruction Codes, Computer Registers, Computer
Instructions, Timing and Control, Instruction Cycle, Memory-Reference Instruction, Input-Output
Instruction, Complete Computer Description, Design of Basic Computer, Design of Accumulator
Logic.
Central Processing Unit :General Register Organization, Stack organization, Instruction Format,
Addressing Modes, Data Transfer and Manipulation, Program Control, RISC, CISC.

Unit 3
Pipelining: Basic Concepts of Pipelining, Throughput and Speedup, Pipeline Hazards.
Parallel Processors: Introduction to Parallel Processors, Concurrent access to memory
andCache Coherency.

Unit 4
Input-output Organization :I/O deviceinterface, I/O transfers–program controlled, interrupt
driven and DMA, Privileged and Non-Privileged Instructions, Software Interrupts.
Memory organization: Memory Hierarchy, Main Memory, Auxiliary Memory, Associative
Memory, Cache Memory, Associative Mapping, Direct Mapping, Set-Associative Mapping,
Writing into Cache, Cache Initialization, Virtual Memory.

Suggested books:
1) “Computer System Architecture”, 3rd Edition by M.Morris Mano, Pearson.
2) “Computer Organization and Design: The Hardware/Software Interface”, 5th Edition
by David A. Patterson and John L. Hennessy, Elsevier.
3) “Computer Organization and Embedded Systems”, 6th Edition by CarlHamacher,
McGraw Hill 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
by William Stallings, Pearson Education.
3) “Computer System Design and Architecture”, 2nd Edition by Vincent P. Heuring and
Harry F. Jordan, Pearson Education.

Course outcomes :
1) Draw the functional block diagram of a single bus architecture of a computer and describe
the function of the instruction execution cycle, RTL interpretation of instructions,
addressing modes, instruction set.
2) Write assembly language program for specified microprocessor for computing

16 bit multiplication, division and I/O device interface (ADC, Control circuit, serial port
communication).
3) Write a flowchart for Concurrent access to memory and cache coherency in Parallel
Processors and describe the process.
4) Given a CPU organization and instruction, design a memory module and analyze its
operation by interfacing with the CPU.
5) Given a CPU organization, assess its performance, and apply design techniques to
enhance performance using pipelining, parallelism and RISC methodology.
 Operating System

Course code PCC-CSE-206G

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.

UNIT 1:

Introduction: Concept of Operating Systems, Generations of Operating systems, Types of

Operating Systems, OS Services.
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 – Hardware
support 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:

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.

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

CO1: Understand the structure and architectural components of OS to analyze and design the
applications to run in parallel. Moreover, students would be able to develop scheduling
algorithms to optimize various parameters like CPU utilization, Throughput, Turnaround Time,
Waiting Time, Response Time for research purpose.
CO2:Understand the design issues associated with Operating system (e.g. Mutual exclusion,
Deadlock detection etc.) to gain insight towards developing algorithms/techniques for efficient
deadlock handling.

CO3: For a given specification of memory organization, develop the techniques for optimally
allocating memory to processes by increasing memory utilization and for improving the access
time.

CO4: Design and implement file management system for a given specification. Identify, use and
evaluate the disk management policies with respect to various performance evaluation
parameters.
 Object Oriented Programming

Course code PCC-CSE-208G

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.
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 clasess, 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.

TEXT BOOKS, AND/OR REFERENCE MATERIAL:

1. BjraneStroustrup, “C++ Programming language”,3rd edition, Pearson education Asia(1997)
2. LaforeR.”Object oriented Programming in C++”,4th Ed. Techmedia,New Delhi(2002).
3. Yashwant Kenetkar,”Let us C++”,1stEd.,Oxford University Press(2006)
4. B.A. Forouzan and R.F. Gilberg,CompilerScience,”A structured approach using C++” Cengage
Learning, New Delhi.
 Course code HSMC-02G
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.

SYLLABUS
UNIT - 1
Introduction of Management- Meaning, definitions, nature of management;
Manageriallevels, 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 andrelationship with other Fields; Contemporary challenges and opportunities
of OB. Individual Processes and Behavior-Personality- Concept, determinants
andapplications; 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
groupdevelopment, 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
barriersof 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: By the end of this course the student will be able to:

1. Students will be able to apply the managerial concepts in practical life.

2. The students will be able to understand the concept of organizational behavior
at individual level and interpersonal level.
3. Students will be able to understand the behavioral dynamics in organizations.
4. Students will be able to understand the organizational culture and change

Suggested Books:
1. Robbins, S.P. and Decenzo, D.A. Fundamentals of Management,
Pearson Education Asia, New Delhi.
2. Stoner, J et. al, Management, New Delhi, PHI, New Delhi.
3. Satya Raju, Management – Text & Cases, PHI, New Delhi.
4. Kavita Singh, OrganisationalBehaviour: Text and cases. New Delhi: Pearson
Education.
5. Pareek, Udai, Understanding OrganisationalBehaviour, Oxford University
Press, New Delhi.
6. Robbins, S.P. & Judge, T.A., OrganisationalBehaviour, Prentice Hall of India,
New Delhi.
7. GhumanKarminder, Aswathappa K., Management concept practice and cases,
Mc Graw Hill education.
8. Chhabra T. N., Fundamental of Management, Sun India Publications-
New Delhi.
 Environmental Sciences

Course code MC-106G

Category Mandatory Course

Course title Environmental Sciences
L T P Credits
Scheme and Credits
3 0 1 0

Branches (B. Tech.) Common For All Branches

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Unit-1TheMultidisciplinarynatureofenvironmentalstudies.Definition,
scopeandimportance. c)
(2lecture) Mineralresources:Useandexploitation,environmental
Unit-2NaturalResources: effects
Renewableandnon- ofextractingandusingmineralresources,casestudies.
renewableresources:Naturalresour d) Foodresources:World
cesandassociatedproblems. foodproblems,changes,causedby
agricultureandovergrazing,effectsofmodernagricult
a) Forest resources:Useandover- ure, fertilizer-
exploitation:deforestation, pesticideproblems,Waterlogging,salinity,case
casestudies.Timberextraction,miningdamsandtheireff studies.
ects onforestsandtribalpeople.
e)
b) Waterresources:Useandover-utilizationofsurfaceand Energyresources:Growingenergyneeds;renewablean
groundwater,floods,drought,conflictsoverwater,da dnon-
ms- benefitsandproblems. renewableenergysources,useofalternateenergysources
 ,case studies. *
f) Valueofbiodiversity:consumptiveuse,produ
Landresources:Landasaresource,landdegradation,m ctiveuse,
aninducedlandslides,soilerosionanddesertification. social,ethical,aestheticandoptionvalues.
* * Biodiversityatglobal,Nationalandlocallevels.
Roleofanindividualinconservationofnaturalresources
* Indiaasamega-diversitynation.
.
* Hot-spotsofbiodiversity.
* Equitableuseofresourcesforsustainablelifestyles.
*
(8lectures)
Threatstobiodiversity:habitatloss,poachingo
fwildlife, man-wildlifeconflicts.
* EndangeredandendemicspeciesofIndia.
Unit-3Ecosystems: * Conservationofbiodiversity:In-situandex-
* Producers,consumersanddecomposers. situ conservationofbiodiversity.
* Energyflowintheecosystem. (8lectures)
* Ecologicalsuccession.
* Foodchains,foodwebsandecologicalpyramids.
*
Introduction,types,characteristicfeatures,stru
ctureand functionofthefollowingeco-system:
a. Forestecosystem.
b.
Grasslandecosyste
m. c. Desert
ecosystem.
d.
Aquaticecosystems(ponds,streams,lakes,
rivers, oceans,estuaries) (6lectures)
Unit-
4Biodiversityanditsconservation
* Introduction-
Definition:Genetic,Speciesandecosystemdiversity.
Unit-5 Environmentalpollution: * Urbanproblemsrelatedtoenergy.
Definition,causes,effectsandcontrolmeasuresof: * Waterconservation,rainwaterharvesting,
a) Airpollution. watershed management.

b) *
Resettlementandrehabilitationofpeople:itspr
Waterpolluti
oblems andconcernscasestudies.
on c)
*
Soilpollution Environmentalethics:Issuesandpossiblesolutions.
d) *
Marinepolluti Climatechange,globalwarming,acidrain,ozo
on e) nelayerdepletion,nuclearaccidentsandholocaust.
Casestudies.
Noisepollutio
* Wastelandreclamation.
n
f)
Thermalpolluti
on g)
Nuclearhazard
s
*
Solidswastemanagement:causes,effectsandc
ontrol measuresofurbanandindustrialwastes.
* Roleofanindividualinpreventionofpollution.
* Pollutioncasestudies.
*
Disastermanagement:floods,earthquake,cycl
oneand landslides.
(8lectures)
Unit-6SocialissuesandtheEnvironment:
*
Fromunsustainabletosustainabledevelopment.
 * Consumerismandwasteproducts. * Visittoalocalpollutedsite-
* EnvironmentProtectionAct. urban/Rural/Industrial/ Agricultural.

* Air(PreventionandControlofpollution)Act. * Studyofcommonplants,insects,birds.

* Water(PreventionandControlofpollution)Act. * Studyofsimpleecosystems-
pond,river,hillslopes,etc. (Fieldworkequalto10
* WildlifeProtectionAct.
lecturehours).
* ForestConservationAct.
*
Issuesinvolvedinenforcementofenvironmentallegislatio
n.
*
Publicaware
ness. (7lectures)
Unit-7 HumanpopulationandtheEnvironment.
Populationgrowth,variationamongnations.P
opulationexplosion-
FamilyWelfareProgramme.
Environmentandhumanhealth.
HumanR
ights.
ValueEd
ucation.
HIV/AI
DS.
WomanandChildWelfare
RoleofInformationTechnologyinEnvironmentandhu
man health.
CaseStudies. (6lectures)
Unit-8 FieldWork:
*
Visittoalocalareatodocumentenvironmenta
lassets- river/forest/grassland/hill/mountain.
 Refe NaturalHistorySociety,Bombay(R).
renc 10. Heywood,V.H.&Watson,R.T.1995. Global
es Biodiversity
1. Assessment,CambridgeUni.Press1140p.
Agarwal,K.C.2001EnvironmentalBiology,NidiPub
11.
.Ltd.
Jadhav,H&Bhosale,V.M.1995.EnvironmentalProte
Bikaner.
ction andLaws.HimalayaPub.House,Delhi284p.
2.
12.
Bharucha,Frach,TheBiodiversityofIndia,MApinPubli
Mackinney,M.L.&Schoch,RM1996,EnvironmentalSc
shingPvt.Ltd.Ahmedabad-380013,India,E-
iencesystems&solutions,Webenhancededition.639p.
mail:[email protected](R).
13. MhaskarA.K., MayyerHazardous,Tekchno-
3.
Science
BrunnerR.C.1989,HazardousWasteIncineration,Mc.
Graw Publications(TB).
HillInc.480p. 14.
MillerT.G.Jr.EnvironmentalScience,WadsworthPubli
4.
shing
ClarkR.S.,Marinepollution,SlandersonPressOxford(
TB).
5.
Cunningham,W.P.Cooper,T.H.Gorhani,E&Hepworth
,M.T.
2001,EnvironmentalEncyclopedia,JaicoPub.House,M
umbai
1196p.
6. DeA.K.,EnvironmentalChemistry,WileyEasternLtd.
7. DowntoEarth,CentreforScienceandEnvironment(R).
8.
Gleick,H.P.,1993.Waterincrisis,PacificInstituteforStu
diesinDev.Environment&SecurityStockholmEnv.Ins
titute, OxfordUniv.Press,473p.
9.
HawkinsR.E.EncyclopediaofIndianNaturalHistory,B
ombay
 C ns(TR).
o. 22.
( WagnerK.D.,1998,EnvironmentalManagement,W
T .B.
B Saundersco.Philadelphia,USA
). 499p.
15. 23.
Odum,E.P.1971,FundamentalsofEcology.W.B.Sau AtextbookenvironmentaleducationG.V.S.Publishers
nders byDr.
Co.USA J.P
,574p. .Y
16. ad
RaoM.N.&Datta,A.K.1987WasteWaterTreatment.O av.
xford (M)
&TBHPubl.Co.Pvt.Ltd.
345p. Magazi
17. ne (R)
Sharma,B.K.2001,EnvironmentalChemistry,GoalP Referen
ubl. ce (TB)
House,
Meerut. Textbo
18. SurveyoftheEnvironment,TheHindu(M). ok

19. Theschemeofthepaperwillbeunder:
TownsendC.,HarperJ.andMichaelBegon.Essentials
of ThesubjectofEnvironmental Studieswill
Ecology,BlackwellScienc beincludedasa
e(TB). qualifyingpaperinallUGCoursesandthestudentswillberequir
edtoqualifythesameotherwise
20.
thefinalresultwillnotbedeclaredanddegreewillnotbeawarded
TrivediR.K.,HandbookofEnvironmentalLaws,Rul
.
es,
Guidelines,ComliancesandStandards,Vol.IandIIEnvi
roMedia(R).
21.
TrideviR.K.andP.K.Goal,Introductiontoairpollution,T
echno
SciencePublicatio
Thedurationofthecoursewillbe40lectures.The
examinationwillbeconductedalong
withthesemesterexaminations.
Exam.Pattern:Incaseofawardingthemarks,thepaperwill
carry100marks.Theory:75marks,Practical/ Field
visit:25marks.Thestructure ofthequestionpaperwillbe:
Part-A:ShortAnswerPattern :
15marks
Part-B:EssayTypewithinbuiltchoice :
60marks
Part-C:FieldWork(Practical) :
25marks
InstructionsforExaminers:
Part-
A:QuestionNo.1iscompulsoryandwillcontainfiveshort-
answertypequestionof3
markseachcoveringtheentiresyllabus.
Part-
B:Eightessaytypequestions(withinbuiltchoice)willbeset
fromtheentiresyllabusandthecandidatewillberequiredtoan
swer
anyfourofthem.Eachessaytypequestionwillbeof15marks.
Theexaminationoftheregularstudentswillbeconducte
dbytheconcernedcollege/Institute.Each
studentwillberequiredtoscoreminimum40%marksseparat
elyin theoryandpractical/Field visit.Themarks
inthisqualifyingpaperwillnotbe
includedindeterminingthepercentageofmarksobtainedforthe
award
ofdegree.However,thesemarkswillbeshowninthedetailedm
arks certificateofthestudents.
 Web Technologies

Course code LC-CSE-210G

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.
Suggested books:

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

2. Web Technologies, Black Book, Dreamtech Press
3. Web Applications : Concepts and Real World Design, Knuckles, Wiley-India
4. 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

Course outcomes

• For a given conceptual problem student will able to understand the basic process of
Web Technologies and their application domains
• For a given problem the student will able to analyze the problem and select which
technique is most suitable for developing a website.
• The knowledge of various techniques will enable student to implement in these dynamic
techniques using various tools to make interactive web pages.
• Student will able to write a program using these technologies to implement the basic
concepts of web.
 Operating System Lab

Course code LC-CSE-212G

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

Contents:
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.
Suggested Books:
1. UNIX Shell Programming by YashavantKanetkar.
2. UNIX Concepts and Applications by Sumitabha Das
Course Outcomes.
Co1: Understand the structure and architectural components of UNIX Operating System to
analyze and design the problem. Moreover, students would be able to know the Basic
Introduction of UNIX Operating System.
Co2: Basic Introduction of UNIX Commands that are used for operating the UNIX.
Co3: Introduction of Shell Scripting and VI Editor.so that the students get familiar with writing
the UNIX scripts in UNIX editor.
Co4: Students will establish themselves as effective professionals by solving real problems with
UNIX Shell Scripting knowledge and with attention to teamwork, critical thinking and problem
solving skills by Writing Shell Scrips of unknown problems
 Object Oriented Programming Lab Using C++

Course code LC-CSE-214G

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

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.
 Web Technologies Lab

Course code LC-CSE-216G

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

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
 MC-106G : (ENVIRONMENT SCIENCE)

Theory 75 Marks Field Work 25 Marks (Practical/Field visit)

Unit-1 The Multidisciplinary nature of environment studies. Definition,
scope and importance. (2 lecture) Unit-3 Ecosystems :
Unit-2 Natural Resources : * Producers, consumers and decomposers.
Renewable and non-renewable resources : * Energy flow in the ecosystem.
Natural resources and associated problems. * Ecological succession.
a) Forest resources : Use and over-exploitation : * Food chains, food webs and ecological pyramids.
deforestation, case studies. Timber extraction, mining * Introduction, types, characteristic features, structure
dams and their effects on forests and tribal people. and function of the following eco-system :
b) Water resources : Use and over-utilization of surface and a. Forest ecosystem.
ground water, floods, drought, conflicts over water, dams- b. Grassland ecosystem.
benefits and problems.
c. Desert ecosystem.
c) Mineral resources : Use and exploitation, environmental effects
d. Aquatic ecosystems (ponds, streams, lakes, rivers,
of extracting and using mineral resources, case studies.
oceans, estuaries) (6 lectures)
d) Food resources : World food problems, changes, caused by
Unit-4 Biodiversity and its conservation
agriculture and overgrazing, effects of modern agriculture,
fertilizer-pesticide problems, Water logging, salinity, case * Introduction - Definition : Genetic, Species and
studies. ecosystem diversity.
e) Energy resources : Growing energy needs; renewable and * Value of biodiversity: consumptive use, productive
non-renewable energy sources, use of alternate energy use, social, ethical, aesthetic and option values.
sources, case studies. * Biodiversity at global, National and local levels.
f) Land resources : Land as a resource, land degradation, * India as a mega-diversity nation.
man induced landslides, soil erosion and desertification. * Hot-spots of biodiversity.
* Role of an individual in conservation of natural resources.
* Threats to biodiversity: habitat loss, poaching of
* Equitable use of resources for sustainable lifestyles. wildlife, man-wildlife conflicts.
(8 lectures) * Endangered and endemic species of India.
* Conservation of biodiversity : In-situ and ex-situ
conservation of biodiversity.
(8 lectures)
Unit-5 Environmental pollution : * Consumerism and waste products.
Definition, causes, effects and control measures of : * Environment Protection Act.
a) Air pollution. * Air (Prevention and Control of pollution) Act.
b) Water pollution * Water (Prevention and Control of pollution) Act.
c) Soil pollution * Wildlife Protection Act.
d) Marine pollution * Forest Conservation Act.
e) Noise pollution * Issues involved in enforcement of environmental
legislation.
f) Thermal pollution
* Public awareness. (7 lectures)
g) Nuclear hazards
Unit-7 Human population and the Environment.
* Solids waste management: causes, effects and
control measures of urban and industrial wastes. Population growth, variation among nations.
* Role of an individual in prevention of pollution. Population explosion- Family Welfare Programme.
* Pollution case studies. Environment and human health.
* Disaster management : floods, earthquake, cyclone Human Rights.
and landslides. Value Education.
(8 lectures) HIV/AIDS.
Unit-6 Social issues and the Environment: Woman and Child Welfare
* From unsustainable to sustainable development. Role of Information Technology in Environment and human
* Urban problems related to energy. health.
* Water conservation, rain water harvesting, Case Studies. (6 lectures)
watershed management. Unit-8 Field Work :
* Resettlement and rehabilitation of people : its * Visit to a local area to document environmental
problems and concerns case studies. assets - river/forest/grassland/hill/mountain.
* Environmental ethics : Issues and possible solutions.
* Visit to a local polluted site-urban/Rural/ Industrial/
* Climate change, global warming, acid rain, ozone layer Agricultural.
depletion, nuclear accidents and holocaust. Case studies. * Study of common plants, insects, birds.
* Wasteland reclamation. * Study of simple ecosystems- pond, river, hill slopes,
etc. (Field work equal to 10 lecture hours).
References Co. (TB).
1. Agarwal, K.C. 2001 Environmental Biology, Nidi Pub. 15. Odum, E.P. 1971, Fundamentals of Ecology. W.B.
Ltd. Bikaner. Saunders Co. USA, 574p.
2. Bharucha, Frach, The Biodiversity of India, MApin Publishing 16. Rao M.N. & Datta, A.K. 1987 Waste Water Treatment.
Pvt. Ltd. Ahmedabad-380013, India, E-mail : [email protected] Oxford & TBH Publ. Co. Pvt. Ltd. 345p.
(R). 17. Sharma, B.K. 2001, Environmental Chemistry, Goal
3. Brunner R.C. 1989, Hazardous Waste Incineration, Mc. Publ. House, Meerut.
Graw Hill Inc. 480p. 18. Survey of the Environment, The Hindu (M).
4. Clark R.S., Marine pollution, Slanderson Press Oxford (TB).
19. Townsend C., Harper J. and Michael Begon. Essentials of
5. Cunningham, W.P. Cooper, T.H. Gorhani, E & Ecology, Blackwell Science (TB).
Hepworth, M.T. 2001, Environmental Encyclopedia,
20. Trivedi R.K., Handbook of Environmental Laws, Rules,
Jaico Pub. House, Mumbai 1196 p.
Guidelines, Comliances and Standards, Vol. I and II
6. De A.K., Environmental Chemistry, WileyEastern Ltd. Enviro Media (R).
7. Down to Earth, Centre for Science and Environment (R). 21. Tridevi R.K. and P.K. Goal, Introduction to air pollution,
8. Gleick, H.P., 1993. Water in crisis, Pacific Institute for Techno Science Publications (TR).
Studies in Dev. Environment & Security Stockholm Env. 22. Wagner K.D., 1998, Environmental Management, W.B.
Institute, Oxford Univ. Press, 473p. Saunders co. Philadelphia, USA 499p.
9. Hawkins R.E. Encyclopedia of Indian Natural History, 23. Atext book environmental education G.V.S. Publishers
Bombay Natural HistorySociety, Bombay(R). byDr. J.P. Yadav.
10. Heywood, V.H. & Watson, R.T. 1995. Global (M) Magazine
Biodiversity Assessment, Cambridge Uni. Press 1140p.
(R) Reference
11. Jadhav, H & Bhosale, V.M. 1995. Environmental
(TB) Textbook
Protection and Laws. Himalaya Pub. House, Delhi 284p.
12. Mackinney, M.L. & Schoch, RM 1996, Environmental The scheme of the paper will be under :
Science systems & solutions, Web enhanced edition. 639p. The subject of Environmental Studies will be included as a
13. Mhaskar A.K., Mayyer Hazardous, Tekchno-Science qualifying paper in all UG Courses and the students will be
Publications (TB). required to qualify the same otherwise the final result will not
14. Miller T.G. Jr. Environmental Science, Wadsworth Publishing be declared and degree will not be awarded.
The duration of the course will be 40 lectures. The examination will
be conducted along with the semester 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 :EssayType with inbuilt choice : 60marks
Part-C : Field Work (Practical) : 25marks
Instructions 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. Each student 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.
 M.D. UNIVERSITY, ROHTAK
(NAAC Accredited ‘A+’ Grade)

SCHEME OF STUDIES AND EXAMINATION

B.TECH (Computer Science & Engineering)
SEMESTER 5th AND 6th
Scheme effective from 2020-21

COURSE CODE AND DEFINITIONS:

Course Code Definitions
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
TH Theory
Pr Practical

General Notes:
1. Mandatory courses are non credit courses in which students will be required passing
marks in internal assessments.
2. Students will be allowed to use non programmable scientific calculator. However,
sharing of calculator will not be permitted in the examination.
3. 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.
 Scheme of Studies and Examination
B.TECH (Computer Science & Engineering) – 5th Semester
w.e.f. 2020-21

Hours per Examination Schedule

Dur
week (Marks)
Total atio
Mar
Contac n of
Sr. Course Title Cre k of
Category Course Code t Hrs. Pra Exa
No. dit Clas The Tot
L T P per ctic m
s ory al
week al (Ho
wor
urs)
k
Engineering
1 Science ESC-CSE-301G Microprocessor 3 0 0 3 3 25 75 100 3
Course
Professional Computer
2 PCC-CSE-303G 3 0 0 3 3 25 75 100 3
Core Course Networks

Professional Formal Languages

3 PCC-CSE-305G 3 0 0 3 3 25 75 100 3
Core Course & Automata

Professional Design & Analysis

4 PCC-CSE-307G 3 0 0 3 3 25 75 100 3
Core Course of Algorithms

Professional Programming in
5 PCC-CSE-309G 3 0 0 3 3 25 75 100 3
Core Course Java
Professional
Refer to
6 Elective Elective–I 3 0 0 3 3 25 75 100 3
Annexure I
Course
Engineering
Microprocessor
7 Science LC-ESC-321G 0 0 2 2 1 25 - 25 50 3
Lab
Course
Professional Computer
8 LC-CSE-323G 0 0 3 3 1.5 25 - 25 50 3
Core Course Networks Lab
Design & Analysis
Professional
9 LC-CSE-325G of Algorithms 0 0 3 3 1.5 25 - 25 50 3
Core Course
Using C++
Professional Programming in
10 LC-CSE-327G 0 0 3 3 1.5 25 - 25 50 3
Core Course Java Lab

Practical Training-
11 Training PT-CSE-329G - - - - - - - * Refer Note 1
1
23.
TOTAL CREDIT 800
5
Note:

1. 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.
2. Choose any one from Elective-1
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
Tot Examination Schedule
Hours per week Dur
al (Marks)
atio
Con Mar
n of
Sr. tact Cre k of
Category Course Code Course Title Pra Exa
No. Hrs. dit Clas The Tot
L T P ctic m
per s ory al
al (Ho
wee wor
urs)
k k
Professional
1 PCC-CSE-302G Compiler Design 3 0 0 3 3 25 75 100 3
Core Course
Professional Artificial
2 PCC-CSE-304G 3 0 0 3 3 25 75 100 3
Core Course Intelligence
Professional
3 PCC-CSE-306G Advanced Java 3 0 0 3 3 25 75 100 3
Core Course
Engineering Mobile and
4 Science ESC-CSE-308G Wireless 3 0 0 3 3 25 75 100 3
Course Communication
Professional
Refer to
5 Elective Elective-II 3 0 0 3 3 25 75 100 3
Annexure II
Course
Professional
Refer to
6 Elective Elective-III 3 0 0 3 3 25 75 100 3
Annexure III
Course

7 Project PROJ-CSE-322G Project-I 0 0 4 4 2 25 25 50 3

Professional Compiler Design

8 LC-CSE-324G 0 0 3 3 1.5 25 25 50 3
Core Course Lab
Artificial
Professional
9 LC-CSE-326G Intelligence Lab 0 0 3 3 1.5 25 25 50 3
Core Course
using python
Professional Advanced Java
10 LC-CSE-328G 0 0 2 2 1 25 25 50 3
Core Course Lab
Mandatory Constitution of
11. MC-317G 2 0 0
Courses India
TOTAL 24 800

*MC-317G is a mandatory non –credit course in which the students will be required passing
marks in theory.
NOTE:
1. 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.
2. Choose any one from Elective-II
3. Choose any one from Elective-III
 Annexure I
Elective –I (Professional Elective Course)

1. PEC-CSE-311G:Software Engineering
2. PEC-CSE-313G : System Programming and System Administration
3. PEC-CSE-315G :Digital Image Processing

Annexure II

Elective –II (Professional Elective Course)

1. PEC-CSE-310G:Advanced Database Management System

2. PEC-CSE-312G :Mobile Application Development
3. PEC-CSE-314G:Computer Graphics
4. PEC-CSE-330G :Communication Engineering

Annexure III

Elective –III (Professional Elective Course)

1. PEC-CSE-316G: Distributed System

2. PEC-CSE-318G :Information Technology & Industry Business Skills
3. PEC-CSE-320G : Data Science
4. PEC-CSE-332G :VHDL and Digital Design
 MICROPROCESSOR

Course code ESC-CSE-301G

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
Course Objectives:
 To make understand architecture and working of Intel 8085 microprocessor in depth.
 To make understand architecture and working of Intel 8086 microprocessor in depth.
 Familiarization with the assembly language programming.
 Familiarization with various peripheral operations

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
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.

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

Course Outcomes:

 Understand the operation and architecture of Intel 8085 microprocessor including

Instruction Set Architecture, assembly language programming, timing and speed of
operation.
 Learn the operation of circuits for user interaction through switches, keyboard and
display devices.
 Understand the operation and architecture of Intel 8086 microprocessor including
Instruction Set Architecture, assembly language programming, timing and speed of
operation.
 Understand the motivation and need for peripheral operations circuits for digital
data exchange, timer, serial communication, merits of direct memory access,
interrupt controller and other circuits.
 COMPUTER NETWORKS

Course code PCC-CSE-303G

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

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

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: 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.

Suggested books:

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.

Suggested reference books:

1. Computer Networks, 8th Edition, Andrew S. Tanenbaum, Pearson New International

Edition.
2. Internetworking with TCP/IP, Volume 1, 6th Edition Douglas Comer, Prentice Hall of
India.
3. TCP/IP Illustrated, Volume 1, W. Richard Stevens, Addison-Wesley, United States of
America.

Course Outcomes:
 Explain the functions of the different layer of the OSI Protocol.
 Draw the functional block diagram of wide-area networks (WANs), local area
networks (LANs) and Wireless LANs (WLANs) and describe the function of each.
 Identify and connect various connecting components of a computer network.
 Configure DNS DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP,
SNMP, Bluetooth, Firewalls using open source available software and tools.
FORMAL LANGUAGES AND AUTOMATA

Course code PCC-CSE-305G

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
Course Objectives:
 To understand basic concepts of formal languages and automata theory.
 To study the types of Automata i.e. NFA, DFA, NFA with ϵ-transition and their
interconversion methods and importance.
 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.
 To develop the concepts and design of higher-level automata to accept the language
not accepted by finite automata such as PDA &Turing machine.
 To study the various properties of turing machine and their designing.

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:
Finite Automata: Introduction: Set, Power Set, Super Set, Alphabet, languages and
grammars, productions and derivation, Deterministic finite automata (DFA), Non-
Deterministic finite automata (NDFA), Equivalence of DFA and NDFA, Conversion of NFA 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: Church-Turing thesis, universal Turing machine, the universal and
diagonalization languages, reduction between languages and Rice s theorem, undecidable
problems about languages.

Suggested books:
1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John
E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Introduction to the Theory of Computation, Michael Sipser, 3rd edition,
Cengage Learning.

Suggested reference books

1. K. L. P Mishra, N. Chandrashekaran (2003), Theory of Computer Science-Automata
Languages and Computation, 2nd edition, Prentice Hall of India, India.
2. Raymond Greenlaw, H. James Hoover, Fundamentals of the Theory of Computation,
Principles and Practice, Morgan Kaufmann, 1998.
3. John C. Martin: Introduction to Languages and Automata Theory, 3rd edition, Tata
Mcgraw-Hill, 2007

Course Outcomes:
 To use basic concepts of formal languages of finite automata techniques.
 To Design Finite Automata’s for different Regular Expressions and Languages.
 To Construct context free grammar for various languages.
 To solve various problems of applying normal form techniques, push down
automata and Turing Machines.
 DESIGN AND ANALYSIS OF ALGORITHMS

Course code PCC-CSE-307G

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

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

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 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.

Suggested Text Books:

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

Suggested Reference Books:

1. The Design and Analysis of Computer Algorithm, Aho A.V. Hopcroft J.E., 1974,
Addison Wesley.
2. Algorithms-The Construction, Proof and Analysis of Programs, Berlion, P.Bizard, P.,
1986. Johan Wiley & Sons,
3. Writing Efficient Programs, Bentley, J.L., PHI
4. Introduction to Design and Analysis of Algorithm, Goodman, S.E. &Hedetnieni, 1997,
MGH.
5. Introduction to Computers Science- An algorithms approach, Jean Paul Trembley,
Richard B.Bunt, 2002, T.M.H.
6. Fundamentals of Algorithms: The Art of Computer Programming Vol Knuth, D.E.:
1985, Naresh Publication.

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

Course code PCC-CSE-309G

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

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

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 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;

Text Books:
1. Patrick Naughton and HerbertzSchidt, “Java-2 the complete Reference”, TMH
2. Sierra & bates, “Head First Java”, O’Reilly.
Reference Books:
1. E. Balaguruswamy, “Programming with Java”, TMH
2. Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley.
3. Decker &Hirshfield, “Programming.Java”, Vikas Publication.

Course Outcomes:
 Knowledge of the structure and model of the Java programming language,
(knowledge)
 Use the Java programming language for various programming technologies
(understanding)
 Develop software in the Java programming language
 MICROPROCESSOR LAB

Course code LC-ESC-321G

Category Engineering Science Course
Course title Microprocessor Lab
L T P Credits
Scheme and Credits Semester 5
0 0 2 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-301G.

 COMPUTER NETWORKS LAB

Coursec ode LC-CSE-323G

Category Professional Core Course
Course title Computer Networks Lab
L T P Credits
Scheme and Credits Semester 5
0 0 2 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-303G using hardware

resources and using simulation tool.
 DESIGN & ANALYSIS OFALGORITHMS USING C++

Course code LC-CSE-325G

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

Course Objectives:
 Implementation of various algorithms and to analyze the performance of algorithms.
 Demonstrate a familiarity with major algorithms and data structures.
 Apply important algorithmic design paradigms and methods of analysis.
 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:

 The course will help in improving the programming skills of the students.
 The design of algorithms for any problem will inculcate structured thinking
process in the students and improve the analytical power.
 PROGRAMMING IN JAVA LAB

Course code LC-CSE-327G

Category L
Professional Core Course

Course title Java Programming Lab

L T P Credits Semester 5
Scheme and Credits 0 0 3 1.5
Classwork 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 the5 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.
 PRACTICAL TRAINING 1

Course code PT-CSE-329G

Category L
Professional Core Course

Course title PRACTICAL TRAINING 1

L T P Credits Semester 5
Scheme and Credits
0 0 0
Classwork -
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.

 SOFTWARE ENGINEERING

Course code PEC CSE-311G

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

 Be successful professionals in the field with solid fundamental knowledge of software

engineering
 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
 Apply their foundations in software engineering to adapt to readily changing
environments using the appropriate theory, principles and processes

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: 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 a 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.

Suggested books:

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

Suggested reference books

 Fundamentals of software Engineering, Rajib Mall, PHI Software Engineering by

Nasib Singh Gill, Khanna Book Publishing Co (p) Ltd
 Software Engineering by Ian Somerville, Pearson Edu, 5 edition, 1999, AW,
 Software Engineering – David Gustafson, 2002, T.M.H
 Software Engineering Fundamentals Oxford University, Ali Behforooz and Frederick
J. Hudson 1995 JW&S,
 An Integrated Approach to software engineering by Pankaj jalote , 1991 Narosa,

Course Outcomes

1. How to apply the software engineering lifecycle by demonstrating competence in

communication, planning, analysis, design, construction, and deployment
2. An ability to work in one or more significant application domains
3. Work as an individual and as part of a multidisciplinary team to develop and deliver
quality software
4. Demonstrate an understanding of and apply current theories, models, and techniques
that provide a basis for the software lifecycle
5. Demonstrate an ability to use the techniques and tools necessary for engineering
practice
 SYSTEM PROGAMMING AND SYSTEM ADMINISTRATION

Course code PEC CSE-313G

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
Objectives of the course
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
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
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

Suggested books:
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.

Suggested reference books

1. Advanced Unix programmer’s Guide by Stephen Prato, BPB
2. Unix- Concept and applications by Sumitabha Das, 2002, T.M..H

Course Outcomes
1. To understand various file statistics.
2. To work on wildcards.
3. To know about shell programming and AWK utility.
 Digital Image Processing
Course Code
PEC-CSE-315G
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

Objectives of the course

 To become familiar with digital image fundamentals

 To get exposed to simple image enhancement techniques in Spatial and
Frequency domain.
 To learn concepts of degradation function and restoration techniques.
 To study the image segmentation and representation techniques.
 To become familiar with image compression and recognition method
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 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.
Suggested books:
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.
Suggested reference books

1. Kenneth R. Castleman, Digital Image Processing Pearson, 2006.

2. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins, Digital Image Processing
using MATLAB Pearson Education, Inc., 2011.
3. D,E. Dudgeon and RM. Mersereau, Multidimensional Digital Signal Processing
Prentice Hall Professional Technical Reference, 1990.
4. William K. Pratt, Digital Image Processing John Wiley, New York, 2002
5. Milan Sonka et al Image processing, analysis and machine vision Brookes/Cole,
Vikas Publishing House, 2nd edition, 1999

Course Outcomes

1. Know and understand the basics and fundamentals of digital image processing, such
as digitization, sampling, quantization, and 2D-transforms.
2. Operate on images using the techniques of smoothing, sharpening and
enhancement.
3. Understand the restoration concepts and filtering techniques.
4. Learn the basics of segmentation, features extraction, compression and recognition
methods for colour models
 COMPILER DESIGN

Course code PCC-CSE-302G

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

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.

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 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.

Suggested Text Books:

1. Compilers Principle, Techniques & Tools - Alfread V. AHO, Ravi Sethi & J.D. Ullman;
1998 Addison Wesley.

Suggested Reference Books:

1. Theory and practice of compiler writing, Tremblay & Sorenson, 1985, Mc. Graw Hill.
2. System software by Dhamdere, 1986, MGH.
3. Principles of compiler Design, Narosa Publication
4. Elements compiler Design, Dr. M. Joseph, University Science Press

Course Outcomes:

1. To develop the lexical analyser for a given grammar specification.

2. For a given parser specification design top-down and bottom-up parsers.
3. To Develop syntax directed translation schemes.
 ARTIFICIAL INTELLIGENCE

Course code PCC-CSE-304G

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

Objectives of the course:

 To provide historical perspective of AI and its foundation.

 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.
 Explore application of AI techniques in Expert systems, Neural Networks.
 Explore the current trends, potential, limitations, and implications of AI.

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 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: Min Max 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

Suggested Test books:

1. Artificial Intelligence: A Modern Approach Third Edition Stuart Russell and Peter
Norvig, 2010, Pearson Education.

Suggested reference books:

1. Elaine Rich, Kevin Knight, & Shivashankar B Nair, Artificial Intelligence, McGraw Hill,
3rd ed.,2009.
2. Introduction to Artificial Intelligence & Expert Systems, Dan W Patterson, PHI.,2010.
3. Artificial intelligence, Patrick Henry Winston, 1992, Addition Wesley 3 Ed.

Course Outcomes:

1. Display the understanding of the historical perspective of AI and its foundation.

2. Apply basic principles of AI in solutions that require problem solving, inference,
knowledge representation and learning.
3. Demonstrate fundamental understanding of various application of AI techniques in
Expert systems, Neural Networks.
4. Demonstrate an ability to share in discussion of AI, it’s the current trends,
limitations, and implications of AI.
 ADVANCED JAVA

Course code PCC-CSE-306G

Category Professional Course Code

Course title Advanced Java

L T P Credits Semester 6
Scheme and Credits
3 0 0 3
Classwork 25Marks
Exam 75Marks
Total 100Marks
Duration of Exam 03Hours

Objectives of the course:

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.

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

Servlet: Servlet introduction, web terminology, servlet API, servlet Interface, generic servlet, Http
servlet, servlet lifecycle, servlet with IDE (eclipse, My eclipse, Net beans), 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: Lifecycle of JSP, JSPAPI, scripting elements, 9Implicit 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, stuts2withI18N, zero configuration,
struts2withtiles, hibernate with struts2, spring with struts2, 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;
UNIT3
Hibernate(HB): Introduction, architecture, HB with IDE, HB Log4j, 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:
1. Knowledge of the structure and model of the Java programming language,
(knowledge)
2. Use the Java programming language for various programming technologies
(understanding)
3. Develop software in the Java programming language,

Suggested Text Books:

1. Patrick Naught on and Herbertz Schidt, “Java-2 the complete Reference”,TMH
2. Sierra & bates, “Head First Java”, O’Reilly.

Suggested Reference Books:

1. E. Balaguruswamy, “Programming with Java”,TMH
2. Horstmann, “Computing Conceptswith Java2 Essentials”, John Wiley.
3. Decker & Hirsh field, “Programming.Java”, Vikas Publication.
 MOBILE AND WIRELESS COMMUNICATION

Course code ESC-CSE-308G

Category Engineering Science Course

Course title Mobile and wireless communication
L T P Credits
Scheme and Credits Semester 6
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours
Objectives of the course:

 Understand the wireless/cellular radio concepts such as frequency reuse, handoff

and interference between mobiles and base stations.
 Identify the techno-political aspects of wireless and mobile communications such as
the allocation of the limited wireless spectrum by regulatory agencies.
 Understand the information theoretical aspects such as channel capacity,
propagation effects, modeling the impact of signal bandwidth and motion in mobile
systems.
 Describe the current and future Mobile Communication Systems, GSM, Satellite,
Broadcasting, Bluetooth, Wireless LANs, Mobile Adhoc Networks.
 Describe the mobility support mechanism, WWW and WAPs.

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: 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.
Suggested Reference Books:

1. Jochen Schiller, “MobileCommunication”, Pearson Education, 2002

2. LEE, “Mobile Cellular Telecommunications”, McGRAW-Hill, 2nd Edition.
3. Theodore S Rappaport, “Wireless Communications”, Pearson Education.

Course Outcomes:

 Explain the principles and theories of mobile computing technologies.

 Describe infrastructures and technologies of mobile computing technologies.
 List applications in different domains that mobile computing offers to the public,
employees, and businesses.
 Describe the possible future of mobile computing technologies and applications.
 Effectively communicate course work through written and oral presentations
 PROJECT - I

Course code PROJ-CSE-322G

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)

 Synopsis submission (5 marks),

 1stmid term progress evaluation (5 marks)
 2nd mid term progress evaluation (5 marks)
 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.
 COMPILERDESIGN LAB

Course code LC-CSE-324G

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

Objectives of the course:

 Implementation of different concepts of lexical analysis.
 Implementation of parsers.
 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:
i) Write a Program for implementation of calculator using YACC tool.
ii) Write a Program for implementation of Recursive Descent Parser using LEX
tool.
10. Write a Program for implementation of LL (1) Parser.
11. 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:

 The course will help in improving the programming skills of the students.
 The implementation of different parsers will help in understanding of compiler
designing.
 ARTIFICIAL INTELLIGENCE LAB USING PYTHON

Course code LC-CSE-326G

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.

 ADVANCED JAVA LAB

Course code LC-CSE-328G

Category Professional Core Course

Course title Advanced Java Lab
L T P Credits
Scheme and Credits Semester 6
0 0 2 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-306G

Course code MC-317G
Category Mandatory Course
Course title Constitution of India

Scheme and credits L T P Credits

2 0 0 0

Course Objectives:
Students will be able to:
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.
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.
Course Outcomes:
Students will be able to:
1. Discuss the growth of the demand for civil rights in India for the bulk of Indians before the
arrival of Gandhi in Indian politics.
2. Discuss the intellectual origins of the framework of argument that informed the
conceptualization of social reforms leading to revolution in India.
3. Discuss the circumstances surrounding the foundation of the Congress Socialist Party
[CSP] under the leadership of Jawaharlal Nehru and the eventual failure of the proposal of
direct elections through adult suffrage in the Indian Constitution.
4. Discuss the passage of the Hindu Code Bill of 1956.

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 for
the 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-310G

Category Professional Elective Course

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

Objective of the course:

 To understand DBMS Components, Advantages and Disadvantages.
 Understanding Data modeling: ER, EER, Network, Hierarchical and Relational data
models.
 Understanding normalization, general strategies for query processing, query
processor, syntax analyzer, Query decomposition, Heuristic Query optimization.
 To understand transaction concept, schedules, serializability, locking and
concurrency control protocols.
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: 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

Suggested Text Book:

1. Elmarsi, Navathe, Somayajulu, Gupta, “Fundamentals of Database Systems”, 4 th
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

Suggested References Books:

1. Date, Kannan, Swaminathan, “An Introduction to Database Systems”, 8th Edition

Pearson Education, 2007
2. Singh S.K., “Database System Concepts, design and application”, Pearson Education,
2006.
3. Silberscatz, Korth, Sudarshan, “Database System Concepts”, Mcgraw Hill, 6th Edition,
2006
4. W. Kim, “Modern Database Systems”, 1995, ACM Press, Addision Wesley,

Course Outcomes:
 Students will get understanding of DBMS Components, Its advantages and
disadvantages.
 Understanding about various types of Data modeling: ER, EER, Network, Hierarchical
and Relational data models.
 Understanding normalization, general strategies for query processing, query
processor, syntax analyzer, Query decomposition, Heuristic Query optimization.
 Understanding transaction concept, schedules, serializability, locking and
concurrency control protocols.
 MOBILE APPLICATIONS DEVELOPMENT

Course code PEC-CSE-312G

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

Objectives of the course:

 Introduce the students with the various “Next Generation Technologies” in the area
of mobile computing
 Assist students understand the various Mobile operating Systems
 Explore the findings using Android Technologies

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: 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 management, communication
protocols, application development methods, deployment.
iOS: Introduction to iOS, Architecture, memory management, communication protocols,
application development methods, deployment

Suggested text books:

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

Suggested reference books:

1. Neal Goldstein, Tony Bove, “iPhone Application Development All-In-One For

Dummies”, John Wiley & Sons
2. Henry Lee, Eugene Chuvyrov, “Beginning Windows Phone App Development”,
Apress, 2012.
3. Jochen Schiller,“Mobile Communications”, Addison-Wesley, 2nd edition, 2004.
4. Stojmenovic and Cacute, “Handbook of Wireless Networks and Mobile
Computing”, Wiley, 2002, ISBN 0471419028.

Course Outcomes:

 Explain the principles and theories of mobile computing technologies.

 Describe infrastructures and technologies of mobile computing technologies.
 List applications in different domains that mobile computing offers to the public,
employees, and businesses.
 Describe the possible future of mobile computing technologies and applications.
 Effectively communicate course work through written and oral presentations
 COMPUTER GRAPHICS

Course code PEC-CSE-314G

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

Objectives of the course:

 To have basic understanding of the core concepts of Computer Graphics.

 Understand scan conversion, 2D, 3D – transformation and viewing.
 To be able to create interactive computer Graphics with understanding of shading,
image processing and illumination model.

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 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.

Suggested Text Books:

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.

Suggested Reference Books:

1. Procedural Elements for Computer Graphics – David F. Rogers, 2001, T.M.H Second
Edition
2. Fundamentals of 3-Dimensional Computer Graphics by Alan Watt, 1999, Addision
Wesley.
3. Computer Graphics: Secrets and Solutions by Corrign John, BPB
4. Graphics, GUI, Games & Multimedia Projects in C by Pilania & Mahendra, Standard
Publ.
5. Computer Graphics Secrets and solutions by Corrign John, 1994, BPV
6 Introduction to Computer Graphics by N. Krishanmurthy T.M.H 2002

Course Outcomes:

 Understanding of the software, hardware and applications of Computer Graphics.

 Understanding of Scan conversion, 2D, 3D – transformation and viewing.
 To be able to implement picture on screen using projection, shading, image
processing and illumination model.
 COMMUNICATION ENGINEERING

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

Category Program Elective Course
Course title Communication Engineering
L T P Credits
Scheme and Credits
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours
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

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
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
TEXT BOOK :
1. Principles of Communication Systems: Taub Schiling; TMH
REFERENCE BOOKS.
1. Communication Systems: Singh and Sapre ; TMH
2. Communication Systems: A Bruce Carlson; TMH

COURSE OUTCOMES: After the completion of the course the student will be able to:

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

Course code PEC-CSE-316G

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

Objectives of the course:

 To examine the fundamental principles of distributed systems, and provide students
hands-on experience in developing distributed protocols.
 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.

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: 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
Suggested Reference books:

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,
TimKindberg, 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

Course Outcomes:

 List the principles of distributed systems and describe the problems and challenges
associated with these principles.
 Understand Distributed Computing techniques, Synchronous and Processes.
 Apply Shared Data access and Files concepts.
 Design distributed system that fulfills requirements with regards to key distributed
systems properties.
 Understand Distributed File Systems and Distributed Shared Memory.
 Apply Distributed web-based system and understand the importance of security in
distributed system
 INFORMATION TECHNOLOGY & INDUSTRY BUSINESS SKILLS

Course code PEC-CSE-318G

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

Objectives of the course:

 To understand the novel information technology techniques and industry business
skills.
 To study about the concept of amazon web services.
 To understand the use of cloud in web services and their different application.
 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.

Suggested reference books:

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;

Course Outcomes:

 Student will understand the concept of web services of amazon, virtual machines
and their working.
 For a given region the availability of resources and cost management.
 For a given application scalable model and selection of services.
 DATA SCIENCE

Course code PCC-CSE-320G

Category Professional Core 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

Objectives of the course:

 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.
 To introduce the conceptual knowledge of the area of data science domain, feature
and scope of applications.
 To impart programming knowledge needed for data sciences.
 To understand the different issues involved in the design and implementation of a
data science applications.
 To understand case studies of essential Data sciences 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

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

Suggested Text books:

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.

Suggested Reference books:

1. Data Science Workflow: Overview and Challenges by Philip Guo
2. Python for Data Analysis, O’Reilly Media Rajiv, “Machine Learning”, Khanna
Publishing House, Delhi.
3. Ian Goodfellow, YoshuaBengio and Aaron Courville, "Deep Learning", MIT Press
4. http://www.deeplearningbook.org
5. Jiawei Han and Jian Pei, "Data Mining Concepts and Techniques", Third Edition,
Morgan
6. Kaufmann Publishers

Course Outcomes:

 Understand the value of data science and the process behind using it.
 Use Python to gather, store, clean, analyse, and visualise data-sets.
 Apply toolkits to formulate and test data hypotheses and uncover relationships
within data-sets
 Understand the data science methodology in the data science pipeline
 Understand real-world challenges with several case studies
 VHDL AND DIGITAL DESIGN

Course code PEC-CSE-332G (common with ECE)

Category Program Elective Course

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

Course Objective:

 To understand the modelling & simulation & its role in digital evaluation.
 To learn basic concepts of VHDL language, its different architecture, designing of
various Combinational & sequential circuits.
 To study various PLDs & detail study of FPGAs and implementation of various
combinational & sequential logic circuits on FPGAs.

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: Introduction to Computer-aided design tools for digital systems. Hardware

description languages; introduction to VHDL data objects, classes and data types, Operators,
Overloading, logical operators. Types of delays, Entity and Architecture declaration.
Introduction to behavioural dataflow and structural models.

UNIT- 2
VHDL STATEMENTS: Assignment statements, sequential statements and process,
conditional statements, case statement Array and loops, resolution functions, Packages and
Libraries, concurrent statements. Subprograms: Application of Functions and Procedures,
Structural Modelling, component declaration, structural layout and generics.

UNIT -3

COMBINATIONAL & SEQUENTIAL CIRCUIT DESIGN:VHDL Models and Simulation of

combinational circuits such as Multiplexers, Demultiplexers, encoders, decoders , code
converters, comparators, implementation of Boolean functions etc. VHDL Models and
Simulation of Sequential Circuits Shift Registers, Counters etc.
UNIT-4

DESIGN OF MICROCOMPUTER & PROGRAMMABLE DEVICE: Basic components of a

computer, specifications, architecture of a simple microcomputer system, and
implementation of a simple microcomputer system using VHDL Programmable logic devices:
ROM, PLAs, PALs, GAL, PEEL, CPLDs and FPGA. Design implementation using CPLDs and
FPGAs

REFERENCE BOOKS:
1. Ashenden - Digital design,Elsevier
2. IEEE Standard VHDL Language Reference Manual (1993).
3. Digital Design and Modelling with VHDL and Synthesis: KC Chang; IEEE Computer Society
Press.
4. "A VHDL Primmer” : Bhasker; Prentice Hall 1995.
5. “Digital System Design using VHDL” : Charles. H.Roth ; PWS (1998).
6. "VHDL-Analysis & Modelling of Digital Systems” :Navabi Z; McGraw Hill.
7. VHDL-IV Edition: Perry; TMH (2002)
8. “Introduction to Digital Systems” :Ercegovac. Lang & Moreno; John Wiley (1999).
9. Fundamentals of Digital Logic with VHDL Design : Brown and Vranesic; TMH (2000)
10. Modern Digital Electronics- III Edition: R.P Jain; TMH (2003).
11. Grout - Digital system Design using FPGA & CPLD 'S,Elsevier

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

 Understand the need & application of hardware description language.

 Modelling & simulations of various basic & advanced digital systems using VHDL.
 Implementation of various basic & advanced digital systems using FPGAs.
 Apply knowledge to design & implement combinational circuits & sequential circuits
related to research & industry applications.
 M.D. UNIVERSITY, ROHTAK
SCHEME OF STUDIES AND EXAMINATION
B. TECH (Computer Science and Engineering)
SEMESTER 7th & 8th
‘G’ Scheme effective from 2021-22

COURSE CODE AND DEFINITIONS

Course Code Definition

L Lecture s
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

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 Examination Schedule

Dur
week (Marks)
Total atio
Contac Inte n of
Sr. Course Title Cre
Category Course Code t Hrs. rnal Pra Exa
No. dit The Tot
L T P per Ass ctic m
ory al
week esm al (Ho
ent urs)

Professional
1 PCC-CSE-401G Neural Networks 3 0 0 3 3 25 75 100 3
Core Course
Professional
Refer to Professional
2 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 Elective –I 3 0 0 3 3 25 75 100 3
Course OEC-I
Professional Neural Networks
5 LC-CSE-421G 0 0 2 2 1 25 - 25 50 3
Core Course Lab

PROJ-CSE-
6 Project Project-II 0 0 6 6 3 50 - 50 100 3
423G

Professional Practical Training-

7 PT-CSE-425G 0 0 0 1 - - - - - -
Core Course II

TOTAL CREDIT 16 175 300 75 550

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 annexures.
Annexure IV: Professional Elective -IV
1. PEC-CSE-403G: Software Project Management
2. PEC-CSE-405G: Web Mining
3. PEC-CSE-407G: Predictive Analysis
4. PEC-CSE-409G: Information Hiding Techniques
Annexure V: Professional Elective -V
1. PEC-CSE-411G: Network Security and cryptography
2. PEC-CSE-413G: Software Testing
3. PEC-CSE-415G: Cyber Security Threats
4. PEC-CSE-417G: Advanced Computer Architecture
Annexure OEC-I: Open Elective-I
1. OEC-PHY-101G: Material Science
2. OEC-ECE-451-G: Electronic Principles
3. HSMC-08G: Fundamentals of Management
4. OEC-CE-451-G: Disaster Management
5. HSMC-10G: English for Professionals
 B.Tech (COMPUTER SCIENCE & ENGINEERING)
Scheme of Studies/Examination
Semester 8th
w.e.f. 2021-2022

Tot Examination Schedule

Hours per week Dur
al (Marks)
atio
Con
Inte n of
Sr. tact Cre
Category Course Code Course Title rnal Pra Exa
No. Hrs. dit The Tot
L T P Ass ctic m
per ory al
esm al (Ho
wee
ent urs)
k
Professional Machine
1 PCC-CSE-402G 3 0 0 3 3 25 75 100 3
Core Course Learning

Professional Big Data

2 PCC-CSE-404G 3 0 0 3 3 25 75 100 3
Core Course Analytics
Open Refer to
3 Elective Annexure OEC- Open Elective-II 3 0 0 3 3 25 75 100 3
Course III
Professional Big Data
4 LC-CSE-410G 0 0 0 2 1 25 25 50 3
Core Course Analytics Lab
Machine
Professional
5 LC-CSE-412G Learning with 0 0 2 2 1 25 25 50 3
Core Course
Python Lab

6 Project PROJ-CSE-422G Project-III 0 0 8 4 4 50 50 100 3

TOTAL CREDIT 15 175 225 100 500

NOTE:
Choose one subject from open Elective – II. List of elective subjects is attached as
annexure.

Annexure OEC-II: Open Elective-II

1. PEC-ME-410G: Quality Engineering
2. OEC-ECE-430G: Wireless Adhoc and Sensor Networks
3. OEC-ECE-452-G: Intelligent Instrumentation for Engineers
4. OEC-CE- 448G: Traffic Engineering and Road Safety
5. OEC-EE-08G: Conventional and Renewable Energy Resources
 NEURAL NETWORK

Course code PCC-CSE-401G

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.

UNIT 1
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 mu ltilayer
network, fully recurrent network,
UNIT 2
McCulloch and Pits Neural Network (MCP Model): Architecture, Solution of AND, OR
function using MCP model, Hebb Model: Architecture, training and testing, Hebb network
for 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.
UNIT 3
Learning: Supervised, Unsupervised, reinforcement learning, Gradient Decent algorithm,
generalized delta learning rule, Habbian learning, Competitive learning, Back propogation
Network: Architecture, training and testing,
UNIT 4
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:
1. For a given conceptual problem student will able to analyze the problem and able to
visualize in NN
2. Students will be familiar with different NN models.
3. Students will be able to understand the concept of learning in NN.

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
 NEURAL NETWORKS LAB

Course code LC-CSE-421G

Category Professional Core Course

Course title Neural Networks Lab
L T P Credits
Scheme and Credits 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

1. For a given conceptual problem student will be able to analyze the problem and able
to visualize using NN
2. Students will be familiar with different NN models and its implementation.
3. Students will be able to understand the concept of learning in NN and its
implementation.
 PROJECT-II

Course code PROJ-CSE-423G

Category Professional Core Course

Course title Project-II
L T P Credits
Scheme and Credits Semester 7
0 0 6 3
Class work 50 Marks
Exam 50 Marks
Total 100 Marks
Duration of Exam 03 Hrs

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 (10 marks),
2. 1st mid-term progress evaluation (10 marks)
3. 2nd mid-term progress evaluation (10 marks)
4. Final submission evaluation (20 marks).
The external examiner will evaluate the project on the basis of idea/quality of
project, implementation of the project, project report and viva.
 PRACTICAL TRAINING-II

Course code PT-CSE-425G

Category Professional Core Course

Course title Practical Training-II
L T P Credits
Scheme and Credits 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

Course code PEC-CSE-403G

Category Professional Elective Course

Course title Software Project Management
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:
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 e ight 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.
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

Course code PEC-CSE-405G

Category Professional Elective Course

Coursetitle Web Mining
L T P Credits
Scheme and Credits 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 uni t.

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:
pages of web search engine by classifying the web documents and identifying the web
power
1. Learn how the Web mining helps to improve the power of web search engine by
classifying the web documents and identifying the web pages.
2. How to predict user behaviour in the web.
3. For a given data set how the optimization will be performed.

Suggested 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-407G

Category Professional Elective Course

Course title Predictive Analytics
L T P Credits
Scheme and Credits Semester 7
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.

Unit 1
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).

Unit 2
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, Logit 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:
1. Ability to develop and use various quantitative and classification predictive models
based on various regression and decision tree methods.
2. Ability to select the appropriate method for predictive analysis
3. Ability to search, identify, gather and pre-process data for the analysis.
4. Ability to formulate predictive analytics questions.

Suggested books:
1. “An Introduction to Statistical Learning: with Applications in R” by James, Witten,
Hastie and Tibshirani, Springer, 1st. Edition, 2013.

Suggested 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)
 INFORMATION HIDING TECHNIQUES

Course code PEC-CSE-409G

Category Professional Elective Course

Course title Information Hiding Techniques
L T P Credits
Scheme and Credits 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 learn about data hiding applications and their techniques.

2. To learn about hacking.
3. To learn security based protocols, attacks and intrusions.
4. To work with advance data hiding techniques.

UNIT 1
Introduction to Information Hiding: Types of Information Hiding, Applications,
Importance & Significances. Differences between cryptography and steganography,
Wisdom from Cryptography, types of steganography their application and significances.
Past present and future of steganography

UNIT 2
Framework for Secret Communication, Security of Steganography System, Information
Hiding in Noisy Data, Adaptive versus non-Adaptive Algorithms, Active and Malicious
Attackers, Information hiding in Written Text, Steganographic system, Study of
Different methods of insertion and retrieval of message using image steganography,
Study of histrogram analysis using MATLAB of original image and stegno image

UNIT 3
Basics of watermarking, Watermarking process, Watermarking applications,
Requirements and Algorithmic Design Issues, Evaluation and Benchmarking of
Watermarking, Bit plane of an Image, study of noises in stego images and their
comparisons, Robustness of watermarking schemes on different attacks like blurring,
cropping , compression of the image. PSNR calculation of the images.

UNIT 4
Use of image steganography in biometric sciences, Study of security enhancement of
biometric template using steganographic Frame proof codes:-Definition, Introduction
of frame proof codes, Methods to obtain 2- frame proof codes using mutually
orthogonal latin squares. Use of frame proof codes in ownership and software piracy.

Course Outcomes:

After completing the course the student will be able to:

1. Explain information security.

2. Give an overview of access control of relational databases.
3. State the basic concept in information systems security, including security
technology and principles, software security and trusted systems and IT security
management.
4. Learn advance data hiding techniques.

Suggested Books:
1. Recent Advances in Information Hiding and Applications, Pan, J.-S.,
Huang, H.-C., Jain, L.C., Zhao, Y., Springer (2013).
2. Information Hiding Techniques for Steganography and Digital
Watermarking, StefanKatzenbeisser, Fabien A. P. Petitcolas, Artech
House, 2000.
 NETWORK SECURITY AND CRYPTOGRAPHY

Course code PEC-CSE-411G

Category Professional Elective Course

Course title Network Security and Cryptography
L T P Credits
Scheme and Credits 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, RSA
symmetric 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.

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)

Course Outcomes:

After completing the course the student will be able to

1. Compare various cryptographic techniques.

2. Work with symmetric & asymmetric key algorithms.
3. Design secure applications.
4. Inject secure coding in the developed applications.
 SOFTWARE TESTING

Course code PEC-CSE-413G

Category Professional Elective Course

Course title Software Testing
L T P Credits
Scheme and Credits 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 testing
operations, 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.

Unit 1

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

Unit 4

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:
1. Understand software testing and quality as a fundamental component of
software development life cycle
2. Understand and design the test cases for a given problem
3. Understand the process of Reporting of software failures(bugs) using tools like
Bugzilla
4. Develop the knowledge of selection of appropriate test cases for execution
during regression testing

Suggested books:
1. “Software Testing: Principles and Practices”, by Naresh Chauhan. Oxford
University Press

Suggested 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

Course code PEC-CSE-415G

Category Professional Elective Course

Course title Cyber Security Threats

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

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:
1. Analyze and resolve security issues in networks and computer systems to
secure an IT infrastructure.
2. Design, develop, test and evaluate secure software.
3. Develop policies and procedures to manage enterprise security risks.
4. Evaluate and communicate the human role in security systems with an
emphasis on ethics, social engineering vulnerabilities and training.
5. Interpret and forensically investigate security incidents.

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

Course code PCC-CSE-417G

Category Professional Elective Course

Course title Advanced Computer Architecture
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

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 depe ndent 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:

1) Understand the Concept of Parallel Processing and its applications.

2) Implement the Hardware for Arithmetic Operations.
3) Analyze the performance of different scalar Computers.
4) Develop the Pipelining Concept for a given set of Instructions.
5) Distinguish the performance of pipelining and non-pipelining environment in
a processor.

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

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

Course code OEC-PHY-101G

Category Open Elective Course
Course title Material Science
Scheme and Credits L T P Credits
3 0 0 3

Class work 25 Marks

Exam 75 Marks
Total 100 Marks
Duration of exam 03 Hours

Course objectives:

The course intends to provide the knowledge of

1. Crystal structure and defects in solids.
2. Classification of different solids.
3. Properties of semiconductor, dielectric and magnetic materials.

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 se lecting one from each unit.

UNIT - 1

Crystal Structure

Space lattice and translation vectors, Unit cell, Bravais lattice, Closed packed structures,
Miller indices, Diffraction of electromagnetic waves by crystals: X-rays, electrons and
neutrons, Bragg’s law, X-ray diffraction (Laue and Powder method), Point defects in solids -
Schottky and Frenkel defects.

UNIT - 2

Electrical Properties

Classification of solids into conductors, semiconductors and insulators, Semiconductor

Materials: intrinsic and extrinsic, Fermi level and electron & hole concentrations at
equilibrium, Carrier transport: diffusion and drift, p-n junction, Zener and Avalanche
breakdown.
UNIT - 3

Magnetic Properties

Atomic magnetic moments and origin of magnetization, Types of magnetic materials,

Ferromagnetism: molecular field, Curie temperature, Domain theory, Hysteresis and its
applications.

Superconductivity: Properties of superconductors, Meissner effect, London equations,

Elements of BCS Theory, Applications of superconductors.

UNIT - 4

Dielectric Properties

Molecular theory, Polarization, Electric displacement vector, susceptibility, dielectric

constant, permittivity and various relations between these parameters, Gauss’s law in the
presence of a dielectric, Energy stored in a uniform electric field, Concept of local molecular
fields and Claussius - Mossotti relation.

Course outcome:
At the end of the course, the student should at least be able to:
1. Segregate crystals based on their structure and apply effects of defects on manipulating
properties of solids.
2. Distinguish between insulator, conductor and semiconductor. They should know the
difference between intrinsic and extrinsic semiconductors and about the fermi level
position in these semiconductors.
3. Select various dielectric, magnetic materials for specific applications in different fields.

Suggested reference books:

1. Concepts of Modern Physics- Arthur Beiser (TMGH)

2. Solid State Physics- S.O. Pillai (New Age Int. Ltd. Pub.)
3. Modern Physics for Engineers- S.P. Taneja (R. Chand)
4. Engineering Physics- Satya Prakash (Pragati Prakashan)
5. Engineering Physics- Malik & Singh (McGraw Hill)
6. Charles Kittel, Introduction to Solid State Physics, 7th Edition, John Wiley & Sons,
2008.
7. S O Pillai, Solid State Physics, 8th edition, New Age international Publishers, 2018
 ELECTRONIC PRINCIPLES

Course code OEC-ECE-451-G

Category Open Elective Course

Course title Electronic Principles
L T P Credits
Scheme and Credits Semester 7th
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 se lecting 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 abili ty to:
1. Understand the working of electronic components.
2. Understand the Digital System and various displays.

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-08G

Category Open Elective Course

Course title Fundamentals of Management

Scheme and Credits L T P Credits

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,

Management vs. 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
1. Evolution of Management and contribution of Management thinkers.
2. Importance of staffing and training
3. The concept of material management and inventory control
4. The components of marketing and advertising
5. Various sources of finance and capital structure

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-451G

Category Open elective courses

Course title Disaster Management
L T P Credits
Scheme and 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:

1. To know natural as well as manmade disaster and their extent and possible effects
on the economy.
2. To Plan national importance structures based upon the previous history.
3. To acquaint with government policies, acts and various organizational structures
associated with an emergency.
4. To know the simple dos and don’ts in such extreme events and act accordingly.

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-10G
Category Open Elective Course
Course title English For Professionals
Scheme and Credits L T P Credits
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

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.

UNIT 1

Communication Process Types and Levels, Scopes and significance, Technical and Tools of
Effective communication

UNIT 2

Speaking files and Personality Development Oral Presentation, Body Language, Voice
Modulation, Negotiation, Group Discussion, Interview techniques

UNIT 3

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

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
 BASICS OF MACHINE LEARNING

Course code PCC-CSE-402G

Category Professional Core Course

Course title Basics of Machine Learning
L T P Credits
Scheme and Credits Semester-8
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

Suggested books
1. E. Alpaydin, Introduction to
2. 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.
Suggested 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

Course Outcomes

1. Understand fundamental issues and challenges of supervised and unsupervised

learning techniques.
2. Extract features that can be used for a particular machine learning approach
3. To compare and contrast pros and cons of various machine learning techniques and
to get an insight of when to apply a particular machine learning approach.
4. To mathematically analyse various machine learning approaches and paradigms.
 BIG DATA ANALYTICS

Course code PCC-CSE-404G

Category Professional Core Course

Course title Big Data Analytics
L T P Credits
Scheme and Credits Semester 8
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 Apply
techniques 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

Suggested books:

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

Suggested reference books

1. Michael Berthold, David J. Hand, "Intelligent Data Analysis”, Springer, 2007.

2. Jay Liebowitz, “Big Data and Business Analytics” Auerbach Publications, CRC press
(2013)
3. 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.
4. Anand Rajaraman and Jef rey David Ulman, “Mining of Massive Datasets”, Cambridge
University Press, 2012.
5. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics”, John Wiley & sons, 2012.
6. Glen J. Myat, “Making Sense of Data”, John Wiley & Sons, 2007
7. Pete Warden, “Big Data Glossary”, O’Reily, 2011.
8. Michael Mineli, Michele Chambers, Ambiga Dhiraj, "Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends for Today's Businesses", Wiley Publications,
2013.
9. ArvindSathi, “BigDataAnalytics: Disruptive Technologies for Changing the Game”, MC
Press, 2012
10. 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.
 Course Outcomes

1. For a given query Describe the Big Data landscape including examples of real world big
data problems including the three key sources of Big Data: people, organizations, and
sensor.
2. For a given specification, Recognize different data elements in your own work and in
everyday life problems
3. For a given specification select a data model to suit the characteristics of your data
4. 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
5. 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.
 BIG DATA ANALYTICS LAB

Course code LC-CSE-421G

Category Big Data Analytics

Course title Neural Networks Lab
L T P Credits
Scheme and Credits Semester 8
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.

 MACHINE LEARNING WITH PYTHON

Course code LC-CSE-421G

Category MACHINE LEARNING WITH PYTHON

Course title MACHINE LEARNING WITH PYTHON LAB
L T P Credits
Scheme and Credits Semester 8
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.

 Project-III

Course code PROJ-CSE-422G

Category Professional Core Course

Course title Project-III
L T P Credits
Scheme and Credits Semester 8
0 0 8 4
Class work 50 Marks
Exam 50 Marks
Total 50 Marks
Duration of Exam 03 Hrs

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 (10 marks),
2. 1st mid-term progress evaluation (10 marks)
3. 2nd mid-term progress evaluation (10 marks)
4. Final submission evaluation (20 marks).
The external examiner will evaluate the project on the basis of idea/quality of
project, implementation of the project, project report and viva.
 QUALITY ENGINEERING
Course code PEC-ME-410G
Category Open Elective Courses
Course title QUALITY ENGINEERING
Scheme and Credits L T P Credits Semester-8
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.
UNIT 1
Basic Concepts of Quality: Definitions of Quality and its importance in industry, Quality
function, Quality Characteristics, Quality process, Quality Traits, Applications of Quality
Concept, Introduction to quality control, Computer aided quality control, Total quality
control(TQC) and its implementation, Elements of TQC, Quality Circle, Objectives of quality
circle, Role of management in quality circle, Quality in service organizations, characteristics
of a service organization, Important service dimensions, Design of service quality.
UNIT2
Basic Statistical Concepts: The Concept of variation, Distinction between variables and
attributes data, The frequency distribution, graphical representation of frequency
distribution, Quantitative description of distribution, the normal curve, concept of
probability, laws of probability, probability distributions, hyper geometric distribution,
binomial distribution, The Poisson distribution.

UNIT3
Quality systems: Quality systems, Need for quality System, Need for standardization,
History of ISO:9000 series standards and its features, steps to registration, India and
ISO:9000, Automated inspection systems technologies, Different forms of Inspection,
Industrial inspection,
UNIT4
Total Quality Management: Introduction o TQM, Concepts, Characteristics of TQM,
Relevance of TQM, Approaches to TQM Implementation, TQM philosophies, Taguchi
Philosphy, JIT, Kaizen, Six Sigma approach, 5-S approach

Course Outcomes: Upon completion of this course the student will be able to:
 1. Attain the basic techniques of quality improvement, fundamental knowledge of
statistics and probability
2. Use control charts to analyze for improving the process quality.
3. Describe different sampling plans
4. Acquire basic knowledge of total quality management
5. Understand the modern quality management techniques

Text Books:
1. Quality planning and Analysis, Juran and Gryna, TMH, New Delhi
2. Quality Management, Kanishka Bed, Oxford University Press, New Delhi
3. Introduction to SQC, Montgomery DC, 3e, Wiley, New Delhi
4. Fundamentals of quality control and improvement, A Mitra, Mcmillan pub.
Company, NY

Reference Books:
1. Fundamentals of Applied Statistics, Gupta and Kapoor, Sultan Chand and Sons, New
Delhi.
 WIRELESS ADHOC AND SENSOR NETWORKS

Course code OEC-ECE-430G

Category Open Elective Course

Course title Wireless Adhoc and Sensor Networks
L T P Credits
Scheme and Credits SEMESTER 8
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours

Objectives of the course

2. Learn Ad hoc network and Sensor Network fundamentals
3. Understand the different routing protocol
4. Have an in-depth knowledge on sensor network architecture and design issue.
5. Understand the transport layer and security issues possible in Ad hoc and Sensor
networks
6. Have an exposure to mote programming platforms and tool.

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- I
Introduction to Ad Hoc Networks: Characteristics of MANETs, Applications of MANETs and
challenges of MANETs - Routing in MANETs: Criteria for classification, Taxonomy of
MANET routing algorithms, Topology based routing algorithms, Position based routing
algorithms, Other routing algorithms.

UNIT- II
Data Transmission: Broadcast storm problem, Broadcasting, Multicasting and
GeocastingTCP over Ad Hoc: TCP protocol overview, TCP and MANETs, Solutions for TCP
over Ad hoc

UNIT- III
Basics of Wireless, Sensors and Applications: Applications, Classification of sensor networks,
Architecture of sensor network, Physical layer, MAC layer, Link layer.

UNIT- IV
Data Retrieval in Sensor Networks: Routing layer, Transport layer, High-level application
layer support; Adapting to the inherent; dynamic nature of WSNs; Sensor Networks and
mobile robots. Security: Security in Ad Hoc networks, Key management, Secure routing,
Cooperation in MANETs, Intrusion Detection systems.
Sensor Network Platforms and Tools: Sensor Network Hardware, Berkeley motes, Sensor
Network Programming Challenges, Node-Level Software Platforms - Operating System:
TinyOS– Imperative Language: nesC, Dataflow style language: TinyGALS, Node -Level
Simulators, ns2 and its sensor network extension, TOSSIM.

Suggested Books:
1. Ad Hoc and Sensor Networks – Theory and Applications, Carlos Corderio Dharma
P.Aggarwal, World Scientific Publications, March 2006, ISBN – 981-256-681-3
2.Wireless Sensor Networks: An Information Processing Approach, Feng Zhao, Leonidas
Guibas, Elsevier Science, ISBN – 978-1-55860-914-3 ( Morgan Kauffman

Course Outcomes:
1. Understand the needs of Wireless Adhoc and Sensor Network in current scenario .
2. Describe current technology trends for the implementation and deployment of
wireless Adhoc/sensor networks.
3. Discuss the challenges in designing MAC, routing.
4. Transport protocols for wireless Ad-hoc/sensor networks.
5. Explain the principles and characteristics of wireless sensor networks.
 TRAFFIC ENGINEERING AND ROAD SAFETY

Course code OEC-CE- 448G

Category Open Elective Course

Course title Traffic Engineering and Road Safety
L T P Credits
Scheme and Credits SEMESTER 8
3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 3 Hours

COURSE OBJECTIVES:

1. Acquaint the students to basic concepts of Traffic and their significance.

2. To stimulate the students to think systematically and objectively about various
traffic problems

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

Traffic Characteristics: Importance of traffic characteristics. Road user characteristics.

Vehicular characteristics. Max dimensions and weights of vehicles allowed in India.

Traffic Studies: Traffic volume study, speed study and origin and destination study. Speed
and delay study.

UNIT2

Traffic Accidents: Accident surveys. Causes of road accidents and preventive measures.
Capacity and Level of Service.

Relationship between speed, volume and density, PCU, Design service volume, Capacity of
non-urban roads. IRC recommendations, Brief review of capacity of urban roads.

UNIT3

Traffic Control Devices: Signs, Signals, markings and islands. Types of signs, Types of signals,
Design of Signal, Intersections at grade and grade separated intersections. Types of grades
separated intersections, Parking surveys: On street parking, off street parking.
UNIT-4

Road safety audit, RSA team, RSA Report, Elements of RSA, Vehicular air pollution and
Situation in India, Motor vehicle act, Vehicular emission norms in India and abro ad,
Alternate fuels, Factors affecting fuel consumption.

COURSE OUTCOMES:

After completing this course, students should be able:

 To realize the significance of traffic engineering in today life.

 To understand the processes involved in traffic studies.
 To appreciate the role of Traffic regulations.

RECOMMENDED BOOKS:

 Principles of Transportation Engineering by Chakroborty & Das, Prentice Hall, India.

 Highway Engg by S.K.Khanna & C.E.G. Justo, Nem Chand Bros., Roorkee.
 Traffic Engg and Transport Planning by L.R.Kadiyali, Khanna Publishers, Delhi.
 Principles of Transportation and Highway Engineering by G.V.Rao, Tata McGraw-Hill
Publishing Co. Ltd. N.Delhi.
 CONVENTIONAL AND RENEWABLE ENERGY RESOURCES

Course code OEC-EE- 08G

Category Open Elective Course

Course title Conventional And Renewable Energy Resources
Scheme and L T P Credits
SEMESTER 8
Credits 3 0 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 3 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.
Objective:
1. The course will provide understanding of power generation technology using
conventional and non-conventional energy sources which will be useful for
understanding the operation and working of power plants.
2. Students will learn basics of Tariff structure for energy production.
3. Students will understand the operation, maintenance and working of substations.

UNIT1
INTRODUCTION: Energy sources, their availability, recent trends in Power Generation,
Amount of generation of electric power from Conventional and non-conventional sources of
energy in Haryana, India and some developed countries of the world. Interconnected
Generation of Power Plants.

UNIT2
POWER GENERATION PLANNING: Load forecasting, load curves, load duration curve, Base
load and Peak load Power Plants, connected Load, maximum demand, demand factor,
Group diversity factor, load factor, significance of load factor, plant factor, capacity factor,
selection of unit size, No. of Units, reserves, cost of power generation, Depreciation, tariff.

UNIT3
CONVENTIONAL ENERGY SOURCES: Selection of site, capacity calculations, classification,
Schematic diagram and working of Thermal Power Stations(TPS), Hydro Electric Plant and
Nuclear Power Plant .
NON-CONVENTIONAL ENERGY SOURCES: Selection of site, capacity calculations, Schematic
diagram and working of Wind, Solar, fuel cell, Magneto Hydro Dynamic (MHD) system.
UNIT4
ELECTRIC ENERGY CONSERVATION & MANAGEMENT: Energy management,
Energy Audit, Energy Efficient Motors, Co-generation.
Course Outcomes:
After learning the course the students should be able to:
1. Describe the working of thermal power station using single line diagram and state the
functions of the major equipment and auxiliaries of a TPS.
2. Explain hydro energy conversion process with block diagrams and identify the appropriate
site for it.
3. Explain the working of Nuclear power station.
4. Describe the working of Solar Power station and wind power plant.
5. Compare various economic aspects of different types of Tariffs.
6. Classify various substations and describe working of its equipments.
7. Compare various generating systems.

REFERENCES:
1. Renewable Energy Sources and Emerging Technologies : D.P Kothari, K.C.Singla, Rakesh
Ranjan- PHI Publications, ’Latest Edition’.
2.Electric Power Generation, B.R.Gupta, ’Latest Edition’.
3. Power Generation, Operation and Control, Wood and Wollenberg, John Wiley &
Sons,’Latest Edition’.
4. A Course in Electric Power System, Soni, Gupta, Bhatnagar, Dhanpat Rai & Sons, ’Latest
Edition’.
5. Power System Engineering, Nagrath & Kothari, Tata Mc-Graw Hill, New Delhi, ’Latest
Edition’.
6. Power Plant Engg: G.D. Rai, ’Latest Edition’.
7. Electric Power: S.L. Uppal (Khanna Publishing), ’Latest Edition’.