S.R.M. UNIVERSITY SCHOOL OF COMPUTER SCIENCE & ENGINEERING Curriculum for B.

Tech (CSE) 2007 -2008 I SEMESTER Subject Code Category Theory LE0101 G MA0101 B PH0101 B CY0101 B GE0101 E Practical PD0101 G GE0107 G GE0105 B PH0103 B CY0103 B ME0120 / E ME0130 Total

Subject Name English Mathematics I Physics Chemistry Basic Engineering I Personality Development -I NSS,NCC,NSO Computer Literacy Physics Laboratory Chemistry Lab Workshop Practice / Engineering Graphics

L 1 3 3 3 4 0 0 0 0 0 0/1 14/ 15

T 0 2 0 0 0 0 0 0 0 0 0 2

P 2 0 0 0 0 2 2 2 2 2 4 16

C 2 4 3 3 4 0 1 1 1 1 2/3 22/ 23

II SEMESTER Subject Category Code Theory GE0108 G GE0102 B GE0104 B MA0102 B PH0102 B GE0106 E CS0102 P Practical PD0102 G CS0112 B ME0130 / E ME0120 Total

Subject Name Value Education Biology for Engineers Principles of Environmental Science Mathematics II Material Science Basic Engineering- II Digital Computer Fundamentals Personality Development - II Programming in C Engineering Graphics/ Workshop Practice

L 1 2 2 3 2 4 3 0 2 1/0 20/ 19

T 0 0 0 2 0 0 0 0 0 0 2

P 0 0 0 0 2 0 2 2 2 0/4 8/ 12

C 1 2 2 4 3 4 4 0 3 3/2 26/ 25

III SEMESTER Subject Category Code Theory G LE0201/ LE0203 / LE0205 MA 0211 B CS0201 P CS0203 P CS0205 P CS0207 P Practical PD0201 G CS0211 P CS0213 P Total

Subject Name German Language Phase I / Japanese Language Phase I / French Language Phase I Mathematics III Data Structures using C++ Design & Analysis of Algorithms Microprocessor & Interfacing Computer Organization & Architecture Personality Development - III Microprocessor Lab Data Structures & Algorithms Lab (C & C++)

L 2 3 3 3 3 3 0 0 0 17

T 0 1 0 0 0 0 0 0 0 1

P 0 0 0 0 0 0 2 3 3 8

C 2 4 3 3 3 3 1 2 2 23

IV SEMESTER Subject Category Code Theory LE0202 / G LE0204 / LE0206 MA0212 E CS0202 P CS0204 P CS0206 P CS0210 P Practical PD0202 G CS0212 P CS0214 P CS0216 P Total V SEMESTER Subject Category Code Theory CS0305 E EC0211 E CS0301 P CS0303 P P Practical PD0301 G CS0311 P CS0313 P CS0315 P Total

Subject Name German Language Phase II / Japanese Language Phase II / French Language Phase II Probability & Queuing Theory Principles of Programming Languages Theory of Computation Operating Systems Comprehension - I Personality Development - IV Operating Systems Lab JAVA Programming Computer Skills

L 2 3 3 3 3 0 0 0 2 1 17

T 0 0 0 0 0 2 0 0 0 0 2

P 0 0 0 0 0 0 2 3 2 2 9

C 2 3 3 3 3 1 1 2 3 2 23

Subject Name Operations Research Techniques Principles of Communication Compiler Design Computer Networks Elective I Personality Development - V Compiler Design Lab Networking Lab Industrial Training - I

L 3 3 3 3 3 1 0 0 0 16

T 0 0 0 0 0 0 0 0 0 0

P 0 0 0 0 0 2 3 3 2 10

C 3 3 3 3 3 2 2 2 1 22

VI SEMESTER Subject Category Code Theory CS0302 P CS0304 P CS0306 P CS0308 P P CS0310 P Practical PD0302 G CS0312 P CS0314 P Total

Subject Name Artificial Intelligence & Expert Systems Data Base Management Systems Object Oriented Analysis & Design Logic for Computer Science Elective II Comprehension - II Personality Development - VI Artificial Intelligence & Expert Systems Lab Data Base Management Systems Lab

L 3 3 3 3 3/1 0 1 0 0 16/ 14

T 0 0 0 0 0 2 0 0 0 2

P 0 0 0 0 0/3 0 2 3 3 8/11

C 3 3 3 3 3 1 2 2 2 22

VII SEMESTER Subject Category Code Theory MB0403 G CS0401 P CS0403 P CS0405 P P P Practical CS0411 P CS0413 P CS0316 P Total VIII SEMESTER Subject Category Code Theory CS0402 P P P Practical CS0414 P Total

Subject Name Industrial Management & Economics Software Engineering Parallel & Distributed Computing VLSI Design & Embedded Systems Elective III Elective IV Software Engineering Lab VLSI & Embedded System Design Lab Industrial Training - II

L 3 3 3 3 3 3 0 0 0 18

T 0 0 0 0 0 0 0 0 0 0

P 0 0 0 0 0 0 2 3 2 7

C 3 3 3 3 3 3 1 2 1 22

Subject Name Scripting Languages & Web Technology Elective V Elective VI Project

L 3 3 3 0 9

T 0 0 0 0 0

P 0 0 0 16 16

C 3 3 3 8 17

TOTAL CREDITS TO BE EARNED : 177 Summary Table

Semester Total G B E P

I 22/23 3 13 6/7 0

II 26/25 1 14 7/6 4

III 23 3 4 0 16

IV 23 3 0 3 17

V 22 2 0 6 14

VI 22 2 0 0 20

VII 22 3 0 0 19

VIII 17 0 0 0 17

Total 177 17 31 22 107

% 100 9.6 17.5 12.4 60.5

Electives for Fifth Semester Subject Code Subject Name CS0321 System Modeling and Simulation CS0323 Digital Image Processing CS0325 Visual Programming CS0327 Soft Computing CS0329 Advanced Operating System CS0331 E-Commerce CS0333 TCP/IP Principles & Architecture

L 3 3 3 3 3 3 3

T 0 0 0 0 0 0 0

P 0 0 0 0 0 0 0

C 3 3 3 3 3 3 3

Electives for Sixth Semester Subject Code Subject Name CS0322 Advanced Networks CS0324 Virtual Reality CS0326 Advanced Databases CS0328 Neural Networks CS0330 Quantum Information Processing Electives for Seventh Semester Subject Code Subject Name CS0421 Genetic Algorithms CS0423 Speech Technology CS0425 Mobile Computing CS0427 Network Security CS0429 Fault Tolerant Computing CS0431 WINDOWS Internals CS0433 LINUX Internals CS0435 Computer Vision CS0437 Advanced Java Programming CS0439 Component Based Technology CS0441 Information Storage and Management

L 3 3 3 3 3

T 0 0 0 0 0

P 0 0 0 0 0

C 3 3 3 3 3

L 3 3 3 3 3 3 3 3 3 3 3

T 0 0 0 0 0 0 0 0 0 0 0

P 0 0 0 0 0 0 0 0 0 0 0

C 3 3 3 3 3 3 3 3 3 3 3

Electives for Eighth Semester Subject Code Subject Name CS0422 ATM Networks CS0424 Data Mining CS0426 Grid Computing CS0428 Agent Based Systems CS0430 Human Computer Interaction CS0432 Real Time System Design CS0434 Pattern Recognition CS0436 Robotics CS0438 Decision Support System CS0440 Bioinformatics CS0442 Bluetooth Technology CS0444 Software Reliability CS0446 Firewall Architecture CS0448 Optimization Techniques

L 3 3 3 3 3 3 3 3 3 3 3 3 3 3

T 0 0 0 0 0 0 0 0 0 0 0 0 0 0

P 0 0 0 0 0 0 0 0 0 0 0 0 0 0

C 3 3 3 3 3 3 3 3 3 3 3 3 3 3

SEMESTER I L 1 T 0 P 2 C 2

LE 0101

ENGLISH
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. UNIT 1 LISTENING Listening Practice Hints on Listening Listening Practice Note Taking: Note Taking Strategies UNIT 2 SPEAKING 3 Definitions: Expressing Opinions (agreement / disagreement )-Offering Suggestions Technical Definitions Describing Objects speaking practice. Phonetics: Pronunciation-Phonetic Transcription-Stress-Intonation UNIT 3 READING 3 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. UNIT 4 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 UNIT 5 FOCUS ON AND COMMUNICATION AND COMPUNICATION 3 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. PRACTICAL TOTAL 30 45 3 3

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.

MA 0101

MATHEMATICS -I Prerequisite Nil

L 3

T 2

P 0

C 4

PURPOSE To impart analytical ability in solving mathematical problems as Engineering.

applied to the respective branches of

INSTRUCTIONAL OBJECTIVES At the end of the course, student should be able, To apply advanced matrix knowledge to Engineering problems. To improve their ability in solving geometrical applications of differential calculus problems to equip themselves familiar with the functions of several variables. To familiarize with the applications of differential equations. To expose to the concept of three dimensional analytical geometry. UNIT 1 MATRICES 9 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. UNIT 2 GEOMETRICAL APPLICATIONS OF DIFFERENTIAL CALCULUS Curvature Cartesian and polar coordinates Circle of curvature Involutes and Evolutes Envelopes Properties of envelopes. 9

UNIT 3 FUNCTIONS OF SEVERAL VARIABLES 9 Function of two variables Partial derivatives Total differential Taylors expansion Maxima and Minima Constrained Maxima and Minima by Lagrangean Multiplier method Jacobians UNIT 4 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. 9

UNIT 5 THREE DIMENSIONAL ANALYTICAL GEOMETRY 9 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. TUTORIAL TOTAL 30 75

TEXT BOOK Grewal B.S, Higher Engg Maths, Khanna Publications, 38th Edition., Veerajan, T., Engineering Mathematics, Tata McGraw Hill Publishing Co., New Delhi,2000. 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. 4.

Narayanan S., Manicavachagom Pillay T.K., Ramanaiah G., Advanced Mathematics for Engineering students, Volume I (2nd edition), S.Viswanathan Printers and Publishers, 1992. Venkataraman M.K., Engineering Mathematics First Year (2nd edition), National Publishing Co., Chennai,2000.

PH 0101

PHYSICS Prerequisite Nil

L 3

T 0

P 0

C 3

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. UNIT 1 PROPERTIES OF MATTER AND SOUND 9 Properties of Matter: Hookes 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. UNIT 2 ELECTROMAGNETISM AND MICROWAVES 9 Electromagnetism: Divergence, curl and gradient Maxwells 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. UNIT 3 OPTICS 9 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. UNIT 4 CRYSTAL PHYSICS AND CRYOGENICS 9 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, Lindes process, and adiabatic demagnetization process) Measurement of cryogenic temperatures. UNIT 5 ENERGY PHYSICS 9 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. TOTAL 45 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 Physics, 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 Resources, Mechanical Engineering Series, Tata McGraw Hill Publishing Company Ltd., New Delhi, 2006.

CY 0101

CHEMISTRY Prerequisite Nil

L 3

T 0

P 0

