B.Tech. - CSE. 2015

Computer Science Engineering
Department
Syllabus
For
B.Tech CSE
GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Teaching and Examination Scheme common for B.Tech. (Computer Science & Engineering 4 Year Course)
Session 2015-2016
Year: I B Tech I Semester
S.No. Course Nature of Course Name Credits Contact Exam Weightage
Code Course (UC/ Hrs/Wk. Hrs. (in%)
PC/
UE/PE) L T P CI ESE
E
1 MA 101 Maths I 4 3 1 0 3 40 60
2 EN 101 Professional Communication 3 3 0 0 3 40 60
3 PY 101/ Engg. Physics(ME/EE/CE)/Computer 3 3 0 0 3 40 60
CP 101 UC Programming (CS/IT/EC/Bio)
4 IT 101/ Fundamental of Computer & IT (CS/IT/EC/ 2 2 0 0 3 40 60
ES 101 Bio) / Environmental Sc. (ME/EE/CE)
5 EN 151 Professional Communication Lab 1 0 0 2 2 60 40
6 PY 151/ Engg. Physics Lab(ME/EE/CE)/Computer 1 0 0 2 2 60 40
CP 151 Programming Lab (CS/IT/EC/Bio)
7 Proficiency in Co-Curricular Activities 2 0 0 0 0 10
0
8 EE 101/ EEE/Engg. Mechanics (Except Biotech) 4 3 1 0 3 40 60
ME 101
9 EE 151/ PC EEE Lab/Workshop Practice(Except Biotech) 1 0 0 2 2 60 40
ME 153
10 Engg. Graphics (Except B.TechBioTech) 1 0 0 2 2 60 40
11 CP 153 MATLAB Programming 1 0 0 2 2 60 40
12 CP 103 Basic of MAT Lab 3 3 0 0 3 40 60
13 CY 101 Engg. Chemistry (CS/IT/EC/EE/ME) 2 2 0 0 3 40 60
14 Remedial Mathis 2 2 0 0 3 40 60
15 UE Remedial Physics 2 2 0 0 3 40 60
16 Foreign Language (German/French. Etc.) 2 2 0 0 3 40 60
17 History of Engineering & Science 1 1 0 0 2
18 CY 151 Engg. Chemistry Lab(CS/IT/EC/EE/ME) 1 0 0 2 2 60 40
Session 2015-2016
B Tech II Semester
Course Nature of Course Name Credi Contact Exa Weightage

Code Course (UC/ ts Hrs/Wk. m (in%)
PC/ Hrs.
UE/PE) L T P CIE ESE
1 MA 102 Maths II 4 3 1 0 3 40 60
2 EN 102 Communication Techniques 3 3 0 0 3 40 60
3 CP 101/ Computer Programming (ME/EE/CE)/Engg. 3 3 0 0 3 40 60
PY 101 UC Physics (CS/IT/EC/Bio)
4 ES 101/ Environmental Sc. (ME/EE/CE)/ 2 2 0 0 3 40 60

IT 101 Fundamental of Computer & IT (CS/IT/EC/Bio)
5 CP 151/ Computer Programming Lab(ME/EE/CE)/ 1 0 0 2 2 60 40

PY 151 Engg. Physics Lab (CS/IT/EC/Bio)
6 ES 101 Employability SkillsI 1 0 2 0

7 Proficiency in Co-Curricular Activities 2 0 0 0 0 100
8 ME 101/ Engg. Mechanics/EEE (Except Biotech) 4 3 1 0 3 40 60
EE 101
PC
9 ME 153/ Workshop Practice/ EEE Lab (Except Biotech)1 0 0 2 2 60 40
EE 151
11 CP 154 OOPs Lab 1 0 0 2 2 60 40
12 CP 156 Python Lab 1 0 0 2 2 60 40
13 CP 102 OOPs Concepts 3 3 0 0 3 40 60
14 CY 102 Engg. Chemistry (CS/IT/EC/EE/ME) 2 2 0 0 3 40 60
15 Remedial Mathis 2 2 0 0 3 40 60
16 UE Remedial Physics 2 2 0 0 3 40 60
17 Foreign Language (German/French. Etc.) 2 2 0 0 3 40 60
18 History of Engineering & Science 1 1 0 0 2
19 CY 152 Engg. Chemistry Lab (CS/IT/EC/EE/ME) 1 0 0 2 2 60 40
Session 2016-2017
Year: II Semester: III
S. Course Course Name Credits Contact Exam Weightage
No. Code Hrs/Wk. Hrs. (in%)
L T P CIE ESE
University Core
1 HS 201 Economics and Social Sciences 3 3 0 0 3 40 60
2 ES 102 Employability Skill 2 1 0 2 0
3 MA 203 Advance Mathis 4 3 1 0 3 40 60
4 Proficiency in Co-Curricular Activities 2 - - - - 100 -

Program Core
5 CP 201 Data Structure and Algorithm 4 3 1 0 3 40 60
6 CP 203 Principle of Programming Language 3 3 0 0 3 40 60
7 CP 251 Data Structure and Algorithm Lab 1 0 0 2 2 60 40
8 CP 255 Industrial oriented Python Project Lab 2 0 0 2+2 2 60 40
Program Elective
9 EC 223 Switching Theory & Logic Design 3 3 0 0 3 40 60
10 CP 205 Internet Programming 3 3 0 0 3 40 60
11 CP 253 Internet Programming Lab 1 0 0 2 2 60 40
12 EC 255 Digital Logic Design Lab 1 0 0 2 2 60 40
University Elective
13 EC 221 Electronics Devices and Circuits 2 2 0 0 3 60 40
14 EC 213 Medical Electronics 2 2 0 0 3 60 40
Year: II Session 2016-2017

Note:- Industrial training for 30 days after 4th Semester Exams is compulsory.

L T P CIE ESE
University Core
2 Proficiency in Co-Curricular Activities 2 0 0 0
Program Core
3 EC 212 Microprocessor and Interface 3 3 0 0 3 40 60
4 CP 202 Software Engineering 4 3 1 0 3 40 60
5 CP 204 Graph Theory and Discrete Maths 3 3 0 0 3 40 60
6 CP 206 Core Java 4 3 1 0 3 40 60

7 EC 213 Microprocessor Lab 1 0 0 2 2 60 40
8 CP 254 Industrial oriented Core Java Project Lab 2 0 0 2+2 2 60 40
9 CP 258 Design Practice with UML Lab 1 0 0 2 2 60 40
Program Elective
10 MA 204 Introduction to Probability Theory & Stochastic 3 3 0 0 3 40 60
Processes
11 CP 208 Open Source Technology 3 3 0 0 3 40 60
12 CP 217 E-Commerce 3 3 0 0 3 40 60
13 CP 256 Open Source Technology Lab (UNIX) 1 0 0 2 2 60 40
University Elective
14 EC 210 Telecomm Engineering Fundamentals 2 2 0 0 3 60 40
15 CP 209 Business Eonomics 2 2 0 0 3 60 40
16 **** Fundamental of Optical Communication 2 2 0 0 3 60 40
17 **** Communication Lab 1 0 0 2 2 60 40
Session 2017-2018
Year: III
Semester: V
L T P CIE ESE
University Core
2 PTS 101 Practical Training Seminar I 1 - - 2 2 60 40
3 Proficiency in Co-Curricular Activities 2 - - - 100
Program Core
4 CP 301 Database Management System 4 3 1 - 3 40 60
5 CP 302 Computer Architecture 3 3 0 0 3 40 60
6 CP 307 Computer Graphics 3 3 0 0 3 40 60
7 CP 305 Web Technology 3 3 0 0 3 40 60
8 CP 352 Computer Architecture Lab 1 - - 2 2 60 40
9 CP 353 DBMS Lab 1 - - 2 2 60 40
10 CP 355 Industrial oriented Web Programming Project Lab 2 - - 2+2 2 60 40
Program Elective
11 CP 309 Logical & Functional Programming 3 3 0 0 3 40 60
12 CP 311 Advance Data Structure 3 3 0 0 3 40 60
13 CP 313 Computational Complexity 3 3 0 0 3 40 60
14 CP 357 Advance Data Structure Lab 1 - - 2 2 60 40
University Elective
15 ***** Material Science 2 2 - - 3 40 60
16 CP 210 Management Information System 2 2 - - 3 40 60
Year: III Session 2017-2018 Semester: VI
Note:- Industrial training for 45 days after 6th Semester Exams is compulsory.
L T P CIE ESE
University Core
1 ES 105 Employability Skills 5 1 0 2 0
Program Core
3 CP 308 Design Analysis & Algorithm 4 3 1 - 3 40 60
4 CP 304 Theory of Computation 4 3 1 - 3 40 60
5 CP 306 Computer Network 3 3 - - 3 40 60
6 CP 411 Multi Media System 3 3 - - 3 40 60
7 Major Project (Stage I) 3 - - 5 2 60 40

8 CP 354 Computer Network Lab 1 - - 2 2 60 40
9 CP 358 Android Lab 1 - - 2 2 60 40
Program Elective
10 CP 310 System Software Engineering 3 3 - - 3 40 60
11 CP 318 Mobile Computing 3 3 - - 3 40 60
12 CP 312 Data Mining & Data Warehouse 3 3 - - 3 40 60
13 CP 356 System Software Engineering Lab 1 - - 2 2 60 40
University Elective
14 CP 314 Simulation Modelling 2 2 - - 2 40 60
15 CP 316 Bioinformatics 2 2 - - 2 40 60
16 CP 360 Network Simulation Lab 1 - - 2 2 60 40
Year: IV Session 2018-2019 Semester: VII

L T P CIE ESE
University Core
1 ES 106 Employability Skills 6 1 0 2 0
2 Practical Training Seminar II 1 - - 2 2 60 40
Program Core
4 CP 407 Artificial Intelligence 4 3 1 - 3 40 60
5 CP 413 Digital Image Processing 3 3 - - 3 40 60
6 CP 405 Operating System 4 3 1 - 3 40 60
7 CP 408 Distributed System 3 3 - - 3 40 60

8 .NET Lab 1 - - 2 2 60 40
9 CP 455 Operating System Lab 1 - - 2 2 60 40
11 Major Project (Stage II) 4 - - 8 2 60 40

Program Elective
12 CP 409 Real Time System 3 3 - - 3 40 60
13 CP 417 Cyber Law 3 3 - - 3 40 60
14 CP 401 Asynchronous Transmission Mode 3 3 - - 3 40 60
15 CP 453 X windows Lab 1 - - 2 2 60 40
University / Open Elective
16 EC 312 Introduction to Wireless Network 2 2 - - 3 40 60
17 EC 417 Signal & system 2 2 - - 3 40 60
18 EC 419 Logic Synthesis 2 2 - - 3 40 60
19 CE 401 Operation and Production Management 2 2 - - 3 40 60
20 EC 457 Digital Hardware Design Lab 1 - - 2 2 60 40
Year: IV Session 2017-2018 Semester: VIII

L T P CIE ESE
University Core
1 HS 404 Intellectual Property Right 2 2 - - 3 40 60
2 B.Tech seminar 1 - - 2 2 60 40
Program Core
3 CP 402 Information & Network Security System 3 3 - - 3 40 60
4 CP 408 Advance Computer Architectures 3 3 - - 3 40 60
5 CP 404 Compiler Construction 4 3 1 - 3 40 60

6 CP 412 Cloud Computing 3 3 - - 3 40 60
7 CP 458 System Security Lab using MATLAB 1 - - 2 2 60 40
8 CP 452 Compiler Lab 1 - - 2 2 60 40
9 CP 460 Industrial oriented PHP Project Lab 2 - - 2+2 2 60 40
Program Elective
10 CP 416 Soft Computing 3 3 - - 3 40 60
11 CP 418 Data Compression Technique 3 3 - - 3 40 60
12 CP 414 Embedded System 3 3 - - 3 40 60

13 CP 420 Parallel Computing 3 3 - - 3 40 60
14 CP 410 Fault tolerant System 3 3 - - 3 40 60
15 Cp 454 Advance Computer Architectures Lab 1 - - 2 2 60 40
University / Open Elective
16 EC 418 CAD for VLSI Design 2 2 - - 3 40 60
17 CP 422 Natural Language Processing 2 2 - - 3 40 60
18 EC 458 CAD for VLSI Design Lab 1 - - 2 2 60 40
GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY

st
B. Tech. / Dual Degree Program 1 Year (Common to All Branches)
LIST OF COURSES OFFERED
Course code Course Name Credits Contact Exam Weightage

Hrs/Wk. Hrs. (in%)
L T/S P CE ESE
CP 101 Computer Systems & Prog. 3 3 0 0 3 40 70
CP 102 C++ 3 3 0 0 3 40 70
CP 103 Basic of MAT Lab 3 3 0 0 3 40 70
CP 151/152 Computer Programming Lab 1 0 0 2 2 60 40
CP 154 OOPS Lab 1 0 0 2 2 60 40
CP 153 MATLAB Programming 1 0 0 2 2 60 40
CP 156 Python Lab 1 0 0 2 2 60 40
EE 101/102 Electrical & Electronics Engineering 4 3 1 0 3 40 70
EE 151/152 Electrical & Electronics Engg. Lab 1 0 0 2 2 60 40
IT 101/102 Information Technology 2 2 0 0 3 40 70
ME 101/102 Engg. Mechanics 4 3 1 0 3 40 70
ME 151/152 Auto CAD Lab 1 0 0 2 2 60 40
ME 153/154 Workshop Practice 1 0 0 2 2 60 40
EN 101 Engineering English 3 3 0 0 3 40 70
EN 102 Communication Techniques 3 3 0 0 3 40 70
EN 151 English Communication Lab 1 0 0 2 2 60 40
EN 152 Language Lab 1 0 0 2 2 60 40
MA 101 Engineering Mathematics- I 4 3 1 0 3 40 70
MA 102 Engineering Mathematics- II 4 3 1 0 3 40 70
PY 101/102 Engg. Physics 4 3 1 0 3 40 70
PY 151/152 Engg.Physics Lab 1 0 0 2 2 60 40
CY 101/102 Engg. Chemistry 4 3 1 0 3 40 70
CY 151/152 Engg. Chem. Lab 1 0 0 2 2 60 40
ES 101/102 Environmental Studies 2 2 0 0 3 40 70
DC 101/102 Discipline and Co- Curricular 2 0 0 0 0 100 0
Activities - II
Department Of Computer Science and Engineering
List Of Subjects
Sr. Credits Contact Hrs Exam Hrs. Weightage
No. Sub.Code Subject Name /Wk. (in%)
L T/S P CE ESE
CP 201 Data Structure & Algorithms 4 3 1 - 3 40 60

1
CP 202 Software Engineering 3 3 - - 3 40 60
2
CP 203 Principles of Programming Language 3 3 - - 3 40 60
3
CP 204 Graph Theory and Discrete Maths 3 3 - - 3 40 60
CP 205 Internet Programming 3 3 - - 3 40 60
4
CP 206 Core JAVA 3 3 - - 3 40 60
5
CP 208 Open Source Technology 3 3 - - 3 40 60
6
CP 210 Management Information System 3 3 - - 3 40 60
7
CP 212 PATTERN RECOGNITION & 4 3 1 - 3 40 60
8 LEARNING
CP 217 E-Commerce 3 3 0 - 3 40 60
9
CP 251 Data Structure & Algorithms Lab 2 - - 2+2 3 60 40
10
CP 253 Internet Programming Lab 2 - - 2+2 3 60 40
11
CP 254 Industrial Oriented Core JAVA Project Lab 2 - - 2+2 3 60 40
12
CP 256 Open Source Technology Lab 1 - - 2 3 60 40
13
CP 258 Software Engineering Lab 1 - - 2 3 60 40
14
CP 301 Database Management System 4 3 1 - 3 40 60
15
CP 302 Computer Architecture 3 3 - - 3 40 60
16
CP 303 Discrete mathematical Structure 3 3 - - 3 40 60
17
CP 304 Theory of Computation 4 3 1 - 3 40 60
18
CP 305 Web Technology 4 3 1 - 3 40 60
19
CP 306 Computer Networks 4 3 1 - 3 40 60
20
CP 307 Computer Graphics 3 3 - - 3 40 60
21
CP 308 Design Analysis & Algorithm 4 3 1 - 3 40 60
22
CP 309 Logical & Functional Programming 3 3 - - 3 40 60
23
CP 310 System soft ware Engineering 3 3 - - 3 40 60
24
CP 311 Advance Data Structure 3 3 - - 3 40 60
25
CP 312 Data Mining & dataq warehousing 3 3 - - 3 40 60
26
CP 314 Simulation Modeling 3 3 - - 3 40 60
27
CP 316 Bio Informatics 3 3 - - 3 40 60
28
CP 351 Computer Graphics lab 1 - - 2 3 60 40
29
CP 352 Computer Architecture lab 2 - - 2+2 3 60 40
30
CP 353 Data Base Management System Lab 2 - - 2+2 3 60 40
31
CP 354 COMPUTER NETWORK Lab 1 - - 2 3 60 40
32
Industrial oriented Web Programming
CP 355 Project Lab 2 - - 2+2 3 60 40
33
CP 356 System software Lab 2 - - 2+2 3 60 40
34
CP 402 Information Network Security System 4 3 1 - 3 40 60
35
CP 403 Asynchronous Transfer Mode Networks 3 3 - - 3 40 60
36
CP 404 Advance Computer Architectures 4 3 1 - 3 40 60
37
CP 405 Operating Systems 3 3 - - 3 40 60
38
CP 406 Compiler Construction 4 3 1 - 3 40 60
39
CP 407 Artificial Intelligence 4 3 1 - 3 40 60
40
CP 408 Distributed Systems 3 3 - - 3 40 60
41
CP 409 Real Time Systems 4 3 1 - 3 40 60
42
CP 410 Fault Tolerant System 3 3 - - 3 40 60
43
CP 411 Multimedia Systems 3 3 - - 3 40 60
44
CP 414 Embedded Systems 3 3 - - 3 40 60
45
CP 415 Neural Network 3 3 - - 3 40 60
46
CP 420 Parallel Computing 4 3 1 - 3 40 60
47
CP 451 .NET Lab 1 - - 2 3 60 40
48
CP 452 Compiler Lab 2 - - 2+2 3 60 40
49
CP 453 X-Windows Lab 2 - - 2+2 3 60 40
50
CP 454 Advance Computer Architecture Lab 2 - - 2+2 3 60 40
51
CP 456 NETWORK SYSTEM SECURITY LAB 1 - - 2 3 60 40
52
CP 501 Advanced Multimedia Technology 3 3 - - 3 40 60
53
Software Quality Assurance And 4 3 1 - 3 40 60
CP 502
54 Certification
Mobile and Satellite Communication 3 3 0 - 3 40 60
55 IT 501
EC 210 Telecom Engg. Fundamentals 4 3 1 - 3 40 60
56
EC 212 Microprocessor & Interface 4 3 1 - 3 40 60
57
EC 213 Medical Electronics 3 3 - - 3 40 60
58
EC 221 Electronics Lab 3 3 - - 3 40 60
59
EC 223 Switching Theory & Logic Design 3 3 - - 3 40 60
60
EC 252 Microprocessor Lab 2 - - 2+2 3 60 40
61
EC 253 Electronic Devices & Circuits Lab 1 - - 2 3 60 40
62
EC 255 Digital Logic Design Lab 1 - - 2 3 60 40
63
EC 312 Introduction to wireless Network 3 3 - - 3 40 60
64
EC 417 Signal & System 4 3 1 - 3 40 60
65
EC 418 CAD for VLSI DESIGN 3 3 - - 3 40 60
66
EC 419 Logic Synthesis 4 3 1 - 3 40 60
67
EC 458 VLSI Design Lab 1 - - 2 3 60 40
68
MA 203 Advance Mathematics 4 3 1 - 3 40 60
69
Introduction to Probability Theory and
MA 204 Stochastic Process 4 3 1 - 3 40 60
70
HS-201 Communication Skill 3 3 - - 3 40 60
71
HS 202 Cognitive Skill 3 3 0 - 3 40 60
72
HS 204 Business Economics
73
HS 301 Verbal and non-Verbal Reasoning 3 3 - - 3 40 60
74
HS 302 Technical writing 3 3 - - 3 40 60
75
HS 401 Technical aptitude 3 3 0 - 3 40 60
76
77 HS 402 English Comprehension Module 3 3 - - 3 40 60
CP 101 COMPUTER SYSTEMS AND PROGRAMMING C (L, T, P) = 3 (3, 0, 0)
Units Contents of the Course Hours

Introduction
Types of computers and generations
I 6
Basic architecture of computers and its building blocks
Input-Output devices, Memories
Number Systems
Binary, octal, decimal and hexadecimal representation of numbers
Integers and floating point numbers
Representation of characters, ASCII and EBCDIC codes
II Binary Arithmetic: addition, subtraction, complements 7
Classification of Computer Languages
Machine, assembly and high level languages
Brief idea of operating system
Assembler, compiler and interpreter
Programming in C
Need of programming languages, Defining problems
III Flowcharts and algorithm development 8
Data types, constants, variables, operators and expressions
Input and output statements, Conditional and control statements
IV Loops (While do while for), break, goto, continue, Arrays, 2D array, user defined functions 8
V Structures and unions ; Pointers; File handling 8
Total 37
Reference books
1. Let Us c : Yaswant Kanetaker
2. Programming in c: Balaguruswami
3. Computer fundamental: P.K. Sinha
4. Programming in C: Lipschutz
5. Programming in C: Kernighan Ritchie
6. Computer System Programming : Naveen Hemrajani
CP 102 C++ C (L, T, P) = 3 (3, 0, 0)
Unit Contents of the Course Hours

