B.e Computer Science And Engineering

THIAGARAJAR COLLEGE OF ENGINEERING: MADURAI - 625 015. B.E. Degree in CSE- Regular ( For Candidates admitted 2005-2006 Onwards ) Subjects of Study II SEMESTER COURSE CODE COURSE TITLE L T P Theory C21 C22 C23 C24 C25 C26 Practical C27 C28 C29

III SEMESTER COURSE CODE Theory C31 C32 C33 C34 C35 C36 C39 Practical C37 C38

C

Mathematics-I Electrical circuits Material Science Programming in C Electronic Devices Digital System

3 3 3 3 3 3

1 1 1 1 1 1

0 0 0 0 0 0

4 4 4 4 4 4

Electronic Devices and circuits Laboratory C Programming Laboratory Workshop Practices

0

0

3

2

0 0

0 0

3 3

COURSE TITLE

L

T

P

C

Mathematics-II Control Systems Computer architecture and Organization Object Oriented Programming Communication Systems Data Structures Professional Ethics

3 3 3

1 1 1

0 0 0

4 4 4

3 3 3 3

1 1 1 0

0 0 0 0

4 4 4 3

Digital Systems and architecture Laboratory

0

0

3

2

Data Structures in C++ Laboratory

0

0

3

2

2 2 Total : 30

Total : 31 IV SEMESTER COURSE CODE Theory C41 C42 C43 C44 C45 C46 C49

COURSE TITLE

L

T

P

C

Mathematics-III Java Programming System Software Operating Systems Microprocessors Computer Networks Professional Communication

3 3 3 3 3 3 1

1 1 1 1 1 1 1

0 0 0 0 0 0 1

4 4 4 4 4 4 2

Practical C47 C48

V SEMESTER COURSE CODE Theory C51 C52 C53 C54 C55 C56 C59 Practical C57 C58

VI SEMESTER COURSE CODE Theory C61 C62 C63 C64 C65 C66 C69 Practical C67 C68 VII SEMESTER COURSE CODE Theory C71 C72 C73 C74 C7X C7Y Practical C77 C78

OS and System Software Laboratory Microprocessor Laboratory

0 0

0 0

3 3

2 2 Total: 30

COURSE TITLE

L

T

P

C

Discrete mathematics Data Base Management systems Advanced Computer Architecture Principles of compiler design Design and Analysis of Algorithms High speed Networks and Quality of Service Total Quality Management

3 3 3 3 3 3 3

1 1 1 1 1 1 0

0 0 0 0 0 0 0

4 4 4 4 4 4 3

Network Laboratory DBMS Laboratory

0 0

0 0

3 3

2 2 Total : 31

COURSE TITLE

L

T

P

C

Operations Research Numerical Methods and number theory Object Oriented Analysis and Design Internet Programming and web design Software Engineering Distributed Computing Environmental Science

3 3 3 3 3 3 3

1 1 1 1 1 1 0

0 0 0 0 0 0 0

4 4 4 4 4 4 3

Internet Programming Laboratory Visual Programming Laboratory

0 0

0 0

3 3

2 2 Total: 31

COURSE TITLE

L

T

P

C

Network Security Software Testing Techniques Advanced databases Organizational Behavior Elective-I Elective-II

3 3 3 3 3 3

1 1 1 1 1 1

0 0 0 0 0 0

4 4 4 4 4 4

Applications development lab Using DB2 Software testing Laboratory

0

0

3

2

0

0

3

2 Total: 28

VIII SEMESTER COURSE CODE Theory C81 C8X C8Y Practical C84

COURSE TITLE

L

T

P

C

Wireless Network Technologies Elective-III Elective-IV

3 3 3

1 1 1

0 0 0

4 4 4

Project and viva-voce(review starts from Semester 7)

0

0

18

12 Total : 24

Total Credit to be earned for the award of degree: 235 THIAGARAJAR COLLEGE OF ENGINEERING: MADURAI - 625 015. B.E. Degree in - Regular (For Candidates admitted from 2004 Onwards) SCHEME OF EXAMINATIONS II SEMESTER Sl. No

Sub Code

Name of the Subject

Duration of Exam in Hrs

THEORY 1 2 3 4 5 6

C21 C22 C23 C24 C25 C26

7

C27

8 9

C28 C29

Mathematics-I Electrical circuits Material Science Programming in C Electronic Devices Digital System PRACTICALS Electronic Devices and circuits Laboratory C Programming Laboratory Workshop Practices

3 3 3 3 3 3

Name of the Subject

Duration of Exam in Hrs

Marks

Continuous Terminal assessment Exam. 30 70 30 70 30 70 30 70 30 70 30 70

Max. Marks

Minimum for Pass

100 100 100 100 100 100

Terminal Total Exam 35 50 35 50 35 50 35 50 35 50 35 50

3

30

70

100

35

50

3 3

30 30

70 70

100 100

35 35

50 50

Max. Marks

Minimum for Pass

100 100 100

Terminal Total Exam 35 50 35 50 35 50

III SEMESTER Sl. Sub Code No.

THEORY 1 2 3

C31 C32 C33

4 5

C34 C35

Mathematics-II Control Systems Computer architecture and Organization Object Oriented Programming Communication Systems

3 3 3 3 3

Marks

Continuous Terminal assessment Exam. 30 70 30 70 30 70 30 30

70 70

100 100

35 35

50 50

6 9

C36 C39

Data Structures Professional ethics

3 3

30 30

70 70

100 100

35 35

50 50

7

C37

8

C38

PRACTICALS Digital Systems and architecture Laboratory Data Structures in C++ Laboratory

3

30

70

100

35

50

3

30

70

100

35

50

IV SEMESTER Sl. Sub Code No.

Name of the Subject

Duration of Exam in Hrs

THEORY 1 2 3 4 5 6

C41 C42 C43 C44 C45 C46 C49

7 PRATICALS 8 C47 9

C48

Marks

Continuous Terminal assessment Exam. 30 70 30 70 30 70 30 70 30 70 30 70 30 70

Max. Marks

Minimum for Pass

100 100 100 100 100 100 100

Terminal Total Exam 35 50 35 50 35 50 35 50 35 50 35 50 35 50

Mathematics-III Java Programming System Software Operating Systems Microprocessors Computer Networks Professional Communication

3 3 3 3 3 3 3

OS and System Software Laboratory Microprocessor Laboratory

3

30

70

100

35

50

3

30

70

100

35

50

V SEMESTER Sl. No.

Sub Code

Name of the Subject

Duration of Exam in Hrs

THEORY 1 2 3 4 5 6

C51 C52 C53 C54 C55 C56

7

C59.

8 9

C57 C58

VI SEMESTER

Marks

Continuous Terminal assessment Exam. 30 70 30 70 30 70 30 70 30 70 30 70

Max. Marks

Minimum for Pass

100 100 100 100 100 100

Terminal Total Exam 35 50 35 50 35 50 35 50 35 50 35 50

Discrete mathematics Data Base Management systems Advanced Computer Architecture Principles of compiler design Design and Analysis of Algorithms High Speed Networks and Quality of Service Total Quality Management PRATICALS

3 3 3 3 3 3 3

30

70

100

35

50

Network Laboratory DBMS Laboratory

3 3

30 30

70 70

100 100

35 35

50 50

Sl. Sub Code No.

Name of the Subject

Duration of Exam in Hrs

THEORY 1 2

C61 C62

3

C63

4

C64

5 6 7

C65 C66 C69

8 9

C67 C68

Operations Research Numerical Methods and number theory Object Oriented Analysis and Design Internet Programming and web design Software Engineering Distributed Computing Environmental Science PRACTICALS Internet Programming Laboratory Visual Programming Laboratory

3 3

Marks

Continuous Terminal assessment Exam. 30 70 30 70

Max. Marks

Minimum for Pass

100 100

Terminal Total Exam 35 50 35 50

3

30

70

100

35

50

3

30

70

100

35

50

3 3 3

30 30 30

70 70 70

100 100 100

35 35 35

50 50 50

3 3

30 30

70 70

100 100

35 35

50 50

VII SEMESTER Sl. Sub Code No.

Name of the Subject

Duration of Exam in Hrs

THEORY

Marks

Continuous Terminal assessment Exam. 30 70 30 70

Max. Marks

Minimum for Pass

100 100

Terminal Total Exam 35 50 35 50

1 2

C71 C72

Network Security Software Testing Techniques

3 3

3 4 5 6

C73 C74 C7X C7Y

3 3 3 3

30 30 30 30

70 70 70 70

100 100 100 100

35 35 35 35

50 50 50 50

7

C77

3

30

70

100

35

50

8

C78

Advanced databases Organizational Behavior Elective-I Elective-II PRACTICALS Applications development lab Using DB2 Software testing Laboratory

3

30

70

100

35

50

VIII SEMESTER Sl. Sub Code No.

Name of the Subject

Duration of Exam in Hrs

THEORY 1

C81

Wireless Network Technologies

3

2

C8X

Elective-III

3

Marks

Continuous Terminal assessment Exam. 30 70 30

70

Max. Marks

Minimum for Pass

100

Terminal Total Exam 35 50

100

35

50

3

C8Y

4

C84

Elective-IV PRACTICALS Project and viva-voce(review starts from Semester 7)

3

30

70

100

35

50

3

150

150

300

75

150

LIST OF ELECTIVES FOR B.E CSE VII & VIII SEMESTER Specialization Subject code

B.E. (CSE)

Lecture

Tutorial

Practice

Credit

C7X/8X

3

1

0

4

VII Semester C7A

Network Management

C7B

Data mining and warehousing

C7C

Software Project Management

C7D

Free-Open Source Software

C7E

Artificial Intelligence

C7F

Electronic Commerce

C7G

Embedded Systems

C7H

Multimedia Systems

VIII Semester C8A

Convergent Technology

C8B

Knowledge Engineering and Management

C8C

Software Quality management

C8D

Operating System Design

C8E

Neural Networks

C8F

Enterprise Resource Planning

C8G

Parallel Computing

C8H

Multimedia Compression

Specialization Subject code

B.E. (CSE) C21

Lecture 3

Tutorial 1

Practice 0

Credit 4

C21 MATHEMATICS – I Unit I Multiple Integrals Double Integration, Cartesian and Polar Coordinates, Change of order of Integration, Area as a double integral, triple integration in Cartesian coordinates, Change of Variables between Cartesian and Polar coordinates and between Cartesian and Cylindrical Spherical polar Coordinates. (10 periods) Unit - II Vector calculus Gradient - divergence and curl –Line, Surface and volume integrals Green's,Gauss,Stoke's theoremsimple problems.(with out Proof). Verification of above theorems and evaluation of integrals using them . (10 periods) Unit - III Analytic Functions Function of a complex variable, Analytic function, Necessary Conditions, Cauchy Riemann equations in Cartesian and Polar coordinates, Sufficient conditions (all without proof) Properties of Analytic Function, Determination of harmonic conjugate by Milne Thomson method, Conformal mapping az + b, Z2, 1/z, ez, sin z, cos z, az +b /cz+ d, Schwartz Christoffel Transformation. (10 periods) Unit – IV Complex Integration: Statement and application of Cauchy’s theorem and Cauchy’s integral formula, Taylor and Laurent expansion, Singularities, Classification, Residues, Cauchy’s Residue Theorem, Contour Integration, Unit Circle and Semi Circular Contours (excluding Poles on real axis). (10 periods) Unit V Laplace Transformation Laplace Tranform, Sufficient Conditions,Transforms of elementary functions - properties inverse transforms , Transforms of derivatives and integrals - derivatives and integrals of transforms convolution theorem - Transform of periodic functions , Laplace transform of Dirac Delta and Unit Step function ,Second shifting theorem-Application to solution of linear differential equation – Constant coeffiecient , variable coefficient, simultaneous differential equations, Integral equations, initial and final value theorems (10 periods) Text Book: 1.Grewal,B.S.,Higher Engineering Mathematics,Khanna Publishers, New Delhi, 1998. ReferenceBooks: 1.Veerarajan .T , “Engineering Mathematics(for First Year) “ , Second Edition , Tata Pub , Co.Ltd, NewDelhi , 2002.

McGraw – Hill

2.Venkatraman,M.K.,Engineering Mathematics, Vol II, III, National Publishers, Chennai,1997. 3.Kandasamy,P.Thilagavathi,K.,Gunavathy,K.,Engineering Mathematics, Vol II, III, S.Chand & Co, New Delhi,1997.

Specialization Subject code

B.E. (CSE) C22

Lecture

Tutorial

3 1 C22 Electrical Circuits Unit I METHODS OF CIRCUIT ANALYSIS

Practice

Credit

0

4

Kirchoff voltage Law – Kirchoff Current Law – Mesh Analysis-Super mesh Analysis – Super mode Analysis – Source Transformation Technique- Star Delta Transformation. (10 periods) Unit II Theorems in Circuit Analysis Superposition Theorem – Thevenin’s Theorem – Norton’s Theorem – Reciprocity Theorem – Compensation Theorem – Maximum Power Transfer Theorem – Principle of Duality – Dual Networks – Millman’s theorem. (10 periods) Unit III AC Analysis Generation of Alternaring EMF – Average and RMS values – Peak and Form Factor of various Waveforms – alternating EMF applied to circuits involving R, L and C – Pharos representation of alternating Quantities – Power and Power Factor – Simple Problems involving series and parallel circuits - series and parallel resonance. (10 periods) Unit IV Coupled Circuits Mutual Inductance – coefficient of coupling – Self and Mutual Inductance. Transients: Differential Equation – Applications to electrical circuits – Steady state and Transient Response – DC Response of RL, RC and RLC Circuits. (10 periods) Unit V Network Functions and Parameters Terminal ports – Network Functions for one port and two port – Ladder Network – General Networks – Poles and Zeroes of Network Functions – Relationship of two port variables – Open Circuit impedance Parameters – Short Circuit Admittance Parameters – Hybrid parameters – Inverse Hybrid Parameters – Transmission Parameters. (10 periods) Text book: 1.Sudhakaran.A and ShyamMohan .S.P , Circuits and Networks – Analysis and Synthesis , Tata Mcgraw Hill , 1995. 2.M.Arumugam and N.PremaKumar , Electric Circuit Theory , Khanna Publishers , New Delhi , 1996. Reference: 1.Joseph A.Edminister, Electrical Circuits, Schaums Outline Series , Asian Students Edition , 1983. 2.hayt and Kemmaly, engineering Circuit Analysis,McGraw Hill, 1985. 3.V.K.Aatre, Network Theory and Filter Design, Wiley Eastern Publishers, 1993. 4.Umesh Sinha, Network Analysis and Synthesis, Satya Prakasham, 1997.

5.Van Valken Berg, Network Analysis, John Wiley and Sons, 1996.

Specialization Subject code

B.E. (CSE) C23

Lecture 3

Tutorial 1

Practice 0

Credit 4

C23 Material Science Unit – I Conducting Materials : Free electron theory of metals – Relaxation time – Mathiiessen’s conductivity – Wiede – mann Franz law – Mobility of Charge Current – Hall Effect – Hall Voltage – Hall Coefficient Determination. Semiconducting Materials: Elemental Semiconductors – Intermetallic III-V Compounds – Compound Semiconductors – Oxides – Organic Semiconductors. (10 periods) Unit – II Magnetic Materials: Langevin Theory of Diamagnetism & Paramagnetism – Weiss Theory of Ferromagnetism – Domain Structure – Hard and Soft Magnetic Materials – Ferrites and Their Uses. Super Conducting Materials: Meissner Effect – Josephson Effect (Both AC & DC) – BCS Theory on Superconductors – Application of Superconductors – High Temperature Super Conducting Materials. (10 periods) Unit – III Dielectric Materials: Introduction to Dielectrics – Dielectric Parameters – Different Types of Polarization (Electronic, Ionic and Dipolar) – Clausius – Mosotti Equation – Dielectric Breakdown – Dielectric Losses. Energy Conversion Devices and Thin Films: Photo Voltaic Effect – Solar Cells and its Applications – Fuel Cell (Qualitative Study Only) – Thin Films – Electron Beam Deposition Method – Sputtering Method – Applications. (10 periods) Unit – IV Optical Properties: Introduction – Optical Absorption Coefficient – Ionic Conduction – Optical Refractive Index and Relative Dielectric Constant – Optical Absorption in metals, Insulators and Semiconductors – Color Centers – Optical Fibers – Glass Fibers and Plastic Fibers – Application. Optical Sensors: Illuminence – Irradiance – Photovoltaic Sensors – Photo Emissive ensors – Photoconductive Sensors – Luminescence – Fluorescence – Phosphorescence. (10 periods) Unit – V Smart Materials: Introduction to Smart Materials – Generation of Smart Materials – Multifunctional Materials – Intelligent Materials – Sensors, Actuators and Processors – Intelligent Materials and Humanity – Sensing Technologies – Micro Sensors – Applications of Smart Materials, Shape Memory Alloys, Electro Theological Fluids and Photochromics Materials. Text Books: 1. Charles Kittel, Introduction to Solid State Physics, John Wiley and Sons, 1997. (Unit – I, II, III & IV) 2. M.V.Gandhi and S.S.Thompson, Smart Materials and Structures, Chapman & Hall, London, 1992 (Unit – V) Reference: 1. S.O.Pillai, Solid State Physics, New Age International (P) Limited, 2000 2. Azaraf and Brophy. J, “Electronic Process in Materials”, McGraw Hill, 1963. 3. S.P.Suhatme, Solar Energy, McGraw Hill, New Delhi, 1990.

