Académique Documents
Professionnel Documents
Culture Documents
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
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
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
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
S. Course Course Name Credits Contact Exam Weightage
No. Code Hrs/Wk. Hrs. (in%)
L T P CIE ESE
University Core
1 ES 104 Employability Skill 4 1 0 2 0
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
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
Note:- Industrial training for 45 days after 6th Semester Exams is compulsory.
S. Course Course Name Credits Contact Exam Weightage
No. Code Hrs/Wk. Hrs. (in%)
L T P CIE ESE
University Core
1 ES 105 Employability Skills 5 1 0 2 0
2 Proficiency in Co-Curricular Activities 2 - - - 100
Program Core
3 CP 308 Design Analysis & Algorithm 4 3 1 - 3 40 60
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
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
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
Scripts and functions, Script files, Function files, Global Variables, Loops, Branches,
III
Control flow 7
5 Implement Stack
7 Reading a CSV File already created and check for a specific pattern
Recommended Books
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.
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)
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.
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
UNIT CONTENTS
UNIT-I GRAMMAR Tense
Question Tags
Modal Verbs
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
Recommended books
1 Phonetics
4 Affixes
6 Paper presentation
7 Seminar presentation
8 Reading comprehension
9 Group Discussion
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
1 Communication
4 Body Language
5 Team building
6 Time Management
7 Interview 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)
Units Contents of the Course Hours
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
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)
Books Recommended
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)
26
HS 203 ECONOMICS AND SOCIAL SCIENCES C(L,T,P) = 3 (3,0,0)
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
27
CP 203 PRINCIPLES OF PROGRAMMING LANGUAGE C(L,T,P) = 3 (3,0,0)
28
EC 223: SWITCHING THEORY AND LOGIC DESIGN C(L,T,P) = 3 (3,0,0)
29
Total 34
Reference Books:
1. J.Millman & C.C. Halkias :Integrated Electronics, McGraw Hill
2. Millman Grabel: Microelectronics, McGraw Hill.
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.
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).
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.
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.
31
EC 212 MICROPROCESSOR AND INTERFACES C(L,T,P) = 4 (3,1,0)
Reference Books:
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
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)
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.
Reference Books:
1) Vikas thada, Review to OST
2) Balaguruswamy concepts of open source concepts
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.
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
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.
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.
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.
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)
Reference Books:
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.
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
I 6
Complexity classes, P/NP/PSPACE, reductions, hardness, completeness, hierarchy, relationships between complexity
classes.
II 7
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)
Reference Books:
1. S.Jawadekar: Management Information System, (Tata McGraw Hill)
2. Loudon & Loudon-Management Information Systems, Pearson Education Asia.
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.
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
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.
45
CP 304 THEORY OF COMPUTATION C(L,T,P) = 4 (3,1,0)
46
CP 411 MULTIMEDIA SYSTEMS C(L,T,P) = 3 (3,0,0)
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.
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)
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)
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.
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)
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
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
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
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
Reference Books:
53
DIGITAL IMAGE PROCESSING C(L,T,P) = 3 (3,0,0)
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.
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:
Reference Books:
56
3. Stallings B-ISDN & ATM with Frame Relay-Pearson
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
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)
Reference Books:
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)
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.
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.
Reference Books:
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:
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
Access control, Autonomic Security, Cloud computing security challenges: Virtualization security
management- virtual
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.
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
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)..
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
Total 35
Reference Books:
64
CP 410 EMBEDDED SYSTEMS C(L,T,P) = 3 (3,0,0)
Reference Books:
th
1. William Stallings: Embedded System (PHI, 5 Ed.)
2. James Martin: semiconductor in computer (PHI, 3rd Ed.)
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
Total
Reference Books:
3. LALA: Digital systems design using PLDs PHI 1990.
4. N. N. Biswas: Logic Design theory, PHI 1990.
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)
Reference Books:
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
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
1,2 Write a Program to identify data storage statements in an 8086 assembly language program and estimate the size of
data segment.
4,5. Extend the above program to implement simple and recursive macro expansion.
7, 8 Write a program to parse source code string of C-language and identify token in terms of keywords and identifiers.
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.
69