DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING …vcenggw.ac.in/pdf/cse/ug/cse_ug_regulation2013.pdf · VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN (Autonomous Institution Affiliated

1

VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN

(Autonomous Institution Affiliated to Anna University, Chennai)

Elayampalayam, Tiruchengode – 637 205

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CURRICULUM & SYLLABUS

UG - R2013




CURRICULUM

(Applicable to the students admitted from the academic year 2013 - 2014 onwards)

Programme B.E. Programme Code 101 Regulation 2013

Department COMPUTER SCIENCE AND ENGINEERING Semester I

Course Code Course Name Periods / Week Credit Maximum Marks

L T P C CA ESE Total

THEORY

U13EN101 Technical English – I* 3 0 2 4 50 50 100

U13MA101 Engineering Mathematics – I* 3 1 0 4 50 50 100

U13PH101 Engineering Physics* 3 0 0 3 50 50 100

U13CH101 Engineering Chemistry* 3 0 0 3 50 50 100

U13CS101 Computer Programming* 3 0 0 3 50 50 100

U13GE101 Engineering Graphics* 2 0 3 4 50 50 100

PRACTICAL

U13PC101 Physics and Chemistry Laboratory* 0 0 3 2 50 50 100

U13CS102 Computer Practices Laboratory* 0 0 3 2 50 50 100

Total Credits 25 400 400 800

CA - Continuous Assessment, ESE - End Semester Examination

*Common Syllabus for CSE, EEE, ECE, IT & BT

2




CURRICULUM

(Applicable to the students admitted from the academic year 2013 - 2014 onwards)


Department COMPUTER SCIENCE AND ENGINEERING Semester II



THEORY

U13EN202 Technical English – II* 3 0 2 4 50 50 100

U13MA202 Engineering Mathematics – II* 3 1 0 4 50 50 100

U13PH202 Material Science* 3 0 0 3 50 50 100

U13CH202 Environmental Science and

Engineering* 3 0 0 3 50 50 100

U13EC201 Electronic Devices and Circuits* 3 1 0 4 50 50 100

U13CS203 Object Oriented Programming* 3 0 0 3 50 50 100

PRACTICAL

U13GE203 Engineering Practices Laboratory* 0 0 3 2 50 50 100

U13CS204 Object Oriented Programming

Laboratory* 0 0 3 2 50 50 100



*Common Syllabus for CSE, EEE, ECE &IT

3


(Autonomous Institution Affiliated to Anna University Chennai)



Department COMPUTER SCIENCE AND ENGINEERING Semester III

CURRICULUM

(Applicable to the students admitted from the academic year 2013-2014 onwards)



THEORY

U13MA303 Discrete Mathematics and Graph

Theory+ 3 1 0 4 50 50 100

U13CS305 Data Structure using C++* 3 0 0 3 50 50 100

U13CS306 Paradigms in Programming 3 0 0 3 50 50 100

U13CS307 Unix Internals 3 0 1 4 50 50 100

U13CS308 Database and Information System 3 0 0 3 50 50 100

U13EC307 Logic Design+ 3 0 0 3 50 50 100

PRACTICAL

U13CS309 Data Structure using C++ Laboratory* 0 0 3 2 50 50 100

U13CS310 Database and Information System

Laboratory 0 0 3 2 50 50 100

U13EC308 Logic Design Laboratory 0 0 3 2 50 50 100



*Common Syllabus for CSE, EEE, ECE & IT

+Common Syllabus for CSE & IT

4





Department COMPUTER SCIENCE AND ENGINEERING Semester IV

CURRICULUM




THEORY

U13MA406 Numerical Methods 3 1 0 4 50 50 100

U13CS413 Advanced Java Programming 3 0 0 3 50 50 100

U13CS414 Design and Analysis of Algorithms 3 1 0 4 50 50 100

U13IT404 Operating Systems* 3 1 0 4 50 50 100

U13CS415 Computer Graphics 3 0 0 3 50 50 100

U13CS416 Computer Architecture 3 0 0 3 50 50 100

PRACTICAL

U13CS417 Advanced Java Programming

Laboratory 0 0 3 2 50 50 100

U13CS418 Computer Graphics Laboratory 0 0 3 2 50 50 100

U13IT407 Operating System Laboratory* 0 0 3 2 50 50 100



* Common Syllabus for CSE & IT

5





Department COMPUTER SCIENCE AND ENGINEERING Semester V

CURRICULUM




THEORY

U13CS519 Data Warehousing and Data Mining 3 0 0 3 50 50 100

U13CS520 Theory of Computation* 3 0 0 3 50 50 100

U13CS521 Web Technology 3 1 0 4 50 50 100

U13CS522 System Software 3 0 0 3 50 50 100

U13CS523 Computer Networks 3 0 0 3 50 50 100

U13CS524 Software Engineering* 3 0 0 3 50 50 100

PRACTICAL

U13EN503 Communication Skills & Career

Development Practice Laboratory 0 0 3 2 50 50 100

U13CS525 Web Technology Laboratory 0 0 3 2 50 50 100

U13CS526 Computer Networks Laboratory 0 0 3 2 50 50 100




6





Department COMPUTER SCIENCE AND ENGINEERING Semester VI

CURRICULUM




THEORY

U13CS628 Artificial Intelligence 3 1 0 4 50 50 100

U13CS629 Big Data Analytics 3 0 0 3 50 50 100

U13CS630 Object Oriented and Analysis Design* 3 1 0 4 50 50 100

U13CS631 Compiler Design 3 0 0 3 50 50 100

U13CS632 XML and Web Services 3 0 0 3 50 50 100

Elective-I 3 0 0 3 50 50 100

PRACTICAL

U13CS633 Compiler Design Laboratory 0 0 3 2 50 50 100

U13CS634 Case Tools Laboratory 0 0 3 2 50 50 100

U13CS635 XML and Web Services Laboratory 0 0 3 2 50 50 100




7





Department COMPUTER SCIENCE AND ENGINEERING Semester VII

CURRICULUM




THEORY

U13CS736 Open Source Software 3 0 0 3 50 50 100

U13CS737 Cloud Computing 3 0 0 3 50 50 100

U13CS738 Cryptography and Network Security 3 1 0 4 50 50 100

U13CS739 Mobile Computing 3 0 0 3 50 50 100

Elective-II 3 0 0 3 50 50 100

Elective-III 3 0 0 3 50 50 100

PRACTICAL

U13CS740 Open Source Software Laboratory 0 0 3 2 50 50 100

U13CS741 Mobile Application Development

Laboratory 0 0 3 2 50 50 100

U13CS742 Mini-project 0 0 3 2 50 50 100



8





Department COMPUTER SCIENCE AND ENGINEERING Semester VIII

CURRICULUM



Cumulative Course Credits: 194



THEORY

U13CS843 Software Project Management 3 0 0 3 50 50 100

Elective-V 3 0 0 3 50 50 100

Elective-VI 3 0 0 3 50 50 100

PRACTICAL

U13CS844 Project Work 0 0 12 6 100 100 200


9





Department COMPUTER SCIENCE AND ENGINEERING Semester -

CURRICULUM


ELECTIVE – I



THEORY

U13CSE01 Microprocessor and Microcontroller 3 0 0 3 50 50 100

U13CSE02 Visual Programming 3 0 0 3 50 50 100

U13CSE03 Middleware Technology 3 0 0 3 50 50 100

U13CSE04 Distributed Systems 3 0 0 3 50 50 100

U13CSE05 Real Time Systems 3 0 0 3 50 50 100

U13CSE06 Advanced Database Technology 3 0 0 3 50 50 100


10






CURRICULUM


ELECTIVE – II & III

Course Code Course Name Periods / Week Credi

t Maximum Marks


THEORY

U13CSE07 Digital Signal Processing 3 0 0 3 50 50 100

U13CSE08 Client Server Computing 3 0 0 3 50 50 100

U13CSE09 Advanced Operating System 3 0 0 3 50 50 100

U13CSE10 Professional Ethics in Engineering 3 0 0 3 50 50 100

U13CSE11 Digital Image Processing 3 0 0 3 50 50 100

U13CSE12 Embedded Systems 3 0 0 3 50 50 100

U13CSE13 Advanced Computer Architecture 3 0 0 3 50 50 100

U13CSE14 Human Computer Interaction 3 0 0 3 50 50 100

U13CSE15 Enterprise Resource Planning 3 0 0 3 50 50 100

U13CSE16 Multimedia Systems 3 0 0 3 50 50 100

U13CSE17 C# and .Net Framework 3 0 0 3 50 50 100


11






CURRICULUM


ELECTIVE – IV, V & VI

Course Code Course Name Periods / Week Credi

t Maximum Marks

L T P C CA ESE Tota

l THEORY

U13CSE18 Adhoc & Wireless Sensor Networks 3 0 0 3 50 50 100

U13CSE19 Soft Computing 3 0 0 3 50 50 100

U13CSE20 Service Oriented Architecture 3 0 0 3 50 50 100

U13CSE21 Multi-Core Architectures and

Programming 3 0 0 3 50 50 100

U13CSE22 Nano Computing 3 0 0 3 50 50 100

U13CSE23 Information Security 3 0 0 3 50 50 100

U13CSE24 Machine Learning 3 0 0 3 50 50 100

U13CSE25 Indian Constitution and Society 3 0 0 3 50 50 100

U13CSE26 Information Retrieval 3 0 0 3 50 50 100

U13CSE27 Social Network Analysis 3 0 0 3 50 50 100

U13CSE28 Software Testing and Quality Assurance 3 0 0 3 50 50 100

U13CSE29 Total Quality Management 3 0 0 3 50 50 100

U13CSE30 Advances in Compiler Construction 3 0 0 3 50 50 100

U13CSE31 Computational Number Theory 3 0 0 3 50 50 100

U13CSE32 Advanced Graph Theory 3 0 0 3 50 50 100


12




Programme B.E. / B.Tech. Programme Code Regulation 2013

Department CSE, EEE, ECE, IT & Bio-Tech. Semester I

Course

Code Course Name

Periods / Week Credit Maximum Marks


U13EN101 Technical English – I 3 0 2 4 50 50 100

Course

Objective

Develop listening skills for academic and professional purposes

Acquire the ability to speak effectively in real life situations.

Develop effective reading skills

L –Listening , R –Reading, W –Writing , S –Speaking, LF- Language Focus

Unit – I Periods 12

L-Types of Listening, R-Basic Reading Comprehension, W- Introduction to writing strategies, S-

Conversational Skills, LF - Language Focus-Technical terms, collocations and Grammar. SUGGESTED

ACTIVITIES :L-Listening to conversations, R-Reading Instructions and Technical Manuals, W-Writing

Definitions, S-Short Conversations through role play, LF-Activities relating to understanding and using active

and passive general and technical vocabulary Basic sentence patterns; Exercises relating to technical terms,

tenses (past, present, perfect and continuous tenses).

Unit – II Periods 12

L- Types of Listening, R - Reading Comprehension, W- Introduction to writing strategies, S - Strategies for

developing conversational skills, LF - Tenses and concord. SUGGESTED ACTIVITIES:L-Listening to

lectures, listening to description of equipment, R-Reading e-mails, Reading headlines, predicting content, W-

Note making, writing descriptions, S-Asking questions, participating in discussions, LF-Exercises related to

special uses of tenses, Subject - verb agreement.

Unit – III Periods 12

L-Enhancing Listening Skills, R-Intensive reading, W-Effective writing strategies, S -Improving fluency

through oral practice, LF-Form and Informal usage of words, Use of the passive forms.

SUGGESTED ACTIVITIES: L-Listening to different kinds of interviews (Face - to - face, radio, TV and

telephone interviews), R-Reading passages for gist, W-Informal writing -short e-mails (Focus on brevity,

coherence and cohesion), Memos, S - Role play and describing, LF -Descriptive words, verbs to describe

Unit – IV Periods 12

L - Note taking, R-Reading strategies, W-Effective writing strategies-Informal, S - Improving fluency

through oral practice, LF - Cause and Effect, Modals. SUGGESTED ACTIVITIES: L-Taking down notes,

R-Reading passages for specific information, W- Phone messages (Focus on brevity, coherence and

cohesion), S- Pronunciation (Phonetic sounds-vowels, consonants and diphthongs), LF -Exercises related to

cause and effect (if - clauses and types), usage of modal verbs.

Unit – V Periods 12

L-Listening for nuances of tone, R-Reading for a purpose, information transfer, W- Effective writing

strategies – Formal, S-Improving fluency through oral practice, LF - Descriptive Vocabulary -Word building.

SUGGESTED ACTIVITIES: L-Activities relating to variation in tone, listening to welcome speeches, R -

Reading business documents, interpreting graphical representations, W-Writing business e-mails, Segmental

and suprasegmental features-stress and intonation, LF -Exercises related to describing objects and usage of

prefixes and suffixes, synonyms and antonyms.

Total Periods 60

TEXT BOOK:

1. Norman Whitby - Business Benchmark Pre-Intermediate to Intermediate, Students Book, Cambridge

13

University Press, 2008. , 1997.

REFERENCE BOOKS:

1. Dutt Rajeevan, Prakash -A Course in Communication Skills(Anna University, Coimbatore Edition) :

Cambridge University Press India Pvt.Ltd, 2007.

2. Meenakshi Raman and Sangeeta Sharma -Technical Communication English Skills for Engineers',;

Oxford University Press, 2008.

3. S.P. Dhanavel ,English and Communication Skills for Students of Science and Engineering, , Orient

Blackswan Pvt, Ltd, 2009.

4. Technical English – I & II, Sonaversity, Sona College of Technology, Salem, First Edition, 2012.

EXTENSIVE READING:

1. A.P.J. Abdul Kalam with Arun Tiwari, „Wings of Fire‟ An Autobiography, University Press India

Pvt. Ltd., 1999, 30th Impression 2007.

2. Randy Pausch, The Last Lecture: July 2008. Author Randy Pausch with Jeffrey Zaslow, Publication

date April 8, 2008.

3. Edward De Bono :Six Thinking Hats, Little Brown & Co. 1999

E RESOURCES FOR EXTENSIVE READING

http://www.cs.cmu.edu/~pausch/Randy/pauschlastlecturetranscript.pdf

http://www.youtube.com/watch?v=j7zzQpvoYcQ

http://www.volunteeringnthqld.org.au/6ThinkingHatsHandout.pdf

http://www.is-toolkit.com/workshop/hats/ChangeManagement6ThinkingHats.pdf

http://www.debonogroup.com/video_1.php

http://www.youtube.com/watch?v=QJmoq1R3KVc

http://www.go4tech.in/ebooks/WingsoffirebyAbdulKalam.pdf

Course

Outcome

Able to acquire and develop communication skills for academic, social and professional

purposes.

Exhibit effective reading skills

Improve their vocabulary

Write effectively in informal and professional situations.

http://en.wikipedia.org/wiki/Randy_Pausch

http://en.wikipedia.org/wiki/Jeffrey_Zaslow




http://www.is-toolkit.com/workshop/hats/ChangeManagement6ThinkingHats.pdf




14


(Autonomous Institution, Affiliated to Anna University, Chennai)




Course

Code Course Name



U13MA101 Engineering Mathematics – I 3 1 0 4 50 50 100

Course

Objective

To have knowledge in Matrices, Sequences and Series, Ordinary Differential

Equation

To have knowledge in differential Calculus, Functions of several variables.

Unit - I MATRICES Periods 9+3

Introduction - Characteristic Equation-Eigen Values and Eigen Vectors of a Real matrix- Properties- Cayley-

Hamilton Theorem ( excluding Proof) –Orthogonal transformation of a symmetric matrix to diagonal form-

Reduction of quadratic form to canonical form by orthogonal transformation-nature of quadratic form .

Unit - II SEQUENCES AND SERIES Periods 9+3

Introduction- Sequences: Definition and examples – Series: Types and Convergence – Series of positive terms

– Tests of convergence: Comparison test, Integral test and D‟ Alembert‟s ratio test .

Unit - III ORDINARY DIFFERENTIAL EQUATION Periods 9+3

Introduction-Higher order Linear differential equation with constant coefficients-method of variation of

Parameters-Cauchy‟s and Legendre‟s linear equations.

Unit - IV DIFFERENTIAL CALCULUS Periods 9+3

Introduction- Curvature: Radius of curvature in Cartesian form - Centre of Curvature- Circle of Curvature-

Evolute-Envelope of one and two parameter family of curves.

Unit – V FUNCTIONS OF SEVERAL VARIABLES Periods 9+3

Introduction- Partial Derivatives-Total Derivatives-Jacobian‟s and properties – differentiation of implicit

functions - Taylor‟s Theorem for Function of Two Variables-Maxima and Minima of Functions of Two

Variables with Constraints- Method of Lagrangian Mutipliers.

Total Periods 60

REFERENCES:

1. B.V. Ramana“Higher Engineering Mathematics”, Tata McGraw-Hill Publication,

NewDelhi.2012

2. Dr. B.S Grewal, “Higher Engineering Mathematics” 37

th Edition , Khanna Publishers, New

Delhi,

FURTHER READINGS:

1. T. Veerarajan, “Engineering Mathematics”, Tata McGraw-Hill Publication, NewDelhi, 2008.

2. N.P. Bali, Manish Goyal, “Engineering Mathematics”, 3

rd Edition, Laxmi publications pvt.

Ltd, 2009.

3. Kanti Datta, “Mathematical methods of Science and Engineering”, Cengage Learning India Pvt

Ltd, 2013.

4. P.Sivaramakrishna Das and E. Rukmangadachari “Engineering Mathematics”, Second Edition,

Pearson‟s Publications.

5. Ravish R Singh/ Mukul Bhatt “Engineering Mathematics - I”, McGraw Hill Education.-2008

6. V.Sundaram, R. Balasubramanian and K.A. Lakshminarayanan ,“Engineering Mathematics” ,

Sixth Edition, Vikas Publishing House Pvt ltd,.

Course

Outcome

Able to get the knowledge and understanding in fields of materials of differential

equation.

Able to get the knowledge and understanding in integral and differential calculus.

15






Course

Code Course Name



U13PH101 Engineering Physics 3 0 0 3 50 50 100

Course

Objective

To Understand the difference between classical physics and Modern Physics

To know the different types of laser and its applications

To know the new technology in Fiber optics and to know the structure in crystal physics.

Unit - I ELEMENTARY MODERN PHYSICS Periods 9

Theory of Relativity - concept of theory of relativity - Frames of reference- Inertial frames of reference-

Postulates of special theory of relativity- variation of mass with velocity – Mass-Energy equivalence -

relativistic relation between energy and momentum-Black body radiation – Plank‟s theory- Wien‟s

displacement law- Rayleigh Jeans law – Photo electric effect- Einstein‟s Photo electric equation - Wave

particle Duality –de-Broglie Hypothesis - Wavelength, properties of matter waves.

Unit – II QUANTUM PHYSICS Periods 9

Compton effect- Experimental verification of Compton effect – Importance of Compton effect- wave

function, Schrodinger‟s Time dependent and Time independent wave equations –Applications –Particle in a

one –Dimensional box –Scanning electron microscope (SEM)- Transmission electron microscope (TEM).

Unit – III LASER Periods 9

Introduction –Atomic Excitation and Energy States -Interaction of External Energy with the Atomic Energy

States - Einstein Coefficients - derivation. Population inversion, pumping mechanism Coefficients-

Components of Laser system- Types of lasers –CO2, Semiconductor laser (homojunction and heterojunction).

Qualitative Industrial Applications of laser – Laser in welding, heat treatment, cutting etc. – medical

applications – Holography (construction and reconstruction).

Unit – IV FIBER OPTICS AND APPLICATIONS Periods 9

Principle and propagation of light in optical fibers- Numerical aperture and acceptance angle –Types of optical

fibre (material, mode and refractive index)- Double crucible technique of fibre drawing - Splicing, loss in

optical fibre - attenuation, dispersion, bending- fiber optical communication system (Block diagram) –Light

sources – Detectors- Fibre Optic sensors –temperature and displacement sensor – Fibre Endoscope.

Unit – V CRYSTAL PHYSICS Periods 9

Lattice –unit cell – Bravais space lattice – Lattice planes –Miller indices- d spacing in cubic lattice –

Calculation of number of atoms per unit cell- Atomic radius – Coordination number- Packing Factor for Sc,

Bcc, Fcc and Hcp structures – Zns and Graphite structures- polymorphism and allotropy – Crystal defects –

point, line and surface defects – Burger vector.

Total Periods 45

TEXT BOOKS:

1. B.K. Pandey, S. Chaturvedi. “Engineering Physics”, Cengage Learning India Pvt Ltd. (2012).

REFERENCES:

1. Dattu R Joshi, “Engineering Physics”, Tata McGraw Hill Education Pvt Ltd. New Delhi, (2012)

2. M.N.Avadhanulu, “Engineering Physics-I”, S.Chand & Company Ltd. New Delhi, (2009)

3. V. Rajendran, “Engineering Physics”, Tata McGraw Hill Education Pvt Ltd. New Delhi, (2012)

Course

Outcome

Understand the difference between classical physics and Modern Physics

Able to apply the laser technology and Fiber optics in various communication processes.

16





Department CSE, EEE, ECE, IT, & Bio-Tech. Semester I

Course

Code Course Name



U13CH101 Engineering Chemistry 3 0 0 3 50 50 100

Course

Objective

To conversant with basic concepts of solar cells and its applications.

To enrich with conventional and non conventional energy sources, storage devices and

fundamentals of nano materials.

To have knowledge of principles of polymer chemistry and engineering applications of

polymers

Unit - I SOLAR CELLS Periods 9

Introduction – Photovoltaic cells - importance of solar cells - P-N junction of solar cell - conversion of light into

electricity - doping of silicon for photovoltaics - properties of silicon - production of solar grade from Quartz -

manufacture of photovoltaic cell - Solar panels- applications.

Unit - II NUCLEAR CHEMISTRY Periods 9

Introduction – Nuclear energy - Mechanism of nuclear fission and fusion - chain reactions-critical mass- light

water nuclear reactor for power generation (block diagram only) - breeder reactor- Safety and disposal of

Nuclear plant - radiation hazards and their prevention.

Unit - III NANO MATERIALS Periods 9

Introduction – Basics - distinction between molecules, nanoparticles and bulk materials; size-dependent

properties. Nanoparticles - Synthesis: Precipitation, sol gel method, laser ablation, spray pyrolysis, Chemical

vapour deposition, Arc-discharge method; properties and applications

Unit - IV BATTERIES AND FUEL CELLS Periods 9

Batteries - basic concepts - characteristics - classifications - classical batteries - modern batteries- Lithium

batteries - fuel cells - types and classifications of fuel cells - merits of fuel cells and applications of batteries.

Unit - V POLYMERS AND CONDUCTING POLYMERS Periods 9

Definitions - classification of Polymers - types of polymerization - glass transition temperatures (Tg) - structure

and property relationship of polymers - Plastics - synthesis - property - applications of thermoset - thermo

plastics (PE, PTFE, PMMA, PU, PC, Bakelite, Urea formaldehyde) ) - Conducting polymers - conduction

mechanism of poly acetylene, polypyrole and polyaniline.

Total Periods 45

TEXT BOOKS:

1. O.G.Palanna,”Engineering Chemistry”,4thedition ,Tata Mc GrawHill PVT,Ltd.2012

2. N. Krishnamurthy, P. Vallinayagam, D. Madhavan, 2nd edition , Eastern EconomyEdition.2009

REFERENCES:

1. Arnicker, Advanced nuclear chemistry, 4th edition, Wiley 1995

2. Fred.w.Billmeyer, Text book of Polymer Chemistry,14

th edition , inter science publisher-New

Delhi,2007

3. Prasanna Chandrasekar, Conducting polymer, Fundamentals and Application,2

nd edition,

Springer,2003.

Course

Objective

Able to conversant with basic concepts of solar cells and its applications

Able to enrich with conventional and non conventional energy sources, storage devices and

fundamentals of nano materials.

Able to have knowledge of principles of polymer chemistry & engineering applications of

polymers

17








U13CS101 Computer Programming 3 0 0 3 50 50 100

Course

Objective

To provide an in-depth knowledge in computer fundamentals.

To provide the basics of C programming language.

To enhance the knowledge in application relevant to C programming language.

Unit – I COMPUTER FUNDAMENTALS Periods 9

Introduction – Evolution – Generation – Classification – Components of Computer Systems – Application –

Evolution of Internet – Classification of Programming Languages – Algorithm , Pseudo Code , Flowchart.

Unit – II FUNDAMENTALS OF C Periods 9

Introduction – Identifier, Keywords, Variables, Data types of C, Constants – Operators and Expression – Type

conversion in C – Formatted Input and Output functions – Decision Making and Branching – Conditional

Operators – Switch Statement, While Construct, GOTO statements, Nested Loops.

Unit – III ARRAYS AND STRINGS Periods 9

Introduction – One Dimensional Arrays – Working with 1D Array – Strings – String Manipulations – N

Dimensional Array – Working with 2D Arrays – Arrays of Strings – Manipulating String Arrays.

Unit – IV FUNCTIONS AND POINTERS Periods 9

Concept of Function – User Defined Functions – Scope Rules – Storage Classes – Recursion, Common Errors –

Pointers: Void and Null Pointers – Arrays and Pointers – Pointer and Strings, Pointer Arithmetic – Dynamic

Memory Allocation.

Unit – V USER DEFINED DATA TYPES & VARIABLES Periods 9

Introduction – Structures – Structures within Structures – Array of Structures – Array within Structures –

Structures and Pointers – Structures and Functions – Union – Enumeration Types – Bit Fields.

Total Periods 45

REFERENCES:

1. Pradip Dey and Manas Ghosh, “Fundamentals of Computers with Programming in C”, First

Edition, Oxford University Press, 2009.

2. Behrouz A.Forouzan and Richard.F.Gilberg,”A Structured Programming Approach Using C”, II

edition,Brooks-Cole Thomson Learning Publications,(2007).

FURTHER READINGS:

1. Balagurusamy. E “Programming in ANSI C”, Fourth Edition, Tata McGraw Hill, 2008.

2. Ashok N. Kamthane, “Computer Programming”, Second Edition, Dorling Kindersley (India) Pvt.

Ltd., Pearson Education, 2012.

3. Anita Goel and Ajay Mittal, “Computer Fundamentals and Programming in C”, Dorling Kindersley

(India) Pvt. Ltd., Pearson Education in South Asia, 2011

4. Byron Gottfried, “Programming with C”, 2

nd Edition, (Indian Adapted Edition), TMH publications,

(2006).

5. Stephen G.Kochan, “Programming in C”, Third Edition, Pearson Education India, (2005).

Course

Outcome

Able to understand the computer basics

Design C Programs for real world problems.

Write and execute C programs for simple applications.

18








U13GE101 Engineering Graphics 2 0 3 4 50 50 100

Course

Objective

To develop engineering drawing and drafting skills for communication of concepts, ideas

and design of engineering products.

To expose the existing national standards related to technical drawings

Introduction Introduction to Engineering Drawing. BIS. Principles of dimensioning Periods 5

Unit - I PROJECTION OF POINTS, LINES AND PLANE SURFACES Periods 15

Orthographic projection- Principles-Principal planes-First angle projection-Projection of points and straight lines

located in the first quadrant- Determination of true lengths and true inclinations-Projection of Polygonal surface