Specializations Subject code

B.E. (CSE) C24

Lecture 3

Tutorial 1

Practice 0

Credit 4

C24 PROGRAMMING IN C Objectives : To make the student to understand the concepts in C programming language and enable them to develop good programming skills. Unit – I Getting Started with C – Decision Control Structures – Loop Control Structures – Case Control Structures – Functions – Data types Revisited. The Left Overs – Enumerated Data type, Uses of Enum, Renaming Data type with typedef, Type casting, Bit fields, Functions with variable number of arguments. (10 periods) Unit – II C Preprocessors – Features of C Preprocessor, Macro Expansion, File Inclusion, Conditional Compilation, Miscellaneous Directives Arrays – More On Arrays, More than One dimension - Initializing a two dimensional array, Memory Map of a two dimensional array, Passing 2 D array to a function Pup petting On Strings – More about Strings, Standard Library String Functions, Two Dimensional Array of Characters. Structures – Why use structures, Array of Structures, Additional Features of Structures, Uses Of Structures (10 Periods) Unit – III I/O in C – Types of I/O, Console I/O Functions, Disk I/O Functions, I/O Redirection, I/O under Windows Interaction with H/W in C – DOS Approach, ROM – BIOS, CPU Registers, Interrupts and Interrupt Vector Table, Invoking ROM – BIOS Functions, Unions,int86() Function, Interrupts to Access ROM – BIOS Services, DOS Function Requests, Interaction with HW using Port I/O. The Windows Approach., Operation on bits – Mouse Programming (10 periods) Unit – IV An Introduction to pointers – Pointers and Arrays – Passing Array Elements to a Function, Pointers and Arrays, Passing an Entire Array to a Function, Multidimensional array, Pointers and Two Dimensional Arrays, Array of Pointers, Pointers and Strings-Standard Library Functions, Two Dimensional Array Of characters, Array of Pointers to Strings, Limitation of Array of Pointers to Strings (10 periods) Unit – V Pointers and Structures – An Array of Structures, Structure Pointer, Dynamic Memory Allocation, Linked Lists, Stacks and Queues, Doubly Linked Lists, Pointers and Data Structures – Merging of Linked Lists, Linked Lists and Polynomials, Circularly Linked List, Trees, Binary Trees, Traversal of a binary tree, Deletion of a Binary tree, Threaded Binary Tree, Pointers Miscellany (10 periods)

Textbook: 1. Let Us C – Yeshiva Kantar –BPB Publications –4th Edition (Unit – I, II, III) 2. Understanding Pointers in C – Yeshiva Kantar – BPB Publications – 2nd Edition (Unit IV, V) Reference books: 1.Brain W.Kernighan and Ritchie – ANSI C Programming, PHI 19902.Peteric A. Darnell and Philip E.Margolis A software Engg Approach – Naraosa Publishing House -1993

Specialization Subject code

B.E. (CSE)

Lecture

Tutorial

Practice

Credit

C25

3

1

0

4

C25 ELECTRON DEVICES (Common to ECE, EEE, CSE, IT, Mechatronics Branches) Unit I : Semiconductor Diode: Semiconductor Diode- Ideal Diode- Resistance Levels- Equivalent Circuits- Transition and Diffusion Capacitances- Reverse Recovery Time- Zener Diodes- Diode ArraysLoad line analysis – Diode Approximations – Series Diode Configurations with DC inputs _ Parallel and Series-parallel Configurations – Light Emitting Diodes, Schottkey – Varactor, Power, Tunnel Diode (10 Periods) Unit II : BJT and Biasing : Transistor and construction – Operation – Common Base, Common Emitter, Common Collector Configurations – Transistor and amplifying action – Operation Limits- Transistor Testing – Operating Point – Fixed Bias – Emitter Bias - Voltage Divider Bias Circuits – Bias Stabilization Thermal runaway- Thermistor, Sensistor compensation, heat sink (10 Periods) Unit III : FETs and Biasing : Field Effect Transistors – Construction and Characteristics- Transfer Characteristics – Relationships – Depletion type MOSFET- Enhancement Type MOSFET- VMOSCMOS- Fixed Bias, Self Bias, and Voltage Divider Bias Configurations – P channel FETs – Universal JFET Bias Curve. (10 Periods) Unit IV: Special Semiconductor Devices : Photo Diodes – Photo Conductive cells- IR Emitters- Liquid Crystal Displays – Solar cells – Thermistor – SCR – Operation Characteristics and Applications- GTOSCS- Shockely diodes- Laser activated SCR –DIAC- TRIAC – UJT- Photo Transistors – Opto IsolatorsProgrammable UJT- Charge coupled device – Piezoelectric device (10 Periods) Unit V : Applications : Half wave Rectifier – Full wave Rectifier – Capacitor Filter - RC Filter Zener, Transistor Voltage Regulators – IC Voltage Regulators. Clippers – Clampers – Voltage Multiplier Circuit, Diode AND, OR gates- Transistors as switch – Relay Driver – Voltage level Indicator – FET VVR – Timer Network – FET in Fiber Optic system – SCR, TRIAC crow bar circuit, phase control circuit. Textbook: Robert L.Boylested, Louis Nashelksy “ Electron Devices and Circuit Theory”, Eighth Edition, Person Education Asia 2002. Reference Books: 1. Faculty of Network Institutions, “ Analog Electronics”, Project Network Engineering Series, 2004. 2. Albert Paul Malvino, “ Electronic Principles”, Tata McGraw Hill, 2002. 3. David A.Bell, “Electronic Devices and Circuits”, Fourth Edition, Prentice Hall India, 1999.

4. Millman and Halkias, “Electron Devices and Circuits”, Tata McGraw Hill, 2003. 5. Donald L. Schilling, Charles Belove "Electronic Circuits: Discrete and Integrated” McGraw Hill, 2000.

Specialization Subject code

B.E. (CSE) C26

Lecture 3

Tutorial 1

Practice 0

Credit 4

C26 DIGITAL SYSTEMS Objective: It is aimed at developing the skills to work effectively in specialized areas such as industrial automation, communications and process control. It also emphasizes on hardware descriptive languages (Alter Max + Plus II, Logic Works IV), which promotes portability. UNIT-I Number systems, Combinational system design, Development of truth tables, Don’t care conditions. Switching algebra and logic circuits:- Definition, Basic properties of switching algebra, Manipulation of algebraic functions, Implementation of functions with AND,OR,NOT gates, From the truth table to algebraic expressions, Introduction to Karnaugh map, Complement and product of sums, NAND, NOR & Ex-OR gates, Simplification of algebraic expression, Manipulation of algebraic functions and NAND gate implementations. A more general Boolean algebra (10 periods)

UNIT-II Karnaugh map, Algorithm minimization technique, Delay in combinational logic circuits, Adders, Decoders, Encoders, Priority encoders, Multiplexers, Three state gates, Gate arrays-ROM’s, PLA’s and PAL’s-Designing with ROM’s- Designing with PLA’s – Designing with PAL (10 periods) UNIT-III Sequential systems-Latches and flip-flops-Design process for synchronous sequential systems-Analysis of sequential systems- Flip-flop design techniques-Design of synchronous counters-Design of asynchronous counters-Derivation of state tables and State diagrams (10 periods) UNIT-IV Solving larger sequential problems-Shift registers, counters, Programmable Logic devices-Design using ASM diagrams-Hardware design language (10 periods)

UNIT-V Simplification of Sequential circuits: - Tabular method for state reduction, Partitions, State reduction using partition, choosing a state assignment. (10 periods) TEXT BOOK: Introduction to logic design, Alan B.Marcovitz, Tata Mc Graw Hill , 2002 REFERENCE BOOK: Ronald J.Tocci , Digital systems Principles and Applications ,6/ePHI,1996

Specialisation Subject code

B.E. (CSE) C27

Lecture 0

Tutorial 0

Practice 3

Credit 2

Practice 3

Credit 2

C27 Electronic Devices and Circuits Lab 1.

Verification of Circuit laws(Kirchoff’s laws..)

2.

Verification of theorems (Thevinin.Norton’s)

3.

Measurement of R,L,C,Q

4.

Parallel/Series resonance

5.

PN Diode,Zener characteristics

6.

Wave shaping Circuits(Clipper/Clamper)

7.

Half wave Rectifier,Full wave Rectifier

8.

BJT,FET characteristics

9.

SCR/DIAC/Triac

10. LED/LDR/PHOTO TRANSISTOR characteristics 11. Optocoupler characteristics 12. Transistor,diode voltage regulators

Specialization Subject code

B.E. (CSE) C28

Lecture 0

Tutorial 0

C28 C PROGRAMMING LABORATORY 1.

C program for Fibonacci Series, Finding the sum of set of numbers, Generation of Prime Numbers

2.

Matrix Manipulation –Addition, Subtraction, Multiplication, Inverse Using Functions

3.

C Program for sorting numbers and strings using arrays and pointers

4.

Program for string operations like String copy, strcat using pointers

5.

Program to illustrate bit wise operations

6.

Program to illustrate Macro Expansion, Conditional Compilation.

7.

Program to illustrate array of Structure.

8.

Program to illustrate Pointers to function.

9.

Program to illustrate Pointer to pointers.

10. Program to read a file and display the contents to screen 11. Program to read a set of lines from the keyboard and write into the specified file 12. Program to store and retrieve the structure elements in a specified file

13. Program such as finding the memory size using int86 () 14. Program for creating new files with read/write permission codes, reading a given file and displaying the contents using low level file operation Specialization Subject code

B.E. (CSE) C31

Lecture Tutorial 3 1 C31 MATHEMATICS – II

Practice 0

Credit 4

Objective: To emphasize the development of rigorous logical thinking and analytical skills. Based on this course to give adequate exposure to theory and applications of Fourier series, Fourier transforms,PDE and BVP UNIT – I Fourier Series Dirichlet’s condition, General Fourier series, half range sine and cosine series, Parseval’s identity, harmonic analysis, complex form of Fourier series, double Fourier series, simple problems (10 Periods) UNIT - II Fourier Transformation Fourier integral theorem,- Fourier transforms - Fourier sine and cosine transforms – PropertiesConvolution theorem, Parseval’s identity, Introduction to Discrete time Fourier Transform and fast Fourier transform, simple problems (10 Periods) UNIT - III Partial Differential Equations Formation, solution of standard types of first order equations, Lagrange’s linear equation, linear Partial differential equation of second and higher order with constant coefficient (10 Periods) UNIT - IV Boundary Value Problems Classification of second order linear partial differential equations, one-dimensional wave equation, one dimensional heat equation, solution by Fourier series and Fourier transform method (10 Periods) UNIT - V Boundary Value Problems (Contd.) Steady state solution of two dimensional heat equations in Cartesian coordinates, solution by Fourier series and Fourier transform method. Laplace equation in polar coordinates ,solution by Fourier series method. (10 Periods)

Text books : 1.Grewal, B.S., 2001.

Higher Engineering

Mathematics,

36th Edition ,Khanna

Publishers, New Delhi,

Reference Books: 1.Veerarajan,T Engineering Mathematics,(for semester III) 2nd edition Tata MCGrawHill Pub .Co.Ltd NewDelhi 2002 1.Kandasamy , P.Thilagavathi, K.Gunavathi, K., Engineering Mathematics, 4th revised edition, S.Chand & Co., New Delhi, 2000. 2.Venkatraman, M.K .Engineering Mathematics, 4th edition, National Publishers, Chennai., 2003. 4.Erwin Kreyszig,”Advanced Engineering mathematics” 8th edition John wieley&Sons,2001 Specialization Subject code

B.E. (CSE) C32

Lecture 3

Tutorial 1

Practice 0

Credit 4

C32 CONTROL SYSTEMS Objective: To provide basic knowledge about the mechanisms in control system unit – I Basic Concepts and Representation : Terminology – Open loop and Closed loop Control Systems – Transfer function Representation – Block Diagram Representation – State Space Representation – Signal flow graph Representation – Block Diagram Reduction (10 Periods)

Unit – II Time Domain Analysis : Standard Test Signals – Time Response of First order and Second Order Control Systems subjected to Unit Step input – Performance Specifications – Steady State Error – Static and Dynamic Error Constants (10 Periods) Unit – III Frequency Domain analysis : Introduction – Frequency domain Specifications – Correlation between time and Frequency response – Bode Plot Stability : The concept of Stability – Routh Hurwitz Stability criterion – Stability Assessment through Bode plot (10 Periods) Unit – IV State Variable Analysis : Introduction – Concepts of State – State Space Representation using Physical variables – Derivation of Transfer Function from State model – Diagonalisation – Eigen Values and Eigen Vectors – Solution of State Equation – Controllability and Observability (10 Periods) Unit – V Digital Control Systems : Introduction – Digitization – Principles of signal Conversion – Review of Z transforms relation between Laplace and Z transform, S plane and Z plane Advanced Control Systems : Non Linear Control – System Identification with Neural Networks – Designing a Fuzzy Logic Controller (10 Periods)

Text Book: 1. I.J.Nagrath, M.Gopal, “Control System Engineering”, Tata McGraw-Hill, III Edition, 2004. 2. M.Gopal, “State Variables and Digital Control Methods”, Tata McGraw-Hill, 1997. References:

1. M.Gopal, “Control System Principles and Design”, Tata McGraw-Hill, 1998. 2. Kuo, “Digital Control Systems”, Second Edition, Oxford University press, 1992. 3. Ogatta.K. “Modern Control Engineering”, Prentice hall of India, II edition, 1997. 4. Franklin G.F, J.David Powell, Michael Worleman, “ Digital Control of Dynamic Systems”3rd Edition, Addison Wesley, 2000.

Specialization Subject code

B.E. (CSE) C33

Lecture 3

Tutorial 1

Practice 0

Credit 4

C 33 COMPUTER ARCHITECTURE AND ORGANISATION Objective: To provide a basis knowledge in the organization and the architecture of the Computer. UNIT – I Basic Structure of Computers – Functional Units – Basic Operational Concepts – Bus Structures – Software – Performance – Multiprocessors and Multicomputers. Machine Instructions and Programs - Memory Locations and Addresses - Memory Operations – Instructions and Instruction Sequencing – Addressing Modes – Basic Input/Output Operations – Stacks and Queues – Subroutines. (10 Periods)

UNIT – II Basic Processing Unit – Some Fundamental Concepts – Execution of Complete Instruction – Multiple-Bus Organization – Hardwired Control – Micro programmed Control. Arithmetic – Addition and Subtraction of Signed Numbers – Multiplication of Positive Numbers – SignedOperand Multiplication – Fast Multiplication – Integer Division. (10 Periods) UNIT – III Memory System – Some basic Concepts – Semiconductor RAM Memories – Read-Only Memories – Cache Memories – Virtual Memories – Memory Management Requirements. (10 Periods) UNIT – IV I/O Organization – Accessing I/O devices – Interrupts – Direct Memory Access – Buses – Interface Circuits – Standard I/O Interfaces. (10 Periods) UNIT – V Pipelining – Basic Concepts – Data Hazards – Instruction Hazards – Super scalar Operation – Performance Considerations. (10 Periods)

TEXT BOOK: 1.Carl Hamacher, Zvonko Vranesic, Safwat Zaky, " Computer Organization ", Tata McGraw Hill, Fifth Edition, 2002. REFERENCE BOOKS: 1. David A. Patterson, john L. Hennessy, “ Computer Organization and Design” , Morgan Kauffmann Publishers, Third Edition, 2005. 2. John P Hayes, " Computer Architecture and Organization ", Tata McGraw Hill, Second Edition.

Specialization Subject code

B.E. (CSE) C34

Lecture 3

Tutorial 1

Practice 0

Credit 4

