B.tech. CSE Syllabus

B.Tech. (Full Time) – Computer Science and Engineering
Curriculum & Syllabus
2007-08
Faculty of Engineering & Technology
SRM University
SRM Nagar, Kattankulathur – 603 203
1 CS – 07-08-SRM – E&T
S.R.M. UNIVERSITY
COMPUTER SCIENCE & ENGINEERING
CURRICULUM AND SYLLABUS
2007-08
I SEMESTER
Course Code Category Course Name L T P C
Theory
LE0101 G English 1 0 2 2
MA0101 B Mathematics – I 3 2 0 4
PH0101 B Physics 3 0 0 3
CY0101 B Chemistry 3 0 0 3
GE0101 E Basic Engineering – I 4 0 0 4
Practical
PD0101 G Personality Development –I* 0 0 2 0
GE0107 G NSS/NCC/NSO/YOGA 0 0 2 1
GE0105 B Computer Literacy 0 0 2 1
PH0103 B Physics Laboratory 0 0 2 1
CY0103 B Chemistry Lab 0 0 2 1
ME0120 /
ME0130
E Workshop Practice /
Engineering Graphics
0/1 0 4 2/3
Total 14/
15
2 16 22/
23
Total Contact Hours 32/33
II SEMESTER
Course
Code
Category Course Name L T P C
Theory
GE0108 G Value Education 1 0 0 1
GE0102 B Biology for Engineers 2 0 0 2
GE0104 B Principles of Environmental Science 2 0 0 2
MA0102 B Mathematics II 3 2 0 4
PH0102 B Material Science 2 0 2 3
GE0106 E Basic Engineering- II 4 0 0 4
CS0102 P Digital Computer Fundamentals 3 0 2 4
Practical
PD0102 G Personality Development – II* 0 0 2 0
CS0112 P Programming in C 2 0 2 3
ME0130 /
ME0120
E Engineering Graphics/ Workshop Practice 1/0 0 4 3/2
Total 20/
19
2 12 26/
25
Total Contact Hours 34/33
G: General programme comprising language/communication skills, humanities and social sciences, economics
and principles of management, and NSS/NCC/NSO/YOGA.
B: Basic sciences comprising Computer Literacy with Numerical Analysis, Mathematics, Physics, and
Chemistry.
E: Engineering Sciences and Technical Arts comprising Engineering Graphics, Workshop Practice, Basic
Engineering, etc.
P: Professional subjects corresponding to the Branch of Studies, which will include core subjects, electives, and
project work.
* Audit course
2 CS – 07-08-SRM – E&T
III SEMESTER
Subject
Code
Category Subject Name L T P C
Theory
LE0201/
LE0203 /
LE0205
G German Language Phase –I / Japanese Language Phase
– I / French Language Phase – I
2 0 0 2
MA 0211 B Mathematics –III 3 1 0 4
CS0201 P Data Structures using C++ 3 0 0 3
CS0203 P Design and Analysis of Algorithms 3 0 0 3
CS0205 P Microprocessor and Interfacing 3 0 0 3
CS0207 P Computer Organization and Architecture 3 0 0 3
Practical
PD0201 G Personality Development - III 0 0 2 1
CS0211 P Microprocessor Lab 0 0 3 2
CS0213 P Data Structures and Algorithms Lab
(C & C++)
0 0 3 2
Total 17 1 8 23
Total Conduct Hours 26
IV SEMESTER
Subject
Code
Category Subject Name L T P C
Theory
LE0202 /
LE0204 /
LE0206
G German Language Phase –II / Japanese Language Phase –
II / French Language Phase – II
2 0 0 2
MA0212 E Probability and Queuing Theory 3 0 0 3
CS0202 P Principles of Programming Languages 3 0 0 3
CS0204 P Theory of Computation 3 0 0 3
CS0206 P Operating Systems 3 0 0 3
CS0210 P Comprehension - I 0 2 0 1
Practical
PD0202 G Personality Development - IV 0 0 2 1
CS0212 P Operating Systems Lab 0 0 3 2
CS0214 P JAVA Programming 2 0 2 3
CS0216 P Computer Skills 1 0 2 2
Total 17 2 9 23
Total Conduct Hours 28
3 CS – 07-08-SRM – E&T
V SEMESTER
Subject
Code
Category Subject Name L T P C
Theory
MA0307 E Operations Research Techniques 3 0 0 3
EC0377 E Principles of Communication 3 0 0 3
CS0301 P Compiler Design 3 0 0 3
CS0303 P Computer Networks 3 0 0 3
P Elective – I 3 0 0 3
Practical
PD0301 G Personality Development - V 1 0 2 2
CS0311 P Compiler Design Lab 0 0 3 2
CS0313 P Networking Lab 0 0 3 2
CS0315 P Industrial Training - I 0 0 2 1
Total 16 0 10 22
Total contact hours 26
VI SEMESTER
Subject
Code
Category Subject Name L T P C
Theory
CS0302 P Artificial Intelligence & Expert Systems 3 0 0 3
CS0304 P Data Base Management Systems 3 0 0 3
CS0306 P Object Oriented Analysis & Design 3 0 0 3
CS0308 P Logic for Computer Science 3 0 0 3
P Elective – II 3 0 0 3
CS0310 P Comprehension - II 0 2 0 1
Practical
PD0302 G Personality Development - VI 1 0 2 2
CS0312 P Artificial Intelligence & Expert Systems Lab 0 0 3 2
CS0314 P Data Base Management Systems Lab 0 0 3 2
Total 16 2 8 22
Total contact hours 26
VII SEMESTER
Subject
Code
Category Subject Name L T P C
Theory
MB0403 G Industrial Management & Economics 3 0 0 3
CS0401 P Software Engineering 3 0 0 3
CS0403 P Parallel & Distributed Computing 3 0 0 3
CS0405 P VLSI Design & Embedded Systems 3 0 0 3
P Elective – III 3 0 0 3
P Elective - IV 3 0 0 3
Practical
CS0411 P Software Engineering Lab 0 0 2 1
CS0413 P VLSI & Embedded System Design Lab 0 0 3 2
CS0416 P Industrial Training - II 0 0 2 1
Total 18 0 7 22
Total contact hours 25
VIII SEMESTER
Subject
Code
Category Subject Name L T P C
4 CS – 07-08-SRM – E&T
Theory
CS0402 P Scripting Languages & Web Technology 3 0 0 3
P Elective – V 3 0 0 3
P Elective - VI 3 0 0 3
Practical
CS0414 P Project 0 0 16 8
Total 9 0 16 17
Total contact hours 25
TOTAL CREDITS TO BE EARNED : 177
Summary Table
Semester
I
II
III
IV
V
VI
VII
VIII
Total
%
Total 22/23 26/25 23 23 22 22 22 17 177 100
G 3 1 3 3 2 2 3 0 17 9.6
B 13 11 4 0 0 0 0 0 28 15.8
E 6/7 7/6 0 3 6 0 0 0 22 12.4
P 0 7 16 17 14 20 19 17 110 62.2
Electives for Fifth Semester
Subject Code Subject Name L T P C
CS0321 System Modeling and Simulation 3 0 0 3
CS0323 Digital Image Processing 3 0 0 3
CS0325 Visual Programming 3 0 0 3
CS0327 Soft Computing 3 0 0 3
CS0329 Advanced Operating System 3 0 0 3
CS0331 E-Commerce 3 0 0 3
CS0333 TCP/IP Principles & Architecture 3 0 0 3
Electives for Sixth Semester
Subject Code Subject Name L T P C
CS0322 Advanced Networks 3 0 0 3
CS0324 Virtual Reality 3 0 0 3
CS0326 Advanced Databases 3 0 0 3
CS0328 Neural Networks 3 0 0 3
CS0330 Quantum Information Processing 3 0 0 3
Electives for Seventh Semester
Subject Code Subject Name L T P C
CS0421 Genetic Algorithms 3 0 0 3
CS0423 Speech Technology 3 0 0 3
CS0425 Mobile Computing 3 0 0 3
CS0427 Network Security 3 0 0 3
CS0429 Fault Tolerant Computing 3 0 0 3
CS0431 WINDOWS Internals 3 0 0 3
CS0433 LINUX Internals 3 0 0 3
CS0435 Computer Vision 3 0 0 3
CS0437 Advanced Java Programming 3 0 0 3
CS0439 Component Based Technology 3 0 0 3
Electives for Eighth Semester
Subject Code Subject Name L T P C
5 CS – 07-08-SRM – E&T
CS0422 ATM Networks 3 0 0 3
CS0424 Data Mining 3 0 0 3
CS0426 Grid Computing 3 0 0 3
CS0428 Agent Based Systems 3 0 0 3
CS0430 Human Computer Interaction 3 0 0 3
CS0432 Real Time System Design 3 0 0 3
CS0434 Pattern Recognition 3 0 0 3
CS0436 Robotics 3 0 0 3
CS0438 Decision Support System 3 0 0 3
CS0440 Bioinformatics 3 0 0 3
CS0442 Bluetooth Technology 3 0 0 3
CS0444 Software Reliability 3 0 0 3
CS0446 Firewall Architecture 3 0 0 3
CS0448 Optimization Techniques 3 0 0 3
SEMESTER – I
L T P C
LE 0101 ENGLISH 1 0 2 2
Prerequisite
Nil
PURPOSE
To provide an adequate mastery of communicative English Language training primarily - reading and writing
skills, secondarily listening and speaking skills.
INSTRUCTIONAL OBJECTIVES
To provide language training to the engineering students which will enable them to understand and acquire
knowledge in technical subjects.
LISTENING
Listening Practice – Hints on Listening – Listening Practice
Note Taking: Note Taking Strategies
SPEAKING
Definitions: Expressing Opinions (agreement / disagreement )-Offering Suggestions – Technical Definitions –
Describing Objects – speaking practice.
Phonetics: Pronunciation-Phonetic Transcription-Stress-Intonation
READING
Comprehension: Skimming-scanning-close reading-Comprehension – Transferring Information – Exercise – An
unseen passage should be given and questions may be asked in the form of True or False statements, MCQ,
short answers.
Transcoding : Interpreting tables, flow charts, piechart, bar diagram, tree diagram, graphs.
WRITING
Art of Writing : Writing Language – Rules for effective writing – Technical Essay Writing – Exercise
Report Writing : Technical Writing – Lab Report – Exercise
Letter Writing : Formal Letters – Letter to the Editor – Letter Inviting Dignitaries – Letter of Application
Curriculum Vitae – Placing an Order.
Dialogue Writing
FOCUS ON AND COMMUNICATION AND “COMPUNICATION”
6 CS – 07-08-SRM – E&T
Communication : Basic Concepts – Process – Kinds – Routes – Forms – Factors – Barriers – Triangles
Communication (Communicate through Computers – Power Point & Tele Conference).
INTERNAL ASSESSMENT
Based on the submission of Assignments and test performance of the students marks will be awarded.
TEXT BOOKS
1. Abraham Benjamin Samuel ‘Practical Communication Communicative English LSRW2000’– SRMEC
– June 2006 Revised Edition.
2. Staff of the Department of Humanities and Social Science, Anna University, “English for Engineers /
Technologist Vol.-I”. Orient Longman, 1990.
REFERENCE BOOKS
1. Herbert. A. J. “The structure of Technical English” Orient Longman 1995.
2. Pickett and Laster, ‘Technical English, Writing, Reading and Speaking’, New York Harper and Row
Publications, 1997.
3. “Interactive course in phonetics and spoken English” published by Acoustics Engineers(ACEN) 2002.
4. Munter, Mary, “Business Communication Strategy and Skill”, Prentice Hall Inc.,New Jersey, 1987.
L T P C
MA 0101 MATHEMATICS -I 3 2 0 4
Prerequisite
Nil
PURPOSE
To impart analytical ability in solving mathematical problems as applied to the respective branches of
Engineering.
INSTRUCTIONAL OBJECTIVES
At the end of the course, student should be able
1. To apply advanced matrix knowledge to Engineering problems.
2. To improve their ability in solving geometrical applications of differential calculus problems.
3. To equip themselves familiar with the functions of several variables.
4. To familiarize with the applications of differential equations.
5. To expose to the concept of three dimensional analytical geometry.
MATRICES
Characteristic equation – Eigen values and eigen vectors of a real matrix – Properties of eigen values – Caley –
Hamilton theorem – Orthogonal reduction of a symmetric matrix to diagonal form – Orthogonal matrices –
Reduction of quadratic form to canonical form by orthogonal transformations.
GEOMETRICAL APPLICATIONS OF DIFFERENTIAL CALCULUS
Curvature – Cartesian and polar coordinates – Circle of curvature – Involutes and Evolutes – Envelopes –
Properties of envelopes.
FUNCTIONS OF SEVERAL VARIABLES
Function of two variables – Partial derivatives – Total differential – Taylor’s expansion – Maxima and Minima
– Constrained Maxima and Minima by Lagrangean Multiplier method – Jacobians
ORDINARY DIFFERENTIAL EQUATIONS
Simultaneous first order linear equations with constant coefficients – Linear equations of second order with
constant and variable coefficients – Homogeneous equation of Euler type – Equations reducible to
homogeneous form.
THREE DIMENSIONAL ANALYTICAL GEOMETRY
Direction cosines and ratios – Angle between two lines – Equation of a plane – Equation of a straight line – Coplanar
lines – Shortest distance between skew lines – Sphere – Tangent plane – Plane section of a sphere –
Orthogonal spheres.
7 CS – 07-08-SRM – E&T
TEXT BOOKS
1. Grewal B.S, Higher Engg Maths, Khanna Publications, 38th Edition., Veerajan, T., Engineering
Mathematics, Tata McGraw Hill Publishing Co., New Delhi,2000.
2. Dr.V.Ramamurthy & Dr. Sundarammal Kesavan,” Engineering Mathematics” – Vol I & II Anuradha
Publications, Revised Edition 2006.
REFERENCE BOOKS
1. Kreyszig.E, “Advanced Engineering Mathematics”, 8th edition, John Wiley & Sons. Singapore,2001.
2. Kandasamy P etal. “Engineering Mathematics”, Vol.I (4th revised edition), S.Chand &Co., New
Delhi,2000.
3. Narayanan S., Manicavachagom Pillay T.K., Ramanaiah G., “Advanced Mathematics for Engineering
students”, Volume I (2nd edition), S.Viswanathan Printers and Publishers, 1992.
4. Venkataraman M.K., “Engineering Mathematics” – First Year (2nd edition), National Publishing Co.,
Chennai,2000.
L T P C
PH 0101 PHYSICS 3 0 0 3
Prerequisite
Nil
PURPOSE
The purpose of this course is to develop scientific temper and analytical capability through learning physical
concepts and their applications in engineering and technology. Comprehension of some basic physical concepts
will enable the students to logically solve engineering problems.
INSTRUCTIONAL OBJECTIVES
At the end of the course, the student will be able to:
1. Understand the general scientific concepts required for technology,
2. Apply the concepts in solving engineering problems,
3. Explain scientifically the new developments in engineering and technology, and
4. Get familiarized with the concepts, theories, and models behind many technological applications.
PROPERTIES OF MATTER AND SOUND
Properties of Matter: Hooke’s law – Twisting couple on a cylinder – Shafts – Torsion pendulum – Bending of
beams – Bending moment – Uniform bending and non-uniform bending – I shape girder. Sound: Shock waves
– Mach number (simple problems) – Ultrasonic production (magnetostriction and piezoelectric methods) and
application – Acoustics of buildings – Sources and impacts of noise – Sound level meter – Control of noise
pollution.
ELECTROMAGNETISM AND MICROWAVES
Electromagnetism: Divergence, curl and gradient – Maxwell’s equations – Wave equation for electromagnetic
waves – Propagation in free space – Poynting vector – Rectangular and circular wave guides. Microwaves:
Properties and applications – Generation by magnetron and reflex klystron oscillator – Travelling wave tube –
Biological effects.
OPTICS
Photometry: Principles and Lummer-Brodhun photometer. Lasers: Principles and characteristics – Types of
lasers (CO2, excimer, NdYAG, GaAs, free electron) – Holographic mass storage. Optical Fiber: Principles –
Physical structure and types – Optical fiber communication. Photoelasticity: Theory and applications.
CRYSTAL PHYSICS AND CRYOGENICS
Crystal Physics: Crystal directions – Planes and Miller indices – Basic symmetry elements – Translational
symmetry elements – Reciprocal lattice – Diamond and HCP crystal structure – Imperfections in crystals.
Cryogenics: Methods of liquefaction of gases (cascade process, Linde’s process, and adiabatic demagnetization
process) – Measurement of cryogenic temperatures.
ENERGY PHYSICS
Introduction to non-conventional energy sources – Solar cells – Thermoelectric power generators – Thermionic
power generator – Magneto hydrodynamic power generator – Fuel cells (H2O2) – Solid state batteries (Lithium)
– Low voltage and high voltage nuclear cells – Thermocouple based nuclear cell – Ultra capacitors.
8 CS – 07-08-SRM – E&T
TEXT BOOKS
1. Arumugam, M., “Engineering Physics”, 2nd edition, Anuradha Publishers, Kumbakonam, 2003.
2. Gaur and Gupta, “Engineering Physics”, 7th edition, Dhandapani and Sons, New Delhi, 1997.
3. Thiruvadigal, J. D., Ponnusamy, S., Vasuhi, P. S. and Kumar, C., “Physics for Technologists”, 5th
edition, Vibrant Publication, Chennai, 2007.
REFERENCE BOOKS
1. Vasudeva, A. S., “Modern Engineering Physic”s, Revised edition, S. Chand and Company Ltd., New
Delhi, 2004.
2. Vasudevan, D. N., “Fundamentals of Magnetism and Electricity”, 11th edition, S. Chand and Company
Ltd., New Delhi, 1983.
3. Nair, K. P. R., “Atoms, Molecules and Lasers”, Narosa Publishing House, New Delhi, 2006.
4. Pillai, S. O., “Solid State Physics”,5th edition, New Age International (P) Ltd., New Delhi, 2004.
5. Khan, B. H., “Non-Conventional Energy Resource”s, Mechanical Engineering Series, Tata McGraw
Hill Publishing Company Ltd., New Delhi, 2006.
L T P C
CY 0101 CHEMISTRY 3 0 0 3
Prerequisite
Nil
PURPOSE
To impart a sound knowledge on the principles of chemistry involving the different application oriented topics
required for all engineering branches.
INSTRUCTIONAL OBJECTIVES
The students should be conversant with
1. The role of applied chemistry the field of engineering.
2. The knowledge of water quality parameters and the treatment of water.
3. The principles involves in corrosion and its inhibitions.
4. Important analytical techniques, instrumentation and the applications.
5. Knowledge with respect to the phase equlibria of different systems.
TECHNOLOGY OF WATER
Water quality parameters: Physical, Chemical & Biological - Hardness of water – estimation of hardness
(EDTA method & O. Hehner”s method), Alkalinity – determination – disadvantages of using hard water in
boilers: Scale, sludge formation – disadvantages – prevention – treatment: Internal conditioning – phosphate,
calgon and carbonate conditioning methods – External: Zeolite, ion exchange methods - desalination – reverse
osmosis and electrodialysis - domestic water treatment.
CORROSION AND ITS CONTROL
Corrosion: Basic concepts – principles, mechanism of chemical, electrochemical corrosion – Pilling Bedworth
rule – galvanic corrosion – differential aeration corrosion - pitting corrosion - stress corrosion - factors
influencing corrosion.
Corrosion control: cathodic protection – sacrificial anodic method – corrosion inhibitor. Protective coatings:
surface preparation for metallic coatings - electro plating and electroless Plating - chemical conversion coatings
– anodizing, phosphating & chromate coating.
PHASE EQUILIBRIA
Phase rule: Statement – explanation of the terms involved - one component system (water system only).
Condensed phase rule - thermal analysis – two component systems: simple eutectic, Pb-Ag; Br, Cd - solid
solution Cu-Ni and compound formation Mg-Zn - applications of eutectics.
POLYMERS AND REINFORCED PLASTICS
Classification of polymers – types of polymerization reactions – mechanism of addition polymerization: free
radical, ionic and ziegler – Natta - effect of structure on the properties of polymers – strength, plastic
9 CS – 07-08-SRM – E&T
deformation, plastics elasticity and physical nature –Preparation and properties of important resins:-
Polyethylene, PVC, PMMA, Polyester, Teflon Bakelite, Epoxy resins, compounding of plastics, moulding
methods - injection, extrusion, compression and calendaring - reinforced plastics – FRP – Carbon, Graphite,
Glass– applications.
INSTRUMENTAL METHODS OF ANALYSIS
Basic principles, instrumentation of potentiometry, flame photometry – applications. Elementary theory –
principle – instrumentation of UV – visible spectroscopy and atomic absorption spectroscopy and infrared
spectroscopy.
TEXT BOOKS
1. Jain.P.C and Monika Jain, “Engineering Chemistry”, Danpat Raj publishing company (P) Ltd, New
Delhi – 2002.
2. Dara.S.S, “Text book of Engineering Chemistr”y, S. Chand & Company Ltd, New Delhi 2003.
3. Willard H.A., Merit L.L and Dean J.A., “Instrumental methods of analysis” 6th Edition Van Nostrand,
1986.
REFERENCE BOOKS
1. Kuriacose J.C. and Rajaram J. “Chemistry in Engineering and Technology”, Volume II, Tata McGraw
Hill p.b. Co., 1988.
2. Jeyalakshmi.R & Ramar. P, “Engineering Chemistry”, 1st Edition, Devi Publications, Chennai 2006.
3. Kamaraj.P & Arthanareeswari. M, “Applied Chemistry”, 2nd Edition, Sudhandhira Publications, 2003.
4. Arivalagan. K,” Engineering Chemistry”, 1st Edition, Mass publications, 2007.
5. P.Kamatchi, “Applied Chemistry-I”, Ponnuswamy publications, Chennai.
6. Dr. Helen P Kavitha , “Engineering Chemistry – I” ILA Publications, 2002
L T P C
GE 0101 BASIC ENGINEERING - I 4 0 0 4
Prerequisite
Nil
PART A CIVIL ENGINEERING
PURPOSE
To get exposed to the glimpses of Civil Engineering topics that is essential for an Engineer.
INSTRUCTIONAL OBJECTIVES
1. To know about different materials and their properties.
2. Engineering aspects related to buildings.
3. To know about importance of Surveying.
4. To know about the transportation systems.
5. To get exposed to the rudiments of engineering related to Dams, Water Supply, Transportation system
and Sewage Disposal.
BUILDING MATERIALS AND THEIR PROPERTIES
Introduction - Civil Engineering – Building Materials – Brick, Stone, Cement, Steel, Concrete, timber –
Properties – Uses. Units – Stress, strain and three modulii of elasticity – factor of safety - Centre of Gravity and
Moment of Inertia for rectangle and circular section – simple problems.
BUILDINGS AND THEIR COMPONENTS
Buildings – Classification - Components of buildings and their functions Foundations - functions –
classification of foundations – Bearing capacity Floorings – functions - Types - Cement Concrete flooring –
Mosaic flooring - Marble flooring Roofs - Types – Requirements – Madras Terrace roof. Tall structure – types
of structural systems.
UTILITY AND SERVICES
Surveying - Objective – Principles – Classification – Instruments used for Surveying. Dams - Purpose –
Selection of site – Classification – Gravity dam (cross-section details only) Transportation system -
Classification – Roadway - components – classification of roads - Railway – Cross-section of permanent waycomponents
parts and functions. Docks and Harbour – classification – Terminology Bridges –components of a
10 CS – 07-08-SRM – E&T
bridge - types of bridges.Water supply - Sources - Standards of drinking water (BIS) – elementary
treatment methods – RO System Sewage disposal – Septic tank – function and components.
TEXT BOOKS
1. Raju K.V.B., Ravichandran P.T., “Basics of Civil Engineering”, Ayyappa Publications, Chennai, 2000.
2. Ramesh Babu, “Civil Engineering “, VRB Publishers, Chennai, 2000.
REFERENCE BOOKS
1. Rangwala,S.C., “Engineering Materials”, Charotar Publishing House, Anand, 1980.
2. National Building Code of India, Part V, “Building Materials”, 2005
3. Surendra Singh, “Building Materials”, Vikas Publishing Company, New Delhi, 1996
PART B MECHANICAL ENGINEERING
PURPOSE
To familiarize the students with the basics of Mechanical Engineering.
INSTRUCTIONAL OBJECTIVES
To familiarize with
1. The basic machine elements
2. The Sources of Energy and Power Generation
3. The various manufacturing processes
MACHINE ELEMENTS
Springs: Helical and leaf springs – Springs in series and parallel. Cams: Types of cams and followers – Cam
profile. Power Transmission: Gears (terminology, spur, helical and bevel gears, gear trains). Belt drives
(types). Chain drives. Simple Problems.
ENERGY
Sources: Renewable and non-renewable (various types, characteristics, advantages/disadvantages). Power
Generation: External and internal combustion engines - Hydro and nuclear power plants (layouts,
element/component description, advantages, disadvantages, applications). Simple Problems.
MANUFACTURING PROCESSES
Sheet Metal Work: Introduction – Equipments – Tools and accessories – Various processes (applications,
advantages / disadvantages). Welding: Types – Equipments – Tools and accessories – Techniques employed
(applications, advantages / disadvantages (gas and arc welding only)) – Gas cutting – Brazing and soldering.
Lathe Practice: Types - Description of main components – Cutting tools – Work holding devices – Basic
operations. Simple Problems. Drilling Practice: Introduction – Types – Description – Tools. Simple
Problems.
TEXT BOOKS
1. Kumar, T., Leenus Jesu Martin., and Murali, G., “Basic Mechanical Engineering”, Suma Publications,
Chennai, 2007.
2. Prabhu, T. J., Jai Ganesh, V., Jebaraj, S., “Basic Mechanical Engineering”, Scitech Publications,
Chennai, 2000.
REFERENCE BOOKS
1. Hajra Choudhary, S.K. and Hajra Choudhary, A. K., “Elements of Manufacturing Technology”, Vols. I
& II, Media Publishers, 1986.
2. Nag, P.K., “Power Plant Engineering”, Tata McGraw-Hill, New Delhi, 2006.
3. Palanichamy, M.S., “Basic Civil & Mechanical Engineering”, Tata McGraw-Hill , New Delhi 1991.
4. Nagpal G. R., “Power Plant Engineering”, Khanna Publisher, Delhi,2004
L T P C
PD 0101 PERSONALITY DEVELOPMENT - I 0 0 2 0
Prerequisite
Nil
PURPOSE
11 CS – 07-08-SRM – E&T
The purpose of this course is to build confidence and inculcate various soft skills and to help Students to identify
and achieve their personal potential
INSTRUCTIONAL OBJECTIVES
1. To guide thought process.
2. To groom students' attitude.
3. To develop communication skill.
4. To build confidence.
METHODOLOGY
The entire program is designed in such a way that every student will participate in the class room activities. The
activities are planned to bring out the skills and talents of the students which they will be employing during
various occasions in their real life.
1. Group activities + individual activities.
2. Collaborative learning.
3. Interactive sessions.
4. Ensure Participation
5. Empirical Learning
Self-analysis SWOT - Time management - Creative chain story telling
Vocabulary games I – Attitude - Interpersonal skills
Motivation I - Vocabulary games II - Article review
Team building exercise - Critical Thinking - Event Management
Business situation - Leadership Qualities – Review
SCHEME OF INSTRUCTION
Marks allocated for regular participation in all oral activities in class
SCHEME OF EXAMINATION
Complete Internal evaluation on a regular Basis
L T P C
GE0107 NSS/NCC/NSO/YOGA 0 0 2 1
Prerequisite
Nil
I. YOGA SYLLABUS
PRACTICE LECTURE
I Meditation – Agnai, Asanas, Kiriyas, Bandas, Muthras Benefits of Agnai Meditation
II Meditation Santhi Physical Exercises (I & II) Benefits of santhi Meditation
III Kayakalpa Yoga Asanas, Kiriyas, Bandas, Muthras Lecture & Practice
IV Meditation Santhi Physical Exercises III & IV Analysis of Thought
V Meditation Thuriyam Kayakalpa Asanas, Kiriyas, Bandas, Muthras Benefits of Thuriyam
VI Meditation Thuriyam Kayakalpa Asanas, Kiriyas, Bandas, Muthras Attitude
VII Meditation Thuriyam Kayakalpa Asanas, Kiriyas, Bandas, Muthras Importance of Arutkappy & Blessings
VIII Meditation Santhi Kayakalpa Asanas, Kiriyas, Bandas, Muthras Benefits of Blessings
Hours = 30
12 CS – 07-08-SRM – E&T
TEXT BOOKS:
1. Vedatri Maharshi , “Yoga for Modern Age”
2. Vedatri Maharshi, “ Simplified Physical Exercises”
II. NATIONAL SPORTS ORGANISATION (NSO)
Each student must select two of the following games and practice for two hours per week. An
attendance of 80% is compulsory to earn the credits specified in the curriculum.
List of games:
1. Basket Ball
2. Football
3. Volley Ball
4. Ball Badminton
5. Cricket
6. Throwball
III. NATIONAL CADET CORPS (NCC)
Any student enrolling as a member of National Cadet Core (NCC) will have to attend sixteen parades
out of twenty parades each of four periods over a span of academic year.
Attending eight parades in first semester will qualify a student to earn the credits specified in the
curriculum.
IV. NATIONAL SERVICE SCHEME (NSS)
A student enrolling as member of NSS will have to complete 60 hours of training / social service to be
eligible to earn the credits specified in the curriculum.
L T P C
GE0105 COMPUTER LITERACY 0 0 2 1
Prerequisite
Nil
PURPOSE
This Lab Course will enable the students to understand the basics of computer and to know the basics of MSOffice.
INSTRUCTIONAL OBJECTIVES
1. To learn the basics of computer.
2. To work on Ms-Word, Ms-Excel, Ms-Power Point and Ms-Access
EXPERIMENTS TO IMPLEMENT
1. Study experiment on evolution of computer programming languages.
2. Suggest some of the Network Topologies that can be incorporated in your campus. Justify your choice.
3. Experiments to demonstrate directory creation and file creation.
4. Create a document with all formatting effects.
5. Create a document with tables.
6. Create labels in MS word.
7. Create a document to send mails using mail merge option.
8. Create an Excel File to analyze the student’s performance. Create a chart for the above data to depict it
diagrammatically.
9. Create Excel sheet to use built-in-function.
10. Create Excel sheet to maintain employee information and use this data to send mails using mail merge.
11. Create a Power Point presentation for your personal profile with varying animation effects with timer.
12. Consider student information system which stores student personal data, mark information and non
academic details.
13 CS – 07-08-SRM – E&T
* Use MS Access to create Tables and execute SQL queries to do this following
* Display all student records.
* Display student details with respect to his identity.
* Delete some records from the table.
* Find total marks obtained by student in each list.
TEXT BOOK
1. “Introduction to Information Technology” ITL Education Solutions Ltd., Pearson 2nd Edition, 2006.
L T P C
PH 0103 PHYSICS LABORATORY 0 0 2 1
Prerequisite
Nil
PURPOSE
The purpose of this course is to develop scientific temper and analytical capability among the engineering
students.
INSTRUCTIONAL OBJECTIVES
At the end of the course, the student will be able to:
1. Understand scientific concepts in measurement of different physical variables
2. Develop the skill in arranging and handling different measuring instruments and
3. Get familiarized with the errors in various measurements and planning / suggesting how these
contributions may be made of the same order so as to make the error in the final result small.
LIST OF EXPERIMENTS
1. Determination of Young’s Modulus of the material – Uniform bending
2. Determination of Rigidity Modulus of the material – Torsion Pendulum
3. Determination of velocity of Ultrasonic waves in liquids
4. Determination of dispersive power of a prism using spectrometer
5. Determination of laser parameter – Divergence and wavelength for a given laser source – laser grating
6. Particle size determination using laser
7. Study of attenuation and propagation characteristics of optical fiber cable
8. Calibration of voltmeter using potentiometer.
9. Calibration of ammeter using potentiometer.
10. Construction and study of regulation properties of a given power supply using IC
REFERENCE BOOKS
1. Chattopadhyay, D., Rakshit, P. C. and Saha, B., “An Advanced Course in Practical Physics”, 2nd
edition, Books & Allied Ltd., Calcutta, 1990.
2. Chauhan and Singh, “Advanced Practical Physics”, Revised edition, Pragati Prakashan, Meerut, 1985.
3. Thiruvadigal. J. D., Ponnusamy. S., Vasuhi. P. S. and Kumar. C, “Hand Book of Practical Physics”, 5th
edition, Vibrant Publication, Chennai, 2007.
L T P C
CY 0103 CHEMISTRY LABORATORY 0 0 2 1
Prerequisite
Nil
PURPOSE
An integrated laboratory course consists of experiments from applied chemistry and is designed to illustrate the
underlying principles of measurement techniques, synthesis, dynamics and chemical transformation.
INSTRUCTIONAL OBJECTIVES
Students should be able to understand the basic concept and its applications.
LIST OF EXPERIMENTS
1. Preparation of standard solutions.
14 CS – 07-08-SRM – E&T
2. Estimation of total hardness, permanent and temporary hardness by EDTA method.
3. Conductometric titration – determination of strength of an acid.
4. Estimation of iron by potentiometer – titration.
5. Determination of molecular weight of polymer by viscosity average – method.
6. Determination of dissolved oxygen in a water sample by Winkler”s method
7. Determination of Na / K in water sample by Flame photometry.
8. Estimation of Copper in ore.
9. Estimation of nickel in steel.
10. Determination of total alkalinity and acidity of a water sample.
REFERENCE
1. Chemistry department manual, Edition, 2003.
L T P C
ME 0120 WORKSHOP PRACTICE 0 0 4 2
Prerequisite
Nil
PURPOSE
To provide the students with hands on experience on different trades of engineering like fitting, carpentary,
smithy, welding and sheet metal.
INSTRUCTIONAL OBJECTIVES
To familiarize with
1. The basics of tools and equipments used in fitting, carpentry, sheet metal, welding and smithy.
2. The production of simple models in the above trades.
LIST OF EXPERIMENTS
EMPHASIS TO BE LAID ON REAL LIFE APPLICATIONS WHEN FRAMING THE EXERCISES.
FITTING
Tools & Equipments – Practice in Filing and Drilling.
Making Vee Joints, Square, dovetail joints, Key Making.
CARPENTARY
Tools and Equipments- Planning practice. Making Half Lap, dovetail, Mortise & Tenon joints, a mini model of
a single door window frame.
SHEET METAL
Tools and equipments - Fabrication of a small cabinet, Rectangular Hopper, etc.
WELDING
Tools and equipments - Arc welding of butt joint, Lap Joint, Tee Fillet. Demonstration of Gas welding, TIG &
MIG.
SMITHY
Tools and Equipments –Making simple parts like hexagonal headed bolt, chisel.
TEXT BOOK
1. Gopal, T.V., Kumar, T., and Murali, G., “A first course on workshop practice – Theory, practice and
work book”, Suma Publications, 2005.
REFERENCE BOOKS
1. Kannaiah,P. & Narayanan,K.C. “Manual on Workshop Practice”, Scitech Publications, Chennai, 1999.
2. Venkatachalapathy, V.S. , “First year Engineering Workshop Practice”, Ramalinga Publications,
Madurai, 1999.
L T P C
15 CS – 07-08-SRM – E&T
ME 0130 ENGINEERING GRAPHICS 1 0 4 3
Prerequisite
Nil
(Only First Angle Projection is to be followed)
PURPOSE
1. To draw and interpret various projections of 1D, 2D and 3D objects.
2. To prepare and interpret the drawings of buildings.
INSTRUCTIONAL OBJECTIVES
To familiarise with
1. The construction of geometrical figures
2. The projection of 1D, 2D & 3D elements
3. Sectioning of solids and development of surfaces
4. Preparation and interpretation of building drawing
FUNDAMENTALS OF ENGINEERING GRAPHICS
Lettering, two dimensional geometrical constructions, conics, representation of three-dimensional objects –
principles of projections – standard codes – projection of points.
PROJECTION OF LINES AND SOLIDS
Projection of straight lines, projection of solids – auxiliary projections
SECTIONS AND DEVELOPMENTS
Sections of solids and development of surfaces.
PICTORIAL PROJECTIONS
Conversion of projections: Orthographic projection, isometric projection of regular solids & combination of
solids.
BUILDING DRAWING
Building Drawing – plan, elevation and section of single storied residential (or) office building with flat RCC
roof and brick masonry walls having not more than 3 rooms (planning / designing is not expected in this
course).
TEXT BOOKS
Jeyapoovan, T., “Engineering Drawing and Graphics using AutoCAD 2000”, Vikas Publishing house Pvt
Ltd, NewDelhi, 2005.
Narayanan, K.L & Kannaiah, P., “Engineering Graphics”, Scitech Publications, Chennai, 1999.
REFERENCE BOOKS
1. Bhatt, N.D., “Elementary Engineering Drawing (First Angle Projection)”, Charotar Publishing Co.,
Anand, 1999.
2. Venugopal, K. “Engineering Drawing & Graphics”, New Age international Pvt. Ltd., 2001.
3. Natarajan, K.V. “Engineering Drawing & Graphics”, Private Publication, Chennai, 1990.
4. Shah, M.B. and Rana, B.C., “Engineering Drawing”, Pearson Education (Singapore) Pvt. Ltd., Delhi –
110 092, 2005.
SEMESTER – II
L T P C
GE 0108 VALUE EDUCATION 1 0 0 1
Prerequisite
Nil
PURPOSE
16 CS – 07-08-SRM – E&T
To provide guiding principles and tools for the development of the whole person, recognizing that the
individual is comprised of Physical Intellectual, Emotional and Spiritual dimensions.
INSTRUCTIONAL OBJECTIVES
To help individuals think about and reflect on different values.
To deepen understanding, motivation and responsibility with regard to making personal and social choices
and the practical implications of expressing them in relation to themselves, others, the Community and the
world at large.
To inspire individuals to choose their own personal, social, moral and spiritual values and be aware of
practical methods for developing and deepening them.
Value Education—Introduction – Definition of values – Why values? – Need for Inculcation of values – Object
of Value Education – Sources of Values – Types
Values:
i) Personal values
ii) Social values
iii) Professional values
iv) Moral and spiritual values
v) Behavioral (common) values
Personal values – Definition of person – Self confidence – Self discipline – Self Assessment – Self restraint –
Self motivation – Determination – Ambition – Contentment – Humility and Simplicity - Sympathy and
Compassion – Gratitude -Forgiveness – Honesty – Courtesy.
Social values – Definition of Society – Units of Society - Individual, family, different groups – Community –
Social consciousness – Equality and Brotherhood – Dialogue – Tolerance – Sharing – Responsibility – Cooperation
Freedom – Repentance and Magnanimity.
Professional values – Definition – Competence – Confidence – Devotion to duty –Efficiency – Accountablility
– Respect for learning /learned – Willingness to learn-Open and balanced mind – Team spirit – Professional
Ethic – Willingness for Discussion – Aims – Effort – Avoidance of Procrastination and slothfulness –Alertness.
Behavioral values – Individual values and group values – Good manners at home and outside – Equality –
Purity of thought, speech and action – Understanding the role of religion – Faith – Understanding the
commonness of religions – respect for other faiths – unity in diversity – Living together – Tolerance – Nonviolence
– Truthfulness – Common aim – Unified effort towards peace – Patriotism.
REFERENCE BOOKS
1. Dr. S. Ignacimuthu S. J., Values for life, Better yourself Books, Bandra Mumbai-600 050 (1999).
2. Values(Collection of Essays)., Published by : Sri Ramakrishna Math., Chennai—4.,(1996)
3. Prof. R.P.Dhokalia., Eternal Human Values NCRT –Campus Sri Aurobindo Marg., New Delhi - 110
011.
4. Swami Vivekananda., Education., Sri Ramakrishna Math., Chennai-4(1957)
5. Tirukural (English Translation by Dr.G.U.Pope).
6. The Bible
7. The Kuran
8. The Bagavath Geetha
L T P C
GE 0102 BIOLOGY FOR ENGINEERS 2 0 0 2
Prerequisite
Nil
PURPOSE
To provide a basic understanding of biological mechanisms from the perspective of engineers.
INSTRUCTIONAL OBJECTIVES
To familiarize the students with the basic organization of organisms and subsequent building to a living being.
With this knowledge, the student will be then imparted with an understanding about the machinery of the cell
17 CS – 07-08-SRM – E&T
functions that is ultimately responsible for various daily activities. Nervous and immune systems will be taught
as examples of this signaling machinery.
FROM ATOMS TO ORGANISMS
The Cell: the Basic Unit of Life - Molecular Components of Cells - Expression of Genetic Information - Protein
Structure and Function- Cell Metabolism - Cells Maintain Their Internal Environments - Cells Respond to
Their External Environments - Cells Grow and Reproduce - Cells Differentiate
THE MOLECULAR DESIGN OF LIFE
Biochemistry and the Genomic Revolution- . DNA Illustrates the Relation between Form and Function-
Biochemical Unity Underlies Biological Diversity-. Chemical Bonds in Biochemistry -. Biochemistry and
Human Biology-. Protein Synthesis Requires the Translation of Nucleotide Sequences Into Amino Acid
Sequences-.2. Aminoacyl-Transfer RNA Synthetases Read the Genetic Code- A Ribosome Is a
Ribonucleoprotein Particle (70S) Made of a Small (30S) and a Large (50S) Subunit-Protein Factors Play Key
Roles in Protein Synthesis-. Eukaryotic Protein Synthesis Differs from Prokaryotic Protein Synthesis Primarily
in Translation Initiation
CATALYTIC STRATEGIES
Proteases: Facilitating a Difficult Reaction-. Making a Fast Reaction Faster: Carbonic Anhydrases-. Restriction
Enzymes: Performing Highly Specific DNA-Cleavage Reactions- Nucleoside Monophosphate Kinases:
Catalyzing Phosphoryl Group Exchange between Nucleotides Without Promoting Hydrolysis- metabolismanabolism
and catabolism-photosynthesis and carbon fixation- biological energy production.
MECHANOCHEMISTRY
How Protein Motors Convert Chemical Energy into Mechanical Work- Brief Description of ATP Synthase
Structure- The F1 Motor: A Power Stroke-A Pure Power Stroke- Coupling and Coordination of Motors-
Measures of Efficiency- F1-Motor of ATP synthase- The Bacterial Flagellar Motor- Motor Driven by H_ and
Na_ Ion Flux- Proton Motive Force, Sodium-motive Force, Ion Flux- Molecular Motor Directionality- Chimeric
Kinesin Motors- Backwards Myosins- Chimeric Myosin Motors- Bidirectional Dyneins?
SENSORY AND IMMUNO SYSTEMS
General Principles of Cell Signaling-Signaling via G-Protein-linked Cell-Surface Receptors-Signaling via
Enzyme-linked Cell-Surface Receptors-Target-Cell Adaptation-The Logic of Intracellular Signaling: Lessons
from Computer-based "Neural Networks"-The Cellular Basis of Immunity-The Functional Properties of
Antibodies-The Fine Structure of Antibodies-The Generation of Antibody Diversity-T Cell Receptors and
Subclasses-MHC Molecules and Antigen Presentation to T Cells-Cytotoxic T Cells-Helper T Cells and T Cell
Activation-Selection of the T Cell Repertoire
TEXT BOOKS
1. J.M.Berg, J.L.Tymosczko and L.Sryer. Biochemistry,W.H. Freeman Publications.
2. STUDENT COMPANION to accompany Biochemistry, Fifth Edition -Richard I. Gumport
3. Frank H. Deis, Nancy Counts Gerber, Roger E. Koeppe, II Molecular motors
REFERENCE BOOKS:
1. Alberts, 2003 Molecular Biology of the cell
2. Lodish, 2004 Molecular cell biology
L T P C
GE 0104 PRINCIPLES OF ENVIRONMENTAL SCIENCE 2 0 0 2
Prerequisite
Nil
PURPOSE
The course provides the comprehensive knowledge in environmental science, environmental issues and the
management.
INSTRUCTIONAL OBJECTIVES
1. The importance of environmental education, ecosystem and ethics.
18 CS – 07-08-SRM – E&T
2. Knowledge with respect to biodiversity and its conservation.
3. To create awareness on the various environmental pollution aspects and issues.
4. To educate the ways and means to protect the environment.
5. Important environmental issues and protection
ENVIRONMENT AND ECOSYSTEMS
Environmental education: definition - scope - objectives and importance. Concept of an ecosystem – types
(terrestrial and aquatic ecosystems) – structure and function – ecological succession - food chains, food webs
and ecological pyramids
BIODIVERSITY
Introduction: definition - genetic, species and ecosystem diversity - value of biodiversity: consumptive use,
productive use, social, ethical, aesthetic and option values - threats to biodiversity: habitat loss, poaching of
wildlife - endangered and endemic species of India, Conservation of biodiversity: in-situ and ex-situ
conservations.
POLLUTION AND WASTE MANAGEMENT
Air and water pollution – classification of pollutants and their effects – control measures of air pollution. Waste
water treatment (general) – primary, secondary & tertiary stages. Solid waste management: causes - effects of
municipal waste, hazardous waste, bio medical waste - process of waste management.
CURRENT ENVIRONMENTAL ISSUES
Environmental ethics -issues and possible solutions- population explosion, climatic change, ozone layer
depletion, global warming, acid rain and green house effect. Sustainable development: definition, objectives
and environmental dimensions of sustainable development- environmental audit for sustainable development.
ENVIRONMENTAL PROTECTION
National and international concern for environment: Important environmental protection acts in India – water,
air (prevention and control of pollution) act, wild life conservation and forest act – functions of central and state
pollution control boards - international effort – key initiatives of Rio declaration, Vienna convention, Kyoto
protocol and Johannesburg summit.
TEXT BOOKS
1. Sharma.B.K. and Kaur, “Environmental Chemistry”“ Goel Publishing House, Meerut, 1994.
2. De.A.K., “Environmental Chemistry”, New Age International (p) lt., , New Delhi, 1996.
3. Kurian Joseph & R. Nagendran, “Essential of Environmental Studies”“ Pearson Education, 2004.
REFERENCE BOOKS
1. Dara S.S., A Text Book of Environmental Chemistry and pollution control, S.Chand & Company Ltd.,
New Delhi, 2004.
2. Jeyalakshmi.R, Principles of Environmental Science, 1st Edition, Devi Publications, Chennai 2006.
3. Kamaraj.P & Arthanareeswari.M, Environmental Science – Challenges and Changes, 1st Edition,
Sudhandhira Publications, 2007.
4. Arivalagan.K, Ramar.P & Kamatchi.P, Principles of Environmental Science, 1st Edition, Suji
Publications, 2007.
L T P C
MA 0102 MATHEMATICS - II 3 2 0 4
Prerequisite
MA0101
(Common to all Branches of Engineering except BT, BP, BI, BME, FPE, & GE)
PURPOSE
To impart analytical ability in solving mathematical problems as applied to the respective branches of
Engineering.
INSTRUCTIONAL OBJECTIVES
At the conclusion of the course, students should have understood Multiple Integrals , Laplace Transforms,
Vector Calculus and Functions of a complex variable including contour integration and able to apply to all their
Engineering problems.
19 CS – 07-08-SRM – E&T
MULTIPLE INTEGRALS
Double integration in Cartesian and polar coordinates – Change of order of integration – Area as a double
integral – Triple integration in Cartesian coordinates.
LAPLACE TRANSFORMS
Transforms of simple functions – Basic operational properties – Transforms of derivatives and integrals – Initial
and final value theorems – Inverse transforms – Convolution theorem – periodic functions – Applications of
Laplace transforms for solving linear ordinary differential equations up to second order with constant
coefficients only.
VECTOR CALCULUS
Gradient, divergence, curl – Solenoidal and irrotational fields – Vector identities (without proof) – Directional
derivatives – Line, surface and volume integrals – Statements of Green’s, Gauss divergence and Stroke’s
theorems only – Verification and applications to cubes and parallelopipeds only.
ANALYTIC FUNCTIONS
Definition of Analytic Function – Cauchy Riemann equations – Properties of analytic functions - Determination
of harmonic conjugate – Milne-Thomson’s method – Conformal mappings: 1/z, az az+b and bilinear
transformation.
COMPLEX INTEGRATION
Line integral – Cauchy’s integral theorem (without proof ) – Cauchy’s integral formulae (with proof) –
application of Cauchy’s integral formulae – Taylor’s and Laurent’s expansions (statements only) – Singularities
– Poles and Residues – Cauchy’s residue theorem (with proof) - Evaluation of line integrals.
TEXT BOOKS
1. Grewal B.S, Higher Engg Maths, Khanna Publications, 38th Edition.
2. Veerajan, T., Engineering Mathematics, Tata McGraw Hill Publishing Co., New Delhi,2000.
3. Dr.V.Ramamurthy & Dr. Sundarammal Kesavan, Engineering Mathematics – Vol I & II Anuradha
Publications, Revised Edition 2006.
REFERENCE BOOKS
1. Kreyszig.E, Advanced Engineering Mathematics, 8th edition, John Wiley & Sons. Singapore,2001.
2. Kandasamy P etal. Engineering Mathematics, Vol.I (4th revised edition), S.Chand &Co., New
Delhi,2000.
3. Narayanan S., Manicavachagom Pillay T.K., Ramanaiah G., Advanced Mathematics for Engineering
students, Volume I (2nd edition), S.Viswanathan Printers and Publishers, 1992.
4. Venkataraman M.K., Engineering Mathematics – First Year (2nd edition), National Publishing Co.,
Chennai,2000.
L T P C
PH 0102 MATERIALS SCIENCE 2 0 2 3
Prerequisite
Nil
PURPOSE
The purpose of this course is to develop comprehension of the rapidly changing technological scenario and the
requisite expertise for appropriate selection of materials for specific engineering applications.
INSTRUCTIONAL OBJECTIVES
At the end of the course, the student will be able to:
1. Understand electrical properties of materials,
2. Understand the properties and applications of semi conducting materials,
3. Understand general properties and applications of magnetic and dielectric materials,
4. Understand the behaviour of materials on exposure to light,
5. Understand general properties and application of modern engineering and bio materials, and
6. Get familiarized with the concepts of Nano Science and Technology.
20 CS – 07-08-SRM – E&T
ELECTRONIC AND PHOTONIC MATERIALS
Electronic materials: Importance of Classical and Quantum free electron theory of metals – Fermi energy and
Fermi Dirac distribution function – Variation of Fermi level with temperature in intrinsic and extrinsic
semiconductors – Hall effect – Dilute Magnetic Semiconductors (DMS) and their applications – High
temperature Superconductivity. Photonic materials: LED and LCD materials – Photo conducting materials –
Nonlinear optical materials (elementary ideas) and their applications.
MAGNETIC, DIELECTRIC AND MODERN ENGINEERING MATERIALS
Magnetic materials: Ferrites and garnets – Magnetic bubbles and their applications – Giant Magneto
Resistance (GMR) – Colossal Magneto Resistance (CMR). Dielectric materials: Various polarization
mechanisms in dielectrics (elementary ideas) and their frequency and temperature dependence – Dielectric loss
– Piezo electric and ferro electric materials and their applications. Modern engineering materials: Shape
memory alloys – Metallic glasses – Advanced ceramics and composites.
BIO MATERIALS
Classification of biomaterials – Comparison of properties of some common biomaterials – Effects of
physiological fluid on the properties of biomaterials – Biological responses (extra and intra vascular system) –
Metallic, Ceramic and Polymeric implant materials – Introduction to bio sensors and tissue engineering.
NANO MATERIALS AND NANOTECHNOLOGY
Basic concepts of Nano science and technology – Quantum wire – Quantum well – Quantum dot – Properties
and technological advantages of Nano materials – Carbon Nanotubes and applications – Material processing
by Sol – Gel method, Chemical Vapour deposition and Physical Vapour deposition – Microwave Synthesis of
materials – Principles of SEM, TEM and AFM .
MECHANICAL PROPERTIES OF MATERIALS
Stress Strain diagram for different engineering materials – Engineering and true stress strain diagram – Ductile
and brittle material – Tensile strength – Hardness – Impact strength – Fatigue – Creep – Fracture (Types and
Ductile to brittle transition) – Factors affecting mechanical properties.
PRACTICALS
1. Band gap determination using Post office box.
2. Dielectric constant measurement.
3. Photoconductivity measurement.
4. Resistivity determination for a semiconductor wafer using Four probe method.
5. Determination of Hall coefficient and carrier type for a semiconductor material.
6. To trace the hysteresis loop for a magnetic material.
7. Magnetic susceptibility – Quincke’s method.
8. Determination of thermal conductivity – Lee’s Disc method
9. Visit to Nano Technology Laboratory (optional)
TEXT BOOKS
1. S.O. Kasap, Principles of Electronic Materials and Devices, Tata McGraw Hill Edition, New Delhi,
2002.
2. Van Vlack, L.H., Material Science for Engineers, 6th edition, .Addision Wesley, 1985.
3. Thiruvadigal, J. D., Ponnusamy, S. and Vasuhi.P. S., Materials Science, 5th edition, Vibrant
Publications, Chennai, 2007.
REFERENCE BOOKS
1. Rolf E. Hummel, Electronic Properties of materials, Narosa Publishing House, New Delhi, 1994.
2. Raghavan.V., Materials Science & Engineering – A First Course, 5th edition, Prentice Hall of India,
New Delhi,2005.
3. Khanna. O. P., A Text Book of Material Science & Metallurgy, Revised edition, Dhanpat Rai
Publications, New Delhi,2006.
4. Sujata V. Bhat, Biomaterials, 2nd edition, Narosa Publishing House, New Delhi, 2006.
5. Mick Wilson, Kamali Kannangara, Michells Simmons and Burkhard Raguse, Nano Technology – Basic
Science and Emerging Technologies, 1st edition, Overseas Press,New Delhi,2005.
21 CS – 07-08-SRM – E&T
L T P C
GE 0106 BASIC ENGINEERING – II 4 0 0 4
Prerequisite
Nil
PURPOSE
This course provides comprehensive idea about circuit analysis, working principles of machines and common
measuring instruments. It also provides fundamentals of electronic devices, transducers and integrated circuits.
INSTRUCTIONAL OBJECTIVES
1. At the end of the course students will be able
2. To understand the basic concepts of magnetic, AC & DC circuits.
3. To explain the working principle, construction, applications of DC & AC machines & measuring
instruments.
4. To gain knowledge about the fundamentals of electric components, devices, transducers & integrated
circuits.
PART A ELECTRICAL ENGINEERING
ELECTRICAL MACHINES
Definition of mmf, flux and reluctance, leakage flux, fringing, magnetic materials and B-H relationship.
Problems involving simple magnetic circuits.Faraday’s laws, induced emfs and inductances, brief idea on
Hysteresis and eddy currents. Working principle, construction and applications of DC machines and AC
machines (1-phase transformers, 3-phase induction motors, single phase induction motors – split phase,
capacitor start and capacitor start & run motors).
AC & DC CIRCUITS
Circuit parameters, Ohms law, Kirchhoff’s law. Average and RMS values, concept of phasor representation.
RLC series circuits and series resonance, RLC parallel circuits (includes simple problems in DC & AC circuits)
Introduction to three phase systems – types of connections, relationship between line and phase values.
(qualitative treatment only)
WIRING & LIGHTING
Types of wiring, wiring accessories, staircase & corridor wiring, Working and characteristics of incandescent,
fluorescent, SV & MV lamps. Basic principles of earthing, simple layout of generation, transmission &
distribution of power.
TEXT BOOKS
1. Kothari D P and Nagrath I J , Basic Electrical Engineering , Tata McGraw Hill,1991
2. Mehta V K ,Principles of Electronics S Chand & Co,1980
REFERENCE BOOKS
1. Kothari D P and Nagrath I J ,Basic Electrical Engineering , Tata McGraw Hill,1991
2. Mithal G K , Electronic Devices and Circuits, Khanna Publications,1997
PART B ELECTRONICS ENGINEERING
ELECTRONIC COMPONENTS AND DEVICES
Passive components – Resistors, Inductors and Capacitors and their types.
Semiconductor: Energy band diagram, Intrinsic and Extrinsic semiconductors, PN junction diodes and Zener
diodes – characteristics.
Transistors: PNP and NPN transistors – theory of operation – Transistor configurations – characteristics –
comparison.
Special semiconductor devices : FET – SCR – LED – V I characteristics – applications.
Rectifiers: Half wave and full wave rectifier – capacitive filter – wave forms – ripple factor – regulation
characteristics.
TRANSDUCERS AND MEASURING INSTRUMENTS
22 CS – 07-08-SRM – E&T
Transducers: General features and classification of transducers, Resistive Transducers – Potentiometer,
Unbonded strain gauge-Bonded strain gauge-Load cell, Inductive transducers – Differential output transducers –
LVDT, Flow transducers, Temperature Transducers – Thermistors, Thermocouple and pyrometers.
Measuring Instruments: Basic principles and classification of instruments, Moving coil and moving iron
instruments, CRO – Principle of operation.
DIGITAL ELECTRONICS & LINEAR ICs
Digital Fundamentals: Number systems – Boolean Theorems – DeMorgan’s Theorem - Logic gates –
Implementation of Boolean Expression using Gates.
Integrated Circuits: IC fabrication – Monolithic Technique, Function of Operational Amplifier.
TEXT BOOKS
1. Muthusubramanian.R, Salivahanan.S, Muraleedharan.K.A, “Basic Electrical, Electronics and
Computer Engineering”, Tata McGraw - Hill ,1999.
2. Metha V.K, “Principles of Electronics “,S. Chand & Co.,1980.
3. Kalsi H S, Electronics Instrumentation”, ISTE publication,1995
REFERENCE BOOKS
1. Kothari D. P and Nagrath IJ, “Basic Electrical Engineering”, Tata McGraw- Hill, 1991.
2. Thomas L.Floyd “Electronic devices”, Addison Wesley Longman (Singapore) Pvt . Ltd., 5th Edition.
L T P C
CS0102 DIGITAL COMPUTER FUNDAMENTALS 3 0 2 4
Prerequisite
NIL
PURPOSE
This course is to develop a strong foundation in the field of digital electronics
To learn the fundamentals of digital Computer and its components
INSTRUCTIONAL OBJECTIVES
1. Number System and Boolean Algebra
2. Sequential and Combinational Logic
3. Synchronous and asynchronous circuits
4. State diagrams
NUMBER SYSTEMS & BOOLEAN ALGEBRA
Digital Computers and digital systems-Review of binary number systems-Number conversion-Complements-
Binary Arithmetic-Binary codes-Boolean Algebra and Theorems-Canonical and standard forms-Simplification
of Boolean functions using Karnaugh map & tabulation methods
IMPLEMENTATION OF COMBINATIONAL LOGIC DESIGN
Logic gates-Combinational Circuits-Analysis and design procedure-Binary Adder and Subtractor- Decimal
adder -Encoder-Decoder-Multiplexer-Demultiplexer-Binary parallel adders- -Magnitude comparators-Read-
Only Memory(ROM)-Programmable Logic Array(PLA)-Programmable Array Logic(PAL)
DESIGN OF SYNCHRONOUS SEQUENTIAL CIRCUITS
Sequential circuits-Latches-Flip-flops-Analysis of clocked sequential circuits-State reduction and state
assignment-Design procedure- Design of counters. Shift registers and ripple counters
ASYNCHRONOUS SEQUENTIAL LOGIC
Analysis and design procedure-Reduction of state and flow tables-Race and Free State assignment-Hazards
HARDWARE DESCRIPTION LOGIC
Introduction to Hardware Description Language (HDL)-HDL for combinational circuits
23 CS – 07-08-SRM – E&T
PRACTICAL
1. Verification of Gates & Flip Flops
2. Adders
3. Multiplexers & Demultiplexers
4. Counters
5. Shift registers
6. Encoders & Decoders
TEXT BOOKS
1. M.Morris Mano, “Digital Logic and Computer Design”, PHI,2001 (Chapter 1, 2, 3 for UNIT-I)
2. M.Morris Mano,”Digital Design”,Third edition,Pearson Education,2002(Chapter 2,4,7 for UNIT-II,
Chapter 5,6 for UNIT-III,Chapter 9 for UNIT-IV ,Chapter 3.9 and 4.11 for UNIT-V)
REFERENCE BOOKS
1. Raj Kamal ,” Digital Systems Principles and Design”, Pearson Education,2007
2. Charles H.Roth, Jr.” Fundamentals of Logic Design”, 4th edition, Jaico publishing House,1995
3. Donald D.Givone, “Digital Principles and Design”, TataMcGraw –Hill ,2003.
ONLINE REFERENCE
http://www.elec.gla.ac.uk/coursedb/7ltv.pdf
L T P C
PD 0102 PERSONALITY DEVELOPMENT - II 0 0 2 0
Prerequisite
Nil
PURPOSE
The purpose of this course is to build confidence and inculcate various soft skills and to help Students to identify
and achieve their personal potential
INSTRUCTIONAL OBJECTIVES
1. To guide thought process.
2. To groom students' attitude.
3. To develop communication skill.
4. To build confidence.
METHODOLOGY
The entire program is designed in such a way that every student will participate in the class room activities. The
activities are planned to bring out the skills and talents of the students which they will be employing during
various occasions in their real life.
1. Group activities + individual activities.
2. Collaborative learning.
3. Interactive sessions.
4. Ensure Participation.
5. Empirical Learning
Puzzles I - Poster design/Caption/Slogan writing (Social issues) - Bone of contention I – debate
Bone of contention II - Puzzle II - Survey and Reporting (favorite channel, music, food)
Interpretation of Visuals of I & II - Vocabulary games III
Book Review - Quiz I - Presentation Skills I
Presentation Skills II - Analytical Thinking - Review
EVALUATION
1. Activities assessed by both group and individual participation
24 CS – 07-08-SRM – E&T
2. Continuous assessment based on daily participation
SCHEME OF INSTRUCTION
Marks allocated for regular participation in all oral activities in class
SCHEME OF EXAMINATION
Complete Internal evaluation on a regular Basis
L T P C
CS0112 PROGRAMMING IN C 2 0 2 3
Prerequisite
NIL
PURPOSE
To familiarize the students with the fundamentals and programming basics of C language.
INSTRUCTIONAL OBJECTIVES
1. To learn the basics of C declarations, operators and expressions.
2. To work on all the elementary statements (Loop, Branch) and arrays.
3. To learn on the manipulation of strings, functions and pointers.
THEORY:
Character set - Identifiers and keywords – Data types – Constants - Variables and Arrays – Declarations –
Expressions – Statements - Operators – Library functions – Input, Output statements- If –While-Do-While –
Break – Continue – switch-case statements.
Functions –– calling Functions – Passing arguments - Storage Classes – Arrays – Defining and processing an
array - Passing arrays to Functions –Multidimensional Arrays – Strings- Pointer declarations - Passing
pointers to a function – Operations on Pointers – Pointers and Multidimensional Arrays - Arrays of pointers.
Structures & Unions: definition – Processing structures – Passing structures to a function – User defined data
types - bitwise operators – Files: File creation – File processing – Opening and closing a file.
LIST OF EXPERIMENTS
Program to understand the basic data types.
Program on Fibonacci series.
Finding a factorial for a given number.
Programs using Built-in math functions.
Conversions: Hex to Decimal, Binary to Octal etc.
Matrix operations: Multiplication, Symmetric, Inverse.
Working on bitwise operators.
Student mark processing using structures.
Arithmetic operations using functions (with and without) return values.
Program on string manipulations (finding length, concatenation, comparison, etc).
Program to perform arithmetic operations (add, sub, mul, etc) through variables and pointers.
Program on basic file operations.
TEXT BOOK
1. Ashok N. Kamthane., “Programming with ANSI and Turbo C”,Pearson Education, 2007.
REFERENCE BOOKS
1. Sheela Kumar.T., Sridhar.S.S. , “Computer Practice “, Anuradha Publishers, 2003.
2. Balaguruswamy .E. “Programming in ANSI C”, Tata McGraw Hill, 2004.
3. Mullish Cooper, “The Sprit of C”, Jaico Books, 2002
L T P C
ME 0130 ENGINEERING GRAPHICS 1 0 4 3
Prerequisite
25 CS – 07-08-SRM – E&T
Nil
(Only First Angle Projection is to be followed)
PURPOSE
1. To draw and interpret various projections of 1D, 2D and 3D objects.
2. To prepare and interpret the drawings of buildings.
INSTRUCTIONAL OBJECTIVES
To familiarize with
1. The construction of geometrical figures
2. The projection of 1D, 2D & 3D elements
3. Sectioning of solids and development of surfaces
4. Preparation and interpretation of building drawing
FUNDAMENTALS OF ENGINEERING GRAPHICS
Lettering, two dimensional geometrical constructions, conics, representation of three-dimensional objects –
principles of projections – standard codes – projection of points.
PROJECTION OF LINES AND SOLIDS
Projection of straight lines, projection of solids – auxiliary projections
SECTIONS AND DEVELOPMENTS
Sections of solids and development of surfaces.
PICTORIAL PROJECTIONS
Conversion of projections: Orthographic projection, isometric projection of regular solids & combination of
solids.
BUILDING DRAWING
Building Drawing – plan, elevation and section of single storied residential (or) office building with flat RCC
roof and brick masonry walls having not more than 3 rooms (planning / designing is not expected in this
course).
TEXT BOOKS
1. Jeyapoovan, T., Engineering Drawing and Graphics using AutoCAD 2000, Vikas Publishing house Pvt
Ltd, NewDelhi, 2005.
2. Narayanan, K.L & Kannaiah, P., Engineering Graphics, Scitech Publications, Chennai, 1999.
REFERENCE BOOKS
1. Bhatt, N.D., Elementary Engineering Drawing (First Angle Projection), Charotar Publishing Co.,
Anand, 1999.
2. Venugopal, K. Engineering Drawing & Graphics, New Age international Pvt. Ltd., 2001.
3. Natarajan, K.V. Engineering Drawing & Graphics, Private Publication, Chennai, 1990.
4. Shah, M.B. and Rana, B.C., Engineering Drawing, Pearson Education (Singapore) Pvt. Ltd., Delhi –
110 092, 2005.
L T P C
ME 0120 WORKSHOP PRACTICE 0 0 4 2
Prerequisite
Nil
PURPOSE
To provide the students with hands on experience on different trades of engineering like fitting, carpentary,
smithy, welding and sheet metal.
INSTRUCTIONAL OBJECTIVES
To familiarize with
1. The basics of tools and equipments used in fitting, carpentry, sheet metal, welding and smithy.
26 CS – 07-08-SRM – E&T
2. The production of simple models in the above trades.
LIST OF EXPERIMENTS
EMPHASIS TO BE LAID ON REAL LIFE APPLICATIONS WHEN FRAMING THE EXERCISES.
FITTING
Tools & Equipments – Practice in Filing and Drilling.
Making Vee Joints, Square, dovetail joints, Key making.
CARPENTRY
Tools and Equipments- Planning practice. Making Half Lap, dovetail, Mortise & Tenon joints, a mini model of
a single door window frame.
SHEET METAL
Tools and equipments - Fabrication of a small cabinet, Rectangular Hopper, etc.
WELDING
Tools and equipments - Arc welding of butt joint, Lap Joint, Tee Fillet. Demonstration of Gas welding, TIG &
MIG.
SMITHY
Tools and Equipments –Making simple parts like hexagonal headed bolt, chisel.
TEXT BOOK
1. Gopal, T.V., Kumar, T., and Murali, G., “A first course on workshop practice – Theory, practice and
work book”, Suma Publications, 2005.
REFERENCE BOOKS
1. Kannaiah,P. & Narayanan,K.C. Manual on Workshop Practice, Scitech Publications, Chennai, 1999.
2. Venkatachalapathy, V.S. First year Engineering Workshop Practice, Ramalinga Publications, Madurai,
1999.
SEMESTER – III
L T P C
LE0201 GERMAN LANGUAGE PHASE I 2 0 0 2
Prerequisite
Nil
Instructional Objectives for beginners with no knowledge of German acquiring basic verbal and communication
skills.
INTRODUCTION
German Language, Alphabets and Pronunciation.
THEMEN
Name, Land, Leute, Beruf, Familie geschwister, Einkaufen, Reisen, Zahlen, Haus, Freunden, Essen and
Stadium, Fest, Zeit.
LISTENING
Listening to the cassette and pay special attention to the meaning and sounds. Listening Comprehension –
Announcements / Airport / Station / General.
READING
Listening to the cassette and reading it allowed.
READING COMPRENSION BASICS / STATION / NEWS / NOTICE BOARDS.
GLOSSARY
Technical Words Lesson (1-5)
27 CS – 07-08-SRM – E&T
TEXT BOOK WITH CASSETTES
1. Grundkurs Deutsch
2. Momentmal (Max Mueller Bhavan – Goethe Institute, Germany).
L T P C
LE0203 JAPANESE LANGUAGE PHASE I 2 0 0 2
Prerequisite
Nil
OBJECTIVE: for beginners with no Knowledge of Japanese to acquire basic communication Skills.
Alphabets (Hiragana ), Self Introduction, Greetings, Classroom expressions, Numbers,
Conversation.
Alphabets Hiragana (continued),Vocabularies.
Counters .Time expression. Conversation
Katakana and related vocabulary.
Kanjis –introduction. conversation.
Lesson-1 Watashiwa Nihonjin desu. Grammar,Marume &Sentence pattern.Marume.
Conversation.
TEXT BOOKS
1. Nihongo Shoho I main Text sold in India by the Japanese Language Teachers Association Pune.
2. Hiragana and Katakana Work Book published by AOTS Japan
3. Grammar and Kotoba ( Work Book )
4. Japanese for Dummies.(Conversation) CD.
L T P C
LE0205 FRENCH LANGUAGE PHASE I 2 0 0 2
Prerequisite
Nil
Objective:
To acquire basic knowledge in French, with communication skills.
INTRODUCTION AND PRONUNCIATION
Introduction of the French Language, Alphabets and Pronunciation, Greetings (Wishing, Thanking and Bidding
good bye), Introducing oneself & someone Presenter quelqu’un et se presenter - conversational French
sentences based on the topics discussed above.
VOCABULARY
Numbers and Dates, Days, Months and Seasons, Time, Nouns, Professions and Nationalities. C;onversational
sentences on weather, time, and professions.
GRAMMAR
Basic Verbs (Avoir, Etre, Aller, Faire) – Conjugation – Present tense, Affirmative, Negative, Interrogative,
Adjectives (Qualitative), Subject Pronouns and Disjunctive Pronouns.
CONVERSATION AND LISTENING
28 CS – 07-08-SRM – E&T
Conversational sentences on physical description and expressions with verbs like avoir, etre and faire
GRAMMAR
Prepositions ( a, de,dans, en, sur,sous, pour….),Contracted Articles, Question Tag
(Qui, Quel, Ou, ……etc)
TEXT BOOK:
1. Panorama – Goyal Publishers
2. Apprenons le Francais I, Sarawathy publication.
L T P C
MA0211 MATHEMATICS – III 3 1 0 4
Prerequisite
MA0101, MA0102
(Common for EEE, ECE, IT, CSE, ICE & EIE)
PURPOSE
To inculcate the problem solving ability in the minds of students so as to apply the theoretical knowledge to the
respective branches of Engineering.
INSTRUCTIONAL OBJECTIVES
At the end of the course, the student should be able to
1. Have thorough knowledge in fourier series.
2. Exposed to solving problems using partial differential equations.
3. Be familiar with one and two dimensional wave and heat equations.
4. Gain good knowledge in the application of fourier transforms.
FOURIER SERIES
Dirichlet’s conditions – General Fourier series – Half range Sine and Cosine series – Parseval’s identity –
Harmonic Analysis.
PARTIAL DIFFERENTIAL EQUATIONS
Formation – Solution of standard types of first order equations – Lagrange’s equation – Linear homogeneous
partial differential equations of second and higher order with constant coefficients - Classification of second
order linear partial differential equations.
ONE DIMENSIONAL WAVE & HEAT EQUATION
Boundary and initial value problems - Transverse vibrations of elastic string with fixed ends – Fourier series
solutions – One dimensional heat equation - Steady and transient states – problems.
TWO DIMENSIONAL HEAT EQUATION
Two dimensional heat equation – Steady state heat flow equation – Laplace Equation Cartesian form – Laplace
equation in polar form – heat flow in circular plates including annulus - Fourier series solution.
FOURIER TRANSFORMS
Statement of Fourier integral theorem – Fourier transform pairs – Fourier Sine and Cosine transforms –
Properties – Transforms of simple functions – Convolution theorem – Parseval’s identity.
TEXT BOOKS
1. Grewal B.S., Higher Engineering Mathematics, 36th edition, Khanna Publishers, 2002. (Unit I – Chapter 10
Section 10.2 – 10.7, 10.9, 10.11 Unit II – Chapter 17 Section 17.2, 17.5, 17.6, 17.8 – 17.10, Chapter 28
Section 28.2, Unit III – Chapter 18 section 18.4 (2), 18.5(2), Unit IV – Chapter 18 Section 18.7, 18.8(1)
Unit V – Chapter 22 section 22.3 – 22.7).
REFERENCE BOOKS
1. Kreyszig.E, Advanced Engineering Mathematics, 8th edition, John Wiley & Sons, Singapore, 2000.
2. Kandasamy P etal. Engineering Mathematics, Vol. II & Vol. III (4th revised edition), S.Chand & Co., New
Delhi, 2000.
3. Narayanan S., Manicavachagom Pillay T.K., Ramanaiah G., Advanced Mathematics for Engineering
students, Volume II & III (2nd edition), S.Viswanathan Printers and Publishers, 1992.
29 CS – 07-08-SRM – E&T
4. Venkataraman M.K., Engineering Mathematics – Vol.III – A & B (13th edition), National Publishing Co.,
Chennai, 1998.
L T P C
CS0201 DATA STRUCTURES USING C++ 3 0 0 3
Prerequisite
NIL
PURPOSE
The purpose of this course is to impart knowledge on various data structure concepts to the students.
INSTRUCTIONAL OBJECTIVES
At the end of the course, student should be able to understand
1. Several data structures concepts like stack, queues, linked list, trees and files
2. Applications of data structures
3. Problem solving using data structure tools and techniques
INTRODUCTION
Introductory concepts of C++-Data types-Control structures-Definitions of Data Structure and Algorithm -The
Abstract Data Type-Algorithm efficiency-Searching-List structures-Hashed List structures-Basic concepts-
Hashing methods
LINKED LISTS
Linear and Linked List concepts-Linked List Algorithms-Processing a Linked List-List Applications-Complex
Linked List Structures-Implementation-Case studies
STACKS AND QUEUES
STACKS: Basic Operations- Linked List Implementation- Applications-Stack ADT-Array Implementation-
QUEUES: Operations-Linked List design-Implementation-Case study-Overflow and underflow of stack size
TREES AND GRAPHS
TREES: Basic Tree Concepts-Binary Trees- Tree Traversals- General Trees- Search Trees: Binary Search
Trees-AVL trees-GRAPHS: Operations-Depth First Traversal-Breadth First Traversal-Implementation-Storage
Structures-Case studies
SORTING CONCEPTS
General Sort concepts-Insertion Sort-Shell Sort-Selection Sort-Heap Sort-Exchange Sort-Bubble sort-Quick
Sort-Case studies
TEXT BOOK:
1. RICHARD F.GILBERG AND BEHROUZ A.FOROUZAN “DATA STRUCTURES - A Pseudo code
Approach with C++”,THOMSON ASIA, 2005.
REFERENCE BOOKS:
1. HERBERT SCHILDT “The Complete Reference C++” Fourth Edition, TataMcGraw Hill Edition,
2003.
2. YEDIDYAH LANGSAN, MOSHE J. AUGENSTEIN AND AORON M. TANENBAUM “Data
Structures using C and C++”, Prentice-Hall of India Pvt Ltd, 2004.
30 CS – 07-08-SRM – E&T
3. SARTAJ SAHNI “Data Structures, Algorithms and Applications in C++”, McGraw-Hill International
Edition, 2000.
4. MARK ALLEN WEISS, “Data Structures and Algorithm Analysis in C++” Addison-Wesley
Publishing Company, 1994.
5. AHO, HOPCROFT, ULLMAN – “Data Structures and algorithms” – Pearson Education – 1983.
6. JEAN PAUL TREMBLAY & PAUL SORENSON – “An Introduction to Data Structures with
Applications” – TMH – 1984.
ONLINE REFERENCES
http://www.cmpe.boun.edu.tr/~akin/cmpe223/homepage.htm
http://www.csie.ndhu.edu.tw/~rschang/dscontent.htm
L T P C
CS0203 DESIGN AND ANALYSIS OF ALGORITHMS 3 0 0 3
Prerequisite
MA 0102 & MA0211
PURPOSE
This course will provide an understanding of how to write algorithms for various problems and do an analysis of
the same
INSTRUCTIONAL OBJECTIVES
1. Divide and Conquer , Dynamic Programming techniques
2. Backtracking , NP complete problems
3. Various analysis of algorithms
ANALYSIS OF ALGORITHM
Introduction - Algorithms – Pseudo code for algorithms – present – future. Mathematics for Algorithms –
Definitions – Notation and Basic results – Asymptotic Notation- Mathematical Induction – Analysis of
Algorithms - Recurrence relations.
DIVIDE AND CONQUER METHOD
General Method - Binary Search – Finding Maximum and Minimum – Merge Sort – Quick Sort Greedy
Method – General Method – KnapSack Problem – Minimum Spanning Tree Algorithm – Single Source Shortest
Path Algorithm.
DYNAMIC PROGRAMMING
General Method–Multistage Graph – All Pairs Shortest Path Algorithm – 0/1 Knapsack Problem – Traveling
Salesman Problem - Basic search techniques and traversal techniques –bi-connected components – Depth First
Search – Breadth First Search.
BACKTRACKING
The General Method – 8-Queens Problem- Sum of Subsets – Graph Coloring- Hamiltonian Cycle-Knapsack
Problem – Branch and Bound Method – 0/1 Knapsack Problem – Traveling Salesman Problem
P and NP
Polynomial time – Nondeterministic Algorithms and NP – Reducibility and NP completeness – NP complete
Problems – More on NP completeness. Case studies
TEXT BOOKS
1. E.Horowitz , Sahni & Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”, Galgotia
Publications,1997
2. Richard Johnsonbaugh , Marcus Schaefer , “ Algorithms “ , Pearson Education, 2006
3rd edition (chapter 1,2,10)
REFERENCE BOOKS
1. Aho, Ullman & Hopcraft, “The Design and Analysis of Algorithms”, Pearson Education, 2001
2. S.E.Goodman , S.T.Hedetniemi , “Introduction to the Design and Analysis of Algorithms”, McGraw Hill ,
2002
31 CS – 07-08-SRM – E&T
3. Sara Baase , “Computer Algorithms - Introduction to design and analysis”, Pearson Education, 1998
ONLINE RESOURCE
http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html
L T P C
CS0205 MICROPROCESSOR AND INTERFACING 3 0 0 3
Prerequisite
NIL Same as IT0202
PURPOSE
The purpose of this course is to impart knowledge of microprocessor architecture and programming, interfacing
and coprocessors which gives foundation to advanced microprocessor architecture and programming.
INSTRUCTIONAL OBJECTIVES
In this course, students learn the following topics:
1. Architecture of 8086 & 8088 microprocessors
2. Instruction sets of 8086/88 and programming.
3. Math Coprocessor & I/O processor and multiprocessor configuration
4. Interfacing of microprocessor with various peripheral devices
INTEL 8085 ARCHITECTURE
Introduction to 8085 - 8085 architecture- Instruction Set & Assembler Directives- Assembly Language
Programming with 8085.
INTEL 8086/8088 ARCHITECTURE
Introduction to 8086/8088 - 8086/8088 architecture- Instruction Set & Assembler Directives- Assembly
Language Programming with 8086/8088- Special Architectural Features.
COMMUNICATION INTERFACES
Basic Peripherals & their interfacing with 8086/8088-Semiconductor Memory Interfacing-Dynamic RAM
Interfacing-Interfacing I/O Ports-PIO 8255-Modes of Operation-Interfacing Analog to Digital Data Converters-
Stepper Motor Interfacing
PERIPHERAL INTERFACES
Special Purpose Programmable Peripheral Devices & their Interfacing-Programmable Interval Timer 8253-
Programmable Interrupt Controller 8259A-DMA Controller 8257-DMA Transfers & Operations-Programmable
DMA Interface 8237.
MULTIPROCESSOR SYSTEMS
Interconnection Topologies- Software Aspects of Multiprocessor Systems- Numeric Processor 8087- Bus
Arbitration & Control- Tightly Coupled & Loosely Coupled Systems.
TEXT BOOK
1. Ray A K, K M Bhurchandi, “Advanced Microprocessor & Peripherals”, Tata McGraw Hill,1st
Edition,2000.(CH1,CH2,CH3,CH4,CH5,CH6,CH7,CH8,CH16.)
REFERENCE BOOKS
1. Douglas V Hall, “Microprocessor & Interfacing”, Tata McGraw Hill, 2nd Edition,1999.
2. Rafiquzzuman M, “Microprocessor theory & Applications”, Prentice Hall of India,1994.
3. Yuchenhiu, Glenn A Gibson, “Microprocessor Systems - 8086/8088 Family”, Prentice
Hall of India, 2nd Edition, 1986.
32 CS – 07-08-SRM – E&T
ONLINE REFERENCES
1. www.emu8086.com
2. www.cpu-world.com
3. www.hobbyprojects.com
4. www.8052.com
L T P C
CS0207 COMPUTER ORGANIZATION AND ARCHITECTURE 3 0 0 3
Prerequisite
CS0102
PURPOSE
The purpose of this course is to give a strong foundation of the computer organization and its internal
architecture.
INSTRUCTIONAL OBJECTIVES
1. Gives a knowledge of various architectures
2. CPU, Control unit, I/O Processing
3. Memory and its types
4. Design of the above components
INTRODUCTION
Evolution of Computer Systems-Computer Types-Functional units-Basic operational concepts-Bus structures-
Memory location and addresses-memory operations- Addressing modes-Design of a computer system-
Instruction and instruction sequencing, RISC versus CISC.
CENTRAL PROCESSING UNIT
Introduction-Arithmetic Logic Unit - Fixed point arithmetic, floating point arithmetic-Execution of a complete
instruction-Basic concepts of pipelining.
CONTROL UNIT DESIGN
Introduction-Control Transfer-Fetch cycle - Instruction Interpretation & Execution - Hardwired control -
Microprogrammed control.
MEMORIES AND SUBSYSTEMS
Semiconductor memory - Static and Dynamic -Associative memory- Cache memory- Virtual memory-
Secondary memories-Optical magnetic tape & magnetic disks & controllers.
I/O PROCESSING
Introduction-Data transfer techniques- Bus Interface- I/O Channel-I/O Processor, I/O devices -Direct memory
access.
TEXT BOOK
1.Carl Hamacher,”Computer Organization”,Fifth Edition,McGrawHill International Edition, 2002
REFERENCE BOOKS
1. P.Pal Chaudhuri, "Computer Organization and Design" , 2nd Edition, PHI ‘ 2003
2. William Stallings , “Computer Organization and Architecture – Designing for Performance”, PHI, 2004.
3. John P.Hayes, "Computer Architecture and Organization", III Edition, McGraw Hill International Editions,
1998.
ONLINE REFERENCES:
www.amazon.com
www.freebookcentre.com
33 CS – 07-08-SRM – E&T
L T P C
PD 0201 PERSONALITY DEVELOPMENT - III 0 0 2 1
Prerequisite
Nil
PURPOSE
The purpose of this course is to build confidence and inculcate various soft skills and to help Students to identify
and achieve their personal potential
INSTRUCTIONAL OBJECTIVES
1. To guide thought process.
2. To groom students' attitude.
3. To develop communication skill.
4. To build confidence.
METHODOLOGY
The entire program is designed in such a way that every student will participate in the class room activities. The
activities are planned to bring out the skills and talents of the students which they will be employing during
various occasions in their real life.
1. Group activities + individual activities.
2. Collaborative learning.
3. Interactive sessions.
4. Ensure Participation.
5. Empirical Learning
Goal Setting - Problem Solving - Emotional Quotient
Assertiveness - Stress Management - Quiz II
Lateral Thinking (Situational) - Team Work (Role Plays) Impromptu - Text Analysis
Business plan presentation I - Business plan presentation II - Chinese Whisper
Picture Perfect - Case Studies – Review
SCHEME OF INSTRUCTION
Marks allocated for regular participation in all oral activities in class
SCHEME OF EXAMINATION
Complete Internal evaluation on a regular Basis
L T P C
CS0211 MICROPROCESSOR LAB 0 0 3 2
Prerequisite
NIL
PURPOSE
This Lab Course will enable the students to implement some simple logic at assembly level.
INSTRUCTIONAL OBJECTIVES
To do any kind of operations (8 bit addition, subtraction, Multiplication and division) with 8085 microprocessor
To implement interfacing of 8086 with various peripheral devices
34 CS – 07-08-SRM – E&T
LIST OF EXERCISES
Study of Peripherals & interfacing.
8085 Experiments:
8-bit Addition, Multiplication &Division.
16-bit Addition, Multiplication &Division.
Counters and Time Delay
BCD to Hexadecimal & vice-versa.
Traffic light control.
Stepper motor control.
8086 Experiments:
Basic arithmetic & Logical operations.
Sorting & searching algorithms.
Data transfer instructions.
RAM size & system date.
Digital clock
Key board & printer status.
Password checking.
Serial interface & parallel interface
Trouble shooting.
REFERENCE: Laboratory manual
L T P C
CS0213 DATA STRUCTURES AND ALGORITHMS LAB (C & C++) 0 0 3 2
Prerequisite
CS0112
PURPOSE
This laboratory course gives a thorough understanding of the concepts of various Data Structures and its
applications. It also gives a comprehensive understanding of the various algorithms for problems
INSTRUCTIONAL OBJECTIVES
1. Implementing Stack, Queue , Linked List , Binary tree
2. Sorting and Searching Techniques
3. Divide and Conquer, Dynamic Programming methods
4. Greedy method , Traversals and Backtracking
LIST OF EXERCISES
CYCLE – I
1. Implementation of stack & Queue
2. Singly Linked List
3. Doubly linked list
4. Binary tree Implementations and traversals.
5. Sorting Techniques : Insertion , Selection Sort
6. Sorting Techniques : Quick sort , Merge sort
CYCLE- II
1. Divide and Conquer Method
- Binary Search
- Max Min Problem
2. Greedy Method
- Knapsack Problem
3. Traversal Technique
35 CS – 07-08-SRM – E&T
- Depth First Search
- Breadth First Search
4. Backtracking
- 8-Queens Problem
REFERENCE :Laboratory Manual
SEMESTER – IV
L T P C
LE0202 GERMAN LANGUAGE PHASE - II 2 0 0 2
Prerequisite
GERMAN LANGUAGE PHASE - I
SPEAKING;
Dialogue – Questioning / Basic queries / Conversational with practical exposure.
GRAMMATIK (WRITING)
Verben, Wortstellung, Nomen, Pronomen, Artikel, Nominitativ, Akkusativ, Dativ, Adjective, Prasens, Perfect
and Neben Satze.
GLOSSARY
Technical words. Lesson (6-10)
TEXT BOOK WITH CASSETTES
A. Grundkurs Deutsch
B. Momentmal
(Prescribed by Max Mueller Bhavan – Goethe Institute, Germany).
L T P C
LE0204 JAPANESE LANGUAGE PHASE II 2 0 0 2
Prerequisite
JAPANESE LANGUAGE PHASE I
OBJECTIVES
For beginners with no knowledge of Japanese to acquire basic communication skills.
Lesson 2-{Korewa Tsukue desu } – Grammar, Sentence pattern, Marume . Conversation
Lesson 3 – [Kokoni denwa ga arimasu] - Grammar, Sentence pattern, Marume .Copnversation
Lesson 4– {Asokoni hito ga imasu} - Grammar, Sentence pattern, Marume .
Lesson 5– {Akairingo wa ikutsu arimasu ka}-Grammar, Sentence pattern, Marume . Conversation.
Lesson 6– {Barano hana wa ippon ikura desu ka}- Grammar, Sentence pattern.Marume.Conversation
TEXT BOOKS
1. Nihongo Shoho Imain Text sold in India by the Japanese Language Teachers Association Pune.
2. Hiragana and Katakana Work Book published by AOTS Japan
3. Grammar and Kotoba ( Work Book )
4. Japanese for Dummies.(Conversation) CD.
L T P C
LE0206 FRENCH LANGUAGE PHASE II 2 0 0 2
Prerequisite
36 CS – 07-08-SRM – E&T
FRENCH LANGUAGE PHASE I
Sports (Ski, natation, tennis, Tour de France), Cuisine (French dishes),Cinema
(Review of a film) – Articles on these topics and group discussion will be followed.
GRAMMAR
Possessive Adjectives, Demonstrative Adjectives, Past tense – Passé Compose( Verbe Auxiliare:.Etre et Avoir)
Culture and Civilization French Monuments (Tres celebres), French History (Jeanne d’ Arc, Louis XIV
Prise de la Bastille), Culture and Civilisation (vin, fromage, mode, parfums)
Transport system, government and media in France – articles on these topics.
Comprehension and Grammar Comprehension passages and conversational sentences in
different situations (at the restaurant, at the super market)
TEXT BOOK:
1. Panorama – Goyal Publishers
2. Apprenons le Francais II, Sarawathy Publications
L T P C
MA0212 PROBABILITY AND QUEUEING THEORY 3 0 0 3
Prerequisite
Nil
(Common for CSE, IT & ICE)
PURPOSE
To impart statistical techniques using probability and distributions.
INSTRUCTIONAL OBJECTIVES
At the end of the course, students should be able to
1. Be thorough with probability concepts and the corresponding distributions.
2. Get exposed to the testing of hypothesis using distributions.
3. Gain strong knowledge in principles of queuing theory.
PROBABILITY AND RANDOM VARIABLES
Probability concepts − Random Variable – Characteristics of random variables : Expectation, Variance,
Covariance, Moments; Moment generating function – Function of random variable – Chebychev’s inequality.
THEORETICAL DISTRIBUTIONS
Discrete : Binomial, Poisson, Geometric, Negative Binomial; Continuous : Exponential and Normal
Distributions.
TESTING OF HYPOTHESES
Large sample tests based on Normal Distribution – Small sample tests based on t, F distributions – Chi square
tests for goodness of fit and independence of attributes.
PRINCIPLES OF QUEUEING THEORY
Introduction to Markovian queueing models – Single server model with finite and infinite system capacity –
Characteristics of the model; Applications of queueing theory to computer science and engineering.
MARKOV CHAINS
Introduction to Markov process – Markov chains – transition probabilities – Limiting distribution.
TEXT BOOKS
1. Veerarajan T., Probability, Statistics and Random Processes, Tata McGraw Hill,1st Reprint 2004.
37 CS – 07-08-SRM – E&T
(Unit I – Chapter 1 Pages 1.1-1.20, Chapter 2 Pages 2.1 – 2.3, Chapter 3 Pages 3.1, Chapter 4 Pages 4.36
Unit II – Chapter 5 Pages 5.1 – 5.8, 5.38, 5.39,5.44 – 5.53, Unit IV – Chapter 8 Pages 8.1-8.10,8.15, Unit
V–Chapter 6 Pages 6.1– 6.3, Chapter 7 Pages 7.45 – 7.49)
2. S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 9th extensively revised edition,
Sultan Chand & Sons, 1999.
(Unit III – Chapter 12 Section 12.1, 12.3,12.4,12.6-12.42, Chapter 13 Section 13.5, 13.39, 13.49, Chapter
14 Section 14.16- 14.24, 14.57).
REFERENCE BOOKS
1. Trivedi K S, “ Probability and Statistics with reliability, Queueing and Computer Science
Applications”,Prentice Hall of India,New Delhi, 1984
2. Gross.D and Harris.C.M. “Fundementals of Queuing theory”, John Wiley and Sons, 1985.
3. Allen.A.O., “Probability Statistics and Queuing theory”,Academic Press, 1981.
L T P C
CS0202 PRINCIPLES OF PROGRAMMING LANGUAGES 3 0 0 3
Prerequisite
CS0201, CS0203
PURPOSE
The purpose of this course is to impart concepts of Programming Languages
INSTRUCTIONAL OBJECTIVES
1. Concepts of High level languages and its grammar
2. Study of Imperative languages ( Pascal and C)
3. Study of Object oriented Programming ( C++ and JAVA)
4. Study of Functional Programming ( Haskell / Lisp)
5. Study of Logic Programming ( Prolog and SQL)
PRELIMINARY CONCEPTS
High Level Languages, Issues in Programming - Case studies, Programming paradigms, Language
implementation. Syntactic Structure — Language representation, Abstract Syntax tree, Lexical syntax, Context
Free Grammars, Variants of CFG, Issues involved and Normal Forms for CFG.
IMPERATIVE LANGUAGES
Structured Programming — Need and Design issues. Block Structures (Pascal), types arrays, records, sets,
pointers, procedures, parameter passing, scope rules (in C).
OBJECT ORIENTED LANGUAGES
Grouping of data and Operations — Constructs for Programming Structures, abstraction
Information Hiding, Program Design with Modules, Defined types, Object oriented programming — concept of
Object, inheritance, Derived classes and Information hiding – Templates- Exception handling (Using C++ and
Java as example language).
FUNCTIONAL PROGRAMMING
Functional Programming — Features, Implementation, Types — values and operations, Product of types. Lists
and Operations on Lists, Functions from a domain to a range, Function Application, Lexical Scope. Bindings of
values and functions (Using Haskell/ Lisp as example language)
LOGIC PROGRAMMING
Formal Logic Systems, Working with relations and their implementation (Using Prolog as example). Database
query Languages, Exception handling (Using SQL as example)
TEXT BOOK
38 CS – 07-08-SRM – E&T
1. Pratt, Zelkowitz, “Programming Languages: Design and Implementation Edition,
Pearson Education,” 2nd Edition, 2004
REFERENCE BOOKS
1. Ravi Sethi, “Programming Language Concepts and Constructs”, Pearson Education, 2006
2. Kenneth C.Louden, “Programming Languages- Principles & Practice”, Thomson, 2nd Edition
3. Doris Appleby, Julius J. Vandekopple, “Programming Languages: Paradigms and Practice”,
McGraw Hill, 1997
4. Damir Medak and Gerhard Navratil, “Haskell-Tutorial”, Available on the Web, Feb2003.
5. Paul Hudak, John Peterson and Joseph H. Fasel, “A gentle Introduction to Haskell-98”,2004
6. A.B.Tucker, Robert, Noonan, “Programming Languages”, McGraw Hill, 2002.
ONLINE REFERENCES
1. http://www.cs.indiana.edu/eopl/
2. http://www.cs.brown.edu/courses/cs173/
3. http://www.cs.iastate.edu/~leavens/ComS342-EOPL2e/index.shtml
4. http://www.mhhe.com/engcs/compsci/tucker/
L T P C
CS0204 THEORY OF COMPUTATION 3 0 0 3
Prerequisite
MA 0102 & MA0211
PURPOSE
The purpose of this course is to impart concepts of Theory of Computation
INSTRUCTIONAL OBJECTIVES
1. Study of Finite Automata, Regular Expressions, Grammars.
2. Pushdown Automata, Turing Machines
3. Undecidability problems.
FINITE AUTOMATA
Introduction - Basic Mathematical Notation and techniques- Finite State systems – Basic Definitions – Finite
Automaton – DFA & NDFA – Finite Automaton with €-moves – 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.
GRAMMARS
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 – Greiback Normal form – Chomsky
normal form – Problems related to CNF and GNF
PUSHDOWN AUTOMATA
Pushdown Automata - Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata –
Equivalence of Pushdown automata and CFL - pumping lemma for CFL – problems based on pumping Lemma
TURING MACHINE
Turing Machines- Introduction – Formal definition of Turing machines – Instantaneous descriptions- Turing
Machine as Acceptors – Turing Machine as Transducers Computable Languages and functions – Turing
Machine constructions – Modifications of Turing Machines.
COMPUTATIONAL COMPLEXITY
Undecidability- Basic definitions- Decidable and undecidable problems - Properties of Recursive and
Recursively enumerable languages – Introduction to Computational Complexity: Definitions-Time and
Space complexity of TMs – complexity classes – introduction to NP-Hardness and NP-Completeness.
39 CS – 07-08-SRM – E&T
TEXT BOOK
1. E.Hopcroft and J.D.Ullman, “Introduction to Automata Theory, Languages and Computation”,
Pearson, Education Publishers, 2nd Edition, 2004
REFERENCE BOOKS
1. Michael Sipser, “Introduction to the Theory of Computation”, Thomson Asia, 2004
2. J.C.Martin, “Introduction to Languages and Theory of Computation”, McGraw Hill,2003
3. K.L.P. Mishra, N.Chandrasekaran , “ Theoretical Computer Science “, PHI, 3rd Edition, 2007
ONLINE REFERENCES
1. http://www.cis.upenn.edu/~cis511/
2. http://en.wikipedia.org/wiki/Theory_of_computation
3. http://geisel.csl.uiuc.edu/~loui/sdcr/.
4. http://www.math.niu.edu/~rusin/known-math/index/68QXX.html#INTRO
5. http://www.eecs.harvard.edu/theory/
6. http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk.html
L T P C
CS0206 OPERATING SYSTEMS 3 0 0 3
Prerequisite
CS0201, CS0203
PURPOSE
Every computer professional should have a basic understanding of how an operating system controls the
computing resources and provide services to the users. This course provides an introduction to the operating
system functions, design and implementation. It serves as strong foundation for other courses like networks,
compiler design, data base systems.
INSTRUCTIONAL OBJECTIVES
The students learn about:
1. Structure and functions of OS
2. Process scheduling, Deadlocks
3. Device management
4. Memory management
5. File systems
INTRODUCTION
Computer system overview-basic elements, Instruction execution, Interrupts, memory hierarchy, I/O
communication techniques, operating system overview-objectives and functions, Evolution of OS Microsoft
windows overview.
PROCESSES
Process description and control - process states, process description, process control; Processes and Threads,
Symmetric Multiprocessing and microkernels. Windows Thread and SMP Management. Case studies-UNIX,
SOLARIS thread management
CONCURRENCY AND SCHEDULING
Principles of concurrency - mutual exclusion, semaphores, monitors, Readers/Writers problem; Deadlocks –
prevention- avoidance – detection .Scheduling : Types of scheduling – scheduling algorithms. Case studies-
UNIX scheduling.
MEMORY
Memory management requirements, partitioning, paging, and segmentation; Virtual memory - Hardware and
control structures, operating system software, Linux memory management, case studies- WINDOWS memory
management, UNIX and SOLARIS Memory management
INPUT/OUTPUT AND FILE SYSTEMS
I/O management and disk scheduling – I/O devices, organization of I/O functions; OS design issues, I/O
buffering, disk scheduling, Disk cache, File management – organization, directories, file sharing, record
blocking, secondary storage management; case studies-LINUX I/O, UNIX File management.
40 CS – 07-08-SRM – E&T
TEXT BOOK
1. William Stallings, “Operating Systems – internals and design principles ”, Prentice Hall India, 5th
Edition, 2005.
REFERENCE BOOKS
1. Andrew S. Tannenbaum & Albert S. Woodhull, “Operating System Design and Implementation”,
Prentice Hall India, 2nd Edition, 1998.
2. Gary Nutt, “Operating System - A Modern Perspective”, Pearson Education Asia, 2nd Edition 2000.
3. Harvey .M. Deitel, “Operating Systems”, 2nd Edition , 2000.
4. Silberschatz, Peter Galvin, “Operating System Concepts”, AWL 6th Edition, 2002,
5. Ida M.Flynn, Ann Mclver McHoes, “Understanding Operating Systems”, 3rd Edition,Thomson
Learning 2001s
ONLINE REFERENCES
www.oreilly .com
www.eclipse.org
www.refdesk.com
L T P C
CS 0210 COMPREHENSION I 0 2 0 1
Prerequisite
Should have studied the Computer Science and Engineering Subjects
Prescribed / opted for upto IV SEMESTER
PURPOSE
To provide a compete picture of Computer Science and engineering topics covered in I to IV semesters so that a
comprehensive understanding of Computer Science and engineering is achieved so that students are well
prepared to face job interviews and subjects related to competitive examinations.
INSTRUCTIONAL OBJECTIVES
To provide overview of all Computer Science and engineering topics covered I to IV semesters given
below.
To assess the overall knowledge level of Computer Science and engineering standards and guide them
to take corrective measures where deficiencies are detected.
COMPREHENSION
A. Review of the following topics of Computer Science and engineering:
1. Digital Computer Fundamentals
2. Programming in C
3. Data Structures
4. Design and Analysis of algorithms
5. Microprocessor and Interfacing
6. Principles of Programming Languages
7. Theory of Computation
8. Operating Systems
9. Java Programming
B. Seminar/group discussion
Students shall have seminar/group discussion sessions on the topics listed under A above under the guidance of
staff.
(Evaluation shall consist of a 3 hour duration end semester examination consisting of objective type as
well as conventional questions )
L T P C
PD 0202 PERSONALITY DEVELOPMENT - IV 0 0 2 1
Prerequisite
Nil
PURPOSE
41 CS – 07-08-SRM – E&T
The purpose of this course is to build confidence and inculcate various soft skills and to help Students to identify
and achieve their personal potential
INSTRUCTIONAL OBJECTIVES
1. To guide thought process.
2. To groom students' attitude.
3. To develop communication skill.
4. To build confidence.
METHODOLOGY
The entire program is designed in such a way that every student will participate in the class room activities. The
activities are planned to bring out the skills and talents of the students which they will be employing during
various occasions in their real life.
1. Group activities + individual activities.
2. Collaborative learning.
3. Interactive sessions.
4. Ensure Participation.
5. Empirical Learning
Motivation II - Interpretation of Visuals of I & II
Humor in real life - Body language - Collage and poster designing and slogan writing
Brain Teasers – JAM - Current News Update I
Current News Update II - Enactment (SKIT –I) - Enactment (SKIT – II)
Survey and Reporting (heroes, sports persons etc.) - Quiz III – Review
VALUATION:
1. Activities assessed by both group and individual participation
2. Continuous assessment based on daily participation
SCHEME OF INSTRUCTION
Marks allocated for regular participation in all oral activities in class
SCHEME OF EXAMINATION
Complete Internal evaluation on a regular Basis
L T P C
CS0212 OPERATING SYSTEMS LAB 0 0 3 2
Prerequisite
CS0201, CS0203
PURPOSE
This laboratory course gives a complete understanding of the operating systems principles and its
implementations
INSTRUCTIONAL OBJECTIVES
1. Scheduling algorithms
2. Deadlock algorithms and page replacement algorithms
42 CS – 07-08-SRM – E&T
3. Memory management schemes, Thread and synchronization
LIST OF EXPERIMENTS
1. Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
2. Simulate all file allocation strategies
a) Sequential b) Indexed c) Linked
3. Simulate MVT and MFT
4. Simulate all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
5. Simulate Bankers Algorithm for Dead Lock Avoidance
6. Simulate an Algorithm for Dead Lock Detection
7. Simulate all page replacement algorithms
a) FIFO b) LRU c) LFU
8. Shared memory and IPC
9. Simulate Paging Technique of memory management.
10. Threading & Synchronization Applications
11. Write a collection of sufficient no. of processes which carry out the following different types of tasks
independently:
1. Only computation
2. Only printfs
Tune each of the above process to run for 30 seconds when it runs standalone.
Then run them simultaneously with different combinations.
Gather per process and system statistics
e.g. required cpu time, turnaround time, wait time, in each test combination
12. Write a collection of programs p1, p2, p3 such that they execute sequentially with the same process-id, and
each program should also print its PID. (process id) The user should be able to invoke any combination of these
programs, to achieve the required functionality.
For example consider three programs twice , half, square which accept only one integer as argument and does
some specific operation.
a) twice 10 prints 20 and some int which is its process-id as output
b) square 10 prints 100 and some int which is its process-id as output
c) half 10 prints 5 and some int which is its process-id as output
Now the user should be able to combine these programs in any combination to achieve the required result.
For example:
a) twice square half twice half 10
should calculate half(twice(half(square(twice(10))))) and print 200 as result. It should also print the process ids
of each program as it executes. Note that the process-id printed by each of these programs should be the same,
in this case.
REFERENCE :
Laboratory Manual
L T P C
CS0214 JAVA PROGRAMMING 2 0 2 3
Prerequisite
CS0112
PURPOSE
To learn and Practice the basics of JAVA language
INSTRUCTIONAL OBJECTIVES
1. To learn & practice the Object Oriented concepts like Inheritance, Overloading etc.
2. To learn & practice Interfaces and Packages
3. To learn &practice Java applet programming
43 CS – 07-08-SRM – E&T
THEORY
Java Basics – Data types- methods – class – objects- overloading- Inheritance-types of inheritance- overriding-
Exception handling – Strings - Interfaces- Packages- Threads- Applets- Exception handling
PRACTICAL
JAVA BASICS
1. Programs illustrating various data types in Java
2. Programs illustrating class, objects and methods
3. Programs for addition and multiplication of Matrices
4. Programs illustrating Overloading in Java
5. Programs illustrating the implementation of Various forms of Inheritance( Single, Hierarchical,
Multilevel )
6. Programs illustrating Overriding methods in Java
7. Programs illustrating Exception Handling
8. Programs to manipulate strings
JAVA INTERFACES, PACKAGES and THREADS
9. Programs illustrating Interfaces in Java
10. Programs to create Packages in Java
11. Programs illustrating Threads in Java
JAVA APPLETS
12. Programs to write applets to draw the various shapes
13. Programs to manipulate labels, lists, text fields and panels
14. Programs to handle mouse events
15. Programs using layout mangers
REFERENCE: Laboratory Manual
L T P C
CS0216 COMPUTER SKILLS 1 0 2 2
Prerequisite
Nil
Special training shall be arranged on the latest developments in Computer Science and Engineering field by
internal faculty (or) external experts
SEMESTER V
L T P C
MA0307 OPERATIONS RESEARCH TECHNIQUES 3 0 0 3
Prerequisite
MA 0102 & MA0211
PURPOSE
To enlighten the students with the various optimization techniques
INSTRUCTIONAL OBJECTIVES
At the end of the course the students will be able to know
1. Concepts of Linear programming techniques
2. Applications and use of replacement models and game theory
3. Techniques of PERT, CPM
4. Detailed knowledge of Inventory control
5. Advanced Linear Programming
44 CS – 07-08-SRM – E&T
LINEAR PROGRAMMING
Introduction to linear programming – Formulation of the problem – Graphical method – Simplex method –
Artificial variable techniques – Dual Simplex method
REPLACEMENT AND GAME THEORY
Replacement models – replacement of items that deteriorate with time –equipment that fails suddenly – Two
person zero sum games – Pure strategies and saddle point – Mixed strategies – 2 x n and m x 2 games – method
of dominance - numerical graphical solutions -
RESOURCE SCHEDULING AND NETWORK ANALYSIS
Problem of sequencing – Processing ‘n’ jobs through two machines and three machines, Processing two jobs
through ‘m’ machines.
PERT and CPM, - Critical path calculations – probability and cost consideration
INVENTORY CONTROL
Inventory models – Deterministic models – Economic ordering quantity, Reorder level, optimum cost –
Instantaneous and Non-instantaneous receipt of goods with or without shortages.
ADVANCED LINEAR PROGRAMMING
Integer programming problem - Cutting plane algorithm – Transportation models - Vogel’s Approximation
method – MODI method – Unbalanced transportation problem – Degeneracy in transportation models –
Assignment models – Traveling salesman problem
TEXT BOOK
1. Kanti Swarup, Gupta P.K., and Man Mohan, Operations Research, Sultan Chand & Sons, 1994.
REFERENCE BOOKS
1. Gupta, P.K. and Hira, D.S., Operations Research, S. Chand & Sons, 2000
2. Sundaresan.V, Ganapathy Subramanian.K.S. and Ganesan.K, Resource Management Techniques, A.R.
Publications,2002
3. Taha, H.A., Operations Research – An Introduction, 7th edition, PHI, 2002
4. Sharma S.D., Operations Research, Kedarnath Ramnath & Co., Meerut,1994.
5. Billy B. Gillet., Introduction to Operations Research, TMH Publishing and Co.
6. Gupta, P.K., and Manmohan, Operations Research and Quantitative Analysis – S. Chand & Co. New
Delhi.
7. Hamblin, S., and Steveens Jr., Operations Research, Mc Graw Hill and Co.
L T P C
EC0377 PRINCIPLES OF COMMUNICATION 3 0 0 3
Prerequisite
CS0112, CS0203
PURPOSE
The subject Communication Engineering is offered for EIE , ICE EEE&CSE branch students who are
expected to know about the basics of communication engineering such as Analog modulation methods(AM,
FM,PM Transmission, Reception), PCM and finally Digital modulation techniques.
INSTRUCTIONAL OBJECTIVES
1. AM Modulation and Demodulation – DSB-FC,DSB-SC,SSB,VSB.
2. FM Modulation and Demodulation
3. Data Transmission – ASK, FSK, PSK.
4. PAM, PPM, PWM, PCM, TDM AND FDM.
5. Fundamentals of Radar, TV, satellite and fiber optical communication.
AM MODULATION
Source of noise – Internal and external – Types – Need for Modulation_ Amplitude Modulation – Generation of
AM waves (DSB-FC) - Suppressed carrier systems (DSB-SC) – Single side band modulation(SSB) – Vestigial
side band modulation (VSM) - comparison of various AM systems.
45 CS – 07-08-SRM – E&T
TRANSMITTERS AND RECEIVERS
Demodulation of AM waves – Envelope Detectors – Synchronous Detectors - Pilot carrier method – AM
Transmitters - Low level and High level transmitters – AM Receivers – TRF receiver, super heterodyne
receiver – Frequency Division Multiplexing.
FM MODULATION AND DEMODULATION
Introduction to angle modulation systems – Definitions for FM & PM – Narrow band FM – Wide band FM –
FM Modulators - Direct and Indirect method – FM Transmitters - FM Demodulators – Slope detector - Ratio
Detector – Frequency discriminator – PLL - FM Receivers - Noise in angle modulated systems – Comparison
between AM & FM.
PULSE MODULATION
Introduction to Pulse modulation systems – Pulse amplitude modulation – Pulse Time modulation – Pulse code
modulation – Inter symbol Interference - Eye Patterns – Equalization - companding – time division
multiplexing – synchronous and asynchronous - pulse stuffing – Bandwidth of PCM – noise in PCM – delta
modulation – adaptive delta modulation – comparison between PCM and DM – DPCM.
COMMUNICATION SERVICES (ELEMENTARY TREATMENT ONLY)
Radar: Basic Radar system – Radar range equation – Pulsed radar systems.
Television: Picture elements – Transmission and reception of picture information – Motion picture – Horizontal
and vertical scanning frequencies – TV transmitters – TV Receivers – TV channels. Satellite communication:
Read – orbit – Satellite altitude – Transmission path – its loss – Satellite system. Fiber optical communication:
Need – Principles of light transmission in a fiber – optical fiber communication system – optical fiber – Light
sources – Photo detectors – Advantages.
TEXT BOOKS
1. R.P.SINGH, S.D.SAPRE, “Communication Systems, Analog and Digital “, McGraw Hill Pub. 5th
Reprint 2000.
2. DESHPANDE,N.D , “Communication Electronics” , Tata McGraw Hill Pub.1989.
REFERENCE BOOKS
1. KENNEDY, “Electronic of Communication Systems”, McGraw Hill – 5th reprint – 2000.
2. RODDY D. and COOLEN J.,” Electronic communications”, Prentice Hall of India P. Ltd. 1987.
3. ANOKH SINGH, “Principles of communication Engineering”, S.Chand & Co. 1991.
L T P C
CS0301 COMPILER DESIGN 3 0 0 3
Prerequisite
CS0204
PURPOSE
To learn the design aspects of a Compiler, and study other system software tools
INSTRUCTIONAL OBJECTIVES
1. To study the concepts of Assembler, Macro Processor, Loader and Linker
2. To learn about the various phases of compiler and syntax analysis
3. To learn the various parsing techniques
4. To learn the semantic analysis, translation of statements
5. To learn about Generating and Optimizing codes
ASSEMBLER,MACROS, LOADER & LINKER
Assembler: Overview of the assembly process - Design of two pass assembler- Single pass assembler -
Macros : Macro definition and usage- schematics for macro expansion - Design of a Macro pre- processor
- Design of a Macro assembler ; Introduction to Loaders and Linkers.
INTRODUCTION TO COMPILERS
Compiler: Introduction - Analysis of the source program - phases of a compiler - Compiler construction tools-
Lexical analysis - Role of the lexical analyzer - Specification of tokens –Recognition of tokens -Lexical analyzer
46 CS – 07-08-SRM – E&T
generators- Design aspects of Lexical Analyzer
SYNTAX ANALYSIS – PARSING
Syntax Analysis: Role of the parser - Context free grammars - Top-down parsing: shift reduce- predictive
parsing; Bottom-up parsing: Operator precedence, LR parsers (SLR, Canonical LR,LALR) - Parser generators-
Design aspects of Parser.
SEMANTIC ANALYSIS – TRANSLATION & RUNTIME STORAGE
Syntax-directed translation: Syntax-directed definitions - S-attributed definition - L-attributed definition -Topdown
and bottom-up translation- Type checking - Type systems -Specification of a type checker; Run time
environment -Source language issues -Storage organization –Storage allocation strategies - Access to nonlocal
names - Parameter passing - Symbol tables- Design aspects of Syntax Directed Translation
CODE GENERATION & OPTIMIZATION
Intermediate code generation: Intermediate languages - Declaration - Assignment Statement - Boolean
expression - Procedure calls - Code optimization : Introduction - Sources of optimization - Introduction to data
flow analysis- Code generator : Issues in the design of a code generator- the target machine- A simple code
generator- Design aspects of Code Optimizer.
TEXT BOOKS
1. Alfred V. Aho, Ravi Sethi & Jeffrey. D. Ullman, “Compilers Principles, Techniques & Tools”,Pearson
Education, third edition, 2007.
2. D.M.Dhamdhere, "System Programming and Operating Systems", 2nd Edition., Tata Mcgraw
Hill,1995
REFERENCE BOOKS
1. Kenneth C. Louden, Compiler Construction, Principles and Practice, Thomson Books,2007.
2. Aho. A.V & Ullman J.D, “Principles of Compiler Design”, Narosa publications,1985.
3. S.S. Muchnick Harcourt Asra,” Advanced Compiler Design implementation”, Morgan Kaufman,
1997.
4. Anrew W. Appel, “Modern Compiler Implementation in JAVA”, Cambridge University Press, 2003.
ONLINE RESOURCES:
http://lambda.uta.edu/cse5317/notes/notes.html
www.cs.bilkent.edu.tr/~ilyas/courses/cs416/
PURPOSE
To study the various layer in Computer Networking and its Protocol design
INSTRUCTIONAL OBJECTIVES
1. To understand the concepts of data communications.
2. To study the functions of different layers.
3. To make the students to get familiarized with different protocols and network components.
INTRODUCTION
Network Architecture – Historical review – Network software architecture: layers and protocol, OSI vs TCP.
Network hardware architecture: topologies, devices. Introduction to types of networks-Optical Networks, Sensor
networks.
PHYSICAL AND DATA LINK LAYERS
Basics for Data communications—Transmission Media— Guided and unguided transmission media —
Communication satellites - Data link Layer design issues—Error Detection & Correction—Elementary Data
link Protocols—Sliding window Protocols.
L T P C
CS0303 COMPUTER NETWORKS 3 0 0 3
Prerequisite
CS0112, CS0203
47 CS – 07-08-SRM – E&T
MAC & NETWORK LAYERS
Media access control and LANs: The channel allocation – Methods and protocols for LANs – IEEE 802
standards and LAN technologies – Ethernet, token ring – hardware addressing - Network layer design issues—
Routing Algorithms—Congestion Control Algorithms
TRANSPORT LAYER
Transport services—Elements of transport Protocols—A simple transport Protocols—UDP—TCP—
Performance issues.
APPLICATION LAYER
DNS—E-mail—WWW-Multimedia—Introduction to Cryptography–basic concepts-firewalls.
TEXT BOOK
1. Andrew S. Tanenbaum, “Computer Networks”, Pearson, Fourth Edition, 2005.
REFERENCE BOOKS
1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw-Hill, 2004.
2. James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach
Featuring the Internet”, Pearson Education, Third Edition 2003.
3. William Stallings, “Data and Computer Communication”,Seventh Edition,
Pearson Education, 2003.
ONLINE REFERENCES:
1. www.cs.purdue.edu
2. ocw.mit.edu/
3. http://www.public.asu.edu
4. http://authors.phptr.com/tanenbaumcn4
5. cs.umass.edu
6. www.csee.usf.edu
7. www.cs.cmu.edu
L T P C
ELECTIVE - I 3 0 0 3
Prerequisite
Nil
One course from the list of courses given below to be selected by the students
CS0321,CS0323,CS0325,CS0327,CS0329,CS0331,CS0333
L T P C
PD0 301 PERSONALITY DEVELOPMENT - V 1 0 2 2
Prerequisite
Nil
PURPOSE
The purpose of this course is to build confidence and inculcate various soft skills and to help Students to identify
and achieve their personal potential
INSTRUCTIONAL OBJECTIVES
At the end of the course the students will be able to
1. Acquire the important soft skills for employment
2. Take part in group discussions and job interviews confidently
3. Appear for placement aptitude tests confidently
4. Gain self confidence to face the placement process
METHODOLOGY
The entire program is designed in such a way that every student will participate in the class room activities. The
activities are planned to bring out the skills and talents of the students which they will be employing during
various occasions in their real life.
48 CS – 07-08-SRM – E&T
1. Group activities + individual activities.
2. Collaborative learning.
3. Interactive sessions.
4. Ensure Participation.
5. Empirical Learning
Syllogism - Binary Logic [cause & effect] - Assertive & Counter Argument - Simple Interest - Time & Work -
Time & Distance
Upstream &Downstream Reasoning - Verbal Comprehension I - Verbal Comprehension II- Compound
InterestLogarithms - Surds & Indices
Verbal Reasoning I - Verbal Reasoning II - Verbal Reasoning III – Percentage – Test – Averages
Deductive Reasoning I - Deductive Reasoning II - Language Usage I - Decimal Fractions - Profit & Loss –
Probability
Language Usage II - Logic Games I - Logic Games II – Area - Pipes & Cisterns – Test
SCHEME OF INSTRUCTION
Marks allocated for regular participation in all oral activities in class
SCHEME OF EXAMINATION
Complete Internal evaluation on a regular Basis
L T P C
CS0311 COMPILER DESIGN LAB 0 0 3 2
Prerequisite
CS0204
PURPOSE
To Practice and implement the system software tools and compiler design techniques
INSTRUCTIONAL OBJECTIVES
1. To implement Loader, Linker, Assembler & Macro processor
2. To implement the NFA,DFA, First & Follow procedures
3. To implement Top down and Bottom up parsing techniques
LIST OF EXPERIMENTS
1. Implementation of a Linker
2. Implementation of a Loader
3. Implementation of an Assembler
4. Implementation of Macro processor
5. Implementation of a Lexical Analyser
6. Converting a regular expression to NFA
7. Converting NFA to DFA
8. Computation of FIRST and FOLLOW sets
9. Construction of Predictive Parsing Table
10. Implementation of Shift Reduce Parsing
11. Computation of Leading and Trailing Sets
49 CS – 07-08-SRM – E&T
12. Computation of LR(0) items
13. Construction of DAG
14. Intermediate Code Generation
15. Design of Simple Compiler using native language words
16. Trace the execution of another program - debugger
REFERENCE: Laboratory Manual
L T P C
CS0313 NETWORKING LAB 0 0 3 2
Prerequisite
CS0112, CS0203
PURPOSE
This laboratory course deals with the complete implementation aspects of Networking and their applications
INSTRUCTIONAL OBJECTIVES
1. TCP Socket Programming , UDP applications , File transfer
2. RMI and Routing Algorithms.
LIST OF EXPERIMENTS
1. Write a socket Program for Echo/Ping/Talk commands.
2. Create a socket (TCP) between two computers and enable file transfer between them.
3. Write a program to implement Remote Command Execution ( Two M/Cs may be used )
4. Create a socket (UDP)
5. Write a code simulating ARP /RARP.
6. Create a socket for HTTP for web page upload & Download.
7. Write a program for TCP module Implementation.(TCP services)
8. Write a program for File Transfer in client-server architecture using following methods.
(a) USING RS232C (b) TCP/IP
9. Write a program to implement RMI (Remote Method Invocation)
10. Perform a case study about the different routing algorithms to select the network path with its optimum
and economical during data transfer.
• Shortest path routing
• Flooding
• Distance vector
11. Implement client in C and server in Java.
12. Using QUAL NET 4.0
a) Create a scenario with the following specifications.
• No of subnets - 2
• No. of nodes - 40
• Traffic
FTP - 11 to 21
FTP - 30 to 40
UDP - 5 to 7
• Routing Protocol – AODV
• 802.16
Show the throughput using different bandwidths i.e., 10 Mbps and 100 Mbps respectively.
b) Create a scenario as described below.
No of students – 2
SN -1 Nodes – 15
SN -2 Nodes - 10
50 CS – 07-08-SRM – E&T
Generate FTP Traffic & HTTP traffic between
Nodes 1 to 11 (FTP)
14 to 7 (HTTP / Gen FTP)
Trace the packet with in the Simulation time and display the Trace file.
REFERENCE : Laboratory Manual
L T P C
CS 0315 INDUSTRIAL TRAINING I 0 0 2 1
Prerequisite
Nil
(Training to be undergone after IV Semester)
PURPOSE
To provide hands-on experience at site where Computer Science and engineering projects are executed.
INSTRUCTIONAL OBJECTIVES
1. To enable the students to gather a first hand experience on site.
INDUSTRIAL TRAINING I
1. Students have to undergo two weeks practical training in Computer Science and Engineering related
project sites. At the end of the training they have to submit a report together with a certificate in the
format prescribed and make a presentation which shall be evaluated.
SEMESTER VI
L T P C
CS0302 ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS 3 0 0 3
Prerequisite
MA 0211
PURPOSE
The purpose of this course is to impart concepts of Artificial Intelligence and Expert System
INSTRUCTIONAL OBJECTIVES
1. To study the concepts of Artificial Intelligence
2. Methods of solving problems using Artificial Intelligence
3. Introduce the concepts of Expert Systems and machine learning.
INTRODUCTION TO Al AND PRODUCTION SYSTEMS
Introduction to Al — Problem formulation, Problem Definition — Production systems, Control strategies,
Search strategies. Problem characteristics, Production system characteristics — Specialized production systems
— Problem solving methods — Problem graphs, Matching, Indexing and Heuristic functions — Hill Climbing,
Depth first and Breath first, Constraints satisfaction — Related algorithms, Measure of performance and
analysis of search algorithms.
REPRESENTATION OF KNOWLEDGE
Game playing — Knowledge representation, Knowledge representation using Predicate logic, Introduction to
predicate calculus, Resolution, Use of predicate calculus, Knowledge representation using other logic —
Structured representation of knowledge.
FUNDAMENTALS OF EXPERT SYSTEMS
Basic plan generation systems — Strips — Advanced plan generation systems — K strips — D Comp. Expert
systems — Architecture of expert systems, Roles of expert systems — Knowledge Acquisition — Meta
knowledge, Heuristics.
KNOWLEDGE INFERENCE
51 CS – 07-08-SRM – E&T
Knowledge representation — Production based system, Frame based system. Inference — Backward chaining,
Forward chaining, Rule value approach, Fuzzy reasoning — Certainty factors, Bayesian probability.
MACHINE LEARNING
Strategic explanations — Why, Why not and how explanations. Learning — Machine learning, adaptive
learning. - Typical expert systems — MYCIN, PIP, INTERNIST, DART, XOON, Expert systems shells
TEXT BOOKS
1. Elaine Rich, “Artificial Intelligence”, 2nd Edition, McGraw Hill, 2005
2. Dan W.Patterson, “ Introduction to AI and ES”, Pearson Education, 2007
REFERENCE BOOKS:
1. Peter Jackson,” Introduction to Expert Systems”, 3rd Edition, Pearson Education, 2007
2. Stuart Russel, Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson Education 2007.
ONLINE REFERENCES:
1. http://library.thinkquest.org/2705/
2. http://www-formal.stanford.edu/jmc/whatisai/
3. http://en.wikipedia.org/wiki/Artificial_intelligence
4. http://ai.eecs.umich.edu/
5. http://www.cee.hw.ac.uk/~alison/ai3notes/subsection2_6_2_3.html
6. http://starbase.trincoll.edu/~ram/cpsc352/notes/heuristics.html
7. http://www.macs.hw.ac.uk/~alison/ai3notes/section2_4_3.html
8. http://www.rbjones.com/rbjpub/logic/log019.htm
9. http://www.cs.odu.edu/~jzhu/courses/content/logic/pred_logic/intr_to_pred_logic.html
10. http://www.macs.hw.ac.uk/~alison/ai3notes/chapter2_5.html
L T P C
CS0304 DATABASE MANAGEMENT SYSTEMS 3 0 0 3
Prerequisite
CS0201
PURPOSE
To study the concepts of Relational Database design and query languages
INSTRUCTIONAL OBJECTIVES
1. To provide a general introduction to relational model
2. To learn about ER diagrams
3. To learn about Query Processing and Transaction Processing
INTRODUCTION
The Evolution of Database Systems- Overview of a Database Management System-Outline of Database-System
Studies-The Entity-Relationship Data Model: Elements of the E/R Model-Design Principles-The Modeling of
Constraints-Weak Entity Sets
THE RELATIONAL DATA MODEL & ALGEBRA
Basics of the Relational Model-From E/R Diagrams to Relational Designs-Converting Subclass Structures to
Relations-Functional Dependencies-Rules About Functional Dependencies-Design of Relational Database
Schemas - Multivalued Dependencies-Relational Algebra: Relational Operations-Extended Operators of
Relational Algebra- Constraints on Relations
SQL
Simple Queries in SQL-Sub queries-Full-Relation Operations-Database Modifications-Defining a Relation
Schema-View Definitions- Constraints and Triggers: Keys and Foreign Keys-Constraints on Attributes and
Tuples-Modification of Constraints-Schema-Level Constraints and Triggers -Java Database Connectivity-
Security and User Authorization in SQL
INDEX STRUCTURE, QUERY PROCESSING
Index Structures:Indexes on Sequential Files-Secondary Indexes-B-Trees-Hash Tables-Bitmap Indexes-Query
Execution: Physical-Query-Plan Operators-One-Pass, two-pass & index based Algorithms, Buffer
52 CS – 07-08-SRM – E&T
Management, Parallel Algorithms-Estimating the Cost of Operations-Cost-Based Plan Selection -Order for
Joins-Physical-Query-Plan
FAILURE RECOVERY AND CONCURRENCY CONTROL
Issues and Models for Resilient Operation -Undo/Redo Logging-Protecting against Media Failures-Concurrency
Control: Serial and Serializable Schedules-Conflict-Serializability-Enforcing Serializability by Locks-Locking
Systems With Several Lock Modes-Concurrency Control by Timestamps, validation- transaction management:
Serializability and Recoverability-View Serializability-Resolving Deadlocks-Distributed Databases: commit&
lock
TEXT BOOK
1. Hector Garcia-Molina, Jeff Ullman, and Jennifer Widom, “Database Systems: The Complete Book” -
Pearson Education, 2002
REFERENCE BOOKS
1. Silberschatz, H. Korth and S. Sudarshan, “Database System Concepts”, 4rth Edition, McGraw-Hill
International, 2002.
2. R. Elmasri and Shamakant B. Navathe, “Fundamentals of Database Systems”, 3rd Edition, Addision
Wesley , 2000.
ONLINE RESOURCES
http://www.cs.helsinki.fi/u/laine/tikape/k03/material03.html
http://infolab.stanford.edu/~ullman/dscb.html
http://cs.nyu.edu/courses/spring06/G22.2433-001/
L T P C
CS0306 OBJECT ORIENTED ANALYSIS AND DESIGN 3 0 0 3
Prerequisite
CS0202
PURPOSE
This course separates and makes explicit the decisions that make up an object oriented analysis and design. We
show how to use the UML notations most effectively both to discuss designs with colleagues, and in documents.
INSTRUCTIONAL OBJECTIVES
To provide the students with sufficient knowledge for
1. Understanding Object Basics, Classes and Objects, Inheritance
2. How software objects are altered to build software systems that are more robust
3. Gaining enough competence in object-oriented analysis and design (OOAD) to tackle a complete
object oriented project
4. Understanding the issues and options in reuse
5. Using UML, a common language for talking about requirements, designs, and component interfaces
INTRODUCTION
Categories of Information systems – traditional paradigm vs Object oriented paradigm – Objects and Classes –
Inheritance – Object relationship – Examples of UML class modeling – Unified Process – Iteration and
incrementation within the unified process
UML AND THE UNIFIED PROCESS
Overview of requirements – Initial understanding of the domain – Business Model – Requirements workflow –
Osbert Oglesby case study- MSG Foundation case study revising the requirements – MSG Foundation case
study – Continuing the requirements workflow – MSG Foundation case study Refining the revised
requirements – MSG Foundation case study
OBJECT ORIENTED ANALYSIS
Extracting entity classes – Initial dynamic model – Extracting control classes- refining use cases – incrementing
the class diagram – Initial dynamic model – MSG Foundation case study
I. revising the entity classes- Extracting – USE case realization – MSG Foundation case study
53 CS – 07-08-SRM – E&T
II. incrementing the class diagram – more on use cases - risk
OBJECT ORIENTED DESIGN WORKFLOW
Design workflow – format of the attributes – allocation of operations – Osbert Oglesby case study – Workflows
of the unified process – Phases of the unified process – class diagrams – Use case diagrams – Interaction
diagrams – state charts – package diagrams – Deployment diagrams
TESTING AND MANAGEMNET ISSUES
Quality issues – Non execution based testing – execution based testing – cost benefit analysis – risk analysis –
Improving the process - Metrics – CPM/PERT _- Choice of programming language – Reuse case studies –
Portability – planning and estimating duration and cost – testing the project management plan – maintenance
and the object oriented paradigm - CASE Tools for maintenance
TEXT BOOKS
1. S. R Schach, “Introduction to Object Oriented analysis and Design”, Mc Graw Hill, 2003
2. Ali Bahrami , “Object Oriented System Development”, McGraw Hill International Edition, 1999.
REFERENCE BOOKS
1. Booch G., “Object Oriented Analysis and Design”, Addison Wesley Publishing Company, 2nd Edition,
2000.
2. Rambaugh.J, Blaha. M. Premerlani.W, Eddy F and Loresen W, “Object Oriented Modeling and
Design”,Prentice Hall of India, 1997.
3. Coad P, Yourdon E., “Object oriented analysis”, Yourdon Press, 1991.
ONLINE REFERENCES
http://www.ooad.org/
http://www.iturls.com/English/SoftwareEngineering/SE_6.asp
http://www2.enel.ucalgary.ca/People/far/Lectures/SENG609-23/
http://www.cs.virginia.edu/~horton/cs494/
L T P C
CS0308 LOGIC FOR COMPUTER SCIENCE 3 0 0 3
Prerequisite
MA 0101 , MA 0102 & MA 0211
PURPOSE
To study important concepts in Logic
INSTRUCTIONAL OBJECTIVES
1. To provide main notions of Mathematical Logic
2. To learn Formal framework to construct logic arguments
3. To student deductive systems along with completeness
PROPOSITIONAL LOGIC
Declarative sentences – Natural deduction – Popositional logic as a Formal Language – Semantics of
Propositional Logic – Normal Forms – SAT Solvers
PREDICATE LOGIC
Predicate Logic as a formal Language - Proof Theory of Prediacte Logic - Semantics of Prediacte Logic –
Undecidability of Predicate Logic - Expressiveness of Predicate Logic Models – Micromodels of Software
VERIFICATION BY MODEL CHECKING
Motivation for Verification – Linear Time Temporal Logic – Model Checking : systems, Tools and Properties –
Branching Time temporal Logic – Model Checking algorithms – CTL+ and the expressive power of LTL and
CTL – Fixed point characterization of CTL
PROGRAM VERIFICATION AND MODAL LOGIC
54 CS – 07-08-SRM – E&T
A Framework for software verification – Proof calculus for partial correctness – Proof calculus for total
correctness – Basic Modal logic – Logic Engineering – Natural Deduction – Reasoning about knowledge in a
multi-agent system
BINARY DECISION DIAGRAMS
Representing Boolean functions – Algoritms for reduced OBBDs - Geometric Templates from Spatial Relations
– Application – Image Based Rendering – Symbolic Model Checking – A relational Mu – calculus – Coding
CTL models and specifications
TEXT BOOK
1. Huth M and Ryan M ,” Logic in Computer Science : Modeling and Reasoning about systems”,
Cambridge University Press 2005
REFERENCE BOOKS
1. Enderton H B, “A Mathematical Introduction to Logic”, Academic Press, 2001
2. Mathematical Logic for Computer Science”, Springer, 2001
3. Herbert B. Enderton, “A Mathematical Introduction to Logic”, Elsevier,2005
4. I.M.Copi, D.Cohen, P.Jetli, M.Prabakar, “Introduction to Logic”, Pearson Education,2006
ONLINE REFERENCES
http://www.cs.swan.ac.uk/~csetzer/logic-server/
http://www.cis.upenn.edu/~jean/gbooks/logic.html
http://arxiv.org/list/cs.LO/recent
http://www.cs.rice.edu/~vardi/comp409/
L T P C
ELECTIVE - II 3 0 0 3
Prerequisite
Nil
One course from the list of courses given below to be selected by the students
CS0322,CS0324,CS0326,CS0328,CS0330
L T P C
CS 0310 COMPREHENSION II 0 2 0 1
Prerequisite
Should have studied the Computer Science and Engineering Subjects
prescribed / opted for upto VI SEMESTER
PURPOSE
To provide a complete picture of Computer Science and engineering topics covered in I to VI semesters
including the related topics covered in I to IV semesters so that a comprehensive understanding of Computer
Science and engineering is achieved so that students are well prepared to face job interviews and subjects related
competitive examinations.
INSTRUCTIONAL OBJECTIVES
1. To provide overview of all Computer Science and engineering topics covered in V and VI semesters
including the related topics covered in I to IV semesters as given below.
2. To assess the overall knowledge level of Computer Science and engineering standards and guide them
to take corrective measures where deficiencies are detected.
3. COMPREHENSION
A. Review of the following topics of Computer Science and engineering:
1. Data Structures
2. Design and Analysis of Algorithms
3. Operating Systems
4. Theory of Computation
55 CS – 07-08-SRM – E&T
5. Compiler Design
6. Computer Networks
7. Artificial Intelligence and Expert Systems
8. Data Base Management Systems
9. Object Oriented Analysis and Design
10. Logic for Computer Science
B. Seminar/group discussion
Students shall have seminar/group discussion sessions on the topics listed under A above under the
guidance of staff.
(Evaluation shall consist of a 3 hour duration end semester examination consisting of objective type as
well as conventional questions )
L T P C
PD0 302 PERSONALITY DEVELOPMENT VI 1 0 2 2
Prerequisite
Nil
PURPOSE
The purpose of this course is to build confidence and inculcate various soft skills and to help Students to identify
and achieve their personal potential
INSTRUCTIONAL OBJECTIVES
At the end of the course the students will be able to
1. Acquire the important soft skills for employment
2. Take part in group discussions and job interviews confidently
3. Appear for placement aptitude tests confidently
4. Gain self confidence to face the placement process
METHODOLOGY
The entire program is designed in such a way that every student will participate in the class room activities. The
activities are planned to bring out the skills and talents of the students which they will be employing during
various occasions in their real life.
1. Group activities + individual activities.
2. Collaborative learning.
3. Interactive sessions.
4. Ensure Participation.
5. Empirical Learning
Self Introduction - Narration - Current News Update – Numbers - Height & Distance - Square & Cube Roots
Current Tech Update - Verbal Aptitude Test I - GD –I - Odd man out series - Permutation & Combination -
Problems on ages
GD –II - Resume Writing - Mock Interview I / reading comprehension - Problems on trains – Allegation of
Mixtures - Test
Mock Interview II / reading comprehension - Mock Interview III/ reading comprehension - GD – III - Ratio &
Proportion - Clocks - H.C.F & L.C.M
GD – IV - Verbal Aptitude Test II – Review – Partnership – Puzzles – Test
56 CS – 07-08-SRM – E&T
SCHEME OF INSTRUCTION
Marks allocated for regular participation in all oral activities in class
SCHEME OF EXAMINATION
Complete Internal evaluation on a regular Basis
L T P C
CS0312 ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS LAB 0 0 3 2
Prerequisite
MA 0211
PURPOSE
To learn & implement the various concepts & algorithms of AI & Expert Systems
INSTRUCTIONAL OBJECTIVES
1. To implement Heuristic functions & Prepositional Logic
2. To implement A* & AO* algorithms
3. To implement an Expert system for medical diagnosis
LIST OF EXPERIMENTS
1. Water Jug Problem (Using DFS And BFS)
2. Single Player Game(Using Heuristic Function)
3. Two Player Game(Using Heuristic Function)
4. A* Algorithm
5. AO* Algorithm
6. Predicate To Prepositional Logic
7. Syntax Checking of English sentences-English Grammar.
8. Develop an Expert system for Medical diagnosis.
9. Develop any Rule based system for an application of your choice.
10. Develop an algorithm for morphological derivation / verb derivation and
implement it.
REFERENCE : Laboratory Manual
L T P C
CS 0314 DATABASE MANAGEMENT SYSTEMS LAB 0 0 3 2
Prerequisite
CS0201
PURPOSE
This laboratory course gives a thorough understanding of the concepts of database design model and its
applications. It also gives a comprehensive understanding of using a query language.
INSTRUCTIONAL OBJECTIVES
1. Designing a database
2. Using DDL and DML commands
3. Backing up of files
LIST OF EXPERIMENTS
1. Data Definition Language (DDL) commands in RDBMS
2. Data Manipulation Language (DML) and Data Control Language (DCL)
3. High level language extensions with cursors
4. High level language extension with Triggers
5. Procedures and Functions
6. Embedded SQL
57 CS – 07-08-SRM – E&T
7. Database design using E-R model and Normalization
8. Design and implementation of payroll processing system
9. Design and implementation of Banking system
10. Design and implementation of Library Information System
11. Design and implementation of Student Information System
12. Automatic Backup of Files and Recovery of Files
REFERENCE : Laboratory Manual
SEMESTER VII
L T P C
MB0403 INDUSTRIAL MANAGEMENT AND ECONOMICS 3 0 0 3
Prerequisite
Nil
PURPOSE
To expose the students on Economics and management aspects.
INSTRUCTIONAL OBJECTIVES
To apply theoretical economic concepts to practical business situation and to take decision in the Industrial
Engineering Situation.
INTRODUCTION
Introduction to management:- Nature and scope of management – Functions- Planning-Organizing – Staffing-
Leading-controlling.
PRODUCTION AND MANAGEMENT
Production & Management – Plant location – Factors Influencing location – Process – Methods-Procedures –
Production routing, scheduling, Production Costs, Inventory and Controlling Techniques.
MANAGERIAL ECONOMICS
Managerial economics for Industry-Demand-Types-Supply-Factors-Determining Demand-Elasticity of
Demand-Forecasting Methods-Utility-Theories of Utility – Pricing – Methods of Pricing.
ENGINEERING ETHICS
Engineering Ethics – Social experimentation – Responsibility for safety – Collective bargaining – Global issues
– Environmental Ethics – Sample Code & Conducts.
ACCOUNTING AND FINANCE
Accounting for Management – Concepts, Conventions – Introduction to financial statements – tools and
techniques of Financial Statements – Budget and Budgetary control – Cost Concepts – Financial information
System.
TEXT BOOKS
1. Koontz, “Essential of Management”, McGraw Hill Publishing Company, International edition.
2. Dr.S.N.Maheswari, “Financial and Management Accounting”, sultan chand & sons, New delhi.,
1998.
3. Mike Martin, Roland Sehinzinger, “Ethics in Engineering”, Mc Graw Hill New Yord, 1996.
REFERENCE BOOKS
1. M.Senthil, “Production Management”, A.R.S publishers, sivakasi.
2. Vaishney, sundaram,”Managerial economics”, sultan Chand, New Delhi.
L T P C
CS0401 SOFTWARE ENGINEERING 3 0 0 3
Prerequisite
NIL
58 CS – 07-08-SRM – E&T
PURPOSE
This course in Software Engineering provides an in-depth understanding of the Software
Engineering principles and methodologies
INSTRUCTIONAL OBJECTIVES
1. Planning and Estimation of Software projects
2. Software Requirements Specification, Software Design Concepts
3. Implementation issues ,Validation and Verification Procedures
4. Maintenance of Software and methodologies
SOFTWARE PROJECT MANAGEMENT
Software project planning : Importance of software – Introduction – Defining the problem – Developing a
solution strategy – Planning and development process – Other planning activities. Software cost estimation :
Introduction – Software cost factors – Software cost estimation techniques – Staffing level estimation –
Estimating software maintenance costs.
SOFTWARE REQUIREMENTS ANALYSIS
Introduction – The software requirement specifications – Formal specification techniques – Languages and
processors for requirements specification : SDAT, SSA, GIST, PSL/PSA, REL/REVS- Software prototyping –
rapid prototyping techniques- user interface prototyping- Analysis & modeling – data, functional & behavioral
models – Structured analysis & data dictionary.
SOFTWARE DESIGN CONCEPTS
Abstraction – Modularity – Software architecture – Cohesion, coupling – Various design concepts and notations
– Real time and distributed system – Design – Documentation – Data flow oriented design – Jackson system
development – Design for reuse – Programming standards.
User interface Design- principles- SCM- Need for SCM- Version control – Introduction to SCM process –
software configuration items
IMPLEMENTATION AND TESTING
Implementation Issues : Introduction – Structured coding techniques – Coding style – Standards and guidelines
– Documentation guidelines-Modern Programming Languages Features : The translation process – PL
characteristics.
Software testing – levels – test activities – types of s/w test – black box testing – testing boundary conditions –
structural testing – test coverage criteria based on data flow mechanisms – regression testing – testing in the
large. S/W testing strategies – strategic approach and issues - unit testing – integration testing – validation
testing – system testing and debugging
SOFTWARE MAINTENANCE & RELIABILITY ISSUES
Introduction – Quality assurance – Walk through and inspections – Static analysis – Symbolic execution-
Software Maintenance: Introduction – Enhancing maintainability during development – Managerial aspects of
software maintenance – Configuration management – Source code metrics – Other maintenance tools and
techniques.
Software reliability – issues- Software reliability Vs Hardware reliability – Failures and Faults - Classification
of Failures – Components and Operational Models
TEXT BOOKS
1. Richard Fairley, “Software Engineering Concepts”, McGraw Hill, 1985.
2. Roger S. Pressman, “Software Engineering A Practitioner Approach” 4th edition , McGraw Hill, 1999
REFERENCE BOOKS
1. Roger S.Pressman, Software engineering- A practitioner’s Approach, McGraw-Hill
International Edition, 5th edition, 2001.
2. Ian Sommerville, Software engineering, Pearson education Asia, 6th edition, 2000.
3. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag, 1997.
4. Shooman, Software Engineering, McGraw Hill, 1983.
59 CS – 07-08-SRM – E&T
5. John D. Musa, “ Software Reliability”, McGrawHill, 1985
6. David Gustafson, “Software Engineering”, Schaum’s outlines,Tata McGraw- Hill,2003.
ONLINE REFERENCES :
1. http://www.rspa.com/spi
2. http://www.comp.lancs.ac.uk/computing/resources/IanS/SE6/Slides/index.html
3. http://www.softwareqatest.com/qatlnks1.html
L T P C
CS0403 PARALLEL AND DISTRIBUTED COMPUTING 3 0 0 3
Prerequisite
CS0201, CS0303
PURPOSE
The purpose of this course is to provide the basics of parallel computing, algorithm design and parallel
programming.
INSTRUCTIONAL OBJECTIVES
1. An introduction about parallel computing.
2. Parallel programming platforms
3. Principles of parallel algorithm design
4. Principles of message passing
5. Shared address space platforms
INTRODUCTION TO PARALLEL COMPUTING
Motivating Parallelism-Scope of parallel computing-Parallel programming platforms-Implicit Parallelism-
Limitations of Memory System Performance-Dichotomy of Parallel computing platforms-Physical organization
of parallel platforms-Communication costs in parallel machines-Routing mechanisms for inter connection
networks.
PRINCIPLES OF PARALLEL ALGORITHM DESIGN
Preleminaries-Decomposition techniques-characteristics of tasks and interactions-mapping techniques for load
balancing-methods for containing interaction overheads-parallel algorithm models.
BASIC COMMUNICATION OPERATIONS
One to all broadcast and all to one reduction-all to all broadcast and reduction
-scatter and gather –sources of overhead in parallel programs-performance metrics for parallel systems-the
effect of granularity on performance.
PROGRAMMING USING MESSAGE PASSING PARADIGM
Principles of message passing programming-Building blocks-Message passing interface-Topologies and
embedding-Overlapping computation with communication-Collective communication and computation
operation.
PROGRAMMING SHARED ADDRESS SPACE PLATFORMS
Thread basics-Why threads?-POSIX thread-Thread basics-Synchronization primitives in Pthreads-controlling
thread and synchronization attributes-Composite synchronization constructs-Case study:Implementation of Chat
Server.
TEXT BOOKS
1. Ananth Grama ,Vipin Kumar,”Introduction to parallel computing”,Second edition,2007
2. Cameron Hughes,Tracey Hughes,”Parallel and Distributed Programming using C++.Pearson
education,2005
REFERENCE BOOK
1. Albert y.Zomaya ,”Parallel and Distributed Computing Hand book”McGrawl Publications 2005.
ONLINE REFERENCES:
www.ebooks.com
www.freebookcentre.com
60 CS – 07-08-SRM – E&T
L T P C
CS0405 VLSI DESIGN AND EMBEDDED SYSTEMS 3 0 0 3
Prerequisite
CS0205, CS0211
PURPOSE
To introduce the concepts, terminologies and technologies used in modern days data communication and
computer networking.
INSTRUCTIONAL OBJECTIVES
1. To understand the concepts of data communications.
2. To study the functions of different layers.
3. To introduce IEEE standards employed in computer networking.
4. To make the students to get familiarized with different protocols and network components.
COMPONENTS OF VLSI
Components of VLSI circuits- Fundamental features (Switching delay, power consumption, scaling, yield
estimation) -. Time-area complexity (Lower bounds, communication complexity and crossing sequence)
VLSI SYSTEM DESIGN
Overview of VLSI system design (Y-chart and optimizations, hierarchical design)
Physical design-Logic synthesis-- High-level synthesis-System On a Chip (SOC)Design methodology.
INTRODUCTION TO EMBEDDED SYSTEM
Introduction-Processor and Memory Organization-Devices and Buses for Device Networks-Device Drivers and
Interrupt Servicing Mechanisms
EMBEDDED PROGRAMMING
Programming concepts-Embedded Programming in C and C++-Embedded Programming in JAVA-Real Time
Operating System Programming Tools.-Micro C/OS-II and VxWorks.
CASE STUDIES OF PROGRAMMING WITH RTOS
Coding for an Automatic Chocolate Vending Machine-Coding for Sending an Application Layer Byte on a
TCP/IP Network –Embedded System for an Adaptive Cruise Control System in a Car-Embedded System for a
Smart Card
TEXT BOOKS
1. 1. W.Wolf ,” Modern VLSI Design: Systems on Silicon ”Second Edition, Prentice Hall 1998, ISBN:0-
011076-0
2. Raj Kamal “Embedded Systems-Architecture, Programming and Design: Tata McGraw-Hill, Eleventh
Reprint ,2007.
REFERENCE BOOKS
1. Douglas A. Pucknell and Kamran Eshraghian, "Basic VLSI Design" Prentice Hall,1995
2. Eugene D. Fabricius, . "Introduction to VLSI Design" Tata- Mcgraw- Hill . ,1990
3. Frank Vahid and Tony Givargis”Embedded System Design: A Unified
4. Hardware/Software Introduction” John Wiley & Sons,ISBN:0471386782,2001
ONLINE REFERENCES
1.Http://www.cc.ee.ntu.edu-iw/`wchang/courses/vlsi2k.html.
2.Http://www.eeng.dcu.ie/`ee213
3.Http://www.esd.cs.ucr.edu.
L T P C
ELECTIVE -III 3 0 0 3
Prerequisite
Nil
One course from the list of courses given below to be selected by the students
CS0421,CS0423,CS0425,CS0427,CS0429,CS0431,CS0433,CS0435,CS0437,CS0439
61 CS – 07-08-SRM – E&T
L T P C
ELECTIVE - IV 3 0 0 3
Prerequisite
Nil
One course from the list of courses given below to be selected by the students
CS0421,CS0423,CS0425,CS0427,CS0429,CS0431,CS0433,CS0435,CS0437,CS0439
L T P C
CS0411 SOFTWARE ENGINEERING LAB 0 0 2 1
Prerequisite
NIL
PURPOSE
To understand the concepts and implement the software engineering methodologies in the list of applications
given below.
INSTRUCTIONAL OBJECTIVES
Develop two or three of the following applications using the software engineering methodologies given below
using Visual tools as front end and MS-ACCESS as Backend.
Requirements Analysis
Design Concepts
Function Point Analysis
Implementation
Software Testing Techniques
Error Tracking
Suggested List of Applications:
1. Library Management System
2. Bank Management System
3. Inventory System
4. Software for a Game
5. Text Editor
6. Natural Language Based Grammar Checker
7. Airline Reservation System
8. Online Survey
REFERENCE : Laboratory Manual
L T P C
CS0413 VLSI AND EMBEDDED SYSTEM DESIGN LAB 0 0 3 2
Prerequisite
CS0205, CS0211
PURPOSE
1. VLSI provides improved solutions for high speed networking, high performance computers, and
special applications of integrated circuits, requiring the use of multiple disciplines.
2. There is urgent need to absorb and assimilate the latest development in the VLSI and embedded
system design field.
3. VLSI industry needs VLSI design engineers and Embedded system design engineers.
INSTRUCTIONAL OBJECTIVES
1. To teach basics of Digital Electronics
2. To teach Digital Signal Processing
3. To have some idea about Microprocessor assembly language programming
4. To know Linear and Digital Integrated Circuits
62 CS – 07-08-SRM – E&T
CMOS VLSI Design
1. VLSI Technology
2. Embedded Systems Design
3. Testing & Verification of VLSI Circuits
4. Digital System Design Using VHDL
5. Design of Analog & Mixed mode VLSI circuits
6. Real Time Embedded Systems
7. Low Power VLSI Design
8. CAD – Tools for VLSI Design
9. Algorithms for VLSI Design Automation
10. Design of VLSI Systems
11. Advanced Embedded System Design
12. VLSI Sub – system Design
REFERENCE : Laboratory Manual
L T P C
CS0416 INDUSTRIAL TRAINING – II 0 0 2 1
(Training to be undergone after VI Semester)
PURPOSE
To provide hands-on experience at site where Computer Science and engineering projects are executed.
INSTRUCTIONAL OBJECTIVES
1. To enable the students to gather a first hand experience on site.
INDUSTRIAL TRAINING II
1. Students have to undergo two weeks practical training in Computer Science and Engineering related
project sites. At the end of the training they have to submit a report together with a certificate in the
format prescribed and make a power point presentation which shall be evaluated.
SEMESTER VIII
L T P C
CS0402 SCRIPTING LANGUAGES AND WEB TECHNOLOGY 3 0 0 3
Prerequisite
CS0202, CS0303
PURPOSE
Uses of web sites and portals have become common for knowledge sharing and business. The course focuses on
the fundamentals of CGI, SCRIPTING LANGUAGES Web Applications
INSTRUCTIONAL OBJECJTIVES
This course introduces the students to
1. Basic web concept and Internet protocol.
2. CGI Concepts & CGI Programming
3. SCRIPTING LANGUAGES
4. Study of DHTML, XML
5. Study of On-Line web application & Internet Concepts
INTRODUCTION
Internet Principles – Basic Web Concepts – Client/Server model – retrieving data from Internet – HTM and
Scripting Languages – Standard Generalized Mark –up languages – Next Generation – Internet –Protocols and
Applications
63 CS – 07-08-SRM – E&T
COMMON GATEWAY INTERFACE PROGRAMMING
HTML forms – CGI Concepts – HTML tags Emulation – Server – Browser Communication – E-mail generation
– CGI client Side applets – CGI server applets – authorization and security. Introduction to PERL.
SCRIPTING LANGUAGES
Java Script Programming-Dynamic HTML-Cascading style sheets-Object model and Event model- Filters and
Transitions-Active X Controls-Multimedia-Client side script.- VB Script programming – Forms – Scripting
Object
SERVER SIDE PROGRAMMING
Dynamic Web content – cascading style sheets – DHTML – XML – Server side includes – communication –
Active and Java Server Pages – Firewalls – Proxy Servers.
ON-LINE APPLICATIONS
Simple applications – on-line databases – monitoring user events – plug-ins –database connectivity – Internet
Information Systems – EDI application in business – Internet Commerce – Customization of Internet
Commerce.
TEXT BOOKS
1. Jason Hunter, William Crawford, “Java Servlet Programming”, O’ Reilly Publications, 1999.
2. Ravi Kalakota and Andrew B Whinston, “Frontiers of Electronic Commerce”, Addison Wesley, 1996
3. Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and Java”, Prentice Hall of India – QUE,1999
REFERENCE BOOKS
1. Jeffy Dwight, Michael Erwin and Robert Niles, “Using CGI”, Prentice Hall of India QUE, 1999.
2. Scot Johnson, Keith Ballinger, Davis Chapman, “Using Active server Pages”, Prentice Hall of India,
1999.
3. Ted coombs, Jason coombs , Brewer, “ Active X source book”, John wiley, 1999
4. Evangelos Petroutsos , “ Mastering Visual Basic 6”, BPB Publications, 1998
ONLINE REFERENCES
http://books.google.com
http://en.wkipedia.org/wki/scriptinglanguage
L T P C
ELECTIVE - V 3 0 0 3
Prerequisite
Nil
One course from the list of courses given below to be selected by the students
CS0422,CS0424,CS0426,CS0428,CS0430,CS0432,CS0434,CS0436,CS0438,CS0440,CS0442,CS0444,
CS0446,CS0448
L T P C
ELECTIVE - VI 3 0 0 3
Prerequisite
Nil
One course from the list of courses given below to be selected by the students
CS0422,CS0424,CS0426,CS0428,CS0430,CS0432,CS0434,CS0436,CS0438,CS0440,CS0442,CS0444,
CS0446,CS0448
L T P C
CS 0414 PROJECT 0 0 16 8
Prerequisite
Should have studied the Computer Science and Engineering Subjects
Prescribed / opted for upto VIII SEMESTER
PURPOSE
64 CS – 07-08-SRM – E&T
To simulate real life situations related to Computer Science and engineering and impact adequate training so
that confidence to face and tackle any problem in the field is developed.
INSTRUCTIONAL OBJECTIVES
1. To guide the students such a way that the students carry out a comprehensive work on the chosen topic
which will stand them in good stead as they face real life situations.
PROJECT
Each student is given a Project which will cover all the aspects ( to the extent possible) like investigation,
planning, designing, detailing and estimating of a Computer Science and engineering structure in which the
aspects like analysis, application of relevant codes, etc., will find a place. Alternately, a few research problems
also may be identified for investigation and the use of laboratory facilities to the fullest extent may be taken as a
project work. Alternately, a student is encouraged to take an industrial project with any Computer Science and
engineering organization or firm. A project report is to be submitted on the topic which will be evaluated.
ELECTIVES FOR FIFTH SEMESTER
L T P C
CS0321 SYSTEM MODELLING AND SIMULATION 3 0 0 3
Prerequisite
Nil
PURPOSE
This course provides a complete understanding of the various mathematical models, simulation techniques and
its applications
INSTRUCTIONAL OBJECTIVES
1. Mathematical models for simulation
2. Random numbers generation
3. Analysis of simulation data and modeling
4. Applications of Simulation, and, simulation software
INTRODUCTION
Systems & Environment – Discrete & Continuous systems- model of a system – Types- Discrete event system
simulation – steps; Simulation Example – Queuing systems – Inventory systems – other examples; General
Principles – concepts in Discrete event simulation – List processing
MATHEMATICAL & STATISTICAL MODELS
Statistical models – Discrete & Continuous distributions – Poisson process; Queuing models – Characteristics –
notations; long run measure of performance of queuing systems – server utilization – costs in queuing problems;
steady-state behavior of infinite population Markovian models- Multiserver Queue: M/M/c/∞/∞ , M/M/c/k/k
RANDOM NUMBERS
Random number generation – Properties – Generation of Pseudo Random numbers – Techniques for generation
– Tests for Random numbers – Random variate generation –
Inverse Transform Technique – Exponential, Uniform, Weibull, Triangular, Empirical continuous, Discrete
distributions- Acceptance Rejection principle
ANALYSIS OF SIMULATION DATA
Input modeling – Identifying the distribution – parameter estimations – Goodness of Fit test – Fitting a non
stationery poisson process – selecting input models without data; Verification and Validation of simulation
models- model building – verification of models – calibration and validation of models – output analysis for a
single model.
APPLICATION & SIMULATION SOFTWARES
65 CS – 07-08-SRM – E&T
Simulation of Computer systems – simulation Tools – model input – High level system simulation – CPU and
memory simulation; Simulation of Computer networks – Traffic modeling – media access control – Data Link
layer, TCP , Model construction.
History of Simulation Software - Simulation in Java, GPSS, SSF; Introduction to various simulation softwares
TEXT BOOK
1. Jerry Banks, John S.Carson, Barry L.Nelson, David M. Nicol, “Discrete Event System Simulation”,
Pearson Education, Fourth Edition, 2005
REFERENCE BOOKS
1. Geoffery Gordon, “System Simulation”, Pearson Education, 2nd Edition, 2007
2. Arerill M.Law, David Kelton, “ Simulation Modelling & Analysis”, McGraw Hill International
Edition, 2000
ONLINE REFERENCES
1. Simulation Software Development Framework
www.topology.org/soft/sim.html
2. Simulation in Python
www.simpy.sourceforge.net
3. C++ Simulation : http://cxxsim.ncl.ac.uk
L T P C
CS0323 DIGITAL IMAGE PROCESSING 3 0 0 3
Prerequisite
Nil
PURPOSE
This course provides a complete understanding of the various image processing techniques
INSTRUCTIONAL OBJECTIVES
1. Image fundamentals and techniques
2. To learn various Image enhancement , restoration and compression techniques
3. To learn various Image segmentation , representation and description methods
INTRODUCTION
Origin of Digital Image processing – fundamental steps – Components of Image processing system – Visual
perception – Light and EM spectrum – Image sensing and acquisition – Image sampling and Quantization –
relationship between pixels
IMAGE ENHANCEMENT
Spatial Domain: Gray level transformation – Histogram processing – Arithmetic / Logic operations- Spatial
filtering – smoothing filters – sharpening filters
Frequency Domain: Fourier transform – smoothing frequency domain filters – sharpening filters – Homographic
filtering
IMAGE RESTORATION
Model of Image degradation/ restoration process – Noise models – mean filters – order statistics – adaptive
filters – band reject – bandpass – notch – optimum notch filters – Linear, position invariant degradations –
establishing degradation functions – Inverse filtering – Weiner – least square – Geometric mean filters
IMAGE COMPRESSION
Fundamentals – Image compression models – Information theory – error free compression: variable length –
LZW – Bitplane – Lossless predictive coding; Lossy compression : Lossy predictive – transform – wavelet
coding; Image compression standards
IMAGE SEGMENTATION, REPRESENTATION & DESCRIPTION
Segmentation: Detection of discontinuities – Edge linking & Boundary detection – Thresholding – region based
segmentation
66 CS – 07-08-SRM – E&T
Representation & Description: Chain codes – Polygonal approximations – signatures – Boundary segments –
Skeletons; Boundary Descriptors – Regional descriptors
TEXT BOOK
1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing” , 2nd edition , Pearson Education,
2007.
REFERENCE BOOKS
1. S.Annadurai, R.Shanmugalakshmi, “fundamentals of Digital Image Processing”, Pearson Education,
2007
2. Rafael C. Gonzalez, Richard E. Woods, Eddins, “Digital Image Processing using MATLAB” , Pearson
Education, 2005
3. Anil Jain K. “Fundamentals of Digital Image Processing”, PHI, 1999.
4. William Pratt , “Digital Image Processing”, Wiley Interscience, 2nd edition 1991
ONLINE REFERENCES
http://eeweb.poly.edu/~onur/lectures/lectures.html
www.caen.uiowa.edu/~dip/LECTURE/lecture.html
L T P C
CS0325 VISUAL PROGRAMMING 3 0 0 3
Prerequisite
Nil
PURPOSE
This course gives a strong foundation to the Visual Programming concepts
INSTRUCTIONAL OBJECTIVES
1. Basics of Windows Programming
2. Visual Basic ,Visual C++ and Visual JAVA Programming
3. Java Applets and Networking concepts
INTRODUCTION TO WINDOWS PROGRAMMING
Different paradigms of programming – Structured Programming- Object Oriented Programming-Functional
Programming- Logic programming- Visual Programming- Concurrent Programming – Comparison – Event
driven programming – Windows programming fundamentals – Applications.
VISUAL BASIC PROGRAMMING
Visual Basic Applications – Creating and using Controls – Menus and Dialogs – Managing projects –
Programming fundamentals – Objects and instances – Debugging – Responding to mouse events – Using grid
control – Creating graphics for application – Displaying and printing information – Interacting with the
environment – File system controls - Processing files – Accessing databases with the data controls.
VISUAL C++ PROGRAMMING
Visual C++ components – Developing simple applications – Microsoft Foundation classes – Controls – Message
handling - Document-view architecture – Dialog based applications – Mouse and keyboard events.
VISUAL JAVA – INTRODUCTION
Java basics – Java classes – Object references – Inheritance – Exception handling - File I/O – Java tools –
Developing Java applications.
JAVA APPLETS AND NETWORKING
Visual J++ Applet wizard – Handling events – Multithreading – Animation techniques – Animating images –
Applets and HTML – Java beans – JavaScript – Combining scripts and Applets – Applets over web and
networking.
TEXT BOOKS
1. Charles Petzold, “Windows Programming”, Microsoft Press, 1995.(Unit – I)
67 CS – 07-08-SRM – E&T
2. Marion Cottingham “Visual Basic”, Peachpit Press, 1999. (Unit – II)
3. Kate Gregory ‘Using Visual C++”, Prentice Hall of India Pvt., Ltd., 1999. (Unit – III)
4. H.M.Deitel and P.J.Deitel, “Java how to program with an Introduction to Visual
5. J++”, Prentice Hall, 1998. (Unit – IV & V)
REFERENCE BOOKS
1. C.H. Pappas, W.H. Murray, III “Visual C++: The Complete Reference”, Tata McGraw-Hill Publishing
Company, 1999.
2. Stephen R.Davis, “Lean Java Now”, Microsoft Press, 1996.
3. Jamie Jaworski, “Java Unleashed”, SAMS Techmedia Publication, 1999.
4. Jason Blooberg. Jeff Kawski, and Paul Treffers, “Web Page Scripting Techniques”,Hayden books,
1996
ONLINE RESOURCES
http://www.hitmill.com/programming/vb.htm
http://www.programmersheaven.com/
http://www.austinlinks.com/CPlusPlus/
http://support.microsoft.com/kb/305326
L T P C
CS0327 SOFT COMPUTING 3 0 0 3
Prerequisite
Nil
PURPOSE
This course provides a way to understand the concepts of Artificial Intelligence , ANN , Genetic Algorithms and
Fuzzy systems and its applications
INSTRUCTIONAL OBJECTIVES
1. Basics of AI and ANN
2. Neuro fuzzy systems and its applications
3. Genetics algorithms and its applications
BASICS OF NEUROSCIENCE AND ANN MODELS
The Brain as a Neural network-Basic Properties of Neurons – Neuron Models – Rosenblatt’s
Prceptron – The widrow-Hoff LMS Learning Algorithm-Order of a Predicate and a Perceptron –
Complexity of Learning using Feedforward Networks.
FUZZY SYSTEMS
Fuzzy Sets and Fuzzy Reasoning – Fuzzy Matrices – Fuzzy Functions – Decompositions –
Fuzzy Automata and Languages – Fuzzy Control Method – Fuzzy Decision Making.
NEURO-FUZZY SYSTEMS
Introduction to Neuro – Fuzzy Systems –Fuzzy System Design Procedures – Fuzzy Sets and
Logic Background - Fuzzy / ANN Design and Implementation
GENETIC ALGORITHMS
Introduction – Robustness of Traditional Optimization and Search Techniques – The goals of
optimization-Computer Implementation-Data Structures, Reproduction, Crossover and Mutation
– Mapping Objective Functions to fitness form – Some Applications of Genetic Algorithms.
ARTIFICIAL INTELLIGENCE
AI technique-Level of the Model – Problems, Problem Spaces and Search – Issues in the Design
of Search Programs – Heuristic Search Techniques – Knowledge Representations and Mappings
TEXT BOOKS
68 CS – 07-08-SRM – E&T
1. N. K. Bose and P. Liang , “Neural Network Fundamentals”
2. Timothy J. Ross , “Fuzzy Logic with Engineering Applications”, McGraw- Hill
International Editions,1995
REFERENCE BOOKS
1. Elaine Rich and Kelvin knight ,“Artificial Intelligence”,McGraw- Hill 2000
2. David E. Goldberg, “Genetic Algorithms-In Search, optimization and Machine
Learning”, Pearson Education.
3. Robert J. Schalkoff, “Artificial Neural Networks”, McGraw-Hill International
Editions,1997.
4. Freeman J.A. & D.M. Skapura , “Neural Networks: Algorithms, Applications and Programming
Techniques”, Addison Wesley, 1992.
5. G.J. Klir & B. Yuan, “Fuzzy Sets & Fuzzy Logic”, PHI, 1995.
6. Melanie Mitchell , “An Introduction to Genetic Algorithm”, PHI, 1998.
ONLINE REFERENCE
www.cs.nthu.edu.tw/~jang/nfsc.htm
L T P C
CS0329 ADVANCED OPERATING SYSTEM 3 0 0 3
Prerequisite
Nil
PURPOSE
To learn the Advances concepts of Operating Systems
INSTRUCTIONAL OBJECTIVES
1. To learn the Multiprocessor and Network Operating Systems
2. To learn the Distributed OS ,Database OS and Real time OS
MULTIPROCESSOR OPERATING SYSTEMS
Threads – Process synchronization – Processor scheduling – Memory management – Reliability – Fault
tolerance.
NETWORK OPERATING SYSTEMS (NOS)
Types of NOS – NOS to LANs – Choosing and NOS – Multiple NOS on a single Network – NOS and Network
management – Future Trends.
DISTRIBUTED OPERATING SYSTEMS
Issues - Communication Primitives – Remote procedure call – Logical clocks – Vector clocks – Distributed
mutual exclusion – Non token based algorithms – Token based algorithms – Issues in deadlock detection and
resolution – Centralized and distributed deadlock detection algorithms – Election algorithms, Issues in load
distributing – Load distributing algorithms – Distributed File System design issues – Mechanisms for building
DFS
DATABASE OPERATING SYSTEMS
Requirements - Concurrency control model – Serializability theory – Distributed database systems –
Synchronization primitives – Lock based and timestamp based algorithms – Fully replicated database systems.
REAL TIME OPERATING SYSTEMS
Architecture of Real Time Systems – Operating Systems Issues – Performance Measures – Estimating Program
runtimes – Uniprocessor Scheduling – IRIS Tasks – Task Assignment Mode changes – Fault – tolerant
scheduling – Case Study: Design of a Protocol to access one OS to other
TEXT BOOKS
1. Mukesh Singhal, Niranjan G.Shivaratri, “Advanced Concepts in Operating systems”, McGraw-Hill,
New York, 1994.(UNIT 1, III & IV)
69 CS – 07-08-SRM – E&T
2. C.M.Krishna, Kang G.Shin, “Real Time Systems”, McGraw-Hill, 1997.(Unit – V)
3. Philip Hunter, “Network Operating Systems – Making Right Choices”, Addison Wesley, 1995. (Unit –
II)
REFERENCE BOOKS
1. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall, NJ (Section 9 – 13 only).
2. Pradeep K. Sinha, “Distributed Operating Systems Concepts and Design”, PHI,1997.
3. Gary Nutt, “Operating Systems – A Modern Perspective”, Addison Wesley, 2000.
ONLINE REFERENCES
http://cactus.eas.asu.edu/partha/Teaching/Archive/531.1999/
http://redwood.snu.ac.kr/bbs/zboard.php?id=Conference
http://resources.linuxinsider.com/search/keyword/linuxinsider/Operating%20Systems%20Lecture%20Notes/Op
erating%20Systems%20Lecture%20Notes
L T P C
CS0331 E- COMMERCE 3 0 0 3
Prerequisite
Nil
PURPOSE
This course provides a better understanding of the concepts of Electronic Commerce
INSTRUCTIONAL OBJECTIVES
1. E-Commerce Framework, EDI
2. Security in E-Commerce
3. Intelligent Agents
INTRODUCTION
History of E- Commerce – Overview of E- Commerce framework – E- Business models – Network
infrastructure - Role of Internet – E- commerce and World wide Web.
E COMMERCE
Consumer oriented E- Commerce applications – Mercantile process models ; Electronic Payment Systems –
Digital Token based EPS – Smart cards – Credit cards – Risks – designing EPS.
ORGANIZATIONAL COMMERCE AND EDI
Electronic Data Interchange – EDI applications in Business – EDI and e Commerce – EDI standardization and
implementation – Internet based EDI.
SECURITY
Internet security standards – secure electronic payment protocols ; cryptography and authentication – security
issues – encryption techniques; e commerce payment mechanisms –SET protocol – electronic check – electronic
cash; E-commerce ethics, regulations and social responsibility.
INTELLIGENT AGENTS
Definition and capabilities – limitation of agents – security – web based marketing – search engines and
Directory registration – online advertisements – Portables and info mechanics – website design issues.
TEXT BOOKS
1. Ravi Kalakota and Andrew B Whinston, “ Frontiers of Electronic Commerce “,Pearson Education
Asia, 1999.( Chapters 1,2,3,6-10,16)
2. Marilyn Greenstein and Todd M Feinman , ” Electronic commerce: Security, Risk Management and
Control “ Tata McGraw-Hill , 2000.(Chapters 7,8,10-12)
REFERENCE BOOKS
1. Judy Strauss and Raymond Frost , “ E Marketing “, PHI, 2002
2. Brenda Kienan , “ Managing e Commerce Business” , PHI,2001
3. Vivek Sharma and Rajiv Sharma , “ Developing e Commerce Sites – an integrated approach “ ,
Pearson Education Asia, 2000
70 CS – 07-08-SRM – E&T
ONLINE REFERENCES
http://www.techtutorials.info/ecommerce.html(Unit-1,2)
http://en.wikipedia.org/wiki/Electronic_data_interchange (Unit-3)
http://cs.anu.edu.au/student/comp3410/lectures/security/symmetric-4up.pdf (Unit-4)
http://www.iseca.org/mirrors/sans.org/4-37.pdf
http://www.webopedia.com/didyouknow.internet/2005/ssl.asp
http://www.cs.berkeley.edu/~russell/aimale/chapter02.pdf (unit-5)
L T P C
CS0333 TCP/IP PRINCIPLES AND ARCHITECTURE 3 0 0 3
Prerequisite
Nil
PURPOSE
To learn the principle s of TCP / IP and its Architecture.
INSTRUCTIONAL OBJECTIVES
1. Network Layer and Applications
2. UDP and TCP applications
3. Transport Layer Reliability
4. To understand the basic concepts of TCP/IP Architecture
INTRODUCTION
Intermediate communication entities- Layering network addresses-DNS-Client server model- Port numbers-
Standardization process-RFC’s-Standard simple services-Application programming interfaces-Ethernet &IEEE
802 – encapsulation-SLIP-PPP-loop back interface-MTU-path MTU-ARP cache – Packet format – proxy ARP
& Gratitions ARP –ARP command – RARP- Structure TCP/IP s/w in operating system.
NETWORK LAYER AND APPLICATION
Introduction- IP header- IP routing - Subnet addressing- Subnet mask- Special case IP addresses – Examples-
Ifconfig – Netstat- routing principles - ICMP host and Network unreachable errors - ICMP redirect errors –
ICPM router discovery messages- Dynamic routing - UNIX routing daemons- routing information protocol
(RIP)-OSPF-CIDR – Case study: Voice over IP for two way Communication.
UDP AND APPLICATIONS
Introduction- UDP header- UDP checksum- examples-IP fragmentation - ICMP unreachable errors – Path
MTU discovery- Interaction between UDP and ARP-UDP datagram size- ICMP source quench error- Broad
casting and Multi casting - IGMP- NFS- -TFTP-BOOTP
TCP
Introduction- TCP services- TCP header – Connection establishment and termination – Maximum size – TCP
half close – TCP state transition diagram – Reset segments- Simultaneous open and close – TCP options –
Interactive input – Delayed acknowledgement – Nagle algorithm – Window size advertisement- Normal data
flow – Sliding window – Window size - PUSH flag – Slow start– Bulk data throughput – Urgent mode
TRANSPORT LAYER RELIABILITY AND APPLICATION
CP/IP time out – Retransmission – Roundtrip time measurement – Congestion avoidance algorithms – Fast
retransmit and fast recover algorithm – Repacaketization - ICMP errors- TCP persistent – TCP features and
performance – Telnet and rhogin - SMTP – TCP dump
TEXT BOOKS
1 .W. Richard Stevens, “TCP/IP Illustrated,The Protocol-Volume I” , Addison-Wesley Pub Co,1st
Edition,1994
2 Dougles E.Comer, “Internetworking with TCP/IP–Principles, Protocols & Architecture”, Pearson
education, 4th Edition,2000
REFERENCE BOOKS
1. Behrouz A. Forouzam, “TCP/IP Protocol Suite”, Tata McGraw Hill, 2000
2. Michael Santifaller, “TCP/IP – ONC/NFS, Internetworking in UNIX Environment”, Addison Wesley
Professional, 2nd Edition, 1994.
71 CS – 07-08-SRM – E&T
3. Richard Stevens, “ TCP/IP Illustrated”, Vol 1,2,3 Pearson education India, 1996
ONLINE REFERENCES
http://www.rhyshaden.com/ipadd.html
http://ckp.made-it.com/ieee8023.html
http://en.wikipedia.org/wiki/IEEE_802
http://edia.org/wiki/Transmission_Control_Protocol#Protocol_operation
ELECTIVES FOR SIXTH SEMESTER
L T P C
CS0322 ADVANCED NETWORKS 3 0 0 3
Prerequisite
Nil
PURPOSE
This course gives a overview of advanced computer networks and TCP/IP protocols and also covers security
and network management aspects.
INSTRUCTIONAL OBJECTIVES
1. IPV4 and IPV6 protocols routing
2. Resource allocation and service management
3. Network security and example security systems
4. Network management and its protocols
5. Advanced network protocol applications
HIGH SPEED NETWORKS
Introduction – Protocols and Architecture – TCP and IP – High Speed Networks – Frame relay- ATM – High
Speed LANs
Performance modeling and estimation – Queuing analysis – self similarity and self similar traffic.
CONGESTION, TRAFFIC MANAGEMENT AND INTERNET ROUTING
Congestion control in data networks and internets – Link level flow and error control – TCP traffic control –
Traffic and Congestion control in ATM Networks – Internet routing – graph theory and least cost paths –
Interior routing protocols.
PRINCIPLES OF WIRELESS NETWORK OPERATION
Network planning – topologies – fundamentals – signal to interference ratio calculation – capacity expansion
techniques – network planning for CDMA systems – Wireless network operations – mobility – radio resources
and power management – security.
LOCAL AND BROADBAND AND AD HOC NETWORKS
Introduction WLANs – IEEE 802.11 WLANs – Wireless ATM and HIPERLAN – Adhoc Networking and
WPAN – Wireless geolocation systems architecture.
NETWORK MANAGEMENT
Network Management – Choosing a configuration method – Management Information Base – SNMP – XML –
CORBA –choosing a configuration protocol – COPS
Advanced Applications – IP encapsulation – VPNs – Mobile IP – Header Compression – Voice over IP – IP and
ATM IP over dial-up links
Case Study: Design of Cluster Networks
TEXT BOOKS
1. William Stallings, “High Speed Networks, Internet Performance and QoS”, Prentice Hall, 2003.
2. Kaveh Pahlevan and Prashant Krishnamoorthy, “Principles of Wireless Networks”, Prentice Hall of
India, 2006.
3. Adrian Farrel, “The Internet and its Protocols “ First India Reprint 2005, Elsevier publications
REFERENCE BOOKS
1. Larry L.Peterson and Bruce S.Davie, “Computer Networks” Third Edition, Elsevier Publications 2003.
2. William Stallings, “Local & Metropolitan Area Networks”, 6th edition, Prentice Hall, 2000
72 CS – 07-08-SRM – E&T
3. Behrouz A Forouzan, “Data Communication and Computer Networking”, 3rd edition, 2004
ONLINE REFERNCES
www.utdallas.edu/~metin/SuNet
www.rivier.edu/faculty/vriabov
ce.sharif.edu/courses
http://williamstallings.com/HsNet2e.html
L T P C
CS0324 VIRTUAL REALITY 3 0 0 3
Prerequisite
Nil
PURPOSE
This course provides a detailed understanding of the concepts of Virtual Reality and its application.
INSTRUCTIONAL OBJECTIVES
1. Geometric modeling and Virtual environment.
2. Virtual Hardware and Software.
3. Virtual Reality applications.
INTRODUCTION
Virtual Reality & Virtual Environment : Introduction – Computer graphics – Real time computer graphics –
Flight Simulation – Virtual environments –requirement – benefits of virtual reality- 3D Computer Graphics :
Introduction – The Virtual world space – positioning the virtual observer – the perspective projection – human
vision – stereo perspective projection – 3D clipping – Colour theory – Simple 3D modeling – Illumination
models – Reflection models – Shading algorithms.
GEOMETRIC MODELLING
Geometric Modeling: Introduction – From 2D to 3D – 3D space curves – 3D boundary representation -
Geometrical Transformations: Introduction – Frames of reference – Modeling transformations – Instances –
Picking – Flying – Scaling the VE – Collision detection - A Generic VR system: Introduction – The virtual
environment – the Computer environment – VR Technology – Model of interaction – VR System.
VIRTUAL ENVIRONMENT
Animating the Virtual Environment: Introduction – The dynamics of numbers – Linear and Non-linear
interpolation - The animation of objects – linear and non-linear translation - shape & object inbetweening – freeform
deformation – particle system- Physical Simulation : Introduction – Objects falling in a graphical field –
Rotating wheels – Elastic collisions – projectiles – simple pendulum – springs – Flight dynamics of an aircraft.
VR HARDWARES & SOFTWARES
Human factors : Introduction – the age- the ear- the somatic senses - VR Hardware : Introduction – sensor
hardware – Head-coupled displays –Aquatic hardware – Integrated VR systems-VR Software: Introduction –
Modeling virtual world –Physical simulation- VR toolkits – Introduction to VRML.
VR APPLICATION
Introduction – Engineering – Entertainment – Science – Training – The Future: Introduction – Virtual
environments – modes of interaction.
TEXT BOOKS
1. John Vince, “Virtual Reality Systems “, Pearson Education Asia, 2002
REFERENCE BOOKS
1. Adams, “Visualizations of Virtual Reality”, Tata McGraw Hill, 2000.
2. Grigore C. Burdea, Philippe Coiffet , “Virtual Reality Technology” , WileyInterscience,1 Edition,1994.
3. William R. Sherman, Alan B. Craig, “Understanding Virtual Reality: Interface, Application, and
Design”,Morgan Kaufmann, 1st Edition,2002.
ONLINE REFERENCES
www.vresources.org
www.vrac.iastate.edu
73 CS – 07-08-SRM – E&T
www.w3.org/MarkUp/VRML/
http://books.google.com - Multimedia and Virtual Reality Engineering, Virtual Reality Technology
L T P C
CS0326 ADVANCED DATABASES 3 0 0 3
Prerequisite
Nil
PURPOSE
The purpose of this course is to impart knowledge on various data structure concepts to the students.
INSTRUCTIONAL OBJECTIVES
At the end of the course, student should be able to understand
1. Several Database concepts like Distributed Database, Spatial Database, Mobile Database, Temporal
Database
2. Applications of Databases
3. Analysis of Database design and Methodology
INTRODUCTION
Introduction to Database – Database Environment – Relational Model – Relational Algebra and Relational
Calculus – Introduction to SQL – Commercial RDBMS – Ms Access 2000, Oracle 8i.
DATABASE ANALYSIS & DESIGN TECHNIQUES
Database Planning – Design & Administration – Fact finding techniques - E-R Modeling – EER Modeling –
Normalization.
METHODOLOGY
Logical Database Design for Relation Model – Physical Database Design for Relational Database – Security –
Transaction Processing – Query Processing.
OBJECT ORIENTED AND DISTRIBUTED DATABASES
Introduction to Object DBMS – Object DBMS Concepts and Design – Distributed Database Concepts and
Design – Advanced Concepts of Distributed Database – Introduction to Parallel Database.
CURRENT TRENDS
Mobile Database – Geographic Information Systems – Genome Data Management – Multimedia Database –
Parallel Database – Spatial Databases –Temporal databases - Database administration – Data Warehousing and
Data Mining.
TEXT BOOK
1. Thomas Connolly, Carolyn Begg.,”Database Systems”, 3rd Edition – Pearson Education.
REFERENCE BOOKS
1. Abraham Silberschatz, Henry F.Korth, Sudarshan,”Database System Concepts”,4th Edition – McGraw-
Hill.
2. M.Tamer Ozsu , Patrick Ualduriel, “Principles of Distributed Database Systems”, Second Edition,
Pearson Education, 2003.
3. Ramez Elmasri & Shamkant B.Navathe, “Fundamentals of Database Systems”, Fourth Edition,
Pearson Education , 2004.
4. Peter Rob and Corlos Coronel, “Database Systems – Design, Implementation and Management”,
Thompson Learning, Course Technology, 5th Edition, 2003.
ONLINE RESOURCES
http://www.doc.ic.ac.uk/~pjm/adb/index.html
http://www.cs.manchester.ac.uk/postgraduate/taught/programmes/fulllist/
index.html#COMP60362
L T P C
CS0328 NEURAL NETWORKS 3 0 0 3
Prerequisite
74 CS – 07-08-SRM – E&T
Nil
PURPOSE
To study the Artificial Neural Networks and its applications in computer field
INSTRUCTIONAL OBJECTIVES
1. To learn the basics of ANN and comparing with Human brain
2. To learn the various architectures of building an ANN and its applications
3. To learn the pattern classification techniques , advanced methods of representing information in ANN
INTRODUCTION
Definition of ANN-Biological Neural Networks-Applications of ANN-Typical Architectures-Setting the
weights-Common Activation functions-Development Of Neural Networks-McCulloch-Pitts Neuron
SIMPLE NEURAL NETS FOR PATTERN CLASSIFICATION
General discussion - Hebb net – Perceptron- Adaline - Backpropagation neural net- Architecture- Algorithm-
Applications
PATTERN ASSOCIATION
Training Algorithm for Pattern Association-Heteroassociative memory neural network-Autoassociative net-
Iterative Autoassociative net-Bidirectional Associative Memory
NEURAL NETS BASED ON COMPETITION
Fixed Weights Competitve Nets- Kohonen’s Self-Organizing Map – Learning Vector Quantization-Counter
Propagation Network.
ADAPTIVE RESONANCE THEORY AND NEOCOGNITRON
Motivation – Basic Architecture- Basic Operation-ART1-ART2-Architecture-Algorithm-applications-Analysis-
Probablistic Neural Net-Cascade Correlation-Neocognitron: Architecture—Algorithm.
TEXT BOOK
1. Laurene Fausett, “Fundamentals Of Neural Networks-Architectures, Algorithms and Applications”,
Pearson Education, 2004.
REFERENCE BOOKS
1. James. A.Freeman and David.M.Skapura, "Neural Networks Algorithms, Applications and
Programming Techniques " ,Pearson Education , 2002.
2. B.Yegnanarayana, "Artificial Neural Networks",Prentice - Hall, of India, 2001.
3. Simon Haykin, "Neural Networks - A Comprehensive Foundation’, Pearson Education – 2001.
4. L.O.Chua , T.Roska, “Cellular Neural Networks and Visual computing- Foundations and
Applications”, Cambridge University Press, 2002
5. D.J.Mackay, “Information Theory, Inference and Learning Algorithms”, Cambridge University Press,
2005.
ONLINE REFERENCES
http://www.cs.stir.ac.uk/~lss/NNIntro/InvSlides.html
http://www.willamette.edu/~gorr/classes/cs449/intro.html
L T P C
CS0330 QUANTUM INFORMATION PROCESSING 3 0 0 3
Prerequisite
Nil
PURPOSE
This course aims to exploit genuine quantum features to envisage novel forms of information processing.
INSTRUCTIONAL OBJECTIVES
To provide the students sufficient knowledge for
1. quantum mechanics
2. gate and measurement based models of quantum computation
75 CS – 07-08-SRM – E&T
3. to complement the traditional approaches of computation
INTRODUCTION
Quantum bits – quantum computation – quantum gates – quantum circuits - quantum parallelism - Deutsch’s
algorithm –– Experimental quantum Information processing – example problems.
QUANTUM MECHANICS
Linear operators and matrices – adjoints and Hermitian operators – tensor products – polar and singular value
decomposition - state space – quantum measurement – projective measurements – superdense coding –
ensembles of quantum states – EPR and Bell inequality
QUANTUM COMPUTATION
Single qubit operations – Universal quantum gates – a discrete set of universal operations – quantum
computational complexity – quantum simulation algorithm – perspectives on quantum simulation
QUANTUM SEARCH ALGORITHMS
The oracle – the procedure – Geometric visualization – Quantum counting – Speeding up the solution of NP
complete problems – Quantum search of an unstructured database – Optimality of the search algortithms
QUANTUM INFORMATION THEORY
Distinguishing quantum states and the accessible information – Schumacher’s quantum noiseless channel
coding theorem for data compression – communication over noisy quantum channel – Entanglement distillation
and Quantum error correction – quantum key distribution – security of quantum key distribution.
TEXT BOOK
1. M. A. Nielsen and I. L. Chuang, “Quantum Computation and Quantum information”, Cambridge
University Press 2000
REFERENCE BOOKS
1. Bellac Michel Le, “A short introduction to quantum information and quantum computation”,
Cambridge University Press, 2006
2. Vishal Sahni, “Quantum Computing”, Tata McGrawHill, 2007.
ONLINE REFERENCES
http://www.qubit.org/
http://www.hpl.hp.com/research/qip/
http://www.qipirc.org/links.php
http://www.nsf.gov/pubs/2000/nsf00101/nsf00101.htm
ELECTIVES FOR SEVENTH SEMESTER
L T P C
CS0421 GENETIC ALGORITHMS 3 0 0 3
Prerequisite
Nil
PURPOSE
This course enables us to understand the concepts of Genetic Algorithms and its applications
INSTRUCTIONAL OBJECTIVES
1. Genetic Operators and modeling
2. Applications of Genetic Algorithms
3. Genetic Based Machine Learning
INTRODUCTION TO GENETIC ALGORITHM
Introduction to Genetic Algorithm – History – Basic concepts – Creation of Off-springs – Working principle
- Encoding – binary encoding – octal encoding – hexadecimal encoding – permutation encoding- value
encoding – tree encoding – fitness function
76 CS – 07-08-SRM – E&T
GA OPERATORS
Reproduction- Roulette-wheel Selection – Boltzmann Selection – Tournament Selection-Rank Selection –
Steady –state selection – Elitism – generation gap and steady-state selection - Inheritance operators -
Crossover- Single-point crossover – Two-point cross over – Multi-point cross over – Uniform Cross over –
Matrix Cross Over – Cross Over rate - Mutation operators – mutation – mutation rate
GENETIC MODELLING
Inversion and deletion : Inversion – deletion and duplication - deletion and regeneration – segregation – cross
over and inversion – Bit-wise operators – one’s complement operator – logical bit-wise operators – shift
operators – bit-wise operators used in GA – generational cycle – convergence of GA - Differences and
Similarities between GA and Other Traditional Methods
APPLICATIONS OF GA
The rise of GA – GA application of Historical Interaction. – Dejung & Function optimization – Current
applications of GA -Techniques in genetic search :Dominance, Diploidy & abeyance –Niche & Speciation –
Multi objective optimization – Knowledge-Based Techniques. – GA & parallel processes- Real Life Problem
GENETICS-BASED MACHINE LEARNING
Genetics – Based Machined learning – Classifier system – Rule & Message system – Apportionment of credit:
The bucket brigade – Genetic Algorithm – A simple classifier system in Pascal. – Results using the simple
classifier system-The Rise of GBMC – Development of CS-1, the first classifier system. – Smitch’s Poker
player–Current Applications.
TEXT BOOKS
1. David E. Goldberg, “Genetic Algorithms in Search, Optimization & Machine Learning”, Pearson
Education, 2001.
2. S.Rajasekaran, G.A.Vijayalakshmi Pai, “ Neural Networks, Fuzzy Logic and Genetic Algorithms”,
Pearson Education , 2003.
REFERENCE BOOK
1. Kalyanmoy Deb ,”Optimization for Engineering Design , Algorithms and examples” PHI 1995.
ONLINE REFERENCES
www.ai-depot.com
www.cscs.umich.edu/links/evocomp.html
L T P C
CS0423 SPEECH TECHNOLOGY 3 0 0 3
Prerequisite
Nil
PURPOSE
To study important concepts in Speech technology
INSTRUCTIONAL OBJECTIVES
To provide a general introduction to speech technology
1. To study about text to speech conversion, speech recognition
2. To study about machine translation
INTRODUCTION AND FINITE STATE TRANSDUCERS
Introduction: Knowledge in Speech and Language processing – Ambiguity – Models and algorithms –
Language, thought and understanding - Regular expressions – Finite state automata – Regular Languages –
Morphology: Survey of English morphology – Morphological parsing – Combining FST Lexicon and rules –
The porter stemmer – Human morphological processing
TEXT TO SPEECH AND PROBABILISTIC MODELS
Speech Sounds and Phonetic Transcription – Phonological Rules – Transducers – Advanced issues in
computational phonology – Mapping text to phones for TTS – prosody in TTS – Probabilistic models: Spelling
errors – Detecting Non-word errors – Bayesian method to spelling and pronunciation. Minimum Edit Distance –
Weighted Automata – N-grams: Counting words – Smoothing – Back-off – Deleted Interpolation – Entropy
77 CS – 07-08-SRM – E&T
SPEECH RECOGNITION AND GRAMMER
Architecture – Overview of Hidden Markov Models - Viterbi Algorithm - Acoustic processing – Acoustic
probabilities – Speech Recognizer – Speech synthesis – English word classes – Part of Speech Tagging – Rule
Based POS tagging – Transformation Based Tagging – issues- Context Free Rules and Trees – Sentence Level
Constructions – Noun phrase – Agreement – Spoken Language Syntax – Grammars and Human Processing.
PARSING
Parsing as Search – Top Down Parser – Problems – Earley Algorithm – Finite State Parsing Methods –
Probabilistic Context Free Grammars – Problems with PCFGs – Probabilistic Lexicalized CFGs – Dependency
Grammars – Human Parsing – Computational Desiderata for Representations - First Order Predicate Calculus –
Linguistically Relevant Concepts – Alternative Approaches to Meaning.
SEMANTIC ANALYSIS AND MACHINE TRASLATION
Syntax Driven Semantic Analysis – Attachments – Robust Semantic Analysis – Dialogue and Conversational
Agents : Dialogue Acts – Automatic Interpretation – Dialogue Structure – Dialogue Managers in Conversational
Agents – Machine Translation : Language Similarities and Differences – Transfer Metaphor – Interlingua Idea –
Statistical Techniques – Usability and System Development.
TEXT BOOK
1. Daniel Jurafsky, James H. Martin, “Speech and Language processing” – Pearson Education”, 2004.
REFERENCE BOOKS
1. R Rabinder L and Juang B.H “Fundamentals of Speech Recognition “- Prentice Hall, 1993.
2. Lawrence R. Rabiner, Ronald W. Schafer,” Digital Processing of Speech Signals” – Prentice Hall, 1978.
ONLINE REFERENCES
http://www.stanford.edu/class/cs224s/2006/
http://www.cs.colorado.edu/%7Emartin/SLP/slp-web-resources.html
http://www.speech.cs.cmu.edu/comp.speech/
http://www.speech.cs.cmu.edu/comp.speech/
L T P C
CS0425 MOBILE COMPUTING 3 0 0 3
Prerequisite
Nil
PURPOSE
To learn the standards and issues in Wireless and Mobile Computing
INSTRUCTIONAL OBJECTIVES
1. Wireless transmission basics
2. Different architectures of Tele communication Systems
3. Medium Access control Techniques
4. Protocols in mobile network layer and transport layer.
5. Ad Hoc networks
INTRODUCTION
Introduction – wireless transmission – radio propagation – signals and propagation – antennas – multiplexing
and modulation – spectrum - operation of cellular systems, planning a cellular system, analog & digital cellular
systems.
MAC,TELECOMMUNICATIO AND SATELLITE SYTEMS
Medium access control Techniques-SDMA-TDMA-FDMA-CDMA-Comparison. Tele Communication
Systems-GSM-DECT and TETRA - Satellite Systems-Routing,Localization and Handover.
WIRELESS LAN
Wireless LAN – IEEE 802.11 standards – HIPERLAN – Blue tooth technology and protocols. Wireless Local
Loop technologies.
78 CS – 07-08-SRM – E&T
MOBILE NETWORK LAYER AND TRANSPORT LAYER
Reference model -Handover Location Management-Mobile QOS-Access Point Control Protocol,Mobile IPDHCP-
Mobile transport layer-Traditional TCP-Indirect snooping-Mobile TCP-Wireless Application protocol.
ADHOC WIRELESS NETWORKS
Introduction-Issues in Adhoc Wireless Networks-Adhoc Wireless Internet-Routing protocols in Ad Hoc
networks-Security in Ad hoc networks. Case Studies: Automatic transfer of Plans- Identifying the callee.
TEXT BOOKS
1. Jochen Schiller, “Mobile Communications”, Addison Wesley , 2000.
2. C.Siva Ram Murthy and B.S Manoj “Ad hoc Wireless Networks”, Pearson Education, 2007.
REFERENCE BOOKS
1. Mobile Computing Principles-Reza B’Far-Cambridge University Press-2005
2. Uyless Black, “Mobile and Wireless Networks”, Prentice Hall, 1996.
3. Willian C.Y.Lee, Mobile Communication Design Fundamentals, John Wiley, 1993.
ONLINE REFERENCES
www.interscience.wiley.com/jpages/1530-8669
www.freebookcentre.com/Networking/WirelessLanBooks.html
www.cambridge.org/us/catalogue/catalogue.asp
L T P C
CS0427 NETWORK SECURITY 3 0 0 3
Prerequisite
Nil
PURPOSE
This course provides a way to understand the various security techniques in network.
INSTRUCTIONAL OBJECTIVES
1. Encryption techniques and key generation techniques
2. Authentication and security measures
3. Intrusion and filtering analysis
CONVENTIONAL AND MODERN ENCRYPTION
Model of network security – Security attacks, services and attacks – OSI security architecture – Classical
encryption techniques – SDES – Block cipher Principles- DES – Strength of DES - Block cipher design
principles – Block cipher mode of operation – Evaluation criteria for AES – RC5 - Differential and linear crypto
analysis – Placement of encryption function – traffic confidentiality
PUBLIC KEY ENCRYPTION
Number Theory – Prime number – Modular arithmetic – Euclid’s algorithm - Fermet’s and Euler’s theorem –
Primality – Chinese remainder theorem – Discrete logarithm – Public key cryptography and RSA – Key
distribution – Key management – Diffie Hellman key exchange – Elliptic curve cryptography
AUTHENTICATION
Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and
MAC – MD5 – SHA - HMAC – Digital signature and authentication protocols – DSS
SECURITY PRACTICE
Authentication applications – Kerberos – X.509 Authentication services - E-mail security – IP security - Web
security
SYSTEM SECURITY
Intruder – Intrusion detection system – Virus and related threats – Countermeasures – Firewalls design
principles – Trusted systems – Practical implementation of cryptography and security
79 CS – 07-08-SRM – E&T
TEXT BOOK
1. William Stallings, “Cryptography & Network Security”, Pearson Education, 4th Edition 2006.
REFERENCE BOOKS
1. Charlie Kaufman, Radia Perlman, Mike Speciner, “ Network Security, Private communication in public
world” PHI 2nd edition 2002
2. Bruce Schneier, Neils Ferguson, “Practical Cryptography”, Wiley Dreamtech India Pvt Ltd, 2003
3. Douglas R Simson “Cryptography – Theory and practice”, CRC Press 1995
ONLINE REFERENCES
1. www.williamstallings.com/Security2e.html
2. www.ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-
857Fall2003/CourseHome/index.htm
L T P C
CS0429 FAULT TOLERANT COMPUTING 3 0 0 3
Prerequisite
Nil
PURPOSE
This course gives a detailed design of fault tolerant systems and self checking systems
INSTRUCTIONAL OBJECTIVES
1. Basics of failures and faults
2. Fault tolerant design and Fail safe design
3. Designing testable combinational logic circuits
BASIC CONCEPTS
Failure and Faults, Reliability and failure rate, relation between eligibility and Mean-time Between failures,
maintainability and availability , reliability of series and parallel systems, Modeling of faults, stuck at, Bridging
(short-circuit), stuck open , transient and intermittent faults.
Test Generation: Fault diagnosis of digital systems, Test generation for combinational logic circuits –
conventional methods, Random testing, transition count testing and signature analysis.
FAULT TOLERANT DESIGN
Basic concepts – static, dynamic, Hybrid, and self-purging redundancy, shift-over Modular Redundancy (SMR).
Triple Modular redundancy, SMR. Reconfiguration, use of error correcting codes. Time redundancy, software
redundancy, fail soft-operation, examples of practical fault tolerant systems, Introduction to fault Tolerant
Design of VLSI Chips.
SELF CHECKING CIRCUITS & FAIL SAFE DESIGN
Design of Totally self-checking checkers, checkers using m-out of –n codes, Berger codes and low cost residue
code. Self-checking sequential Machines, partially self checking circuits. Fail Safe Design: Strongly fault
secure circuits, failsafe Design of sequential circuits using partition theory and Berger codes, totally selfchecking
PLA design.
DESIGN FOR TESTABLE COMBINATION LOGIC CIRCUITS
Basic concepts of test ability, controllability and observability. The read-muller expansion technique, three level
OR-AND-OR design, use of control logic and syndrome-testable design.
DESIGN OF TESTABLE SEQUENTIAL CIRCUITS
The scan-path technique – level sensitive scan design (LSSD) and Random Access scan technique, built-in-test,
built-in-test of VLSI chips, design for autonomous self-Test, Designing Testability into logic Boards.
TEXT BOOK
Parag K. Lala, “Fault Tolerant and Fault Testable, Hardware design” PHI 1985.
REFERENCE BOOKS
1. LALA, “ Digital systems design using PLD’s”, PHI 1990.
2. N. N. Biswas, “Logic Design theory”, PHI 1990.
80 CS – 07-08-SRM – E&T
3. Shem , toy Levei , Ashok K.Agarwala , “Fault Tolerant System design”, Tata McGraw Hill, 1994.
4. Pradhan K.K., “Fault Tolerant Computing – Theory and Techniques”, Vol – I and II , PHI 1986.
ONLINE REFERENCE
http://books.google.co.in
L T P C
CS0431 WINDOWS INTERNALS 3 0 0 3
Prerequisite
Nil
PURPOSE
The purpose of this course is to make the students familiar with Windows programming techniques and
concepts in windows environment.
INSTRUCTIONAL OBJECTIVES
1. Windows architecture
2. Windows Programming 2000
3. Windows driver programming
4. DLL and Security
OVERVIEW OF WINDOWS
Windows 2000 overview- DLL’s Multiple file system, Windows 2000 fundamentals- Programming perspective,
Components of window, windows 2000 Applications Basics, Windows 2000 skeleton.
MENUS, CONTROLS AND PROGRAMS
Application essentials- messages & basic I/O, Menu basics, Menu programming, Dialog box and sample
programs, scroll bar programs, Listbox, radiobutton and static controls, Working with Bitmaps, solving the
repaint problem.
TEXT AND CONTROLS
Working with text, using graphics- drawing arcs, rectangles, world-coordinate transforms, mapping modes to
view ports, experiments with GDI, More common controls- up-down control, Track bars, Progress bar, status
windows, tab controls, tree views.
MULTITASK VS MULTIPROGRAM
Multi Programming, multi tasking concepts, Thread-based Multitasking, Using Header month, calendar control
programs, Property sheets & Wizards.
WINDOWS HELP PROGRAMMING AND DLL SECURITY
Context Sensitive vs Reference Help, WM_Help, WinHelp demonstration program, printer device context,
system registry and creation of screen savers, DLL’s and Security.
TEXT BOOK
1. Herbert Schildt ,”Windows 2000 Programming from ground up”, Tata McGraw-Hill –– 2002.
REFERENCE BOOKS
1 Steve Roman ,”Win32 API Programming with Visual Basic”, O'Reilly and Associates, Inc. – - 1999
(Chapter – 9) (Unit -1)
2 Penny Orwick; Guy Smith ,”Developing Drivers with the Microsoft Windows Driver Foundation “–-
MS Press – 2007 (Unit 5)
ONLINE REFERENCES
http://www.microsoft.com/technet/archive/ntwrkstn/evaluate/featfunc/winarch.mspx
http://www.microsoft.com/whdc/driver/wdf/wdf-intro.mspx
www.chapters.indigo.ca/.../item/books-978007212189/0072121890/Windows-2000-Programming-from-the-
Ground-Up
www.mbalat.blogspot.com/2007/01/how-to-secure-windows-2000-xp.html
www.codepedia.com/1/Herbert+Schildt
81 CS – 07-08-SRM – E&T
www.ecampus.com/isbnbrowser2/isbnstart/00721
L T P C
CS0433 LINUX INTERNALS 3 0 0 3
Prerequisite
Nil
PURPOSE
To study the basic and administration concepts in linux .
INSTRUCTIONAL OBJECTIVES
1. To provide a general introduction to linux server.
2. To teach user administration, internet and intranet services.
3. To introduction of process and shell programming .
INSTALLING LINUX AS A SERVER
History of Linux operating system – Difference between windows 2000 and Linux distribution – Installing
Linux in a server configuration – Dual booting issues – methods of installation - GNOME and KDE – X
windows system – KDE Basics – Installing software.
SINGLE – HOST ADMINISTRATION
Managing users – User properties – user database – utilize user management tools setUID & getUID -
Command Line – Booting and Shutting down –Boot loaders, GRUB, Bootstrapping - File System – Core
System services – Compiling Linux kernel Securing an individual server.
INTERNET SERVICES
Internet Services – understanding naming services – BIND configuration file and database file - DNS – FTP –
Setting up web server using Apache – SMTP - Install, configure and run postfix server –POP – conflicts
between pop and other protocols- SSH public key cryptography – creating a secure tunnel.
INTRANET SERVICES
Intranet Services – NFS – enable and configure NFS server and client - NIS – configure NIS Client – setup
secondary NIS server – NIS tools - SAMBA – Administrating samba Printing – Install cups – add and manage
print jobs - DHCP network configuration configure network interfaces - use routers.
LINUX PROCESS CONTROL & SHELL PROGRAMMING
Linux process environment – login process – parent child relationship – process variable process monitoring –
invoking foreground and background process – terminating process Daemons –Introduction to Shell
programming – Shell scripts – executing shell scripts creating scripts – simple examples
TEXT BOOK
1.Steven Graham, Steve Shah ,”Linux Administration A Beginners Guide” ,3rd edition, Dreamtech press ,
2003.
REFERENCE BOOKS
1. Mc Kinnon , Mc Kinnon , “Installing and Administrating Linux “, 2nd edition ,Wiley Dreamtech ,2002
2. Sandip Bhattacharya, Panancrazio De Mauro,Shishir Gundavaram, Mark Mamone,Kapil Sharma,
Deepak Thomas,Simon Whiting “Beginning Red Hat Linux 9 “, 5th edition , Wiley Dreamtech. ,2003
3. Christopher Negus , “Red Hat Linux 9 Bible “, Wiley Dreamtech India Pvt Ltd.2002
ONLINE REFERENCES
www.linuxhomenetworking.com
www.google.com/linux
www.linux.org
http://www.oreillynet.com/linux/cmd/
http://tldp.org/FAQ/Linux-FAQ/
82 CS – 07-08-SRM – E&T
L T P C
CS0435 COMPUTER VISION 3 0 0 3
Prerequisite
Nil
PURPOSE
To study important concepts in Computer Vision
INSTRUCTIONAL OBJECTIVES
1. To provide a general introduction in the field of Computer Vision
2. To teach mathematical concepts and techniques
3. To solve real vision problems
IMAGE FORMATION AND IMAGE MODELS
Geometric Camera Models - Geometric Camera Calibration - Radiometry - Measuring Light – Shadows and
shading - Color
EARLY VISION - MULTIPLE IMAGES
The Geometry of Multiple Views - Stereopsis - Affine Structure from Motion - Projective Structure from
Motion
MID LEVEL VISION
Segmentation by Clustering - Segmentation by Fitting a Model - Segmentation and Fitting using Probabilistic
Methods - Tracking with Linear Dynamic Models
HIGH LEVEL VISION – GEOMETRIC METHODS
Model-Based Vision - Smooth Surfaces and their Outlines - Aspect Graphs -Range Data
HIGH LEVEL VISION -PROBABILISTIC AND INFERENTIAL METHODS
Recognition by Relations between Templates - Geometric Templates from Spatial Relations – Application –
Image Based Rendering
TEXT BOOKS
1. Forsyth D A and Ponce J ,” Computer Vision : A Modern Approach “– Prentice Hall 2003
2. Horn B K P,” Robot Vision”, Cambridge MIT press 1986
REFERENCE BOOKS
1. Y Shirai,”Three Dimensional Computer Vision”, Springer Verlag 1987
2. Wechsler ,”Computational Vision”, Academic Press 1987
3. Haralick R M And Shapiro L G ,”Computer And Robot Vision Vo I and II”, Addison Wesley 1993
4. Jain R C Kasturi R ,”Machine Vision”, McGrawHill 1995
ONLINE REFERENCES
http://kercd.free.fr/linksKCD.html
http://www.cs.ubc.ca/spider/lowe/vision.html
http://www.teiath.gr/seyp/optics/Vision.htm
http://www.visionscience.com/
L T P C
CS0437 ADVANCED JAVA PROGRAMMING 3 0 0 3
Prerequisite
Nil
PURPOSE
To learn the different concepts of Advanced Java and techniques
INSTRUCTIONAL OBJECTIVES
1. To learn Java Applets, Beans and Networking concepts
2. To learn Advanced Java Networking concepts
3. To learn the JDBC and Graphics in Java
83 CS – 07-08-SRM – E&T
INTRODUCTION TO ADVANCED JAVA
Java Streaming – Components and events handling – Threading concepts – Networking features – Byte code
interpretation – Media Techniques.
JAVA APPLETS AND BEANS
Applets and HTML – Bean Concepts – Events in Bean Box – Bean customization and persistence – JavaScript –
Combining scripts and Applets – Applets over web - Animation techniques – Animating images.
ADVANCED NETWORKING
Client-Sever computing – Sockets – Content and Protocols handlers – Developing distributed applications –
RMI – Remote objects – Object serialization
JAVA DATABASE PROGRAMMING
Connecting to Databases – JDBC principles – Databases access – Interacting – Database search – Accessing
Multimedia databases – Database support in Web applications.
RELATED JAVA TECHNIQUES
3D graphics – JAR file format and creation – Internationalization – Swing Programming – Advanced Java
Scripting Techniques.
TEXT BOOKS
1. Jame Jaworski, “Java Unleashed”, SAMS Techmedia Publications, 1999.
2. H.M.Deitel and P.J.Deitel, “Java how to program with an Introduction to Visual J++”, Pearson
Education, 1998.
REFERENCE BOOKS
1. Campione, Walrath and Huml, “The Java Tutorial”, Addison Wesley, 1999.
2. Duane A.Bailey, “Java Structures”, McGraw-Hill Publications, 1999.
3. Jeff Frentzen and Sobotka, ‘Java Script”, Tata McGraw-Hill, 1999.
4. Jamie Jaworski, “Java Unleashed”, SAMS Techmedia Publication, 1999.
5. Jason Blooberg. Jeff Kawski, and Paul Treffers, “Web Page Scripting Techniques”,Hayden books,
1996.
ONLINE REFERENCES
http://javaboutique.internet.com/tutorials/Basics
http://java.sun.com/developer/onlineTraining/Programming/JDCBook
http://lists.xcf.berkeley.edu/mailman/listinfo/advanced-java
http://java.sun.com/docs/books/tutorial/networking/TOC.html
L T P C
CS0439 COMPONENT BASED TECHNOLOGY 3 0 0 3
Prerequisite
Nil
PURPOSE
The course contains concepts of software components and deals with the design of ORB applications.
INSTRUCTIONAL OBJECTIVES
The main aim of this course is to teach the students
1. Fundamentals of COM and DCOM
2. Advanced concepts of COM
3. Concepts of CORBA, building ORB applications in Java
COM BASICS
Components-Components benefits-components requirements-COM-interface-implementing COM interface-
Behinds interface-Query interface- Query interface rules and regulating- query interface defines the componenthandling
new versions of components- Dynamic linking-Distributed COM.
ADVANCED CONCEPTS OF COM
84 CS – 07-08-SRM – E&T
Class factory- Cocreate instance – Class features-Implementing the class factory-Multiple components in DLLUnloading
the DLL- Component reuse: Containment and aggregation – Implementing containment –
Implementing interface-Implementing aggregation-Multiple threads-COM threads-Implementing apartment and
free threading.
JAVA VS CORBA
Benefits of java programming with CORBA – CORBA overview-object management group- object
management architecture, CORBA –OMG IDL
JAVA ORB
Overview of java and java ORB’s- Interface, class, and object –Java applets – Java servlets- java beans- Java
ORB terminology-Clients and servers as Java application- Client as Java applets- Client as Servlets- servers as
Java Applets-Clients and servers implemented using non-java ORB-First java ORB application -OMG IDL Java
mapping.
SERVICES AND EVENTS
Discovering services: CORBA naming service- Trading service-Overview of trading- Overview of trading
service interface-Binding application-Advanced features- The any type and type codes- Interface repositioning
and dynamic invocation and interface-Dynamic skeleton interface-Events-CORBA event service concepts-
Notifications service-Java events and CORBA.
TEXT BOOKS
1. Dale Rogerson, ”INSIDE COM “, Microsoft COM, Third edition: 2003
2. Gerald Brose, Andreas Vogel, Kerth Duddy ,”Java programming with CORBA”, 3rd edition, Wiley
computer publications.,2003
REFERENCE BOOKS
1. George Shepard Brad Kisg ,”INSIDE COM, Inside ATL “ ,Microsoft press- 2000 ., WP publishers and
distributors.
2. Clemens Szperski ,”Component Software – Beyond Object Oriented Programming –, Pearson
Education- 2nd edition ,2004
ONLINE REFERENCES
http://www.sei.cmu.edu/str/descriptions/com_body.html
http://en.wikipedia.org/wiki/Component_Object_Model
http://java.sun.com/developer/technicalArticles/RMI/rmi_corba/
http://ei.cs.vt.edu/~cs6704/CORBA.ppt
ELECTIVES FOR EIGHTH SEMESTER
L T P C
CS0422 ATM NETWORKS 3 0 0 3
Prerequisite
Nil
PURPOSE
This course provides an introduction to ATM Networks, various layers in ATM,ATM Protocols and routing
issues.
INSTRUCTIONAL OBJECTIVES
1. To study the various topologies, Protocol Architectures and basics of ATM cells.
2. To learn about the routing issues and various algorithms to control congestion.
3. To study about wireless ATM and the current trends in ATM.
INTRODUCTION
ATM – Historical perspective – Protocol Architecture – Logical connections – Cells – Transmission of ATM
cells – SDH /SONET architecture.
ATM PROTOCOL
Routing,Switching,Signaling techniques- ATM Service categories – QOS parameters – ATM Adaptation Layer.
85 CS – 07-08-SRM – E&T
ROUTING ISSUES
Routing for high speed networks – RSVP, Traffic and Congestion control – Traffic shaping – Peak cell rate
algorithms – Rate based congestion control – Connection admission control.
HIGH SPEED LANS
Fast Ethernet – ATM LAN’s – LAN Emulation(LANE)
PROTOCOLS OVER ATM
Multiple protocols over ATM, IP over ATM, TCP over ATM – Real time transport protocol – Wireless ATM –
Current trends.
TEXT BOOK
1. William Stallings, “High Speed Networks TCP/IP and ATM Design Principles”, Prentice Hall
International, 1998.
REFERENCE BOOKS
1. William Stalling, “ISDN with Broad Lane ISDN with frame relay and ATM”, PHI,4th edition,1999.
2. Rainer Handel, Manfred N. Huber, Stefan Schroder, “ATM Networks”, Addison Wesley,1999.
3. Uyless Black, “ATM Vol.1 and 2”, PHI, 1999.
ONLINE REFERENCES
http://williamstallings.com/HsNet2e.html
http://williamstallings.com/DCC/DCC7e.html
www.cs.wisc.edu
L T P C
CS0424 DATA MINING 3 0 0 3
Prerequisite
Nil
PURPOSE
This course enable us to understand the concepts of Data Mining and its applications.
INSTRUCTIONAL OBJECTIVES
1. Data mining techniques and algorithms
2. Data Mining environments and applications
3. Spatial Mining, temporal Mining Algorithms.
INTRODUCTION
Data Mining Tasks, Data mining Issues, Decision Support System, Dimentional Modelling, Data warehousing,
Data warehousing,OLAP & its tools, OLTP
MINING TECHNIQUES & CLASIFICATION
Introduction,statistical Perspective of data mining,Decision tree,Neural networks,Genetic algorithms,Issues in
classification,Statistitical based algorithm(regression),Distance based algorithm(simple approach),Decision Tree
based algorithm(C4.5),Neural network based(propogation)
CLUSTERING AND ASSOCIATION RULES
Introduction to clustering,Similarity and distance measures,Hierarchical algorithm(divisive clustering),
partitional algorithm(Mininum Spanning tree,nearest neighbour), Clustering large database(CURE),Introduction
to association,basic algorithm(Apriori),parallel & distributed(data parallelism),Incremental rules,Association
rule techniques(Generalised,multiple level)
ADVANCED MINING
Web mining, Web content mining, Introduction to Spatial mining & its primitives, spatial classification
algorithm(ID3 extension),Spatial clustering algorithm(SD),Introduction to temporal mining, Time series,
Temporal association rule
DATA MINING ENVIRONMENT
86 CS – 07-08-SRM – E&T
Case study in building business environment, Application of data mining in Government, National
datawarehouse and case studies
TEXT BOOK
1. Margaret H. Dunham, S. Sridhar “Data Mining Introductory & Advance Topics” (Unit – 1,2,3,4) -2006
REFERENCE BOOK
1. J.Han, M.Kamber,”Data mining concepts & techniques”,Academic press,Morgan Kanf Man
Publishers,2003.
ONLINE REFERENCE
http://www.data-miners.com/
L T P C
CS0426 GRID COMPUTING 3 0 0 3
Prerequisite
Nil
PURPOSE
To understand the technology application and tool kits for grid computing
INSTRUCTIONAL OBJECTIVES
1. To understand the genesis of grid computing
2. To know the application of grid computing
3. To understand the technology and tool kits for facilitating grid computing
INTRODUCTION AND OVERVIEW OF GRID COMPUTING
Early Grid Activities-Current Grid Activities-An Overview of Grid Business Areas-Grid Applications-Grid
Infrastructure
WEB SERVICES AND RELATED TECHNOLOGIES
Service – Oriented Architecture-Web Service Architecture-XML, Related Technologies, and Their Relevance
to Web services-XML Messages and Enveloping-Service Message Description Mechanisms-Relationship
between Web Service and Grid Service – Web Service Interoperability and the Role of the WS-I Organization
DISTRIBUTED OBJECT TECHNOLOGY FOR GRID COMPUTING (OGSA)
Introduction to Open Grid Services Architecture(OGSA)- Commercial Data Center- National Fusion
Collaboratory- The OGSA Platform Components
OPEN GRID SERVICES INFRASTRUCTURE (OGSI)
Introduction-Grid Services-A High-Level Introduction to OGSI – Introduction to Service Data Concepts – Grid
Service: Naming and Change Management Recommendations.
OGSA BASIC SERVICES AND THE GRID COMPUTING TOOLKITS
Common Management Model(CMM)-Security Architecture- GLOBUS GT3 Toolkit: Architecture- GLOBUS
GT3 Toolkit: - Architecture, Programming model, High level services .
TEXTBOOK
1. Joshy Joseph & Craig Fellenstein, “Grid Computing”, Pearson/PHI PTR-2003.
REFERENCE BOOK
1. Ahmar Abbas, “Grid Computing: A Practical Guide to technology and Applications”, Charles River
media – 2003.
ONLINE REFERENCES
http://www.cs.uiowa.edu/~jni/GC/
The TeraGrid: http://www.teragrid.org
The NSF Middleware initiative: http://www.nsf-middleware.org
The Globus Project: http://www.globus.org
The Grid Portal Toolkit (Grid Port ): http://www.gridport.net
87 CS – 07-08-SRM – E&T
The Open Grid Computing Environments Consortium: http://www.ogce.org
The GridSphere Project: http://www.gridsphere.org
IBM Grid Pages: http://www-1.ibm.com/grid/
Univeristy of Texas UT Grid: http://utgrid.utexas.edu
L T P C
CS0428 AGENT BASED SYSTEMS 3 0 0 3
Prerequisite
Nil
PURPOSE
The purpose of this course is to impart concepts of agents and multi agent systems
INSTRUCTIONAL OBJECTIVES
1. To provide a comprehensive introduction to agents and multiagent systems.
2. It covers a broad range of distributed artificial intelligence topics including agent architectures, agent
interaction and communication, and applications of agent-based systems.
3. It lays the foundations for advanced courses such as Multi-Agent Semantic Web Systems
BASICS
Basics: definitions of agency; properties of agents; agents vs. objects- Agent Architectures:
reactive/deliberative/hybrid agents; BDI and practical reasoning agents; deductive reasoning agents.
RATIONAL REASONING
Rational Reasoning: decision-theoretic/game-theoretic foundations- bounded rationality; means-ends reasoning
- planning
INTERACTION
Interaction: non-communicative interaction; agent communication languages; interaction protocols.
AGENT COORDINATION
Agent coordination: distributed problem solving, planning and task sharing; teamwork and coalition formation;
negotiation (game-theoretic/heuristic/argumentation-based); matchmaking and brokering.
ADVANCED TOPICS
Advanced Topics: distributed search/distributed constraint satisfaction; multiagent learning; agent-oriented
software engineering; trust/norms/institutions, organisational approaches.
TEXT BOOK
1. Michael J. Wooldridge, “An Introduction to Multiagent Systems”, John Wiley and Sons, 2002
REFERENCE BOOK
1. G. Weiss (ed.), “Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence” , MIT
Press, 1999
ONLINE REFERENCES
http://www.inf.ed.ac.uk/teaching/courses/abs/
http://www.sics.se/isl/abc/survey.html
http://en.wikipedia.org/wiki/Multi-agent_system
http://www.dcs.warwick.ac.uk/research/absg/
L T P C
CS0430 HUMAN COMPUTER INTERACTION 3 0 0 3
Prerequisite
Nil
PURPOSE
88 CS – 07-08-SRM – E&T
This course provides a thorough understanding of the user interaction with computers
INSTRUCTIONAL OBJECTIVES
1. Software process and Design rules
2. Implementation and user support
3. Different models for cognition and collaboration
4. Introduction to Ubiquitous computing
FOUNDATIONS
The Human – Input-output channels – Human Memory – Thinking – emotions – Psychology & design of
interactive systems; Computer – Text entry devices- Positioning, Pointing & drawing – Display devices for
Virtual reality, 3D; Interaction – models – Frameworks & HCI, Ergonomics – Interaction styles – WIMP
Interfaces – context; paradigms for Interaction
SOFTWARE PROCESS & DESIGN RULES
Interaction design basics – user focus – scenarios – navigation – screen design & layout; HCI in software
process – life cycle – Usability engineering – Interactive design & prototyping ; Design rules – Principles for
usability – standards – guidelines – golden rules – HCI patterns
IMPLEMENTATION & USER SUPPORT
Implementation support – Windowing system elements – using tool kits – user interface management ;
Evaluation techniques – goals – expert analysis – choosing a method; universal design principles – multimodal
interaction; user support – requirements – Approaches – adaptive help systems – designing user support
systems.
COGNITIVE, COMMUNICATION & COLLABORATIVE MODELS
Cognitive models – Goal & task hierarchies – Linguistic models – Physical
& device models – architectures ; communication & collaboration models – Face-to-face communication –
conversation – text based – group working; Task analysis – difference between other techniques – task
decomposition – Knowledge based analysis – ER based techniques –uses
UBIQUITOUS COMPUTING, HYPERTEXT, WWW
Ubiquitous computing application research – virtual & augmented reality – information & data visualization ;
understanding hypertext – finding things – Web Technology & issues – Static Web content – Dynamic Web
content; Groupware systems – Computer mediated communication – DSS – Frameworks for groupware.
TEXT BOOK
1. Alan Dix , Janet Finlay, Gregory D.Abowd, Russell Beale, “ Human Computer Interaction”, Third
Edition, Pearson Education, 2004
REFERENCE BOOK
1. John M.Carrol, “Human Computer Interaction in the New Millenium”, Pearson Education, 2002
ONLINE REFERENCES
www.scis.nova.edu/nova/hci/notes.html
http://courses.iicm.tugraz.at/hci/hci.pdf
www.ida.liu.se/~miker/hci/course.html
L T P C
CS0432 REAL TIME SYSTEM DESIGN 3 0 0 3
Prerequisite
Nil
PURPOSE
This course enables us to understand the concepts of Real time systems and its applications
INSTRUCTIONAL OBJECTIVES
1. Basics of Real time systems
2. Real time memory and design considerations
89 CS – 07-08-SRM – E&T
3. Integration of Hardware and software in real time applications
INTRODUCTION
Basic real time concepts - Introduction, Real-time Versus Conventional Software, Computer Hardware for
Monitoring and Control, Software Engineering Issues.
DESIGN TECHNIQUES
Real time specification and design techniques – structure of an RTOS - real time kernels – intertask
communication and synchronization.
MEMORY MANAGEMENT
Real time memory management. System performance analysis and optimization.
QUEUING MODELS AND FAULT TOLERANT ARCHITECTURES
Queuing models – Reliability,testing and fault tolerance, HW/SW faults, diagnosis, functional testing . Fault
tolerant architectures: TMR systems - multiprocessing systems.
APPLICATIONS
Hardware/Software integration, real time applications- case studies
TEXT BOOKS
1. Laplante Philip.A, “Real-time systems design and analysis: An engineer’s handbook”,2nd Edition,
PHI.,1994.
2. C.M.Krishna, Kang G.Shin, “Real-time systems” – McGraw Hill, 1997.
REFERENCE BOOKS
1. Alan C. Shaw , “Real – Time Systems and software “,John Wiley & Sons Inc,2001
2. Buhr R J and Bailey D L, “An Introduction to Real-Time Systems”, Prentice-Hall 1999.
3. Burns, A and Wellings, A, “Real Time Systems and Programming Languages: Ada 95, Real-Time Java
and Real-Time C/POSIX”, Addison-Wesley. ISBN.,2001
4. Levi S.T. and Agarwal A.K., “Real time System Design”, McGraw Hill International Edition, 1990.
5. Rajibmall “Realtime systems, Theory & Practice “ , Pearson Education 2007.
ONLINE REFERENCES
www.eventhelix.com/realtimemantra/basics
www.unix.ecs.umass.edu/~krishna
http://infoweb.vub.ac.be/infoef/ulbarch/
www.augustana.ab.ca/~mohrj/courses/2005.winter/cs380/slides.7e
L T P C
CS0434 PATTERN RECOGNITION 3 0 0 3
Prerequisite
Nil
PURPOSE
This course provide a way to learn the various pattern recognition techniques and their applications
INSTRUCTIONAL OBJECTIVES
1. Pattern features and Statistical techniques
2. Cluster analysis and synthetic pattern recognition
3. Feature extraction techniques and advances in the field
INTRODUCTION
Pattern and features – Training and learning in pattern recognition systems – Pattern recognition approaches –
Statistical pattern recognition – Syntactic pattern recognition – Neural pattern recognition – Reasoning driven
pattern recognition – Discriminant functions – Linear and Fisher’s discriminant functions.
STATISTICAL PATTERN RECOGNITION
90 CS – 07-08-SRM – E&T
Gaussian model – Supervised learning – Parametric estimation – Maximum likelihood estimation – Bayesian
parameter estimation – Perceptron algorithm – LMSE algorithm – Problems with Bayes approach – Pattern
classification by distance functions – Maximum distance pattern classifier.
CLUSTER ANALYSIS
Unsupervised learning – Clustering for unsupervised learning and classification – C-means algorithm –
Hierarchical clustering procedures – Graph theoretic approach to pattern clustering – Validity of clustering
solutions.
SYNTACTIC PATTERN RECOGNITION
Elements of formal grammar – String generation as pattern description – Recognition of syntactic description –
Parsing – Stochastic grammar and applications – Graph based structural representation.
FEATURES EXTRACTION AND RECENT ADVANCES
Entropy minimization – Karhunen –Loeve transformation – Neural network structures for pattern recognition –
Unsupervised learning – Self organizing networks – Fuzzy pattern classifiers – Genetic algorithms –
Application to pattern recognition.
TEXT BOOK
1. Robert J, Schalkoff, “Pattern Recognition: Statistical, Structural and Neural Approaches”, John
Wiley & Sons Inc., New York, 1992.
REFERENCE BOOKS
1. Duda R.O. and Hart P.E., “Pattern Classification and Scene Analysis”, John Wiley, New York, 2001
2. Morton Nadler and Eric Smith P., “Pattern Recognition Engineering”, John Wiley and Sons, New
York, 1993.
3. Touand , Gonzalez R. “Patten Recognition Principles” Addision Wesley, 1974.
4. Earl Gose, Richard Johnsonbaugh, Steve Jost, “Pattern Recognition and Image Analysis”, Prentice Hall
of India Private Ltd., New Delhi – 110 001, 1999.
5. Duda R.O, Hart .P.E., D.G. Stal, “ Pattern Classification”,John Wiley, 2001
6. Sergious Theodoridis, Konstantinos Koutroumbus, “Pattern Recognition”, Elsevier,2006
ONLINE REFERENCES:
www.amazon.com
www.oclc.org
www.electricalengineeringnetbase.com
iris.usc.edu
cgm.cs.mcgill.ca
L T P C
CS0436 ROBOTICS 3 0 0 3
Prerequisite
Nil
PURPOSE
To study some topics relevant to designing robots controlled by microcontrollers
INSTRUCTIONAL OBJECTIVES
1. To use microcontrollers for robotics
2. To use different type of sensors for robots
3. To design robots in a real time environment
MICROCONTROLLERS IN ROBOTS
Support Components – Memory and Device Programming – Interrupts – Built in Peripherals – Interfacing the
controller to Robots
SOFTWARE DEVELOPMENT
Source files, Object Files, Libraries, Linkers and Hex files – Assemblers – Interpreters- Compilers – Simulators
and Emulators – Integrated development Environments
THE MICROCHIP PICmicro MICROCONTROLLER
91 CS – 07-08-SRM – E&T
Different PICmicro MCU devices and features – application development tools – Basic circuit requirements –
The PIC16F627 – EL Cheapo PICmicro MCU Programmer Circuit
THE MICROCONTROLLER CONNECTIONS
Hardware Interface Sequencing – Robot C Programming Template – Protyping with the PICmicro
Microcontroller – Intercomputer Communications – RS 232-
Hyperterminal RS 232 Terminal Emulator – RS 232 Interface Example between PC and PCmicro MCU –
Bidirectional Synchronous Interfaces – Output devices – LEDS – PWM power level control – Sensors –
Whiskers for Physical Object detection – iR collision detection sensors – IR Remote controls – Ultrasonic
distance measurement – Light level sensors – Sound Sensors – Odometry for Motor control and navigation –
Radio control servos
BRINGING ROBOTS TO LIFE
Real Time Operating Systems (RTOS) – Example application running in an RTOS – State Machines –
Randomly moving a Robot application with IR Remote Control – Behavioral Programming – Neural Networks
and Artificial Intelligence
TEXT BOOKS :
1. Myke Predko, “Programming Robot Controllers “– McGrawHill, 2002
2. Michael Slater, “Microprocessor – based design: A Comprehensive Guide to Effective Hardware
Design”, Prentice Hall, 1989
REFERENCE BOOKS
1. Myke Predko, “Programming and Customizing the 8051 micro-controller”, Tata McGraw-Hill, New
Delhi, 2000
2. Kenneth J.Ayala, “The 8051 Micro-controller Architecture, programming and applications”, Penram
International Publishers, Mumbai, 1996
3. Murphy Robin R, “Introduction to AI Robotics”, MIT Press, 2000
4. Siegwart R. and Nourbakhsh I. R., “Introduction to Autonomous Mobile Robots” – Prentice Hall India,
2005
5. Roland Siegwart, Illah R. Nourbakhsh, “Introduction to Autonomous Mobile Robots”, MIT Press,2005
ONLINE REFERENCES
http://www.ifi.unizh.ch/groups/ailab/links/robotic.html
http://www.robotics.com/robots.html
http://prime.jsc.nasa.gov/ROV/olinks.html
http://www.idi.ntnu.no/grupper/ai/eval/lego_links.html
L T P C
CS0438 DECISION SUPPORT SYSTEMS 3 0 0 3
Prerequisite
Nil
PURPOSE
The purpose of this course is to impart concepts of decision, decision processes and its implementation
INSTRUCTIONAL OBJECTIVES
1. DSS and its Characteristics
2. Decision Makers and styles
3. Decision processes and its modeling
4. Executive Information System
5. Perspective of DSS
6. Implementation of DSS
INTRODUCTION
Introduction : DSS definition- characteristics- History of DSS- Components of DSS- Data and Model
Management-DSS knowledge base- user interfaces- DSS user- categories and classes of DSS’s- Decision and
Decision Makers : Decision Makers- Decision styles- Decision effectiveness- Hardness of Decisions
DECISION MAKING
92 CS – 07-08-SRM – E&T
Typology of Decisions: Decision theory- Rational Decision Making- Bounded Rationality-Process of choice –
Cognitive processes-Heuristics in Decision Making- Effectiveness and efficiency- Decisions in the
Organization: Understanding the Organization- Organization culture- power and politics- organization
Decision making
DECISION PROCESSES
Modeling Decision Processes: Problem definition and its structure – decision models- types of probability and
its forecasting techniques- sensitivity analysis- Group Decision Support : Group Decision making- the problem
with groups- concepts and definition of MDM technology – MDM activities- virtual workplace-Executive
Information system(EIS):history of EIS-characteristics of executives- EIS components-making EIS workfuture
of executive Decision making and EIS.
SYSTEM PERSPECTIVE OF DSS
Perspective of DSS: System – DSS in the context of information system- Information quality issues in DSS
design- DSS information system architecture- role of Internet in DSS development and use- Designing and
Building DSS: Strategies of DSS Analysis and Design- DSS Developer-tools for DSS development- DSS user
Interface Issues
IMPLEMENTATION OF DSS
Implementing DSS : DSS Implementation- Patterns of Implementation- System Evaluation-Importance of
Integration-Creativity Decision making: Definition of creativity- occurrence of creativity- creative problem
solving techniques-introduction to intelligent DSS (AI, Expert system and Knowledge based systems)– DSS in
the 21st century-future of DSS, EIS and DSS technologies
TEXT BOOK
1. George M .Marakas , "Decision Support Systems",2nd Edition, Pearson Education, 2005.
REFERENCE BOOK
1. Efraim Turban, Jay E.Aronson, Ting-Peng Liang, "Decision Support Systems and Intelligent Systems",
7th Edition, Pearson Education ,2006.
ONLINE REFERENCES
http://en.wikipedia.org/wiki/Decision_support_system
http://www.uky.edu/BusinessEconomics/dssakba/bkpg1.htm
http://dssresources.com/history/dsshistory.html
L T P C
CS0440 BIOINFORMATICS 3 0 0 3
Prerequisite
Nil
PURPOSE
To explore how biological information could be stored in digital form to create bioinformatics resources and
how the same may be processed.
INSTRUCTIONAL OBJECTIVES
1. To study the different coding techniques and standards
2. To know about the different biological network of resources available
3. To learn how to analyze DNA and Protein sequences
4. To learn and understand the multiple sequence analysis techniques
5. To understand protein classification and Structure prediction
INTRODUCTION
Definition – Overview- Major databases in Bio Informatics- Molecular biology – Central Dogma- Data retrieval
tools – Data mining of Databases – Gene Analysis – Prokaryotic and Eukaryotic Genomes – Sequence
Assembly – Gene mapping – Physical maps – cloning – ORF – amino acids – DNA, RNA sequences – Genetic
code.
DNA and PROTEIN SEQUENCES
93 CS – 07-08-SRM – E&T
DNA: working with single DNA sequence : removing vector sequences- verifying restriction maps – PCR
design – GC content – counting words – internal repeats – protein coding regions – ORFing – Genomescan
Protein: predicting properties – primary structure analysis – transmembrane segments – PROSITE patterns –
interpreting scanprosite results- finding domains – CD server results – pfscan results.
ALIGNMENT OF PAIR OF SEQUENCES
Terminology – Global and Local alignment – Dot matrix – dynamic programming – using scoring matrices –
PAM matrices – BLOSUM.
Working with FASTA – Algorithm – output – E-values – Histogram.
Working with BLAST – algorithm – output – services – gapped BLAST- PSIBLAST – comparison of FASTA
and BLAST.
MULTIPLE SEQUENCE ALIGNMENT
Criteria for Multiple sequence alignment – applications – choosing the right sequences; FASTA, ClustalW,
TCoffee methods – interpreting multiple sequence alignment – getting in right format – converting formats –
using Jalview – preparing for publication.
PROTEIN CLASSIFICATION & STRUCTURE PREDICTION
Structure of amino acids – primary structure – secondary structure – folds and motifs – alpha and beta helix –
structure based protein classification – protein structure Data bases – folding problem – PROPSEARCH –
primary structure analysis and prediction – secondary structure analysis and prediction – motifs – profiles –
patterns and fingerprints
TEXT BOOKS
1. S.C Rostogi , Mendiratta, P.Rasogi, “ BioInformatics: methods and applications”,second edition, PHI
2006.
2. Jean Mickel Clavere & Cadrienotredom “Bio Informatics– A beginners guide” Wiley DreamTech,
2003.
REFERENCE BOOKS
1. T.K. Attwood and D.J Perry Smith, “ Introduction to Bio Informatics”, Pearson Education, 1st
Edition, 2001.
2. Dan E.Krane, Michael L.Raymer, “fundamental concepts of BioInformatics “, Pearson Education,
2004.
ONLINE REFERENCES
1. Nucleotide Databases:
www.ncbi.nlm.nih.gov/Genbank
www.ncbi.nlm.nih.gov/Entrez
www.ebi.ac.uk/embl
www.ddbj.nig.ac.jp
2. Protein Databases
www.us.expasy.org
www.ebi.ac.uk/trembl
www.expasy.uniprot.org
3. Protein Structure Databases
www.rcsb.org/pdb
L T P C
CS0442 BLUETOOTH TECHNOLOGY 3 0 0 3
Prerequisite
Nil
PURPOSE
To Study the concepts of Bluetooth Technology.
INSTRUCTIONAL OBJECTIVES
The students will learn how Bluetooth devices operate in the frequency band where other devices operate
including wireless LAN, microwave ovens, cordless telephones, wireless video cameras, and others.
94 CS – 07-08-SRM – E&T
THE BLUETOOTH MODULE
Introduction-overview - the Bluetooth module-antennas-baseband-introduction-bluetooth device address –
masters, slaves, and Pico nets-system timing-physical links-Bluetooth packet structure-logical channelsfrequency
hopping.
THE LINK CONTROLLER
The link controller-link control protocol-link controller operation-Pico net, scatter net operation-master/slave
role switching-base band/link controller architectural overview -link manager-the host controller interface.
THE BLUETOOTH HOST
The blue tooth host-logical link control and adaptation protocol –RFCOMM- the service discovery protocol –
the wireless access protocol-OBEX and IrDA-telephony control protocol.
CROSS LAYER FUNCTIONS
Cross layer functions-Encryption and security-low power operations-controlling low power modes-hold modesniff
mode-park mode-quality of service-managing Bluetooth devices.
TEST AND QUALIFICATION
Test and qualification- test mode-qualification and type approval-implementation – related standards and
technologies.
TEXT BOOK
1. Jennifer Bray and Charles F Sturman,” Bluetooth: Connect Without Cables”,Pearson Education, 2002.
REFERENCE BOOKS
1. By Jennifer Bray, Brain Senese, Gordon McNutt, Bill Munday,”Bluetooth
2. Application Developer Guide”,Syngress Media, 2001.
3. Discovering Bluetooth M.Miller (paperback 2001)
4. C S R Prabhu, P A Reddi, “Bluetooth Technology and its applications with JAVA and J2ME”, PHI,2006
ONLINE REFERENCES
safari.informit.com
www.pearsoned.com
www.pearsoned.co.in
L T P C
CS0444 SOFTWARE RELIABILITY 3 0 0 3
Prerequisite
Nil
PURPOSE
This course gives a thorough knowledge of providing software reliability.
INSTRUCTIONAL OBJECTIVES
1. Software Reliability.
2. Reliability approaches
3. Reliability models
INTRODUCTION TO RELIABILITY ENGINEERING
Reliability — Repairable and Non Repairable systems — Maintainability and Availability — Designing for
higher reliability — Redundancy — MTBF — MTTF MDT - MTTR— k out of in systems
INTRODUCTION TO SOFTWARE RELIABLITY
Software reliability - Software reliability Vs Hardware reliability – Failures and Faults - Classification of
Failures – Counting – System Configuration – Components and Operational Models – Concurrent Systems –
Sequential Systems – Standby Redundant systems
SOFTWARE RELIABILITY APPROACHES
95 CS – 07-08-SRM – E&T
Fault Avoidance — Passive Fault detection — Active Fault Detection — Fault Tolerance - Fault Recovery -
Fault Treatment
SOFTWARE RELIABILITY MODELING
Introduction to Software Reliability Modeling – Parameter Determination and Estimation - Model Selection –
Markovian Models – Finite and Infinite failure category Models – Comparison of Models – Calendar Time
Modeling
SPECIAL TOPICS IN SOFTWARE RELIABLITY
Management Techniques for reliability - Organization and Staffing — Programming Languages and Reliability
— Computer Architecture and Reliability — Proving Program correctness & Reliability Design - Reliability
Testing – Reliability Economics.
TEXT BOOKS
1. John D. Musa, “ Software Reliability”, McGraHill, 1985
2. Glenford J. Myers, “Software Reliability “, Wiley Interscience Publication, 1976
REFERENCE BOOKS
1. Patric D. T.O connor, “Practical Reliability Engineering”, 4th Edition, John Wesley & sons, 2003.
2. Anderson and PA Lee : “Fault tolerance principles and Practice “, PHI ,1981.
3. Pradhan D K (Ed.): “ Fault tolerant computing – Theory and Techniques”, Vol1 and Vol 2 , Prentice
hall, 1986.
4. E.Balagurusamy ,” Reliability Engineering”, Tata McGrawHill, 1994
ONLINE RESOURCES
http://www.cs.colostate.edu/~cs630/software.html
http://www2.enel.ucalgary.ca/People/far/Lectures/SENG635/index.html
L T P C
CS0446 FIREWALL ARCHITECTURE 3 0 0 3
Prerequisite
Nil
PURPOSE
To study the firewall architecture and design concepts.
INSTRUCTIONAL OBJECTIVES:
1. Types of firewall architecture.
2. Design and implementation of firewall
3. Firewall maintenance.
NETWORK SECURITY
Internet firewalls- Internet services – security strategies – least privilege- Defense in depth - choke point –
weakest link – fail safe stance – universal-Participation – simplicity.
FIREWALL TECHNOLOGIES AND ARCHITECTURE
Firewall technologies – definitions – packet filtering – proxy services – network Address translation – virtual
private networks – firewall architectures – single Box – screened host – screened subnet - architecture with
multiple screened Subnets – variations on firewall architectures - terminal servers and modem pools – internal
firewalls.
FIREWALL DESIGN
Firewall design – packet filtering - configuring a packet filtering router – packet Filtering tips – rules – filtering
by address – by service – choosing a packet Filtering router – implementations – where to do packet filtering
and rules.
PROXY SYSTEMS AND BASTION HOSTS
Proxy systems – server terminology – SOCKS for proxying – TIS internal firewall toolkit for proxying –
bastion hosts – principles – special kinds of bastion hosts – choosing machine and location – locating bastion
hosts – selecting services - disabling user accounts – building a bastion host - securing disabling non required
services – operating bastion hosts – protecting the machine.
96 CS – 07-08-SRM – E&T
Case study - screened subnet architecture – merged routers and bastion host.
MAINTAINING FIREWALLS
Maintaining firewalls - housekeeping – monitoring your systems – keeping up to date – two sample firewalls –
screened subnet architecture - merged routers and bastion host using general purpose hardware.
TEXT BOOK
1. Elizabeth D.Zwicky, Simon Cooper and D. Brent Chapman “Building Internet Firewalls”, second
edition, Shroff publishers 2000
REFERENCE BOOK
1. John R. Vacca and Scott R. Ellis. “Firewalls jumpstart for network and systems administrators
“Elsevier publications 2006.
ONLINE REFERENCES
www.okcforum.org
www.microsoft.com
www.networkcomputing .com
L T P C
CS0448 OPTIMIZATION TECHNIQUES 3 0 0 3
Prerequisite
MA0102, MA0211
PURPOSE
To study design aspects of complex systems
INSTRUCTIONAL OBJECTIVES
1. To learn about Problem Formulation and set up
2. To learn the optimization and search methods
3. To learn multi objective and stochastic challenges
4. To study implementation issues and Real world applications
OPTIMIZATION MODELS
Mathematical Modeling – Design Optimization – Feasibility and boundedness – Topography of the design
space – Modeling data – Modeling considerations prior to computation
MODEL BOUNDEDNESS
Bounds, Extrema and optima – Constrained Optimum – Underconstrained Models – Recognizing Monotonicity
– Inequalities – Equality constraints – Nonmonotonic Functions
OPTIMA
The Weierstrass Theorem – Local approximation – Taylor Series – Optimality – nature of stationery points -
Convexity – Local Exploration – Gradient descent – Searching along a line – curvature at the Boundary –
Gradient Projection Method – KKT conditions – Lagrangian standard Forms – Basic Linear Programming
algorithm
PARAMETRIC AND DISCRETE OPTIMA
Branching – Parametric tests – Functional monotonicity analysis – Discrete design activity and optimality –
constraint derivation
COMPUTATIONS
Local and Global convergence – Quasi Newton Methods – Lagrange multipliers estimates – sequential quadratic
programming – Lagrange Newton equations – Convex linearization – preparing models for numerical
computation – scaling – Interpreting numerical results – selecting algorithms and software
TEXT BOOKS
1. Papalambros, Panos Y., and Douglass J. Wilde,”Principles of Optimal Design – Modeling and
Computation”. 2nd ed. Cambridge, UK: Cambridge University Press, 2000.
97 CS – 07-08-SRM – E&T
2. Ravindran A, Ragsdell K M and Reklaitis,” Engineering Optimization – Methods and Applications”,
Wiley India, 2006.
3. Steuer, R. E.” Multiple Criteria Optimization: Theory, Computation and Application”. New York: Wiley,
1986.
REFERENCE BOOKS
1. Goldberg, David E, “Genetic Algorithms – in Search, Optimization & Machine Learning”. Reading,
MA: Addison-Wesley, 1989.
2. Alexandrov, N. M., and M. Y. Hussaini, eds. “Multidisciplinary Design Optimization: State of the Art”.
Proceedings in Applied Mathematics Series, No. 80. Soc for Industrial & Applied Math, 1997.
3. Fogel, Owens, and Walsh. “Artificial Intelligence Through Simulated Evolution”. New York: John Wiley
& Sons, 1966.
4. Statnikov, Roman B., and Joseph B. Matusov. Multicriteria Optimization and Engineering. New York:
Chapman and Hall, 1995.
ONLINE REFERENCES
http://www.mat.univie.ac.at/~neum/glopt/techniques.html
http://www.mit.jyu.fi/miettine/lista.html
http://www.ing.unlp.edu.ar/cetad/mos/geometric.html
http://www.stanford.edu/~boyd/cvxbook/