and circular lamina inclined to both reference planes.

Unit - II PROJECTION OF SOLIDS Periods 15

Projection of simple solids like prisms, pyramids, cylinder and cone when the axis is inclined to one reference

plane by change of position method.

Unit - III SECTION OF SOLIDS Periods 10

Sectioning of regular solids in simple vertical position when the cutting plane is inclined to the one of the principal

planes and perpendicular to the other-Obtaining true shape of section.

Unit - IV DEVELOPMENT OF SURFACES Periods 15

Development of lateral surfaces of regular solids and truncated solids.

Unit - V PICTORIAL PROJECTIONS Periods 15

Principles of pictorial views-Orthographic views from given pictorial view-Isometric view from given two or three

views.

Total Periods 75

REFERENCES

1. Venugopal K, Prabhu Raja V, “Engineering Graphics “ New Age International Publishers, 2007.

2. Bhatt.N.D and Panchal V.M., “Engineering Drawing”, 50

th Edition, Charotar Publishing House,

2010.

3. Bureau of Indian Standards, “Engineering Drawing Practices for Schools and Colleges SP 46-2003”,

BIS New Delhi, 2004.

4. Natarajan K V, "Engineering Drawing and Graphics", M/s Dhanalakshmi N, Chennai, 2007

SPECIAL POINTS APPLICABLE TO END SEMESTER EXAMINATIONS ON ENGINEERING

GRAPHICS

1. There will be five questions, each of either or type covering all units of the syllabus

2. All questions will carry equal marks of 20 each making a total of 100

3.

Students have to answer the questions by using only standard drafting and modeling software

packages such as AutoCAD, ProE, SolidEdge, etc., in the Engineering Graphics lab. Printouts are

treated as answer scripts for external evaluation.

19

Course

Outcome

Able to know and understand the conventions and the methods of engineering drawing.

Interpret engineering drawings using fundamental technical mathematics.

Construct basic and intermediate geometry.

Able to improve their visualization skills so that they can apply these skills in developing new

products and comprehend the theory of projection




Programme B.E. / B. Tech. Programme Code Regulation 2013


Course

Code Course Name



U13PC101 Physics and Chemistry

Laboratory 0 0 3 2 50 50 100

PHYSICS:

Course

Objective

To provide a quality based engineering application in physics laboratory

To know the concepts in Laser, spectrometer grating, prism, Young‟s modulus and the Air

wedge experiments.

LIST OF EXPERIMENTS (Any five)

1. a) Determination of Laser Wavelength.

b) Particle size determination using Diode Laser

2. Determination of wavelength of mercury spectrum – spectrometer grating.

3. Determination of Young‟s modulus of the uniform bar- Non-uniform method.

4. Determination of dispersive power of a prism – spectrometer.

5. Determination of thickness of thin wire – Air wedge method.

6. Determination of Numerical Aperture, Attenuation and Acceptance angle using Optical Fiber.

Course

Outcome

Able to evaluate the modulus of elasticity, refractive index, wavelength and thickness of

wire.

Able to apply the principles of optics and laser in engineering field.

CHEMISTRY:

Course

Objective

To provide an in-depth knowledge in Chemistry laboratory

To understand the basis of conductance, potential value, pH.

LIST OF EXPERIMENTS (Any five)

1. Conductometric titration (Simple Acids and Bases).

2. Conductometric titration (Mixture of weak and Strong Acids).

3. Conductometric titration BaCl2 Vs Na2SO4

4. Potentiometric titration (Fe2+

/KMnO4 or K2Cr2O7).

5. pH metric titration (Acids and Bases).

6. Estimation of Ferric Iron by Spectrophotometer.

Course

Outcome

Able to have hands on Knowledge in the quantitative chemical analysis of water quality

related parameters.

Total Periods: 45

20








U13CS102 Computer Practices Laboratory 0 0 3 2 50 50 100

Course

Objective

To enhance the working knowledge in MS-Office.

To enhance the problem solving skills and algorithm design techniques.

To design and implement C programs using arrays and functions

To design programs using recursive functions, Structures and Union.

LIST OF EXPERIMENTS

1. Work with MS office/ Open Office for search, Generate and Manipulate data.

2. Process with Presentation and Visualization-graphs, charts, 2D, 3D.

3. Problem formulation, Problem Solving, Algorithms and Flowcharts.

4. Implement C Program using Simple statements and expressions.

5. Implement scientific problems solving using decision making and looping.

6. Implement C program for 1D and 2D arrays.

7. Basic C program for solving problems and string functions

8. C program using a user defined functions.

9. C program using Recursive functions.

10. C program for Structures and Unions

Course

Outcome

Have working knowledge in MS-Office.

Able to design and implement C programs using arrays and functions

Able to design programs using recursive functions, Structures and Union.

Total Periods : 45

21


(Autonomous Institution, Affiliated to Anna University ,Chennai)

Elayampalayam, Tiruchengode – 637 205.

Programme B.E. / B. Tech. Programme code Regulation 2013

Department CSE, EEE, ECE, IT & Bio-Tech. Semester II



U13EN202 Technical English – II 3 0 2 4 50 50 100

Aim To enable students to acquire and develop communication skills for academic, social

and professional purposes.

Course

Objective

Develop listening skills for academic and professional purposes

Develop effective reading skills


Write effectively in informal and professional situations

Abbreviation L –Listening , R –Reading, W –Writing , S –Speaking, LF- Language Focus

Unit – I Periods 12

L - Listening to cultural awareness, R - Inferential Reading, W- Letter writing - Informal and Formal

S - Developing confidence, LF - Adjectives, Degrees of comparison. SUGGESTED ACTIVITIES:

L - Listening to casual conversations, talks, interviews and lectures, R - Reading short messages and technical

articles - Thank you letters, calling for quotations, placing an order, seeking clarification, letters of complaint,

S -Describing and Discussing, LF -Exercises - equal and unequal comparison.

Unit – II Periods 12

L - Listening to specific information relating to technical content, R - Reading Texts, W- Letter writing –

Formal, S - Expressing opinions, LF - Simple, compound and complex sentences.

SUGGESTED ACTIVITIES: L- Listening for statistical information, R-Exercises related to articles (in

magazines) and comparing articles, W-Letter seeking permission to undergo practical training and undertake

project work, S-Exercises related to discussing, describing role play and oral summarizing, LF -Exercises

related to transformation of sentences.

Unit – III Periods 12

L - Listening to specific information relating to technical content, R-Skimming and Scanning, W- Formal

Letter writing, S-Giving Instructions, LF - Pronouns, Phrasal verbs, Restrictive and Non - restrictive clauses.

SUGGESTED ACTIVITIES: L-Exercises related to listening to interviews and presentations R - Reading

Job applications, W-Applying for a Job, Writing a CV, S-Exercises related to discussing, describing role play

and oral summarizing of instructions, LF -Exercises related to vocabulary and Grammar.

Unit – IV Periods 12

L - Listening and retrieving Information, R-Skimming and Scanning, W-Letter writing, Report writing, S -

Developing fluency and Coherence, LF - Countable, Uncountable nouns, Vocabulary relating to graphical

representation, Recommendations. SUGGESTED ACTIVITIES: L - Exercises related to listening and

retrieving information, R-Reading and understanding Advertisements, W-Letters to the Editor, Letter of

Complaint, Various kinds of Report writing meetings, industrial visits, S-Activities related to intonation and

improving voice quality, LF -Exercises related to vocabulary and grammar structure and examples of

situational recommendations (Should form).

22

Unit – V Periods 12

L - Listening and retrieving Information, R-Predicting content, W-Writing proposals, Agenda, Minutes of the

meeting, S-Developing coherence and self-expression, making presentations, LF-British and American

Vocabulary, Error Detection, Punctuation. SUGGESTED ACTIVITIES: L-Exercises related to listening

and retrieving information, gapped texts, R- Interpreting reports, W-Writing Proposals (Symposia, seminars,

conferences)Agenda and Minutes of the meeting (Class committee meeting etc.), S-Paralinguistic and extra

linguistic features (body language, short presentations), LF -Exercises related to British and American

vocabulary (Differences in vocabulary, spelling etc), Editing texts.

Total Periods

60

TEXT BOOK:

1. Norman Whitby - Business Benchmark Pre-Intermediate to Intermediate, Students Book,

Cambridge University Press, 2008, 1997.

REFERENCE BOOKS:

1. Dutt, Rajeevan, Prakash-A Course in Communication Skills (Anna University, Coimbatore

edition) :. Cambridge University Press India Pvt.Ltd, 2007

2. Meenakshi Raman and Sangeeta Sharma -Technical Communication English Skills for

Engineers',; Oxford University Press, 2008.

3. S.P. Dhanavel, English and Communication Skills for Students of Science and Engineering,

Orient Blackswan Pvt, Ltd, 2009.

4. Technical English – I & II, Sonaversity, Sona College of Technology, Salem, First Edition,

2012.

EXTENSIVE READING:

1. A.P.J. Abdul Kalam with Arun Tiwari, „Wings of Fire‟ An Autobiography, University Press

India Pvt. Ltd., 1999, 30th Impression 2007.

2. Randy Pausch, The Last Lecture: July 2008. Author Randy Pausch with Jeffrey Zaslow,

Publication date April 8, 2008

3. Edward De Bono :Six Thinking Hats, Little Brown & Co. 1999

E RESOURCES FOR EXTENSIVE READING:

1. http://www.cs.cmu.edu/~pausch/Randy/pauschlastlecturetranscript.pdf

2. http://www.youtube.com/watch?v=j7zzQpvoYcQ 3. http://www.volunteeringnthqld.org.au/6ThinkingHatsHandout.pdf 4. http://www.is-toolkit.com/workshop/hats/ChangeManagement6ThinkingHats.pdf

5. http://www.debonogroup.com/video_1.php

6. http://www.youtube.com/watch?v=QJmoq1R3KVc

7. http://www.go4tech.in/ebooks/WingsoffirebyAbdulKalam.pdf

Course

Outcome

Able to develop communication skills for academic, social and professional

purposes.

Exhibit effective reading skills


Write effectively in informal and professional situations.

http://en.wikipedia.org/wiki/Randy_Pausch

http://en.wikipedia.org/wiki/Jeffrey_Zaslow







23




Programme B.E./ B. Tech. Programme code Regulation 2013




U13MA202 Engineering Mathematics – II 3 1 0 4 50 50 100

Course

Objective

To have fundamental knowledge in Multiple Integrals, Complex integration, Vector

Calculus.

To have fundamental knowledge in Analytic functions, and Laplace Transforms.

Unit - I MULTIPLE INTEGRALS Periods 12

Introduction-Double Integral- Cartesian and polar coordinates-Change of Order of Integration-Change of

variables between Cartesian and polar coordinates-Area as double integral (Only Cartesian).

Unit – II COMPLEX INTEGRATION Periods 12

Introduction - Cauchy‟s Integral Theorem-Cauchy‟s Integral Formula-Singular points-Residues-Residue

theorem (excluding proof) -Applications of residue theorem to evaluate real Integrals.

Unit - III VECTOR CALCULUS Periods 12

Introduction- Gradient, Divergence and Curl-Directional derivative- Irrotational and solenoidal vector fields-

Vector Integration- Green‟s, Gauss divergence and Stoke‟s theorems (without proof)-Verification of the

above theorems and evaluation of Integrals using them.

Unit - IV ANALYTIC FUNCTIONS Periods 12

Introduction- Analytic functions-Necessary conditions, Cauchy-Riemann equation and sufficient conditions

(excluding proofs)-Harmonic and orthogonal properties of analytic function-Harmonic conjugate-

Construction of analytic functions.

Unit - V LAPLACE TRANSFORM Periods 12

Introduction- Laplace Transform- Conditions for existence-Transform of elementary functions-Basic

properties-Transform of derivatives and Integrals- Initial and final value theorems-Transform of unit step

function-Transform of periodic functions. Inverse Laplace transform-Convolution theorem-Residue theorem-

Partial Fraction method.

Total Periods 60

TEXT BOOK:

1. B.V. Ramana, “Higher Engineering Mathematics”, Tata McGraw-Hill Publication,

NewDelhi.2012

2. Dr. B.S Grewal, “Higher Engineering Mathematics”, 37th Edition. Khanna Publishers, NewDelhi

REFERENCES:

1. T. Veerarajan “Engineering Mathematics” , Tata McGraw-Hill Publication, NewDelhi, 2008

2. N.P.Bali,Manish Goyal,“Engineering Mathematics”,3rd

Edition,Laxmi publications pvt. Ltd, 2009

3. Kanti Datta “Mathematical methods of Science and Engineering”,Cengage Learning India Pvt

Ltd, 2013

4. P.Sivaramakrishna Das and E. Rukmangadachari “Engineering Mathematics”, 2

nd Edition,

Pearson‟s Publications,

5. Ravish R Singh/ Mukul Bhatt “Engineering Mathematics - I”, McGraw Hill Education.2010.

6. V.Sundaram, R. Balasubramanian and K.A. Lakshminarayanan “Engineering Mathematics” , 6

th

Edition , Vikas Publishing House Pvt ltd,.

Course

Outcome

Able to solve Vector Calculus, Laplace transforms and complex functions.

Able to solve Problems related to engineering applications by using these techniques

24




Programme B.E./ B. Tech. Programme code Regulation 2013

Department CSE, EEE, ECE , IT & Bio-Tech. Semester II

Course Code Course Name Periods /Week Credit Maximum Marks


U13PH202 Material Science 3 0 0 3 50 50 100

Course

Objective

To know the various types of materials and its properties

To get a brief knowledge in each materials and to know their characteristics.

Unit - I CONDUCTING MATERIALS Periods 9

Band theory of solids. Conductors, Semiconductors and Insulators – Classical free electron theory of metals –

Electrical and Thermal conductivity – Wiedemann – Franz law – Lorentz number – Draw backs of classical

theory – Quantum theory – Fermi distribution function – Effect of temperature on Fermi Function – Density

of energy states – carrier concentration in metals.

Unit - II SEMICONDUCTING MATERIALS Periods 9

Intrinsic semiconductor – carrier concentration derivation – Fermi level – Variation of Fermi level with

temperature – electrical conductivity – band gap determination– extrinsic semiconductors – carrier

concentration derivation in n-type and p-type semiconductor – variation of Fermi level with temperature and

impurity concentration – compound semiconductors – Hall effect –Determination of Hall coefficient –

Applications.

Unit - III MAGNETIC AND SUPERCONDUCTING MATERIALS Periods 9

Origin of magnetic moment – Bohr magneton – Dia and para magnetism – Ferromagnetism – Domain theory

– Hysteresis – soft and hard magnetic materials –antiferromagnetic materials – Ferrites. Superconductivity :

properties - Types of super conductors – BCS theory of superconductivity (Qualitative) - High Tc

superconductors – Applications ofsuperconductors – SQUID, cryotron, magnetic levitation.

Unit - IV DIELECTRIC MATERIALS Periods 9

Electrical susceptibility – dielectric constant – electronic, ionic, orientational and space charge polarization –

frequency and temperature dependence ofpolarisation – internal field – Claussius – Mosotti relation

(derivation) – dielectricloss – dielectric breakdown – uses of dielectric materials (capacitor and transformer) –

ferroelectricity and applications.

Unit - V MODERN ENGINEERING MATERIALS Periods 9

Metallic glasses: properties and applications. Shape memory alloys (SMA): Characteristics, properties of

NiTi alloy,application, advantages and disadvantages of SMA. Nanomaterials: synthesis –plasma arcing –

chemical vapour deposition – solgels– electrodeposition – ball milling - properties of nanoparticles and

applications – Quantum Dots. Carbon nano tubes: fabrication – arc method – pulsed laser deposition –

chemical vapour deposition - structure – properties and applications – carbon nanowires.

Total Periods 45

TEXT BOOKS:

1. B.K. Pandey, S. Chaturvedi. “Engineering Physics”, Cengage Learning India Pvt Ltd, 2012.

REFERENCES:

1. Jayakumar.S. „Materials science‟, R.K. Publishers, Coimbatore, 2008.

2. Rajendran.V, „Materials science‟, TMH publications, New Delhi, 2011.

3. Charles Kittel „ Introduction to Solid State Physics‟, 7

th edition, John Wiley & sons, Singapore,

2007

Course

Outcome

Understand the materials which relevant in day today life

To know the metals, semi conductors, magnetic materials, dielectric materials and nano

materials.

25




Programme B.E./ B. Tech. Programme Code Regulation 2013

Department EEE, ECE, CSE & IT Semester II



U13CH202 Environmental Science and

Engineering 3 0 0 3 50 50 100

Course

Objective

To conversant with environmental awareness and sustainable development

To know the importance of eco system and environmental problems

Unit – I NATURAL RESOURCES AND BIODIVERSITY

CONSERVATION Periods 9

Natural Resources-Forest, Water, Mineral, Food, Energy, and Land. Biodiversity: Concept, origin, values,

measurement and loss of biodiversity; needs for conservation of biodiversity; Hot spots of biodiversity and

Key stone species.

Unit – II ENVIRONMENTAL POLLUTION Periods 9

Water pollution, Air Pollution, Land pollution, Noise Pollution- effect and control; Sampling and

measurement of their quality and their analysis (Water Pollution).

Unit – III ENVIRONMENT AND ENERGY Periods 9

Fossil Fuels-Nuclear Energy-Solar Energy-Wind Energy-Geothermal Energy-Hydro electric energy-Tidal

energy-Green power.

Unit – IV GLOBAL ATMOSPHERIC CHANGE Periods 9

Global temperature-Green house effect-Global warming-Carbon cycle-Carbon emission from fossil fuel-Acid

rain-Climate change-Ozone layer depletion.

Unit – V SOLID WASTE MANAGEMENT AND RESOURCE

RECOVERY Periods 9

Source reduction-Collection and transfer operations-recycling-composting-discarded materials-waste to

energy combustion-landfills-E-Waste management.

Total Periods 45

TEXT BOOK:

1. Gilbert.M.Masters,“Environmental Science”,2nd

Edition,Pearson Education, 2004

2. Linda Williams, “Environmental Science”1st Edition, Tata McGraw Hill. 2008.

REFERENCES:

1. T.G.Miller Jr,“Environmental Science”,10th Edition,Wadsworth Publishing Co.2004

2. Cunnighum and Cooper,“Environmental Science” 4th Edition,Jaico Publ, House .2007

3. William P. Cunningham, Barbara Woodworth Saigo, “Environmental Science”, 4th Edition ,Tata

McGraw Hill.2011

Course

Outcome

To gain knowledge on Natural Resources and Biodiversity Conservation, Environmental

Pollution, Environment and Energy, Global Atmospheric Change, Solid Waste Management.

Resource Recovery will provide them a strong platform to understand the concepts in

Environmental Science and engineering for further learning and research.

Able to know about the sources of water and air pollution control methods.

26





Department CSE & IT Semester II

Course Code Course Name Periods Per Week Credit Maximum Marks


U13EC201 Electronic Devices and Circuits 3 1 0 4 50 50 100

Course

Objective

To acquaint the students with the construction, theory and operation of the basic

electronic devices such as PN junction diode, Bipolar and Field effect Transistors,

LED, Amplifiers, Oscillators and other amplifiers.

Unit – I PN JUNCTION DIODE Periods 12

PN junction diode –structure, operation and V-I characteristics, diffusion and transient capacitance -

Rectifiers – Half Wave and Full Wave Rectifier, – Display devices- LED, Laser diodes, Zener diode-

characteristics-Zener Reverse characteristics – Zener as regulator.

Unit – II TRANSISTOR Periods 12

BJT, JFET, MOSFET- structure, operation, characteristics and Biasing UJT, thyristor and IGBT -

Structure and characteristics.

Unit – III AMPLIFIERS Periods 12

BJT small signal model – Analysis of CE, CB, CC amplifiers- Gain and frequency response –

MOSFET small signal model– Analysis of CS and Source follower – Gain and frequency response- High

frequency analysis.

Unit – IV MULTISTAGE AMPLIFIERS AND DIFFERENTIAL

AMPLIFIER Periods 12

BIMOS cascade amplifier, Differential amplifier – Common mode and Difference mode analysis – FET input

stages – Single tuned amplifiers – Gain and frequency response – Neutralization methods, power

amplifiers –Types (Qualitative analysis).

Unit – V FEEDBACK AMPLIFIERS AND OSCILLATORS Periods 12

Advantages of negative feedback – voltage / current, series, Shunt feedback –positive feedback – Condition

for oscillations, phase shift – Wien bridge, Hartley, Colpitts and Crystal oscillators.

Total Periods 60

REFERENCES:

1. David A. Bell,”Electronic devices and circuits”, Prentice Hall of India, 2004.

2. Sedra and smith, “Microelectronic circuits “Oxford University Press, 2004.

3. Rashid, “Microelectronic circuits” Thomson publications, 1999.

4. Floyd, “Electron devices” 5th Edition, Pearson Asia, 2001.

5. Donald A Neamen, “Electronic Circuit Analysis and Design”, 3rd Edition, Tata McGraw Hill,

2003

6. Robert L.Boylestad, “Electronic devices and circuit theory”, 2002.

7. Robert B. Northrop, “Analysis and Application of Analog Electronic Circuits to

Biomedical Instrumentation”, CRC Press, 2004.

Course

Outcome

Operation of the basic electronic devices such as PN junction diode, Bipolar and Field effect

Transistors, LED, Amplifiers, Oscillators and other amplifiers

27






Course Code Course Name

Periods Per

Week Credit Maximum Marks


U13CS203 Object Oriented Programming 3 0 0 3 50 50 100

Course

Objective

To understand the concept of object -oriented programming and master OOP using C++

To develop the skills and understanding required to design and develop object oriented

applications.

Unit - I INTRODUCTION Periods 9

Object oriented approach-Characteristics of Object oriented languages – C++ Programming basics – Loops

and Decisions – Structures - Objects and Classes : A Simple class – C++ objects as physical objects – Classes,

Objects and Memory – Static Class data – Const and classes- Pointers : Memory management – Pointers to

objects- Pointers to Pointers.

Unit - II CONSTRUCTORS AND OPERATOR OVERLOADING Periods 9

Constructors – Objects as Function arguments - Default copy constructor –Assignment and Copy

Initialization -Returning objects – Operator Overloading: Unary Operators – Binary Operators – Data

Conversion – Pitfalls.

Unit - III FUNCTIONS, TEMPLATES AND EXCEPTIONS Periods 9

Simple Functions – Passing arguments – returning values – Reference arguments – Default arguments –

Overloaded Functions – Inline Functions – Friend functions - Variables and storage classes – Function

Templates – Class Templates – Exceptions

Unit – IV INHERITANCE AND VIRTUAL FUNCTIONS Periods 9

Inheritance: Derived and Base Classes – Derived class Constructors – Overriding member functions – Class

hierarchy – Public and Private Inheritance – Levels of Inheritance – Multiple Inheritance – Ambiguity -

Virtual Functions – Static functions- this pointer – Dynamic type Information.

Unit – V STREAMS AND FILES Periods 9

Stream Classes – Stream Errors – Disk File I/O wit streams – File pointers –Error Handling in File I/O – File

I/O with member functions – Overloading the extraction and Insertion operators – Memory as a Stream object

– Command line arguments – The C++ string Class – Standard template Library.

Total Periods 45

REFERENCES:

1. Robert Lafore, “Object Oriented Programming in C++”, 4th Edition, Galgotia Publications Pvt

Ltd, 2008. 2. Herbert Schildt, “C++ The Complete Reference”, 5th Edition, Tata McGraw-Hill Publishing

Company Limited. 3. Bhushan Trivedi, “Programming with ANSI C++”, 2nd

Edition, Oxford University Press, 2012.

4. Paul Deitel, Harvey Deitel, “C++ How to program”, 8th Edition, PHI, 2011.

5. E.Balagurusamy, “Object Oriented Programming with C++”, 5th Edition, Tata McGraw-Hill

Education, 2008. 6. Yashavant P. Kanetkar , “Let Us C++”, 2nd

Edition, BPB Publications, 2002.

Course

Outcome

Design problem solutions using Object Oriented Techniques.

Apply the concepts of data abstraction, encapsulation and inheritance for problem

solutions.

Use the control structures of C++ appropriately.

Critically analyze the various algorithms.

http://www.amazon.com/Herbert-Schildt/e/B001H6PSMG/ref=ntt_athr_dp_pel_1/184-8704303-7472741

http://www.google.co.in/search?tbo=p&tbm=bks&q=inauthor:%22Yashavant+P.+Kanetkar%22

28








U13GE203 Engineering Practices Laboratory 0 0 3 2 50 50 100

Course

Objective

To provide exposure to the students with hands on experience on various basic

engineering practices in Civil, Mechanical, Electrical and Electronics Engineering.

GROUP A (CIVIL & MECHANICAL)

Section-I Civil Engineering Practice Periods 15

Buildings:

(a) Study of plumbing and carpentry components of residential and industrial buildings. Safety aspects.

Plumbing Works:

(a) Study of pipeline joints, its location and functions: valves, taps, couplings, unions, reducers and

elbows in household fittings.

(b) Study of pipe connections requirements for pumps and turbines.

(c) Preparation of plumbing line sketches for water supply and sewage works.

(d) Hands-on-exercise:

Basic pipe connections – Mixed pipe material connection – Pipe connections with different joining

components.

(e) Demonstration of plumbing requirements of high-rise buildings.

Carpentry using Power Tools only:

(a) Study of the joints in roofs, doors, windows and furniture.

(b) Hands-on-exercise: Wood work, joints by sawing, planning and cutting.

Section-II Mechanical Engineering Practice Periods 15

Welding:

(a) Preparation of arc welding of butt joints, lap joints and tee joints.

(b) Gas welding practice

Basic Machining:

(a) Simple Turning and Taper turning

(b) Drilling Practice

Sheet Metal Work:

(a) Forming & Bending:

(b) Model making – Trays, funnels, etc.

(c) Different type of joints.

Machine assembly practice:

(a) Study of centrifugal pump

(b) Study of air conditioner

Demonstration on:

(a) Smithy operations, upsetting, swaging, setting down and bending. Example – Exercise –

Production of hexagonal headed bolt.

29

(b) Foundry operations like mould preparation for gear and step cone pulley.

(c)Fitting – Exercises – Preparation of square fitting and vee – fitting models.

GROUP B (ELECTRICAL & ELECTRONICS)

Section-III Electrical Engineering Practice Periods 15

1. Residential house wiring using switches, fuse, indicator, lamp and energy meter.

2. Fluorescent lamp wiring.

3. Stair case wiring

4. Measurement of electrical quantities – voltage, current, power & power factor in RLC circuit.

5. Measurement of energy using single phase energy meter.

6. Measurement of resistance to earth of electrical equipment.

Section- IV Electronics Engineering Practice Periods 15

1. Study of Electronic components and equipments – Resistor colour coding, measurement

of AC signal parameters (Peak-Peak, RMS, Period, Frequency) using CRO.

2. Study of logic gates AND, OR, EX-OR and NOT.

3. Generation of Clock Signal.

4. Soldering practice – Components, Devices and Circuits – Using ge n e r a l purpose PCB.

5. Measurement of ripple factor of HWR and FWR.

Total Periods: 60

REFERENCES:

1. Jeyachandran.K, Natarajan.S. & Balasubramanian.S, “A Primer on Engineering Practices

Laboratory”, Anuradha Publications, 2007.