C34 OBJECT ORIENTED PROGRAMMING IN C++ Objective: To understand the basic concepts of object oriented programming and to enable the student to write object oriented program. UNIT – I Introduction – Object oriented technology- Disadvantages of conventional technology – Programming paradigms – Perfect to OOP – Key concept of OOP – Advantages of OOP – Object oriented languages. Input and output in C++ - Streams - Buffering – Stream classes – Unformatted console I/O – Member functions of Istream class – Formatted console I/O – Bit fields – Manipulators. Data types in C++ - Basic, derived and user defined data types – Type modifiers – Type casting – Constants – Constant pointers (10 Periods) UNIT – II Operators – Precedence levels – Referencing and dereferencing operators – Scope access – Memory management operators – Comma operator – review of control structures- Function in C++ - Parts of function – Passing arguments – Return by reference – Default arguments – Inline functions – Function overloading. Structures – Classes – Declaring objects – Public, private and protected keywords – Member functions – Data hiding or encapsulation – Classes, objects and memory – Static member variables and functions – Static object – array of objects – object as arguments – friend functions (10 Periods) UNIT – III Constructors – copy constructors – constructors with default arguments – Calling constructors and destructors – Qualifier and nested classes – anonymous objects.

Keyword operator – over loading un array operators – operator return type – over loading binary operators – over loading with friend function – Type conversion. (10 Periods) UNIT - IV Access specifiers and simple inheritance – Types of inheritances – virtual base classes – Constructors and destructors – object as a class member – abstract classes – Qualifier classes and inheritance – pointers and inheritance – Advantages and disadvantages of inheritance. Pointers – declaration –this pointer – pointer to class – pointer to object – pointer to derived and base class – pointers to members – accessing private members – arrays – characteristics and initialization (10 Periods)

UNIT - V Virtual functions and pure virtual functions – array of pointers – abstract classes – Bonding – Introduction to templates – class and function templates – Principle of exception handling – Exception handling mechanism. Introduction with files-file stream classes-steps of file operations-checking for errors and end of fileopening modes-file pointers and manipulators-sequential read and write-random access operation. (10 Periods) Text Book: Object oriented programming with ANSI and Turbo C++, Ashok N. Kamthane, Pearson Education, New Delhi , Second Indian Reprint,2004.

Specialization Subject code

B.E. (CSE) C35

Lecture 3

Tutorial 1

Practice 0

Credit 4

C35 COMMUNICATION SYSTEMS Objective: An Engineering student needs to have some basic knowledge about the communication system and the modes of communication, which this subject helps. UNIT – I Electronic Communication systems – Modulation and Demodulation- Electromagnetic Spectrum – Bandwidth and Information Capacity – Transmission Modes – Circuit arrangements – Signal analysis – Mixing – Noise analysis. (10 Periods) UNIT – II Principles of AM – AM Modulation circuits – AM transmitters – Receiver Parameters-AM Receivers. (10 Periods) UNIT – III SSB systems – Introduction to SSB transmitters and receivers – Angle modulation – Phasor representation of an angle modulated wave – Average Power – Pre emphasis and De emphasis – Frequency and Phase modulators – Angle Modulation versus Amplitude modulation – Introduction to FM Demodulators. (10 Periods) UNIT – IV Transverse electromagnetic waves – Types of transmission lines – Transmission line wave propagation – Terrestrial Propagation of Waves – Basic Antenna Operation – Antenna reciprocity – Basic and special purpose antennas. (10 Periods) UNIT – V Introduction to Optical Fiber Communications – System Block Diagram – Fiber Types – Light Propagation – Optical Fiber Configurations – Introduction to Optical Sources and detectors. (10 Periods) Text Book: Wayne Tomasi , Electronic Communication Systems Fundamentals through Advanced, Pearson Education, 4th Edition, 2003. Reference Books: 1.Dennis Roddy and John Coolen, Electronic Communications, PHI, 1995(Unit I,II,V) 2.George Kennedy,Benard Davis,Electronic Communication Systems, 4/e,TMH,1999.(Unit III,IV).

Specialization Subject code

B.E. (CSE) C36 C36

Lecture 3

Tutorial 1

Practice 0

Credit 4

DATA STRUCTURES

Objective: To make the student understand the various data structures involved in programming. Unit-I The Role of Algorithms in Computing:- Analyzing algorithms-running time calculations. Elementary Data Structures:- Lists: List ADT, array implementation, linked lists, doubly and circularly linked lists, sorted

linked lists, inheritance and virtual functions, The stack ADT : model, implementation, applications – The Queue ADT : Model, implementation, applications. (10 Periods) Unit-II Trees : Preliminaries: implementation of trees , tree traversals - Binary trees: implementation , expression trees - The search tree ADT – Binary search trees: make_ empty, find, insert, remove - AVL trees : single rotation, double rotation, Splay trees : splaying , Tree traversals- B-Trees (10 Periods) Unit-III Hashing : Hash function, open hashing, closed hashing: Linear probing, quadratic probing, double hashing – Rehashing – extendible hashing. Priority Queues: Model – simple implementation – Binary Heap : structure property, heap order property, heap operations – Applications of priority queues – d-Heaps – Leftist Heaps : property, operations- Skew heaps- Binomial Queues: structure, operations, implementation. (10 Periods) Unit-IV Sorting : Insertion sort, a lower bound for simple sorting algorithms – shell sort – heap sort – merge sort – quick sort – sorting large objects – a general lower bound for sorting – bucket sort – external sorting – The Disjoint set ADT : equivalence relations , dynamic equivalence problem, smart union algorithms, path compression. (10 Periods) Unit-V Graph Algorithms:-Representation of graphs- topological sort – shortest path algorithms – network flow problems – minimum spanning tree – applications of depth-first search – introduction to NP-completeness (10 Periods) Text Book: 1. Data Structure & Algorithm Analysis in C++ by Mark Allen Weiss, Pearson Education Asia, 2000. Reference Books: 2. Introduction to Algorithms by Thomas H. Conmen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, PHI, New Delhi-110 001, 2002 edition 3. Algorithms in C++ by Robert Sedgwick, Pearson Education Asia, 2002.

Specialization Subject code

B.E. (CSE) C37

Lecture 0

Tutorial 0

Practice 3

C37 DIGITAL SYSTEMS AND ARCHITECTURE LABORATORY Objective: To help the student understand the basics of Computer Architecture.

1.

Study of logic gates design

2.

Design &testing of half &full adder circuit

3.

Design &testing of parity generator &checker circuit

4.

Design &testing of multiplexer & demultiplexer

5.

Design &testing of coder &decoder

6.

Design &testing of code converters

Credit 2

7.

Design &testing of binary multiplier

8.

Design &testing of magnitude comparator

9.

Study of flip flops

10. Design &testing of ripple counters 11. Design &testing of synchronous counters 12. Design &testing of sequence detector 13. Design of Look ahead carry generator.

14. Design of simple ALU. Specialization Subject code

Total No. of Periods : 50

B.E. (CSE) C38 C38

Lecture 0

Tutorial 0

Practice 3

Credit 2

DATA STRUCTURES IN C++ LABORATORY

Objective: To help the students understand the data structures concepts 1.

Implementation of Linked List

2.

Operations on Doubly Linked List and Circular List.

3.

Implementation of Stack

4.

Using STACK to check matching left and right characters such as parentheses, curly braces and square brackets in a given string

5.

Implementation of Queue

6.

Implementation of Circular Queue & Double Ended Queue

7.

Single server queuing system and gathering statistics

8.

Recursion (Solving Towers of Hanoi problem using Recursion)

9.

Binary Tree Implementation with Insertion and Deletion

10. Implementation of Binary Search Tree 11. Representation of Sparse Matrix 12. Implementation of Graph Traversal Techniques

Total No. of Periods : 50 Specialization Subject code

B.E. (CSE) C39 C39

Lecture 3

Tutorial 0

PROFESSIONAL ETHICS

Objective: To learn the importance of Ethics in Life as Engineers. Unit I ENGINEERING ETHICS

Practice 0

Credit 0

Senses of 'Engineering Ethics' - variety of moral issues - types of inquiry - moral dilemmas - moral autonomy -Kohlberg’s theory -Gilligan’s theory - consensus and controversy - professions and professionalism – professional ideals and virtues - theories about right action - self-interest-customs and religion - uses of ethical theories (10 Periods) Unit II ENGINEERING AS SOCIAL EXPERIMENTATION Engineering as experimentation - engineers as responsible experimenters - codes of ethics-a balanced outlook on law-the challenger case study (10 Periods) Unit III ENGINEER'S RESPONSIBILITY FOR SAFETY Safety and risk - assessment of safety and risk - risk benefit analysis-reducing risk-the three mile island and Chernobyl case studies. (10 Periods) Unit IV RESPONSIBILITIES AND RIGHTS Collegiality and loyalty - respect for authority - collective bargaining - confidentiality - conflicts of interest -occupational crime - professional rights - employee rights - intellectual property rights (ipr)discrimination. (10 Periods) Unit V GLOBAL ISSUES Multinational corporations - environmental ethics-computer ethics-weapons development-engineers as managers-consulting engineers-engineers as expert witnesses and advisors-moral leadership-sample code of conduct. (10 Periods) Text Book: 1. Mike Martin and Roland Schinzinger, "Ethics in Engineering", McGraw Hill, New York 1996. References : 1. Charles D.Fleddermann, "Engineering Ethics", prentice Hall, New Mexico, 1999. 2. Laura Schlesinger, "How Could You Do That: The Abdication of Character, Courage, and Conscience”, Harper Collins, New York, 1996. 3. Stephen Carter, "Integrity", Basic Books, New York, 1996. 4.Tom Rusk, "The Power of Ethical Persuasion: From Conflict to Partnership at Work and in Private Life”, Viking, New York, 1993 Specialization Subject code

B.E. (CSE) C41

Lecture 3

Tutorial 1

Practice 0

Credit 4

C41 MATHEMATICS - III UNIT – I Statistics & Probability: Linear Correlation and regression Curve fitting, method of least squares, continuous probability distributions, Normal, Gamma, Beta, Chi-square, Weibull, exponential & Hyper – geometric distribution. (10 periods) UNIT – II Tests of Hypothesis: Hypothesis testing, Testing hypothesis involving means & proportions, comparison of small samples & large samples, t-test, z-test, comparison of variances, F test, Test of Goodness of fit Chisquare test, Contingency table included.

(10 periods) UNIT – III Calculus of variations: Functional, Euler’s equation, Functional involving higher order derivatives, several dependent variables, Geodesics, Isoperimetric problems, Raleigh – Ritz method. (10 periods) UNIT – IV Boundary Value Problems in ODE: Use of weighted residual techniques, Ritz method, Collocation method, Moment method, Least square technique, Galerkin’s method, Partition method, Use of Titz finite element method in solving BVPs in ODE, simple problems. (10 periods) UNIT –V Graph Theory: Basic definitions in graph, paths, trial, circuits, Trees, Properties distance and center in a tree, Tooted and binary trees, Spanning trees, Adjacency matrix, Incidence matrix. (10 periods) Text Books: 1. 2. 3. 4.

Veerarajan, T., Probability, statistics and random processes, Tata McGraw Hill, 2002 (For Unit I & II). Grewal, B.S., “Higher Engineering Mathematics”, Thirty Sixth Edition, Khanna Publishers, Delhi, 2001. (For Unit III) M.K. Jain “Numerical Solution of Differential Equations” New Age International Publication 2000. (For Unit IV). Narasingh Deo, Graph Theory with applications PHI 1998 (For Unit V)

Specialization Subject code

B.E. (CSE) C42

Lecture 3

Tutorial 1

Practice 0

Credit 4

C42- JAVA PROGRAMMING Objective: To understand the concepts for programming in Java Unit-I The Genesis of Java-An Overview of Java - Data types, Variable and Arrays - Operators- Control statements. (10 Periods) Unit II Fundamentals –declaring objects-Constructors class, This key word-Garbage collection - Overloading methods-Overloading constructors-using objects as parameters-arguments passing-access control-StaticFinal-Nested and Inner Classes (10 Periods) Unit III Inheritance – Packages and Interface - Exception Handling - Multithreaded programming – I/O Basis, Reading console input - Writing console output - Reading and Writing files, (10 Periods) Unit IV Input output : Files, Stream Class, Byte streams, Character streams , Serialization - Networking

(10 Periods) Unit V The Applet class –Event Handling – Introducing AWT : Working with Windows , Graphics and Text – Using AWT controls, Images. (10 Periods) Text books: 1. 2.

Herbert Schildt, Java 2 The complete reference, TMH, 2002. Ken Arnold, James Gosling, The JAVA language, II edition, Addison Wesley, 1998.

Specialization Subject code

B.E. (CSE) C43 C43

Lecture 3

Tutorial 1

Practice 0

Credit 4

SYSTEM SOFTWARE

Objective: To provide a basic knowledge in the concepts of System Software . Unit – I Introduction-System software and machine architecture –Simplified Instructional computer - machine architecture- Programming – Traditional machine – CISC – VAX – Pentium Pro – RISC machines – UltraSPARC – PowerPC – Cray T3E (10 Periods) Unit – II Assemblers-Basic functions – Assembler algorithm and Data structures – Machine dependent assembler features- Instruction formats – Addressing modes – Program relocation - machine independent assembler features- Design of assemblers – One pass – multipass assemblers - Implementation examples (10 Periods) Unit – III Loaders – Basic functions – Machine dependent loader features – Relocation – Linking - Machine independent loader features- Automatic library search – Loader options – Design of loader – Linkage editors – Dynamic linking – Bootstrap loaders Implementation examples(10 Periods) Unit - IV Macro Processors – Basic functions – Machine independent macro processor – concatenation –labels – macro expansion – macro parameters – Design of Macro processor - Recursive macro expansion – General purpose macro processors – Language translators – Implementation examples (10 Periods) Unit – V Formal systems and Programming Languages – Uses of Formal System in Programming Language – Formal Specification – Formal Grammars – Hierarchy of Languages – BNF – Canonic Systems and Formal Systems. (10 Periods) Text Book: 1) Leland L.Beck,” System Software”, Pearson Education, 3rd Edition, 2004 (Unit I to Unit IV) 2) John.J Donovan,”System Programming”,Tata McGraw Hill Edition,2000 (Unit V) Reference Book: 1) D. M. Dhamdhere,”Introduction to System Software”,Tata McGraw Hill, 1992 2) D. M. Dhamdhere,”System Programming & Operating Systems”, Tata McGraw Hill, 1995 Specialization

B.E. (CSE)

Lecture

Tutorial

Practice

Credit

Subject code

C44

3

1

0

4

C44 OPERATING SYSTEMS Objective: To understand the fundamental concepts in Operating Systems and enable the student to take up projects in the same. Unit – I Introduction – What is an Operating System – The Operating System Zoo-Operating System conceptsSystem calls-Operating System structure Processes- The process model-Process creation, termination, hierarchies-Process states-Implementation of processes. Threads-Thread model-Thread usage-Implementing thread in user space, Kernel-Scheduler activationsPop-up threads-Making Single threaded code Multithreaded. (10 Periods) Unit – II Introduction to Scheduling - Scheduling in batch systems-Interactive systems-Real time systems-Policy versus mechanism-Thread scheduling Interprocess communication-Race condition-critical regions-Mutual exclusion with busy waiting-sleep and wake-up-semaphores-mutexes-monitors-message passing. Classical problems-The dining philosopher’s problem-The readers and writers problem. (10 Periods) Unit – III Memory Management – Monoprogramming without swapping or paging-Monoprogramming with fixed partitions-Modeling Multiprogramming. Swapping-Virtual Memory-Page replacement algorithm-Modeling page replacement algorithms. Segmentation-Implementation of pure segmentation-Segmentation with paging :the Intel Pentium (10 Periods) Unit –IV Dead Locks – Resources-Introduction to deadlocks-Deadlock detection and recovery-Deadlock avoidanceDeadlock prevention-Other issues. File Systems-Files-naming,Structure,Types ,Access,Attributes,Operations. Directories- File system implementation. (10 Periods)

Unit – V Input/Output-Principles of I/o Hardware-Disk-Disk Formatting-Disk Arm scheduling. Case study:Unix-History of UNIX-Overview of Unix-Processes in Unix-Memory management in UnixThe Unix file system. (10 Periods) Text Book: Modern Operating Systems –Andrew S,Tanenbaum, 2nd Edition. Reference Books: Operating System concepts-Silberchatz Galvin 5th edition Operating Systems – Milenkovic Specialization Subject code

B.E. (CSE) C45

Lecture 3

Tutorial 1

