+ All Categories
Home > Documents > B.E Computer Science and Engineering

B.E Computer Science and Engineering

Date post: 16-Nov-2014
Category:
Upload: api-3838221
View: 331 times
Download: 0 times
Share this document with a friend
70
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 C Theory C21 Mathematics-I 3 1 0 4 C22 Electrical circuits 3 1 0 4 C23 Material Science 3 1 0 4 C24 Programming in C 3 1 0 4 C25 Electronic Devices 3 1 0 4 C26 Digital System 3 1 0 4 Practical C27 Electronic Devices and circuits Laboratory 0 0 3 2 C28 C Programming Laboratory 0 0 3 2 C29 Workshop Practices 0 0 3 2 Total : 30 III SEMESTER COURSE CODE COURSE TITLE L T P C Theory C31 Mathematics-II 3 1 0 4 C32 Control Systems 3 1 0 4 C33 Computer architecture and Organization 3 1 0 4 C34 Object Oriented Programming 3 1 0 4 C35 Communication Systems 3 1 0 4 C36 Data Structures 3 1 0 4 C39 Professional Ethics 3 0 0 3 Practical C37 Digital Systems and architecture Laboratory 0 0 3 2 C38 Data Structures in C++ Laboratory 0 0 3 2 Total : 31 IV SEMESTER COURSE CODE COURSE TITLE L T P C Theory C41 Mathematics-III 3 1 0 4 C42 Java Programming 3 1 0 4 C43 System Software 3 1 0 4 C44 Operating Systems 3 1 0 4 C45 Microprocessors 3 1 0 4 C46 Computer Networks 3 1 0 4 C49 Professional Communication 1 1 1 2
Transcript
Page 1: 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 SEMESTERCOURSE CODE COURSE TITLE L T P C

Theory C21 Mathematics-I 3 1 0 4C22 Electrical circuits 3 1 0 4C23 Material Science 3 1 0 4

C24 Programming in C 3 1 0 4C25 Electronic Devices 3 1 0 4C26 Digital System 3 1 0 4

PracticalC27 Electronic Devices and circuits

Laboratory0 0 3 2

C28 C Programming Laboratory 0 0 3 2C29 Workshop Practices 0 0 3 2

Total : 30

III SEMESTERCOURSE CODE COURSE TITLE L T P CTheoryC31 Mathematics-II 3 1 0 4C32 Control Systems 3 1 0 4C33 Computer architecture and

Organization3 1 0 4

C34 Object Oriented Programming 3 1 0 4C35 Communication Systems 3 1 0 4C36 Data Structures 3 1 0 4C39 Professional Ethics 3 0 0 3Practical C37 Digital Systems and architecture

Laboratory0 0 3 2

C38 Data Structures in C++ Laboratory 0 0 3 2

Total : 31

IV SEMESTERCOURSE CODE COURSE TITLE L T P CTheoryC41 Mathematics-III 3 1 0 4C42 Java Programming 3 1 0 4C43 System Software 3 1 0 4C44 Operating Systems 3 1 0 4C45 Microprocessors 3 1 0 4C46 Computer Networks 3 1 0 4C49 Professional Communication 1 1 1 2

Page 2: B.E Computer Science and Engineering

PracticalC47 OS and System Software Laboratory 0 0 3 2C48 Microprocessor Laboratory 0 0 3 2

Total: 30

V SEMESTERCOURSECODE

COURSE TITLE L T P C

TheoryC51 Discrete mathematics 3 1 0 4C52 Data Base Management systems 3 1 0 4C53 Advanced Computer Architecture 3 1 0 4C54 Principles of compiler design 3 1 0 4C55 Design and Analysis of Algorithms 3 1 0 4C56 High speed Networks and Quality of Service 3 1 0 4C59 Total Quality Management 3 0 0 3PracticalC57 Network Laboratory 0 0 3 2C58 DBMS Laboratory 0 0 3 2

Total : 31

VI SEMESTERCOURSE CODE COURSE TITLE L T P CTheoryC61 Operations Research 3 1 0 4C62 Numerical Methods and number theory 3 1 0 4C63 Object Oriented Analysis and Design 3 1 0 4C64 Internet Programming and web design 3 1 0 4C65 Software Engineering 3 1 0 4C66 Distributed Computing 3 1 0 4C69 Environmental Science 3 0 0 3PracticalC67 Internet Programming Laboratory 0 0 3 2C68 Visual Programming Laboratory 0 0 3 2

Total: 31VII SEMESTERCOURSE CODE COURSE TITLE L T P CTheoryC71 Network Security 3 1 0 4C72 Software Testing Techniques 3 1 0 4C73 Advanced databases 3 1 0 4C74 Organizational Behavior 3 1 0 4C7X Elective-I 3 1 0 4C7Y Elective-II 3 1 0 4PracticalC77 Applications development lab Using

DB2 0 0 3 2

C78 Software testing Laboratory 0 0 3 2 Total: 28

Page 3: B.E Computer Science and Engineering

VIII SEMESTERCOURSE CODE COURSE TITLE L T P CTheoryC81 Wireless Network Technologies 3 1 0 4C8X Elective-III 3 1 0 4C8Y Elective-IV 3 1 0 4PracticalC84 Project and viva-voce(review starts

from Semester 7)0 0 18 12

Total : 24Total 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 Durationof Examin Hrs

Marks Max.Marks

Minimum forPass

THEORY Continuousassessment

TerminalExam.

TerminalExam

Total

1 C21 Mathematics-I 3 30 70 100 35 502 C22 Electrical circuits 3 30 70 100 35 503 C23 Material Science 3 30 70 100 35 504 C24 Programming in C 3 30 70 100 35 505 C25 Electronic Devices 3 30 70 100 35 506 C26 Digital System 3 30 70 100 35 50

PRACTICALS7 C27 Electronic Devices and

circuits Laboratory3 30 70 100 35 50

8 C28 C Programming Laboratory 3 30 70 100 35 509 C29 Workshop Practices 3 30 70 100 35 50

III SEMESTER

Sl.No.

Sub Code Name of the Subject Durationof Examin Hrs

Marks Max.Marks

Minimum forPass

THEORY Continuousassessment

TerminalExam.

TerminalExam

Total

1 C31 Mathematics-II 3 30 70 100 35 502 C32 Control Systems 3 30 70 100 35 503 C33 Computer architecture and

Organization3 30 70 100 35 50

4 C34 Object Oriented Programming 3 30 70 100 35 505 C35 Communication Systems 3 30 70 100 35 50

Page 4: B.E Computer Science and Engineering

6 C36 Data Structures 3 30 70 100 35 509 C39 Professional ethics 3 30 70 100 35 50

Page 5: B.E Computer Science and Engineering

PRACTICALS7 C37 Digital Systems and architecture

Laboratory3 30 70 100 35 50

8 C38 Data Structures in C++ Laboratory 3 30 70 100 35 50

IV SEMESTER

Sl.No.

Sub Code Name of the Subject Durationof Examin Hrs

Marks Max.Marks

Minimum forPass

THEORY Continuousassessment

TerminalExam.

TerminalExam

Total

1 C41 Mathematics-III 3 30 70 100 35 502 C42 Java Programming 3 30 70 100 35 503 C43 System Software 3 30 70 100 35 504 C44 Operating Systems 3 30 70 100 35 505 C45 Microprocessors 3 30 70 100 35 506 C46 Computer Networks 3 30 70 100 35 50

7C49 Professional Communication 3 30 70 100 35 50

PRATICALS8 C47 OS and System Software

Laboratory3 30 70 100 35 50

9 C48 Microprocessor Laboratory 3 30 70 100 35 50

V SEMESTER

Sl.No.

Sub Code Name of the Subject Durationof Examin Hrs

Marks Max.Marks

Minimum forPass

THEORY Continuousassessment

TerminalExam.

TerminalExam

Total

1 C51 Discrete mathematics 3 30 70 100 35 502 C52 Data Base Management systems 3 30 70 100 35 503 C53 Advanced Computer Architecture 3 30 70 100 35 504 C54 Principles of compiler design 3 30 70 100 35 505 C55 Design and Analysis of Algorithms 3 30 70 100 35 506 C56 High Speed Networks and Quality

of Service3 30 70 100 35 50

7 C59. Total Quality Management 3 30 70 100 35 50PRATICALS

8 C57 Network Laboratory 3 30 70 100 35 509 C58 DBMS Laboratory 3 30 70 100 35 50

VI SEMESTER

Page 6: B.E Computer Science and Engineering

Sl.No.

Sub Code Name of the Subject Durationof Examin Hrs

Marks Max.Marks

Minimum forPass

THEORY Continuousassessment

TerminalExam.

TerminalExam

Total

1 C61 Operations Research 3 30 70 100 35 502 C62 Numerical Methods and number

theory3 30 70 100 35 50

3 C63 Object Oriented Analysis andDesign

3 30 70 100 35 50

4 C64 Internet Programming and webdesign

3 30 70 100 35 50

5 C65 Software Engineering 3 30 70 100 35 506 C66 Distributed Computing 3 30 70 100 35 507 C69 Environmental Science 3 30 70 100 35 50

PRACTICALS8 C67 Internet Programming Laboratory 3 30 70 100 35 509 C68 Visual Programming Laboratory 3 30 70 100 35 50

VII SEMESTER

Sl.No.

Sub Code Name of the Subject Durationof Examin Hrs

Marks Max.Marks

Minimum forPass

THEORY Continuousassessment

TerminalExam.

TerminalExam

Total

1 C71 Network Security 3 30 70 100 35 502 C72 Software Testing Techniques 3 30 70 100 35 50

3 C73 Advanced databases 3 30 70 100 35 504 C74 Organizational Behavior 3 30 70 100 35 505 C7X Elective-I 3 30 70 100 35 506 C7Y Elective-II 3 30 70 100 35 50

PRACTICALS7 C77 Applications development lab

Using DB2 3 30 70 100 35 50

8 C78 Software testing Laboratory 3 30 70 100 35 50

VIII SEMESTERSl.No.

Sub Code Name of the Subject Durationof Examin Hrs

Marks Max.Marks

Minimum forPass

THEORY Continuousassessment

TerminalExam.

TerminalExam

Total

1 C81 Wireless Network Technologies 3 30 70 100 35 50

2 C8X Elective-III 3 30 70 100 35 50

Page 7: B.E Computer Science and Engineering

3 C8Y Elective-IV 3 30 70 100 35 50 PRACTICALS

4 C84 Project and viva-voce(review startsfrom Semester 7)

3 150 150 300 75 150

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

Specialization B.E. (CSE) Lecture Tutorial Practice Credit

Subject code 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

Page 8: B.E Computer Science and Engineering

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C21 3 1 0 4

C21 MATHEMATICS – I

Unit IMultiple IntegralsDouble Integration, Cartesian and Polar Coordinates, Change of order of Integration, Area as a doubleintegral, triple integration in Cartesian coordinates, Change of Variables between Cartesian and Polarcoordinates and between Cartesian and Cylindrical Spherical polar Coordinates.