Overview of C++ : Object oriented programming, Concepts, Advantages, Usage. C++ Environment:
Program development environment, the language and the C++ language standards. Prototype of
main() function, Data types.
I Array, Pointers References & The Dynamic Allocation operators : Array of objects, Pointers to object, 6
Type checking C++ pointers, The This pointer, Pointer to derived types, Pointer to class members,
References: Reference parameter, Passing references to objects, Returning reference, Independent
reference, C++ s dynamic allocation operators, Initializing allocated memory, Allocating Array,
Allocating objects.
Classes & Objects : Classes, Structure & classes, Union & Classes, Friend function, Friend classes,
Inline function, Scope resolution operator, Static class members, Static data member, Static member
II function, Passing objects to function, Returning objects, Object assignment. 7
Constructor & Destructor: Introduction, Constructor, Parameterized constructor, Multiple constructor
in a class, Constructor with default argument, Copy constructor, Default Argument, Destructor.
Inheritance : Base class Access control, Protected members, Protected base class inheritance,
Inheriting multiple base classes, Constructors, destructors & Inheritance, When constructor &
III 7
destructor function are executed, Passing parameters to base class constructors, Granting access,
Virtual base classes .
Function & operator overloading : Function overloading, Overloading constructor function finding the
address of an overloaded function, Operator Overloading: Creating a member operator function,
IV Creating Prefix & Postfix forms of the increment & decrement operation, Overloading the shorthand 7
operation (i.e. +=,-= etc), Operator overloading restrictions, Operator overloading using friend
function.
Virtual functions & Polymorphism: Virtual function, Pure Virtual functions, Early Vs. late binding
V The C++ I/O system basics : C++ streams, The basic stream classes: C++ predefined streams, 8
Formatted I/O.
Total 35
Text & Reference Books :
Herbert Schildt, C++ The Complete Reference - TMH Publication ISBN 0-07-463880-7
R. Subburaj, Object Oriented Programming With C++ , Vikas Publishing House, New Delhi.isbn 81-259-1450-1 E.
Balguruswamy, C++ , TMH Publication ISBN 0-07-462038-x
M Kumar Programming In C++, TMH Publications
R. Lafore, Object Oriented Programming C++
Ashok . N. Kamthane, Object Oriented Programming with ANSI & Turbo C++, Pearson Education Publication, ISBN 81-7808-772-3
CP 103 BASICS OF MATLAB C (L, T, P) = 3 (3, 0, 0)

Basics of MATLAB matrices and vectors, matrix and array operations.
I
Saving and loading data, plotting simple graphs

II
7
Scripts and functions, Script files, Function files, Global Variables, Loops, Branches,
III
Control flow 7
IV Advanced data objects, Multi-dimensional matrices, Structures,

7
Applications in linear algebra curve fitting and interpolation.
V Numerical integration, Ordinary differential equation. (All contents is to 8
be covered with tutorial sheets)
Total 35
Text & Reference Books :

Duane Hanselman's Mastering MATLAB 6 ISBN 0-13-019468-9, Prentice Hall,7
Getting Started With MATLAB Version 6: A Quick Introduction for Scientists and Engineers by RUDRA PATAP
published by Oxford Uni Press
CP 151/152 COMPUTER PROGRAMMING LAB C (L, T, P) = 1 (0, 0, 2)
S.No. List of Experiments

I Simple input program integer, real character and string. (Formatted & Unformatted)
II Conditional statement programs (if, if-else-if, switch-case)
III Looping Program (for, while, do-white)
IV Program based on array (one, two, and three dimensions)
V Program using structure and unions.
VI Program using Function (With and without recursion)
VII Simple programs using pointers
VIII File handling
CP 154 OBJECT ORIENTED PROGRAMMING LAB C (L, T, P) = 1 (0, 0, 2)
Write a program to find the greatest between four numbers.

Write a program to prepare mark sheet of student using structures.
Write a C program to read several different names and addresses, re-arrange the names in alphabetical order and print name in
alphabetical order using structures.
Write a program to implement concatenation of two strings using pointers.
Write a program to search a pattern in a given string.
Write a program to read add, subtract and multiply integer matrices.
Write a program to calculate the power function (mn) using the function overloading technique, implement it for power of
integer and double.
Implement file creation and operate it in different modes: seek, tell, read, write and close operations.
Using multilevel inheritance, prepare students mark sheet. Three classes containing marks for every student in three subjects.
The inherited class generate mark sheet.
Write a program to print the following output using FOR loop.
1 1
2 2 2 2
3 3 3 3 3 3
4 4 4 4 4 4 4 4
55 5 5 5 55 5 5 5
CP 15 PYTHON LAB C (L, T, P) = 1 (0, 0, 2)
S.No Name of Experiment
1 Create a calculator program
2 Explore String functions
3 Implement sequential search
4 Implement Selection sort
5 Implement Stack
6 Creating a CSV File based on user input
7 Reading a CSV File already created and check for a specific pattern
CP 153 MATLAB Programming C (L, T, P) = 1 (0, 0, 2)
1. WAP for operations on matrices

2. WAP to draw the curve of the line
3. WAP to ndraw the curve of cos(x).
4. WAP to draw the curve of exp(x).
5. WAP to draw the curve of sine
6. WAP to draw the curve of a line
7. WAP to draw the curve of parabola.
8. WAP to Implements logic gates AND and OR.
9. Generation on various signals and Sequences (periodic and aperiodic), such as unit impulse, unit
step,square, sawtooth, triangular, sinusoidal, ramp, sinc.
10. Operations on signals and sequences such as addition,multiplication, scaling,shifting, folding,
computation of energy and average power.
EE 101/102 ELECTRICAL AND ELECTRONICS ENGINEERING C (L, T, P) = 4 (3, 1, 0)

UNIT CONTENTS OF THE COURSE Hours
1 DC Networks: Kirchoffs Laws, Node Voltage and Mesh Current Analysis;Delta-Star and Star-Delta 7
Transformation, Source Conversion. Classification of Network Elements, Superposition Theorem, Thevenins
Theorem.
II Single Phase AC Circuits: Generation of Single Phase AC Voltage, EMF Equation, Average, RMS and 7
Effective Values. RLC Series, Parallel and Series-Parallel Circuits, Complex Representation of Impedances.
Phasor Diagram, Power and Power Factor.
Three Phase A.C. Circuits: Generation of Three-Phase AC Voltage, Delta and Star-Connection, Line &
Phase Quantities, 3-Phase Balanced Circuits, Phasor Diagram, Measurement of Power in Three Phase
Balanced Circuits.
III Transformer: Faradays Law of Electromagnetic Induction, Construction and Operation of Single Phase 7
Transformer, EMF Equation, Voltage & Current
Relationship and Phasor Diagram of Ideal Transformer.
Electrical DC Machine: Principle of DC Machines, Types, Different Parts of DC Machines.
IV Diode: PN junction diode, formation of depletion layer and diode characterstics. Transistor: Bipolar Junction 7
Transistor, Transistor Current Components, Characteristics of CE, CB and CC Transistor Amplifiers.
Thyristors: The four layer diode, Bi-directional thyristors, the uni-junction transistor and its application in
thyristor circuits.
V Communication System: Introduction to modulation (AM, FM & PM) demodulation, multiplexing. 7
Superhetrodyne radio receiver, television.
Elementary concepts of optical, satellite & mobile communication.
Total 35
Recommended Books
1. BL Theraja, Electrical Engineering

2. Niazi, Electrical and Electronics Engineering
3. Network Synthesis by Heytt Kamerly
4. Network Theory by Van Valkenburg
EE 151/152 ELECTRICAL AND ELECTRONICS ENGG. LAB C (L, T, P) = 1 (0, 0, 2)
S. List of Experiments
No.
A. ELECTRICAL LAB
1. To verify:Kirchhoffs Current and Voltage Laws, Superposition Theorem and Thevenin Theorem.
Make house wiring including earthing for 1-phase energy meter, MCB, ceiling fan, tube light, three pin socket and a
2.
lamp operated from two different positions. Basic functional study of components used in house wiring.
3. Study the construction and basic working of single phase induction motor and ceiling fan along with regulator.
Basic functional study and connection of moving coil & moving iron ammeters and voltmeters, dynamometer, wattmeter
4.
and energy meter.
Study the construction, circuit, working and application of the following lamps: (i) Fluorescent lamp, (ii) Sodium vapour
5.
lamp and (iii) Mercury vapour lamp
Study the construction and connection of single phase transformer and auto-transformer.
6.
Measure input and output voltage and find turn ratio.
ELECTRONICS LAB
Identification, testing and applications of resistors, inductors, capacitors, PN-diode, Zener diode, LED, LCD, BJT, SCR,
7.
Photo diode and Photo transistor.
Functional study of CRO, analog & digital multi-meters and function / signal generator.
8.
9. Study the BJT amplifier in common emitter configuration and measure voltage gain.
10. Measurement of power in 3Phase circuit using Two Wattmeters and finding Power Factor.
IT 101/102 INFORMATION TECHNOLOGY C (L, T, P) = 3 (3, 0, 0)
An overview of information technology, difference between data and information,

I quality, of information, Information system. 6
Important data types: text, image, graphics & animation, audio, video.
Data compression and its techniques
Introduction to internet: www, web browser, search engine, email
Introduction to e-commerce and its advantage, security threats to e-commerce,
II 7
Electronic payment system,
E-governance, EDI and its benefits
Introduction to cryptography, digital signature and smart card technology
Introduction to LAN, WAN, MAN: Transmission media
Data transmission type: Introduction to OSI reference model
III Analog and digital signals, modulation 7
Network topologies, client-server architecture, ISDN
Overview, definition and function of operating system, need of operating system

IV Batch processing, spooling, multi-programming, multi-processing 7
Time sharing, online processing, real time system
Application software and their categories, system software

V 8
User interface GUI, spread sheet
Data base software, its features and benefits
Total 35
Recommended Books:
1. Information Technology and the Networked Economy, Second Edition By McKeown, Patrick G.
2. Internet & Intranet Engineering, Tata McGraw Hill company.
3. Information Technology by Ajit Poonia.
4. Information Technology by D.P. Sharma
ME 101/102 ENGINEERING MECHANICS C (L, T, P) = 4 (3, 1, 0)

I System of forces, Fundamental laws of mechanics, Composition of forces : Free body diagram, 6
Lamiss theorem : Moments and couple, Varignons theorem, condition of equilibrium : Types of
support and loading, reaction, Analysis of simple trusses by methods of joints and method of sections.
II Law of Coulomb friction, Ladder, Wedges: Belt friction and rolling: Principle of virtual work and its 6
application.
III Location of centroid and center of gravity,area moment of inertia, mass moment of machine : Law of 7
machines, Variation of mechanical advantages, efficiency, reversibility of machine : Pulleys, wheel
and axle,wheel and differential axle : Transmission of power through belt and rope.
IV Kinematics of Particle: - Rectilinear motion,plane curvilinear motion : Projectile motion : 6
Constrained motion of connected particles. Dynamics of Particle and Rigid Body: - Newtons law of
motion: DAlemberts principle.
V Work and Energy: - Work,energy (potential, Kinetic and Spring) : Work-Energy relation : Law of 7
conservation of energy. Impulse and Momentum: - Impulse, momentum: Impulse-Momentum
relation, Impact. Vibration: - Un-damped Free vibrations.
Total 32
Recommended Books:
1. Engineering Mechanics by Domkundwar & Domkundwar, Dhanpat Rai & Co.
2. Engineering Mechanics by D.S.Kumar.
3. Engineering Mechanics by R.K.Rajput.
4. Classical Mechanics by R. Douglas Gregory University of Manchester
5. Engineering Mechanics by Bhattacharya Oxford University Press.
ME 151/152 AUTO-CAD LAB C (L, T, P) = 1 (0, 0, 2)

I LINE: Lettering and Dimensioning. 6
SCALES: Representative factor, Plain scales, Diagonal scales, Scales of Chords.
CONIC SECTIONS: Construction of ellipse, Parabola and hyperbola by different methods, normal
and tangents.
II PROJECTIONS: Types of Projection, Orthographic Projection, First angle and Third angle 6
Projection.
III SECTIONS OF SOLIDS:- Section of right solids by normal and inclined planes. 7
IV 2 D Drafting:- Introduction to CAD, using coordinate systems, 2-Dimensional drafting, making 2 D 6
vices, working with Draw tools, Working with Grips, Dynamic & Parametric Modification,
understanding References ( X-Line, Ray), Concept of Hatching, Different Hatching styles & patterns,
Importance of Layer, Working with Layers, Dimensioning ( Create, Edit & Styling).
V 3D Modeling:- Intro to 3-D Modeling, Concept & Typing of 3-D Model, 3-D coordinate system, 7
overview of 3-D objects, Create wire frame model, viewing 3-D Model, Create surfaces, Solid
Modeling, Sectioning of 3-D Model.
Total 32
Recommended Books:
1. Engineering Drawing by N.D.Bhatt & V.M.Panchal.
2. Practical Geometry by P.S.Gill.
3. Engineering Drawing by Laxmi Narayan Mathur.
4. Advanced Techniques in Auto CAD by Tickoo Sham T.M.H.
5. Understanding Auto CAD by Tickoo Sham T.M.H.
ME 153/154 WORKSHOP PRACTICE C (L, T, P) = 1 (0, 0, 2)
CARPENTRY SHOP
Timber, definition, engineering applications, seasoning and preservation Plywood and ply boards.
List of jobs to be made in the Carpentryshop
1. T Lap joint
2. Bridle joint
FOUNDRY SHOP
Moulding Sands, constituents and characteristics,
Pattern definition, materials types, core prints,Role of gate, runner, riser, core and chaplets, Causes and remedies of
some common casting defects like blow holes, cavities, inclusions
List of jobs to be made in the Foundryshop
1. Mould of any pattern
2. Casting of any simple pattern
WELDING SHOP
Definition of welding, brazing and soldering processes and their applications
Oxyacetylene gas welding process, equipment and techniques, types of flames and their
Applications. Manual metal arc welding technique and equipment, AC and DC welding
Electrodes: Constituents and functions of electrode coating, welding positions
Types of welded joints, common welding defects such as cracks, undercutting, slag
inclusion and boring
List of jobs to be made in the Weldingshop
1. Gas welding practice by students on mild steel flat
2. Lap joint by gas welding
3. MMA welding practice by students
4. Square butt joint by MMA welding
5. Lap joint by MMA welding
6. Demonstration of brazing
MACHINE SHOP PRACTICE

Study Of Machine Tools:-
Lathe Machine : Parts Of lathe description ,operations on lathe, tools used on lathes, attachments ,Specifications of lathe
,types of lathe
Shaper Machine:- Parts of shaper, description of parts ,Operations on shaper ,tools used on Shaper ,Mechanisms in shaper,
specification of shaper
List of jobs to be made in the Machineshop
1. Job on lathe with one step turning and chamfering operations
2. Job on shaper for finishing two sides of a job
3. Drilling two holes of size 5 and 12 mm diameter on job used / to be used for shaping
4. Grinding a corner of above job on bench grinder
FITTING AND SMITHY SHOP

Files, materials and classification.
Forging, forging principle, materials, Operations like drawing, upsetting, bending and forge welding,Use of forged parts.
List of jobs to be made in the Fitting And SmithyShop
1. Finishing of two sides of a square piece by filing
2. Tin smithy for making mechanical joint and soldering of joint
3. To cut a square notch using hacksaw and to drill three holes on PCD and tapping
List of Recommended Books:-
1. Workshop Technology And Practice By Hazara Chowdhary Vol I & Vol II
2. Workshop Technology And Practice By B.S. Raghuvanshi
3. Production Technology By R.K. Jain
4. Manufacturing Process By :Begman
5. Workshop Technology By : Chapman Vol I ,II & III
EN 101 Engineering English C (L, T, P) = 3 (3, 0, 0)
UNIT CONTENTS
UNIT-I GRAMMAR Tense
Question Tags
Modal Verbs
UNIT-II COMPOSITION Report Writing

Essay Writing
Review Writing
UNIT-III SHORT STORIES The Last Leaf by O Henry
The Fortune Teller by Karel Capek
The Three Dancing Goats by Anonymous
UNIT- IV ESSAYS & SHORT PLAYS Of Studies by Francis Bacon
On The Rule Of The Road by A. G. Gardiner
The Monkeys Paw by W.W. Jacobs
UNIT V POEMS The Character Of A Happy Life by Sir Henry Wotton

Night Of The Scorpion by NIssim Ezekiel
Death The Leveller byJames Shirley
Recommended books
1. Communicative Grammar and Composition by Rajesh K. Lidiya,2008 Oxford Uni. Press, New Delhi
2. Communicative Grammar and Composition, by Rajesh K. Lidiya,2013 OUP, New Delhi
3. Effective Technical Communication by M. Ashraf Rizvi 2005 ,Tata McGrew Hill New Delhi
4. Technical Communication by Meenakshi Raman & Sangeeta Sharma ,2008 OUP New Delhi
5. Business Communication by Meenakshi Raman & Prakash singh, OUP, New Delhi
6. A Practical Course for developing Writing Skills In English by J.K. Gangal PHI Learning Pvt. Ltd. New Delhi
7. Oxford Companion to English Literature U P
8. A glossary of literary terms -M H Abrams
s
EN 102 COMMUNICATION TECHNIQUES C (L,
T, P) = 3 (3, 0, 0)
UNIT CONTENTS
UNIT-I GRAMMAR Active & passive
Nouns and Articles
Conditionals
UNIT-II COMPOSITION Letter Writing

.Application Writing
Technical proposal writing
UNIT-III COMMUNICATION Definition, Meaning

Objectives & its significance
Characteristics, principles & purpose
UNIT- IV MODERN COMMUNICATION Communication devices
Communication structure in an organization
Email messages & Etiquettes
UNIT V SKILLS OF COMMUNICATION Professional communication
Interpersonal Communication
Methods to improve it
Recommended books
1. Modern English N. Krishnaswamy, Macmillan publication

2. Oxford Guide to Writing and Speaking John Selly Oxford University press
3. Communicative Grammar and Composition by Rajesh K. Lidiya,2008 Oxford Uni. Press,
New Delhi
4. Communicative Grammar and Composition, by Rajesh K. Lidiya,2013 OUP, New Delhi
5. Effective Technical Communication by M. Ashraf Rizvi 2005 ,Tata McGrew Hill New Delhi
6. Technical Communication by Meenakshi Raman & Sangeeta Sharma ,2008 OUP New Delhi
7. Business Communication by Meenakshi Raman & Prakash singh, OUP, New Delhi
8. A Practical Course for developing Writing Skills In English by J.K. Gangal PHI Learning Pvt. Ltd. New Delhi.
EN 151 ENGLISH COMMUNICATION LAB C (L, T, P) = 1 (0, 0, 2)
S.No. Contents of subject
1 Phonetics
2 Phonetic Symbol & Transcription
3 Synonyms and Antonyms
4 Affixes
5 One word substitution
6 Paper presentation
7 Seminar presentation
8 Reading comprehension
9 Group Discussion
10 Personal Grooming & Etiquettes
Reference books:-
1 Working with Emotional Intelligence-Daniel Goldman
2 Emotional Intelligence- Daniel Goldman
3 Stress Management-Vera Pfeiffer
4 Self hypnosis- Valerie Austin
5 Memory Boosters- Hamlyn
6 The 7 Habits of highly Effective People- Stephen R. Covey
EN 152 LANGUAGE LAB C (L, T, P) = 1 (0, 0, 2)

S.No. Contents of subject
1 Communication
2 Verbal & Non verbal Language
3 Essentials of personality development
4 Body Language
5 Team building
6 Time Management
7 Interview skills
8 Practical lesson on personality development
9 Speaking & listening skills
10 Presentation skills
Reference books:-
1 Working with Emotional Intelligence-Daniel Goldman
2 Emotional Intelligence- Daniel Goldman
3 Stress Management-Vera Pfeiffer
4 Self hypnosis- Valerie Austin
5 Memory Boosters- Hamlyn
6 The 7 Habits of highly Effective People- Stephen R. Covey
MA 101 ENGINEERING MATHEMATICS I C (L, T, P) = 4 (3, 1, 0)
I Differential Calculus
Curvature, Concavity and Convexity and Point of inflexion (Cartesian Coordinates
only) 6
Partial Differentiation, Eulers Theorem on Homogeneous Functions.
II Differential Calculus
Maxima and Minima of Two and more Independent Variables, Lagranges method of
undetermined multipliers.
Asymptotes (Cartesian coordinates only), Intersection of the curve and its asymptotes. 7
Multiple points, Curve tracing of simple curves (Cartesian and Polar) including
cardioids, Lemniscates of Bernoulli, Limacon, Equiangular Spiral, Folium of
Descartes.
III Integral Calculus 7
Double integral, Change of order of integration, Triple integral ,Beta function and Gamma
function. To find areas by using double integrals.
IV Differential Equations
Differential Equations of first order and first degree.
Linear Differential Equations of Higher Order with Constant Coefficients. 7
Homogeneous Linear Differential Equations.
V Differential Equations
Linear Differential Equations of Second Order with Variable Coefficients:Exact differential
equations Method of
Change of Dependent and Independent Variables. 7
Method of Variation of Parameters.
Total 34
Books Recommended:
1. Advanced Mathematics for Engineers by Erwin Kreszig.
2. Advanced Mathematics for Engineers by B.S. Griwal.
3. Advanced Mathematics for Engineers by Chandrika Prasad.
4. Engg. Mathematics I by Y.N. Gaur & C.L. Koul
5. Engg. Mathematics I by D.N. Vyas
6. Engg. Mathematics I by RBD Publication
MA 102 ENGINEERING MATHEMATICS II C (L, T, P) = 4 (3, 1, 0)

I Algebra 6
Convergence and Divergence of infinite series: Comparison test, Cauchys nth root test, Dalemberts ratio test,
logarithmic ratio test, Raabis test, DeMorgan and Bertrands test, Gauss test (without proof)
Fourier Series: Expansion of simple functions in Fourier Series, Fourier Series of even and odd functions. Half
range series, change of intervals, Harmonic Analysis.
II Matrices 6
Rank of a matrix, inverse of a matrix by elementary transformations.
Solution of simultaneous linear equations by matrix method.
Eigen values and Eigen vectors, Cayley- Hamilton theorem (without proof).
Diagonalization of matrix.
III Coordinate Geometry of Three Dimensions 6
Equation of a sphere.
Intersection of a sphere and a plane, tangent plane, normal lines.
Right circular cone.
Right circular cylinder.
IV Vector Calculus 7
Scalar and vector point functions, differentiation & integration of vector functions.
Gradient, Divergence, Curl and Differential Operator.
Line, Surface and volume integrals. .
V Partial Differential Equations 7
Partial Differential Equations of the First Order.
Non-linear Partial Differential Equations of order one: Standard forms.
Charpits Method.
Total 32
Books Recommended:
1 1. Advanced Mathematics for Engineers by Erwin Kreszig.
2 2. Advanced Mathematics for Engineers by B.S. Griwal
3 3. Advanced Mathematics for Engineers by Chandrika Prasad
4 4. Engg. Mathematics Book 2 by Y.N. Gaur & C.L. Koul
5 5. Engg. Mathematics II by K.C. Jain & M.L. Rawat
6 6. Engg. Mathematics I by RBD Publication
7 7. Engg. Mathematics II by RBD Publication
PY 101/102 ENGINEERING PHYSICS C (L, T, P) = 4 (3, 1, 0)
Units Contents of Course Hours