C 3

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. UNIT 1 TECHNOLOGY OF WATER 9 Water quality parameters: Physical, Chemical & Biological - Hardness of water estimation of hardness (EDTA method & O. Hehners 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. UNIT 2 CORROSION AND ITS CONTROL 9 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. UNIT 3 PHASEEQUILIBRIA 9 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. UNIT 4 POLYMERS AND REINFORCED PLASTICS 9 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 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.

UNIT 5 INSTRUMENTAL METHODS OF ANALYSIS 9 Basic principles, instrumentation of potentiometry, flame photometry applications. Elementary theory principle instrumentation of UV visible spectroscopy and atomic absorption spectroscopy and infrared spectroscopy. TOTAL 45 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 Chemistry, 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

GE 0101

BASIC ENGINEERING - I
Prerequisite Nil

L 4

T 0

P 0

C 4

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. UNIT 1 BUILDING MATERIALS AND THEIR PROPERTIES 10 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. UNIT 2 BUILDINGS AND THEIR COMPONENTS 10 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. UNIT 3 UTILITY AND SERVICES 10 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 bridge - types of bridges.Water supply - Sources - Standards of drinking water (BIS) elementary treatment methods RO System Sewage disposal Septic tank function and components. TOTAL 30

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 UNIT 1 MACHINE ELEMENTS 10 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. UNIT 2 ENERGY 10 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. UNIT 3 MANUFACTURING PROCESSES 10 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. TOTAL 30 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

10

PD 0101

PERSONALITY DEVELOPMENT - I Prerequisite Nil

L 0

T 0

P 2

C 0

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 UNIT 1 Self-analysis SWOT - Time management - Creative chain story telling UNIT 2 Vocabulary games I Attitude - Interpersonal skills UNIT 3 Motivation I - Vocabulary games II - Article review UNIT 4 Team building exercise - Critical Thinking - Event Management UNIT 5 Business situation - Leadership Qualities - Review 6

TOTAL SCHEME OF INSTRUCTION Marks allocated for regular participation in all oral activities in class SCHEME OF EXAMINATION Complete Internal evaluation on a regular Basis

30

11

GE0107

NSS/NCC/NSO/YOGA
Prerequisite Nil

L 0

T 0

P 2

C 1

I.

YOGA SYLLABUS PRACTICE I II Meditation Agnai, Asanas, Kiriyas, Bandas, Muthras Meditation Santhi Physical Exercises (I & II) Kayakalpa Yoga Asanas, Kiriyas, Bandas, Muthras Meditation Santhi Physical Exercises III & IV Meditation Thuriyam Kayakalpa Asanas, Kiriyas, Bandas, Muthras Meditation Thuriyam Kayakalpa Asanas, Kiriyas, Bandas, Muthras Meditation Thuriyam Kayakalpa Asanas, Kiriyas, Bandas, Muthras Meditation Santhi Kayakalpa Asanas, Kiriyas, Bandas, Muthras LECTURE Benefits of Agnai Meditation Benefits of santhi Meditation Lecture & Practice Analysis of Thought Benefits of Thuriyam Attitude Importance of Arutkappy & Blessings Benefits of Blessings Hours = 30

III IV V VI VII VIII

TEXT BOOKS: 1. 2. Vedatri Maharshi , Yoga for Modern Age 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. 2. 3. 4. 5. 6. Basket Ball Football Volley Ball Ball Badminton Cricket 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.

12

L GE0105 COMPUTER LITERACY Prerequisite Nil 0

T 0

P 2

C 1

PURPOSE This Lab Course will enable the students to understand the basics of computer and to know the basics of MS-Office. 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. 2. 3. 4. 5. 6. 7. 8.

30

Study experiment on evolution of computer programming languages. Suggest some of the Network Topologies that can be incorporated in your campus. Justify your choice. Experiments to demonstrate directory creation and file creation. Create a document with all formatting effects. Create a document with tables. Create labels in MS word. Create a document to send mails using mail merge option. Create an Excel File to analyze the students 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. * 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. TOTAL 30 TEXT BOOK 1. Introduction to Information Technology ITL Education Solutions Ltd., Pearson 2nd Edition, 2006.

PH 0103

PHYSICS LABORATORY Prerequisite Nil

L 0

T 0

P 2

C 1

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.

13

LIST OF EXPERIMENTS 30 1. Determination of Youngs 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 TOTAL 30 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 0 T 0 P 2 C 1

CY 0103

CHEMISTRY LAB 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. 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 Winklers 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. TOTAL REFERENCE 1. Chemistry department manual, Edition, 2003. 30

30

ME 0120

WORKSHOP PRACTICE
Prerequisite Nil

L 0

T 0

P 4

C 2

PURPOSE To provide the students with hands on experience on different trades of engineering like fitting, carpentary, smithy, welding and sheet metal.

14

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. UNIT 1 FITTING Tools & Equipments Practice in Filing and Drilling. Making Vee Joints, Square, dovetail joints, Key Making. 12

UNIT 2 CARPENTARY 12 Tools and Equipments- Planning practice. Making Half Lap, dovetail, Mortise & Tenon joints, a mini model of a single door window frame. UNIT 3 SHEET METAL Tools and equipments - Fabrication of a small cabinet, Rectangular Hopper, etc. 12

UNIT 4 WELDING 12 Tools and equipments - Arc welding of butt joint, Lap Joint, Tee Fillet. Demonstration of Gas welding, TIG & MIG. UNIT 5. SMITHY Tools and Equipments Making simple parts like hexagonal headed bolt, chisel. TOTAL 12

60

TEXT BOOKS 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.

ME 0130

ENGINEERING GRAPHICS
Prerequisite Nil (Only First Angle Projection is to be followed)

L 1

T 0

P 4

C 3

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

15

UNIT 1 FUNDAMENTALS OF ENGINEERING GRAPHICS 2 Lettering, two dimensional geometrical constructions, conics, representation of three-dimensional objects principles of projections standard codes projection of points. UNIT 2 PROJECTION OF LINES AND SOLIDS Projection of straight lines, projection of solids auxiliary projections UNIT 3 SECTIONS AND DEVELOPMENTS Sections of solids and development of surfaces. 4

UNIT 4 PICTORIAL PROJECTIONS 4 Conversion of projections: Orthographic projection, isometric projection of regular solids & combination of solids. UNIT 5 BUILDING DRAWING 2 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). PRACTICAL 60 TOTAL 75 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.

16

SEMESTER II GE 0108 VALUE EDUCATION Prerequisite Nil L 1 T 0 P 0 C 1

PURPOSE 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.

UNIT 1 3 Value EducationIntroduction 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 UNIT 2 3 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. UNIT 3 3 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. UNIT 4 3 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. UNIT 5 3 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. TOTAL 15 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., Chennai4.,(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

17

GE 0102

BIOLOGY FOR ENGINEERS Prerequisite Nil

L 2

T 0

P 0

C 2

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 functions that is ultimately responsible for arious daily activities. Nervous and immune systems will be taught as examples of this signaling machinery. UNIT 1 FROM ATOMS TO ORGANISMS 6 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 UNIT 2 THE MOLECULAR DESIGN OF LIFE 6 Biochemistry and the Genomic Revolution- . DNA Illustrates the Relation between Form and FunctionBiochemical 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 UNIT 3 CATALYTIC STRATEGIES 6 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. UNIT 4 MECHANOCHEMISTRY 6 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 MotorsMeasures 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? UNIT 5 SENSORY AND IMMUNO SYSTEMS 6 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 TOTAL 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 30

18

GE 0104

PRINCIPLES OF ENVIRONMENTAL SCIENCE Prerequisite Nil

L 2

T 0

P 0

C 2

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. 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 UNIT 1 ENIVRONMENT AND ECOSYSTEMS 6 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 UNIT 2 BIODIVERSITY 6 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. UNIT 3 POLLUTION AND WASTE MANAGEMENT 6 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. UNIT 4 CURRENT ENVIRONMENTAL ISSUES 6 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. UNIT 5 ENVIRONMENTAL PROTECTION 6 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. TOTAL 30 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.

19

MA 0102

L MATHEMATICS - II 3 Prerequisite Nil (Common to all Branches of Engineering except BT, BP, BI, BMI, FPE, & GE)

T 2

P 0

C 4

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. UNIT 1 MULTIPLE INTEGRALS Double integration in Cartesian and polar coordinates Change of order of integration Area as a double integral Triple integration in Cartesian coordinates. 9

UNIT 2 LAPLACE TRANSFORMS 9 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. UNIT 3VECTOR CALCULUS 9 Gradient, divergence, curl Solenoidal and irrotational fields Vector identities (without proof) Directional derivatives Line, surface and volume integrals Statements of Greens, Gauss divergence and Strokes theorems only Verification and applications to cubes and parallelopipeds only. UNIT 4 ANALYTIC FUNCTIONS 9 Definition of Analytic Function Cauchy Riemann equations Properties of analytic functions - Determination of harmonic conjugate Milne-Thomsons method Conformal mappings: 1/z, az az+b and bilinear transformation. UNIT 5 COMPLEX INTEGRATION 9 Line integral Cauchys integral theorem (without proof ) Cauchys integral formulae (with proof) application of Cauchys integral formulae Taylors and Laurents expansions (statements only) Singularities Poles and Residues Cauchys residue theorem (with proof) - Evaluation of line integrals. TUTORIAL TOTAL 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. 2. 3. 4. Kreyszig.E, Advanced Engineering Mathematics, 8th edition, John Wiley & Sons. Singapore,2001. Kandasamy P etal. Engineering Mathematics, Vol.I (4th revised edition), S.Chand &Co., New Delhi,2000. Narayanan S., Manicavachagom Pillay T.K., Ramanaiah G., Advanced Mathematics for Engineering students, Volume I (2nd edition), S.Viswanathan Printers and Publishers, 1992. Venkataraman M.K., Engineering Mathematics First Year (2nd edition), National Publishing Co., Chennai,2000. 30 75

20

PH 0102

MATERIALS SCIENCE Prerequisite Nil

L 2

T 0

P 2

C 3

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. UNIT 1 ELECTRONIC AND PHOTONIC MATERIALS 6 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. UNIT 2 MAGNETIC, DIELECTRIC AND MODERN ENGINEERING MATERIALS 6 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. UNIT 3 BIO MATERIALS 6 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. UNIT 4 NANO MATERIALS AND NANOTECHNOLOGY 6 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 . UNIT 5 MECHANICAL PROPERTIES OF MATERIALS 6 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 Quinckes method. 8. Determination of thermal conductivity Lees Disc method 9. Visit to Nano Technology Laboratory (optional) TOTAL 30

60

21

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.

GE 0106

BASIC ENGINEERING II Prerequisite Nil

L 4

T 0

P 0

C 4

PART A ELECTRICAL ENGINEERING 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. UNIT 1 ELECTRICAL MACHINES 12 Definition of mmf, flux and reluctance, leakage flux, fringing, magnetic materials and B-H relationship. Problems involving simple magnetic circuits.Faradays 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). UNIT 2 AC & DC CIRCUITS 10 Circuit parameters, Ohms law, Kirchhoffs 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) UNIT 3 WIRING & LIGHTING 8 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. TOTAL 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 30

22

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 PURPOSE: This course provides comprehensive idea about circuit analysis, working principles of machines and common measuring instruments. It also provides all fundamentals of circuit components, electronic devices, transducers and integrated circuits. OBJECTIVES 1. To understand the basic concept of magnetic, AC and DC circuits. 2. To explain the working principle, construction and applications of DC and AC machines. 3. To gain knowledge about the fundamentals of electric components, devices, transducers, measuring instruments and integrated circuits. UNIT 1 ELECTRONIC COMPONENTS AND DEVICES 10 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. UNIT 2 TRANSDUCERS AND MEASURING INSTRUMENTS 10 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. UNIT 3 DIGITAL ELECTRONICS & LINEAR ICs 10 Digital Fundamentals: Number systems Boolean Theorems DeMorgans Theorem - Logic gates Implementation of Boolean Expression using Gates. Integrated Circuits: IC fabrication Monolithic Technique, Function of Operational Amplifier. TOTAL 30 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.

23

CS0102

DIGITAL COMPUTER FUNDAMENTALS Prerequisite NIL

L 3

T 0

P 2

C 4

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 UNIT 1 NUMBER SYSTEMS & BOOLEAN ALGEBRA 10 Digital Computers and digital systems-Review of binary number systems-Number conversion-ComplementsBinary Arithmetic-Binary codes-Boolean Algebra and Theorems-Canonical and standard forms-Simplification of Boolean functions using Karnaugh map & tabulation methods UNIT 2 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-ReadOnly Memory(ROM)-Programmable Logic Array(PLA)-Programmable Array Logic(PAL) UNIT 3 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 UNIT 4 ASYNCHRONOUS SEQUENTIAL LOGIC Analysis and design procedure-Reduction of state and flow tables-Race and Free State assignment-Hazards UNIT 5 HARDWARE DESCRIPTION LOGIC Introduction to Hardware Description Language (HDL)-HDL for combinational circuits PRACTICAL 1. Verification of Gates & Flip Flops 2. Adders 3. Multiplexers & Demultiplexers 4. Counters 5. Shift registers 6. Encoders & Decoders PRACTICAL 30 TOTAL 75 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, 3. 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 9

24

PD 0102

PERSONALITY DEVELOPMENT - II Prerequisite Nil

L 0

T 0

P 2

C 0

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

UNIT 1 Puzzles I - Poster design/Caption/Slogan writing (Social issues) - Bone of contention I debate UNIT 2 Bone of contention II - Puzzle II - Survey and Reporting (favorite channel, music, food) UNIT 3 Interpretation of Visuals of I & II - Vocabulary games III UNIT 4 Book Review - Quiz I - Presentation Skills I UNIT 5 Presentation Skills II - Analytical Thinking - Review TOTAL

30

EVALUATION 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

25

CS0112

PROGRAMMING IN C Prerequisite NIL

L 2

T 0

P 2

C 3

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: 30 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. 30

TOTAL 60 TEXT BOOK Ashok N. Kamthane., Programming with ANSI and Turbo C.Pearson Education, 2007. REFERENCE BOOKS 1. 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

ME 0130

ENGINEERING GRAPHICS Prerequisite Nil (Only First Angle Projection is to be followed)

L 1

T 0

P 4

C 3

PURPOSE 1. To draw and interpret various projections of 1D, 2D and 3D objects. 2. To prepare and interpret the drawings of buildings.

26

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 UNIT 1 FUNDAMENTALS OF ENGINEERING GRAPHICS 2 Lettering, two dimensional geometrical constructions, conics, representation of three-dimensional objects principles of projections standard codes projection of points. UNIT 2 PROJECTION OF LINES AND SOLIDS Projection of straight lines, projection of solids auxiliary projections UNIT 3 SECTIONS AND DEVELOPMENTS Sections of solids and development of surfaces. 4

UNIT 4 PICTORIAL PROJECTIONS 4 Conversion of projections: Orthographic projection, isometric projection of regular solids & combination of solids. UNIT 5 BUILDING DRAWING 2 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). PRACTICAL 60 TOTAL 75 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 0 T 0 P 4 C 2

ME 0120

WORKSHOP PRACTICE 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.

27

LIST OF EXPERIMENTS EMPHASIS TO BE LAID ON REAL LIFE APPLICATIONS WHEN FRAMING THE EXERCISES. UNIT 1 FITTING 12 Tools & Equipments Practice in Filing and Drilling. Making Vee Joints, Square, dovetail joints, Key making. UNIT 2 CARPENTRY 12 Tools and Equipments- Planning practice. Making Half Lap, dovetail, Mortise & Tenon joints, a mini model of a single door window frame. UNIT 3 SHEET METAL Tools and equipments - Fabrication of a small cabinet, Rectangular Hopper, etc. 12

UNIT 4 WELDING 12 Tools and equipments - Arc welding of butt joint, Lap Joint, Tee Fillet. Demonstration of Gas welding, TIG & MIG. UNIT 5 SMITHY Tools and Equipments Making simple parts like hexagonal headed bolt, chisel. 12

TOTAL 60 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.

28

SEMESTER III

LE0201