(10periods)

Unit - IIVector calculusGradient - divergence and curl –Line, Surface and volume integrals Green's,Gauss,Stoke's theorem-simple problems.(with out Proof).Verification of above theorems and evaluation of integrals using them

. (10 periods)

Unit - IIIAnalytic FunctionsFunction of a complex variable, Analytic function, Necessary Conditions, Cauchy Riemann equations inCartesian 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 – IVComplex Integration:Statement and application of Cauchy’s theorem and Cauchy’s integral formula, Taylor and Laurentexpansion, Singularities, Classification, Residues, Cauchy’s Residue Theorem, Contour Integration, UnitCircle and Semi Circular Contours (excluding Poles on real axis).

(10 periods)

Unit VLaplace TransformationLaplace Tranform, Sufficient Conditions,Transforms of elementary functions - properties - inversetransforms , Transforms of derivatives and integrals - derivatives and integrals of transforms -convolution theorem - Transform of periodic functions , Laplace transform of Dirac Delta and Unit Stepfunction ,Second shifting theorem-Application to solution of linear differential equation – Constantcoeffiecient , variable coefficient, simultaneous differential equations, Integral equations, initial and finalvalue 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 McGraw – HillPub , Co.Ltd, NewDelhi , 2002.

Page 9: B.E Computer Science and Engineering

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 B.E. (CSE) Lecture Tutorial Practice Credit

Subject code C22 3 1 0 4C22 Electrical Circuits

Unit I METHODS OF CIRCUIT ANALYSIS

Kirchoff voltage Law – Kirchoff Current Law – Mesh Analysis-Super mesh Analysis – Super modeAnalysis – Source Transformation Technique- Star Delta Transformation.

(10 periods)Unit II

Theorems in Circuit AnalysisSuperposition 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 parallelresonance. (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. (10periods)

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 impedanceParameters – 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 McgrawHill , 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.

Page 10: B.E Computer Science and Engineering

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

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C23 3 1 0 4

C23 Material Science

Unit – IConducting Materials : Free electron theory of metals – Relaxation time – Mathiiessen’s conductivity –Wiede – mann Franz law – Mobility of Charge Current – Hall Effect – Hall Voltage – Hall CoefficientDetermination.Semiconducting Materials: Elemental Semiconductors – Intermetallic III-V Compounds – CompoundSemiconductors – Oxides – Organic Semiconductors. (10 periods)

Unit – IIMagnetic Materials: Langevin Theory of Diamagnetism & Paramagnetism – Weiss Theory ofFerromagnetism – Domain Structure – Hard and Soft Magnetic Materials – Ferrites and Their Uses.Super Conducting Materials: Meissner Effect – Josephson Effect (Both AC & DC) – BCS Theory onSuperconductors – Application of Superconductors – High Temperature Super Conducting Materials.

(10periods)

Unit – IIIDielectric 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 – FuelCell (Qualitative Study Only) – Thin Films – Electron Beam Deposition Method – Sputtering Method –Applications. (10 periods)

Unit – IVOptical Properties: Introduction – Optical Absorption Coefficient – Ionic Conduction – Optical RefractiveIndex 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 – VSmart Materials: Introduction to Smart Materials – Generation of Smart Materials – MultifunctionalMaterials – 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, 20002. Azaraf and Brophy. J, “Electronic Process in Materials”, McGraw Hill, 1963.3. S.P.Suhatme, Solar Energy, McGraw Hill, New Delhi, 1990.

Page 11: B.E Computer Science and Engineering

Specializations B.E. (CSE) Lecture Tutorial Practice CreditSubject code C24 3 1 0 4

C24 PROGRAMMING IN CObjectives : To make the student to understand the concepts in C programming language and enable themto develop good programming skills.

Unit – IGetting 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 – IIC Preprocessors – Features of C Preprocessor, Macro Expansion, File Inclusion, Conditional Compilation,Miscellaneous DirectivesArrays – More On Arrays, More than One dimension - Initializing a two dimensional array, Memory Mapof a two dimensional array, Passing 2 D array to a functionPup petting On Strings – More about Strings, Standard Library String Functions, Two Dimensional Arrayof Characters.Structures – Why use structures, Array of Structures, Additional Features of Structures, Uses Of Structures

(10Periods)

Unit – IIII/O in C – Types of I/O, Console I/O Functions, Disk I/O Functions, I/O Redirection, I/O under WindowsInteraction with H/W in C – DOS Approach, ROM – BIOS, CPU Registers, Interrupts and InterruptVector 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

(10periods)

Unit – IVAn Introduction to pointers – Pointers and Arrays – Passing Array Elements to a Function, Pointers andArrays, Passing an Entire Array to a Function, Multidimensional array, Pointers and Two DimensionalArrays, Array of Pointers, Pointers and Strings-Standard Library Functions, Two Dimensional Array Ofcharacters, Array of Pointers to Strings, Limitation of Array of Pointers to Strings

(10periods)

Unit – VPointers and Structures – An Array of Structures, Structure Pointer, Dynamic Memory Allocation, LinkedLists, 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)

Page 12: B.E Computer Science and Engineering

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 PhilipE.Margolis A software Engg Approach – Naraosa Publishing House -1993

Specialization B.E. (CSE) Lecture Tutorial Practice Credit

Subject code 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- EquivalentCircuits- Transition and Diffusion Capacitances- Reverse Recovery Time- Zener Diodes- Diode Arrays-Load line analysis – Diode Approximations – Series Diode Configurations with DC inputs _ Parallel andSeries-parallel Configurations – Light Emitting Diodes, Schottkey – Varactor, Power, Tunnel Diode

(10Periods)

Unit II : BJT and Biasing : Transistor and construction – Operation – Common Base, Common Emitter,Common Collector Configurations – Transistor and amplifying action – Operation Limits- TransistorTesting – Operating Point – Fixed Bias – Emitter Bias - Voltage Divider Bias Circuits – Bias Stabilization -Thermal runaway- Thermistor, Sensistor compensation, heat sink

(10Periods)

Unit III : FETs and Biasing : Field Effect Transistors – Construction and Characteristics- TransferCharacteristics – Relationships – Depletion type MOSFET- Enhancement Type MOSFET- VMOS-CMOS- Fixed Bias, Self Bias, and Voltage Divider Bias Configurations – P channel FETs – UniversalJFET Bias Curve. (10Periods)

Unit IV: Special Semiconductor Devices : Photo Diodes – Photo Conductive cells- IR Emitters- LiquidCrystal Displays – Solar cells – Thermistor – SCR – Operation Characteristics and Applications- GTO-SCS- Shockely diodes- Laser activated SCR –DIAC- TRIAC – UJT- Photo Transistors – Opto Isolators-Programmable 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 – TimerNetwork – 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, PersonEducation 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.

Page 13: B.E Computer Science and Engineering

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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C26 3 1 0 4

C26 DIGITAL SYSTEMSObjective: It is aimed at developing the skills to work effectively in specialized areas such as industrialautomation, communications and process control. It also emphasizes on hardware descriptive languages(Alter Max + Plus II, Logic Works IV), which promotes portability.

UNIT-INumber systems, Combinational system design, Development of truth tables, Don’t care conditions.Switching algebra and logic circuits:- Definition, Basic properties of switching algebra, Manipulation ofalgebraic functions, Implementation of functions with AND,OR,NOT gates, From the truth table toalgebraic expressions, Introduction to Karnaugh map, Complement and product of sums, NAND, NOR &Ex-OR gates, Simplification of algebraic expression, Manipulation of algebraic functions and NANDgate implementations. A more general Boolean algebra (10 periods)

UNIT-IIKarnaugh map, Algorithm minimization technique, Delay in combinational logic circuits,Adders, Decoders, Encoders, Priority encoders, Multiplexers, Three state gates, Gate arrays-ROM’s, PLA’sand PAL’s-Designing with ROM’s- Designing with PLA’s – Designing with PAL

(10 periods)

UNIT-IIISequential systems-Latches and flip-flops-Design process for synchronous sequential systems-Analysis ofsequential systems- Flip-flop design techniques-Design of synchronous counters-Design of asynchronouscounters-Derivation of state tables and State diagrams (10 periods)

UNIT-IVSolving larger sequential problems-Shift registers, counters, Programmable Logic devices-Design usingASM diagrams-Hardware design language (10 periods)

UNIT-VSimplification of Sequential circuits: - Tabular method for state reduction, Partitions, State reduction usingpartition, 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

Page 14: B.E Computer Science and Engineering

Specialisation B.E. (CSE) Lecture Tutorial Practice CreditSubject code C27 0 0 3 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C28 0 0 3 2

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

Page 15: B.E Computer Science and Engineering

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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C31 3 1 0 4

C31 MATHEMATICS – II

Objective: To emphasize the development of rigorous logical thinking and analytical skills. Based on thiscourse to give adequate exposure to theory and applications of Fourier series, Fourier transforms,PDEand BVP

UNIT – IFourier 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 TransformationFourier integral theorem,- Fourier transforms - Fourier sine and cosine transforms – Properties-Convolution theorem, Parseval’s identity, Introduction to Discrete time Fourier Transform and fast Fouriertransform, simple problems

(10 Periods)UNIT - III

Partial Differential Equations

Formation, solution of standard types of first order equations, Lagrange’s linear equation, linear Partialdifferential equation of second and higher order with constant coefficient (10 Periods)

UNIT - IVBoundary Value Problems

Classification of second order linear partial differential equations, one-dimensional wave equation, onedimensional 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 seriesand Fourier transform method. Laplace equation in polar coordinates ,solution by Fourier series method.

(10 Periods)

Page 16: B.E Computer Science and Engineering

Text books :1.Grewal, B.S., Higher Engineering Mathematics, 36th Edition ,Khanna Publishers, New Delhi,2001.

Reference Books:1.Veerarajan,T Engineering Mathematics,(for semester III) 2nd edition Tata MCGrawHill Pub .Co.LtdNewDelhi 20021.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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C32 3 1 0 4

C32 CONTROL SYSTEMS

Objective: To provide basic knowledge about the mechanisms in control system

unit – IBasic Concepts and Representation : Terminology – Open loop and Closed loop Control Systems –Transfer function Representation – Block Diagram Representation – State Space Representation – Signalflow graph Representation – Block Diagram Reduction (10 Periods)

Unit – IITime Domain Analysis : Standard Test Signals – Time Response of First order and Second Order ControlSystems subjected to Unit Step input – Performance Specifications – Steady State Error – Static andDynamic Error Constants

(10 Periods)

Unit – IIIFrequency Domain analysis : Introduction – Frequency domain Specifications – Correlation betweentime and Frequency response – Bode Plot Stability : The concept of Stability – Routh Hurwitz Stability criterion – Stability Assessment throughBode plot

(10 Periods)