Interference of light
Newtons Rings: Theory and determination of diameters of dark and bright rings.
Michelsons interferometer: Construction and working, Determination of wavelength 8 hrs,
I of light and wavelength separation of two nearby wavelengths.
Polarization of Light
Production of Plane, circular and elliptically polarized, Phase retardation plates,
Specific rotation and its measurement using the half shade and Bi-Quartz polarimeters.
Diffraction of Light :
Fraunhofers diffraction due to single Slit, 6 hrs.
II Theory of plane transmission grating and determination of wavelength of light
Resolving power: Reyliegh criterion, Resolving power of diffraction grating.
Lasers , Holography and Optical fiber
Theory , design and application of Ruby, He- Ne and semiconductor lasers
Construction and Reconstruction of Hologram 6 hrs.
III Introduction of optical fiber as wave guide
Numerical Apeture of an optical fiber
Special Theory of Relativity
Postulates of special theory of relativity, Lorentz Transformations 6 hrs.
IV Relativity of length , mass, and time.
Relativistic velocity addition , Mass- Energy relation
Electricity & Magnetism
Scalar and Vector Fields, Concepts of Gradient, Divergence and Curl, Maxwells
V electromagnetic Equations.
Nuclear Radiation Detectors 7 hrs.
Nuclear Binding Energy, Construction , working and properties of proportional , G.eiger
M.uller and Scintillation counter
Total 33
Books Recommended
Optics by A.K. Ghatak (Tata McGraw-Hill)

Introductory Quantum Mechanics by Liboff (Pearsons Publication)
Quantum Mech. by A.Ghatak & S. Lokhathan (Tata McGraw-Hill
A textbook of Optics: Brijlal and Subramanium. S. Chand Co. Ltd.
Introduction to Modern Optics by G.R. Fowels
An introduction to Fiber Optics by R. Allen Shotwell, PHI
Elements of Electromagnetic Fields: S P Seth, Dhanpat Rai & Company.
Lasers Theory and Applications by Thyagarajan and Ghatak, Macmillan India Ltd.
Elements of Electromagnetic by Mathew N.O. Sadiku, Oxford University Press.
Introductory University optics: Beynon, Prentice Hall of India Pvt. Ltd.
An introduction to Fiber Optics by John M. Senior, PHI
Nuclear Physics by Burchem (Addision Weisly)
PY 151/152 ENGINEERING PHYSICS LAB C (L, T, P) = 1 (0, 0, 2)
S. LIST OF PRACTICALS
No.
1 To determine the dispersive power of material of prism
2 To determine the wavelength of sodium light by Newtons rings experiment
3 To determine the specific rotation of glucose / cane sugar solution using polarimeter
4 To determine the wavelength of prominent lines of white light by plane diffraction grating
5 To determine the wavelength of sodium light with the help of Michelson interferometer
6 To study the profile of He-Ne Laser
7 To determine the Numerical Aperture of optical fiber
8 To determine the fringe width and distance between coherent sources by Fresnels bi-prism experiment
9 To determine the band gap in a semiconductor using a P.N. junction diode
10 To convert a galvanometer into an ammeter.
11 To convert a galvanometer into a voltmeter
12 To draw the plateau characteristic of a Geiger Muller Counter using a radio active source.
13 To determine the height of an object with the help of sextant
14 To determine high resistance by method of leakage with the help of ballistic galvanometer
15 To determine the specific resistance of a given of a wire with the help of Carry Fosters Bridge
CY 101/102 ENGINEERING CHEMISTRY C (L, T, P) = 4 (3, 1, 0)
Units Contents of the Subject Hours

I Water: Common impurities, Hardness, Determination of hardness by Clarks and Complex metric (EDTA) 7 hrs.
method, Degree of Hardness. Municipal Water Supply: Requisites of drinking water, Purification of water.
Sedimentation, coagulation, filtration, sterilization. Break point chlorination. Water for Steam Preparation:
Boiler Trouble, Carryover, Corrosion, Scale & Sludge and caustic embrittlement. Methods of Boiler Water
Treatment: Preliminary treatments, Preheating. Lime-Soda Process, Permutite or Zeolite process,
Deionization or demineralization. Feed water Conditioning, Internal treatment, Blow down. Problems based
on water treatment (Lime-Soda Process).Sanitation.
II Corrosion: Definition and its significance, Theories of corrosion. Galvanic Cell and concentration Cell, 9 hrs.
Pitting and Stress Corrosion. Protection against Corrosion, Protective Metallic Coating. Lubricants:
Classification, Types, Properties: Viscosity, Viscosity Index, Flash and Fire point, Cloud and Pour point and
Emulsification. Pollution: Elementary idea of air and water pollution, Effect of air pollution. Depletion of
ozone layer and its environmental impact. Greenhouse effect. Phase Rule: Statement, Definitions.
Application to one component system: Water and Sulphur. Study of two components: Lead-Silver.
III New & Advanced Engineering Materials: Materials and Chemistry of Engineering materials Software & 7 hrs.
Hardware industry: chip and integrated circuit manufacturing. Chemistry of Electrical Engineering
materials. Metals Alloys, polymers. Electronics and Communication industries: Semiconductor Materials
for, Mechanical industries Materials for Civil and building constructions.
IV Plastics: Classification and constituents of plastics and their uses, preparation, properties and uses of 7 hrs.
Polyethylene. Bakelite, Terylene and Nylon. Rubber : Natural rubber, vulcanization, synthetic rubbers.
Cement: Manufacture of Portland cement, vertical shaft kiln technology, Chemistry of setting and
hardening. Refractories: Definition, properties, classification, Manufacturing and Properties of Silica and
Fireclay Refractories. Glass: Preparation, varieties and uses, Explosive: Introduction, classification,
requisites of explosives. Plastic explosives, blasting fuses, application.
V Chemicals Fuels: Origin and classification fuels. Solid Fuels: Coal, Calorific value ,Proximate and Ultimate 7 hrs.
analysis Determination of calorific value by Bomb Calorimeter. Liquid Fuel: Advantages, petroleum and
refining of petroleum, synthetic petrol, Cracking and Reforming, Knocking Ant knocking Octane number,
Cetane number. Gaseous Fuels: Advantages, Manufacture, composition and calorific value of coal gas and
oil gas, Determination of calorific value by Junkers Calorimeter. Advanced fuel systems: Elementary Non-
conventional Energy Materials.
Books:
1.A Text book of engineering chemistry:Dr. Sunita Rattan ,S.K. Kataria
2.A Text book of Engineering chemistry:P.C. Jain & Monika Jain,Dhanpat Rai Publication
3.VLSI Technology :S.M. Sze Tata Mc Graw Hill Publication company Ltd.
4.VLSI fabrication Principles ,Sorab K. Gandhi,John Wilay & Sons Inc.
5 .Semiconductor Devices,Basic Principles :Jasprit Singh.
6.Materials sciences:MS Vijaya & G Rangarajan,Tata Mc Graw Hill pub.. House
7.Materials Sciences and Engineering:Willams D Callister Jr. Wiley India(p)Ltd.
8.Materials Sciences:G.K. Narula ,K.S. Narula
9.Engineering Chemistry:R. Gopalan ,D. Venkappaya,Vikas Publication
10.Air Pollution :MN Rao,HVN Rao,Tata Mc Graw Hill Publication Company.
CY 151/152 CHEMISTRY LAB C (L, T, P) = 1 (0, 0, 2)
S. No. Name of Experiment No. of

Practical
Turns
I Physical Methods of Analysis
1. Conduct metric Analysis
a. Determination of strength Acid and Bases 01
b. Determination of Solubility of Barium sulphate 01
c. Determination of equivalent conductivity 01
2. pH Analysis
a. Determination of strength of Acids and Bases 01
b. Determination of PH of various Water Sample and its Analysis 01
3. Determination of Viscosity of a given sample of oil at various temperature by Redwood Viscometer 01
No.1
4. Determination of Flash and Fire point of a given sample using Pensky Marten apparatus 01
5. Determination of Cloud and Pour point of a sample 01
II Volumetric Analysis
1. To study kinetics of acetone iodine reactions 02
2. Determination of available chorine in Bleaching Powder 01
3. Determination of free chlorine in a Water sample 01
4. To study hydrolysis of ester 01
5. Determination of B.O.D Value of Water sample 01
6. Determination of C.O.D Value of Water sample 01
7. Determination of hardness of water 01
8. Determination of Dissolved Oxygen or Ammonia or Carbon Dioxide 02
9. Determination of total suspended dissolved and fixed solids in Sewage and Water sample 01
III REDOX Titrations
1. Determination of Copper sulphate Idometrically 01
2. Determine Potassium dichromate idometrically 01
3. Determination Potassium dichromate by retreating it against ferrous ammonium sulphate ( Using 02
internal indictor)
4. Estimation of Iron in plain Carbon steel 01
5. Estimation of Copper in brass 01
IV Gravimetric Analysis
1. Barium as Barium sulphate gravimetrically 02
2. Silver as Silver Nitrate gravimetrically 02
3. Copper as Copper thiocynate gravimetrically 02
As per availability of experiment
ES101/102 ENVIRONMENTAL STUDIES C (L, T, P) = 2 (2,01, 0)

I Man & Environment: Definition of Environment & its various components. Ecosystem 6
concepts. Dependence of Man on nature for its various various needs. Human population
growth & its impacts on environment. Environment & human health. Environmental
concerns including climate change, Global warming, Acid Rain, Ozone layer Depletion etc.
Environmental ethics. Traditional ways of utilising various components of environment.
Sustainable developments.
II Natural Resources: Forest resources, Mining , Dams & their effects on forests & tribal 6
people. Water resources-over utilization of water, floods, droughts and conflicts over water
resources. Mineral Resources- Use of various minerals for Human welfare & environmental
effects of mining. Food resources -World food problem. Impacts of changing Agriculture
practices on Environment. Energy Resources-Renewable and non renewable energy
Resources & exploration of alternative energy sources. Land Resources- land degradation,
soil erosion, desertification & soil contamination.
III Ecosystems: Structure & function, energy flow, food chains, food webs, Ecological 6
pyramids. Basics of forest grasslands, desert & aquatic ecosystem (Ponds, Streams, Lakes,
Rivers, Oceans & Estuaries)
IV Biological Diversity: Genetic, species & ecosystem diversity, Values of Biodiversity, 6
Global, National & Local Biodiversity. Hot-spots of Biodiversity, threat to biodiversity.
Endangered & endemic species of India. Conservation of biodiversity in situ & ex-situ
V Environment pollution: Causes, effects & control of- Air pollution, Water pollution, Soil 6
pollution, Noise Pollution, Thermal pollution & Nuclear Hazards. Solid wastes & their
Management. Disaster Management-Flood, Drought, Earthquake, Land slides etc.
Total 30
References
1. Agarwal KC, 2001. Environmental Biology, Nidi Publishers Ltd. Bikaner.
2. Bharucha Erach, 2003. The Biodiversity of India, Mapin Publishing Pvt. Ltd, Ahmedabad 380013, India. Email: mapin@icenet.net
3. Brunner RC, 1989, Hazardous Waste Incineration, McGraw Hill Inc. 480pgs.
4. Clark RS, Marine Pollution, Clanderson Press, Oxofrd (TB).
5. Cunningham WP, Cooper TH, Gorhani E & Hepworth MT, 2001. Environmental Encyclopaedia, Jaico Publishing House, Mumbai,
1196pgs.
6. De AK, Environmental Chemistry, Wiley Eastern Ltd.
7. Down to Earth, Center for Science and Environment (R)
8. Gleick HP, 1993. Water in Crisis, Pacific Institute for Studies in Development, Environment and Security. Stockholm Environmental
Institute, Oxford University Press, 473pgs.
9. Hawkins RE, Encyclopedia of Indian Natural History, Bombay Natural History Society, Bombay (R)
10. Heywood VH, and Watson RT, 1995. global Biodiversity Assessment. Cambridge University Press 1140pgs.
11. Jadhav H and Bhosale VM, 1995. Environmental Protection and Laws. Himalaya Publishing House, Delhi 284pgs.
12. Mckinney ML and Schoch RM, 1996. Environmental Science Systems and Solutions. Web enhanced edition, 639pgs.
13. Mhaskar AK, Matter Hazardous, Techno-Science Publications (TB)
14. Miller TG, Jr. Environmental Science, Wadsworth Publishing CO. (TB)
15. Odum EP, 1971. Fundamentals of Ecology. WB Saunders Co. USA, 574pgs.
16. Rao MN and Datta AK, 1987. Waste Water Treatment. Oxford and IBH Publishing Co. Pvt. Ltd. 345pgs.
26
HS 203 ECONOMICS AND SOCIAL SCIENCES C(L,T,P) = 3 (3,0,0)
Unit Course Contents Total Contact

Hours - 37
I Introduction: Definition meaning, nature and scope of economics. 6
II Micro Economics: Definition, meaning and scope of Micro Economics. Importance and limitations. 6
III Concept of Demand and supply :Utility Analysis, Law of Demand, Demand determinants, Demand Distinctions. Law of 7
Supply, Elasticity
IV Introduction to social Sciences: impact of british rule on India(Economic Social and Cultural). Indian National movement, 10
Psysography of India.
V Political Economy: Agriculture, Socio-Economic development, Challenges to Indian Decomcracy, Polical Parties and 8
pressure groups.
Reference Books:-
Micro Economics by M.L.Sethi
Advance Micro Economics by M.L. Shingham
CP 201 : DATA STRUCTURES AND ALGORITHMS C(L,T,P) = 4 (3,1,0)
Unit Contents of the Course Total Contact

Hrs.
Data Structure: Definition, Implementation, Operation, Application, Algorithm writing and convention. Analysis of
algorithm, Complexity Measures and Notations
I Arrays: Representation of arrays (multidimensional), Address calculation using column and row major ordering. 8
Linked Lists : Implementation, Doubly linked list, Circular linked list, unrolled linked list, skip-lists, Splices, Sentinel
nodes, Application (Sparse Matrix, Associative Array, Functional Programming)
Stacks : Definition, Implementation, Application (Tower of Hanoi, Function Call and return, Parentheses Matching,
II Back-tracking, Expression Evaluation) 7
Queues : Definition, deque, enque, priority queue, bounded queue, Implementation, Application
Tree: Definition of elements, Binary trees: Types (Full, Complete, Almost complete), Binary Search Tree, Traversal
(Pre, In, Post & Level order)
III Pruning, Grafting. Application: Arithmetic Expressions Evaluation Variations: Indexed Binary Tree 7
Threaded Binary Tree, AVL tree, Multi-way trees, B tree, B+ tree, Forest, Trie and Dictionary
Graphs: Elementary definition, Representation (Adjacency Matrix, Adjacency Lists)
IV Traversal (BFS, DFS)Application: Spanning Tree (Prim and Kruskal Algorithm) 6
Dijkstra's algorithm, shortest path algorithms.
Sorting: Bubble, Selection, Insertion, Quick, Radix
V 6
Merge, Bucket, Heap, Searching: Hashing, Symbol Table, Binary Search, Simple String Searching
Total 34
Reference Books:
1. Aho A.V., J.E.Hopcroft. J.D.Ulman: Data Structures and Algorithms, Addison Wesley.
2. Brastrad: Algorithms, PHI.
3. Horowitz and Sawhni: Algorithms Design and Analysis, CS Press.
4. Kruse R.L.: Data structure and Program Design.PHI.
5. Tanenbaum : Data structures in C,PHI
6. Trembley & Sorenson :An Introduction to Data Structures, Mc-Graw Hill International
27
CP 203 PRINCIPLES OF PROGRAMMING LANGUAGE C(L,T,P) = 3 (3,0,0)

Hrs.
Programming Language: Definition, History, Features. Issue in Language Design: Structure and Operation of
Computer
I 8
Language Paradigms. Efficiency, Regularity. Issues in Language Translation: Syntax, Semantics, Stages analysis
and synthesis, Parse Tree, CFG and BNF grammar.
Specification and Implementation of Elementary and Structured Data Types
II 7
Type equivalence, checking and conversion. Array, List, Structure, Union.
Sequence control with Expressions, Conditional Statements, Loops, Exception handling
III Subprogram definition and activation, simple and recursive subprogram 7
Subprogram environment. Parameter passing mechanism.
Abstract Data type, information hiding, encapsulation, type definition.
IV Static and Stack-Based Storage management 6
Fixed and Variable size heap storage management. Garbage Collection
Parallel Programming: Introduction, parallel processing and programming language
V 6
Threads, semaphore, monitor, message passing.
Total 34
Reference Books:
1. V.Rajaraman :Fundamentals of Computers
2. Ghezzi: Programming Language Concepts, Addison Wesley.
3. Kernighan, Ritchie :Programming in C
4. Structure :Programming in C++
5. Pratt :Programming Languages
6. Ravi Shetty:Programming Language
CP 205: INTERNET PROGRAMING C(L,T,P) = 3 (3,0,0)
Units Course Contents Hours

I Internet Connection Concepts Server, Client and Parts, DNS, Telephone, Cable and Satellite connections- Dialup, ISDN, 6
ADSL and Leased live based connection, Cable and DSS a/c, Web TV and Internet, ISP features. TCP and UDP protocols, URLs
, CGI, MIME and introduction to SGML
II Introduction of intranet - Intranet v/s LAN, Components of Internet-Workstations and Client software, Server and Network 6
operating system. Network cards, cabling and hubs, steps for creating an intranet. Maintenance and connecting to internet.
III E-mail technology - features and concepts massage headers, address book, attachment, filtering and forwarding mails. 7
IV Web technology - Elements of web clients and servers languages and protocols, web page and web sites, special kinds of web 8
sites, web resources search engines, massage boards, clubs, news groups and chat, web page creation concepts planning,
navigation, themes and publishing. Analyzing web traffic log file data, analyzing log file and product for analyzing web traffic.
V Scripting languages HTML forms frames table webpage design java script introduction control structures functions 8
arrays objects simple web applications.
Dynamic HTML introduction cascading style sheets objects model and collections events model filter and transition
data binding data control ActiveX Control handling of multimedia data.
Total 35
Reference Books:
1. Young, The Complete Reference Of Internet, Tata McGraw Hill.
2. Deitel, Deitel and Nieto, Internet and World Wide Web How To Program, Pearson Education Publisher, 2000.
3. Thom no A. Powell, The Complete Reference HTML and XHTML, fourth edition Tata McGraw Hill, 2003.
28
EC 223: SWITCHING THEORY AND LOGIC DESIGN C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course Total

Contact Hrs.
Number systems, Coding Schemes: BCD, Excess-3, Grey, r's and (r-l)s complement. Boolean Algebra, Fundamental
I theorems, Simplifications of Boolean expressions 7
Logic gates and their truth table. Gate implementation and Truth table of Boolean functions.
Standard forms of Boolean functions. Minterm and Maxterm designation of functions. Simplification of functions on
Karnaugh maps
Incompletely specified functions. Cubical representation of Boolean functions and determination of prime implicants
II 7
Selection of an optimal set of prime implicants. Multiple output circuits and map minimization of multiple output
Circuits
Tabular determination of multiple output prime implicants.
Combinational circuits Adder, subtractor, encoder, coder
III 6
Multiplexer. Design of Combinational circuit using Multiplexers.
Multiplexer. Design of Combinational circuit using Multiplexers. Flip Flops: RS, J-K, D, T. Sequential circuits.
Clock, pulse and level mode sequential circuits Analysis and design of sequential circuits
Synthesis of state diagrams, Finite memory circuits, equivalence relations equivalent states and circuits
IV 7
Determination of classes of indistinguishable states and simplification by implicants tables. Mealy and Moore
Machines
State assignment and memory element input equations, Partitioning and state assignment.
Switching Devices. Positive and Negative logic of OR, AND, NOR, NAND, XOR and XNOR gates
V Logic Family: RTL, DTL, DCTL, TTL, RCTL, ECL, HTL, MOS and CMOS logic circuit. Speed and delay in logic 6
circuits, integrated circuit logic and noise immunity
Total 33
Reference Books:
1. Sandiege: Modern Digital Design, McGraw Hill.
2. Moris Mano :Digital Design, PHI
3. H, Taub, D.Schilling :Digital Integrated Electronics, McGraw Hill
4. Hill & Peterson :Switching Theory and Logic Design, John Wiley
5. Parag K. Lala: Practical Digital Logic Design & Testing Prentice Hall of India.
EC 221: ELECTRONIC DEVICES & CIRCUITS C(L,T,P) = 4 (3,1,0)

Hrs.
Diode circuits: Diode as a circuit. Element, load line concept
I 8
Clipping & clamping circuits, voltages multipliers.
Devices: construction, characteristics and working principles of the following devices. Diodes BJT, JFET,
II 7
MOSFET, UJT, photo diodes, LEDs, photo transistorsSolar cells. Thermistor, LDR
Transistors: transistor characteristics, current components, current gains. Alpha and vita operating point. High bride
model, h- parameter equivalent circuits
CE, CB and Cc configuration Dc and ac analysis of CE, CC and CB amplifiers
III 7
Evers- moll model. Biasing and stabilization techniques. Thermal run away, thermal stability. Equivalent circuits
and blessing of JFETs and MOSFETs
Low frequency CS and CD JFET amplifiers. FET as a voltage variable resistor.
Small signal amplifiers at low frequency: analysis of BJT and FET, dc and rc coupled amplifiers Frequency
Response
IV 6
Midband gain, gains at low and high frequency. Analysis of dc and differential amplifiers, Millers theorem
Cascading transistor amplifiers, Darlington and cascaded circuits. Emitter and source followers.
Oscillators: concept of feedback classification, criterion for oscillation. Tuned collector, Hartley Colpitts
V 6
Rc- phase shift, Wein bridge and crystal oscillators, astable, monostable and bistable multivibrators. Schmitt trigger
29
Total 34
Reference Books:
1. J.Millman & C.C. Halkias :Integrated Electronics, McGraw Hill
2. Millman Grabel: Microelectronics, McGraw Hill.
EC 213 MEDICAL ELECTRONICS C(L,T,P) = 3 (3,0,0)

Hrs.
Introduction of Human Physiology: Nerve physiology. Functions of nerves and myoneural junctions.
Membranae and action potential of nerves.
I Function of skeletal and smooth muscle and its rhythmic contraction, cardiac muscle. 8
Blood flow system, Arterial pressure Mechanism of respiration.
COMPUTER NETWORK S function of spinal cord and cord reflexes. Myo-electrical control of paralyzed muscles.
ECG, EMG and EEG: Principle & Means of recording non-electrical biological parameters.
II Signals from micro-electrodes and slat bridge Use of field electric devices as electrometers,driven shield,photon 7
coupled amplifier. Artifacts
Measurement of biological events : Electronic methods of measuring blood pressure, skin & systemic body
III Temperature 7
Pulse rate and coronary care monitoring.
Biomedical Instruments: Electronic pace makers. Implantable power source.
Defibrillators. Micro power transmitter for telemeter binominals. Special characteristics of CRO in bio-medical
IV applications Surgical and therapeutic diathermy units. 6
Physiological simulators. Basic diagnostic X-ray units. Introduction to patient monitoring and intensive care unit.
Interference and patient safety. Anaesthetic explosion and fires.
Miscellaneous : Introduction to heart Lung machines, CT scanners
V 6
Ultrasound sonography and Doppler measurements, NMR & PET Scans. Use of lasers in medical applications.
Total 34
Reference Books:
1. Webster, J.G.: Medical Instrumentation, Application and Design, John Willey and Sons.
2. Jacobson, B.Wester, J.G.: Medical and Clinical Engineering Prentice Hall, International.
3. Cromwell: Biometical Instrumentation and Measurements.et al. Prentice Hall, International.
4. R.S. Khandipur: Handbook of Biomeideal Instrumentation. Tata McGraw Hill.
5. Carr: Introduction to Biomedical Equipmens, Pearson Education.
CP 251 DATA STRUCTURE AND ALGORITHM LAB C(L,T,P) = 2

(0,0,2+2)
1. Program on array searching, sorting (Bubble sort, Quick sort, Marge sort etc.)
2. Program to insert element at desire position, replacing element, deletion in array.
3. Various matrices operations.
4. Various strings programs.
5. Implementation of stack and queue using array
6. Implementation of stack and queue using link lists
7. Implementation of circular queue using link lists.
8. Polynomial addition, multiplication.
9. Two-way link lists programs.
10. Infix to postfix/prefix conversion.
11. BST implementation (addition, deletion, searching).
12. Graph traversal (BFS, DFS).
CP 253 INTERNET PROGRAMMING LAB C(L,T,P) = 2 (0,0,2+2)
30
1. Create a bio-data of self using HTML with a photograph on the page and containing marks in a table.
2. Develop your web page with the following properties.
(1) 2 Photographs display at the same place, which can flip on mouse over.
(2) Link to separate HTML file for academics, sports and other interests.
3. Enhance your Web page using style sheets, frames and setup a hyper link to your friends page.
4. Make a form for submission of Querying about the interest rates of bank (use Text fields of HTML) and submit buttons of HTML.
5. Make a local query form, which takes in the input the range of marks through Text fields and display the list of students having marks in that range in
another window.
6. Enhance the above query through password protection.
7. Build a shopping Cart page in which items of 10 types are picked and quantity and a bill is generated by the web page.
8. Enhance the above page for making a payment through electronic billing system.
9. Associate guest book in your web page.
10. Setup a Counter to count the number of visitors on your web page.
EC 253 ELECTRONIC DEVICES & CIRCUITS LAB C(L,T,P) = 1 (0,0,2)
S.
List of Experiments
No.
1. Study the following devices:
(a) Analog & digital multimeters
(b) Function/ Signal generators
(c) Regulated d. c. power supplies (constant voltage and constant current operations)
(d) Study of analog CRO, measurement of time period, amplitude, frequency & phase angle using Lissajous figures.
2. Plot V-I characteristic of P-N junction diode & calculate cut-in voltage, reverse saturation current and static & dynamic resistances.
3. Plot V-I characteristic of zener diode and study of zener diode as voltage regulator. Observe the effect of load changes and determi ne load
limits of the voltage regulator.
4. Plot frequency response curve for single stage amplifier and to determine gain bandwidth product.
5. Plot drain current - drain voltage and drain current gate bias characteristics of field effect transistor and measure of Idss & Vp
6. Application of Diode as clipper & clamper
7. Plot gain- frequency characteristic of two stage RC coupled amplifier & calculate its bandwidth and compare it with theoretical value.
8. Plot gain- frequency characteristic of emitter follower & find out its input and output resistances.
9. Plot input and output characteristics of BJT in CB, CC and CE configurations. Find their hparameters.
10. Study half wave rectifier and effect of filters on wave. Also calculate theoretical & practical ripple factor.
11. Study bridge rectifier and measure the effect of filter network on D.C. voltage output & ripple factor.
EC 255 DIGITAL ELECTRONICS LAB C(L,T,P) = 1 (0,0,2)
1. Experimental study of characteristics of CMOS integrated circuits.

2. Interfacing of CMOS to TTL and CMOS.
3. Study of various combinatorial circuits based on: AND/NAND Logic blocks and OR/NOR Logic blocks.
4. Study of following combinational circuits: Multiplexer; Demultiplexer and Encoder. Verify truth tables of various logic functions.
5. To study various waveforms at different points of transistor bistable multivibrators and its frequency variation with different parameters.
6. To study transistor astable multivibrators.
7. To design a frequency driver using IC-555/timer.
8. To study Schmitt trigger circuit.
9. To study OP-AMP as Current to voltage and voltage to current converter comparator.
10. BCD to binary conversion on digital/IC trainer.
11. Study various Flip flops and construct Parallel-in-Serial-out register. Testing of digital IC by automatic digital IC trainer.
31
EC 212 MICROPROCESSOR AND INTERFACES C(L,T,P) = 4 (3,1,0)

Hrs.
Introduction to Micro Computer Systems: Microprocessors, microcontroller and microcomputer devices
I 6
Machine and assembly language, Bus concept. Architecture & Pinout of 8085A
Assembly Language and Programming in 8085: Instruction set, Program structures (sequential, conditional,
II (iterative) 7
Macros and subroutines, Stack, Counter and timing delay, interrupt structure and its programming
Peripherals and their interfacing with 8085-I: Memory Interfacing, Interfacing I/O ports
III Data transfer schemes (Synchronous, asynchronous, interrupt driven), Architecture & interfacing of PPI 8255, 7
Data Converters and Timer 8254
Peripherals and their interfacing with 8085-II:
Architecture & interfacing of- DMA controller 8257,
IV 8
interrupt Controller 8259A, USART 8251, Level Converters MC 1488 and MC 1489
Current loop, RS 232 C and RS 422 A
Comparative study of 8085 A, 8086 and 8088 (Pinout, internal architecture, timing diagrams)
V Instruction format and addressing modes Data and Branch related. Features of Pentium processor, MMX and 7
Dual core processor
Total 35
Reference Books:
1. Gaonkar-8085 Programming, Penram Press.

2. A.P. Mathur-Introduction to Microprocessors, Tata Mc-Graw-Hill.
3. Antanakos-Introduction to Intel Family Microprocessors, Pearson Education.
4. Gilmore-Microprocessors Principles and Applications, Tata Mc-Graw Hill.
5. B.Ram-Fundamentals of Microprocessors & Micro Computers, Dhanpat Rai Pub.
6. Ray and Bhurchandi-Intel Microprocessors, Tata-Mc-Graw Hill.
CP
211 GRAPH THEORY AND DISCRETE MATHIS C(L,T,P) = 4 (3,1,0)
Total
Conta
Unit Contents of the Course ct
Hrs.
Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs,Set Identities.
I Relations: Definition, Operations on relations, Properties of relations, Composite Relations, 6
Equality of
32
II Algebraic Structures: Definition, Groups, Subgroupsand order, Cyclic Groups, Cosets, Lagrange's theorem, Normal 7
Subgroups, Permutation and Symmetric groups, Group Homomorphisms, Definition and elementary properties of Rings
and Fields, Integers Modulo n.
III Partial order sets: Definition, Partial order sets,Combination of partial order sets, Hasse diagram. Lattices: Definition, Properties of lattices Bounded,
Complemented, Modular and Complete Lattice,Morphisms of lattices. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic
manipulation of Boolean expressions. Simplificationof Boolean Functions, Karnaugh maps, Logic gates, Digital circuits and Booleanalgebra. Combinationa
sequential Circuits
Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of proposition, Theory of Inference
IV Deduction. Predicate Logic: First order predicate, well formedformula of predicate, quantifiers, Inference Propositional Logic: Proposition,8 well formed
Truth tables, Tautology, Satisfiability,
Trees : Definition, Binary tree, Binary tree traversal, Binary search tree. Graphs: Definition and terminology, Representation of graphs,
V Multigraphs, Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph 7
coloring . Recurrence Relation & Generating function: Recursive definition of functions, Recursive algorithms, Method of solving
recurrences. Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle
Total 35
Reference Books:1. Liu and Mohapatra, Elements of Distcrete Mathematics, McGraw Hill
2. Jean Paul Trembley, R Manohar, Discrete Mathematical Structures with Application to Computer Science, McGraw-Hill
3. Y. N. Singh, Discrete Mathematical Structures, Wiley India, New Delhi, First Edition, August 2010.
4. R.P. Grimaldi, Discrete and Combinatorial Mathematics, Addison Wesley
CP 202 SOFTWARE ENGINEERING C(L,T,P) = 3 (3,0,0)

Hrs.
System Analysis: Characteristics, Problems in system Development
I System Level project Planning, System Development Life cycle (SDLC), 7
Computer system engineering system analysis, modeling the architecture, system specification.
Software Project Management: Objectives, Resources and their estimation, LOC and FP estimation, effort estimation
COCOMO estimation model, risk analysis
II 7
Software project scheduling. Software Development : Life Cycle (SWDLC), SWDLC models software engineering
Approaches
Requirement Analysis: Requirement analysis tasks, Analysis principles. Software prototyping and specification data
Dictionary
III 6
Finite state machine (FSM) models. Structured Analysis: Data and control flow diagrams, control and process
specification behavioral modeling, extension for data intensive applications
Software Design: Design fundamentals, Effective modular design
IV 7
Data architectural and procedural design, design documentation
Object Oriented Analysis: Object oriented Analysis Modeling, Data modeling.
V Object Oriented Design: OOD concepts and methods class and object definitions, refining operations. 8
Class and object relationships, object modularization. Introduction to Unified Modeling Language
Total 35
Reference Books:
N Pressman; Software Engineering-A practitioner's Approach, McGraw Hill International
O Behforooz and F.J. Hudson: Software Engineering Fundamentals Oxford University Press
CP 206 JAVA C(L,T,P) = 4 (3,1,0)
Total Contact
Units Contents of the Course
Hrs.
An overview of Java: Object oriented programming, Two paradigms, abstraction, the, OOP principles, Java class
33
librariesDate types, variables and arrays: Integers, floating-point types, characters, Boolean, Iterates, Variable, Data
I types and casting, automatic type promotion in expressions arrays. 7
Operators: Arithmetic operators, bit wise operators, relational operators, Boolean logical assignment operators, the?
Operator, operator precedence
Control statements: -Java's selection statements, iteration statements, jump statements
II Introduction to classes: Class fundamentals, declaring object reference variable, Introducing methods, constructors,
6
the key word, garbage collection, the finalize () method.
Methods and Classes:-Overloading methods, using objects as parameters, recursion
Inheritance: Inheritance basics, using super, method overriding, dynamic method dispatch, using abstract Classes,
III Using final with inheritance, Package and Interfaces, Package asses protection, importing packages
Exception handling: Exception handling fundamentals. Exception types, Uncaught Exceptions Using try and catch,
multiple catch clauses, nested try statements throw, Finally Java built in exception creating your own exception sub
classes, using exceptions.
Multithreaded Programming: The Java thread model, the main thread, creating thread, creating multiple thread, using 8
is alive () and join (). Thread priorities, synchronization, Inter thread Communications, suspending resuming and
stopping thread using multithreading
String handling: The string constructor, string length, special string operator character extraction, string comparison,
IV
searching string, modifying string, data conversion, changing the case of characters, string buffer. 7
Networking: Networking basics, Java and the Internet Address, TCP/IP client Sockets URL,URL connection, TCP/IP
server Sockets The Applet Class
V
The Applet Class: its architecture displays methods. The HTML APPLET. Passing parameters to Applet. The get
Documentation Base () and get Code Base () methods Applet Context and Show Document 7
Total 35
Reference Books:
1. Java 2 Computer Reference (Tata McGraw Hill)
2. Core Java-I (Addison Wesley) - horstmann
3.Core Java - II (Addison Wesley)
CP 207 INTRODUCTION TO PROBABILITY THEORY AND STOCHASTIC
PROCESSES C(L,T,P) = 3 (3,0,0)

Hrs.
Probability Theory: Axioms of probability, Probability space, Conditional probability, Independence, Baye's rule,
Random variable.
Some common discrete and continuous distributions, Distribution of Functions of

Random Variable, Moments, Generating functions, Two and higher dimensional
distributions.
II 7
Functions of random variables, Order statistics, Conditional distributions, Covariance,

correlation coefficient, conditional expectation, Modes of convergences, Law of large
numbers, Central limit theorem.
III 7
Stochastic Processes: Definition of Stochastic process, Classification and properties of

stochastic processes, Simple stochastic processes, Stationary processes, Discrete and
IV continuous time Markov chains, Classification of states, Limiting distribution, 7
V Birth and death process, Poisson process, Steady state and transient distributions, 8
Simple Markovian queuing models (M/M/1, M/M/1/N, M/M/c/N, M/M/N/N).
34
Total 35
Reference Books:
4. 1. Introduction to Probability and Stochastic Processes with Applications, Liliana Blanco Castaneda,
Viswanathan Arunachalam, Selvamuthu Dharmaraja, Wiley, New Jersey, June 2012.
5. 2. Probability and Statistics with Reliability, Queueing and Computer Science Applications, Kishor S. Trivedi,
John Wiley, second edition, 2001.
6. 3. Introduction to Probability Models, Sheldon M. Ross, Academic Press, ninth edition, 2000.
CP 208 OPEN SOURCE TECHNOLOGY C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course Total Contact Hrs.

OST overview: Evolution & development of OST and contemporary technologies, Factors leading to its growth.
Open Source Initiative (OSI), Free Software Foundation and the GNU Project, principle and methodologies. Contexts
I of OST (India & international). 7
Applications of open source (open source teaching and open source media) Risk Factors. Myths regarding open
source.
Philosophy of Software Freedom, Free Software, OSS, Closed software, Public Domain Software, Shared software,
Shared source.
II 7
Detail of few OSS like Open Audio, Video, 2d & 3d graphics software, system tools, office tools,
Networking & internet, Security, Educational tools and Games
Open Source Development Model, Starting and Maintaining an Open Source Project
III Open Source Hardware, Open Source Design, Ongoing OS Projects (i.e. examples of few good upcoming software 7
projects.) Case Study: - Linux, Wikipedia.
Licenses and Patents: What Is A License, How to create your own Licenses?
IV 6
Important FOSS Licenses (Apache,BSD, GPL, LGPL), copyrights and copy lefts, Patents
Social and Financial impacts of open source technology, Economics of FOSS: Zero Marginal Cost, Income generation
V opportunities 8
Problems with traditional commercial software, Internationalization, Open Source as a Business Strategy.
Total 35
Reference Books:
1) Vikas thada, Review to OST
2) Balaguruswamy concepts of open source concepts
CP 217 E-COMMERCE C(L,T,P) = 3 (3,0,0)