GERMAN LANGUAGE PHASE I Prerequisite Nil

L 2

T 0

P 0

C 2

PURPOSE Enabling the Engineering Students to one more Foreign Language, especially German, which is scientific and technical language. This may be useful in the field of employment opportunities as well as helping them to develop projects on browsing German websites. INSTRUCTIONAL OBJECTIVES Developing pronunciation so that they can read the text and e-mail during their employment, instructing them to write their own C V and developing a fundamental conversation with any German national. UNIT 1 INTRODUCTION German Language, Alphabets and Pronunciation. 10

THEMEN Name, Land, Leute, Beruf, Familie geschwister, Einkaufen, Reisen, Zahlen, Haus, Freunden, Essen and Stadium, Fest, Zeit. UNIT 2 LISTENING 10 Listening to the cassette and pay special attention to the meaning and sounds. Listening Comprehension Announcements / Airport / Station / General. UNIT 3 READING Listening to the cassette and reading it allowed. READING COMPRENSION BASICS / STATION / NEWS / NOTICE BOARDS. TOTAL GLOSSARY Technical Words Lesson (1-5) TEXT BOOK WITH CASSETTES 1. 2. Grundkurs Deutsch Momentmal (Max Mueller Bhavan Goethe Institute, Germany). 10

30

SCHEME OF EVALUATION Internal 50 = Listening 10 Marks, Speaking 20 Marks, Reading 10 Marks and Writing = 10 Marks

LE0203

JAPANESE LANGUAGE PHASE I Prerequisite Nil

L 2

T 0

P 0

C 2

PURPOSE In view of globalization, learning Foreign Language by Engineering graduates enhances their employment opportunities. Get awareness of understanding of International culture. Widening the Linguistic Skills of the Students.

29

INSTRUCTIONAL OBJECTIVES To learn the scripts of Japanese Languages namely Hiragana, Katakana and Kanji, Vocabularies etc. To learn basic grammar and acquire basic communication skills. To understand Japanese culture. UNIT 1 Alphabets (Hiragana ), Self Introduction, Greetings, Classroom expressions, Numbers, Conversation. UNIT 2 Alphabets Hiragana (continued),Vocabularies. Counters .Time expression. Conversation UNIT 3 Katakana and related vocabulary. Kanjis introduction. conversation. UNIT 4 Lesson-1 Watashiwa Nihonjin desu. Grammar,Marume &Sentence pattern.Marume. Conversation. TOTAL 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. SCHEME OF EVALUATION Internal 50 = Listening 10 Marks, Speaking 20 Marks, Reading 10 Marks and Writing = 10 Marks 8

30

LE0205

FRENCH LANGUAGE PHASE I Prerequisite Nil

L 2

T 0

P 0

C 2

PURPOSE 1. As language skills are as valuable as technical skills a knowledge of French enables the engineering graduates in career orientation. 2. As a second international global Lang after English there is a wider choice of job opportunities in the inter national employment market and also multinationals in India and an understanding of French culture thro language. INSTRUCTIONAL OBJECTIVE Characterised by the Roman script, grammar, vocabulary and colloquial expressions are taught which enables them to communicate effectively with any native speaker. UNIT 1 INTRODUCTION AND PRONUNCIATION 8 Introduction of the French Language, Alphabets and Pronunciation, Greetings (Wishing, Thanking and Bidding good bye), Introducing oneself & someone Presenter quelquun et se presenter - conversational French sentences based on the topics discussed above. UNIT 2 VOCABULARY 6 Numbers and Dates, Days, Months and Seasons, Time, Nouns, Professions and Nationalities. C;onversational sentences on weather, time, and professions. UNIT 3 GRAMMAR Basic Verbs (Avoir, Etre, Aller, Faire) Conjugation Present tense, Affirmative, Negative, Interrogative, Adjectives (Qualitative), Subject Pronouns and Disjunctive Pronouns. 5

30

UNIT 4 CONVERSATION AND LISTENING Conversational sentences on physical description and expressions with verbs like avoir, etre and faire UNIT 5 GRAMMAR Prepositions ( a, de,dans, en, sur,sous, pour.),Contracted Articles, Question Tag (Qui, Quel, Ou, etc) TOTAL Text book: 1. Panorama Goyal Publishers 2. Apprenons le Francais I, Sarawathy publication. SCHEME OF EVALUATION Internal 50 = Listening 10 Marks, Speaking 20 Marks, Reading 10 Marks and Writing = 10 Marks

30

MA0211

MATHEMATICS III Prerequisite MA0101, MA0102 (Common for EEE, ECE, IT, CSE, ICE & EIE)

L 3

T 1

P 0

C 4

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. UNIT 1 FOURIER SERIES 9 Dirichlets conditions General Fourier series Half range Sine and Cosine series Parsevals identity Harmonic Analysis. UNIT 2 PARTIAL DIFFERENTIAL EQUATIONS 9 Formation Solution of standard types of first order equations Lagranges equation Linear homogeneous partial differential equations of second and higher order with constant coefficients - Classification of second order linear partial differential equations. UNIT 3 ONE DIMENSIONAL WAVE & HEAT EQUATION 9 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. UNIT 4 TWO DIMENSIONAL HEAT EQUATION 9 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. UNIT 5 FOURIER TRANSFORMS 9 Statement of Fourier integral theorem Fourier transform pairs Fourier Sine and Cosine transforms Properties Transforms of simple functions Convolution theorem Parsevals identity. TUTORIAL 15 TOTAL 60

31

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. 4. Venkataraman M.K., Engineering Mathematics Vol.III A & B (13th edition), National Publishing Co., Chennai, 1998.

CS0201

DATA STRUCTURES USING C++ Prerequisite NIL

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 8 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 conceptsHashing methods UNIT 2 LINKED LISTS 9 Linear and Linked List concepts-Linked List Algorithms-Processing a Linked List-List Applications-Complex Linked List Structures-Implementation-Case studies UNIT 3 STACKS AND QUEUES 9 STACKS: Basic Operations- Linked List Implementation- Applications-Stack ADT-Array ImplementationQUEUES: Operations-Linked List design-Implementation-Case study-Overflow and underflow of stack size UNIT 4 TREES AND GRAPHS 10 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 UNIT 5 SORTING CONCEPTS 9 General Sort concepts-Insertion Sorts-Shell Sort-Selection Sorts-Heap Sort-Exchange Sorts-Bubble sort-Quick Sort-Case studies Total :45 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.

32

2. 3. 4. 5. 6.

YEDIDYAH LANGSAN, MOSHE J. AUGENSTEIN AND AORON M. TANENBAUM Data Structures using C and C++, Prentice-Hall of India Pvt Ltd, 2004. SARTAJ SAHNI Data Structures, Algorithms and Applications in C++, McGraw-Hill International Edition, 2000. MARK ALLEN WEISS, Data Structures and Algorithm Analysis in C++ Addison-Wesley Publishing Company, 1994. AHO, HOPCROFT, ULLMAN Data Structures and algorithms Pearson Education 1983. 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

CS0203

DESIGN AND ANALYSIS OF ALGORITHMS Prerequisite MA 0102 & MA0211

L 3

T 0

P 0

C 3

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 UNIT 1 ANALYSIS OF ALGORITHM 9 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. UNIT 2 DIVIDE AND CONQUER METHOD 9 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. UNIT 3 DYNAMIC PROGRAMMING 9 General MethodMultistage 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. UNIT 4 BACKTRACKING 9 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 UNIT 5 P and NP 9 Polynomial time Nondeterministic Algorithms and NP Reducibility and NP completeness NO complete Problems More on NP completeness. Case studies TOTAL 45 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)

33

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 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 CS0205 MICROPROCESSOR AND INTERFACING Prerequisite NIL Same as IT0202 3

T 0

P 0

C 3

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

UNIT 1 INTEL 8085 ARCHITECTURE 6 Introduction to 8085 - 8085 architecture- Instruction Set & Assembler Directives- Assembly Language Programming with 8085. UNIT 2 INTEL 8086/8088 ARCHITECTURE 9 Introduction to 8086/8088 - 8086/8088 architecture- Instruction Set & Assembler Directives- Assembly Language Programming with 8086/8088- Special Architectural Features. UNIT 3 COMMUNICATION INTERFACES 9 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 ConvertersStepper Motor Interfacing UNIT 4 PERIPHERAL INTERFACES 12 Special Purpose Programmable Peripheral Devices & their Interfacing-Programmable Interval Timer 8253Programmable Interrupt Controller 8259A-DMA Controller 8257-DMA Transfers & Operations-Programmable DMA Interface 8237. UNIT 5 MULTIPROCESSOR SYSTEMS 9 Interconnection Topologies- Software Aspects of Multiprocessor Systems- Numeric Processor 8087- Bus Arbitration & Control- Tightly Coupled & Loosely Coupled Systems. TOTAL 45 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.

34

ONLINE REFERENCES 1. www.emu8086.com 2. www.cpu-world.com 3. www.hobbyprojects.com 4. www.8052.com

L CS0207 COMPUTER ORGANIZATION AND ARCHITECTURE Prerequisite CS0102 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 Evolution of Computer Systems-Computer Types-Functional units-Basic operational concepts-Bus structuresMemory location and addresses-memory operations- Addressing modes-Design of a computer systemInstruction and instruction sequencing, RISC versus CISC. UNIT 2 CENTRAL PROCESSING UNIT 9 Introduction-Arithmetic Logic Unit - Fixed point arithmetic, floating point arithmetic-Execution of a complete instruction-Basic concepts of pipelining. UNIT 3 CONTROL UNIT DESIGN 9 Introduction-Control Transfer-Fetch cycle - Instruction Interpretation & Execution - Hardwired control Microprogrammed control. UNIT 4 MEMORIES AND SUBSYSTEMS 9 Semiconductor memory - Static and Dynamic -Associative memory- Cache memory- Virtual memorySecondary memories-Optical magnetic tape & magnetic disks & controllers. UNIT 5 I/O PROCESSING 9 Introduction-Data transfer techniques- Bus Interface- I/O Channel-I/O Processor, I/O devices -Direct memory access. TOTAL 45 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

35

PD 0201

PERSONALITY DEVELOPMENT - III Prerequisite Nil

L 0

T 0

P 2

C 1

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 UNIT 1 Goal Setting - Problem Solving - Emotional Quotient UNIT 2 Assertiveness - Stress Management - Quiz II UNIT 3 Lateral Thinking (Situational) - Team Work (Role Plays) Impromptu - Text Analysis UNIT 4 Business plan presentation I - Business plan presentation II - Chinese Whisper UNIT 5 Picture Perfect - Case Studies - Review TOTAL 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 CS0211 MICROPROCESSOR LAB Prerequisite NIL 0 T 0 P 3 C 2 6

30

PURPOSE This Lab Course will enable the students to implement the small logic at assembly language level.

36

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 LIST OF EXERCISES 1. 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. 20

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. TOTAL REFERENCE: Laboratory manual

25

45

L CS0213 DATA STRUCTURES AND ALGORITHMS LAB (C & C++) Prerequisite CS0112 0

T 0

P 3

C 2

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 given 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 20

37

CYCLE- II 1. 2. 3. 4. Divide and Conquer Method - Binary Search - Max Min Problem Greedy Method - Knapsack Problem Traversal Technique - Depth First Search - Breadth First Search Backtracking - 8-Queens Problem

25

TOTAL 45 REFERENCE :Laboratory Manual

38

SEMESTER IV L 2 T 0 P 0 C 2

LE0202

GERMAN LANGUAGE PHASE - II Prerequisite GERMAN LANGUAGE PHASE - I

PURPOSE Enabling the Engineering Students to one more Foreign Language, especially German, which is scientific and technical language. This may be useful in the field of employment opportunities as well as helping them to develop projects on browsing German websites. INSTRUCTIONAL OBJECTIVES Developing pronunciation so that they can read the text and e-mail during their employment, instructing them to write their own C V and developing a fundamental conversation with any German national. UNIT 1 SPEAKING; Dialogue Questioning / Basic queries / Conversational with practical exposure. 20

UNIT 2 GRAMMATIK (WRITING) 10 Verben, Wortstellung, Nomen, Pronomen, Artikel, Nominitativ, Akkusativ, Dativ, Adjective, Prasens, Perfect and Neben Satze. TOTAL 30 GLOSSARY Technical words. Lesson (6-10) TEXT BOOK WITH CASSETTES A. Grundkurs Deutsch B. Momentmal (Prescribed by Max Mueller Bhavan Goethe Institute, Germany).

SCHEME OF EVALUATION Internal 50 = Listening 10 Marks, Speaking 20 Marks, Reading 10 Marks and Writing = 10 Marks L 2 T 0 P 0 C 2

LE0204

JAPANESE LANGUAGE PHASE II Prerequisite JAPANESE LANGUAGE PHASE I

PURPOSE In view of globalization, learning Foreign Language by Engineering graduates enhances their employment opportunities. Get awareness of understanding of International culture. Widening the Linguistic Skills of the Students. INSTRUCTIONAL OBJECTIVES To learn the scripts of Japanese Languages namely Hiragana, Katakana and Kanji, Vocabularies etc. To learn basic grammar and acquire basic communication skills. To understand Japanese culture. UNIT 1 Lesson 2-{Korewa Tsukue desu } Grammar, Sentence pattern, Marume . Conversation UNIT 2 Lesson 3 [Kokoni denwa ga arimasu] - Grammar, Sentence pattern, Marume .Copnversation UNIT 3 Lesson 4 {Asokoni hito ga imasu} - Grammar, Sentence pattern, Marume . Lesson 5 {Akairingo wa ikutsu arimasu ka}-Grammar, Sentence pattern, Marume . Conversation. 8