Unit – IVState Variable Analysis : Introduction – Concepts of State – State Space Representation using Physicalvariables – Derivation of Transfer Function from State model – Diagonalisation – Eigen Values and EigenVectors – Solution of State Equation – Controllability and Observability

(10 Periods)

Unit – VDigital Control Systems : Introduction – Digitization – Principles of signal Conversion – Review of Ztransforms 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)

Page 17: B.E Computer Science and Engineering

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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C33 3 1 0 4

C 33 COMPUTER ARCHITECTURE AND ORGANISATION

Objective: To provide a basis knowledge in the organization and the architecture of the Computer.

UNIT – IBasic 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 andQueues – Subroutines. (10 Periods)

UNIT – IIBasic Processing Unit – Some Fundamental Concepts – Execution of Complete Instruction – Multiple-BusOrganization – Hardwired Control – Micro programmed Control.

Arithmetic – Addition and Subtraction of Signed Numbers – Multiplication of Positive Numbers – Signed-Operand 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 – InterfaceCircuits – Standard I/O Interfaces. (10 Periods)

UNIT – VPipelining – Basic Concepts – Data Hazards – Instruction Hazards – Super scalar Operation – PerformanceConsiderations. (10 Periods)

Page 18: B.E Computer Science and Engineering

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 KauffmannPublishers, Third Edition, 2005.2. John P Hayes, " Computer Architecture and Organization ", Tata McGraw Hill, Second Edition.

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C34 3 1 0 4

C34 OBJECT ORIENTED PROGRAMMING IN C++

Objective: To understand the basic concepts of object oriented programming and to enable the student towrite object oriented program.

UNIT – IIntroduction – Object oriented technology- Disadvantages of conventional technology – Programmingparadigms – 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 – Memberfunctions 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 – Memorymanagement operators – Comma operator – review of control structures- Function in C++ - Parts offunction – Passing arguments – Return by reference – Default arguments – Inline functions – Functionoverloading.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 anddestructors – Qualifier and nested classes – anonymous objects.Keyword operator – over loading un array operators – operator return type – over loading binaryoperators – over loading with friend function – Type conversion.

(10 Periods)UNIT - IV

Access specifiers and simple inheritance – Types of inheritances – virtual base classes – Constructors anddestructors – object as a class member – abstract classes – Qualifier classes and inheritance – pointers andinheritance – 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)

Page 19: B.E Computer Science and Engineering

UNIT - VVirtual functions and pure virtual functions – array of pointers – abstract classes – Bonding –Introduction to templates – class and function templates – Principle of exception handling – Exceptionhandling mechanism.Introduction with files-file stream classes-steps of file operations-checking for errors and end of file-opening 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, NewDelhi , Second Indian Reprint,2004.

Page 20: B.E Computer Science and Engineering

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C35 3 1 0 4

C35 COMMUNICATION SYSTEMS

Objective: An Engineering student needs to have some basic knowledge about the communication systemand the modes of communication, which this subject helps.

UNIT – IElectronic Communication systems – Modulation and Demodulation- Electromagnetic Spectrum –Bandwidth and Information Capacity – Transmission Modes – Circuit arrangements – Signal analysis –Mixing – Noise analysis. (10 Periods)

UNIT – IIPrinciples of AM – AM Modulation circuits – AM transmitters – Receiver Parameters-AM Receivers.

(10Periods)

UNIT – IIISSB systems – Introduction to SSB transmitters and receivers – Angle modulation – Phasor representationof an angle modulated wave – Average Power – Pre emphasis and De emphasis – Frequency and Phasemodulators – Angle Modulation versus Amplitude modulation – Introduction to FM Demodulators.

(10Periods)

UNIT – IVTransverse electromagnetic waves – Types of transmission lines – Transmission line wave propagation –Terrestrial Propagation of Waves – Basic Antenna Operation – Antenna reciprocity – Basic and specialpurpose antennas. (10 Periods)

UNIT – VIntroduction to Optical Fiber Communications – System Block Diagram – Fiber Types – LightPropagation – 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C36 3 1 0 4

C36 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 DataStructures:- Lists: List ADT, array implementation, linked lists, doubly and circularly linked lists, sorted

Page 21: B.E Computer Science and Engineering

linked lists, inheritance and virtual functions, The stack ADT : model, implementation, applications – TheQueue ADT : Model, implementation, applications.

(10 Periods)Unit-II

Trees : Preliminaries: implementation of trees , tree traversals - Binary trees: implementation , expressiontrees - The search tree ADT – Binary search trees: make_ empty, find, insert, remove - AVL trees : singlerotation, double rotation, Splay trees : splaying , Tree traversals- B-Trees (10 Periods)

Unit-IIIHashing : 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- Skewheaps- 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 – TheDisjoint set ADT : equivalence relations , dynamic equivalence problem, smart union algorithms, pathcompression.

(10 Periods)Unit-V

Graph Algorithms:-Representation of graphs- topological sort – shortest path algorithms – network flowproblems – 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 edition3. Algorithms in C++ by Robert Sedgwick, Pearson Education Asia, 2002.

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C37 0 0 3 2

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

Page 22: B.E Computer Science and Engineering

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. Total No. of Periods : 50

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C38 0 0 3 2

C38 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C39 3 0 0 0

C39 PROFESSIONAL ETHICS

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

ENGINEERING ETHICS

Page 23: B.E Computer Science and Engineering

Senses of 'Engineering Ethics' - variety of moral issues - types of inquiry - moral dilemmas - moralautonomy -Kohlberg’s theory -Gilligan’s theory - consensus and controversy - professions andprofessionalism – professional ideals and virtues - theories about right action - self-interest-customs andreligion - uses of ethical theories

(10 Periods)Unit II

ENGINEERING AS SOCIAL EXPERIMENTATIONEngineering as experimentation - engineers as responsible experimenters - codes of ethics-a balancedoutlook on law-the challenger case study (10 Periods)

Unit IIIENGINEER'S RESPONSIBILITY FOR SAFETYSafety and risk - assessment of safety and risk - risk benefit analysis-reducing risk-the three mile island andChernobyl case studies. (10 Periods)

Unit IVRESPONSIBILITIES AND RIGHTSCollegiality 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 VGLOBAL ISSUESMultinational corporations - environmental ethics-computer ethics-weapons development-engineers asmanagers-consulting engineers-engineers as expert witnesses and advisors-moral leadership-sample codeof 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, andConscience”, 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C41 3 1 0 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.

(10periods)

UNIT – IITests of Hypothesis: Hypothesis testing, Testing hypothesis involving means & proportions, comparison ofsmall samples & large samples, t-test, z-test, comparison of variances, F test, Test of Goodness of fit Chi-square test, Contingency table included.

Page 24: B.E Computer Science and Engineering

(10 periods)

UNIT – IIICalculus of variations: Functional, Euler’s equation, Functional involving higher order derivatives, severaldependent variables, Geodesics, Isoperimetric problems, Raleigh – Ritz method.

(10periods)

UNIT – IVBoundary 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 elementmethod in solving BVPs in ODE, simple problems.

(10periods)

UNIT –V Graph Theory: Basic definitions in graph, paths, trial, circuits, Trees, Properties distance and center in atree, Tooted and binary trees, Spanning trees, Adjacency matrix, Incidence matrix.

(10

periods)Text Books:

1. Veerarajan, T., Probability, statistics and random processes, Tata McGraw Hill, 2002 (For Unit I& II).

2. Grewal, B.S., “Higher Engineering Mathematics”, Thirty Sixth Edition, Khanna Publishers, Delhi,2001. (For Unit III)

3. M.K. Jain “Numerical Solution of Differential Equations” New Age International Publication2000. (For Unit IV).

4. Narasingh Deo, Graph Theory with applications PHI 1998 (For Unit V)

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C42 3 1 0 4

C42- JAVA PROGRAMMING

Objective: To understand the concepts for programming in Java

Unit-IThe Genesis of Java-An Overview of Java - Data types, Variable and Arrays - Operators- Controlstatements. (10 Periods)

Unit IIFundamentals –declaring objects-Constructors class, This key word-Garbage collection - Overloadingmethods-Overloading constructors-using objects as parameters-arguments passing-access control-Static-Final-Nested and Inner Classes (10 Periods)

Unit IIIInheritance – 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

Page 25: B.E Computer Science and Engineering

(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. Herbert Schildt, Java 2 The complete reference, TMH, 2002.2. Ken Arnold, James Gosling, The JAVA language, II edition, Addison Wesley, 1998.

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C43 3 1 0 4

C43 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 - machinearchitecture- Programming – Traditional machine – CISC – VAX – Pentium Pro – RISC machines –UltraSPARC – PowerPC – Cray T3E (10 Periods)

Unit – IIAssemblers-Basic functions – Assembler algorithm and Data structures – Machine dependent assemblerfeatures- Instruction formats – Addressing modes – Program relocation - machine independent assemblerfeatures- Design of assemblers – One pass – multipass assemblers - Implementation examples

(10 Periods)Unit – III

Loaders – Basic functions – Machine dependent loader features – Relocation – Linking - Machineindependent loader features- Automatic library search – Loader options – Design of loader – Linkageeditors – Dynamic linking – Bootstrap loaders Implementation examples(10 Periods)

Unit - IVMacro 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

(10Periods)

Unit – VFormal systems and Programming Languages – Uses of Formal System in Programming Language –Formal Specification – Formal Grammars – Hierarchy of Languages – BNF – Canonic Systems andFormal 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, 19922) D. M. Dhamdhere,”System Programming & Operating Systems”, Tata

McGraw Hill, 1995

Specialization B.E. (CSE) Lecture Tutorial Practice Credit

Page 26: B.E Computer Science and Engineering

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 upprojects in the same.

Unit – IIntroduction – What is an Operating System – The Operating System Zoo-Operating System concepts-System calls-Operating System structureProcesses- The process model-Process creation, termination, hierarchies-Process states-Implementation ofprocesses.Threads-Thread model-Thread usage-Implementing thread in user space, Kernel-Scheduler activations-Pop-up threads-Making Single threaded code Multithreaded. (10 Periods)

Unit – IIIntroduction to Scheduling - Scheduling in batch systems-Interactive systems-Real time systems-Policyversus mechanism-Thread schedulingInterprocess communication-Race condition-critical regions-Mutual exclusion with busy waiting-sleep andwake-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 fixedpartitions-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 avoidance-Deadlock prevention-Other issues.File Systems-Files-naming,Structure,Types ,Access,Attributes,Operations.Directories- File system implementation. (10 Periods)

Page 27: B.E Computer Science and Engineering

Unit – VInput/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 Unix-The 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C45 3 1 0 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 PCUnit I

INTEL 16 bit microprocessors Register organization of 8086-architecture-Physical memory organization-IO addressing capability-Special processor activities- 8086 Instruction set and Assembler directivesAddressing 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 8086Programming with assembler, Assembly language example programs. Special architecture features andrelated 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 ( SoftwareInterrupts), MACROS (10 Periods)