2. Jeyapoovan T., Saravanapandian M. & Pranitha S., “Engineering Practices Lab Manual”, Vikas

Publishing House Pvt.Ltd, 2006.

3. Bawa H.S., “Workshop Practice”, Tata McGraw – Hill Publishing Company Limited, 2007.

4. Rajendra Prasad A. & Sarma P.M.M.S., “Workshop Practice”, Sree Sai Publication, 2002.

5 Kannaiah P. & Narayana K.L., “Manual on Workshop Practice”, Scitech Publications, 1999.

Course

Outcome

Ability to fabricate carpentry components and pipe connections including plumbing

works.

Ability to use welding equipment‟s to join the structures.

Ability to use welding equipment‟s to join the structures

Ability to fabricate electrical and electronics circuits.

30








U13CS204 Object Oriented Programming

Laboratory 0 0 3 2 50 50 100

Course

Objective

To understand and develop programs using C++ Language

To develop programming skills on object oriented applications like operator

overloading, constructors, friend functions and inheritance.

To develop programming skills on basic data structure concepts.

LIST OF EXPERIMENTS:

1. Design C++ classes with static members, methods with default arguments, friend functions. (For

example, design matrix and vector classes with static allocation, and a friend function to do matrix-

vector multiplication).

2. Implement complex number class with necessary operator overloadings and type conversions such as

integer to complex, double to complex, complex to double etc.

3. Implement Matrix class with dynamic memory allocation and necessary methods. Give proper

constructor, destructor, copy constructor, and overloading of assignment operator.

4. Overload the new and delete operators to provide custom dynamic allocation of memory.

5. Develop a template of linked-list class and its methods.

4. Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort, and

quick sort.

6. Design stack and queue classes with necessary exception handling.

5. Define Point class and an Arc class. Define a Graph class which represents graph as a collection of

Point objects and Arc objects.

6. Write a method to find a minimum cost spanning tree in a graph.

7. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse,

Triangle, Polygon, etc.

8. Design a simple test application to demonstrate dynamic polymorphism and RTTI.

9. Write a C++ program that randomly generates complex numbers (use previously designed Complex

class) and writes them two per line in a file along with an operator (+, -, *, or /). The numbers

are written to file in the format (a + ib).

10. Write another program to read one line at a time from this file, perform the corresponding operation

on the two complex numbers read, and write the result to another file (one per line).

Total Periods: 45

Course

Outcome

Design and implement C++ programs using friend functions, polymorphism and

inheritance.

Apply good programming design methods for problem solving.

Apply the different data structures for implementing solutions to practical problems.

31




Programme B.E. / B.Tech. Programme code Regulation 2013

Department CSE & IT Semester III

Course code Course name Periods per week Credit Maximum Marks


U13MA303 Discrete Mathematics and Graph

Theory 3 1 0 4 50 50 100

Course

Objective

Have knowledge of the concepts needed to test the logic of a program.

Have an understanding in identifying structures on many levels.

Be aware of a class of functions which transform a finite set into another finite set

which relates to input output functions in computer science.

Be exposed to concepts and properties of algebraic structures such as semi groups,

monoids and groups.

Unit – I LOGIC AND MATHEMATICAL REASONING Periods 12

Logic, Propositional Equivalences -Predicates and Quantifiers- Methods of Proof- Mathematical Induction.

Unit - II FUNCTIONS AND RELATIONS Periods 12

Functions, Sequences and Summations- The Growth Functions-Relations and their Properties, Non- array

Relations & their Applications- Representing Relations- Closures of Relations, Equivalence Relations- Partial

Orderings.

Unit – III GRAPHS Periods 12

Introduction to Graphs- Graph Terminology and Representation- Connectivity- Euler and Hamiltonian Paths-

Shortest Path Programs.

Unit - IV TREES Periods 12

Introduction and applications of trees- Tree Traversal- Spanning Trees- Minimum Spanning trees.

Unit – V SEMI GROUPS, GROUPS AND CODING Periods 12

Binary Operations- Semi groups- Products and Quotients of Semi groups- Groups- Product and Quotients of

Groups- Coding of Binary Information and Error Correction- Decoding and Error Correction.

Total Periods 60

REFERENCES:

1. B.Kolman et.al,” Discrete mathematical Structures”, 5

th Edition, Pearson Education, New Delhi -

2004.

2. K.H. Rosen, “Discrete Mathematics and Its Applications”, 4

th Edition, Tata McGraw Hill, New

Delhi – 2001

3. J.P. Tremblay et.al,”Discrete Mathematical Structures with Applications to Computer Science”,

TMH, New Delhi – 2004.

Course

Outcome

To have knowledge of the concepts needed to test the logic of a program.

Able to understand the identifying structures on many levels.

Be aware of a class of functions which transform a finite set into another finite set which

relates input and output functions in computer science.

Be aware of the counting principles.

32





Department CSE, EEE, ECE & IT Semester III


Periods Per



U13CS305 Data Structure using C++ 3 0 0 3 50 50 100

Course

Objective

Be exposed to the concepts of ADTs

Learn linear data structures – list, stack, and queue.

To learn the algorithm of sorting, hashing.

Unit – I INTRODUCTION TO C++ AND ALGORITHM

ANALYSIS Periods 9

C++ classes, C++ details, using matrices, Mathematical background for algorithm analysis, model and what

to analyze, Running Time calculations.

Unit - II LISTS, STACKS AND QUEUES Periods 9

Abstract Data Types, The list ADT, The Stack ADT, The Queue ADT.

Unit – III TREES Periods 9

Preliminaries, Binary Trees, The Search Tree ADT – Binary Search Trees, AVL Trees, Splay Trees, Tree

Traversals, B-Trees.

Unit - IV HASHING AND PRIORITY QUEUES Periods 9

Model and Simple implementations of Hashing, Binary Heap, Applications of Priority Queues, d-Heaps,

Leftist and Skew Heaps.

Unit – V GRAPH ALGORITHMS AND SORTING Periods 9

Definitions, Topological Sort, Shortest Path Algorithms, Network Flow Problems and Minimum Spanning

Tree. Sorting: Preliminaries, Insertion sort, A Lower Bound for Simple Sorting Algorithms, Shell sort, Heap

sort, Merge sort, and Quick sort.

Total Periods 45

REFERENCES :

1. Mark A. Weiss, “Data Structures & Algorithm Analysis in C++”, 2

nd Edition, Pearson Education,

New Delhi, 2002.

2. Gregory L. Heilean,”Data Structures Algorithms, and Object Programming”, Tata McGraw Hill,

New Delhi, 2002.

3. Mark A. Weiss, “Data Structures and Algorithm Analysis in C++”, 4

th Edition, Prentice Hall,

2012

4. S. Sahni, “Data Structures, Algorithms and Applications in C++”, 2

nd edition, Universities Press,

2005.

Course

Outcome

Implement abstract data types for linear data structures.

Apply the different linear data structures to problem solutions.

Critically analyze the various algorithms.

33








U13CS306 Paradigms in Programming 3 0 0 3 50 50 100

Course

Objective

To understand the concepts of object-oriented, concurrent programming and event

driven programming paradigms.

To develop skills in using these paradigms using Java.

Unit – I OBJECT-ORIENTED PROGRAMMING FUNDAMENTALS Periods 9

The Genesis of Java – Overview of Java – Data Types, Variables and Arrays – Operators – Control

Statements – Introducing Classes – Methods and Classes.

Unit - II INHERITANCE AND PACKAGES Periods 9

Inheritance Basics – Using super – Multilevel Hierarchy – When the Constructors are Called – Method

Overriding – Dynamic Method Dispatch – Abstract Classes – Using final – Packages – Access

Protection – Importing Packages – Interfaces.

Unit – III EXCEPTION HANDLING Periods 9

Exception Handling Fundamentals – Exception Types – Uncaught Exceptions – Using try and catch –

Multiple catch – Nested try Statements – throw – throws – finally – Chained Exceptions – Using

Exceptions.

Unit – IV MULTITHREADING PROGRAMMING Periods 9

The Java Thread Model – Creating a Thread – Creating Multiple Threads – Using isAlive () and join () –

Thread Priorities – Synchronization – Interthread Communication – Suspending, Resuming and Stopping

Threads.

Unit – V I/O, APPLETS AND EVENT HANDLING Periods 9

I/O Basics – Reading Console Input – Reading Console Output – The Print Writer Class – Reading and

Writing Files – String Handling – Applet Fundamentals – Applet Class – The HTML APPLET Tag –

Passing Parameters to the Applet- Abstract Window Toolkit – Event Handling.

Total Periods 45

REFERENCES:

1. Herbert Schildt, “The Complete Reference Java 2”, Fifth Edition, Tata McGraw-Hill Edition

India Pvt. Ltd., 2002.

2. Cay S. Horstmann and Gary Cornell, “Core Java: Volume I – Fundamentals”, Eighth Edition,

Sun Microsystems Press, 2008.

3. K.Arnold and J. Gosling, “The Java Programming Language”, Third Edition, Pearson Education,

2000.

4. Timothy Budd, “Understanding Object Oriented Programming with Java”, Updated Education,

Pearson Education, 2000.

5. C.Thomas Wu,”An Introduction to Object-Oriented Programming with Java”, Fourth Edition,

Tata McGraw-Hill Publishing company Ltd., 2006.

Course

Outcome

Design simple Java Programs for problems.

Design a Multithread programming using Java.

Design an event driven applet programming.

34








U13CS307 Unix Internals 3 0 1 4 50 50 100

Course

Objective

To introduce the architecture of the Unix Operating System.

To understand the buffer structure, system calls, process & memory management

Unit – I GENERAL OVERVIEW OF THE SYSTEM Periods 12

General Review of the System-History-System structure-User Perspective-Operating System Services-

Assumptions About Hardware. Introduction to the Kernel-Architecture System Concepts-Data Structures-

System Administration

Unit – II BUFFER CACHE Periods 12

The Buffer Cache-Headers-Buffer Pool-Buffer Retrieval-Reading and Writing Disk Blocks - Advantages and

Disadvantages. Internal Representation of Files-Inodes- Structure-Directories-Path Name to Inode- Super

Block-Inode Assignment-Allocation of Disk Blocks -Other File Types.

Unit – III SYSTEM CALLS FOR FILE SYSTEM Periods 12

Open-Read-Write-Lseek-Close-Create-Special files Creation -Change Directory and Change Root-Change

Owner and Change Mode-Stat- Fstat-Pipes-Dup-Mount-Unmount-Link-Unlink-File System Abstraction.

Unit – IV THE STRUCTURE OF PROCESSES Periods 12

The System Representation of Processes-States-Transitions-System Memory-Context of a Process-Saving the

Context-Manipulation of a Process Address Space-Sleep Process Control-signals-Process Termination-

Awaiting Invoking other Programs-The Shell-System Boot and the INIT Process.

Unit – V PROCESS SCHEDULING AND MEMORY

MANAGEMENT POLICIES Periods 12

Process Scheduling-Memory Management Policies-Swapping-Demand Paging- Hybrid Systems.

Total Periods 60

REFERENCES:

1. Maurice J. Bach, “The Design of the Unix Operating System”, Indian Edition, PHI, 2004.

2. Vahalia, “Unix Internals: The New Frontiers”, Pearson Education Inc, 2003.

3. John Lion, "Lion's Commentary on UNIX", 6th edition, Peer-to-Peer Communications, 2004.

4. Daniel P. Bovet & Marco Cesati, “Understanding the Linux Kernel”, O‟REILLY,

Shroff Publishers & Distributors Pvt. Ltd, 2000.

5. M. Beck et al, “Linux Kernel Programming”, Pearson Education Asia, 2002.

Course

Outcome

Understand the structure of unix operating system

Understand the how the unix organizes the files and how to interact with the kernel.

Understand how the process are allocated and scheduled for execution.

35








U13CS308 Database and Information System 3 0 0 3 50 50 100

Course

Objective

To design high-quality relational databases and database applications.

To familiarize the students with ER diagrams & SQL

To make the students to understand the fundamentals of Transaction Processing and

Query Processing.

Unit – I INTRODUCTION TO DATABASE SYSTEMS Periods 9

Database system concepts and architecture- ER model: ER Modeling concepts- ER Diagrams- Cardinality

constraints- Enhanced ER Model (EER)- Weak-entity types-Specialization and Generalization.

Unit – II RELATIONAL MODEL, LANGUAGES AND SYSTEMS Periods 9

Relational algebra- Relational model concepts- Relational integrity constraints-Update operations on

relations- Relational algebra model- ER to relational mappings. Data definition in SQL- Queries and update

statements- Views- Integrity constraints

Unit – III DATABASE DESIGN USING THERELATIONALMODEL Periods 9

Functional dependencies- Keys in a relational model-Concept of functional dependencies- first normal form-

second normal form- third normal form- Boyce-Codd Normal Forms- Multi-values dependencies and fourth

normal form-Join dependencies and fifth normal form.

Unit – IV STORAGE AND INDEXING STRUCTURES Periods 9

Storage structures-Secondary storage devices- Buffering of blocks- File Organization- Heaps- Sorted Files-

Hashing and overflow handling techniques- Dynamic hashing- Extensible hashing-Indexing methods-Primary

indexes-Clustering index- Secondary index- Multilevel indexes- ISAM- B-trees- B+ trees- inserting and

searching algorithms for B+ trees.

Unit – V TRANSACTION PROCESSING AND CONCURRENCY

CONTROL Periods 9

Transaction Fundamentals- Necessary properties of transactions (ACID properties)-Transaction states-

serializability-Serial schedules-Conflict serializability- View serializability- Recoverable and non-recoverable

schedules- Cascading rollbacks- Cascade less schedules- Concurrency- Need for Concurrency-Locking

Protocols-Two Phase Locking- Intent Locking- Deadlock-Serializability- Recovery Isolation Levels.

Recovery concepts.

Total Periods 45

REFERENCES:

1. Elmasri, Navathe, “Fundamentals of Database Systems”, Sixth Edition, Pearson Education, 2010.

2. Abraham Silberschatz, Henry F. Korth and S. Sudarshan, “Database System Concepts” Fourth

Edition, McGraw Hill, 2002.

3. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems”, Third Edition,

McGraw Hill, 2002. http://pages.cs.wisc.edu/~dbbook/

Course

Outcome

Design Databases for applications.

Apply concurrency control and recovery mechanisms for practical problems.

Design the Query Processor and Transaction Processor.

36




Programme B.E. / B.Tech. Programme code Regulation 2013

Department CSE & IT Semester III


Periods Per



U13EC307 Logic Design 3 0 0 3 50 50 100

Course

Objective

To introduce the concept of digital and binary systems

To design and analyze combinational logic circuits.

To design and analyze sequential logic circuits.

To understand the basic software tools for the design and implementation of digital

circuits and systems.

Unit – I BOOLEAN ALGEBRA AND SWITCHING FUNCTIONS Periods 9

The nature of logic-Boolean Algebra and switching functions-Number Systems-binary-hexadecimal and other

systems-Representation and properties of switching functions and their logic realizations using GATES and

Switches.

Unit – II OPTIMAL DESIGN Periods 9

Minterm – Maxterm - Sum of Products (SOP) – Product of Sums (POS) -Implicants and prime implicants,

Minimization using K-map, Quine-McCluskey algorithm for finding prime implicants.

Unit – III COMBINATIONAL CIRCUITS Periods 9

Combinational circuits–Analysis and design procedures-Circuits for arithmetic operations-Code conversion–

Decoders and encoders-Multiplexers and demultiplexers-Implementation of combinational logic circuits using

ROM, PLA, PAL-Introduction to Hardware Description Language(HDL)-HDL for combinational circuits.

Unit – IV SEQUENTIAL CIRCUITS Periods 9

Sequential logic elements, Flip-Flops, Registers, Shift Registers and Counters. Examples of applications.

State reduction and state assignment - HDL for Sequential Circuits.

Unit – V SYNCHRONOUS AND ASYNCHRONOUS SEQUENTIAL

CIRCUITS Periods 9

Synchronous Sequential Circuits: General Model–Classification–Design–Analysis of Synchronous Sequential

Circuits. Asynchronous Sequential Circuits: Analysis and design of asynchronous sequential circuits-

Reduction of state and flow tables–Race free state assignment–Hazards-Design of Hazard Free Switching

circuits-ASM Chart.

Total Periods 45

REFERENCES:

1. M. Morris Mano, “Digital Design”, 4th Edition, Prentice Hall of India Pvt. Ltd., 2008 / Pearson

Education (Singapore) Pvt. Ltd., New Delhi, 2003.

2. John F.Wakerly, “Digital Design”, 4th Edition, Pearson/PHI, 2008

3. John.M Yarbrough, “Digital Logic Applications and Design”, Thomson Learning, 2006.

4. Charles H.Roth. “Fundamentals of Logic Design”, 6th Edition, Thomson Learning, 2013.

5. Thomas L. Floyd, “Digital Fundamentals”, 10th Edition, Pearson Education Inc, 2011

Course

Outcome

Perform arithmetic operations in any number system.

Simplify the Boolean expression using K-Map and Tabulation techniques.

Use boolean simplification techniques to design a combinational hardware circuit.

Design and Analysis of a given digital circuit – combinational and sequential.

37





Department CSE, EEE, ECE & IT Semester III



U13CS309 Data Structure using C++

Laboratory 0 0 3 2 50 50 100

Course

Objective

To develop programming skills in design and implementation of data structures and

their applications.


1. Implement singly and doubly linked lists.

2. Represent a polynomial as a linked list and write functions for polynomial addition.

3. Implement stack and use it to convert infix to postfix expression

4. Implement a double -ended queue (dequeue) where insertion and deletion operations are possible at

both the ends.

5. Implement an expression tree. Produce its pre-order, in-order, and post order traversals.

6. Implement binary search tree.

7. Implement insertion in AVL trees.

8. Implement priority queue using binary heaps.

9. Implement hashing with open addressing.

10. Implement prim‟s algorithm using priority queue to find MST of an undirected graph.

Total Periods: 45

Course

Outcome

Design and implement C++ programs for manipulating stacks, queues, linked lists, trees,

and graphs.

Apply good programming design methods for program development.

Apply the different data structures for implementing solutions to practical problems.

Develop recursive programs using trees and graphs.

38


(Autonomous Institution ,Affiliated to Anna University,Chennai)


Programme B.E. Programme code 101 Regulation 2013




U13CS310 Database and Information System

Laboratory 0 0 3 2 50 50 100

Course

Objective

Learn to create and use a database

Be familiarized with a query language

Have hands on experience on DDL Commands

Have a good understanding of DML Commands and DCL commands


1. Creation of a database and writing SQL queries to retrieve information from the database.

Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records based on

Conditions.

2. Creation of Views, Sequence, Indexes, save point.

3. Creating an Employee database to set various constraints.

4. Creating relationship between the databases.

5. Study of PL/SQL block.

6. Write a PL/SQL block to satisfy some conditions by accepting input from the user.

7. Write a PL/SQL block that handles all types of exceptions.

8. Creation of Procedures.

9. Creation of database triggers and functions

10. Mini project (Application Development using Oracle/ Mysql )

Total Periods: 45

Course

Outcome

Design and implement a database schema for a given problem-domain

Populate and query a database

Create and maintain tables using PL/SQL.

39






Course

Code Course Name

Periods Per Week Credit Maximum Marks


U13EC308 Logic Design Laboratory 0 0 3 2 50 50 100

Course

Objective

Understand the various logic gates.

Be familiar with various combinational circuits.

Understand the various components used in the design of digital computers.

Be exposed to sequential circuits


1. Simplification, realization of Boolean expressions using logic gates/Universal gates.

2. Realization of Half/Full adder and Half/Full Subtractors using logic gates.

3. (i) Realization of parallel adder/Subtractors using 7483 chip

(ii) BCD to Excess-3 code conversion and vice versa.

4. Realization of Binary to Gray code conversion and vice versa

5. MUX/DEMUX – use of 74153, 74139 for arithmetic circuits and code converter.

6. Realization of One/Two bit comparator and study of 7485 magnitude comparator.

7. Use of a) Decoder chip to drive LED display and b) Priority encoder.

8. Truth table verification of Flip-Flops: (i) JK Master slave (ii) T type and (iii) D type.

9. Realization of 3 bit counters as a sequential circuit and MOD – N counter design (7476, 7490, 74192,

74193).

Total Periods: 45

Course

Outcome

Use Boolean simplification techniques to design a combinational hardware circuit.

Design and Implement combinational and sequential circuits.

Analyze a given digital circuit – combinational and sequential.

40








U13MA406 Numerical Methods 3 1 0 4 50 50 100

Course

Objective

To have the knowledge in Interpolation and Approximation

To have the knowledge in solutions of system of equations

To have the knowledge in solutions of non linear equations

To have the knowledge in Initial value problems for ODE

Unit - I SOLUTION OF EQUATIONSAND EIGENVALUE PROBLEMS Periods 12

Solution of equation –Fixed point iteration: x=g(x) method - Newton‟s method– Solution of linear system by

Gaussian elimination and Gauss-Jordon method–Iterative method-Gauss-Seidel method-Inverse of a matrix by

Gauss Jordon method–Eigen value of a matrix by power method and by Jacobi method for symmetric matrix.

Unit - II INTERPOLATION AND APPROXIMATION Periods 12

Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton‟s forward

and backward difference formulas

Unit - III NUMERICAL DIFFERENTIATION AND INTEGRATION Periods 12

Differentiation using interpolation formulae –Numerical integration by trapezoidal and Simpson‟s 1/3 and

3/8 rules – Romberg‟s method – Two and Three point Gaussian quadrature formulae – Double integrals

using trapezoidal and Simpsons‟s rules

Unit - IV INITIAL VALUE PROBLEMS FOR ORDINARY

DIFFERENTIAL EQUATIONS Periods 12

Single step methods: Taylor series method – Euler method for first order equation – Fourth order Runge

– Kutta method for solving first and second order equations – Multistep methods: Milne‟s and Adam‟s

predictor and corrector methods

Unit - V BOUNDARY VALUE PROBLEMS IN ORDINARY AND

PARTIAL DIFFERENTIAL EQUATIONS Periods 12

Finite difference solution of second order ordinary differential equation – Finite difference solution of one

dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two

dimensional Laplace and Poisson equations.

Total Periods 60

REFERENCES:

1. Veerarjan.T and Ramachandran.T, “Numerical methods with programming in C”, Second Edition,

Tata McGraw-Hill Publishing.Co.Ltd, 2007.

2. Sankara Rao K, “Numerical Methods for Scientists and Engineers”, Third Edition, Prentice Hall of

India Private Ltd, New Delhi, 2007.

3. Chapra.S.C and Canale.R.P, “Numerical Methods for Engineers”, Fifth Edition, TataMcGraw-Hill,

New Delhi, 2007.

4. Gerald.C.F and Wheatley.P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson Education

Asia, New Delhi, 2006.

5. Grewal.B.S and Grewal.J.S, “Numerical methods in Engineering and Science”,

Sixth Edition, Khanna Publishers, New Delhi, 2004.

Course

Outcome

Able to have a clear perception of the power of numerical techniques, and ideas.

Able to demonstrate the applications of these techniques to problems drawn from industry,

management and other engineering fields.

41








U13CS413 Advanced Java

Programming 3 0 0 3 50 50 100

Course

Objective

To learn advanced Java programming concepts like interface, threads, Swings etc.

To develop network programs in Java

To understand Concepts needed for distributed and multi-tier applications

Unit – I JAVA I/O Periods 9

Java I/O streaming – filter and pipe streams – Byte Code interpretation - Threading – Swing GUI

Unit - II NETWORKING PROGRAMMING Periods 9

Sockets-Secure Sockets-TCP / UDP Sockets-Multicast Socket – URL Classes – Reading Data from the

server- Writing Data.

Unit – III MULTI-TIER APPLICATION DEVELOPMENT Periods 9

JDBC –MVC design pattern in swings- Servlet-applet to servlet communication- Data connectivity in servlet-

Introduction to Java Servlet pages.

Unit - IV APPLICATIONS IN DISTRIBUTED

ENVIRONMENT Periods 9

Java Messaging services- Remote Method Invocation – IIOP Implementation – CORBA-IDL Technology-

Naming Services-CORBA programming Models - JAR file creation.

Unit – V ENTERPRISE APPLICATIONS Periods 9

Server Side Component Architecture-Introduction to J2EE–Session Beans–Entity Beans–Persistent Entity

Beans.

Total Periods 45

REFERENCES:

1. Herbert Schildt, “JAVA: The Complete Reference”, Eighth Edition, Oracle Press, Tata McGraw-

Hill, 2012.

2. Cay S Horstmann & Gary Cornell, “Core Java Volume II - Java Advanced Features”, Ninth

Edition, Printice Hall, 2013.

3. Elliotte Rusty Harold, “Java Network Programming”, O‟Reilly publishers, 2004.

4. Ed Roman, “Mastering Enterprise Java Beans”, Third Edition, John Wiley & Sons Inc.,

2005.

Course

Outcome

Develop applications to access and manipulate data in a relational database

Design graphical user interfaces using Java-based programming structures

Develop the Network applications using Sockets

Develop the enterprise application using java beans

42








U13CS414 Design and Analysis of Algorithms 3 1 0 4 50 50 100

Course

Objective

Learn the algorithm analysis techniques.

Become familiar with the different algorithm design techniques.

Understand the limitations of Algorithm power.

Unit – I ALGORITHM ANALYSIS AND RECURRENCE EQUATION Periods 12

Models of computation- algorithm analysis- time and space complexity- average and worst case analysis-

lower bounds- amortization- randomization- Solving recurrence equations – Analysis of linear search.

Unit – II DIVIDE AND CONQUER Periods 12

General Method – Binary Search – Finding Maximum and Minimum – Merge Sort.-Quick sort

Unit – III GREEDY ALGORITHMS Periods 12

General Method – Container Loading – Knapsack Problem.-tree vertex splitting

Unit – IV DYNAMIC PROGRAMMING Periods 12

General Method – Multistage Graphs – All-Pair shortest paths – Optimal binary search trees – 0/1 Knapsack

– Traveling salesperson problem.

Unit – V PROBLEM CLASSES Periods 12

P, NP, P-SPACE; reducibility, NP-hard and NP-complete problems. Approximation algorithms for some NP-

hard problems.

Total Periods 60

REFERENCES:

1. T.H.Cormen, C.E.Leiserson, R.L.Rivest, C.Stein, “Introduction to Algorithms”, 2nd Edition,

Prentice-Hall India, 2001.

2. J. Kleinberg and E. Tardos, “Algorithm Design”, Pearson International Edition, 2005.

Course

Outcome

Design algorithms for various computing problems.

Analyze the time and space complexity of algorithms.

Critically analyze the different algorithm design techniques for a given problem.

Modify existing algorithms to improve efficiency.

43





Department CSE & IT Semester IV



U13IT404 Operating Systems 3 1 0 4 50 50 100

Course

Objective

To know the components of an operating system.

To have a thorough knowledge of process and storage management

To know the concepts of I/O and file systems.

Unit – I INTRODUCTION Periods 10

What is an Operating System?- Simple Monitor- Performance- Multiprogramming- time-sharing- Real Time

systems- Protection. File Systems: File Concept and support- Access and allocation methods- directory

systems- File protection.

Unit – II CPU SCHEDULING AND MEMORY MANAGEMENT Periods 13