Hrs.
Business Strategy in an Electronic Age: Value Chain-supply chains, Proter's value chain, model and Inter-
35
Organizational value chains. Competitive Advantage-Competitive strategy
I Proter's Model, First Mover advantage and competitive advantage using e-commerce Business strategy 7
Introduction to Business Strategy, Strategic Implications of IT technology e-commerce Implementation and
Evaluation
Business to Business Electronic Commerce: Inter-organizational Transactions,
The credit Transaction Trade cycle.
II 7
A variety of transactions, Electronic markets-markets and electronic markets, usage of electronic markets,
Advantages and disadvantages of electronic markets
Electronic Data Interchange (EDI): Definition and benefits of EDI.
III EDI technology, standards, communications, implementation, agreements and securities. 6
EDI trading patterns and transactions.
Building an E-Commerce Site: Introduction to object behavior, components, active scripting.
Object models, Infrastructure objects, service object and data objects, choosing the objects.
Building a scalable application, Addition the configure method, connecting to the database, Accessing and
IV 6
versioning the database.
Building the catalog object with example. Creating shopping basket-Holding state, creating the tables for a shopping
basket, modifying the object model and making the basket accessible
J2EE Architecture Overview: Enterprise components, Information technology in the enterprises,
V Introduction to enterprise objects and enterprise component model. 6
The J2EE model features, J2EE components-container architecture. Enterprises Java and J2EE architecture.
Total 32
Reference Books:
1. David Whiteley - E-Commerce Strategy, Technology and Application, Tata McGraw Hill.
2. Mathew Reynolds - Beginning E-commerce with Visual Basic ASP, SQL Server 7.0 and MTS, Shroff Publishers & Distributors Pvt. Ltd.
3. Perrone & Chaganti - Building Java Enterprises System with J2EE, Techmedia.
4. Kalakota - Frontiers of Electronic Commerce, Pearson Education.
EC 210 TELECOM ENGG. FUNDAMENTALS C(L,T,P) = 4 (3,1,0)

Contact
Hrs.
INTRODUCTION :- Electromagnetic Spectrum, Frequency Spectrum-Bandwidth-Allocation, Time domain and
Frequency domain analysis
TRANSMISSION MEDIA:- Twisted pair, UTP cables, Coaxial and optical fiber cables, wireless, microwave and
I 8
satellite transmission
DATA TRANSMISSION: - Transmission impairments. Serial and parallel transmission, Simplex, half duplex or full
duplex transmission mode.
DATA ENCODING :- Modulation (ASK, FSK and PSK, PCM, PAM, Delta Modulations), Line coding (NRZ-L,
II NRZI , Bipolar AMI, Manchester and differential Manchester), 8
MULTIPLEXING:- FDM, Synchronous and Statistical TDM
DATA LINK LAYER: Channel allocation problem, pure and slotted ALOHA Protocols, Persisted And Non-Persisted
CSMA Collision Free Protocols, Digital Cellular Radio and CDMA
III Logical Link Sub Layer, MAC Sub layer. 6
Brief Introduction: Frame Relay, PPP
PROTOCOL :- OSI & TCP/IP Protocol Architecture
SWITCHING NETWORKS: Circuit switching Networks, Space and Time division switching, Routing circuit
IV switched networks, control signaling packet switching principles, fixed, flooding and adaptive routing strategies: X.25 & 6
X.28 protocols Brief introduction: ISDN,ADSL
NETWORK DEVICES: Gateway, Router, Bridge, Switch, Hub, Repeater, Multilayer Switch, Protocol Converter,
V Router, Proxy, Firewall, Multiplexer, Network Card, Modem. 7
NETWORK TECHNOLOGY: DSL, GSM, Bluetooth, Infrared.
Total 35
Reference Books:
th
1. William Stallings: Data and Computer Communications (PHI, 5 Ed.)
rd
2. James Martin: Telecommunication and the Computer (PHI, 3 Ed.)
36
CP 209 BUSINESS ECONOMICS- C(L,T,P) = 3 (3,0,0)
Unit Course Contents Total Contact Hours
- 37
I Introduction: Meaning, Definition , nature, scope and importance of Macro Economics 6
II National Income Analysis 6

Nature and scope of macroeconomics with emphasis on macroeconomic problems and policies
Introduction to macro-economic data circular flow of income- definitions of gross domestic
product, gross and net national product, national and personal income, methods of national
income accounting, saving-investment identity and role of unintended change in inventories
III Money & Civilization : Functions and Forms of Money, Monetary And Fiscal Policy and its 7
impact on the economy.
IV New Economic Reforms: Liberalization , Globalization and privatization. Critical evaluation 10
of latest economic policy.
V Social Sciences: Unemployment, Industrial development of India. Inflation and 8
unemployment. Economic Growth and Productivity.
Reference Books:-
1. Business Environment by Justin paul
2. Business Environment by Shekh salim
CP 254 JAVA LAB C(L,T,P) = 2 (0,0,2+2)
1. Programs based on inheritance property.