Unit IIIBasic peripherals and their interfacing with 8086/8088 – Interfacing I/OOD Ports PPI ( Prog PeripheralInterface(8255), Modes of Operation of 8255, Special Purpose Programmable peripheral devices and theirinterfacing: Prog Interval Timer(8253),Prog Interrupt Controller (8259) INTEL 32 BITMICROPROCESSORS: 80386 DX- silent features of 80386dx, Architecture of 80386 RegisterOrganization of 80386, Addressing Modes Data types, Real addressing Modes, Protected mode of 8086Segmentation ,Paging, Virtual 8086 Mode, Enhanced Instruction Set of 8086 (10 Periods)

Unit IVExploring Memory Hierarchy: Introduction ,basis of Cache, Measuring and Improving Cache Performance,Virtual Memory, A Common Framework for Memory Hierarchies, The Pentium 4 Memory HierarchyStorage Networks and Other Peripherals Introduction, Disk Store and Depend- ability , Reliability andAvailability RAID, Busses and Other Connections between Processors Memory and I/O Devices Fire wire1394 , UNIVERSAL Serial Bus (USB2.0), Line printer Interfaces (LPT parallel port),Accelerated graphicsport (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. (10Periods)

Unit VAccessing and Understanding Performance Introduction, CPU Performance and its factors Evaluatingperformance, Two SPEC Benchmarks and the Performance of recent Intel Processors EnhancingPerformance of Pipeline An Overview of pipeline basic Issues involved in pipeline :IA-32 based advancedmicroprocessor: Pentium onwards : Salient features of Pentium, A few relevant concepts of ComputerArchitecture, System Architecture, Branch Prediction, Enhanced Instruction set of PentiumMMX-

Page 28: B.E Computer Science and Engineering

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

Page 29: B.E Computer Science and Engineering

Text Books:1. Advanced Microprocessor and peripherals – A K Ray , K M Bhurchandi TMH 2000.Sixteenth

Reprint(Unit I,II,III & V)

Reference book1. Computer Organization and Design David A Patterson, John. L Hennessey –The Hardware / SoftwareInterface 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C46 3 1 0 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 designissues 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 forcommon service- Network architecture: Layering and protocols, OSI Architecture, Internet architecture,Protocol implementation issues.- Performance: Bandwidth and latency, Delay BW product, High speednetworks, Application performance needs. (10periods)

Unit – II

Direct link networks: Hardware building block: Nodes and links- Encoding- Framing: Byte and bitoriented protocols- Error detection: Internet checksum algorithm, CRC- Reliable transmission: stop andwait protocol, sliding window protocol- Ethernet and token rings: physical properties and access control-Wireless 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- Simpleinternetworking: Introduction, service model, global address, Datagram forwarding- Routing: Graphrepresentation, 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 endissues, segment format, three way handshake- TCP extension- Remote procedure call – Date expression-lossless compression algorithms for image, video and audio : JPEG,MPEG, MP3. (10 periods)

Unit– V Network security and Applications: Cryptographic algorithms: Requirements, DES, RSA and MD5-Firewalls: Filter based and proxy based- DNS: Domain hierarchy, name servers and solutions.- Electronicmail, world wide web- Multimedia Applications: Real time transport protocol, session control and callcontrol. (10 periods)

Page 30: B.E Computer Science and Engineering

Text BookLarry L. Peterson and Bruce S. Davie, “Computer networks-A system Approach”, Third Edition, McGrawHill Reference books:

1 CCNA3 and 4 companion guide, Third edition, Pearson education.2 Andrew S.Tanenbaum, “Computer Networks”, Prentice Hall of India3 Dimetri Bertsekas and Robert Gallager, “Data Networks”, PHI, 1994.

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C47 0 0 3 2

C47 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 Total No. of Periods: 50

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C48 0 0 3 2

C48 Microprocessor Laboratory

Objective: To understand the basic concepts in Microprocessor and implement programs to verify thefunctionality of the interfaces

Cycle 1

1. Addition and Subtraction of 8 bit numbers.

2. Multiply and Divide 8 bit numbers.

Page 31: B.E Computer Science and Engineering

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. Total No. of Periods : 50

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C51 3 1 0 4

C51 DISCRTE MATHEMATICSObjective: The main objective of this course is to introduce most of the basic terminology used inadvanced courses of computer science. The topic set theory, logic theory, Algebraic structures andAutomata theory will be used in practical applications- particularly related to Computer Science. Thesetopics support more advanced courses in Computer Science program such as Automata theory, ArtificialIntelligence and software designing.

UNIT IMathematical Logic –Introduction-Statements and Notations-Negation-Conjunction-Disjunction-Truthtable – Conditional – Biconditional-Tautologies-Equivalence of Formulas-Duality Law- TautologicalImplications – Functionally Complete set of Connectives-Other Connectives- Two state Devices &Statement Logic –Normal Forms. (10 periods)

UNIT IIThe Theory of Inference for the Statement Calculus-Validity Using Truth Table-Rules of Inference-Consistency of Premises and Indirect Method of Proof-Automatic Theorem proving – The PredicateCalculus-The statement Funtion,Variables and Quantifiers-Predicate Formulas-Free and Bound variables-The Universe of Discourse-Inference Theory of the Predicate Calculus.

(10 periods)

UNIT IIISet Theory- Basic concepts of Set Theory – Some Operations on Sets – Some Basic Set Identities-OrderedPairs and n-tuples-Cartesian Products – Relations –Properties of Binary Relation-Relation Matrix and theGraph of a Relation-Partition and Covering of a Set- Equivalence Relations-Compatibility Relations-Composition of Relations-POset-Funtions-Definition-Composition of Funtions-Inverse Functions.

(10periods)

Page 32: B.E Computer Science and Engineering

UNIT IVFinite Automata and Regular Expressions-Basic definitions-Nondeterministic finite automat-EiniteAutomata with e-moves – Regular expressions-Two-way finite automata-Finite automata with output.

(10periods)

UNIT VProperties of Regular Sets-The pumping lemma for regular sets-Closure properties of regular sets-Context-free grammars-Derivation trees-Chomsky normal form-Greibach normal form.

(10periods)Text Books:1. J.P.Tremblay , R.Manohar,”Discrete Mathematical Structures with Applications to ComputerScience,Tata McGraw-Hill,1997(Unit I,II & III)2. John E.Hopcroft ,Jeffrey D.Ullman,”Introduction to Automata Theory, Languages andComputation,Narosa Publishing House,1997(Unit IV and V)Reference Books:1. Dr.MK.Venkataraman,Dr.N.Sridharan & N.Chandrasekaran,”Discrete Mathematics”. The NationalPublishing Company ,Chennai.2. Kenneth H.Rosen,”Discrete Mathematics and Its Applications” Fifth Edition, Tata McGraw- HillEdition,2003.

Page 33: B.E Computer Science and Engineering

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C52 3 1 0 4

C52 Data Base Management System

Objective: To understand the fundamentals of databases and learn about resent trends.

Unit 1Introduction: purpose of database systems - View of data - Data Model - Database languages - TransactionManagement - 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 DatabasesSQL: Basic Structure - Ste Operations - Aggregate Functions - Null Values - Nested Sub Quires - DerivedRelations - Views - Modification Of Databases - Joined Relations - DDL - Embedded SQL - Other SQLFeatures.

(10 Periods)Unit III

Integrity Constraints: Domain Constraints - Referential Integrity - Assertions - Triggers - FunctionalDependenciesRelational Database Design: Pitfalls in database Design - Decomposition - Normalization using FunctionalDependencies - Multi valued Dependencies - Join Dependencies - Domain Key Normal Form - AlternativeApproaches

(10 Periods)Unit IV

Storage and File Structures: Physical Storage Media - Magnetic Disks - RAID - Tertiary Storage - StorageAccess - File Organization - Organization of Records in Files - Data Dictionary - Storage.Indexing and Hashing: Basic Concepts - Ordered Indices - B+ Trees Index Files - Btree Index Files - StaticHashing - Dynamic Hashing - Comparison of Ordered Indexing and Hashing - Index Definition in SQL -Multiple Key Access.

(10Periods)

Unit VTransactions: Transactions Concepts - Transaction State - Implementation of Atomicity and DurabilityExecutions.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 EditionMcGraw Hill Edition (ch 1, 2, 3, 4, 6, 7, 10, 11, 12.1- 12.9, 14.1, 15.1- 15.4)- Units I to IV2. 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.

Page 34: B.E Computer Science and Engineering

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 DesignImplementation, Second Edition, Addison Weasly, 1998

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C53 3 1 0 4

C53 Advanced Computer Architecture

Objective: To give an exposure in the advanced topics of Computer architecture and Parallel computingmodels.

Unit I

Parallel Computing models-State of computing-Multiprocessor and multicomputers-PRAM and VLSImodel-Program and Network properties-Conditions of parallelisms-Program partitioning and scheduling-Program flow mechanism-system interconnect architectures

(10Periods)

Unit IIProcessors –Advanced processor technology-Superscalar and Vector processors-Vector processingprinciples-Multifactor multiprocessors-Compound vector processing-SIMD Computer organization-Dataflow architectures. (10 Periods)

Unit IIIInstruction Level Parallelism: Concepts and challenges-Overcoming Data Hazards and DynamicScheduling- Dynamic Scheduling: Examples and Algorithms-Reducing Branch costs with DynamicHardware prediction-High-Performance Instruction Delivery- Studies of Limitations on ILP.

(10 Periods).

Unit IVMultiprocessors and Thread –Level Parallelism-Introduction-Characteristics of Application Domains-Symmetric Shared-Memory Architectures-Performance of Symmetric Shared memory Multiprocessors-Distributed Shared memory Architectures-Performance of Distributed Shared memory Multiprocessors-Synchronization-Models of Memory consistency: An introduction

(10 Periods)Unit V

Pipelining: Basic and intermediate Concepts-Introduction-The major hurdle of Pipelining-Pipeline hazards-How is Pipelining implemented-What makes Pipelining hard to implement-Extending the MIPS Pipeline tohandle Multicycle Operations- Crosscutting issues

(10 Periods)

Text Books:1.John .L. Hennessy & David .A Patterson , Computer Architecture - A Quantitative Approach, MorganKaufmann 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.

Page 35: B.E Computer Science and Engineering

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C54 3 1 0 4

C54 - Principles of Compiler Design

Objective: To understand the concepts of compiler and learn how to design the various phases of acompiler for any high level language

Unit IIntroduction to compiling: Compilers, Analysis of the source program, Phases of a compiler, Cousins of acompiler, Grouping of Phases, Compiler – construction tools.A Simple one pass compiler: Overview, syntax definition, syntax-directed translation, Parsing, A translatorfor simple expressions. (10 Periods)

Unit IILexical Analysis: Introduction, Incorporating a symbol table, The role of the lexical analyzer, Inputbuffering, Specification of tokens , A language for specifying lexical analyzer, Finite Automata , From aregular expression to an NFA, Design of a lexical analyzer generator.

(10Periods)

Unit IIISyntax 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 IVRun-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 VCode Optimisation: The principal sources of optimisation, Loop optimization, The DAG representation ofbasic blocks, Dominators, Reducible flow graphs, Loop- invariant computation , Induction variableelimination.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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C55 3 1 0 4

Page 36: B.E Computer Science and Engineering

C55DESIGN AND ANALYSIS OF ALGORITHMS

Objective: To give an exposure on fundamental techniques which is used to design and analyze anefficient algorithm.

Unit IIntroduction – Mathematical Notation – proof Techniques – contradiction and Mathematical Induction.-Generalized mathematical induction.Program Performance – Introduction – Space Complexity – Components of Space Complexity TimeComplexity – 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 IIElementary Algorithms – Introduction – Efficiency of Algorithms – Average and Worst Case Analysis.-Binary search-Sequential searchAnalysis Of Algorithms: Analyzing Control Structures-Average Case Analysis-Amortized Analysis-Potential, Accounting, Aggregate methods-Solving Recurrences-Homogeneous recurrences-Inhomogeneous recurrences-Change of variable-Range transformations-Asymptotic recurrences.

(10 Periods)Unit III

Greedy Algorithms: General Characteristics-Minimum Spanning Trees-Kruskal’s-Prim’s algorithm-Dijkstra’s Shortest Path algorithm-Knapsack Problem: Divide And Conquer: Introduction-Binary Search-Sorting - Finding the Median-Matrix Multiplication- Exponentiation.

(10 Periods)Unit IV

Dynamic Programming: Introduction-Principle Of Optimality-Knapsack Problem-Shortest Paths- ChainedMatrix Multiplication-Recursion-Memory Functions.Exploring Graphs: Traversing Trees – Depth First Search – Undirected and Directed Graphs - Breadth FirstSearch - Back Tracking – Branch and Bound. (10 Periods)

Unit VComputational Complexity: Introduction-Information Theoretic Arguments-Adversary Arguments-LinearReductions-Reductions among matrix problems-Reductions among shortest path problems-Introduction toNP Completeness. -The classes P and NP-Polynomial reductions-NP-complete problems-NPcompleteness 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 , PrenticeHall of India, 1998.2.Jeffrey J.McConnell-Analysis Of Algorithms-An active learning approach”-Narosa-2002

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C56 3 1 0 4

C56 High Speed Networks and Quality of Service

Page 37: B.E Computer Science and Engineering

Objective: To understand the concepts in Advanced Network technology and learn about the researchtrends in Congestion control, flow control and QoS.

Unit IFast Ethernet-Gigabit Ethernet-MAC Sublayer-Physical layer-Implementation of physical layer-Fiberchannel-Frame relay networks. (10 Periods)

Page 38: B.E Computer Science and Engineering

Unit IIEffects of congestion- Congestion and control- Traffic Management- Congestion control in Packetswitching networks - frame relay Congestion control -The need for flow and error control- Link controlmechanisms- ARQ Performance (10 periods)

Unit IIITCP 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 IVQOS in IP networks- Integrated services Architecture - Queuing discipline - Random Early Detection -Differentiated services - RSVP - MPLS. (10 Periods)

Unit VIntroduction to IEEE802.11 standards-802.11 protocol stack-802.16 protocol stack-physical and MACprotocols-comparison of 802.11 with 802.16DSL Technology - ADSL - Other DSL technologies - Cable modem - Traditional cable networks - HFCnetwork - 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, secondedition, 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C57 3 1 0 4

C 57 : NETWORK LABORATORY

Objective: To provide the basic knowledge in the socket programming and implement few concepts innetwork 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 RS232Cb. TCP/IP

7. Write a program to implement RMI.

Page 39: B.E Computer Science and Engineering

8. Write code simulating the following routing methodologies:a. Distance vector routingb. Link state Routing

9. Write a code simulating Sliding window flow control at the Data Link Layer.

10. Implementation of RSA algorithm

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C58 0 0 3 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C62 3 1 0 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 completeprocedure for solving different kinds of problems that occur in engineering numerically and number theoryfor computer security.

UNIT INumerical Solutions of Algebraic and Transcendental Equations Bisection method, Regula Falsi method,Newton Raphson method, Ordinary iterative method, Horners method, Graffes Root Squaring method,

Page 40: B.E Computer Science and Engineering

Bairstow’s method. (10periods)

UNIT IINumerical solutions of Simultaneous Equations Gauss Elimination method, Gauss Jordan method, Crout’smethod, Gauss Jacobi method,Gauss Seidel method, Relaxation method. Inversion by Gauss Jordan andCrout’s method, Eigen vaues by Power method.

(10 periods)UNIT III

Numerical Solutions of Ordinary and Partial Differential Equations Ordinary Differential EquationsPicards method, Taylor Series method, Euler’s method, Modified and Improved methods, Rungekuttamethod of order four, Milne’s method, Adams method, Boundary value problem by finite differencemethod. 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-ModularArithmetic-Applications of Congruences-Cryptology-Integers and Algorithms – Representation of Integers–Algorithms for Integer Operations- Modular Exponentiation-The Eucidean Algorithm-Applications ofNumber Thoery-Some Useful Results-Linear Congruences-The Chinese Remainder Theorem-ComputerArithmetic with Large Integers- Pseudoprimes – Public key Cryptography – RSA Encryption-RSADecryption-RSA as a Public key system. (10periods)

UNIT VCounting Basic Counting Principles-The Inclusion-Exclusion Principle- Tree Diagrams-The PigeonholePrinciple – The Generalized Pigeonhole principle-Permutations and Combinations-The BinomialTheorem- Pascal’s Identity and Triangle – Other Identities of the Binomial Coefficients – GeneralizedPermutation and Combinations. (10 periods)

Text Books:Curtis F.Gerald , Patrick O.Wheatley, “Applied Numerical Analysis” Fifth Edition, Addison-WesleyPublishing Company,1998 (Units I, II, III)Kenneth H.Rosen,”Discrete Mathematics and Its Applications” Fifth Edition, Tata McGraw- HillEdition,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- Hill5. Tom M.Apostal(1997),Introduction to Analytic Number Thoery,Narosa Publishing House.

SpecializationB.E. (CSE) Lecture Tutorial Practice Credit

Subject code C63 3 1 0 4

C 63 Object oriented analysis and Design

Page 41: B.E Computer Science and Engineering

Objective: To Provide good foundation and resources to understand the fundamental concepts of objectmodel.

UNIT – IConcepts-Complexity –The inherent complexity of software–The structure of complex systems. Briningorder 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 class-Relationships among classes-The interplay of classes and objects.Classification-The importance of proper classification. Identifying classes and objects – Key abstractionsand mechanisms (10 Periods)

UNIT – IIIIntroducing the UML-Overview-A conceptual model of the UML. Basic structural Modeling-Classes-Relationships-Common Mechanisms-Diagrams-Class diagrams-Advanced classes- AdvancedRelationships-Interfaces, Types, and Roles Packages-Object Diagrams.

(10 Periods)UNIT – IV

Basic behavioral Modeling-Interactions-Use case Diagrams-Interaction Diagrams-Activity Diagrams-Events and Signals-State Machines-Process and Threads-Time and Space-Common modeling techniques.State chart diagrams. (10 Periods)

UNIT – VComponents-Deployment-Collaborations-Patterns and frame works- Component diagrams-DeploymentDiagrams-Systems and models-Applying the UML. (10 Periods)

Text Books:1. Object oriented analysis and design with applications. Second edition, Pearson Education .- GradyBooch. (1 st and 2 nd Unit) 2. The Unified Modeling Language –User Guide.- Grady Booch. ,James Rumbaugh,Ivar Jacobson-Addison Wessley.

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 B.E. (CSE) Lecture Tutorial Practice Credit

Subject code C64 3 1 0 4

C64 Internet Programming and Web Design

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

Unit I

Page 42: B.E Computer Science and Engineering

Distributive systems- multi tier architecture, Client Tier, Web Tier, EJB Tier, EIS Tier, implementationchallenges. XHTML – Headers, Linking, Images, Image maps, meta elements, frameset, cascading stylesheets. (10 Periods)

Unit IIDynamic 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. (10Periods)

Unit IVJava Servlets - simple servlet, anatomy of java servlet, Reading Data from client and sending data to aclient, working with cookies, tracking sessions. JSP-tags, request strings, user sessions, cookies, sessionsobjects (10Periods)

Unit VEJB-deployment descriptor, session bean, entity bean, message driven bean. Java RMI. JDBC - drivertypes, 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 2002Reference Books:

1. D.Norton and H.Schildt – Java 2: The Complete Reference – TMH 20002. Deitel & Deitel, Java How to Program, Prentice Hall 1999

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C65 3 1 0 4

C65 SOFTWARE ENGINEERING

Objective: To provide the basic knowledge in the software Engineering and learn various techniques/toolsrequired for efficient development of software.

UNIT - ISoftware Process: Life cycle models-Waterfall model-Incremental Process models-Evolutionary processmodels.Software Process and project metrics : Measures metrics and indicators - Metrics in the process andproject domains - Project metrics - Software Measurement - Metrics for software quality - Measuringquality (10 Periods)

UNIT – IISoftware Project Planning: Project planning objectives - Software Project Estimation - COCOMOmodel-Function point model.Decomposition techniques-Empirical estimation models - Automated estimation tools. Software Quality Assurance : Quality concepts - Quality assurance - SQA Activities - The SQA plan - TheISO 9000 quality standards - The ISO approach to quality assurance systems - The ISO 9001 standard.(10 Periods)

Page 43: B.E Computer Science and Engineering

UNIT – IIISoftware Configuration management: Identification of objects in software configuration-Version control-Change control-configuration audit-status reporting.System Engineering: Computer Based systems - The system engineering hierarchy - Business processengineering- Product engineering- Requirements Engineering-System modeling. Requirement analysis-Analysis Principles-Specification. (10 Periods)

UNIT - IVSoftware Testing Methods: Software testing fundamentals - White box testing - Basis path testing -Control structure testing - Black box testing - Unit testing-Integration testing-Validation testing-Systemtesting. (10 Periods)

UNIT - VClient / Server Software Engineering : The structure of client server systems - Software engineeringfor 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/Stesting tactics.

(10 Periods)Text Books :1. Roger S.Pressman, Software Engineering A Practitioner's Approach, sixth Edition, McGraw HillInternational Edition.,2003

2. Roger S.Pressman, Software Engineering A Practitioner's Approach, Fifth Edition, McGraw HillInternational Edition.,2000Reference Books :1.Ian Somerville-Software Engineering, John Wiley and sons,20032.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.

Page 44: B.E Computer Science and Engineering

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C66 3 1 0 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:-Architecturalmodels-Fundamental Models, Interposes Communication:-The API for the Internet protocols, External datarepresentation and marshalling, Client Server communication, Group communication.

(10 Periods)

UNIT II

Distributed Objects and Remote Invocation: Communication between distributed objects, RemoteProcedure call, Events and notifications. Operating System Support. The operating system layer-Protection-Processes and threads-Communication and invocation-Operating system architecture.

(10 Periods)

UNIT IIIDistributed 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 andlogical clocks-Global states. Coordination and Agreement:- Distributed mutual exclusion- Elections-Multicast communication. (10Periods)

UNIT IVTransactions and Concurrency Control:- Transactions, Nested transactions, Locks, Optimistic concurrencycontrol, Timestamp ordering. Distributed Transactions:- Flat and nested distributed transactions.., Atomiccommit protocols, concurrency control in distributed transactions, Distributed deadlocks, Transactionrecovery. (10 Periods)

UNIT VDistributed 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-PrenticeHall- First Edition- 20022.Ross J.Anderson- Security Engineering: A Guide to Building Dependable Distributed Systems-John

Page 45: B.E Computer Science and Engineering

Wiley & Sons-2001

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C67 0 0 3 2

C67: Internet Programming Lab

Objective: To provide practice in application development in three tier architecture.

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

Specialization B.E. (CSE) Lecture Tutorial Practice Credit

Subject code C68 0 0 3 2

C68- VISUAL PROGRAMMING LABORATORY

Objective: To make the student understand how to design an effective graphical user interface (GUI) for aprogram. The student should learn how to analyze a problem and design a program structure to solve theproblem using an event driven programming language such as Visual Basic or Visual C++

Visual Basic:Form Designing – To Access the Credit Card InformationUsing the structure of the three top-level menu items, File, Edit, and Help, combine them all together tomake one large menu item. Make sure File,Edit,and the Help menu all branch out to their own originalmenu items, and include the separator bars.Use of ODBC, DAO- Using the BIBLIO database, write the SQL Statement required returning thefollowing columnsTable ColumnTitles TitleTitles ISBNAuthors AuthorTitles Year PublishedPublisher Company NameUse of Active X Controls for a Font Demo ProgramUse of Report Generation - To create a form that displays the list of publishers from the Data Environmentby dragging and dropping columns unto the form. Add a button to export the report to HTML.Design of Paint Brush, Notepad , Calculator Using VBMini Project

Visual C++:Creation of Resources- To Access the Credit Card Information

Page 46: B.E Computer Science and Engineering

Drawing in a Window- To Access the Credit Card InformationDocument – Creation , Storing, Printing Without using MFCCreation of Dialog Resources Using MFCWriting 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 Credit

Subject code C71 3 1 0 4

C71 Network Security

Objective: To provide knowledge of security concepts, applications and protocols.

Unit IServices, Mechanisms and attacks - OSI Security Architecture - A model for Network Security - BlockCipher Principles - DES - Strength of DES - Differential and Linear Crypto Analysis - Block CipherDesign Principles - Block Cipher Modes of Operation.

(10 Periods)

Unit IIEvaluation criteria for AES- Introduction AES Cipher - Triple DES - Blowfish - RC5 - Characteristics ofAdvanced Symmetric Block Ciphers - Placement of encryption function - Traffic Confidentiality KeyDistribution.

(10 Periods)Unit III

Principles of Public Key Cryptosystems - RSA Algorithm - Key Management - Diffie Hellman KeyExchange- Authentication Requirements - Authentication Functions.

(10 Periods) Unit IVMessage Authentication Codes - Hash Functions - Security of Hash Functions and MACS - MD5 MessageDigest Algorithm - Secure Hash Algorithm - Digital Signatures - Authentication Protocols - DigitalSignature Standards.

(10 Periods) Unit VElectronic Mail Security - Pretty Good Privacy - IP Security Overview - Architecture - AuthenticationHeader - 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C72 3 1 0 4

C72 – Software Testing Techniques

Objective: To understand the concepts of testing strategies and learn about the research trends in TestingProcess.

Unit I

Page 47: B.E Computer Science and Engineering

Assessing Testing Capabilities and Competencies: Roles of Testing, Defect, Business Perspective ofTesting. Building a Software Testing Strategy: Computer System Strategic Risks, Economics of testing,Economics of System Development Life Cycle, Establishing a testing Policy Structured Approach totesting, Test Strategy, Testing Methodology.

(10 periods)Unit II

Testing Strategies: White-box testing techniques – Statement Coverage – Branch Coverage – Conditioncoverage – Multiple condition coverage – Data flow coverage – Black box testing techniques – Boundaryvalue Analysis – robustness tests – Equivalence partitioning – Levels of testing – Unit, Integration andSystem testing.

(10 periods)Unit III

Establishing a Software testing methodology – Verification & Validation – Functional and StructuralTesting – Eight Considerations in developing Testing Methodologies.Determining Software Testing Techniques : Testing Techniques/tool selection process – Structural Systemtesting techniques – Functional System Testing Techniques – Unit Testing Technique – Functional testingand analysis.

(10 periods)Unit IV

Eleven Step Testing Process: Assess Project Management Development Estimate and status – Develop testplan – Requirement Phase testing 0 Design Phase testing – Program Phase testing Execute test and recordresults – 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 – TestingWeb – 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C73 3 1 0 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, PersistentC++ Systems Object Relational Databases: Nested Relations, Complex Types, Inheritance, ReferenceTypes, Querying with complex types, Functions and procedures

(10 Periods)

Page 48: B.E Computer Science and Engineering

Unit IIXML: Structure of XML data, XML Document Schema, Querying and Transformation, Storage of XMLData, XML ApplicationsDatabase 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 phasecommit, Three Phase commit, Concurrency Control in Distributed Databases: Locking protocols, Timestamping, Deadlock handling, Availability, Distributed Query processing: Query transformation- Simplejoin 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 toDatabases, 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 Formats-Continuous 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, TataMcGraw Hill, 2002.

References:1. Gary W. Hanson and James V. Hanson, "Database Management and Design", Prentice Hall of India PvtLtd, 1999.2 R. Elmasri and S.B. Navathe, "Fundamentals of Database Systems", Addison Wesley, 2000.

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C74 3 1 0 4

C74 ORGANIZATIONAL BEHAVIOUR AND MANAGEMENT

Objective: To expose students the concepts of Organizational Behavior and Management, thereby makingthem to use these principles in decision making in organizational settings.

UNIT IIntroduction to OB- Historical development - Contribution of social sciences -Models of OB-

Understanding of individual behavior-Personality -Determinants of Personality--Personality theories-Learning -Perception-Perceptual process-Development of perceptual skills-Motivation -Theories ofmotivation.

(10 Periods)UNIT II

Understanding of groups-Groups and group dynamics-Types of groups- Formation of groups-Group cohesiveness- Conflicts - Types, Conflicts resolution techniques -Communication-Process-

Page 49: B.E Computer Science and Engineering

Importance--Barriers of Communication-Making communication effective.

(10 Periods)UNIT III

Understanding organization system- Organizational change-Forces for change-Change process-Resistance 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 skills-Planning -Importance and steps- Organizing- Principles of organizing- organizational structures-Staffing-Manpower planning- Recruitment and selection-Directing –Leadership qualities- Styles-Controlling.

(10 Periods)

Page 50: B.E Computer Science and Engineering

UNIT VPlant location- Factors to be considered- Plant layout- Objectives- Types- Merits and demerits-

planning for layout- Plant maintenance- Functions-Types- Merits and demerits- Productivity- Productivityof 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C77 0 0 3 2

C77- Application Development Lab using DB2

Objective: To provide a practice in Application Development using DB2

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

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C71 0 0 3 2

C78 SOFTWARE TESTING LABORATORY

Objective: To enable the students to practice the disciplined approach of software testing by giving anexposure 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 andQuick Test Professional tool - Standard Calculator present in Windows.

a. Record Test Cases and Perform themb. Synchronization of test casesc. Data Driven testingd. Generating Rapid Test Script wizarde. Checking GUI Objects

2. To Perform Regression Testing Using Mercury's Interactive Win Runner tool, SQA Robot Tool andQuick Test Professional tool - Binary Search Program in C

a. Make Changes, Record Test Cases and perform them

Page 51: B.E Computer Science and Engineering

b. Synchronization of test casesc. Data Driven testingd. Generating Rapid Test Script wizarde. Checking GUI Objects

3. To perform Load / Performance testing for a Web - based application Using Mercury's InteractiveLoad Runner tool - Weather India Application.

4. To perform Load / Performance testing for a Database application Using Apache JMeter tool -Weather India Application.

a. JDBC Testb. HTTP Test

5. To Perform Test Process Management Using Mercury's Interactive Test Director Tool - Employeedatabase Application

a. Requirements Managementb. Test Planningc. Test Executiond. Test result analysis

6. To Manage a Project Using Configuration Management Toolsa. 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, MessageMagic tool.

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C81 3 1 0 4

C81 WIRELESS NNETWORK TECHNOLOGIES

Objective: To understand the concepts of wireless networks, protocols, architectures and applications.

UNIT IComparison of wired and Wireless Media - Radio Propagation Mechanisms - Physical Layer Alternatives -Considerations in the Design of Wireless Modems - Wireless Transmissions Techniques - Short DistanceBased Transmission - UWB Pulse Transmission - Carrier Modulated Transmission - Digital CellularTransmission - Broadband Modems for high Speeds - Speed Spectrum Transmissions- Introduction toTDMA, FDMA and CDMA. (10 periods) UNIT IIIEEE 802.11 Wireless LAN standard - Protocol Architecture - Architecture and Services - 802.11 Physicallayer and MAC - Blue Tooth overview - Radio Specification - Base band Specification - Link ManagerSpecification - Logical Link Control and Adaptation Protocol.

(10 periods)

UNIT IIIIntroduction to Network Planning - Wireless Network Topologies - Cellular Topology - Cell Fundamentals- Signal to Interference Ratio Calculation - Capacity expansion Techniques- Network plann9ing for CDMAsystems. (10 periods)

Page 52: B.E Computer Science and Engineering

UNIT IVIntroduction to wireless network operation - Mobility Management - Radio resources and powermanagement - GSM - Services - Reference Architecture - Mechanisms to support a mobile environment -CDMA - IMT 2000. (10 periods)

UNIT VIntroduction to mobile data networks - CDPD network - GPRS and higher data rates - Short messagingServices in GSM - Mobile applications protocols - Introduction to Mobile IP

(10periods)

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 B.E Computer Science & Engg Lecture Tutorial Practice CreditSubject code C 7A 3 1 -- 4

C7A Network Management

Objective It is aimed at making the students learn network management principles and technologies formanaging networks, systems applications and services in a balanced way.

Unit – INetwork management standards- Network management model- Organization model-Information model-Communication model-Abstract Syntax Notation one- Encoding structure- Macros-Functional model-Managed network: Case history- The SNMP Model- Organization model-System overview.

(10 periods)

Unit –IISNMP Information model- SNMPv1 Network Management- Communication model- Functional model.

(10periods)

Unit – IIIMajor changes in SNMPv2- SNMPv2 system architecture- Structure of management Information System-Introduction to MIB- SNMPv2 protocol- Compatibility with SNMPv1

(10periods)

Unit – IVSNMPv3 documentation-Architecture- Applications- SNMPv3 MIB- Security- User based security model-Access control-RMON- SMI and MIB-Introduction to RMON1 and RMON2- Case study of Internet trafficusing RMON. (10 periods)

Unit – V

Page 53: B.E Computer Science and Engineering

Network Management tools- Network Statistics Measurement Systems- Network management systems-NMS with web interface and web based management- Desktop management interface-Web basedenterprise 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 B.E Computer Science & Engg Lecture Tutorial Practice CreditSubject code C 7B 3 1 -- 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 ofpatterns mined - Classification - Major issuesData Warehouse and OLAP Technology for Data Mining : A multidimensional data model - Data cubes –Schemas - Measures: their categorization and computation - OLAP operations in the multidimensional datamodel -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-basedcharacterization - 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 - IIIMining Association Rules in Large Databases : Association rule mining - Mining single-dimensionalBoolean association rules from transactional databases - Mining multilevel association rules fromtransaction databases - Mining multidimensional association rules from relational databases and datawarehouses - From association mining to correlation analysis - Constraint-based association miningClassification and Prediction: Definitions - Issues regarding classification and prediction - Classification bydecision tree induction - Bayesian classification - Classification by back-propagation - Classification basedon 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-basedclustering methods - Outlier analysis

(10 periods)Unit - V

Mining Complex Types of Data: 1 Multidimensional analysis and descriptive mining of complex dataobjects - Mining spatial databases - Mining multimedia databases - Mining time-series and sequence data -

Page 54: B.E Computer Science and Engineering

Mining text databases - Mining the World-Wide Web

Data Mining Applications and Trends in Data Mining: Data mining applications - Data mining systemproducts 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 inKnowledge 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 JavaImplementations, Morgan Kaufmann, 2000, ISBN: 1-55860-552-5.

Specialization B.E Computer Science & Engg Lecture Tutorial Practice CreditSubject code C 7C 3 1 -- 4

C7C SOFTWARE PROJECT MANAGEMENT

Objective: Learning the software project management concepts to cater the latest trends.

UNIT – IManaging software projects – process and project management – CMM – overview – KPA’s – Projectplanning – project planning infrastructure – process database – process capability baseline – process assets& body of knowledge systems – process planning – standard process – process tailoring – requirementchange management.

10 periodsUNIT – II

Effort estimation & scheduling – concepts – effort estimation models – effort estimation – scheduling –quality planning – quality concepts – quantitative quality management planning – defect preventionplanning – risk management – risk assessment – risk control

10 periodsUNIT – III

Measurement and tracking planning – concepts – measurements project tracking – project managementplan – team management – customer communications & issue resolution – structure.

10 periods

UNIT-IVConfiguration management – concepts – configuration management process – project execution & closure– reviews process – data collection – monitoring and control.

10 periods

UNIT – VProject monitoring & control – project tracking – milestone analysis – activity level analysis using SPC –defect analysis & prevention – process monitoring and audit – project closure – analysis.

Page 55: B.E Computer Science and Engineering

10 periodsTotal 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C7D 4 0 0 4

C7D FREE-OPEN SOURCE SOFTWARE

Objective: The main objective is to allow students to address issues and adapt Open Source Technologiesand Practices

Unit-1 History and Overview of GNU/Linux Introduction to Linux- The Future- Why use Linux-The GNU Difference- Linux Distributions- InstallationRequirements- Understanding various Installation Methods- Starting the Installation Process-Troubleshooting-Installing &Configuring LILO

(10 periods)Unit-2

Configuring additional Hardware Configuring the Linux system-Configuring the Network-Configuring a Printer-Configuring Standard UserFeatures-Adding Hardware to your Linux system-Dealing with the kernel- Adding a modem-Adding aSound 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 Process-Manually Controlling a Process- Formatting and Disk Partitioning-Checking the File System-Backups-System 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-SpecialCommand Line Constructions- Shell Functions-Shell Aliases-Built-In Bash Commands-Some HandyCommand Line Utilities- Introduction to Shell Programming- Conditional Execution-Execution of Scriptsand Programs-Some Utilities That can Be Useful in Scripts

(10periods)

Page 56: B.E Computer Science and Engineering

Unit- 5 Web Server FTP Server Fundamentals-Configuring the FTP Server- The /etc/passwd File- Controlling and Monitoringthe FTP Service- Using FTP Client Software- Installing the Web Server- Configuring the Web Server-Adding Virtual Host-Using NFS on Linux- Configuring NFS-Mounting and Unmounting File systems

(10periods)

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 LarKaufman, O'Reilly Publishers, December 2002, ISBN: 0-596-00272-6.3. Linux Cookbook, First Edition, Carla Schroder, O'Reilly Cookbooks Series, November 2004,ISBN: 0-596-00640-3.

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C7E 3 1 0 4

C7E ARTIFICIAL INTELLIGENCE

Objectives: To present modern approaches in AI and indicate the ways in which techniques can be used inapplication programs

Page 57: B.E Computer Science and Engineering

Unit IIntroduction – Solving problems by search – agents – example problems – searching for solutions –uninformed search strategies – avoiding repeated states – searching with partial information – informedsearch and exploration – informed search strategies – heuristic functions – local search algorithms andoptimization problems – continuous spaces – online search agents and unknown environments

(10 periods)

Unit IIConstraint satisfaction problems – backtracking search for CSPs- variable and value ordering-intelligentbacktracking - local search for CSP – structure of problems – adversarial search – games – optimaldecision in games –minimax algorithm - alpha beta pruning – imperfect real time decisions – evaluationfunction - elements of chance – card games – state of art games programs

(10 periods)Unit IIIFirst 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 logic-prepositional versus first order inference – unification and lifting – forward chaining – backward chaining-Resolution – conjunctive normal form – completeness of resolution – resolution strategies

(10 periods)

Unit IVPlanning-The Planning Problem- Planning with State-Space Search-Partial-Order Planning-PlanningGraphs-Planning with Prepositional Logic-Planning and Acting in the Real World-Time, Schedules andResources-Hierarchical Task Network Planning- Planning and Acting in Nondeterministic domain-Execution Monitoring and Replanning-Continuous planning-MultiAgent planning

(10 periods)

Unit VUncertain Knowledge-Rational Decisions-Design-Propositions-Atomic Events-Axioms-Inference usingfull joint distribution -Independence-Bayes rule-Probabilistic Reasoning-Uncertain Domains- ConditionalDistribution-Exact Inference-Approximate Inference- Extending Probability to first order representations-Approaches to Uncertain Reasoning- Dempster Shafer Theory – rule based methods

(10 periods)

Text Book1)Stuart Russell, Peter Norvig, Artificial Intelligence:A Modern Approach, Pearson Education, 2003Reference1)E. Charnick, Introduction to Artificial Intelligence, Addison – Wesley, 20002)Rich,E and Knight,K, Artificial Intelligence, McGraw Hill, 19913)Nilsson, Artificial Intelligence: A new synthesis, Morgan kaufmann, 1998

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C7F 4 0 0 4