Scheduling concepts and algorithms- Algorithms evaluation and Multiple processor scheduling. Memory

Management: Preliminaries-Bare Machine-Resident Monitor-Swapping-Multiple partitions- Paging-

Segmentation- Combined systems.

Unit – III VIRTUAL MEMORY Periods 12

Overlays- Demand paging- Performance of demand paging- Page replacement- Virtual memory concepts-

Page replacement algorithms-Allocation algorithms and Thrashing.

Unit – IV PROCESS SYNCHRONIZATION AND DEADLOCKS Periods 13

Semaphores- OS Synchronization- Atomic Transaction The deadlock problem- Deadlock characterization-

Deadlock prevention- Deadlock avoidance-Deadlock detection- Recovery from deadlock and Combined

approach to deadlock handling.

Unit – V DISK SCHEDULING Periods 12

Physical characterization- Disk Management- Swap-Space Management- RAID structure- FCFS scheduling-

Shortest SeekTime First Scheduling-Look Scheduling and Scan Scheduling.

Total Periods 60

REFERENCES:

1. Silver Schatz.A and Golvin.P.B “Operating System Concepts”, 5

th Edition, John Wiley, New

York, 2000.

2. Deitel H.M., “An Introduction to Operating System”, Addison Wesley, Inc., London, 1995.

3. Mandinck S.E., “Operating System” McGraw Hill., London, 1993.

Course

Outcome

Design various Scheduling algorithms.

Design deadlock, prevention and avoidance algorithms.

Compare and contrast various memory management schemes.

Design and Implement a prototype file systems.

44







Periods Per



U13CS415 Computer Graphics 3 0 0 3 50 50 100

Course

Objective

Gain knowledge about graphics hardware devices and software used.

Understand the two dimensional and three dimensional graphics and their

transformations.

Appreciate illumination and color models.

Be familiar with understand clipping techniques.

Unit – I INTRODUCTION AND BASIC RASTER GRAPHICS Periods 9

Overview of Computer Graphics- Scan conversion of Lines- Circles- Ellipses- Filling Polygons- Clipping

Lines algorithms- clipping polygons and text clipping.

Unit – II GEOMETRIC MANIPULATION – 2D Periods 9

Transformations- Matrices- Homogeneous Coordinates of 2D- Two -Dimensional Translation- Rotation

Scaling- Complex 2D Transformations- Matrix Representation 2D Transformations- Composition of 2D

Transformations

Unit – III GEOMETRIC MANIPULATION – 3D Periods 9

Three-Dimensional Scaling-Three-Dimensional Translation-Three-Dimensional Shearing- Three-

Dimensional Rotation- Matrix Representation of 3D Transformations-Composition of 3D Transformations-

Vanishing points.

Unit - IV VISIBILITY Periods 9

Image and object precision- Back face removal- z-Buffer algorithms- Area based algorithms- Visible surface

ray tracing.

Unit – V ILLUMINATION AND SHADING Periods 9

Illumination and Shading Models for Polygons- Phong‟s model- Gouraud shading- Flat and smooth shading-

Adding texture to faces-Creating shadow objects-Rendering texture- Drawing shadows.

Total Periods 45

REFERENCES:

1. F.S. Hill, “Computer Graphics Using Open GL”, Prentice Hall, 2001.

2. S. Feiner, J. Foley, A. Van Dam, R. Hughes, “Computer Graphics, Principles and Practice”, Third

Edition, Addison Wesley, 1990.

Course

Outcome

Design two dimensional graphics & Apply two dimensional transformations.

Design three dimensional graphics & Apply three dimensional transformations.

Apply Illumination and color models.

Apply clipping techniques to graphics.

45







Periods Per



U13CS416 Computer Architecture 3 0 0 3 50 50 100

Course

Objective

To understand the basic structure and operation of digital computer.

To familiarize the arithmetic and logic unit and implementation of fixed point

and floating-point arithmetic operations.

To expose the concept of pipelining & hierarchical memory system including c

cache memories and virtual memory.

To expose different ways of communicating with I/O devices and standard I/O

interfaces.

Unit – I BASIC STRUCTURE OF COMPUTERS Periods 9

Functional units – Basic operational concepts – Bus structures – Performance and metrics – Instructions and

instruction sequencing – Hardware – Software Interface –Instruction set architecture – Addressing modes –

RISC – CISC.

Unit – II BASIC PROCESSING UNIT Periods 9

Fundamental concepts – Execution of a complete instruction – Multiple bus organization– Hardwired control

– Micro programmed control – Nano programming.

Unit – III PIPELINING Periods 9

Basic concepts – Data hazards – Instruction hazards – Influence on instruction sets –Data path and control

considerations – Performance considerations – Exception handling.

Unit – IV MEMORY SYSTEM Periods 9

Basic concepts – Semiconductor RAM – ROM – Speed – Size and cost – Cache memories – Improving cache

performance – Virtual memory – Memory management requirements – Associative memories – Secondary

storage devices.

Unit – V I/O ORGANIZATION Periods 9

Accessing I/O devices – Programmed Input/Output -Interrupts – Direct Memory Access – Buses – Interface

circuits – Standard I/O Interfaces (PCI, SCSI, USB)

Total Periods 45

REFERENCES:

1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, “Computer Organization”, Fifth Edition,

Tata McGraw Hill, 2002.

2. David A. Patterson and John L. Hennessy, “Computer Organization and Design: The

Hardware/Software interface”, Third Edition, Elsevier, 2005.

3. William Stallings, “Computer Organization and Architecture – Designing for Performance”,

Sixth Edition, Pearson Education, 2003.

4. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata McGraw Hill,

1998.

5. V.P. Heuring, H.F. Jordan, “Computer Systems Design and Architecture”, Second Edition,

Pearson Education, 2004.

Course

Outcome

Design arithmetic and logic unit.

Design and analyze pipelined control units

Understand parallel processing architectures.

46


(Autonomous Institution ,Affiliated to Anna University, Chennai)




Course

Code Course Name



U13CS417 Advanced Java Programming

Laboratory 0 0 3 2 50 50 100

Course

Objective

To develop programming skills in event driven programming and networking concepts of

java.

To develop the enterprise application using Servlet, JSP and CORBA.


1. Write a Java program to print all number below 100,000 that are both prime and Fibonacci.

2. Design a simple calculator using event driven programming.

3. Develop a simple OPAC system for Library using swings and event driven programming. Use JDBC

to connect to a back-end database.

4. Develop a multi-threaded chat application using TCP/UDP Sockets.

5. Write a program to implement remote method invocation.

6. Develop a online book store using Servlet and JDBC

7. Develop an online quiz system using JSP and JDBC.

8. Develop a stock market system using CORBA Naming Service.

Total Periods: 45

Course

Outcome

Design graphical user interfaces using Java-based programming structures

Develop applications to access and manipulate data in a relational database

Develop the Network applications using Sockets

Develop the enterprise application using java beans

47


(Autonomous Institution ,Affiliated to Anna University, Chennai)






U13CS418 Computer Graphics Laboratory 0 0 3 2 50 50 100

Course

Objective

To develop the basic graphics primitives with their transformations.

To have knowledge about image editing and authoring tools.


1. Implementation of Algorithms to draw a line for all slopes, circle and ellipse.

2. Generation of 2D Geometric transformations like Translation,Rotation,Scaling

3. Reflection, Shear and Window to Viewport transformation.

4. Design of Line Clipping algorithm

5. Generation of 3D Transformations -Translation, Rotation, Scaling

6. Image Editing and Manipulation -

-Basic Operations on image using any image editing software,

-Creating gif animated images, Image optimization

7. 2D Animation –Creation of interactive animation using any authoring tool.

Total Periods: 45

Course

Outcome

Create basic primitives of graphics such as line, circle & ellipse & apply two

dimensional transformations

Create 3D graphical scenes using open graphics library suits

Implement image manipulation and enhancement

Create 2D animations using tools

48





Department CSE & IT Semester IV



U13IT407 Operating Systems Laboratory 0 0 3 2 50 50 100

Course

Objective

To learn shell programming commands.

To write programs using shell programs.

To implement operating system algorithms (CPU scheduling algorithms, producer-

consumer and bankers algorithm) in C/C++.


1. UNIX - Basic Commands.

2. Shell programming (Using looping, control constructs etc.,)

3. Write programs using the following system calls of UNIX operating system: fork, exec,

getpid, exit, wait, close, stat, opendir, readdir

4. Write programs using the I/O system calls of UNIX operating system (open, read, write, etc)

5. Write C programs to simulate UNIX commands like ls, grep, etc.

6. Implementation of CPU scheduling algorithms: FCFS, SJF, Round Robin & Priority Scheduling.

7. Implement the Producer – Consumer problem using semaphores.

8. Implementation of Banker‟s algorithm.

9. Implement some memory management schemes (First fit, Best fit & Worst fit)

10. Implement some page replacement algorithms (FIFO & LRU).

Total Periods: 45

Course

Outcome

Implement deadlock avoidance and Detection Algorithms

Compare the performance of various CPU Scheduling Algorithm

Critically analyze the performance of the various page replacement algorithms

Create processes and implement IPC

49








U13CS519 Data Warehousing and Data Mining 3 0 0 3 50 50 100

Course

Objective

Be familiar with the concepts of data warehouse and data mining,

Be acquainted with the tools and techniques used for Knowledge Discovery in

Databases.

Unit - I DATA WAREHOUSING Periods 9

Data warehousing Components –Building a Data warehouse –- Mapping the Data Warehouse to a

Multiprocessor Architecture – DBMS Schemas for Decision Support – Data Extraction, Cleanup, and

Transformation Tools –Metadata.

Unit - II BUSINESS ANALYSIS Periods 9

Reporting and Query tools and Applications–Tool Categories–The Need for Applications–Cognos Impromptu

– Online Analytical Processing (OLAP) – Need – Multidimensional Data Model – OLAP Guidelines –

Multidimensional versus Multirelational OLAP – Categories of Tools – OLAP Tools and the Internet.

Unit - III DATA MINING Periods 9

Introduction – Data – Types of Data – Data Mining Functionalities – Interestingness of Patterns –

Classification of Data Mining Systems – Data Mining Task Primitives – Integration of a Data Mining System

with a Data Warehouse – Issues –Data Preprocessing.

Unit - IV ASSOCIATION RULE MINING AND CLASSIFICATION Periods 9

Mining Frequent Patterns, Associations and Correlations – Mining Methods – Mining various Kinds of

Association Rules – Correlation Analysis – Constraint Based Association Mining – Classification and

Prediction - Basic Concepts - Decision Tree Induction - Bayesian Classification – Rule Based Classification –

Classification by Back propagation – Support Vector Machines – Associative Classification – Lazy Learners

– Other Classification Methods – Prediction.

Unit - V CLUSTERING AND TRENDS IN DATA MINING Periods 9

Cluster Analysis-Types of Data–Categorization of Major Clustering Methods–K-means–Partitioning Methods

–Hierarchical Methods-Density-Based Methods–Grid Based Methods–Model-Based Clustering Methods –

Clustering High Dimensional Data-Constraint–Based Cluster Analysis–Outlier Analysis–Data Mining

Applications.

Total Periods 45

REFERENCES:

1. Alex Berson and Stephen J.Smith, “Data Warehousing, Data Mining and OLAP”, Tata McGraw –

Hill Edition, Thirteenth Reprint 2008.

2. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Third Edition,

Elsevier, 2012.

3. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data Mining”, Person

Education, 2007.

4. K.P. Soman, Shyam Diwakar and V. Aja, “Insight into Data Mining Theory and Practice”,

Eastern Economy Edition, Prentice Hall of India, 2006.

5. G. K. Gupta, “Introduction to Data Mining with Case Studies”, Eastern Economy Edition,

Prentice Hall of India, 2006.

6. Daniel T.Larose, “Data Mining Methods and Models”, Wiley-Interscience, 2006.

Course

Outcome

Apply data mining techniques and methods to large data sets.

Use data mining tools

Compare and contrast the various classifiers.

50








U13CS520 Theory of Computation 3 1 0 4 50 50 100

Course

Objective

Understand various Computing models like Finite State Machine, Pushdown Automata,

and Turing Machine.

Be aware of Decidability and Un-decidability of various problems.

Learn types of grammars.

Unit – I FINITE AUTOMATA Periods 12

Introduction- Basic Mathematical Notation and techniques- Finite State systems – Basic Definitions – Finite

Automaton – DFA & NDFA – Finite Automaton with €- moves .

Unit - II REGULAR LANGUAGES Periods 12

Regular Languages- Regular Expression – Equivalence of NFA and DFA – Equivalence of NDFA‟s with and

without €-moves – Equivalence of finite Automaton and regular expressions –Minimization of DFA-

Pumping Lemma for Regular sets – Problems based on Pumping Lemma.

Unit – III GRAMMARS Periods 12

Grammar Introduction– Types of Grammar - Context Free Grammars and Languages– Derivations and

Languages – Ambiguity- Relationship between derivation and derivation trees – Simplification of CFG –

Elimination of Useless symbols - Unit productions - Null productions – Greibach Normal form –Chomsky

normal form – Problems related to CNF and GNF.

Unit - IV PUSHDOWN AUTOMATA Periods 12

Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic pushdown

automata – Equivalence of Pushdown automata and CFL - pumping lemma for CFL – problems based on

pumping Lemma.

Unit – V TURING MACHINES Periods 12

Definitions of Turing machines – Models – Computable languages and functions –Techniques for Turing

machine construction – Multi head and Multi tape Turing Machines - The Halting problem – Partial

Solvability – Problems about Turing machine.

Total Periods 60

REFERENCES:

1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory, Languages and

Computations”, Second Edition, Pearson Education, 2008.

2. John C Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, Tata

McGraw Hill Publishing Company, New Delhi, 2007.

3. Mishra K L P and Chandrasekaran N, “Theory of Computer Science - Automata, Languages and

Computation”, Third Edition, Prentice Hall of India, 2004.

4. Harry R Lewis and Christos H Papadimitriou, “Elements of the Theory of Computation”, Second

Edition, Prentice Hall of India, Pearson Education, New Delhi, 2003.

5. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition, Narosa

Publishers, New Delhi, 2002.

Course

Outcome

Design Finite State Machine, Pushdown Automata, and Turing Machine.

Explain the Decidability or Undesirability of various problems

51








U13CS521 Web Technology 3 0 0 3 50 50 100

Course

Objective

Understand different Internet Technologies.

Be exposed to java specific web services architecture

Unit - I HTML & XHTML Periods 9

The Internet-Basic Internet Protocols -The World Wide Web-HTTP request message-response message-Web

Clients Web Servers. Markup Languages: XHTML. An Introduction to HTML History-Versions-Basic

XHTML Syntax and Semantics-Some Fundamental HTML Elements-Relative URLs-Lists-tables-Frames-

Forms-Creating HTML Documents.

Unit - II CSS & JAVA SCRIPT Periods 9

Style Sheets: CSS-Introduction to Cascading Style Sheets-Features-Core Syntax-Style Sheets and HTML

Style Rules Cascading and Inheritance-Text Properties-Box Model. Client-Side Programming: The JavaScript

Language-History and Versions -Syntax-Variables and Data Types-Statements-Operators- Literals-Functions-

Objects-Arrays-Built-in Objects-DHTML with JavaScript.

Unit - III JAVA SERVLET & JSP Periods 9

Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session Handling-

Understanding Cookies- Installing and Configuring Apache Tomcat Web Server- Database Connectivity:

JDBC perspectives, JDBC program example.

Unit - IV JSP Periods 9

Understanding Java Server Pages-JSP Standard Tag Library(JSTL)-JSP Directives - Creating HTML forms

by embedding JSP code- JSP objects – Page redirection -Session tracking in JSP –introduction to Java bean-

Using java bean with JSP.

Unit - V AJAX & WEB SECURITY Periods 9

AJAX: Ajax Client Server Architecture-Introduction to XML- XML Http Request Object-Call Back

Methods; Web Services: Introduction- Java web services Basics – Creating, Publishing, Testing and

Describing a Web services (WSDL)-Consuming a web service-SOAP.

Total Periods 45

REFERENCES:

1. Jeffrey C. Jackson, "Web Technologies--A Computer Science Perspective", Pearson Education,

2011.

2. Deitel and Deitel and Nieto, “Internet and World Wide Web - How to Program”, Prentice Hall,

5th Edition, 2011.

3. Herbert Schildt, “Java-The Complete Reference”, Eighth Edition, Mc Graw Hill Professional,

2011.

4. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of India, 2011.

5. Chris Bates, Web Programming – Building Intranet Applications, 3rd Edition, Wiley

Publications, 2009.

Course

Outcome

Create a basic website using HTML and Cascading Style Sheets.

Design and implement dynamic web page with validation using JavaScript objects and by

applying different event handling mechanisms.

Design and implement server side programs using Servlets and JSP.

Design rich client presentation using AJAX.

52







Periods Per



U13CS522 System Software 3 0 0 3 50 50 100

Course

Objective

To understand the relationship between system software and machine architecture.

To know the design and implementation of assemblers

To know the design and implementation of linkers and loaders.

To have an understanding of macro processors and system software tools.


System software and machine architecture – The Simplified Instructional Computer (SIC) - Machine

architecture - Data and instruction formats - addressing modes -instruction sets - I/O and programming.

Unit - II ASSEMBLERS Periods 10

Basic assembler functions - A simple SIC assembler – Assembler algorithm and data structures - Machine

dependent assembler features - Instruction formats and addressing modes – Program relocation - Machine

independent assembler features - Literals – Symbol-defining statements – Expressions - One pass assemblers

and Multi pass assemblers

Unit – III LOADERS AND LINKERS Periods 9

Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader -Machine dependent

loader features - Relocation – Program Linking - Machine-independent loader features – Automatic Library

Search – Loader Options - Loader design options - Linkage Editors – Dynamic Linking – Bootstrap Loaders.

Unit - IV MACRO PROCESSORS Periods 9

Basic macro processor functions - Macro Definition and Expansion – Macro Processor Algorithm and data

structures - Machine-independent macro processor features -Concatenation of Macro Parameters –

Generation of Unique Labels – Conditional Macro Expansion.

Unit – V SYSTEM SOFTWARE TOOLS Periods 9

Text editors-Overview of the Editing Process-User Interface–Editor Structure.-Interactive debugging systems

- Debugging functions and capabilities – Relationship with other parts of the system – User-Interface Criteria

Total Periods 45

REFERENCES:

1. Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3

rd Edition,

Pearson Education Asia, 2006.

2. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition,

Tata McGraw-Hill, 2000.

3. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.

4. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann Publishers,

2000

Course

Outcome

Compare and contrast application software and system software.

Examine the role and importance of system software.

The importance of developing a skill set that enables you to work with different System

software Tools.

53








U13CS523 Computer Networks 3 0 0 3 50 50 100

Course

Objective

Understand the division of network functionalities into layers.

Be familiar with the components required to build different types of networks

Be exposed to the required functionality at each layer

Learn the flow control and congestion control algorithms

Unit – I FUNDAMENTALS & LINK LAYER Periods 9

Building a network – Requirements - Layering and protocols - Internet Architecture – Network software –

Performance ; Link layer Services - Framing - Error Detection - Flow control

Unit - II MEDIA ACCESS & INTERNETWORKING Periods 9

Media access control - Ethernet (802.3) - Wireless LANs – 802.11 – Bluetooth - Switching and bridging –

Basic Internetworking (IP, CIDR, ARP, DHCP,ICMP )

Unit – III ROUTING Periods 9

Routing (RIP, OSPF, metrics) – Switch basics – Global Internet (Areas, BGP, IPv6), Multicast –addresses –

multicast routing (DVMRP, PIM)

Unit – IV TRANSPORT LAYER Periods 9

Overview of Transport layer - UDP - Reliable byte stream (TCP) - Connection management – Flow control -

Retransmission – TCP Congestion control - Congestion avoidance (DECbit, RED) – QoS –Application

requirements

Unit – V APPLICATION LAYER Periods 9

Traditional applications -Electronic Mail (SMTP, POP3, IMAP, MIME) – HTTP – Web Services – DNS

- SNMP

Total Periods 45

REFERENCES:

1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fifth Edition,

Morgan Kaufmann Publishers, 2011.

2. James F. Kurose, Keith W. Ross, “Computer Networking - A Top-Down Approach Featuring the

Internet”, Fifth Edition, Pearson Education, 2009.

3. Nader. F. Mir, “Computer and Communication Networks”, Pearson Prentice Hall Publishers,

2010.

4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source

Approach”,

Mc Graw Hill Publisher, 2011.

5. Behrouz A. Forouzan, “Data communication and Networking”, Fourth Edition, TMH, 2011.

Course

Outcome

Identify the components required to build different types of networks

Choose the required functionality at each layer for given application

Identify solution for each functionality at each layer

Trace the flow of information from one node to another node in the network

54








U13CS524 Software Engineering 3 0 0 3 50 50 100

Course

Objective

To understand the importance of software engineering lifecycle models in the

development of software

To understand the various design principles in modeling a software

To develop a software which adheres to the standard benchmarks

To undergo the technical know in the process of software testing.

Unit – I SOFTWARE PROCESS Periods 8

Introduction: Some Definitions, FAQs about software engineering-the evolving role of software- Software

characteristics- SW applications. Software Processes: Software process models- Waterfall model- the

prototyping model- spiral model- RAD and Incremental model. Project Management: Management

activities-Project planning- Project scheduling-Risk Management.

Unit - II SOFTWARE REQUIREMENTS Periods 10

Software Requirements: Functional and non functional requirements-User requirements-System

requirements-the software requirements document. IEEE standard of SRS- Quality of good SRS.

Requirement Engineering Process: Feasibility study- Requirements elicitation and analysis- Requirements

validation- Requirement management.

Unit – III ANALYSIS, DESIGN CONCEPTS AND PRINCIPLES Periods 9

Systems Engineering - Analysis Concepts - Design Process And Concepts – Modular Design – Design

Heuristic – Architectural Design – Data Design – User Interface Design – Real Time Software Design –

System Design – Real Time Executives – Data Acquisition System – Monitoring And Control System.

Unit - IV TESTING Periods 9

Verification and Validation: Verification and Validation Planning- S/W inspection- static analysis.

Software Testing: Testing functions- Test care design- White Box testing-Black box testing- Unit testing-

Integration Testing- System testing- Reliability.

Unit – V MANAGING & QUALITY CONTROL Periods 9

Management: SW cost estimation: Estimation techniques- Algorithmic cost modeling- Project duration and

staffing. Quality Management: Quality assurance and standards-Quality planning- Quality control.

Software Change: Program Evolution Dynamic- S/W Maintenance in detail.

Total Periods 45

REFERENCES:

1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education Asia, 2007.

2. Roger S. Pressman, “Software Engineering – A practitioner‟s Approach”, Sixth Edition,

McGraw-Hill International Edition, 2005.

3. Watts S.Humphrey,”A Discipline for Software Engineering”, Pearson Education, 2007.

4. James F.Peters and Witold Pedrycz,”Software Engineering, An Engineering Approach”, Wiley-

India, 2007

5. Stephen R.Schach, “ Software Engineering”, Tata McGraw-Hill Publishing Company Limited,

2007

6. S.A.Kelkar,”Software Engineering”, Prentice Hall of India Pvt, 2007

Course

Outcome Identify the key activities in managing a software project.

55

Compare different process models.

Concepts of requirements engineering and Analysis Modeling.

Apply systematic procedure for software design and deployment.

Compare and contrast the various testing and maintenance.








U13EN503 Communication Skills & Career

Development Practice Laboratory 0 0 3 2 50 50 100

REFERENCES:

1. Anderson, P.V, Technical Communication, Thomson Wadsworth, 6th Edition, New Delhi, 2007.

2. John Seely, The Oxford Guide to Writing and Speaking, Oxford University Press, New Delhi,

2004.

3. Thorpe, E, and Thorpe, S, Objective English, Pearson Education, Second Edition, New Delhi,

2007.

4. Turton, N.D and Heaton, J.B, Dictionary of Common Errors, Addision Wesley Longman Ltd.,

Indian reprint 1998

5. Barun K. Mitra, Personality Development and Soft Skills, Oxford University Press, New

Delhi, 2011

Course

Outcome

The syllabus focuses and scrutinizes the skill based outcome of every individual student in

the point of corporate requirement and expectations that‟s behavioral as well as cognitional

ability.

In the end of the progression it moulds the students according to the industrial obligates such

as personality development with excellent ability of English communication skills with

Course

Objective

To equip students of engineering and technology with effective speaking and listening

skills in English.

To help them develop their soft skills and interpersonal skills, which will make the

transition from college to workplace smoother and help them excel in their job. English Language Proficiency: Listening Comprehension, Reading Comprehension, Common Errors in

English, Diction and its usage, Framing sentences – Idiomatic Expressions.

Resume – Structuring and Drafting the resume – Cover letter- Writing Professional Letters

Presentation skills: Making Self Introduction effectively-Elements of effective presentation – Structure of

presentation - Presentation tools – Voice Modulation – Audience analysis - Body language – Accents analysis

– Stylistics.

Group Discussion: Introduction – Topic Analysis – Thematic Expressions-Objective and content of

discussion – Persuasion – Discussion – Controlling Emotions - Presentation of the group – Offering support –

Use of functional Language - Summary and conclusion

Soft Skills: Introduction - Change in Today‟s Workplace: Soft Skills as a Competitive Weapon - Antiquity of

Soft Skills - Classification of Soft skills - Ability to work as a team - Innovation, Creativity and Lateral

thinking – Flexibility - Personality Traits and Soft Skills for future Career Advancement-Personality and Soft

Skills for career growth- Time management.

56

reference and accomplishment of corporate etiquettes.

The syllabus entirely concentrates on current trends of the soft skill management, Art of

Speaking with right accent and pronunciation. It ensures the quality and compatibility of the

future Engineers and their fixation of the corporate readiness inclusively corporate

Managerial skills.







Periods Per



U13CS525 Web Technology Laboratory 0 0 3 2 50 50 100

Course

Objective

Be familiar with Web page design using HTML/XML and style sheets

Learn to create dynamic web pages using server side scripting.

Learn to write Client Server applications.

Be exposed to creating applications with AJAX


1. Create a tourism web page for your home town with the following using HTML elements

a. To embed a map in a web page

b. To fix the hot spots in that map

c. Show all the related information when the hot spots are clicked.

d. Develop the feedback form to get the feedback from user.

2. Create a web page with the following.

a. Cascading style sheets.

b. Embedded style sheets.

c. Inline style sheets.

Use our college information for the web pages.

3. Create an E-Mail registration form and validate the necessary field using JavaScript.

4. Write programs in Java to create three-tier applications using servlets for conducting on-line examination.

Assume that questions are available in a database. Finally display total marks obtained by student.

5. Create a webpage with Session tracking using hidden form fields and Session tracking for a hit count

6. Develop the online shopping application using JSP. Assume the product informations are available in the

database already.

7.Explore the following application in AJAX: Searching in real time with live searches, Getting the answer

with auto complete, Chatting with friends ,Dragging and dropping with Ajax, Getting instant login feedback,

Ajax-enabled popup menus, and Modifying Web pages on the fly.

Total Periods 45

Course

Outcome

Design Web pages using HTML/XML and style sheets

Create dynamic web pages using server side scripting.