39

UNIT 4 Lesson 6 {Barano hana wa ippon ikura desu ka}- Grammar, Sentence pattern.Marume.Conversation TOTAL TEXT BOOKS 1. 2. 3. 4. Nihongo Shoho Imain Text sold in India by the Japanese Language Teachers Association Pune. Hiragana and Katakana Work Book published by AOTS Japan Grammar and Kotoba ( Work Book ) Japanese for Dummies.(Conversation) CD.

30

SCHEME OF EVALUATION Internal 50 = Listening 10 Marks, Speaking 20 Marks, Reading 10 Marks and Writing = 10 Marks L 2 T 0 P 0 C 2

LE0206

FRENCH LANGUAGE PHASE II Prerequisite FRENCH LANGUAGE PHASE I

PURPOSE 1. As language skills are as valuable as technical skills a knowledge of French enables the engineering graduates in career orientation. 2. As a second international global Lang after English there is a wider choice of job opportunities in the inter national employment market and also multinationals in India and an understanding of French culture thro language. INSTRUCTIONAL OBJECTIVE Characterised by the Roman script, grammar, vocabulary and colloquial expressions are taught which enables them to communicate effectively with any native speaker. UNIT 1 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. 6

UNIT 2 GRAMMAR 6 Possessive Adjectives, Demonstrative Adjectives, Past tense Pass Compose( Verbe Auxiliare:.Etre et Avoir) UNIT 3 6 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) UNIT 4 Transport system, government and media in France articles on these topics. 6

UNIT 5 6 Comprehension and Grammar Comprehension passages and conversational sentences in different situations (at the restaurant, at the super market) TOTAL 30 TEXT BOOK: 1. Panorama Goyal Publishers 2. Apprenons le Francais II, Sarawathy Publications SCHEME OF EVALUATION Internal 50 = Listening 10 Marks, Speaking 20 Marks, Reading 10 Marks and Writing = 10 Marks

40

MA0212

PROBABILITY AND QUEUEING THEORY Prerequisite Nil (Common for CSE, IT & ICE)

L 3

T 0

P 0

C 3

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. UNIT 1 PROBABILITY AND RANDOM VARIABLES 9 Probability concepts Random Variable Characteristics of random variables : Expectation, Variance, Covariance, Moments; Moment generating function Function of random variable Chebychevs inequality. UNIT 2 THEORETICAL DISTRIBUTIONS 9 Discrete : Binomial, Poisson, Geometric, Negative Binomial; Continuous : Exponential and Normal Distributions. UNIT 3 TESTING OF HYPOTHESES 9 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. UNIT 4 PRINCIPLES OF QUEUEING THEORY 9 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. UNIT 5 MARKOV CHAINS Introduction to Markov process Markov chains transition probabilities Limiting distribution. 9 TOTAL 60 TEXT BOOKS 1. Veerarajan T., Probability, Statistics and Random Processes, Tata McGraw Hill,1st Reprint 2004. (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 VChapter 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. 2. 3. Trivedi K S, Probability and Statistics with reliability, Queueing and Computer Science Applications,Prentice Hall of India,New Delhi, 1984 Gross.D and Harris.C.M. Fundementals of Queuing theory, John Wiley and Sons, 1985. Allen.A.O., Probability Statistics and Queuing theory,Academic Press, 1981.

41

L CS0202 PRINCIPLES OF PROGRAMMING LANGUAGES Prerequisite CS0201, CS0203 3

T 0

P 0

C 3

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) UNIT 1 PRELIMINARY CONCEPTS 9 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. UNIT 2 IMPERATIVE LANGUAGES Structured Programming Need and Design issues. Block Structures (Pascal), types arrays, records, sets, pointers, procedures, parameter passing, scope rules (in C). 9

UNIT 3 OBJECT ORIENTED LANGUAGES 9 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). UNIT 4 FUNCTIONAL PROGRAMMING 9 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) UNIT 5 LOGIC PROGRAMMING 9 Formal Logic Systems, Working with relations and their implementation (Using Prolog as example). Database query Languages, Exception handling (Using SQL as example) TOTAL 45 TEXT BOOK 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/

42

L CS0204 THEORY OF COMPUTATION Prerequisite MA 0102 & MA0211 3

T 0

P 0

C 3

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. UNIT 1 FINITE AUTOMATA 10 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 NDFAs with and without -moves Equivalence of finite Automaton and regular expressions Minimization of DFA- - Pumping Lemma for Regular sets Problems based on Pumping Lemma. UNIT 2 GRAMMARS 10 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 UNIT 3 PUSHDOWN AUTOMATA 9 Pushdown Automata - Definitions Moves Instantaneous descriptions Deterministic pushdown automata Equivalence of Pushdown automata and CFL - pumping lemma for CFL problems based on pumping Lemma UNIT 4 TURING MACHINE 8 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. UNIT 5 COMPUTATIONAL COMPLEXITY 8 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. TOTAL 45 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

43

CS0206

OPERATING SYSTEMS Prerequisite CS0201, CS0203

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 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. UNIT 2 PROCESSES 9 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 UNIT 3 CONCURRENCY AND SCHEDULING 9 Principles of concurrency - mutual exclusion, semaphores, monitors, Readers/Writers problem; Deadlocks prevention- avoidance detection .Scheduling : Types of scheduling scheduling algorithms. Case studiesUNIX scheduling. UNIT 4 MEMORY 9 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 UNIT 5 INPUT/OUTPUT AND FILE SYSTEMS 9 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. TOTAL 45 TEXT BOOK 1. William Stallings, Operating Systems internals and design principles , Prentice Hall India, 5th Edition, 2005. REFERENCE BOOKS Andrew S. Tannenbaum & Albert S. Woodhull, Operating System Design and Implementation, Prentice Hall India, 2nd Edition, 1998. Gary Nutt, Operating System - A Modern Perspective, Pearson Education Asia, 2nd Edition 2000. Harvey .M. Deitel, Operating Systems, 2nd Edition , 2000. Silberschatz, Peter Galvin, Operating System Concepts, AWL 6th Edition, 2002, 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

44

CS 0210

COMPREHENSION I Prerequisite Should have studied the Computer Science and Engineering Subjects Prescribed / opted for upto IV SEMESTER

L 0

T 2

P 0

C 1

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 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: Digital Computer Fundamentals 1. Programming in C 2. Data Structures 3. Design and Analysis of algorithms 4. Microprocessor and Interfacing 5. Principles of Programming Languages 6. Theory of Computation 7. Operating Systems 8. 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. TOTAL 30 (Evaluation shall consist of a 3 hour duration end semester examination consisting of objective type as well as conventional questions ) 30

PD 0202

PERSONALITY DEVELOPMENT - IV Prerequisite Nil

L 0

T 0

P 2

C 1

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.

45

1. Group activities + individual activities. 2. Collaborative learning. 3. Interactive sessions. 4. Ensure Participation. 5. Empirical Learning UNIT 1 Motivation II - Interpretation of Visuals of I & II UNIT 2 Humor in real life - Body language - Collage and poster designing and slogan writing UNIT 3 Brain Teasers JAM - Current News Update I UNIT 4 Current News Update II - Enactment (SKIT I) - Enactment (SKIT II) UNIT 5 Survey and Reporting (heroes, sports persons etc.) - Quiz III - Review TOTAL EVALUATION: 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 6

30

L CS0212 OPERATING SYSTEMS LAB Prerequisite CS0201, CS0203 0

T 0

P 3

C 2

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 3. Memory management schemes, Thread and synchronization LIST OF EXPERIMENTS 1. 2. 3. 4. 5. 6. Simulate the following CPU scheduling algorithms a) Round Robin b) SJF c) FCFS d) Priority Simulate all file allocation strategies a) Sequential b) Indexed c) Linked Simulate MVT and MFT Simulate all File Organization Techniques a) Single level directory b) Two level c) Hierarchical d) DAG Simulate Bankers Algorithm for Dead Lock Avoidance Simulate an Algorithm for Dead Lock Detection 45

46

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. TOTAL 45 REFERENCE : Laboratory Manual L CS0214 JAVA PROGRAMMING Prerequisite CS0112 2 T 0 P 2 C 3

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 THEORY 30 Java Basics Data types- methods class objects- overloading- Inheritance-types of inheritance- overridingException handling Strings - Interfaces- Packages- Threads- Applets- Exception handling

PRACTICAL JAVA BASICS 1. Programs illustrating various data types in Java

30

47

2. 3. 4. 5. 6. 7. 8.

Programs illustrating class, objects and methods Programs for addition and multiplication of Matrices Programs illustrating Overloading in Java Programs illustrating the implementation of Various forms of Inheritance( Single, Hierarchical, Multilevel ) Programs illustrating Overriding methods in Java Programs illustrating Exception Handling 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 TOTAL REFERENCE: Laboratory Manual 60

CS0216

COMPUTER SKILLS Prerequisite Nil

L 1

T 0

P 2

C 2

48

SEMESTER V L 3 T 0 P 0 C 3

CS0305

OPERATIONS RESEARCH TECHNIQUES Prerequisite MA 0102 & MA0211

PURPOSE To enlighten the students with the various optimized techniques INSTRUCTIONAL OBJECTIVES At the end of the course the students will be able to know 1. 2. 3. 4. 5. Concepts of Linear programming technique Applications and use of Assignment, Transportation and Replacement models Techniques of PERT, CPM Detailed knowledge of Inventory control Advanced Linear Programming

UNIT 1 LINEAR PROGRAMMING 9 Operations research and decision making, Types of mathematical models and constructing the model, Formulation of linear programming problem, Simplex method (Analytical & Graphical), Two phase and Big M methods UNIT 2 ASSIGNMENT & TRANSPORTATION MODELS 9 Assignment models, Transportation problem North west corner method Least cost method Vogels approximation method Modi method, Unbalance and degeneracy in trasnprotation model, Replacement model Replacement of items that deteriorate, gradually, fail suddenly, group replacement policy analysis. UNIT 3 SCHEDULING AND NETWORK ANALYSIS 9 Problem of sequencing Processing n jobs through two machines and three machines, Processing two jobs through m machines. Network analysis PERT and CPM, Total slack, free slack, Probability of achieving completion date, Cost analysis UNIT 4 INVENTORY CONTROL Inventory models Deterministic models Economic ordering quantity, Reorder level, optimum cost Instantaneous and Non-instantaneous receipt of goods with or without shortages. 9

UNIT 5 ADVANCED LINEAR PROGRAMMING 9 Integer programming problem - Cutting plane algorithm Transportation models - Vogels Approximation method MODI method Unbalanced transportation problem Degeneracy in transportation models Assignment models Traveling salesman problem-Dynamic Programming problem. TOTAL 45 TEXT BOOK 1. Handy .A. Taha, Operations Research, Prentice Hall of India., 5th Edition, 1995 REFERENCE BOOKS 1. Kanti Swarup, Gupta P.K., and Man Mohan, Operations Research, Sultan Chand & Sons, 1994. 2. Sharma S.D., Operations Research, Kedarnath Ramnath & Co., Meerut,1994. 3. Sundaresan.V, Ganapathy Subramanian.K.S. and Ganesan.K, Resource Management Techniques, A.R. Publications,2002

49

L EC0211 PRINCIPLES OF COMMUNICATION Prerequisite CS0112, CS0203 3

T 0

P 0

C 3

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. UNIT 1 AM MODULATION 9 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. UNIT 2 TRANSMITTERS AND RECEIVERS 9 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. UNIT 3 FM MODULATION AND DEMODULATION 9 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. UNIT 4 PULSE MODULATION 9 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. UNIT 5 COMMUNICATION SERVICES (ELEMENTARY TREATMENT ONLY) 9 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. TOTAL 45 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.

50

CS0301

COMPILER DESIGN Prerequisite CS0204

L 3

T 0

P 0

C 3

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 UNIT 1 ASSEMBLER,MACRO,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. 9

UNIT 2 INTRODUCTION TO COMPILERS 8 Compiler: Introduction - Analysis of the source program - phases of a compiler - Compiler construction toolsLexical analysis - Role of the lexical analyzer - Specification of tokens Recognition of tokens -Lexical analyzer generators- Design aspects of Lexical Analyzer UNIT 3 SYNTAX ANALYSIS PARSING 10 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 generatorsDesign aspects of Parser. UNIT 4 SEMANTIC ANALYSIS TRANSLATION & RUNTIME STORAGE 9 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 UNIT 5 CODE GENERATION & OPTIMIZATION 9 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. TOTAL : 45 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. 2. 3. 4. Kenneth C. Louden, Compiler Construction, Principles and Practice, Thomson Books,2007. Aho. A.V & Ullman J.D, Principles of Compiler Design, Narosa publications,1985. S.S. Muchnick Harcourt Asra, Advanced Compiler Design implementation, Morgan Kaufman, 1997. 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/

51

CS0303

COMPUTER NETWORKS Prerequisite CS0112, CS0203

L 3

T 0

P 0

C 3

PURPOSE To study the various layer in Computer Networking and its Protocol design INSTRUCTIONAL OBJECTIVES 3. To understand the concepts of data communications. 4. To study the functions of different layers. 5. To make the students to get familiarized with different protocols and network components. UNIT 1 INTRODUCTION 8 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. UNIT 2 PHYSICAL AND DATA LINK LAYERS 10 Basics for Data communicationsTransmission Media Guided and unguided transmission media Communication satellites - Data link Layer design issuesError Detection & CorrectionElementary Data link ProtocolsSliding window Protocols. UNIT 3 MAC & NETWORK LAYERS 10 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 AlgorithmsCongestion Control Algorithms UNIT 4 TRANSPORT LAYER 9 Transport servicesElements of transport ProtocolsA simple transport ProtocolsUDPTCP Performance issues. UNIT 5 APPLICATION LAYER DNSE-mailWWW-MultimediaIntroduction to Cryptographybasic concepts-firewalls. 8

