JC - Bose University Syllabus
JC - Bose University Syllabus
JC - Bose University Syllabus
for
in
COMPUTER ENGINEERING
(w.e.f Session 2019-2020)
FARIDABAD
2|Page
J. C. BOSE UNIVERSITY OF SCIENCE & TECHNOLOGY, YMCA
VISION
―J. C. Bose University of Science and Technology, YMCA, Faridabad aspires to be a nationally
and internationally acclaimed leader in technical and higher education in all spheres which
transforms the life of students through integration of teaching, research and character building.
MISSION
3|Page
DEPARTMENT OF COMPUTER ENGINEERING
VISION
The department aims to make a place at both national and international level by producing high
quality ethically rich computer engineers conversant with the state-of-the-art technology with the
ability to adapt the upcoming technologies to cater to the ever changing industrial demands and
societal needs. It endeavours to establish itself as a centre of excellence by contributing to
research areas having IT impact on the people‘s life and nation‘s growth.
MISSION
To provide the future leaders in the area of computer engineering and information
technology through the development of human intellectual potential to its fullest extent.
To enable the students to acquire globally competence through problem solving skills and
exposure to latest developments in IT related technologies.
To educate the students about their professional and ethical responsibilities.
To ensure continuous interaction with the industry and academia through collaborative
research projects.
4|Page
ABOUT THE PROGRAM
The Bachelor of Technology (B.Tech) program in Computer Engineering has a strong flavor on
design and hands-on experience. The program includes a deeper study of a number of
engineering subjects to which students are introduced at the core curriculum level, theoretical
and programming solutions of real world problems and design of systems relevant to the
software organizations. The areas introduced by the department include software engineering,
software testing, web crawlers, information retrieval, computer networks and data structures etc.
Besides the theoretical and laboratory based curriculum, students complete an advanced
programming project in the final year of the program including one full semester in an industry
This degree provides a solid foundation in core Computer Engineering disciplines, critical
thinking and problem-solving skills. Through the academic program, students also develop
excellent written and oral communication skills, learn to work as a team and project
management.
NOTE:
1. The scheme will be applicable from Academic Session 2019-20 onwards.
2. The syllabus for the theory subjects is provided along with the scheme. For Practicals,
syllabus is not defined and depends upon the syllabus content of the related subject. The
list of practicals may vary depending on the technological evolution in the concerned
area.
3. From session 2019-20 onwards, for B.Tech program, a student has to earn at least 12
credits during the duration of Degree subject to passing of at least one MOOC course of
12 week duration (carrying minimum 3 credits) per year through SWAYAM Platform.
The Credit Transfer/Mobility Policy for Online Courses approved in 17th Academic
Council Dated 11.06.2019 may be referred for the same.
5|Page
6|Page
B.TECH PROGRAM
COMPUTER ENGINEERING
PROGRAM OUTCOMES
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex
engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
7|Page
responsibilities relevant to the professional engineering practice.
PO9 Individual and team work: Function effectively as an individual, and as a member
or leader in diverse teams, and in multidisciplinary settings.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
PSO2 Ability to test and analyze the quality of various subsystems and to integrate them in
order to evolve a larger computing system.
8|Page
STRUCTURE OF UNDERGRADUATE ENGINEERING PROGRAM
6. VI 33 900 27
7. VII 22 700 20
8. VIII One Semester 500 10
9. MOOCs - - 12*
Total 212 5950 180*
9|Page
*Student has to earn at least 12 credits during the duration of Degree subject to passing
of at least one MOOC course of 12 week duration (carrying minimum 3 credits) per year.
10 | P a g e
CREDIT DISTRIBUTION IN THE FIRST YEAR OF UNDERGRADUATE
ENGINEERING PROGRAM
Subject Lecture Tutorial Laboratory/ Total
(L) (T) Practical(P) credits(C)
Chemistry 3 1 3 5.5
Physics 3 1 3 5.5
Mathematics-1 3 1 0 4
Mathematics -2 3 1 0 4
Programming for Problem solving 3 0 4 5
English 2 0 2 3
Engineering Graphics & Design 0 0 4 2
Workshop 0 0 8 4
Basic Electrical Engg. 3 1 2 5
MOOC - - - 3
11 | P a g e
MANDATORY INDUCTION PROGRAM (3-WEEKS DURATION)
When new students enter an institution, they come with diverse thoughts, backgrounds and
preparations. It is important to help them adjust to the new environment and inculcate in them
the ethos of the institution with a sense of larger purpose. A 3-week long induction program for
the UG students entering the institution, right at the start, has to be planned. Normal classes will
start only after the induction program is over. Its purpose is to make the students feel
comfortable in their new environment, open them up, set a healthy daily routine, create bonding
in the batch as well as between faculty and students, develop awareness, sensitivity and
understanding of the self, people around them, society at large, and nature.
Tentative activities which can be planned in this Induction Programme are as follows:
Physical Activity
Creative Arts
Universal Human Values
Literary
Proficiency Modules
Lectures by Eminent People
Visits to Local Area
Familiarization to Dept./Branch & Innovations
12 | P a g e
HUMANITIES & SOCIAL SCIENCES INCLUDING MANAGEMENT
S.No. Code No. Course Title Hours Per week Total Semester
Credits
L T P
1 HSMC-101 English 2 0 2 3 2
2 HSMC-01 Humanities –I (Effective 3 0 0 3 3
Technical
Communication)
3 HSMC-02 Economics for Engineers 3 0 0 3 4
4 HSMC-03/ Management-I 3 0 0 3 7
HSMC-04 (Organizational
Behaviour/ Finance &
Accounting)
Total Credits 12
13 | P a g e
ENGINEERING SCIENCE COURSE (ESC)
S.No. Code No. Course Title Hours Per Week Total Semester
Credits
L T P
1 ESC101 Basic Electrical 3 1 2 5 1/2
Engineering
2 ESC102 Engineering Graphics 0 0 4 2 1/2
& Design
3 ESC103 Programming for 3 0 2 5 1/2
Problem Solving
4 ESC104 Workshop–I 0 0 4 2 1
5 ESC106 Workshop –II 0 0 4 2 2
6 ESC-301, Analog Electronic 3 0 4 5 3
ESC-303 Circuits
7 ESC-302, Digital Electronics 3 0 4 5 3
ESC-304
8 ESC-501 Signals & Systems 3 0 0 3 5
Total Credits 29
14 | P a g e
9 PCC-CS-503, Object Oriented 3 0 4 5 5
PCC-CS-505 Programming
10 PCC-CS-601, Intelligent Systems 3 0 4 5 6
PCC-CS-603
11 PCC-CS-602, Computer Networks 3 0 4 5 6
PCC-CS-604
Total Credits 49
15 | P a g e
J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA, FARIDABAD
B.Tech. (COMPUTER ENGINEERING)
Scheme of Studies/Examination
Semester- 3
S. Category Course Course Title Hours per Credi Marks Marks for Total
No Code week ts F End Term
. or Examinatio
Session n
L T P al
1 ESC ESC- Analog Electronic 3 0 0 3 25 75 100
301 Circuits
2 PCC PCC- Data Structures& 3 0 0 3 25 75 100
CS-301 Algorithms
3 ESC ESC- Digital Electronics 3 0 0 3 25 75 100
302
4 BSC BSC- Mathematics- III 3 0 0 3 25 75 100
301 (Calculus and
Ordinary
Differential
Equations)
5 HSMC- Effective 3 0 0 3 25 75 100
HSMC 01 Technical
Communication
6 Capstone PROJ- Project-I 0 0 4 2 25 75 100
Project CS-301
7 PCC PCC- IT Workshop 0 0 4 2 15 35 50
CS-302
Note:
(a) Theory exams will be of 03 hours duration and Practical exams will be of 02 hours duration
(b) Additional 3 credits per year to be earned through MOOCs
16 | P a g e
J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA, FARIDABAD
B.Tech. (COMPUTER ENGINEERING)
Scheme of Studies/Examination
Semester- 4
S Category Course Course Title Hours per Credi Marks Marks for Total
. Code week ts for End Term
N Session Examinatio
o L T P al n
.
1 PCC PCC-CS- Discrete 3 1 0 4 25 75 100
401 Mathematics
2 PCC PCC-CS- Computer 3 0 0 3 25 75 100
402 Organization &
Architecture
3 PCC PCC-CS- Operating System 3 0 0 3 25 75 100
403
4 PCC PCC-CS- Design & Analysis 3 0 0 3 25 75 100
404 of Algorithms
Note:
(a) Theory exams will be of 03 hours duration and Practical exams will be of 02 hours duration
(b) Additional 3 credits per year to be earned through MOOCs
17 | P a g e
J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA, FARIDABAD
B.Tech. (COMPUTER ENGINEERING)
Scheme of Studies/Examination
Semester- 5
S. Category Course Course Title Hours per Credi Marks Marks for Total
N Code week ts for End Term
o. Session Examinatio
L T P al n
1 ESC ESC-501 Signals & Systems 3 0 0 3 25 75 100
2 PCC PCC-CS- Database 3 0 0 3 25 75 100
501 Management
Systems
3 PCC PCC-CS- Formal 3 0 0 3 25 75 100
502 Languages,
Automata and
Compiler Design
4 PCC PCC-CS- Object Oriented 3 0 0 3 25 75 100
503 Programming
18 | P a g e
J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA, FARIDABAD
B.Tech. (COMPUTER ENGINEERING)
Scheme of Studies/Examination
Semester- 6
S. Categor Course Course Title Hours per Credi Marks Marks for Total
No y Code week ts for End Term
. Session Examinatio
L T P al n
1 PCC PCC-CS- Intelligent Systems 3 0 0 3 25 75 100
601
2 PCC PCC-CS- Computer 3 0 0 3 25 75 100
602 Networks
3 PEC PEC-CS- Elective-II 3 0 0 3 25 75 100
<Stream
>-601
4 PEC PEC-CS- Elective-III 3 0 0 3 25 75 100
<Stream
>-602
5 OEC OEC- Open Elective-I 3 0 0 3 25 75 100
CS-601 (Humanities)
6 OEC OEC- Open Elective-II 3 0 0 3 25 75 100
CS-602
7 AC AC02 Message of 2 1 0 3 25 75 100
Bhagwat Gita
8 Capstone PROJ- Project-IV 0 0 4 2 25 75 100
Project CS-601
9 PCC PCC-CS- Intelligent Systems 0 0 4 2 15 35 50
603 Lab
10 PCC PCC-CS- Computer 0 0 4 2 15 35 50
604 Networking Lab
Total 20 1 12 27 230 670 900
Note:
(a) Theory exams will be of 03 hours duration and Practical exams will be of 02 hours duration
(b) Additional 3 credits per year to be earned through MOOCs
19 | P a g e
J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA, FARIDABAD
B.Tech. (COMPUTER ENGINEERING)
Scheme of Studies/Examination
Semester- 7 (May be carried out in 8th Semester*)
S. Categor Course Course Title Hours per Credi Marks Marks for Total
No y Code week ts for End Term
. Session Examinatio
L T P al n
1 PEC PEC-CS- Elective-IV 3 0 0 3 25 75 100
<Stream
>-701
2 PEC PEC-CS- Elective-V 3 0 0 3 25 75 100
<Stream
>-702
3 PEC PEC-CS- Elective-VI 3 0 0 3 25 75 100
<Stream
>-703
4 OEC OEC- Open Elective-III 3 0 0 3 25 75 100
CS-701
5 OEC OEC- Open Elective-IV 3 0 0 3 25 75 100
CS-702
6 HSMC HSMC- Organizational 3 0 0 3 25 75 100
03/HSM Behaviour /
C-04
Finance &
Accounting
* The course contents of 7th Semester may be pursued by the students of UTDs/Departments of Affiliated
colleges in 8th semester. In the case of pursuance of internship in 7th semester, the course contents of 7th
semester will be taught in 8th semester and vice-versa. The approval of such interchangeability should be
requested from the authority before the commencement of 7th semester.
Note: Exams duration will be as under
(a) Theory exams will be of 03 hours duration and Practical exams will be of 02 hours duration
(b) Additional 3 credits per year to be earned through MOOCs
20 | P a g e
J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA, FARIDABAD
B.Tech. (COMPUTER ENGINEERING)
Scheme of Studies/Examination
Semester- 8 (May be carried out in 7th semester*)
* The Industry Internship may be pursued by UTDs/Departments of Affiliated colleges in 7th or 8th
semester. In the case of pursuance of internship in 7th semester, the course contents of 7th semester will be
taught in 8th semester and vice-versa. The approval of such interchangeability should be requested from
the authority before the commencement of 7th semester.
21 | P a g e
Professional Elective Courses
Electives Stream-1 Stream-2 Stream-3 Stream-4
Theory and Systems Data Science Applications
Algorithms Code: PEC-CS- and Machine Code: PEC-CS-
Code: PEC-CS- S<number> Intelligence A<number>
T<number> Code: PEC-CS-
D<number>
Elective-I Introduction to Advanced Basics of Machine Image Processing
Graph Theory Computer Learning (PEC-CS-A-501)
(PEC-CS-T-501) Architecture (PEC-CS-D-501)
(PEC-CS-S-501)
Elective-II Advanced Software Data Mining Digital Signal
Algorithms Engineering (PEC-CS-D-601) Processing
(PEC-CS-T-601) (PEC-CS-S-601) (ELPE613)
Elective-III Parallel and Distributed Soft Computing Computer Graphics
Distributed Systems (PEC-CS-D-602) (PEC-CS-A-602)
Algorithms (PEC-CS-S-602(I))
(PEC-CS-T-602) Basics of
Embedded System
(PEC-CS-S-
602(II))
Elective-IV Queuing Theory Advanced Speech and Natural Theory of
and Modeling Operating Systems Language Processing Optimization
(PEC-CS-T-701) (PEC-CS-S-701(I)) (PEC-CS-D-701) Techniques
Real Time Systems (PEC-CS-A-701)
(PEC-CS-S-
701(II))
Elective-V Game Theory Ad-Hoc and Sensor Data Analytics Web and Internet
(PEC-CS-T-702) Networks (PEC-CS-D-702(I)) Technology
(PEC-CS-S-702) Information (PEC-CS-A-702)
Retrieval
(PEC-CS-D-702(II))
Elective-VI Information Theory Internet of Things Neural Networks and Cryptography and
and Coding (PEC-CS-S-703) Deep Learning Network Security
(PEC-CS-T-703) (PEC-CS-D-703) (PEC-CS-A-703)
22 | P a g e
OPEN ELECTIVE COURSES*
Open Elective-I Open Elective-II Open Elective-III Open Elective-IV
Soft Skills and Human Resource Financial Economic Policies in
Interpersonal Management Management India
Communication (OEC-CS-602(I)) (OEC-CS-701(I)) (OEC-CS-702(I))
(OEC-CS-601(I))
Cyber Law and Ethics ICT for Development E-commerce and Basics of Cloud
(OEC-CS-601(II)) (OEC-CS-602(II)) Entrepreneurship Computing
(OEC-CS-701(II)) (PEC-IT-I-703)
* The list is non-exhaustive and may be appended with new courses time to time with the
approval of Board of Studies.
23 | P a g e
VALUE ADDED COURSE [VAC]*
L T P
1. HSMC (H-102) Universal Human Values2: 0 0 2 V
Understanding Harmony
S. Code Course Title Hours Semester Credits Marks Marks for Total
No. Per for End Term
Week Sessional Examination
L T P
1. AC02 Message of 2 1 0 VI 3 25 75 100
Bhagwat Gita
Total 3 25 75 100
*As approved in 20th Meeting of Academic Council, the above subjects are to be included
in the curriculum
24 | P a g e
ADDITIONAL REQUIREMENTS FOR B.TECH (Hons.)
A student will be eligible to get Under-Graduate (B.Tech) with Honours if he/she completes
additional credits through MOOC‘s. (AICTE Model Curriculum, Chapter1(B)). Following
pattern will be followed for earning additional credits for the award of Honours degree:
Note: From session 2019-20 onwards, for B.Tech program, a student has to earn at least 12
credits during the duration of the Degree subject to the passing of at least one MOOC course
(carrying minimum 3 credits) per year. The MOOC chosen by the student should not be on
offer/scheme of the degree.
The Credit Transfer/Mobility Policy for Online Courses approved in 17th Academic Council Dated
11.06.2019 may be referred for the same.
25 | P a g e
DETAILED 4-YEAR CURRICULUM CONTENTS
26 | P a g e
CODE: ESC-301
CREDITS: 3
27 | P a g e
Course Outcomes:
REFERENCES
28 | P a g e
CODE: PCC-CS-301
CREDITS: 3
Course Objectives:
1. To impart the basic concepts of data structures and algorithms.
2. To understand concepts about searching and sorting techniques
3. To understand basic concepts about stacks, queues, lists, trees and graphs.
4. To enable them to write algorithms for solving problems with the help of fundamental
data structures
MODULE 1: INTRODUCTION
Basic Terminologies: Elementary Data Organizations, Data Structure Operations: insertion,
deletion, traversal etc.; Analysis of an Algorithm, Asymptotic Notations, Time-Space trade off.
Searching: Linear Search and Binary Search Techniques and their complexity analysis.
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary Tree,
Binary Search Tree, AVL Tree; Tree operations on each of the trees and their algorithms with
29 | P a g e
complexity analysis. Applications of Binary Trees, B Tree, B+ Tree: definitions, algorithms and
analysis.
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, linked list and Tree, 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.
REFERENCES
1. A. M. Tenenbaum, Langsam, Moshe J. Augentem , “Data Structures using C,” PHI Pub.
2. A.V. Aho, J.E. Hopcroft and T.D. Ullman, “Data Structures and Algorithms” Original
edition, Addison-Wesley, 1999, Low Priced Edition.
3. Ellis Horowitz & Sartaj Sahni, “Fundamentals of Data structures” Pub, 1983,AW
30 | P a g e
CODE: ESC-302
CREDITS: 3
Course Objectives:
31 | P a g e
A/D converter using voltage to frequency and voltage to time conversion, specifications of A/D
converters, example of A/D converter ICs
MODULE 5: SEMICONDUCTOR MEMORIES AND PROGRAMMABLE LOGIC
DEVICES
Memory organization and operation, expanding memory size, classification and characteristics of
memories, sequential memory, read only memory (ROM), read and write memory(RAM),
content addressable memory (CAM), charge de coupled device memory (CCD), commonly used
memory chips, ROM as a PLD, Programmable logic array, Programmable array logic, complex
Programmable logic devices (CPLDS), Field Programmable Gate Array (FPGA).
Course Outcomes:
REFERENCES:
32 | P a g e
CODE: BSC-301
NO OF CREDITS: 3
Course Objectives:
Convergence of sequence and series, tests for convergence, power series, Taylor's series. Series
or exponential, trigonometric and logarithmic functions.
Limit, continuity and partial derivatives, directional derivatives, total derivative; Tangent plane
and normal line; Maxima, minima and saddle points; Method of Lagrange multipliers; Gradient,
curl and divergence.
Multiple Integration: double and triple integrals (Cartesian and polar), change of order of
integration in double integrals, Change of variables (Cartesian to polar). Theorems of Green,
Gauss and Stokes, orthogonal curvilinear coordinates, Simple applications involving cubes,
sphere and rectangular parallelepipeds.
Exact, linear and Bernoulli‘s equations, Euler‘s equations, Equations not of first degree:
equations solvable for p, equations solvable for y, equations solvable for x and Clairaut‘s type.
Second order linear differential equations with variable coefficients, method of variation of
parameters, Cauchy-Euler equation; Power series solutions; Legendre polynomials, Bessel
functions of the first kind and their properties.
33 | P a g e
Course Outcomes:
REFERENCES
1. G.B. Thomas and R.L. Finney, “Calculus and Analytic geometry” , 9th Edition, Pearson,
Reprint, 2002.
2. 2. Veerarajan T., “Engineering Mathematics for first year”, Tata McGraw-Hill, New Delhi,
2008.
3. Ramana B.V., “Higher Engineering Mathematics”, Tata McGraw Hill New Delhi, 11th
Reprint, 2010.
4. N.P. Bali and Manish Goyal, “A text book of Engineering Mathematics”, Laxmi
Publications, Reprint, 2010.
5. B.S. Grewal, “Higher Engineering Mathematics”, Khanna Publishers, 35th Edition, 2000.
6. Erwin Kreyszig, “Advanced Engineering Mathematics”, 9th Edition, John Wiley & Sons,
2006.
7. W. E. Boyce and R. C. DiPrima, “Elementary Differential Equations and Boundary Value
Problems, 9th Edition, Wiley India, 2009.
8. S. L. Ross, “Differential Equations”, 3rd Ed., Wiley India, 1984.
9. E. A. Coddington, “An Introduction to Ordinary Differential Equations”, Prentice Hall
India, 1995.
10. E. L. Ince, “Ordinary Differential Equations”, Dover Publications, 1958.
11. G.F. Simmons and S.G. Krantz, “Differential Equations”, Tata McGraw Hill, 2007.
34 | P a g e
CODE: HSMC-01
CREDITS: 3
Course Objectives:
35 | P a g e
MODULE 5: ETHICS
Business ethics, Etiquettes in social and office settings, Email etiquettes, Telephone Etiquettes,
Engineering ethics, Managing time, Role and responsibility of engineer, Work culture in jobs,
Personal memory, Rapid reading, Taking notes, Complex problem solving, Creativity.
Course Outcomes:
REFERENCES:
1. David F. Beer and David McMurrey, Guide to writing as an Engineer, John Willey.
New York, 2004
2. Diane Hacker, Pocket Style Manual, Bedford Publication, New York, 2003. (ISBN
0312406843)
3. Shiv Khera, You Can Win, Macmillan Books, New York, 2003.
4. Raman Sharma, Technical Communications, Oxford Publication, London, 2004.
5. Dale Jungk, Applied Writing for Technicians, McGraw Hill, New York, 2004.
(ISBN: 07828357-4)
6. Sharma, R. and Mohan, K. Business Correspondence and Report Writing, TMH
New Delhi 2002.
7. Xebec, Presentation Book, TMH New Delhi, 2000. (ISBN 0402213)
36 | P a g e
CODE: PCC-CS-302
CREDITS: 2
Course Objectives:
The course is intended to assist undergraduates in learning the basics of programming in general
and programming MATLAB in particular. Basics of programming in MATLAB will be covered,
with the goal of having students become comfortable enough to continue learning MATLAB and
other programming languages on their own.
MODULE 1: INTRODUCTION
Data types and variables: Introduction to MATLAB, Data Types, Inter-conversion of Data
types, MATLAB Variables, Keywords and Constant, Session Command. MATLAB Operators
and Operations: Operators (Arithmetic, Relational, Logical, Bitwise), Set Operations, Operator
Precedence, Mathematical Functions.
MODULE 2: PROGRAMMING IN MATLAB
Script and Function: Decision Making, Loops, branches, Functions, Working on Script File
(Creating, Saving and Executing), MATLAB I/O, Formatted I/O Method,.
MODULE 3: ARRAYS AND GRAPHICS
Matrices and Arrays: Introduction to Matrices, Operations on Arrays/Matrices, Manipulations of
Arrays/Matrices, Expansion of Matrix Size, Reduction of Matrices/Arrays order,
Graphics: Introduction to plot, Basic 2-D Plots( Style options, Labels, Axis control, etc.),
specialized 2-D Plots, drawing multiple plots. Using MATLAB for fractals and chaos and
Conway game of life
MODULE 4: FILE HANDLING AND DEBUGGING
File Handling: Introduction to file handling, working on files, accessing of Text File, Saving/
Loading MATLAB Variables, reading data without opening file, reading and writing Excel.
37 | P a g e
Debugging: Introduction to debugging, Break points, debugger, stepping, watching variable
values, debugging commands.
Course Outcomes:
At the end of the course, students will be able to
1. Use MATLAB for programming purposes
2. Learn and explore MATLAB further on their own
3. Use this learning experience to learn other programming languages.
REFERENCES:
1. Delores M. Etter, David C. Kuncicky, Holly Moore, “Introduction to MATLAB 7.0”,
Pearson, 2013.
2. Rudra Pratap, “Getting Started with MATLAB”, OXFORD University Press, 2010.
3. Agam Kumar Tyagi, “MATLAB and Simulink for Engineers”, University Press,
2012.
WEB REFERENCES
https://ocw.mit.edu/courses/mathematics/18-s997-introduction-to-matlab- programming-
fall-2011/syllabus/
38 | P a g e
CODE: PCC-CS-401
NO OF CREDITS: 4
Throughout the course, students will be expected to demonstrate their understanding of Discrete
Mathematics by being able to do each of the following:
MODULE-2:
Basic counting techniques-inclusion and exclusion, pigeon-hole principle, permutation and
combination.
MODULE-3:
Propositional Logic: Syntax, Semantics, Validity and Satisfiability, Basic Connectives and
Truth Tables, Logical Equivalence: The Laws of Logic, Logical Implication, Rules of Inference,
The use of Quantifiers. Proof Techniques: Some Terminology, Proof Methods and Strategies,
39 | P a g e
Forward Proof, Proof by Contradiction, Proof by Contraposition, Proof of Necessity and
Sufficiency.
MODULE-4:
Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation, Semi
Groups, Monoids, Groups, Congruence Relation and Quotient Structures, Free and Cyclic
Monoids and Groups, Permutation Groups, Substructures, Normal Subgroups, Algebraic
Structures with two Binary Operation, Rings, Integral Domain and Fields. Boolean Algebra and
Boolean Ring, Identities of Boolean Algebra, Duality, Representation of Boolean Function,
Disjunctive and Conjunctive Normal Form
MODULE-5:
Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub Graph,
Isomorphism, Eulerian and Hamiltonian Walks, Graph Colouring, Colouring maps and Planar
Graphs, Colouring Vertices, Colouring Edges, List Colouring, Perfect Graph, definition
properties and Example, rooted trees, trees and sorting, weighted trees and prefix codes, Bi-
connected component and Articulation Points, Shortest distances.
Course Outcomes:
1. For a given logic sentence express it in terms of predicates, quantifiers, and logical
connectives
2. For a given a problem, derive the solution using deductive logic and prove the solution
based on logical inference
3. For a given a mathematical problem, classify its algebraic structure
4. Evaluate Boolean functions and simplify expressions using the properties of Boolean
algebra
5. Develop the given problem as graph networks and solve with techniques of graph theory.
REFERENCES:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
2. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth
Publishing Co. Inc.
3. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer
Oriented Approach, 3rd Edition by, Tata McGraw – Hill.
4. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and It‟s
Application to Computer Science”, TMG Edition, TataMcgraw-Hill
5. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press.
Schaum‟s Outlines Series, Seymour Lipschutz, Marc Lipson, Discrete Mathematics,
Tata McGraw - Hill
40 | P a g e
CODE: PCC-CS-402
MODULE-1:
Functional blocks of a computer: CPU, memory, input-output subsystems, control unit.
Instruction set architecture of a CPU – registers, instruction execution cycle, RTL interpretation
of instructions, addressing modes, instruction set. Case study – instruction sets of some common
CPUs.
Data representation: signed number representation, fixed and floating point representations,
character representation. Computer arithmetic – integer addition and subtraction, ripple carry
adder, carry look-ahead adder, etc. multiplication – shift-and add, Booth multiplier, carry save
multiplier, etc. Division restoring and non-restoring techniques, floating point arithmetic.
MODULE-2:
Introduction to x86 architecture.
CPU control unit design: hardwired and micro-programmed design approaches, Case study –
design of a simple hypothetical CPU.
Memory system design: semiconductor memory technologies, memory organization.
Peripheral devices and their characteristics: Input-output subsystems, I/O device interface,
I/O transfers – program controlled, interrupt driven and DMA, privileged and non-privileged
instructions, software interrupts and exceptions. Programs and processes – role of interrupts in
process state transitions, I/O device interfaces – SCII, USB
MODULE-3:
Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards.
41 | P a g e
Parallel Processors: Introduction to parallel processors, Concurrent access to memory and cache
coherency.
MODULE-4:
Memory organization: Memory interleaving, concept of hierarchical memory organization, cache
memory, cache size Vs block size, mapping functions, replacement algorithms, write policies.
Course Outcomes:
After completion of this course, the students will be able to perform the following:
1. Draw the functional block diagram of 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 microprocessors using different data
representations.
3. Design the ALU, Control Unit and CPU of a computer system.
4. Design a memory module and analyze its operation by interfacing with a given CPU
organization and instruction
5. Given a CPU organization, assess its performance, and apply design techniques to
enhance performance using pipelining, parallelism and RISC methodology.
REFERENCES:
42 | P a g e
CODE: PCC-CS-403
SUBJECT NAME: OPERATING SYSTEM
NO OF CREDITS: 3
B.TECH 4th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Pre-requisites: Fundamentals of Computers, Computer Organization & Architecture
Course Objectives:
Course Contents:
43 | P a g e
MODULE-5: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) and Least Recently used (LRU).
MODULE-6:I/O Hardware: I/O devices, Device controllers, Direct memory access Principles of
I/O Software: Goals of Interrupt handlers, Device drivers, Device independent I/O software,
Secondary-Storage Structure: Disk structure, Disk scheduling algorithms
File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocation methods (contiguous, linked, indexed), Free-space
management (bit vector, linked list, grouping), directory implementation (linear list, hash table).
Course Outcomes:
After the completion of the course, the students will be able to:
1. Learn the basic concepts of operating system, its various types and architecture
2. Learn and implement process management issues including process life cycle,
scheduling, synchronization and deadlocks
3. Learn and implement memory management issues including memory partitioning,
memory allocation and virtual memory concept
4. Learn and implement files systems and I/O systems including file management and disk
management
Reference Books:
1. Abraham Silberschatz, Peter Galvin, Greg Gagne, ―Operating System Concepts
Essentials‖, 9th Edition, Wiley Asia Student Edition.
2. Naresh Chauhan, "Principles of Operating Systems,", Oxford University Press India,
2014.
3. William Stallings, ―Operating Systems: Internals and Design Principles‖, 5th Edition,
Prentice Hall of India
44 | P a g e
CODE: PCC-CS-404
NO OF CREDITS: 3
Course Objectives:
1. Analyze the asymptotic performance of algorithms.
2. Write rigorous correctness proofs for algorithms.
3. Demonstrate a familiarity with major algorithms and data structures.
4. Apply important algorithmic design paradigms and methods of analysis.
5. Synthesize efficient algorithms in common engineering design situations.
MODULE-1: INTRODUCTION
Characteristics of algorithm, Analysis of algorithm: Asymptotic analysis of complexity bounds –
best, average and worst-case behavior; Performance measurements of Algorithm, Time and
space trade-offs, Analysis of recursive algorithms through recurrence relations: Substitution
method, Recursion tree method and Masters‘ theorem.
MODULE-2: FUNDAMENTAL ALGORITHMIC STRATEGIES
Brute-Force, Greedy, Dynamic Programming, Branch and-Bound and backtracking
methodologies for the design of algorithms; Illustrations of these techniques for Problem-
Solving, Bin Packing, Knapsack, Job sequencing with deadline, Optimal Binary Search tree, N-
Queen problem, Hamiltonian Cycle, TSP, Heuristics – characteristics and their application
domains.
MODULE-3:GRAPH AND TREE TRAVERSAL ALGORITHMS
Depth First Search (DFS) and Breadth First Search (BFS); Shortest path algorithms, Transitive
closure, Minimum Spanning Tree, Topological sorting, Network Flow Algorithm.
MODULE-4:TRACTABLE AND INTRACTABLE PROBLEMS
Computability of Algorithms, Computability classes – P, NP, NP-complete and NP-hard, Cook‘s
theorem, Standard NP-complete problems and Reduction techniques.
45 | P a g e
MODULE-5:ADVANCED TOPICS
Approximation algorithms, Randomized algorithms, Class of problems beyond NP – P SPACE
Course Outcomes:
1. For a given algorithms analyze worst-case running times of algorithms based on
asymptotic analysis and justify the correctness of algorithms.
2. Describe the greedy paradigm and explain when an algorithmic design situation calls for
it. For a given problem develop the greedy algorithms.
3. Describe the divide-and-conquer paradigm and explain when an algorithmic design
situation calls for it. Synthesize divide-and-conquer algorithms. Derive and solve
recurrence relation.
4. Describe the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it. For a given problems of dynamic-programming and develop the
dynamic programming algorithms, and analyze it to determine its computational
complexity.
5. For a given model engineering problem model it using graph and write the corresponding
algorithm to solve the problems.
6. Explain the ways to analyze randomized algorithms (expected running time, probability
of error).
7. Explain what an approximation algorithm is. Compute the approximation factor of an
approximation algorithm (PTAS and FPTAS).
REFERENCES
46 | P a g e
CODE: HSMC-02
NO OF CREDITS: 3
Course objectives:
MODULE-1:
Introduction to the subject: Micro and Macro Economics, Relationship between Science,
Engineering, Technology and Economic Development. Production Possibility Curve, Nature of
Economic Laws.
MODULE-2:
Time Value of Money: concepts and application. Capital budgeting; Traditional and modern
methods, Payback period method, IRR, ARR, NPV, PI (with the help of case studies)
MODULE-3:
Meaning of Demand. Law of Demand, Elasticity of Demand; meaning, factors effecting it and its
practical application and importance. Demand forecasting (a brief explanation)
MODULE-4:
Meaning of Production and factors of production, Law of variable proportions and returns to
scale. Internal and external economies and diseconomies of scale. Concepts of cost of
production, different types of costs; accounting cost, sunk cost, marginal cost, Opportunity cost.
Break even analysis, Make or Buy decision (case study). Relevance of Depreciation towards
industry.
MODULE-5:
Meaning of market, types of market, perfect competition, Monopoly, Monopolistic, Oligopoly.
(main features). Supply and law of supply, Role of demand and supply in price determination.
MODULE-6:
Indian Economy, nature and characteristics. Basic concepts; fiscal and monetary policy, LPG,
Inflation, Sensex, GATT, WTO and IMF. Difference between Central bank and Commercial
banks
47 | P a g e
REFERENCES:
1. Jain T.R., Economics for Engineers, VK Publication
2. Chopra P. N., Principle of Economics, Kalyani Publishers
3. Dewett K. K., Modern economic theory, S. Chand
4. H. L. Ahuja., Modern economic theory, S. Chand
5. DuttRudar&Sundhram K. P. M., Indian Economy
6. Mishra S. K., Modern Micro Economics, Pragati Publications
7. Pandey I.M., Financial Management; Vikas Publishing House
8. Gupta Shashi K., Management Accounting, Kalyani Publication
48 | P a g e
CODE: MC-03
NO OF CREDITS: 0
B.TECH4THSEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
2 0 0 TOTAL : 100
Pre-requisites: None
Course Objectives:
The prime objective of the course is to provide the students a detailed knowledge on the threats
and challenges to the environment due to developmental activities. The students will be able to
identify the natural resources and suitable methods for their conservation and sustainable
development. The focus will be on awareness of the students about the importance of ecosystem
and biodiversity for maintaining ecological balance. The students will learn about various
attributes of pollution management and waste management practices. The course will also
describe the social issues both rural and urban environment and environmental legislation
49 | P a g e
Land resources: Land as a resource, land degradation, man induced landslides, soil
erosion and desertification.
Role of an individual in conservation of natural resources. Equitable use of resources for
sustainable lifestyles.
MODULE-3: Ecosystems
Causes, effects and control measures of: a)Air pollution b) Water pollution c)Soil
pollution d) Marine pollution e) Noise pollution f) Thermal pollution g) Nuclear hazards
Solid waste Management: Causes, effects and control measures of urban andindustrial
wastes. Role of an individual in prevention of pollution. Pollution case studies. Disaster
management: floods, earthquake, cyclone and landslides.
50 | P a g e
Environmental ethics: Issues and possible solutions. Climate change, global warming,
acid rain, ozone layer depletion, nuclear accidents and holocaust. Case studies. Wasteland
reclamation. Consumerism and waste products.
Environment Protection Act. Air (Prevention and Control of Pollution) Act. Water
(Prevention and Control of Pollution) Act
Wildlife Protection Act. Forest Conservation Act. Issues involved in enforcement of
environmental legislation Public awareness.
Course Outcomes:
After the completion of the course, the students will be able to:
1. Understand environmental legislation and policies of national and international regime.
2. No regulations applicable to industries and other organizations which significant
environmental aspects.
3. Get knowledge of the legal system operating in India and will be in a position to prepare
compliance report for getting environmental clearance.
4. Prepare the environmental management system for an organization.
RERERENCES
1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008
PHL Learning Private Ltd. New Delhi.
2. Environmental Engineering and science by Gilbert M. Masters and Wendell P. Ela
2008 PHI Learning Pvt Ltd.
3. Environmental Science by Daniel B. Botkin& Edwards A. Keller, Wiley INDIA
edition.
4. Fundamentals of Ecology by Odum, E.P., Barrick, M. and Barret, G.W. Thomson
Brooks/Cole Publisher, California, 2005.
51 | P a g e
CODE: ESC-501
NO OF CREDITS: 3
Course Objectives:
52 | P a g e
MODULE-4: SAMPLING AND RECONSTRUCTION
The Sampling Theorem and its implications. Spectra of sampled signals. Reconstruction: ideal
interpolator, zero-order hold, first-order hold. Aliasing and its effects. Relation between
continuous and discrete time systems. Introduction to the applications of signal and system
theory: modulation for communication, filtering, feedback control systems.
Course Outcomes:
REFERENCES:
53 | P a g e
CODE: PCC-CS-501
NO OF CREDITS: 3
Course Objectives:
MODULE-1:
Database system architecture: Data Abstraction, Data Independence, Data Definition
Language (DDL), Data Manipulation Language (DML).
Data models: Entity-relationship model, network model, relational and object oriented data
models, integrity constraints, data manipulation operations.
MODULE-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 axiom, Normal forms,
Dependency preservation, Lossless design.
Query processing and optimization: Evaluation of relational algebra expressions, Query
equivalence, Join strategies, Query optimization algorithms.
54 | P a g e
MODULE-3:
Storage strategies: Indices, B-trees, hashing.
MODULE-4:
Transaction processing: Concurrency control, ACID property, Serializability of scheduling,
Locking and timestamp based schedulers, Multi-version and optimistic Concurrency Control
schemes, Database recovery.
MODULE-5:
Database Security: Authentication, Authorization and access control, DAC, MAC and RBAC
models, Intrusion detection, SQL injection.
MODULE-6:
Advanced topics: Object oriented and object relational databases, Logical databases, Web
databases, Distributed databases, Data warehousing and data mining.
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 ER 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
REFERENCES:
1. “Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F.
Korth, S. Sudarshan, McGraw-Hill.
2. “Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D. Ullman,
Computer Science Press.
3. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S. Navathe,
Pearson Education
4. “Foundations of Databases”, Reprint by Serge Abiteboul, Richard Hull, Victor
Vianu, Addison-Wesley
55 | P a g e
CODE: PCC-CS-502
NO OF CREDITS: 3
Course Objectives
1. To introduce formal notation for strings, languages and machines & design finite
automata to accept strings of a language.
2. To design context free grammars for a given language and to convert them into normal
forms.
3. To introduce context sensitive grammar and unrestricted grammars.
4. To design lexical analyzer and parsers.
5. To generate optimized intermediate code and Machine code for a target machine.
Context-free grammars (CFG) and languages (CFL), Ambiguity in CFG, Chomsky and Greibach
normal forms, Nondeterministic and deterministic pushdown automata (PDA). Introduction to
Context-sensitive languages and linear bounded automata, Introduction to Turing machines.
Phases of compilation and overview, Lexical Analysis (scanner): scanner generator (lex, flex).
Syntax Analysis (Parser): ambiguity LL(1) grammars and top-down parsing, operator precedence
parser, bottom up parsing: LR(0), SLR(1), LR(1), and LALR(1).
Semantic Analysis: Attribute grammars, syntax directed definition, evaluation and flow of
attribute in a syntax tree.
56 | P a g e
MODULE-3: COMPILER DESIGN-SYNTHESIS
Machine code Generation and optimization: Instruction scheduling (for pipeline), loop
optimization (for cache memory) etc. Register allocation and target code generation.
Course Outcomes:
1. Understand the different types of grammars such as regular, Context free, and context
sensitive grammar.
2. Design finite state automata for Regular grammar and parser for CFG
3. Design schemes for semantic analysis.
4. Develop algorithms to generate and optimize intermediate and machine code.
REFERENCES
57 | P a g e
CODE:PCC-CS-503
NO OF CREDITS: 3
Course Objectives:
The course will introduce standard tools and techniques for software development, using object
oriented approach, use of a version control system, an automated build process, an appropriate
framework for automated unit and integration tests.
Introduction and classification. Creational Pattern – Abstract Factory Pattern, Factory Method,
Singleton, Structural Pattern – Bridge, Flyweight, Behavioural Pattern - The iterator pattern,
Observer pattern, Model-view-controller pattern
Simple Generics, Generics and Subtyping, Wildcards, Generic Methods, Set Interface, List
Interface, Queue Interface, Deque Interface, Map Interface, Object Ordering, SortedSet Interface,
SortedMap Interface
58 | P a g e
MODULE-5: GUIS. GRAPHICAL PROGRAMMING WITH SCALA AND SWING
Swing components, Laying out components in a container, Panels, Look & Feel, Event listener,
concurrency in swing.
Course Outcomes:
REFERENCES
59 | P a g e
CODE: BSC-01
NO OF CREDITS: 3
Course Objectives:
MODULE 1: INTRODUCTION
Bring out the fundamental differences between science and engineering by drawing a
comparison between eye and camera, Bird flying and aircraft. Mention the most exciting aspect
of biology as an independent scientific discipline. Why we need to study biology? Discuss how
biological observations of 18th Century that lead to major discoveries. Examples from Brownian
motion and the origin of thermodynamics by referring to the original observation of Robert
Brown and Julius Mayor. These examples will highlight the fundamental importance of
observations in any scientific inquiry.
MODULE 2: CLASSIFICATION
Purpose: To convey that classification per se is not what biology is all about. The underlying
criterion, such as morphological, biochemical or ecological be highlighted.
Hierarchy of life forms at phenomenological level. A common thread weaves this hierarchy
Classification. Discuss classification based on (a) cellularity- Unicellular or multicellular (b)
ultrastructure- prokaryotes or eucaryotes. (c) energy and Carbon utilisation -Autotrophs,
heterotrophs, lithotropes (d) Ammonia excretion – aminotelic, uricoteliec, ureotelic (e) Habitata-
acquatic or terrestrial (e) Molecular taxonomy- three major kingdoms of life. A given organism
can come under different category based on classification. Model organisms for the study of
biology come from different groups. E.coli, S.cerevisiae, D. Melanogaster, C. elegance, A.
Thaliana, M. Musculus.
60 | P a g e
MODULE 3: Genetics
Purpose: To convey that ―Genetics is to biology what Newton‘s laws are to Physical Sciences‖
Mendel‘s laws, Concept of segregation and independent assortment. Concept of allele. Gene
mapping, Gene interaction, Epistasis. Meiosis and Mitosis be taught as a part of genetics.
Emphasis to be give not to the mechanics of cell division nor the phases but how genetic material
passes from parent to offspring. Concepts of recessiveness and dominance. Concept of mapping
of phenotype to genes. Discuss about the single gene disorders in humans. Discuss the concept of
complementation using human genetics.
MODULE 4: BIOMOLECULES
Purpose: To convey that all forms of life has the same building blocks and yet the
manifestations are as diverse as one can imagine
Molecules of life. In this context discuss monomeric units and polymeric structures. Discuss
about sugars, starch and cellulose. Amino acids and proteins. Nucleotides and DNA/RNA. Two
carbon units and lipids.
MODULE 5: ENZYMES
Purpose: To convey that without catalysis life would not have existed on earth.
Enzymology: How to monitor enzyme catalysed reactions. How does an enzyme catalyse
reactions? Enzyme classification. Mechanism of enzyme action. Discuss at least two examples.
Enzyme kinetics and kinetic parameters. Why should we know these parameters to understand
biology? RNA catalysis.
MODULE 8: METABOLISM
Purpose: The fundamental principles of energy transactions are the same in physical and
biological world.
61 | P a g e
Thermodynamics as applied to biological systems. Exothermic and endothermic versus
endergonic and exergoinc reactions. Concept of Keq and its relation to standard free energy.
Spontaneity. ATP as an energy currency. This should include the breakdown of glucose to CO2 +
H2O (Glycolysis and Krebs cycle) and synthesis of glucose from CO2 and H2O (Photosynthesis).
Energy yielding and energy consuming reactions. Concept of Energy Charge.
MODULE 9: MICROBIOLOGY
Concept of single celled organisms. Concept of species and strains. Identification and
classification of microorganisms. Microscopy. Ecological aspects of single celled organisms.
Sterilization and media compositions. Growth kinetics.
Course Outcomes:
REFERENCES
1. “Biology: A global approach” Campbell, N. A.; Reece, J. B.; Urry, Lisa; Cain, M,
L.; Wasserman, S. A.; Minorsky, P. V.; Jackson, R. B. Pearson Education Ltd
2. “Outlines of Biochemistry” , Conn, E.E; Stumpf, P.K; Bruening, G; Doi, R.H.
John Wiley and Sons
3. “Principles of Biochemistry(V Edition)”, By Nelson, D. L.; and Cox, M. M.W.H.
Freeman and Company
4. “Molecular Genetics (Second edition)”, Stent, G. S.; and Calender, R. W.H. Freeman
and company, Distributed by Satish Kumar Jain for CBS Publisher
5. “Microbiology” , Prescott, L.M J.P. Harley and C.A. Klein 1995. 2nd edition Wm,
C.Brown Publishers
62 | P a g e
CODE: MC-01
NO OF CREDITS: 0
The Constitution of India is the supreme law of India. Parliament of India can not make any law
which violates the Fundamental Rights enumerated under the Part III of the Constitution. The
Parliament of India has been empowered to amend the Constitution under Article 368, however,
it cannot use this power to change the ―basic structure‖ of the constitution, which has been ruled
and explained by the Supreme Court of India in its historical judgments. The Constitution of
India reflects the idea of ―Constitutionalism‖ – a modern and progressive concept historically
developed by the thinkers of ―liberalism‖ – an ideology which has been recognized as one of the
most popular political ideology and result of historical struggles against arbitrary use of
sovereign power by state. The historic revolutions in France, England, America and particularly
European Renaissance and Reformation movement have resulted into progressive legal reforms
in the form of ―constitutionalism‖ in many countries. The Constitution of India was made by
borrowing models and principles from many countries including United Kingdom and America.
The Constitution of India is not only a legal document but it also reflects social, political and
economic perspectives of the Indian Society. It reflects India‘s legacy of ―diversity‖. It has been
said that Indian constitution reflects ideals of its freedom movement, however, few critics have
argued that it does not truly incorporate our own ancient legal heritage and cultural values. No
law can be ―static‖ and therefore the Constitution of India has also been amended more than one
hundred times. These amendments reflect political, social and economic developments since the
year 1950.
The Indian judiciary and particularly the Supreme Court of India has played an historic role as
the guardian of people. It has been protecting not only basic ideals of the Constitution but also
strengthened the same through progressive interpretations of the text of the Constitution. The
judicial activism of the Supreme Court of India and its historic contributions has been recognized
throughout the world and it gradually made it ―as one of the strongest court in the world‖.
63 | P a g e
COURSE CONTENT
REFERENCES:
64 | P a g e
CODE: PCC-CS-601
NO OF CREDITS: 3
Course Objectives:
The aim of the course is to introduce to the field of Artificial Intelligence (AI) with emphasis on
its use to solve real world problems for which solutions are difficult to express using the
traditional algorithmic approach. It explores the essential theory behind methodologies for
developing systems that demonstrate intelligent behaviour including dealing with uncertainty,
learning from experience and following problem solving strategies found in nature.
MODULE-1:
Biological foundations to intelligent systems I: Artificial neural networks, Backpropagation
networks, Radial basis function networks, and recurrent networks.
MODULE-2:
Biological foundations to intelligent systems II: Fuzzy logic, knowledge Representation and
inference mechanism, genetic algorithm, and fuzzy neural networks.
MODULE-3:
Search Methods Basic concepts of graph and tree search. Three simple search methods: breadth-
first search, depth-first search, iterative deepening search. Heuristic search methods: best-first
search, admissible evaluation functions, hill climbing search. Optimisation and search such as
stochastic annealing and genetic algorithm.
MODULE-4:
Knowledge representation and logical inference Issues in knowledge representation. Structured
representation, such as frames, and scripts, semantic networks and conceptual graphs. Formal
logic and logical inference, Knowledge-based systems structures, its basic components. Ideas of
Blackboard architectures.
65 | P a g e
MODULE-5:
Reasoning under uncertainty and Learning Techniques on uncertainty reasoning such as
Bayesian reasoning, Certainty factors and Dempster-Shafer Theory of Evidential reasoning, A
study of different learning and evolutionary algorithms, such as statistical learning and induction
learning.
Course Outcomes:
REFERENCES:
1. Luger G.F. and Stubblefield W.A. (2008). Artificial Intelligence: Structures and
strategies for Complex Problem Solving. Addison Wesley, 6th edition.
2. Russell S. and Norvig P. (2009). Artificial Intelligence: A Modern Approach.
Prentice-Hall, 3rd edition.
66 | P a g e
CODE:PCC-CS-602
NO OF CREDITS: 3
Course Objectives:
1. To develop an understanding of modern network architectures from a design and
performance perspective.
2. To introduce the student to the major concepts involved in wide-area networks (WANs),
local area networks (LANs) and Wireless LANs (WLANs).
3. To provide an opportunity to do network programming
4. To provide a WLAN measurement ideas.
Representation of data and its flow Networks , Various Connection Topology, Protocols and
Standards, OSI model, Transmission Media, LAN: Wired LAN, Wireless LANs, Connecting
LAN and Virtual LAN, Techniques for Bandwidth utilization: Multiplexing - Frequency
division, Time division and Wave division, Concepts on spread spectrum.
Error Detection and Error Correction - Fundamentals, Block coding, Hamming Distance, CRC;
Flow Control and Error control protocols - Stop and Wait, Go back – N ARQ, Selective Repeat
ARQ, Sliding Window, Piggybacking, Random Access, Multiple access protocols -Pure
ALOHA, Slotted ALOHA, CSMA/CD,CDMA/CA
Switching, Logical addressing – IPV4, IPV6; Address mapping – ARP, RARP, BOOTP and
DHCP–Delivery, Forwarding and Unicast Routing protocols.
67 | P a g e
Process to Process Communication, User Datagram Protocol (UDP), Transmission Control
Protocol (TCP), SCTP Congestion Control; Quality of Service, QoS improving techniques:
Leaky Bucket and Token Bucket algorithm.
Domain Name Space (DNS), DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW,
HTTP, SNMP, Bluetooth, Firewalls, Basic concepts of Cryptography
Course Outcomes
REFERENCES:
68 | P a g e
CODE:HSMC-03
NO OF CREDITS: 3
The objective of this course is to expose the students to basic concepts of management and
provide insights necessary to understand behavioural processes at individual, team and
organizational level.
MODULE-1
Introduction to management: concept, nature; evolution of management thoughts –traditional,
behavioural, system, contingency and quality viewpoints; Managerial levels, skills and roles in
an organization; Functions of Management: Planning, Organizing, Directing, Controlling,
Problem solving and Decision making; Management control; managerial ethics and social
responsibility; Management Information System (MIS).
MODULE-2
Fundamentals of Organizational Behavior: Concept, evolution, importance and relationship with
other Fields; Contemporary challenges of OB; Individual Processes and Behavior – differences,
Personality concept, determinant, theories and applications; Values, Attitudes and Emotions,
Perception- concept, process and applications, Learning and Reinforcement; Motivation:
concept, theories and applications; Stress management.
MODULE-3
Interpersonal Processes- Work teams and groups- Definition of Group, Stages of group
development, Group cohesiveness, Types of groups, Group processes and Decision Making;
Team Building; Conflict- concept, sources, types, management of conflict; Power and Political
Behavior; Leadership: concept, function and styles.
MODULE-4
Organizational Processes and structure: organizational design: various organizational structures
and their effect on human behavior; Organizational climate; Organizational culture;
Organizational change: Concept, Nature, Resistance to Change, Change Management,
Implementing Change and Organizational Development
69 | P a g e
Course Outcomes:
1. The students learn how to influence the human behaviour.
2. Students will be able to understand behavioural dynamics in organizations.
3. Students will be able to apply managerial concepts in practical life.
4. Students will be able to understand organizational culture and change.
REFERENCES:
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 Organisational Behaviour, Oxford University Press,
New Delhi
6. Robbins, S.P. & Judge, T.A., Organisational Behaviour, Prentice Hall of India, New
Delhi
70 | P a g e
CODE:HSMC-04
NO OF CREDITS: 3
The purpose of the course is to understand nature of accounting and its interaction with other
accounting and their comparison. It also focuses what kind of information the manager need,
from where these can be obtained and how this information can be used to carry out important
managerial decision.
MODULE-1:
Meaning nature and scope of different types of accounting and their comparison. Accounting
principles and Indian accounting standards, IFRS, Preparation of final accounts of company with
basic adjustments.Reading and understanding of Annual report.
MODULE-2:
Analysis and interpretation of financial statements – meaning, importance and techniques, ratio
analysis; fund flow analysis; cash flow analysis (AS-3)
MODULE-3:
Classification of costs, preparation of cost sheet, inventory valuation, overview of standard
costing and variance analysis; material variance and labour variance.
MODULE-4:
Budgetary control- meaning, need, objectives, essentials of budgeting, different types of budgets
cash budget, flexible budget zero base budget; marginal costing, BEP analysis, decision making
for optimum sales mix, exploring new markets, make/Buy decisions, expand/ contract, accepting
and rejecting decisions
Course Outcomes:
1. This course will impart knowledge to the students regarding preparation of financial
statements their analysis.
71 | P a g e
2. The students will be able to understand applications of cost accounting and cost control
techniques like standard costing etc.
3. The course will help them to take better managerial decisions.
4. Students will be able to know about budget control techniques.
REFERENCES:
1. Singhal, A.K. and Ghosh Roy, H.J., Accounting for Managers, JBC Publishers
and Distributors, New Delhi
2. Pandey, I.M., Management Accounting, Vikas Publishing House, New Delhi
3. Horngren, Sundem and Stratton, Introduction to Management Accounting,
Pearson Education, New Delhi.
4. Jain, S.P and Narang, K.L., Advanced Cost Accounting, Kalyani Publishers,
Ludhiana.
5. Khan, M.Y. and Jain, P.K., Management Accounting, TMH, New Delhi
72 | P a g e
DETAILED 4-YEAR CURRICULUM CONTENTS
STREAM-1
73 | P a g e
CODE: PEC-CS-T-501
NO OF CREDITS: 3
Course Objectives:
Definition of a graph and directed graph, simple graph. Degree of a vertex, regular graph,
bipartite graphs, subgraphs, complete graph, complement of a graph, operations of graphs,
isomorphism and homomorphism between two graphs, directed graphs and relations.
Walks, paths and circuits, connectedness of a graph, Disconnected graphs and their components,
Konigsberg 7-bridge problem, Around the world problem, Euler graphs, Hamiltonian paths and
circuits, Existence theorem for Eulerian and Hamiltonian graphs.
Trees and their properties, distance and centre in a tree and in a graph, rooted and binary trees,
spanning trees and forest, fundamental circuits, cut sets, connectivity and separability,1-
isomorphism, 2-isomorphism, breadth first and depth first search.
Incidence matrix and its sub matrices, Reduced incidence matrix, circuit matrix, fundamental
circuit matrix, cut set matrix, fundamental cut set matrix, path matrix, adjacency matrix of a
graph and of digraph.
74 | P a g e
MODULE-5:PLANAR AND DUAL GRAPH
Planar graphs, Euler‘s formula, Kuratowski‘s graphs, detections of planarity, geometric dual,
combinatorial dual.
Network flows, Ford-Fulkerson algorithm for maximum flow, Dijkstra algorithm for shortest
path between two vertices, Kruskal‘s and Prim‘s algorithms for minimum spanning tree.
Course Outcomes:
REFERENCES
1. Deo Narsingh, Graph Theory with Applications to engineering and computer science,
Prentice Hall of India, 1992.
2. Clark John and Holton D.A., A first Look At Graph Theory, Allied Publishers Ltd., New
Delhi,1995.
3. Aldous and Wilson, Graphs and Applications: An Introductory Approach, Springer,2000.
4. Mott J.L., Kandel A and Baker T.P., . Discrete Mathematics for Computer Scientists and
Mathematicians, Prentice Hall of India,2001.
6. Reinhard Diestel, Graph Theory, Springer International Edition..2004
75 | P a g e
CODE: PEC-CS-T-601
NO OF CREDITS: 3
Course Objectives:
MODULE-1:
Sorting: Review of various sorting algorithms, topological sorting
Graph: Definitions and Elementary Algorithms: Shortest path by BFS, shortest path in edge-
weighted case (Dijkasra's), depth-first search and computation of strongly connected
components, emphasis on correctness proof of the algorithm and time/space analysis, example of
amortized analysis.
MODULE-2:
Matroids: Introduction to greedy paradigm, algorithm to compute a maximum weight maximal
independent set. Application to MST.
Graph Matching: Algorithm to compute maximum matching. Characterization of maximum
matching by augmenting paths, Edmond's Blossom algorithm to compute augmenting path.
MODULE-3:
Flow-Networks: Maxflow-mincut theorem, Ford-Fulkerson Method to compute maximum flow,
Edmond-Karp maximum-flow algorithm.
Matrix Computations: Strassen's algorithm and introduction to divide and conquer paradigm,
inverse of a triangular matrix, relation between the time complexities of basic matrix operations,
LUP-decomposition.
MODULE-4:
Shortest Path in Graphs: Floyd-Warshall algorithm and introduction to dynamic programming
paradigm. More examples of dynamic programming.
76 | P a g e
Modulo Representation of integers/polynomials: Chinese Remainder Theorem, Conversion
between base-representation and modulo-representation, Extension to polynomials, Application:
Interpolation problem.
Discrete Fourier Transform (DFT): In complex field, DFT in modulo ring, Fast Fourier
Transform algorithm. Schonhage-Strassen Integer Multiplication algorithm
MODULE-5:
Linear Programming: Geometry of the feasibility region and Simplex algorithm
NP-completeness: Examples, proof of NP-hardness and NP-completeness.
One or more of the following topics based on time and interest
Approximation algorithms, Randomized Algorithms, Interior Point Method, Advanced Number
Theoretic Algorithm
MODULE-6:
Recent Trends in problem solving paradigms using recent searching and sorting techniques by
applying recently proposed data structures.
REFERENCES:
77 | P a g e
CODE: PEC-CS-T-602
NO OF CREDITS: 3
Course Objectives:
1. To make the students familiar with Parallel Computation and techniques for
parallelization
2. To enable students understand how to reduce the number of processors and calculating
cost of communication
3. To give knowledge about parallel search, elementary parallel algorithm, graph
algorithm, P- complete classes
4. To enable students understand the concept of Mutual exclusion and Clock
Synchronization, Distributed Graph algorithms
5. To make the students understand basics of Cover MPI programming
Parallel Reduction, Prefix Sums, List Ranking, Pre-order Tree Traversal, Merging Two Sorted
Lists, Graph Coloring, Reducing the Number of Processors and Brent's Theorem, Dichotomy of
Parallel Computing Platforms, Cost of Communication
The P-Complete Class, Mapping and Scheduling, Elementary Parallel Algorithms, Matrix
Multiplication, Sorting, Dictionary Operations: Parallel Search, Graph Algorithms
78 | P a g e
Models and complexity measures, Safety, liveness, termination, logical time and event ordering,
Global state and snapshot algorithms, Mutual exclusion and Clock Synchronization, Distributed
Graph algorithms
Cover MPI programming basics with simple programs and most useful directives; Demonstrate
Parallel Monte Carlo
Course Outcomes:
1. The students will be able to understand basics of PRAM Model of Parallel Computation,
techniques for parallelization like pointer jumping and Divide and Conquer
2. The students would be able to perform preorder traversal and understand parallel
computing platforms and find the cost of communication.
3. The students will be able define elementary parallel algorithms and Dictionary operations
4. The students will be able to measure complexity,
5. The students would be able to demonstrate Parallel Monte Carlo and write simple
programs using MPI programming
REFERENCES
79 | P a g e
CODE: PEC-CS-T-701
NO OF CREDITS: 3
Course Objectives:
MODULE-1:
Introduction to Queues and Queueing Theory, Stochastic Processes, Markov Processes and
Markov Chains, Birth-Death Process, Basic Queueing Theory (M/M/-/- Type Queues, Departure
Process from M/M/-/- Queue, Time Reversibility, Method of Stages, Queues with Bulk Arrivals,
Equilibrium Analysis of the M/G/1 Queue
MODULE-2:
Analyzing the M/G/1 Queue using the Method of Supplementary Variables, M/G/1 Queue with
Vacations, M[x] /G/1 Queue, Priority Operation of the M/G/1 Queue, M/M/n/K Queue with
Multiple Priorities
MODULE-3:
M/G/1/K Queue, G/M/1, G/G/1 G/G/m, and M/G/m/m Queues, Queueing Networks -
Classification and Basic Concepts, Open and Closed Networks of M/M/m Type Queues,
Jackson's Theorem
MODULE-4:
Analysis of Closed Queueing Networks using Convolution and Mean Value Algorithms,
Norton's Theorem for Closed Queueing Networks, Mixed Queueing Networks, Queueing
Network Analyzer (QNA) Approach, Simulation Techniques for Queues and Queuing Networks,
Discrete Time Queues.
80 | P a g e
Course Outcomes:
1. develop an understanding to the basic concepts of Queuing theory and type of queues.
2. understand and apply the Queuing theory to Science and Engineering problems and
applications.
3. calculate the n-step transition probabilities for any Markov chain and understand about
the birth and death of processes.
4. apply Markov chain & Birth Death process to real life problems.
5. develop an understanding of various Queuing Systems.
REFERENCES
1. Donald Gross, James M. Thompson, John F. Shortle and Carl W. Harris, Fundamentals
of Queueing Thoery, Wiley 2008.
2. Sanjay K. Bose, An Introduction to Queueing Systems, Springer 2002.
81 | P a g e
CODE: PEC-CS-T-702
NO OF CREDITS: 3
Course Objectives:
82 | P a g e
MODULE-5: REPEATED GAMES
Infinitely/finitely repeated games, Trigger strategies, Folk theorems, Imperfect monitoring and
perfect public equilibrium.
MODULE-6: MECHANISM DESIGN
Optimal auctions, revenue-equivalence theorem, Social choice viewpoint. Impossibility results,
Revelation principle, Incentive compatibility, VCG mechanisms, Mechanisms in networking,
decentralized mechanisms.
Course Outcomes:
After the successful completion of the course, student will be able to:
1. Understand the use of game theory in economics, political science, sociology, engineering
apart from disciplines like mathematics and biology.
2. Use different types and forms of the games and choose the type depending upon the need.
3. Apply learning mechanisms in an environment of perfect/incomplete information and
understand the need of repeated game.
4. Design mechanisms using game theory to understand and analyze real life situations such
as market behaviour, decentralized network model.
REFERENCES
1. Osborne, M. J., “An Introduction to Game Theory”, Oxford University Press, 2004
2. Mas-Colell, A., M.D. Whinston and J.R. Green ,“Microeconomic Theory”, Oxford
University Press, 1995.
3. Gibbons, R. ,“A Primer in Game Theory”, Pearson Education, 1992.
83 | P a g e
CODE: PEC-CS-T-703
NO OF CREDITS: 3
Course Objectives:
1. Students will able to learn concept of information and entropy
2. Understand Shannon‘s theorem for coding and Huffman coding
3. Students will able to calculate channel capacity
4. Able to apply various coding techniques
MODULE-1:
Basics of information theory, entropy for discrete ensembles; Shannon's noiseless coding
theorem; Encoding of discrete sources.
MODULE-2:
Markov sources; Shannon's noisy coding theorem and converse for discrete channels;
Calculation of channel capacity and bounds for discrete channels; Application to continuous
channels.
MODULE-3:
Techniques of coding and decoding; Huffman codes and uniquely detectable codes; Cyclic
codes, Convolutional arithmetic codes.
Course Outcomes:
At the end of the course, students will demonstrate the ability to:
84 | P a g e
REFERENCES:
85 | P a g e
DETAILED 4-YEAR CURRICULUM CONTENTS
STREAM-2
86 | P a g e
CODE: PEC-CS-S-501
NO OF CREDITS: 3
Course Objectives:
MODULE-1: INTRODUCTION
Some definition and terms, interpretation and microprogramming. Basic data types, Instructions
set (L/S, R/M, R+M architecture), instructions (Classes, mnemonics, conventions), Computer
Architectural Classification schemes, Flynn‘s Classification, System attributes to performance.
MODULE-2: PROGRAM AND NETWORK PROPERTIES
Conditions of parallelism, Data and resource Dependences, Hardware and software parallelism,
Program partitioning and scheduling, Grain Size and latency, Program flow mechanisms, Control
flow versus data flow, Data flow Architecture, Demand driven mechanisms, Comparisons of
flow mechanisms.
Introduction to Data level-parallelism- SIMD and Vector, Introduction to Thread- level
parallelism- Symmetric and shared memory architectures, Symbolic processors.
MODULE-3: CACHE MEMORY NOTION
87 | P a g e
Basic Notion, Cache Organization (direct, associative, set-associative and sectored), Write
policies and Strategies for replacement, Introduction to different types of caches- Split I and D-
Caches, on chip caches and Two level Caches.
MODULE–4: MEMORY SYSTEM DESIGN
The physical memory; memory module, error detection and correction, memory buffer,
partitioning the address space, models of simple memory processor interaction (Hellerman‘s,
Strecker‘s, Rau‘s) memory hierarchy Technology: inclusion, coherence and locality; Interleaved
memory organization Virtual memory technology: models, TLB, paging and segmentation,
memory replacement policies.
Course Outcomes
By the end of the course, a student should be able to:
1. Discuss the organization of computer-based systems and the advanced concepts of
computer architecture. The student will be able to expose the major differences of RISC
and CISC architecture. Also analyze the L/S, R/M and R+M architectures
2. Evaluate performance of different architectures with respect to various parameters and
how a range of design choices are influenced by applications
3. Understand and identify cache and memory related issues in parallel computer systems,
including multiprocessor systems.
4. Incorporate parallelism in systems to improve their performance.
REFERENCES:
1. Advance computer architecture by Kai Hwang , TMH, ed 2001.
2. Pipelined and Parallel processor design by Michael J. Fiynn – 1995, Narosa.
3. Computer Architecture A Quantitative Approach, John L Hennessey and David A
Patterson, Morgan Kaufmann/ Elsevier, Fifth Edition, 2012.
88 | P a g e
CODE: PEC-CS-S-601
NO OF CREDITS: 3
L T P THEORY EXAM: 75
3 0 0 TOTAL: 100
Pre-requisites:
Course Objectives:
MODULE-1: INTRODUCTION
Evolving role of software, Software Characteristics, Software crisis, Silver bullet, Software
myths, Software process, Personal Software Process (PSP), Team Software Process (TSP),
emergence of software engineering, Software process, project and product, Software Process
Models: Waterfall Model, Prototype Model, Spiral, Model ,RAD Model, Iterative Model,
Incremental Model, Aspect-oriented Model, Agile Model.
MODULE-2: SOFTWARE PROJECT MANAGEMENT
Project management concepts, Planning the software project, Estimation—LOC based, FP based,
Use-case based, empirical estimation COCOMO- A Heuristic estimation techniques, staffing
level estimation, team structures, staffing, risk analysis and management.
MODULE-3: REQUIREMENTS, ANALYSIS AND SPECIFICATION
Software Requirements engineering, Requirement engineering process, Requirement
Engineering Tasks, Types of requirements, SRS. System modeling: Data Modeling, Functional
modeling and information flow: Data flow diagrams, Behavioral Modeling, The mechanics of
89 | P a g e
structured analysis: Creating entity/ relationship diagram, data flow model, control flow model,
the data dictionary.
MODULE-4: SYSTEM DESIGN
Design principles, the design process; Design concepts: Abstraction, refinement, modularity,
software architecture, control hierarchy, structural partitioning, data structure, software
procedure, information hiding; Effective modular design: Functional independence, Cohesion,
Coupling;
MODULE-5: SOFTWARE TESTING AND MAINTENANCE
Testing terminology- error, bug/defect/fault, failure, Verification and validation, Test case
design, Static testing ,Dynamic testing--- Black box testing—Boundary value analysis, White
box testing-- basis path testing, Unit testing, Integration testing, Acceptance Testing
MODULE-6: SOFTWARE QUALITY MODELS AND STANDARDS
Quality concepts, Software quality assurance, SQA activities, Formal approaches to SQA;
Statistical software quality assurance; CMM, The ISO 9126 Standard
Course Outcomes:
1. Implement Software life cycle models and have a knowledge of different phases of
Software life cycle
2. Identify, formulate, review, estimate and schedule complex software projects using
principles of mathematics.
3. Create a bug free software with good design and quality by using appropriate techniques
and modern engineering and IT tools.
4. Analyze verification, validation activities, static, dynamic testing, debugging tools and
techniques and importance of working in teams.
REFERENCES:
90 | P a g e
CODE:PEC-CS-S-602(I)
NO OF CREDITS: 3
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Course Objectives:
1. To introduce the fundamental concepts and issues of managing large volume of shared
data in a parallel and distributed environment
2. To provide insight into related research problems.
MODULE-1: INTRODUCTION
Distributed data processing; What is a DDBS; Advantages and disadvantages of DDBS;
Problem areas; Overview of database and computer network concepts. Distributed Database
Management System ArchitectureTransparencies in a distributed DBMS; Distributed DBMS
architecture; Global directory issues/
MODULE-2:DISTRIBUTED DATABASE DESIGN
Alternative design strategies; Distributed design issues; Fragmentation; Data allocation
Semantics Data Control : View management; Data security; Semantic Integrity Control
Query Processing Issues: Objectives of query processing; Characterization of query processors;
Layers of query processing; Query decomposition; Localization of distributed data
MODULE-3: DISTRIBUTED QUERY OPTIMIZATION
Factors governing query optimization; Centralized query optimization; Ordering of fragment
queries; Distributed query optimization algorithms
Transaction Management: The transaction concept; Goals of transaction management;
Characteristics of transactions; Taxonomy of transaction models
Concurrency Control: Concurrency control in centralized database systems; Concurrency
control in DDBSs; Distributed concurrency control algorithms; Deadlock management
MODULE-4: RELIABILITY
91 | P a g e
Reliability issues in DDBSs; Types of failures; Reliability techniques; Commit protocols;
Recovery protocols
Course Outcomes:
After completion of course, students would be:
1. Design trends in distributed systems.
2. Apply network virtualization.
3. Apply remote method invocation and objects.
REFERENCES
92 | P a g e
CODE: PEC-CS-S-602(II)
NO OF CREDITS: 3
Course Objectives:
MODULE-1:
MODULE-2:
Timing and clocks in embedded systems; processor Architectures: Harvard V/S Princeton, CISC
V/S RISC, Microcontroller‘s memory types, Microcontroller‘s features: clocking, I/O pins,
interrupts, timers, peripherals,
MODULE-3:
Task Modeling and management, saving memory space. Real time operating system issues,
Recent Trends in Embedded Processors, Operating System and Development programming
Languages.
MODULE-4:
Course Outcomes:
93 | P a g e
1. The students will be able to understand the basics of embedded systems and familiar with
the issues and challenges in the embedded system design.
2. The students will be able to familiar with the host and target machine and able to transfer
the software to target machine.
3. Understand the recent trend for Embedded system development and operating system.
4. Able to apply thefault tolerance technique for real time embedded systems.
REFERENCES
94 | P a g e
CODE: PEC-CS-S-701(I)
NO OF CREDITS: 3
Course Objectives:
MODULE-1: INTRODUCTION
Introduction of Operating Systems, Evolution of OS, Types of OS: Batch OS, single user &
Multi-user OS, Multiprogramming and Multi-tasking, Multi-threading, Time-sharing, Embedded
OS, Distributed Operating Systems, Multi-processor Operating Systems, Real-time Operating
Systems, Mobile Operating Systems
MODULE-2: DISTRIBUTED OPERATING SYSTEMS
Introduction, Characteristics, Network OS & Distributed OS, Various issues, Communication in
Distributed Systems, Clock Synchronization, Mutual Exclusion Algorithms, Deadlock Detection
and Prevention, Distributed Process Scheduling Algorithms, Distributed File Systems.
MODULE-3: MULTI-PROCESSOR OPERATING SYSTEMS
Introduction, System Architecture, Structure of Multi-processor OS, Process Synchronization,
Processor Scheduling Algorithms, Memory Sharing, Process Migration, Fault Tolerance
MODULE-4: REAL-TIME OPERATING SYSTEMS
95 | P a g e
Introduction, Characteristics, Structure of a Real-time System, Scheduling Algorithms, Mutual
Exclusion, Priority Inheritance Protocol, Priority Ceiling Protocol, Case Studies
Course Outcomes:
After the successful completion of the course students will be able to:
1. Understand the characteristics of different OS.
2. Develop algorithms for process scheduling, synchronization for different OS.
3. 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 for different OS.
4. Design and implement file management system for different OS.
5. Design and implement security policies in OS.
REFERENCES
96 | P a g e
CODE: PEC-CS-S-701(II)
NO OF CREDITS: 3
Course Objectives:
1. The student will learn abort the basic of real time system.
2. The student will learn abort the basic of embedded system.
3. Able to understand the RTOS and scheduling techniques.
4. The student will able to understand the Fault tolerance techniques.
97 | P a g e
MODULE-4:TASK ASSIGNMENT AND SCHEDULING
Fault types, fault detection measures, fault detection mechanisms, fault and error containment,
Redundancy: Hardware and software redundancy, time redundancy, Desirable characteristics of
Real time languages.
Course Outcomes:
1. The students will be able to understand the basics of real time systems and familiar
withthe issues and challenges in the embedded system design.
2. The students will be able to familiar with the host and target machine and understand
therelease time, deadline and timing constraints with issues involved in real time system
design.
3. Understand the structure of RTOS its properties together with task management with
multi-task scheduling algorithms
4. Able to familiar with the fault types and error containment zone with the concepts of
hardware and software redundancy.
REFERENCES:
98 | P a g e
CODE: PEC-CS-S-702
NO OF CREDITS: 3
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Course Objectives:
1. To make the students familiar with the basics of adhoc and wireless network along with
the difference between the two.
2. To make the student understand the concept of routing and different strategies/protocols
available for efficient routing in adhoc network.
3. To make the student aware about the quality of service in adhoc& wireless network.
4. To make the student understand the need, limitations of secured routing in ad hoc
networks and wireless networks.
MODULE-1:
Introduction: Wireless Networks, Infrastructure and Infrastructure less Wireless Networks, Ad
hoc Wireless Networks, Heterogeneity in Mobile Devices, Types of Adhoc Mobile
Communications,
MANET & WSN: Concepts & architecture of MANET & WSN, Applications & Design
Challenges of Adhoc& Sensor Networks.
MODULE-2:
Routing Protocols in MANET : Destination Sequenced Distance Vector (DSDV), Wireless
Routing Protocol (WRP), Cluster Switch Gateway Routing (CSGR) Ad hoc On–Demand
Distance Vector Routing (AODV) , Dynamic Source Routing (DSR) ,Temporally Ordered
Routing Algorithm (TORA) , Signal Stability Routing (SSR) , Location–Aided Routing (LAR)
Hybrid Routing Protocol: Zone Routing Protocol (ZRP).
QoS in Ad-hoc Networks: Introduction to QoS, Issues and Challenges in Providing QoS in Ad
hoc Wireless Networks , classifications of QoS Solutions , Network Layer Solutions (Ticket
99 | P a g e
Based QoS Routing, Predictive Location Based QoS Routing, QAODV ) , QoS Frameworks for
Ad hoc Wireless Networks (IntServ, DiffServ, FQMM, INSIGNIA,INORA)
MODULE-3:
Wireless Sensor Networks (WSN): Protocol Stack of WSN, Origin ,need and Enabling
Technologies for WSN, WSN Middleware Principles, Middleware Architecture, Existing
Middleware (Milan, IrisNET,CLMF,MLM),Operating systems Design Issues
MAC Protocols : Challenges for MAC, Classification of MAC Protocols , Contention free and
Contection Based MAC Protocols.
MODULE-4:
WSN Routing, Localization &QoS : Challenges for Routing,Classification of Protocols, Data–
Centric and Flat Architecture Protocols (Flooding,Gossiping,SPIN) Heirarchical protocols (
LEACH,PEGASIS,TEEN,APTEEN ), Location Based(Unicast, Multicast, GeoCast) and QoS
based(Sequential Assignment,SPEED) Routing Protocols.
Security in WSN: Challenges of Security in WSN, Security Attacks in WSN, Protocols and
Mechanisms for Security, IEEE 802.15.4 and ZigBee Security
Course Outcomes:
At the end of the course, students will be able to:
1. Describe the concept of ad-hoc network and differentiate between infrastructure based
and infrastructure less networks.
2. Comprehending different categories of ad-hoc and wireless sensor network protocols
available for efficient routing.
3. Understand the importance of QoS in communication and various routing protocols
proposed for QoS achievement in mobile adhoc network. ClassifyQoS Parameter in
adhoc environment and design routing algorithms for adhoc network using them.
4. Classification of Routing protocols for WSN.
5. Identify the need of security in WSN along with the understanding of different types of
attacks and available protocols.
REFERENCES
1. C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks Architectures and
Protocols”, Prentice Hall, PTR, 2004.
2. C. K. Toh, “Ad Hoc Mobile Wireless Networks Protocols and Systems”, Prentice Hall,
PTR, 2001.
3. Charles E. Perkins, “Ad Hoc Networking”, Addison Wesley, 2000
100 | P a g e
4. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003, ISBN : 0-470-86736-1
5. Holger Karl & Andreas Willig, " Protocols And Architectures for Wireless
SensorNetworks" , John Wiley, 2005, ISBN : 0-470-09510-5.
6. Ian F. Akyildiz and Mehmet Can Varun ” Wireless Sensor Networks” John Wiley ISBN
978-0- 470-03601-3.
7. Kazem Sohraby, Daniel Minoli, &TaiebZnati, “Wireless Sensor Networks-Technology,
Protocols, And Applications”, John Wiley, 2007, ISBN :978-0-471-74300-2
101 | P a g e
CODE: PEC-CS-S-703
NO OF CREDITS: 3
Course Objectives:
Introduction to IoT, Characteristics of IoT, Physical design of IoT, Logical design of IoT,
Functional blocks of IoT, Communication models & APIs ,IoT & M2M Machine to Machine,
Difference between IoT and M2M, Software define Network, Challenges in IoT(Design
,Development, Security).
Wireless medium access issues, MAC protocol survey, Survey routing protocols, Sensor
deployment & Node discovery, Data aggregation & dissemination.
Web of Things vs Internet of things, two pillars of web, Architecture and standardization of IoT,
Unified multitier-WoT architecture, WoT portals and Business intelligence, Cloud of things:
Grid/SOA and cloud computing, Cloud middleware, cloud standards
102 | P a g e
Course Outcomes:
REFERENCES:
103 | P a g e
DETAILED 4-YEAR CURRICULUM CONTENTS
STREAM-3
104 | P a g e
CODE: PEC-CS-D-501
NO OF CREDITS: 3
105 | P a g e
MODULE-5:
Scalable Machine Learning (Online and Distributed Learning), Introduction to Bayesian
Learning and Inference, Recent trends in various learning techniques of machine learning and
classification methods.
Course outcomes:
After completion of course, students would be able to:
1. Extract features that can be used for a particular machine learning approach in various
IOT applications.
2. 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.
3. To mathematically analyse various machine learning approaches and paradigms.
REFERENCES:
1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical
Learning, Springer 2009 (freely available online)
3. Christopher Bishop, Pattern Recognition and Machine Learning, Springer, 2007
106 | P a g e
CODE: PEC-CS-D-601
NO OF CREDITS: 3
Course Objectives:
1. To familiarize the students with the basic roadmap of data mining and various data
mining techniques.
2. To introduce the techniques of frequent pattern mining and Clustering
3. To acquaint students with classification and prediction techniques in data mining.
4. To introduce students with time series data and data streams
5. To introduce various advance mining applications areas like web mining, social network
analysis etc.
MODULE-1: INTRODUCTION
Mining frequent patterns, association and correlations; Association Rule Mining, Sequential
Pattern Mining concepts, Cluster Analysis – Types of Data in Cluster Analysis, Partitioning
methods, Hierarchical Methods; Transactional Patterns and other temporal based frequent
patterns,
107 | P a g e
Mining Time series Data, Periodicity Analysis for time related sequence data, Similarity search
in Time-series analysis; Mining Data Streams, Methodologies for stream data processing and
stream data systems, Frequent pattern mining in stream data, Classification of dynamic data
streams.
Web Mining, Web page layout structure; mining web link structure, content and usage patterns;
Recent trends in Distributed Warehousing and Data Mining, Class Imbalance Problem; Graph
Mining; Social Network Analysis
Course Outcomes:
1. The students will be able to understand basic concepts of data warehouse and data
mining, techniques and applications
2. The students will be able to understand the techniques to extract patterns from
transactional database using Association and Apriori algorithms
3. The students will be able to understand different clustering techniques and will be able to
cluster data sets
4. The students will be able to classify data set into different classes and acquire the
knowledge to make predications based on classified data
5. The students will be able to understand and analyze time series data
6. The students will be able to understand types of web mining viz. content, structure
and usage mining.Web content mining in detail.
7. The students can extend the Graph mining algorithms to Web mining
8. Students will understand advance applications of data mining
REFERENCES
1. Jiawei Han and M Kamber, Data Mining Concepts and Techniques,, Second Edition,
Elsevier Publication, 2011.
2. Introduction to Data Mining - Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Addison
Wesley, 2006. 3. G Dong and J Pei, Sequence Data Mining, Springer, 2007.
108 | P a g e
CODE: PEC-CS-D-602
NO OF CREDITS: 3
Course Objectives:
1. To introduce soft computing concepts and techniques and foster their abilities in
designing appropriate technique for a given scenario.
2. To implement soft computing based solutions for real-world problems.
3. To give students knowledge of non-traditional technologies and fundamentals of artificial
neural networks, fuzzy sets, fuzzy logic, genetic algorithms.
4. To provide students a hand-on experience on MATLAB to implement various strategies.
109 | P a g e
Course Outcomes:
After completion of course, students would be able to:
1. Identify and describe soft computing techniques and their roles in building intelligent
Machines.
2. Apply fuzzy logic and reasoning to handle uncertainty and solve various engineering
problems.
3. Apply genetic algorithms to combinatorial optimization problems.
4. Evaluate and compare solutions by various soft computing approaches for a given
problem.
REFERENCES
1. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic: Theory and
Applications”, PHI
2. Satish Kumar, “Neural Networks: A classroom approach” Tata McGraw Hill.
3. Haykin S., “Neural Networks-A Comprehensive Foundations”, PHI
4. Anderson J.A., “An Introduction to Neural Networks”, PHI
5. M.Ganesh, “Introduction to Fuzzy sets and Fuzzy Logic” PHI.
6. N P Padhy and S P Simon, “ Soft Computing with MATLAB Programming”,
Oxford University Press
110 | P a g e
CODE: PEC-CS-D-701
NO OF CREDITS: 3
Pre-requisites:
Course Objectives:
1. To make the students familiar with difference levels/stages of natural language
processing and to introduce concept of Formal languages and grammars: Chomsky
hierarchy and problems associated (like Left-Associative grammars, ambiguous
grammars) with them.
2. To introduce the students with Morphology and Part of Speech Tagging by taking
examples from Hindi, English.
3. To introduce the top down and the bottom up parsing approaches and their respective
types of parsers.
4. To make the students familiar with grammar types like ATN & RTN.
5. To make the students familiar with the basic techniques of parsing like CKY, Earley&
Tomita‘s algorithms and role Hidden Markov Model in NLP
6. To make the students familiar with Semantics-knowledge and its utilization.
111 | P a g e
MODULE-4: COMPUTATION LINGUISTICS:
Morphology of natural languages like Hindi, English etc.,Part of Speech Tagging (POS),
recognition and parsing of natural language structures: ATN & RTN, General techniques of
parsing: CKY, Earley& Tomita‘s algorithms. Introduction to Hidden Markov Model (HMM)
Semantic networks logic and inference pragmatics, graph models and optimization, Prolog for
natural language semantic (e.g. DCG).
Course outcomes:
Upon successful completion of the course, the student will be able to understand:
1. Difference levels/stages of natural language processing and the concept of Formal
languages and grammars: Chomsky hierarchy and problems associated (like Left
Associative grammars, ambiguous grammars) with them.
2. The top down and the bottom up parsing approaches and their respective types of parsers
like CKY, Earley& Tomita‘s.
3. The Hidden Markov Model and its application in NLP.
4. The student will be able to write small ATN & RTN grammars for simple English
sentences.
5. The student will be able to do Morphology of words from natural languages like Hindi,
English and Semantics-knowledge and its important to understand the documents.
REFERENCES
112 | P a g e
CODE: PEC-CS-D-702(I)
NO OF CREDITS: 3
Course Objectives:
1. to get the students familiar about the Concepts of Descriptive and Inferential Statics
through tests
2. to study the concepts of ANOVA and Machine learning
3. to study in detail Supervised Learning and Classification techniques
4. to study the basic and advanced concepts of Unsupervised Learning and Challenges for
Big Data Analytics
113 | P a g e
MODULE-4:UNSUPERVISED LEARNING AND CHALLENGES FOR BIG DATA
ANALYTICS
Clustering Associative Rule Mining Challenges for big data analytics, Creating data for analytics
through designed experiments Creating data for analytics through Active learning Creating data
for analytics through Reinforcement learning
Course Outcomes:
After completion of the course:
1. Students will be able to understand the statistical analysis methods.
2. Students will be able to understand the concepts of Regression and Machine Learning
3. Students will be able to Compare and contrast Supervised and Unsupervised learning
4. Students will be able to understand the major challenges related to Big Data Analytics
REFERENCES
1. Hastie, Trevor, et al. The elements of statistical learning. Vol. 2. No. 1. New York: springer,
2009.
2. Montgomery, Douglas C., and George C. Runger. Applied statistics and probability for
engineers. John Wiley & Sons, 2010.
3. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, 2007.
4. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge
University Press, 2012.
114 | P a g e
CODE: PEC-CS-D-702(II)
NO OF CREDITS:3
Pre-requisites:
Course Objectives:
1. To build an understanding of the fundamental concepts of Information Retrieval
2. To understand the elements of Web Search Engines and Crawlers
3. To familiarize students with the basic taxonomy and terminology of Indices and to
understand Heap‘s Law for estimation and Zipf‘s law for modeling distribution of terms
4. To understand dictionary compression and posting list compression and to introduce the
scoring ,tf-idf weighting and vector space model for scoring
Information retrieval problem, an inverted index, Processing Boolean queries, The extended
Boolean model versus ranked retrieval, an inverted index, Bi-word indexes, Positional indexes,
Combination schemes
Basic Building Blocks and Architecture, Text Acquisition, Text Transformation, Index Creation,
User Interaction, Ranking, Evaluation.
Crawling the Web, Retrieving Web Pages, The Web Crawler, Freshness, Focused Crawling,
Deep Web, Crawling Documents and Email, Storing the Documents, Detecting Duplicates
115 | P a g e
Index compression: Statistical properties of terms in information retrieval, Heaps‘ law:
Estimating the number of terms, Zipf‘s law: Modeling the distribution of terms, Dictionary
compression, Dictionary as a string, Blocked storage, Postings file compression
Parametric and zone indexes, Weighted zone scoring, Learning weights, The optimal weight,
Term frequency and weighting, Inverse document frequency, Tf-idf weighting, The vector space
model for scoring , Computing scores in a complete search system.
Course Outcomes:
REFERENCES
116 | P a g e
CODE: PEC-CS-D-703
NO OF CREDITS: 3
Course Objectives:
Artificial neurons, Neural networks and architectures, Feedforward and feedback architectures,
Learning types-supervised, unsupervised and reinforced, learning mechanisms-Gradient Descent,
Boltzmann, and Hebbian, Single Perceptron as classifier, Multi-layer perceptron model. .
Attractor Neural Networks, Associative learning and Memory Model, Discrete Hopfield
Network, Condition for Perfect Recall in Associative Memory, Bi-direction Associative
memories (BAM)-Auto and Hetro-association, Boltzmann machine, Introduction to Adaptive
Resonance Networks.
Gradient Descent and Least Mean Squares Algorithm, Back Propagation Algorithms, Multi-
Class Classification Using Multi-layered Perceptrons., Support Vector Machine (SVM), Radial
Basis Function Networks: Cover's Theorem, Learning Mechanisms in RBF.
117 | P a g e
Introduction to PCA, Dimensionality reduction Using PCA, Hebbian-Based Principal
Component Analysis, Introduction to Self OrganizingMaps : Cooperative and Adaptive
Processes in SOM, and Vector-Quantization Using SOM.
Course Outcomes:
After successful completion of the course, the students will be able to:
1. Use neural networks concepts and associated techniques for solving classification and
regression problems.
2. Design and Use neural networks for pattern recall, completion and repair.
3. Design and Use neural networks for self learning and unsupervised classifications.
4. Choose the appropriate classifier.
REFERENCES:
1. Haykin S., “Neural Networks-A Comprehensive Foundations”, Prentice-Hall International,
New Jersey, 1999.
2. Anderson J.A., “An Introduction to Neural Networks”, PHI, 1999.
3. Satish Kumar, “Neural Networks: A Classroom Approach”
4. Hertz J, Krogh A, R.G. Palmer, “Introduction to the Theory of Neural Computation”,
Addison-Wesley, California, 1991.
118 | P a g e
DETAILED 4-YEAR CURRICULUM CONTENTS
STREAM-4
119 | P a g e
CODE: PEC-CS-A-501
NO OF CREDITS: 3
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Pre-requisites:
Course Objectives:
To learn and understand the fundamentals of digital image processing, and various image Transforms,
Image Enhancement Techniques, Image restoration Techniques and methods, image compression and
Segmentation used in digital image processing.
Elements of visual perception, image sensing and acquisition, image sampling and quantization,
basic relationships between pixels – neighborhood, adjacency, connectivity, distance measures.
Color models–RGB, YUV, HSI; Color transformations– formulation, color complements, color
slicing, tone and color corrections; Color image smoothing and sharpening; Color Segmentation.
Detection of discontinuities, edge linking and boundary detection, thresholding – global and
adaptive, region-based segmentation. Wavelets and Multi-resolution image processing-
Uncertainty principles of Fourier Transform, Time-frequency localization, continuous wavelet
transforms, wavelet bases and multi-resolution analysis, wavelets and Sub band filter banks,
wavelet packets.
120 | P a g e
Redundancy–inter-pixel and psycho-visual; Loss less compression – predictive, entropy; Lossy
compression- predictive and transform coding; Discrete Cosine Transform; Still image
compression standards – JPEG and JPEG-2000.
Course Outcomes
At the end of the course, students will demonstrate the ability to:
REFERENCES
1. R.C. Gonzalez and R.E. Woods, Digital Image Processing, Second Edition, Pearson
Education 3rd edition 2008
3. Murat Tekalp , Digital Video Processing" Prentice Hall, 2nd edition 2015
121 | P a g e
CODE: ELPE613
NO OF CREDITS: 3
122 | P a g e
3. Understand the Discrete-Fourier Transform (DFT) and the FFT algorithms.
4. Design digital filters for various applications.
5. Apply digital signal processing for the analysis of real-life signals.
REFERENCES:
1. S. K. Mitra, “Digital Signal Processing: A computer based approach”, McGraw
Hill, 2011.
2. A.V. Oppenheim and R. W. Schafer, “Discrete Time Signal Processing”, Prentice
Hall, 1989.
3. J. G. Proakis and D.G. Manolakis, “Digital Signal Processing: Principles,
Algorithms And Applications”, Prentice Hall, 1997.
4. L. R. Rabiner and B. Gold, “Theory and Application of Digital Signal Processing”,
Prentice Hall, 1992.
5. J. R. Johnson, “Introduction to Digital Signal Processing”, Prentice Hall, 1992.
a. D. J. DeFatta, J. G. Lucas andW. S. Hodgkiss, “Digital Signal Processing”, John
Wiley & Sons, 1988.
123 | P a g e
CODE: PEC-CS-A-602
NO OF CREDITS: 3
Course Objectives:
1. Understand the basics of computer graphics, different graphics systems and applications
of computer graphics.
2. Learn the various algorithms for scan conversion and filling of basic objects and their
comparative analysis. To improve the object appearance by filling relevant parts of the
area.
3. Learning to use composite geometric transformations on graphical objects in 2D and 3D.
4. Understand the techniques for improving the object appearance with the help of clipping
objects outside the view. Explore projections for display of 3D scene on 2D screen.
5. Study different techniques that help to remove the surfaces outside the view of user by
understanding the concept of rendering.
Computer Graphics and Its Types, Application of computer graphics, Refresh CRT, Flat Panel
displays, Raster Scan Systems, Random Scan Systems, shadow-mask method, beam-penetration
method, color models- RGB, CMY, setting the color attributes of pixels.
MODULE-2: SCAN-CONVERSION
Output Primitives- Points, Lines, Circle, polygons; Attributes of Output Primitives: Line
Attributes, Color and Grayscale Levels, Area fill Attributes, Character Attributes, Bundled
Attributes; Scan–converting Lines- DDA line drawing algorithm, Bresenhams line drawing
algorithm;
MODULE-3: TRANSFORMATIONS
124 | P a g e
Two-dimensional Geometric Transformations:Basic Transformations, Matrix Representation and
Homogeneous Coordinates, Composite Transformations, Reflection and Shearing; Two-
Dimension Viewing : The viewing Pipeline, Window to viewport coordinate transformation ;
Three-Dimensional Transformations.
Image-space and Object-Space Method, Coherence and its types, Depth Comparison, Z-buffer
(Depth Buffer), Area-subdivision
Course Outcomes:
REFERENCES
125 | P a g e
CODE: PEC-CS-A-701
NO OF CREDITS: 3
Course Objectives:
1. The objective of this course is to provide insight to the mathematical formulation of real
world problems.
2. To optimize these mathematical problems using nature based algorithms. And the
solution is useful, especially for NP-Hard problems.
MODULE-1:
Engineering applications of optimization, Formulation of design problems as mathematical
programming problems.
MODULE-2:
General Structure of Optimization Algorithms, Constraints, The Feasible Region.
MODULE-3:
Branches of Mathematical Programming: Optimization using calculus, Graphical Optimization,
Linear Programming, Quadratic Programming, Integer Programming, Semi Definite
Programming.
MODULE-4:
Optimization Algorithms like Genetic Optimization, Particle Swarm Optimization, Ant Colony
Optimization etc.
MODULE-5:
Real life Problems and their mathematical formulation as standard programming problems.
Course Outcomes:
126 | P a g e
2. Understand and apply the concept of optimality criteria for various types of optimization
problems.
3. Solve various constrained and unconstrained problems in Single variable as well as
multivariable.
4. Apply the methods of optimization in real life situations.
REFERENCES
127 | P a g e
CODE: PEC-CS-A-702
NO OF CREDITS: 3
Course Objectives:
1. To familiarize the students with the basic concepts of internet, its history, ways to
connect to internet and basics of world wide web and search engines.
2. To familiarize the student with the fundamental language of internet i.e. HTML
3. To teach the student aware of the concepts of cascading style sheets
4. To teach the student the students the basics of client side and Server side scripting
128 | P a g e
MODULE 5 :SERVER SIDE SCRIPTING
CGI, Server Environment, Servlets, Servlet Architecture, Java Server Pages, JSP Engines, Beans,
Introduction to J2EE.
Course Outcomes:
At the end of the course/session the student would be
1. Acquainted with the basics of internet &search engines.
2. Have a hands on HTML
3. Learned the need and basics of CSS
4. Learned the concepts of client side and server side scripting.
REFERENCES
1. Fundamentals of the Internet and the World Wide Web, Raymond Greenlaw and
Ellen Hepp 2001, TMH .
2. Internet & World Wide Programming, Deitel,Deitel& Nieto, 2000, Pearson
Education
3. Complete idiots guide to java script,. Aron Weiss, QUE, 1997.
4. Network firewalls, Kironjeetsyan - New Rider Pub.
129 | P a g e
CODE: PEC-CS-A-703
NO OF CREDITS: 3
Course Objectives:
1. Understand the basic concept of Cryptography and Network Security, their mathematical
models.
2. To impart knowledge of major issues in network and computer system security, focusing
mainly on threats from malicious software and To understand common attacks on
computer networks and methods to detect and remediate such attacks.
3. To study various issues in security of MANETS and study various attacks.
4. To provide the students with the competences required for understanding various issues
in security of Wireless Security Networks and also various attacks against security
mechanism and routing.
MODULE-1:
Introduction What is security?, Need of security, Why is security so hard?, various goals of
security, Difference between Vulnerability, Threats, Attacks and control, Security goals, aspects
of security, security services, security attacks Encryption Techniques Terminology of
encryption, Requirement of encryption, cryptography, cryptanalysis, cryptanalytic attacks,
symmetric ciphers: Substitution ciphers, Transposition ciphers, Data Encryption Standard (DES,
Advanced Encryption Standard (AES), location of encryption devices, key distribution, Public
Key Cryptography and RSA, Diffie-Hellman Key Exchange, Message Authentication and
Hash Functions, MD5, SHA
MODULE-2:
Network Security Security services, Message confidentiality, Message integrity, message
authentication, digital signature, entity authentication. Authentication applications: Kerberose95,
X.509 Authentication service, Public key infrastructure. Electronic mail Security: Preety Good
Privacy (PGP), IP Security: IP security overview, IP security architecture, Authentication header,
Encapsulating security Payload, Combining security associations, Key management.
130 | P a g e
MODULE-3:
Security Attacks in MANET Security issues in MANET, Attacks in MANET: External Attack,
Internal attack, Black hole attack, warm hole attack, grey hole attack, Byzantine attack, Sleep
Deprivation attack, Flooding attack: RREQ flooding attack, Data flooding Attack.
MODULE-4:
Security Attacks in Wireless Sensor Networks Security issues in WSN, Attacks in WSN : Attack
against Security mechanism, Attack against basic mechanism like routing: Spoofed, altered,
replayed routing, Information, Selective forwarding , Sinkhole attacks , Sybil attacks,
Wormholes, HELLO flood attacks
Course Outcomes:
After the completion of this course the student will able to:
REFERENCES:
131 | P a g e
DETAILED 4-YEAR CURRICULUM CONTENTS
132 | P a g e
CODE: OEC-CS-601(I)
SUBJECT NAME: SOFT SKILLS AND INTERPERSONAL COMMUNICATION
NO OF CREDITS: 3
B.TECH 6th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
The course aims at creating awareness among the stock holders of the corporate world in which
the role of individuals as team players and also as responsible leaders materializes to a great
extent. The course, with its interactive and need based modules, will address various challenges
of communication as well as behavioral skills faced by individuals at workplace and
organizations in bridging the gaps through effective skills of interviews, group discussions,
meeting management, presentations and nuances of drafting various business documents for
sustainability in today‘s global world.
MODULE-1: INTRODUCTION
Introduction to Soft Skills, Aspects of Soft Skills, Effective Communication Skills, Classification
of Communication, Personality Development
Positive Thinking, Telephonic Communication Skills, Telephonic Communication Skills,
Communicating Without Words, Paralanguage, Proxemics, Haptics: The Language of Touch,
Meta-communication, Listening Skills, Types of Listening, Negotiation Skills , Culture as
Communication, Communicating across Cultures , Organizational Communication.
Structure of Report, Report Style, Group Communication Skills, Leadership Skills, Group
Discussion, Meeting Management, Adaptability & Work Ethics.
133 | P a g e
Advanced Speaking Skills, Oral Presentation, Speeches & Debates, Combating Nervousness,
Patterns & Methods of Presentation, Oral Presentation: Planning & Preparation
134 | P a g e
CODE: OEC-CS-601(II)
NO OF CREDITS: 3
MODULE- 1: INTRODUCTION
Computers and its Impact in Society, Overview of Computer and Web Technology, Need for
Cyber Law, Cyber Jurisprudence at International and Indian Level
Cyber Crimes against Individuals, Institution and State, Hacking, Digital Forgery, Cyber
Stalking/Harassment, Cyber Pornography, Identity Theft &Fraud, Cyber terrorism, Cyber
Defamation, Different offences under IT Act, 2000
Cyber Defamation, Different Types of Civil Wrongs under the IT Act, 2000
Interface with Copyright Law, Interface with Patent Law, Trademarks & Domain Names Related
issues
135 | P a g e
MODULE- 7: E-COMMERCE CONCEPT
E-commerce-Salient Features, Online approaches like B2B, B2C & C2C Online contracts, Click
Wrap Contracts, Applicability of Indian Contract Act, 1872
Concept of Jurisdiction, Indian Context of Jurisdiction and IT Act, 2000, International Law and
Jurisdictional Issues in Cyberspace, Dispute Resolutions, Information warfare policy and ethical
Issues.
References:
Chris Reed & John Angel, Computer Law, OUP, New York, (2007).
Justice Yatindra Singh, Cyber Laws, Universal Law Publishing Co, New Delhi, (2012)
Verma S, K, Mittal Raman, Legal Dimensions of Cyber Space, Indian Law Institute, New
Delhi, (2004)
JonthanRosenoer, Cyber Law, Springer, New York, (1997).
Sudhir Naib, The Information Technology Act, 2005: A Handbook, OUP, New York, (2011)
S. R. Bhansali, Information Technology Act, 2000, University Book House Pvt. Ltd., Jaipur
(2003).
Vasu Deva, Cyber Crimes and Law Enforcement, Commonwealth Publishers, New Delhi,
(2003).
136 | P a g e
CODE: PCC-IT- 601
NO OF CREDITS: 3
137 | P a g e
arrays, NumPy array attributes, Converting arrays, Creating array views and copies. Indexing
with a list of locations. Indexing NumPy arrays with Booleans. Broadcasting NumPy arrays.
MODULE-5: DATA MANIPULATION AND VISUALIZATION IN PYTHON
Data frames in panda, Creatingdataframes from .csv and excel files, Lists of tuples, Dataframes
aggregation and concatenation, plotting data using matplotlib & panda
Course Outcomes:
REFERENCES:
1. Wesley J Chun, Core Python Programming, Prentice Hall, Second Edition, 2006
2. Ivan Idris, Python Data Analysis, PacktPublishing,UK, 2014 (freely available online)
3. Wes McKinney, Python for Data Analysis, O‟Reilly - 2013
138 | P a g e
CODE: OEC-CS-601(IV)
SUBJECT NAME: ELECTRONIC DEVICES
NO OF CREDITS: 3
B.TECH 6th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL: 100
Course Outcomes:
At the end of this course students will demonstrate the ability to
1. Understand the principles of semiconductor Physics
139 | P a g e
2. Understand and utilize the mathematical models of Semiconductor junctions and 1. MOS
transistors for circuits and systems.
3. Understand various Semiconductor, fabrication process.
4. Understand the design & characteristics of Semiconductor devices.
REFERENCES:
140 | P a g e
CODE: OEC-CS-601(V)
SUBJECT NAME: DIGITAL SYSTEM DESIGN
NO OF CREDITS: 3
B.TECH 6th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL: 100
Pre-requisites:
Course objectives:
1. To study the concept of combinational logic circuits
2. To make the student aware about modular combinational circuits with MUX/DEMUX,
Decoder, Encoder
3. T o understand the synchronous sequential logic circuits
4. To study Logic families and semiconductor memories.
5. To study VLSI design flow.
Review of Boolean Algebra and De Morgan‘s Theorem, SOP & POS forms, Canonical forms,
Karnaugh maps up to 6 variables, Binary codes, Code Conversion.
Comparators, Multiplexers, Encoder, Decoder, Driver & Multiplexed Display, Half and Full
Adders, Subtractors, Serial and Parallel Adders, BCD Adder, Barrel shifter and ALU
Building blocks like S-R, JK and Master-Slave JK FF, Edge triggered FF, Ripple and
Synchronous counters, Shift registers, Finite state machines, Design of synchronous FSM,
Algorithmic State Machines charts. Designing synchronous circuits like Pulse train generator,
Pseudo Random Binary Sequence generator, Clock generation
141 | P a g e
TTL NAND gate, Specifications, Noise margin, Propagation delay, fan-in, fan-out, Tristate TTL,
ECL, CMOS families and their interfacing, Memory elements, Concept of Programmable logic
devices like FPGA. Logic implementation using Programmable Devices.
Design entry: Schematic, FSM & HDL, different modeling styles in VHDL, Data types and
objects, Dataflow, Behavioral and Structural Modeling, Synthesis and Simulation VHDL
constructs and codes for combinational and sequential circuits.
Course Outcomes:
At the end of this course students will demonstrate the ability to
1. Design and analyze combinational logic circuits
2. Design &analyze modular combinational circuits with MUX/DEMUX, Decoder, Encoder
3. Design &analyze synchronous sequential logic circuits
4. Use HDL & appropriate EDA tools for digital logic design and simulation
REFERENCES:
1. R.P. Jain, “Modern digital Electronics”, Tata McGraw Hill, 4th edition, 2009.
Douglas Perry, “VHDL”, Tata McGraw Hill, 4th edition, 2002.
2. W.H. Gothmann, “Digital Electronics- An introduction to Theory and Practice”, PHI,
2nd edition ,2006.
3. D.V. Hall, “Digital Circuits and Systems”, Tata McGraw Hill, 1989
4. Charles Roth, “Digital System Design using VHDL”, Tata McGraw Hill 2nd edition
2012.
142 | P a g e
CODE: OEC-CS-602(I)
NO OF CREDITS: 3
B.TECH 6th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL: 100
Course objectives:
The primary concern of this course is to sensitize students to the various facts of managing
people and to create an understanding of the various policies and practices of human resource
management.
MODULE-1:
Human Resource Management: concept, evolution and scope; Strategic objectives of HR
management; Roles, responsibilities and competencies of HR manager; Challenges to HR
professionals; Human Resource Planning & Forecasting: significance and process; Human
Resource Information System.
MODULE-2:
HR Sourcing and Recruitment; Selection: process, Placement; Induction and Socialization.
Job Analysis: job Description and job Specification; Job Design: approaches and methods; Job
Evaluation-concept & methods; Performance Management System: appraisal and counselling.
MODULE-3:
Training: training process, training need analysis (TNA); training methods and techniques;
Designing Training programs; Training evaluation; Career planning and Development; Potential
Appraisal and Succession planning; Employee Compensation: basic concepts & determinants;
New trends in compensation management.
MODULE-4:
Industrial Relations and Grievance Handling; Employee welfare; Dispute Resolution;
International Human Resource Management; Contemporary Issues in HRM: knowledge
Management, HR Audit &Accounting, HR in virtual organizations, ethics &corporate social
responsibility.
Course Outcomes:
1. The course will help to understand the basics of HRM with roles and responsibilities of a
143 | P a g e
HR manager.
2. This course enables the students to meet HR challenges in present scenario
3. It will facilitate them in employing, maintaining and promoting a motivated force in an
organization.
4. Students will be aware about contemporary issues of human resource management.
RERERENCES:
1. K. Aswathapa Human resource Management: Text and cases, 6 th edition, Tata
McGraw Hill, New Delhi.
2. Uday Kumar Haldar&JuthikaSarkarHuman resource Management New Delhi,
Oxford University Press.
3. De Cenvo, Da & Robbins S.P. Fundamentals of Human Resource Management, 9 th
edition, New York, John Wiley & Sons.
4. Gary Dessler, Human Resource Management, 11th edition New Delhi: Pearson
Prentice Hall.
5. TanujaAgarwala, Strategic Human resource Management, Oxford University Press
144 | P a g e
CODE: OEC-CS-602(II)
NO. OF CREDITS: 3
MODULE-1: INTRODUCTION
The hardware and software, the physical infrastructure, satellite, wireless solutions,
telecommunication technologies, mobiles, fixed line, internet and world wide web, community
radio, technology-user interface, design of relevant ICT products and services.
145 | P a g e
MODULE-4: ICT APPLICATIONS
Policy and Institutional Framework in India, e governance, ICT Models in health, education,
agriculture, finance, gender equality, Mobiles for Development Experience sharing by ICT for
Development practitioners Case Studies: Reuters Market Light, IffcoKisaan Sanchar Ltd.
Developing an ICT4D Project, Critical Success factors for technology diffusion and use,
Constraints in adoption, The role of national policies, Institutional Policy framework, Multi-
stakeholder partnerships, Role of Private Sector Case Studies: echaupal , Lifelines India.
Course Outcomes:
1. Students will be familiarized with main theories and conceptual frameworks in the field
of ICT for development
2. Students will learn potential of both information and communication technologies in
different areas such as health, education, agriculture, finance, gender equality and climate
change.
3. Students will be able to understand the existing innovative business models and other
applications in the above mentioned areas with reference to India and other developing
countries
4. Students will be able to compare and contrast various business models (public, private
sector, PPP, civil society) with respect to technology, infrastructure, capacity building,
human resource etc.
5. Students will be able to learn how ICT models can be successfully implemented at the
field and understand critical success factors and constraints in adoption.
REFERENCES
146 | P a g e
CODE: OEC-CS-602(III)
NO OF CREDITS: 3
1. To make the student aware about Intellectual Property and why it is important
2. To study the concept of Patents, history of patent and its categorization.
3. To learn the procedure of obtaining Patents.
4. To make the student learn Assignment and Revocation of Patent
5. To study the concept of infringement and its defence.
147 | P a g e
What is Infringement?, How is Infringement determined? Who is an Infringer?, Direct,
Contributory and Induced, Defences of Infringement: Research Exemption, Invalidity, Misuse,
Failure to mark, Laches and Estoppel and first sale doctrine
Course Outcomes:
After completion of the course student will be able to:
1. Understand the concept of Intellectual Property and its importance.
2. Understand Patents, categorization and procedure for obtaining patents.
3. Understand the commercialization of invention
4. Understand the concept of infringement and its defence.
REFERENCES:
148 | P a g e
CODE: OEC-CS-602(IV)
NO OF CREDITS: 3
MODULE-1:
International business environment; Concept of international business; domestic vs international
business, stages of internationalization, tariff and non-tariff barriers,Risks involved in
international business
MODULE-2:
Theories of international trade: Adam Smith, Ricardo and Ohlin & Heckler theory, Leontif
paradox, PLC
MODULE-3:
International Monetary Systems: Historical background and structure. International Financial
institutions; IMF, World Bank, Euro Currency.International financial markets and instruments.
MODULE-4:
Free trade zones.Bilateral and Multilateral Trade Laws – General Agreement on Trade and
Tariffs, (GATT), World Trade Organization – IPR, TRIPS, TRIMS, GATS. Regional Economic
Integrations: NAFTA, EU. Trade Blocks; ASEAN, SAAARC, BRICS
Course Outcomes:
1. The student will be aware of the international organizations in which India is a member
or otherwise.
2. The students may take opportunity to take their business from domestic to international.
3. International organizations and their links to India will be understood by students in an
easy manner.
4. The students will be aware business environment at international level
149 | P a g e
RERERENCES:
1. Lasserre, Philippe Global Strategic Management, Palgrave MacMillan.
2. John D Daniels, Lee H Radebaugh Daniel P Sullivan ,Prashant Salwan.
International Business Environments and Operations, Pearson Education
3. Tamer Cavusgil, Gary Knight International Business: Strategy, Management and
the New Realities, 1st Edition, Pearson Education.
4. K Aswathappa, International Business, Tata Mcgraw Hill.
5. Richard Hodgetts, Fred Luthans, Jonathan Doh. International Management:
Culture, Strategy And Behaviour, Pearson Education.
6. Deresky, International Management: Managing across borders and culture.
Pearson Education.
7. Nandi : “International Business Environment” McGraw Hill Education.
150 | P a g e
CODE: OEC-CS-602(V)
NO OF CREDITS: 3
1. To introduce the student with Different types of OR Models and Linear Programming
Model
2. To introduce the students about Dual Sensitive Method and Sensitive Analysis.
3. To introduce the concept of Assignment Problem.
4. To introduce the students with Network Model
5. To introduce the concept of Dynamic Programming and Queuing Model.
MODULE-1:
The origin of OR, Phases of an O.R. study, Impact of OR, Formulation of Linear-programming
model, Graphical solution. Converting the linear programming problem to standard form,
Simplex method.
MODULE-2:
Big-M method, Two-phase method, Degeneracy, Alternate optima, unbounded and infeasible
solution.
MODULE-3:
Definition of the dual problem, prima-dual relationship, Dual Simplex method, Post optimal and
sensitivity analysis.
MODULE-4:
Assignment problem and its mathematical formulation, solution of assignment problem
(Hyngarian method), Transportation problem and its mathematical formulation. Initial basic
feasible solution of transportation problem by North-West corner rule. Lowest-Cost Entry
method and Vogel‘s Approximation method, Optimal solution of transportation problem.
MODULE-5:
Network models, Minimal spanning tree algorithm, Shortest-route problem (Floyd‘s Algorithm
and Dijkstras algorithm), Maximal flow problem, Introduction to CPM & PERT.
151 | P a g e
MODULE-6:
Introduction to Dynamic Programming, General inventory Model, Static Economic Order
Quantity (EOQ) Models.
MODULE-7:
Elements of a Queuing model, Pure Birth & Death model, Generalized Poisson Queuing,
Specialized Poisson Queues.
Course Outcomes:
After completion of the course student will be able to:
1. Understand different types of OR Model and solve Linear programming problems.
2. Understand dual simplex problem and sensitive analysis.
3. Solve Assignment problem.
4. Understand Dynamic Programming and Queuing Model.
REFERENCES:
152 | P a g e
CODE: OEC-CS-701(I)
NO OF CREDITS: 3
To develop understanding among the students regarding nature of finance and its interaction with
other Management functions and the objectives of Financial Management.
MODULE-1:
MODULE-2:
MODULE-3:
MODULE-4:
Working Capital- meaning, need, determinants; estimation of working capital need; management
of cash, inventory and receivables.
Course Outcomes:
1. It creates understanding among the students regarding the key decisions like Investment,
Financing and dividend Decisions of financial Management.
2. They are able to understand the usage and applications of leverages in financial decisions.
3. The students are able to use their best knowledge in finance towards the value creation
for the organization.
153 | P a g e
4. The students will be made aware of working capital management concept.
RERERENCES:
1. Pandey, I.M., “Financial Management”, Vikas Publishing House, New Delhi
2. Khan M.Y, and Jain P.K., “Financial Management”, Tata McGraw Hill, New
Delhi
3. Keown, Arthur J., Martin, John D., Petty, J. William and Scott, David F,
“Financial Management”, Pearson Education
4. Chandra, Prasanna, “Financial Management”, TMH, New Delhi
5. Van Horne, James C., “Financial Management and Policy”, Prentice Hall of India
6. Brigham & Houston, “Fundamentals of Financial Management”, Thomson
Learning, Bombay.
7. Kishore, R., “Financial Management”, Taxman‟s Publishing House, New Delhi
154 | P a g e
CODE: OEC-CS-701(II)
NO OF CREDITS: 3
Need, importance, Business models, revenue models and business processes, economic forces &
e-commerce, identifying e-commerce opportunities, international nature of e-commerce,
technology infrastructure-internet & WWW; Business strategies for ecommerce: Revenue
models in transaction, revenue strategic issues, customer behavior and relationship intensity,
advertising on the web, e-mail marketing, technology enabled CRM
(Overview strategic methods for Developing E-Commerce) Purchasing, logistics and supply
activities, electronic data interchange (EDI), electronic data interchange on the internet, supply
chain management using internet technologies, electronic market place & portals (Home
shopping, E-marketing, Tele marketing), auctions, online auctions, virtual communicative & web
portals; legal, and ethical issues in e-commerce — use and protection of intellectual property in
online business, online crime, terrorism & warfare, ethical issues.
MODULE-3: ENTREPRENEURSHIP
Definition, Concept, Growth and role. The Entrepreneur: types, Characteristics, theories of
Entrepreneurial class, Urges and importance of Entrepreneurship Stimulants; Seed-Beds of
Entrepreneurship, Influencing Factors; Problems (Operational and Non-Operational) and
Obstacles. Entrepreneurial Management. Role of socio-economic environment
155 | P a g e
MODULE-4:
Skills for a New Class of Entrepreneurs, The Ideal Entrepreneurs, The Entrepreneurship Audit,
Identification of opportunities by an Entrepreneur, The steps to identify the project /ventures,
Process of converting business opportunities into reality. Feasibility Report and analysis, Process
of setting up a small scale industry / unit
MODULE-5:
Course Outcomes:
1. The students will be able to understand the basic concepts of electronic transactions.
2. Study of various types of business models and customer relationship management.
3. Students will be able to understand about various business strategies and marketing
strategies.
4. Study of various legal and ethical issues related to electronic transactions.
5. Study of intellectual property rights and its importance.
6. Study of Entrepreneurship management
7. Study of analyzing the external environment, the competition and designing the
framework for establishing a venture capital.
8. Study of business intelligence and knowledge management tools.
REFERENCES:
156 | P a g e
CODE: OEC-CS-701(III)
NO OF CREDITS: 3
Course Objectives:
1. Understand what R is and what it can be used for
2. Why would you choose R over another tool
3. Troubleshoot software installs (keep your fingers crossed)
4. Gain familiarity with using R from within the RStudio IDE
5. Get to know the basic syntax of R functions
6. Be able to install and load a package into your R library
MODULE-1: INTRODUCTION
Getting R, R Version, 32-bit versus 64-bit, The R Environment, Command Line Interface,
RStudio, Revolution Analytics RPE
R Packages: Installing Packages, Loading Packages, Building a Package
R Basics: Basic Math, Variables, Data Types, Vectors, Calling Functions, Function
Documentation, Missing Data
Advanced Data Structures: data frames, Lists, Matrices, Arrays
MODULE-2: R DATA
Reading Data into R: Reading CSVs, Excel Data, Reading from Databases, Data from Other
Statistical Tools, R Binary Files, Data Included with R, Extract Data from Web Sites
Statistical Graphics: Base Graphics, ggplot2
157 | P a g e
MODULE-4: DATA MANIPULATION
Group Manipulation: Apply Family, aggregate, plyr, data.table
Data Reshaping: cbind and rbind, Joins, reshape2
Manipulating Strings: paste, sprint, Extracting Text, Regular
REFERENCES:
1. Jared P. Lander, R for Everyone: Advanced Analytics and Graphics, Pearson Edu.
Inc.
2. Christian Heumann, Michael Schomaker and Shalabh, Introduction to Statistics
and Data Analysis - With Exercises, Solutions and Applications in R , Springer,
2016
3. Pierre Lafaye de Micheaux, Rémy Drouilhet, Benoit Liquet, The R Software-
Fundamentals of Programming and Statistical Analysis, Springer 2013
4. By Alain F. Zuur, Elena N. Ieno, Erik H.W.G. Meesters, A Beginner's Guide to R
(Use R) Springer 2009
158 | P a g e
CODE: OEC-CS-701(IV)
NO OF CREDITS: 3
MODULE-1:
Introduction, Distributed vs Central Station Generation
Sources of Energy such as Micro-turbines
Internal Combustion Engines.
MODULE-2:
Introduction to Solar Energy, Wind Energy, Combined Heat and Power
Hydro Energy, Tidal Energy, Wave Energy
Geothermal Energy, Biomass and Fuel Cells.
MODULE-3:
Power Electronic Interface with the Grid
MODULE-4:
Impact of Distributed Generation on the Power System
Power Quality Disturbances
MODULE-5:
Transmission System Operation
Protection of Distributed Generators
Economics of Distributed Generation
Course Outcomes:
After completion of the course,Students will be able to:
1. Gain knowledge about renewable energy
159 | P a g e
2. Understand the working of distributed generation system in autonomous/grid connected
modes
3. Know the Impact of Distributed Generation on Power System
REDERENCES:
1. Ranjan Rakesh, Kothari D.P, Singal K.C, “Renewable Energy Sources and Emerging
Technologies”, 2nd Ed. Prentice Hall of India ,2011
2. Math H. Bollen, Fainan Hassan, “Integration of Distributed Generation in the Power
System”, July 2011,Wiley –IEEE Press
3. Loi Lei Lai, Tze Fun Chan, “Distributed Generation: Induction and Permanent Magnet
Generators”, October 2007, Wiley-IEEE Press.
4. Roger A. Messenger, Jerry Ventre, “Photovoltaic System Engineering”, 3rd Ed, 2010
5. James F. Manwell, Jon G.McGowan, Anthony L Rogers, “Wind energy explained: Theory
Design and Application”, John Wiley and Sons 2nd Ed, 2010
160 | P a g e
CODE: OEC-CS-702(I)
NO OF CREDITS: 3
The candidates at the post-graduate level are expected to analyze various issues pertaining to
India‘s economic development. The performance of the economy is to be assessed on the
backdrop of various Five Year Plans implemented in the economy. Wherever possible, critical
appraisal is expected by taking cognizance of the contemporary developments in the economy.
161 | P a g e
Indian Financial System- issues of Financial Inclusion, Financial Sector Reforms-review
of Monetary Policy of R.B.I. Capital Market in India.
MODULE-4: THE ECONOMIC POLICY AND INDUSTRIAL SECTOR
REFERENCES
162 | P a g e
CODE: PEC-IT-I-703
SUBJECT NAME: BASICS OF CLOUD COMPUTING
NO OF CREDITS: 3
B.TECH 7th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Course objectives: The student will learn how to apply
Online Social Networks and Applications, Cloud introduction and overview, Different clouds,
Risks, Novel applications of cloud computing .
Infrastructure Security, Infrastructure Security: The Network Level, The Host Level, The
Application Level, Data Security and Storage, Aspects of Data Security, Data Security
Mitigation Provider Data and Its Security Identity and Access Management Trust Boundaries
and IAM, IAM Challenges, Relevant IAM Standards and Protocols for Cloud Services, IAM
Practices in the Cloud, Cloud Authorization Management
163 | P a g e
Security Management Standards, Security Management in the Cloud, Availability Management:
SaaS, PaaS, IaaS Privacy Issues Privacy Issues, Data Life Cycle, Key Privacy Concerns in the
Cloud, Protecting Privacy, Changes to Privacy Risk Management and Compliance in Relation to
Cloud Computing, Legal and Regulatory Implications, U.S. Laws and Regulations, International
Laws and Regulations
Course Outcomes:
After completion of course, students would be able to:
1. Identify security aspects of each cloud model
2. Develop a risk-management strategy for moving to the Cloud
3. Implement a public cloud instance using a public cloud service provider
REFERENCES:
1. Gautam Shroff, ―Enterprise Cloud Computing Technology Architecture Applications‖,
Cambridge University Press; 1 edition, [ISBN: 978-0521137355], 2010.
2. Kai Hwang, Geoffrey C. Fox, Jack J. Dongarra, ―Distributed and Cloud Computing:
From parallel processing to IOT‖ Morgan Kaufmann Publishers; 1 edition [ISBN: 978-0-
12-385880], 2012.
164 | P a g e
CODE: OEC-CS-702 (III)
NO OF CREDITS: 3
1. To make students familiar with SONET and SDH Architecture and add Drop
Multiplexer.
2. To make students aware of wavelength division multiplexing techniques.
3. To introduce T-Carrier multiplexed hierarchy.
4. To introduce features of SONET and SDH.
4. To study about LDP protocol in detail
MODULE-2:SONET ARCHITECTURES
SONET integration of TDM signals, SONET electrical and optical signals, SONET Layers,
SONET framing, SONET transport overhead, SONET alarms, multiplexing, virtual tributaries,
SONET network elements, SONET topologies, SONET protection mechanisms, APS, two-fiber
UPSR, DRI, and two-fiber and four-fiber BLSR rings. SPR,RPR
MODULE-3:SDH ARCHITECTURES
SDH integration of TDM signals, SDH electrical and optical signals, SDH Layers, SDH framing,
SDH higher layer graming, SDH transport overhead, SDH alarms, multiplexing, virtual
containers, SDH network elements, SDH topologies, SDH protection mechanisms, APS, 1+1
protection, 1:1protection, 1:N protection, Unidirection v/s bidirectionsl rings, Path and multiplex
section switching, Subetwork Connection protection rings, DRI, and two-fiber and four-fiber
Multiplex section-shared protection rings,
165 | P a g e
MODULE-4:WAVELENGTH-DIVISION MULTIPLEXING
The Label Distribution Protocol (LDP), Label Spaces, LDP Sessions, and Hello Adjacencies ,
The LDP PDU Format, The LDP Message Format, The LDP Messages, The Multi-Protocol
Label Switching (MPLS) Architecture, Label Allocation Schemes, The Next Hop Label
Forwarding Entry (NHLFE), Explicit Routing, An Example of the Use of the Label Stack,
Schemes for Setting up an LSP
Course Outcomes:
Upon successful completion of the course, the student will be able to understand
1. SONET and SDH Architecture.
2. wavelength and time division multiplexing techniques.
3. SONET and SDH frames and their architectures
4. LDP protocol in detail.
REFERENCES
166 | P a g e
CODE: OEC-CS-702(IV)
SUBJECT NAME: HIGH SPEED NETWORK
NO OF CREDITS: 3
B.TECH 7th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Course Objectives:
Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture, ATM
logical Connection, ATM Cell – ATM Service Categories – AAL.High Speed LANs: Fast
Ethernet, Gigabit Ethernet, Fiber Channel – Wireless LANs: applications, requirements –
Architecture of 802.11
167 | P a g e
MODULE-5: PROTOCOLS FOR QOS SUPPORT
RSVP – Goals & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms –
Multiprotocol Label Switching – Operations, Label Stacking, Protocol details – RTP – Protocol
Architecture, Data Transfer Protocol, RTCP.
Course outcomes:
1. Students will be able to understand basic high speed networks like Frame relay and
ATM.
2. Students will be familiar with advantages and disadvantages of high speed network.
3. Students will be aware of congestion control traffic management techniques.
4. Students will be aware of TCP and ATM congestion control techniques.
5. To learn the functionality of integrated and differentiated services architecture.
6. Familiarity with various high speed protocols currently available.
REFERENCES
168 | P a g e
DETAILED 4-YEAR CURRICULUM CONTENTS
169 | P a g e
CODE:HSMC (H-102)
NO OF CREDITS: 0
Course Objectives:
This course also discusses their role in their family. It, very briefly, touches issues related to their
role in the society and the nature, which needs to be discussed at length in one more semester for
which the foundation course named as ―H-102 Universal Human Values 2: Understanding
Harmony‖ is designed which may be covered in their III or IV semester. During the Induction
Program, students‘ world get and initial exposure to human values through Universal Human
Values –I. This exposure is to be augmented by this compulsory full semester foundation course.
1. Purpose and motivation for the course, recapitulation from Universal Human Values-I
2. Self-Exploration–what is it? - Its content and process; ‗Natural Acceptance‘ and
Experiential Validation- as the process for self-exploration
170 | P a g e
3. Continuous Happiness and Prosperity- A look at basic Human Aspirations
4. Right understanding, Relationship and Physical Facility- the basic requirements for
fulfilment of aspirations of every human being with their correct priority
5. Understanding Happiness and Prosperity correctly- A critical appraisal of the current
scenario
6. Method to fulfil the above human aspirations: understanding and living in harmony at
various levels.
Include practice sessions to discuss natural acceptance in human being as the innate acceptance
for living with responsibility (living in relationship, harmony and co-existence) rather than as
arbitrariness in choice based on liking-disliking.
1. Understanding human being as a co-existence of the sentient ‗I‘ and the material ‗Body‘
2. Understanding the needs of Self (‗I‘) and ‗Body‘ - happiness and physical facility
3. Understanding the Body as an instrument of ‗I‘ (I being the doer, seer and enjoyer)
4. Understanding the characteristics and activities of ‗I‘ and harmony in ‗I‘
5. Understanding the harmony of I with the Body: Sanyam and Health; correct appraisal of
Physical needs, meaning of Prosperity in detail
6. Programs to ensure Sanyam and Health.
Include practice sessions to discuss the role others have played in making material goods
available to me. Identifying from one‘s own life. Differentiate between prosperity and
accumulation. Discuss program for ensuring health vs dealing with disease
171 | P a g e
Include practice sessions to reflect on relationships in family, hostel and institute as extended
family, real life examples, teacher-student relationship, goal of education etc. Gratitude as a
universal value in relationships. Discuss with scenarios. Elicit examples from students‘ lives
Include practice sessions to discuss human being as cause of imbalance in nature (film ―Home‖
can be used), pollution, depletion of resources and role of technology etc.
Include practice Exercises and Case Studies will be taken up in Practice (tutorial) Sessions eg.
To discuss the conduct as an engineer or scientist etc.
Course Outcomes:
By the end of the course, students are expected to become more aware of themselves, and their
surroundings (family, society, nature); they would become more responsible in life, and in
handling problems with sustainable solutions, while keeping human relationships and human
nature in mind. They would have better critical ability. They would also become sensitive to
172 | P a g e
their commitment towards what they have understood (human values, human relationship and
human society). It is hoped that they would be able to apply what they have learnt to their own
self in different day-to-day settings in real life, at least a beginning would be made in this
direction. This is only an introductory foundational input. It would be desirable to follow it up by
READINGS:
Text Book
1. Human Values and Professional Ethics by R R Gaur, R Sangal, G P Bagaria, Excel
Books, New Delhi, 2010
REFERENCE BOOKS
173 | P a g e
DETAILED 4-YEAR CURRICULUM CONTENTS
AUDIT COURSES
174 | P a g e
CODE:AC-02
NO OF CREDITS: 3
Course Objectives:
To enable the students to create an awareness on Message of Bhagwat Gita to instill Moral,
Social Values and to appreciate the Karma Yoga.
MODULE-2: Karma Yoga: Yoga of Action – Living in the present- Dedicated Action without
Anxiety over Results – Concept of Swadhrma, Dhyana Yoga: Tuning the Mind- Quantity,
Quality and Direction of Thoughts- Reaching Inner Silence.
MODULE-3: Bhakti Yoga: Yoga of Devotion – Form and Formless Aspects of the Divine-
Inner Qualities of a True Devotee, GanatrayaVibhaga Yoga: Dynamics of the Three Gunas:
Tamas, Rajas, Sattva- Going Beyond the Three Gunas- Description of A Gunatheetha.
Course Outcomes:
Upon completion of the course, the student should be able to realize the Relevance of Bhagavad
Gita today Yoga to devotion, realize the responsibilities and duty in the society.
REFERENCES
1. Swami Chinmayananda, : The Holy Geeta”, Central Chinmaya Mission Trust 2002.
2. Swami Chinmayananda, “ A Manual of Self Unfordment”, Central Chinmaya
Mission Trust, 2001.
175 | P a g e