Write Client Server applications & Create applications with AJAX.

57







Periods Per



U13CS526 Computer Networks Laboratory 0 0 3 2 50 50 100

Course

Objective

Learn socket programming.

Be familiar with simulation tools.

Have hands on experience on various networking protocols.


1. Implementation of Stop and Wait Protocol and Sliding Window Protocol.

2. Write a code simulating PING and TRACEROUTE commands

3. Applications using TCP Sockets like

a. Echo client and echo server

b. Chat

c. File Transfer

4. Applications using TCP and UDP Sockets like

a. DNS

b. SNMP

5. Study of Network simulator (NS) and Simulate the simple scenario using TCP and UDP Agents.

6. Simulation of Congestion Control Algorithms using NS

7. Perform a case study about the different routing algorithms to select the network path with its optimum and

economical during data transfer using NS2 Simulator.

a. Link State routing

b. Flooding

c. Distance vector

Total Periods 45

Course

Outcome

Use simulation tools

Implement the various protocols.

Analyze the performance of the protocols in different layers.

Analyze various routing algorithms

58

VIVEKANANDHA COLLEGE OF ENGINEERING FOR

WOMEN (Autonomous Institution, Affiliated to Anna University

,Chennai)






U13CS628 Artificial Intelligence 3 1 0 4 50 50 100

Course

Objective

Study the concepts of Artificial Intelligence.

Learn the methods of solving problems using Artificial Intelligence.

Introduce the concepts of Expert Systems and machine learning.

Unit – I INTRODUCTION TO Al AND PRODUCTION SYSTEMS Periods 12

Introduction to AI-Problem formulation, Problem Definition -Production systems, Control strategies, Search

strategies. Problem characteristics, Production system characteristics -Specialized production system-

Problem solving methods - Problem graphs, Matching, Indexing and Heuristic functions -Hill Climbing-

Depth first and Breath first, Constraints satisfaction - Related algorithms, Measure of performance and

analysis of search algorithms.

Unit - II REPRESENTATION OF KNOWLEDGE Periods 12

Game playing - Knowledge representation, Knowledge representation using Predicate logic,

Introduction to predicate calculus, Resolution, Use of predicate calculus, Knowledge representation using

other logic-Structured representation of knowledge.

Unit - III KNOWLEDGE INFERENCE Periods 12

Knowledge representation -Production based system, Frame based system. Inference - Backward chaining,

Forward chaining, Rule value approach, Fuzzy reasoning - Certainty factors, Bayesian Theory-

Bayesian Network-Dempster - Shafer theory.

Unit - IV PLANNING AND MACHINE LEARNING Periods 12

Basic plan generation systems - Strips -Advanced plan generation systems – K strips -Strategic

explanations -Why, Why not and how explanations. Learning- Machine learning, adaptive Learning.

Unit - V EXPERT SYSTEMS Periods 12

Expert systems - Architecture of expert systems, Roles of expert systems - Knowledge Acquisition –Meta

knowledge, Heuristics. Typical expert systems - MYCIN, DART, XOON, Expert systems shells

Total Periods 60

REFERENCES:

1. Peter Jackson, “Introduction to Expert Systems”, 3rd

Edition, Pearson Education, 2007.

2. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007. (Unit-III).

3. Peter Jackson, “Introduction to Expert Systems”, 3rd

Edition, Pearson Education, 2007

4. Stuart Russel and Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson Education

2007

5. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education 2013

Course

Outcome

Identify problems that are amenable to solution by AI methods.

Formalize a given problem in the language/framework of different AI methods.

Implement basic AI algorithms.

Design and carry out an empirical evaluation of different algorithms on problem

formalization, and state the conclusions that the evaluation supports.

59






Course code Course name

Periods per

week Credit Maximum Marks


U13CS629 Big Data Analytics 3 0 0 3 50 50 100

Course

Objective

Be exposed to big data & the different ways of Data Analysis

Be familiar with data streams

Learn the mining and clustering

Be familiar with the visualization

Unit – I INTRODUCTION TO BIG DATA Periods 9

Introduction to Big Data Platform – Challenges of conventional systems - Web data – Evolution of Analytic

scalability, analytic processes and tools, Analysis vs reporting - Modern data analytic tools, Stastical

concepts: Sampling distributions, resampling, statistical inference, prediction error.

Unit – II DATA ANALYSIS Periods 9

Regression modeling, Multivariate analysis, Bayesian modeling, inference and Bayesian networks, Support

vector and kernel methods, Analysis of time series: linear systems analysis, nonlinear dynamics - Rule

induction.

Unit – III MINING DATA STREAMS Periods 9

Introduction to Streams Concepts – Stream data model and architecture - Stream Computing, Sampling data

in a stream – Filtering streams – Counting distinct elements in a stream – Estimating moments – Counting

oneness in a window – Decaying window - Real time Analytics Platform(RTAP) applications - real time

sentiment analysis, stock market predictions

Unit – IV FRAMEWORKS Periods 9

MapReduce – Hadoop, Hive, MapR – Sharding – NoSQL Databases - S3 - Hadoop Distributed file systems.

Unit – V VISUALIZATION Periods 9

Visualizations - Visual data analysis techniques- interaction techniques; Systems and applications.

Total Periods 45

REFERENCES:

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

2. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge University

Press, 2012.

3. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams

with advanced analytics”, John Wiley & sons, 2012.

4. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007

5. Pete Warden, “Big Data Glossary”, O‟Reilly, 2011.

6. Jiawei Han, Micheline Kamber “Data Mining Concepts and Techniques”, Second

Edition, Elsevier, Reprinted 2008.

Course

Outcome

Apply the statistical analysis methods.

Compare and contrast various soft computing frameworks.

Design distributed file systems.

Apply Stream data model & use Visualization techniques

60







Periods per



U13CS630 Object Oriented and Analysis Design 3 0 0 3 50 50 100

Course

Objective

Learn the basics of Object Oriented analysis and design skills.

Learn the UML design diagrams.

Learn to map design to code.

Be exposed to the various testing techniques.

Unit – I UML DIAGRAMS Periods 9

Introduction to OOAD – Unified Process - UML diagrams – Use Case – Class Diagrams– Interaction Diagrams

– State Diagrams – Activity Diagrams – Package, component and Deployment Diagrams.

Unit – II DESIGN PATTERNS Periods 9

GRASP: Designing objects with responsibilities – Creator – Information expert – Low Coupling – High

Cohesion – Controller - Design Patterns – creational - factory method - structural – Bridge – Adapter -

behavioral – Strategy – observer.

Unit - III CASE STUDY Periods 9

Case study – the Next Gen POS system, Inception -Use case Modeling - Relating Use cases – include,

extend and generalization - Elaboration - Domain Models - Finding conceptual classes and description classes

– Associations – Attributes – Domain model refinement – Finding conceptual class Hierarchies - Aggregation

and Composition.

Unit - IV APPLYING DESIGN PATTERNS Periods 9

System sequence diagrams - Relationship between sequence diagrams and use cases Logical architecture

and UML package diagram – Logical architecture refinement - UML class diagrams - UML interaction

diagrams - Applying GoF design patterns.

Unit - V CODING AND TESTING Periods 9

Mapping design to code – Testing: Issues in OO Testing – Class Testing – OO Integration Testing – GUI

Testing – OO System Testing.

Total Periods 45

REFERENCES:

1. Craig Larman, "Applying UML and Patterns: An Introduction to Object-Oriented Analysis

and Design and Iterative Development”, Third Edition, Pearson Education, 2005.

2. Simon Bennett, Steve Mc Robb and Ray Farmer, “Object Oriented Systems Analysis and

Design Using UML”, Fourth Edition, Mc-Graw Hill Education, 2010.

3. Erich Gamma, and Richard Helm, Ralph Johnson, John Vlissides, “Design patterns:

Elements of Reusable Object-Oriented Software”, Addison-Wesley, 1995.

4. Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object Modeling Language”,

Third edition, Addison Wesley, 2003.

5. Paul C. Jorgensen, “Software Testing:- A Craftsman‟s Approach”, Third Edition, Auerbach

Publications, Taylor and Francis Group, 2008.

Course

Outcome

Design and implement projects using OO concepts.

Use the UML analysis and design diagrams.

Compare and contrast various testing techniques

61








U13CS631 Compiler Design 3 1 0 4 50 50 100

Course

Objective

Learn the design principles of a Compiler.

Learn the various parsing techniques and different levels of translation

Learn how to optimize and effectively generate machine codes

Unit - I INTRODUCTION TO COMPILERS Periods 12

Translators-Compilation and Interpretation-Language processors -The Phases of Compiler-Errors

Encountered in Different Phases-The Grouping of Phases-Compiler Construction Tools - Programming

Language basics

Unit - II LEXICAL ANALYSIS Periods 12

Need and Role of Lexical Analyzer-Lexical Errors-Expressing Tokens by Regular Expressions-

Converting Regular Expression to DFA- Minimization of DFA-Language for Specifying Lexical

Analyzers-LEX-Design of Lexical Analyzer for a sample Language.

Unit – III SYNTAX ANALYSIS Periods 12

Need and Role of the Parser-Context Free Grammars -Top Down Parsing -General Strategies-

Recursive Descent Parser Predictive Parser-LL(1) Parser-Shift Reduce Parser-LR Parser-LR (0)Item-

Construction of SLR Parsing Table -Introduction to LALR Parser - Error Handling and Recovery in Syntax

Analyzer-YACC-Design of a syntax Analyzer for a Sample Language.

Unit – IV SYNTAX DIRECTED TRANSLATION & RUN TIME

ENVIRONMENT Periods 12

Syntax directed Definitions-Construction of Syntax Tree-Bottom-up Evaluation of S-Attribute

Definitions- Design of predictive translator - Type Systems-Specification of a simple type checker-

Equivalence of Type Expressions-Type Conversions. RUN-TIME ENVIRONMENT: Source Language

Issues-Storage Organization-Storage Allocation-Parameter Passing-Symbol Tables-Dynamic Storage

Allocation-Storage Allocation in FORTAN.

Unit – V CODE OPTIMIZATION AND CODE GENERATION Periods 12

Principal Sources of Optimization-DAG- Optimization of Basic Blocks-Global Data Flow Analysis-

Efficient Data Flow Algorithms-Issues in Design of a Code Generator - A Simple Code Generator

Algorithm.

Total Periods 60

REFERENCES:

1. Alfred V Aho, Monica S. Lam, Ravi Sethi and Jeffrey D Ullman, “Compilers – Principles,

Techniques and Tools”, 2nd

Edition, Pearson Education, 2007.

2. Randy Allen, Ken Kennedy,“Optimizing Compilers for Modern Architectures: A

Dependence-based Approach”, Morgan Kaufmann Publishers, 2002

3. Steven S. Muchnick, “Advanced Compiler Design and Implementation, “Morgan Kaufmann

Publishers - Elsevier Science, India, Indian Reprint 2003

4. Keith D Cooper and Linda Torczon, “Engineering a Compiler”, Morgan Kaufmann

Publishers Elsevier Science, 2004

5. Charles N. Fischer, Richard. J. LeBlanc, “Crafting a Compiler with C”, Pearson Education, 008

Course

Outcome

Design and implement a prototype compiler.

Apply the various optimization techniques.

Use the different compiler construction tools.

62








U13CS632 XML and Web Services 3 0 0 3 50 50 100

Course

Objective

Learn XML fundamentals.

Be exposed to build applications based on XML.

Learn various web service standards.


Role Of XML - XML and The Web - XML Language Basics - SOAP - Web Services - Revolutions Of XML

- Service Oriented Architecture (SOA).

Unit - II XML TECHNOLOGY Periods 9

XML - Name Spaces - Structuring With Schemas and DTD - Presentation Techniques - Transformation –

XML Infrastructure.

Unit – III SOAP Periods 9

Overview Of SOAP - HTTP - XML-RPC - SOAP: Protocol - Message Structure - Intermediaries - Actors -

Design Patterns And Faults - SOAP With Attachments.

Unit - IV WEB SERVICES Periods 9

Overview - Architecture - Key Technologies - UDDI - WSDL - ebXML - SOAP And Web Services In E-

Com - Overview Of .NET And J2EE.

Unit – V XML SECURITY Periods 9

Security Overview - Canonicalization - XML Security Framework - XML Encryption - XML Digital

Signature - XKMS Structure - Guidelines For Signing XML Documents - XML In Practice.

Total Periods 45

REFERENCES:

1. Ramesh Nagappan , Robert Skoczylas and Rima Patel Sriganesh, " Developing Java Web

Services", Wiley Publishing Inc., 2004.

2. Sandeep Chatterjee, James Webber, "Developing Enterprise Web Services", Pearson

Education, 2004.

3. McGovern, et al., "Java Web Services Architecture", Morgan Kaufmann Publishers,2005.

Course

Outcome

Learn some of Semantic Web technologies and applications

Design and code data transfer scripts using XML languages for the transfer of data over

business networks and the Internet.

Validate XML documents with the use of Document Type Definitions and schemas

according to industry standards.

63








U13CS633 Compiler Design Laboratory 0 0 3 2 50 50 100

Course

Objective

Be exposed to compiler writing tools.

Learn to implement the different Phases of compiler

Be familiar with control flow and data flow analysis

Learn simple optimization techniques


1. Implementation of Symbol Table

2. Develop a lexical analyzer to recognize a few patterns in C. (Ex. identifiers, constants, comments,

operators etc.)

3. Implementation of Lexical Analyzer using Lex Tool

4. Generate YACC specification for a few syntactic categories. a) Program to recognize a valid

arithmetic expression that uses operator +, - , * and /. b) Program to recognize a valid variable

which starts with a letter followed by any number of letters or digits. d)Implementation of

Calculator using LEX and YACC

5. Implement control flow analysis and Data flow Analysis

6. Implement any one storage allocation strategies(Heap ,Stack, Static)

7. Construction of DAG

8. Implement the back end of the compiler which takes the three address code and produces the

8086 assembly language instructions that can be assembled and run using a 8086 assembler. The

target assembly instructions can be simple move, add, sub, jump. Also simple addressing modes

are used.

9. Implementation of Simple Code Optimization Techniques (Constant Folding. etc.)

Total Periods 45

Course

Outcome

Implement the different Phases of compiler using tools

Analyze the control flow and data flow of a typical program

Optimize a given program and Generate an assembly language program equivalent to

a source language program

64







Periods Per



U13CS634 Case Tools Laboratory 0 0 3 2 50 50 100

Course

Objective

Learn the basics of Object Oriented analysis and design skills.

Be exposed to the UML design diagrams.

Learn to map design to code.

Be familiar with the various testing techniques


To develop a mini-project by following the 9 exercises listed below.

1. To develop a problem statement.

2. Identify Use Cases and develop the Use Case model.

3. Identify the conceptual classes and develop a domain model with UML Class diagram.

4. Using the identified scenarios find the interaction between objects and represent them using UML

Sequence diagrams.

5. Draw relevant state charts and activity diagrams.

6. Identify the User Interface, Domain objects, and Technical services. Draw the partial layered, logical

architecture diagram with UML package diagram notation.

7. Develop and test the Technical services layer.

8. Develop and test the Domain objects layer.

9. Develop and test the User interface layer.

SUGGESTED DOMAINS FOR MINI-PROJECT:

1. Passport automation system.

2. Book bank

3. Exam Registration

4. Stock maintenance system.

5. Online course reservation system

6. E-ticketing

7. Software personnel management system

8. Credit card processing

9. e-book management system

10. Recruitment system

11. Foreign trading system

12. Conference Management System

13. BPO Management System

14. Library Management System

15. Student Information System

Total Periods 45

Course

Outcome

Design and implement projects using OO concepts.

Use the UML analysis and design diagrams.

Create code from design.

Compare and contrast various testing techniques

65







Periods Per



U13CS635 XML and Web Services Laboratory 0 0 3 2 50 50 100

Course

Objective

Be familiar with Web page design using XML and style sheets

Learn to create web services.

Learn to design application using Xqurey.


1. Program using Sample xml schema

2. Program using Validation and Conversion

3. Program using XSL Transformation

4. Program using XSLT and FO

5. Program using XML and XQuery

6. Develop & Use Simple Web services

7. Mini Project

Total Periods 45

Course

Outcome

Design Web pages using XML and style sheets.

Create a new web services.

66








U13CS736 Open Source Software 3 0 0 3 50 50 100

Course

Objective

Promoting the use of OSS in learning, teaching and administrative IT infrastructure.

To train the students in Linux, Mysql.

To Make the student to develop websites using PHP

To understand the open source scripting languages Python and Perl.

Unit – I INTRODUCTION TO OPEN SOURCES Periods 9

Introduction to Open sources – Need of Open Sources – Advantages of Open Sources – Application of Open

Sources.

Unit – II OPEN SOURCE OPERATING SYSTEM - LINUX Periods 9

Introduction – General Overview – Kernel Mode and user mode – Process – Advanced Concepts –Scheduling

– Signals - Development with Linux.

Unit – III PHP Periods 9

Essential PHP - Operators and Flow control - Strings and Arrays - Creating functions - Reading data in web

pages - PHP Browser Handling Power - File Handling -Working with Databases.

Unit – IV PYTHON Periods 9

Syntax and Style – Python Objects – Numbers – Sequences – Strings – Lists and Tuples –

Dictionaries – Conditionals and Loops – Files and Input and Output –Functions –Calling and Creating

Function-Passing Function-Formal Arguments-Functional Programming-Recursion-Modules-Namespaces-

Importing Modules and Packages.

Unit – V PERL Periods 9

PERL overview - Variables and Data – Statements and Control structures – Subroutines, Packages and

Modules - Working with Files.

Total Periods 45

REFERENCES:

1. Remy Card, Eric Dumas and Frank Mevel, “The Linux KernelBook”, WileyPublications, 2003

2. Steve Suchring, “MySQL Bible”, John Wiley, 2002

3. Rasmus Lerdorf and Levin Tatroe, “Programming PHP”, O‟Reilly,2002

4. Wesley J. Chun, “Core Python Programming”, Prentice Hall, 2001

5. Martin C. Brown, “Perl: The Complete Reference”, 2nd Edition, TataMcGraw-Hill

Publishing Company Limited, Indian Reprint 2009.

Course

Outcome

Understand the benefits of OSS and essential structure of Linux

Have working knowledge in Linux Operating System environment.

Design and implement a small to medium size web-enabled information storage and

retrieval system using PHP & MySQL

Understand the syntax and style of python and perl scripting.

67








U13CS737 Cloud Computing 3 0 0 3 50 50 100

Course

Objective

To introduce the broad perceptive of cloud architecture and model

To understand the concept of Virtualization and features of cloud simulator

To be familiar with the lead players in cloud.

To apply different cloud programming model as per need

Unit – I CLOUD ARCHITECTURE AND MODEL Periods 9

Technologies for Network-Based System – System Models for Distributed and Cloud Computing – NIST

Cloud Computing Reference Architecture. Cloud Models:- Characteristics – Cloud Services – Cloud models

(IaaS, PaaS, SaaS) – Public vs Private Cloud –Cloud Solutions - Cloud ecosystem – Service management –

Computing on demand.

Unit - II VIRTUALIZATION Periods 9

Basics of Virtualization - Types of Virtualization - Implementation Levels of Virtualization - Virtualization

Structures - Tools and Mechanisms - Virtualization of CPU, Memory, I/O Devices - Virtual Clusters and

Resource management – Virtualization for Data-center Automation.

Unit – III CLOUD INFRASTRUCTURE Periods 9

Architectural Design of Compute and Storage Clouds – Layered Cloud Architecture Development – Design

Challenges - Inter Cloud Resource Management – Resource Provisioning and Platform Deployment – Global

Exchange of Cloud Resources.

Unit - IV PROGRAMMING MODEL Periods 9

Parallel and Distributed Programming Paradigms – MapReduce , Twister and Iterative MapReduce – Hadoop

Library from Apache – Mapping Applications - Programming Support - Google App Engine, Amazon AWS -

Cloud Software Environments -Eucalyptus, Open Nebula, OpenStack, CloudSim

Unit – V SECURITY IN THE CLOUD Periods 9

Security Overview–Cloud Security Challenges and Risks–Software-as-a-Service Security–Security

Governance–Risk Management–Security Monitoring–Security Architecture Design–Data Security–

Application Security–Virtual Machine Security-Identity Management and Access Control–Autonomic

Security.

Total Periods 45

REFERENCES:

1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, “Distributed and Cloud Computing, From

Parallel Processing to the Internet of Things”, Morgan Kaufmann Publishers, 2012.

2. John W.Rittinghouse and James F.Ransome, “Cloud Computing: Implementation, Management,

and Security”, CRC Press, 2010.

3. Toby Velte, Anthony Velte, Robert Elsenpeter, “Cloud Computing, A Practical Approach”,

TMH, 2009.

4. Kumar Saurabh, “ Cloud Computing – insights into New-Era Infrastructure”, Wiley India,2011.

5. George Reese, “Cloud Application Architectures: Building Applications and Infrastructure in the

Cloud” O'Reilly

6. James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for Systems and Processes”,

Elsevier/Morgan Kaufmann, 2005.

68

7. Katarina Stanoevska-Slabeva, Thomas Wozniak, Santi Ristol, “Grid and Cloud Computing – A

Business Perspective on Technology and Applications”, Springer.

8. Ronald L. Krutz, Russell Dean Vines, “Cloud Security – A comprehensive Guide to Secure

Cloud Computing”, Wiley – India, 2010.

9. Rajkumar Buyya, Christian Vecchiola, S.Tamarai Selvi, „Mastering Cloud Computing”,

TMGH,2013.

10. Gautam Shroff, Enterprise Cloud Computing, Cambridge University Press, 2011

11. Michael Miller, Cloud Computing, Que Publishing,2008

12. Nick Antonopoulos, Cloud computing, Springer Publications, 2010

Course

Outcome

Compare the strengths and limitations of cloud computing

Identify the architecture, infrastructure and delivery models of cloud computing

Choose the appropriate Programming Models and approach.

Address the core issues of cloud computing such as security, privacy and interoperability








U13CS738 Cryptography and Network

Security 3 1 0 4 50 50 100

Course

Objective

Understand OSI security architecture and classical encryption techniques.

Acquire fundamental knowledge on the concepts of finite fields and number theory.

Understand various block cipher and stream cipher models.

Describe the principles of public key cryptosystems, hash functions and digital

signature.


Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical Encryption

techniques: Symmetric cipher model, substitution techniques, transposition techniques, steganography.

Unit - II BLOCK CIPHERS & PUBLIC KEY CRYPTOGRAPHY Periods 13

Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced Encryption

Standard (AES)-Triple DES-Blowfish-RC5 algorithm. Public key cryptography: Principles of public key

cryptosystems-The RSA algorithm-Key management - Diffie Hellman Key exchange-Elliptic curve

arithmetic-Elliptic curve cryptography.

Unit - III HASH FUNCTIONS AND DIGITAL SIGNATURES Periods 11

Authentication requirement – Authentication function – MAC – Hash function – Security of hash function

and MAC –MD5 - SHA - HMAC – CMAC - Digital signature and authentication protocols – DSS – EI

Gamal – Schnorr.

Unit - IV SECURITY PRACTICE & SYSTEM SECURITY Periods 11

Authentication applications – Kerberos – X.509 Authentication services - Internet Firewalls for Trusted

System: Roles of Firewalls – Firewall related terminology- Types of Firewalls - Firewall designs - SET for E-

Commerce Transactions. Intruder – Intrusion detection system – Virus and related threats – Countermeasures

69

– Firewalls design principles – Trusted systems.

Unit - V E-MAIL, IP & WEB SECURITY Periods 12

E-mail Security: Security Services for E-mail-attacks possible through E-mail - establishing keys privacy-

authentication of the source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME. IPSecurity:

Overview of IPSec - IP and IPv6-Authentication Header-Encapsulation Security Payload -Internet Key

Exchange. Web Security: SSL/TLS Basic Protocol-computing the keys- client authentication-PKI as

deployed by SSLAttacks fixed in v3- Exportability-Encoding-Secure Electronic Transaction.

Total Periods 60

REFERENCES:

1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March

2013.

2. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security”, Prentice Hall of India,

2002.

3. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata Mc Graw Hill, 2007

4. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”,

Wiley Publications, 2003.

5. Charles Pfleeger, “Security in Computing”, 4th Edition, Prentice Hall of India, 2006.

Course

Outcome

Compare various Cryptographic Techniques

Design Secure applications

Inject secure coding in the developed applications

70








U13CS739 Mobile Computing 3 0 0 3 50 50 100

Course

Objective

Understand the basic concepts of mobile computing

Learn the basics of mobile telecommunication system

Be exposed to Ad-Hoc networks

Gain knowledge about different mobile platforms and application development


Mobile Computing–Mobile Computing Vs wireless Networking–Mobile Computing Applications–

Characteristics of Mobile computing–Structure of Mobile Computing Application. MAC Protocols– Wireless

MAC Issues–Fixed Assignment Schemes–Random Assignment Schemes – Reservation Based Schemes.

Unit – II MOBILE INTERNET PROTOCOL AND TRANSPORT LAYER Periods 9

Overview of Mobile IP–Features of Mobile IP–Key Mechanism in Mobile IP–route Optimization. Overview

of TCP/IP–Architecture of TCP/IP-Adaptation of TCP Window–Improvement in TCP Performance.

Unit – III MOBILE TELECOMMUNICATION SYSTEM Periods 9

Global System for Mobile Communication (GSM)–General Packet Radio Service (GPRS)–Universal Mobile

Telecommunication System (UMTS).

Unit – IV MOBILE AD-HOC NETWORKS Periods

9

Ad-Hoc Basic Concepts–Characteristics–Applications–Design Issues–Routing–Essential of Traditional

Routing Protocols–Popular Routing Protocols–Vehicular Ad Hoc networks(VANET)–MANET Vs VANET –

Security.

Unit – V MOBILE PLATFORMS AND APPLICATIONS Periods 9

Mobile Device Operating Systems – Special Constrains & Requirements – Commercial Mobile Operating

Systems – Software Development Kit: iOS, Android, BlackBerry, Windows Phone – MCommerce –

Structure – Pros & Cons – Mobile Payment System – Security Issues.

Total Periods 45

REFERENCES:

1. Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.

Ltd, New Delhi – 2012.

2. Jochen H. Schller, “Mobile Communications”, Second Edition, Pearson Education, New Delhi,

2007.

3. Dharma Prakash Agarval, Qing and An Zeng, "Introduction to Wireless and Mobile systems",

Thomson Asia Pvt Ltd, 2005.

4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile

Computing”, Springer, 2003.

5. William.C.Y.Lee,“Mobile Cellular Telecommunications-Analog and Digital Systems”, Second

Edition,Tata Mc Graw Hill Edition ,2006.

6. C.K.Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education, 2002.

Course

Outcome

Explain the basics of mobile telecommunication system

Choose the required functionality at each layer for given application

Identify solution for each functionality at each layer

Use simulator tools and design Ad hoc networks

71







Periods Per



U13CS740 Open Source Laboratory 0 0 3 2 50 50 100

Course

Objective

To introduce OSS environment and OSS operating Systems.

To learn the installation of various open source software.

To learn PHYTON and PERL programming.

To learn the installation of NS2 and various tcl scripts execution.


1. Installation of Linux in GUI mode

2. My SQL installation

3. Apache installation