TOTAL 45 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

52

PD0 301

PERSONALITY DEVELOPMENT - V Prerequisite Nil

L 1

T 0

P 2

C 2

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 UNIT 1 9 Syllogism - Binary Logic [cause & effect] - Assertive & Counter Argument - Simple Interest - Time & Work Time & Distance UNIT 2 9 Upstream &Downstream Reasoning - Verbal Comprehension I - Verbal Comprehension II- Compound InterestLogarithms - Surds & Indices UNIT 3 Verbal Reasoning I - Verbal Reasoning II - Verbal Reasoning III Percentage Test Averages 9

UNIT 4 9 Deductive Reasoning I - Deductive Reasoning II - Language Usage I - Decimal Fractions - Profit & Loss Probability UNIT 5 Language Usage II - Logic Games I - Logic Games II Area - Pipes & Cisterns - Test TOTAL SCHEME OF INSTRUCTION Marks allocated for regular participation in all oral activities in class SCHEME OF EXAMINATION Complete Internal evaluation on a regular Basis 9

45

CS0311

COMPILER DESIGN LAB Prerequisite CS0204

L 0

T 0

P 3

C 2

PURPOSE To Practice and implement the system software tools and compiler design techniques

53

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. 2. 3. 4. 5. 6. 7. 8. 9. Implementation of a Linker Implementation of a Loader Implementation of an Assembler Implementation of Macro processor Implementation of a Lexical Analyser Converting a regular expression to NFA Converting NFA to DFA Computation of FIRST and FOLLOW sets Construction of Predictive Parsing Table 45

10. Implementation of Shift Reduce Parsing 11. Computation of Leading and Trailing Sets 12. Computation of LR(0) items 13. Construction of DAG 14. Intermediate Code Generation 15. Design of Simple Compiler using Tamil words 16. Trace the execution of another program - debugger TOTAL REFERENCE: Laboratory Manual L CS0313 NETWORKING LAB Prerequisite CS0112, CS0203 0 T 0 P 3 C 2 45

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 45 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.

54

 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 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. TOTAL REFERENCE : Laboratory Manual 45

CS 0315

INDUSTRIAL TRAINING I Prerequisite Nil (Training to be undergone after IV Semester)

L 0

T 0

P 2

C 1

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.

55

SEMESTER VI L CS0302 ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS Prerequisite MA 0211 3 T 0 P 0 C 3

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. UNIT 1 INTRODUCTION TO Al AND PRODUCTION SYSTEMS 10 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. UNIT 2 REPRESENTATION OF KNOWLEDGE 10 Game playing Knowledge representation, Knowledge representation using Predicate logic, Introduction to predicate calculus, Resolution, Use of predicate calculus, Knowledge representation using other logic Structured representation of knowledge. UNIT 3FUNDAMENTALS OF EXPERT SYSTEMS 9 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. UNIT 4 KNOWLEDGE INFERENCE 8 Knowledge representation Production based system, Frame based system. Inference Backward chaining, Forward chaining, Rule value approach, Fuzzy reasoning Certainty factors, Bayesian probability. UNIT 5 MACHINE LEARNING 8 Strategic explanations Why, Why not and how explanations. Learning Machine learning, adaptive learning. - Typical expert systems MYCIN, PIP, INTERNIST, DART, XOON, Expert systems shells TOTAL 45 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

56

L CS0304 DATABASE MANAGEMENT SYSTEMS Prerequisite CS0201, Maths I 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 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 UNIT 2 THE RELATIONAL DATA MODEL & ALGEBRA 9 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 UNIT 3 SQL 9 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 ConnectivitySecurity and User Authorization in SQL UNIT 4 INDEX STRUCTURE, QUERY PROCESSING 9 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 Management, Parallel Algorithms-Estimating the Cost of Operations-Cost-Based Plan Selection -Order for Joins-Physical-Query-Plan UNIT 5 FAILURE RECOVERY AND CONCURRENCY CONTROL 9 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 TOTAL 45 TEXT BOOK 1. Hector Garcia-Molina, Jeff Ullman, and Jennifer Widom, Database Systems: The Complete Book Pearson Eduction, 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/

57

CS0306

OBJECT ORIENTED ANALYSIS AND DESIGN Prerequisite CS0202

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 8 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 UNIT 2 UML AND THE UNIFIED PROCESS 9 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 UNIT 3 OBJECT ORIENTED ANALYSIS 10 Extracting entity classes Initial dynamic model Extracting control classes- refining use cases incrementing the class diagram Initial dynamic model MSG Foundation case study revising the entity classes- Extracting USE case realization MSG Foundation case study incrementing the class diagram more on use cases risk UNIT 4 OBJECT ORIENTED DESIGN WORKFLOW 10 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 UNIT 5 TESTING AND MANAGEMNET ISSUES 8 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 TOTAL 45 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.

58

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 3 T 0 P 0 C 3

CS0308

LOGIC FOR COMPUTER SCIENCE Prerequisite MA 0101 , MA 0102 & MA 0211

PURPOSE To study important concepts in Logic INSTRUCTIONAL OBJECTIVES 4. To provide main notions of Mathematical Logic 5. To learn Formal framework to construct logic arguments 6. To student deductive systems along with completeness UNIT 1 PROPOSITIONAL LOGIC Declarative sentences Natural deduction Popositional logic as a Formal Language Semantics of Propositional Logic Normal Forms SAT Solvers UNIT 2 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 9

UNIT 3 VERIFICATION BY MODEL CHECKING 9 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 UNIT 4 PROGRAM VERIFICATION AND MODAL LOGIC 9 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 UNIT 5 BINARY DECISION DIAGRAMS 9 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 TOTAL 45 TEXT BOOK Huth M and Ryan M , Logic in Computer Science : Modeling and Reasoning about systems, Cambridge University Pres 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/

59

CS 0310

COMPREHENSION II Prerequisite Should have studied the Computer Science and Engineering Subjects prescribed / opted for upto VI SEMESTER

L 0

T 2

P 0

C 1

PURPOSE To provide a complete picture of Computer Science and engineering topics covered in I to IV 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. A. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. COMPREHENSION Review of the following topics of Computer Science and engineering: Data Structures Design and Analysis of Algorithms Operating Systems Theory of Computation Compiler Design Computer Networks Artificial Intelligence and Expert Systems Data Base Management Systems Object Oriented Analysis and Design Logic for Computer Science 30

B. Seminar/group discussion Students shall have seminar/group discussion sessions on the topics listed under A above under the guidance of staff. TOTAL 30 (Evaluation shall consist of a 3 hour duration end semester examination consisting of objective type as well as conventional questions ) L 1 T 0 P 2 C 2

PD0 302

PERSONALITY DEVELOPMENT VI 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.

60

1. Group activities + individual activities. 2. Collaborative learning. 3. Interactive sessions. 4. Ensure Participation. 5. Empirical Learning UNIT 1 9 Self Introduction - Narration - Current News Update Numbers - Height & Distance - Square & Cube Roots UNIT 2 9 Current Tech Update - Verbal Aptitude Test I - GD I - Odd man out series - Permutation & Combination Problems on ages UNIT 3 9 GD II - Resume Writing - Mock Interview I / reading comprehension - Problems on trains Allegation of Mixtures - Test UNIT 4 9 Mock Interview II / reading comprehension - Mock Interview III/ reading comprehension - GD III - Ratio & Proportion - Clocks - H.C.F & L.C.M UNIT 5 GD IV - Verbal Aptitude Test II Review Partnership Puzzles - Test TOTAL 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 CS0312 ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS LAB Prerequisite MA 0211 0 T 0 P 3 C 2 9 45

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. 2. 3. 4. 5. 6. 7. 8. 9. 10. Water Jug Problem (Using DFS And BFS) Single Player Game(Using Heuristic Function) Two Player Game(Using Heuristic Function) A* Algorithm AO* Algorithm Predicate To Prepositional Logic Syntax Checking of English sentences-English Grammar. Develop an Expert system for Medical diagnosis. Develop any Rule based system for an application of your choice. Develop an algorithm for morphological derivation / verb derivation and implement it. TOTAL 45 REFERENCE : Laboratory Manual 45

61

CS 0314

DATABASE MANAGEMENT SYSTEMS LAB Prerequisite CS0201, MA 0101

L 0

T 0

P 3

C 2

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. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. Data Definition Language (DDL) commands in RDBMS Data Manipulation Language (DML) and Data Control Language (DCL) High level language extensions with cursors High level language extension with Triggers Procedures and Functions Embedded SQL Database design using E-R model and Normalization Design and implementation of payroll processing system Design and implementation of Banking system Design and implementation of Library Information System Design and implementation of Student Information System Automatic Backup of Files and Recovery of Files TOTAL 45 REFERENCE : Laboratory Manual 45

62

SEMESTER VII L MB0403 INDUSTRIAL MANAGEMENT AND ECONOMICS Prerequisite Nil 3 T 0 P 0 C 3

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. UNIT 1 INTRODUCTION 9 Introduction to management:- Nature and scope of management Functions- Planning-Organizing StaffingLeading-controlling. UNIT 2 PRODUCTION AND MANAGEMENT 9 Production & Management Plant location Factors Influencing location Process Methods-Procedures Production routing, scheduling, Production Costs, Inventory and Controlling Techniques. UNIT 3 MANAGERIAL ECONOMICS Managerial economics for Industry-Demand-Types-Supply-Factors-Determining Demand-Elasticity Demand-Forecasting Methods-Utility-Theories of Utility Pricing Methods of Pricing. 9 of

UNIT 4 ENGINEERING ETHICS 9 Engineering Ethics Social experimentation Responsibility for safety Collective bargaining Global issues Environmental Ethics Sample Code & Conducts. UNIT 5 ACCOUNTING AND FINANCE 9 Accounting for Management Concepts, Conventions Introduction to financial statements tools and techniques of Financial Statements Budget and Budgetary control Cost Concepts Financial information System. TOTAL 45 TEXT BOOKS Koontz, Essential of Management, McGraw Hill Publishing Company, International edition. Dr.S.N.Maheswari, Financial and Management Accounting, sultan chand & sons, New delhi., 1998. 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 CS0401 SOFTWARE ENGINEERING Prerequisite NIL 3

T 0

P 0

C 3

PURPOSE This course in Software Engineering provides an in-depth understanding of the Software Engineering principles and methodologies

63

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 UNIT 1 SOFTWARE PROJECT MANAGEMENT 9 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. UNIT 2 SOFTWARE REQUIREMENTS ANALYSIS 9 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. UNIT 3 SOFTWARE DESIGN CONCEPTS 9 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 UNIT 4 IMPLEMENTATION AND TESTING 9 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 UNIT 5 SOFTWARE MAINTENANCE & RELIABILITY ISSUES 9 Introduction Quality assurance Walk through and inspections Static analysis Symbolic executionSoftware 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 TOTAL 45 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 practitioners 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. 5. John D. Musa, Software Reliability, McGrawHill, 1985 6. David Gustafson, Software Engineering, Schaums 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

64

CS0403

PARALLEL AND DISTRIBUTED COMPUTING Prerequisite CS0201, CS0303

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION TO PARALLEL COMPUTING 9 Motivating Parallelism-Scope of parallel computing-Parallel programming platforms-Implicit ParallelismLimitations 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. UNIT 2 PRINCIPLES OF PARALLEL ALGORITHM DESIGN 9 Preleminaries-Decomposition techniques-characteristics of tasks and interactions-mapping techniques for load balancing-methods for containing interaction overheads-parallel algorithm models. UNIT 3 BASIC COMMUNICATION OPERATIONS 9 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. UNIT 4 PROGRAMMING USING MESSAGE PASSING PARADIGM 9 Principles of message passing programming-Building blocks-Message passing interface-Topologies and embedding-Overlapping computation with communication-Collective communication and computation operation. UNIT 5 PROGRAMMING SHARED ADDRESS SPACE PLATFORMS 9 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. TOTAL 45 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 bookMcGrawl Publications 2005. ONLINE REFERENCES: www.ebooks.com www.freebookcentre.com

65

CS0405

VLSI DESIGN AND EMBEDDED SYSTEMS Prerequisite

L 3

T 0

P 0

C 3