C7F ELECTRONIC COMMERCE

Objective: To gain knowledge in Enterprise Information Systems and E-Business applications

UNIT – IE-Commerce(EC) – Introduction - Electronic Commerce Framework – Electronic Commerce and MediaConvergence – The anatomy of E-Commerce Applications – Electronic Commerce Consumer

Page 58: B.E Computer Science and Engineering

Applications. Architectural Framework for Electronic Commerce – WWW (World Wide Web) as thearchitecture - Electronic Commerce Models.

(10 Periods)UNIT – II

Business-to-E-Commerce-Characteristics of B2B EC-Models of B2B EC-Internet Market Place-Just-in-Time Delivery-Other B2B Models, Auctions, and Services. Integration with Back-End InformationSystems-The Role of Software Agents for B2B EC-Electronic Marketing in B2B-Solutions to B2B EC-Managerial 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 andElectronic Payment Systems – Credit Card based Electronic Payment Systems - Risk factors in ElectronicFunds Transfer - Digital Payment – Designing Electronic Payment Systems– ATM Transactions – A CaseStudy.

(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 Envelopeand Message Transport – VAN (Value Added Network) – Internet based EDI.

(10 Periods)UNIT – V

Internal Information Systems - Macro forces and internal commerce - Workflow Automation andCoordination - Customization and Internal commerce - Supply Chain Management (SCM) – Elements ofSCM – 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, 20022. Dhruv Nath, The Nuts and Bolts of E-Commerce, TataMcGraw Hill, 2002

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C7G 4 0 0 4

C7G –EMBEDDED SYSTEMS

Objective: Objective: To provide the basic knowledge in the concepts of Embedded Systems.

UNIT – IEmbedded computing – Introduction - Complex systems and microprocessors -The embedded systemdesign process - Formalisms for system design - Instruction sets-Introduction – Preliminaries - ARMprocessor - SHARC processor (10 Periods)

UNIT - IIThe 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

Page 59: B.E Computer Science and Engineering

(10 Periods)UNIT - III

Processes and operating systems – Introduction – Multiple tasks and multiple processes –Processes – Context switching – Operating systems – Scheduling policies – Inter process communicationmechanisms – Evaluating operating system performance – Power optimization strategies for processes

(10 Periods)UNIT - IV

Distributed Embedded Architectures – I2C Bus and CAN Bus -System design techniques-Designmethodologies, 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 B.E. (CSE) Lecture Tutorial Practice CreditSubject code C7H 3 1 0 4

C7H MULTIMEDIA SYSTEMS

Objective: To introduce the concepts and various technologies behind Multimedia systemsUNIT – 1

Introduction-Multimedia: Media and Data Streams: Medium- main properties –Traditional Data streamscharacteristics - 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 Imageprocessing –synthesis – analysis – transmission – Video and Animation – Signal representation – Video

format- Television – Computer based animation – Languages – methods – display - transmission (10 periods)

UNIT –IIIMultimedia communication – Application subsystem – collaborative computing – Session management –Transport subsystem – requirements – Quality of Service and Resource management – Establishment andClosing multimedia call – Managing resources – architectural issues

(10 periods)

Page 60: B.E Computer Science and Engineering

UNIT – IVSynchronization – 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 basedsynchronization-scripts

(10 periods)UNIT –V

Multimedia applications – programs – structure – media preparation – media composition – mediaintegration – 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, 2001Reference: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 B.E Computer Science &Engg

Lecture Tutorial Practice Credit

Subject code C8A 3 1 -- 4

C8A CONVERGENT TECHNOLOGY

OBJECTIVE: To understand the concepts in VOIP Technologies.

UNIT – IPrinciples of converged Networks – Voice and Data Network characteristics – Benefits of the IP – CentricNetworks – RTP – Payload formats – RTP Header – mixers and translators – RTCP – Types of RTCPpackets – 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.323addressing – 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 ProxyServers – Introduction to SDP. (10 periods)

UNIT – IVIntroduction 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 thenetwork – Modems – ISDN – DSL – Cable TV infrastructure – Fixed wireless Access – Introduction tomobile services. (10 periods)

Page 61: B.E Computer Science and Engineering

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.

Page 62: B.E Computer Science and Engineering

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C8B 3 1 0 4

C8B Knowledge Engineering and managementObjective: To Provide good foundation and resources in the concepts of knowledge engineering andknowledge management.

UNIT – IIntroduction –The value of knowledge- knowledge Engineering Basics –historical perspective –TheMethodological pyramid-principles-The task and its organizational context. The main steps in task andorganizational analysis. The feasibility study. Knowledge management. Explicit and tacit knowledge –theKM cycle. Knowledge management and knowledge engineering.

(10Periods)

UNIT – II

Knowledge model components. The nature of knowledge-the knowledge model-domain knowledge –taskknowledge-Template knowledge models-classification –assessment-diagnosis-monitoring-synthesis-assignment-planning –scheduling –Task type combinations. Relation to task and organization models.

(10 Periods)UNIT – III

Knowledge model construction –Introduction –stages in knowledge model construction –knowledgeidentification –knowledge specification –knowledge refinement-knowledge elicitation techniques-characteristics of knowledge elicitation . Elicitation techniques modeling communication aspects.

(10 Periods)UNIT – IV

Case study: The housing application –introduction –task model-agent model-knowledge modeling-communication model. Designing knowledge systems-introduction -structure preserving design –designsystem architecture –identify target implementation platform-specify architectural components. specifyapplication within architecture. Design of prototypes. Knowledge system implementation-implementation in prolog.

(10 periods)UNIT – V

Advanced knowledge modeling-introduction-domain knowledge –interface knowledge-task knowledge-UML notations used in common KADS-activity diagram-state diagrams-class diagrams-use case diagrams-general UML constructs.-Project management- project planning-assessing risks. Plan-setting objectivethrough model states.

(10 Periods)TEXT BOOK:1.Knowledge Engineering and management –Guus Schreiber,hans akkermans,anjo anjewierdenUniversities press (India Ltd) 2001. REFERENCE BOOKS:1. Knowledge management –Elias M.Awad&Hassan M.Ghaziri Pearson Edition 20032 .Amrit Tiwana, The Knowledge Management Toolkit (With a CD), Practical techniques for Building aKMS, Printice Hall PTR.3.Jerry Honeycutt, Knowledge Management Strategies, ITR professional, Microsoft.

Specialization B.E Computer Science & Engg Lecture Tutorial Practice CreditSubject code C 8C 3 1 -- 4

Page 63: B.E Computer Science and Engineering

C8C SOFTWARE QUALITY MANAGEMENT

Objective: To learn the software quality management concepts and understand the process to practice fordelivering quality software.

UNIT – ISoftware Quality Assurance – Introduction – software quality control – TQM – SQA and Operatingsystems software – SQA and Mission critical software – SQA and real time software – SQA and Interactivesoftware – SQA and Business software – Business process reengineering & Y2K – SQA and softwareconfiguration management – SQA and software maintenance – Quality Gurus and their philosophies( Deming, Ishikawa, Juran, Taguchi, Crosby)

10 periods

UNIT – IISoftware Cost of Quality – Input – value added actions – Output – activity analysis – Non-cost of Quality –Major components – Software Reviews and Inspections - Inspection process – Requirements Inspection-Specification Inspection – Documentation Inspection – Inspection metrics – National software qualityexperiment – Pareto principle – Defect identification – Pareto chart comparison.

10 periods

UNIT – IIIIntroduction 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 – MalcolmBaldrige Award.

10 periodsUNIT – IV

Software Quality Assurance metrics – Introduction – Software Quality metrics methodology – omnibussoftware quality metrics – software quality indicators – Effective methods of information services –statistical methods applied to software quality control – Quality programming – proposed solution to sometechnical problems – Software safety and its relation to software quality assurance.

10 periodsUNIT – V

What is Six Sigma – Implementing Six Sigma – Six Sigma goals and metrics – Case studies onimplementing 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-12. 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-5References: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.

Page 64: B.E Computer Science and Engineering

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C8D 3 1 0 4

C 8D 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, DirectoryManagement, Protection, Time Management – Structure: Monolithic Systems Layered Systems VirtualMachines 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 , Principlesof 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 replacementalgorithms - 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- overviewof the minix file system -Design of Unix Operating System-Introduction to Kernel – Internal representationof 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 & Sons2)W.Stallings,Operating System Internals & Design Principles, Prentice Hall

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C8E 3 1 0 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 ProcessingElement-Vector formulation-Perceptron model-ANS simulation – Need – Design guidelines for simulators-Array based ANS structure-ANS Data structure Extension of ANS data structures