4. PHP with Database connectivity(Retrieving and uploading data, dynamic internet applications)

5. PYTHON programming

6. Perl programming.

7. Network simulator (NS2) installation and simple tcl scripts

Total Periods 45

Course

Outcome

Install the Linux Operating System and configure the required services.

Develop the websites using PHP and Mysql

Have working knowledge in Perl, Python scripting language and NS2.

72








U13CS741 Mobile Application Development

Laboratory 0 0 3 2 50 50 100

Course

Objective

Know the components and structure of mobile application development frameworks

for Android and windows OS based mobiles.

Understand how to work with various mobile application development frameworks.

Learn the basic and important design concepts and issues of development of mobile

applications.


1. Develop an application that uses GUI components, Font and Colours

2. Develop an application that uses Layout Managers and event listeners.

3. Develop a native calculator application.

4. Write an application that draws basic graphical primitives on the screen.

5. Develop an application that makes use of database.

6. Develop an application that makes use of RSS Feed.

7. Implement an application that implements Multi threading

8. Develop a native application that uses GPS location information.

9. Implement an application that writes data to the SD card.

10. Implement an application that creates an alert upon receiving a message.

Total Periods 45

Course

Outcome

Design and Implement various mobile applications using emulators.

Deploy applications to hand-held devices

73





Department COMPUTER SCIENCE AND ENGINEERING Semester VIII



U13CS843 Software Project Management 3 0 0 3 50 50 100

Course

Objective

To outline the need for Software Project Management

To highlight different techniques for software cost estimation and activity planning.

Unit – I PROJECT EVALUATION AND PROJECT PLANNING Periods 9

Importance of Software Project Management – Activities Methodologies – Categorization of Software

Projects – Setting Objective – Management Principles – Management Control – Project portfolio

Management – Cost-benefit evaluation technology – Risk evaluation – Strategic program Management –

Stepwise Project Planning.

Unit - II PROJECT LIFE CYCLE AND EFFORT ESTIMATION Periods 9

Software process and Process Models – Choice of Process models - mental delivery – Rapid Application

development – Agile methods – Extreme Programming – SCRUM – Managing interactive processes – Basics

of Software estimation – Effort and Cost estimation techniques – COSMIC Full function points - COCOMO

II A Parametric Productivity Model - Staffing Pattern.

Unit – III ACTIVITY PLANNING AND RISK MANAGEMENT Periods 9

Objective of Activity planning – Project schedules – Activities – Sequencing and scheduling – Network

Planning models – Forward Pass & Backward Pass techniques – Critical path (CRM) method – Risk

identification – Assessment – Monitoring – PERT technique – Monte Carlo simulation – Resource Allocation

– Creation of critical patterns – Cost schedules.

Unit – IV PROJECT MANAGEMENT AND CONTROL Periods 9

Framework for Management and control – Collection of data Project termination – Visualizing progress –

Cost monitoring – Earned Value Analysis- Project tracking – Change control- Software Configuration

Management – Managing contracts – Contract Management.

Unit – V STAFFING IN SOFTWARE PROJECTS Periods 9

Managing people – Organizational behavior – Best methods of staff selection – Motivation – The Oldham-

Hackman job characteristic model – Ethical and Programmed concerns – Working in teams – Decision

making – Team structures – Virtual teams – Communications genres – Communication plans.

Total Periods 45

REFERENCES:

1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata

McGraw Hill, New Delhi, 2012.

2. Robert K. Wysocki “Effective Software Project Management” – Wiley Publication, 2011.

3. Walker Royce: “Software Project Management”- Addison-Wesley, 1998.

4. Gopalaswamy Ramesh, “Managing Global Software Projects” – McGraw Hill Education (India),

Fourteenth Reprint 2013.

Course

Outcome

Apply systematic procedure for software design and deployment

Compare and contrast the various testing and maintenance.

74





Department COMPUTER SCIENCE AND ENGINEERING Semester Elective-I



U13CSE01 Microprocessor and

Microcontroller 3 0 0 3 50 50 100

Course

Objective

Study the Architecture of 8086 microprocessor.

Learn the design aspects of I/O and Memory Interfacing circuits.

Study about communication and bus interfacing.

Study the Architecture of 8051 microcontroller.

Unit – I THE 8086 MICROPROCESSOR Periods 9

Introduction to 8086 – Microprocessor architecture – Addressing modes - Instruction set and assembler

directives – Assembly language programming – Modular Programming - Linking and Relocation - Stacks -

Procedures – Macros – Interrupts and interrupt service routines – Byte and String Manipulation.

Unit - II 8086 SYSTEM BUS STRUCTURE Periods 9

8086 signals – Basic configurations – System bus timing –System design using 8086 – IO programming –

Introduction to Multiprogramming – System Bus Structure - Multiprocessor configurations – Coprocessor,

Closely coupled and loosely Coupled configurations – Introduction to advanced processors.

Unit – III I/O INTERFACING Periods 9

Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface

– D/A and A/D Interface - Timer – Keyboard /display controller – Interrupt controller – DMA controller –

Programming and applications Case studies: Traffic Light control, LED display , LCD display, Keyboard

display interface and Alarm Controller.

Unit - IV MICROCONTROLLER Periods 9

Architecture of 8051 – Special Function Registers(SFRs) - I/O Pins Ports and Circuits - Instruction set -

Addressing modes - Assembly language programming.

Unit – V INTERFACING MICROCONTROLLER Periods 9

Programming 8051 Timers - Serial Port Programming - Interrupts Programming – LCD & Keyboard

Interfacing - ADC, DAC & Sensor Interfacing - External Memory Interface- Stepper Motor and Waveform

generation.

Total Periods 45

REFERENCES:

1. Yu-Cheng Liu, Glenn A.Gibson, “Microcomputer Systems: The 8086 / 8088 Family -

Architecture, Programming and Design”, Second Edition, Prentice Hall of India, 2007.

2. Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, “The 8051 Microcontroller and

Embedded Systems: Using Assembly and C”, Second Edition, Pearson Education, 2011.

3. Doughlas V.Hall, “Microprocessors and Interfacing, Programming and Hardware:,TMH, 2012.

Course

Outcome

Design and implement programs on 8086 microprocessor.

Design I/O circuits.

Design Memory Interfacing circuits.

Design and implement 8051 microcontroller based systems.

75







Periods per



U13CSE02 Visual Programming 3 0 0 3 50 50 100

Course

Objective

To understand the concept of visual programming

To develop the skills required to design an event handling application

Unit - I BASIC CONCEPTS OF VISUAL PROGRAMMING Periods 9

Customizing Form- Writing simple programs- Toolbox- Creating Controls- Name Property- Command

Button- Access Keys- Image Controls- Text Boxes- Labels- Message Boxes- Grid- Editing Tools- Bitmaps –

Palettes – Device-Independent Bitmaps-Variables- Data Types- String- Numbers.

Unit - II FUNCTIONS AND CONTROLS Periods 9 Displaying information- Determinate Loops- Indeterminate Loops- Conditionals- Built-in functions-

Functions and Procedures- Controls – Modal and Modeless Dialog – Property – Data I/O – Sound – Timer

Unit - III EVENT HANDLING Periods 9 Lists- Array- Sorting and Searching- Record- Control Arrays- Combo Boxes- Grid Control- Projects with

Multiple Forms- Do Events and Sub Main- Error Trapping

Unit - IV GRAPHICAL ENVIRONMENT Periods 9 VB objects- Dialog Boxes- Common Controls- Menus- MDI Forms- Testing, Debugging and Optimization-

Working with Graphics- Working with Images- Memory management – SDI – MDI – MFC for Advanced

windows user Interface – Tree view – List view – Threads

Unit - V FILE HANDLING SYSTEM Periods 9 Monitoring Mouse Activity- File Handling- File System Controls- File system Objects- COM Fundamentals –

ActiveX control – ATL – Internet Programming- COM/OLE- Automation- DLL Servers- OLE Drag and

Drop- ODBC.

Total Periods 45

REFERENCES:

1. Gary Cornell, “Visual Basic 6 from the Ground up”, Tata McGraw-Hill,1999

2. Noel Jerke, “Visual Basic 6 (The Complete Reference)”, Tata McGraw-Hill,1999

3. B. Siler and J. Spotts, “Special Editor using Visual Basic 6”, PHI, 2001

4. David I. Schneider, “An Introduction to programming using Visual Basic 2005 (6

th ed.)”, Pearson

Edition Inc.,2007

Course

Outcome

Explore Visual C++ Integrated Development Environment (IDE).

Understand the variables and data types used in program development.

Develop application using File handling and event handling in VC++

76








U13CSE03 Middleware Technology 3 0 0 3 50 50 100

Course

Objective

Establish communication between client and server through java RMI and JDBC

Carry out client server communication using heterogeneous programming languages

using CORBA.

Unit – I CLIENT / SERVER CONCEPTS Periods 9

Client-Server − File server − Database server − Group server − Object server − Web server −

Middleware − General middleware − Service specific middleware − Client / server building blocks −

RPC − Messaging − Peer-to-Peer.

Unit - II EJB ARCHITECTURE Periods 9

EJB − EJB architecture − Overview of EJB software architecture − View of EJB − Conversation −

Building and deploying EJBs − Roles in EJB.

Unit – III EJB APPLICATIONS Periods 9

EJB session beans−EJB entity beans−EJB clients−EJB deployment−Building an application with

EJB.

Unit - IV CORBA Periods 9

CORBA−Distributed systems−Purpose−Exploring CORBA alternatives−Architecture overview

CORBA and networking model−CORBA object model−IDL−ORB−Building an application with

CORBA

Unit – V COM Periods 9

COM − Data types − Interfaces − Proxy and stub − Marshalling − Implementing server/client −

Interface pointers − Object creation − Invocation − Destruction − Comparison COM and CORBA −

Introduction to .NET − Overview of .NET architecture − Marshalling − Remoting.

Total Periods 45

REFERENCES:

1. Robert Orfali, Dan Harkey and Jeri Edwards, “The Essential Client / Server Survival Guide”,

Galgotia Publications Pvt. Ltd., 2002.

2. Tom Valesky, “Enterprise Java Beans”, Pearson Education, 2002. -

3. Mowbray, “Inside CORBA”, Pearson Education, 2002.

4. Jeremy Rosenberger, “Teach Yourself CORBA in 14 days”, TEC Media, 2000

5. Jason Pritchard, “COM and CORBA Side by Side”, Addison Wesley, 2000

Course

Outcome

Know client server computing models and can establish communication between them

Design a dynamic remote application with RMI and JDBC Connectivity

Differentiate homogeneous and heterogeneous language communications.

Develop real time projects by combining CORBA and database interfacing.

77







Periods per



U13CSE04 Distributed Systems 3 0 0 3 50 50 100

Course

Objective

Understand foundations of Distributed Systems.

Introduce the idea of peer to peer services and file system.

Understand in detail the system level and support required for distributed system.

Understand the issues involved in studying process and resource management.


Characterization of Distributed Systems- System Models-Architectural-Fundamental -Examples of

Distributed Systems–Trends in Distributed Systems – Focus on resource sharing – Challenges.

Unit – II COMMUNICATION IN DISTRIBUTED SYSTEM Periods 9

Inter process Communication - the API for internet protocols – External data representation and Multicast

communication. Network virtualization: Overlay networks. Remote Method Invocation And Objects: Remote

Invocation – Introduction - Request-reply protocols - Remote procedure call - Remote method invocation.

Unit – III PEER TO PEER SERVICES AND FILE SYSTEM Periods 9

Peer-to-peer Systems–Introduction-Napster and its legacy-Peer-to-peer–Middleware-Routing overlays.

Distributed File Systems: Introduction - File service architecture–Andrew File system. File System: Features-

File model -File accessing models - File sharing semantics Naming: Identifiers, Addresses, Name Resolution

Unit – IV PROCESS & RESOURCE MANAGEMENT Periods 9

Process Management: Process Migration: Features, Mechanism - Threads: Models, Issues. Resource

Management: Introduction- Features of Scheduling Algorithms –Task Assignment Approach – Load

Balancing Approach – Load Sharing Approach.

Unit – V SYNCHRONIZATION AND REPLICATION Periods 9

Introduction - Clocks, events and process states - Synchronizing physical clocks- Logical time and logical

clocks - Global states – Coordination and Agreement – Introduction - Distributed mutual exclusion –

Elections – Transactions and Concurrency Control– Transactions -Nested transactions – Locks – Optimistic

concurrency control - Timestamp ordering – Atomic Commit protocols -Distributed deadlocks – Replication

Total Periods 45

REFERENCES:

1. George Coulouris, Jean Dollimore, Tim Kindberg, "Distributed Systems: Concepts and Design",

4th Edition, Pearson Education, 2005.

2. A.TS. Tanenbaum and M. V. Steen, "Distributed Systems: Principles and Paradigms", Second

Edition, Prentice Hall, 2006.

3. M.L.Liu, “Distributed Computing Principles and Applications”, Pearson Addison Wesley, 2004.

4. Mukesh Singhal, “Advanced Concepts In Operating Systems”, McGraw Hill Series in Computer

Science, 1994.

5. Nancy A. Lynch, "Distributed Algorithms", The Morgan Kaufmann Series in Data Management

System, Morgan Kaufmann Publishers, 2000.

Course

Outcome

Discuss trends in Distributed Systems.

Apply network virtualization.

Apply remote method invocation and objects.

Design process and resource management systems

78








U13CSE05 Real Time Systems 3 0 0 3 50 50 100

Course

Objective

To gain the knowledge on various applications of Microcontrollers, Real time

operating system and also advanced architectures like ARM and SHARC.


Introduction - Issues in Real Time Computing- Structure of a Real Time System-Task Classes- Performance

Measures for Real Time Systems- Estimating Program Run times- Task Assignment and Scheduling -

Classical Uniprocessor scheduling algorithms- UniProcessor scheduling of IRIS Tasks- Task Assignment-

Mode Changes and Fault Tolerant Scheduling.

Unit – II PROGRAMMING LANGUAGES AND TOOLS Periods 9

Programming Language and Tools – Desired Language characteristics- Data Typing- Control structures-

Facilitating Hierarchical Decomposition- Packages, Run-time (Exception) Error handling- Overloading and

Generics, Multitasking-Low Level programming, Task scheduling- Timing Specifications- Programming

Environments- Run-time Support.

Unit – III REAL TIME DATABASES Periods 9

Real time Databases - Basic Definition- Real time Vs General Purpose Databases- Main Memory Databases-

Transaction priorities- Transaction Aborts- Concurrency Control Issues- Disk Scheduling Algorithms- Two-

phase Approach to improve Predictability- Maintaining Serialization Consistency- Databases for Hard Real

Time systems.

Unit – IV COMMUNICATION Periods 9

Real-Time Communication - Communications Media-Network Topologies Protocols- Fault Tolerant Routing.

Fault Tolerance Techniques - Fault Types, Fault Detection. Fault Error containment Redundancy-Data

Diversity- Reversal Checks- Integrated Failure handling.

Unit – V EVALUATION TECHNIQUES Periods 9

Reliability Evaluation Techniques-Obtaining Parameter Values-Reliability Models for Hardware

Redundancy- Software Error models-Clock Synchronization – Clock- A Nonfault-Tolerant Synchronization

Algorithm- Impact of Faults-Fault Tolerant Synchronization in Hardware- Fault Tolerant Synchronization in

Software

Total Periods 45

REFERENCES:

1. C.M. Krishna, Kang G. Shin, “Real-Time Systems”, McGraw-Hill International Editions, 1997.

2. Stuart Bennett, “Real Time Computer Control-An Introduction”, Second edition Prentice Hall

PTR, 1994.

3. Peter D. Lawrence, “Real time Micro Computer System Design – An Introduction”, McGraw

Hill, 1988

4. S.T. Allworth and R.N. Zobel, “Introduction to real time software design”, Macmillan, II

nd

Edition, 1987

5. R.J.A Buhur, D.L. Bailey, “An Introduction to Real-Time Systems”, Prentice-Hall International,

1999.

Course

Outcome

An ability to understand advanced concepts in applications of computer science.

An ability to apply knowledge of advanced computer science to formulate the analyze

problems in computing and solve them

79







Periods per



U13CSE06 Advanced Database Technology 3 0 0 3 50 50 100

Course

Objective

Learn different types of databases.

Be exposed to query languages.

Be familiar with the indexing techniques.

Unit – I PARALLEL AND DISTRIBUTED DATABASES Periods 9

Inter and Intra Query Parallelism – Architecture – Query evaluation – Optimization – Distributed

Architecture – Storage – Catalog Management – Query Processing - Transactions – Recovery - Large-scale

Data Analytics in the Internet Context – Map Reduce Paradigm - run-time system for supporting scalable and

fault-tolerant execution - paradigms: Pig Latin and Hive and parallel databases versus Map Reduce.

Unit - II ACTIVE DATABASES Periods 9

Syntax and Sematics (Starburst, Oracle, DB2) – Taxonomy – Applications – Integrity Management –

Workflow Management – Business Rules – Design Principles – Properties – Rule Modularization – Rule

Debugging – IDEA methodology – Open Problems.

Unit – III TEMPORAL AND OBJECT DATABASES Periods 9

Overview – Data types – Associating Facts – Temporal Query Language – TSQL2 – Time Ontology –

Language Constructs – Architecture – Temporal Support – Object Database and Change Management –

Change of Schema – Implementing Database Updates in O2.

Unit - IV COMPLEX QUERIES AND REASONING Periods 9

Logic of Query Languages – Relational Calculi – Recursive rules – Syntax and semantics of Data log – Fix

point semantics – Implementation Rules and Recursion – Rule rewriting methods – Compilation and

Optimization – Recursive Queries in SQL.

Unit – V SPATIAL, TEXT AND MULTIMEDIA DATABASES Periods 9

Traditional Indexing Methods (Secondary Keys, Spatial Access Methods) – Text Retrieval – Multimedia

Indexing – 1D Time Series – 2d Color images – Sub pattern Matching – Open Issues – Uncertainties.

Total Periods 45

REFERENCES:

1. Raghu Ramakrishnan “Database Management System”, Mc Graw Hill Publications, 2000.

2. Carlo Zaniolo, Stefano Ceri “Advanced Database Systems”, Morgan Kauffmann

Publishers.VLDB Journal, 1997.

3. Abraham Silberschatz, Henry F. Korth and S. Sudharshan, “Database System Concepts”, Sixth

Edition, Tata McGraw Hill, 2011.

Course

Outcome

Design different types of databases.

Use different query languages.

Apply indexing techniques.

80





Department COMPUTER SCIENCE AND ENGINEERING Semester Elective- II & III



U13CSE07 Digital Signal Processing 3 0 0 3 50 50 100

Course

Objective

To introduce discrete Fourier transform and its applications.

To teach the design of infinite and finite impulse response filters for filtering undesired

signals.

To introduce signal processing concepts in systems having more than one sampling

frequency

Unit – I SIGNALS AND SYSTEMS Periods 9

Basic elements of DSP – concepts of frequency in Analog and Digital Signals – sampling theorem – Discrete

– time signals, systems – Analysis of discrete time LTI systems – Z transform – Convolution – Correlation.

Unit - II FREQUENCY TRANSFORMATIONS Periods 9

Introduction to DFT – Properties of DFT – Circular Convolution - Filtering methods based on DFT – FFT

Algorithms - Decimation – in – time Algorithms, Decimation – in – frequency Algorithms – Use of FFT in

Linear Filtering – DCT – Use and Application of DCT.

Unit – III IIR FILTER DESIGN Periods 9

Structures of IIR – Analog filter design – Discrete time IIR filter from analog filter – IIR filter design by

Impulse Invariance, Bilinear transformation, Approximation of derivatives – (LPF, HPF, BPF, BRF) filter

design using frequency translation.

Unit - IV FIR FILTER DESIGN Periods 9

Structures of FIR – Linear phase FIR filter – Fourier Series - Filter design using windowing techniques

(Rectangular Window, Hamming Window, Hanning Window), Frequency sampling techniques

Unit – V FINITE WORD LENGTH EFFECTS IN DIGITAL FILTERS Periods 9

Binary fixed point and floating point number representations – Comparison - Quantization noise –

truncation and rounding – quantization noise power- input quantization error- coefficient quantization error –

limit cycle oscillations-dead band- Overflow error-signal scaling.

Total Periods 45

REFERENCES:

1. John G. Proakis and Dimitris G.Manolakis,“Digital Signal Processing – Principles, Algorithms &

Applications”, Fourth Edition, Pearson Education, Prentice Hall, 2007.

2. Emmanuel C.Ifeachor, and Barrie.W.Jervis, “Digital Signal Processing”, Second Edition, Pearson

Education, Prentice Hall, 2002.

3. Sanjit K. Mitra, “Digital Signal Processing – A Computer Based Approach”, Third Edition,

Tata Mc Graw Hill, 2007.

4. A.V.Oppenheim, R.W. Schafer and J.R. Buck, Discrete-Time Signal Processing, 8th Indian

Reprint, Pearson, 2004.

5. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2006.

Course

Outcome

Perform frequency transforms for the signals.

Design IIR and FIR filters.

Finite word length effects in digital filters

81





Department COMPUTER SCIENCE AND ENGINEERING Semester Elective-II & III



U13CSE08 Client Server Computing 3 0 0 3 50 50 100

Course

Objective

Constructing a complete end to-end information system solution.

Prepared to choose follow-on courses that explore some of these topics in much

greater detail, improving their ability to tailor their degree.


Client Server Computing, Benefits, Evolution of client server computing, Client Server Applications,

Components, Classes of Client Server Computing – Categories of Client Server Computing

Unit - II CLIENT/SERVER OPERATING SYSTEMS Periods 9

Dispelling the myths, Obstacles upfront and hidden, open systems and standards, factors needed for success.

Standards setting organizations

Unit – III THE CLIENT Periods 9

Client Hardware and software, Client components, Client Operating Systems, GUI, X windows and

Windowing, Database Access Application Logic, Client Software Products, Client Requirements

Unit - IV THE SERVER Periods 9

Server Hardware, Categories, Features classes of Server Machines, Server Environment, Network

management environment, network Computing Environment, Network Operating Systems, Server

requirements, Platform Independence, Transaction Processing, Connectivity. Server Data Management and

Access Tools

Unit – V CLIENT SERVER AND INTERNET Periods 9

Client server and internet, Web client server, 3 tier client server web style, CGI , the server side of web, CGI

and State, SQL database servers, Middleware and federated databases, data warehouses, EIS/DSS to data

mining, GroupWare Server , what is GroupWare, components of GroupWare

Total Periods 45

REFERENCES:

1. Dawana Travis Dewire, “ Client Server Computing”, Tata Mc-Graw Hill Education Pvt. Ltd., New

Delhi, 2003

2. Robert Orfali, Dan Harkey & Jeri Edwards, “Essential Client/Server Survival Guide”, second

edition, John Wiley & Sons, Singapore, 2003.

3. Eric J Johnson, “A complete guide to Client / Server Computing”, first edition, Prentice Hall, New

Delhi, 2001.

4. Smith & Guengerich, “Client /Server Computing”, Prentice Hall, New Delhi, 2002

5. James E. Goldman, Phillip T. Rawles, Julie R. Mariga, “Client/Server Information Systems, A

Business Oriented Approach”, John Wiley & Sons, Singapore, 2000.

Course

Outcome

Recognize the difference between HTML, XHTML, MySQL & PHP

Differentiate between PHP Web & HTML Controls

Understand different Web controls and Web pages with DB.

82






Course

code Course name

Periods per



U13CSE09 Advanced Operating System 3 0 0 3 50 50 100

Course

Objective

To introduce Operating System Concepts with emphasis on foundations & design principles.

To understand the principles and concepts that are used as a basis of modern operating

system kernels.

Become exposed to classic and current operating systems literature


Overview - Functions of an Operating System – Design Approaches – Types of Advanced Operating

System - Synchronization Mechanisms – Concept of a Process, Concurrent Processes – The Critical

Section Problem, Other Synchronization Process Deadlocks - Preliminaries – Models of Deadlocks,

Resources, System State – Necessary and Sufficient conditions for a Deadlock – Systems with Single-

Unit Requests, Consumable Resources, Reusable Resources.

Unit - II DISTRIBUTED OPERATING SYSTEMS Periods 9

Introduction–Issues–Communication Primitives –Inherent Limitations - Lamport‟s Logical Clock; Vector

Clock; Causal Ordering; Global State; Cuts; Termination Detection. Distributed Mutual Exclusion – Non-

Token Based Algorithms – Lamport‟s Algorithm-Token-Based Algorithms – Suzuki-Kasami‟s Broadcast

Algorithm – Distributed Deadlock Detection – Issues – Centralized Deadlock-Detection Algorithms -

Distributed Deadlock-Detection Algorithms. Agreement Protocols – Classification - Solutions –Applications.

Unit - III DISTRIBUTED RESOURCE MANAGEMENT Periods 9

Distributed File systems–Architecture–Mechanisms–Design Issues–Distributed Shared Memory–Architecture

– Algorithm – Protocols - Design Issues. Distributed Scheduling – Issues – Components – Algorithms.

Unit - IV FAILURE RECOVERY AND FAULT TOLERANCE Periods 9

Basic Concepts-Classification of Failures–Basic Approaches to Recovery: Recovery in Concurrent

System; Synchronous and Asynchronous Check pointing and Recovery; Check pointing in Distributed

Database Systems; Fault Tolerance; Issues-Two-phase and Non- blocking Commit Protocols; Voting

Protocols; Dynamic Voting Protocols.

Unit - V MULTIPROCESSOR AND DATABASE OPERATING

SYSTEMS Periods 9

Structures – Design Issues – Threads – Process Synchronization – Processor Scheduling – Memory

Management – Reliability / Fault Tolerance; Database Operating Systems – Introduction –

Concurrency Control – Distributed Database Systems – Concurrency Control Algorithms.

Total Periods 45

REFERENCES:

1. Mukesh Singhal and N. G. Shivaratri, “Advanced Concepts in Operating Systems”, McGraw-

Hill, 2000

2. Abraham Silberschatz, Peter B. Galvin, G. Gagne, “Operating System Concepts”, Sixth

Edition, Addison Wesley Publishing Co., 2003.

3. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley,

2001.

Course

Outcome

Understand Concurrent Processes execution, deadlock, prevention and avoidance

algorithms.

Compare and contrast various memory management schemes.

83






Course

Code Course Name



U13CSE10 Professional Ethics in Engineering 3 0 0 3 50 50 100

Course

Objective

To stimulate critical and responsible reflections on moral issues surrounding

engineering practices

To provide conceptual tools necessary for pursuing those issues.

To be aware of the different ethical issues, codes for conduct for engineers in society

and moralities in an organization.

Unit – I ENGINEERING ETHICS Periods 9

Senses of „Engineering Ethics‟ – Variety of moral issues – Types of inquiry – Moral dilemmas – Moral

Autonomy – Kohlberg‟s theory – Gilligan‟s theory – Consensus and Controversy – Professions and

Professionalism – Professional Ideals and Virtues – Uses of Ethical Theories

Unit – II ENGINEERING AS SOCIAL EXPERIMENTATION Periods 9

Engineering as Experimentation – Engineers as responsible Experimenters – Research Ethics - Codes of

Ethics – Industrial Standards - A Balanced Outlook on Law – The Challenger Case Study