PURPOSE VLSI provides improved solutions for high speed networking, high performance computers, and special applications of integrated circuits, requiring the use of multiple disciplines There is urgent need to absorb and assimilate the latest development in the VLSI and embedded system design field VLSI industry needs VLSI design engineers and Embedded system design engineers INSTRUCTIONAL OBJECTIVES In this course, the students will be able to 1. Study the physics of MOSFETs at an elementary level, derive their I/V characteristics, describe the second-order effects, and derive small-signal model. 2. Acquire working knowledge of basic digital design paradigms and the necessary Verilog HDL constructs that would help to build small digital circuits 3. Learn the concepts of embedded processors, embedded programming and Real-Time Operating Systems. UNIT 1 9 Basic MOS device physics (Elementary treatment only) MOSFET as a switch - MOSFET structure, symbols, operation logic gates in CMOS, transmission gate circuits. UNIT -2 9 Electrical characteristics of MOSFETs and CMOS Logic gates Threshold voltage, derivation of I/V characteristics short-channel effects MOS device models DC characteristics, switching characteristics and power dissipation of CMOS inverter. UNIT -3 9 Digital system design with Verilog HDL (Elementary treatment only) Basic concepts, modules and ports gate-level modeling, dataflow modeling, behavioural modeling, switch-level modelling, UDPs. UNIT -4 9 Introduction to embedded systems (Elementary treatment only) Challenges of Embedded Systems Embedded system design process. Embedded processors 8051 Microcontroller, ARM processor Architecture, Instruction sets and embedded programming in Assembly Language (ALP) and in High-Level Language C UNIT -5 9 Real-Time Operating System (Elementary treatment only) Concept of tasks, task states, task and data, hard and soft real time systems - task scheduling like SJF, RR, EDF, RM Process, Process table, Inter process communication, Interrupts, clock synchronization, deadlocks - semaphores, shared data, semaphore functions, message queue functions, mailbox functions, pipe functions, timer functions, events, memory management, interrupt routines in RTOS environment, basic design using an RTOS Total 45 TEXT BOOKS 1. John P. Uyemura, Introduction to VLSI Circuits and Systems, Wiley India, 2006. 2. Samir Palnitkar, Verilog HDL: A guide to Digital Design and Synthesis, 2nd edition, Pearson Education. 3. Rajkamal, Embedded Systems: Architecture, Programming and Design, Tata McGraw-Hill Education, 2008.

66

REFERENCE BOOKS 1. Jan M. Rabaey, Anantha Chandrakasan and Borivoje Nikolic, "Digital Integrated Circuits", Second Edition, Prentice-Hall. 2. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay, The 8051 Microcontroller and Embedded systems, Person Education, 2004. 3. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles, 7th edition, Wiley-India.
L CS0411 SOFTWARE ENGINEERING LAB 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 1. 2. 3. 4. 5. 6. 7. 8. Suggested List of Applications: Library Management System Bank Management System Inventory System Software for a Game Text Editor Natural Language Based Grammar Checker Airline Reservation System Online Survey TOTAL 30 REFERENCE : Laboratory Manual 0 T 0 P 2 C 1

L CS0413 VLSI AND EMBEDDED SYSTEM DESIGN LAB Prerequisite CS0205, CS0211 0

T 0

P 3

C 2

PURPOSE Almost all embedded systems are designed with microcontrollers as an essential basic part. This subject provides basic knowledge of typical microcontrollers. HDL programming is fundamental for VLSI design and hence this course is given. INSTRUCTIONAL OBJECTIVES To make the students To learn two typical microcontrollers and how to use it in pratical applications. The lab component gives hands on training on the design, development and microcontroller applications. To write programs in VHDL and verilog for modeling digital circuits. Total 45

67

LIST OF EXPERIMENTS 1. Design with 8 bit Microcontrollers 8051/PIC Microcontrollers i) I/O Programming, Timers, Interrupts, Serial port programming ii) PWM Generation, Motor Control, ADC/DAC, LCD and RTC Interfacing, Sensor Interfacing iii) Both Assembly and C programming 2. Design with ARM Processors - I/O programming, ADC/DAC, Timers, Interrupts 3. Study of one type of Real Time Operating Systems (RTOS) 4. Design and Implementation of simple Combinational/Sequential Circuits 5. Design with Programmable Logic Devices using Xilinx/Altera FPGA and CPLD

L CS0316 INDUSTRIAL TRAINING II (Training to be undergone after VI Semester) 0

T 0

P 2

C 1

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.

68

SEMESTER VIII L CS0402 SCRIPTING LANGUAGES AND WEB TECHNOLOGY Prerequisite CS0202, CS0303 3 T 0 P 0 C 3

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 protocols. 2. CGI Concepts & CGI Programming 3. SCRIPTING LANGUAGES 4. Study of DHTML, XML 5. Study of On-Line web application & Internet Concepts UNIT 1 INTRODUCTION 9 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 UNIT 2 COMMON GATEWAY INTERFACE PROGRAMMING 9 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. UNIT 3 SCRIPTING LANGUAGES 9 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 UNIT 4 SERVER SIDE PROGRAMMING 9 Dynamic Web content cascading style sheets DHTML XML Server side includes communication Active and Java Server Pages Firewalls Proxy Servers. UNIT 5 ON-LINE APPLICATIONS 9 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. TOTAL 45 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

69

CS 0414

PROJECT Prerequisite Should have studied the Computer Science and Engineering Subjects Prescribed / opted for upto VIII SEMESTER

L 0

T 0

P 16

C 8

PURPOSE 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 an exercise 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.

70

ELECTIVES FOR FIFTH SEMESTER L 3 T 0 P 0 C 3

CS0321

SYSTEM MODELLING AND SIMULATION 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 UNIT 1 INTRODUCTION 9 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 UNIT 2 MATHEMATICAL & STATISTICAL MODELS 9 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 UNIT 3 RANDOM NUMBERS 9 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 UNIT 4 ANALYSIS OF SIMULATION DATA 9 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. UNIT 5 APPLICATION & SIMULATION SOFTWARES 9 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 TOTAL 45 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

71

L CS0323 DIGITAL IMAGE PROCESSING Prerequisite Nil 3

T 0

P 0

C 3

PURPOSE This course provides a complete understanding of the various image processing techniques INSTRUCTIONAL OBJECTIVES Image fundamentals and techniques To learn various Image enhancement , restoration and compression techniques To learn various Image segmentation , representation and description methods UNIT 1 INTRODUCTION 8 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 UNIT 2 IMAGE ENHANCEMENT 9 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 UNIT 3 IMAGE RESTORATION 10 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 UNIT 4 IMAGE COMPRESSION 9 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 UNIT 5 IMAGE SEGMENTATION, REPRESENTATION & DESCRIPTION 9 Segmentation: Detection of discontinuities Edge linking & Boundary detection Thresholding region based segmentation Representation & Description: Chain codes Polygonal approximations signatures Boundary segments Skeletons; Boundary Descriptors Regional descriptors TOTAL 45 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

72

CS0325

VISUAL PROGRAMMING Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION TO WINDOWS PROGRAMMING 8 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. UNIT 2 VISUAL BASIC PROGRAMMING 10 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. UNIT 3 VISUAL C++ PROGRAMMING 9 Visual C++ components Developing simple applications Microsoft Foundation classes Controls Message handling - Document-view architecture Dialog based applications Mouse and keyboard events. UNIT 4 VISUAL JAVA INTRODUCTION 9 Java basics Java classes Object references Inheritance Exception handling - File I/O Java tools Developing Java applications. UNIT 5 JAVA APPLETS AND NETWORKING 9 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. TOTAL 45 TEXT BOOKS 1. Charles Petzold, Windows Programming, Microsoft Press, 1995.(Unit I) 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 C.H. Pappas, W.H. Murray, III Visual C++: The Complete Reference, Tata McGraw-Hill Publishing Company, 1999. Stephen R.Davis, Lean Java Now, Microsoft Press, 1996. Jamie Jaworski, Java Unleashed, SAMS Techmedia Publication, 1999. 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

73

CS0327

SOFT COMPUTING Prerequisite Nil

L 3

T 0

P 0

C 3

PURPOSE This course provides a way to understand the concepts of Artificial Intelligence , ANN , Genetic Algorithms and Fuzzy systems and its applications INSTRUCTIONAL 1. 2. 3. OBJECTIVES Basics of AI and ANN Neuro fuzzy systems and its applications Genetics algorithms and its applications

UNIT 1 BASICS OF NEUROSCIENCE AND ANN MODELS 9 The Brain as a Neural network-Basic Properties of Neurons Neuron Models Rosenblatts Prceptron The widrow-Hoff LMS Learning Algorithm-Order of a Predicate and a Perceptron Complexity of Learning using Feedforward Networks. UNIT 2FUZZY SYSTEMS 9 Fuzzy Sets and Fuzzy Reasoning Fuzzy Matrices Fuzzy Functions Decompositions Fuzzy Automata and Languages Fuzzy Control Method Fuzzy Decision Making. UNIT 3 NEURO-FUZZY SYSTEMS 9 Introduction to Neuro Fuzzy Systems Fuzzy System Design Procedures Fuzzy Sets and Logic Background - Fuzzy / ANN Design and Implementation UNIT 4 GENETIC ALGORITHMS 9 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. UNIT 5 ARTIFICIAL INTELLIGENCE 9 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 TOTAL 45

TEXT BOOKS 1. N. K. Bose and P. Liang , Neural Network Fundamentals 2. Timothy J. Ross , Fuzzy Logic with Engineering Applications, McGraw- Hill International Editions,1995 ( UNIT 2& III) 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

74

CS0329

ADVANCED OPERATING SYSTEMS Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 MULTIPROCESSOR OPERATING SYSTEMS 9 Threads Process synchronization Processor scheduling Memory management Reliability Fault tolerance. UNIT 2 NETWORK OPERATING SYSTEMS (NOS) 9 Types of NOS NOS to LANs Choosing and NOS Multiple NOS on a single Network NOS and Network management Future Trends. UNIT 3 DISTRIBUTED OPERATING SYSTEMS 9 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 UNIT 4 DATABASE OPERATING SYSTEMS 9 Requirements - Concurrency control model Serializability theory Distributed database systems Synchronisation primitives Lock based and timestamp based algorithms Fully replicated database systems. UNIT 5 REAL TIME OPERATING SYSTEMS 9 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 acces one OS to other TOTAL 45 TEXT BOOKS 1. Mukesh Singhal, Niranjan G.Shivaratri, Advanced Concepts in Operating systems, McGraw-Hill, New York, 1994.(UNIT 1, III & IV) 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

75

CS0331

E- COMMERCE Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 History of E- Commerce Overview of E- Commerce framework E- Business models Network infrastructure - Role of Internet E- commerce and World wide Web. UNIT 2 E COMMERCE 9 Consumer oriented E- Commerce applications Mercantile process models ; Electronic Payment Systems Digital Token based EPS Smart cards Credit cards Risks designing EPS. UNIT 3 ORGANIZATIONAL COMMERCE AND EDI 9 Electronic Data Interchange EDI applications in Business EDI and e Commerce EDI standardization and implementation Internet based EDI. UNIT 4 SECURITY 9 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. UNIT 5 INTELLIGENT AGENTS 9 Definition and capabilities limitation of agents security web based marketing search engines and Directory registration online advertisements Portables and info mechanics website design issues. TOTAL 45 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 Judy Strauss and Raymond Frost , E Marketing , PHI, 2002 Brenda Kienan , Managing e Commerce Business , PHI,2001 Vivek Sharma and Rajiv Sharma , Developing e Commerce Sites an integrated approach , Pearson Education Asia, 2000 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)

76

CS0333

TCP/IP PRINCIPLES AND ARCHITECTURE Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 Intermediate communication entities- Layering network addresses-DNS-Client server model- Port numbersStandardization process-RFCs-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. UNIT 2 NETWORK LAYER AND APPLICATION 9 Introduction- IP header- IP routing - Subnet addressing- Subnet mask- Special case IP addresses ExamplesIfconfig 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. UNIT 3 UDP AND APPLICATIONS 9 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 UNIT 4 TCP 9 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 UNIT 5 TRANSPORT LAYER RELIABILITY AND APPLICATION 9 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 TOTAL 45 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/IPPrinciples, 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. 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

77

ELECTIVES FOR SIXTH SEMESTER L 3 T 0 P 0 C 3

CS0322

ADVANCED NETWORKS 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 UNIT 1 HIGH SPEED NETWORKS 8 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. UNIT 2 CONGESTION, TRAFFIC MANAGEMENT AND INTERNET ROUTING 9 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. UNIT 3 PRINCIPLES OF WIRELESS NETWORK OPERATION 9 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. UNIT 4 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. 9

UNIT 5 NETWORK MANAGEMENT 10 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 TOTAL 45 TEXT BOOKS 1. William Stallings, High Speed Networks, Internet Performance and QoS, Prentice Hall, 2003. (UNIT 1and II) 2. Kaveh Pahlevan and Prashant Krishnamoorthy, Principles of Wireless Networks, Prentice Hall of India, 2006. (UNIT 3and IV) 3. Adrian Farrel, The Internet and its Protocols First India Reprint 2005, Elsevier publications (UnitsV) 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 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

78

L CS0324 VIRTUAL REALITY Prerequisite Nil 3

T 0

P 0

C 3

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. UNIT 1 INTRODUCTION 9 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. UNIT 2 GEOMETRIC MODELLING 9 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. UNIT 3 VIRTUAL ENVIRONMENT 9 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. UNIT 4 VR HARDWARES & SOFTWARES 9 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. UNIT 5 VR APPLICATION 9 Introduction Engineering Entertainment Science Training The Future: Introduction Virtual environments modes of interaction. TOTAL 45 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 www.w3.org/MarkUp/VRML/ http://books.google.com - Multimedia and Virtual Reality Engineering, Virtual Reality Technology

79

L CS0326 ADVANCED DATABASES Prerequisite Nil 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 Introduction to Database Database Environment Relational Model Relational Algebra and Relational Calculus Introduction to SQL Commercial RDBMS Ms Access 2000, Oracle 8i. UNIT 2 DATABASE ANALYSIS & DESIGN TECHNIQUES 9 Database Planning Design & Administration Fact finding techniques - E-R Modeling EER Modeling Normalization. UNIT 3 METHODOLOGY 9 Logical Database Design for Relation Model Physical Database Design for Relational Database Security Transaction Processing Query Processing. UNIT 4 OBJECT ORIENTED AND DISTRIBUTED DATABASES 9 Introduction to Object DBMS Object DBMS Concepts and Design Distributed Database Concepts and Design Advanced Concepts of Distributed Database Introduction to Parallel Database. UNIT 5 CURRENT TRENDS 9 Mobile Database Geographic Information Systems Genome Data Management Multimedia Database Parallel Database Spatial Databases Temporal databases - Database administration Data Warehousing and Data Mining. TOTAL 45 TEXT BOOK 1. Database Systems Thomas Connolly, Carolyn Begg. 3rd Edition Pearson Education. REFERENCE BOOKS 1. Database System Concepts Abraham Silberschatz, Henry F.Korth, Sudarshan. 4th Edition McGrawHill. 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

