CURRICULUM - Tiruchengodevcenggw.ac.in/pdf/it/ug/b.tech-it-syllabi_2013.pdf · (Autonomous...
Transcript of CURRICULUM - Tiruchengodevcenggw.ac.in/pdf/it/ug/b.tech-it-syllabi_2013.pdf · (Autonomous...
1
VIVEKANANDHA COLLEGE OF ENGINEERING FORWOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
Programme B.Tech. Programme Code 101 Regulation 2013
Department INFORMATION TECHNOLOGY 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
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester II
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
Course Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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
Total Credits 25 400 400 800
CA - Continuous Assessment, ESE - End Semester Examination
# Common Syllabus for CSE, IT, ECE, EEE & BT
* Common Syllabus for CSE, IT, ECE & EEE
3
VIVEKANANDHA COLLEGE OF ENGINEERING FORWOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY
Semester III
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
Course Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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
U13EE311 Introduction to System Theory 3 0 0 3 50 50 100
U13IT301 Database Management Systems 3 0 0 3 50 50 100
U13CS311 Open Source Software* 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
U13IT302 DBMS Laboratory 0 0 3 2 50 50 100
U13CS312 Open Source Software Laboratory 0 0 3 2 50 50 100
Total Credits 25 450 450 900
CA - Continuous Assessment, ESE - End Semester Examination
* Common Syllabus for CSE & IT
4
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
Course Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
THEORY
U13MA407 Advanced Engineering Mathematics 3 1 0 4 50 50 100
U13MA408 Scientific Computing 3 1 0 4 50 50 100
U13IT403 Computer Networks 3 0 0 3 50 50 100
U13IT404 Operating Systems* 3 0 0 3 50 50 100
U13IT405 Computer System Architecture 3 0 0 3 50 50 100
U13EC417 Discrete and Integrated Analog Circuits 3 0 0 3 50 50 100
PRACTICAL
U13IT406 Computer Networks Laboratory 0 0 3 2 50 50 100
U13IT407 Operating Systems Laboratory 0 0 3 2 50 50 100
U13EC418 Integrated Circuits Laboratory 0 0 3 2 50 50 100
Total Credits 26 450 450 900
CA - Continuous Assessment, ESE - End Semester Examination
* Common Syllabus for CSE & IT
5
VIVEKANANDHA COLLEGE OF ENGINEERING FORWOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
Course Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
THEORY
U13EC525 Introduction to Analog & Digital
Communication 3 0 0 3 50 50 100
U13IT508 Theory of Computation* 3 0 0 3 50 50 100
U13IT509 Java Programming 3 0 0 3 50 50 100
U13EC526 Microprocessor and its Interfacing 3 0 0 3 50 50 100
U13IT510 Software Engineering* 3 0 0 3 50 50 100
U13IT511 Cryptography and Network Security 3 0 0 3 50 50 100
PRACTICAL
U13IT512 Java Programming Laboratory 0 0 3 2 50 50 100
U13IT513 Software Engineering Laboratory 0 0 3 2 50 50 100
U13IT514 Cryptography Laboratory 0 0 3 2 50 50 100
Total Credits 24 450 450 900
CA - Continuous Assessment, ESE - End Semester Examination
* Common Syllabus for CSE & IT
6
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
Course
Code Course Name
Periods /
Week Credit Maximum Marks
L T P C CA ESE Total
THEORY
U13EC635 Digital Signal Processing 3 0 0 3 50 50 100
U13IT615 Object Oriented Analysis & Design* 3 0 0 3 50 50 100
U13IT616 Internet & Web Technology 3 0 0 3 50 50 100
U13IT617 Principles of Multimedia 3 0 0 3 50 50 100
U13IT618 Information & Coding Theory 3 1 0 4 50 50 100
Elective – I 3 0 0 3 50 50 100
PRACTICAL
U13IT619 Multimedia Laboratory 0 0 3 2 50 50 100
U13IT620 Internet & Web Technology Laboratory 0 0 3 2 50 50 100
U13EN603 Communication Skills & Career
Development Practices Laboratory 0 0 3 2 50 50 100
Total Credits 25 450 450 900
CA - Continuous Assessment, ESE - End Semester Examination
* Common Syllabus for CSE & IT
7
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VII
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
Course
Code Course Name
Periods /
Week Credit Maximum Marks
L T P C CA ESE Total
THEORY
U13IT721 Professional Ethics in Engineering 3 0 0 3 50 50 100
U13IT722 Wireless Communications & Networks 3 0 0 3 50 50 100
U13IT723 Parallel & Distributed Computing 3 0 0 3 50 50 100
U13IT724 Computer Graphics 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
U13IT725 Parallel & Distributed Computing Laboratory 0 0 3 2 50 50 100
U13IT726 Computer Graphics Laboratory 0 0 3 2 50 50 100
U13IT727 Mini Project 0 0 3 2 50 50 100
Total Credits 24 400 400 800
CA - Continuous Assessment, ESE - End Semester Examination
8
VIVEKANANDHA COLLEGE OF ENGINEERING
FORWOMEN (Autonomous Institution Affiliated to Anna University,
Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VIII
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
Course
Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
THEORY
U13BA804 Principle of Management 3 0 0 3 50 50 100
Elective – IV 3 0 0 3 50 50 100
Elective – V 3 0 0 3 50 50 100
PRACTICAL
U14IT828 Project Work 0 0 12 6 50 50 100
Total Credits 15 300 300 600
CA - Continuous Assessment, ESE - End Semester Examination
Cumulative Course Credits: 189
9
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester -
CURRICULUM
(Applicable to the students admitted from the academic year 2013 - 2014 onwards)
LIST OF ELECTIVES
Course Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
THEORY
U13ITE01 Embedded System Design 3 0 0 3 50 50 100
U13ITE02 Middleware Technologies 3 0 0 3 50 50 100
U13ITE03 Cloud Computing 3 0 0 3 50 50 100
U13ITE04 Data Warehousing & Data
Mining 3 0 0 3 50 50 100
U13ITE05 C# &. Net Programming 3 0 0 3 50 50 100
U13ITE06 Principles of Programming
Languages 3 0 0 3 50 50 100
U13ITE07 Soft Computing 3 0 0 3 50 50 100
U13ITE08 Software Reliability & Testing 3 0 0 3 50 50 100
U13ITE09 E-Commerce 3 0 0 3 50 50 100
U13ITE10 Compiler Design 3 0 0 3 50 50 100
U13ITE11 Information System Project
Management 3 0 0 3 50 50 100
U13ITE12 Decision Support Systems &
Intelligent Systems 3 0 0 3 50 50 100
U13ITE13 Pattern Recognition 3 0 0 3 50 50 100
U13ITE14 Real Time Systems 3 0 0 3 50 50 100
10
U13ITE15 Advanced Database Management
Systems 3 0 0 3 50 50 100
U13ITE16 Cyber Forensics 3 0 0 3 50 50 100
U13ITE17 Knowledge Management 3 0 0 3 50 50 100
U13ITE18 Modern Telecommunication
Systems 3 0 0 3 50 50 100
U13ITE19 Business Data Communications 3 0 0 3 50 50 100
U13ITE20 Optimization Techniques 3 0 0 3 50 50 100
U13ITE21 Bio- Informatics 3 0 0 3 50 50 100
U13ITE22 Advanced Computer Graphics 3 0 0 3 50 50 100
U13ITE23 Computing & Complexity
Theory 3 0 0 3 50 50 100
U13ITE24 Digital Image Processing 3 0 0 3 50 50 100
U13ITE25 Natural Language Processing 3 0 0 3 50 50 100
U13ITE26 Modeling & Simulation 3 0 0 3 50 50 100
U13ITE27 Social Network Analysis 3 0 0 3 50 50 100
U13ITE28 Machine Learning 3 0 0 3 50 50 100
CA - Continuous Assessment, ESE - End Semester Examination
11
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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 I
Course
Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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
12
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
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.
13
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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 I
Course
Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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.
14
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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 I
Course
Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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 process.
15
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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 I
Course
Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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 Economy
Edition.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
Outcomes
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 and engineering applications of
polymers
16
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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 I
Course Code Course Name Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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
17
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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 I
Course Code Course Name Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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
18
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.
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
19
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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
I
Course
Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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 I
Course Code Course Name Periods / Week Credit Maximum Marks
L T P C CA ESE Total
U13CS102 Computer Practices Lab 0 0 3 2 50 50 100
Course
Objectives
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
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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
Course Code Course Name Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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
Objectives
Develop listening skills for academic and professional purposes
Develop effective reading skills
Improve their vocabulary
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
Improve their vocabulary
Write effectively in informal and professional situations.
23
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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
Course Code Course Name Periods / Week Credit Maximum Marks
L T P C CA ESE Total
U13MA202 Engineering Mathematics – II 3 1 0 4 50 50 100
Course
Objectives
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
24
REFERENCES:
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”, 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
25
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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
Course
Code Course Name
Periods /Week Credit Maximum Marks
L T P C CA ES
E Total
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
Able to know the metals, semi conductors, magnetic materials, dielectric materials and nano
materials.
26
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E./ B. Tech. Programme Code Regulation 2013
Department EEE, ECE, CSE & IT Semester II
Course
Code Course Name
Periods / Week Credit Maximum Marks
L T P C CA ES
E Total
U13CH202 Environmental Science and Engineering 3 0 0 3 50 50 100
Course
Objectives
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
Able to gain knowledge on Natural Resources and Biodiversity Conservation,
Environmental Pollution, Environment and Energy, Global Atmospheric Change, Solid
Waste Management and 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.
27
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code Regulation 2013
Department CSE & IT Semester II
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
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
At the end of course, the students able to,
Operation of the basic electronic devices such as PN junction diode, Bipolar and
Field effect Transistors, LED, Amplifiers, Oscillators and other amplifiers
28
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code Regulation 2013
Department CSE & IT Semester II
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
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
EFERENCES:
1. Robert Lafore, “Object Oriented Programming in C++”, 4th Edition, Galgotia Publications Pvt Ltd, 2008.
2. Bhushan Trivedi, “Programming with ANSI C++”, 2nd
Edition, Oxford University Press, 2012.
3. Paul Deitel, Harvey Deitel, “C++ How to program”, 8th Edition, PHI, 2011.
4. E.Balagurusamy, “Object Oriented Programming with C++”, 5th Edition, Tata McGraw-Hill Education,
2008.
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 analyse the various algorithms.
29
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(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
Course Code Course Name Periods / Week Credit Maximum Marks
L T P C CA ESE Total
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 –
30
Production of hexagonal headed bolt.
(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.
31
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code Regulation 2013
Department CSE & IT Semester II
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
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
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.
32
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester III
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13MA303 Discrete Mathematics and Graph
Theory 3 1 0 4 50 50 100
Course
Objective
To have knowledge of the concepts needed to test the logic of a program.
To 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..
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 , “Discrete mathematical Structures”, 5th Edn, Pearson Education, New Delhi - 2004.
2. K.H. Rosen, “Discrete Mathematics and Its Applications”, 4th Edn, Tata McGraw Hill, New Delhi –
2001.
3. J.P. Tremblay , “ Discrete Mathematical Structures with Applications to Computer Science”, TMH,
New Delhi – 2004.
Course
Outcome
Have an understanding in identifying structures on many levels.
Be aware of the counting principles.
Be exposed to concepts and properties of algebraic structures such as groups,
rings and fields in the area of computer applications.
33
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution, Affiliated to Anna University ,Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester III
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13CS305 Data Structure using C++ 3 0 0 3 50 50 100
Course
Objective
An issue central to the art of computer programming is to know the basic concepts of
list ,stacks, tree, graph, and hashing algorithms.
To understand the structure and comprehensive set of computer assignments
Unit – I INTRODUCTION TO C++ AND ALGORITHM ANALYSIS Periods 12
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 12
Abstract Data Types, The list ADT, The Stack ADT, The Queue ADT.
Unit – III TREES Periods 12
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 12
Model and Simple implementations, Binary Heap, Applications of Priority Queues, d-Heaps, Leftist and
Skew Heaps.
Unit – V SORTING AND GRAPH ALGORITHMS Periods 12
Preliminaries, Insertion sort, Shell sort, Heap sort, Merge sort, and Quick sort, Topological Sort, Shortest Path
Algorithms, Network Flow Problems and Minimum Spanning Tree.
Total Periods 60
REFERENCES:
1. Mark A. Weiss, “Data Structures & Algorithm Analysis in C++”, 2nd Edition, Pearson Education,
New Delhi – 2002.
2. Gregory L. Heilean, “Data Structures Algorithms, and Object Programming”, Tata McGrow Hill,
New Delhi – 2002.
3. Mark A. Weiss, “Data Structures and Algorithm Analysis in C++”, 4/E, Prentice Hall, 2014
4. S. Sahni, “Data Structures, Algorithms and Applications in C++”, 2nd edition, Universities
Press,2005.
Course
Outcome
Well equipped with the tools of data organization to enable you to write simple, clear,
and efficient programs.
34
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester III
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13EE311 Introduction to System Theory 3 0 0 3 50 50 100
Course
Objective
Introduction to mathematical signal processing and system theory.
An ability to determine conditions that guarantee the linear system stability.
An ability to present and analyze linear control system using the state space technique.
Unit – I INTRODUCTION TO SIGNALS AND SYSTEMS Periods 9
Definition, Basis of classification, Representation of common signals and their properties, System modeling.
Unit – II ANALOGOUS SYSTEM Periods 9
Introduction, D Alembert‟s Principle, Force-voltage and force-current analogies, Electrical analogue of
mechanical, Hydraulic and thermal systems.
Unit – III SYSTEM ANALYSIS Periods 9
System Analysis by Laplace Transform method, System response. Natural, forced, transient and steady state
responses. Transfer function and characteristic equation, Superposition integral, Concept of poles and zeros,
Nature of system response from poles and zeros.
Unit – IV SYSTEM STABILITY Periods 9
Concept of stability, Types, Necessary and sufficient conditions, Routh Hurwitz stability criterion,
Limitations and its applications to closed loop systems.
Unit – V STATE-SPACE CONCEPT Periods 9
Introduction, Definition: State, State variable, State vector and state space, State space representation,
Derivation of State model from transfer function, Bush form and diagonal canonical form of state model,
Non-uniqueness of state model, Derivation of transfer function from state model, Transition matrix and its
properties, Solution of time invariant state equation.
Total Periods 45
REFERENCES:
1. Nagrath & Gopal, “Control System Engineering”, New age International Publishes, 5th Edition 2007.
2. M.Gopal, “Control System Principles and Design”, Tata McGraw Hill, 2nd
edition 2002.
3. M.Gopal, “Digital Control and state variable methods,” 2nd
Edition, TMH 2007.
Course
Outcome
Able to analyze the state-space model with respect to minimality, observability,
reachability, detectability and stabilizability.
Able to explain the relationship between input-output (external) models and state-
space (internal) models for linear systems and derive such models from the basic
principles.
35
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester III
Course
Code Course Name
Periods Per
Week Credit Maximum Marks
L T P C CA ESE Total
U13IT301 Database Management Systems 3 0 0 3 50 50 100
Course
Objective
To understand the role of a database management system in an organization.
To understand basic database concepts, including the structure and operation of the
relational data model.
To construct simple and moderately advanced database queries using Structured Query
Language (SQL).
Unit – I INTRODUCTION Periods 9
Purpose of Database System; View of Data, Data Models, Database Languages, Transaction Management,
Storage Management, Database Users Administrator, History of Database Systems.
Unit – II DATABASE DESIGN AND ENTITY – RELATIONAL MODEL Periods 9
Overview of design process, E-R model, Constraints, E-R Diagram, Weak Entity Sets, Extended E-R
Features, Reduction to E-R Schemas, Structure of Relational Database, Fundamental Relational Algebra
Operations, Additional Relational Algebra Operations, Domain Relational Calculus, Tuple Relational
calculus, Query by Examples.
Unit – III SQL & ADVANCED SQL Periods 9
Data definition, Basic structure of SQL queries, Set Operations, Aggregate Functions, Null Values, Nested
Sub Queries, complex queries, views, modification of database, SQL data types & schemas, Integrity
constraints, authorization, Embedded SQL.
Unit – IV RELATIONAL DATABASE DESIGN Periods 9
Atomic domains & first normal form, Decomposition using functional dependencies, Functional dependency
theory, Decomposition using functional dependencies, Decomposition using multivalued dependencies, more
normal forms.
Unit – V QUERY PROCESSING, TRANSACTION & CONCURRENCY
CONTROL Periods 9
Measure of Query Cost, Selection Operation, Evaluation of Expressions- Transaction Concepts & ACID
Properties, Transaction States, Concurrent Executions, Serializability & Its Testing, Recoverability,
Introduction to Concurrency Control, Locked Base Protocol & Deadlock Handling.
Total Periods 45
REFERENCES:
1. A.Silberschatz et.al, “Database System Concepts”, 5th Edn, Tata Mc-Graw Hill, New Delhi – 2000.
2. Date C.J., “An Introduction to Database System”, Pearson Education, New Delhi - 2005.
3. R. Elmasri, “Fundamentals of Database Systems”, Pearson Education, New Delhi - 2005.
Course Outcome Identify and prioritize database assets threats to database asset
Present a disaster recovery plan for database assets after an incident
36
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester III
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13CS311 Open Source Software 3 0 0 3 50 50 100
Course
Objective
To introduce the concept of open source system and OSS operating system.
To provide adequate knowledge about MySQL, the open source database and open
source programming languages PHP, Python, 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 – Personalities – Cloning – Signals - Development with Linux.
Unit – III MYSQL Periods 9
Introduction – Setting up account – Starting, terminating and writing your own SQL programs – Record
selection Technology – Working with strings – Date and Time – Sorting Query Results – Generating
Summary – Working with metadata using sequences - Essential PHP - Operators and Flow control - Strings
and Arrays - Creating functions - Reading data in web pages - PHP Browser - Handling Power - Object
Oriented Programming - Advanced OOP - 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 – Input and Output – Errors and Exceptions – Functions –
Modules - Classes and OOP.
Unit – V PERL Periods 9
PERL overview - Variables and Data – Statements and Control structures – Subroutines, Packages, and
Modules - Working with Files – Data Manipulation.
Total Periods 45
REFERENCES:
1. Remy Card, Eric Dumas and Frank Mevel, “The Linux Kernel Book”, Wiley Publications, 2003.
2. Steve Suchring, “MySQL Bible”, John Wiley, 2002.
3. Steven Holzner, “PHP: The Complete Reference”, 2
nd Edition, Tata McGraw-Hill Publishing
Company Limited, Indian Reprint 2009.
4. Wesley J. Chun, “Core Phython Programming”, Prentice Hall, 2001.
5. Martin C. Brown, “Perl: The Complete Reference”, 2
nd Edition, Tata McGraw-Hill Publishing
Company Limited, Indian Reprint 2009.
Course
Outcome
Ability to install and run open-source operating systems.
Ability to gather information about Free and Open Source Software
projects from software releases and from sites on the internet.
Ability to build and modify one or more Free and Open Source Software
packages
37
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester III
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13EC307 Logic Design 3 0 0 3 50 50 100
Course
Objective
To introduce the concept of digital and binary systems.
To be able to design and analyze combinational logic circuits.
To be able 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
Able to perform arithmetic operations in any number system.
Can simplify the Boolean expression using K-Map and Tabulation techniques.
Can perform Boolean simplification techniques to design a combinational hardware
circuit.
38
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution, Affiliated to Anna University ,Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code 104 Regulation 2013
Department INFORMATIONTECHNOLOGY Semester III
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13CS309 Data Structure using C++
Laboratory 0 0 3 2 50 50 100
Course
Objective
To develop skills to design and analyze simple linear and non linear data structures •
To Strengthen the ability to identify and apply the suitable data structure for the given
real world problem
To Gain knowledge in practical applications of data structures
SUGGESTED EXPERIMENTS:
Identification of different data structures for different problems like:
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 hasing with open addressing.
10. Implement prim‟s algorithm using priority queue to find MST of an undirected graph.
Performing the same using C++ programming.
Total Periods 45
Course Outcome
Has an clear understanding of linear and non linear data structures
Ability to identify and apply the suitable data structure for the given real world
problem
39
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester III
Course Code Course Name
Periods Per
Week Credit Maximum Marks
L T P C CA ESE Total
U13IT302 DBMS Laboratory 0 0 3 2 50 50 100
Course
Objective
To write queries in data manipulation language and to update and manage a database.
To design and build a simple database system and demonstrate competence with the
fundamental tasks involved with modeling, designing, and implementing a DBMS.
SUGGESTED EXPERIMENTS:
1. Data Definition, Table Creation, Constraints,
2. Insert, Select Commands, Update & Delete Commands.
3. Nested Queries & Join Queries
4. Views
5. Working with PL/SQL blocks.
6. Front end tools
7. Triggers
8. Menu Design
9. Reports.
10. Database Design and implementation (Mini Project).
Total Periods 45
Course
Outcome
Able to understand, appreciate and effectively explain the underlying concepts
of database technologies
Able to design and implement a database schema for a given problem-domain
Populate and query a database using sql dml/ddl commands.
Design and build a gui application using a 4gl
40
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester III
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13CS312 Open Source Software
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.
SUGGESTED EXPERIMENTS:
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. PHYTON programming
6. Perl programming.
7. Network simulator (NS2) installation and simple tcl scripts
Total Periods 45
Course Outcome
Able to Work on open source OS ubuntu.
Can Select and install the various open source software as per the requirement and to handle the installation failure
To create the virtualization environment.
41
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course
Code Course Name
Periods Per week Credit Maximum Marks
L T P C CA ESE Total
U13MA407 Advanced Engineering Mathematics 3 1 0 4 50 50 100
Course
Objective
To understand the applications of Special functions, complex integration,Partial
Differential Equations,Fourier Series, Fourier transform
Unit – I SPECIAL FUNCTIONS Periods 12
Bessel‟s equation: solution and Bessel‟s function of the first kind, Recurrence relations. Orthogonality of
Bessel‟s Functions. Generating function and Bessel‟s integral.
Unit – II COMPLEX VARIABLES Periods 12
Analyticity of a function of a complex variable, Cauchy Riemann equations. Harmonic functions, Bilinear
transformations. Complex integration, Cauchy‟s integral theorem and Cauchy‟s integral formula and for
Derivatives - Taylor‟s and Laurent‟s Series. Poles and Singularities. Cauchy‟s Residue Theorem.
Unit – III PARTIAL DIFFERENTIAL EQUATIONS Periods 12
Boundary value Problems. One dimensional Wave equation - modeling and solutions - One dimensional
heat equation and its solution.
Unit – IV FOURIER SERIES Periods 12
Periodic functions , Fourier series -Dirichlet‟s condition- General Fourier series – Odd and Even functions-
Half range sine and cosine series- Parseval‟s identity.
Unit – V FOURIER TRANSFORM Periods 12
Fourier integral theorem (without proof) – Fourier transform pair-Sine and cosine transforms – Parseval‟s
identity.
Total Periods 60
TEXT BOOKS:
1. Erwin Kreyszig, “Advanced engineering mathematics”, 10th Edition, John Wiley 1999.
2. C. Prasad ,”Advanced Engineering Mathematics”, Prasad Mudranalaya, 1978.
3. B.V.Ramana,”Higher Engineering Mathematics”,17th Reprint(Unit-I)Tata Mc Graw Hill Pvt Ltd
REFERENCES:
1. Ian N. Sneddon ,”Fourier Transforms” ,Dover Edition , McGraw Hill, 1995.
Course Outcome Able to apply the mathematical principles on transforms , partial differential
Equations and special functions in the physical problems of engineering.
42
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course Code Course Name
Periods Per
Week Credit Maximum Marks
L T P C CA ESE Total
U13MA408 Scientific Computing 3 1 0 4 50 50 100
Course
Objective
To understand different types of scientific programming problems including curve
fitting, optimization, integration, differentiation, statistical analysis, ODE solving, and
simulation.
A – NUMERICAL COMPUTING
Unit – I SOLUTIONS OF POLYNOMIAL EQUATIONS Periods 12
Transcendental and Polynomial Equations: Introduction, Bisection Method, Iterative Methods, Rate of
Convergence, Methods for Complex Roots, Polynomial Equations.
Unit – II SYSTEM OF LINEAR EQUATIONS AND INTERPOLATION Periods 12
System of Linear Equations Direct Methods, Iteration Methods, Interpolation and Approximation: Introduction
to Lagrange and Newton Interpolations.
Unit – III DIFFERENTIATION AND INTEGRATION Periods 12
Numerical differentiation, Numerical Integration, Ordinary Differential Equations: Euler methods, Single and
Multistep methods, Predictor-corrector methods.
B – STATISTICAL COMPUTING
Unit – IV PROBABILITY DISTRIBUTIONS Periods 12
Introduction to probability, random variables, probability distributions, moments, moment generating function,
Special discrete and continuous distributions: Binomial and Poisson distributions, Uniform, Gaussian and
Exponential distributions. Function of a random variable.
Unit – V TESTING OF HYPOTHESIS Periods 12
Testing of hypotheses for mean, variance, proportions of single sample using normal, t, chi-square distributions.
Total Periods 60
TEXT BOOKS :
1. Sastrty, S.S. , “Introductory Methods of Numerical Analysis”, 4th Edn., PHI, New Delhi, 2005
3. Montgomery ,”Advanced Statistics and Probability for Engineers”, John Wiley &Son‟s publications
2012.
4. Dr. J. Ravichandran ,“Probability and statistics for Engineers”, Wiley India Ltd.2012.
43
REFERENCES:
1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Third Edition,
Morgan Kauffmann Publishers Inc., 200UNIT.
2. James F. Kuross, Keith W. Ross, “Computer Networking, A Top-Down Approach Featuring the
Internet”, Third Edition, Addison Wesley, 2004.
3. Nader F. Mir, “Computer and Communication Networks”, Pearson Education, 2007.
4. Comer, “Computer Networks and Internets with Internet Applications”, Fourth Edition, Pearson
Education, 2000.
5. Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, 2000.
6. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000.
Course Outcome
Have a clear perception of the power of statistical and numerical ideas
Able to demonstrate the applications of these techniques to problems drawn
from industry, management and other engineering fields.
44
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT403 Computer Networks 3 0 0 3 50 50 100
Objective
To provide all the program, date and hardware is available to everyone on the
network without regard to the physical location of the resource and the users.
To provide the high Reliability. It is achieved by replicating the files on two or more
machines, so in case of unavailability (due to fail of hardware) the other copies can be
used.
Unit - I NETWORK ARCHITECTURE Periods 9
Network architecture – layers – Physical links – Channel access on links – Hybrid multiple access techniques
- Issues in the data link layer - Framing – Error correction and detection – Link-level Flow Control.
Unit - II MEDIUM ACCESS CONTROL Periods 9
Medium access – CSMA – Ethernet – Token ring – FDDI - Wireless LAN – Bridges and Switches.
Unit - III SWITCHING AND ROUTING Periods 9
Circuit switching vs. packet switching / Packet switched networks – IP – ARP – RARP –DHCP – ICMP –
Queuing discipline – Routing algorithms – RIP – OSPF – Sub netting – CIDR – Inter domain routing – BGP
– Ipv6 – Multicasting – Congestion avoidance in network layer.
Unit - IV UDP AND TCP Periods 9
UDP – TCP – Adaptive Flow Control – Adaptive Retransmission - Congestion control –Congestion
avoidance – QoS.
Unit - V EMAIL AND SECURITY Periods 9
Email (SMTPE, MIME, IMAP, POP3) – HTTP – DNS- SNMP – Telnet – FTP – Security –PGP – SSH.
Total Periods 45
REFERENCES:
1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Third Edition,
Morgan Kauffmann Publishers Inc., 200UNIT.
2. James F. Kuross, Keith W. Ross, “Computer Networking, A Top-Down Approach Featuring the
Internet”, Third Edition, Addison Wesley, 2004.
3. Nader F. Mir, “Computer and Communication Networks”, Pearson Education, 2007.
4. Comer, “Computer Networks and Internets with Internet Applications”, Fourth Edition, Pearson
Education, 2000.
5. Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, 2000.
6. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000.
45
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT404 Operating Systems 3 0 0 3 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 Sceduling.
Total Periods 60
REFERENCES:
1. Silver Schatz, A and Golvin, P.B. “Operating System Concepts”, 5th Edn. 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
Able to design various Scheduling algorithms.
Able to design deadlock, prevention and avoidance algorithms.
Able to compare and contrast various memory management schemes.
Able to design and Implement a prototype file systems.
46
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT405 Computer System Architecture 3 0 0 3 50 50 100
Course
Objective
To learn various aspects of computer architecture such as hardware, software
interfaces, instruction set and architecture.
To learn processing units pipelining, memory systems and input and output devices.
Unit - I DESIGN METHODOLOGY Periods 9
System Design System Representation, Design Process, the Gate level The Register Level, Register - Level
Components, Programmable Logic Devices, Register - Level Devices. The Processor Level Processor - level
Components, Processor - level Design.
Unit - II PROCESSOR BASICS AND DATA PATH DESIGN Periods 9
CPU Organization Fundamentals, Additional Floating - Point Numbers Data Representation Basic Format,
Fixed - Point Numbers, Floating - Point Numbers Instruction Sets Instruction Formats and Types. Fixed -
Point Arithmetic Addition, Subtraction, Multiplication and Division Arithmetic Logic Units Combinational
ALUs, Sequential ALUs.
Unit - III CONTROL DESIGN Periods 9
Basic Concepts, Introduction, Hardwired Control Micro programmed Basic Concepts, Multiplier Control Unit
Control Pipeline Control Instruction Pipeline, Arithmetic Pipeline.
Unit - IV MEMORY ORGANIZATION Periods 9
Memory Technology Memory Device Characteristics, Random Access Memories, Serial Access Memories
Memory Systems Multilevel Memories, Address Translation, Memory Allocation Cache Main Features,
Address Mapping.
Unit - V SYSTEM ORGANIZATION Periods 9
Communication Methods Basic concepts Bus Control System Control DMA and Interrupts.
Advanced Topics: Pipeline Processing, Parallel Processing.
Total Periods 45
REFERENCES:
1. Hayes, J.P., “Computer Architecture and Organization”, 3rd
Edition McGraw - Hill, London - 2000.
2. Mano, M.M., “Computer System Architecture”, Prentice Hall of India, New Delhi - 1995.
3. Heuring V.P., “ Computer System Design and Architecture”, Addison Wesley Indian Reprint, 2000.
4. Hamacher.V., “Computer Organization” ,4th edition, McGraw Hill, Singapore - 1996.
5. Ram.B, ”Computer Fundamentals: Architecture and Organization”, 3
rd Edition New Age
International Publication, New Delhi - 2000.
Course Outcome
Well know about computer performance, instruction set architecture
design and implementation
Well known processor implementation alternatives (single-cycle,
multiple-cycle and pipelined implementations
47
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13EC417 Discrete and Integrated Analog
Circuits 3 0 0 3 50 50 100
Course
Objective
To develop a basic understanding of both discrete integrated electronic devices typically
referred to as analog components.
To develop skill in working with these devices i.e. using them in applications to solve
common analog circuit designs and computer interfacing problems.
To develop skill in applying these devices in a project-based course leading toward the
design of an electronic system.
Unit – I RC FILTERS Periods 12
RC loss pass and high pass filters and their response to sinusoidal, step, pulse, Square wave and ramp inputs.
Unit – II TRANSISTORS AT HIGH FREQUENCIES Periods 12
Hybrid π model, Amplifier response at high frequencies, Gain- Bandwidth product, FET at high frequencies.
Low frequency response of RC coupled stage and Multistage amplifiers, Single tuned amplifier, Cascade
(CE-CB pair) amplifier.
Unit – III FEEDBACK AMPLIFIERS AND OP-AMP BASED
OSCILLATORS Periods 12
Classification of amplifiers, Voltage series, Voltage shunt, Current series, Current shunt feedback,
Barkhausen criterion, Phase shift and Wein bridge oscillators, Hartley and Colpitt‟s oscillators, Crystal
oscillators, Frequency stability.
Unit – IV VOLTAGE AND CURRENT TIME BASE GENERATORS Periods 12
Exponential sweep, UJT as a negative resistances switch in sawtooth generators, Miller and Bootstrap time
base generators, A simple current sweep, Linearity correction through adjustment of driving waveforms, A
transistor current time-base generator.
Unit – V A/D AND D/A CONVERTERS Periods 12
D/A converters – Binary Weighted D/A Converter, Ladder type D/A converters, Specifications for D/A
Converters, A/D Converters – Simultaneous A/D converter, Counter type A/D converter, Successive
approximation type A/D converter, Dual slope converter, Comparison of converter types.
Total Periods 60
REFERENCES:
1. Taub & Schilling, “Digital Integrated Electronics”,TMH.
2. Millman & Taub, “Pulse Digital and Switching Waveforms”, TMH.
3. Millman & Halkias, “Integrated Electronics”, McGraw Hill.
4. D. Schilling and C. Belove, “Electronics Circuits: Discrete and Integrated”, McGraw Hill.
5. R. P. Jain, “Modern Digital Electroncis”, TMH.
6. Malvino & Leach, “Digital Principles & Application”, TMH.
Course Outcome Able to design various types of amplifier using Op-amp
Able to design basic timer and analog and digital circuits using Ics
48
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course Code Course Name
Periods Per
Week Credit Maximum Marks
L T P C CA ESE Total
U13IT406 Computer Networks Laboratory 0 0 3 2 50 50 100
Course
Objective To implement the new way of networking concepts and applications in java language.
SUGGESTED EXPERIMENTS:
1. Programs using TCP Sockets (like date and time server & client, echo server &client, etc..)
2. Programs using UDP Sockets (like simple DNS)
3. Programs using Raw sockets (like packet capturing and filtering)
4. Programs using RPC
5. Simulation of sliding window protocols
6. Experiments using simulators (like OPNET)
7. Performance comparison of MAC protocols
8. Performance comparison of Routing protocols
9. Study of TCP/UDP performance
Total Periods 45
Course
Outcome
Understand fundamental underlying principles of computer networking
Understand details and functionality of layered network architecture
Analyze and summarize research literature describing P2P file sharing
system architectures
Understand ethical, legal, security, and social issues related to computer
networking
Participate in a medium scale team project utilizing modern software
development tools
Design and implement a P2P file sharing application utilizing several
application and transport layer protocols
49
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.E. / B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
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++.
SUGGESTED EXPERIMENTS:
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
Able to create the process and synchronize the process
Perform the inter process communication including shared memory,
pipes and messages using UNIX system calls
Perform simulations on FIFO, LRU, OPTIMAL ,Bankers‟ algorithm
50
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester IV
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13EC418 Integrated Circuits Laboratory 0 0 3 2 50 50 100
Course
Objective
Understand the characteristics and frequency response Differential Amplifiers and its
Applications.
Study the concepts of oscillators.
Understand the concepts of A/D and D/A convertors.
SUGGESTED EXPERIMENTS:
Design and test :
1. Inverting Non inverting amplifiers
2. Integrator and Differentiator
3. Instrumentation Amplifiers
4. Differential Amplifiers
5. Active Low pass high pass Band pass filters
6. Comparator clipper and clamper
7. Logarithmic amplifiers
8. A/D and D/A convertor
9. A stable mono stable and Bi stable multivibrators using Op-amp and NE 555
10. Phase shift and Wein bridge Oscillators
11. Design and Simulate above all experiments using OSCAD open source software
Total Periods 45
Course
Outcome
Understand the operating principles of major electronic devices, circuit models and
connection to the physical operation of the devices.
Able to apply this knowledge to the analysis and design of basic circuits.
An ability to design and conduct experiments, as well as to organize, analyzes, and
interprets data.
51
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13EC525 Introduction to Analog & Digital
Communication 3 0 0 3 50 50 100
Course
Objective
To understand analog and digital communication techniques.
To learn data and pulse communication techniques.
To be familiarized with source and Error control coding.
To gain knowledge on multi-user radio communication
Unit – I FUNDAMENTALS OF ANALOG COMMUNICATION Periods 9
Principles of amplitude modulation, AM envelope, frequency spectrum and bandwidth, modulation index and
percent modulation- DSBSC, SSB and VSB signals- Angle modulation - FM and PM waveforms, phase deviation
and modulation index, frequency deviation and percent modulation, Frequency analysis of angle modulated
waves, Bandwidth requirements for Angle modulated waves.
Unit – II DIGITAL COMMUNICATION Periods 9
Amplitude Shift Keying (ASK) – Frequency Shift Keying (FSK) Minimum Shift Keying (MSK) –Phase Shift
Keying (PSK) – BPSK – QPSK – 8 PSK – 16 PSK - Quadrature Amplitude Modulation (QAM) – 8 QAM – 16
QAM – Bandwidth Efficiency– Comparison of various Digital Communication System (ASK – FSK – PSK –
QAM).
Unit – III DIGITAL TRANSMISSION Periods 9
Introduction, Pulse modulation, PCM - PCM sampling, sampling rate, signal to quantization noise rate,
companding - analog and digital - percentage error, delta modulation, adaptive delta modulation, differential
pulse code modulation, pulse transmission - Intersymbol interference, eye patterns.
Unit – IV SOURCE AND ERROR CONTROL CODING Periods 9
Entropy, Source encoding theorem, Shannon fano coding, Huffman coding, mutual information, channel capacity,
channel coding theorem, Error Control Coding, linear block codes, cyclic codes, convolution codes, viterbi
decoding algorithm.
Unit – V MULTI-USER RADIO COMMUNICATION Periods 9
Advanced Mobile Phone System (AMPS) - Global System for Mobile Communications (GSM) - Code division
multiple access (CDMA) – Cellular Concept and Frequency Reuse - Channel Assignment and Hand off -
Overview of Multiple Access Schemes - Satellite Communication - Bluetooth.
Total Periods 45
TEXT BOOKS:
1. Wayne Tomasi, “Advanced Electronic Communication Systems”, 6th Edition, Pearson Education,
2009.
2. Simon Haykin, “Communication Systems”, 4th Edition, John Wiley & Sons, 2004
52
REFERENCES:
1. H.Taub, D L Schilling and G Saha, “Principles of Communication”, 3rd Edition, Pearson
Education, 2007.
2. B. P.Lathi, “Modern Analog and Digital Communication Systems”, 3rd Edition, Oxford
University Press, 2007.
3. B.Sklar, “Digital Communication Fundamentals and Applications”, 2nd Edition Pearson
Education 2007.
Course Outcome
Able to understand the basic concepts of Amplitude Modulation, Frequency
modulation, Phase modulation techniques..
Familiarized with source and Error control coding.
Able to gain knowledge on multi-user radio communication.
53
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT508 Theory of Computation 3 0 0 3 50 50 100
Course
Objective
To introduce the fundamental mathematical and computational principles that are the
foundation of computer science.
To address students‟ misconceptions about computer science theory.
To understand the Regular Expression languages,grammars and Turing machines.
Unit – I FINITE AUTOMATA Periods 9
Introduction- Basic Mathematical Notation and techniques- Finite State systems – Basic Definitions – Finite
Automaton – DFA & NDFA – Finite Automaton with €- moves .
Unit – II REGULAR LANGUAGES Periods 9
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 9
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 9
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 9
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 45
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
54
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT509 Java Programming 3 0 0 3 50 50 100
Course
Objective
To Understand fundamentals of Java programming such as variables, iterative methods,
etc.,
To Understand the fundamentals of programming in Java, including defining classes,
invoking methods, using class libraries.
Be able to use the Java SDK environment to create, run and execute the simple java
programs.
Unit – I INTRODUCTION Periods 9
INTRODUCTION: Features of Java – Anatomy of Java – Data types – Variables and Array – Operators –
Control statements – Classes – Methods – Objects – Inheritance – Packages – Interfaces – Programming
examples
Unit – II INPUT / OUTPUT OPERATIONS Periods 9
INPUT / OUTPUT OPERATIONS: Exploring java.util Package – Collection Interfaces – Collection Classes
– Exploring java.io Package – File – Byte Streams – Character Streams – Serialization
Unit – III ERRORS AND EXCEPTION HANDLING Periods 9
ERRORS AND EXCEPTION HANDLING: Fundamentals – Compile time errors –Run time errors –
Exception types – try catch block – Multiple catch statement – Nested try – Throw – Finally – User defined
exceptions
Unit – IV THREADS Periods 9
THREADS: Java threads – Priorities – Synchronization – Thread class and Runnable interfaces – Creating
threads – Multiple threads – Inter thread communication.
Unit – V APPLETS Periods 9
APPLETS: Applet Basics – AWT classes – Frames – Graphics - AWT controls – Layout managers – Swings –
Programming examples.
Total Periods 45
REFERENCES:
1. Patrick Naughton and Herbert Schildt, “Java 2- The Complete Reference”, Tata McGrawHill, New
Delhi, 2008.
2. Deitel H M and Deitel P I, “Java - How to Program”, Pearson Education, New Delhi, 2008.
3. Hubbard John R, “Schaum‟s outline of Theory and Problems of programming with Java”, Tata
McGrawHill, New Delhi, 2006.
4. E Balagurusamy, “Programming with JAVA”, Tata McGrawHill, New Delhi, 2009.
5. Bruce W. Perry, “ Java Servlet and JSP Cookbook”, O'Reilly Media, 2004
Course Outcome
Able to create Java application programs using sound OOP practices (e.g.,
interfaces and APIs)
Able to design proper program structuring (e.g., by using access control identifies,
automatic documentation through comments, error exception handling)
55
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13EC526 Microprocessor and its Interfacing 3 0 0 3 50 50 100
Course
Objective
To introduce the architecture and programming of 8085 microprocessor.
To introduce the interfacing of peripheral devices with 8085 microprocessor.
To introduce the architecture and programming of 8086 microprocessor.
To introduce the architecture, programming and interfacing of 8051 microcontroller.
Unit – I 8085 CPU Periods 9
8085 Architecture – Instruction set – Addressing modes – Timing diagrams – Assembly language programming –
Counters –Time Delays – Interrupts – Memory interfacing – Interfacing, I/O devices.
Unit – II 8086 CPU Periods 9
Intel 8086 Internal Architecture – 8086 Addressing modes- Instruction set- 8086 Assembly language
Programming–Interrupts.
Unit – III INTERFACING CONCEPTS Periods 9
Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface –
Timer – Keyboard /display controller – Interrupt controller – DMA controller –ADC/DAC interfacing-
Programming and applications.
Unit – IV 8051 MICROCONTROLLER Periods 9
8051 Micro controller hardware- I/O pins, ports and circuits- External memory –Counters and Timers-Serial Data
I/O- Interrupts-Interfacing to external memory and 8255-8051 instruction set – Addressing modes – Assembly
language programming – I/O port programming -Timer and counter programming.
Unit – V BUILDING SYSTEMS Periods 9
Bus Concepts – Bus Standards –The Peripheral Component Interconnect (PCI) Bus – Universal Serial
Bus (USB) – Platform Architectures.
Total Periods 45
TEXT BOOKS:
1. Ramesh S Gaonkar, “ Microprocessor Architecture, Programming and application with 8085”, 4th
Edition, Penram International Publishing, New Delhi, 2000.
2. Mohammed Ali Mazidi and Janice Gillispie Mazidi, “The 8051 Microcontroller and Embedded
Systems”, Pearson Education Asia, New Delhi, 2003.
REFERENCES:
1. A. K. Ray & K. M. Bhurchandi, “Advanced Microprocessors and peripherals-
Architectures, Programming and Interfacing”, TMH, 2002 reprint.
2. Kenneth J Ayala, “The 8051 Microcontroller Architecture Programming and Application”, 2nd Edition,
Penram International Publishers (India), New Delhi, 1996.
Course Outcome
Able to introduce the architecture and programming of 8085 microprocessor.
Able to introduce the interfacing of peripheral devices with 8085 microprocessor.
Able to introduce the architecture and programming of 8086 microprocessor.
Able to introduce the architecture, programming and interfacing of 8051
56
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT510 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 9
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 9
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 Maintance in detail.
Total Periods 45
REFERENCES:
1. R. S. Pressman, “Software Engineering: A Practiioners Approach” , 5th Edn., TMA, New Delhi.
2. I. Sommerville, “Software Engineering” , Pearson Education Publication, 7th ed.
3. J. F. Peters & W. Pedrycz, “Software Engineering”, John Wiley & Sons, Inc. 2000.
4. A.Behforooz & F.J.Hudson, “Software Engineering Fundamentals”, Oxford Univ.Press, New York,
2000.
Course
Outcome
Selection and implementation of different software development process models
Extracting and analyzing software requirements specifications for different projects
Developing some basic level of software architecture/design
57
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT511 Cryptography and Network Security 3 0 0 3 50 50 100
Course
Objective
To introduce the fundamental concepts and techniques in cryptography and network
security
To illustrate the working principles of various Symmetric and Asymmetric Ciphers
To familiarize the various Data integrity algorithms
To realize the potential applications of cryptography in security.
Unit - I INTRODUCTION Periods 9
Computer Security Concepts- OSI Security Architecture- Security Attacks- Security Services- Security
Mechanisms- Model for Network Security- Classical Encryption Techniques- Symmetric Cipher Model-
Substitution Techniques- Transposition Techniques- Rotor Machines- Stegnography- Basic Concepts in Number
Theory and Finite Fields- Divisibility and the Division Algorithm- Euclidean Algorithm- Modular Arithmetic-
Groups, Rings, and Fields- Finite Fields of the Form GF(p)
Unit - II MODERN SYMMETRIC CIPHERS Periods 9
Block Ciphers and the Data Encryption Standard-Block Cipher Principles-The Data Encryption Standard (DES)-
Strength of DES-Differential and Linear Cryptanalysis-Block Cipher Design Principles-Advanced Encryption
Standard- Block Cipher Modes of Operation- Stream Ciphers-RC4
Unit - III ASYMMETRIC CIPHERS Periods 9
Prime Numbers- Fermat's and Euler's Theorems- Testing for Primality- Chinese Remainder Theorem-Discrete
Logarithms- Principles of Public-Key Cryptosystems- RSA Algorithm- Diffie-Hellman Key Exchange- ElGamal
Cryptosystem- Elliptic Curve Arithmetic- Elliptic Curve Cryptography
Unit - IV DATA INTEGRITY ALGORITHMS Periods 9
Cryptographic Hash Functions- Applications of Cryptographic Hash Functions- Secure Hash Algorithm (SHA)-
SHA-3- Birthday Attack- Message Authentication Codes - Security of MACs- Digital Signatures -ElGamal Digital
Signature Scheme- Digital Signature Standard (DSS)
Unit - V APPLICATIONS Periods 9
X.509 Certificates- Kerberos- Data protection in the cloud- Transport Level Security- - Wireless Network Security-
Pretty Good Privacy-IP Security- UNIX Password Encipherment- Protecting ATM Transactions
Total Periods 45
REFERENCES:
1. William Stallings, “Cryptography and network Security”, Pearson, Sixth edition, 2013.
2. Alan G. Konheim, “Computer security & cryptography”, John Wiley & Sons, 2007.
3. Charles P. Pfleeger, Shari Lawrence Pfleeger, “Security in computing”, Prentice Hall of India, Third
Edition, 2006.
4. Wade Trappe, Lawrence C Washington, “Introduction to Cryptography with coding theory”, Pearson,
Second edition, 2007.
Course
Outcome
Implementation of various security algorithm available for security and protection
Analysis of conventional encryption algorithm and key management issues
Better understanding of digital signature and its importance in transaction processing
58
Implement the concept of network security in directory authentication, e-mail.
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course Code Course Name
Periods Per
Week Credit Maximum Marks
L T P C CA ESE Total
U13IT512 Java Programming Laboratory 0 0 3 2 50 50 100
Course
Objective
To provide students with the ability to write programs in Java and apply concepts
described in the Object-Oriented Programming course
To Demonstrate the ability to use Java data types within a Java program.
To Apply Java principles to accomplish data input, output, selection, and repetition
structures.
To Construct arrays within a Java program and Debug simple Java programs, and Design
and display simple Java applets.
SUGGESTED LAB EXPERIENTS:
1. Implementing Object Oriented Concepts.
2. Implementing Control Statements
3. Implementation of Interface and Package program.
4. Implement Program to handle Built-in and User-defined Exception
5. Implement Multithreading concepts.
6. Implementation of Collection interfaces
7. Implementation of Streams Handling concepts.
8. Applet Implementation with AWT Controls.
Total Periods 45
Course Outcome
Construct Java Programs using Fundamental Programming Structures
Create classes that conform to the Interface
Build Java Programs that use Graphical User Interface (GUI) with IO Streams
59
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT513 Software Engineering
Laboratory 0 0 3 2 50 50 100
Course
Objective
To impart state-of-the-art knowledge on Software Engineering and UML in an
interactive manner through the Web
To present case studies to demonstrate practical applications of different concepts
To provide a scope to students where they can solve small, real life problems
SUGGESTED LAB EXPERIENTS:
Theory (10 Hours)
Introductory Lectures on the use of appropriate tools is to be given.
Peer review discussions of deliverables will also be done in theory sessions.
Practical (35 Hours)
Course Objective is to develop a significant software product using sound software engineering principles by
small student groups. Choice of appropriate methodology and standard tools are also expected. The lab will
have deliverables at each milestone of development.
1. Problem Statement / Product Specification.
2. Project Plan – Project Management Tool to be identified and Estimation and Costing to be done.
3. Requirements Document – Specification Tool choice to be justified - In class Review.
4. Design Document – Choice of Methodology to be justified - In class Review.
5. Code and Test Report – Peer review documents of standards adherence to be provided.
6. Demo – Integrated Product or Solution to the problem.
7. Review of the process and analysis of variation from initial plan and estimation.
Total Periods 45
Course Outcome
Can understand the process to be followed in the software development life
cycle
Able to work independently as well as in team manage a project from
beginning to end
60
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester V
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT514 Cryptography Laboratory 0 0 3 2 50 50 100
Course
Objective
To understand the concepts and foundations of computer security, and identify
vulnerabilities of IT systems.
To use basic security tools to enhance system security.
To develop basic security enhancements in stand-alone applications.
SUGGESTED LAB EXPERIENTS:
Implement and Check the Primality Testing Using Cryptographic Concepts
Implement Euclidean algorithm.
Implement Extended Euclidean algorithm.
Implement the algorithms of Classical Encryption Techniques like Ceaser Cipher etc.,
Implementation of Elliptic Curve Cryptosystem
Implement Chinese Remainder Theorem.
Implement RSA public key algorithm
Implement ElGamal Cryptosystem
Implement Diffie-Hellman Key Exchange
Implement AES and DES Cryptographic algorithm concepts
Total Periods 45
Course
Outcome
To understand the various cryptography algorithms and protocols work.
Evaluate security mechanisms using rigorous approaches, including
theoretical derivation, modeling, and simulations.
Formulate research problems in the computer security field.
Clearly present ideas and research results in public key algorithms.
61
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
Course
Code Course Name
Periods /Week Credit Maximum Marks
L T P C CA ESE Total
U13EC635 Digital Signal Processing 3 0 0 3 50 50 100
Course
Objective
To understand the basic concepts of linear and circular convolution.
To analyze the Discrete Fourier transformation (DFT).
To analyze and design an IIR filter design.
To analyze and design FIR filer design.
To study the various applications.
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 (linear and
circular) – Correlation.
Unit - II FREQUENCY TRANSFORMATIONS Periods 9
Introduction to DFT – Properties of DFT – Filtering methods based on DFT – FFT Algorithms
Decimation – in – time Algorithms, Decimation – in – frequency Algorithms – Use of FFT in Linear Filtering
– 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 – (HPF, BPF, BRF) filter design
using frequency translation
Unit - IV FIR FILTER DESIGN Periods 9
Structures of FIR – Linear phase FIR filter – Filter design using windowing techniques, Frequency sampling
techniques – Finite word length effects in digital Filters
Unit – V APPLICATIONS Periods 9
Multi-rate signal processing – Speech compression – Adaptive filter – Musical sound processing – Image
enhancement.sampling methods, design of optimum equiripple linear phase FIR filters, comparison of FIR
and IIR filters.
Total Periods 45
62
TEXT BOOKS:
1. John G. Proakis & Dimitris G.Manolakis, “Digital Signal Processing – Principles, Algorithms &
Applications”, 4th Edition, Pearson education / Prentice Hall, 2007.
2. Emmanuel C.Ifeachor, & Barrie.W.Jervis, “Digital Signal Processing”, 2
nd Edition, Pearson
Education / Prentice Hall, 2002.
REFERENCES:
1. Alan V.Oppenheim, Ronald W. Schafer & Hohn. R.Back, “Discrete Time Signal Processing”,
Pearson Education.
2. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill.
Course Outcome
Able to understand the basic concepts of linear and circular convolution.
Able to analyze the Discrete Fourier transformation (DFT).
Able to design an IIR and FIR filter design.
63
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
Course
Code Course Name
Periods Per
Week Credit Maximum Marks
L T P C CA ESE Total
U13IT615 Object Oriented Analysis & Design 3 0 0 3 50 50 100
Course
Objective
To develop a working understanding of formal object-oriented analysis and design
processes
To develop an appreciation for and understanding of the risks inherent to large-scale
software development
To learn (through experience!) Techniques, processes, and artifacts that can mitigate
these risks.
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. Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object Modeling
Language”, Third edition, Addison Wesley, 2003.
4. Erich Gamma, and Richard Helm, Ralph Johnson, John Vlissides, “Design patterns:
Elements of Reusable Object-Oriented Software”, Addison-Wesley, 1995.
5. Paul C. Jorgensen, “Software Testing:- A Craftsman‟s Approach”, Third Edition,
Auerbach Publications, Taylor and Francis Group, 2008.
Course outcomes
Design and implement projects using OO concepts.
Use the UML analysis and design diagrams.
Apply appropriate design patterns.
64
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT616 Internet & Web Technology 3 0 0 3 50 50 100
Course
Objective
To Understand the major protocols for internetworking in today‟s Internet
To Understand client-server architecture and to perform basic website design
To Perform basic client side programming and server side programming
Unit – I Internet Periods 9
Introduction, Evolution of Internet, Internet Applications,Internet Protocol -TCP/IP, UDP, HTTP, Secure
Http(Shttp) Internet Addressing – Addressing Scheme – Ipv4 & IPv6, Network Byte Order, Domain
Name Server and IP Addresses, Mapping .Internet Service Providers, Web Technologies: Three Tier Web
Based Architecture; Jsp, Asp, J2ee, .Net Systems
Unit – II HTML and CSS Periods 9
HTML – Introduction, Sgml, Dtd(Document Type Definition, Basic Html Elements, Tags and usages, HTML
Standards , Issues in HTML Dhtml: Introduction Cascading Style Sheets: Syntax ,Class Selector, Id Selector
Dom (Document Object Model) & Dso (Data Source Object) Java Script – Java Script Object Model,
Variables-Constant – Expressions, Conditions- Relational Operators- Data Types – Flow Control – Functions
& Objects-events and eventhandlers
Unit – III XML Periods 9
What is XML – Basic Standards, Schema Standards, Linking & Presentation Standards, Standards that build
on XML, Generating XML data, Writing a simple XML File, Creating a Document type definition,
Documents & Data ,Defining Attributes & Entities in the DTD , Resolving a naming conflict, Using
Namespaces
Unit – IV Security and Firewalls Periods 9
Security Threats From Mobile Codes, Types Of Viruses, Client Server Security Threats, Data & Message
Security, Various electronic payment systems, Introduction to EDI, Challenges–Response System, Encrypted
Documents And Emails , Firewalls: Hardened Firewall Hosts, Ip- Packet Screening, Proxy Application
Gateways, Aaa (Authentication , Authorization And Accounting).
Unit – V Web Security and Applications Periods 9
Introduction, Web Page Lay-Outing, Where To Host Site, Maintenance Of Site, Registration Of Site On
Search Engines And Indexes, Introduction To File Transfer Protocol, Public Domain Software, Types Of Ftp
Servers (Including Anonymous),Ftp Clients Common Command. Telnet Protocol, Server Domain, Telnet
Client, Terminal Emulation. Usenet And Internet Relay Chat
Total Periods 45
REFERENCES:
1. Daniel Minoli , “Internet & Intranet Engineering”, TMH.
2. S. Raj Kamal , “Interrnet and Web Technology”, Tata McGraw Hill, New Delhi, 2002.
3. Alexis Leon and Mathews Leon , “Internet for Every One”, Tech World.
4. Eric Ladd, Jim O‟Donnel –“Using HTML 4, XML and JAVA”,Prentice Hall of India ,1999.
Course Outcome
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.
65
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT617 Principles of Multimedia 3 0 0 3 50 50 100
Course
Objective
To Provide an in-depth understanding of Interactive Multimedia Design
To Promote creative and innovative approaches to design and problem solving and to
develop analytical, critical and reflective thinking skills
Unit – I MULTIMEDIA-AN OVERVIEW Periods 9
Multimedia-An Overview: Introduction, Multimedia presentation and production, Characteristics of a
multimedia presentation, Multiple media, Utilities of multisensory perception, Hardware and Software
requirements, Uses of multimedia, Promotion of multimedia based content, Steps for creating a multimedia
presentation. Digital Representation: Introduction, Analog representation, Waves, Digital representation,
Need for digital representation, Analog to Digital conversion, Digital to Analog conversion, Relation between
sampling rate and Bit Depth, Quantization error, Fourier representation, Pulse modulation, Importance and
drawbacks of digital representation.
Unit – II TEXT & IMAGES Periods 9
Text: Introduction, Types of text, Unicode standard, Font, Insertion of text, Text compression, File formats.
Images: Introduction, Image types, Seeing color, Color models, Basic steps for image processing, Scanner,
Digital camera, Interface standards, Specifications of digital images, Color management system(CMS),
Device independent color models, Gamma and Gamma correction, Image processing software, File formats,
Image output on monitor, Image output on printer.
Unit – III ANIMATION TECHNIQUES Periods 9
Introduction, Historical background, Uses of Animation, Keyframes and Tweening, Types of Animation,
Computer assisted animation, Creating movement, Principles of animation, Some techniques of animation,
Animation on the web, 3D animation, Camera, Special effects, Creating animation, Rendering algorithms.
Unit – IV COMPRESSION TECHNIQUES Periods 9
Introduction, CODEC, Types of compression, Types of redundancies, Lossless/Statistical compression
techniques, GIF image coding standard, Lossy/Perceptual compression techniques, JPEG image coding
standard, MPEG standards overview, MPEG-1 Audio, MPEG-1 Video, MPEG-2 Audio, MPEG-2 Video,
MPEG-4, MPEG-7, Fractals.
Unit – V MULTIMEDIA ARCHITECTURE Periods 9
Multimedia Architecture: Introduction, User interfaces, Windows multimedia support, Hardware support,
Distributed multimedia applications, Real-time protocols, Playback Architectures, Streaming technologies,
Temporal relationships, Synchronization, Multimedia database systems(MMDBS), Feature extraction of
image, Feature extraction of audio, Feature of extraction of video, Benchmarking of MMDBS.
Total Periods 45
REFERENCES:
1. R. Parekh – Principles of Multimedia, 2nd Edition, TMH, New Delhi, 2006.
2. R.Steinmetz & K. Nahrstedt- Multimedia: Computing, Communications and Applications, Pearson
Edn., New Delhi, 2006.
3. P.K.Audleigh & K.Thakrar- Multimedia Systems Design, PHI, New Delhi, 2005.
Course Outcome Deploy the right multimedia communication models.
Develop the real-time multimedia network applications.
66
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT618 Information & Coding Theory 3 1 0 4 50 50 100
Course
Objective
To equip students with the basic understanding of the fundamental concept of entropy
and information as they are used in communications.
To enhance knowledge of probabilities, entropy, measures of information.
Unit – I SOURCE CODING Periods 9
Source Coding: Definitions and Examples, Uniquely Decodable Codes, Instantaneous Codes, Constructing
Instantaneous Codes, Kraft‟s Inequality, McMillan‟s Inequality, Comments on Kraft‟s and McMillan‟s
Inequalities.
Unit – II ENTROPY & OPTIMAL CODING Periods 9
Optimal Codes: Optimality, Binary Huffman Codes, Average Word-length of Huffman Codes, Optimality of
Binary Huffman Codes, r-ary Huffman Codes, Extensions of Sources.
Entropy: Information and Entropy, Properties of the Entropy Function, Entropy and Average Word-length,
Shannon-Fano Coding, Entropy of Extensions and Products, Shannon‟s First Theorem, An Examples of
Shannnon‟s First Theorem.
Unit – III INFORMATION CHANNELS Periods 9
Information Channels: Notation and Definitions, The Binary Symmetric Channel, System Entropies,
System Entropies for the Binary Symmetric Channel, Extension of Shannon‟s first Theorem to Information
Channels, Mutual Information, Mutual Information for the Symmetric Channel, Channel Capacity.
Unreliable Channel: Decision Rules, An Examples of Improved Reliability, Hamming Distance, Statement
and Outline Proof of Shannon‟s Theorem, The Converse of Shannon‟s Theorem, Comments on Shannon‟s
Theorem.
Unit – IV ERROR- CORRECTING CODES Periods 9
Error- correcting Codes: Introductory Concepts, Examples of Codes, Minimum Distance, Hamming‟s
Sphere-packing Bound, The Gilbert – Varshamov Bound, Hadamard Matrices and Codes.
Unit – V LINEAR CODES Periods 9
Linear Codes: Matrix Description of Linear Codes, Equivalence of Linear Codes, Minimum Distance of
Linear Codes, The Hamming Codes, The Golay Codes, The Standard Array, Syndrome Decoding.
Total Periods 45
REFERENCES:
1. G.A.Jones & J.M.Jones-Information and Coding Theory, 3rd Edition, Springer Publication, New
Delhi, 2000.
2. R.Bose- Information Theory, Coding and Cryptography, TMH, New Delhi, 2002.
3. R.W. Hamming- Coding and Information Theory, Prentice-Hall, New Jersy, 1980.
Course Outcome
Apply the implications and consequences of fundamental theories and laws of
information theory and coding theory with reference to the application in
modern communication and computer systems
67
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT619 Multimedia Laboratory 0 0 3 2 50 50 100
Course
Objective
To learn different multimedia formats and use the different media to create
applications
To understand basic concepts related to Multimedia including data standards,
algorithms and software
SUGGESTED LAB EXPERIMENTS:
1. Write a program to justify a text entered by the user on both left and right hand side. For example the
test An architect may have a graphics program to draw an entire building but be interested in only
ground floor”, can be justified in 30 columns. An architect may have a graphics programs draw an
entire building but interested in ground floor.
2. Study the notes of a piano and stimulate them using the keyboard and store them in file.
3. Write a program to read a paragraph and store it to a file name suggested by the author.
4. Devise a routine to produce the animation effect of a square transforming to a triangle and then to a
circle.
5. Write a program to show a bitmap image on your computer screen.
6. Create a web page for a clothing company which contains all the details of that company and atleast
five links to other web pages.
7. Write a program by which we can split mpeg video into smaller pieces for the purpose of sending it
over the web or by small capacity floppy diskettes and then joining them at the destination.
8. Write a program to simulate the game of pool table.
9. Write a program to simulate the game mine sweeper.
10. Write a program to play “wave” or “midi” format sound files.
Total Periods 45
Course Outcome
Implement the deeper knowledge of display systems, image synthesis, shape
modeling of 3D application.
Develope a multimedia software by utilizing existing libraries and descriptions of
algorithms
68
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT620 Internet & Web Technology
Laboratory 0 0 3 2 50 50 100
Course
Objective
To learn Markup languages and Style Sheets for web design
To familiarize with Client-Side Programming and host objects
To explore Client-Side Programming and Server-Side Programming
To discover the use of XML
To learn about web services
SUGGESTED LAB EXPERIMENTS:
1. Web page design using HTML.
2. Apply Cascading style sheets to web pages.
3. Use JavaScript to Validate Web Forms.
4. Create interactive web pages using DOM.
5. Server side programming using Servlet.
6. Use JSP for web application development.
7. Write XML and process it using XSLT or JAXP.
8. Develop web services.
Total Periods 45
Course Outcome
Validate XML code and associated DTDs and schemas using a XML editing tool
so that the XML code can be used within business and health care industries
Write and maintain HL7 segments at an elementary level for an entry level
position in the Health Care Industry.
69
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VI
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13EN603 Communication Skills & Career
Development Practices Laboratory 0 0 3 2 50 50 100
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.
Total periods 45
REFERENCES:
1. Anderson, P.V, “Technical Communication”, Thomson Wadsworth, Sixth 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
70
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VII
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT721 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
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).
71
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VII
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT722 Wireless Communication & Networks 3 0 0 3 50 50 100
Course
Objective
To endow with the knowledge required to understand emerging communication
networks
To describe the basic concepts and principles in mobile computing
To understand the structure and components for mobile ip and mobility
management.
Unit – I CHARACTERIZATION OF THE WIRELESS CHANNEL Periods 9
Multipath Propagation Environment, Linear Time-Variant Channel Model, Channel Correlation Functions,
Large-Scale Path Loss and Shadowing, Small-Scale Multipath Fading.
Unit – II BANDPASS TRANSMISSION TECHNIQUES FOR MOBILE
RADIO Periods 9
Introduction, Signal Space and Decision regions, Digital Modulation, Power Spectral Density, Probability of
Transmission Error.
Unit – III FUNDAMENTALS OF CELLULAR COMMUNICATIONS Periods 9
Frequency Reuse and Mobility Management, Cell Cluster Concept, Cochannel and Adjacent Channel
Interference, Call Blocking and Delay at the Cell-Site.
Unit – IV MOBILITY MANAGEMENT IN WIRELESS NETWORKS Periods 9
Introduction, Call Admission Control (CAC), Handoff Management, Location Management for Cellular
Networks, Location Management for PCS Networks, Traffic Calculation.
Unit – V WIRELESS/WIRELINE INTERWORKING Periods 9
Mobile IP, Internet Protocol (IP), Transmission Control Protocol (TCP), Network Performance, Wireless
Application Protocol (WAP), Mobile AD HOC Networks.
Total Periods 45
REFERENCES:
1. J.W. Mark & W.Zhuang ,“Wireless Communications and Networking”, Pearson Education, New
Delhi – 2007.
2. W.Stallings ,”Wireless communications & Networks”, 2/e, Pearson Education, New Delhi- 2007.
Course Outcome
Implementing the basics of Wireless Communication Networks.
Able to pursue research in the area of wireless communication.
72
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VII
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT723 Parallel & Distributed Computing 3 0 0 3 50 50 100
Course
Objective
To learn how to design parallel programs and how to evaluate their execution
To understand the characteristics, the benefits and the limitations of parallel systems
and distributed infrastructures
To expose students to writing code in different parallel programming environments.
Unit – I INTRODUCTION Periods 9
A brief history, Communications and computer networks, Operating systems for distributed and parallel
computing, The client-server model, Distributed database systems, Parallel programming languages and
algorithms.
Unit-II COMPUTER ORGANIZATION FOR PARALLEL AND
DISTRIBUTED COMPUTING: Periods 9
Pipeline and vector processors, Multicomputers and computer networks, Multiprocessors, Massively parallel
architecture, Non-von Neumann-type computers, Cache architectures in multiprocessors.
Communications, Computer network architecture Network topology, Network interconnection, Integrated
Services Digital Network (ISDN), Asynchronous Transfer Mode, Wireless computing.
Unit – III OPERATING SYSTEMS FOR DISTRIBUTED AND PARALLEL
COMPUTING Periods 9
Network operating systems, Distributed operating systems, Operating systems for parallel computing,
Distributed and Parallel system modeling, Example systems.
Unit – IV DISTRIBUTED COMPUTING Periods 9
Introduction – Distributed Systems, Theory of Distributed Computing, Formal models for Message – passing
systems, Broadcast and Converge Cast on a Spanning Tree, Flooring and Building a Spanning Tree,
Constructing DFS Spanning Tree for a Specified Root and without a Specified Root, The Leader Election
Problems, Anonymous Rings, Asynchronous and Synchronous Rings
Unit – V MUTUAL EXCLUSION IN SHARED MEMORY Periods 9
Formal model for shared memory systems, The Mutual Exlusion Problem, Mutual Exclusion Problem,
Mutual Exclusion using powerful Primitives and R/W registers.
Fault Tolerant Concensus: Synchronous systems with Crash and Byzantine Failures, Impossibility in a
synchronous systems.
Causality and Time: Capturing Causality, Examples of using causality, Clock synchronization.
Total Periods 45
REFERENCES:
1. J.M. Crichlow , “An Introduction to Distributed and parallel computing”, 2/e PHI, New Delhi–
2002.
2. H.Attiya & J. Welch , “Distributed Computing”, 2/e John Wiley, India Edition, 2006
Course Outcome
Able to write the portable program for parallel & distributed
architecture using MPI library
Evaluate the impact of network topology on parallel/distributed
algorithm formulations and traffic their performance
Gain hand-on experience with the agent-based and internet-based
73
parallel and distributed programming techniques
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
epartment INFORMATION TECHNOLOGY Semester VII
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT724 Computer Graphics 3 0 0 3 50 50 100
Course
Objective
To provide a comprehensive introduction to computer graphics leading to the ability
to understand contemporary terminology, progress, issues, and trends.
A thorough introduction to computer graphics techniques, focusing on 3D modeling,
image synthesis, and rendering
To train the students to acquire skills in generating marketable computer graphics and
animated pictures, especially in the area of advertisements.
To train the students to acquire skills and mastery in the use of different
software producing graphics and animation.
Unit – I INTRODUCTION AND OVERVIEW OF GRAPHICS SYSTEMS Periods 9
Use of Computer graphics, Video Display Devices, Refresh Cathode-Ray Tubes, Raster and Random Scan
Displays, Color CRT Monitors, Direct View Storage Tubes, Flat Panel Displays, 3D Viewing Devices,
Stereoscopic and Virtual Reality Systems, Raster and Random Scan Systems, Different Input and Hard Copy
Devices, Graphics Softwares.
Output Primitives: Points and Lines, Line Drawing Algorithms (DDA and Bresenham‟s), Circle and Ellipse
Generating Algorithms, Conic Sections.
Unit – II 2D GEOMETRIC TRANSFORMATIONS Periods 9
Different types of transformations and their matrix representations, Homogeneous Coordinates, Composite
Transformations, transformations between Coordinate Systems, Affine transformations, Window-to-Viewport
Coordinate transformation, Clipping-Point, Line, Polygon, Curve and Text Clipping.
Unit – III 3D CONCEPTS AND OBJECT REPRESENTATION Periods 9
3D Display Methods, Polygon Surfaces, Curved Lines and Surfaces, Quadric Surfaces, Spline
Representations, Cubic Spline interpolation methods, Bezier Curves and Surfaces.
Unit – IV 3D TRANSFORMATIONS AND VIEWING Periods 9
Translation, Rotation, Scaling, Reflection, Shears, Composite Transformations, Projections- Parallel and
Perspective, Projection Transformations, Clipping.
Unit – V VISIBLE SURFACE DETECTION METHODS Periods 9
Classification of Visible Surface Detection Algorithms, Back Face Detection, Depth Buffer Method, A-Buffer
Method, Scan-Line Method, Depth Sorting Method, BSP-Tree Method & Area Subdivision Method.
Illumination Models and Surface Rendering: Light Sources, Basic Illumination Models, Polygon- Rendering
Methods.
Total Periods 45
74
REFERENCES:
1. D. Hearn & M.P. Baker , “Computer Graphics”, 2/e, Pearson Education, New Delhi, 2005.
2. W.M. Newman. , “Principle of Interactive Computer Graphics” , Mc Graw Hill Publication, New
Delhi, 1995.
3. S. Harrington -Computer Graphics, “A Programming Approach”, Mc Graw Hill Publication, New
Delhi, 1994.
4. J.D. Foley , “A Fundamental of Computer Graphics”,Addition Wesley, London, 1993.
Course Outcome
Able to describe the general software architecture of programs that use 3D
computer graphics.
Better understanding the hardware system architecture for computer graphics
pipeline, frame buffers, and graphic accelerators/co-processors.
Know to use a current 3D graphics API (e.g., OpenGL or DirectX).
Able to use the underlying algorithms, mathematical concepts, supporting
computer graphics.
75
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VII
Course
Code Course Name
Periods Per
Week Credit Maximum Marks
L T P C CA ESE Total
U13IT725 Parallel & Distributed Computing
Laboratory 0 0 3 2 50 50 100
Course
Objective
To understand the characteristics,benefits and limitations of parallel systems To expose students to writing code in different parallel programming environments
SUGGESTED LAB EXPERIMENTS:
1. How to use a Java-based TCP communication through a design of chat client and server program
2. Write a Parallel-computing application using MPI Java
3. Compare RMI and mobile agents in terms of programmability and performance.
4. Construct DFS Spanning Tree for a Specified Root and without a Specified Root under Parallelism
Concepts.
5. Implement the Leader Election Algorithm and Provide the Solution for electing a leader among a
group of processes whose communication pattern is arranged in a ring.
6. Write a parallel program that calculates the value of PI using integral method.
7. Design a program to calculate prefix sum of „n‟ numbers on „n‟ processes. Use MPI_Scan to address
this problem.
8. Write a parallel program having the non blocking processes communications which calculates the sum
of numbers in parallel on different numbers of nodes. Also calculate the execution time.
9. Write a program that calculates the sum and multiplication of numbers in parallel on different number
of nodes
10. Demonstrate the matrix multiplication in MPI_Bcast.
11. Write a parallel program and broadcast it on different nodes.
Total periods 45
Course Outcome
Devise parallel and distributed database that suits given application
constraints
Synthesize object oriented and object relational database for given scenario
Formulate database for web applications
76
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VII
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13IT726 Computer Graphics Laboratory 0 0 3 2 50 50 100
Course
Objective
To learn basic and fundamental computer graphics techniques;
To learn image synthesis techniques;
To examine applications of modelling, design and visualization.
SUGGESTED LAB EXPERIMENTS:
Practical (35 Hours)
1. Drawing Geometric Primitives - case studies.
2. Create simple models.
3. Interactive Transformations and Projections
4. Parsing simple mesh file formats
5. Rendering meshes.
Case Study: Model a scene, Place lights on the scene, render shadows and texture models.
Total periods 45
Course
Outcome
Implement the graphics 2D primitives
Demonstrate geographical transformations in graphical applications
77
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester VIII
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13BA804 Principle of Management 3 0 0 3 50 50 100
Course
Objective
To gain a basic understanding of principles of management including planning,
organizing and controlling.
To gain a basic understanding of concepts for managing people including human
resources, motivation, leading, and communications.
To improve your ability to examine managerial issues and problems and to develop
feasible alternatives that can result in better decision-making.
To develop an awareness of multiple approaches that can be used to resolve
managerial issues and problems.
Unit – I CONCEPTS OF MANAGEMENTS Periods 9
Definition, nature and scopes, overall view of Management, Relation with other social sciences and industry.
Unit – II EVOLUTION OF MANAGEMENT THOUGHT Periods 9
Classical theory of management, Bureaucracy -Introduced by Max Weber, Scientific Management-F.W.
Taylor and his followers, Process Management-Introduced B.H. Fayol and others, NCO-classical theory of
management, aluman Relations-B.E. May and Roethlisberger, Behavioral Science approach-By Mc Gregor
Maslow and others, Modern Management theories peter Drucker.
Unit – III MANAGEMENT FUNCTIONS Periods 9
Planning, Organisation, staffing, Directing and controlling.
Executive Functions: Production, Marketing, Finance, Personnel.
Planning: Concept, Nature, Importance, Course Objectives, Policies, Procedure, strategies, and Method of
Decision-Making.
Unit – IV ORGANISATIONS Periods 9
Definition, Theories of Organisation, Forms of Organisation, Formal and Informal Organisation, Type of
formal organisations, Departmentation, Line and Staff Relationship, Span of Decentralisation, Committees.
Unit – V STAFFING, DIRECTING & CONTROLLING Periods 9
Staffing: Selection, Recruitment, raining, Development and Welfare.
Directing: Leadership and Supervision, Motivation and communication.
Controlling: The elements, process and style of Control, techniques of control.
Total Periods 45
78
REFERENCES:
1. Koontz, “ Principle of Management Essentials of management”.
2. Theo Haiman , “Management theory and Practice”.
3. Drucker P.F , “Management-Task and Responsibility”.
4. Drucker P.F, “ The Practice of Management”.
5. Newman , “ Process of Managements”.
6. Beach E.F.L, “ The Principle and Practical Management Chapter 1”
7. Merril H.F , “ Classics in Management Preface”.
Course Outcome
Evaluate the global context for taking managerial actions of planning,
organizing and controlling.
Assess global situation, including opportunities and threats that will
impact management of an organization.
Can integrate management principles into management practices.
Able to assess managerial practices and choices relative to ethical
principles and standards.
79
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE01 Embedded System Design 3 0 0 3 50 50 100
Course
Objective
Have a knowledge about rigorous analysis of a given problem, while taking into
account the classical constraints of an embedded
Have an ability to implement the designed system, according to the model centric
design.
Unit – I EMBEDDED COMPUTING Periods 9
Challenges of Embedded Systems – Embedded system design process. Embedded processors – ARM
processor – Architecture, ARM and Thumb Instruction sets
Unit – II EMBEDDED C PROGRAMMING Periods 9
C-looping structures – Register allocation – Function calls – Pointer aliasing – structure arrangement –
bit fields – unaligned data and endianness – inline functions and inline assembly – portability issues.
Unit – III OPTIMIZING ASSEMBLY CODE Periods 9
Profiling and cycle counting – instruction scheduling – Register allocation – conditional execution –
looping constructs – bit manipulation – efficient switches – optimized primitives.
Unit – IV PROCESSES AND OPERATING SYSTEMS Periods 9
Multiple tasks and processes – Context switching – Scheduling policies – Inter-process communication
mechanisms – Exception and interrupt handling - Performance issues.
Unit – V EMBEDDED SYSTEM DEVELOPMENT Periods 9
Meeting real time constraints – Multi-state systems and function sequences. Embedded software
development tools – Emulators and debuggers. Design methodologies – Case studies – Complete design of
example embedded systems.
Total Periods 45
REFERENCES:
1. Andrew NSloss, D. Symes, C. Wright, ” ARM System Developers Guide”, Morgan
Kaufmann / Elsevier, 2006.
FURTHER READINGS:
1. Michael J. Pont, “Embedded C”, Pearson Education , 2007.
2. Wayne Wolf, “Computers as Components : Principles of Embedded Computer System
Design”,Second Edition, Morgan Kaufmann / Elsevier, 2008.
3. Steve Heath, “Embedded System Design” ,Second Edition, Elsevier, 2003.
Course Outcome
Able to implement combinatorial logic and sequential systems in terms of
basic digital building blocks using simulation software.
Can design, test and critically of embedded solutions in real world
situations using digital components (sequential and combinatorial).
Can develop software systems for embedded devices using assembler
code.
80
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE02 Middleware Technologies 3 0 0 3 50 50 100
Course
Objective
To Understand different types of client server computing models and also Benefits of
client server computing, pitfalls of client server programming
To establish communication between client and server through java RMI and JDBC
To carry out client server communication using heterogeneous programming
languages using CORBA
To design a dynamic remote application with RMI and JDBC Connectivity
Unit – I INTRODUCTION Periods 9
Publish/Subscribe matching algorithm, event based systems, notification filtering mechanisms, Composite
eventprocessing, content based routing, content based models and matching, matching algorithms, distributed
hash tables(DHT)
Unit – II ROUTING Periods 9
Distributed notification routing, content based routing algorithms, engineering event based systems,
Accessing publish/subscribe functionality using APIs.
Unit – III SCOPING Periods 9
Scoping, event based systems with scopes, notification mappings, transmission policies, implementation
strategies for scoping.
Unit – IV EVENT DETECTION Periods 9
Composite event detection, detection architectures, security, fault tolerance, congestion control, mobility,
existing notification standards- JMS, DDS, HLA.
Unit – V TOPIC BASED & COMMERCIAL SYSTEMS Periods 9
Topic based systems, Overlays, P2P systems, overlay routing, Case studies- REBECA, HERMES, Gryphon.
Commercial systems- IBM Websphere MQ, TIBCO Rendezvous.
Total Periods 45
REFERENCES:
1. GeroMuhl, LudgerFiege, Peter R. Pietzuch, “Distributed Event Based Systems”, Springer, 2006
2. Chris Britton and Peter Bye, “IT Architectures and Middleware”, Pearson Education, (2/e), 2005
3. YanleiDiao, and Michael J. Franklin, “Query Processing for High-Volume XML Message
Brokering”, VLDB2003.
4. Chee-Yong Chan, Minos Garofalakis and Rajeev Rastogi, “RE-Tree: An Efficient Index Structure
for RegularExpressions”, VLDB 2002
5. Peter R. Pietzuch, Brian Shand, Jean Bacon. “A Framework for Event Composition in Distributed
Systems”,Proc. of the 4th Int. Conf. on Middleware (MW'03)
Course Outcome
Able to develop a client server communicating environment
Can design a dynamic remote application with RMI and JDBC
Connectivity
Can understand the differentiationof homogeneous and heterogeneous
communications
81
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE03 Cloud Computing 3 0 0 3 50 50 100
Course
Objective
To impart fundamental concepts in the area of cloud computing
To understanding the systems, protocols and mechanisms to support cloud
computing
To Understanding the hardware necessary for cloud computing
To design and implement a novel cloud computing applications
Unit – I MODULE – 1 Periods 9
New Computing Paradigms & Services: Cloud computing , Edge computing , Grid computing , Utility
computing ,Cloud Computing Architectural Framework,
Unit – II MODULE – II Periods 9
Cloud Deployment Models, Virtualization in Cloud Computing, Parallelization in Cloud Computing, Security
for Cloud Computing, Cloud Economics , Metering of services
Unit – III MODULE – III Periods 9
Cloud Service Models: Software as a Service (SaaS), Infrastructure as a Service (IaaS), Platform as a Service
(PaaS),Service Oriented Architecture (SoA), Elastic Computing, On Demand Computing, Cloud Architecture,
Introduction toVirtualization
Unit – IV MODULE – IV Periods 9
Types of Virtualization, Grid technology , Browser as a platform, Web 2.0, Autonomic Systems, Cloud
ComputingOperating System, Deployment of applications on the cloud, Case studies- Xen, VMware,
Eucalyptus, Amazon EC2.
Unit – V MODULE - V Periods 9
Introduction to Map Reduce, Information retrieval through Map Reduce, Hadoop File System, GFS, Page
Rankingusing Map Reduce, Security threats and solutions in clouds, mobile cloud computing, Case studies-
Ajax, Hadoop.
Total Periods 45
REFERENCES:
1. Tom White, “Hadoop: The Definitive Guide”, O'Reilly Media, 2009
2. Jason Venner, “Pro Hadoop”, Apress, 2009
3. Timothy Chou , “Introduction to cloud computing & Business”, Active Book Press, 2010
Course Outcome Can develop the application for cloud computing
Clear understanding for the hardware necessary for cloud computing
82
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE04 Data Warehousing & Data Mining 3 0 0 3 50 50 100
Course
Objectives
To understand Data mining principles and techniques and introduce Data Mining as a
cutting edge business intelligence.
To study the overview of developing areas – Web mining, Text mining and ethical
aspects of Data mining.
Unit – I DATA WAREHOUSE Periods 9
Data Warehousing - Operational Database Systems vs. Data Warehouses - Multidimensional Data Model -
Schemas for Multidimensional Databases – OLAP Operations – Data Warehouse Architecture – Indexing –
OLAP queries & Tools.
Unit – II DATA MINING & DATA PREPROCESSING Periods 9
Introduction to KDD process – Knowledge Discovery from Databases - Need for Data Preprocessing – Data
Cleaning – Data Integration and Transformation – Data Reduction – Data Discretization and Concept
Hierarchy Generation.
Unit – III ASSOCIATION RULE MINING Periods 9
Introduction - Data Mining Functionalities - Association Rule Mining - Mining Frequent Itemsets with and
without Candidate Generation - Mining Various Kinds of Association Rules - Constraint- Based Association
Mining.
Unit – IV CLASSIFICATION & PREDICTION Periods 9
Classification vs. Prediction – Data preparation for Classification and Prediction – Classification by Decision
Tree Induction – Bayesian Classification – Rule Based Classification – Classification by Back Propagation –
Support Vector Machines – Associative Classification – Lazy Learners – Other Classification Methods –
Prediction – Accuracy and Error Measures – Evaluating the Accuracy of a Classifier or Predictor – Ensemble
Methods – Model Section.
Unit – V CLUSTERING Periods 9
Cluster Analysis: - Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods –
Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model-Based
Clustering Methods – Clustering High- Dimensional Data – Constraint- Based Cluster Analysis – Outlier
Analysis.
Total Periods 45
REFERENCES:
1. Jiawei Han and MichelineKamber, “Data Mining Concepts and Techniques” Second Edition,
Elsevier, Reprinted 2008.
2. K.P. Soman, ShyamDiwakar and V. Ajay, “Insight into Data mining Theory and Practice”, Easter
Economy Edition, Prentice Hall of India, 2006.
3. G. K. Gupta, “Introduction to Data Mining with Case Studies”, Easter Economy Edition, Prentice
Hall of India, 2006.
Course Outcome
Ability to do OLAP applications through physical and logical design
Have a knowledge of data mining
Able to design data mart for management regarding client requirement
83
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE05 C # & .Net Programming 3 0 0 3 50 50 100
Course
Objective
Understand the foundations of CLR execution
Learn the technologies of the .NET framework
Know the object oriented aspects of C#
Be aware of application development in .NET
Learn web based applications on .NET(ASP.NET)
Unit – I INTRODUCTION TO C# Periods 9
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 9
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 9
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 9
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 9
Assemblies, Versoning, Attributes, reflection, viewing meta data, type discovery, reflection on type,
marshalling, remoting, security in .NET
Total Periods 45
REFERENCES:
1. Herbert Schildt, “The Complete Reference: C# 4.0”, Tata McGraw Hill, 2012.
2. Christian Nagel ,“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
Explain how C# fits into the .NET platform.
Analyze the basic structure of a C# application
Can develop programs using C# on .NET
Can design and develop Web based applications on .NET
84
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE06 Principles of Programming
Languages 3 0 0 3 50 50 100
Course
Objective
To understand the concept of Interfaces, Packages
To understand the concept of Exception Handling and Multithreading
To understand the concept of Applets and AWT
Unit – I MODULE - I Periods 9
Programming Languages: Concepts and Constructs. Untyped Arithmetic Expressions – Introduction,
Semantics, Evaluation.
Unit – II MODULE – II Periods 9
Untyped Lambda Calculus – Basics, Semantics. Programming in Lambda Calculus
Unit – III MODULE – III Periods 9
Typed Arithmetic Expressions – Types and Typing relations, Type Safety.
Unit – IV MODULE – IV Periods 9
Simply Typed Lambda Calculus – Function types, Typing relations, Properties of typing.
Unit – V MODULE - V Periods 9
Extensions to Simply Typed Lambda Calculus – Unit type, Let bindings, Pairs, Records, Sums, Variants,
References, Exceptions.
Total Periods 45
REFERENCES:
1. Benjamin C. Pierce, “Types and Programming Languages”, MIT Press, 2002
2. David A. Schmidt, “Programming Language Semantics”.
3. Luca Cardelli, Allen B. Tucker, “Handbook of Computer Science and Engineering”, CRCPress,
1996.
4. Michael L. Scott, “ Programming Language Pragmatics”, Elsevier (2/e), 2004
Course
Outcome
Can able to find practical solutions to the problems
Can solve specific problems alone or in teams
Can manage a project from beginning to end
Can work independently as well as in teams
Can define, formulate and analyse a problem
85
VIVEKANANDHA COLLEGE OF ENGINEERING FORWOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE07 Soft computing 3 0 0 3 50 50 100
Course
Objective
To understand the concept of Interfaces, Packages
To understand the concept of Exception Handling and Multithreading
To understand the concept of Applets and AWT
Unit – I INTRODUCTION Periods 9
Soft Computing Concept Explanation - Importance of Tolerance of Imprecision and Uncertainty -
Biological and Artificial Neuron - Neural Networks - Adaline - Perceptron - Back Propagation Neural
Networks - Feed forward Multilayer Networks
Unit – II NEURAL NETWORKS Periods 9
Types of Neural Networks - Competitive Learning - Kohonen Maps - CPN - ART - Neocognitron Neural
Networks - Neural Networks as Associative Memories: Hopfield and Bidirectional Associative Memory
Unit – III FUZZY LOGIC Periods 9
Fuzzy Systems – Fuzzy Sets – Operations and Properties - Fuzzy Rules and Reasoning - Fuzzy Inference
Systems – Fuzzy Models.- Adaptive Neuro-Fuzzy Inference Systems.
Unit – IV OPTIMIZATION TECHNIQUES Periods 9
Derivative-based Optimization – Derivative-free Optimization – Genetic Operations – Crossover –
Mutation – Fitness Scaling – Inversion - Genetic Algorithms.
Unit – V APPLICATIONS Periods 9
Printed Character Recognition – Inverse Kinematics Problems - Automobile Fuel Efficiency Prediction –
Soft Computing for Color Recipe Prediction.
Total Periods 45
REFERENCES:
1. J.S.R. Jang, C.T. Sun and E. Mizutani, “Neuro-Fuzzy and Soft Computing”, Prentice-Hall of
India, 2007.
2. Aliev, R.A and Aliev, R.R, “Soft Computing and its Application”, World Scientific Publishing
Co. Pvt. Ltd., 2001.
4. Michael L. Scott, “Programming Language Pragmatics”, Elsevier (2/e), 2004
Course Outcome
Clear knowledge about the fuzzy sets and fuzzy logic and its operations
Ability to build the applications based on genetic algorithm and neural
networks
86
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE08 Software Reliability & Testing 3 0 0 3 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 aware of the counting principles.
Be exposed to concepts and properties of algebraic structures such as semi groups,
monoids and groups.
Unit – I INTRODUCTION Periods 9
Software Reliability & Hardware Reliability, Basic Concepts, Availability, Modeling.
Unit – II SELECTED MODELS Periods 9
Execution Time Component, Calendar Time Component, Model Choice.
Unit – III APPLICATIONS Periods 9
System Engineering, Project Management, Management of Operational Phase, Evaluation of S/W Engg.
Technologies.
Unit – IV SYSTEM DEFINITION Periods 9
Failure definition, System Configuration, Text Run Selection.
Unit – V PARAMETER DETERMINATION Periods 9
Execution Time Component, Calendar Time Component.
Total Periods 45
REFERENCES:
1. J.D.Musa,, “ Software Reliability: Measurement, Prediction & Application Series in Software
Engineering and Technology”, McGraw Hill, 1987.
2. John D. Musa, “Software Reliability Engineering”, Tata McGraw Hill, 1999.
3. Norman E . Fenton, Shari Lawrence Pfleeger, "Software metrics", Second Edition, International
Student Edition, 2003.
Course
Outcome
Can able to find practical solutions to the problems
Can solve specific problems individual or in teams
Can manage themselves through the project
Can work independently as well as in teams
Can define, formulate and analyse a problem
87
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE09 E - Commerce 3 0 0 3 50 50 100
Course
Objective
To recognize the business impact and potential of e-Commerce
To explain the technologies required to make e-Commerce viable
To discuss the current drivers and inhibitors facing the business world in adopting
and using e-Commerce
To explain the economic consequences of e-Commerce
Unit – I INTRODUCTION TO ELECTRONIC COMMERCE Periods 9
Electronic Commerce, Scope of Electronic Commerce, Definition of Electronic commerce, Electronic
Commerce and Tmade cycle, Electronic Market, Electronic Data Interchange, Internet Commerce.
Unit – II BUSINESS STRATEGY IN AN ELECTRONIC AGE Periods 9
Value Chain, Supply Chains, Porter‟s Value Chain Model Inter organizational Value chains Competitive
advantage, Competitive strategy, Porter‟s Model, First Mover advantage, Competitive advantage using
ecommerce.
Unit – III BUSINESS STRATEGY Periods 9
Introduction to Business Strategy, Strategic implications of IT, Technology, Business Environment, Business
Capability, Existing Business strategy, Strategy Formulation and Complementation Planning, ecommerce
implementation, ecommerce & evaluation.
Unit – IV ELECTRONIC MARKET Periods 9
Case Study: ecommerce in passenger Air Transport. Business to Business Electronic Commerce: Inter
organizational Transactions. Markets, Electronic Markets, Usage of electronic markets, Advantages and
Disadvantages of electronic market.
Unit – V FUTURE OF ELECTRONIC MARKETS Periods 9
Electronic Data Interchange (EDI), Introduction, Definition, Benefits, Examples, EDI Technology, EDI
Communications, EDI implementation, EDI Security, EDI Business.
Total Periods 45
REFERENCES:
1. David Whiteley ,”ECOMMERCE: Strategy, Technologies and Applications”, TMH, New Delhi,
2000.
2. Ravi Kalakota & Andre B. Whinston ,”Electronic Commerce A Manager‟s Guide”, Pearson
Education, 2005.
Course Outcome
Can understand the e-commerce framework and technology.
Able to explain the e-commerce business models.
Can understand the e-commerce customers in different industries.
Can measure the success in an e-commerce environment
Able to understand the infrastructure of e-commerce.
88
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE10 Compiler Design 3 0 0 3 50 50 100
Course
Objective
To enrich the knowledge in various phases of compiler ant its use of code optimization
techniques, machine code generation, and use of symbol table.
To extend the knowledge of parser by parsing LL parser and LR parser.
To provide practical programming skills necessary for constructing a compiler.
To apply the knowledge of lex tool & yacc tool to devleop a scanner & parser.
To design & implement a software system for backend of the compiler.
Unit – I INTRODUCTION TO COMPILING Periods 9
Compilers, Analysis of the source program, The phase of a compiler, Cousins of the compiler, The grouping of
phases, Compiler constructions tools.
Unit – II A SIMPLE ONE PASS COMPILER & LEXICAL ANALYSIS Periods 9
Syntax definition, Syntax directed translation, Parsing, A translator for simple expressions, Lexical analysis,
Incorporating a symbol table, Abstract stack machines. The role of the lexical analyzer, Input buffering,
Specification of tokens, Recognition of tokens, A language of specifying lexical analyzers, Design of a lexical
analyzer generator.
Unit – III SYNTAX ANALYSIS Periods 9
The role of the parser, Writing a grammar, Top down parsing, Bottom up parsing, Operator precedence parsing, LR
parsars, Using ambiguous grammars, Parsar generators.
Unit – IV SYNTAX DIRECTED TRANSLATION Periods 9
Syntax direct definitions, Construction of syntax trees, Bottom up evaluation of S, attributed definitions, Lattributed
definitions, Top down translation. Type Checking: Type systems, Specification of a simple type checker. Run Time
Environments: Source language issues, Storage organization, Storage allocation strategies, Access to nonlocal
names, Parameter passing, Symbol tables, Language facilities for dynamic storage allocation, Dynamic storage
allocation techniques.
Unit – V INTERMEDIATE CODE GENERATION Periods 9
Intermediate languages, Declarations, Assignment statements, Boolean expressions.
Code Generation :Issues in the design of a code generator, Target machine, Runtime
storage management, Basic blocks and flow graphs. Code Optimization: Introduction, The Principle sources of
optimization.
Total Periods 45
REFERENCES:
1. A.V.Aho, R. Sethi ,”Compilers Principles, Techniques, and Tools”, 2
nd Edition, Pearson Education, New
Delhi, 2006
2. A.I.Holub,” Compiler Design in C”, Prentice Hall of India, New Delhi, 1995
3. J.P. Tremblay ,”The Theory and Practice of Compiler Writing”, McGraw Hill, Singapore, 1993.
4. K.C. Louden ,”Compiler Construction: Principles and Practice”, Thomson, Learning, New Delhi, 2005.
Course Outcome Can demonstrate Different techniques of symbol table organization.
Can improve Code generation and its limitations.
89
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE11 Information System Project
Management 3 0 0 3 50 50 100
Course
Objective
To understand the importance of project management certification
To describe the project management process groups
To describe the process of project integration management
To understand the importance of project time management and how to use various
techniques to manage time
Unit – I INFORMATION SYSTEMS Periods 9
Concepts And Management: Information Systems: Concepts and Definitions, Types of Information Systems,
Examples of Information Systems, Managing Information Resources. The Modern Organization In The Digital
Economy: Doing Business in the Digital Economy, Business Pressures, Organizational Responses, and IT Support,
Competitive Advantage and Strategic Information Systems, Why Should You Learn About
Information Technology.
Unit – II ETHICS, PRIVACY, AND INFORMATION SECURITY Periods 9
Ethical Issues, Threats to Information Security, Protecting Information Resources. Data And Knowledge
Management: Managing Data, The Database Approach, Database Management Systems, Data Warehousing, Data
Visualization Technologies, Knowledge Management.
Unit – III WIRELESS, MOBILE COMPUTING, AND MOBILE COMMERCE Periods 9
Wireless Technologies, Wireless Computer Networks and Internet Access, Mobile Computing and Mobile
Commerce, Pervasive Computing, Wireless Security.
Unit – IV ORGANIZATIONAL INFORMATION SYSTEMS Periods 9
Transaction Processing Systems, Functional Information Systems, Enterprise Resource Planning Systems, Customer
Relationship Management, Supply Chain Management Systems, Electronic Data Interchange and Extranets.
Unit – V MANAGERIAL SUPPORT SYSTEMS Periods 9
Managers and Decision Making, Decision Support Systems, Enterprise and Executive Decision Support Systems,
Intelligent Systems.
Total Periods 45
REFERENCES:
1. R.K. Rainer Jr, E Turban & R.E.Pattern,” Introduction to Information Systems”, John Wiley, India Edition,
2006.
2. L.Jessup,” Information Systems Today”, 2/e, Pearson Education, New Delhi2006.
Course
Outcome
Can understand the issues involved in managing information systems projects.
Able to explore practical knowledge of the skills and techniques used to manage
information systems projects
90
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE12 Decision Support Systems &
Intelligent Systems 3 0 0 3 50 50 100
Course
Objective
To understand systems definition, systems requirements, and information needed for
decision maker.
To identify several methods to enhance and develop information systems and to
manage the information system recourses
To understand several ethical issues in information system
Unit – I DECISION SUPPORT SYSTEMS Periods 9
An Overview: Opening Vignette: Southwest Airlines Flies in the Face of Competition through DSS, DSS
Configurations, What Is a DSS, Characteristics and Capabilities of DSS, Components of DSS, The Data
Management Subsystem, The User Interface (Dialog) Subsystem, The Knowledge Based Management
Subsystem, The User, DSS Hardware, DSS Classifications.
Unit – II MODELING AND ANALYSIS Periods 9
Opening Vignette: DuPont Simulates Rail Transportation System and Avoids Costly Capital Expense, MSS
Modeling, Static and Dynamic Models, Certainty, Uncertainty, and Risk, Influence Diagrams, MSS Modeling
with Spreadsheets, Decision Analysis of a Few Alternatives (Decision Tables and Decision Trees).
Unit – III BUSINESS INTELLIGENCE Periods 9
Data Warehousing, Data Acquisition, Data Mining, Business Analytics, And Visualization: Opening
Vignette: Information Sharing a Principal Component of the National Strategy for Homeland Security, The
Nature and Sources of Data, Data Collection, Problems, and Quality, The Web/Internet and Commercial
Database Services, Database Management Systems in Decision Support Systems/Business Intelligence.
Unit – IV DECISION SUPPORT SYSTEM DEVELOPMENT Periods 9
Opening Vignette: Osram Sylvania Thinks Small, Strategizes Big Develops the InfoNet HR Portal System,
Introduction to DSS Development, The Traditional System Development Life Cycle, Alternative
Development Methodologies, Prototyping: The DSS Development Methodology, Change Management, DSS
Technology Levels and Tools, DSS Development Platforms, DSS Development Tool Selection.
Unit – V KNOWLEDGE ACQUISITION, REPRESENTATION, AND
REASONING Periods 9
Opening Vignette: Development of a RealTime KnowledgeBased System at Eli Lilly, Concepts of
Knowledge Engineering, Scope and Types of Knowledge, Methods of Knowledge Acquisition from Experts,
Knowledge Acquisition from Multiple Experts, Automated Knowledge Acquisition from Data and
Documents, Knowledge Verification and Validation, Representation of Knowledge, Reasoning in RuleBased
Systems, Explanation and Metaknowledge, Inferencing with Uncertainty, Expert Systems Development,
Knowledge Acquisition and the Internet.
Total Periods 45
REFERENCES:
1. E. Turban, J.E. Aronson & T.P.Liang, ”Decision Support Systems and Intelligent Systems”, 7/e,
Pearson Education, New Delhi2006.
Course Outcome
Can test the system quality and how to enhance it
Can Explore the basic concepts in information system and the benefits with
these systems in modern society
Able to Differentiate between data, information, and knowledge
91
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE13 Pattern Recognition 3 0 0 3 50 50 100
Course
Objective
To introduce you to a variety of pattern recognition algorithms, along with pointers on
which algorithms work with a real world problem.
In order to best prepare you for such real world problems, will routinely use real-
world problems in this class.
To provide a detailed overview of some advanced topics in pattern recognition and a
project opportunity to conduct independent, cutting-edge and publishable research.
Unit – I PATTERN RECOGNITION OVERVIEW Periods 9
Overview, Pattern Recognition, Classification and Description, Patterns and Feature Extraction, Training and
Learning in PR Systems, Pattern Recognition Approaches.
Unit – II STATISTICAL PATTERN RECOGNITION Periods 9
Introduction, The Gaussian case and Class Dependence Discriminate Functions, Extensions, Classifier
Performance, RISK and Errors.
Unit – III SUPERVISED LEARNING Periods 9
Parametric Estimation and Supervised Learning, Maximum Likelihood Estimation Approach, Bayesian
Parameter Estimation Approach, Non – Parametric Approaches, Parzen Windows, Knn Non Parametric
Estimation. Nearest Neighbour Rule.
Unit – IV LINEAR DISCRIMINATE FUNCTIONS Periods 9
The Discrete and Binary Feature Cases: Introduction, Discrete and Binary Classification Problems,
Techniques to Directly Obtain Linear Classifiers.
Unit – V SYNTACTIC PATTERN RECOGNITION Periods 9
Overview Quantifying Structure in Pattern Description and Recognitions, Grammar Based Approach and
Application, String Generation as Pattern Description. Recognition by String Matching and Parsing. The
CockeYounger Kasami (ck) parsing algorithm.
Total Periods 45
REFERENCES:
1. Robort Schalkoff ,” Pattern Recognition, Statistical, Structural and Neural Approach”, John Wiley,
Indian Edition, 2000.
2. R. U. Duda ,”Pattern Classification”, John Wiley, Indian Edition, 2006.
Course
Outcome
Can explore with basic mathematical and statistical techniques commonly used
in pattern recognition.
Able to Compare and contrast various pattern recognition with an adequate
background on probability theory, statistics, and optimization theory to tackle a
wide spectrum of engineering problems
92
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution, Affiliated to Anna University ,Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2014
Department Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE14 Real Time Systems 3 0 0 3 50 50 100
Course
Objective
To know about the specification and design techniques of a Real Time System.
To understand about real time task communication and synchronization
To have a vast knowledge of queuing models and Real Time System integration.
Unit – I BASIC REAL TIME CONCEPTS Periods 12
Basic computer architecture – some terminology - real time design issues – example real time systems – input
and output – other devices – language features.
Unit – II REAL TIME SPECIFICATION AND DESIGN TECHNIQUES Periods 12
Natural languages – mathematical specification – flow charts – structured charts – pseudocode and
programming design languages – finite state automata – data flow diagrams – petri nets – Warnier Orr
notation – state charts – polled loop systems – phase / sate driven code – coroutines – interrupt – driven
systems – foreground/background system – full featured real time operating systems
Unit – III INTERTASK COMMUNICATION AND SYNCHRONIZATION Periods 12
Buffering data – mailboxes – critical regions – semaphores – deadlock – process stack management –
dynamic allocation – static schemes – response time calculation – interrupt latency – time loading and its
measurement – scheduling is NP complete – reducing response times and time loading – analysis of memory
requirements – reducing memory loading – I/O performance
Unit – IV QUEUING MODELS Periods 12
Probability functions – discrete- basic buffering calculation – classical queuing theory – little's law – erlong's
formula – faults, failures, bugs and effects – reliability-testing – fault tolerance – classification of architecture
– distributing systems – Non Von Neuman architecture
Unit – V HARDWARE/SOFTWARE INTEGRATION Periods 12
Goals of real time system integration – tools - methodology -software Heinsberg uncertainity principle – real
time applications
Total Periods 45
REFERENCES:
1. Philip A.Laplante, “Real time system design and analysis – an engineer's handbook”, Wiley-IEEE
Press, 2004.
2. C.M.Krishna and Kang G Shin, "Real time systems", TMH, 1997
3. Stuart Bennelt, "Real time computer control – and introduction", Pearson education,2003.
4. Allen Burns, Andy Wellings, “Real Time Systems and Programming Languages”,Pearson
Education, 2003.
Course
Outcome
Can analyze, design, develop, debug, and document embedded computer systems
using software written in both assembly and higher level languages.
Able to analyze and design basic central processing units and memory systems for
general-purpose computers
93
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods Per
Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE15 Advanced Database Management Systems 3 0 0 3 50 50 100
Course
Objective
This module aims to give students in depth information about system implementation
techniques, data storage, representing data elements, database system architecture, the system
catalog, query processing and optimization, transaction processing concepts, concurrency
control techniques, database recovery techniques, database security and authorization,
enhanced data models for advanced applications.
Unit – I THE EXTENDED E- R MODEL AND OBJECT MODEL Periods 9
The Extended Entity Relationship Model and Object Model: The ER model revisited, Motivation for complex
data types, User defined abstract data types and structured types, Subclasses, Super classes, Inheritance,
Specialization and Generalization, Constraints and characteristics of specialization and Generalization,
Relationship types of degree higher than two.
Unit – II OBJECT-ORIENTED DATABASES Periods 9
Object-Oriented Databases: Overview of Object-Oriented concepts, Object identity, Object structure, and type
constructors, Encapsulation of operations, Methods, and Persistence, Type hierarchies and Inheritance, Type
extents and queries, Complex objects; Database schema design for OODBMS; OQL, Persistent programming
languages; OODBMS architecture and storage issues; Transactions and Concurrency control, Example of
ODBMS
Unit – III OBJECT RELATIONAL AND EXTENDED
RELATIONAL DATABASES Periods 9
Object Relational and Extended Relational Databases: Database design for an ORDBMS - Nested relations and
collections; Storage and access methods, Query processing and Optimization; An overview of SQL3,
Implementation issues for extended type; Systems comparison of RDBMS, OODBMS, ORDBMS
Unit – IV PARALLEL AND DISTRIBUTED DATABASES AND
CLIENT-SERVER ARCHITECTURE Periods 9
Parallel and Distributed Databases and Client-Server Architecture: Architectures for parallel databases, Parallel
query evaluation; Parallelizing individual operations, Sorting, Joins; Distributed database concepts, Data
fragmentation, Replication, and allocation techniques for distributed database design; Query processing in
distributed databases; Concurrency control and Recovery in distributed databases. An overview of Client Server
architecture
Unit – V DATABASES ON THE WEB AND SEMI STRUCTURED
DATA Periods 9
Databases on the Web and Semi Structured Data: Web interfaces to the Web, Overview of XML; Structure of
XML data, Document schema, Querying XML data; Storage of XML data, XML applications; The semi
structured data model, Implementation issues, Indexes for text data 6. Enhanced Data Models for Advanced
Applications: Active database concepts. Temporal database concepts.; Spatial databases, Concepts and
architecture; Deductive databases and Query processing; Mobile databases, Geographic information systems.
Total Periods 45
94
TEXT BOOKS:
1. Elmasri and Navathe, “Fundamentals of Database Systems”, Pearson Education
2. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, McGraw-Hill
FURTHER READINGS:
1. Korth, Silberchatz , Sudarshan , “Database System Concepts”, McGraw-Hill
2. Peter Rob and Coronel, “Database Systems, Design, Implementation and Management” , Thomson
Learning
3. C.J. Date, Longman, “Introduction To Database Systems”, Pearson Education
Course Outcome
Can deal with online transactions and control Concurrency.
Able to Understand types of Data Base failures and Recovery.
Acquire knowledge about advanced topics and can research on that.
95
VIVEKANANDHA COLLEGE OF ENGINEERING FORWOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods /Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE16 Cyber Forensics 3 0 0 3 50 50 100
Course
Objective
Learn the security issues network layer and transport layer.
Be exposed to security issues of the application layer.
Learn computer forensics.
Be familiar with forensics tools.
Learn to analyze and validate forensics data.
Unit – I NETWORK LAYER SECURITY &TRANSPORT LAYER
SECURITY Periods 9
IPSec Protocol - IP Authentication Header - IP ESP - Key Management Protocol for IPSec.Transport layer
Security: SSL protocol, Cryptographic Computations – TLS Protocol
Unit – II E-MAIL SECURITY & FIREWALLS Periods 9
PGP - S/MIME - Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related terminology-
Types of Firewalls - Firewall designs - SET for E-Commerce Transactions
Unit – III INTRODUCTION TO COMPUTER FORENSICS Periods 9
Introduction to Traditional Computer Crime, Traditional problems associated with Computer Crime.
Introduction to Identity Theft & Identity Fraud. Types of CF techniques - Incident and incident response
methodology - Forensic duplication and investigation. Preparation for IR: Creating response tool kit and IR
team. - Forensics Technology and Systems - Understanding Computer Investigation – Data Acquisition.
Unit – IV EVIDENCE COLLECTION AND FORENSICS TOOLS Periods 9
Processing Crime and Incident Scenes – Working with Windows and DOS Systems. Current Computer
Forensics Tools: Software/ Hardware Tools
Unit – V ANALYSIS AND VALIDATION Periods 9
Validating Forensics Data – Data Hiding Techniques – Performing Remote Acquisition – Network Forensics
– Email Investigations – Cell Phone and Mobile Devices Forensics
Total Periods 45
TEXT BOOKS:
1. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”,
Wiley Publications, 2003
2. Nelson, Phillips, Enfinger, Steuart, “Computer Forensics and Investigations”, Cengage Learning,
India Edition, 2008
3. John R.Vacca, “Computer Forensics”, Cengage Learning, 2005
4. Richard E.Smith, “Internet Cryptography”, 3rd Edition Pearson Education, 2008
5. Marjie T.Britz, “Computer Forensics and Cyber Crime”: An Introduction”, 3rd Edition, Prentice
Hall, 2013.
Course
Outcome
Discuss the security issues network layer and transport layer.
Apply security principles in the application layer.
Explain computer forensics.
Use forensics tools.
Analyze and validate forensics data
96
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods /Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE17 Knowledge Management 3 0 0 3 50 50 100
Course
Objective
Learn the Evolution of Knowledge management.
Be familiar with tools.
Be exposed to Applications.
Be familiar with some case studies
Unit – I INTRODUCTION Periods 9
Introduction: An Introduction to Knowledge Management - The foundations of knowledge management-
including cultural issues- technology applications organizational concepts and processes- management
aspects- and decision support systems. The Evolution of Knowledge management: From Information
Management to Knowledge Management - Key Challenges Facing the Evolution of Knowledge Management
- Ethics for Knowledge Management
Unit – II CREATING THE CULTURE OF LEARNING AND
KNOWLEDGE SHARING Periods 9
Organization and Knowledge Management - Building the Learning Organization. Knowledge Markets:
Cooperation among Distributed Technical Specialists – Tacit Knowledge and Quality Assurance.
Unit – III KNOWLEDGE MANAGEMENT-THE TOOLS Periods 9
Telecommunications and Networks in Knowledge Management - Internet Search Engines and Knowledge
Management - Information Technology in Support of Knowledge Management - Knowledge Management
and Vocabulary Control - Information Mapping in Information Retrieval - Information Coding in the Internet
Environment - Repackaging Information
Unit – IV KNOWLEDGEMANAGEMENT-APPLICATION Periods 9
Components of a Knowledge Strategy - Case Studies (From Library to Knowledge Center, Knowledge
Management in the Health Sciences, Knowledge Management in Developing Countries).
Unit – V FUTURE TRENDS AND CASE STUDIES Periods 9
Advanced topics and case studies in knowledge management - Development of a knowledge management
map/plan that is integrated with an organization's strategic and business plan - A case study on Corporate
Memories for supporting various aspects in the process life -cycles of an organization
Total Periods 45
TEXT BOOKS:
1. Srikantaiah, T.K., Koenig, M., “Knowledge Management for the Information Professional”
Information Today, Inc., 2000
2. Nonaka, I., Takeuchi, H., “The Knowledge-Creating Company: How Japanese Companies Create
the Dynamics of Innovation”, Oxford University Press, 1995
Course
Outcome
Use the knowledge management tools.
Develop knowledge management Applications.
Design and develop enterprise applications
97
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE18 Modern Telecommunication Systems 3 0 0 3 50 50 100
Course
Objective
Ability to use the techniques, skills, and modern engineering tools necessary for
engineering practice.
To obtain the Knowledge of contemporary issues.
Unit – I DATA COMMUNICATION NETWORKS Periods 9
Introduction, network architecture, layered network architecture, protocols, data communications hardware, data
communication circuits.
Unit – II SWITCHING SYSTEMS Periods 9
Introduction, Elements of switching systems, switching network configuration, principles of cross bar
switching.Electronic space division switching, Time division switching, Combination switching.
Unit – III TELEPHONE NETWORKS Periods 9
Networks types:Public switched data networks, connection oriented & connection less service, Circuit
Switching, packet switching and virtual circuit switching concepts, OSI reference model, LAN, WAN, MAN &
Internet. Repeaters, Bridges, Routers and gate ways.
Unit – IV INTEGRATED SERVICES DIGITAL NETWORK (ISDN) Periods 9
Introduction, motivation, ISDN architecture, ISDN interfaces, functional grouping, reference points, protocol
architecture, signaling, numbering, addressing, BISDN.
Unit – V DSL TECHNOLOGY Periods 9
ADSL, Cable Modem, Traditional Cable Networks, HFC Networks, Sharing, CM & CMTS and DOCSIS.
SONET: Devices, Frame, Frame Transmission, Synchronous Transport Signals, STS I, Virtual Tributaries and
Higher rate of service.
Total Periods 45
TEXT BOOKS:
1. Thyagarajan Viswanath, “Tele communication switching system and networks” , PHI, 2000.
2. Wayne Tomasi, “Advanced electronic communications systems”,PHI, 2004.
98
REFERENCES:
1. J. Bellamy, John Wiley, “ Digital telephony”2nd edition, 2001.
2. Achyut. S.Godbole,” Data Communications & Networks” ,TMH, 2004.
3. H. Taub & D. Schilling , “ Principles of Communication Systems”,TMH, 2nd Edition, 2003
4. B.A. Forouzan, “ Data Communication & Networking”,TMH, 3rd Edition, 2004.
Course Outcome
Ability to design a system, component, or process to meet desired needs within
realistic constraints such as economic, environmental, social, political, ethical,
health and safety, manufacturability, and sustainability.
Ability to function on multi-disciplinary teams.
99
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE19 Business Data Communications 3 0 0 3 50 50 100
Course
Objective
To understand the fundamental principles of the technologies underlying modern
business telecommunications and computer networks.
To understand the role of data communications in modern business, its impact on the
business organizational structures, and its use for business strategic advantages.
To understand the state of art of data communications technologies widely used in
business organizations and the issues in network management.
Unit – I INTRODUCTION Periods 9
INTRODUCTION: Information and Communication, The Manager‟s Dilemma, The Nature of Business
Information Requirements, Distributed Data Processing, The Transmission of Information, Networks,
Communications, Software, Management Issues, Stadards, Internet Resources, Useful Publications
Unit – II DISTRIBUTED DATA PROCESSING Periods 9
DISTRIBUTED DATA PROCESSING: Centralized Versus Distributed Processing, Forms of Distributed
Data Processing, Distributed Data, Networking Implications of DDP.THE INTERNET ADDRESSING AND
SERVICES: The Internet, Internet Addressing, Quality of Service, Integrated Services, Differentiated
Services.
Unit – III DATA TRANSMISSION Periods 9
DATA TRANSMISSION: Signals for Conveying Information, Transmission Impairments and Channel
Capacity. TRANSMISSION MEDIA: Guided Transmission Media, Wireless Transmission. DATA
COMMUNICATION FUNDAMENTALS: Analog and Digital Data Communication, Data Encoding
Techniques, Asynchronous and Synchronous Transmission, Interfacing
Unit – IV DATA LINK CONTROL Periods 9
DATA LINK CONTROL: Flow Control, Error Detection, Error correction, Data Link Control Protocols.
TRANSMISSION EFFICIENCY: The Need for Transmission Efficiency, Frequency Division Multiplexing,
Synchronous Time Division Multiplexing, Statistical Time Division Multiplexing, Data Compression.
DISTRIBUTED APPLICATIONS: Electronic Mail, Electronic Data Interchange, Enterprise Application
Integration.
Unit – V CLIENT/SERVER AND INTRANET COMPUTING Periods 9
CLIENT/SERVER AND INTRANET COMPUTING: The Growth of Client/Server Computing, Client/Server
Applications, Middleware, Intranets, Extranets, Case Studies
Total Periods 45
TEXT BOOKS:
1. Willian Stallings,”Business Data Communications “, Pearson Education, New Delhi,2007.
2. D.A.Stamper and T.L.Case ,”Business Data Communications”, 6/e,Pearson Education, New
Delhi 2004
Course
Outcome Able to Recognize the different internetworking devices and their functions.
Can Explain the role of protocols in networking.
100
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods /Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE20 Optimization Techniques 3 0 0 3 50 50 100
Course
Objective
To understand the theory of optimization methods and algorithms developed for solving
various types of optimization problems
To develop and promote research interest in applying optimization techniques in
problems of Engineering and Technology
Unit – I INTRODUCTION TO LINEAR PROGRAMMING Periods 9
Introduction To Linear Programming : Prototype Example, The Linear Programming Model, Assumptions of
Linear Programming, Additional Examples, Some Classic Case Studies. Solving Linear Programming
Problems .The Simplex Method : The Essence of the Simplex Method, Setting Up the Simplex Method, The
Algebra of the Simplex Method, The Simplex Method in Tabular Form, Tie Breaking in the Simplex Method,
Adapting to Other Model Forms, Post optimality Analysis
Unit – II THE THEORY OF THE SIMPLEX METHOD Periods 9
The Theory Of The Simplex Method: Foundations of the Simplex Method ,The revised Simplex Method, A
Fundamental Insight. Duality Theory And Sensitivity Analysis : The Essence of Duality Theory, Economic
Interpretation of Duality, Primal Dual relationships, Adapting to Other Primal Forms, The Role of Duality
Theory in Sensitivity Analysis.
Unit – III OTHER ALGORITHMS FOR LINEAR
PROGRAMMING Periods 9
Other Algorithms For Linear Programming: The Dual Simplex Method, Parametric Linear Programming, The
Upper Bound Techniques, An Interior Point Algorithm. Network Optimization Models: Prototype Example,
The Terminology of Networks, The Shortest Path Problem, The Minimum Spanning Tree Problem, The
Maximum Flow Problem, The Minimum Cost flow Problem, The Network Simplex Method
Unit – IV DYNAMIC PROGRAMMING Periods 9
Dynamic Programming : A Prototype Example for Dynamic Programming, Characteristics of Dynamic
Programming Problems, Deterministic Dynamic Programming, Probabilistic Dynamic Programming
Unit – V INTEGER PROGRAMMING Periods 9
Integer Programming : Prototype Example, Some BIP Applications, Innovative Uses of Binary Variables in
Model Formulation, Some Formulation examples, Some Perspectives on Solving Integer Programming
Problems, The Branch and Bound Technique and Its Application to Binary Integer Programming, A Branch
and Bound Algorithm for Mixed Integer.
Total Periods 45
TEXT BOOKS:
1. S. Hiller & G.J. Lieberman ,” Operations Research”, 8th Edn, TMH, New Delhi – 2006.
2. H.A.Taha ,”Operations Research,” 8/e , Pearson Education , New Delhi2007.
3. J.K. Sharma ,”Operations Research”, 3/e, Mcmillan , India Ltd, 2007.
Course
Outcome
Can understand the theory of optimization methods and algorithms
developed for solving various types of optimization problems.
Can able to solve the Fundamental problems of optimization techniques.
101
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course
Code Course Name
Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE21 Bio- Informatics 3 0 0 3 50 50 100
Course
Objective
To introduce the fundamentals of evolution, molecular biology, and molecular evolution.
These principals underlie much of modern bioinformatics, apply to many of the basic
predictive methods that are of common use in the field.
To provide with a practical and hands-on experience with common bioinformatics tools and
databases.
Unit – I MOLECULAR BIOLOGY AND BIOLOGICAL CHEMISTRY Periods 9
Molecular Biology and Biological Chemistry : The Generic Material: Nucleotides,Orientation, Base Pairing, The
Central Dogma of Molecular Biology, Gene Structure and Information Content: Promoter Sequences, The Genetic
Code, Open Reading Frames, Introns and Exons, Protein Structure and Function: Primary Structure,
Secondary,Tertiary, and Quaternary Structure, The Nature of Chemical Bonds: Anatomy of an Atom, Valence,
Electronegativity, Hydrophilicity and Hydrophobicity, Molecular Biology Tools: Restriction Enzyme Digests, Gel
Electrophoresis, Blotting and Hybridization, Cloning, Polymerase Chain Reaction, DNA Sequencing, Genomic
Information Content: CValue Paradox, Reassociation Kinetics
Unit – II MOLECULAR BIOLOGY AND BIOLOGICAL CHEMISTRY Periods 9
Data Searches and Pairwise Alignments : Dot Plots, Simple Alignments, Gaps: Simple Gap Penalties, Origination
and Length Penalties, Scoring Matrices, Dynamic Programming: The Needleman and Wunsch Algorithm, Global
and Local Alignments: Semiglobal Alignments, The SmithWaterman algorithm, Database Searches: BLAST and Its
Relatives, FASTA and Related Algorithms, Alignment Scores and Statistical Significance of Database Searches,
Multiple Sequence Alignments
Unit – III SUBSTITUTION PATTERNS Periods 9
Substitution Patterns : Estimating Substitution Numbers: Jukes Cantor Model, Transitions and Transversions,
Kimura‟s Two Parameter Model, Models With Even More Parameters, Substitutions Between Protein Sequences,
Variations in Evolutionary Rates Between Genes.
Unit – IV HISTORY OF MOLECULAR PHYLOGENETICS Periods 9
History of Molecular Phylogenetics : Advantages to Molecular Phylogenies, Phylogenetic Trees: Terminology of
Tree Reconstruction, Rooted and Unrooted Trees, Gene vs. Species Trees, Character and Distance Data, Distance
Matrix Methods: UPGMA, Estimation of Branch Lengths, Transformed Distance Method, Neighbor‟s Relation
Method, Neighbor Joining Methods, Maximum Likelihood Approaches, Multiple Sequence Alignments
Unit – V CHARACTER – BASED METHODS OF PHYLOGENETICS Periods 9
Character – Based Methods of Phylogenetics : Parsimony: Informative and Uninformative Sites, Un weighted
Parsimony, Weighted Parsimony, Inferred Ancestral Sequences, Strategies for Faster Searches: Branch and Bound,
Heuristic Searches, Consensus Trees, Tree Confidence: Bootstrapping, Parametric Tests, Comparison of
Phylogenetic Methods, Molecular Phylogenies: The Tree of life, Human Origins
Total Periods 45
102
TEXT BOOKS:
1. D.E. Krane & M.L. Raymer ,”Fundamental Concepts of Bioinformatics”, Pearson
Education, New Delhi2003.
FURTHER READINGS:
1. S.C. Rastogi ,”Bioinformatics:Methods and Applications”, PHI, New Delhi2005.
2. V.R. Srinivas ,”Bioinformatics:A Modern Approach”, PHI, New Delhi2005.
3. A.M. Lesk ,”Introduction to Bioinformatics”, Oxford (Indian Edn), New Delhi2004.
Course Outcome
Can Analyze the basic theory and application of programs used for database
searching, protein and DNA sequence analysis, prediction of protein function, and
building phylogenetic trees.
103
VIVEKANANDHA COLLEGE OF ENGINEERING FORWOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE22 Advanced Computer Graphics 3 0 0 3 50 50 100
Course
Objective
Analyze the basic raytracing algorithm and explain its limitations
Explain a local illumination model and derive the rendering equation
Design and implement a rendering algorithm based on Monte Carlo path tracing
Explain the physical laws of motion relevant for computer animation
Unit – I REPRESENTING CURVES AND SURFACES Periods 9
Polygon Meshes, Parametric Cubic Curves, Parametric Bicubic Surfaces, Quadratic Surfaces- Achromatic
Light, Chromatic Color, Color Models for Raster Graphics, Reproducing color, Using Color in Computer
Graphics.
Unit – II THE QUEST FOR VISUAL REALISM Periods 9
Why Realism, Fundamental Difficulties, Rendering Techniques for Line Drawings, Rendering Techniques for
Shaded Images, Improved Object Model, Dynamics, Stereopsis, Improved Displays, Interacting with Our
Other Senses, Aliasing and Antialiasing.
Unit – III VISIBLESURFACE DETERMINATION Periods 9
Functions of Two Variables, Techniques for Efficient Visible Surface Algorithms, Algorithms for Visible
Line Determination, The zBuffer Algorithm, List Priority Algorithms, Scan Line Algorithms, Area
Subdivision Algorithms, Algorithms for Octrees, Algorithms for Curved Surfaces, Visible Surface Ray
Tracing.
Unit – IV ILLUMINATION AND SHADING Periods 9
Illumination Models, Shading Models for Polygons, Surface Detail, Shadows, Transparency, Inter object
Reflections, Physically Based Illumination Models, Extended Light Sources, Spectral Sampling
Unit – V ADVANCED GEOMETRIC AND RASTER ALGORITHMS Periods 9
Clipping, Scan Converting Primitives, Antialiasing, The Special Problems of Text, Filling Algorithms,
Making copy Pixel Fast, The Shape Data Structure and Shape Algebra.
Total Periods 45
REFERENCES:
1. J.D. Foley,”Computer Graphics Principles & Practical “,2/e ,Pearson Education, New Delhi, 2004.
Course Outcome
Can Assess / Evaluate the performance and conceptual limits of the
implemented simulation code
Can Assess / Evaluate and understand a performance-based animation
system
104
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE23 Computing & Complexity Theory 3 0 0 3 50 50 100
Course
Objective
The various notions used in computational complexity theory to classify computational
problems as hard or easy to solve.
To become familiar with the important complexity classes
Should be able to follow the proofs, and develop a feel for the techniques used in
reasoning about computational complexity.
Unit – I THE CHURCHTURING THESIS Periods 9
Turing Machines Formal definition of a Turing machine, Examples of Turing machines; Variants of Turing
Machines Multitape Turing machines, Nondeterministic Turing machines, Enumerators, Equivalence with other
models; The Definition of Algorithm Hilbert‟s problems, Terminology for describing Turing machines.
Unit – II DECIDABILITY & REDUCIBILITY Periods 9
Decidable Languages Decidable problems concerning regular languages, Decidable problems concerning
context free languages; The Halting Problem The diagonalization method, The halting problem is undecidable -
Undecidable Problems from Language Theory Reductions via computation histories; A Simple Undecidable
Problem; Mapping ReducibilityComputable functions, formal definition of mapping reducibility
Unit – III ADVANCED TOPICS IN COMPUTABILITY THEORY Periods 9
The Recursion Theorem, Selfreference, Terminology for the recursion theorem, applications; Decidability of
logical theories A decidable theory, An undecidable theory; Turing Reducibility; A Definition of Information
Minimal length descriptions, Incompressible strings and randomness.
Unit – IV TIME COMPLEXITY Periods 9
Measuring Complexity BigO and smallo notation, Analyzing algorithms, Complexity relationships among
models; The Class P Polynomial time, Examples of problems in P; The Class NPExamples of problems in NP,
The P versus NP question; NPcompleteness Polynomial time reducibility, Definition of NP completeness, The
CookLevin Theorem; Additional NP complete Problems The vertex cover problem, The Hamiltonian path
problem, The subset sum problem.
Unit – V SPACE COMPLEXITY Periods 9
Savitch‟s Theorem, The Class PSPACE, PSPACH completeness – The TQBF problem, Winning strategies for
games, Generalized geography; The Classes L and NL, NL completeness Searching in graphs; NL equals coNL
Intractability: Hierarchy Theorems Exponential space completeness; Relativization Limits of the diagonalization
method; Circuit Complexity.
Total Periods 45
REFERENCES:
1. Michael Sipser ,“Introduction to the Theory of Computation”, 2/e, Thomson Learning – India
Edition 2006.
2. R.G.Taylor ,”Models of Computation and Formal Languages”, Oxford University New York,
1998
3. B.M. Moret ,”The Theory of Computation “, PearsonEducation, New Delhi 2002
Course
Outcome Able to follow the proofs
Can develop a feel for the techniques used in reasoning about computational complexity.
105
VIVEKANANDHA COLLEGE OF ENGINEERING FORWOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE24 Digital Image Processing 3 0 0 3 50 50 100
Course
Objective
To understand the basic principles and methods of digital image processing
Should be able to formulate solutions to general image processing problems
To have a comprehensive background in image filtering
To be prepared for research in image processing if you choose to go that way
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 - Multiresolution 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. Anil Jain K. “Fundamentals of Digital Image Processing”, PHI Learning Pvt. Ltd., 2011
3. Willliam K Pratt, “Digital Image Processing”, John Willey, 2002
4. Malay K. Pakhira, “Digital Image Processing and Pattern Recognition”, First Edition, PHI Learning
Pvt. Ltd., 2011
Course Outcome
Can write programs that demonstrate 2D image processing
techniques.
Can write programs that demonstrate geometrical transformations.
106
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE25 Natural Language Processing 3 0 0 3 50 50 100
Course
Objective
To know about the leading trends and systems in natural language processing
To understand the concepts of morphology, syntax, semantics and pragmatics of the
language
To recognize the significance of pragmatics for natural language understanding
To describe the simple system based on logic and demonstrate the difference
between the semantic presentation and interpretation of that presentation
To describe the application based on natural language processing and to show the
points of syntactic, semantic and pragmatic processing
Unit – I MODULE – I Periods 9
Introduction to Natural Language Processing, Different Levels of language analysis, Representation and
understanding,Linguistic background. Grammars and parsing, Top down and Bottom up parsers.
Unit – II MODULE – II Periods 9
Transition Network Grammars, Feature systems and augmented grammars, Morphological analysis and the
lexicon,Parsing with features, Augmented Transition Networks.
Unit – III MODULE – III Periods 9
Grammars for natural language, Movement phenomenon in language, Handling questions in context free
grammars,Hold mechanisms in ATNs, Gap threading
Unit – IV MODULE – IV Periods 9
Human preferences in parsing, Shift reduce parsers, Deterministic parsers,Statistical methods for Ambiguity
resolution
Unit – V MODULE – V Periods 9
Semantic Interpretation, word senses and ambiguity, Basic logical form language, Encoding ambiguity in
logical from,Thematic roles, Linking syntax and semantics, Information Retrieval, Recent trends in NLP.
Total Periods 45
REFERENCES:
1. James Allen, “Natural Language Understanding “(2/e), Pearson Education, 2003
2. T Siddiqui and U S Tiwary, “Natural Language Processing and Information Retrieval”, Oxford
University Press, 2008
3. D Juraffsky and J H Martin, “Speech and Language Processing”, Pearson Education, 2000
Course Outcome
Able to extract the meaning of an input sentence or an input text
Can understand the concepts of morphology, syntax, semantics and
pragmatics of the language.
Can recognize the significance of pragmatics for natural language
understanding.
107
VIVEKANANDHA COLLEGE OF ENGINEERING FORWOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE26 Modeling & Simulation 3 0 0 3 50 50 100
Course
Objective
To understand the basic system concept and definitions of system
To know the various techniques to model and to simulate various systems
To enhance the ability to analyze a system and to make use of the information to
improve the performance
Unit – I BASIC SIMULATION MODELING Periods 9
The nature of Simulation, Systems, Models, and Simulation, Discrete Event Simulation, Simulation of a
Single Server Queuing System, Simulation of an Inventory System, Alternative Approaches to Modeling and
Coding Simulations, Steps in a Sound Simulation Study, Other Types of Simulation, Advantages,
Disadvantages, and Pitfalls of Simulation
Unit – II SIMULATION SOFTWARE Periods 9
Introduction, Comparison of Simulation Packages with Programming Languages, Classfication of Simulation
Software, Desirable Software Features, General Purpose Simulation Packages, Object Oriented Simulation
Unit – III BUILDING VALID, CREDIBLE, AND APPROPRIATELY
DETAILED SIMULATION MODELS Periods 9
Introduction and Definitions, Guidelines for Determining the Level of Model Detail, Verification of
Simulation Computer Programs, Techniques for Increasing Model Validity and Credibility
Unit – IV SELECTING INPUT PROBABILITY DISTRIBUTION Periods 9
Introduction, Useful Probability Distributions, Techniques for Accessing Sample Independence, Activity I:
Hypothesizing Families of Distributions, Activity II: Estimation of Parameters, Activity III: Determining
How Representative the Fitted Distributions Are.
Unit – V RANDOM NUMBER GENERATORS Periods 9
Linear Congruential Generators, Other Kinds of Generators, Testing Random Number Generators. General
Approaches to Generating Random Variates, Generating Continuous Random Variates, Generating Discrete
Random Variates
Total Periods 45
REFERENCES:
1. A.M.Law, “KeltonSimulationModeling and Analysis”, 4/e, Tata McGraw Hill, New Delhi, 2006
2. J. Banks ,“Discrete – Event System Simulation”, 4/e, Pearson Education, New Delhi, 2007.
3. A.F. Seila ,“Applied Simulation Modeling”, Thomson Learning, IndiaEdition, 2004
4. G. Gordon , “System Simulation”, PHI, New Delhi, 2006.
Course Outcome Can able to Analyze a system and to make use of the information to improve
the performance.
108
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE27 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
Unit – I INTRODUCTION Periods 9
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 - Modelling 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
109
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 Soulé-Dupuy, “Collaborative and Social Information
Retrieval and Access: Techniques for Improved user Modelling”, IGI Global Snippet, 2009
6. John G. Breslin, Alexandre Passant and Stefan Decker, “The Social Semantic Web”, Springer, 2009.
Course Outcome
Able to Develop semantic web related applications.
Can Represent knowledge using ontology.
Able to Predict human behaviour in social web and related communities.
110
VIVEKANANDHA COLLEGE OF ENGINEERING FOR WOMEN
(Autonomous Institution Affiliated to Anna University, Chennai)
Elayampalayam, Tiruchengode – 637 205
Programme B.Tech. Programme Code 104 Regulation 2013
Department INFORMATION TECHNOLOGY Semester ELECTIVE
Course Code Course Name Periods Per Week Credit Maximum Marks
L T P C CA ESE Total
U13ITE28 Machine Learning 3 0 0 3 50 50 100
Course
Objective
Be able to formulate machine learning problems corresponding to different
applications
To understand a range of machine learning algorithms along with their strengths and
weaknesses.
To understand the basic theory underlying machine learning
Be able to apply machine learning algorithms to solve problems of moderate
complexity
Be able to read current research papers and understand the issues raised by current
research. Unit – I INTRODUCTION Periods 9
Basic concepts; Supervised learning: Supervised learning setup, LMS, Logistic regression, Perceptron,
Exponential family, Generative learning algorithms, Gaussian discriminant analysis, Naive Bayes,
Unit – II SUPPORT VECTOR MACHINES Periods 9
Support vector machines, Model selection and feature selection, Ensemble methods: Bagging, boosting,
Evaluating and debugging learning algorithms
Unit – III LEARNING THEORY Periods 9
Bias/variance tradeoff, Union and Chern off/ Hoeffding bounds, VC dimension, Worst case (online) learning
Unit – IV UNSUPERVISED LEARNING Periods 9
Clustering K-means, EM. Mixture of Gaussians, Factor analysis, PCA (Principal components analysis), ICA
(Independent components analysis)
Unit – V REINFORCEMENT LEARNING AND CONTROL Periods 9
MDPs. Bellman equations, Value iteration and policy iteration, Linear quadratic regulation (LQR), LQG, Q-
learning. Value function approximation, Policy search. Reinforce. POMDPs.
Total Periods 45
REFERENCES:
1. Ethem Alpaydin, “Introduction to Machine Learning”, Second Edition, PHI, 2010.
2. P. Langley, “Elements of Machine Learning”, Morgan Kaufmann, 1995.
Course Outcome
Can understand a number of models for supervised, unsupervised, and
reinforcement machine learning
Able to describe the strength and weakness of each of these models
Can understand the mathematical background from linear algebra, statistics,
and probability theory used in these machine learning models