Practice 0

Credit 4

C45 Microprocessors (Common to ECE, EEE, CSE, IT, Mechatronics Branches) Objective: To understand the concepts of Microprocessor and learn how it is applied in PC Unit I INTEL 16 bit microprocessors Register organization of 8086-architecture-Physical memory organizationIO addressing capability-Special processor activities- 8086 Instruction set and Assembler directives Addressing modes of 8086 Instruction set of 8086 Assembler directives and operator (10 Periods) Unit II Art of Assembly Language Programming with 8086: A Few Machine level Programs using ALP 8086 Programming with assembler, Assembly language example programs. Special architecture features and related programs Introduction to stack, stack structure of 8086, Interrupt and Interrupt services routines, Interrupt cycle of 8086, Non Maskable Interrupt, Mask able Interrupt, Interrupt Programming ( Software Interrupts), MACROS (10 Periods) Unit III Basic peripherals and their interfacing with 8086/8088 – Interfacing I/OOD Ports PPI ( Prog Peripheral Interface(8255), Modes of Operation of 8255, Special Purpose Programmable peripheral devices and their interfacing: Prog Interval Timer(8253),Prog Interrupt Controller (8259) INTEL 32 BIT MICROPROCESSORS: 80386 DX- silent features of 80386dx, Architecture of 80386 Register Organization of 80386, Addressing Modes Data types, Real addressing Modes, Protected mode of 8086 Segmentation ,Paging, Virtual 8086 Mode, Enhanced Instruction Set of 8086 (10 Periods) Unit IV Exploring Memory Hierarchy: Introduction ,basis of Cache, Measuring and Improving Cache Performance, Virtual Memory, A Common Framework for Memory Hierarchies, The Pentium 4 Memory Hierarchy Storage Networks and Other Peripherals Introduction, Disk Store and Depend- ability , Reliability and Availability RAID, Busses and Other Connections between Processors Memory and I/O Devices Fire wire 1394 , UNIVERSAL Serial Bus (USB2.0), Line printer Interfaces (LPT parallel port),Accelerated graphics port (AGP), THE Buses and Networks of Pentium 4, Memory controller (North Bridge I/OOD controller ( south bridge)based Intel chipsets, Interfacing i/o Devices to processors, Memory and Operation systems, Designing an I/O systems, A digital Camera. (10 Periods) Unit V Accessing and Understanding Performance Introduction, CPU Performance and its factors Evaluating performance, Two SPEC Benchmarks and the Performance of recent Intel Processors Enhancing Performance of Pipeline An Overview of pipeline basic Issues involved in pipeline :IA-32 based advanced microprocessor: Pentium onwards : Salient features of Pentium, A few relevant concepts of Computer Architecture, System Architecture, Branch Prediction, Enhanced Instruction set of PentiumMMX-

Multimedia extension, Intel MMX architecture MMX Data types warp around saturation arithmetic MMX Instruction set Comparison of Pentium PRO, Pentium II Pentium III and Pentium IV (10 Periods)

Text Books: 1. Advanced Microprocessor and peripherals – A K Ray , K M Bhurchandi TMH 2000.Sixteenth Reprint(Unit I,II,III & V) Reference book 1. Computer Organization and Design David A Patterson, John. L Hennessey –The Hardware / Software Interface ELSEVIER – Morgan Kaufmann Publishers – 2005 – Third Edition. (Unit IV and V): 2. Computer Organization Carl Hamacher, Zvonko Vranesic, Safwatzaky Mc Graw Hill International student Edition 2002 Fifth Edition. Specialization Subject code

B.E. (CSE) C46

Lecture 3

Tutorial 1

Practice 0

Credit 4

C46 COMPUTER NETWORKS (Common to ECE, EEE, CSE, IT, Mechatronics Branches) Objective: (i) To impart the basic knowledge in the area of computer networks and highlight the design issues in implementing the Network.(ii)To give an introduction to Network security and its applications Unit-I Fundamentals: Applications- Requirments: connectivity, cost effective resource sharing, And support for common service- Network architecture: Layering and protocols, OSI Architecture, Internet architecture, Protocol implementation issues.- Performance: Bandwidth and latency, Delay BW product, High speed networks, Application performance needs. (10 periods)

Unit – II

Direct link networks: Hardware building block: Nodes and links- Encoding- Framing: Byte and bit oriented protocols- Error detection: Internet checksum algorithm, CRC- Reliable transmission: stop and wait protocol, sliding window protocol- Ethernet and token rings: physical properties and access controlWireless Lan: Physical properties, collision avoidance and distribution system (10 periods) Unit – III Packet switching: Switching and forwarding: Datagram’s and VC switching- Bridges and LAN switches: Learning bridges, spanning tree algorithm, Implementation and performance: Ports and fabrics- Simple internetworking: Introduction, service model, global address, Datagram forwarding- Routing: Graph representation, RIP and OSPF- Global internet- Subnetting and CIDR. (10 periods) Unit – IV End to End protocols and Data: Simple Demultiplexer (UDP) – Reliable byte stream (TCP)- end to end issues, segment format, three way handshake- TCP extension- Remote procedure call – Date expressionlossless compression algorithms for image, video and audio : JPEG,MPEG, MP3. (10 periods) Unit– V Network security and Applications: Cryptographic algorithms: Requirements, DES, RSA and MD5Firewalls: Filter based and proxy based- DNS: Domain hierarchy, name servers and solutions.- Electronic mail, world wide web- Multimedia Applications: Real time transport protocol, session control and call control. (10 periods)

Text Book Larry L. Peterson and Bruce S. Davie, “Computer networks-A system Approach”, Third Edition, McGraw Hill Reference books: 1 CCNA3 and 4 companion guide, Third edition, Pearson education. 2 Andrew S.Tanenbaum, “Computer Networks”, Prentice Hall of India 3 Dimetri Bertsekas and Robert Gallager, “Data Networks”, PHI, 1994. Specialization Subject code

B.E. (CSE) C47 C47

Lecture 0

Tutorial 0

Practice 3

Credit 2

OS AND SYSTEM SOFTWARE LABORATORY.

Objective: To implement the basic concepts in System Software and Operating Systems 1.

Study of System Calls

2.

Symbol table Construction

3.

Single Pass Assembler

4.

Mutipass Assembler

5.

Absolute Loader

6.

Relocatable Loader

7.

Linker

8.

Macroprocessor

9.

Design of Lex and Yacc

10. File system simulation 11. Virtual memory simulation.

12. Simulation of Dead lock

Specialization Subject code

B.E. (CSE) C48

Total No. of Periods: 50

Lecture 0

Tutorial 0

Practice 3

Credit 2

C48 Microprocessor Laboratory Objective: To understand the basic concepts in Microprocessor and implement programs to verify the functionality of the interfaces Cycle 1 1.

Addition and Subtraction of 8 bit numbers.

2.

Multiply and Divide 8 bit numbers.

3.

Addition and Subtraction of 16 bit numbers.

4.

Multiply and Divide 16 bit numbers.

5.

Find the sum of the given array find its average.

6.

Find the largest/smallest number in a given array.

7.

Arrange the given numbers in ascending/descending sequence. Cycle 2

1. Moving of information from one location to another using function key as well as ALP.(FILL & MOVE) 2.

Write ALP to interface 8255 PPI to operate in various modes(I/O mode & BSR mode)

3.

Write ALP to interface 8253 PIT to operate in various modes(Two out of Six)

4.

Write ALP to interface DA/AD converters.

5.

Write ALP to interface Traffic light controller with microprocessor.

6.

Write ALP to interface stepper motor with Microprocessor.

7. Write an ALP to interface Microprocessor with PC. Specialization Subject code

B.E. (CSE) C51

Lecture 3

Tutorial 1

Total No. of Periods : 50 Practice 0

Credit 4

C51 DISCRTE MATHEMATICS Objective: The main objective of this course is to introduce most of the basic terminology used in advanced courses of computer science. The topic set theory, logic theory, Algebraic structures and Automata theory will be used in practical applications- particularly related to Computer Science. These topics support more advanced courses in Computer Science program such as Automata theory, Artificial Intelligence and software designing. UNIT I Mathematical Logic –Introduction-Statements and Notations-Negation-Conjunction-Disjunction-Truth table – Conditional – Biconditional-Tautologies-Equivalence of Formulas-Duality Law- Tautological Implications – Functionally Complete set of Connectives-Other Connectives- Two state Devices & Statement Logic –Normal Forms. (10 periods) UNIT II The Theory of Inference for the Statement Calculus-Validity Using Truth Table-Rules of InferenceConsistency of Premises and Indirect Method of Proof-Automatic Theorem proving – The Predicate Calculus-The statement Funtion,Variables and Quantifiers-Predicate Formulas-Free and Bound variablesThe Universe of Discourse-Inference Theory of the Predicate Calculus. (10 periods) UNIT III Set Theory- Basic concepts of Set Theory – Some Operations on Sets – Some Basic Set Identities-Ordered Pairs and n-tuples-Cartesian Products – Relations –Properties of Binary Relation-Relation Matrix and the Graph of a Relation-Partition and Covering of a Set- Equivalence Relations-Compatibility RelationsComposition of Relations-POset-Funtions-Definition-Composition of Funtions-Inverse Functions. (10 periods)

UNIT IV Finite Automata and Regular Expressions-Basic definitions-Nondeterministic finite automat-Einite Automata with e-moves – Regular expressions-Two-way finite automata-Finite automata with output. (10 periods) UNIT V Properties of Regular Sets-The pumping lemma for regular sets-Closure properties of regular sets-Contextfree grammars-Derivation trees-Chomsky normal form-Greibach normal form. (10 periods) Text Books: 1. J.P.Tremblay , R.Manohar,”Discrete Mathematical Structures with Applications to Computer Science,Tata McGraw-Hill,1997(Unit I,II & III) 2. John E.Hopcroft ,Jeffrey D.Ullman,”Introduction to Automata Theory, Languages and Computation,Narosa Publishing House,1997(Unit IV and V) Reference Books: 1. Dr.MK.Venkataraman,Dr.N.Sridharan & N.Chandrasekaran,”Discrete Mathematics”. The National Publishing Company ,Chennai. 2. Kenneth H.Rosen,”Discrete Mathematics and Its Applications” Fifth Edition, Tata McGraw- Hill Edition,2003.

Specialization Subject code

B.E. (CSE) C52

Lecture 3

Tutorial 1

Practice 0

Credit 4

C52 Data Base Management System Objective: To understand the fundamentals of databases and learn about resent trends. Unit 1 Introduction: purpose of database systems - View of data - Data Model - Database languages - Transaction Management - Storage management - DBA- Database Users - Overall System Structure. Entity Relationship Model: Basic Concepts - Design issues - Mapping Constraints - Keys - E-R Diagrams-Weak Entity Sets - Extended E-R Features - Design of an E-R Database Schema - Reduction to tables (10 Periods) Unit II Relational Model: Structure of Relational Databases - Relational Algebra - Tuple Relational Calculus Domain Relational Calculus - Extended Relational Algebra Operations - Modification of the Databases SQL: Basic Structure - Ste Operations - Aggregate Functions - Null Values - Nested Sub Quires - Derived Relations - Views - Modification Of Databases - Joined Relations - DDL - Embedded SQL - Other SQL Features. (10 Periods) Unit III Integrity Constraints: Domain Constraints - Referential Integrity - Assertions - Triggers - Functional Dependencies Relational Database Design: Pitfalls in database Design - Decomposition - Normalization using Functional Dependencies - Multi valued Dependencies - Join Dependencies - Domain Key Normal Form - Alternative Approaches (10 Periods) Unit IV Storage and File Structures: Physical Storage Media - Magnetic Disks - RAID - Tertiary Storage - Storage Access - File Organization - Organization of Records in Files - Data Dictionary - Storage. Indexing and Hashing: Basic Concepts - Ordered Indices - B+ Trees Index Files - Btree Index Files - Static Hashing - Dynamic Hashing - Comparison of Ordered Indexing and Hashing - Index Definition in SQL Multiple Key Access. (10 Periods) Unit V Transactions: Transactions Concepts - Transaction State - Implementation of Atomicity and Durability Executions. Concurrency Control: Lock Based Protocols. Case Study: BD2: Architecture - Process Models - Memory Modal - Storage Model - SQL Compiler. Controlling Data Access: Authentication - Authorities and Privileges - DB2 application Development Static and Dynamic Embedded SQL - Call Level Interface (CLI) - DB2 APIs - Java Interfaces. (10 Periods) Text Books: 1 Abraham Silberschatrtz, Henry Forth and S.Sudhersan - Database System Concepts - Third Edition McGraw Hill Edition (ch 1, 2, 3, 4, 6, 7, 10, 11, 12.1- 12.9, 14.1, 15.1- 15.4)- Units I to IV 2. George Baklarz and Bill Wong, DB2 Universal Database V7.1 Fourth Edition - Unit - V Reference Books: 1. Ragu Ramakrishnan, Database Management Systems, McGraw Hill Edition, 1998.

2. Ramez Elmasri and Samrath Navetha, Fundamentals of Database System, Addison Werely, 1994. 3 Thomas Connly Begg and Anne Strachan, Database Systems - A practical Approach to Design Implementation, Second Edition, Addison Weasly, 1998

Specialization Subject code

B.E. (CSE) C53 C53

Lecture 3

Tutorial 1

Practice 0

Credit 4

Advanced Computer Architecture

Objective: To give an exposure in the advanced topics of Computer architecture and Parallel computing models. Unit I Parallel Computing models-State of computing-Multiprocessor and multicomputers-PRAM and VLSI model-Program and Network properties-Conditions of parallelisms-Program partitioning and schedulingProgram flow mechanism-system interconnect architectures (10 Periods) Unit II Processors –Advanced processor technology-Superscalar and Vector processors-Vector processing principles-Multifactor multiprocessors-Compound vector processing-SIMD Computer organizationDataflow architectures. (10 Periods) Unit III Instruction Level Parallelism: Concepts and challenges-Overcoming Data Hazards and Dynamic Scheduling- Dynamic Scheduling: Examples and Algorithms-Reducing Branch costs with Dynamic Hardware prediction-High-Performance Instruction Delivery- Studies of Limitations on ILP. (10 Periods) . Unit IV Multiprocessors and Thread –Level Parallelism-Introduction-Characteristics of Application DomainsSymmetric Shared-Memory Architectures-Performance of Symmetric Shared memory MultiprocessorsDistributed Shared memory Architectures-Performance of Distributed Shared memory MultiprocessorsSynchronization-Models of Memory consistency: An introduction (10 Periods) Unit V Pipelining: Basic and intermediate Concepts-Introduction-The major hurdle of Pipelining-Pipeline hazardsHow is Pipelining implemented-What makes Pipelining hard to implement-Extending the MIPS Pipeline to handle Multicycle Operations- Crosscutting issues (10 Periods) Text Books: 1.John .L. Hennessy & David .A Patterson , Computer Architecture - A Quantitative Approach, Morgan Kaufmann Publishers, 3rd edition 2003.(Unit-III,IV and V) 2. Kai Hwang-Advanced Computer Architecture, MCGrawHill, Inc Ed; 1993,II series. (Unit-I,II) Reference Book: Heuring V.P., Jordan H.F., “Computer System Design and Architecture ",Addison Wesley, 1999.

Specialization Subject code

B.E. (CSE) C54

Lecture 3

Tutorial 1

Practice 0

Credit 4

C54 - Principles of Compiler Design Objective: To understand the concepts of compiler and learn how to design the various phases of a compiler for any high level language Unit I Introduction to compiling: Compilers, Analysis of the source program, Phases of a compiler, Cousins of a compiler, Grouping of Phases, Compiler – construction tools. A Simple one pass compiler: Overview, syntax definition, syntax-directed translation, Parsing, A translator for simple expressions. (10 Periods) Unit II Lexical Analysis: Introduction, Incorporating a symbol table, The role of the lexical analyzer, Input buffering, Specification of tokens , A language for specifying lexical analyzer, Finite Automata , From a regular expression to an NFA, Design of a lexical analyzer generator. (10 Periods) Unit III Syntax Analysis : The role of a parser, Context-free grammars, Writing a grammar, Top-down Parsing, Bottom-up parsing, Operator-precedence parsing , LR parsers. Type checking: Type systems, Specification of a simple type checker. (15 Periods) Unit IV Run-time environments: Source language issues, Storage organization, storage-allocation strategies. Intermediate Code Generation: Intermediate languages, Declarations, Assignment statements. Error Detection & recovery: Errors, Lexical-phase errors, Syntactic-phase errors, Semantic Errors. (10 Periods) Unit V Code Optimisation: The principal sources of optimisation, Loop optimization, The DAG representation of basic blocks, Dominators, Reducible flow graphs, Loop- invariant computation , Induction variable elimination. Code Generation: Problems in code generation, A simple code generator, Code generation from DAG’s , Peephole Optimisation. (10 Periods) Text Books: 1. Alfred V. Aho, Ravi Sethi, Jeffrey D Ullman – Compiler Principles, Techniques and Tools, Pearson Education – 2003. 2. Alfred V. Aho, Jeffrey D Ullman – Principles of Compiler Design, Narosa Publishing House – 2003. Reference Books: 1. Steven S. Muchnick – Advanced Compiler Design & Implementation – Harcourt Asia, Morgan Kaufmann – 2001. 2. J. P. Bennet - Introduction to Compiling Techniques- Tata McGraw-Hill Publishing- 2002.

Specialization Subject code

B.E. (CSE) C55

Lecture 3

Tutorial 1

Practice 0

Credit 4

C55DESIGN AND ANALYSIS OF ALGORITHMS Objective: To give an exposure on fundamental techniques which is used to design and analyze an efficient algorithm. Unit I Introduction – Mathematical Notation – proof Techniques – contradiction and Mathematical Induction.Generalized mathematical induction. Program Performance – Introduction – Space Complexity – Components of Space Complexity Time Complexity – Components of Time Complexity - Operation counts –Rank sort, Insertion sort, Bubble sort, Radix sort Selection sort-Step Counts-Matrix add,transpose,multiply- Asymptotic Notation (Ο,Ω,θ,ο), Practical Complexities, Performance Measurements (10 Periods) Unit II Elementary Algorithms – Introduction – Efficiency of Algorithms – Average and Worst Case Analysis.Binary search-Sequential search Analysis Of Algorithms: Analyzing Control Structures-Average Case Analysis-Amortized AnalysisPotential, Accounting, Aggregate methods-Solving Recurrences-Homogeneous recurrencesInhomogeneous recurrences-Change of variable-Range transformations-Asymptotic recurrences. (10 Periods) Unit III Greedy Algorithms: General Characteristics-Minimum Spanning Trees-Kruskal’s-Prim’s algorithmDijkstra’s Shortest Path algorithm-Knapsack Problem: Divide And Conquer: Introduction-Binary SearchSorting - Finding the Median-Matrix Multiplication- Exponentiation. (10 Periods) Unit IV Dynamic Programming: Introduction-Principle Of Optimality-Knapsack Problem-Shortest Paths- Chained Matrix Multiplication-Recursion-Memory Functions. Exploring Graphs: Traversing Trees – Depth First Search – Undirected and Directed Graphs - Breadth First Search - Back Tracking – Branch and Bound. (10 Periods) Unit V Computational Complexity: Introduction-Information Theoretic Arguments-Adversary Arguments-Linear Reductions-Reductions among matrix problems-Reductions among shortest path problems-Introduction to NP Completeness. -The classes P and NP-Polynomial reductions-NP-complete problems-NP completeness proofs-NP hard problems-Nondeterministic algorithms (10 Periods) Text Books: 1.Gilles Brassard and Paul Bratley-“Fundamentals Of Algorithmics”-PHI-1997. 2.Sahni-“Data Structures, Algorithms and Applications in C++.”,McGraw-Hill International Edition-2000. (Unit – I) Reference books: 1. Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest – Introduction of Algorithms , Prentice Hall of India, 1998. 2.Jeffrey J.McConnell-Analysis Of Algorithms-An active learning approach”-Narosa-2002 Specialization Subject code

B.E. (CSE) C56

Lecture 3

Tutorial 1

C56 High Speed Networks and Quality of Service

Practice 0

Credit 4

Objective: To understand the concepts in Advanced Network technology and learn about the research trends in Congestion control, flow control and QoS. Unit I Fast Ethernet-Gigabit Ethernet-MAC Sublayer-Physical layer-Implementation of physical layer-Fiber channel-Frame relay networks. (10 Periods)

Unit II Effects of congestion- Congestion and control- Traffic Management- Congestion control in Packet switching networks - frame relay Congestion control -The need for flow and error control- Link control mechanisms- ARQ Performance (10 periods) Unit III TCP traffic control - TCP flow control - Congestion control - performance of TCP over ATM. Exterior Routing Protocols and Multicast - Path vector protocols: BGP and IDRP -Multicasting. (10 Periods) Unit IV QOS in IP networks- Integrated services Architecture - Queuing discipline - Random Early Detection Differentiated services - RSVP - MPLS. (10 Periods) Unit V Introduction to IEEE802.11 standards-802.11 protocol stack-802.16 protocol stack-physical and MAC protocols-comparison of 802.11 with 802.16 DSL Technology - ADSL - Other DSL technologies - Cable modem - Traditional cable networks - HFC network - sharing - CM and CMTS - SONET - SONET devices - SONET frames - Frame Transmission STS-1-Higher rate services. (10 Periods) Textbook: (1) William Stallings, High-Speed Networks and Internet Performance and Quality of services, second edition, Pearson Asia Education, 2003.(Unit 1,2,3,4) References: (1) Andrew S.Tenenbaum, Computer networks, forth edition, Pearson Asia Edition, 2003. (2) Behroug a.Forozan, Data Communications and Networking, Third Edition, tata Mc Graw Hill,2004 Specialization Subject code

B.E. (CSE) C57

Lecture 3

Tutorial 1

Practice 0

Credit 4

C 57 : NETWORK LABORATORY Objective: To provide the basic knowledge in the socket programming and implement few concepts in network technology 1. Write a socket Program for implementing Echo/Ping/Talk commands. 2. Create a Socket (TCP) between two computers and enable file transfer between them. 3. Development of Multiprotocol(TCP and UDP) servers. 4. Create a socket for HTTP for web page upload and Download. 5. Write a program for implementing the connection establishment module in TCP . Write a program for File transfer in client -server architecture using following methods: a. Using RS232C b. TCP/IP 7. Write a program to implement RMI.

8. Write code simulating the following routing methodologies: a. Distance vector routing b. Link state Routing 9. Write a code simulating Sliding window flow control at the Data Link Layer. 10. Implementation of RSA algorithm

Specialization Subject code

B.E. (CSE) C58

Lecture 0

Tutorial 0

Practice 3

Credit 2

C58- DBMS Laboratory Objective: To provide practice in SQL and application development with Oracle and DB2.

1.

Writing DDL commands with foreign key and primary key constraints.

2.

Writing DML commands for nested sub queries.

3.

Creating store procedures using ORACLE.

4.

Creating triggers with ORACLE.

5.

Creation of functions and packages with ORACLE.

6.

Writing simple application with VB and ORACLE.

7.

Write simple Pay Roll application using Java and DB2.

8.

Writing store procedures using DB2.

9.

Writing simple application with VB and DB2.

10. Writing simple application with Java and DB2. 11. Design of Database using normalization for an application. 12. Creation of views and indices with DB2.

Specialization Subject code

B.E. (CSE) C62

Lecture 3

Tutorial 1

Practice 0

Credit 4

C62 NUMERICAL METHODS AND NUMBER THEORY Objective: To develop efficient algorithms for solving problems in Science, Engineering and Technologies. In computer Security, the number systems is required so this course gives a complete procedure for solving different kinds of problems that occur in engineering numerically and number theory for computer security. UNIT I Numerical Solutions of Algebraic and Transcendental Equations Bisection method, Regula Falsi method, Newton Raphson method, Ordinary iterative method, Horners method, Graffes Root Squaring method,

Bairstow’s method. periods)

(10

UNIT II Numerical solutions of Simultaneous Equations Gauss Elimination method, Gauss Jordan method, Crout’s method, Gauss Jacobi method,Gauss Seidel method, Relaxation method. Inversion by Gauss Jordan and Crout’s method, Eigen vaues by Power method. (10 periods) UNIT III Numerical Solutions of Ordinary and Partial Differential Equations Ordinary Differential Equations Picards method, Taylor Series method, Euler’s method, Modified and Improved methods, Rungekutta method of order four, Milne’s method, Adams method, Boundary value problem by finite difference method. Partial Differential Equation Parabolic by Bender Schidt method, Elliptic by Leibmann’s method, Hyperbolic by finite difference method. (10 periods) UNIT IV Integers The Integers and Division-Division-Primes-The Division Algorithm-GCD and LCM-Modular Arithmetic-Applications of Congruences-Cryptology-Integers and Algorithms – Representation of Integers –Algorithms for Integer Operations- Modular Exponentiation-The Eucidean Algorithm-Applications of Number Thoery-Some Useful Results-Linear Congruences-The Chinese Remainder Theorem-Computer Arithmetic with Large Integers- Pseudoprimes – Public key Cryptography – RSA Encryption-RSA Decryption-RSA as a Public key system. (10 periods) UNIT V Counting Basic Counting Principles-The Inclusion-Exclusion Principle- Tree Diagrams-The Pigeonhole Principle – The Generalized Pigeonhole principle-Permutations and Combinations-The Binomial Theorem- Pascal’s Identity and Triangle – Other Identities of the Binomial Coefficients – Generalized Permutation and Combinations. (10 periods) Text Books: Curtis F.Gerald , Patrick O.Wheatley, “Applied Numerical Analysis” Fifth Edition, Addison-Wesley Publishing Company,1998 (Units I, II, III) Kenneth H.Rosen,”Discrete Mathematics and Its Applications” Fifth Edition, Tata McGraw- Hill Edition,2003. (Unit IV and V) Reference Books: 1.Grewal,”Numerical Analysis”,Khanna Publishers, New Delhi,1997. 2.P.Kandasamy,K.Thilagavathy,K.Gunavathy, “Numerical Methods”,SChand and Sons, 1997. 3. Lipschutz, S. (1997). Schaum's outline of theory and problems of discrete mathematics. McGraw-Hill (2nd ed.). 4. V.K.Balakrishanan(1994),Schaum's outline of Combinatorics, McGraw- Hill 5. Tom M.Apostal(1997),Introduction to Analytic Number Thoery,Narosa Publishing House. Specialization Subject code

B.E. (CSE) C63

Lecture 3

Tutorial 1

C 63 Object oriented analysis and Design

Practice 0

Credit 4

Objective: To Provide good foundation and resources to understand the fundamental concepts of object model. UNIT – I Concepts-Complexity –The inherent complexity of software–The structure of complex systems. Brining order to chaos. On designing complex systems. The Object Model- The evolution of object model -Elements of object model- Applying the object model. (10 Periods) UNIT – II Classes and Objects-The Nature of an object –Relationship among objects-The Nature of classRelationships among classes-The interplay of classes and objects. Classification-The importance of proper classification. Identifying classes and objects – Key abstractions and mechanisms (10 Periods) UNIT – III Introducing the UML-Overview-A conceptual model of the UML. Basic structural Modeling-ClassesRelationships-Common Mechanisms-Diagrams-Class diagrams-Advanced classesAdvanced Relationships-Interfaces, Types, and Roles Packages-Object Diagrams. (10 Periods) UNIT – IV Basic behavioral Modeling-Interactions-Use case Diagrams-Interaction Diagrams-Activity DiagramsEvents and Signals-State Machines-Process and Threads-Time and Space-Common modeling techniques. State chart diagrams. (10 Periods) UNIT – V Components-Deployment-Collaborations-Patterns and frame works- Component diagrams-Deployment Diagrams-Systems and models-Applying the UML. (10 Periods) Text Books: 1. Object oriented analysis and design with applications. Second edition, Pearson Education .- Grady Booch. (1 st and 2 nd Unit) 2. The Unified Modeling Language –User Guide.- Grady Booch. Addison Wessley.

,James Rumbaugh,Ivar Jacobson-

Reference Books: 1. Ali Bahrami,”Object Oriented System development “,McGraw Hill international edition 1999. 2.Thomas A.Pender “UML in an Instant” wiley-dreamtech India Pvt Ld. 3.Fowler “Analysis pattern” Addison Wesley 1996. 4.Hans –Erick Eriksson and Magnus penker ,” UML Toolkit”, Wiley computer pub,1998. Specialization Subject code

B.E. (CSE) C64 C64

Lecture 3

Tutorial 1

Practice 0

Credit 4

Internet Programming and Web Design

Objective: To understand the concepts of design and programming techniques in three tier architecture and n tier architecture Unit I

Distributive systems- multi tier architecture, Client Tier, Web Tier, EJB Tier, EIS Tier, implementation challenges. XHTML – Headers, Linking, Images, Image maps, meta elements, frameset, cascading style sheets. (10 Periods) Unit II Dynamic HTML- object model and Collections, Event model, Filters and Transitions Java Script introduction to scripting, control statements, functions, objects. (10 Periods) Unit III XML - Introduction - Structuring data, XML namespaces-DTD and Schemes-XML vocabularies , DOM.Introduction to XML , XSL, SOAP, WEB services. (10 Periods) Unit IV Java Servlets - simple servlet, anatomy of java servlet, Reading Data from client and sending data to a client, working with cookies, tracking sessions. JSP-tags, request strings, user sessions, cookies, sessions objects (10 Periods) Unit V EJB-deployment descriptor, session bean, entity bean, message driven bean. Java RMI. JDBC - driver types, packages, process, connection, statement, result set, transaction processing (10 Periods) Text Books: 1. Deitel & Deitel, Internet & World Wide Web How to Program, Prentice Hall 2004.(Units 1,2, & 3) 2. Jim Keogh, The complete reference J2EE, Tata McGraw Hill 2002 Reference Books: 1. D.Norton and H.Schildt – Java 2: The Complete Reference – TMH 2000 2. Deitel & Deitel, Java How to Program, Prentice Hall 1999 Specialization Subject code

B.E. (CSE) C65

Lecture 3

Tutorial 1

Practice 0

Credit 4

C65 SOFTWARE ENGINEERING Objective: To provide the basic knowledge in the software Engineering and learn various techniques/tools required for efficient development of software. UNIT - I Software Process: Life cycle models-Waterfall model-Incremental Process models-Evolutionary process models. Software Process and project metrics : Measures metrics and indicators - Metrics in the process and project domains - Project metrics - Software Measurement - Metrics for software quality - Measuring quality (10 Periods) UNIT – II Software Project Planning: Project planning objectives - Software Project Estimation - COCOMO model-Function point model. Decomposition techniques-Empirical estimation models - Automated estimation tools. Software Quality Assurance : Quality concepts - Quality assurance - SQA Activities - The SQA plan - The ISO 9000 quality standards - The ISO approach to quality assurance systems - The ISO 9001 standard. (10 Periods)

UNIT – III Software Configuration management: Identification of objects in software configuration-Version controlChange control-configuration audit-status reporting. System Engineering: Computer Based systems - The system engineering hierarchy - Business process engineering- Product engineering- Requirements Engineering-System modeling. Requirement analysisAnalysis Principles-Specification. (10 Periods) UNIT - IV Software Testing Methods: Software testing fundamentals - White box testing - Basis path testing Control structure testing - Black box testing - Unit testing-Integration testing-Validation testing-System testing. (10 Periods) UNIT - V Client / Server Software Engineering : The structure of client server systems - Software engineering for C/S systems - Analysis modeling issues - Design for C/S systems - Conventional design approaches - Data base design - Process design iteration - Testing issues - Overall C/S testing strategy - C/S testing tactics. (10 Periods) Text Books : 1. Roger S.Pressman, Software Engineering A Practitioner's Approach, sixth Edition, McGraw Hill International Edition.,2003 2. Roger S.Pressman, Software Engineering A Practitioner's Approach, Fifth Edition, McGraw Hill International Edition.,2000 Reference Books : 1.Ian Somerville-Software Engineering, John Wiley and sons,2003 2.Pankaj Jalote,-An Integrated Approach to Software Engineering - Narosa Publishers - 1994. 3.Stephen R.Schach, Classical and Object Oriented Software Engineering, Irwin McGraw Hill 1996.

Specialization Subject code

B.E. (CSE) C66

Lecture 3

Tutorial 1

Practice 0

Credit 4

C66 DISTRIBUTED COMPUTING Objective: To provide knowledge in distributed computing systems and its operating environment UNIT I Characterization of Distributed Systems: Resource sharing and the Web-System models:-Architectural models-Fundamental Models, Interposes Communication:-The API for the Internet protocols, External data representation and marshalling, Client Server communication, Group communication. (10 Periods) UNIT II Distributed Objects and Remote Invocation: Communication between distributed objects, Remote Procedure call, Events and notifications. Operating System Support. The operating system layerProtection-Processes and threads-Communication and invocation-Operating system architecture. (10 Periods) UNIT III Distributed File Systems:- File service architecture-Sun Network File System-The Andrew File System. Time and Global States:- clocks, events and process states Synchronizing physical clocks-Logical time and logical clocks-Global states. Coordination and Agreement:- Distributed mutual exclusion- ElectionsMulticast communication. (10 Periods) UNIT IV Transactions and Concurrency Control:- Transactions, Nested transactions, Locks, Optimistic concurrency control, Timestamp ordering. Distributed Transactions:- Flat and nested distributed transactions.., Atomic commit protocols, concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery. (10 Periods) UNIT V Distributed Multimedia Systems:- Characteristics of multimedia data, Quality of service management, Resource management, Stream adaptation. Distributed Shared Memory: Design and implementation issues, Sequential consistency and Ivy, Release consistency and Munin. Corba Case Study (10 Periods) Textbook: 1.George Coulouris, Jean Dollimore, Tim Kindberg- Distributed Systems Concepts and Design- AWL, Third Edition- 2002. Reference Books: I.Maarten Van Steen, Andrew & Tanenbaum- Distributed systems: Principles and Paradigms-Prentice Hall- First Edition- 2002 2.Ross J.Anderson- Security Engineering: A Guide to Building Dependable Distributed Systems-John

Wiley & Sons-2001

Specialization Subject code

B.E. (CSE) C67

Lecture 0

Tutorial 0

Practice 3

Credit 2

C67: Internet Programming Lab Objective: To provide practice in application development in three tier architecture. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.

Format and Display the XML file using Javascript Implement Client Side form validation using Javascript Create a web page to handle events and objects using Java script Implement a program for Document Object Model to process XML file Create an applet to display graphical objects. Write a simple servlet which communicate with browser (HTML Forms) .Develop a Java program to connect database using JDBC drivers. Design a website for E_Shopping application with JSP using WSAD Design a website for on line student evaluation system with Servlets in WSAD Design a website for on line registration using WSAD

Specialization Subject code

B.E. (CSE) C68

Lecture 0

Tutorial 0

Practice 3

Credit 2

C68- VISUAL PROGRAMMING LABORATORY Objective: To make the student understand how to design an effective graphical user interface (GUI) for a program. The student should learn how to analyze a problem and design a program structure to solve the problem using an event driven programming language such as Visual Basic or Visual C++ Visual Basic: Form Designing – To Access the Credit Card Information Using the structure of the three top-level menu items, File, Edit, and Help, combine them all together to make one large menu item. Make sure File,Edit,and the Help menu all branch out to their own original menu items, and include the separator bars. Use of ODBC, DAO- Using the BIBLIO database, write the SQL Statement required returning the following columns Table Column Titles Title Titles ISBN Authors Author Titles Year Published Publisher Company Name Use of Active X Controls for a Font Demo Program Use of Report Generation - To create a form that displays the list of publishers from the Data Environment by dragging and dropping columns unto the form. Add a button to export the report to HTML. Design of Paint Brush, Notepad , Calculator Using VB Mini Project Visual C++: Creation of Resources- To Access the Credit Card Information

Drawing in a Window- To Access the Credit Card Information Document – Creation , Storing, Printing Without using MFC Creation of Dialog Resources Using MFC Writing DLLs Using MFC Implementation of Stock Market Simulation without using MFC. Connecting and Updating Data Sources Using ODBC, DAO for BIBLIO Database. Specialization B.E. (CSE) Lecture Tutorial Practice Subject code C71 3 1 0

Credit 4

C71 Network Security Objective: To provide knowledge of security concepts, applications and protocols. Unit I Services, Mechanisms and attacks - OSI Security Architecture - A model for Network Security - Block Cipher Principles - DES - Strength of DES - Differential and Linear Crypto Analysis - Block Cipher Design Principles - Block Cipher Modes of Operation. (10 Periods) Unit II Evaluation criteria for AES- Introduction AES Cipher - Triple DES - Blowfish - RC5 - Characteristics of Advanced Symmetric Block Ciphers - Placement of encryption function - Traffic Confidentiality Key Distribution. (10 Periods) Unit III Principles of Public Key Cryptosystems - RSA Algorithm - Key Management - Diffie Hellman Key Exchange- Authentication Requirements - Authentication Functions. (10 Periods) Unit IV Message Authentication Codes - Hash Functions - Security of Hash Functions and MACS - MD5 Message Digest Algorithm - Secure Hash Algorithm - Digital Signatures - Authentication Protocols - Digital Signature Standards. (10 Periods) Unit V Electronic Mail Security - Pretty Good Privacy - IP Security Overview - Architecture - Authentication Header - Encapsulating Security Payload - Combining Security Association - Web Security Considerations - SSL and TLS - Firewall Design Principles - Trusted systems. (10 Periods) Textbook: 1. William Stallings, Cryptography and Network Security Principles and practices Third Edition Pearson education,2003 Specialization Subject code

B.E. (CSE) C72

Lecture 3

Tutorial 1

Practice 0

Credit 4

C72 – Software Testing Techniques Objective: To understand the concepts of testing strategies and learn about the research trends in Testing Process. Unit I

Assessing Testing Capabilities and Competencies: Roles of Testing, Defect, Business Perspective of Testing. Building a Software Testing Strategy: Computer System Strategic Risks, Economics of testing, Economics of System Development Life Cycle, Establishing a testing Policy Structured Approach to testing, Test Strategy, Testing Methodology. (10 periods) Unit II Testing Strategies: White-box testing techniques – Statement Coverage – Branch Coverage – Condition coverage – Multiple condition coverage – Data flow coverage – Black box testing techniques – Boundary value Analysis – robustness tests – Equivalence partitioning – Levels of testing – Unit, Integration and System testing. (10 periods) Unit III Establishing a Software testing methodology – Verification & Validation – Functional and Structural Testing – Eight Considerations in developing Testing Methodologies. Determining Software Testing Techniques : Testing Techniques/tool selection process – Structural System testing techniques – Functional System Testing Techniques – Unit Testing Technique – Functional testing and analysis. (10 periods) Unit IV Eleven Step Testing Process: Assess Project Management Development Estimate and status – Develop test plan – Requirement Phase testing 0 Design Phase testing – Program Phase testing Execute test and record results – Acceptance test – Report test results – Testing software Installation – Test Software Changes – Evaluate Test Effectiveness. (10 periods) Unit V Miscellaneous Topics : Testing Client Server Systems – Testing rapid Application Development – Testing Web – Based Systems - Testing Off – the – Shelf Software – Testing in Multi platform environment – Testing Security Testing a data Warehouse – Creating Test Documentation. (10 periods) TextBook: 1. William E. Perry, “Effective Methods for Software Testing, Second Edition”, John Wiley & Sons, 2000. 2. Roger S. Pressman, “Software Engineering”, Sixth Edition, McGraw Hill. Reference Books: 1. Boris Beizer, “Software Testing Techniques”, Second Edition, Van Nostrand Reinhold, 1990. 2. Robert V. Binder, “Testing Object – Oriented Systems: Models Patterns and Tools”, Addison Wesley, 2000.

Specialization Subject code

B.E. (CSE) C73

Lecture 3

Tutorial 1

Practice 0

Credit 4

C73 Advanced Databases Objective: To provide knowledge in advanced concepts and new applications in database systems Unit I Object Oriented Databases: Object Oriented Data Modal, Persistent Programming Languages, Persistent C++ Systems Object Relational Databases: Nested Relations, Complex Types, Inheritance, Reference Types, Querying with complex types, Functions and procedures (10 Periods)

Unit II XML: Structure of XML data, XML Document Schema, Querying and Transformation, Storage of XML Data, XML Applications Database System Architectures: Centralized and Client-Server Architectures, Server System Architecture, Parallel Systems, Distributed Systems (10 Periods) Unit III Distributed Databases: Distributed data storage, Distributed transactions, Commit protocols: Two phase commit, Three Phase commit, Concurrency Control in Distributed Databases: Locking protocols, Time stamping, Deadlock handling, Availability, Distributed Query processing: Query transformation- Simple join processing- Semi join processing (10 Periods) Unit IV Parallel Databases : Introduction, I/O Parallelism, Interquery Parallelism, Intraquery parallelism, Interoperation parallelism, and Interoperation parallelism, Design of Parallel systems Web Interfaces to Databases, Performance Tuning, Performance Benchmarks, and Standardization (10 Periods) Unit V Advanced data Types and new Applications. - Time in database, Spatial and geographic data: Representation-Application-Spatial queries-Spatial Indexing Multimedia databases: Data FormatsContinuous media data- Similarity based Retrieval, Mobility and Personal Databases (10 Periods) Text Book: Abraham Silberschatz, Henry. F. Korth, S.Sudharsan," Database System Concepts", Fourth Edition, Tata McGraw Hill, 2002. References: 1. Gary W. Hanson and James V. Hanson, "Database Management and Design", Prentice Hall of India Pvt Ltd, 1999. 2 R. Elmasri and S.B. Navathe, "Fundamentals of Database Systems", Addison Wesley, 2000.

Specialization Subject code

B.E. (CSE) C74

Lecture 3

Tutorial 1

Practice 0

Credit 4

C74 ORGANIZATIONAL BEHAVIOUR AND MANAGEMENT Objective: To expose students the concepts of Organizational Behavior and Management, thereby making them to use these principles in decision making in organizational settings. UNIT I Introduction to OB- Historical development - Contribution of social sciences -Models of OBUnderstanding of individual behavior-Personality -Determinants of Personality--Personality theoriesLearning -Perception-Perceptual process-Development of perceptual skills-Motivation -Theories of motivation. (10 Periods) UNIT II Understanding of groups-Groups and group dynamics-Types of groups- Formation of groupsGroup cohesiveness- Conflicts - Types, Conflicts resolution techniques -Communication-Process-

Importance--Barriers of Communication-Making communication effective. (10 Periods) UNIT III Understanding organization system- Organizational change-Forces for change-Change processResistance to change- Organizational development-Models -Requisites for effective use of OD -Organizational climate-Morale -Morale and productivity. (10 Periods) UNIT IV Introduction to management-Nature of managing -Managerial functions-Managerial skillsPlanning -Importance and steps- Organizing- Principles of organizing- organizational structures-StaffingManpower planning- Recruitment and selection-Directing –Leadership qualities- Styles-Controlling. (10 Periods)

UNIT V Plant location- Factors to be considered- Plant layout- Objectives- Types- Merits and demeritsplanning for layout- Plant maintenance- Functions-Types- Merits and demerits- Productivity- Productivity of different factors of production- Methods of improving human aspects of productivity. (10 Periods) Text Books 1. Stephen P. Robbins, “Organizational Behavior”, PHI , 2001.(Units I to III) 2. Koontz and O' Donnel, “Essentials of Management”, .McGraw Hill. 2002. (Unit IV) 3. O.P.Khanna, “Principles of industrial Management”, Dhanpat Rai and Sons, New Delhi, 2003. (Unit V) Reference Books 1. Fred Lufthansa, “Organization Behavior” , McGraw Hill, 2002. 2. Keith Davis, “Human Behavior at Work”, McGraw Hill, 2001. 3. VSP.Rao & Narayana , “Organization Behavior” ,Sulthan Chand & Sons, 2003. 4. L.M. Prasad, “Principles of Management”, Sulthan Chand & Sons, 2003.

Specialization Subject code

B.E. (CSE) C77

Lecture 0

Tutorial 0

Practice 3

Credit 2

C77- Application Development Lab using DB2 Objective: To provide a practice in Application Development using DB2 1. 2. 3. 4. 5. 6.

Develop online Quiz with three-tier architecture with DB2 as database. Develop online course registration using DB2. Develop stored procedure in DB2 for calculate fine amount for library management system. Develop Trigger in DB2 which does not allow the user to modify database in non working hours. Design a database for employee payroll application and implement in Java and DB2 Develop application for simple Library management system with VB and DB2

Specialization Subject code

B.E. (CSE) C71 C78

Lecture 0

Tutorial 0

Practice 3

Credit 2

SOFTWARE TESTING LABORATORY

Objective: To enable the students to practice the disciplined approach of software testing by giving an exposure to various software testing tools that enhances the Quality of Software. 1. To Perform Functional Testing Using Mercury's Interactive Win Runner, SQA Robot Tool and Quick Test Professional tool - Standard Calculator present in Windows. a. Record Test Cases and Perform them b. Synchronization of test cases c. Data Driven testing d. Generating Rapid Test Script wizard e. Checking GUI Objects 2. To Perform Regression Testing Using Mercury's Interactive Win Runner tool, SQA Robot Tool and Quick Test Professional tool - Binary Search Program in C a. Make Changes, Record Test Cases and perform them

b. Synchronization of test cases c. Data Driven testing d. Generating Rapid Test Script wizard e. Checking GUI Objects 3. To perform Load / Performance testing for a Web - based application Using Mercury's Interactive Load Runner tool - Weather India Application. 4. To perform Load / Performance testing for a Database application Using Apache JMeter tool Weather India Application. a. JDBC Test b. HTTP Test 5. To Perform Test Process Management Using Mercury's Interactive Test Director Tool - Employee database Application a. Requirements Management b. Test Planning c. Test Execution d. Test result analysis 6. To Manage a Project Using Configuration Management Tools a. Revision Control System (RCS) b. Source Code Control (SCC) - Stack Implementation in C 7. To Perform Testing on Embedded System Applications Using Rational Test Real Time, Message Magic tool.

Specialization Subject code

B.E. (CSE) C81

Lecture 3

Tutorial 1

Practice 0

Credit 4

C81 WIRELESS NNETWORK TECHNOLOGIES Objective: To understand the concepts of wireless networks, protocols, architectures and applications. UNIT I Comparison of wired and Wireless Media - Radio Propagation Mechanisms - Physical Layer Alternatives Considerations in the Design of Wireless Modems - Wireless Transmissions Techniques - Short Distance Based Transmission - UWB Pulse Transmission - Carrier Modulated Transmission - Digital Cellular Transmission - Broadband Modems for high Speeds - Speed Spectrum Transmissions- Introduction to TDMA, FDMA and CDMA. (10 periods) UNIT II IEEE 802.11 Wireless LAN standard - Protocol Architecture - Architecture and Services - 802.11 Physical layer and MAC - Blue Tooth overview - Radio Specification - Base band Specification - Link Manager Specification - Logical Link Control and Adaptation Protocol. (10 periods) UNIT III Introduction to Network Planning - Wireless Network Topologies - Cellular Topology - Cell Fundamentals - Signal to Interference Ratio Calculation - Capacity expansion Techniques- Network plann9ing for CDMA systems. (10 periods)

UNIT IV Introduction to wireless network operation - Mobility Management - Radio resources and power management - GSM - Services - Reference Architecture - Mechanisms to support a mobile environment CDMA - IMT 2000. (10 periods) UNIT V Introduction to mobile data networks - CDPD network - GPRS and higher data rates - Short messaging Services in GSM - Mobile applications protocols - Introduction to Mobile IP (10 periods)

Text Book: Kaveh Pahlavan & Prashant Krishnamurthy, Principles of Wireless networks, Pearson Education, 2003. Reference Book: William Stallings, Wireless Communications and Networks, Pearson education, 2003

Specialization Subject code

B.E Computer Science & Engg C 7A

Lecture 3

Tutorial 1

Practice --

Credit 4

C7A Network Management Objective It is aimed at making the students learn network management principles and technologies for managing networks, systems applications and services in a balanced way. Unit – I Network management standards- Network management model- Organization model-Information modelCommunication model-Abstract Syntax Notation one- Encoding structure- Macros-Functional modelManaged network: Case history- The SNMP Model- Organization model-System overview. (10 periods) Unit –II SNMP Information model- SNMPv1 Network Management- Communication model- Functional model. (10 periods) Unit – III Major changes in SNMPv2- SNMPv2 system architecture- Structure of management Information SystemIntroduction to MIB- SNMPv2 protocol- Compatibility with SNMPv1 (10 periods) Unit – IV SNMPv3 documentation-Architecture- Applications- SNMPv3 MIB- Security- User based security modelAccess control-RMON- SMI and MIB-Introduction to RMON1 and RMON2- Case study of Internet traffic using RMON. (10 periods) Unit – V

Network Management tools- Network Statistics Measurement Systems- Network management systemsNMS with web interface and web based management- Desktop management interface-Web based enterprise management (10 periods) Text Book: 1) Mani Subramanian, Network Management Principles and Practices, Addision Westly, 2000. Reference Book: 1) Willium Stalings SNMP, SNMP v2, SNMP v3, ROMAN 1 and 2, Third Edition, Pearson Education, 2003. Specialization Subject code