Page 65: B.E Computer Science and Engineering

Adaline and Madaline – Signal processing and filters review-Adaline and the Adaptive linear combiner-LMS learning rule-Practical considerations-Applications-Madaline Architecture-MRII Training algorithm-Madaline for Translation-Invariant Pattern recognition-Simulating Adaline – Data structure-Implementation (10 periods)

UNIT – IIBackpropagation network-Approach-BPN operation-Generalized Delta rule-Update of weights-Practicalconsiderations-Applications-Backpropagation simulator

BAM and Hopfield Memory-Associative memory definitions-Linear associator-BAM architecture-Processing-mathematics-energy function-Hopfield memory-Continuous Hopfield model-TSP problem-Simulating the BAM (10 periods)

UNIT – IIISimulated annealing-Information theory and statistical mechanics-concepts-Annealing-Boltzman machine-Learning-Boltzmann simulator-ApplicationCounterpropagation network-Building blocks-Input layer-Instar-competitive networks-Outstar-CPN dataprocessing-Forward mapping-Practical consideration-Application-Simulator

(10periods)

UNIT - IVSelf organizing maps-SOM data processing-Learning algorithm-Feature map classifier-Applications-Simulating the SOMAdaptive resonance theory-network description-Gain control in ART-ART1-ART2-Simulation