2. Programs of operator overloading (complex number arithmetic, polar coordinates).
3. Programs using friend functions.
4. Write a Program for implementing exception handling
5. Write a Program for implementing multithreading
6. Write a Program for crating a stack and its operation
7. To implement spell checker using dictionary.
8. To implement color selector from a given set of colors.
9. To implement shape selector from a given set of shapes.
10. To implement a calculator with its functionality.
11. To show movement of a car.
CP 256 OPEN SOURCE TECHNOLOGY (UNIX) LAB C(L,T,P) = 1 (0,0,2)
37
1. Practice commands: cp, mv, rm, ln, ls, who, echo, cat, mkdir, rmdir. Wildcards (? *) ,
I/O redirection (<, >, >>), pipelines (|)
2. Practice commands: xargs, alias, set-unset, setenv-unsetenv, export, source, ps, job, kill.
3. Practice commands: head, tail, cut, paste, sed, grep, sort, uniq, find, locate, chmod.
4. Writing a simple shell script to echo who is logged in.
5. Write a shell script to display only executable files in a given directory.
6. Write a shell script to sort a list of file either in alphabetic order or largest file first according to user response.
7. Write a shell script to count the lines. Words and characters in its input (Note: Don't use wc).
8. Write a shell script to print end of a glossary file in reverse order using array. (Hint: use awk tail).
9. Modify cal command to accept more than one month (e.g. $cal Oct, Nov, ) (Hint : use alias too)
10. Write a shell script to check whether Ram logged in, continue checking every 60 seconds until success.
CP 258 DESIGN PRACTICE WITH UML LAB C(L,T,P) = 1 (0,0,2)
In this lab first 8 experiments are to practice software engineering techniques. Use any open source CASE tool. Many of them are available at
www.sourceforge.net. You can choose any other CASE tool, as per choice. Language: C++ / JAVA
Design Approach: Object Oriented these designing can be done on any automation system e.g. library management system, billing s ystem, payroll
system, bus reservation system, gas agency management system, book-shop management system, students management system.
1. Do feasibility study
2. Document all the requirements as specified by customer in Software Requirement Specification
3. Design sequence diagrams for project
4. Design Collaboration diagram
5. Design Data Flow Diagram for the project
6. Design Entity Relation Diagram for the project
7. Design Class diagram
8. Design at least 10 test cases for each module.
9. -10: Code and test the project, which you have designed in last 8 labs.
EC 213 MICROPROCESSORS LAB C(L,T,P) = 2 (0,0,2+2)
1. Study of hardware, functions, memory, and operations of 8085 kit.

2. Program to perform integer addition (two and three numbers 8 bit)
3. Program to perform multiplication (two 8 bit numbers).
4. Program to perform division (two 8 bit numbers).
5. Transfer of a block data in memory to another place in memory in forward
and reverse order.
6. Swapping of two block data in memory.
7. Addition of 10 numbers using array.
8. Searching a number in an array.
9. Sorting of array (ascending, descending order).
10. Print Fibonacci sequence. (15 elements)
11. To insert a number at correct place in a sorted array.
Interfacing seven segment display using 8255.
PHP Project lab
1. Write a PHP Program to demonstrate the techniques of Exception Handing and Error Handling.
38
2. Write a PHP program to process the marks obtained by students and embed it in HTML. Use the Multi-Dimensional array concept.
3. Write a PHP program using Looping and Control Structures.
4. Write A PHP program to demonstrate the concept of user-defined Functions.
5. Write a PHP program to demonstrate constructors and destructors.
6. Write a PHP program for database management.
7. Write a PHP program for cookies and sessions.
8. Write a PHP program to read a file from an HTTP server and save it into a compressed file
CP 301 DATABASE MANAGEMENT SYSTEMS C(L,T,P) = 4 (3,1,0)

Hrs.
INTRODUCTION TO DATABASE SYSTEMS: Overview and History of DBMS. File System vs DBMS
I .Advantage of DBMS Describing and Storing Data in a DBMS. 6
Queries in DBMS. Transaction management and Structure of a DBMS
ENTITY RELATIONSHIP MODEL: Overview of Data Design Entities, Attributes and Entity Sets, Relationship
and Relationship Sets. Features of the ER Model-Key Constraints, Participation Constraints, Weak Entities, Class
II 7
Hierarchies, Aggregation Conceptual Data Base, Design with ER Model-Entity vs Attribute, Entity vs Relationship
Binary vs Ternary Relationship and Aggregation vs ternary Relationship Conceptual Design for a Large Enterprise
RELATIONSHIP ALGEBRA AND CALCULUS: Relationship Algebra Selection and Projection, Set Operations,
III 7
Renaming, Joints, Division Relation Calculus, Expressive Power of Algebra and Calculus
SQL QUERIES PROGRAMMING AND TRIGGERS: The Forms of a Basic SQL Query, Union, Intersection and
IV Except, Nested Queries ,Correlated Nested Queries, Set-Comparison Operations, Aggregate Operators, Null Values 6
Embedded SQL, Dynamic SQL, ODBC and JDBC, Triggers and Active Databases.
SCHEMA REFINEMENT AND NORMAL FORMS: Introductions to Schema Refinement, Functional
V Dependencies, Boyce-Codd Normal Forms, Third Normal Form 8
Normalization-Decomposition into BCOMPUTER NETWORK F Decomposition into 3-NF manufacturing sector.
Total 34
Reference Books: Korth, Pearson
CP 302 COMPUTER ARCHITECTURE C(L,T,P) = 3 (3,0,0)

Hrs.
REGISTER TRANSFER LANGUAGE: Data movement around registers. Data movement from/to memory, arithmetic
I and logic micro operations. 6
Concept of bus and timing in register transfer
CPU ORGANISATION: Addressing Modes, Instruction Format.
II 7
CPU organization with large registers, stacks and handling of interrupts & subroutines Instruction pipelining
ARITHMETIC ALGORITHM: Array multiplier, Booth's algorithm.
III 7
Addition subtraction for signed unsigned numbers and 2's complement numbers
MICROPROGRAMMED CONTROL Unit : Basic organization of micro-programmed controller
IV 7
Horizontal & Vertical formats, Address sequencer
MEMORY ORGANISATION: Concept of RAM/ROM, basic cell of RAM
Associative memory, Cache memory organization, Vertical memory organization.
V 8
I/O ORGANISATION: Introduction to Peripherals & their interfacing. Strobe based and handshake-based
communication, DMA based data transfer, I/O processor
Total 34
Reference Books:
1. J.P.Hayes -'Computer Architecture & organization', Mc-Graw Hill.
39
2. Heuring-Computer System Design and Architecture, Pearson Education.
3. M.MORRISMANNO-'Computer System Architecture', Prentice Hall of India.
4. Bartee-Computer Architecture, Tata Mc-Graw Hill.
5. Stallings-Computer Organization and Architecture, Pearson Education.
CP 305 WEB TECHNOLOGY C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course Total Contact Hrs.

Introduction and Web Development Strategies History of Web
I Protocols governing Web, Creating Websites for individual and Corporate World, Cyber Laws Web Applications 6
Writing Web Projects, Identification of Objects, Target Users, Web Team, Planning and Process Development.
HTML, XML and Scripting List, Tables, Images, Forms, Frames, CSS Document type definition,
II XML schemes, Object Models, Presenting XML, Using XML Processors: DOM and SAX 7
Introduction to Java Script, Object in Java Script, Dynamic HTML with Java Script
Java Beans and Web Servers Introduction to Java Beans, Advantage, Properties, BDK
III Introduction to EJB, Java Beans API Introduction to Servelets, Lifecycle, JSDK, Servlet API 7
Servlet Packages: HTTP package, working with Http request and response, Security Issues.
Introduction to JSP, JSP processing, JSP Application Design, Tomcat Server, Implicit
IV JSPobjects, Conditional Processing, Declaring variables and methods 7
Error Handling and Debugging, Sharing data between JSP pages- Sharing Session and Application Data.
Database Connectivity Database Programming using JDBC
V Studying Javax.sql.*package, accessing a database from a JSP page 8
Application-specific Database Action, Developing Java Beans in a JSP page, introduction to Struts framework.
Total: 35
Reference Books:
1 Ajit singh poonia, web technology and fundamentals

2 J.E. Frend internet and history.
CP 307 COMPUTER GRAPHICS C(L,T,P) = 3 (3,0,0)

Hrs.
Introduction to Raster scan displays, Storage tube displays, refreshing, flicking, interlacing, color monitors,
display processors resolution, working principle of dot matrix, inkjet laser printers, working principles of keyboard,
I 6
mouse scanner, digitizing camera, track ball , tablets and joysticks
graphical input techniques, positioning techniques, rubber band techniques, dragging etc
Scan conversion techniques, image representation, line drawing
II simple DDA, Bresenhams Algorithm, Circle drawing, general method, symmetric DDA 7
Bresenhams Algorithm, curves, parametric function, Beizier Method, Bsp- line Method
2D & 3D Co-ordinate system, Translation, Rotation, Scaling, Reflection Inverse transformation, Composite
Transformation
III 7
world coordinate system, screen coordinate system, parallel and perspective projection, Representation of 3D object
on 2D screen
Point Clipping. Line Clipping Algorithms, Polygon Clipping algorithms
Introduction to Hidden Surface elimination, Basic illumination model, diffuse reflection, specular reflection, phong
IV 6
40
shading, Gourand shading ray tracing
color models like RGB, YIQ, CMY, HSV etc
Multimedia components, Multimedia Hardware, SCSI, IDE, MCI
V Multimedia data and file formats, RTF, TIFF, MIDI, JPEG, DIB, MPEG, Multimedia Tools, Presentation tools, 7
Authoring tools, presentation
Total 33
Reference Books:
1. J.Foley, A. Van dam, S.Feiner, J.Hughes: Computer Graphics Principles and Practice. Addison Wesley.
2. D.Rogers and Adams: Mathematical Elements of computer Graphics McGraw Hill.
3. D.Hearn and Baker: Computer Graphics PHI.
CP 309 LOGICAL AND FUNCTIONAL PROGRAMMING C(L,T,P) = 3 (3,0,0)

Hrs.
PROPOSITIONS: Fully parenthesized propositions, Evaluation of constant propositions, Evaluation of proposition n a
state.
I Precedence rules for operators, Tautologies, Propositions a sets of states and Transforming English to prepositional form, 6
REASONING USING EQUIVALENCE TRANSFORMATIONS: The laws of equivalence, rules of substitution and
transitivity
Inference rules. Formal system of axioms and interference Rules
II NATURAL DEDUCTION SYSTEM: Introduction to deductive proofs, Inference rules, proofs and sub-proofs, adding 7
flexibility to the natural deduction system and developing natural deduction system proofs
PREDICATES: Extending the range of a state, Quantification, Free and Bound Identifiers, Textual substitution
III 7
Quantification over other ranges and some theorems about textual substitution and states
LOGIC PROGRAMMING: Introduction to prepositional and predicate calculus, First-order predicate calculus
IV Format logical systems, PROLOG programming-Facts, Rules and queries, Implementations, Applications, Strengths and 7
Weaknesses
FUNCTIONAL PROGRAMMING: Introduction to lambda calculus-Syntax and semantics, Computability and
correctness.
Features of Functional Languages-Composition of functions, Functions as first-class Objects, no side effects and clean
V 8
Semantics
LISP Programming-Data types and structures, Scheme dialect, primitive functions, functions for constructing functions
and functional forms. Applications of functional languages and comparison of functional and imperative languages
Total 35
Reference Books:
1. Appleby-Programming Languages, Tata Mc-Graw Hill.

2. Sebesta-Concepts of Programming Languages, Pearson Education
3. David Gries-The Science of programming, Narosa Publication House.
CP 311 ADVANCED DATA STRUCTURES C(L,T,P) = 3 (3,0,0)

Hrs.
ADVANCED TREES: Definitions Operations on Weight Balanced Trees (Huffman Trees), 2-3 Trees and Red-
Black Trees.
I Augmenting Red-Black Trees to Dynamic Order Statistics and Interval Tree Applications. 6
Operations on Disjoint sets and its union-find problem Implementing Sets. Dictionaries, Priority Queues and
Concatenable Queues using 2-3 Trees
MERGEABLE HEAPS: Merge able Heap Operations, Binomial Trees Implementing Binomial Heaps and its
Operations, 2-3-4. Trees and 2-3-4 Heaps.
II 7
Amortization analysis and Potential Function of Fibonacci Heap Implementing Fibonacci Heap.
SORTING NETWORK: Comparison network, zero-one principle, bitonic sorting and merging network sorter.
GRAPH THEORY DEFINITIONS: Definitions of Isomorphic Components.
41
III Circuits, Fundamental Circuits, Cut-sets. Cut-Vertices Planer and Dual graphs, Spanning Trees, Kuratovski's two 7
Graphs
GRAPH THEORY ALGORITHMS: Algorithms for Connectedness, Finding all Spanning Trees in a Weighted
Graph and Planarity Testing
IV Breadth First and Depth First Search, Topological Sort, Strongly Connected Components and Articulation Point. 7
Single Min-Cut Max-Flow theorem of Network Flows. Ford-Fulkerson Max Flow Algorithms
NUMBER THEORITIC ALGORITHM: Number theoretic notation, Division theorem

V GCD recursion, Modular arithmetic, Solving Linear equation, Chinese remainder theorem, power of an element 8
RSA public key Cryptosystem, primality Testing and Integer Factorization
Total 35
Reference Books:
1. Narsingh Deo-Graph Theory with Application to Engineering and Computer Science, Prentice Hall of India.
2. Baase-Computer Algorithms, Pearson Education.
3. Cormen-Introduction to Algorithms, Prentice Hall of India.
4. Aho A.V., Hopcrptt J.E. and Ullman J.D.-The Design and Analysis of Computer Algorithms, Pearson Education.
5. Horowitz and Sawhni-Fundamentals of Data Structures Galgotia Book Source.
COMPUTATIONAL COMPLEXITY C(L,T,P) = 3 (3,0,0)

Hrs.
Models of Computation, resources (time and space), algorithms, computability, complexity.
I 6
Complexity classes, P/NP/PSPACE, reductions, hardness, completeness, hierarchy, relationships between complexity
classes.
II 7
III Randomized computation and complexity; Logical characterizations, incompleteness; Approximability. 7
Circuit complexity, lower bounds; Parallel computation and complexity; Counting

problems; Interactive proofs.
IV 7
Probabilistically checkable proofs; Communication complexity; Quantum computation

V 8
Total 35
Books:
1. Combinatorial Optimization: Algorithms and Complexity (Hardcover) by Christos H. Papadimitriou.
2. Complexity Theory: A Modern Approach Sanjeev Arora and Boaz Barak
3. Computability and Complexity Theory (Texts in Computer Science) (Hardcover) by Steven Homer (Author), Alan L. Selman (Author)
Publisher:
42
CP 210 MANAGEMENT INFORMATION SYSTEM C(L,T,P) = 3 (3,0,0)

Hrs.
Introduction: MIS concept, Definition, role & Impact of MIS
I 6
Process of management, organization structure & behavior
Basic of Management Information System: Decision Making, Information concepts
II 7
System concepts & control Types of system handling system complexity System development model
Development of Management Information System: Requirement and implementation of MIS
III 6
Choice of information Technology for Management Information System
Application of Management Information system: Application in manufacturing sector using for personal
management
IV 7
Financial management, Production Management, Material Management, Marketing Management Application in
Service Sector
Enterprise Resource Planning (ERP): EMS, ERP, Benefits implementation, EMS & MIS.
V 7
Case Studies: Application of SAP technologies in manufacturing sector.
Total 33
Reference Books:
1. S.Jawadekar: Management Information System, (Tata McGraw Hill)
2. Loudon & Loudon-Management Information Systems, Pearson Education Asia.
CP-352 COMPUTER ARCHITECTURE LAB C(L,T,P) = 2 (0,0,2+2)]
This lab will be based on assembly programming on of RISC processor simulator SPIM. SPIM simulator is available at site
SPIM exercises
1. Read an integer from the keyboard and print it out if (n => n_min AND n <= n_max).
2. Read an integer from the keyboard and print out the following as per switch-case statement
Switch (n)
{n <= 10 print "not a lot" n
== 12 print "a dozen"
n == 13 print "a baker's dozen" n
== 20 print "a score"
n >= 100 print "lots and lots" n!
= 42 print "integer"
otherwise print "you have the answer!}
3. Read a string from the keyboard and count the number of letters. Use the equivalent of following for loop to count number of chars.
for (s1=0; str [s1] != '\n'; ++s1)
4. Print out a line of characters using simple procedure call.
5. Print out a triangle of characters using recursive procedure call.
6. Print factorial of a number using recursion.
7. Print reverse string after reading from keyboard.
43
8. Print a string after swapping case of each letter.
9. Print an integer in binary and hex.
10. Implement bubble sort algorithm.
11. Print Pascal Triangle of base size 12.
12. Evaluate and print Ackerman function.
CP 353 DATABASE MANAGEMENT LAB C(L,T,P) = 2 (0,0,2+2)
Student can use MySql (preferred open source DBMS) or any other Commercial DBMS tool (MS-Access / ORACLE) at backend and C++ (preferred)
VB/JAVA at front end.
1. (a) Write a C++ program to store students records (roll no, name, father name) of a class using file handling. (Using C++ and File handling).
(b) Re-write program 1, using any DBMS and any compatible language. (C++/MySQL) (VB and MS-Access)
2. Database creation/ deletion, table creation/ deletion.
(a) Write a program to take a string as input from user. Create a database of same name. Now ask user to input two more string, create two tables of
these names in above database.
(b) Write a program, which ask user to enter database name and table name to delete. If database exist and table exist then delete that table.
3. Write a program, which ask user to enter a valid SQL query and display the result of that query.
4. Write a program in C++ to parse the user entered query and check the validity of query. (Only SELECT query with WHERE clause)
5 - 6. Create a database db1, having two tables t1 (id, name, age) and t2 (id, subject, marks).
(a) Write a query to display name and age of given id (id should be asked as input).
(b) Write a query to display average age of all students.
(c) Write a query to display mark-sheet of any student (whose id is given as input).
(d) Display list of all students sorted by the total marks in all subjects.
7 - 8. Design a Loan Approval and Repayment System to handle Customer's Application for Loan and handle loan repayments by deposi ting
installments and reducing balances.
9 -10. Design a Video Library Management System for managing issue and return of Video tapes/CD and manage customer's queries
CP 355 WEB PROGRAMING LAB C(L,T,P) = 2 (0,0,2+2)
1. Develop a static html page using style sheet to show your own profile.
Add a page to show 5 photos and add a page to show your academics in a table
Add a page containing 5 links to your favorite website Add navigational links to all above pages (add menu).
2. Update your homepage, by creating few html file (e.g. header, footer, left-sidebar, right), in these file you will put all html code to be shown on
every page.
3. Use Cascading Style Sheets to format your all pages in a common format.
4. Basic Php programs: Write a simple "hello word" program using php.
5. Write a program to accept two strings (name and age) from user. Print welcome statement e.g. Hi Ram, your age is 24."
6. Write a program to create a calculator, which can support add, subtraction and multiply and division operation.
7. Write a program to take input parameters for a table (no. of rows and no. of columns), and create the desired table.
8. Create a "Contact Me" page -Ask user to enter his name, email ID, Use Java-Script to verify entered email address.
9. Store submitted value in a MySql database. Display latest 5 submitted records in contact me page. Display above record with navigation
10. support. e.g. (next, previous, first, last).
44
ANDROID LAB MANUAL
1. Introduction of Eclipse software and how to install eclipse in windows system. Apply all kind of settings also.
2. WAP to implement an android application containing "HELLO" string at center of screen for all kind of screen
resolutions.
3.WAP to implement some basic android GUI elements(INPUT TEXTFIELD,BUTTON,TEXTAREA,LABEL).
4.WAP to implement a simple registration page for your college in an android application.
5.WAP to implement database connectivity through GUI elements in an android application.
6. WAP to implement to call different-different activities through android application.
7.WAP to implement scrolling concept in android GUI.
8.WAP to implement to synchronize API for server connectivity.
9.WAP to implement to synchronize FACEBOOK,GMAIL API in android application.
10.WAP to implement notification process through android app with extra elements features in GUI.
CP 308 DESIGN & ANALYSIS OF ALGORITHMS C(L,T,P) = 4 (3,1,0)

Hrs.
BACKGROUND: Review of Algorithm Complexity and Order Notations and Sorting Methods.
DIVIDE AND CONQUER METHOD: Binary Search, Merge Sort, Quick sort and strassen's matrix multiplication
I 6
algorithms.
GREEDY METHOD: Knapsack Problem, Job Sequencing, Optimal Merge Patterns and Minimal Spanning Trees
DYNAMIC PROGRAMMING: Matrix Chain Multiplication. Longest Common Subsequence and 0/1 Knapsack
Problem.
II 7
BRANCH AND BOUND: Traveling Salesman Problem and Lower Bound Theory.
Backtracking Algorithms and queens problem.
PATTERN MATCHING ALGORITHMS: Nave and Rabin Karp string matching algorithms, KMP Matcher and
III Boyer Moore Algorithms. 7
ASSIGNMENT PROBLEMS: Formulation of Assignment and Quadratic Assignment Problem
RANDOMIZED ALGORITHMS. Las Vegas algorithms, Monte Carlo algorithms, randomized algorithm for Min-
IV Cut, randomized algorithm for 2-SAT. 7
Problem definition of Multicommodity flow, Flow shop scheduling and Network capacity assignment problems
PROBLEM CLASSES NP, NP-HARD AND NP-COMPLETE: Definitions of P, NP-Hard and NP-Complete
Problems.
V 8
Decision Problems. Cook's Theorem. Proving NP-Complete Problems - Satisfiability problem and Vertex Cover
Problem. Approximation Algorithms for Vertex Cover and Set Cover Problem.
Total 35
Reference Books:
1. Aho A.V. J.E. Hopcroft, J.D. Ullman: Design and Analysis of Algorithms, Pearson Education.
2. Rivest and Cormen, Introduction to Algorithms, Prentice Hall of India.
3. Baase, Computer Algorithms, Pearson Education.
4. Brassard, Algorithmics, Prentice Hall.
5. Bazaraa, Linear Programming & Network Flows,John Wiley & Sons.
45
CP 304 THEORY OF COMPUTATION C(L,T,P) = 4 (3,1,0)

Contact
Hrs.
Finite Automata & Regular Expression: Basic Concepts of finite state system, Deterministic and non-deterministic finite
I automation and designing regular expressions relationship between regular expression & Finite automata minimization of 6
finite automation mealy & Moore Machines
Regular Sets of Regular Grammars: Basic Definition of Formal Language and Grammars. Regular Sets and Regular Grammars
II closure proportion of regular sets, Pumping lemma for regular sets, decision Algorithms for regular sets, Myhell_Nerod Theory 7
& Organization of Finite Automata
Context Free Languages& Pushdown Automata: Context Free Grammars Derivations and Languages Relationship between
derivation and derivation trees ambiguity simplification of CEG Greiback Normal form Chomsky normal forms
III Problems related to COMPUTER NETWORK F and GNF Pushdown Automata: Definitions Moves Instantaneous 7
descriptions Deterministic pushdown automata Pushdown automata and CFL - pumping lemma for CFL - Applications of
pumping Lemma.
Turing Machines: Turing machines Computable Languages and functions Turing Machine constructions Storage in finite
control multiple tracks checking of symbols subroutines two way infinite tape.
IV 6
Undecidability:Properties of recursive and Recursively enumerable languages Universal Turing Machines as an undecidable
problem Universal Languages Rices Theorems
Linear bounded Automata Context Sensitive Language: Chomsky Hierarchy of Languages and automata Basic Definition&
V 7
descriptions of Theory & Organization of Linear bounded Automata Properties of context-sensitive languages.
Total 33
Reference Book:
1. John E.Hopcroft, Rajeev Motwani and J.D. Ulman, Introduction to Automata theory Languages and Computation, Pearson
Education
2. John C. Martin, Introduction to Languages and the Theory of Computation, TMH.
3. Cohen, Introduction to Computer Theory, Pearson Education Asia.
CP 306 COMPUTER NETWORKS C(L,T,P) = 3 (3,0,0)

Hrs.
Network, Network Protocols, Edge, Access Networks and Physical Media Protocol Layers and their services models,
I 6
Internet Backbones, NAP's and ISPs
Application Layer: Protocol and Service provided by application layer, transport protocols. The World Wide Web.
HTTP, Message formats, User Server Interaction and Web caches. FTP commands and replies. Electronic Mail, SMTP,
II 7
Mail Message Formats and MIME and Mail Access Protocols DNS The internet's directory service DNS records and
Message.
Transport Layer: Transport Layer Service and Principles, Multiplexing and Demultiplexing applications,
Connectionless Transport. UDP Segment structure and UDP Checksum. Principles of Reliable Data Transfer-Go back to
III 7
N and Selective Repeat. Connection Oriented Transport TCP Connection and Segment Structure, Sequence Numbers
and acknowledgement numbers, Telnet, Round trip time and timeout. TCP connection management
Network Layer and Routing: Network service model, Routing principles. Link State routing Algorithm, A distant Vector
IV 7
routing & OSPF algorithm. Router Components; Input Prot, Switching fabric and output port. IPV6 Packet format.
Sonet/SDH: Synchronous Transport Signals. Physical configuration-SONET Devices, Sections, Lines and Paths.
SONET Layers-Photonic Layer, section layer, line layer, path layer and device layer relationship.
V Sonet Frame format. Section overhead, Line overhead and path overhead. Virtual Tributaries and types of VTs. Point 8
To Point Protocol (PPP), transition States, PPP Layers-Physical Layer and Data Link Layer, Link Control Protocols.
LCP Packets and options. Authentication PAP and CHAP, Network Control Protocol (NCP).
Total 35
Reference Books:
1. J.F.Kurose and K.W.Ross-Computer Networking, Pearson Education Asia.
2. B.A.Forouzan-Data Communications and Networking, Tata Mc-Graw Hill.
3. Garcia and Widjaja-Communication Networks, Tata Mc-Graw Hill.
46
CP 411 MULTIMEDIA SYSTEMS C(L,T,P) = 3 (3,0,0)

Hrs.
Introduction to Multimedia, Multimedia Information, Multimedia Objects, Multimedia in business and work.
Convergence of Computer
Communication and Entertainment products and Stages of Multimedia Projects, Multimedia hardware, Memory &
I 6
storage devices, Communication devices,
Multimedia software's, presentation tools, tools for object generations, video, sound, image capturing, authoring tools,
card and page based authoring tools
Multimedia Building Blocks Text
II 7
Sound MIDI, Digital Audio, audio file formats, MIDI under windows environment Audio & Video Capture.
Data Compression Huffman Coding, Shannon Fano Algorithm, Huffman Algorithms
III Adaptive Coding, Arithmetic Coding Higher Order Modeling. Finite Context Modeling, Dictionary based Compression, 7
Sliding Window Compression, LZ77, LZW compression, Compression, Compression ratio loss less & lossy compression
Speech Compression & Synthesis Digital Audio concepts
IV 6
Sampling Variables, Loss less compression of sound, loss compression & silence compression.
Images: Multiple monitors, bitmaps, Vector drawing, lossy graphic compression, image file formatic animations Images
Standards
JPEG Compression, Zig Zag Coding, Multimedia Database. Content based retrieval for text and images,
V 8
Video: Video representation, Colors, Video Compression, MPEG standards, MHEG Standard Video Streaming on net,
Video Conferencing, Multimedia Broadcast Services, Indexing and retrieval of Video Database, recent development in
Multimedia
Total 34
Reference Books:
1. Ralf Steinmetz & Klara Nahrstedt - Multimedia: computing, Communication & Applications, Pearson Education Asia.
2. Prabhat K.Andleigh-Multimedia System Design, Prentice Hall, Iran Thaukrar.
CP 310 SYSTEM SOFTWARE ENGINEERING C(L,T,P) = 4 (3,1,0)

Hrs.
Overview: Comparison of machine language, assembly language and high level languages
External and internal representation of instructions and data. Data allocation structures, search structures and
I addressing modes. 6
Activities and system software for program generation, translation and execution. Editors for source code and
object code/executable code files
Assemblers: Assembly language specification. Machine dependent and independent features of assembler.
II 7
Classification of assemblers. Pass structure of assemblers (problem and associated for IBM-PC.
Loader and Linkers: Functions and classification.
III Machine dependent and independent features of loaders 6
Design of bootstrap, absolute and relocatable loaders, Design of linker. Case study of MS-DOS linker
Macro processors: Macro definition, call and expansion. Macro processor algorithm and data structure.
IV Machine independent features (parameters, unique labels, conditional expansion, nesting and recursion). 7
Pass structure and design of microprocessor and macro assembler, Case study of MASM macro processor
High level language processor: HLL specification: Grammars and parse trees, expression and precedence.
Lexical analysis: Classification of tokens, scanning methods, character recognition, lexical ambiguity.
V Syntactic analysis: Operator precedence parsing, recursive descent parsing. 7
Symbol Table Management: Data structure for symbol table, basing functions for symbols, overflow technique,
block structure in symbol table
Total 33
Reference Books:
1. D.M. Dhamdhere-System programming & operating system. Tata McGraw Hill.
2. L.L. Beck-System Software, Pearson Education
3. J.J. Donovan-System programming Tata McGraw Hill.
47
CP
312 DATA MININIG AND DATA WAREHOUSING C(L,T,P) = 3 (3,0,0)

Contact
Hrs.
Overview, Motivation(for Data Mining),Data Mining-Definition &
Functionalities
Data Processing, Form of Data Preprocessing
Data Cleaning: Missing Values, Noisy Data, (Binning, Clustering, Regression, Computer and Human
inspection)
I 6
Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data Cube Aggregation,
Dimensionality
Reduction
Data Compression, Luminosity Reduction, Clustering, Discrimination and Concept hierarchy generation
Concept Description:- Definition, Data Generalization, Analytical Characterization, Analysis of attribute
relevance,
Mining Class comparisons
Statistical measures in large Databases. Measuring Central Tendency, Measuring Dispersion of Data, Graph
Displays
of Basic Statistical class Description
II 7
Mining Association Rules in Large Databases, Association rule mining, mining Single-Dimensional
Boolean
Association rules from Transactional
Databases Apriority Algorithm, Mining Multilevel Association rules from Transaction Databases and
Mining Multi-
Dimensional Association rules from Relational Databases.
What is Classification & Prediction, Issues regarding Classification and prediction, Decision tree,
Bayesian
Classification, Classification by Back propagation
Multilayer feed-forward Neural Network, Back propagation Algorithm, Classification methods K-nearest
neighbor
classifiers, Genetic Algorithm.
III 7
Cluster Analysis: Data types in cluster analysis, Categories of clustering
methods
Partitioning methods. Hierarchical Clustering- CURE and Chameleon. Density Based Methods-DBSCAN,
OPTICS.
Grid Based Methods- STING, CLIQUE. Model Based Method Statistical Approach, Neural Network
approach,
Outlier Analysis
Data Warehousing: Overview, Definition, Delivery Process, Difference between Database System and Data
Warehouse
Multi Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept hierarchy,
IV Process 7
Architecture, 3 Tier Architecture, Data Mining
Aggregation, Historical information, Query Facility, OLAP function and
Tools.
OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery, Tuning
V Data 8
Warehouse, Testing Data Warehouse.
Total 35
Reference Books:
1. Rob Mattson-Web Warehousing and Knowledge Management, Tata Mc-Graw Hill.
2. Shelley Powers-Dynamic Web Publishing, Techmedia.
3. Anahory-Data Warehousing in the Real World, Pearson Education Asia.
48
49
CP 314 SIMULATION AND MODELING C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course Total Con

Hrs.
System definition and components, Stochastic activities, continuous and discrete systems
I System modeling, types of models, static and dynamic physical models, static and dynamic mathematical models, full 6
corporate model, types of system study
System simulation, why to simulate and when to simulate, basic nature of simulation
technique of simulation, comparison of simulation and analytical methods, types of system simulation, real time
II simulation, hybrid simulation 7
Simulation of pure-pursuit problem single-server queuing system and an inventory problem, Monte-Carlo simulation,
Distributed Lag models, Cobweb model.
Simulation of continuous systems, analog vs. digital simulation, simulation of water reservoir system, simulation of
servo system, simulation of an autopilot.
III Discrete system simulation, fixed time-step vs. event-to-event model, generation of random numbers, test of 7
randomness, generalization of non-uniformly distributed random numbers
Monte-Carlo computation vs. stochastic simulation
System Dynamics, exponential growth models, exponential decay models, modified exponential growth models
IV logistic curves, generalization of growth models, system dynamics diagrams, feedback in socio-economic systems and 6
world models
Simulation of PERT networks, critical path simulation, uncertainties in activity duration, resource allocation and
consideration.
V Simulation software, simulation languages, continuous and discrete simulation languages, expression based languages, 7
object-oriented simulation, general-purpose vs. application-oriented simulation packages
CSMP-III and MODSIM-III.
Total 33
Reference Books:
1. Kelton W.D. and Law A.M. -Simulation Modeling and Analysis, II Edition, Mc-Graw Hill.
2. G.A.Korn-Interactive Dynamic System Simulation, Mc Graw Hill.
OPTICAL COMMUNICATION C(L,T,P)=(3,0,0)
Units I
OPTICAL FIBERS - Basic optical laws and definitions, Principles of light propagation in fibers, Ray theory, Optical fiber modes and
configurations, Step index and graded index fibers, Monomode and multimode fibers, Fiber materials, fiber fabrication, Fiber optic
cables. Attenuation, signal distortion in optical fibers, Dispersion-intra modal & inter modal, Dispersion shifted and flattened fiber.
UnitsII
OPTICAL SOURCES - LEDs- Structure, Materials, Characteristics, Modulation, Power & efficiency, Laser Diodes - Basic concept,
Hetro Structure, properties and modulation.
UnitsIII
OPTICAL DETECTORS - PIN and Avalanche photo diodes, photo detector noise, detector response time, Avalanche multiplication
noise. Photo diode materials. Fundamental of Optical Receiver Operation.
UnitsIV
OPTICAL FIBER COMMUNICATION SYSTEMS- Source to fiber coupling, fiber to fiber joints, fiber splicing, fiber connectors.
Principle components. Link design calculation, Applications, Wavelength division multiplexing.
UnitsV
OPTICAL FIBER MEASUREMENTS: Measurements of Fiber attenuation, Dispersion, refractive index profile, Numerical aperture &
diameter.
50
CP 316 BIO-INFORMATICS C(L,T,P) = 3 (3,0,0)
Units Course Contents H

Introductory Concepts: The Central Dogma The Killer application Parallel Universes Watsons Definition Top Down
I Versus Bottom up Information Flow Convergence Databases Data Management Data Life Cycle Database
Technology Interfaces Implementation Networks Geographical Scope Communication Models Transmissions 7
Technology Protocols Bandwidth Topology Hardware Contents Security Ownership Implementation
Management.
Search Engines and Data Visualization: The search process Search Engine Technology Searching and Information Theory
II Computational methods Search Engines and Knowledge 7
Management Data Visualization sequence visualization structure visualization user Interface Animation Versus
simulation General Purpose Technologies.
Statistics and Data Mining: Statistical concepts Microarrays Imperfect Data Randomness Variability Approximation
III Interface Noise Assumptions Sampling and Distributions Hypothesis Testing Quantifying Randomness Data 7
Analysis Tool selection statistics of Alignment Clustering and Classification Data Mining Methods Selection and
Sampling Preprocessing and Cleaning Transformation and Reduction Data Mining Methods Evaluation Visualization
Designing new queries Pattern Recognition and Discovery Machine Learning Text Mining Tools.\
Pattern Matching: Pairwise sequence alignment Local versus global alignment Multiple sequence alignment 8
IV Computational methods Dot Matrix analysis Substitution matrices Dynamic Programming Word methods Bayesian
methods Multiple sequence alignment
Modeling and Simulation: Drug Discovery Components Process Perspectives Numeric considerations Algorithms 6
V Hardware Issues Protein structure AbInitio Methods Heuristic methods Systems Biology Tools
Total 35
REFERENCE BOOKS:
1. Ranjan Bose, Information Theory, Coding and Cryptography, Tata McGraw- Hill, 2002.
2. Viterbi, Information Theory and Coding, McGraw-Hill, 1982.
3. John G. Proakis, Digital Communications, McGraw-Hill, New edition, 2000.
4. Gareth A. Jones and J. Mary Jones, Information and Coding Theory, Springer
Undergraduate Mathematics Series, 2000
MATERIAL SCIENCE C(L,T,P)=(3,0,0)
Unit-I
Introduction : Importance of materials. historical perspective, Brief review of modern & atomic concepts in Physics and Chemistry.
Atomic models, Periodic table, Chemical bondings. 4 Crystallography and Imperfections : Concept of unit cell space lattice, Bravais
lattices, common crystal structures, Atomic packing factor and density. Miller indices. Xray crystallography techniques. Imperfections,
Defects & Dislocations in solids. 3
Unit-II
Mechanical properties and Testing : Stress strain diagram, Ductile & brittle material, Stress vs strength. Toughness, Hardness, Fracture,
Fatigue and Creep. Testing of material such as Strength tests, Hardness tests, Impact tests, Fatigue tests, Creep tests, and Non-destructive
testing (NDT). 4 Microstructural Exam : Microscope principle and methods. Preparation of samples and Microstructure exam and grain
size determination. Comparative study of microstructure of various metals & alloys such as Mild steel, CI, Brass. 2 Phase Diagram and
Equilibrium Diagram : Uniary and Binary diagrams, Phase rules. Types of equilibrium diagrams: Solid solution type, eutectic type and
combination type. Iron-carbon equilibrium diagram. 3
Unit-III
Ferrous materials : Various types of carbon steels, alloy steels and cast irons, its properties and uses. 2 Heat Treatment : Various types of
heat treatment such as Annealing, Normalizing, Quenching, Tempering (Austempering, Martempering), and various case hardening
processes. Time Temperature Transformation (TTT) diagrams. 2 Diffusion: Diffusion of Solids, Ficks I and II law. 1 Non-Ferrous metals
and alloys : Non-ferrrous metals such as Cu, Al, Zn, Cr, Ni etc. and its applications. Various type of Brass and Bronze, bearing materials,
its properties and uses. Aluminum alloys such as Duralumin. Other advanced materials/alloys.
Non-Ferrous metals and alloys : Non-ferrrous metals such as Cu, Al, Zn, Cr, Ni etc. and its applications. Various type of Brass and
51
Bronze, bearing materials, its properties and uses. Aluminum alloys such as Duralumin. Other advanced materials/alloys. 3
Unit-IV Dielectric Materials: Dielectric Materials and their applications. 1 Magnetic properties : Concept of magnetism - Dia, para,
ferro Hysteresis. Soft and hard magnetic materials, Magnetic storages. 2 Electric properties, Semi conductors and Super conductors:
Energy band concept of conductor, insulator and semi-conductor. Intrinsic & extrinsic semi-conductors. P-n junction and transistors.
Basic devices and its application. Super conductivity and its applications. Messier effect. Type I & II superconductors. High Tc
superconductors.
Books and References: 1. Callisters Materials Science and Engineering, by William D. Callister, Jr, (Adopted by R. Balasubramaniam),
Wiley India Pvt. Ltd
. 2. Elements of Material Science & Engineering by Van Vlack, Pearson
3. Materials Science and Engineering - A First Course by Raghavan, PH
4. I 4. Material Science and Engineering by Smith, Hashemi and Prakash, TMH
5. 5. Introduction to Materials Science for Engineers by Shackelford, Pearson
6. 6. Material Science by Narula , TMH
CP 354 COMPUTER NETWORK LAB C(L,T,P) = 1(0,0,2)
1. The lab is to be conducted in Perl programming language, Perl works on all platforms (including windows)
2. Write few basic programs of Perl.
a. A Hello World Program
b. Write a program to add to 10 numbers.
c. Write a program of reading input from the keyboard and displaying them on monitor.
d. Write a program to take two strings as input and
compare them 3. To understand advance constructs
of Perl
e. Write a program to create a list of your course (all theory courses in current semester) using array and print them.
f. Write a program to accept ten number, store it into a hash table (Perl have itself) and when asked by user tell him that number exists or
not. (do not store duplicate numbers)
g. Write a program to compute the number of lines in a file.
4. Find the IP address of a host or turn an IP address into a name.
5. Connect to an FTP server and get or put files. Automate the one-time transfer of many files to download the file everyday, which have
changed since yesterday. (use Net: FTP)
6. Write a program to send mail. The programs should monitor system resources like disk space and notify admin by mail when disk
space becomes dangerously low. (use Net: mail)
7. Fetch mail from a POP3 server (use Net: pop 3)
8. Find out who owns a domain (use Net: whois, Whois is a service provided by domain name registration authorities to identify owners
of domain names)
9. Test whether a machine is alive. machine can be specified using IP address or domain name of machine.
10. You have a URL that fetch its content from a Perl script, convert it to ASCII text (by stripping html tags) and display it.
11. Writing a TCP Client, Writing a TCP Server and communicate some data over TCP
CP 356 SYSTEM SOFTWARE LAB C(L,T,P) = 2 (0,0,2+2)
In this lab we will practice how source code is processed by compiler/ assembler/ pre-processor.
All programs have to be written in C++
1. Write a class for file handling, having functions to open/ read/
write/ close/ reset. (2-5) Develop a program which take input a file
of C language
a. Print Lines of Codes and print signature of all function (including main)
52
b. Print number of variables in every function (with type)
c. Generate a new file without the comments. (/* */ and //)
d. Process all #define (i.e. #define MAX 100, than replace every occurrence of
MAX with 100). (Macro value 100 can be an expression also.)
6. Write a program to create a symbol table.
7. Write a program which can parse a given C file and store all variables and functions
in symbol table. (8-10). Write a program to convert given C program into RTL code.
Assumption
a. input C file will have only main function,
b. only two type of statements, either variable
declaration statements (int sub1=23;) OR mathematical
expression (sub1=sub2-sub3 ;).
c. system have 16 registers (R1 to R16)
d. RTL opcode available are: ADD, LOAD, MOVE, SUB, MULTIPLY, DIVIDE
e. No control-flow (i.e. if-else, loop, jump etc.) expression is there in input code e.g.
int main()
{
int sub1=72,
sub2=85,
sub3=63; float
per;
per=(sub1+sub2+sub3)/(100+100+100);
}
Fundamentals
CP 407 ARTIFICIAL INTELLIGENCE C(L,T,P) = 4 (3,1,0)

Hrs.
Meaning and definition of artificial intelligence, Various types of production systems, Characteristics of production
Systems
Study and comparison of breadth first search and depth first search. Techniques, other Search Techniques like hill 6
Climbing, Best first Search.
A* algorithm, AO* algorithms etc, and various types of control strategies
Knowledge Representation, Problems in representing knowledge, knowledge representation using propositional and
II predicate logic, comparison of propositional and predicate logic 7
Resolution, refutation, deduction, theorem proving, inferencing, monotonic and non-monotonic reasoning.
Probabilistic reasoning, Baye's theorem, semantic networks scripts schemas, frames, conceptual dependency and
III 7
fuzzy logic, forward and backward reasoning
Game playing techniques like minimax procedure,
IV alpha-beta cut-offs etc, planning, Study of the block world problem in robotics, 7
Introduction to understanding and natural languages processing
Introduction to learning, Various techniques used in learning, introduction to neural networks, applications of neural
V 7
networks, common sense, reasoning, some example of expert systems.
Total 34
Reference Books:
1. E.Rich, K Knight-Artificial Intelligence, Tata McGraw Hills.

2. S.Russell, P.Norving-Artificial Intelligence-A Modern Approach, Pearson Education, Asia.
3. Thomas Dean-Artificial Intelligence-Theory & Practice, Pearson Education, Asia.
4. Alison Caursey - The Essence of Artificial Intelligence, Pearson Education, Asia.
53
DIGITAL IMAGE PROCESSING C(L,T,P) = 3 (3,0,0)

Hrs.
Introduction and Fundamentals

Motivation and Perspective, Applications, Components of Image Processing System,
Element of Visual Perception, A Simple Image Model, Sampling and Quantization.
Image Enhancement in Spatial Domain
Introduction; Basic Gray Level Functions Piecewise-Linear Transformation Functions:
Contrast Stretching; Histogram Specification; Histogram Equalization; Local
Enhancement; Enhancement using Arithmetic/Logic Operations Image Subtraction,
Image Averaging; Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic
Filter; Sharpening The Laplacian.
I 6
Image Enhancement in Frequency Domain

Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain,
Filters Low-pass, High-pass; Correspondence Between Filtering in Spatial and
Frequency Domain; Smoothing Frequency Domain Filters Gaussian Lowpass Filters;
Sharpening Frequency Domain Filters Gaussian Highpass Filters; Homomorphic
Filtering.
Image Restoration
A Model of Restoration Process, Noise Models, Restoration in the presence of Noise
only-Spatial Filtering Mean Filters: Arithmetic Mean filter, Geometric Mean Filter,
Order Statistic Filters Median Filter, Max and Min filters; Periodic Noise Reduction by
Frequency Domain Filtering Bandpass Filters; Minimum Mean-square Error
Restoration.
II 6
Color Image Processing

Color Fundamentals, Color Models, Converting Colors to different models, Color
Transformation, Smoothing and Sharpening, Color Segmentation.
Morphological Image Processing
Introduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening
and Closing, Morphological Algorithms Boundary Extraction, Region Filling,
III Extraction of Connected Components, Convex Hull, Thinning, Thickening 7
IV 7
Registration
Introduction, Geometric Transformation Plane to Plane transformation, Mapping, Stereo Imaging Algorithms to
Establish Correspondence, Algorithms to Recover Depth Segmentation Introduction, Region Extraction, Pixel-Based
Approach, Multi-level Thresholding, Local Thresholding, Region-based Approach, Edge and Line Detection: Edge
Detection, Edge Operators, Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements
Extraction by Thresholding, Edge Detector Performance, Line Detection, Corner Detection.
Feature Extraction
Representation, Topological Attributes, Geometric Attributes Description Boundary-based Description, Region-based
Description, Relationship. Object Recognition Deterministic Methods, Clustering, Statistical Classification, Syntactic
Recognition, Tree Search, Graph Matching
V 8
Total 34
Reference Books:
1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard E. Woods. Published by: Pearson Education.
2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: John Wiley and Sons, NY.
3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice Hall, Upper Saddle River, NJ.
CP 405 OPERATING SYSTEMS C(L,T,P) = 3 (3,0,0)

Hrs.
Introduction to Operating Systems, Operating system services, multiprogramming, time-sharing system, storage
54
Structures
System calls, multiprocessor system.
I 6
Basic concepts of CPU scheduling, Scheduling criteria, Scheduling algorithms, algorithm evaluation, multiple
processor scheduling, real time scheduling
I/0 devices organization, I/0 devices organization, I/0 devices organization, I/0 buffering
Process concept, process scheduling, operations on processes
Threads, inter-process communication, precedence graphs
II Critical section problem, semaphores, and classical problems of synchronization. 6
Deadlock problem, deadlock characterization, deadlock prevention, deadlock avoidance, deadlock detection, recovery
from deadlock, Methods for deadlock handling.
Concepts of memory management, logical and physical address space
III swapping, contiguous and non-contiguous allocation 7
paging, segmentation, and paging combined with segmentation
Concepts of virtual memory, demand paging, page replacement algorithms
IV 7
Allocation of frames, thrashing, demand segmentation. Security threads protection intruders-Viruses-trusted system
Disk scheduling, file concepts, file access methods, allocation methods, directory systems, file protection,
V 8
Introduction to distributed systems and parallel processing case study.
Total 34
Reference Books:
1. A.S.Tanenbaum-Modern Operating Systems, Pearson Education Asia.

2. D.M.Dhamdhere-Operating Systems-A Concept based approach, Tata Mc-Graw Hills.
3. Achyut godble -Operating Systems, Tata Mc-Graw Hills.
4. Stallings-Operating System, Pearson.
CP 408 DISTRIBUTED SYSTEMS C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course Total Co

Hrs
CHARACTERIZATION OF DISTRIBUTED SYSTEMS: Introduction, Examples of distributed Systems, Resource
sharing and the Web Challenges. System
Models: Architectural models, Fundamental Models Theoretical Foundation for Distributed System: Limitation of
I Distributed system, absence of global clock, shared memory, Logical clocks, 6
Lamports & vectors logical clocks, Causal ordering of messages, global state, and termination. Distributed Mutual
Exclusion: Classification of distributed mutual exclusion, requirement of mutual exclusion theorem,
Token based and non token based algorithms, performance metric for distributed mutual exclusion algorithms
DISTRIBUTED DEADLOCK DETECTION: system model, resource Vs communication deadlocks, deadlock
prevention, avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection
Path pushing algorithms, edge chasing algorithms. Agreement Protocols: Introduction System models, classification of
II Agreement Problem 7
Byzantine agreement problem, Consensus problem, Interactive consistency Problem, Solution to Byzantine Agreement
Problem
Application of Agreement problem, Atomic Commit in Distributed Database system
DISTRIBUTED OBJECTS AND REMOTE INVOCATION: Communication between distributed objects, Remote
procedure call, Events and notifications, Java RMI case study.
SECURITY: Overview of security techniques, Cryptographic algorithms, Digital signatures Cryptography pragmatics,
III 7
Case studies: Needham Schroeder, Kerberos, SSL & Millicent.
DISTRIBUTED FILE SYSTEMS: File service architecture, Sun Network File System, The Andrew File System, Recent
Advances
TRANSACTIONS AND CONCURRENCY CONTROL: Transactions, Nested transactions, Locks, Optimistic
Concurrency control, Timestamp ordering, Comparison of methods for concurrency control.
DISTRIBUTED TRANSACTIONS: Flat and nested distributed transactions, Atomic Commit protocols, Concurrency
IV 7
control in distributed transactions,
Distributed deadlocks, Transaction recovery. Replication: System model and group communication, Fault - tolerant
services, highly available services, Transactions with replicated data
DISTRIBUTED ALGORITHMS: Introduction to communication protocols, Balanced sliding window protocol, Routing
algorithms, Destination based routing,
V 8
APP problem, Deadlock free Packet switching, Introduction to Wave & traversal algorithms, Election algorithm.
CORBA CASE STUDY: CORBA RMI, CORBA services
Total 34
Reference Books:
55
1. George Coulouris-Distributed Systems Concepts and Design, 3rd ed., Pearson Education Asia.
2. A.S. Tanenbaum-Distributed Systems Principles and Paradigms, Prentice Hall of India.
3. Darrel Ince-Developing Distributed and E-Commerce Applications, Addition Wesley.
CP 409 REAL TIME SYSTEMS C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course Tot

Con
Hr
Introduction: Definition, Typical Real Time Applications: Digital Control, High Level Controls, Signal Processing etc.,
Release Times, Deadlines, and Timing Constraints,
I Hard Real Time Systems and Soft Real Time Systems, Reference Models for Real Time Systems: Processors and 6
Resources, Temporal Parameters of Real Time Workload
Periodic Task Model, Precedence Constraints and Data Dependency.
Real Time Scheduling: Common Approaches to Real Time Scheduling: Clock Driven Approach, Weighted Round
Robin Approach, Priority Driven Approach,
II Dynamic Versus Static Systems, Optimality of Effective-Deadline-First (EDF) and Least-Slack-Time-First (LST) 7
Algorithms, Offline Versus Online Scheduling,
Scheduling Aperiodic and Sporadic jobs in Priority Driven and Clock Driven Systems
Resources Access Control: Effect of Resource Contention and Resource Access Control (RAC), Non-preemptive
Critical Sections, Basic Priority-Inheritance and Priority-Ceiling Protocols
III 7
Stack Based Priority-Ceiling Protocol, Use of Priority-Ceiling Protocol in Dynamic Priority Systems, Preemption
Ceiling Protocol, Access Control in Multiple-Unit Resources, Controlling Concurrent Accesses to Data Objects
Multiprocessor System Environment: Multiprocessor and Distributed System Model, Multiprocessor Priority-Ceiling
Protocol,
IV Schedulability of Fixed-Priority End-to-End Periodic Tasks, Scheduling Algorithms for End-to-End Periodic Tasks, 7
End-to-End Tasks in Heterogeneous Systems, Predictability and Validation of Dynamic Multiprocessor Systems,
Scheduling of Tasks with Temporal Distance Constraints
Real Time Communication: Model of Real Time Communication
Priority-Based Service and Weighted Round- Robin Service Disciplines for Switched Networks
V 8
Medium Access Control Protocols for Broadcast Networks, Internet and Resource Reservation Protocols, Real Time
Protocols, Communication in Multicomputer System, An Overview of Real Time Operating Systems
Total 35
Reference Books:
1. W.S.Liu-Real-Time Systems, Pearson Education Asia.
2. Raymond A.Buhr-Introduction to Real-Time Systems, Pearson education Asia.
3. Alan Burns-Real-Time Systems and Programming Languages, Pearson Education.
CP 401 ASYNCHRONOUS TRANSFER MODE NETWORKS C(L,T,P) = 3 (3,0,0)

Hrs.
INTRODUCTION: An overview of communication networks protocol layering, multiplexing and switching principles
I of Asynchronous Transfer Mode Precursor Technologies-X 25, Frame Relay and ISDN. 6
Broad Band-ISDN (B-ISDN)-Configuration, Interfaces, reference model and services
ATM PROTOCOL STACK :ATM reference model,
II Physical layer transmission convergence sub layer functions, physical medium dependent sub layer and physical layer 7
standards for ATM
ATM layer-ATM cell header structure.
III 7
ATM layer functions. ATM adaptation layer-AAL1 to AAL5 layers
TRAFFIC MANAGEMENT: Concept of Traffic and service. Traffic and service characteristics of voice and video data.
IV ATM Traffic descriptors and QOS parameters. Factors affecting QOS parameters and service categories. 8
QOS classes. Elements of ATM Traffic management-Traffic contracting, policing and shaping
V SWITCHING IN ATM: Performance measures and Architectural issues in switch design. ATM switching Architecture 7
Total 35
Reference Books:
1. Sunil Kasera-ATM Networks Concepts and Protocols, Tata McGraw Hills.

2. Rainer Handel-ATM Networks 2nd Edition, Pearson Education Asia.
56
3. Stallings B-ISDN & ATM with Frame Relay-Pearson
INTRODUCTION TO WIRELESS NETWORK C(L,T,P) = 3 (3,0,0)

Hrs.
MULTIPLE ACCESS TECHNIQUES FOR WIRELESS COMMUNICATION : Introduction, FDMA, TDMA, Spread
I 6
Spectrum, Multiple access, SDMA, Packet radio, Packet radio protocols, CSMA protocols, Reservation protocols
INTRODUCTION TO WIRELESS NETWORKING : Introduction, Difference between wireless and fixed telephone
II 6
networks, Development of wireless networks, Traffic routing in wireless networks.
WIRELESS DATA SERVICES : CDPD, ARDIS, RMD, Common channel signaling, ISDN, BISDN and ATM, SS7, SS7
III 7
user part, signaling traffic in SS7.
MOBILE IP AND WIRELESS ACCESS PROTOCOL : Mobile IP Operation of mobile IP, Co-located address,
IV Registration, Tunneling, WAP Architecture, overview, WML scripts, WAP service, WAP session protocol, wireless 7
transaction, Wireless datagram protocol.
WIRELESS LAN TECHNOLOGY & BLUE TOOTH :: Infrared LANs, Spread spectrum LANs, Narrow bank
microwave LANs, IEEE 802 protocol Architecture, IEEE802 architecture and services, 802.11 medium access control,
V 7
802.11 physical layer.BLUE TOOTH : Overview, Radio specification, Base band specification, Links manager
specification, Logical link control and adaptation protocol. Introduction to WLL Technology.
Total 3
Reference Books:
1.Wireless Digital Communications Kamilo Feher, PHI, 1999.
2. Principles of Wireless Networks Kaveh Pah Laven and P. Krishna Murthy, Pearson Education, 2002.
3. Wireless Communications Andreaws F. Molisch, Wiley India, 2006.
4. Introduction to Wireless and Mobile Systems Dharma Prakash Agarwal, Qing-An Zeng, Thomson 2nd Edition
EC 417 SIGNAL AND SYSTEM C(L,T,P) = 3 (3,0,0)

Hrs.
Continuous time and discrete time systems, properties of a system,
Linear time,invariant system(cont. & discrete),properties of LTI systems,their block
I diagram,convolution theorem,discrete time system described by different 6
equations,signal flow graph representation of network,basic network structure of IIR
& FIR systems
Fourier series representation of signals Fourier series representation of continuous
periodic signals and its properties Fourier series representation of discrete periodic
II signals and its properties Continuous time filter & discrete time filters described by 7
differential equations Design of IIR & FIR digital filters Comparison of IIR & FIR
digital filters
Fourier transform Continuous time Fourier transform for periodic & aperiodic signals
III Properties of continuous time fourier transform Discrete time Fourier transform for 7
periodic & aperiodic signals Properties of DTFT Convolution and modulation property
Z-transform and laplas transform Introduction Region for convergence for z-
transform Inverse z-transform 2-dimensional z-transform Properties of z-transform
IV Laplas transform Properties of laplas transform Application of laplas for system 7
analysis FT algorithm FFT algorithm FFFt algorithm N-composite number Chirp-Z
57
transform
Sampling:- mathematical theory of sampling, sampling theorem, ideal and real
sampling, interpolation technique for reconstruction of signal from its sample, aliasing
V 8
& sampling of discrete time signals basic principles of spectrum estimation estimation
of auto co-variance power spectrum & cross-spectrum cross co-variance
Total 35
Reference Books
1. L Philips, J. M. Parr, E. A Riskin, Signals, Systems and Transforms, 3rd ed., Pearson Education, Delhi,
2. R. E. Zeimer, W. H. Tranter, and D. R. Fannin, Signals and Systems: Continuous and Discrete, 4th ,
3. M. J. Roberts, Signals and Systems: Analysis using Transform methods and MATLAB, Tata McGraw Hill,
EC 419
LOGIC SYNTHESIS C(L,T,P) = 4 (3,1,0)
Unit Contents of the Course Tota

Contact
Introduction to VLSI, circuits Asics and Moore's Law. Microelectronic Design, Styles, four phases in creating
Microelectronics chips computer Aided Synthesis and Optimization.
I Algorithms Review of Graph Definitions and Notations Decision and Optimization Problems, Shortest and Longest 6
Path Problems, Vertex Cover, Graph, Coloring, Clique covering and partitioning Algorithms Boolean
Algebra and Representation of Boolean Functions, binary Decision diagrams. Satisfiability and cover problems
Hardware Modeling: Introduction to Hardware Modeling Language, State Diagrams.
Data flow and Sequencing Graphs. Compilation and Behavioral Optimization Techniques. Circuits Specifications for
Architectural Synthesis Resources and constraints.
II 7
Fundamental Architectural Synthesis Problems Temporal Domain Scheduling Spatial Domain Binding Hierarchical
Models and Synchronization Problem.
Area and performance estimation-Resource Dominated circuits and General Circuits.
Scheduling Algorithms: Model for Scheduling Problems, Scheduling without Resource
Constraints-Unconstrained Scheduling ASAP Scheduling Algorithms Latency. Constrained Scheduling. ALAP
III scheduling. 7
Under Timing Constraints and Relative Scheduling with Resource Constraints Integer Linear Programming Model,
Multiprocessor Scheduling, Heuristic Scheduling Algorithms (List Scheduling). Force Directed Scheduling
Two Level Combination Logic Optimization: Logic Optimization Principles-Definitions
Exact Logic Minimization Heuristic, Logic Minimization, and Testability Properties Operations on Two level logic
IV 6
Cover-positional Cube Notation
Functions with Multivolume inputs and list oriented manipulation. Algorithms for logic minimization
Sequential logic optimization: Introduction, Sequential circuit optimization using state based models- state
minimization, state encoding.
V 7
Sequential circuit optimization using network models. Implicit finite state machine traversal methods. Testability
consideration for synchronous circuits
Total 33
Reference Books:
1. Giovanni De Micheli-Synthesis and Optimization of Digital Circuits, Mc-Graw Hill Inc.

2. Zainalabedin Navabi-VHDL Analysis and Modeling of Digital Systems, Mc-Graw Hill Inc.
3. J.Bhasker-VHDL Primer, Addision Wesley.
4. Brassard-Algorithms, Prentice Hall.
CP 451 .NET LAB C(L,T,P) = 2(0,0,2+2)
1. Web Form Fundamentals

2. The Anatomy of an Asp.Net Application, Server Controls, HTML Control
3. Access, Page Class, Application Events, Asp.Net Configuration
58
4. Web Controls Web Controls Basics, Web Control Classes, List Controls, Table Controls,
5. Web Controls Event and auto post back
6. State Management
7. View State, Transferring Information between Pages, Cookies, Session State,
8. Session State Configuration, Application State
9. Rich Controls
10. Calendar, AdRotator, Multiple Views
11. Styles, Themes, and Master Pages
12. Style sheets, Themes, Skins, Master Pages, Content
CP 454 MATLAB PROGRAMMING LAB C(L,T,P) = 2 (0,0,2+2)
1 Basics of MATLAB matrices and vectors, matrix and array operations, Saving and loading
data, plotting simple graphs, scripts and functions, Script files, Function files, Global
Variables, Loops, Branches, Control flow, Advanced data objects, Multi-dimensional matrices,
Structures, Applications in linear algebra curve fitting and interpolation. Numerical
integration, Ordinary differential equation. (All contents is to be covered with tutorial sheets)
2 Simulink: Idea about simulink, problems based on simulink. (All contents is to be covered
with tutorial sheets)
OPERATING SYSTEM LAB C(L,T,P)=1(0,0,2)
1.To implement CPU Scheduling Algorithms

FCFS
SJF
SRTF
PRIORITY
ROUND ROBIN
2. Simulate all Page Replacement Algorithms
FIFO
LRU
3. Simulate Paging Technique of Memory Management
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner.
Intellectual Property Right C(L,T,P) = 3 (3,0,0)

Contact
59
Hrs
Introductory Aspects: Overview of the concept of property; Industrial property and non-industrial
property; Historical background of IPR; Importance of human creativity in present scenario; Different
I 6
forms of IP and its conceptual analysis.
Patents: Introduction and overview of patent protection; History of Patent protections; What is patent
and definition of patent; Object of patent; Scope and salient features of patent; How to obtain patent;
Product patent and Process patent; Specification Provisional and complete specification; Procedure
II for patent applications; Register of patents and Patent Office; Rights and obligations of patentee;
7
Transfer of Patent Rights; Government use of inventions; Biotech patents and patentability of life
forms; Infringement of Patents; Offences and Penalties.
Trade Marks: Introduction and overview of trade mark; Evolution of trade mark law; Object of trade
mark; Features of good trade mark; Different forms of trade mark; Trade mark registry and register of
trade marks; Property in a trade mark; Registrable and non-registrable marks; Basic principles of
III registration of trade mark; Deceptive similarity; Assignment and transmission; Rectification of register;
7
Infringement of trade mark; Passing off; Domain name protection and registration; Offences and
penalties.
Introduction and overview of Cyber Intellectual Property; Intellectual property and cyberspace;
Emergence of cyber crime ; Grant in software patent and Copyright in software; Software piracy; Trade
IV marks issues related to Internet (Domain name); Data protection in cyberspace; E-commerce and E- 6
contract; Salient features of Information Technology Act; IPR provisions in IT Act; Internet policy of
Government of India.
International Convention and Treaties: Paris Convention: Background; Salient features of Paris
Convention; Governing rules of Paris Convention; Patent Cooperation Treaty: Background; Objectives
V of PCT; Salient features of PCT; Madrid Convention: Salient features; International registration of 6
marks; World Intellectual Property Organisation: Background; Salient features WIPO; Organisation of
WIPO.
Total 32
Prescribed Books:
1. P. Narayanan Intellectual Property Law.
2. Cornish William Intellectual Property.
Reference Books:
1. Ganguli Intellectual Property Rights: Unleashed the knowledge economy.
2. Copinger & Skine James Copyright.
3. Pal P. Intellectual Property Rights in India.
4. Unni Trade Mark, Design and Cyber Property Rights.
CP 402 INFORMATION & NETWORK SECURITY SYSTEM C(L,T,P) = 4 (3,1,0)
Unit Contents of the Course Tot

Contac
Introduction to security attacks, services and mechanism, introduction to cryptography.
Conventional Encryption: Conventional encryption model, classical encryption techniques- substitution ciphers and
transposition ciphers, cryptanalysis, stereography, stream and block ciphers.
I Modern Block Ciphers: Block ciphers principals, Shannons theory of confusion and diffusion, festal structure, data 6
encryption standard(DES), strength of DES, differential and linear crypt analysis of DES, block cipher modes of
operations, triple DES, IDEA encryption and decryption, strength of IDEA, confidentiality using conventional encryption,
traffic confidentiality, key distribution, random number generation
Introduction to graph, ring and field, prime and relative prime numbers, modular arithmetic
Fermats and Eulers theorem, primality testing, Euclids Algorithm, Chinese Remainder theorem, discrete logarithms.
II 7
Principals of public key crypto systems, RSA algorithm, security of RSA, key management, Diffle-Hellman key exchange
algorithm, introductory idea of Elliptic curve cryptography, Elganel encryption.
Message Authentication and Hash Function: Authentication requirements, authentication functions, message authentication
Code
III Hash functions, birthday attacks, security of hash functions and MACS, MD5 message digest algorithm, 7
Secure hash algorithm (SHA). Digital Signatures: Digital Signatures, authentication protocols, digital signature standards
(DSS), proof of digital signature algorithm
60
Authentication Applications: Kerberos and X.509, directory authentication service, electronic mail security-pretty good
IV 7
privacy (PGP), S/MIME
IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security associations, key
management.
V 8
Web Security: Secure socket layer and transport layer security, secure electronic transaction (SET). System
Security: Intruders, Viruses and related threads, firewall design principals, trusted systems
Total 35
Reference Books:
Hawang & Briggs-Network security, Mc Graw Hill.
CP 408 ADVANCED COMPUTER ARCHITECTURES C(L,T,P) = 4 (3,1,0)

Contact Hr
INTRODUCTION: Parallel Computing, Parallel Computer Model, Program and Network Properties,
Parallel Architectural Classification Schemes, Flynns & Fangs Classification, Performance Metrics and Measures,
I Speedup Performance Laws: Multiprocessor System and Interconnection Networks; 6
IEEE POSIX Threads: Creating and Exiting Threads, Simultaneous Execution of Threads, Thread Synchronization
using Semaphore and Mutex, Canceling the Threads.
PIPELINING AND MEMORY HIERARCHY: Basic and Intermediate Concepts, Instruction Set Principle;
ILP: Basics, Exploiting ILP, Limits on ILP; Linear and Nonlinear Pipeline Processors; Super Scalar and Super
II 7
Pipeline Design; Memory Hierarchy Design: Advanced Optimization of Cache Performance, Memory Technology
and Optimization, Cache Coherence and Synchronization Mechanisms.
THREAD AND PROCESS LEVEL PARALLEL ARCHITECTURE: Introduction to MIMD Architecture,
Multithreaded Architectures, Distributed Memory MIMD Architectures
III Shared Memory MIMD Architecture, Clustering, Instruction Level Data Parallel Architecture, SIMD Architecture, 7
Fine Grained and Coarse Grained SIMD Architecture, Associative and Neural Architecture
Data Parallel Pipelined and Systolic Architectures, Vector Architectures
Parallel Algorithms: PRAM Algorithms: Parallel Reduction, Prefix Sums, Preorder Tree Traversal, Merging two
Sorted lists;
IV Matrix Multiplication: Row Column Oriented Algorithms, Block Oriented Algorithms; Parallel Quick sort, Hyper 7
Quick sort;
Solving Linear Systems: Gaussian Elimination, Jacobi Algorithm; Parallel Algorithm Design Strategies
Developing Parallel Computing Applications: OpenMP Implementation in C: Execution Model, Memory Model;
Directives: Conditional Compilation, Internal Control Variables, Parallel Construct, Work Sharing Constructs,
V 8
Combined Parallel Work-Sharing Constructs, Master and Synchronization Constructs; Run-Time Library
Routines: Execution Environment Routines, Lock Routines, Timing Routines; Simple Examples in C. Basics of MPI
Total 35
Reference Books:
1. Hawang & Briggs-Computer Architecture & Parallel Processing, Mc Graw Hill.

2. Subrata Das-Advanced Computer Architecture, Vol I & II.
CP 404 COMPILER CONSTRUCTION C(L,T,P) = 4 (3,1,0)

Contact
Compiler, Translator, Interpreter definition, Phase of compiler introduction to one pass & Multipass compilers,
I Bootstrapping, Review of Finite automata lexical analyzer, Input, buffering, Recognition of tokens 6
Idea about LEX: A lexical analyzer generator, Error handling
Review of CFG Ambiguity of grammars, Introduction to parsing. Bottom up parsing Top down parsing techniques,
Shift reduce parsing, Operator precedence parsing, Recursive descent parsing predictive parsers.
II parsing with ambiguous grammar. 7
Introduction of automatic parser generator:.
Syntax directed definitions; Construction of syntax trees,

L-attributed definitions, Top down translation.
III Specification of a type checker, Intermediate code forms using postfix notation and three address code, 7
Representing TAC using triples and quadruples, Translation of assignment statement. Boolean expression and control
Structures
61
Storage organization, Storage allocation, Strategies, Activation records, Accessing local and non local names in a
IV block structured language 7
Parameters passing, Symbol table organization, Data structures used in symbol tables
Definition of basic block control flow graphs, DAG representation of basic block, Advantages of DAG,
V Sources of optimization, Loop optimization, Idea about global data flow analysis, Loop invariant computation, 8
Peephole optimization, Issues in design of code generator, A simple code generator, Code generation from DAG
Total 35
Reference Books:
1. A.V. Aho-Compilers principles, techniques and tools, Pearson Education Asia.

2. N.Wirth-Compiler Construction, Pearson Education Asia.
3. Charles N.Fischer-Crafting a Computer in C, Pearson Education Asia.
CP 411 CLOUD COMPUTING C(L,T,P) = 3 (3,0,0)
Contents of the Course T

Unit
Introduction of Grid and Cloud computing, characteristics, components, business and IT perspective, cloud
services requirements, cloud models, Security in public model, public verses private clouds, Cloud computing
platforms:
I Amazon EC2,Platform as Service: Google App Engine, Microsoft Azure, Utility Computing, Elastic
Computing.
Introduction of Grid and Cloud computing, characteristics, components, business and IT perspective, cloud
services requirements, cloud models, Security in public model, public verses private clouds, Cloud computing
platforms:
II Amazon EC2,Platform as Service: Google App Engine, Microsoft Azure, Utility Computing, Elastic
Computing.
Virtualization technology: Definition, benefits, sensor virtualization, HVM, study of hypervisor, logical
partitioning- LPAR, Storage virtualization, SAN, NAS, cloud server virtualization, virtualized data center.
III
Cloud security fundamentals, Vulnerability assessment tool for cloud, Privacy and Security in cloud, Cloud
IV computing security architecture: Architectural Considerations- General Issues, Trusted Cloud computing,
Secure Execution
Environments and Communications, Micro-architectures; Identity Management and Access control-Identity

management,
Access control, Autonomic Security, Cloud computing security challenges: Virtualization security
management- virtual
threats, VM Security Recommendations, VM-Specific Security techniques, Secure Execution Environments

and
62
Communications in cloud.
SOA and cloud, SOA and IAAS, cloud infrastructure benchmarks, OLAP, business intelligence, e-Business,
ISV,
Clod performance monitoring commands, issues in cloud computing. QOS issues in cloud, mobile cloud
computing, Inter
V cloud issues, Sky computing, Cloud Computing Platform, Xen Cloud Platform, Eucalyptus, OpenNebula,
Nimbus,
TPlatform, Apache Virtual Computing Lab (VCL), Anomaly Elastic Computing Platform .
Total
Reference Book:
1. Dr.Kumar Saurabh, Cloud Computing, Wiley India.
2. Ronald Krutz and Russell Dean Vines, Cloud Security, Wiley-India.
3. Judith Hurwitz, R.Bloor, M.Kanfman, F.Halper, Computing for Dummies, Wiley India Edition.
SOFT COMPUTING C(L,T,P) = 3 (3,0,0)

Contact
Neural networks: History, overview of biological Neuro-system, Matheatical Models of Neurons, architecture,
Learning rules, Learning Paradigms-Supervised, Unsupervised and reinforcement Learning, ANN training Algorithms-
perceptions, Training rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield Networks,
I Associative Memories, Applications of Artificial Neural Networks. Fuzzy Logic: 6
Fuzzy logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets, Membership Function,
Fuzzy rule generation. Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of Operations,
Aggregation Operations.
II 7
Fuzzy arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on

Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations. Fuzzy Logic:
Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic
Hedges.
III 7
Uncertainty based information: Information & Uncertainty, Non-specificity of Fuzzy

& Crisp Sets, Fuzziness of Fuzzy Sets. Introduction of Neuro-Fuzzy Systems.
IV 7
Architecture of neuro fuzzy networks: Application of Fuzzy Logic: Medicine, Economics etc. Genetic Algorithm: An
Overview, GA in problem solving, Implementation of GA
V 8
63
Total 35
Reference Books:
1. S. N. Sivanandam and S. N. Deepa, Principles of Soft Computing, John Wiley India edition, 2008
Reference Book(s):
1. Anderson J.A., An Introduction to Neural Networks, PHI, 1999.
2. Hertz J. Krogh, R.G., Introduction to the Theory of Neural Computation, Palmer, Addison-Wesley, California, 1991.
3. G.J. Klir & B. Yuan, Fuzzy Sets & Fuzzy Logic, PHI, 1995.
4. Melanie Mitchell, An Introduction to Genetic Algorithm, PHI, 1998.
5. Neural Networks-A Comprehensive Foundations, Prentice-Hall International,New Jersey, 1999.
6. Neural Networks: Algorithms, Applications and Programming Techniques,
1. Freeman J.A. & D.M. Skapura, Addison Wesley, Reading, Mass, (1992)..
DATA COMPRASSION TECHNIQUE C(L,T,P) = 3 (3,0,0)

Contact
Hrs.
Introduction
Compression Techniques: Loss less compression, Lossy Compression, Measures of
prefonnance, Modeling and coding, Mathematical Preliminaries for Lossless
compression: A brief introduction to information theory, Models: Physical models,
Probability models, Markov models, composite source model, Coding: uniquely
decodable codes, Prefix codes.
I 6
Huffman coding
The Huffman coding algorithm: Minimum variance Huffman codes, Adaptive
Huffman coding: Update procedure, Encoding procedure, Decoding procedure.
Golomb codes, Rice codes, Tunstall codes, Applications of Hoffman coding: Loss
II less image compression, Text compression, Audio Compression. 7
Arithmetic Coding
Coding a sequence, Generating a binary code, Comparison of Binary and Huffman
coding, Applications: Bi-level image compression-The JBIG standard, JBIG2,
Image compression. Dictionary Techniques: Introduction, Static Dictionary:
Diagram Coding, Adaptive Dictionary. The LZ77 Approach, The LZ78 Approach,
Applications: File Compression-UNIX compress, Image Compression: The
Graphics Interchange Format (GIF), Compression over Modems: V.42 bits,
Predictive Coding: Prediction with Partial match (ppm): The basic algorithm, The
ESCAPE SYMBOL, length of context, The Exclusion Principle, The Burrows-
Wheeler Transform: Move-to-front coding, CALIC, JPEG-LS, Multi-resolution
III Approaches, Facsimile Encoding, Dynamic Markoy Compression. 7
Mathematical Preliminaries for Lossy Coding

Distortion criteria, Models, Scalar Ouantization: The Quantization problem,
IV Uniform Quantizer, Adaptive Quantization, Non uniform Quantization. 7
Advantages of Vector Quantization over Scalar Quantization, The Linde-Buzo-

V Gray Algorithm, Tree structured Vector Quantizers. Structured Vector Quantizers. 8
Total 35
Reference Books:
1. Khalid Sayood, Introduction to Data Compression, Morgan Kaufmann

Publishers
64
CP 410 EMBEDDED SYSTEMS C(L,T,P) = 3 (3,0,0)

Contact
Hrs.
Overview of Embedded System: Embedded System, Categories and Requirements of Embedded Systems
I Challenges and Issues in Embedded Software Development, Applications of Embedded Systems in Consumer 6
Electronics, Control System, Biomedical Systems, Handheld computers, Communication devices
Embedded Hardware & Software Development Environment: Hardware Architecture
II Micro- Controller Architecture, Communication Interface Standards, Embedded System Development Process, 7
Embedded Operating systems Types of Embedded Operating systems
Design quality and Microcontroller: Quality matrix, software and hardware, Estimation
III 8 Bit microcontrollers Architecture, on chip peripherals, instruction set/programming of Intel MCS51 family (8 bit ) 7
Inter facing of 8051 with LCD, ADC, sensors, stepper motor, key board, DAC, memory
Real Time & Database Applications: Real- Time Embedded Software Development, Sending a Message over a Serial
IV Link, Simulation of a Process Control System Controlling an Appliance from the RTLinux System, Embedded Database 7
Applications using examples like Salary Survey, Energy Meter Readings
Programming Languages for Embedded Systems: Tools for building embedded systems - with case studies. Microchip
V PIC16 family PIC16F873 processor features architecture memory organization register file map I/O ports PORTA - 8
PORTB PORTC Data EEPROM and flash program memory Asynchronous serial port SPI mode I2C mode
Total 35
Reference Books:
th
1. William Stallings: Embedded System (PHI, 5 Ed.)
2. James Martin: semiconductor in computer (PHI, 3rd Ed.)
CP 410 FAULT TOLERANT SYSTEM C(L,T,P) = 3 (3,0,0)

Contact
Basic Concepts: Failure and Faults, reliability and failurerate, relation between eligibility and Mean-time Between
failures, maintainability and availability, reliability of series and parallel systems,
I 7
Test Generation: Fault diagnosis of digital systems, Test generation for combinational logic circuits conventional
methods, Random testing, transition count testing and signature analysis.sd
Fault Tolerant Design: Basic concepts static, dynamic, Hybrid, and self-purging redundancy, shift-over Modular
Redundancy (SMR). Triple Modular redundancy, SMR. Reconfiguration, use of error correcting codes.
II 6
Time redundancy, software redundancy, fail soft-operation, examples of practical fault tolerant systems, Introduction
to fault Tolerant Design of VLSI Chips.
Self Checking Circuits: Design of Totally self-checking checkers, checkers using m-out of n codes, Berger codes and
low cost residue code. Self-checking sequential Machines, partially self checking circuits.
III 8
Fail Safe Design: Strongly fault secure circuits, failsafe Design of sequential circuits using partition theory and Berger
codes, totally self-checking PLA design.
Design for Testable Combination Logic circuits: Basic concepts of test ability, controllability and observability.
IV The read-muller expansion technique, three level OR-AND-OR design, use of control logic and syndrome-testable 8
design.
Design of Testable Sequential circuits The scan-path technique level sensitive scan design (LSSD)
V Random Access scan technique, built-in-test, built-in-test of VLSI chips, design for autonomous self-Test, Designing 7
Testability into logic Boards.
Total 36
Reference Books:
1. LALA: Digital systems design using PLDs PHI 1990.
2. N. N. Biswas: Logic Design theory, PHI 1990.
NATURAL LANGUAGE PROCESSING C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course

Co
Context Free grammars, Lexical analysis. Introduction to parsing, context Sensitive grammars
I
65
II Linguistics of English: Review of English Grammar, Morphology, syntax, semantics, structure of discourse. Words and the
lexicon: word classes.
III
Semantic Grammars, TN, ATN, Case grammars, paninian Grammars, parser of NL statements, Determiners and quantifiers,
noun-noun modification, pronoun resolution relative clauses.
Deep Structure, shallow structure, Differences between English and Hindi Application
(a) MT
(b) ASR
(c) IR
(d) Q & A
IV
V Project work on NLP
Total
Reference Books:
3. LALA: Digital systems design using PLDs PHI 1990.
4. N. N. Biswas: Logic Design theory, PHI 1990.
PARALLEL COMPTUING C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course To
Introduction: Paradigms of parallel computing: Synchronous - vector/array, SIMD, Systolic;

Asynchronous - MIMD, reduction paradigm.
Hardware taxonomy: Flynn's classifications, Handler's classifications. Software taxonomy:
Kung's taxonomy, SPMD.
I
Abstract parallel computational models: Combinational circuits, Sorting network, PRAM models, Interconnection RAMs.
Parallelism approaches - data parallelism, control parallelism
Performance Metrices: Laws governing performance measurements. Metrices - speedups, efficiency, utilization, communication
overheads, single/multiple program performances, bench marks.
II
Performance Metrices: Laws governing performance measurements. Metrices - speedups, efficiency, utilization, communication
overheads, single/multiple program performances, bench marks
III
Parallel Processors: Taxonomy and topology - shared memory mutliprocessors, distributed memory networks. Processor
organization - Static and dynamic interconnections. Embeddings and simulations.
IV
V
Parallel Programming: Shared memory programming, distributed memory programming, object oriented programming, data
parallel programming, functional and dataflow programming.
Scheduling and Parallelization: Scheduling parallel programs. Loop scheduling. Parallelization of sequential programs. Parallel
programming support environments
Total
Reference Books:
1. M. J. Quinn. Parallel Computing: Theory and Practice , McGraw Hill, New York, 1994.
2. T. G. Lewis and H. El-Rewini. Introduction to Parallel Computing , Prentice Hall, New Jersey, 1992.
3. T. G. Lewis. Parallel Programming: A Machine-Independent Approach , IEEE Computer Society Press, Los
Alamitos, 1994.
66
CAD FOR VLSI DESIGN C(L,T,P) = 3 (3,0,0)
Unit Contents of the Course Total Contac

Hrs.
Modern digital systems, complexity and diversity of digital systems
I 6
Productivity gap and need for CAD tools. introduction to steps and CAD flow for designing with ASIC and FPGA
Introduction to VHDL, background, VHDL requirement,
II Elements of VHDL, top down design, convention and syntax, basic concepts in VHDL i.e. characterizing H/W 7
languages, objects, classes, and signal assignments
Structural specification of H/W- Parts library, Wiring, modeling, binding alternatives, top down wiring.
III 7
Design organization and parameterization. Type declaration, VHDL operators
VHDL subprogram parameters, overloading, predefined attributes, user defined attributes, packaging basic utilities.
IV 7
VHDL as a modeling language- bi-directional component modeling, multi mode component modeling
Examples of VHDL synthesis subsets- combinational logic synthesis, sequential circuit synthesis,
V 8
State machine synthesis. VHDL language grammar. Introduction to synthetic circuits and circuit repositories
Total 35
Reference Books:
1. Wayne Wolf-Modern VLSI Design,3rd ed Pearson Education Asia.

2. Kiat-Sent Yeo-CMOS/BiCCMOSVLSI,Pearson Education Asia.
3. Neil H.E. Weste-Principles of CMOS VLSI Design, Pearson Education Asia.
CP 454 ADVANCE COMPUTER ARCHITECTURE LAB C(L,T,P) = 2 (0,0,2+2)
This lab will be based on assembly programming on of RISC processor simulator SPIM. SPIM simulator is available at site
SPIM exercises
1. Read an integer from the keyboard and print it out if (n => n_min AND n <= n_max).
2. Read an integer from the keyboard and print out the following as per switch-case
statement Switch (n)
{n <= 10 print "not a
lot" n == 12 print "a
dozen"
n == 13 print "a baker's
dozen" n == 20 print "a score"
n >= 100 print "lots and
lots" n! = 42 print "integer"
otherwise print "you have the answer!}
3. Read a string from the keyboard and count the number of letters. Use the equivalent of following for loop to count number of
chars. for (s1=0; str [s1] != '\n'; ++s1)
4. Print out a line of characters using simple procedure call.
5. Print out a triangle of characters using recursive procedure call.
6. Print factorial of a number using recursion.
7. Print reverse string after reading from keyboard.
8. Print a string after swapping case of each letter.
9. Print an integer in binary and hex.
67
10. Implement bubble sort algorithm.
11. Print Pascal Triangle of base size 12.
12. Evaluate and print Ackerman function.
13. Write a Program onOPEMP implantation
14. WAP on thread synchronization
15. WAP on Simple Pipelining
16. Program on Hyper Quick Sort
17. Program on Timing Routines
18. Program on Lock Routines
CP 456 NETWORK SYSTEM SECURITY LAB LAB C(L,T,P) = 1 (0,0,2)
1. Write a Program in C++ to encrypt & decrypt a text message using stream cipher.
2. Write a Program in C++ to encrypt & decrypt a text message using block cipher.
3. Write a Program in C++ to encrypt & decrypt a text/document file.
4. Write a Program in C++ to implement fiestel Cipher model.
5. Write a Program in C++ to implement Diffie- Hellman Key Exchange.
6. Write a Program in C++ to implement Hashing Techniques.
7. Write a Program in C++ to implement RSA Algorithm.
8. Write a Program in C++ to implement enveloping of keys
CP 452 COMPILER LAB C(L,T,P) = 2 (0,0,2+2)
1,2 Write a Program to identify data storage statements in an 8086 assembly language program and estimate the size of
data segment.
3. Write a program to identify macro definitions in an assembly language program.
4,5. Extend the above program to implement simple and recursive macro expansion.
6. Write a program to process include and define macro in C language.
7, 8 Write a program to parse source code string of C-language and identify token in terms of keywords and identifiers.
9. Construct parse tree of arithmetic statements in C language program.
10. Write a program to optimize the source program for operator strength reduction, dead code elimination and
frequency reduction transformation.
11, 12 Design a simple high level language containing arithmetic and logic operations pointers, branch and loop
instructions. Write its lexical analyzer using lex.
VLSI DESIGN LAB C(L,T,P) = 1 (0,0,2)
Simple Design exercises:

1. Half adder, Full adder, Subtractor Flip Flops, 4bit comparator.
2. Parity generator
3. Bit up/down counter with load able count
4. Decoder and encoder
5. 8 bit shift register
6. 8:1 multiplexer
68
7. Test bench for a full adder
8. Barrel shifter
9. N by m binary multiplier
10. RISC CPU (3bit opcode, 5bit address)
TOOLS:
Xilinx Tools/ Synopsis Tools/ Cadence Tools/ Model SIM/ Leonardo Spectrum Tools/VIS/SIS Tools to be used
69

B.Tech. - CSE. 2015

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

B.Tech. - CSE. 2015

Загружено:

Авторское право:

Доступные форматы

Computer Science Engineering

Course Nature of Course Name Credi Contact Exa Weightage

4 ES 101/ Environmental Sc. (ME/EE/CE)/ 2 2 0 0 3 40 60

5 CP 151/ Computer Programming Lab(ME/EE/CE)/ 1 0 0 2 2 60 40

6 ES 101 Employability SkillsI 1 0 2 0

4 Proficiency in Co-Curricular Activities 2 - - - - 100 -

6 CP 203 Principle of Programming Language 3 3 0 0 3 40 60

7 CP 251 Data Structure and Algorithm Lab 1 0 0 2 2 60 40

8 CP 255 Industrial oriented Python Project Lab 2 0 0 2+2 2 60 40

Year: II Session 2016-2017

S. Course Course Name Credits Contact Exam Weightage

4 CP 202 Software Engineering 4 3 1 0 3 40 60

5 CP 204 Graph Theory and Discrete Maths 3 3 0 0 3 40 60

6 CP 206 Core Java 4 3 1 0 3 40 60

8 CP 254 Industrial oriented Core Java Project Lab 2 0 0 2+2 2 60 40

9 CP 258 Design Practice with UML Lab 1 0 0 2 2 60 40

5 CP 302 Computer Architecture 3 3 0 0 3 40 60

6 CP 307 Computer Graphics 3 3 0 0 3 40 60

7 CP 305 Web Technology 3 3 0 0 3 40 60

8 CP 352 Computer Architecture Lab 1 - - 2 2 60 40

9 CP 353 DBMS Lab 1 - - 2 2 60 40

10 CP 355 Industrial oriented Web Programming Project Lab 2 - - 2+2 2 60 40

Year: III Session 2017-2018 Semester: VI

4 CP 304 Theory of Computation 4 3 1 - 3 40 60

5 CP 306 Computer Network 3 3 - - 3 40 60

6 CP 411 Multi Media System 3 3 - - 3 40 60

7 Major Project (Stage I) 3 - - 5 2 60 40

9 CP 358 Android Lab 1 - - 2 2 60 40

Year: IV Session 2018-2019 Semester: VII

S. Course Course Name Credits Contact Exam Weightage

6 CP 405 Operating System 4 3 1 - 3 40 60

7 CP 408 Distributed System 3 3 - - 3 40 60

9 CP 455 Operating System Lab 1 - - 2 2 60 40

11 Major Project (Stage II) 4 - - 8 2 60 40

Year: IV Session 2017-2018 Semester: VIII

S. Course Course Name Credits Contact Exam Weightage

4 CP 408 Advance Computer Architectures 3 3 - - 3 40 60

5 CP 404 Compiler Construction 4 3 1 - 3 40 60

11 CP 418 Data Compression Technique 3 3 - - 3 40 60

12 CP 414 Embedded System 3 3 - - 3 40 60

GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY

LIST OF COURSES OFFERED

Course code Course Name Credits Contact Exam Weightage

CP 201 Data Structure & Algorithms 4 3 1 - 3 40 60

Units Contents of the Course Hours

CP 102 C++ C (L, T, P) = 3 (3, 0, 0)

Unit Contents of the Course Hours

CP 103 BASICS OF MATLAB C (L, T, P) = 3 (3, 0, 0)

Unit Contents of the Course Hours

Saving and loading data, plotting simple graphs

IV Advanced data objects, Multi-dimensional matrices, Structures,

Text & Reference Books :

CP 151/152 COMPUTER PROGRAMMING LAB C (L, T, P) = 1 (0, 0, 2)

S.No. List of Experiments

CP 154 OBJECT ORIENTED PROGRAMMING LAB C (L, T, P) = 1 (0, 0, 2)

Write a program to find the greatest between four numbers.

CP 15 PYTHON LAB C (L, T, P) = 1 (0, 0, 2)

S.No Name of Experiment

1 Create a calculator program

2 Explore String functions

3 Implement sequential search

4 Implement Selection sort

6 Creating a CSV File based on user input