B.E Computer Science & Engg C 7B

Lecture 3

Tutorial 1

Practice --

Credit 4

C7B DATA MINING AND WAREHOUSING Objective: To understand the concepts and technology behind Data Mining. Unit-I Introduction: Motivation – Definition – Kinds of data – Data mining functionalities – Interestingness of patterns mined - Classification - Major issues Data Warehouse and OLAP Technology for Data Mining : A multidimensional data model - Data cubes – Schemas - Measures: their categorization and computation - OLAP operations in the multidimensional data model -Data warehouse architecture – Implementation - Further development of data cube technology From data warehousing to data mining. (10 periods) Unit – II Data Preparation : Need for preprocessing the data - Data cleaning - Data integration and transformation Data reduction - Discretization and concept hierarchy generation Concept Description: Characterization and Comparison : Data generalization and summarization-based characterization - Analytical characterization: analysis of attribute relevance - 4 Mining class comparisons: discriminating between different classes - Mining descriptive statistical measures in large databases Concept description: a comparison with typical machine learning methods . (10 periods) Unit - III Mining Association Rules in Large Databases : Association rule mining - Mining single-dimensional Boolean association rules from transactional databases - Mining multilevel association rules from transaction databases - Mining multidimensional association rules from relational databases and data warehouses - From association mining to correlation analysis - Constraint-based association mining Classification and Prediction: Definitions - Issues regarding classification and prediction - Classification by decision tree induction - Bayesian classification - Classification by back-propagation - Classification based on concepts from association rule mining - Other classification methods – Prediction - Classifier accuracy. (10 periods) Unit - IV Cluster Analysis: Definition - Types of data in clustering analysis – Categorization Partitioning methods - Hierarchical methods - Density-based methods - Grid-based methods - Model-based clustering methods - Outlier analysis (10 periods) Unit - V Mining Complex Types of Data: 1 Multidimensional analysis and descriptive mining of complex data objects - Mining spatial databases - Mining multimedia databases - Mining time-series and sequence data -