(10periods)

UNIT – VSpatiotemporal pattern classification-Formal avalanche-Architectures-Sequential competitive avalanchefield-example-Applications-STN simulationNeocognitron-Architecture-functional description-data processing-cell processing-training-Application

(10periods)

Textbook:

1) James A. Freeman and David M. Skapura, Neural networks-Algorithms, Applications andProgramming 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

Page 66: B.E Computer Science and Engineering

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C8F 3 1 0 4

C8F ENTERPRISE RESOURCE PLANNING (ERP)

Objective: To gain knowledge in ERP and applying it to utilize the various resources of an organization toimprove its performance.

UNIT – IIntroduction to ERP – What is ERP? – Evolution of ERP – Advantages. Enterprise – An overview -Introduction – Integrated Management Information – Business Modeling – Integrated Data Model. ERPand Related Technologies:- Introduction – Business Process Reengineering (BPR) – ManagementInformation 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) – DataManagement – Make-to-order (MTO) and Make-to-stock (MTS) – Assemble –to-order (ATO) – Engineer-to –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 - HumanResource 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 – ProjectPlanning 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 – Applicationplatforms – New Business Segments. ERP and Internet – Role of Internet in ERP – Benefits –Technological factors – utilizing IT (Information Technology) in ERP. ERP CASE STUDIES: - ADiscussion 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., NewDelhi, 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