80

CS0328

NEURAL NETWORKS Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 Definition of ANN-Biological Neural Networks-Applications of ANN-Typical Architectures-Setting the weights-Common Activation functions-Development Of Neural Networks-McCulloch-Pitts Neuron UNIT 2 SIMPLE NEURAL NETS FOR PATTERN CLASSIFICATION 9 General discussion - Hebb net Perceptron- Adaline - Backpropagation neural net- Architecture- AlgorithmApplications UNIT 3 PATTERN ASSOCIATION 9 Training Algorithm for Pattern Association-Heteroassociative memory neural network-Autoassociative netIterative Autoassociative net-Bidirectional Associative Memory UNIT 4 NEURAL NETS BASED ON COMPETITION 9 Fixed Weights Competitve Nets- Kohonens Self-Organizing Map Learning Vector Quantization-Counter Propagation Network. UNIT 5 ADAPTIVE RESONANCE THEORY AND NEOCOGNITRON 9 Motivation Basic Architecture- Basic Operation-ART1-ART2-Architecture-Algorithm-applications-AnalysisProbablistic Neural Net-Cascade Correlation-Neocognitron: ArchitectureAlgorithm. TOTAL 45 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

81

CS0330

QUANTUM INFORMATION PROCESSING Prerequisite Nil

L 3

T 0

P 0

C 3

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 3. to complement the traditional approaches of computation UNIT 1 INTRODUCTION 9 Quantum bits quantum computation quantum gates quantum circuits - quantum parallelism - Deutschs algorithm Experiemental quantum Information processing example problems. UNIT 2 QUANTUM MECHANICS 9 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

UNIT 3 QUANTUM COMPUTATION 9 Single qubit operations Universal quantum gates a discrete set of universal operations quantum computational complexity quantum simulation algorithm perspectives on quantum simulation UNIT 4 QUANTUM SEARCH ALGORITHMS 9 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 UNIT 5 QUANTUM INFORMATION THEORY 9 Distinguishing quantum states and the accessible information Schumachers 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 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

82

ELECTIVES FOR SEVENTH SEMESTER L 3 T 0 P 0 C 3

CS0421

GENETIC ALGORITHMS 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 UNIT 1 INTRODUCTION TO GENETIC ALGORITHM 9 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 UNIT 2 GA OPERATORS 10 Reproduction- Roulette-wheel Selection Boltzman Selection Tournament Selection-Rank Selection Steady state selection Elitism generation gap and steady-state selection - Inheritance operators - CrossoverSingle-point crossover Two-point cross over Multi-point cross over Uniform Cross over Matrix Cross Over Cross Over rate - Mutation operators mutation mutation rate UNIT 3 GENETIC MODELLING 9 Inversion and deletion : Inversion deletion and duplication - deletion and regeneration segregation cross over and inversion Bit-wise operators ones 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 UNIT 4 APPLICATIONS OF GA 8 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 UNIT 5 GENETICS-BASED MACHINE LEARNING 9 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. Smitchs Poker playerCurrent Applications. Total 45 TEXT BOOKS 1. David E. Gold berg, 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

83

L CS0423 SPEECH TECHNOLOGY Prerequisite Nil 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION AND FINITE STATE TRANSDUCERS 9 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 UNIT 2 TEXT TO SPEECH AND PROBABILISTIC MODELS 9 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 UNIT 3`SPEECH RECOGNITION AND GRAMMER 9 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. UNIT 4`PARSING 9 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. UNIT 5 SEMANTIC ANALYSIS AND MACHINE TRASLATION 9 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. TOTAL 45 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/

84

CS0425

MOBILE COMPUTING Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 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. UNIT 2 MAC,TELECOMMUNICATIO AND SATELLITE SYTEMS 9 Medium access control Techniques-SDMA-TDMA-FDMA-CDMA-Comparison. Tele Communication Systems-GSM-DECT and TETRA - Satellite Systems-Routing,Localization and Handover. UNIT 3 WIRELESS LAN 9 Wireless LAN IEEE 802.11 standards HIPERLAN Blue tooth technology and protocols. Wireless Local Loop technologies. UNIT 4 MOBILE NETWORK LAYER AND TRANSPORT LAYER 9 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. UNIT 5 ADHOC WIRELESS NETWORKS 9 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. TOTAL 45 TEXT BOOKS Jochen Schiller, Mobile Communications, Addison Wesley , 2000. C.Siva Ram Murthy and B.S Manoj Ad hoc Wireless Networks, Pearson Education, 2007. REFERENCE BOOKS 1. Mobile Computing Principles-Reza BFar-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

CS0427

NETWORK SECURITY Prerequisite Nil

L 3

T 0

P 0

C 3

PURPOSE This course provides a way to understand the various security techniques in network.

85

INSTRUCTIONAL OBJECTIVES 1. Encryption techniques and key generation techniques 2. Authentication and security measures 3. Intrusion and filtering analysis UNIT 1 CONVENTIONAL AND MODERN ENCRYPTION 10 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 RC4 Differential and linear cryptanalysis Placement of encryption function traffic confidentiality UNIT 2 PUBLIC KEY ENCRYPTION 10 Number Theory Prime number Modular arithmetic Euclids algorithm - Fermets and Eulers theorem Primality Chinese remainder theorem Discrete logarithm Public key cryptography and RSA Key distribution Key management Diffie Hellman key exchange Elliptic curve cryptography UNIT 3 AUTHENTICATION 8 Authentication requirement Authentication function MAC Hash function Security of hash function and MAC SHA - HMAC CMAC - Digital signature and authentication protocols DSS UNIT 4 SECURITY PRACTICE 9 Authentication applications Kerberos X.509 Authentication services - E-mail security IP security - Web security UNIT 5 SYSTEM SECURITY 8 Intruder Intrusion detection system Virus and related threats Countermeasures Firewalls design principles Trusted systems Practical implementation of cryptography and security TOTAL 45 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/6857Fall2003/CourseHome/index.htm
L 3 T 0 P 0 C 3

CS0429

FAULT TOLERANT COMPUTING 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

86

2. 3.

Fault tolerant design and Fail safe design Designing testable combinational logic circuits

UNIT 1 BASIC CONCEPTS 9 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. UNIT 2 FAULT TOLERANT DESIGN 9 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. UNIT 3 SELF CHECKING CIRCUITS & FAIL SAFE DESIGN 9 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. UNIT 4 DESIGN FOR TESTABLE COMBINATION LOGIC CIRCUITS 9 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. UNIT 5 DESIGN OF TESTABLE SEQUENTIAL CIRCUITS 9 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. TOTAL 45 TEXT BOOK Parag K. Lala, Fault Tolerant and Fault Testable, Hardware design PHI 1985. REFERENCE BOOKS 1. LALA, Digital systems design using PLDs, PHI 1990. 2. N. N. Biswas, Logic Design theory, PHI 1990. 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

CS0431

WINDOWS INTERNALS Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 OVERVIEW OF WINDOWS 8

87

Windows 2000 overview- DLLs Multiple file system, Windows 2000 fundamentals- Programming perspective, Components of window, windows 2000 Applications Basics, Windows 2000 skeleton. UNIT 2 MENUS, CONTROLS AND PROGRAMS 10 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. UNIT 3 TEXT AND CONTROLS 10 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. UNIT 4 MULTITASK VS MULTIPROGRAM 9 Multi Programming, multi tasking concepts, Thread-based Multitasking, Using Header month, calendar control programs, Property sheets & Wizards. UNIT 5 WINDOWS HELP PROGRAMMING AND DLL SECURITY 8 Context Sensitive vs Reference Help, WM_Help, WinHelp demonstration program, printer device context, system registry and creation of screen savers, DLLs and Security. TOTAL 45 TEXT BOOK 1. Windows 2000 Programming from ground up, published by Tata McGraw-Hill Herbert Schildt 2002. REFERENCE BOOKS 1 Win32 API Programming with Visual Basic, published by O'Reilly and Associates, Inc. Steve Roman - 1999 (Chapter 9) (Unit -1) 2 Developing Drivers with the Microsoft Windows Driver Foundation Penny Orwick; Guy Smith - 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-theGround-Up www.mbalat.blogspot.com/2007/01/how-to-secure-windows-2000-xp.html www.codepedia.com/1/Herbert+Schildt www.ecampus.com/isbnbrowser2/isbnstart/00721

CS0433

LINUX INTERNALS Prerequisite Nil

L 3

T 0

P 0

C 3

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 .

UNIT 1 INSTALLING LINUX AS A SERVER

88

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. UNIT 2 SINGLE HOST ADMINISTRATION 9 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. UNIT 3 INTERNET SERVICES 9 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. UNIT 4 INTRANET SERVICES 9 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. UNIT 5 LINUX PROCESS CONTROL & SHELL PROGRAMMING 9 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 TOTAL 45 TEXT BOOK 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/

CS0435

COMPUTER VISION Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 IMAGE FORMATION AND IMAGE MODELS 9 Geometric Camera Models - Geometric Camera Calibration - Radiometry - Measuring Light Shadows and shading - Color

89

UNIT 2 EARLY VISION - MULTIPLE IMAGES 9 The Geometry of Multiple Views - Stereopsis - Affine Structure from Motion - Projective Structure from Motion UNIT 3 MID LEVEL VISION 9 Segmentation by Clustering - Segmentation by Fitting a Model - Segmentation and Fitting using Probabilistic Methods - Tracking with Linear Dynamic Models UNIT 4 HIGH LEVEL VISION GEOMETRIC METHODS Model-Based Vision - Smooth Surfaces and their Outlines - Aspect Graphs -Range Data 9

UNIT 5 HIGH LEVEL VISION -PROBABILISTIC AND INFERENTIAL METHODS 9 Recognition by Relations between Templates - Geometric Templates from Spatial Relations Application Image Based Rendering TOTAL 45 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/

CS0437

ADVANCED JAVA PROGRAMMING Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION TO ADVANCED JAVA 8 Java Streaming Components and events handling Threading concepts Networking features Byte code interpretation Media Techniques. UNIT 2 JAVA APPLETS AND BEANS 9 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. UNIT 3 ADVANCED NETWORKING 10 Client-Sever computing Sockets Content and Protocols handlers Developing distributed applications RMI Remote objects Object serialization UNIT 4 JAVA DATABASE PROGRAMMING 9 Connecting to Databases JDBC principles Databases access Interacting Database search Accessing Multimedia databases Database support in Web applications.

90

UNIT 5 RELATED JAVA TECHNIQUES 9 3D graphics JAR file format and creation Internationalization Swing Programming Advanced Java Scripting Techniques. TOTAL 45 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

CS0439

COMPONENT BASED TECHNOLOGY Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 COM BASICS 9 Components-Components benefits-components requirements-COM-interface-implementing COM interfaceBehinds interface-Query interface- Query interface rules and regulating- query interface defines the componenthandling new versions of components- Dynamic linking-Distributed COM. UNIT 2 ADVANCED CONCEPTS OF COM 9 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. UNIT 3 JAVA VS CORBA 9 Benefits of java programming with CORBA CORBA overview-object management group- object management architecture, CORBA OMG IDL UNIT 4 JAVA ORB 9 Overview of java and java ORBs- 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.

UNIT 5 SERVICES AND EVENTS

91

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 conceptsNotifications service-Java events and CORBA. TOTAL 45 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

CS0441 / IT0362

INFORMATION STORAGE AND MANAGEMENT Prerequisite Nil

L 3

T 0

P 0

C 3

PURPOSE Information Storage and Management has highly developed into a sophisticated pillar of information technology, provides a variety of solutions for storing, managing, accessing, protecting, securing, sharing and optimizing information. INSTRUCTIONAL OBJECTIVES After successful completion of the course, the students should be able to Evaluate storage architectures, including storage subsystems, DAS, SAN, NAS, CAS Define backup, recovery, disaster recovery, business continuity, and replication Examine emerging technologies including IP-SAN Understand logical and physical components of a storage infrastructure Identify components of managing and monitoring the data center Define information security and identify different storage virtualization technologies UNIT 1 9 Introduction to Information Storage Management - Intelligent Storage System - Direct Attached Storage - Introduction to SCSI - Introduction to parallel SCSI,SCSI Command Model Storage Area Networks - Fiber Channel Connectivity, Login types, Topologies. UNIT 2 9 Network-Attached Storage- General purpose servers vs NAS Devices - Benefits of NAS,NAS File I/O - NAS Components, Implementation, File Sharing protocols, I/O operations - IPSANISCSI, Components of ISCSI- Content-Addressed Storage UNIT 3 9 Fixed Content and Archives, Types, Features, Benefits, CAS Architecture, object storage and Retrieval, examples - Storage Virtualization-forms of virtualization, SNIA Taxonomy Storage virtualization configurations, challenges, Types of storage virtualization - Business Continuity

92