Mining text databases - Mining the World-Wide Web Data Mining Applications and Trends in Data Mining: Data mining applications - Data mining system products and research prototypes - Additional themes on data mining - Social impacts of data mining Trends in data mining (10 periods) TEXT BOOK: Jiawei Han, Micheline Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2000, ISBN: 1-55860-489-8. Chap: 1-3, 5-10 REFERENCE BOOKS: M. H. Dunham, Data Mining: Introductory and Advanced Topics, Prentice Hall, 2003. David J. Hand, Heikki Mannila and Padhraic Symyth, Principles of Data Mining, MIT Press, 2000. Usama Fayyad, Gregory Piatetsky-Shapiro, Padhric Smyth, and Ramasamy Uthurusamy, Advances in Knowledge Discovery and Data Mining, AAAI Press, 1996, ISBN 0-262-56097-6. Ian Witten and Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations, Morgan Kaufmann, 2000, ISBN: 1-55860-552-5.

Specialization Subject code

B.E Computer Science & Engg C 7C C7C

Lecture 3

Tutorial 1

Practice --

Credit 4

SOFTWARE PROJECT MANAGEMENT

Objective: Learning the software project management concepts to cater the latest trends. UNIT – I Managing software projects – process and project management – CMM – overview – KPA’s – Project planning – project planning infrastructure – process database – process capability baseline – process assets & body of knowledge systems – process planning – standard process – process tailoring – requirement change management. 10 periods UNIT – II Effort estimation & scheduling – concepts – effort estimation models – effort estimation – scheduling – quality planning – quality concepts – quantitative quality management planning – defect prevention planning – risk management – risk assessment – risk control 10 periods UNIT – III Measurement and tracking planning – concepts – measurements project tracking – project management plan – team management – customer communications & issue resolution – structure. 10 periods UNIT-IV Configuration management – concepts – configuration management process – project execution & closure – reviews process – data collection – monitoring and control. 10 periods UNIT – V Project monitoring & control – project tracking – milestone analysis – activity level analysis using SPC – defect analysis & prevention – process monitoring and audit – project closure – analysis.