Page 67: B.E Computer Science and Engineering

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 B.E Computer Science &Engg

Lecture Tutorial Practice Credit

Subject code C8G 3 1 -- 4

C8G PARALLEL COMPUTING

OBJECTIVE: To motivate the students and make them understand the design, analysis and implementationof parallel algorithms on the parallel computers.

Unit-IIntroduction-Parallel processing terminology-The sieve of Erasthenes-PRAM Algorithms-Model forparallel computation-PRAM Algorithms-reducing the number of processors

(10 periods)Unit-II

Processor array, Multiprocessors, and Multicomputer-Processor organizations-Processor arrays-Multiprocessor-Multicomputers-Flynn’s Taxonomy-Speedup, scaled speedup and parallelizability-Parallelprogramming languages-programming parallel processes-Sequent C-n Cube C-C-LINDA.-A notation forexpressing parallel algorithms.

(10 periods)UNIT-III

Mapping and scheduling-Mapping data to processors on processor arrays and multicomputers-Dynamicload balancing on multicomputers-static scheduling on UMA multiprocessors-Deadlock-ElementaryParallel algorithms-classifying MIMD algorithms Reduction-Broadcast-Prefix sums.

(10periods)

Page 68: B.E Computer Science and Engineering

UNIT-IVMatrix multiplication-sequential algorithms-Algorithm for processor array-algorithms for multicomputer-for multiprocessor-Sorting-Enumeration sort-Odd-even Transposition sort-Bitonic merge-Quick sort-basedalgorithms-Random read and Random write.

(10 periods)UNIT-V

Dictionary operations-Complexity of parallel search-Searching on Multiprocessors- Combinatorial Search-Divide and conquer-TSP-Parallel Branch and Bound algorithms-Alpha beta search-Parallel Alpha betasearch. (10 periods)

TEXT BOOK:Michael J.Quinn,”Parallel Computing, Theory and Practice”, second edition, Tata Mc Graw HillPublishing 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 InternationalEdition, 1989.3. V.Rajaraman, C.Sivarammurthy,”Parallel Computers-Architecture and Programming”, Prentice Hall ofIndia

Specialization B.E. (CSE) Lecture Tutorial Practice CreditSubject code C8H 3 1 0 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 IIArithmetic coding – Coding a sequence – Tags- Generating a binary code – Comparison – Application –

Dictionary technique – static –Digram coding – adaptive – LZ77 - LZ78 approach – applications (10 periods)

Unit IIITransform coding – Types of transform – Karhunen Loeve Transform – Discrete Cosine Transform-Discrete Sine Transform – Discrete Walsh Hadamard transform – Applications – JPEG – Audiocompression (10 periods)

Unit IVAnalysis and Synthesis schemes – Speech compression – Channel vocoder – LPC10 – Code excited linearpredictor – Sinusoidal coders – Mixed excitation linear prediction– Image compression – FractalCompression (10 periods)

Unit V

Page 69: B.E Computer Science and Engineering

Video compression – Motion compression – Video signal representation – Algorithm for Videoconferencing and Video phones – ITU-T recommendation H.261 – Asymmetric applications – Packetvideo – compression in ATM networks (10periods)

Text Book:1. Khalid Sayood, Introduction to Data compression, Morgan Kaufmann, Feb 2000Reference: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 forMultimedia: Principles & Standards. Morgan Kaufmann, 1998.

Page 70: B.E Computer Science and Engineering

Recommended