UNIT 4 9 Information Availability, BC Terminology, Life cycle, Failure analysis - Backup and RecoveryBackup purpose, considerations, Backup Granularity, Recovery considerations- Backup methods, process, backup and restore operations ,Securing the Storage infrastructure UNIT 5 9 Storage security framework, Risk triad - Managing the storage infrastructure ,Monitoring the storage infrastructure, storage management activities. Total 45 REFERENCES : 1. EMC Corporation, Information Storage and Management, WileyIndia, 9788126521470. 2. Robert Spalding, Storage Networks: The Complete Reference, Tata McGraw Hill , Osborne, 2003. 3. Marc Farley, Building Storage Networks, Tata McGraw Hill ,Osborne, 2001. 4. Meeta Gupta, Storage Area Network Fundamentals, Pearson Education Limited, 2002.

93

ELECTIVES FOR EIGHTH SEMESTER L 3 T 0 P 0 C 3

CS0422

ATM NETWORKS 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. UNIT 1 INTRODUCTION 9 ATM Historical perspective Protocol Architecture Logical connections Cells Transmission of ATM cells SDH /SONET architecture. UNIT 2 ATM PROTOCOL 9 Routing,Switching,Signaling techniques- ATM Service categories QOS parameters ATM Adaptation Layer. UNIT 3 ROUTING ISSUES 10 Routing for high speed networks RSVP, Traffic and Congestion control Traffic shaping Peak cell rate algorithms Rate based congestion control Connection admission control. UNIT 4 HIGH SPEED LANS Fast Ethernet ATM LANs LAN Emulation(LANE) 7

UNIT 5 PROTOCOLS OVER ATM 10 Multiple protocols over ATM, IP over ATM, TCP over ATM Real time transport protocol Wireless ATM Current trends. TOTAL 45 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 3 T 0 P 0 C 3

CS0424

DATA MINING 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.

94

UNIT 1 INTRODUCTION Data Mining Tasks, Data mining Issues,Decision warehousing,Data warehousing,OLAP & its tools,OLTP

Support

System,Dimentional

9 Modelling,Data

UNIT 2 MINING TECHNIQUES & CLASIFICATION 9 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) UNIT 3 CLUSTERING AND ASSOCIATION RULES 9 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) UNIT 4 ADVANCED MINING 9 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 UNIT 5 DATA MINING ENVIRONMENT 9 Case study in building business environment, Application of data mining in Government, National datawarehouse and case studies TOTAL 45 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 & techniwues,Academic press,Morgan Kanf Man Publishers,2003. ONLINE REFERENCE http://www.data-miners.com/ L 3 T 0 P 0 C 3

CS0426

GRID COMPUTING 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 UNIT 1 INTRODUCTION AND OVERVIEW OF GRID COMPUTING 9 Early Grid Activities-Current Grid Activities-An Overview of Grid Business Areas-Grid Applications-Grid Infrastructure UNIT 2 WEB SERVICES AND RELATED TECHNOLOGIES 9 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 UNIT 3 DISTRIBUTED OBJECT TECHNOLOGY FOR GRID COMPUTING (OGSA) 9 Introduction to Open Grid Services Architecture(OGSA)- Commercial Data Center- National Fusion Collaboratory- The OGSA Platform Components

95

UNIT 4 OPEN GRID SERVICES INFRASTRUCTURE (OGSI) 9 Introduction-Grid Services-A High-Level Introduction to OGSI Introduction to Service Data Concepts Grid Service: Naming and Change Management Recommendations. UNIT 5 OGSA BASIC SERVICES AND THE GRID COMPUTING TOOLKITS 9 Common Management Model(CMM)-Security Architecture- GLOBUS GT3 Toolkit: Architecture- GLOBUS GT3 Toolkit: - Architecture, Programming model, High level services . TOTAL 45 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 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 GRID STANDARDS AND ORG The Web Services Resource Framework: OASIS: http://www.oasis-open.org/ WSRF Technical Committee: http://www.oasisopen.org/committees/wsrf/charter.php Globus: http://www.globus.org From the Oasis WSRF Pages: The WSRF TC takes, as its starting point, the set of specifications and the papers: http://www.ibm.com/developerworks/library/ws-resource/ws-modelingresources.pdf http://devresource.hp.com/drc/specifications/wsrf/ModelingState-1-1.pdf The WS-Resource Framework (http://www.ibm.com/developerworks/library/ws-resource/ws-wsrf.pdf, http://www-106.ibm.com/developerworks/library/ws-resource/ws-wsrf.pdf, http://devresource.hp.com/drc/specifications/wsrf/WSRF_overview-1-0.pdf) recently published by IBM, the Globus Alliance, HP, Fujitsu and CA. The above papers describe how state associated with a Web service can be modeled in terms of a WS-Resource and give an overview of the specifications that comprise the framework. World Wide Web Consortium (W3C): http://www.w3.org

CS0428

AGENT BASED SYSTEMS Prerequisite Nil

L 3

T 0

P 0

C 3

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

96

UNIT 1 BASICS 9 Basics: definitions of agency; properties of agents; agents vs. objects- Agent Architectures: reactive/deliberative/hybrid agents; BDI and practical reasoning agents; deductive reasoning agents. UNIT 2 RATIONAL REASONING 9 Rational Reasoning: decision-theoretic/game-theoretic foundations- bounded rationality; means-ends reasoning - planning UNIT 3 INTERACTION Interaction: non-communicative interaction; agent communication languages; interaction protocols. 9

UNIT 4 AGENT COORDINATION 9 Agent coordination: distributed problem solving, planning and task sharing; teamwork and coalition formation; negotiation (game-theoretic/heuristic/argumentation-based); matchmaking and brokering. UNIT 5 ADVANCED TOPICS 9 Advanced Topics: distributed search/distributed constraint satisfaction; multiagent learning; agent-oriented software engineering; trust/norms/institutions, organisational approaches. TOTAL 45 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 CS0430 HUMAN COMPUTER INTERACTION Prerequisite Nil 3

T 0

P 0

C 3

PURPOSE 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 UNIT 1 FOUNDATIONS 9 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 UNIT 2 SOFTWARE PROCESS & DESIGN RULES 9 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

97

UNIT 3 IMPLEMENTATION & USER SUPPORT 9 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. UNIT 4 COGNITIVE, COMMUNICATION & COLLABORATIVE MODELS 9 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 UNIT 5 UBIQUITOUS COMPUTING, HYPERTEXT, WWW 9 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. TOTAL 45 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

CS0432

REAL TIME SYSTEM DESIGN Prerequisite Nil

L 3

T 0

P 0

C 3

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 3. Integration of Hardware and software in real time applications UNIT 1 INTRODUCTION 9 Basic real time concepts - Introduction, Real-time Versus Conventional Software, Computer Hardware for Monitoring and Control, Software Engineering Issues. UNIT 2 DESIGN TECHNIQUES 9 Real time specification and design techniques structure of an RTOS - real time kernels intertask communication and synchronization. UNIT 3 MEMORY MANAGEMENT Real time memory management. System performance analysis and optimization. 9

UNIT 4 QUEUING MODELS AND FAULT TOLERANT ARCHITECTURES 9 Queuing models Reliability,testing and fault tolerance, HW/SW faults, diagnosis, functional testing . Fault tolerant architectures: TMR systems - multiprocessing systems.

98

UNIT 5 APPLICATIONS Hardware/Software integration, real time applications- case studies

TOTAL 45 TEXT BOOKS 1. Laplante Philip.A, Real-time systems design and analysis: An engineers 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

CS0434

PATTERN RECOGNITION Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 7 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 Fishers discriminant functions. UNIT 2 STATISTICAL PATTERN RECOGNITION 10 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. UNIT 3 CLUSTER ANALYSIS 8 Unsupervised learning Clustering for unsupervised learning and classification C-means algorithm Hierarchical clustering procedures Graph theoretic approach to pattern clustering Validity of clustering solutions. UNIT 4 SYNTACTIC PATTERN RECOGNITION 8 Elements of formal grammar String generation as pattern description Recognition of syntactic description Parsing Stochastic grammar and applications Graph based structural representation. UNIT 5 FEATURES EXTRACTION AND RECENT ADVANCES 12 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. TOTAL 45

99

TEXT BOOK 1. Robert J, Schalkoff, Pattern Recognition: Statistical, Structural and Neural Approaches, Wiley & Sons Inc., New York, 1992.

John

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 3 T 0 P 0 C 3

CS0436

ROBOTICS 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 UNIT 1 MICROCONTROLLERS IN ROBOTS 9 Support Components Memory and Device Programming Interrupts Built in Peripherals Interfacing the controller to Robots UNIT 2 SOFTWARE DEVELOPMENT 9 Source files, Object Files, Libraries, Linkers and Hex files Assemblers Interpreters- Compilers Simulators and Emulators Integrated development Environments UNIT 3 THE MICROCHIP PICmicro(R) MICROCONTROLLER 7 Different PICmicro MCU devices and features application development tools Basic circuit requirements The PIC16F627 EL Cheapo PICmicro MCU Programmer Circuit UNIT 4 THE MICROCONTROLLER CONNECTIONS 12 Hardware Interface Sequencing Robot C Programming Template Protyping with the PICmicro Microcontroller Intercomputer Communications RS 232Hyperterminal 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 UNIT 5 BRINGING ROBOTS TO LIFE 9 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 TOTAL 45

100

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 CS0438 DECISION SUPPORT SYSTEMS Prerequisite Nil 3 T 0 P 0 C 3

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 UNIT 1 INTRODUCTION 9 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 DSSs- Decision and Decision Makers : Decision Makers- Decision styles- Decision effectiveness- Hardness of Decisions UNIT 2 DECISION MAKING 9 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 UNIT 3 DECISION PROCESSES 9 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. UNIT 4 SYSTEM PERSPECTIVE OF DSS 9 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

101

UNIT 5 IMPLEMENTATION OF DSS 9 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 TOTAL 45 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

CS0440

BIO INFORMATICS Prerequisite Nil

L 3

T 0

P 0

C 3

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 UNIT 1 INTRODUCTION 9 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. UNIT 2 DNA and PROTEIN SEQUENCES 9 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. UNIT 3 ALIGNMENT OF PAIR OF SEQUENCES 9 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. UNIT 4 MULTIPLE SEQUENCE ALIGNMENT 9 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.

102

UNIT 5 PROTEIN CLASSIFICATION & STRUCTURE PREDICTION 9 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 TOTAL 45 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

CS0442

BLUETOOTH TECHNOLOGY Prerequisite Nil

L 3

T 0

P 0

C 3

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. UNIT 1 THE BLUETOOTH MODULE 9 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. UNIT 2 THE LINK CONTROLLER 9 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. UNIT 3 THE BLUE TOOTH HOST 9 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. UNIT 4 CROSS LAYER FUNCTIONS 9 Cross layer functions-Encryption and security-low power operations-controlling low power modes-hold modesniff mode-park mode-quality of service-managing Bluetooth devices.

103

UNIT 5 TEST AND QUALIFICATION 9 Test and qualification- test mode-qualification and type approval-implementation related standards and technologies. TOTAL 45 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 3 T 0 P 0 C 3

CS0444

SOFTWARE RELIABILITY Prerequisite Nil

PURPOSE This course gives a thorough knowledge of providing software reliability. INSTRUCTIONAL OBJECTIVES 1. Software Reliability. 2. Reliability approaches 3. Reliability models UNIT 1 INTRODUCTION TO RELIABILITY ENGINEERING 9 Reliability Repairable and Non Repairable systems Maintainability and Availability Designing for higher reliability Redundancy MTBF MTTF MDT - MTTR k out of in systems UNIT 2 INTRODUCTION TO SOFTWARE RELIABLITY 9 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 UNIT 3 SOFTWARE RELIABILITY APPROACHES 9 Fault Avoidance Passive Fault detection Active Fault Detection Fault Tolerance - Fault Recovery Fault Treatment UNIT 4 SOFTWARE RELIABILITY MODELING 9 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 UNIT 5 SPECIAL TOPICS IN SOFTWARE RELIABLITY 9 Management Techniques for reliability - Organization and Staffing Programming Languages and Reliability Computer Architecture and Reliability Proving Program correctness & Reliability Design - Reliability Testing Reliability Economics. TOTAL 45 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.

104

3. 4.

Pradhan D K (Ed.): Fault tolerant computing Theory and Techniques, Vol1 and Vol 2 , Prentice hall, 1986. 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

CS0446

FIREWALL ARCHITECTURE Prerequisite Nil

L 3

T 0

P 0

C 3

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. UNIT 1 NETWORK SECURITY 9 Internet firewalls- Internet services security strategies least privilege- Defense in depth - choke point weakest link fail safe stance universal-Participation simplicity. UNIT 2 FIREWALL TECHNOLOGIES AND ARCHITECTURE 9 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. UNIT 3 FIREWALL DESIGN 9 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. UNIT 4 PROXY SYSTEMS AND BASTION HOSTS 9 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. Case study - screened subnet architecture merged routers and bastion host. UNIT 5 MAINTAINING FIREWALLS 9 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. TOTAL 45 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

105

CS0448

OPTIMIZATION TECHNIQUES Prerequisite Maths II & III

L 3

T 0

P 0

C 3

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 UNIT 1 OPTIMIZATION MODELS 9 Mathematical Modeling Design Optimization Feasibility and boundedness Topography of the design space Modeling data Modeling considerations prior to computation UNIT 2 MODEL BOUNDEDNESS 9 Bounds, Extrema and optima Constrained Optimum Underconstrained Models Recognizing Monotonicity Inequalities Equality constraints Nonmonotonic Functions UNIT 3 OPTIMA 9 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 UNIT 4 PARAMETRIC AND DISCRETE OPTIMA 9 Branching Parametric tests Functional monotonicity analysis Discrete design activity and optimality constraint derivation UNIT 5 COMPUTATIONS 9 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 TOTAL 45 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. 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/

106