10 periods Total no. of periods: 50 Text Book: 1. Pankaj Jalote, ”Software project management in practice”, Addison – Wesley professional , 2002. (Covers all units) References: 1. Ramesh, " Gopalaswamy: Managing Global Projects ", Tata McGraw Hill, 2003. 2. Humphrey, Watts: " Managing the software process ", Addison Wesley, 1986. 3. Pressman, Roger: " Software Engineering ", A Practitioner's approach, McGraw Hill, 1997. 4. Wheelwright and Clark: " Revolutionising product development ", The Free Press, 1993.

Specialization Subject code

B.E. (CSE) C7D

Lecture 4

Tutorial 0

Practice 0

Credit 4

C7D FREE-OPEN SOURCE SOFTWARE Objective: The main objective is to allow students to address issues and adapt Open Source Technologies and Practices Unit-1 History and Overview of GNU/Linux Introduction to Linux- The Future- Why use Linux-The GNU Difference- Linux Distributions- Installation Requirements- Understanding various Installation Methods- Starting the Installation ProcessTroubleshooting-Installing &Configuring LILO (10 periods) Unit-2 Configuring additional Hardware Configuring the Linux system-Configuring the Network-Configuring a Printer-Configuring Standard User Features-Adding Hardware to your Linux system-Dealing with the kernel- Adding a modem-Adding a Sound Card- Running the XWindow System-Installing GNOME-KDE-Xutilities (10 periods) Unit-3 System Administration Creating New Accounts from the Console-Administrative Tasks- The Startup ad Shutdown ProcessManually Controlling a Process- Formatting and Disk Partitioning-Checking the File System-BackupsSystem Accounting and Logging- Configuring system Quotas-System Load and Current Processes (10 periods) Unit-4 Shell Programming Tools Using the Command Line Shell-Redirection and Pipes- Environment Variables-Invoking a shell-Special Command Line Constructions- Shell Functions-Shell Aliases-Built-In Bash Commands-Some Handy Command Line Utilities- Introduction to Shell Programming- Conditional Execution-Execution of Scripts and Programs-Some Utilities That can Be Useful in Scripts (10 periods)

Unit- 5 Web Server FTP Server Fundamentals-Configuring the FTP Server- The /etc/passwd File- Controlling and Monitoring the FTP Service- Using FTP Client Software- Installing the Web Server- Configuring the Web ServerAdding Virtual Host-Using NFS on Linux- Configuring NFS-Mounting and Unmounting File systems (10 periods) Text Book: 1. Complete Guide to Linux, Peter Norton, Techmedia, First Edition,2000 Reference Book: 1. Introduction to Linux: Installation and Programming; N. B. Venkateshwarlu (Ed); B S Publishers; 2005. 2. Running Linux, Fourth Edition, Matt Welsh, Matthias Kalle Dalheimer, Terry Dawson, and Lar Kaufman, O'Reilly Publishers, December 2002, ISBN: 0-596-00272-6. 3. Linux Cookbook, First Edition, Carla Schroder, O'Reilly Cookbooks Series, November 2004,ISBN: 0596-00640-3.

Specialization Subject code

B.E. (CSE) C7E

Lecture 3

Tutorial 1

Practice 0

Credit 4

C7E ARTIFICIAL INTELLIGENCE Objectives: To present modern approaches in AI and indicate the ways in which techniques can be used in application programs

Unit I Introduction – Solving problems by search – agents – example problems – searching for solutions – uninformed search strategies – avoiding repeated states – searching with partial information – informed search and exploration – informed search strategies – heuristic functions – local search algorithms and optimization problems – continuous spaces – online search agents and unknown environments (10 periods) Unit II Constraint satisfaction problems – backtracking search for CSPs- variable and value ordering-intelligent backtracking - local search for CSP – structure of problems – adversarial search – games – optimal decision in games –minimax algorithm - alpha beta pruning – imperfect real time decisions – evaluation function - elements of chance – card games – state of art games programs (10 periods) Unit III First order logic – syntax and semantics of first order logic – using first order logic – Assertion – queries knowledge engineering in first order logic- knowledge engineering process - inference in first order logicprepositional versus first order inference – unification and lifting – forward chaining – backward chainingResolution – conjunctive normal form – completeness of resolution – resolution strategies (10 periods) Unit IV Planning-The Planning Problem- Planning with State-Space Search-Partial-Order Planning-Planning Graphs-Planning with Prepositional Logic-Planning and Acting in the Real World-Time, Schedules and Resources-Hierarchical Task Network Planning- Planning and Acting in Nondeterministic domainExecution Monitoring and Replanning-Continuous planning-MultiAgent planning (10 periods) Unit V Uncertain Knowledge-Rational Decisions-Design-Propositions-Atomic Events-Axioms-Inference using full joint distribution -Independence-Bayes rule-Probabilistic Reasoning-Uncertain Domains- Conditional Distribution-Exact Inference-Approximate Inference- Extending Probability to first order representationsApproaches to Uncertain Reasoning- Dempster Shafer Theory – rule based methods (10 periods) Text Book 1)Stuart Russell, Peter Norvig, Artificial Intelligence:A Modern Approach, Pearson Education, 2003 Reference 1)E. Charnick, Introduction to Artificial Intelligence, Addison – Wesley, 2000 2)Rich,E and Knight,K, Artificial Intelligence, McGraw Hill, 1991 3)Nilsson, Artificial Intelligence: A new synthesis, Morgan kaufmann, 1998

Specialization Subject code

B.E. (CSE) C7F C7F

Lecture 4

Tutorial 0

Practice 0

Credit 4

ELECTRONIC COMMERCE

Objective: To gain knowledge in Enterprise Information Systems and E-Business applications UNIT – I E-Commerce(EC) – Introduction - Electronic Commerce Framework – Electronic Commerce and Media Convergence – The anatomy of E-Commerce Applications – Electronic Commerce Consumer

Applications. Architectural Framework for Electronic Commerce – WWW (World Wide Web) as the architecture - Electronic Commerce Models. (10 Periods) UNIT – II Business-to-E-Commerce-Characteristics of B2B EC-Models of B2B EC-Internet Market Place-Just-inTime Delivery-Other B2B Models, Auctions, and Services. Integration with Back-End Information Systems-The Role of Software Agents for B2B EC-Electronic Marketing in B2B-Solutions to B2B ECManagerial Issues. Shopping Cart Technology - Data Mining and Data warehousing - Intelligent Agents Internet Marketing. (10 Periods) UNIT – III Electronic Payment Systems – Digital Token based Electronic Payment Systems – Smart Cards and Electronic Payment Systems – Credit Card based Electronic Payment Systems - Risk factors in Electronic Funds Transfer - Digital Payment – Designing Electronic Payment Systems– ATM Transactions – A Case Study. (10 Periods) UNIT – IV Electronic Data Interchange – EDI Applications in Business – EDI: Legal, Security and Privacy issues – EDI and Electronic Commerce. Standardization and EDI – EDI software Implementation – EDI Envelope and Message Transport – VAN (Value Added Network) – Internet based EDI. (10 Periods) UNIT – V Internal Information Systems - Macro forces and internal commerce - Workflow Automation and Coordination - Customization and Internal commerce - Supply Chain Management (SCM) – Elements of SCM – its benefits – Advertising on the Internet. (10 Periods) Text books: 1. Ravi Kalakota and Andrew B Whinston, “Frontiers of Electronic commerce”, Addison Wesley, 1998. 2. Efraim Turban, Electronic Commerce-A Managerial Perspective, Pearson Education, 2002 (Chapter-6)[Unit-2] Reference Books: 1. Jefferey F. Rayport & Bernard J. Jaworshi, “E-Commerce”, TataMcGraw Hill, 2002 2. Dhruv Nath, The Nuts and Bolts of E-Commerce, TataMcGraw Hill, 2002 Specialization Subject code

B.E. (CSE) C7G

Lecture 4

Tutorial 0

Practice 0

Credit 4

C7G –EMBEDDED SYSTEMS Objective: Objective: To provide the basic knowledge in the concepts of Embedded Systems. UNIT – I Embedded computing – Introduction - Complex systems and microprocessors -The embedded system design process - Formalisms for system design - Instruction sets-Introduction – Preliminaries - ARM processor - SHARC processor (10 Periods) UNIT - II The Embedded computing platform- Designing with microprocessors – Development and Debugging- Program design and analysis – Introduction – Program design – Models of programs – Assembly and linking – Basic compilation techniques – Analysis and optimization of Execution time , Energy and power & Program size

(10 Periods) UNIT - III Processes and operating systems – Introduction – Multiple tasks and multiple processes – Processes – Context switching – Operating systems – Scheduling policies – Inter process communication mechanisms – Evaluating operating system performance – Power optimization strategies for processes (10 Periods) UNIT - IV Distributed Embedded Architectures – I2C Bus and CAN Bus -System design techniques-Design methodologies, Requirement analysis, specifications, Quality assurance – Program validation and testing (10 Periods) UNIT - V Real Time Operating Systems- Real-time function and services, Real –time UNIX and POSIX, Processes and Threads- Study of sample RTOS such as eCOS, real-time LINUX, Windows CE. . (10 Periods) Text Book: 1.

Wayne Wolf, Computers as Components : Principles of Embedded Computing System Design , Elsevier Inc ,2001. (Unit I, II ,III & IV) 2. Allan. V.Shaw- Real Time systems and software –John Wiley &Sons –India reprint.( Unit V) Reference Books: 1. Rajkamal , Embedded systems – Architecture , programming and Design , TMH, 2003. 2. David .E. Simon , An Embedded software Primer .Pearson education,2000. 3. D.Lewis , Fundamentals of Embedded software where C and assembly meet, Prentice Hall , 2002. 4. Jack Ganssle , The Firmware Handbook, Elsevier Inc, 2004. Specialization Subject code

B.E. (CSE) C7H

Lecture 3

Tutorial 1

Practice 0

Credit 4

C7H MULTIMEDIA SYSTEMS Objective: To introduce the concepts and various technologies behind Multimedia systems UNIT – 1 Introduction-Multimedia: Media and Data Streams: Medium- main properties –Traditional Data streams characteristics - Data Stream Characteristics for continuous media- Sound/Audio- Formats - Music – MIDI – Speech – Generation – Analysis - Transmission (10 periods) UNIT – II Images and Graphics – Concepts – Representation – Image and Graphics Formats – Computer Image processing –synthesis – analysis – transmission – Video and Animation – Signal representation – Video format- Television – Computer based animation – Languages – methods – display - transmission (10 periods) UNIT –III Multimedia communication – Application subsystem – collaborative computing – Session management – Transport subsystem – requirements – Quality of Service and Resource management – Establishment and Closing multimedia call – Managing resources – architectural issues (10 periods)

UNIT – IV Synchronization – basic issues – Intra and Inter object synchronization – Presentation requirements – Lip – Pointer – Media synchronization – Reference model – Existing classification – Distributed environment – aggregate characteristics - Specification – methods – Interval – Axes – Control flow - Event based synchronization-scripts (10 periods) UNIT –V Multimedia applications – programs – structure – media preparation – media composition – media integration – media communication – media consumption – media entertainment – future directions (10 periods) Text Book: 1. Ralf Steinmetz and Klara Nahrstedt ,Multimedia: Computing,Communications and Applications, Pearson Education Asia, 2001 Reference: 1. John.F. Koegel Buford, Multimedia Systems , Addison Wesley , 2000. 2. Tay Vaughon , Multimedia making it work, TMC , 1999. 3 Fred Halsall, Multimedia communications, Pearson Education Asia, 2001. Specialization Subject code

B.E Computer Science & Engg C8A

Lecture

Tutorial

Practice

Credit

3

1

--

4

C8A CONVERGENT TECHNOLOGY OBJECTIVE: To understand the concepts in VOIP Technologies. UNIT – I Principles of converged Networks – Voice and Data Network characteristics – Benefits of the IP – Centric Networks – RTP – Payload formats – RTP Header – mixers and translators – RTCP – Types of RTCP packets – Round trip time and jitter – IP multicast. (10 periods) UNIT – II Introduction to signaling – H.323 Architecture - H.323 signalling - H.323 protocols overview - H.323 addressing – Codecs – RAS signalling – call signalling – call scenarios – H. 245 Control signalling – conference calls. (10 periods) UNIT - III Introduction to SIP – SIP Architecture – SIP Messaging Syntax - Message Sequences – Redirect and Proxy Servers – Introduction to SDP. (10 periods) UNIT – IV Introduction to media gateway control – Separation of Media and Call control – softswitch architecture – Requirements and protocols for media gateway control - MGCP model – MGCP endpoints, calls, connections and responses – call setup – MGCP events – Internetworking between MGCP and SIP. (10 periods) UNIT – V Need for QoS – Overview of QoS reservations – Types of Services – Diffserv architecture – Accessing the network – Modems – ISDN – DSL – Cable TV infrastructure – Fixed wireless Access – Introduction to mobile services. (10 periods)