Unit – III ENGINEER’S RESPONSIBILITY FOR SAFETY Periods 9

Safety and Risk – Assessment of Safety and Risk – Risk Benefit Analysis – Reducing Risk – The

Government Regulator‟s Approach to Risk - Chernobyl Case Studies and Bhopal

Unit – IV RESPONSIBILITIES AND RIGHTS Periods 9

Collegiality and Loyalty – Respect for Authority – Collective Bargaining – Confidentiality – Conflicts of

Interest – Occupational Crime – Professional Rights – Employee Rights – Intellectual Property Rights (IPR) –

Discrimination

Unit – V GLOBAL ISSUES Periods 9

Multinational Corporations – Business Ethics - Environmental Ethics – Computer Ethics - Role in

Technological Development – Weapons Development – Engineers as Managers – Consulting Engineers –

Engineers as Expert Witnesses and Advisors – Honesty – Moral Leadership – Sample Code of Conduct

Total Periods 45

REFERENCES:

1. Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw Hill, New York, 2005.

2. Charles E Harris, Michael S Pritchard and Michael J Rabins, “Engineering Ethics –Concepts and

Cases”, Thompson Learning, 2000.

3. Prof. (Col) P S Bajaj and Dr. Raj Agrawal, “Business Ethics – An Indian Perspective”, Biztantra,

New Delhi, 2004.

4. David Ermann and Michele S Shauf, “Computers, Ethics and Society”, Oxford University Press,

(2003)

Course

Outcome

At the end of the course, the student should be,

Able to prepare, describe, and defend their own personal definition of what makes for an

ethical engineer.

Able to describe the benefits that are expected to arise from acting ethically.

Able to Question the specific consequences of acting unethically (according to any of

the definitions provided above).

84





Department COMPUTER SCIENCE AND ENGINEERING Semester Elective-II &III



U13CSE11 Digital Image Processing 3 0 0 3 50 50 100

Course

Objective

Learn digital image fundamentals.

Be exposed to simple image processing techniques.

Be familiar with image compression and segmentation techniques.

Learn to represent image in form of features.

Unit – I DIGITAL IMAGE FUNDAMENTALS Periods 9

Introduction – Origin – Steps in Digital Image Processing – Components – Elements of Visual Perception –

Image Sensing and Acquisition – Image Sampling and Quantization – Relationships between pixels - color

models.

Unit - II IMAGE ENHANCEMENT Periods 9

Spatial Domain: Gray level transformations – Histogram processing – Basics of Spatial Filtering– Smoothing

and Sharpening Spatial Filtering – Frequency Domain: Introduction to Fourier Transform – Smoothing and

Sharpening frequency domain filters – Ideal, Butterworth and Gaussian filters.

Unit – III IMAGE RESTORATION AND SEGMENTATION Periods 9

Noise models – Mean Filters – Order Statistics – Adaptive filters – Band reject Filters – Band pass Filters –

Notch Filters – Optimum Notch Filtering – Inverse Filtering – Wiener filtering Segmentation: Detection of

Discontinuities–Edge Linking and Boundary detection – Region based segmentation- Morphological

processing- erosion and dilation.

Unit - IV WAVELETS AND IMAGE COMPRESSION Periods 9

Wavelets – Subband coding – Multi resolution expansions - Compression: Fundamentals – Image Compression

models – Error Free Compression – Variable Length Coding – Bit-Plane Coding – Lossless Predictive Coding

– Lossy Compression – Lossy Predictive Coding – Compression Standards.

Unit – V IMAGE REPRESENTATION AND RECOGNITION Periods 9

Boundary representation – Chain Code – Polygonal approximation, signature, boundary segments – Boundary

description – Shape number – Fourier Descriptor, moments- Regional Descriptors – Topological feature,

Texture - Patterns and Pattern classes - Recognition based on matching.

Total Periods 45

REFERENCES:

1. Rafael C. Gonzales, Richard E. Woods, “Digital Image Processing”, Third Edition, Pearson

Education, 2010.

2. Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, “Digital Image Processing Using

MATLAB”, Third Edition Tata McGraw Hill Pvt. Ltd., 2011.

3. Anil Jain K. “Fundamentals of Digital Image Processing”, PHI Learning Pvt. Ltd., 2011.

4. Willliam K Pratt, “Digital Image Processing”, John Willey, 2002.

5. Malay K. Pakhira, “Digital Image Processing and Pattern Recognition”, First Edition, PHI

Learning Pvt. Ltd., 2011.

Course

Outcome

Apply image enhancement and restoration techniques.

Use image compression and segmentation Techniques.

Represent features of images.

85





Department COMPUTER SCIENCE AND ENGINEERING Semester Elective-II

&III



U13CSE12 Embedded Systems 3 0 0 3 50 50 100

Course

Objective

Learn the architecture and programming of ARM processor.

Be familiar with the embedded computing platform design and analysis.

Learn the system design techniques and networks for embedded systems

Unit – I EMBEDDED COMPUTING Periods 9

Challenges of Embedded Systems – Embedded system design process. Embedded processors – 8051

Microcontroller, ARM processor – Architecture, Instruction sets and programming.

Unit - II MEMORY AND INPUT / OUTPUT MANAGEMENT Periods 9

Programming Input and Output – Memory system mechanisms – Memory and I/O devices and interfacing –

Interrupts handling.

Unit – III PROCESSES AND OPERATING SYSTEMS Periods 9

Multiple tasks and processes – Context switching – Scheduling policies – Inter process communication

mechanisms – Performance issues.

Unit - IV EMBEDDED SOFTWARE Periods 9

Programming embedded systems in assembly and C – Meeting real time constraints – Multi-state systems and

function sequences. Embedded software development tools – Emulators and debuggers.

Unit – V EMBEDDED SYSTEM DEVELOPMENT Periods 9

Design issues and techniques – Case studies – Complete design of example embedded systems.

Total Periods 45

REFERENCES:

1. Wayne Wolf, “Computers as Components: Principles of Embedded Computer System Design”,

Elsevier, 2006.

2. Michael J. Pont, “Embedded C”, Pearson Education, 2007.

3. Steve Heath, “Embedded System Design”, Elsevier, 2005.

4. Muhammed Ali Mazidi, Janice Gillispie Mazidi and Rolin D. McKinlay, “The 8051

Microcontroller and Embedded Systems”, Pearson Education, Second edition, 2007.

Course

Outcome

Describe the architecture and programming of ARM processor.

Outline the concepts of embedded systems

Use the system design techniques to develop software for embedded systems

Model real-time applications using embedded-system concepts

86







Periods per



U13CSE13 Advanced Computer Architecture 3 0 0 3 50 50 100

Course

Objective

Know the classes of computers, and new trends and developments in computer

architecture

Understand the performance metrics of microprocessors, memory, networks, and disks

Understand exploiting ILP using dynamic scheduling, multiple issue, and speculation.

Understand symmetric shared-memory architectures and their performance.

Unit - I INSTRUCTION LEVEL PARALLELISM Periods 9

ILP –Concepts and challenges –Hardware and software approaches –Dynamic scheduling – Speculation -

Compiler techniques for exposing ILP –Branch prediction.

Unit - II MULTIPLE ISSUE PROCESSORS Periods 9

Advanced compiler support –Hardware support for exposing parallelism –Hardware versus software

speculation mechanisms –IA 64 and Itanium processors –Limits on ILP.

Unit - III MULTIPROCESSORS AND THREAD LEVEL PARALLELISM Periods 9

Symmetric and distributed shared memory architectures –Performance issues –Synchronization –Models of

memory consistency –Introduction to Multithreading.

Unit - IV MEMORY AND I/O Periods 9

Cache performance –Reducing cache miss penalty and miss rate –Reducing hit time –Main memory and

performance –Memory technology. Types of storage devices –Buses –RAID –Reliability, availability and

dependability –I/O performance measures –Designing an I/O system.

Unit - V MULTICORE ARCHITECTURES Periods 9

Software and hardware multithreading –SMT and CMP architectures –Design issues –Case studies –Intel

Multi-core architecture –SUN CMP architecture –Heterogeneous multi-core processors –case study: IBM

Cell Processor.

Total Periods 45

REFERENCES:

1. John L. Hennessey and David A. Patterson, “Computer architecture –A quantitative approach”,

Morgan Kaufmann / Elsevier Publishers, 4th edition, 2007.

1. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture: A hardware/software

approach” , Morgan Kaufmann /Elsevier Publishers, 1999.

2. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw Hill, New Delhi,

2003.

Course

Outcome

Understand pipelining, instruction set architectures, memory addressing.

Understand the various techniques to enhance a processors ability to exploit Instruction-

level parallelism (ILP), and its challenges.

Understand multiprocessor cache coherence using the directory based and snooping class

of protocols and various models to achieve memory consistency.

87








U13CSE14 Human Computer Interaction 3 0 0 3 50 50 100

Course

Objective

Learn the foundations of Human Computer Interaction.

Be familiar with the design technologies for individuals and persons with disabilities.

Be aware of mobile HCI.

Learn the guidelines for user interface.

Unit – I FOUNDATIONS OF HCI Periods 9

The Human: I/O channels – Memory – Reasoning and problem solving; The computer: Devices –Memory –

processing and networks; Interaction: Models – frameworks – Ergonomics – styles –elements – interactivity-

Paradigms.

Unit - II DESIGN & SOFTWARE PROCESS Periods 9

Interactive Design basics – process – scenarios – navigation – screen design – Iteration and prototyping. HCI

in software process – software life cycle – usability engineering – Prototyping in practice – design rationale.

Design rules – principles, standards, guidelines, rules. Evaluation Techniques – Universal Design.

Unit – III MODELS AND THEORIES Periods 9

Cognitive models –Socio-Organizational issues and stake holder requirements –Communication and

collaboration models-Hypertext, Multimedia and WWW.

Unit - IV MOBILE HCI Periods 9

Mobile Ecosystem: Platforms, Application frameworks- Types of Mobile Applications: Widgets,

Applications, Games- Mobile Information Architecture, Mobile 2.0, Mobile Design: Elements of Mobile

Design, Tools.

Unit – V WEB INTERFACE DESIGN Periods 9

Designing Web Interfaces – Drag & Drop, Direct Selection, Contextual Tools, Overlays, Inlays and Virtual

Pages, Process Flow. Case Studies.

Total Periods 45

REFERENCES:

1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer Interaction”, 3rd

Edition,Pearson Education, 2004 (UNIT I , II & III).

2. Brian Fling, “Mobile Design and Development”, First Edition , O‟Reilly Media Inc., 2009

(UNIT –IV).

3. Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O‟Reilly, 2009.(UNIT-

V).

Course

Outcome

Design effective dialog for HCI.

Design effective HCI for individuals and persons with disabilities.

Assess the importance of user feedback.

Explain the HCI implications for designing multimedia/ ecommerce/ e-learning sites.

88








U13CSE15 Enterprise Resource Planning 3 0 0 3 50 50 100

Course

Objective

To understand about ERP systems, ERP software and modules.

Implementation of ERP, and Emerging trends on ERP


Overview of enterprise systems – Evolution - Risks and benefits -Fundamental technology - Issues to be

consider in planning design and implementation of cross functional integrated ERP systems

Unit - II ERP SOLUTIONS AND FUNCTIONAL MODULES Periods 9

Overview of ERP software solutions- Small medium and large enterprise vendor solutions, BPR, Business

Engineering and best Business practices - Business process Management. Overview of ERP modules -sales

and Marketing, Accounting and Finance, Materials and Production management.

Unit – III ERP IMPLEMENTATION Periods 9

Planning Evaluation and selection of ERP systems, Implementation life cycle, ERP implementation,

Methodology and Frame workTraining – Data Migration. People Organization in implementation-

Consultants, Vendors and Employees.

Unit - IV POST IMPLEMENTATION Periods 9

Maintenance of ERP- Organizational and Industrial impact; Success and Failure factors of and ERP

Implementation.

Unit – V EMERGING TRENDS ON ERP Periods 9

Extended ERP systems and ERP add–ons -CRM,SCM, Business analytics etc- Future trends in ERP

systems-web enabled, Wireless technologies so on.

Total Periods 45

REFERENCES:

1. Alexis Leon, “ERP demystified ” second Edition Tata McGraw-Hill, 2007

2. Jagan Nathan Vaman,” ERP in Practice” Tata McGraw-Hill, 2008

3. Alexis Leon, “Enterprise Resource Planning”, second edition, Tata McGraw-Hill, 2008.

4. Mahadeo Jaiswal and Ganesh Vanapalli, “ERP” Macmillan India, 2009.

5. Vinod Kumar Grag and N.K. Venkitakrishnan, “ERP- Concepts and Practice”, Prentice Hall of

India,2nd edition, 2006.

Course

Outcome

Able to understand Business Analytic and trends in ERP systems.

Able to solve specific enterprise problem independently or as part of team

Manage a project from start to end.

89








U13CSE16 Multimedia Systems 3 0 0 3 50 50 100

Course

Objective

To provide the foundation knowledge of multimedia computing,

To provide programming training in multimedia computing, multimedia system design

and implementations.


Architecture and components- Multimedia distributed processing model, Synchronization- Orchestration and

Quality of Service (QOS) architecture.

Unit - II AUDIO AND SPEECH Periods 9

Data acquisition- Sampling and Quantization- Human Speech production mechanism- Digital model of

speech production- Analysis and synthesis- Psycho-acoustics- low bit rate speech compression-MPEG audio

compression.

Unit – III IMAGES AND VIDEO Periods 9

Overview Of SOAP - HTTP - XML-RPC - SOAP: Protocol - Message Structure - Intermediaries - Actors -

Design Patterns And Faults - SOAP With Attachments.

Unit – IV MULTIMEDIA COMMUNICATION Periods 9

Fundamentals of data communication and networking- Bandwidth requirements of different media- Real time

constraints: Audio latency-Video data rate- multimedia over LAN and WAN- Multimedia conferencing. Unit – V XML SECURITY Periods 9

Authoring and Publishing- Linear and non-linear presentation-Structuring Information- Different approaches

of authoring hypermedia documents-Hyper-media data models and standards.

Total Periods 45

REFERENCES:

1. Ralf Steinmetz and Klara Nahrstedt,” Multimedia Systems”, Springer.

2. J. D. Gibson,” Multimedia Communications: Directions and Innovations”, Springer.

3. K. Sayood, “Introduction to Data Compression”, Morgan-Kaufmann.

4. A. Puri and T. Chen,” Multimedia Systems, Standards, and Networks”, Marcel Dekker.

5. Iain E.G. Richardson, “H.264 and MPEG-4 Video Compression”, John Wiley.

Course

Outcome

Understand the characteristics of different media.

Understand the characteristics of human are visual system.

Understand different compression principles; understand different compression techniques.

Program multimedia data and be able to design and implement media applications.

90








U13CSE17 C# and .Net Framework 3 0 0 3 50 50 100

Course

Objective

To understand the foundations of CLR execution.

To learn the technologies of the .NET framework.

To know the object oriented aspects of C#.

To learn web based applications on .NET (ASP.NET). Unit - I INTRODUCTION TO C# Periods 12

Introducing C#, Understanding .NET, overview of C#, Literals, Variables, Data Types, Operators, checked

and unchecked operators, Expressions, Branching, Looping, Methods, implicit and explicit casting, Constant,

Arrays, Array Class, Array List, String, String Builder, Structure, Enumerations, boxing and unboxing.

Unit - II OBJECT ORIENTED ASPECTS OF C# Periods 12

Class, Objects, Constructors and its types, inheritance, properties, indexers, index overloading,

polymorphism, sealed class and methods, interface, abstract class, abstract and interface, operator

overloading, delegates, events, errors and exception, Threading.

Unit - III APPLICATION DEVELOPMENT ON .NET Periods 12

Building windows application, Creating our own window forms with events and controls, menu creation,

inheriting window forms, SDI and MDI application, Dialog Box(Modal and Modeless), accessing data with

ADO.NET, DataSet, typed dataset, Data Adapter, updating database using stored procedures, SQL Server

with ADO.NET, handling exceptions, validating controls, windows application configuration.

Unit - IV WEB BASED APPLICATION DEVELOPMENT ON .NET Periods 12

Programming web application with web forms, ASP.NET introduction, working with XML and .NET,

Creating Virtual Directory and Web Application, session management techniques, web.config, web services,

passing datasets, returning datasets from web services, handling transaction, handling exceptions, returning

exceptions from SQL Server.

Unit - V CLR AND .NET FRAMEWORK Periods 12

Assemblies, Versioning, Attributes, reflection, viewing meta data, type discovery, reflection on type,

marshalling, remoting, security in .NET

Total Periods 60

REFERENCES:

1. Herbert Schildt, “The Complete Reference: C# 4.0”, Tata Mc Graw Hill, 2012.

2. Christian Nagel et al. “Professional C# 2012 with .NET 4.5”, Wiley India, 2012.

3. Andrew Troelsen , “Pro C# 2010 and the .NET 4 Platform, Fifth edition, A Press, 2010.

4. Ian Griffiths, Matthew Adams, Jesse Liberty, “Programming C# 4.0”, Sixth Edition, O‟Reilly,

2010.

Course

Outcome

List the major elements of the .NET frame work

Explain how C# fits into the .NET platform.

Analyze the basic structure of a C# application

Design and develop Web based applications on .NET

91





Department COMPUTER SCIENCE AND ENGINEERING Semester Elective- IV,V&VI

Course code Course Name Periods per week Credit Maximum Marks


U13CSE18 Adhoc & Wireless Sensor Networks 3 0 0 3 50 50 100

Course

Objective

Understand the design issues in ad hoc and sensor networks.

Learn the different types of MAC protocols.

Be familiar with different types of adhoc routing protocols.

Be exposing to the TCP issues in adhoc networks.


Fundamentals of Wireless Communication Technology – The Electromagnetic Spectrum – Radio

propagation Mechanisms – Characteristics of the Wireless Channel -mobile ad hoc networks

(MANETs) and wireless sensor networks (WSNs) :concepts and architectures. Applications of Ad Hoc and

Sensor networks. Design Challenges in Ad hoc and Sensor Networks.

Unit - II MAC PROTOCOLS FOR AD HOC WIRELESS NETWORKS Periods 9

Issues in designing a MAC Protocol- Classification of MAC Protocols- Contention based protocols-

Contention based protocols with Reservation Mechanisms- Contention based protocols with

Scheduling Mechanisms – Multi channel MAC-IEEE 802.11

Unit – III ROUTING PROTOCOLS AND TRANSPORT LAYER IN

AD HOC WIRELESS NETWORKS Periods 9

Issues in designing a routing and Transport Layer protocol for Ad hoc networks- proactive routing, reactive

routing (on-demand), hybrid routing- Classification of Transport Layer solutions-TCP over Ad hoc wireless

Networks.

Unit - IV WIRELESS SENSOR NETWORKS - MAC PROTOCOLS Periods 9

Single node architecture: hardware and software components of a sensor node - WSN Network

architecture: typical network architectures-data relaying and aggregation strategies -MAC layer

protocols: self-organizing, Hybrid TDMA/FDMA and CSMA based MAC- IEEE 802.15.4.

Unit – V WSN ROUTING, LOCALIZATION & QOS Periods 9

Issues in WSN routing–OLSR- Localization – Indoor and Sensor Network Localization-absolute and relative

localization, triangulation-QOS in WSN-Energy Efficient Design-Synchronization-Transport Layer issues.

Total Periods 45

REFERENCES:

1. C. Siva Ram Murthy, and B. S. Manoj, "Ad Hoc Wireless Networks: Architectures and Protocols

", Prentice Hall Professional Technical Reference, 2008.

2. Carlos De Morais Cordeiro, Dharma Prakash Agrawal “Ad Hoc & Sensor Networks

Theory and Applications”, World Scientific Publishing Company, 2006.

3. Feng Zhao and Leonides Guibas, "Wireless Sensor Networks", Elsevier Publication - 2002.

4. Holger Karl and Andreas Willig “Protocols and Architectures for Wireless Sensor

Networks”, Wiley, 2005

5. Kazem Sohraby, Daniel Minoli, & Taieb Znati, “Wireless Sensor Networks-Technology,

Protocols, and Applications”, John Wiley, 2007.

6. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003.

Course

Outcome

Analyze the protocol design issues of ad hoc and sensor networks

Design routing protocols for ad hoc and wireless sensor networks with respect to some

protocol design issues

Evaluate the QoS related performance measurements of ad hoc and sensor networks

92








U13CSE19 Soft Computing 3 0 0 3 50 50 100

Course

Objective

Learn the various soft computing frame works.

Be familiar with design of various neural networks.

Learn genetic programming

Be exposed to fuzzy logic & Hybrid Systems


Evolution of Computing - Soft Computing Constituents – From Conventional AI to Computational

Intelligence - Machine Learning Basics

Unit - II NEURAL NETWORKS Periods 9

Machine Learning Using Neural Network, Adaptive Networks – Feed forward Networks –Supervised

Learning Neural Networks – Radial Basis Function Networks – Reinforcement Learning – Unsupervised

Learning Neural Networks – Adaptive Resonance architectures –Advances in Neural networks

Unit – III FUZZY LOGIC Periods 9

Fuzzy Sets – Operations on Fuzzy Sets – Fuzzy Relations – Membership Functions- Fuzzy Rule based system

– Fuzzy Decision Making – Applications of fuzzy logic

Unit - IV NEURO-FUZZY MODELING Periods 9

Adaptive Neuro-Fuzzy Inference Systems – Coactive Neuro -Fuzzy Modeling – Classification and

Regression Trees – Data Clustering Algorithms – Rule base Structure Identification –Neuro-Fuzzy Control.

Unit – V GENETIC ALGORITHMS Periods 9

Introduction to Genetic Algorithms (GA) – Terminologies and operators of GA – Classification of GA – GA

for Optimization problem - Applications of GA

Total Periods 45

REFERENCES:

1. Jyh-Shing Roger Jang, Chuen-Tsai Sun and Eiji Mizutani, “Neuro-Fuzzy and Soft

Computing”, Prentice-Hall of India, 2003

2. S. N. Sivanandam, S. Sumathi and S. N. Deepa, ―Introduction to Fuzzy Logic using MATLAB,

Springer, 2007.

3. S.N.Sivanandam and S.N.Deepa, -“Introduction to Genetic Algorithms”, Springer, 2007.

4. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.

5. David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”,

Addison Wesley, 1997.

6. George J. Klir and Bo Yuan,”Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice

Hall, 1995.

Course

Outcome

Apply various soft computing frame works.

Design of various neural networks.

Use fuzzy logic.

Apply genetic programming.

Discuss hybrid soft computing.

93






Course

code Course Name

Periods per week Credit Maximum Marks


U13CSE20 Service Oriented Architecture 3 0 0 3 50 50 100

Course

Objective

Learn XML fundamentals.

Be exposed to build applications based on XML.

Understand the key principles behind SOA.

Be familiar with the web services technology elements for realizing SOA.

Unit – I INTRODUCTION TO XML Periods 9

XML document structure – Well formed and valid documents – Namespaces – DTD – XML Schema – X-

Files.

Unit - II BUILDING XML- BASED APPLICATIONS Periods 9

Parsing XML – using DOM, SAX – XML Transformation and XSL – XSL Formatting – Modeling

Databases in XML.

Unit – III SERVICE ORIENTED ARCHITECTURE Periods 9

Characteristics of SOA, Comparing SOA with Client-Server and Distributed architectures – Benefits of SOA

- Principles of Service orientation – Service layers.

Unit - IV WEB SERVICES Periods 9

Service descriptions – WSDL – Messaging with SOAP – Service discovery – UDDI – Message

Exchange Patterns – Orchestration – Choreography –WS Transactions.

Unit – V BUILDING SOA-BASED APPLICATIONS Periods 9

Service Oriented Analysis and Design – Service Modeling – Design standards and guidelines -

Composition – WS-BPEL – WS-Coordination – WS-Policy – WS-Security – SOA support in J2EE

Total Periods 45

REFERENCES:

1. Ron Schmelzer et al. “XML and Web Services”, Pearson Education, 2002.

2. Thomas Erl, “Service Oriented Architecture: Concepts, Technology, and Design”, Pearson

Education, 2005.

3. Frank P.Coyle, “XML, Web Services and the Data Revolution”, Pearson Education, 2002

4. Eric Newcomer, Greg Lomow, “Understanding SOA with Web Services”, Pearson

Education, 2005

5. Sandeep Chatterjee and James Webber, “Developing Enterprise Web Services: An Architect‟s

Guide”, Prentice Hall, 2004.

6. James McGovern, Sameer Tyagi, Michael E.Stevens, Sunil Mathew, “Java Web Services

Architecture”, Morgan Kaufmann Publishers, 2003..

Course

Outcome

Build applications based on XML.

Develop web services using technology elements.

Build SOA-based applications for intra-enterprise and inter-enterprise applications.

94





Department COMPUTER SCIENCE AND ENGINEERING Semester Elective- IV, V &

VI



U13CSE21 Multi-Core Architectures ad

Programming 3 0 0 3 50 50 100

Course

Objective

Understand the challenges in parallel and multi-threaded programming.

Learn about the various parallel programming paradigms, and solutions.

Unit – I MULTI-CORE PROCESSORS Periods 9

Single core to Multi-core architectures – SIMD and MIMD systems – Interconnection networks - Symmetric

and Distributed Shared Memory Architectures – Cache coherence - Performance Issues – Parallel program

design.

Unit – II PARALLEL PROGRAM CHALLENGES Periods 9

Performance – Scalability – Synchronization and data sharing – Data races – Synchronization primitives

(mutexes, locks, semaphores, barriers) – deadlocks and live locks – communication between threads

(condition variables, signals, message queues and pipes).

Unit – III SHARED MEMORY PROGRAMMING WITH OpenMP Periods 9

OpenMP Execution Model – Memory Model – OpenMP Directives – Work-sharing Constructs – Library

functions – Handling Data and Functional Parallelism – Handling Loops – Performance Considerations.

Unit – IV DISTRIBUTED MEMORY PROGRAMMING WITH MPI

Periods 9

MPI program execution – MPI constructs – libraries – MPI send and receive – Point-to-point and Collective

communication – MPI derived data types – Performance evaluation

Unit – V PARALLEL PROGRAM DEVELOPMENT Periods 9

Case studies - n-Body solvers – Tree Search – OpenMP and MPI implementations and comparison.

Total Periods 45

REFERENCES:

1. Peter S. Pacheco, “An Introduction to Parallel Programming”, Morgan-Kauffman/Elsevier, 2011.

2. Darryl Gove, “Multicore Application Programming for Windows, Linux, and Oracle Solaris”,

Pearson, 2011 (unit 2)

3. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata McGraw Hill, 2003.

4. Shameem Akhter and Jason Roberts, “Multi-core Programming”, Intel Press, 2006.

Course

Outcome

Program Parallel Processors.

Develop programs using OpenMP and MPI.

Compare and contrast programming for serial processors and programming for parallel

processors.

95





Department COMPUTER SCIENCE AND ENGINEERING Semester Elective-

IV,V&VI



U13CSE22 Nano Computing 3 0 0 3 50 50 100

Course

Objective

Learn nano computing challenges.

Be familiar with the imperfections.

Be exposed to reliability evaluation strategies.

Learn nano scale quantum computing.

Unit – I NANOCOMPUTING-PROSPECTS AND CHALLENGES Periods 9