Text: 1.

Daniel Collins, Carrier Grade Voice over IP, McGraw hill international edition, 2001.

Reference: 1. Mark A. Miller, Voice over IP Technologies, Willey DreamTech India, 2002. 2. Oliver Hersent, David Gurle & Jean – Perirre Petit, IP Telephony Packet – based multimedia communication systems, Addison Wesley, Pearson Education, First Indian Reprint, 2001.

Specialization Subject code

B.E. (CSE) C8B

Lecture 3

Tutorial 1

Practice 0

Credit 4

C8B Knowledge Engineering and management Objective: To Provide good foundation and resources in the concepts of knowledge engineering and knowledge management. UNIT – I Introduction –The value of knowledge- knowledge Engineering Basics –historical perspective –The Methodological pyramid-principles-The task and its organizational context. The main steps in task and organizational analysis. The feasibility study. Knowledge management. Explicit and tacit knowledge –the KM cycle. Knowledge management and knowledge engineering. (10 Periods) UNIT – II Knowledge model components. The nature of knowledge-the knowledge model-domain knowledge –task knowledge-Template knowledge models-classification –assessment-diagnosis-monitoring-synthesisassignment-planning –scheduling –Task type combinations. Relation to task and organization models. (10 Periods) UNIT – III Knowledge model construction –Introduction –stages in knowledge model construction –knowledge identification –knowledge specification –knowledge refinement-knowledge elicitation techniquescharacteristics of knowledge elicitation . Elicitation techniques modeling communication aspects. (10 Periods) UNIT – IV Case study: The housing application –introduction –task model-agent model-knowledge modelingcommunication model. Designing knowledge systems-introduction -structure preserving design –design system architecture –identify target implementation platform-specify architectural components. specify application within architecture. Design of prototypes. Knowledge system implementationimplementation in prolog. (10 periods) UNIT – V Advanced knowledge modeling-introduction-domain knowledge –interface knowledge-task knowledgeUML notations used in common KADS-activity diagram-state diagrams-class diagrams-use case diagramsgeneral UML constructs.-Project management- project planning-assessing risks. Plan-setting objective through model states. (10 Periods) TEXT BOOK: 1.Knowledge Engineering and management –Guus Schreiber,hans akkermans,anjo anjewierden Universities press (India Ltd) 2001. REFERENCE BOOKS: 1. Knowledge management –Elias M.Awad&Hassan M.Ghaziri Pearson Edition 2003 2 .Amrit Tiwana, The Knowledge Management Toolkit (With a CD), Practical techniques for Building a KMS, Printice Hall PTR. 3.Jerry Honeycutt, Knowledge Management Strategies, ITR professional, Microsoft. Specialization Subject code

B.E Computer Science & Engg C 8C

Lecture 3

Tutorial 1

Practice --

Credit 4

C8C

SOFTWARE QUALITY MANAGEMENT

Objective: To learn the software quality management concepts and understand the process to practice for delivering quality software. UNIT – I Software Quality Assurance – Introduction – software quality control – TQM – SQA and Operating systems software – SQA and Mission critical software – SQA and real time software – SQA and Interactive software – SQA and Business software – Business process reengineering & Y2K – SQA and software configuration management – SQA and software maintenance – Quality Gurus and their philosophies ( Deming, Ishikawa, Juran, Taguchi, Crosby) 10 periods UNIT – II Software Cost of Quality – Input – value added actions – Output – activity analysis – Non-cost of Quality – Major components – Software Reviews and Inspections - Inspection process – Requirements InspectionSpecification Inspection – Documentation Inspection – Inspection metrics – National software quality experiment – Pareto principle – Defect identification – Pareto chart comparison. 10 periods

UNIT – III Introduction to the CMM – Evolution – benefits of using the CMM – structure of the CMM – understanding SQA within the CMM – SQA case tools – Applicability of tools – ISO 9000 – Malcolm Baldrige Award. 10 periods UNIT – IV Software Quality Assurance metrics – Introduction – Software Quality metrics methodology – omnibus software quality metrics – software quality indicators – Effective methods of information services – statistical methods applied to software quality control – Quality programming – proposed solution to some technical problems – Software safety and its relation to software quality assurance. 10 periods UNIT – V What is Six Sigma – Implementing Six Sigma – Six Sigma goals and metrics – Case studies on implementing SQA for mission critical software and commercial application software. 10 periods Total No of periods: 50 Text Book: 1. Schulmeyer.G.Gordon, James I. McManus, “ Handbook of Software Quality Assurance”, 3rd edition, Prentice Hall Publications, 1999.(Unit I-IV) ISBN : 0-13-010470-1 2. Thomas Pyzdek, “ The Six Sigma Handbook: the complete guide for Green belts, Blackbelts, and managers at all levels”, Revised and expanded edition”, McGraw-Hill publications, 2003. (Unit V) ISBN : 0-07-141015-5 References: 1. Watt.S. Humphery, " Managing Software Process ", Addison - Wesley, 2001. 2. Roger Pressman, " Software Engineering Practice ", Tata-McGraw Hill,6th edition 2005. 3. Ronald Radice, “ Software Inspections”, Tata – McGraw Hill, 2003.

Specialization Subject code

B.E. (CSE) C8D

Lecture 3 C 8D

Tutorial 1

Practice 0

Credit 4

Operating System Design

Objective: To understand the advanced concept s and the design issues in Operating Systems Unit - I Processes, Files, Shell – System calls :Process Management, Signaling, File Management, Directory Management, Protection, Time Management – Structure: Monolithic Systems Layered Systems Virtual Machines Virtual Mac Client-Server Model (10 Periods) Unit II Processes: Model, Threads – IPC: Race Conditions,Critical Sections,Mutual Exclusion with Busy Waiting, Sleep and Wakeup, Semaphores,Monitors ,Message Passing - Classical IPC problems- Process Scheduling : Types of scheduling, Policy versus Mechanism -Overview of processes in minix (10 Periods) Unit III Input/output : Principles of i/o hardware ,i/o devices, device controllers,Direct memory access , Principles of i/o software, Deadlocks,Overview of i/o in minix , Block devices in minix, RAM disks , disks ,Clocks , Terminals –hardware,software,terminal in minix (10 Periods) Unit IV Memory management,Basic memory management -Swapping - Virtual memory - Page replacement algorithms - Design issues for paging systems -Segmentation - Overview of memory management in minix (10 Periods) Unit V File systems -files - directories - file system implementation - security - protection mechanisms- overview of the minix file system -Design of Unix Operating System-Introduction to Kernel – Internal representation of files- System calls (10 Periods) Text Book: 1)Andrew S.Tanenbaum and Albert S. Woodhull, Operating systems design and implementation, Second Edition, Prentice Hall (Unit I,II,III,Iv) 2) Maurice J bach, Design of Unix OS , Prentice Hall(Unit V) Reference: 1)Silberschatz, Galvin, Gagne, Operating System concepts, John Wiley & Sons 2)W.Stallings,Operating System Internals & Design Principles, Prentice Hall Specialization Subject code

B.E. (CSE) C8E

Lecture 3

Tutorial 1

Practice 0

Credit 4

C8E NEURAL NETWORKS Objectives: To introduce the concept of Neural networks, its algorithms and applications UNIT – I Introduction to ANS technology-Neural circuits and computation-Hebbian learning-General Processing Element-Vector formulation-Perceptron model-ANS simulation – Need – Design guidelines for simulatorsArray based ANS structure-ANS Data structure Extension of ANS data structures

Adaline and Madaline – Signal processing and filters review-Adaline and the Adaptive linear combinerLMS learning rule-Practical considerations-Applications-Madaline Architecture-MRII Training algorithmMadaline for Translation-Invariant Pattern recognition-Simulating Adaline – Data structureImplementation (10 periods) UNIT – II Backpropagation network-Approach-BPN operation-Generalized Delta rule-Update of weights-Practical considerations-Applications-Backpropagation simulator BAM and Hopfield Memory-Associative memory definitions-Linear associator-BAM architectureProcessing-mathematics-energy function-Hopfield memory-Continuous Hopfield model-TSP problemSimulating the BAM (10 periods) UNIT – III Simulated annealing-Information theory and statistical mechanics-concepts-Annealing-Boltzman machineLearning-Boltzmann simulator-Application Counterpropagation network-Building blocks-Input layer-Instar-competitive networks-Outstar-CPN data processing-Forward mapping-Practical consideration-Application-Simulator (10 periods) UNIT - IV Self organizing maps-SOM data processing-Learning algorithm-Feature map classifier-ApplicationsSimulating the SOM Adaptive resonance theory-network description-Gain control in ART-ART1-ART2-Simulation (10 periods) UNIT – V Spatiotemporal pattern classification-Formal avalanche-Architectures-Sequential competitive avalanche field-example-Applications-STN simulation Neocognitron-Architecture-functional description-data processing-cell processing-training-Application (10 periods) Textbook:

1)

James A. Freeman and David M. Skapura, Neural networks-Algorithms, Applications and Programming techniques, Pearson Education Asia, 2001

Reference:

2)

Robert Hech-Nielson, Neuro-computing, Addison Wesley Reading, 1990

3)

Igor Alexander, Neural computing architectures, MIT Press, 1989

4)

Bart Kosko, Neural networks and fuzzy systems ,Prentice Hall, Englewood Cliffs,1992

Specialization Subject code

B.E. (CSE) C8F C8F

Lecture 3

Tutorial 1

Practice 0

Credit 4

ENTERPRISE RESOURCE PLANNING (ERP)

Objective: To gain knowledge in ERP and applying it to utilize the various resources of an organization to improve its performance. UNIT – I Introduction to ERP – What is ERP? – Evolution of ERP – Advantages. Enterprise – An overview Introduction – Integrated Management Information – Business Modeling – Integrated Data Model. ERP and Related Technologies:- Introduction – Business Process Reengineering (BPR) – Management Information system (MIS) – Decision Support System (DSS) – Executive Information Systems (EIS) – Data warehousing Data Mining – Online Analytical Processing (OLAP) – Supply Chain Management. (10 Periods) UNIT – II ERP-A Manufacturing Perspective:- Introduction – CAD/CAM – Materials Requirement Planning (MRP) – Bill of Materials (BOM) – Closed Loop MRP – Manufacturing Resource Planning (MRP-II) – Distribution Requirements Planning (DRP) – Product data Management (PDM) – Data Management – Make-to-order (MTO) and Make-to-stock (MTS) – Assemble –to-order (ATO) – Engineerto –order(ETO) and Configure-to-order(CTO). Benefits of ERP: - Introduction – Reduction of Lead Time – Ontime shipment – in Cycle Time – Improved Resource Utilization - Better Customer Satisfaction – Quality costs. (10 Periods) UNIT – III ERP Modules: - Finance – Plant Maintenance – Quality Management – Materials Management - Human Resource Management - Sales & Distribution – Plant Maintenance. ERP Market – SAP – Baan Company – Oracle Corporation – People soft. (10 Periods) UNIT – IV ERP Implementation Lifecycle:- Introduction – Pre-evaluation Screening – Package evaluation – Project Planning Phase – Gap Analysis – Reengineering - Configuration Implementation Team Training – Testing – Post Implementation. (10 Periods) UNIT – V Future Directions in ERP:- Introduction – New Markets – New Channels – Business Models – Application platforms – New Business Segments. ERP and Internet – Role of Internet in ERP – Benefits – Technological factors – utilizing IT (Information Technology) in ERP. ERP CASE STUDIES: - A Discussion on the implementation of ERP Projects and its benefits. (10 Periods) Text books: Enterprise Resource Planning (ERP) by Alexis Leon, Tata McGraw-Hill Publishing Company Ltd., New Delhi, 2003 Reference Books: 1. Sadagopan.S , ERP-A Managerial Perspective, Tata McGraw Hill, 2001. 2. Jose Antonio Hernandez, the SAP R/3 Handbook, Tata McGraw Hill, 2001. 3. Vinod Kumar Crag and Bharat Vakharia, Enterprise Resource Planning

Strategy, Jaico Publishing house, Mumbai, 1999 4. ERPWARE , ERP Implementation Framework, Garg & Venkitakrishnan, Prentice Hall, 1999. 5. Vinod Kumar Grag and N.K.Venkitakrishnan, Enterprise Resource Planning, Prentice Hall of India, New Delhi, 2001. Specialization Subject code

B.E Computer Science & Engg C8G

Lecture

Tutorial

Practice

Credit

3

1

--

4

C8G PARALLEL COMPUTING OBJECTIVE: To motivate the students and make them understand the design, analysis and implementation of parallel algorithms on the parallel computers. Unit-I Introduction-Parallel processing terminology-The sieve of Erasthenes-PRAM Algorithms-Model for parallel computation-PRAM Algorithms-reducing the number of processors (10 periods) Unit-II Processor array, Multiprocessors, and Multicomputer-Processor organizations-Processor arraysMultiprocessor-Multicomputers-Flynn’s Taxonomy-Speedup, scaled speedup and parallelizability-Parallel programming languages-programming parallel processes-Sequent C-n Cube C-C-LINDA.-A notation for expressing parallel algorithms. (10 periods) UNIT-III Mapping and scheduling-Mapping data to processors on processor arrays and multicomputers-Dynamic load balancing on multicomputers-static scheduling on UMA multiprocessors-Deadlock-Elementary Parallel algorithms-classifying MIMD algorithms Reduction-Broadcast-Prefix sums. (10 periods)

UNIT-IV Matrix multiplication-sequential algorithms-Algorithm for processor array-algorithms for multicomputerfor multiprocessor-Sorting-Enumeration sort-Odd-even Transposition sort-Bitonic merge-Quick sort-based algorithms-Random read and Random write. (10 periods) UNIT-V Dictionary operations-Complexity of parallel search-Searching on Multiprocessors- Combinatorial SearchDivide and conquer-TSP-Parallel Branch and Bound algorithms-Alpha beta search-Parallel Alpha beta search. (10 periods) TEXT BOOK: Michael J.Quinn,”Parallel Computing, Theory and Practice”, second edition, Tata Mc Graw Hill Publishing Company Limited, New Delhi. Reference book: 1. Michael J.Quinn,”Designing Efficient Algorithms for Parallel Computers Graw Hill Book Company, 1987, I ST EDITION. 2. Kai Hwang, Faye J.Briggs,”Computer Architecture and Parallel Processing”, McGrawHill International Edition, 1989. 3. V.Rajaraman, C.Sivarammurthy,”Parallel Computers-Architecture and Programming”, Prentice Hall of India

Specialization Subject code

B.E. (CSE) C8H

Lecture 3

Tutorial 1

Practice 0

Credit 4

C8H MULTIMEDIA COMPRESSION Objective: To understand various text, audio, image and video compression techniques in Multimedia Unit I Introduction – Compression techniques – Lossless – Lossy – Performance measure – modeling and coding – Huffman coding – algorithm – Codes – Encoding/Decoding procedure – Recommendation – applications (10 periods)

Unit II Arithmetic coding – Coding a sequence – Tags- Generating a binary code – Comparison – Application – Dictionary technique – static –Digram coding – adaptive – LZ77 - LZ78 approach – applications (10 periods) Unit III Transform coding – Types of transform – Karhunen Loeve Transform – Discrete Cosine TransformDiscrete Sine Transform – Discrete Walsh Hadamard transform – Applications – JPEG – Audio compression (10 periods) Unit IV Analysis and Synthesis schemes – Speech compression – Channel vocoder – LPC10 – Code excited linear predictor – Sinusoidal coders – Mixed excitation linear prediction– Image compression – Fractal Compression (10 periods) Unit V

Video compression – Motion compression – Video signal representation – Algorithm for Video conferencing and Video phones – ITU-T recommendation H.261 – Asymmetric applications – Packet video – compression in ATM networks (10 periods) Text Book: 1. Khalid Sayood, Introduction to Data compression, Morgan Kaufmann, Feb 2000 Reference: 1. David Salomon. Data Compression: The Complete Reference. Springer Verlag, 1998.. 2. Timothy C. Bell, John G. Cleary, and Ian H. Witten,Text compression. Prentice Hall, 1990. 3 Jerry Gibson, Toby Berger, Tom Lookabaugh, Rich Baker and David Lindbergh,Digital Compression for Multimedia: Principles & Standards. Morgan Kaufmann, 1998.