Introduction - History of Computing - Nanocomputing - Quantum Computers – Nanocomputing

Technologies - Nano Information Processing - Prospects and Challenges - Physics of Nanocomputing :

Digital Signals and Gates - Silicon Nano electronics - Carbon Nano tube Electronics – Carbon Nanotube

Field-effect Transistors – Nanolithography.

Unit - II NANOCOMPUTING WITH IMPERFECTIONS Periods 9

Introduction - Nanocomputing in the Presence of Defects and Faults - Defect Tolerance – Towards

Quadrillion Transistor Logic Systems.

Unit – III RELIABILITY OF NANOCOMPUTING Periods 9

Markov Random Fields - Reliability Evaluation Strategies - NANOLAB - NANOPRISM – Reliable

Manufacturing and Behavior from Law of Large Numbers.

Unit - IV NANOSCALE QUANTUM COMPUTING Periods 9

Quantum Computers - Hardware Challenges to Large Quantum Computers - Fabrication, Test, and

Architectural Challenges - Quantum-dot Cellular Automata (QCA) - Computing with QCA – QCA Clocking

- QCA Design Rules.

Unit – V QCADESIGNER SOFTWARE AND QCA

IMPLEMENTATION Periods 9

Basic QCA Circuits using QCA Designer - QCA Implementation - Molecular and Optical Computing:

Molecular Computing - Optimal Computing – Ultra fast Pulse Shaping and Tb/sec Data Speeds.

Total Periods 45

REFERENCES:

1. Sahni V. and Goswami D, “Nano Computing”, McGraw Hill Education Asia Ltd. (2008), ISBN

(13): 978007024892.

2. Sandeep K. Shukla and R. Iris Bahar, “Nano, Quantum and Molecular Computing”, Kluwer

Academic Publishers 2004, ISBN: 1402080670.

3. Sahni V, “Quantum Computing”, McGraw Hill Education Asia Ltd. 2007.

4. Jean-Baptiste Waldner, “Nano computers and Swarm Intelligence”, John Wiley & Sons, Inc.

2008, ISBN (13): 978-1848210097.

Course

Outcome

Discuss nano computing challenges.

Handle the imperfections.

Apply reliability evaluation strategies.

Use nano scale quantum computing.

96






IV,V&VI



U13CSE23 Information Security 3 0 0 3 50 50 100

Course

Objective

To know the legal, ethical and professional issues in Information Security

To know the aspects of risk management

To become aware of various standards in this area

To know the technological aspects of Information Security


History, What is Information Security?, Critical Characteristics of Information, NSTISSC Security Model,

Components of an Information System, Securing the Components, Balancing Security and Access, The

SDLC, The Security SDLC

Unit - II SECURITY INVESTIGATION Periods 9

Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional Issues

Unit – III SECURITY ANALYSIS Periods 9

Risk Management: Identifying and Assessing Risk, Assessing and Controlling Risk

Unit - IV LOGICAL DESIGN Periods 9

Blueprint for Security, Information Security Poicy, Standards and Practices, ISO 17799/BS 7799, NIST

Models, VISA International Security Model, Design of Security Architecture, Planning for Continuity

Unit – V PHYSICAL DESIGN Periods 9

Security Technology, IDS, Scanning and Analysis Tools, Cryptography, Access Control Devices, Physical

Security, Security and Personnel

Total Periods 45

REFERENCES:

1. Michael E Whitman and Herbert J Mattord, “Principles of Information Security”, Vikas

Publishing House, New Delhi, 2003

2. Micki Krause, Harold F. Tipton, “Handbook of Information Security Management”, Vol 1-3 CRC

Press LLC, 2004.

3. Stuart Mc Clure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw Hill, 2003.

4. Matt Bishop, “ Computer Security Art and Science”, Pearson/PHI, 2002

Course

Outcome

Clarify the legal, ethical and professional issues in Information Security

Manage risk in information security

97






IV,V&VI



U13CSE24 Machine Learning 3 0 0 3 50 50 100

Course

Objective

Basic knowledge about the key algorithms and theory that form the foundation of

machine learning and computational intelligence.

a practical knowledge of machine learning algorithms and methods


Supervised learning algorithms: Linear and Logistic Regression, Gradient Descent, Support Vector Machines,

Kernels.

Unit - II ARTIFICIAL NEURAL NETWORK Periods 9

Artificial Neural Networks, Decision Trees, ML and MAP Estimates, K-Nearest Neighbor, Naive Bayes,

Introduction to Bayesian Networks.

Unit – III UNSUPERVISED LEARNING ALGORITHMS Periods 9

Unsupervised learning algorithms: K-Means clustering, Gaussian Mixture Models, Learning with Partially

Observable Data (EM).

Unit - IV ANALYSIS Periods 9

Dimensionality Reduction and Principal Component Analysis, Bias Variance Trade-off. Model Selection and

Feature Selection, Regularization, Learning Theory.

Unit – V MARKOV DECISION Periods 9

Introduction to Markov Decision Processes, Application to Information Retrieval, NLP, Biology and

Computer Vision, Advanced Topics.

Total Periods 45

REFERENCES:

1. Christopher Bishop “Pattern recognition and machine learning” , Springer Verlag, 2006.

2. Hastie, Tibshirani, Friedman “The elements of Statistical Learning” Springer Verlag

3. T. Mitchell “Machine Learning” McGraw-Hill, 1997.

4. Papoulis and Pillai “Probability, Random Variables and Stochastic processes”, 4th Edition, Tata

McGraw Hill Edition.

5. Gilbert Strand “Linear Algebra and Its Applications” Thompson Books.

Course

Outcome

Understand the principles, advantages, limitations and possible applications of machine

learning

Identify and apply the appropriate machine learning technique to classification, pattern

recognition, optimization and decision problems.

http://research.microsoft.com/en-us/um/people/cmbishop/prml/

98






IV,V&VI



U13CSE25 Indian Constitution and

Society 3 0 0 3 50 50 100

Course

Objective

To propagate the ideals and values of the Indian Constitution.

To further the Objective and goals of the constitutionalism, unity in diversity, social

justice substantive equality

To facilitate the practice of the ideals and values of the Indian Constitution in all

spheres of life, both public and private, including that of individuals.


Historical Background – Constituent Assembly of India – Philosophical foundations of the Indian

Constitution – Preamble – Fundamental Rights – Directive Principles of State Policy – Fundamental Duties –

Citizenship – Constitutional Remedies for citizens.

Unit - II UNION GOVERNMENT Periods 9

Union Government – Structures of the Union Government and Functions – President – Vice President –

Prime Minister – Cabinet – Parliament – Supreme Court of India – Judicial Review.

Unit – III STATE GOVERNMENT Periods 9

State Government – Structure and Functions – Governor – Chief Minister – Cabinet – State Legislature –

Judicial System in States – High Courts and other Subordinate Courts.

Unit - IV INDIAN FEDERAL SYSTEM Periods 9

Indian Federal System – Center – State Relations – President‟s Rule – Constitutional Amendments –

Constitutional Functionaries - Assessment of working of the Parliamentary System in India.

Unit – V SOCIETY Periods 9

Society : Nature, Meaning and definition; Indian Social Structure; Caste, Religion Language in India;

Constitutional Remedies for citizens – Political Parties and Pressure Groups; Right of Women, Children and

Scheduled Castes and Scheduled Tribes and other Weaker Sections.

Total Periods 45

REFERENCES:

1. Durga Das Basu, “Introduction to the Constitution of India “, Prentice Hall of India, New Delhi.

2. R.C.Agarwal, (1997) “Indian Political System”, S.Chand and Company, New Delhi.

3. Maciver and Page, “Society: An Introduction Analysis “, Mac Milan India Ltd., New Delhi.

4. A.V.Oppenheim, R.W. Schafer and J.R. Buck, Discrete-Time Signal Processing, 8th

Indian Reprint, Pearson, 2004.

5. K.L.Sharma, (1997) “Social Stratification in India: Issues and Themes”, Jawaharlal Nehru

University, New Delhi.

6. Sharma, Brij Kishore, “ Introduction to the Constitution of India:, Prentice Hall of India, New

Delhi.

7. U.R.Gahai, “Indian Political System “, New Academic Publishing House, Jalaendhar.

8. R.N. Sharma, “Indian Social Problems “, Media Promoters and Publishers Pvt. Ltd.

99

Course

Outcome

To work towards a gender just society considering the dignity of the person as per the

Constitutional vision.

To provide legal aid and services to the poor and needy especially those groups classified

by the Indian Constitution.

To introduce and implement Constitutional Governance according to the ideals and

principles of the Indian Constitution both in public and private sector, including , all

realms of personal , social economic and public life.

100






IV,V&VI



U13CSE26 Information Retrieval 3 0 0 3 50 50 100

Course

Objective

Learn the information retrieval models.

Be familiar with Web Search Engine.

Be exposed to Link Analysis.

Understand Hadoop and Map Reduce.


Introduction -History of IR- Components of IR - Issues –Open source Search engine Frameworks -

The impact of the web on IR - The role of artificial intelligence (AI) in IR – IR Versus Web Search -

Components of a Search engine- Characterizing the web..

Unit - II INFORMATION RETRIEVAL Periods 9

Boolean and vector-space retrieval models- Term weighting - TF-IDF weighting- cosine similarity –

Preprocessing - Inverted indices - efficient processing with sparse vectors – Language Model based IR -

Probabilistic IR –Latent Semantic Indexing - Relevance feedback and query expansion.

Unit – III WEB SEARCH ENGINE – INTRODUCTION AND

CRAWLING Periods 9

Web search overview, web structure, the user, paid placement, search engine optimization/ spam. Web

size measurement - search engine optimization/spam – Web Search Architectures - crawling - meta-crawlers-

Focused Crawling - web indexes –- Near-duplicate detection - Index Compression - XML retrieval.

Unit - IV WEB SEARCH – LINK ANALYSIS AND SPECIALIZED

SEARCH Periods 9

Link Analysis –hubs and authorities – Page Rank and HITS algorithms -Searching and Ranking –

Relevance Scoring and ranking for Web – Similarity - Hadoop & Map Reduce - Evaluation -

Personalized search - Collaborative filtering and content-based recommendation of documents and

products – handling “invisible” Web - Snippet generation, Summarization, Question Answering, Cross-

Lingual Retrieval.

Unit – V DOCUMENT TEXT MINING Periods 9

Information filtering; organization and relevance feedback – Text Mining -Text classification and

clustering - Categorization algorithms: naive Bayes; decision trees; and nearest neighbor - Clustering

algorithms: agglomerative clustering; k-means; expectation maximization (EM).

Total Periods 45

REFERENCES:

1. C. Manning, P. Raghavan, and H. Schütze, “Introduction to Information Retrieval” , Cambridge

University Press, 2008.

2.

Ricardo Baeza -Yates and Berthier Ribeiro - Neto, “Modern Information Retrieval: The

Concepts

and Technology behind Search” 2nd

Edition, ACM Press Books 2011.

3. Bruce Croft, Donald Metzler and Trevor Strohman, “Search Engines: Information Retrieval in

101

Practice”, 1st Edition Addison Wesley, 2009.

4. Mark Levene, “An Introduction to Search Engines and Web Navigation”, 2

nd Edition Wiley,

2010.

5. Stefan Buettcher, Charles L. A. Clarke, Gordon V. Cormack,” Information Retrieval:

Implementing and Evaluating Search Engines”, The MIT Press, 2010..

6. Ophir Frieder “Information Retrieval: Algorithms and Heuristics: The Information Retrieval

Series “, 2nd Edition, Springer, 2004.

7. Manu Konchady, “Building Search Applications: Lucene, Ling Pipe”, and First Edition, Gate

Mustru Publishing, 2008.

Course

Outcome

Apply information retrieval models.

Design Web Search Engine.

Use Link Analysis.

Use Hadoop and Map Reduce.

102






IV,V&VI



U13CSE27 Social Network Analysis 3 0 0 3 50 50 100

Course

Objective

Understand the concept of semantic web and related applications.

Learn knowledge representation using ontology.

Understand human behaviour in social web and related communities.

Learn visualization of social networks.


Introduction to Semantic Web: Limitations of current Web - Development of Semantic Web - Emergence of

the Social Web - Social Network analysis: Development of Social Network Analysis - Key concepts and

measures in network analysis - Electronic sources for network analysis: Electronic discussion networks,

Blogs and online communities - Web-based networks - Applications of Social Network Analysis.

Unit - II MODELLING, AGGREGATING AND KNOWLEDGE

REPRESENTATION Periods 9

Ontology and their role in the Semantic Web: Ontology-based knowledge Representation - Ontology

languages for the Semantic Web: Resource Description Framework - Web Ontology Language - Modeling

and aggregating social network data: State-of-the-art in network data representation - Ontological

representation of social individuals - Ontological representation of social relationships - Aggregating and

reasoning with social network data - Advanced representations.

Unit – III EXTRACTION AND MINING COMMUNITIES IN WEB

SOCIAL NETWORKS Periods 9

Extracting evolution of Web Community from a Series of Web Archive - Detecting communities in social

networks - Definition of community - Evaluating communities - Methods for community detection and

mining - Applications of community mining algorithms - Tools for detecting communities social network

infrastructures and communities - Decentralized online social networks - Multi-Relational characterization of

dynamic social network communities

Unit - IV PREDICTING HUMAN BEHAVIOUR AND PRIVACY

ISSUES Periods 9

Understanding and predicting human behaviour for social communities - User data management - Inference

and Distribution - Enabling new human experiences - Reality mining - Context - Awareness - Privacy in

online social networks - Trust in online environment - Trust models based on subjective logic - Trust network

analysis - Trust transitivity analysis - Combining trust and reputation - Trust derivation based on trust

comparisons - Attack spectrum and countermeasures.

Unit – V VISUALIZATION AND APPLICATIONS OF SOCIAL

NETWORKS Periods 9

Graph theory - Centrality - Clustering - Node-Edge Diagrams - Matrix representation - Visualizing online

social networks, Visualizing social networks with matrix-based representations - Matrix and Node-Link

Diagrams - Hybrid representations - Applications - Cover networks - Community welfare - Collaboration

networks - Co-Citation networks.

Total Periods 45

103

REFERENCES:

1. Peter Mika, “Social Networks and the Semantic Web”, First Edition, Springer 2007.

2. Borko Furht, “Handbook of Social Network Technologies and Applications”, 1st Edition,

Springer, 2010.

3. Guandong Xu ,Yanchun Zhang and Lin Li, “Web Mining and Social Networking – Techniques

and applications”, First Edition Springer, 2011.

4. Dion Goh and Schubert Foo, “Social information Retrieval Systems: Emerging Technologies and

Applications for Searching the Web Effectively”, IGI Global Snippet, 2008.

5. Max Chevalier, Christine Julien and Chantal Soule-Dupuy, “Collaborative and Social Information

Retrieval and Access: Techniques for Improved user Modeling”, IGI Global Snippet, 2009.

6. John G. Breslin, Alexander Passant and Stefan Decker, “The Social Semantic Web”, Springer,

2009.

Course

Outcome

Develop semantic web related applications.

Represent knowledge using ontology.

Predict human behaviour in social web and related communities.

Visualize social networks.

104






IV,V&VI



U13CSE28 Software Testing and Quality

Assurance 3 0 0 3 50 50 100

Course

Objective

Expose the criteria for test cases.

Learn the design of test cases.

Be familiar with test management and test automation techniques.

Unit – I FUNDAMENTALS OF SOFTWARE QUALITY ASSURANCE Periods 9

Ethical Basis for Software Quality – Total Quality Management Principles – Software Processes and

Methodologies.

Unit - II QUALITY STANDARDS Periods 9

Quality Standards – Practices and Conventions – Software Configuration Management – Reviews and Audits

–Enterprise Resource Planning Software.

Unit – III QUALITY METRIC SYSTEM Periods 9

Measurement Theory – Software Quality Metrics – Designing Software Measurement Programs –

Complexity Metrics and Models – Organizational Learning – Improving Quality with Methodologies

– Structured/Information Engineering.

Unit - IV SOFTWARE TESTING – INTRODUCTION Periods 9

Testing as an Engineering Activity – Role of Process in Software Quality – Testing as a Process –

Basic Definitions, Software Testing Principles – The Tester‟s Role in a Software Development

Organization – Origins of Defects – Defect Classes – The Defect Repository and Test Design –

Defect Examples – Developer/Tester Support for Developing a Defect Repository.

Unit – V TESTING ISSUES Periods 9

Introduction to Testing Design Strategies – The Smarter Tester –Test Case Design Strategies – Using Black

Box Approach to Test Case Design – Random Testing – Equivalence Class Partitioning – Boundary Value

Analysis – Other Black-box Test Design Approaches – Black-box testing and COTS – Using White-Box

Approach to Test design – Test Adequacy Criteria – Coverage and Control Flow Graphs – Covering Code

Logic – Paths – White-box Based Test Design – Additional White Box Test Design Approaches – Evaluating

Test Adequacy Criteria.

Total Periods 45

REFERENCES:

1. Schulmeyer, G. Gordon, James McManus, “Handbook of Software Quality Assurance”, Third

Edition, Van Nostrand Reinhold, 1998.

2. Edward Kit, “Software Testing in the Real World – Improving the Process”, Pearson Education,

2004.

3. William E.Perry , “Effective methods for Software Testing”, Second Edition, Wiley, 2000.

Course

Outcome

Design test cases suitable for a software development for different domains.

Identify suitable tests to be carried out.

Document test plans and test cases designed.

Use of automatic testing tools.

105





Department COMPUTER SCIENCE AND

ENGINEERING Semester

Elective-

IV,V&VI



U13CSE29 Total Quality Management 3 0 0 3 50 50 100

Course

Objective

To facilitate the understanding of Quality Management principles and process.


Introduction - Need for quality - Evolution of quality - Definitions of quality - Dimensions of product and

service quality - Basic concepts of TQM - TQM Framework - Contributions of Deming, Juran and Crosby -

Barriers to TQM - Quality statements - Customer focus - Customer orientation, Customer satisfaction,

Customer complaints, Customer retention - Costs of quality.

Unit – II TQM PRINCIPLES Periods 9

Leadership - Strategic quality planning, Quality Councils - Employee involvement - Motivation,

Empowerment, Team and Teamwork, Quality circles Recognition and Reward, Performance appraisal -

Continuous process improvement - PDCA cycle, 5S, Kaizen - Supplier partnership - Partnering, Supplier

selection, Supplier Rating.

Unit – III TQM TOOLS AND TECHNIQUES I Periods 9

The seven traditional tools of quality - New management tools - Six sigma: Concepts, Methodology,

applications to manufacturing, service sector including IT - Bench marking - Reason to bench mark, Bench

marking process - FMEA - Stages, Types.

Unit – IV TQM TOOLS AND TECHNIQUES II Periods 9

Control Charts - Process Capability - Concepts of Six Sigma - Quality Function Development (QFD) -

Taguchi quality loss function - TPM - Concepts, improvement needs - Performance measures.

Unit – V QUALITY SYSTEMS Periods 9

Need for ISO 9000 - ISO 9001-2008 Quality System - Elements, Documentation, Quality Auditing - QS 9000

- ISO 14000 - Concepts, Requirements and Benefits - TQM Implementation in manufacturing and service

sectors.

Total Periods 45

REFERENCES:

1. James R. Evans and William M. Lindsay, "The Management and Control of Quality", 8th

Edition, First Indian Edition, Cengage Learning, 2012.

2. Suganthi.L and Anand Samuel, "Total Quality Management", Prentice Hall (India) Pvt. Ltd.,

2006.

3. Janakiraman. B and Gopal .R.K., "Total Quality Management - Text and Cases", Prentice Hall

(India) Pvt. Ltd., 2006.

Course

Outcome

Able to apply the tools and techniques of quality management to manufacturing and

services processes

106






IV,V&VI



U13CSE30 Advances in Compiler

Construction 3 0 0 3 50 50 100

Course

Objective

Aims to teach students the principles involved in compiler design.

To know basic components of a compiler but not the advanced material on

optimizations and machine code generation.

Unit – I OVERVIEW OF COMPILER Periods 9

Definition of programming language – Lexical and syntactic structure of a language –Elements of a format

language grammar – Derivation, reduction and syntax trees – A ambiguity – context free grammars

– Capabilities of a context free grammar – Regular expressions-Compiler-Phases of Compiler.

Unit - II LEXICAL, SYNTAX AND SEMANTIC ANALYSIS Periods 9

Role of lexical analyzer – Finite automats –Regular expressions to finite automata – Minimizing the number

of states of DFA – Implementation of a lexical analyzer –Illustrations. Lexical analysis, parsing,

semantic analysis.

Unit – III PARSING TECHNIQUES Periods 9

Parse trees – Left most and right most Parsing techniques- Top down and bottom up parsing – Handles – Shift

reduce Parse- Recursive descent Parser – Operator precedence and predictive Parse. Automatic Parsing

techniques: LR grammars – LR Parsing – Canonical –collection of LR (0) items – construction of ACTION

and GO TO table – Introduction to SLR – canonical and LALR Parsing.

Unit - IV CODE GENERATION AND OPTIMIZATION Periods 9

Error recovery and intermediate code generation; Runtime storage management; Code generation Code

improvement - peephole optimization, dependence analysis and redundancy elimination. Loop optimization,

procedural and inter-procedural optimization, instruction scheduling, and optimization for memory hierarchy.

Unit – V ADVANCES IN COMPILER Periods 9

Compilation for high performance architecture; Portability and retarget ability; Selected topics from

compilers for imperative, object-oriented and mark-up languages, parallel and distributed programming and

concurrency.

Total Periods 45

REFERENCES:

1. V. Aho, Ravi Sethi, Jeffrey D. Ullman, Compilers:Principles,Techniques and Tools,Addison-

Wesley.

2. Michael L. Scott, Programming Language Pragmatics, Elsevier.

3. Andrew W. Appel, Modern Compiler Implementation in C/Java, Cambridge University Press.

4. Keith D. Cooper and Linda Torczon, Engineering a Compiler, Elsevier.

5. Allen I. Holob, Compiler Design in C, Prentice-Hall.

6. Steven S. Muchnik, Advanced Compiler Design and Implementation, Elsevier.

7. Randy Allen and Ken Kennedy, Optimizing Compilers for Modern Architectures, Elsevier.

Course

Outcome

Appreciation of parsing and code generation techniques

Demonstrate ability to understand of optimizations problems and issues, data flow analysis

framework and mathematical modeling.

107






IV,V&VI



U13CSE31 Computational Number Theory 3 0 0 3 50 50 100

Course

Objective

To understand the concept of image processing and sensor

To understand the Concept of transformations

Unit – I ALGORITHMS FOR INTEGER ARITHMETIC Periods 9

Divisibility, gcd, modular arithmetic, modular exponentiation, Montgomery arithmetic, congruence, Chinese

remainder theorem, Hensel lifting, orders and primitive roots, quadratic residues, integer and modular square

roots, prime number theorem, continued fractions and rational approximations.

Unit - II REPRESENTATION OF FINITE FIELDS Periods 9

Prime and extension fields, representation of extension fields, polynomial basis, primitive elements, normal

basis, optimal normal basis, irreducible polynomials.

Unit – III ALGORITHMS FOR POLYNOMIALS Periods 9

Root-finding and factorization, Lenstra-Lenstra-Lovasz algorithm, polynomials over finite fields.

Unit - IV ELLIPTIC CURVES AND ALGORITHMS Periods 9

The elliptic curve group, elliptic curves over finite fields, Schoof's point counting algorithm. Fermat

test, Miller-Rabin test, Solovay-Strassen test, AKS test. Trial division, Pollard rho method, p-1 method,

CFRAC method, quadratic sieve method, elliptic curve method.

Unit – V COMPUTING DISCRETE LOGARITHMS OVER FINITE FIELDS Periods 9

Baby-step-giant-step method, Pollard rho method, Pohlig-Hellman method, index calculus methods, linear

sieve method, and Coppersmith‟s algorithm. Algebraic coding theory, cryptography.

Total Periods 45

REFERENCES:

1. Victor Shoup,” A Computational Introduction to Number Theory and Algebra”, Cambridge

University Press. Second edition, 2008.

2. Maurice Mignotte, “Mathematics for Computer Algebra”, Springer-Verlag

3. Joachim von zur Gathen and Juergen Gerhard, “Modern Computer Algebra”, Cambridge

University Press.

4. Rudolf Lidl and Harald Niederreiter,” Introduction to Finite Fields and their applications”,

Cambridge University Press.

Course

Outcome

State and understand the basic theorems of integer congruence‟s

State and understand the basic ideas of cryptology.

Perform calculations, both by hand and using computer algebra systems, related to

elementary number theory.

108

VIVEKANANDHA COLLEGE OF ENGINEERING FOR

WOMEN (Autonomous Institution, Affiliated to Anna University

,Chennai)




IV,V&VI



U13CSE32 Advanced Graph Theory 3 0 0 3 50 50 100

Course

Objective

To understand the concept of Paths and Cycles of algorithm.

To understand the Concept of External Problem.

Unit – I BASIC CONCEPTS Periods 9

Graphs and digraphs, incidence and adjacency matrices, isomorphism, the auto orphism group; Trees:

Equivalent definitions of trees and forests, Cayley's formula, the Matrix-Tree theorem, minimum

spanning trees; Connectivity: Cut vertices, cut edges, bonds, the cycle space and the bond space,

blocks, Menger's theorem.

Unit - II PATHS AND CYCLES Periods 9

Euler tours, Hamilton paths and cycles, theorems of Dirac, Ore, Bondy and Chvatal, girth, circumference, the

Chinese Postman Problem, the Traveling Salesman problem, diameter and maximum degree, shortest paths.

Unit – III MATCHINGS Periods 9

Berge's Theorem, perfect matchings, Hall's theorem, Tutte's theorem, Konig's theorem, Petersen's theorem,

algorithms for matching and weighted matching (in both bipartitie and general graphs), factors of

graphs (decompositions of the complete graph), Tutte's f-factor theorem.

Unit – IV EXTREMAL PROBLEMS Periods 9

Independent sets and covering numbers, Turan's theorem, Ramsey theorems; Colorings: Brooks theorem, the

greedy algorithm, the Welsh-Powell bound, critical graphs, chromatic polynomials, girth and

chromatic number, Vizing's theorem; Graphs on surfaces: Planar graphs, duality, Euler's formula,

Kuratowski's theorem,,toroidal graphs, 2-cell embeddings, graphs on other surfaces.

Unit – V DIRECTED GRAPHS Periods 9

Tournaments, directed paths and cycles, connectivity and strongly connected digraphs, branching; Networks

and flows: Flow cuts, max flow min cut theorem, perfect square; Selected topics: Dominating sets, the

reconstruction problem, intersection graphs, perfect graphs, and random graphs.

Total Periods 45

REFERENCES:

1. Douglas B. West, “Introduction to Graph Theory”, Prentice Hall of India, 2001

2. Narsingh Deo, “Graph Theory with Applications to Engineering and Computer Science”.

Prentice-Hall.

3. Frank Harary, “Graph Theory”, Narosa, 1995.

4. R. Ahuja, T. Magnanti, and J. Orlin, “Network Flows: Theory, Algorithms, and

Applications”, Prentice-Hall, 1993

Course

Outcome

Knowledge of the most fundamental notions and results in Graph Theory Problem

solving skills; proof techniques.