FIRST SEMESTER THEORY PRACTICAL - Government … syllabi.pdf · FIRST SEMESTER S. No Course Code...

CURRICULUM FOR CANDIDATES ADMITTED

DURING 2012-2013 AND ONWARDS FOUR YEAR B.E PROGRAMME

BRANCH: B.E COMPUTER SCIENCE AND ENGINEERING

FIRST SEMESTER

S.

No

Course

Code

Course

title

Sessiona l

marks

End

SemesterExa m marks

Total

marks

Credits

L T P C

THEORY

1 12S1Z1 Communication Skills in English-I 25 75 100 3 1 0 4

2 12S1Z2 Engineering Mathematics-I 25 75 100 3 1 0 4

3 12S103 Basics of Electrical and Electronics Engineering

25 75 100 4 0 0 4

4 12S104 Materials Science 25 75 100 3 0 0 3

5 12S105 Applied Chemistry 25 75 100 3 0 0 3

6 12S106 Programming in C 25 75 100 3 1 0 4

PRACTICAL

7 12S107 Workshop 25 75 100 0 0 3 2

8 12S108 Chemistry Laboratory 25 75 100 0 0 3 2

9 12S109 C Programming Laboratory 25 75 100 0 0 3 2

TOTAL 900 28

SECOND SEMESTER

S.

No

Course

Code

Course

title

Sessiona l

marks

End

SemesterExa m

marks

Total

marks

Credits

L T P C

THEORY

1 12S2Z1 Communication Skills in English – II

25 75 100 3 1 0 4

2 12S2Z2 Engineering Mathematics – II 25 75 100 3 1 0 4

3 12S203 Engineering Physics 25 75 100 3 0 0 3

4 12S204 Object Oriented Programming Using C++

25 75 100 3 0 0 3

5 12S205 Digital Systems 25 75 100 3 0 2 4

6 12S206 Data Structures and Applications - I 25 75 100 3 1 0 4

PRACTICAL

7 12S207 Physics Laboratory 25 75 100 0 0 3 2

8 12S208 Engineering Graphics 25 75 100 2 0 3 4

9 12S209 Object Oriented Programming

Laboratory 25 75 100 0 0 3 2

TOTAL 900 30

THIRD SEMESTER

S. No

Course Code

Course title

Sessiona l marks

End Semester

Exa m

marks

Total marks

Credits

L T P C

THEORY

1 12S3Z1 Engineering Mathematics-III 25 75 100 3 1 0 4

2 12S302 Discrete Mathematics 25 75 100 3 1 0 4

3 12S303 Microprocessors, Microcontrollers

and Applications 25 75 100 3 0 0 3

4 12S304 Analog and Digital Communication 25 75 100 4 0 0 4

5 12S305 Data Structures and Applications-II 25 75 100 3 1 0 4

6 12S306 Programming in Java 25 75 100 3 0 2 4

PRACTICAL

7 12S307 Microprocessors and Microcontrollers Laboratory

25 75 100 0 0 3 2

8 12S308 Data Structures and Applications Laboratory

25 75 100 0 0 3 2

TOTAL 800 27

FOURTH SEMESTER

S.

No

Course

Code

Course

title

Sessiona l

marks

End

Semester Exa m

marks

Total

marks

Credits

L T P C

THEORY

1 12S401 Probability, Random Processes and Queueing Theory

25 75 100 3 1 0 4

2 12S402 Environmental Science and

Engineering 25 75 100 3 0 0 3

3 12S403 Database Systems 25 75 100 3 0 0 3

4 12S404 Computer Architecture 25 75 100 3 0 0 3

5 12S405 Systems Programming and

Operating Systems 25 75 100 3 1 0 4

6 12S406 Theory of Computation 25 75 100 3 1 0 4

PRACTICAL

7 12S407 Database Systems Laboratory 25 75 100 0 0 3 2

8 12S408 Systems Programming and

Operating Systems Laboratory 25 75 100 0 0 3 2

TOTAL 800 25

FIFTH SEMESTER

S.

No

Course

Code

Course

Title

Sessiona l

marks

End

SemesterExa m marks

Total

marks

Credits

L T P C

THEORY

1 12S501 Object Oriented Analysis and

Design 25 75 100 3 0 0 3

2 12S502 Unix internals 25 75 100 3 0 0 3

3 12S503 Web Technology 25 75 100 3 0 0 3

4 12S504 Computer Graphics and Multimedia

Systems 25 75 100 3 1 0 4

5 12S505 Design and Analysis of Algorithms 25 75 100 3 1 0 4

6 12S506 Computer Networks 25 75 100 3 0 0 3

PRACTICAL

7 12S507 Unix Internals Laboratory 25 75 100 0 0 3 2

8 12S508 Networking Laboratory 25 75 100 0 0 3 2

TOTAL 800 24

SIXTH SEMESTER

S. No

Course Code

Course Title

Sessiona l marks

End Semester

Exa m marks

Total marks

Credits

L T P C

THEORY

1 12S601 Embedded System Design 25 75 100 3 0 0 3

2 12S602 Distributed Computing 25 75 100 3 0 0 3

3 12S603 Compiler Design 25 75 100 3 1 0 4

4 12S604 Artificial Intelligence 25 75 100 3 0 0 3

5 12S605 Fundamentals of Digital Signal

Processing 25 75 100 3 1 0 4

6 12S6Ex Elective I 25 75 100 3 0 0 3

PRACTICAL

7 12S607 Compiler Laboratory 25 75 100 0 0 3 2

8 12S608 Graphics and Multimedia

Laboratory 25 75 100 0 0 3 2

TOTAL 800 24

SEVENTH SEMESTER

S. No

Course Code

Course Title

Sessiona l marks

End Semester

Exa m marks

Total marks

Credits

L T P C

THEORY

1 12S701 Management and Economics 25 75 100 3 0 0 3

2 12S702 Cryptography and Network Security 25 75 100 3 0 0 3

3 12S703 Software Engineering 25 75 100 3 0 0 3

4 12S704 Mobile Computing 25 75 100 3 0 0 3

5 12S7E x Elective II 25 75 100 3 0 0 3

6 12S7E x Elective III 25 75 100 3 0 0 3

PRACTICAL

7 12S707 Software Engineering and Web Technology Laboratory

25 75 100 0 0 3 2

8 12S708 Network Security and Elective

Laboratory 25 75 100 0 0 3 2

TOTAL 800 22

EIGHTH SEMESTER

S. No

Course Code

Course Title

Sessiona l marks

End Semester

Exa m marks

Total marks

Credits

L T P C

THEORY

1 12S8E x Elective – IV 25 75 100 3 0 0 3

2 12S8E x Elective – V 25 75 100 3 0 0 3

PRACTICAL

1 12S801 Project Work 50 150 200 0 0 12

6

TOTAL 400 12

LIST OF ELECTIVES FOR

B.ECOMPUTER SCIENCE AND ENGINEERING

SIXTH SEMESTER

S.

No

Course

Code

Course

Title

Sessiona l

marks

End

Semester Exa m

marks

Total

marks

Credits

L T P C

1 12S6E0 Applied Numerical Methods 25 75 100 3 0 0 3

2 12S6E1 Wireless Adhoc Networks 25 75 100 3 0 0 3

3 12S6E2 Open Source Systems 25 75 100 3 0 0 3

4 12S6E3 Parallel Computing 25 75 100 3 0 0 3

5 12S6E4 Optimization Techniques and Applications

25 75 100 3 0 0 3

6 12S6I1* Information Storage and Management 25 75 100 3 0 0 3

SEVENTH SEMESTER

S. No

Course Code

Course Title

Sessiona l marks

End Semester

Exa m

marks

Total marks

Credits

L T P C

1 12S7E0 High Performance Architecture 25 75 100 3 0 0 3

2 12S7E1 XML and Web Services 25 75 100 3 0 0 3

3 12S7E2 Genetic Algorithms and Swarm Intelligence

25 75 100 3 0 0 3

4 12S7E3 Digital Image Processing 25 75 100 3 0 0 3

5 12S7E4 Grid Computing 25 75 100 3 0 0 3

6 12S7E5 Component Based Techniques 25 75 100 3 0 0 3

7 12S7E6 PC Hardware and Trouble

Shooting 25 75 100 3 0 0 3

8 12S7E7 Data Warehousing and Data Mining

25 75 100 3 0 0 3

9 12S7E8 High Performance Networks 25 75 100 3 0 0 3

10 12S7E9 Wireless Sensor Networks 25 75 100 3 0 0 3

11 12S7I2* Enterprise Infrastructure Management 25 75 100 3 0 0 3

EIGHTH SEMESTER

S.

No

Course

Code

Course

Title

Sessiona l

marks

End

Semester Exa m marks

Total

marks

Credits

L T P C

1 12S8E 0 Software Testing 25 75 100 3 0 0 3

2 12S8E 1 Fuzzy Logic and Neural

Networks 25 75 100 3 0 0 3

3 12S8E 2 Cloud Computing 25 75 100 3 0 0 3

4 12S8E 3 Software Project Management 25 75 100 3 0 0 3

5 12S8E 4 Computer Vision 25 75 100 3 0 0 3

6 12S8E 5 Nano Technology and

Applications 25 75 100 3 0 0 3

7 12S8E 6 Cryptography and Cryptanalysis 25 75 100 3 0 0 3

8 12S8E 7 Semantic Web 25 75 100 3 0 0 3

9 12S8E 8 Quantum Computing 25 75 100 3 0 0 3

10 12S8E 9 Software Quality Assurance 25 75 100 3 0 0 3

* Industry offered electives

12S1Z1 COMMUNICATION SKILLS IN ENGLISH – I

[Common to all branches]

L T P C

3 1 0 4

COURSE OBJECTIVES- Upon completion of this course the students will be familiar with:

Vocabulary and Communication skill so that they employ the words appropriately in

different academic and professional contexts.

Suitable reading strategies that could be adopted while reading science related

articles.

Oral presentation strategies and Listening strategies.

Drafting letters

Group discussions

COURSE OUTCOMES-Upon completion of this course the students will be able to:

CO 1: Frame sentences without error [Familiarity] CO 2: Pronounce with proper stress and intonation. [Usage] CO 3: Listen to specific contexts [Familiarity]

CO 4: Conduct debates on chosen topics [Usage] CO 5: Deliver oral presentations [Usage]

CO 6: Write notices, agenda, and memos. [Usage] CO 7: Participate in group discussions effectively [Usage] CO 8: Interpret information from English information resources [Assessment]

CO 9: Read and understand English novels. [Assessment]

UNIT I (9) Tenses - Word formation- Vocabulary (Synonyms & Antonyms)- Listening and transfer of information -Pronunciation Practice-Word Stress-Sentence Stress-Intonation-Introducing

oneself- Role play activities based on real life situations-Non-Verbal Communication -Reading Comprehension (Skimming and Scanning)- An introduction to Letter Writing – E-Tender

Notices UNIT II (9)

Technical Vocabulary-Abbreviations & Acronyms- Commonly Confused Words- Active Voice to Passive Voice-Impersonal Passive - Listening at Specific Contexts such as Airport, Railway

Station, Bus Stand, Sea Port/Shipboard etc - Debates on Chosen Topics -Reading For Identifying Stylistic Features- Recommendations-Letter to the Editor of a News Paper

UNIT III (9) Subject-Verb Agreement (Concord) - Preposition-Listening to News in English- Mini Oral

Presentation on the assumption of a historian, celebrity, famous Personality etc.- Reading and Note-making-Notice-Agenda- Memo-Advertisement and Slogan Writing

UNIT IV (9) Common Errors in English-Conditional Statements -Use of Modal Auxiliaries- Definition-

Listening to a Discussion at a Business Meeting- Group Discussion on chosen topics-Reading for interpreting tables, charts etc. - Writing E-mails-Graphic Description

UNIT V (9)

Extensive Reading- APJ Abdul Kalam’s ―Wings of Fire‖- An Abridged Special Edition for Students.

LECTURE: 45 TUTORIAL: 15 TOTAL: 60

Text Books

1 Meenakshi Raman, Sangeetha Sharma, “Technical Communication: English Skills for Engineers”, second edition, Oxford University Press: New Delhi, 2009

Reference Books

1 M.AsrafRizvi, ―Effective Technical Communication‖, Tata McGraw Hill, New Delhi,

2005. 2 Hurbert, A.J, ―The Structure of Technical English‖,The English Language Society, 1986.

12S1Z2 ENGINEERING MATHEMATICS – I


L T P C

3 1 0 4

COURSE OBJECTIVES- Upon completion of this course the students will be familiar

with:

Matrix theory that has wider application in engineering problems.

The area of hyperbolic functions and solid geometry to solve sphere, cone and

cylinder problems

The various applications of differential equations and integral calculus.

Functions of two variables.

Performing double and triple integration.


CO 1: Find Eigen values and Eigen vectors of a real matrix. [Usage] CO 2: Reduce quadratic form to canonical form. [Usage] CO 3: Solve problems using hyperbolic functions. [Assessment]

CO 4: Apply solid geometry for solving problems. [Usage] CO 5: Apply differential calculus to solve problems on curvature and envelopes.[Usage]

CO 6: State Taylor‟s theorem. [Familiarity]

CO 7: Use Lagrangian multiplier method and Jacobeans‟ [Usage]

CO 8: Apply Jacobeans‟ [Usage]

CO 9: Perform differentiation under integral sign to two variable equations. [Usage] CO 10: Calculate area using double integral [Usage]

CO 11: Calculate volume using triple integral [Usage]

UNIT IMATRICES (9)

Characteristic equation – Eigen values and Eigen vectors of a real matrix - Properties of

Eigen values - Cayley-Hamilton Theorem (statement only) and applications- Diagonalisation

by similarity transformation - Reduction of quadratic form to canonical form.

UNIT IIHYPERBOLIC FUNCTIONS AND SOLID GEOMETRY (9)

Hyperbolic functions and Inverse Hyperbolic functions -Identities- Real and imaginary parts-

solving problems using hyperbolic functions. Sphere – tangent plane – Orthogonal spheres -

Cone- right circular cone – Cylinder – right circular cylinder.

UNIT IIIAPPLICATIONS OF DIFFERENTIAL CALCULUS (9)

Curvature - Cartesian and polar coordinates – centre and radius of curvature - circle of

curvature -Evolutes - Envelopes - Evolutes as envelope of normal.

UNIT IVFUNCTION OF SEVERAL VARIABLES (9)

Function of two variables - Taylor’s theorem (statement only) and expansions - maxima and minima - constrained maxima and minima by Lagrangian multiplier method - Jacobeans - differentiation under integral sign

UNIT VINTEGRAL CALCULUS (9)

Gamma and Beta functions - Double integration - Cartesian and Polar Coordinates – change

of order of integration - Area as double integral – Triple integration –Volume as a triple

integral - Transformation to Cylindrical and Spherical co-ordinates.


Text Books

1 Veerarajan.T., ―Engineering Mathematics‖, third edition, for Semesters I and II, Tata McGraw Hill Publishing Co., NewDelhi., 2004

2 Dr. Kandasamy.P., Dr.Thilagavathy.K and Dr.Gunavathy.K., ―Engineering

Mathematics‖ for First Year B.E/B.Tech, S. Chand & Co., Ram Nagar, New Delhi,

2010.

Reference Books

1 N.P.Bali., Dr. Manish Goyal., ―A text book of Engineering Mathematics‖ vol. I ,9th edition, University science Press, New Delhi, 2010.

2 H.C.Taneja., ―Advanced Engineering Mathematics‖vol.I, 2ndEdn,I.K.InternationalPub.HousePvt.Ltd., New Delhi, 2010.

3 Baburam., ―Engineering Mathematics‖ vol. I, Pearson, New Delhi, 2010.

4 B.V.Ramana., ―Higher Engineering Mathematics‖ Tata McGraw Hill Publishing Co., first edition, New Delhi, 2006.

5 Grewal B.S., ―Higher Engineering Mathematics‖ (42nd Edition) Khanna Publishers, New Delhi., 2008.

12S103 BASICS OF ELECTRICAL AND ELECTRONICS ENGINEERING


L T P C

4 0 0 4


with:

The basic concepts of electric circuits and perform mesh and node analysis.

Construction and operation of electrical machines and transformers.

Semiconductor diodes and applications.

Basic device and circuit level knowledge on different transistors.

The basic knowledge on working principles of SMPS and UPS.

Characteristics and simple applications of Op-Amps.


CO1: Analyze simple DC circuits and AC circuits. [Familiarity] CO2: Realize the significance of Electrical machines and Transformers [Familiarity] CO3: Acquire knowledge on semi-conductor diodes and its applications. [Familiarity]

CO4: Appreciate the importance of SMPS and UPS for computers [Familiarity] CO5: Realize Amplifiers and Oscillators using transistor circuits [Familiarity]

CO6: Design simple arithmetic circuits using op-amps [Usage]

UNIT IFUNDAMENTALS OF DC AND AC CIRCUITS (12)

Fundamentals of DC circuits: Ohm’s law, Kirchhoff’s laws, Simple resistive circuits –Effects

of series and parallel resistances-Mesh and Nodal analysis. Fundamentals of AC circuits:

RMS and Average values of sine wave, form factor, peak factor, Single phase AC circuits-

impedance, power and power factor-RL, RC, RLC circuits-simple AC circuits.

UNIT IIROTATING MACHINES AND TRANSFORMERS (12) Electrical machines: Construction, Principle of operation, Basic Equations and Applications

of DC Generator, DC Motors, Single Phase Transformer, Induction Motors and stepper

Motors.

UNIT IIISEMICONDUCTOR DEVICES AND ITS APPLICATIONS (12) Semiconductors-N Type and P-Type- Construction and static characteristics ofJunction

diode. Power Supplies: Half Wave and Full Wave Rectifiers, Voltage Regulator, Zener

Regulator, Filters-Voltage Multiplier-Introduction to SMPS and UPS.

UNIT IVTRANSISTORS-INTRODUCTION TO SMALL SIGNAL

AMPLIFIER (12)

Transistor-Types-Transistor characteristics Curve- Transistor as a switch- Measuring gain-Amplification-Common Emitter, Common Base and Common Collector Amplifiers-

Stabilizing the Amplifier-Field Effect Transistors, Junction Field Effect Transistor, N-Channel and P-Channel types, MOSFET-Characteristics, UJT and its characteristics.

UNIT VOP-AMP (12) Basic information of op-amp- Ideal op-amp- Basic inverting amplifier- Basic non- inverting

amplifier- Differential amplifier-DC-Characteristics of op-amp-op amp application: Inverting

, non inverting- Summing amplifier, adder, Subtractor-op amp using diodes: Rectifier,

Clipper, Clamper- Multiplier using op-amp- Basic differentiator and integrator using op-amp.

LECTURE: 60 TUTORIAL: 0 TOTAL: 60 Text Books

1 Edward Hughes, I Mackenzie Smith, ―Electrical and Electronic Technology ―, Pearson Education, 10th Edition, 2008.

Reference Books

1 Prem Kumar and Arumugam, ―Introduction to circuits analysis‖, Khanna

Publishers. 2 B.L .Theraja,‖ Electrical Technology‖-Vol I & II, 23 rdEdition, S Chand, New Delhi,

2008

3 K.Baskaran and J.Rangarajan,‖Electric Circuits and Electronic Devices‖,Pratheeba Publishers.

4 D.RoyChoudhury, Shail Jain,‖ Linear integrated Circuits ‖, New Age science Limited, 4th edition, 2010.

5 Millman and Halkias,‖ Electronics Devices and Circuit‖, Tata McGraw-Hill

Publishers, 3 rd edition, 2012.

12S104 MATERIALS SCIENCE


L T P C

3 0 0 3


with:

The properties of conducting, semiconducting and magnetic materials.

The application of magnetic and super conducting materials.

Application and properties of dielectric materials.

Applications and properties of Modern engineering materials.

Nano materials and its properties.


CO1:Analyze properties of conducting materials. [Familiarity]

CO2:List and analyze the properties of Semiconducting materials and devices. [Familiarity] CO3: Identify and analyze magnetic and super conducting materials. [Familiarity]

CO4: List and analyze the properties of dielectric materials. [Familiarity] CO5: List the properties and applications of modern engineering materials.

[Familiarity]

UNIT ICONDUCTING MATERIALS (9)

Introduction to Conductors – classical free electron theory of metals – Draw backs of classical theory – quantum theory - Electrical and Thermal conductivity of Metals –

Derivation for Wiedemann – Franz law – Lorentz number –– Fermi distribution function -

effect of temperature – density of energy states – calculation of Fermi energy- carrier

concentration in metals.

UNIT II SEMICONDUCTING MATERIALS AND DEVICES (9) Introduction – Properties – elemental and compound semiconductors - Intrinsic and extrinsic

semiconductors – properties - Carrier concentration in intrinsic Semiconductor - variation of Fermi level with temperature and carrier concentration - Electrical Conductivity – band gap determination - extrinsic semiconductors - Carrier concentration in P- type and N-type

semiconductors – variation of Fermi level with temperature and impurity concentration – Hall effect- Determination of Hall Co-efficient in N type and P type Semiconductor -

Applications.

UNIT IIIMAGNETIC AND SUPER CONDUCTING MATERIALS (9) Introduction - Origin of magnetic moment - Bohr magnetron - Dia, Para, and Ferro magnetic

materials - Domain theory of ferromagnetism - Hysteresis - Hard and Soft magnetic

materials. Ferrites - structure and applications. - Magneto optical recording and readout –

Superconductivity - Types of superconductors - BCS theory of superconductivity

(qualitative) - properties- High Tc superconductors, Applications of superconductors-

SQUID, Cryotron, Magnetic levitation.

UNIT IVDIELECTRICS (9)

Introduction to dielectric materials – Electric polarization and Dipole moment - Electrical

susceptibility – dielectric constant – Various polarization mechanisms in dielectrics -

electronic, ionic, orientational and space charge polarization– frequency and temperature

dependent of polarization – internal field – Claussius – Mosotti relation (derivation) –

dielectric loss – dielectric breakdown –BaTiO3 - Applications of dielectric materials.

UNIT VMODERN ENGINEERING MATERIALS (9)

Metallic glasses- preparation of metallic glasses - properties – applications of the metallic

glasses - Shape Memory Alloys (SMA) - Characteristics, properties of NiTi alloy -

applications of the Shape memory alloys - advantages and disadvantages of SMA -

Nanomaterials-synthesis –chemical vapour deposition – Sol Gels – ball Milling – properties

of nanoparticles and applications of nanoparticles – Carbon Nanotubes (CNT) – structure –

properties – applications of the CNTs.


1 Ganesan S. Iyandurai N, ―Engineering Physics II‖, Gems Publishers, Coimbatore 2009.

Reference Books

1 Jayakumar S, ―Materials Science‖, RK Publishers, Coimbatore, 2004

2 William D CallisterJr, ―Materials Science and Engineering – An

Introduction‖,John Wiley and Sons Inc.,7th edition, New York, 2006 3 James F Shackelford, S ―Introduction to materials Science for Engineers‖, 6th

edition, Pearson education Company, New York, 2007

12S105 APPLIED CHEMISTRY


L T P C

3 0 0 3

COURSE OBJECTIVES-Upon completion of this course the students will be familiar

with:

Principles and application of electrochemistry and corrosion science.

Batteries and its characteristics and functions

Corrosion and its preventive measures

Techniques used in planar technology

Structure, functions and applications of polymers.


CO1:Determine the equivalence point acid base by potentiometric titration.[Assessment] CO2: List and describe characteristics and types of batteries. [Familiarity]

CO3:Compare the performance of Lead acid, Ni- Cd, Ni-Fe-Lithium ion

batteries.[Assessment] CO4:Describethe design of structures to prevent corrosion[Familiarity]

CO5:Apply protective coatings like Paints, electro plating to prevent corrosion. [Familiarity] CO6:Describe PN junction using solid state fusion and Fabricate silicon

devices.[Familiarity] CO7: List properties and applications of polymers like PVC, Polyamide. [Familiarity]

CO8:Describe Fabrication-compression molding-Injection moulding-blow moulding& Extrusion moulding. [Familiarity]

UNIT IBASIC ELECTROCHEMISTRY (9) EMF and thermodynamic principles of electrochemical systems- Nernst equation, problems-

applications of EMF measurement – potentiometric titrations- acid alkali, redox reactions –

pH measurements using glass electrode- ion selective electrode- fluoride analysis, solubility

of sparingly soluble salts – concentration cells – electrode/electrolyte – simple examples –

Polarisation – concentration – over voltage.

UNIT IIBATTERIES (9) Batteries - components – Characteristics – voltage , current , capacity, electrical storage density, energy density, discharge rate – types of batteries ( primary and secondary )–

primary- Zn- MnO2, Zn- AgO , Zn- HgO , Li- SO2Cl - cells-construction and working- Comparison of performance of primary cells–Secondary- Lead acid, Ni- Cd, Ni-Fe-Lithium

ion batteries – Components – Characteristics-functioning-comparison of performances.

UNIT IIICORROSION (9) Corrosion -spontaneity –chemical - oxidation corrosion - nature of oxides- Pilling and

Bedworth rule - electrochemical corrosion – general mechanism- differential aeration-

Pitting, Galvanic & stress corrosion. Prevention of corrosion-Proper design of structures,

cathodic protection (sacrificial anode and impressed current cathodic), Inhibitors – Protective

coatings- Paints, electro plating (plating of chromium and nickel only), electroforming and

electro polishing - applications.

UNIT IV PLANAR TECHNOLOGY (9)

Silicon-polycrystalline and single crystalline - crystal growth techniques-Czochralski process

and float zone process-wafer preparation-PN junction formation by solid fusion-open type

diffusion system, Ion implantation and molecular beam epitaxy –Deposition of dielectrical

layers by crystal vapor deposition and sputtering techniques – Fabrication silicon devices -

Masking and photolithography- Etching techniques wet and electrochemical – metal

deposition techniques.

UNIT V POLYMERS (9) Monomers- functionality, Degree of polymerization-Coordination polymerization Zeigler-

Natta catalyst, Polymers, structure , properties and their end uses of Polycarbonate, PVC,

Polyamide, PET, Polyester, Teflon, Epoxy resin, Polyurethane, PMMA. Compounding of

plastics- ingredients and functions, Fabrication-compression molding-Injection moulding-

blow moulding& Extrusion moulding -Conducting polymers, poly acetylene and mechanism

of conduction-natural rubber-vulcanization of rubberBiodegradable polymers - polylactide,

cellulose, and starch.


1 Vairam S. and Ramadevi A., ―Engineering Chemistry”, 1st Edn, Gem publishers,

Coimbatore, 2011. 2 Jain P.C & Jain. M, “Engineering Chemistry”, 17th Edn,DhanpatRai publications (p)

Ltd, New Delhi. 2008.

Reference Books

1 Puri Br, Sharma, Lr, Pathania M.S. ―Principles of Physical Chemistry”, Vishal Publications Co., 2012.

2 Thiyagi .M. S. ―Introduction to Semiconductor Materials and devices”, first edition, John Wiley & sons, 1991

3 PletcherD , Walsh, ―Industrial Electrochemistry, 2nd Edn. Kluwer, the language of

Science, 2008. 4 Linden, ―Hand book of batteries and fuel cells”, vol.1, 3rdEdn, McGraw Hill, 2001.

5 Engineering Chemistry, ―A text book of Chemistry for Engineers”, Wiley India Pvt. Ltd. 2011

12S106 PROGRAMMING IN C

[Common to CIVIL, EEE, EIE, ECE, CSE, IT & IBT]

L T P C

3 1 0 4


with:

Basic hardware and software components, problem solving techniques and development of algorithms.

Usage of basic programming elements, control structures and arrays in C.

Different user defined data types, functions and pointers and effectively use in

development of efficient C programs.

Various storage classes, structures, unions in C.

DOS services, I/O programming, memory management and graphics.


CO 1: Install and uninstall software in computer. [Usage]

CO 2: Explain the working of internet [Familiarity] CO 3: Use algorithm, Flow chart and pseudo code for solving the given problem. [Usage]

CO 4: List, identify and use components of C for writing programs in C [Usage] CO 5: Identify and apply functions and pointers for writing program in C [Usage] CO 6: Effectively use storage classes and structures in C program [Usage]

CO 7:Develop file handling applications and graphical applications using C [Usage]

UNITIBASICS OF COMPUTER, PROGRAMMING AND INFORMATION

TECHNOLOGY (9)

Digital Computer Fundamentals- Block diagram of a computer-Components of a Computer system-Applications of Computers-Hardware and Software definitions-Categories of

Software-Booting-Installing and Uninstalling Software-Software privacy-Software

terminologies-Information Technology Basics-History of Internet-Internet Tools. Problem

solving Techniques-Program-Program development cycle-Algorithm-Flow Chart-Pseudo

Code-Program control structures-Types and generation of programming languages-Development of algorithms for simple problems.

UNIT IIBASIC ELEMENTS OF C (9)

Introduction to C-C Declaration- Operators and Expressions-Input and output Functions- Decision statements: If -If else-Nested If else -If else If ladder -break-continue-goto-switch -

nested switch case-Switch case and nested ifs -Loop control: for, nested for, while, do-while- do while statement with while loop-Arrays: initialization, characteristics, types and operations.

UNIT IIIPOINTERS AND FUNCTIONS (9) Strings and Standard functions: Declaration and initialization, formats, standard, conversion

and memory functions, applications; Pointers-pointers and address- declaration-void ,wild, constant pointers –arithmetic operations with pointers-pointers and arrays- pointers to

pointers-pointers to pointers - pointers and strings; Functions-return statement-types -call by value and reference-returning more values, function as an argument, function with operators, decision statements, loop statements, arrays and pointers, recursion-Tower of Hanoi.

UNIT IV STORAGE CLASSES, STRUCTURE AND UNION (9) Storage classes: auto-extern-static-register; Preprocessor directives; Structures: Declaration

and initialization, structure within structure-Array Of Structures-pointer to structure-structure

and functions-typedef-bit fields- enumerated data types; union: calling BIOS and DOS

services-union of structures.

UNIT V FILES, GRAPHICS AND DYNAMIC MEMORY ALLOCATION (9)

Files: streams and file types-operations-File I/O-read and write-other –creating, processing and updating files-simple file handling programs- low level programming-command line

arguments- Environment variables; Graphics: initialization-functions- library functions-text-patterns and styles-mouse programming-drawing non common figures; Dynamic memory allocation.


Text Books

1 ITL Education solutions Limited, “Introduction to Information Technology”, second edition, Pearson Education (India), 2005. (Unit I) (Chapter: 1, 7, 9, 10, 15, 16).

2 Ashok N. Kamthane, “Programming in C”, Pearson Education, Second Edition,2012.

Reference Books

1 Byron Gottfried, “Programming with C”, II Edition, (Indian Adapted Edition), TMH

publications, 2006. 2 Brain W. Kernighan and Dennis M.Ritchie,‖The C programming language”, Second

Edition, Prentice hall of India, 1988 3 E. Balagurusamy, “Programming in ANSI C”, 6th Edition, Tata McGraw-Hill

Education, 2012.

12S107 WORKSHOP


L T P C

0 0 3 2


with:

Model and design various basic prototypes in the carpentry trade such as Lap joint, Lap Tee joint, Dove tail joint, Mortise &Tenon joint, Cross-Lap joint.

Design and model various basic prototypes in the trade of Welding such as Lap joint,Lap Tee joint, Edge joint, Butt joint and Corner joint.


CO1: Use carpentry, welding and foundry tools. [Usage]

CO2: Use safety measures in welding, carpentry, and foundry. [Usage] CO3: Design half lap joint and dovetail joint in carpentry. [Usage] CO4: Weld lap joint, butt joint and T-joint. [Usage]

CO5: Prepare of Sand mould for cube, conical bush, pipes and V pulley. [Usage] CO6: Fabricate parts like tray, frustum of cone and square box in sheet metal. [Usage]

LIST OF EXPERIMENTS 1. Introduction to use of tools and equipments in Carpentry, Welding, Foundry and Sheet

metal.

2. Safety aspects in Welding, Carpentry and Foundry.

3. Half lap Joint and Dovetail Joint in Carpentry

4. Welding of Lap joint, Butt joint and T-joint

5. Preparation of Sand mould for cube, conical bush, pipes and V pulley.

6. Fabrication of parts like tray, frustum of cone and square box in sheet metal.

TOTAL: 45

12S108 CHEMISTRY LABORATORY


L T P C

0 0 3 2


with:

Basic concepts of chemical analysis and its applications

Chemical and instrumental methods

Identification of acid-base in given sample

EDTA method to find hardness of water

Estimation of manganese in pyrolusite ore.


CO1:Estimate chlorine, manganese and calcium carbonates in water using EDTA,

Mohre‟s method [Assessment]

CO2: Estimate of oxygen in water using winkler‟s method [Usage]

CO3: Estimate of copper and zinc in brass sample [Usage]

CO4: Estimate of manganese in pyrolusite ore [Usage]

CO5: Conduct metric titration of mixture of strong and weak acids using

strongbase[Usage]

CO6: Estimate strenghth of Ferrous iron using Potentiometric titration [Usage]

CO7: Estimate concentration of Fe3+ iron using spectrophotometer [Usage]

LIST OF EXPERIMENTS

1. Estimation of hardness by EDTA method

2. Estimation of chloride by argentometric method

3. Determination Dissolved oxygen by Winkler’s method

4. Estimation of available chlorine in bleaching powder

5. Estimation of copper and zinc in brass sample

6. Estimation of manganese in steel sample.

7. Surface area of activated carbon by adsorption technique using acetic acid

8. Estimation of calcium and magnesium in magnesite ore

9. Estimation of manganese in pyrolusite ore

10.Conduct metric titration of mixture of strong and weak acids using strong base

11. Potentiometric titration ( Ferrous iron versus potassium dichromate)

12.Estimation of sodium or potassium usingflame photometer

13.Estimation nickel using spectrophotometer

14.Estimation of iron by spectrophotometer.

(Any twelve experiments only)

TOTAL: 45

12S109 C PROGRAMMING LABORATORY

[Common to CIVIL, EEE, EIE, ECE, CSE, IT & IBT]

L T P C

0 0 3 2


with:

Flowchart and algorithm for a given problem

Basic structure of the c-programming, declaration and usage of variables

Operators, expressions and IO formatting.

Conditional and iterative statements to write c programs

User defined functions to solve real time problems

C programs using pointers to access arrays, strings and functions.

C programs with pointers and allocation of memory using dynamic memory management functions.

User defined data types including structures and unions to solve problems.

Files handling in C.


CO1:Write C programs using Operators, Expressions and IO formatting [Usage] CO2:Write program to implement decision making and looping using C. [Usage]

CO3:Write programs using arrays and strings. [Usage] CO4:Apply and create functions, use recursion technique in their C program [Usage] CO5:Effectively use pointers in their C program. [Usage]

CO6:Write program using dynamic memory allocation [Usage] CO7:Write C program using structures and unions. [Usage] CO8:Write programs to efficiently manipulate files. [Usage]

CO9:Issue commands through command line arguments. [Usage] CO10:Develop graphical applications using C [Usage]

CO11:Develop small applications using elements and concepts of C. [Usage]

Exercises illustrating the following concepts:

1. Operators , Expressions and IO formatting 2. Decision Making and Looping 3. Arrays and Strings

4. Functions and Recursion 5. Pointers

6. Dynamic Memory Allocation 7. Structures 8. Unions

9. Files

10. Command line arguments

11. Graphics 12. Mini Project

TOTAL: 45

12S2Z1 COMMUNICATION SKILLS IN ENGLISH - II


L T P C

3 1 0 4

PREREQUISITES :

12S1Z1-Communication Skills in English-I


with:

Strategic competence to use spoken language in a wide range of communication

strategies.

Listening and writing skills for effective communication.

Soft skills and Technical Communication skills.

Understanding the discourse competence and to prepare the learner to write and

speak.

Writing abstract/notes for different themes.


CO1: Acquire articulation and listening skills and learn to read a passage using proper

grammar skills (Cloze reading). [Familiarity]

CO2: Analyze the organization of text and compare technical and general articles.

[Familiarity]

CO3: Apply Conversation and Listening skills for effective public speaking. [Assessment]

CO4: Apply language effectively to face interviews and group discussions. [Usage]

CO5: Apply reading and listening skills to make presentation and on a mini project.

[Familiarity]

CO 6: Apply writing skills to prepare reports. [Assessment]

UNIT I (9)

Use of Relative Clauses-Noun Phrases - Listening to Conversations- Telephonic

Conversational Skills Paralinguistic Communication (Articulation, Stress and Pause) – Cloze

Reading-Reading to practice stress, pause etc. -Process Description- Transcoding

UNIT II (9)

Cause and Effect Expressions-Time and Contracted Time Statements- Listening to

Narration/Speech – Extemporaneous -Instructions with Imperatives - Reading for inferring

meaning: Lexical and Contextual - Understanding the organization of the Texts -Writing

Articles (Technical & General).

UNIT III (9)

Phrasal Verbs -American and British Vocabulary- Video Listening: Listening to Authentic

Clippings in English (Movie/ Play)-Making Speeches (Introducing a Chief Guest, Delivering

Welcome Address, Proposing Vote of Thanks)-Reading for understanding discourse

cohesion-Logical Connectives - Minutes of the Meeting

UNIT IV (9)

Idiomatic Expressions -Numerical Expressions- Listening to authentic songs in English-

Mock Interviews-Reading for identifying the topic sentence in each paragraph-An

Introduction to Different kinds of Report-Report on an Industrial Visit-Report on an accident

UNIT V (9)

Abstract – foot notes-bibliography -plagiarism- Technical Style- Presentation of a Mini

Project Report of 25 to 30 pages on one of the topics from the First Year B.E Syllabus or

similar topics.


Text Books

1 Meenakshi Raman, SangeethaSharma,―Technical Communication: English Skills for

Engineers‖, Second Edition, Oxford University Press: New Delhi, 2009

Reference Books

1 RizviAshrav.M, ―Effective Technical Communication‖ Tata McGraw Hill: New

Delhi, 2005

2 Herbert, A.J, ―Structure of Technical English‖: the English Language Society

Authentic NET Resources

12S2Z2 ENGINEERING MATHEMATICS – II

[Common to CSE & IT]

L T P C

3 1 0 4

PREREQUISITES :

12S1Z2 - Engineering Mathematics-I

COURSE OBJECTIVES-Upon completion of this course the students will be Familiar

with:

Vector calculus operations and identities to solve physical problems.

Development of mathematical modelling of systems using differential equations.

Concept of Complex Vector differentiation.

Vector Integration.

Concepts of Laplace Transforms and its applications


CO1: Apply Green's, Gauss Divergence and Stoke's theorem to verify applications. [Usage]

CO2: Apply first, second and higher order differential equations to solve real world applications. [Assessment] CO3: Verify analyticity using Cauchy-Riemann equation and construct analytic

functions. [Assessment] CO4: Evaluate contour integration using Cauchy-Residue theorem. [Assessment]

CO5: Perform Laplace transformations to solve linear and second order differential equations with constant coefficients. [Usage]

UNIT IVECTOR CALCULUS (9)

Gradient , Divergence , Curl – Directional derivative – Irrotational and Solenoidal fields-Vector identities - Line, Surface and Volume Integrals – Green’s Theorem in a Plane , Gauss Divergence and Stoke’s Theorems ( Statements only) – Verifications and Applications.

UNIT IIORDINARY DIFFERENTIAL EQUATIONS (9) Linear equations of Second and Higher order with constant coefficients-Simultaneous first order Linear equations with constant coefficients - Linear equations of Second and Higher

order with variable coefficients –Legendre type. Method of variation of parameters-method of reduction of order.

UNIT IIICOMPLEX DIFFERENTIATION (9)

Functions of a Complex variable-Analytic functions- Cauchy Riemann equations and sufficient conditions (excluding proof)–Harmonic and orthogonal properties of analytic

functions –Construction of analytic functions-Conformal mappings: w= z + a ,az ,1/z , z2, ez ,cosz, sinz and Bilinear Transformation.

UNIT IVCOMPLEX INTEGRATION (9)

Cauchy’s integral theorem, Cauchy’s integral formula -Taylor’s and Laurent’s theorems (Statements only) and expansions – Poles and Residues – Cauchy’s Residue theorem –

Contour integration – Circular and semicircular contours.

UNIT VLAPLACE TRANSFORMATIONS (9) Laplace transforms - Properties and standard transforms-Transforms of unit step, unit impulse

and error functions – Transforms of periodic functions - Inverse Laplace transforms - Initial and Final value theorems –Convolution theorem (statement only) and applications- Applications to Solution of Linear y differential equations of second order with constant

coefficients..


1 Veerarajan.T., ―Engineering Mathematics‖ for Semesters I and II, Tata McGraw

Hill Publishing Co.,New Delhi., 2010. 2 Dr.Kandasamy.P.,Dr.Thilagavathy.K and Dr.Gunavathy.K., ―Engineering

Mathematics‖ for First Year B.E/B.Tech, S. Chand & Co., Ram Nagar, New Delhi, 2010.

Reference Books

1 N.P.Bali., Dr. Manish Goyal., ―A text book of Engineering Mathematics‖ vol. II ,

University science Press,New Delhi, 2010. 2 H.C.Taneja., ―Advanced Engineering Mathematics‖ vol.II, I.K.International Pub.

House Pvt.Ltd., New Delhi,2007.

3 Baburam., ―Engineering Mathematics‖, Pearson, New Delhi, 2010. 4 B.V.Ramana., ―Higher Engineering Mathematics‖ Tata McGraw Hill Publishing Co.,

New Delhi, 2007. 5 Grewal B.S., ―Higher Engineering Mathematics‖(40th Edition ) Khanna Publishers,

New Delhi., 2007.

12S203 ENGINEERING PHYSICS


L T P C

3 0 0 3


with:

Concepts and types of lasers and its applications.

Theory of fibre optics principles and its applications.

Origin of quantum physics and schrodingers‟ equation and applications.

About principles of ultrasonic and their industrial applications.

About fundamentals of crystal physics and its packing factor calculations.


CO1: Analyze the construction and working of CO2, Nd-Yag, Semiconductor and Dye lasers.[Usage] CO2: Explain fiber optics and classify fibers based on index profiles and modes.

[Familiarity] CO3: Analyze the dual nature of matter using Heisenberg's Uncertainty principle and

Schrodinger's time independent and dependent wave equations.[Assessment]

CO4: Apply piezoelectric detector method for industrial applications. [Usage] CO5: Compare crystalline and non crystalline materials and describe the lattice structure,

coordination number and packing factor for crystals. [Usage]

UNIT ILASERS (9) Introduction- Principle of laser action - characteristics of laser - Spontaneous emission and

Stimulated emission –Einstein’s coefficients - population inversion – methods of achieving population inversion -Types of pumping –Optical Resonator - Types of Lasers – Principle, construction and working of different types of laser- CO2,Nd- YAG, Semiconductor laser and

Dye laser- applications of laser -Lasers in microelectronics, welding, heat treatment, cutting – holography – construction and reconstruction of a hologram – applications of holography.

UNIT IIFIBER OPTICS AND APPLICATIONS (9)

Introduction – Basics Principles involved in fiber optics- Total internal reflection – Structure of optical fiber –Propagation of light through optical fiber –Derivation for Numerical

Aperture and acceptance angle - fractional index change - Preparation of optical fiber- Crucible and Crucible technique - Classification of optical fiber based on materials, refractive index profile and Modes - Splicing-fusion and multiple splices - Light sources for fiber

optics.- LED- Detectors- Principle of photo detection - PIN Photodiode, - Fiber optical communication links-Fiber optic sensors-Temperature, displacement.

UNIT IIIQUANTUM PHYSICS AND APPLICATIONS (9) Limitations of classical Physics - Introduction to Quantum theory - Dual nature of matter and

radiation- de-Broglie wavelength in terms of voltage, energy, and temperature –Heisenberg’s Uncertainty principle – verification - Schrödinger’s Time independent and Time dependent

wave equations – physical significance of a wave function - Particle in a one dimensional deep potential well– microscope – basic definitions of microscope - Electron microscope-Scanning Electron Microscope (SEM)-Transmission Electron Microscope (TEM).

UNIT IVULTRASONICS (9) Introduction – properties of ultrasonic waves – production of ultrasonic waves Magnetostriction effect- Magnetostriction generator- Piezoelectric crystals - Piezoelectric

effect- Piezoelectric generator- Detection of ultrasonic wave – kundt’s tube method – sensitive flame method – thermal detector method – piezo electric detector method-

cavitation - industrial applications- ultrasonic drilling- ultrasonic welding- ultrasonic soldering and ultrasonic cleaning-Non- destructive Testing-Pulse echo system, through transmission and resonance system.

UNIT VCRYSTAL PHYSICS (9)

Introduction – Crystalline and Non- crystalline materials –Lattice – Unit Cell –Crystal system - Bravais lattices – Miller indices – d spacing in cubic lattice – Calculation of number of

atoms per unit cell – Atomic radius – Coordination number – Packing factor for SC, BCC, FCC, and HCP structures – NaCl– Polymorphism and allotropy – Crystal defects – Point, line and surface defects.


Text Books

1 Ganesan S. Iyandurai N, ―Engineering Physics I‖, Gems Publishers, Coimbatore,2010

Reference Books

1 Gaur R K and Gupta S L-‖Engineering Physics‖, Dhanpat Raj and sons, 2002.

2 Avadhanulu M N and Kshirsagar P G,‖A textbook of Engineering Physics‖S.Chand and Company Ltd,NewDelhi,2005

3 Arumugam M- ―Engineering Physics‖, Anuadha Publishers, 2002

4 Jayakumar S, ―Engineering Physics‖, RK Publishers, Coimbatore, 2003

12S204 OBJECT ORIENTED PROGRAMMING USING C++

[Common to all circuit branches]

L T P C

3 0 0 3

PREREQUISITES :

12S106 - Programming in C

COURSE OBJECTIVES- Upon completion of this course the students will be Familiar

with:

Concept of classes, objects and their relationship andtosolvecomplexity

Usage of UML diagrams.

Elements of C++

Development of object oriented C++ programs

Object oriented concepts in generic programming


CO 1: Analyze the complexity of a software system [Usage]

CO2: Identify and apply object oriented concepts like abstraction, encapsulation, modularity, hierarchy, typing, concurrency and persistence.[Usage]

CO 3: Use structure and behavioral diagrams.[Usage]

CO 4: Apply micro and macro development process [Usage]

CO 5: Estimate various metrics specific to object oriented development [Assessment]

CO 6: Document requirement on design for development and maintenance of object oriented software systems. [Usage]

CO 7: Apply arrays, pointers and functions to write a C++ program. [Usage]

CO 8: Create and use data type, expression and functions in C++. [Usage]

CO 9: Use polymorphism to classes and objects in C++ programs. [Usage]

CO 10: Use inheritance and templates in C++ program. [Usage]

CO 11: Perform efficient exception handling. [Usage]

UNIT ICONCEPTS (9)

Complexity: Inherent Complexity-Structure-bringing Order to Chaos-On Designing Complex

Systems; Object Model: Evaluation-Elements-Applying Object Model; Classes and Objects-Nature of an Object-Relationships- Nature of a Class-Relationship among Classes-Interplay

of classes and objects-On building Quality classes and objects; Classification- importance-

identifying classes and objects-key abstraction and mechanisms.

UNIT IIMETHODS (9) Notation: Elements-class diagram-state transition, object, Interaction, Module, Process

diagram-Applying the Notation; Process: Principles-micro, macro development process; Pragmatics: Management and planning – staffing - Release management-Reuse-Quality

Assurance and Metrics-Documentation-tools-Benefits and Risks

UNIT IIIOVERVIEW OF C++ (9) Introduction - Variables and basic types - library types- Arrays - Pointers- Expressions-

Statements - Functions -I/O library

UNIT IVCLASSES AND DATA ABSTRACTION (9) Classes: Definitions and Declarations-this pointer-scope constructors- friend, static class

members; Copy control; Overloading operations and conversions; Definitions, Input, output operators, arithmetic, relational, assignment, subscript, member access, increment and

decrement, call operators, function objects, conversions and class types.

UNIT VOBJECT ORIENTED AND GENERIC PROGRAMMING (9) Object Oriented Programming: Inheritance, virtual functions; Templates-Template

compilation models-class template members-generic handle class-template specialization-overloading and function templates-exception handling.


1 Grady Booch, ―Object Oriented Analysis and Design with Applications‖, Third

Edition, Pearson Education,2008. 2 Stanley B.LippmanJoseeLajoie, BarbaraE.Moo,‖ C++ Primer‖,4th Edition, Pearson

Education,2008.

Reference Books

1 Ali Bahrami,‖Object oriented systems Development‖,TMH,second reprint 2008. 2 BjarneStroustrup, ―The C++ Programming Language‖ 4th edition pearson education

3 Herbert Schildt,‖The Complete Reference C++‖,TataMcGraw-Hill Pub.Co.Ltd.,4th edition,2003.

4 Ira Pohl,‖Object oriented programming Using C++‖,secondEdition,Pearson

Education ,2008. 5 VenuGopalK.R.,Rajkumar,Ravishankar.T,‖MasteringC++‖,TataMcGraw-Hill

Pub.Co.Ltd. 1999.

12S205 DIGITAL SYSTEMS


L T P C

3 0 2 4

PREREQUISITES :

12S103- Basics of Electrical and Electronics


with:

Foundations in Number systems and Boolean algebra

Gate level minimization using map reduction

Designing simple combinational circuits

Synchronous and asynchronous sequential circuits

Combinational logic circuits and sequential logic circuits

COURSE OUTCOMES- Upon completion of this course the students will be able to:

CO1: Convert decimal number to Binary, Octal and Hexadecimal forms and Vice-versa.[Usage]

CO2: Perform Binary arithmetic for signed and unsigned numbers. [Usage]

CO3: Use Boolean laws and draw logic circuits for Boolean equation. [Assessment]

CO4: Make Karnaugh map to simplify Boolean expression. [Usage]

CO5: Use SOP and POS methods to design logic circuits. [Assessment]

CO6: Analyse and design arithmetic circuits such as binary adder, subtractor and multiplier.[Usage]

CO7: Show how magnitude comparator, multiplexer and de-multiplexer works

[Familiarity]

CO8: Use HDL to deal with any digital logical design [Usage] CO9: Describe the characteristic equation and analyse the Flip-Flop [Familiarity]

CO10: Describe the basic construction and operation of Asynchronous and Synchronous

circuits. [Familiarity] CO11: Write and Verify HDL behavioral description of shift register, Up-Down counter, ringcounter [Usage]

CO12: Write and Verify HDL description for binary multiplier [Usage]

UNIT IBOOLEAN ALGEBRA AND LOGIC GATES (9)

Digital Systems, Binary Numbers, Number Conversions-Octal and Hexadecimal Numbers,

Complements, Signed Binary Numbers, Introduction to Boolean algebra and Logic Gates –

Boolean functions - Canonical and Standard Forms-Digital Logic gates –Digital Integrated

Circuits-Introduction, Special Characteristics, and Different Logic Families.

UNIT IIGATE LEVEL MINIMIZATION (9)

Introduction, The Map Method, Four Variable Map, Five Variable Map, Product of Sums

Simplification, Don’t Care Conditions, NAND and NOR implementation, Exclusive –OR

Function, Hardware Description Language.

UNIT IIICOMBINATIONAL LOGIC (9)

Combinational circuits- Analysis and Design Procedure- Binary Adder- Subtractor- Decimal

Adder – Binary Multiplier – Magnitude Comparator – Decoders- Encoders- Multiplexers-

HDL for Combinational Circuits.

UNIT IVSYNCHRONOUS AND ASYNCHRONOUS SEQUENTIAL

LOGIC

(9)

Sequential circuits- Latches – Flip flops – Analysis of Clocked Sequential Circuits – HDL

Models for sequential Circuits-State Reduction and Assignment- Design Procedure.

Asynchronous Circuits- Analysis Procedure- Circuits with Latches – Reduction of State Flow

Tables – Race Free State Assignment –Hazards- Design Example.

UNIT VREGISTERS, COUNTERS AND MEMORY (9)

Registers, Shift Registers, Ripple Counters, Synchronous Counters, HDL for Registers and

Counters, Random access memory, Memory Decoding, Error Detection and correction, Read only Memory, Programmable Logic Array. Register Transfer Level Introduction, RTL in

HDL, Algorithmic State Machines, Binary Multiplier, HDL for ASM and Binary Multiplier.

LECTURE: 45 PRACTICALS: 30 TOTAL: 75

Experiments

1. Design a combinational circuit 2. Design a sequential circuit

3. Design and Implementation of Flip-Flops 4. Design and implementation of Shift registers

5. Design and Implementation of Synchronous and Asynchronous counters 6. Simulation of combinational circuit using VHDL

Text Books

1 Morris Mano ,‖Digital Design”, Prentice Hall of India Private Ltd, 5th Edition, 2011.

Reference Books

1 Bhasker.J, ―A VHDL Primer”, Prentice Hall India, 2003.

2 Charles H.Roth,‖ Fundamentals of Logic Design―, Fourth Edition, Jaico Publishing

House, 2000.

3 Peter J. Ashenden,‖ Digital design-An embedded system approach using

Verilog‖,Morgan Kaufmann publishers,2008.

12S206 DATA STRUCTURES AND APPLICATIONS-I


L T P C

3 1 0 4

PREREQUISITES :

12S106 - Programming in C


with:

Basic mathematics for problem analysis.

Stack and queue operations.

Aboutrepresentation, operations and the use of basic linear data structures and their variants in diverse applications.

Representation, operations and the use of basic non-linear data structures in diverse applications.

Identifying and usage of the right data structure for the given application.


CO1: Identify efficient algorithms and analyze time and space complexity using

Big O, Omega and theta notations. [Familiarity]

CO2: Analyze the arrangement of data elements in a stack and a Queue.[Usage]

CO3: Solve symbol balancing, expression conversion, and tower of Hanoi

usingstacks.[Usage]

CO4: Solve job scheduling and eight queen problems using queues. [Usage]

CO5: Use singly, doubly and circular linked list. [Usage]

CO6: Use linked list in applications such as design of Text Editor and Polynomial

Arithmetic [Usage]

CO7: Use binary tree, binary search tree and AVL tree. [Usage]

CO8: Implement simple file system and evaluate expression using appropriate tree

data structure. [Usage]

CO9: Construct and represent a graph [Usage]

CO10: Perform topological sorting and find shortest path using

dijkstra‟salgorithms.[Usage]

CO11:Construct minimal spanning tree and Euler‟s circuit. [Usage]

CO12:Solve graph coloring problem. [Usage]

UNIT IPROBLEM SOLVING (9) Problem solving – top-down design – Implementation – verification – efficiency analysis –

sample algorithms

UNIT II STACKS AND QUEUES (9)

Implementation of Stacks – Linked Stacks – Introduction To Recursion – Backtracking –

Principles of Recursion – Methods For Removing Recursion – Implementation of Queues –

Circular Queues In C – Applications of stacks and Queues: Function calls, Balancing

Symbols, Evaluation of Polish Expression – Translation from Infix to Polish, Simulation

UNIT III LINKED LISTS (9) Pointers And Linked List – Linked Queues - Abstract Data Type – Implementations – List

Specifications – Implementation Of Lists – Doubly Linked List – Comparison of

Implementations – Strings – Linked Lists in Arrays – Application: A Text Editor ,

Polynomial Arithmetic

UNIT IV BINARY TREES (9)

Introduction – Threaded Binary Tree – Binary Search Tree – AVL Tree – Tree Traversals –

Applications: Implementation of File System, Evaluation of Arithmetic Expression.

UNIT V GRAPHS (9) Introduction – Graph Traversal – Topological Sorting – Dijkstra’s Algorithm – Minimal

Spanning Tree – Applications – DFS – Biconnectivity – Euler Circuits – Graph Coloring

Problem.


Text Books

1 R.G.Dromey,‖How To Solve It By Computer‖ ,Pearson Education, Chapter 1.

2 Robert Kruse, C.L.Tondo, Bruce Leung, ShashiMogella, ―Data structures And

Program Design In C‖, Pearson Education, 2nd Edition, Chapters 3-5,9,11.

Reference Books

1 Jean-Paul Tremblay & Paul G.Sorenson, “An Introduction to Data Structures with

Applications”, Tata McGraw Hill Publishing Book Company , 2007.

12S207 PHYSICS LABORATORY


L T P C

0 0 3 2


with:

Wavelength of prominent spectral lines by using Spectrometer

Determining the thickness of the given paper using Air wedge.

Young's modulus and determination of micro particle size.

Calibrate ammeter, voltmeter to find out the rigidity by modelling.

Calculating the input impedance and output admittance forward gain by using NPN transistor kit.

Determination of resistance of an unknown coil and understand transistor characteristics.

Determining the rigidity modulus, movement of inertia by using Torsional pendulum.

COURSE OUTCOMES-Upon completion of this course the students will be able to: CO1: Demonstrate normal incidence method using Spectrometer and visualize the

disturbance of wave fronts using air wedge. [Assessment] CO2: Analyze cantilever bending using Koening's method and determine size of particle.

[Assessment] CO3: Demonstrate thermal conductivity of a bad conductor in form of a disc using Lee‟s method. [Usage]

CO4: Calibrate ammeter and voltmeter and derive equations of rotational motion of a torsional pendulum. [Assessment]

CO5:Determine resistance of a coil using Carey Foster's bridge and analyze characteristics of a transistor. [Usage]

LIST OF EXPERIMENTS 1. Spectrometer - diffraction grating Normal incidence method 2. Air wedge 3. Young’s modulus – cantilever bending Koenig’s method 4. Particle size determination 5. Ammeter and voltmeter calibration – low range 6. Resistance of the given coil of wire – carey Foster’s bridge 7. Torsional pendulum 8. Transistor characteristics

TOTAL: 45

12S208 ENGINEERING GRAPHICS


L T P C

2 0 3 4

PREREQUISITES :

121ZS2- ENGINEERING MATHEMATICS II


with:

Geometrical constructions

Orthographic Projections.

Performing section of solids and development of the same.

Interpretation of solids.

Pictorial view of solids


CO1: Represent geometrical constructions as per international standards.[Familiarity]

CO2: Interpret practicalsituations relevant to conics and technical drawings.[Usage] CO3:Generate multiple views to make objects practically more logical and perform

projections byauxiliary methods.[Usage] CO4: Generate fabrication layout of simple solids through Development of surfaces concept and dissect the solids.[Usage]

CO5: Interpret cylinder and cones and draw sectioned views. [Assessment] CO6: Generate three dimensional scaled views through a given set of multiple pictorial

views. [Usage]

UNIT I GEOMETRICAL CONSTRUCTIONS (15) Dimensioning- Lettering-Types of Lines-Scaling conversions- Dividing a given straight line

in to any number of equal parts-Bisecting a give angle-Drawing a rectangular polygon given one side-Special methods of constructing a pentagon and hexagon-Construction of curves like ellipse, parabola, cycloid and involute using one method

UNIT II ORTHOGRAPHIC PROJECTIONS (25) Introduction to Orthographic Projection-Projection of points-Projection of straight lines with

traces-Projection of planes-Conversion of pictorial views to orthographic views-Projection of

solids-Auxiliary projections

UNIT III SECTION OF SOLIDS AND DEVELOPMENT (15) Section of solids-Development of surfaces

UNIT IV INTERPETRATION OF SOLIDS (10) Cylinder and cylinder, cone and cylinder only.

UNIT V PICTORIAL VIEWS (10)

Isometric projections-Conversion of orthographic views to pictorial views (simple objects).

LECTURE: 30 PRACTICALS: 45 TOTAL: 75

Reference Books

1 K. Vengopal, ―Engineering Graphics ‖, New Age International (P) Limited, 2007

2 Dhananjay.A.Jolhe, ―Engineering Drawing‖ Tata McGraw Hill Publishing Co., 2007

3 K.V.Nataraajan, ―A Text Book of Engineering Graphics‖, Dhanalakshmi Publishers, Chennai, 2006

4 M.B.Shah and B.C.Rana, ―Engineering Drawing‖, Pearson Education, 2005 5 Luzadder and Duff, ―Fundamentals of Engineering Drawing‖, Prentice Hall of India

Pvt Ltd, XI Edition,2001

12S209 OBJECT ORIENTED PROGRAMMING LABORATORY


L T P C

0 0 3 2

PREREQUISITES :

12S106 – Programming in C


with:

Fundamental knowledge of object oriented programming.

Skills required to become a proficient C++ programmer

Transforming the physical problem domain into a hierarchy of objects.

Using OOP to solve simple engineering problems

Development of solution for complex problems in the real world.

COURSE OUTCOMES- Upon completion of this course the students will be able to: CO1: Design an object oriented program using classes and objects. [Usage] CO2: Apply inheritance to reuse the C++ code. [Usage]

CO3: Apply polymorphism to extend the code and reduce the complexity of the program. [Usage]

CO4: Implement files and streams in C++ programs. [Usage] CO5: Implement exception handling in projects using generic types. [Usage]

LIST OF EXPERIMENTS 1. Classes and Objects

2. Arrays and Structures 3. Functions 4. Inheritance

5. Operator Overloading 6. Function Overloading

7. Virtual Functions 8. Pointers 9. Templates

10. Files and Streams 11. Exception handling

12. Mini project

TOTAL: 45

12S3Z1 ENGINEERING MATHEMATICS – III


L T P C

3 1 0 4

PREREQUISITES :

12S2Z2 - Engineering Mathematics II


with:

The partial differential equation concepts, Fourier series and Fourier

transformations

The method of separating variables and introduce Fourier series analysis to solve

the boundary value problems

Finding solutions for difference equations using Z- transformation


CO1: Form and Solve first & higher order partial differential equation[Usage]

CO2: Use Lagrange‟s Equations. [Usage]

CO3: Determine the behavior of the Fourier series at points of discontinuity using

Dirichlet‟s boundary condition.[Familiarity]

CO4: Use half range sine and cosine series, Parseval‟s Identity.[Usage]

CO5: Perform Harmonic Analysis of a discrete function.[Usage]

CO6: Solve problems using Fourier integral theorem and convolution theorem [Usage]

CO7: Solve one dimensional wave and heat equation using separation of variables

method and Fourier series. [Usage]

CO8: Apply Z-transform techniques to solve second order difference equations.

[Assessment]

UNIT I PARTIAL DIFFERENTIAL EQUATIONS (9) Formation of PDE by elimination arbitrary constants and functions – Solutions of standard

first order partial differential equations – Lagrange’s equation – Linear partial differential equations of second and high order with constant coefficients-homogeneous and non homogeneous types

UNIT II FOURIER SERIES (9) Dirichlet’s Conditions – General Fourier Series –Odd and even functions- Half range Sine and cosine series Parseval’s Identity – Harmonic Analysis

UNIT III FOURIER TRANSFORMS (9) Statement of Fourier integral Theorem– Fourier transform pair– Fourier Sine and Cosine Transforms– Properties– Transforms of Simple functions- Convolution Theorem – Parseval’s

Identity-Finite Fourier transforms

UNIT IV BOUNDARY VALUE PROBLEMS (9) Method of separation of variables – One dimensional wave equation – One dimensional heat

equation – Unsteady and Steady state conditions –Fourier series solution

UNIT V Z-TRANSFORMS (9) Z-transforms - Elementary properties-Inverse Z-transform - Initial and Final value theorems -

Convolution theorem - Formation of difference equations - Solution to difference equations of second order with constant coefficients using Z – transform


Text Books

1 Veerarajan.T., “Transforms and Partial Differential Equations”, Tata McGraw Hill PublishingCo., New Delhi, first edition- updated, 2012

Reference Books

1 N.P. Bali., Dr. Manish Goyal., “Transforms and Partial Differential Equations”,

University science Press,New Delhi, 2010. 2 Dr.Kandasamy.P.,Dr.Thilagavathy.K and Dr.Gunavathy.K., “Engineering

Mathematics Vol III‖, S.Chand& Co., Ram Nagar, New Delhi, 2009.

3 B.V.Ramana., “Higher Engineering Mathematics” Tata McGraw Hill Publishing Co., New Delhi,2007.

4 Grewal B.S., “Higher Engineering Mathematics” (40th Edition) Khanna Publishers, New Delhi.,2007.

5 Glyn James, “Advanced Modern Engineering Mathematics” (4th Edition) Wiley

India , New Delhi., 2011

12S302 DISCRETE MATHEMATICS


L T P C

3 1 0 4

PREREQUISITES :

12S2Z2 –Engineering Mathematics II


with:

Way to infer information from the facts using propositional and predicate logic.

Set theory and usage of recursion in mechanical theorem proving.

Concepts and properties of algebraic functions.

Basic concepts of Boolean algebra to design digital circuits.

Basic concepts of graph theory.


CO 1: Represent Facts using propositional and predicate logic and infer information from them. [Familiarity]

CO 2: Use set of relation to transform a finite set to another finite set. [Usage] CO 3: Use the concepts of algebraic structures such as Semigroups and

Monoids.[Usage] CO 4: Construct finite state machines using Boolean algebra concepts.

[Assessment]

CO 5: Apply graph theory concepts in simple precedence grammars and PERT.[Usage]

UNIT IMATHEMATICAL LOGIC (9)

Propositional Logic- Statements and Notations- Connectives- Normal Forms- The theory of Inference for the Statement calculus- Predicate Calculus- Inference theory of the predicate

calculus.

UNIT IISET THEORY (9) Basic Concepts of set theory- Representation of Discrete Structures- Relations and Ordering–

Functions- Natural Numbers– Recursion- Recursion in mechanical theorem proving.

UNIT IIIALGEBRAIC STRUCTURES (9) Algebraic systems-Semigroups and Monoids- Grammars and Languages- Polish Expressions

and their compilation– Groups- Application of residue arithmetic to computers- Group codes.

UNIT IVLATTICES AND BOOLEAN ALGEBRA (9)

Lattices and partially ordered sets- Boolean Algebra-Boolean Functions- Representation and Minimization of Boolean Functions- Design Examples using Boolean Algebra- Finite State machines.

UNIT VGRAPH THEORY (9)

Basic concepts of Graph theory- Storage representation and Manipulation of graphs- Simple precedence grammars- PERT and related techniques- Introduction to Computability Theory.


Text Books

1 Tremblay.J.P and Manohar.R, “ Discrete Mathematical Structures with Applications

to Computer Science “, Tata McGraw Hill Company, 1975.

Reference Books

1 Liu C.L, “ Elements of Discrete Mathematics “, Mc-Graw Hill International, 2nd

Edition, 2000. 2 Kenneth H. Rosen, “ Discrete Mathematics and its Applications “, Mc-Graw Hill

Company, seventh edition, 2012. 3 ThomosKoshy, “Discrete Mathematics with Applications”, Elsevier Publications,

Second edition,2004.

4 Ralph.P.Grimaldi, “Discrete and Combinatorial Mathematics:An Applied

Introduction”, Pearson Education Asia , New Delhi – fifth Edition 2004.

5 Seymour Lipschutz and Mark Lipson, “ Discrete Mathematics “,Schaum‟s outlines, Tata McGraw Hill Company, New Delhi, Third edition, 2007.

6 Veerarajan.T., “Discrete Mathematics”, Tata McGraw Hill Publishing Co., New

Delhi., 2006. 7 T.Sengadir, “ Discrete Mathematics and Combinatorics”, Pearson Education Asia,

2009. 8 BhavaniSatyanarayana, KuchamSyam Prasad, “ Discrete Mathematics and Graph

theory”, PHI Learning Pvt Ltd, New Delhi, 2009.

9 SachinderBal Gupta, “ Discrete Mathematics and Structures”, University Science Press, fifth edition, 2008

12S303 MICRO PROCESSORS, MICRO CONTROLLERS AND APPLICATIONS


L T P C

3 0 0 3

PREREQUISITES :

12S205 - Digital Systems


with:

Working principles and programming of 8085 microprocessor.

Working principles, instruction set and programming of 8086 microprocessor.

Programmingfor interface peripheral devices.

Working principles and programming of 8051 microcontroller.

The usage of microprocessor and microcontroller in real-time applications.


CO 1: Explain the architecture, timing diagram, instruction set and addressing modes of 8085 microprocessor.[Familiarity]

CO 2: Write simple programs like addition, subtraction, multiplication, division, converting number systems using 8085 instruction set.[Assessment]

CO 3: Explain the architecture, timing diagram, instruction set and addressing modes of 8086microprocessor. [Familiarity] CO 4: Demonstrate the interfacing of programmable peripheral controllers such as

8251, 8255, 8257, 8259, 8279, 8253 with 8085 microprocessor.[Usage] CO 5: Explain the architecture, timing diagram, instruction set and addressing

modes of 8051microcontroller. [Familiarity] CO 6 :Develop applications like temperature control, Stepper motor control, Traffic light control, Robotics and Embedded Control, Washing machine Control,

Turbine motor using 8051. [Assessment]

UNIT I 8 BIT MICROPROCESSOR (9) 8085 architecture- Timing diagrams – ROM/ RAM Interfacing – Decoding of memory

addresses Interrupts – Vector interrupts – ISS - instruction set- Programming with 8085.

UNIT II 16 BIT MICROPROCESSOR (9) Architecture of 8086 – 8086 in MIN/ MAX mode – Addressing modes- Instruction set -

Programming with 8086.

UNIT III PERIPHERALS AND INTERFACING WITH 8085 (9) Serial and parallel I/O (8251 and 8255) – Programmable DMA controller (8257)

Programmable interrupt controller (8259) – Keyboard and Display controller (8279 ) - Timer (8253) - ADC/ DAC interfacing.

UNIT IV MICROCONTROLLER (9) INTEL 8051 Architecture – 8051 Microcontroller hardware-Ports and Circuits-External

memory Counter and timers – Serial data I/O – Interrupts – Instruction set - Programming examples - Applications of 8051.

UNIT V MICROPROCESSOR BASED APPLICATIONS (9)

Temperature controller - Stepper motor control – Traffic light control– Robotics and Embedded Control- Washing machine Control - Mining Problem - Turbine motor.


Text Books

1 Ramesh S.Gaonkar, “ Microprocessor - Architecture, Programming and

Applications with the 8085 “,Prentice Hall, fifth edition, 2002.

2 Krishna Kant , “Microprocessors and Microcontrollers “, PHI , 2007

Reference Books

1 Douglas V.Hall, “ Microprocessors and Interfacing: Programming and Hardware “, Tata McGraw Hill, second edition, 1992.

2 BarreyB.Brey, “ The INTEL Microprocessor 8086/8088,80186,286,386,486,

Pentium and Pentium Pro processor – Architecture , Programming and

Interfacing “, Pearson Education Asia , Eigth edition, 2009.

3 MykePredko “ Programming and Customizing the 8051 Microcontroller “, Tata McGraw- Hill Edition , 1999

4 Ray.A.K. &Bhurchandi.K.M., “ Advanced Microprocessors and Peripherals -

Architectures, programmingand Interfacing “, Tata Mc-Graw Hill, second edition, 2006

12S304 ANALOG AND DIGITAL COMMUNICATION


L T P C

4 0 0 4

PREREQUISITES :



with:

Basic analog modulation techniques.

Fundamental knowledge required to explore wireless communication systems.

Digital transmission techniques.

Spread spectrum techniques and multiple access techniques for wireless communication.

Working principles of microwave and optical communication system.


CO1: Explain the principles of Amplitude modulation, Frequency modulation and Phase modulation [Familiarity].

CO2:Describe the operation of transmitter and receiver system for digital communication. [Familiarity]

CO3:Apply the concept of pulse code modulation for telecommunication

networks.[Usage]

CO4:Describe the concept of spread spectrum modulation to obtain secure

communication. [Familiarity]

CO5: Differentiate multiple access techniques like FDMA,TDMA, CDMA and SDMA. [Familiarity]

CO6: Explain the working principles of microwave antennas. [Familiarity]

CO7: Explain the optical fiber communication system. [Familiarity]

UNIT I FUNDAMENTALS OFANALOG COMMUNICATION (9)

Principles of amplitude modulation-AM envelope - frequency spectrum – bandwidth - modulation index - percent modulation - Voltage and power distribution - AM detector –

peak detector - Angle modulation - FM and PM waveforms - phase deviation and modulation index - frequency deviation and percent modulation - Frequency analysis of angle modulated waves - Bandwidth requirements for Angle modulated waves - FM detector – slope detector.

UNIT II DIGITAL COMMUNICATION (9) Introduction- Shannon limit for information capacity- ASK transmitter, receiver and bandwidth- FSK transmitter, receiver and bandwidth- BPSK transmitter, receiver and

bandwidth- QPSK transmitter, receiver and bandwidth- Quadrature Amplitude modulation – transmitter, receiver and bandwidth- bandwidth efficiency- carrier recovery – squaring loop-

Costas loop- DPSK – transmitter and receiver.

UNIT III DIGITAL TRANSMISSION (9)

Sampling theorem- reconstruction of message from its samples- Pulse modulation- PCM – PCM sampling, quantization- signal to quantization noise rate-companding – analog and

digital – percentage error- delta modulation-transmitter and receiver- adaptive delta modulation- differential pulse code modulation-transmitter and receiver- pulse transmission – Intersymbol interference- ISI-Nyquist criteria for distortionless transmission.

UNIT IV SPREAD SPECTRUM AND MULTIPLE ACCESS TECHNIQUES (9) Pseudo-noise sequence -Direct Sequence spread spectrum with coherent binary PSK- Frequency-hop spread spectrum – slow and fast hopping. multiple access techniques: FDMA-

TDMA- CDMA - SDMA- wireless communication-frequency reuse and cell splitting- TDMA and CDMA in wireless communication systems- source coding of speech for wireless

communications.

UNIT V MICROWAVE AND OPTICAL COMMUNICATION (9) UHF and microwave antennas –parabolic and conical horn antenna- frequency modulated

microwave radio system – transmitter, receiver and repeater- Line of sight path characteristics. Optical fiber Communication System: Light propagation in fiber- Optical fiber classification-Losses in optical fibers- Sources and Detectors


Text Books

1 Wayne Tomasi, “Electronic Communication Systems: Fundamentals Through

Advanced”, Pearson Education, Fifth edition, 2004

2 Simon Haykin, “Communication Systems”, 4th Edition, John Wiley & Sons, Third edition, 2004.

Reference Books

1 B.P.Lathi,”Modern Analog And Digital Communication systems”, 4/e, Oxford

University Press, 2009 2 G Kennedy, B Davis and S R M Prasanna “Electronic communication systems” Tata

Mc-Graw Hill EducatioPvt Limited, Fifth Edition 2011 3 H.Taub,D L Schilling ,G Saha ,”Principles of Communication”3/e,2007. 4 Martin S.Roden, “Analog and Digital Communication System”, 5rd Edition, Shroff

Publishers & Distributors Pvt. Limited, 2005. 5 B.Sklar,”Digital Communication Fundamentals and Applications”2/e Pearson

Education 2001. 6 V ChandraSekar, “Analog communication” Oxford University press, 2010 7 Louis E. Frenzel “Principles of Electronic Communication Systems”, Third edition,

Tata Mcgraw Hill Education Private Limited, 2008.

12S305DATASTRUCTURESANDAPPLICATIONS–II


L T P C

3 1 0 4

PREREQUISITES :

12S206 - Data Structures and Applications – I


with:

Different sorting and searching techniques.

Basic operations on balanced trees to achieve optimal searching.

Space dimensional representation using advanced tree structures.

Different heap structures used for dynamically changing multi dimensional

applications.

Hash tables and their growing applications.


CO1: Sorting an array using sorting algorithms such as selection, bubble, insertion,

shell, tree, heap and radix sort.[Assessment]

CO2: Perform searching for an element in an array using searching algorithms such as

linear and binary search. [Assessment]

CO3: Describe the structure, properties and operations of height balanced trees and weight balanced trees [Familiarity]

CO4: Describe the structure, properties and operations of Finger trees, Splay Trees, Interval trees, segment trees, Orthogonal range trees and kd-trees.[Familiarity]

CO5: Describe the structure, properties and operations of heap data structure such as array- based heaps, leftist heaps, skew heaps, Binomial heaps and Fibonacci heaps [Familiarity]

CO6: Describe the structure of double ended and multi dimensional heap [Familiarity]

CO7: Describe the collision resolution strategies in hash table implementation

[Familiarity]

CO8: Use extendible hashing for time sensitive applications [Usage]

CO9: Design Bloom filter for network related problems such as hash based paging and

location updating, traffic flow measurement, packet classification [Usage]

CO10: Use of appropriate dynamic data structure for internet router table. [Usage]

UNIT ISORTINGAND SEARCHING TECHNIQUES (9) Sorting: Selection sort – Bubble sort – Insertion sort – shell sort – Tree sort: Heap sort –

Partition-Exchange sort – Radix sort – Address Calculation sort. Searching: Sequential search – Binary search.

UNIT IISEARCH TREES AND BALANCED SEARCH TREES (9) Two models of search trees- General properties of transformation-Height of search tree-Basic

find, insert and delete-Returning from leaf to root-Dealing with non unique keys-queries for the keys in an interval-Building optimal search trees-converting trees into list- Removing a

Tree-Height-balanced trees – Weight balanced trees –(a,b)-and B-trees-Red-black trees – Top down Rebalancing- Trees with constant update at a known location.

UNIT IIITREE STRUCTURES FOR SETS OF INTERVALS (9)

Finger trees and level linking – Trees with partial Rebuilding – Splay Trees – Skip list – joining and splitting balanced search trees – Interval trees – segment trees – Trees for the union of intervals – Trees for sum of weighted intervals – Trees for interval restricted

maximum sum queries – Orthogonal range trees – Higher dimensional segment trees – Other systems of building blocks – Range-counting and semi group model – kd-trees and related

structures.

UNIT IVHEAPS AND UNIONS (9) Balanced search trees as heaps - Array-based heaps – Heap-ordered trees and Half-ordered trees – Leftist heaps – Skew heaps – Binomial heaps – Changing keys in heaps – Fibonacci

heaps – Heaps of optimal complexity – Double-ended heap structures and multidimensional heaps – Heap-related structures with constant-time updates – Union-find: merging classes of

a partition - Union-find: with copies and dynamic segment trees – List splitting – Problems on root directed trees – Maintaining a linear order.

UNIT VDATA STRUCTURE TRANSFORMATION AND HASH TABLES (9)

Making structure dynamic-Making structure persistent-Data structures for strings: Tries and compressed tries-Dictionaries allowing errors in queries-Suffix trees-Suffix arrays-Hash tables: Basic hash tables and collision resolution-Universal families of hash functions-Perfect

hash functions-Hash trees-Extendible hashing-Membership testers and bloom filters. Applications: IP router table, Multidimensional packet classification-Data structures in web

information retrieval-Web as a dynamic graph-Collision detection.


Text Books

1 Jean-Paul Tremblay & Paul G. Sorenson, ―An Introduction to Data Structures with

Applications‖, Tata McGraw Hill Publishing Book Company, 1991. 2 Peter brass,” Advanced data structures”, Cambridge University press, 2008 3 Dinesh P.Mehta,SartajSahni ” Handbook of Data structures and applications”,

Chapman & Hall/CRC Press, 2005.

Reference Books

1 Robert L. Kruse, Bruce P.Leuag& Clovis L.Tondo, “Data Structure and Program

Design in C‖, Prentice Hall of India Pvt. Ltd., Second edition, 1997. 2 Sara Baase, Allen Van Gelder, ―Computer Algorithms: Introduction to Design and

Analysis‖, Pearson Education, Third Edition, 2000. 3 Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, Clifford Stein,

“Introduction to Algorithms‖, Third Edition, Prentice-Hall India, 2009.

4 ArpitaGopal, ―Magnifying Data Structures‖, PHI,2010.

12S306 PROGRAMMING IN JAVA


L T P C

3 0 2 4

PREREQUISITES :

12S204 - Object Oriented Programming using C++


with:

Basic programming constructs in java to develop simple object oriented programs.

Exception handling, multi-threading and I/O programming and explore the skills in program development.

Development of network programming and GUI applications

Manipulation of images.

Distributed programs and methods to connect with databases.

Development of Enterprise applications using Swings, Javabeans and Servlets.


CO1: Write simple java programs using fundamental concepts of java like control structures, inheritance, packages, interfaces and exception handling. [Usage]

CO2: Write java program using multithreading and string handling. [Usage] CO3: Develop GUI based applications using Applets. [Usage]

CO4: Write java programs to display and manipulation of graphical images. [Usage] CO5: Establish database connectivity.[Familiarity] CO6: Develop client server programs using RMI [Usage]

CO7: Develop applications using javabeans, swing and servlet. [Assessment]

UNIT IFUNDAMENTALS OF JAVA PROGRAMMING (9) History and Evolution of Java- Overview of java– Operators- Control Structures– Methods-

Classes and Objects– Inheritance- Packages and Interfaces- Exception Handling.

UNIT IITHREADS, I/O AND UTILITIES (9) Multi threaded Programming– Enumeration- Auto boxing– Annotations- I/O- applets and

other topics– Generics- String Handling-Input/Output: Exploring java.io.

UNIT IIINETWORKING, APPLETS AND EVENT HANDLING (9) Networking: The Applet class- Event Handling. Introducing the AWT: working with

windows- graphics and text- Using AWT controls- Layout Manager - menus.

UNIT IV IMAGING RMI AND DATABASE CONNECTIVITY (9) Imaging: Creating- loading and displaying- Image observer- Double buffering- Media

tracker- Image producer– consumer– filters– animation- Remote Method Invocation- Java Database Connectivity.

UNIT VSOFTWARE DEVELOPMENT USING JAVA

(9)

Javabeans- Introducing and exploring Swings- Servlets. Case Study: Applying Java and Java Enterprise Applications.

LECTURE: 45 PRACTICAL:30 TOTAL: 75

EXPERIMENTS:

1.Implementation of inheritance and interfaces

2.Implementation of multithreading and Exception Handling 3.Applet, AWT programming and Event Handling 4.Program for network connection and monitoring

5.Program for connecting to a database and database manipulation 6.RMI Implementation and Servlet programming 7.Software development using Java

8.Mini Project

Text Books

1 Herbert Schildt, “Java, The Complete Reference “, Tata McGrawHill, Eighth Edition, 2011.

Reference Books

1 Deitel .H.M and Deitel.P.J, “ Java: How to Program “, Pearson Education Asia, Eigth Edition 2010.

2 Lay.S&Horstmann Gary Cornell, “ Core Java Vol I “, The Sun Microsystems & press

Java Series, Seventh Edition, 2005. 3 Lay.S&Horstmann Gary Cornell, “ Core Java Vol II “, The Sun Microsystems &

press Java Series, Eighth Edition, 2008.

12S307 MICROPROCESSORS AND MICROCONTROLLERS LABORATORY


L T P C

0 0 3 2

PREREQUISITES :



with:

Writing simple 8085 assembly language programs.

Writing simple 8086 assembly language programs.

I/O programming using 8255, 8279, 8253 and 8251.

Designing and implementing simple real time applications using microcontroller


CO1:Write simple 8085 assembly language program for 8-bit / 16-bit addition, subtraction,multiplication, division. [Assessment] CO2: Write simple 8085 assembly language program to convert BCD to Binary,

matrixmultiplication and finding factorial of given number. [Assessment] CO3: Write simple 8086 assembly language programs for string manipulation like

search,find and replace, copy one string to another. [Assessment] CO4: Perform I/O programming using 8255, 8279, 8253 and 8251. [Assessment] CO5: Design and implement traffic light controller using 8051 microcontroller.

[Assessment]

LIST OF EXPERIMENTS 1. Programming with 8085 – 8-bit / 16-bit multiplication/division using repeated

addition/subtraction.

2. Programming with 8085-code conversion BCD to Binary and vice versa. 3. Programming with 8085-matrix multiplication, factorial of given number. 4. Programming with 8086 – String manipulation, search, find and replace, copy

operations(PC Required). 5. Interfacing with 8085/8086 – 8255 PPI.

6. Interfacing with 8085/8086 – 8253 Timer. 7. Interfacing with 8085/8086 – 8279 Keyboard display controller. 8. Interfacing with 8085/8086 – 8251 Serial Interface to check the transmission and

reception of character. 9. 8085 based application : Traffic signal controlling.

10. 8051 Microcontroller based experiments – Simple assembly language programs (cross assembler required).

11. 8051 Microcontroller based experiments – Simple control applications (cross

assembler required).

TOTAL: 45

12S308 DATA STRUCTURES AND APPLICATIONS LABORATORY

[Common to CSE & IT] (To be implemented in C++)

L T P C

0 0 3 2

PREREQUISITES : 12S206 - Data Structures and Applications – I


with

Demonstrating the operations of linear data structures.

Implementing sorting and searching techniques.

Demonstrating the operations of nonlinear data structures.

Implementing dynamic memory management.

Utilizing the data structures for real time applications.

COURSE OUTCOMES-Upon completion of this course the students will be able to: CO1: Implement linear data structures like stack, queue, linked list and its operations.

[Assessment] CO2: Write program to sort an array using insertion, selection and quick sort

[Assessment] CO3: Implement non-linear data structures trees and graph and its operations. [Assessment]

CO4: Write program to search for an element in an array using linear and binary search. [Assessment]

CO5: Implement automatic list management and dynamic memory management. [Assessment]

LIST OF EXPERIMENTS 1. String manipulators and pattern matching.

2. Stack and Queue operations. 3. Application of recursion. 4. Linked list: Linear list, circularly linked list, Doubly linked list.

5. Trees: Operations on binary tree and binary search tree. 6. Operations on AVL tree.

7. Conversion: Infix to polish, polish to code. 8. Applications on graph. 9. Implementation of hashing techniques.

10. Implementation of sorting techniques. 11. Implementation of searching techniques.

12. Implementation of external searching techniques. 13. Implementation of Automatic List Management. 14. Implementation of Dynamic Memory Management

TOTAL: 45

12S401 PROBABILITY, RANDOM PROCESSES AND QUEUEING THEORY


L T P C

3 1 0 4

PREREQUISITES :

12S3Z1 Engineering Mathematics III


with:

Basics of probability and random variables.

Standard distributions and the properties of a Random variable.

Two dimensional random processes by learning various distributions and properties

like covariance, correlation, transformation along with Central Limit theorem.

Basic of various random processes and Markov chains including transition

probabilities and limiting distributions.

Types of Markovian models and Non Markovian model in queuing theory.


CO1: Write Axiomatic definition probability and use of joint, conditional and total

probability [Familiarity]

CO2: Write the formula for Baye‟s theorem and use it in applications such as Biometrics, communication theory [Usage]

CO3: Characterize probability models using probability mass functions & probability distribution functions.[Usage]

CO4:Model and analyse the random process and use central limit theorem. [Assessment]

CO5: Model and analyse the random process using markov process, poisson process and markov chain [Usage]

CO6: Analyse and use queuing model such as MM1, MMC [Familiarity]

UNIT I PROBABILITY AND RANDOM VARIABLES (9) Axioms of probability – continuous probability – Total probability – Baye’s theorem -

Random variables- Discrete and continuous random variables- Moments - Moment Generating Functions and their properties.

UNIT II STANDARD DISTRIBUTIONS (9)

Binomial, Poisson, Geometric, Uniform, Exponential, Gamma, Weibull and Normal distributions and their properties - Functions of a Random variable.

UNIT III TWO DIMENSIONAL RANDOM VARIABLES (9)

Joint distributions – Marginal Distributions – Conditional Distributions –Covariance –Correlation and Regression – Transformation of random variables – Central Limit theorem

UNIT IV RANDOM PROCESSES AND MARKOV CHAINS (9) Definition and examples – first order, second order, strictly stationary, wide – sense

stationery and ergodic processes – Markov process – Poisson processes – Birth and Death processes – Markov chains - Transition probabilities – Limiting distributions.

UNIT V QUEUEING THEORY

(9)

Markovian models – M/M/1 and M/M/c, finite and infinite capacity, M/M/∞ queues – Finite source model – M/G/1 queue (steady state solutions only) – Pollaczek – Khintchine formula – special cases.


Text Books

1 T. Veerarajan,“Probability Statistics and Random Process”,Tata McGraw Hill Publishing Company Ltd., New Delhi – 2007.(Covering units I – IV)

Reference Books

1 S. P. Gupta, “Statistical Methods”, Sultan Chand & Sons, New Delhi – 2007. 2 K.S.Trivedi, “Probabilityand Statistics with Reliability , Queuing and Computer

Science Applications “,Prentice Hall of India Ltd.,New Delhi.(Covering Unit V ).

3 P.Kandasamy,K.Thilagavathy and K.Gunavathy,”Probability and Random Process ”, S.Chand& Sons,NewDelhi-2003.

4 S.C. Gupta and V. K. Kapoor, “Fundamentals of Mathematical Statistics”, Sultan Chand & Sons, New Delhi, Latest Edition 2009.

5 G.Haribaskaran, “Probability, Queueing theory and Reliability Engineering”,

Lakshmi Publishers (P) Ltd(University science Press), New Delhi, 2006.

12S402 ENVIRONMENTAL SCIENCE AND ENGINEERING


L T P C

3 0 0 3


with:

Earth structure, properties of water, soil erosion, deforestation, renewable energy resources.

Ecosystems like forest, desert, and pond and also about biodiversity.

Different environmental pollutions and their control measures.

Environmental threats like acid rain, green house effect, global warming and the natural disasters.

Sustainable technologies, acts imposed for the protection of wild life, air and forest, and also about role of IT in protection of human and health

COURSE OUTCOMES-Upon Completion of this course the students will be able to

CO1: Describe a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and

safety,manufacturability, and sustainability. [Familiarity] CO2: Critically analyze technical subject matter (written or oral) for scientific merit.[Assessment]

CO3: Apply learned environmental knowledge and understanding to solve technical/research problems in new contexts.[Familiarity]

CO4: Interact with others in a manner that fosters a constructive and collaborative working environmental for all.[Usage] CO5: Evaluate technical subject matter (e.g., manuscripts, proposals) for technical

significance potential impact, and priority relative to comparable material.[Assessment]

UNIT I ENVIRONMENTAL RESOURCES (9) Earth structure, Internal and external earth processes, plate tectonics, erosion, weathering,

deforestation, anomalous properties of water, hydrological cycle, effect of modern agriculture, fertilizers, pesticides, eutrophication, biomagnifications, land degradation, minerals, rocks, rock cycle, mining, types of mining, desertification, soil erosion, methods of

conservation of soil erosion, renewable energy resources, wind, solar, geothermal, tidal, OTEC.

UNIT II ECO SYSTEM AND BIODIVERSITY (9)

Weather and climate, ocean current, upwelling, EL Nino, Ecology, ecosystem, biomes, physical and chemical components of ecosystem, biological components of ecosystem, forest

ecosystem, desert ecosystem and pond ecosystem, Energy flow in ecosystem, nitrogen cycle, carbon dioxide cycle, phosphorous cycle, food pyramid, Ecological succession, types, biodiversity, need for biodiversity, values of biodiversity, hot spots of biodivers ity,

endangered and endemic species, conservation of biodiversity insitu-exitu conservation.

UNIT III ENVIRONMENTAL POLLUTION (9)

Air pollution, classification of air pollutants gaseous particulars, sources effects and control of gaseous pollutants SO2, NO2, H2S, CO, CO2 and particulates, control methods, cyclone

separator, electrostatic precipitator, catalytic combustion-water pollution-classification of water pollutants, inorganic pollutants, sources, effects and control of heavy metals, organic pollutants, oxygen demanding wastes, aerobic and anaerobic decomposition, soil pollution,

Noise pollution, sources, effects, decibel scale.

UNIT IVENVIRONMENTAL THREATS (9) Acid rain, green house effect, global warming, disaster management, flood, drought,

earthquake, tsunami, threats to biodiversity, destruction of habitat, habit fragmentation- hunting, over exploitation – man- wildlife conflicts, The IUCN red list categories, status of

threatened species.

UNIT VSOCIAL ISSUES AND ENVIRONMENT (9) Sustainable development- sustainable technologies, need for energy and water conservation,

rain water harvesting, water shed management, waste land reclamation, Air act, Wild life protection act, forest conservation act, population growth, exponential and logistic growth, variation in population among nations, population policy, women and child welfare

programs, Role of information technology in human and health, HIV/AIDS, effects and preventive measures.


Text Books

1 Sharma J.P., „Environmental Studies’, 3rdEdn, University Science Press, New Delhi (2009)

2 AnubhaKaushik and C.P.Kaushik, „Environmental Science and Engineering‟, 3rdEdn New age International Publishers, New Delhi (2008)

Reference Books

1 R.K.Trivedi, „Hand book of Environmental laws, Rules, Guidelines, Compliances and

Standards’, Vol.I&II, Environ Media.(2006). 2 G.TylerMiller,JR, „Environmental Science’, Tenth Edition, Thomson BROOKS/COLE

(2004)

3 Gilbert M.Masters, „Introduction to Environmental Engineering and Science’, 2nd Edition Pearson Education ( 2004).

12S403 DATA BASE SYSTEMS


L T P C

3 0 0 3


with:

Conceptual data and relational model.

Principles and efficient use of storage space using normalization techniques.

Constructing simple and moderately advanced database queries using query language.

Concept of database and related database facilities including concurrency control, backup and recovery, data object locking protocols.

Basics of current trends such as: Data warehousing, XML in relational databases for classification and prediction.


CO1: Build a database management system that satisfies relational theory and provides users with business queries, business forms, and business reports. [Usage]

CO2:Describe components of a database management system and how they work together. [Familiarity] CO3: Systematically design appropriate database structure using normalization and data

modeling. [Assessment] CO4: Program using the database query language SQL. [Usage]

CO5:Illustrate data storage, query processing and optimization techniques such as B Tree, B+ Tree structure.[Assessment]

CO6: Explain the concepts of transaction management. [Familiarity]

CO7:Create conceptual and logical database designs for a business information problem using data mining concepts. [Assessment]

UNIT I INTRODUCTION AND CONCEPTUAL MODELING (9)

Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and Hierarchical Models – ER model – Relational Model –

Relational Algebra and Calculus.

UNIT II RELATIONALMODEL (9) SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational

Database design – Functional dependences and Normalization for Relational Databases (up to BCNF).

UNIT III DATA STORAGE AND QUERY PROCESSING (9) Record storage and Primary file organization- Secondary storage Devices- Operations on

Files – Heap File- Sorted Files-Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree -B+Tree – Query Processing.

UNIT IV TRANSACTION MANAGEMENT (9)

Transaction Processing – Introduction- Need for Concurrency control - Desirable properties of Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency

Control – Types of Locks- Two Phases locking- Deadlock-Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.

UNIT VCURRENT TRENDS (9) Object oriented databases-design of object oriented databases-data warehousing-data ware housing-data mining association rules-application of data mining -classification and

prediction -XML-case studies.


Text Books

1 Abraham Silberschatz, Henry F. Korth and S. Sudarshan -―Database System

Concepts‖, Sixth Edition, McGraw-Hill, 2011.(covering units I,II,III,IV,V)

Reference Books

1 RamezElmasri and Shamkant B. Navathe,―Fundamental Database Systems”, Sixth Edition, Pearson Education, 2011.

2 Raghu Ramakrishnan,JohannesGehrke“Database Management System‖, Tata McGraw-Hill Publishing Company, 3rd edition,2003.

3 Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- ―Database System

Implementation”- Pearson Education- 2000.(Covering units III,IV,V) 4 Peter Rob and Corlos Coronel- ―Database System, Design, Implementation and

Management”, Thompson Learning Course Technology- Fifth edition, 2003. (covering units I,II,III,IV,V)

12S404 COMPUTER ARCHITECTURE


L T P C

3 0 0 3

PREREQUISITES :

12S303 – Micro Processors, Micro Controllers and Applications.


with:

Memory addressing modes used by the instructions and to expose the major differentials of RISC and CISC architectural characteristics with performance

evaluation of CPU.

Basics of number representation of signed integers and to perform operations like

addition and subtraction of signed integers represented.

Organization of a computer system including the CPU data path, CPU control, and memory systems and the way to handle exceptions.

Concept of pipelining and the various hazards that arise in a pipeline and the typical solutions to the hazards.

I/O system and its design and know about Busses and bandwidth requirements to support heterogeneous I/O devices.

COURSE OUTCOMES-Upon Completion of the course the students will be able to

CO1: Explain the fundamentals of MIPS instruction set architectures with performance evaluation of CPU.[Assessment]

CO2: Explain the principles and implementation of computer arithmetic. [Familiarity] CO3: Design and emulate a single cycle data path and multicycle data path. [Usage]

CO4:Explain the operation of modern CPUs including pipelining and hazards. [Familiarity] CO5: Explain the principles of operation of memory systems and buses. [Familiarity]

UNIT IINTRODUCTION (9) Introduction – classes of computing- high - level language to language of hardware –safe place for data –chip manufacturing process – operation of computer hardware – operands of

the computer hardware –instructions – Special-purpose instructions - Addressing modes - RISC vs CISC - Supporting procedures in computer hardware –performance -CPU

performance and its factors – evaluating performance.

UNIT IIDATA REPRESENTATION (9) Signed number representation, fixed and floating point representations, character

representation. Computer arithmetic - integer addition and subtraction, ripple carry adder, carry look- ahead adder, etc. multiplication - shift-and-add, Booth multiplier, carry save multiplier, etc. Division - non-restoring and restoring techniques, floating point arithmetic.

UNIT IIIDESIGN OF CENTRAL PROCESSING UNIT (CPU) (9) Single -Cycle Datapath and Control - Multi-cycle Datapath and Control-Micro-programming

and Hard-wired Control Units- Behavioral HDL Description of Systems- Exceptions Handling

UNIT IVPIPELINING (9) Introduction to Pipelining; Pipelined MIPS Datapath- Pipeline Hazards: Structural, Control,

Data-Hazard Detection and Resolution- Pipelining control- Exceptions Handling

UNIT VMEMORY SYSTEMS AND I/O INTERFACING (9) Overview of SRAM and DRAM Design- Memory Hierarchy -Cache memory design - Virtual memory- Performance issues -I/O device characteristics - Buses and bus arbitration -

Processor/OS interface –DMA


1 David. A. Patterson and John L. Hennessy, “Computer Organization and Design: The

Hardware/SoftwareInterface”, Fifth Edition, Morgan-Kaufmann Publishers Inc. 2014(Covering units I,II,III,IV,V)

Reference Books

1 Carl Hamachar, ZvoncoVranesic and SafwatZaky, “Computer Organization”,

McGraw Hil,5th edition,2002. 2 John P.Hayes, “ Computer Architecture and Organization “ Mc-Graw Hill

International, Third Edition, 1998.

3 William Stallings,”Computer Organization and Architecture: Designing for Performance‖, Pearson Education,7th Edition,2006.(Covering units I,III,V)

4 Morris Mano. M,”Computer system Architecture”,PHI publication, 3rd edition,2008.(Covering units I,II,V)

12S405 SYSTEMS PROGRAMMING AND OPERATING SYSTEMS


L T P C

3 1 0 4

PREREQUISITES :

12S303-Micro Processors, Micro Controllers and Applications


with:

Passes of an assembler and how a linker/loader creates an executable program from an object module and to write such a linker/loader for a simple two-pass assembler

with the working principle of macro processor.

Solving problems involving process control, mutual exclusion, deadlock and

synchronization.

Different schemes for managing main memory, including swapping, paging, and segmentation.

Working of File management systems including file access methods, directory structures, file allocation methods, free space management and disk scheduling.

Operating systems such as Linux System, Memory management, File systems.


CO1: Describe the operation of single pass and two pass assemblers. [Familiarity]

CO2: Implement a simple Macro pre-processors [Usage]

CO3:Use software tools for developing simple editors and programming environments

[Usage]

CO4: Use Scheduling algorithms and process management [Usage]

CO5:Solve problems involving process control, mutual exclusion, deadlock and Synchronization. [Usage]

CO6: Identify and implement device and I/O management functions in operating

systems. [Assessment]

CO7: Evaluate and incorporate security issues in operating systems.[Assessment]

CO8:Analyse the design of operating systems such as linux and windows7.[Familiarize]

UNIT I SYSTEM PROGRAMMING (9) Assemblers: Elements of Assembly Language Programming, A simple Assembly scheme,

Pass structure of assemblers, design of a two pass assemblers, A single pass assembler for IBM PC, Macros and Macro processors: Macro definition and call, Macro Expansion, Nested macro calls, Advanced macro facilities, Design of a macro preprocessor, Linkers: relocation

and linking concepts, Design of a linker, self-relocating programs, Linker for MS DOS, Linking for overlays, Loaders, software Tools: software tools for program development,

editors, debug monitors, programming environments.

UNIT II OPERATING SYSTEMS PROCESS MANAGEMENT (9) Introduction to operating systems - Process management: Process concepts, Scheduling

criteria – Scheduling algorithms– Thread scheduling – Multiple-processor scheduling – Operating system examples – Algorithm Evaluation – The critical-section problem –

Peterson’s solution –Synchronization hardware – Semaphores – Classic problems of synchronization– Critical regions – Monitors – Synchronization examples – Deadlocks –

System model – Deadlock characterization – Methods for handling deadlocks – Deadlock Prevention – Deadlock Avoidance – Deadlock detection – Recovery from deadlock.

UNIT III STORAGE MANAGEMENT (9)

Memory Management – Swapping – Contiguous memory allocation – Paging – Segmentation – Example: The Intel Pentium - Virtual Memory: Background – Demand paging – Copy on write – Page replacement – Allocation of frames– Thrashing.

UNIT IV I/O SYSTEMS (9) File concept – Access methods – Directory structure – File-system mounting –Protection – Directory implementation – Allocation methods – Free-space management – Disk scheduling

– Disk management – Swap-space management– Protection.

UNIT V CASE STUDIES (9) The Linux System – History – Design Principles – Kernel Modules – Process Management –

Scheduling – Memory management – File systems – Input and Output – Inter-process Communication – Network Structure – Security – Windows 7 – History – Design Principles –

System Components – Terminal Services and Fast User – File system – Networking.


Text Books

1 Dhamdhere.D.M, “System Programming & Operating Systems “, Second edition, Tata

Mc-Graw Hill, 2008.(Covering units I,II,III,IV,V) 2 Abraham Silberschatz, Peter B. Galvin, Greg Gagne, “Operating System Concepts

Essentials”, John Wiley & Sons Inc., 2nd edition,2013.

Reference Books

1 Andrew S. Tanenbaum, “Modern Operating Systems”, Fourth edition, Pearson Education, 2014.

2 Deitel.H.M,―Operating Systems “, Third edition, Pearson Education Asia,

2004.(Covering Units I,II,III,IV,V) 3 Leland L.Beck“System Software – An Introduction to Systems Programming”,

Pearson education, Third edition 2011.(CoveringunitsI,II)

12S406 THEORY OF COMPUTATION


L T P C

3 1 0 4

PREREQUISITES :

12S302-Discrete Mathematics


with:

Regular and non regular languages, regular expressions and finite automata(DFA,NFA), Using Pumping Lemma for Regular Languages and

Decision Problems.

Proving the equivalence of language described by pushdown automata and

context free grammar.

Turing machines (deterministic and nondeterministic), recursively enumerable languages and Chomsky hierarchy.

Unsolvable problems-halting problem and computable functions.

Complexity analysis of Turing machines, complexity classes- P and NP complete

problems.

COURSE OUTCOMES-Upon Completion of the course the students will be able to

CO 1: Write regular expression for the given problem. [Usage]

CO 2: Construct the deterministic and non-deterministic finite automata for the given

regular grammar. [Usage]

CO 3: Apply pumping lemma for regular and context free languages. [Usage]

CO 4: Identify and eliminate ambiguity in the given context free grammar. [Usage]

CO 5: Convert arbitrary CFG into CNF. [Usage]

CO 6: Construct push down automata for the given context free grammar. [Usage]

CO 7: Construct Turing machines to accept the recursive languages and for solving

computable functions [Usage]

CO 8: Use single tape multi tape multi track composite and universal TM. [Usage]

CO 9: Built linear bounded automata for context sensitive languages. [Usage]

CO 10: Identify solvable and unsolvable problems. [Usage]

CO 11: Explore approaches to computability such as partial recursive and µ

recursive functions for simple numeric functions. [Usage]

CO 12: Identify the given problem is NP-Hard and NP-Complete [Usage]

UNIT I REGULAR EXPRESSION AND FINITE AUTOMATA (9) Regular Languages and Regular Expressions - Memory Required to Recognize a Language -

Finite Automata - Distinguishing One String from Another - Unions, Intersections, and Complements.

NONDETERMINISM AND KLEENE’S THEOREM, REGULAR AND

NONREGULAR LANGUAGES

Nondeterministic Finite Automata - Nondeterministic Finite Automata with Λ-transitions -Kleene’s Theorem. Criterion for Regularity- Minimal Finite Automata-Pumping Lemma for Regular Languages-Decision Problems- Regular Languages and Computers

UNIT II CONTEXT FREE GRAMMARS, CONTEXT FREE AND NON

CONTEXT FREE LANGUAGES (9)

Examples and Definitions - Regular Grammars - Derivations and Ambiguity - Unambiguous

CFG for Algebraic Expression - Simplified Forms and Normal Forms. Pumping Lemma and

Context Free Languages-Intersections and Complements of Context Free Languages-

Decisions Problems.

PUSHDOWN AUTOMATA

Introduction- Definition- Deterministic Pushdown Automata – PDA corresponding to a Given CFG-CFG Corresponding to a Given PDA- parsing.

UNIT III TURING MACHINES (9) Definitions and Examples- Computing Partial Functions with Turing Machines – Combining

Turing Machines-Variations of Turing Machines with Multitape TMs-Nondeterministic

Turing Machines-Universal Turing Machines-Models of Computations and the Church

Turing Thesis.

RECURSIVELY ENUMERABLE LANGUAGES Recursively Enumerable and Recursive-Enumerating a Language –More General Grammars- Context –Sensitive Languages and the Chomsky hierarchy- Not all Languages and

Recursively Enumerable.

UNIT IV UNSOLVABLE PROBLEM (9) Non recursive Language and an Unsolvable Problems-Reducing One Problem to Another:

The Halting Problem-Other Unsolvable Problems Involving TMs-Rice’s Theorem and More

Unsolvable Problems-Post’s Correspondence Problems-Unsolvable problems Involving

Context-Free Languages.

COMPUTABLE FUNCTIONS Primitive Recursive Functions-Primitive Recursive Predicates and Some Bounded

Operations-unbounded Minimalizations and μ -Recursive Functions-Global Numbering-All Computable Functions Are μ -Recursive- nonnumeric Functions, and Other Approaches to

Computability.

UNIT V MEASURING AND CLASSIFYING COMPLEXITY,TRACTABLE

AND INTRACTABLEPROBLEMS (9)

Growth rates of Functions-Time and Space Complexity of a Turing Machines -Complexity Classes. Tractable and Possibly Intractable Problems: P and NP-Polynomial Time Reductions

and NP Completeness-Cook’s Theorem-Other NP Complete Problems.


Text Books

1 John C. Martin, “Introduction to Languages and the Theory of Computation”, Fourth

Edition, Tata McGraw-Hill Publishing Company Limited, New Delhi, 2011.(covering units I,II,III,IV,V)

Reference Books

1 John E. Hopcroft, Rajeev Motwani, Jeffey D. Ullman, “Introduction to Automata Theory Languages,andComputations”,Third edition, Pearson Education Asia, 2008.

2 Mishra K L B and Chandrasekaran N, “Theory of Computer Science, Automata Languages andComputation”, Third edition,Prentice – Hall of India Pvt. Ltd., 2007

12S407 DATABASE SYSTEMS LABORATORY

[Common to CSE and IT]

L T P C

0 0 3 2


with:

Usage of DDL, DML and TCL commands.

Querying the database using relational algebra operations.

Concepts of triggers, functions and stored procedures in PL/SQL.

Querying the database with the help of front end tools.

COURSE OUTCOMES-Upon completion of this course the students will be able to

CO1: Design and implement a database schema for a given problem-domain.[ Usage]

CO2: Populate and query a database using SQL DML/DDL commands. [Usage] CO3: Declare and enforce integrity constraints on a database using a state-of-the-

artRDBMS. [Usage] CO4:Programming PL/SQL including stored procedures, stored

functions,cursors,packages.[Assessment] CO5: Design and build a GUI application using a 4GL. [Usage]

LIST OF EXPERIMENTS 1. Practice on DDL, DML, DCL and TCL commands.

2. Practice on Built in functions and Relational Algebra operations in SQL. 3. Practice on Updatable and Non-Updatable views. 4. Practice on Stored Procedures, Functions in PL/SQL

5. Practice on Cursors, Packages and Triggers in PL/SQL. 6. Form / Menu design using Front end tools and Report Generation with Database

Connectivity. 7. Mini Project: Developing applications such as Payroll processing system, Banking

system, Inventory control system, Reservation system, College/Library/Hospital

Management system with concurrency control and recovery mechanisms.

TOTAL: 45

12S408 SYSTEMS PROGRAMMING AND OPERATING SYSTEMS LABORATORY

[Common to CSE and IT]

L T P C

0 0 3 2


with:

Designing Assembler and macro processors

Simulating linkers and loaders.

Concepts of process, mutual exclusion, paging and segmentation.

Implementing deadlock prevention and avoidance algorithms.

Implementing file structure and scheduling concepts.


CO1: Design single and two pass assemblers. [Usage]

CO2: Implement the static and dynamic linker [Usage]

CO3: Design simple loader and MASM macro pre-processor. [Usage]

CO4: Identify and use suitable process scheduling algorithm [Usage]

CO5: Solve producer-consumer and reader-write problem using semaphore. [Usage]

CO6: Handle deadlocks.[Usage]

CO7: Design Virtual memory system [Usage]

CO8: Design file system for the given application [Usage]

LIST OF EXPERIMENTS (To be implemented in C language)

SYSTEM PROGRAMMING

1. Design of single pass assembler

2. Design of two pass assembler 3. Simulation of static and dynamic linker

4. Implementation of relocation loader 5. Design of MASM macro processor

OPERATING SYSTEMS

1. Implementation of process scheduling 2. Illustrated of inter process communication strategies 3. Implementation of mutual exclusion by semaphores

4. Deadlock prevention & avoidance algorithms 5. Virtual memory: paging and segmentation

6. Implementation of page replacement algorithms 7. Implementation of disk scheduling algorithms 8. Implementation of file structures

TOTAL: 45

12S501 OBJECT ORIENTED ANALYSIS AND DESIGN


L T P C

3 0 0 3

PREREQUISITES:

12S204 Object Oriented Programming using C++


with:

Object oriented design and methodologies.

Object oriented modelling including UML to represent Object oriented systems.

Appling the process of object-oriented analysis and design to software

development.

Implementation modelling and Testing strategies

Relationship between software engineering and object oriented system design


CO1: Describe the fundamentals of object oriented design and methodologies developed

by Rumbaugh, Booch and Jacobson. [Familiarity] CO2: Model the object oriented system using UML.[Usage]

CO3:Define different types of modelling and its benefits. [Familiarity] CO4: Evaluate the quality of object oriented design models. [Assessment] CO5: Implement and test object oriented models for simple projects.[Usage]

CO6: Apply software engineering principles in object oriented system design. [Usage]

UNIT I OBJECT ORIENTED DESIGN FUNDAMENTALS (9) Review of Object Oriented system – Design objects – class hierarchy – Polymorphism – Object

relationship –Association –Object persistence – metaclass – Object Oriented Systems development life cycle –Object oriented methodologies– Rumbaugh–Booch–Jacobson.

UNIT II UNIFIED MODELING LANGUAGE (9)

The Unified Approach– Object oriented Analysis–Design –Iterative Development–Continuous Testing–Proposed Repository–Layered Approach – Unified Modeling Language–Static –

Dynamic Models–UML Diagrams –UML Class Diagrams–Dynamic Modeling– packages–UML Extensibility –Meta Model.

UNIT III ANALYSIS AND DESIGN (9)

System Conception – Elaborating – Domain Analysis–Class Model–State Model–Interaction Model–Application Analysis– Interaction Model–Class Model–State Model–System Design–Performance–Concurrency–Subsystems–Data Storage– Boundary conditions–Architectural

styles– Class Design– Realizing Use cases– Recursing Downward– Refactoring– Design Optimization.

UNIT IV IMPLEMENTATION MODELING (9) Fine tuning classes–Fine tuning Generalizations–Realizing Associations–Testing–OO

languages–Implementing Structure– Implementing Functionality–Programming Style–Object Oriented Style–Reusability–Extensibility–Robustness.

UNIT V SOFTWARE ENGINEERING (9) Iterative Development– Iteration Scope– Performing an Iteration– Identifying Risks–Managing

Model–models –Modeling sessions–Learning –Teaching –Techniques–Legacy Systems–Reverse Engineering–Building Class Model–Interaction Model–State Model–Wrapping –Maintenance


Text Books

1 Ali Bahrami ,―Object Oriented System Development‖, McGraw Hill International Edition 2008.

2 Michael Blaha, James Rumbaugh, “Object-oriented modeling and design with UML”, 2nd edition, Pearson Education, 2005.

Reference Books

1 Booch, Grady, ―Object Oriented Analysis and Design‖,3rd edition, Pearson Education.

2 O‟cherty, Mike, ―Object-Oriented Analysis &Design‖,Wiley. 2005. 3 Mahesh P.Matha, ―Object Oriented Analysis and Design Using UML‖, PHI, 2010.

12S502 UNIX INTERNALS

L T P C

3 0 0 3

PREREQUISITES :

12S405- System Programming and Operating Systems

COURSE OBJECTIVES-: Upon completion of this course the students will be familiar

with:

Unix system architecture and kernel

Concepts of buffer cache and system calls

About the structure of the process and its control.

Concepts of Process scheduling, Inter Process communication and Memory management


CO1: Explain the architecture of Unix operating system and services [Familiarity]

CO2: Analyze the buffers and kernel representation [Familiarity]

CO3: Describe the structure of Unix file system. [Familiarity] CO4: Demonstrate the functions and usage of system calls. [Familiarity] CO5: Recognize the structure of the process and implement it. [Usage]

CO6: Summarize the principles of process scheduling and memory management. [Familiarity]

CO7:Develop programs that use pipes, message queues, semaphores and Inter Process Communications. [Usage]

UNIT I GENERAL OVERVIEW OF THE SYSTEM (9)

History – System structure – User perspective – Operating system services – Assumptions about hardware. Introduction to the Kernel : Architecture of the UNIX operating system – Introduction to system concepts – Kernel data structures – System administration.

UNIT II BUFFER CACHE AND FILES (9) Buffer headers – Structure of the buffer pool – Advantages and disadvantages of the buffer cache. Internal representation of files :Inodes – Structure of a regular file – Directories –

Conversion of a path name to an Inode – Super block – Other file types.

UNIT III SYSTEM CALLS FOR FILE SYSTEM (9) Open – Read – Write – File and record locking – Adjusting the position of file I/O –LSEEK –

Close – File creation – Creation of special files – Pipes – Dup – Mounting and unmounting file systems, Link - Unlink- File System Abstraction - Maintenance.

UNIT IV THE STRUCTURE OF PROCESSES AND ITS CONTROL (9) The System Representation of Processes – States and Transitions - System Memory -Context

of a Process - Saving the Context - Manipulation of a Process Address Space – Sleep State. Process Control – signals - Process Termination – Awaiting - Invoking other Programs –User

ID and Changing Size of the Process. The Shell - System Boot and the INIT Process.

UNIT V PROCESS SCHEDULING AND MEMORY MANAGEMENT (9)

Process Scheduling and time – Memory Management Policies : Swapping – A hybrid system with swapping and demand paging. The I/O Subsystem : Driver Interfaces– Disk Drivers-Terminal Drivers, Inter Process Communications.


Text Books

1 Maurice J. Bach, “The Design of the Unix Operating System”, Prentice Hall of India, 2010.

Reference Books

1 RanjaVahalia, “Unix Internals: The New Frontiers”, Pearson Education Inc, 2008

2 John Lion, “Lion’s Commentary on UNIX”, 6th edition, Peer-to-Peer Communications, 2004.

3 Daniel P. Bovet & Marco Cesati, “Understanding the Linux Kernel”, O‟REILLY, Shroff Publishers & Distributors Pvt. Ltd, 2003.

4 M. Beck et al, “Linux Kernel Programming”, Pearson Education Asia, 2002

12S503 WEBTECHNOLOGY


L T P C

3 0 0 3

PREREQUISITES :

12S306-Programming in Java

COURSE OBJECTIVES:Upon completion of this course the students will be familiar

with:

Concepts of Web, Internet and the basic protocols.

Building web pages using HTML, CGI and PERL

Basic understanding of Java Script and VB Script programming

Concepts of session management and web database connectivity


CO1: Articulate the organization of web and internet. [Familiarity]

CO2: Generate dynamic web page content using CGI and PERL. [Usage]

CO3: Implement client side scripts using java and VB scripts. [Usage]

CO4: Implement server side script using JSP and servlets. [Usage]

CO5: Build applications for Session management and web database connectivity. [Usage]

CO6: Design simple online web applications incorporating features like e-payment, e-security [Usage]

CO7: Develop e-Customer Management System [Usage]

UNIT I INTRODUCTION (9) Introduction to Internet – Principles- Basic Web Concepts – World Wide Web- Web Servers

–Web Browsers – URL-MIME – HTTP –SGML- Internet Protocols and Standards.

UNIT II COMMON GATEWAY INTERFACE PROGRAMMING (9) HTML Forms – CGI Concepts – HTML Tags Emulation – Server – Browser Communication

– E-Mail Generation– CGI Client Side Applets – CGI Server Applets – Authorization And Security. Introduction To PERL.

UNIT III SCRIPTING LANGUAGES (9)

Java Script Programming-Dynamic HTML-Cascading Style Sheets-Object Model And Event Model- Filters And Transitions-Active X Controls-Multimedia-Client Side Script.- VB Script Programming -Forms - Scripting Object.

UNIT IV SERVER SIDE SCRIPTING (9) Server Side - Scripting - Servlets- Java Server Pages - Session Management -Cookies -

Database Access Through Web -SQL - Architecture for Database System.

UNIT V ON-LINE APPLICATIONS (9) E-Commerce –Business Models For E-Commerce-Enabling Technologies of the World Wide

Web- E-Marketing-E-Security-E-Payment Systems-E-Customer Relationship Management.


1 Deital and Deital, Goldberg, ―Internet & World Wide Web, How To Program‖,

Third edition, Pearson Education, 2004. 2 P.T.Joseph, S.J, ―E-Commerce, An Indian perspective, 4th edition, PHI learning

Private Limited, 2012.

Reference Books

1 Deitel and Deitel, ―Java – How to program‖, 9th ed.,PHI,2012. 2 Jeffy Dwight, Michael Erwin and Robert Niles, ―Using CGI‖, Prentice Hall of India

QUE, 1999.

3 Robert W. Sebesta,‖Programming the World Wide Web‖,7th edition, Pearson education, 2012.

4 Chris Bates, ―Web Programming‖, 3rd ed., Wiley, 2006. 5 W Clay Richardson, et al, ―Professional Java JDK 6 Edition‖,Wrox, 2007.

12S504 COMPUTER GRAPHICS AND MULTIMEDIA SYSTEMS


L T P C

3 1 0 4

PREREQUISITES :

12S106- Programming in C

12S304-Analog and Digital Communication


with:

Fundamental principles of line and curve drawing algorithms and 2D

transformations.

Exploring 3D representations with respect to transformations and modeling, animate

- image, audio and videos.

Components of Multimedia systems, architecture and interface standards.

Significance of Multimedia data compression and decompression.

IO devices of Multimedia systems and the storage and retrieval technologies.


CO1: Explain the fundamental principles of line and curve drawing algorithms and2D transformations. [Familiarity]

CO2:Describe the 3D object representation and apply 3D modeling and transformations [Usage]

CO3: Demonstrate Computer Graphics Animation [Usage]

CO4: Describe the Multimedia system architecture [Familiarity]

CO5:Apply still and video image compression techniques in designing multimedia

systems. [Usage]

CO6: Discuss the effectiveness of video and image display systems.[Familiarity]

CO7:Describe the basic ideas about the storage and retrieval technologies.

[Familiarity]

CO8: Design Simple multimedia applications. [Usage]

CO9: Design distributed Multimedia applications. [Usage]

UNIT I OUTPUT PRIMITIVES (9) Introduction - Line - Curve And Ellipse Drawing Algorithms – Attributes – Two-

Dimensional Geometric Transformations– Two-Dimensional Clipping And Viewing.

UNIT II THREE-DIMENSIONAL CONCEPTS (9) Three-Dimensional Object Representations – Three-Dimensional Geometric and Modeling

Transformations – Three-Dimensional Viewing – Color Models – Animation.

UNIT III MULTIMEDIA SYSTEMS DESIGN (9) An Introduction – Multimedia Elements – Multimedia Applications – Multimedia Systems

Architecture – Evolving Technologies for Multimedia – Defining Objects for Multimedia Systems – Multimedia Data Interface Standards – Need For Data Compression - Multimedia

Databases. Compression and Decompression: Types of Compression – Binary Image Compression Schemes – Color, Gray Scale and Still – Video Image Compression - Audio Compression – Fractal Compression.

UNIT IV MULTIMEDIA INPUT/OUTPUT TECHNOLOGIES (9) Key Technology Issues – Pen Input – Video and Image Display Systems – Print Output

Technologies – Image Scanners - Digital Voice and Audio – Digital Camera - Video Images

And Animation – Full-Motion Video. Storage and Retrieval Technologies: Magnetic Media

Technology – Optical Media – Hierarchical Storage Management – Cache Management for

Storage Systems.

UNIT V MULTIMEDIA APPLICATION DESIGN (9)

Multimedia Application Classes – Types Of Multimedia Systems – Virtual Reality Design –

Components Of Multimedia Systems – Organizing Multimedia Databases – Application

Workflow Design Issues – Distributed Application Design Issues.


Text Books

1 Donald Hearn and M.Pauline Baker, “Computer Graphics C Version‖, Pearson

Education, 2003. [Unit I : Chapters 1 to 6; Unit II: Chapter 9 – 12, 15, 16) 2 Prabhat K Andleigh and KiranThakrar,” Multimedia Systems and Design‖, PHI,

2003. ISBN: 81-203-2177-4. [Unit III, IV & V].

Reference Books

1 Pakhira, “Computer Graphics, Multimedia and Animation”,2 ndEdition,PHI 2010 2 Tay Vaughan,” Multimedia Making it work, Eighth Edition”, Tata McGraw-Hill.

ISBN: 0- 07-463953-6.

3 Ze-Nain Li, Mark S.Drew, “ Fundamentals of Multimedia”, PHI. ISBN :81-203-28175, 2004.

4 John F. Koegel Buford, ― Multimedia Systems”, Third Edition, 2000. ISBN: 8177588273.

5 Judith Jeffcoate, “Multimedia in practice technology and Applications”, PHI, 1998.

6 Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”, Pearson Education, Third edition.

12S505 DESIGN AND ANALYSIS OF ALGORITHMS


L T P C

3 1 0 4

PREREQUISITES :

12S305-Data structures and Applications -II


with:

Principles of algorithm design

Importance of computational complexity of the algorithm

Concepts of approximation and randomized algorithms.

Dynamic programming, divide and conquer, branch and bound and backtracking techniques.

Notions of P, NP, NPC, and NP-hard.


CO1: Discuss the significance of algorithms in problem solving process. [Usage]

CO2: Analyze asymptotic runtime complexity of algorithms [Assessment] CO3: Describe and apply dynamic programming and divide and conquer algorithms.

[Assessment] CO4: Explain approximation and Randomized algorithms [Usage] CO5: Explain and apply Branch and Bound and Backtracking to deal with hard

problems[Usage] CO6: Describe the classes of P, NP and NP Complete problems and able to prove that

certainproblem is NP Complete problem. [Assessment ]

UNIT I INTRODUCTION (9) Asymptotic complexity Some stylistic issues Analysis of Algorithms - Principles of

Algorithm Design - Finding Maximum and Minimum - Amortized analysis- Graph Algorithms- Shortest path -Flow networks

UNIT II ALGORITHMS (9)

Numerical algorithms – integer - matrix and polynomial multiplication – FFT - extended Euclid’s algorithm - modular exponentiation - primality testing - cryptographic computations- Internet algorithms-text pattern matching - tries, information retrieval - data compression -

Web caching- Geometric algorithms -range searching - convex hulls- segment intersections-closest pairs.

UNIT III DIVIDE AND CONQUER AND DYNAMIC PROGRAMMING (9) Introduction - Sorting - Median Finding - Combinatorial Search – Knapsack - Longest

common subsequence - Matrix chain multiplication or Optimal search trees - A machine scheduling problem

UNIT IV ALGORITHM DESIGN (9)

Introduction - Applications- job sequencing with deadlines - Minimum cost spanning trees- Single source shortest path problem -Set of Intervals - Fractional Knapsack - Huffman

Coding - Branch-and-bound – Backtracking - Approximation algorithms-Randomized algorithms

UNIT V NP-COMPLETENESS (9)

Matching - Introduction to NP- Complete - Search/Decision – SAT – Independent Set - Exact Cover - Multi Set - Subset Sum & Partition - Hamiltonian Circuit


1 Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein,

“Introduction to Algorithms”, Third Edition, MIT Press/McGraw-Hill, 2009. 2 Michael T Goodrich and Roberto Tamassia, “Algorithm Design: Foundations,

Analysis, and Internet “, Second Edition, Wiley, 2006.

Reference Books

1 UdiManber, “Introduction toAlgorithms — A Creative Approach‖, Addison-Wesley, Reading, MA, 1989.

2 Mark de Berg, Mark van Kreveld, Mark Overmars and OtfriedShwarzkopf (Cheong), “ComputationalGeometry: Algorithms and Applications”, Third edition, Springer-Verlag, 2008.

3 Jon Kleinberg and ÉvaTardos, “Algorithm Design”, Pearson, 2005. 4 Sara Baase, Allen Van Gelder, ―Computer Algorithms: Introduction to design and

analysis‖, Pearson Education, Third Edition”, 1999.

12S506 COMPUTER NETWORKS


L T P C

3 0 0 3

PREREQUISITES :

12S304-Analog And Digital communication


with:

Fundamental concepts of computer networking.

Basic taxonomy and terminology of the computer networking area.

Layering concepts in OSI/ISO and TCP/IP reference models.

Design issues and functionalities of Physical, data link, network, transport and application layers.


CO1: Explain data communication systems and its components [Familiarity] CO2: Identify the different types of network topologies and protocols [Familiarity]

CO3: Enumerate the layers of the OSI model and TCP/IP and Explain the functions of each layer [Familiarity]

CO4: Identify the design issues of physical, data link, network, transport and application

layers [Familiarity] C05: Describe basic protocols of Computer Networks and how they can be used to assist

in network design and implementation. [Usage]

UNIT I INTRODUCTION AND PHYSICAL LAYER (9) Motivation-Goals of networking-Need for a layered architecture, Network hardware-

Network software -Reference models - Network standardization, RS-232 over serial line - Guided Transmission media - Wireless transmission media.

UNIT II THE DATA LINK LAYER (9)

The Data Link Layer: Data link layer design issues – services provided to the network layer, Framing –Flow and error control :Error detection and correction - Elementary data link protocols – A simplex stop and wait protocol –stop and wait ARQ-Sliding window protocols,

piggy backing - MAC protocols - Ethernet – FDDI-Bridges.

UNIT III THE NETWORK LAYER (9) Network layer design issues –Switching techniques, IP addressing modes- Sub netting-

Routing algorithms: Flooding, Distance vector and Link state routing, Hierarchical routing, Multicasting and broadcasting - Congestion control algorithms -Internetworking.

UNIT IV THE TRANSPORT LAYER (9) Duties of Transport layer- Multiplexing -Demultiplexing-Congestion control, Simple

transport protocol - Internet transport protocols UDP, TCP- ATM protocols.

UNIT V THE APPLICATION LAYER (9) Domain name system - SMTP,FTP, HTTP - Electronic mail - World Wide Web - Multimedia

- Network Security.


1 Behrouz A.Ferouzan,‖Data Communications and Networking‖,5th edition, Tata

McGraw-Hill,2012.

Reference Books

1 Andrew S. Tanenbaum, “Computer networks”s, PHI, 5th edition 2011. 2 Larry L. Peterson and Bruce S. Davie, “Computer Networks, A Systems Approach”,

Morgan Kaufmann Publishers Inc, 5th edition 2011. 3 William Stallings, “Data and computer communication”, 10th edition, Pearson

Education, 2013.

4 Douglas E. comer, “Internetworking with TCP/IP-Volume-I”, 6th edition, PHI, 2013.

12S507 UNIX INTERNALS LABORATORY

L T P C

0 0 3 2

PREREQUISITES :

12S408 - System Programming and Operating systems Laboratory

COURSE OBJECTIVES:Upon completion of this course the students will be familiar with:

System programming techniques in C and UNIX shell script programming which can lead to careers in System Programming, Application Programming, Systems or Network Administration,

Technical Support and Security Analysis.

COURSE OUTCOME- Upon completion of this course the students will be able to:

CO1: Implement Shell scripts and UNIX commands. [Usage] CO2: Interact with the shell using file system calls and perform fundamental operations on

files such as creating, duplication, mounting. [Usage] CO3: Analyze the mutual exclusion, synchronization and critical section problems and debug them. [Assessment]

CO4:Implement and test deadlock detection, prevention and avoidance algorithms. [Usage]

CO5: Develop programs that use pipes, message queues, semaphores, and shared memory for process cooperation and communications. [Assessment] CO6: Implement a mini kernel [Assessment]

LIST OF EXPERIMENTS:

1. Implementation of Shell programming 2. UNIX Command implementation

3. Implementation of system calls 4. Illustration of mutual exclusion

5. Implementation of Classical problems of synchronization 6. Implementation of deadlock detection, prevention and avoidance algorithms 7. Implementation of Inter process communication using message queues, pipes and sockets

8. Simulation of memory management policies 9. Case study: implementation of kernel.

TOTAL: 45

12S508 NETWORKING LABORATORY


L T P C

0 0 3 2

PREREQUISITES :

12S306 - Programming in Java


Hands on socket programming,packet sniffing, RPC and simulate basic network protocols using

NS2.

COURSE OUTCOME- Upon completion of this course the students will be able to:

CO1: Create client-server based application using TCP and UDP sockets. [Usage] CO2: Demonstrate packet sniffing using WIRESHARK. [Usage]

CO3: Develop applications using Raw sockets and remote procedure call. [Usage] CO4:Analyze the performance of MAC, TCP and UDP protocols. [Assessment]

CO5: Simulate LEACH, LAN, MANET protocols using NS2. [Usage] CO6: Measure the performance of networks using NS2. [Usage]


1. Programs using TCP Sockets (like date and time server & client, echo server & client,

etc.) 2. Programs using UDP Sockets (like simple DNS). 3. Packet sniffing using WIRESHARK application.

4. Simulation of sliding window protocols 5. Implementation of address resolution protocol

6. LEACH protocol simulation using ns2 7. Performance comparison of MAC protocols 8. LAN simulation using ns2

9. Measuring network performance using ns2 10. Simulating a MANET using ns2

11. Study of UDP performance 12. Study of TCP performance

TOTAL: 45

12S601 EMBEDDED SYSTEM DESIGN


L T P C

3 0 0 3

PREREQUISITES :

12S404 - Computer Architecture

12S405 - Systems Programming and Operating Systems

12S502 - Unix Internals


with:

Microcontroller architectures.

Embedded software development in Linux environment.

ARM processors and designing the system using ARM processor

Interfacing of I/O devices with processors.

RTOS concepts and to appreciate its need in embedded system

COURSE OUTCOMES- Upon completion of this course the students will be able to

CO1:Apply the microcontroller cores (ARM, RISC, CISC, and SOC) for the Embedded systems. [Usage]

CO2: Develop Embedded software in Linux environment [Usage]

CO3:Design embedded systems using ARM processors such as ARM7, ARM9, and

ARM11 [Usage]

CO4:Explain the interfacing of LEDs, LCDs and Stepper motors with the processor.[Usage]

CO5: Apply RTOS concepts of task and time management, memory management for embedded systems. [Usage]

UNIT I INTRODUCTION TO EMBEDDED SYSTEMS (9) Review of microcontrollers and Digital Signal Processors (DSP) – architecture - peripheral

modules. Embedded microcontroller cores (ARM, RISC, CISC, SOC) - addressing modes - interrupts structure - hardware multiplier pipelining. Hardware/Software co-design -

Architecture of embedded systems.

UNIT II EMBEDDED SOFTWARE DEVELOPMENT (9) Assemblers, linkers and loaders - Binary file formats for processor executable files - Typical

structure of timer- interrupt driven programs - GNU-GCC compiler introduction - programming with Linux environment and GNU debugging - GNU insight with step level trace debugging, make file interaction, building and execution.

UNIT III DESIGN WITH ARM PROCESSOR (9) Introduction to ARM instruction set - addressing modes - operating modes with ARM core - ARMTDMI modes - ADC, Timers, Interrupt structure - Byte ordering (LE, BE) - Thumb

mode normal mode instructions changes, Pipeline utilization with all register allocations. Compare with ARM7, ARM9, and ARM11 with new features additions - System design with

ARM processor. UNIT IV INPUT / OUTPUT INTERFACING (9)

Interfacing with switches, keyboards, LED’s, LCD’s, transistors used for digital controlled current switches, digital-controlled relays, solenoids, DC, AC and stepper motors, analog

interfacing and data acquisition systems.

UNIT V REAL-TIME OPERATING SYSTEM (9) Real Time Operating System Concepts, Kernel Structure, Critical Sections, Multitasking,

Task Management, Time Management, Schedulers, Event Control Blocks, Priorities, Deadlocks, Synchronization, Semaphore Management, Mutual Exclusion, Message Mailbox Management, Message Queue Management, Memory Management, RTOS implementation.

Examples of OSs for embedded systems – RT Linux, uC/OS.


1 Dr.K.V.K.Prasad“Embedded/ Real-Time Systems: Concepts, Design

&Programming”Dreamtechpress,ThirdEdition,New Delhi,2009. 2 Andrew N.Sloss,DominicSysmes and Chris Wright,“ARM System Developer‟s Guide

Designing andOptimizing System Software”, Morgan Kaufman Publisher,2004.

Reference Books

1 David E. Simon ,”An Embedded Software Primer”,Pearson Education South Asia, 2001

2 Jonathan W. Valvano ,“Embedded Microcomputer Systems Real Time Interfacing”, Thomson Asia Pte Ltd.,2006

3 Hollabaugh,”Embedded Linux : Hardware, Software and Interfacing “, Pearson

Education, 2002 4 Sriram V Iyer, PankajGupta,”EmbeddedRealtime Systems Programming”,TMH, 2004

12S602 DISTRIBUTED COMPUTING


L T P C

3 0 0 3

PREREQUISITES :

12S403 - Database Systems

12S405 - System Programming and Operating Systems.

12S506 - Computer Networks.

COURSE OBJECTIVES: Upon completion of this course the students will be familiar

with:

Characteristics of distributed system

Remote object invocation, operating system layer and distributed file system.

Naming services, Synchronizing physical and logical clock, debugging and mutual

exclusion in distributed environment.

Working principles of distributed transaction and concurrency control protocols

Concepts of replication, distributed shared memory and multimedia systems

COURSE OUTCOMES- Upon completion of this course the students will be able to

CO1: Apply resource sharing, inter-process communication, Client Server

Communication and group communications in distributed systems.[Usage]

CO2: Illustrate interprocess communication using RPC, Process and Threads.

[Familiarity]

CO3: Show how distributed file service architecture is applied in Sun Network File system. [Usage]

CO4: Analyze how the physical clock and logical clock are synchronized to global state [Assessment]

CO5: Identify the coordinator using election algorithm. [Usage]

CO6: Show how the ACID properties are satisfied in Distributed transactions. [Usage]

CO7: Analyze the group communication with replicated data. [Assessment]

UNIT I CHARACTERIZATION OF DISTRIBUTED SYSTEMS (9) Introduction – Examples of distributed systems – Resource sharing and the Web – challenges. System Model: introduction – architectural models – fundamental models. Inter process

Communication: Introduction – the API for the Internet protocol – External data representation and Marshaling – Client – Server communication – Group Communication.

UNIT II DISTRIBUTED OBJECTS AND REMOTE INVOCATION (9)

Introduction – Communication between Distributed Objects – RPC – Events And Notifications. Operating System Support: Introduction – The Operating System Layer – Protection – Process And Threads – Communication And Invocation - Operating system

Architecture. Distributed File Systems: Introduction – File Service Architecture – Sun Network File System.

UNIT III NAME SERVICES (9) Introduction – Name Services and the DNS – Directory And Discovery Services. Time And

Global States: Introduction – Clock, Events And Process States – Synchronizing Physical Clocks – Logical Time and Logical Clocks – Global States – Distributed Debugging. Co-

Ordination and Agreement: Introduction – Distributed Mutual Exclusion – Elections – Multicast Communication.

UNIT IV TRANSACTIONS AND CONCURRENCY CONTROL (9) Introduction – Transactions – Nested Transaction – Locks – Optimistic Concurrency Control

– Timestamp Ordering – Comparison of Methods For Concurrency Control. Distributed Transactions: Introduction – Flat And Nested Distributed Transactions – Atomic Commit Protocols – Concurrency Control in Distributed Transactions – Distributed Deadlocks –

Transaction Recovery.

UNIT V REPLICATION (9) Introduction – System Model and Group Communication – Fault Tolerant Services – Highly Available Services – Transactions with Replicate Data. Distributed Shared Memory:

Introduction – Design And Implementation Issues – Sequential Consistency And Ivy – Release Consistency And Munin. Distributed Multimedia Systems: Introduction – Characteristics of Multimedia Data – Quality Of Service Management – Resource

Management – Stream Adaptation.


1 George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems – Concepts

and Design”, Fifth Edition, Pearson Education, 2012. (Chapters 1, 2, 4-6, 8-16, Case Studies are not included)

Reference Books

1 Andrew S. Tanenbaum, Maartenvan Steen, “Distributed Systems – Principles and

Paradigms”, Pearson Education, 2002. 2 MukeshSinghal, NiranjanG.Shivaratri, “Advanced Concepts in Operating Systems:

Distributed, Database,and Multiprocessor Operating Systems”, Tata McGraw-Hill, 2000.

12S603 COMPILER DESIGN

L T P C

3 1 0 4

PREREQUISITES :

12S404 – Theory of Computation

12S405 - Systems Programming and Operating Systems

COURSE OBJECTIVES-Upon completion of this course the students will be familiar with

Different phases of complier and parsing techniques.

Variants of syntax tree used for intermediate code generation

Storage organization and techniques for object code generation.

Different code optimization techniques.

Analyzing the concepts of synchronization techniques for parallelizing compiler.


CO1: Explain the role of a lexical analyzer and identify and design top down and bottom up Parsing techniques ( SLR,CLR,LALR). [Usage]

CO2:Construct a syntax tree and generate three address codes. [Assessment]

CO3:Explain stack and Heap storage allocation techniques and generate code for expressions. [Usage]

CO4:Compare flow graphs and basic blocks and write efficient codes using peephole optimization. [Assessment] CO5: Explain the significance of data reusability and synchronization between parallel

loops. [Usage]

UNIT I INTRODUCTION TO COMPILERS (9) The structure of compiler – Lexical analysis: Role of Lexical analyzer-Input buffering-Specification and recognition of tokens-The lexical analyzer generator Lex- Syntax Analysis:

Top down parsing, Bottom up parsing-LR Parsers: SLR, CLR, and LALR-Parser generator.

UNIT II INTERMEDIATE CODE GENERATION (9) Syntax Directed Definitions, Evaluation orders for syntax directed definitions, Syntax

Directed Translation schemes-Variants of syntax trees- Three address codes – Types and Declarations – Translation of expression- Type checking - Control flow-Back patching-

Switch statements-Intermediate code for procedures

UNIT III OBJECT CODE GENERATION (9) Storage organization- Stack allocation space- Access to non- local data on the stack -Heap

management - Issues in code generation – Target language-Addresses in target code- Design of code generator - Register allocation and assignment– Instruction selection by tree rewriting – Optimal code generation for expressions – Dynamic programming code

generation.

UNIT IV CODE OPTIMIZATION (9) Basic blocks and Flow graphs – Optimization of basic blocks – Principal sources of

optimizations – Data flow analysis – Constant propagation – Partial redundancy elimination - Peephole optimizations.

UNIT V PARALLELIZING COMPILER (9) Basic concepts and examples – Iteration spaces – Affine array indexes – Data reuse – Array

data dependence analysis-Finding synchronization free parallelism – Synchronization between parallel loops- Locality optimizations

LECTURE: 45 TUTORIAL: 15 TOTAL:60

Text Books

1 Alfred V. Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman, ―Compilers: Principles, Techniques and Tools‖, Second Edition, Dorling Kindersley(India) Pvt Ltd., 2011

Reference Books

1 Allen I. Holub, “Compiler Design in C”, Prentice-Hall software series, 2012

2 Randy Allen, Ken Kennedy, “Optimizing Compilers for Modern Architectures: A

Dependence based Approach”, Morgan Kaufmann Publishers, 2002

3 Steven S. Muchnick, “Advanced Compiler Design and Implementation”, Morgan Kaufmann Publishers - Elsevier Science, India, Indian Reprint 2003.

4 Keith D Cooper and Linda Torczon, “Engineering a Compiler”, Morgan Kaufmann Publishers Elsevier Science, 2004.

5 V. Raghavan, “Principles of Compiler Design”, Tata McGraw-Hill Education

Publishers, 2010.

12S604 ARTIFICIAL INTELLIGENCE

L T P C

3 0 0 3

PREREQUISITES :

12S302 - Discrete Mathematics

COURSE OBJECTIVES: Upon completion of this course the students will be familiar with

Concepts of traditional and heuristic search techniques

Knowledge representation and usage of appropriate representation for solving a

problem

Game theory and Natural language processing

Neural Networks classifiers and Expert Systems. Significance of Fuzzy logic and Genetic Algorithm as optimization techniques


CO1:Define and solve problems using Best first search, hill climbing, A* techniques.[Usage] CO2:Compare procedural and declarative knowledge, symbolic and non-monotonic

reasoning, apply Baye‟s theorems for AI. [Assessment] CO3:Explore Min-max search procedure, alpha beta cutoffs, iterative deepening and

articulate Natural Language Processing. [Assessment]

CO4:Analyze Hopfield and other recurrent networks and describe the functionality of speech recognition and action robots. [Assessment]

CO5: Compare crisp and fuzzy sets and apply inference algorithms for Neuro fuzzy systems and Genetic algorithms. [Assessment]

UNIT I PROBLEMS AND SEARCH (9) Artificial Intelligence: Problems, Problem Spaces and Search: Defining the problems as a

State Space Search-Production Systems-Problem characteristics-Production System characteristics - Heuristic Search Techniques: Generate and test-Hill Climbing-Best first

search-Problem reduction-Constraint satisfaction-Means ends analysis-Knowledge representation issues.

UNIT II KNOWLEDGE REPRESENTATION (9)

Implementation-Using predicate logic: Representing simple facts in logic, representing instance and ISA relationships, Computable functions and predicates- Resolution-Natural deduction-Representing knowledge using rules: Procedural versus declarative knowledge,

logic programming, forward versus backward reasoning, matching, control knowledge-Symbolic Reasoning under uncertainty-Introduction to Non monotonic reasoning – Logics

for Non monotonic Reasoning– Implementation issues-Augmenting a problem solver-Implementation – Statistical Reasoning: Probability and Baye’s theorem – certainty factors and rule based systems – Bayesian networks – Dempster - Shafer Theory - Fuzzy logic-Weak

Slot and Filler structures: Semantic nets-Frames– Strong slot and Filler structures: Conceptual dependency-Scripts-CYC.

UNIT III ADVANCED AI TOPICS (9) Game playing: the Minimax search procedure -Adding Alpha-beta cutoffs-Additional

refinements- Iterative Deepening – Planning: Overview- An example domain: The blocks world-Components of a planning system-Goal stack planning-Nonlinear planning using

constraint posting- Hierarchical planning-Reactive systems- Understanding-Natural language Processing – Syntactic processing – semantic analysis – Discourse and pragmatic processing – Statistical natural language processing – spell checking-Parallel and Distributed AI:

Psychological Modeling-Parallelism in reasoning systems-Distributed Reasoning systems.

UNIT IV LEARNING (9) Learning – Connectionist model: Introduction: Hopfield networks-Learning in neural networks-Applications of neural networks-Recurrent networks-Distributed representation-

Connectionist AI and Symbolic AI-Common sense: Qualitative physics-Common sense ontologies - Memory Organization-Case-Based Reasoning– Expert systems: Representing

and using domain knowledge –Expert system shells-Explanation-Knowledge acquisition-Perception and action: Real-Time search-perception-Action-Robot Architecture.

UNIT V FUZZY LOGIC SYSTEMS AND GENETIC ALGORITHMS (9) Fuzzy logic systems-Introduction-Crisp sets-Fuzzy sets - Fuzzy logic control- Sugeno style of fuzzy inference processing-Fuzzy hedges-á-cut threshold- Neuro fuzzy systems-Genetic

Algorithms-Artificial immune systems-Prolog-The Natural Language of Artificial intelligence.


Text Books

1 Elaine Rich, Kevin Knight, Shivashankar B Nair,‖ Artificial Intelligence‖, Tata McGraw hill publications, Third edition, 2009.

Reference Books

1 Dan W. Patterson, ―Introduction to Artificial Intelligence and Expert Systems‖,

Pearson education 1990. 2 Russell, S. and Norvig, P., ―Artificial Intelligence: A Modern Approach‖, Pearson

Education.2006. 3 Nilsson, N. J., ―Artificial Intelligence: A New Synthesis‖, Morgan Kaufmann. 1998

12S605 FUNDAMENTALS OF DIGITAL SIGNAL PROCESSING


L T P C

3 1 0 4

PREREQUISITES:

12S304 - Analog and Digital Communication


Describing the fundamentals of signals and systems.

Solving the problems using DFT and FFT

Describing methods to learn the IIR filters

Describing methods to learn the FIR filters

Acquiring knowledge on signal conversion and errors in real time applications of DSP.

COURSE OUTCOMES-:Upon completion of this course the students will be able to

CO1: Explain the primitives of signal and systems. [Familiarity]

CO2: Compute convolution of continuous and discrete time signals [Usage]

CO3: Use Z Transform to analyse discrete time systems. [Usage]

CO4: Analyse computational complexity of Fast Fourier transform [Assessment]

CO5: Apply FFT for liner filtering and correlation [Usage]

CO6: Transform differential equations into direct form structures for IIR filters.

[Usage]

CO7: Design FIR filters using windowing, rectangular, Kaiser and frequency sampling techniques. [Usage]

CO8: Compare overflow, truncation and Co-efficient errors.[Assessment]

CO9: Describe the application of DSP in designing of vocoder.[Usage]

UNIT I SIGNALS AND SYSTEMS (9) Basic Elements of Digital Signal Processing – Concept of Frequency in Continuous Time and

Discrete Time Signals – Sampling Theorem – Discrete Time Signals – Discrete Time Systems – Analysis of Linear Time Invariant Systems – Z Transform – Convolution and Correlation.

UNIT II FAST FOURIER TRANSFORMS (9) Introduction to DFT – Efficient Computation of DFT – Properties of DFT – FFT Algorithms

– Radix-2 and Radix-4 FFT Algorithms – Decimation in Time – Decimation in Frequency– Use of FFT Algorithms in Linear Filtering and Correlation.

UNIT III IIR FILTER DESIGN (9) Structure of IIR – System Design of Discrete Time IIR filter From Continuous Time Filter –

IIR Filter Design by Impulse Invariance – Bilinear Transformation – Approximation Derivatives – Design of IIR Filter in the Frequency Domain.

UNIT IV FIR FILTER DESIGN (9)

Symmetric and Antisymteric FIR Filters – Linear Phase Filter – Windowing Technique – Rectangular– Kaiser Windows– Frequency Sampling Techniques – Structure for FIR

Systems.

UNIT V FINITE WORD LENGTH EFFECTS (9) Quantization Noise – Derivation for Quantization Noise Power – Fixed Point and Binary

Floating Point Number Representation – Comparison – Over Flow Error – Truncation Error – Co-Efficient Quantization Error – Limit Cycle Oscillation – Signal Scaling – Analytical Model of Sample and Hold Operations – Application of DSP – Model of Speech Wave Form

– Vocoder.


Text Books

1 John G Proakis and Dimtris G Mano lakis, ―Digital Signal Processing Principles –

Algorithms andApplication‖, Fourth Edition, PHI/Pearson Education, 2007.

Reference Books

1 Alan V Oppenheim, Ronald W Schafer and John R Buck, ―Discrete Time Signal Processing‖, Second Edition, PHI/Pearson Education, 2000.

2 JohnyR.Johnson, ―Introduction to Digital Signal Processing‖, Prentice Hall of India/Pearson Education, 2002.

3 SanjitK.Mitra, ―Digital Signal Processing A Computer - Based Approach‖, Second

Edition, Tata McGraw-Hill, 2001.

12S607 COMPILER LABORATORY

L T P C

0 0 3 2

PREREQUISITES :

12S408 - Systems Programming and Operating Systems Laboratory


Constructing finite state automata for regular expressions.

Writing a grammar and prepare it for parsing.

Understanding top down and bottom up parsing techniques.

Explaining intermediate code generation and directed acyclic graph

Understanding static and dynamic storage management.


CO1: Implement the construction of NFA and DFA from regular expression. [Usage]

CO2: Test the given grammar for leading, trailing, FIRST, FOLLOW and remove lef t

factoring & recursion of non terminals. [Usage]

CO3: Implement the construction of LR, Top down, Operator precedence and shift

reduce parsers. [Usage]

CO4: Demonstrate the generation of DAG and three address code.[Assessment]

CO5: Develop programs for storage management. [Usage]


1. Implement a program for constructing NFA from a regular expression.

2. Implement a program for constructing DFA from a regular expression. 3. Implement a program for converting NFA to DFA 4. Implement a program to find leading and trailing of the given grammar.

5. Implement a program to compute FIRST and FOLLOW of non terminals. 6. Implement a program to remove left factoring and left recursion.

7. Implement a program for constructing Top down parsing table. 8. Implement a program to implement shift Reduce Parsing Algorithm. 9. Implement a program to implement Operator Precedence Parsing Algorithm.

10. Implement a program to find the closure of the given grammar. 11. Implement a program for constructing LR parsing table.

12. Implement a program to generate DAG for the given expression. 13. Implement a program to simulate the storage management. 14. Implement front end of compiler that generates the three address code for the given

language. 15. Implement back end of compiler which takes the three address code and produces the

X86 assembly language instructions 16. Analysis of source program using LEX and YAC tool

TOTAL: 45

12S608 GRAPHICS AND MULTIMEDIA LABORATORY

L T P C

0 0 3 2

PREREQUISITES :

12S204 - Object Oriented Programming using C++


COURSE OBJECTIVES- Upon completion of this course the students will be familiar with

Understand the graphic primitive algorithms.

Explore transformation and clipping of 2D and 3D data.

Understand data and image compression.

Gain knowledge about the application of animation software.


CO1: Implement the algorithms of drawing line, circle and ellipse. [Usage]

CO2: Implement the 2D and 3D transformations, clipping and viewing algorithms. [Usage]

CO3: Implement compression algorithms for multimedia data, image, audio and video. [Usage]

CO4: Develop programs to animate- image, audio and videos. [Usage]

CO5: Implement multimedia software using any multimedia tools like flash, movie maker, MAYA, photo shop. [Assessment]

IMPLEMENTATION OF THE FOLLOWING:

1. Line drawing algorithm 2. Circle drawing algorithm 3. Ellipse drawing algorithm

4. 2D transformations 5. 2D clipping and viewing

6. 3D transformations 7. 3D clipping and viewing 8. Data compression and Image compression

9. Audio and video compression 10. Animation

11. Case study: i. Comparison of all compression schemes

ii. Create an animated movie using multimedia tool

12. Mini project TOTAL: 45

12S701 MANAGEMENT AND ECONOMICS

L T P C

3 0 0 3


Gaining knowledge about the management principles, levels of an organization, ethical and social responsibilities of the manager.

Describing Planning, organizing, staffing and directing.

Acquiring knowledge on the leadership qualities, challenges and barriers for an

effective communication.

Identifying the scope, demand and supply of a product or service and its elasticity and

cost.

Gaining knowledge about the causes, types, corrective measures of inflation

Understanding the intricacies of the issues associated with international trade

COURSE OUTCOMES-: Upon completion of this course the Students will be able to

CO1: Describe the management principles, levels of an organization, ethical and social

responsibilities of the manager. [Familiarity]

CO2:Plan, organize, train and allocate human resources for the given project.[

Assessment]

CO3: Apply leadership theories, motivation techniques and communication guidelinesfor

effective communication. [Assessment]

CO4: Identify the scope and nature of micro economics. [Familiarity]

CO5: Compare the supply and demand behavior in the short and long run. [Usage]

CO6: State the nature and functions of money, list the types. [Familiarity]

CO7: Explain financial activities and functions of Reserve Bank Of India such as

corrective measures for inflation. [Usage]

UNIT I BASIS OF MANAGEMENT THOUGHT (9) Evolution of Management, Management- Definition, Levels, Principles, Differences with

administration, Roles of Managers, External Environment of Business, Social responsibility, Management Ethics.

UNIT II PLANNING, ORGANIZING AND STAFFING (9)

Plannning- Process, Types, Guidelines, Premises, Organizing-Nature, Purpose, Concepts-Delegation of authority, Departmentation, Staffing-Manpower Planning, Recruitment,

Selection (Step only), Training Methods.

UNIT III DIRECTING AND CONTROLLING (9) Leadership-Nature, Theories-trait Theory, Managerial Grid, Ohio State Leadership Theory,

Fiedler’s Contingency Model, Challenges to Leadership, motivation- Need Hierarchy, Two-Factor, Theory X and Y, ERG, Equity and Social Comparison Theory, Communication- Process, Barriers, Guidelines and Barriers for effective communication.

UNIT IV MICRO ECONOMICS (9)

Nature, Scope, Demand- Departments, Law of Demand, Exceptions, Elasticity, Supply,-Determinants, Law of supply, Elasticity, Cost concepts, run vs Long run cost relationship.

UNIT V MACRO ECONOMICS (9)

Money- Nature, Functions, Inflation,- Causes, Types, Corrective Measures, Impact, Deflation, Functions of country’s Central Bank and Commercial banks, Global Trade,

Foreign Exchange, Balance of Payments.

LECTURE: 45 TUTORIAL: 0TOTAL: 45

Text Books

1 JKoontz, “Essentials of Management”, McGraw-Hill , eighth edition2010.

2 Prasad L.M, “Principles and Practice of Management”, Sultan Chand and Sons, New Delhi, eighth edition, 2013.

3 Varsheney R.L., Maheshwary K.L., “Managerial Economics”, Sultan Chand and

Sons, New Delhi, 2014.

Reference Books

1 Samuelson P.A., Novohlans W.D., “Economics”, 19th edition, McGraw Hill, New York, 2010.

2 Stephen Robbins, “Organizational Behavior”, Pearson Education, 15thedition,New Delhi, 2013.

12S702 CRYPTOGRAPHY AND NETWORK SECURITY


L T P C

3 0 0 3

PREREQUISITES :

12S302- Discrete Mathematics

12S401- Probability, Random Processes and Queuing Theory

12S506-Computer Networks


Describing the network security model in OSI Architecture and the basic symmetric and asymmetric cryptographic Techniques.

Utilizing the concepts of number theory to perform encryption and decryption.

Acquiring knowledge on principles, algorithms of public key cryptosystem and

various authenticating techniques.

Applying Internet protocol services for key management to provide security in various

web services.

Acquiring basic knowledge about attacks, malicious software and principles of

firewall to develop a trusted system.

COURSE OUTCOMES: Upon completion of this course the students will be able to:

CO1: Convert plain text to cipher text using substitution and transposition techniques.

[Familiarity]

CO2: Utilize the concepts of number theory such as Euclidean theorem to perform encryption and decryption. [Usage]

CO3: Apply the principles, algorithms of public key cryptosystems like RSA and hash functions like SHA for authentication. [Usage]

CO4: Explain concepts, protocols and Architectures used in mail security, IP Security and web security [Familiarity]

CO5: Protect systems from intruders, malicious software using intruder detection,

password management and firewalls [Assessment]

UNIT I INTRODUCTION (9) Overview: Services, Mechanisms and Attacks- The OSI security model Architecture- A

model for Network Security, Classical Encryption Techniques: Substitution Techniques- Transposition Techniques- Rotor Machines- Symmetric Cipher Model - block Ciphers and

Data Encryption Standard: Simplified DES- Block Cipher Principles.

UNIT II NUMBER THEORY (9) Groups, Rings and Fields- Modular Arithmetic- Euclid’s Algorithm- Finite Fields of the form

GF (p)- Finite Fields of the form GF (2n)- Polynomial Arithmetic- Congruence’s and residue classes- Euler’s Phi Functions- The theorems of Fermat and Lagrange- Computer Square roots modulo integer- Computer Square roots modulo composite- Blum Integers.

UNIT III PUBLIC KEY ENCRYPTION AND HASH FUNCTIONS (9)

Public Key Cryptography: Principles of public key cryptosystems- The RSA Algorithm- Message Authentication and Hash Functions: Authentication Requirements- Authentication

Functions- Message Authentication Codes- Hash Functions-Security of Hash Functions and MAC’s.

UNIT IV NETWORK SECURITY (9)

Electronic Mail Security: Pretty Good Privacy- S/MIME- IP Security: IP Security Overview- IP Security Architecture-Authentication Header- Encapsulating Security Payload- Combining Security Associations- Key management- Web Security: Web Security Considerations-

Secure Socket Layer and Transport Layer Security- Secure Electronic Transaction.

UNIT V SYSTEM SECURITY (9) Intruders: Intruders- Intruder Detection- Password Management- Malicious Software: Viruses

and Related Threats-Virus Countermeasures- Firewalls: Firewall Design Principles- Trusted Systems.


Text Books

1 William Stallings, "Cryptography and Network Security": Principles and Practice, Sixth Edition, prentice Hall, 2014.

Reference Books

1 WenboMao,“Modern Cryptography: Theory and practice”, Pearson Education,

first edition,2004. 2 BruceSchneier, “Applied Cryptography”, Second Edition, John Wiley & Sons,1996

3 Douglas R. Stinson, ―Cryptography: Theory and Practice‖, CRC Press, Third Edition,2006

12S703 SOFTWARE ENGINEERING

[Common to CSE, IT & ECE]

L T P C

3 0 0 3

PREREQUISITES :

12S501 - Object Oriented Analysis and Design

COURSE OBJECTIVES-Upon completion of this course the students will be familiar with

Software life cycle models and system engineering process for developing a system

from scratch.

Software project management concepts

Prototyping techniques for requirement engineering process and to analyse data, functional and behavioural model

Design levels of software engineering.

Software testing and technical metrics for verifying and validating the software.


CO1: Explore the strength and weakness of life cycle models such as water fall,

incremental and spiral model.[Assessment]

CO2: Plan, schedule, identify the risk involved and track the development of project for ensuring the software quality. [Assessment]

CO3: Identify the functional and non-functional requirements for the project and use it to develop the project using life cycle model. [Usage]

CO4: Apply design processes and concepts for architectural, data, software, user interface and real time systems design. [Usage]

CO5: Explain taxonomy, levels, and activities of testing [Familiarity]

CO6: Verify, and validate the software applications using different types of testing like black box testing, structural testing, unit testing etc. [Assessment]

UNIT I INTRODUCTION (9)

Introduction –S/W Engineering Paradigm – life cycle models (water fall, incremental, spiral, WINWIN spiral, evolutionary, prototyping, object oriented) - system engineering – computer based system – verification – validation – life cycle process – development process –system

engineering hierarchy.

UNIT II PROJECT MANAGEMENT (9) Project Management Concepts -Software Project Planning Risk analysis and management-

project scheduling and tracking-software quality assurance-Software configuration management

UNIT III REQUIREMENT ANALYSIS (9)

Functional and non-functional - user – system –Requirement Engineering process – feasibility studies – requirements – elicitation – Validation and Management – Software

Prototyping – Prototyping in the software process – rapid prototyping techniques – user interface prototyping -S/W document. Analysis and modeling – Data, Functional and

Behavioral models– Structured Analysis and Data Dictionary.

UNIT IV DESIGN (9) Design process and concepts – Modular design – Design heuristic – Design model and

document. Architectural design – Software architecture – Data design – Architectural design – Transform and transaction mapping – User interface design – User interface design

principles – Component level design. Real time systems - Real time software design – System design – Real time executives – Data acquisition system - Monitoring and control system.

UNIT V TESTING (9) Taxonomy of software testing – levels – test activities – Types of s/w test – Black box testing – Testing boundary conditions – Structural testing – Test coverage criteria based on data flow

mechanisms – Regression testing – Testing in the large. S/W testing strategies – Strategic approach and issues - Unit testing – Integration testing – Validation testing – system testing

and debugging.-Technical Metrics for Software.


Text Books

1 Roger Pressman.S, ―Software Engineering : A Practitioner’s Approach”, Seventh

Edition ,McGraw Hill, 2010.

Reference Books

1 Ian Sommerville,“Software Engineering “, 9th Edition, Pearson Education Asia, 2011.

2 S.A. Kelkar, “Software Engineering, A Concise Study”, Prentice Hall of India,2007 3 Carlo Ghezzi,MehdiJazayeri and Dino Mandrioli, “Fundamentals of Software

Engineering",Second Edition, Prentice Hall of India, 2003.

4 Richard E. Fairley, “Principles of Software Engineering”,IEEE computer society press,2010.

5 Shari Pfleeger, Joanne Atlee, “Software Engineering: Theory and Practice”, Fourth Edition, Pearson Education,2010.

12S704 MOBILE COMPUTING


L T P C

3 0 0 3

PREREQUISITES :

12S506 - Computer Network


Digital communication, channel access techniques and wireless sensor networks.

Standards and issues of wireless communication techniques.

Services, models, functions, layers and routing algorithms for a wireless and ad hoc networks.

Transmission control and technologies used in transport layer.

File systems, protocols, algorithms to support mobility for wireless networks.

COURSE OUTCOMES- Upon completion of this course the student will be able to:

CO1: Explain different medium access schemes such as FDMA, TDMA and CDMA used in wireless communication [Familiarity]

CO2:Analyse the hidden and exposed terminal problem [Usage] CO3: Describe LEO, GEO and MEO in satellite systems [Familiarity] CO4: Compare infrared and radio transmission, Infrastructure and ad hoc network

CO5: Describe IEEE 802.11 and HYPERLAN [Familiarity] CO6: Apply destination sequence distance vector and dynamic source routing

protocols for routing in ad hoc networks [Assessment] CO7: Explain the limitations of standard TCP to support mobile communication [Familiarity]

CO8:Explain file systems and protocols such as coda, little work and wireless application protocol [Familiarity]


Introduction to mobile computing. Convergence of Internet, Digital communicatio n and

computer networks. Sharing of wireless channels: FDMA, TDMA, CDMA. MAC layer

issues in wireless communication, Mobile Communication Systems, Satellite systems.

UNIT II WIRELESS LAN (9) Wireless LAN: Infra redVs Radio transmission, Infra structure and Adhoc Networks – IEEE

802.11,HIPERLAN – Bluetooth, ZigBee. Network layer issues ad hoc and sensor networks

UNIT III WIRELESS ATM AND ADHOC NETWORKS (9)

Motivation for WATM - Services - Reference model - Functions - Radio access layer –

Handover- Location management - Addressing - Mobile QOS - Access point control. Adhoc

Networks: Routing in mobile host- Destination Sequence, Distance Vector, Dynamic Source

routing, Hierarchical algorithms, IP mobility: Mobile IP and IDMP.

UNIT IV NETWORK ISSUES (9) Mobile IP – DHCP – Mobile Transport layer – Indirect TCP – Snooping TCP – Mobile TCP

–Transmission / Time out freezing – Selective retransmission – Transaction oriented TCP.

UNIT V SUPPORT FOR MOBILITY (9) File Systems – World Wide Web – Wireless Application Protocol – Security – Analysis of

existing wireless network, Analysis of algorithms and termination detection.

LECTURE: 45 TUTORIAL: 0 TOTAL: 45 Text Book

1 Schiller J, ―Mobile Communications‖, Second Edition Pearson Education Asia, 2009.

Reference Books

1 Charles E Perkins, ―Mobile IP: Design Principles and Practices‖, First edition

,Pearson Education Asia,1998 2 William Stallings, ―Wireless Communications & Networks‖, Prentice Hall of India,

Second Edition, 2005.

3 Feng Zhao, Leonidas Guibas, ―Wireless Sensor Networks: An Information

Processing Approach‖, First Edition ,Elseivier 2004.

4 Reza B‟Far, ―Mobile Computing Principles‖, Cambridge University Press, 2004

5 T. Rappaport, ―Wireless Communication: Principles and Practice‖, Second Edition,

Pearson Education.2002 6 SipraDasbitandBilap K. Sikdar,”Mobile Computing‖,PHI Learning private Ltd. 2009.

12S707 SOFTWARE ENGINEERING AND WEB TECHNOLOGY LABORATORY

L T P C

0 0 3 2

PREREQUISITES:

12S501-Object Oriented Analysis and Design

12S503-Web Technology

COURSE OBJECTIVES:Upon completion of this course the students will be familiar with

Implementing various cost estimation models.

Debugging risk factors, UML and data flow diagrams.

Implementing various testing procedures.

Designing web page with advanced features and cascading style sheets.

Writing scripts using DHTML and implement applets using JAVA.

Developing programs in JAVA using Servlets.


CO1: Estimate the cost for a railway reservation system using LOC based estimation, FP based estimation and COCOMO model [Assessment]

CO2: Identify and project the risks involved in railway reservation system [Assessment] CO3: Demonstrate the use of Time line charts while designing the railway reservation

system. [Usage] CO4: Demonstrate version control and change control for railway reservation system [Assessment]

CO5: Apply UML and Dataflow diagram to model the banking system [Usage] CO6: Apply Jackson development model to develop banking system [Usage]

CO7: Apply black box testing to test the functionalities of the banking system [Usage] CO8: Apply white box testing to test the functionalities of the banking system [Usage] CO9: Develop mini project using software engineering concepts [Assessment]

CO10: Create a web page with the following using HTML [Usage] Embed an image in the web page Fix hot spots in the embedded image

Show related information when the hot spots are clicked CO11: Create a web page that has information about your college and apply all types of

cascading style sheets to design it [Assessment] CO12: Create a registration form using DHTML and validate the controls in the client side [Usage]

CO13: Create a color palette with matrix of buttons using applets [Usage] CO14: Set background and foreground of the control text area by selecting a color from

color from color palette [Usage] CO15: Write a program to invoke servlets from HTML forms [Usage] CO16: Write a program to invoke servlets from applets [Usage]

LIST OF EXPERIMENTS

SOFTWARE ENGINEERING:

1. Prepare SRS for online mobile store domain problems 2. Cost estimation-LOC based estimation, FP based estimation, COCOMO model

3. Analyse the risk and prepare RMMM plan 4. Time line charts and tracking the schedule using CPM and PERT scheduling methods 5. Version control and change control

6. UML, Data flow diagrams, ER diagrams, CFT and STD for railway protocol. 7. Jackson system development

8. Black box testing 9. White box testing 10. Mini project

WEB TECHNOLOGY

1. Create the web page with all types of cascading style sheets 2. Client side scripts for validating web form controls using DHTML 3. Use filters to pre process an request from client

4. Use custom tags and EL language to develop JSP page 5. Programs using XML- Schema-XSLT/XSL 6. Program using DOM/ SAX

7. Programs using AJAX 8. Case study: search engines

9. Mini project

TOTAL : 45

12S708 NETWORK SECURITY AND ELECTIVE LABORATORY


L T P C

0 0 3 2

PREREQUISITES :

12S306- Programming in Java


with:

Ciphers using substitution techniques.

Test transposition techniques using rail fence and rotor mechanism.

Debug various security algorithms- DES, RC4, RC5, RSA, SHA& MD5.

Practice on the design issues of stenography.

Examining cryptography and to configure the implementation of firewall.

COURSE OUTCOMES-At the end of the course the student will be able to

CO1: Implement multiple letter encryption Playfair cipher and Vignere cipher [Usage]

CO2: Implement a Rail fence mechanism [Usage]

CO3: Implement Data Encryption standard in java [Usage]

CO4: Implement RSA algorithm [Usage]

CO5: Implement SHA & MD5 algorithm in java [Usage]

CO6: Implement Diffie Hellman key exchange algorithm [Usage]

CO7: Implement steganography algorithm for water marking [Usage]

CO8: Configure firewall using packet tracer [Assessment]

CO9: Implement RC4 and RC5 algorithm [Usage]


1. Substitution Techniques i. Implementation Of Vignere Cipher

ii. Implementation Of Playfair Cipher iii. Implementation Of Hill Cipher

2. Transposition Techniques

i. Implementation of Rail Fence Technique ii. Implementation of Rotor Mechanism

3. Implementation of DES 4. Implementation of RC4 and RC5 5. Implementation of RSA Algorithm

6. Implementation of Elliptic Curve Cryptography 7. Implementation of DiffieHelmann Key Exchange Algorithm

8. Implementation of SHA 9. Implementation of MD5 10. Implementation of Digital Watermarking

11. Implementation of Steganography 12. Cryptanalysis

13. Configuring Firewall 14. Experiments Corresponding to Electives

TOTAL: 45

12S801 PROJECT WORK

L T P C

0 0 12 6


with:

To apply knowledge of the mathematical, computational and natural sciences

gained by study ,experience and practice with judgment to develop effective use of matter ,energy and information to the benefit of mankind.

Plan, execute ,manage and document a project

Construct logical and physical models to demonstrate the skills at assimilating,

synthesizing and critically appraising all materials relevant to the project.


CO 1: Identify problem by considering societal/industrial demands.[Assessment]

CO 2: Perform exhaustive literature survey on identified problem.[Assessment] CO 3: Build feasible mathematical/logical model. [Assessment] CO 4:Use design/simulation tools like MATLAB,NS2,NS3,WEKA,etc[usage]

CO 5: Function in a team at any role. [Usage] CO 6: Develop and deliver a good quality formal presentation. [Usage]

CO 7: Write clear, concise and accurate technical document. [Usage]

12S6E0 APPLIED NUMERICAL METHODS


L T P C

3 0 0 3


with:

Solving algebraic and transcendental equation using various methods

Operators, relations between operators, and apply formulae for interpolation

Solving the problems related to numerical differentiation

Solving initial value problems for ordinary differential equations

Solving boundary value problems for ordinary and partial differential equations


CO1: Identify and apply suitable methods from iteration method, Newton-Rapson, Gaussian elimination, Gauss-Jordan and Gauss- Seidel methods to solve an equation [Usage]

CO2: Find the Eigen values of a matrix by power method and Jacobi method for symmetric matrix[Usage]

CO3: Apply Newton‟s divided difference formulae, langrange‟s formulae Newton‟s forward and backward difference formulae to find interpolating points[Usage]

CO4: Solve the problems related to numerical differentiation with interpolation

polynomials and integration using Trapezoidal and Simpson‟s rule and Gaussian quadrature formulae [Usage]

CO5: Solve initial value problems for ordinary differential equations using Singlestep method, Taylor series, Euler and Modified Euler, Runge-Kutta method, Multistep methods, Milne and Adam‟s method [Usage]

CO6: Solve the boundary value problems for ordinary and partial differential equations using ordinary differential equations, one dimensional heat and wave equations,

two dimensional Laplace and Poisson equations[Usage]

UNIT I SOLUTIONS OF EQUATIONS AND EIGEN VALUE PROBLEMS (9) Solution of equation-Iteration method , Newton – Raphson Method for single variable and for

simultaneous equations with two variables – Solutions of Linear system by Gaussian elimination , Gauss – Jordan , Gauss – Seidel Methods – Eigen value of a Matrix by Power Method and by Jacobi method for symmetric matrix

UNIT II INTERPOLATION (9) Operators – Relation between the operators – Newton’s divided difference formula – Langrange’s and Interpolating with a cubic spline - Newton Forward and Backward

difference formulae – Stirlings and Bessel’s Central difference formulae.

UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION (9) Numerical differentiation with Interpolation Polynomials – Numerical Integration by

Trapezoidal and Simpson’s (Both 1/3rd and 3/8th) rules – Two and three point Gaussian quadrature formulae – Double integrals using Trapezoidal and Simpson’s Rules.

UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY

DIFFERENTIAL EQUATIONS

(9)

Single step methods – Taylor series , Euler and Modified Euler , Runge – Kutta method of

order four for first order differential equations – Multistep methods – Milne and Adam’s – Bashforth predictor and Corrector methods.

UNIT V BOUNDARY VALUE PROBLEMS FOR ORDINARY AND

PARTIAL DIFFERENTIAL EQUATIONS

(9)

Finite difference solutions for the second order ordinary differential equations – Finite

difference solutions for one dimensional Heat equation (Both Implicit and Explicit) – One – dimensional Wave equation and two dimensional Laplace and Poisson equations.


1 T Kandasamy. P, Thilagavathy .K ,Gunavathy . K., ―Numerical methods‖, S. Chand and Co., New Delhi, first edition 1997

Reference Books

1 Veerarajan. T and Ramachandran. T., ―Numerical Methods with Programming in C‖,

Tata Mc.Graw Hill Publishers, New Delhi, first edition 2006. 2 Balagurusamy .E., ―Numerical Methods―, Tata Mc.Graw Hill Publishers, New

Delhi,1999, reprint 2007.

3 Grewal. B. S., and Grewal. J.S., ―Numerical Methods in Engineering and Science‖, KhannaPublishers,New Delhi, 2004

4 Gerald.C.F., and Wheatley. P.O., ―Applied Numerical Analysis‖ , (Fifth Edition) , addison Wesley, Singapore, 1998

5 SastryS.S,‖Introductory method of numerical Analysis‖ (Third Edition),Prentice Hall

Of India,New Delhi 1998..Sankara Rao.K,‖Numerical methods for scientists and Engineers (Third Edition), Prentice Hall of India, New Delhi.

12S6E1 WIRELESS ADHOC NETWORKS

L T P C

3 0 0 3

PREREQUISITES :

12S506 Computer Networks


with:

Model of operation, commercial applications and factors affecting Ad Hoc

networking

Finding the path between source and destination using various routing protocols

and acquire knowledge about multi clustering and power issues

Design issues, goals and classification of transport layer protocol, issues and challenges in security provisioning and quality of service.

Basic concepts like constraints and challenges, advantages and applications, routing protocols, tracking scenario and performance metrics of sensor network

Energy aware routing, attribute based routing and techniques required for infrastructure establishment


CO 1: Identify technical and market factors affecting Ad Hoc networks [familiarity] CO 2: Find the path between source and destination using unicast routing protocol

like AODV [Usage]

CO 3: Find the path between source and destination using multicast routing protocol

ODMRP [Usage]

CO 4: Describe the working principles of transport layer protocol and analyze its Quality of service [Familiarity]

CO 5: List the advantages and applications of sensor networks [familiarity] CO 6: Analyze the performance of sensor network based on performance metrics

[Assessment]

CO 7: Analyze energy aware routing and its issues [Assessment] CO 8: Describe clustering and localization in sensor networks [familiarity]

UNIT I INTRODUCTION (9) Model of Operation – Commercial Application – Technical and Market factors affecting Ad Hoc Networking.

UNIT IIROUTING PROTOCOLS (9) Overview of routing methods – Table-driven and Source-initiated On Demand routing protocols, Hybrid protocols – Uni Cast routing protocol (AODV,DSR, DSDV) – Multi-Cast

routing protocol (ODMRP) – Multi clustering– Power Issues– ABR

UNIT III TRANSPORT LAYER AND SECURITY ISSUES (9) Transport layer Protocol: Design issues, goals and classification - TCP over AdHoc wireless

Networks – Security - Security requirements - Issues and challenges in security provisioning - Network security attacks - Security routing. Quality of service: Issues and challenges in providing QoS - Classification of QoS solutions - MAC layer solutions - Network layer

solutions - QoS frameworks.

UNIT IV SENSOR NETWORKS – INTRODUCTION (9) Unique constraints and challenges – Sensor network Classification, MAC and Routing

protocols. Advantages of Sensor networks – Sensor network Applications – Collaborative processing – Key Definitions of sensor networks – A tracking Scenario – problem

formulation – Inference of states – Tracking Multiple Objects – Performance comparison and metrics.

UNIT V NETWORKING SENSORS AND INFRASTRUCTURE

ESTABLISHMENT (9)

Key Assumptions – Medium Access Control – General Issues – Geographic– Energy Aware Routing – Attribute Base Routing. Topology Control – Clustering – Time Synchronization –

Localization and localization services – algorithms


Text Books

1 Toh. C.K., ―Ad Hoc Mobile Wireless networks: Protocols and systems‖, first edition

,Prentice Hall PTR, 2002 2 Charles E.Perkins, ―Ad Hoc Networking‖, first edition, Addison – Wesley, 2001.

Reference Books

1 Feng Zhao, Leonidas Guibas, ―Wireless Sensor Networks – An Information

processing Approach‖, Elseivier 2004. 2 C. Siva Ram Murthy and B.S. Manoj,‖ AdHoc Wireless Networks: Architectures and

protocols‖, Prentice Hall PTR, 2004

3 Stefano Basagni, Marco Conti, Silvia Giordano and Ivan Stojmenovic,‖Mobile AdHoc Networking‖, Wiley – IEEE press, 2004.

12S6E2 OPEN SOURCE SYSTEMS


L T P C

3 0 0 3

PREREQUISITES :

12S502-Unix Internals


with:

Security with reference to SELinux, Linux installation and file management

Linux Shell, process management, user administration, networking and

software repositories

Basic programming constructs of PHP and MYSQL to develop the program

Basic programming constructs of PythonOpen source tools and technologies


CO 1: Install linux and configure network ,proxy server and webserver [Usage] CO2: Work with Linux Shell commands for process management, user administration,

networking and IO redirection [Usage] CO3: Develop programs using basic programming constructs of PHP and MYSQL [Usage]

CO4: Apply the basic programming constructs of Python to develop web enabled application [Usage]

CO5: Configure and use Apache web servers and open source software tools, model driven architecture tools [Assessment]

UNIT I INTRODUCTION TO LINUX (9) Introduction to GNU/Linux and basics: Linux distributions — File System Introduction —

File System Hierarchies— File system security with reference to SELinux —Types of partitions and mount options — RAID overview— Logical Volume Management

UNIT II WORKING WITH LINUX (9)

Using GNU/Linux (Shell Commands): Overview of Shells – BASH and other important shells — Process Management— User Administration— Networking overview and

commands —Introduction to IO redirection— Software Repositories

UNIT III PHP AND MYSQL (9) PHP: Introduction- Programming in Web Environment- Variables- Constants- Data types-

Operators - Statements-Functions- Arrays- OOP - String manipulation and regular expression- MySQL: Introduction – Setting up account – Starting, terminating and writing your own SQL programs – Record selection Technology – Working with strings – Date and

Time

UNIT IV PYTHON PROGRAMMING (9)

Syntax and Style – Python Objects – Numbers – Sequences – Strings – Lists and Tuples – Dictionaries – Conditionals and Loops – Files – Input and Output – Errors and Exceptions –

Functions – Modules – Classes and OOP– Execution Environment.

UNIT V OPEN SOURCE TOOLS AND TECHNOLOGIES (9)

Web Server: Apache Web server – Working with Web server – Configuring and using Apache Web services – OpenSource Software tools and processors – Eclipse IDE platform – Compilers – Model Driven Architecture tools.


Text Books

1 N. B. Venkateshwarlu , ―Introduction to Linux Installation and Programming‖ (Ed); B S Publishers; Hyderabad, 2005.(An NRCFOSS Publication)

2 RasmusLerdorf and Levin Tatroe, ―Programming PHP‖, O’ Reilly Publications, USA 2002.

3 Peter Wainwright, ―Professional Apache‖, Wrox Press, USA, 2002.

Reference Books

1 The Linux Cookbook: Tips and Techniques for Everyday Use, First Edition, Michael Stutz, 2001.URL:http:// dsl.org/cookbook/cookbook_toc.html

2 The Linux System Administrator’s Guide, http://tldp.org/LDP/sag/html/sag.html 3 The Software-RAID HOWTO, JakobØstergaard,

http://www.tldp.org/HOWTO/Software-RAID-HOWTO.html

4 The Network Administrators’ Guide,OlafKirch, http://tldp.org/LDP/nag/nag.html

12S6E3 PARALLEL COMPUTING

L T P C

3 0 0 3

PREREQUISITES :

12S404-Computer Architecture

12S3Z1-Engineering Mathematics-III


with:

Parallel processing terminologies ,Serial computation model, PARAM model of

Parallel computation and Flynn‟s taxonomy

Writing parallel algorithms using parallel programming languages, map and

schedule UMA multiprocessor

Sequential matrix multiplication and solve linear systems using Fourier

transformation

Sorting, merging and searching techniques for dictionary operations

Connected components, shortest path graph algorithms, problem solving techniques

and combinatorial search algorithms

COURSE OUTCOMES:Upon completion of this course the students will be able to:

CO1: Describe the basic parallel processing terminologies and highlights the difference between control parallelism and data parallelism [Familiarity] CO2: Describe parallel algorithms like parallel reduction, prefix sum for PRAM

[Familiarity] CO3: Explain the three basic parallel architectures such as processor arrays,

Multiprocessor and multicomputer [Familiarity] CO4: List features of six imperative programming languages such as FORTRAN 90, SEQUENT C etc. and describe both low level and high level languages. [Assessment]

CO5: Describe three elementary parallel algorithms such as reduction, broadcast and prefix sums for. [Familiarity]

CO6:Discuss the parallel implementation of the matrix multiplication and the parallelization of fast Fourier transform [Assessment] CO7: Solve systems of linear equations by the parallelization of the algorithms like

back substitution and odd even reduction. [Usage] CO8:Illustrate the tradeoff between the complexity of sequential algorithms and

optimal use of processors. [Assessment]

CO9: Describe parallel graph algorithms like all pair shortest path and parallel algorithms for combinatorial search like parallel alpha beta search. [Familiarity]

UNITI INTRODUCTION, PRAM ALGORITHMS, PROCESSOR

ARRAYS, MULTIPROCESSORS,AND MULTICOMPUTERS (9)

Parallel processing terminology- the sieve of Eratosthenes-Model of serial computation-

PRAM model of parallel computation- PRAM algorithms- reducing number of processors- processor organizations, processor arrays, multiprocessors, multicomputers, Flynn’s

taxonomy, speedup, scaled speedup and parallelizability

UNIT II PARALLEL PROGRAMMING LANGUAGES, MAPPING AND

SCHEDULING, ELEMENTARY PARALLEL ALGORITHMS

(9)

Paradigms And Programmability - FORTRAN 90- SEQUENT C- n CUBE C- OCCAM- C

LINDA notation for expressing parallel algorithms- Mapping data to processors - dynamic load balancing on multi computers- static scheduling on UMA multiprocessors- deadlock- Classifying MIMD algorithms reduction- broadcast- prefix sums

UNIT III MATRIX MULTIPLICATION, FAST FOURIER TRANSFORM,

SOLVING LINEAR SYSTEMS (9)

Sequential matrix multiplication- algorithms for processor arrays, multiprocessors and

multicomputers -Discrete Fourier transform- fast Fourier transform. Back substitution- odd even reduction- Gaussian elimination. Jacobi algorithm- Gauss Seidel algorithm- Jacobi and

successive over relaxation- multigrid methods- conjugate gradient

UNIT IV SORTING AND DICTIONARY OPERATIONS (9) Enumeration sort- lower bounds on parallel sorting- odd even transposition sort- bitonic

merge- quicksort based algorithms-random read and random write-Complexity of parallel search- searching on multiprocessors.

UNIT V GRAPH ALGORITHMS AND COMBINATORIAL SEARCH (9)

Searching a graph- connected components- all pairs shortest path- single source shortest path- minimum cost spanning tree- Divide and conquer- branch and bound- parallel branch and bound algorithms- alphabeta search- parallel alpha beta search

LECTURE 45 TUTORIAL: 0 TOTAL : 45

Text Books

1 Michael J. Quinn, “Parallel computing-theory and practice”, second edition, Tata McGraw-Hill, 1994..

Reference Books

1 Kai Hwang, ZhiwelXu, “Scalable Parallel Computing”, McGraw-Hill International Editions, 1998.

2 Kai Hwang and Faye A.Briggs, “Computer architecture and Parallel processing”,

McGrawHill,1984

12S6E4 OPTIMIZATION TECHNIQUES AND APPLICATIONS


L T P C

3 0 0 3

PREREQUISITES :

12S401-Probability, Random Processes and Queueing Theory

12S505-Design and Analysis of Algorithms


with:

Operations research, LP formulations and solve linear programming problems using

various methods.

Usage of dynamic programming concepts, its approach in decision making problems

and sequencing models.

Applying different project management techniques to identify the Critical path in a

network.

Essential features, operating characteristics, probability distribution in queuing

systems and able to obtain the solutions for different queuing models.

Solutions for various inventory models using suitable methods

COURSE OUTCOMES- Upon completion of this course the students will be able to: CO 1: List phases of an OR project and classifies the problems in operations research [Familiarity]

CO2: Write algorithm to solve assignment problem using Hungarian method. [Usage] CO3: Apply dynamic programming approach to solve the decision making problems

like container loading, optimal subdivision problem [Usage] CO4: Solve integer linear programming problem like truck production problem, machine scheduling problem using simplex method and obtain an optimal solution

[Usage] CO5: Apply Johnson‟s algorithm for sequencing problems [Usage]

CO6: Describe PERT and CPM and apply PERT analysis [Usage] CO7: Compare the features, characteristics and classification of the queuing models [Assessment]

CO8: Analyze and solve the inventory problem [Assessment]

UNIT I (9) Introduction of operation research-LP Formulations-Graphical method for solving LP’s with

2 variables- Simplex method-Duality theory in linear programming and applications-Integer linear programming- Dual simplex method

UNIT II (9) Transportation problem- Assignment problem.Dynamic Programming : Basic Concepts,

Bellman’s optimality principles-Dynamics programming approach in decision making problems- optimal subdivision problem. Sequencing Models: Sequencing problem, Johnson’s Algorithm for processing n jobs through

2 machines, Algorithm for processing n jobs through 3 or more machines, Processing 2 jobs through n machines.

UNIT III (9)

Project Management : PERT and CPM : Project management origin and use of PERT-origin and use of CPM-Applications of PERT and CPM- Project Network, Diagram representation-

Critical path calculation by network analysis and critical path method (CPM)- Determination of floats- Construction of time chart and resource labelling- Project cost curve and crashing in project management-Project Evaluation and review Technique (PERT).

UNIT IV (9)

Queuing Models : Essential features of queuing systems-operating characteristics of queuing system- probability distribution in queuing systems-classification of queuing models and its

solutions.

UNIT V

(9)

Inventory Models : Introduction to the inventory problem-Deterministic Models-The classical

EOQ (Economic Order Quantity) model- Inventory models with deterministe demands(no shortage & shortage allowed)-Inventory models with probabilistic demand-multi item determinise models.


Text Books

1 Billy E.Gillett.:‖ Introduction to Operation Research: A Computer Oriented Algorithmic approach‖, - Tata McGraw Hill Publising Co. Ltd. New Delhi, 1976

Reference Books

1 P.K. Gupta & D.S. Hira, ―Operations Research‖, S.Chand& Co, 1979 2 J.K. Sharma, ―Operations Research: Theory and Applications‖, Fourth edition, Mac

Millan publishers, 2009

3 S.D. Sharma, ―Operations Research‖, KedarNath Ram Nath& company, 1992. 4 S.S. Rao ―Optimization: Theory and Application‖, John wiley& son.

5 HamdyA.Taha ―Operations Research - An Introduction‖, eighth Edition, Pearson education, 2009.

12S6I1 INFORMATION STORAGE AND MANAGEMENT


L T P C

3 0 0 3

PREREQUISITES :

12I404 -Computer Architecture


with:

1. Different types of Information Storage Systems 2. The architecture of Storage Networking Technologies and Virtualization concepts

3. Backup and recovery techniques 4. Information security attributes and Storage Management standards

5. EMC Unisphere or FreeNAS Simulator


CO1:Identify the elements of data center infrastructure[Familiarity]

CO2: Explain the architecture, components and topologies of storage networking technologies. [Familiarity] CO3: Explain the Server virtualization techniques such as LVM –based virtualization,

Memory virtualization, Virtual machine, and Hypervisor[Familiarity] CO4: List out the cloud services and issues.[Familiarity]

CO5: Identify single point of failure in storage infrastructure and provide appropriate backup and recovery solutions. [Usage]

CO6: Analyze the security threats in Information systems. [Usage]

CO7: Analyze Protocols and performance of network attached storage using EMC Unisphere or FreeNAS Simulator[Usage]

UNIT I Storage Systems (9)

Review the amount of information being created and understand the value of information to a

business-Identification of Data Center infrastructure elements and their requirements –Role

of ILM strategy – Physical and logical components of hosts, connectivity, and storage – Disk

Drive architecture and performance – Concept of RAID and different levels ( RAID 0 , 1, 3,

5, 0+1/1+0) and intelligent Storage System (ISS) and its components – Implementation of

ISS as high – end and midrange storage arrays.

UNIT II Storage Networking Technologies and Virtualization (9) Implementation of DAS and overview of SCSI – Architecture, components, and topologies of FC-SAN, NAS, Unified Storage - Object based storage system CAS and its application as

long-term archiving solution – Overview of emerging technologies such as Cloud Storage, Virtual provisioning, FAST.Virtualization: Server Virtualization (LVM –based virtualization,

Memory virtualization, Virtual Machine, and Hypervisor), Network (VLAN and VSAN), Storage (Disk virtualization, RAID, LUN masking, File and block level virtualization, Virtual provisioning).Cloud Computing: Definition- cloud computing – cloud services ( SaaS, PaaS,

and IaaS) – cloud concerns and implementations.

UNIT III Business Continuity (9) Concept of information availability and its measurement – Causes and consequences of

downtime – Defining RTO and RPO – Identifying single points of failure in a storage infrastructure and solutions for its mitigation – backup/recovery purposes and considerations – Architecture and different backup/recovery topologies – Local replication technologies and

their operation – Remote replication technologies and their operation – Overview of emerging technologies like de duplication, offsite backup, Continuous data protection

technology (CDP).

UNIT IV Storage Security and Management (9) Definition- information security – Critical security attributes for information systems –

Defining storage security domains – Listing and analyzing the common threats in each domain – Identifying key parameters and components to monitor in a storage infrastructure – key management activities and examples – Defining storage management standards and

initiative, Industry trend.

UNIT V: Lab using EMC Unisphere (Simulator) or FreeNAS (9) Introduction to Storage – Overview of RAID – Overview of LUNs- Overview of Network-

Attached Storage-Analyze Protocols and Performance of Network attached Storage-Analyze Protocols and performance of network attached storage-Overview of iSCSI-Backup and

Recovery-Identifying Security Vulnerabilities- Securing the storage Infrastructure- Managing the Storage Infrastructure


Reference Books

1 ―Information Storage and Management ―, Wiley India, EMC Corporation, 9788126521470.

2 Learning aids on https://education.emc.com/ISMbook.

https://education.emc.com/ISMbook

12S7E0 HIGH PERFORMANCE ARCHITECTURE


L T P C

3 0 0 3

PREREQUISITES :

12S404 -Computer Architecture


with:

Scalability of computer architecture and clustering design principles.

Development of memory and cache memory.

Network topologies, switches and synchronization of networks.

Parallel programming paradigms, models and shared memory programming.

Message passing programming.

COURSE OUTCOMES-At the end of the course, students will be able to

CO1:Elaborate the parallel computing models and issues in parallelism. [Familiarity]

CO2: Explainthe development of cache memory and its issues. [Familiarity]

CO3: Analyze network topologies and synchronization mechanism needed for developing High Performance Architecture. [Assessment] CO4: Examine parallel programming models like shared memory and message passing.

[Assessment] CO5: Develop programs using message passing interface. [Usage]

UNIT I SCALABILITY AND CLUSTERING (9)

Evolution of computer architecture ― Dimensions of scalability ― Parallel computer models –

Basic concepts of clustering ― Scalable design principles ― Parallel programming overview ―

Processes ― Tasks and threads ― Parallelism issues ― Interaction / Communication issues ―

Semantic issues in parallel programs.

UNIT II ENABLING TECHNOLOGIES (9) System development trends ― Principles of processor design ― Microprocessor architecture families ― Hierarchical memory technology ― Cache coherence protocols ― Shared memory

consistency ― Distributed cache memory architecture ― Latency tolerance techniques ― Multithreaded latency hiding.

UNIT III SYSTEM INTERCONNECTS (9)

Basics of interconnection networks ― Network topologies and properties ― Buses ― Crossbar

and multistage switches ― Software multithreading ― Synchronization mechanisms.

UNIT IV PARALLEL PROGRAMMING (9) Paradigms and programmability ― Parallel programming models ― Shared memory

programming.

UNIT V MESSAGE PASSING PROGRAMMING (9) Message passing paradigm ― Message passing interface ― Parallel virtual machine.


Text Book

1 Kai Hwang, Zhi.WeiXu, “Scalable Parallel Computing: Technology, Architecture,

Programming”, Tata McGraw-Hill, 1998.

2 Culler, D.E., Jaswinder Pal Singh, “Parallel Computing Architecture: A Hardware/

Software Approach”, Morgan Kaufman Publishers, 1999

Reference Books

1 Quinn, M. J., “Parallel Programming in C with MPI and OpenMP”, Tata McGraw-

Hill, 2003 2 Kai Hwang, “Advanced Computer Architecture”, Tata McGraw-Hill, second edition,

2010.

12S7E1 XML AND WEB SERVICES


L T P C

PREREQUISITES: 3 0 0 3

12S503- Web Technology


with:

Basics of XML, creating XML schemas and validating XML.

Transformation, integration and formatting of XML for WEB.

Web services using SOAP, WSDL and UDDI.

Applications of XML.

Architecture of semantic web and RDF


CO1: Create and validate XML schema for an application. [Assessment]

CO2: Develop Web application using XML with DOM,SAX and XSL. [Assessment] CO3: Examine the building blocks of web services .[ Familiarity]

CO4: Explore the use of XML for e-business, wireless and voice services. [Familiarity] CO5: Design and represent ontology using RDF. [Assessment]

UNIT I ESSENTIALS OF XML (9)

XML in Context – Fundamentals of XML – Validating XML with DTD – Creating XML

schemas – Xfiles – Defining XML using alternate schema representation.

UNIT II BUILDING XML BASED APPLICATIONS (9) Parsing XML using DOM, SAX – Transforming XML with XSL – Integrating XML with

databases – Formatting XML for the web – XML and content management.

UNIT III WEB SERVICES (9) Architecting web services – Web services building blocks: Simple Object Access Protocol,

Web Services Description language, Universal Description Discovery and Integration.

UNIT IV APPLIED XML (9)

Understanding XML standards – Implementing XML in E-Business – Delivering wireless and voice services with XML.

UNIT V SEMANTIC WEB (9) Basics of Resource Description Framework – RDF specifications and Data Model - RDF

schema – Precursor of Semantic web - Architecture of semantic web.


Text Book

1 Ron Schmelzer et al. “XML and Web Services”, Pearson Education, 2008.

Reference Books

1 Frank P. Coyle, “XML, Web Services and Data revolution”, Pearson Education, 2002.

2 Keith Ballinger,“. NET Web Services Architecture and Implementation”, Pearson Education, 2003.

3 David Chappell, “Understanding .NET A Tutorial and Analysis”, Pearson Education, 2002.

4 Kennard Scibner, Mark C.Stiver,“Understanding SOAP”, SAMS publishing, 2000.

5 Alexander Nakhimovsky, Tom Myers, “XML Programming: Web Applications and Web Services with JSPand ASP”, Apress, 2002.

12S7E2 GENETIC ALGORITHMS AND SWARM INTELLIGENCE

L T P C

3 0 0 3


with:

Basic concepts of Genetic algorithms.

Advanced operators and technique used in GA and multiobjective optimization concepts.

Uses of Genetic algorithms in classifier system and other applications.

Particle swarm optimization and its variants.

Particle swarm optimization for real time applications .


CO1: Solve optimization problems using simple genetic algorithms. [Assessment] CO2: Analyse and Apply advanced operators like inversion and reordering for multi objective optimization. [Usage]

CO3: Apply genetic algorithms in classifiers and real time applications. [Usage] CO4:Develop solution for optimization problem using particle swarm optimization.

[Assessment] CO5: Analyse and apply particle swarm optimization for Human Tremor Classification. [Usage]

UNIT I INTRODUCTION TO GENETIC ALGORITHMS (9) Genetic algorithms-Goals of optimization-Genetic algorithms different from traditional methods-Mathematical foundations: The fundamental theorem- Two armed and k-armed

bandit problem-Building block hypothesis-Minimal deceptive problem, Computer Implementation: Data structures- Reproduction, crossover and mutation- Mapping objective functions to fitness form-Fitness scaling- Codings- Discretization- Constraints.

UNIT II ADVANCED OPERATORS AND TECHNIQUES IN GENETIC

SEARCH (9)

Dominance, Diploidy and Abeyance-Inversion and other reordering operators-Other micro

operators-Niche and speciation-Multiobjective optimization-Knowledge based techniques-

Genetic algorithms and parallel processors.

UNIT III GENETICS BASED MACHINE LEARNING AND

APPLICATIONS

(9)

Genetics based machine learning-Classifier system-Rule and message system-Apportionment of credit-Genetic Algorithm-Simple classifier system in pascal - Rise of genetic algorithms-Genetic algorithm applications- De Jong and function optimization -Improvements in basic

technique-Current applications of Genetic algorithms.

UNIT IV PARTICLE SWARM AND COLLECTIVE INTELLIGENCE (9)

The particle swarm – Sociocognitive Underpinnings – A model of binary decision – The

particle swarm in continuous numbers – Hybrid particle swarm – Science as collaborative

search – Emergent culture – Immergent intelligence – Variations and comparisons.

UNIT V APPLICATIONS (9)

Evolving neural networks with particle swarm – Human tremor analysis – Other applications.


Text Books

1 David E. Goldberg, “ Genetic Algorithms in Search, Optimization , and Machine

Learning” ,Pearson education, 1989.

2 Kennedy J, Russel C Eberhart, “Swarm Intelligence”, Morgan Kaufmann Publishers, 2001.

Reference Books

1 Melanie Mitchell, “An Introduction To Genetic Algorithms”, MIT press, 1998.

12S7E3 DIGITAL IMAGE PROCESSING


L T P C

3 0 0 3

PREREQUISITES:

12S2Z2 - Engineering Mathematics - II

12S605 - Fundamentals of Digital Signal Processing


with:

Fundamentals of digital image processing and transformation techniques.

Performing image enhancement using frequency and spatial domain techniques.

Different kinds of redundancy and image compression techniques.

Segmentation methods used in image processing.

Degradation, restoration and representation of images

COURSE OUTCOMES-Upon completion of this course the student will be able to

CO1: Analyze and apply image transforms like FFT, DCT, Walsh, Hadamard, Haar,

Slant, Hotelling transforms for images. [Usage]

CO2: Enhance the quality of images using frequency and spatial domain techniques.

[Assessment]

CO3: Apply Lossy and lossless image compression techniques for digital images. [Familiarity]

CO4: Perform edge detection and segmentation. [Assessment]

CO5: Identify the degrading, modeling and restoring the image [Assessment]

CO6: Represent image using chain codes, linear signature, shape number, Fourier, moments, regional, texture, relational descriptors. [Assessment]

UNIT I FUNDAMENTALS OF DIGITAL IMAGE PROCESSING (9)

Introduction – Fundamental Steps in image processing – Building blocks of Digital Image Processing systems – Image Acquisition, Storage, Processing, Display and Communication Interface, Digital Image Representation – Sampling and Quantization – Some Basic

Relationships between pixels – Neighbors and Connectivity, Distance Measures, Image Transform – Fourier Transform – Discrete Fourier Transform – Some properties of Fourier

Transform – Fast Fourier transform – FFT Algorithm, Inverse FFT, DCT – Properties, Walsh Transform, Hadamard Transform, Haar Transform, Slant Transform, Hotelling Transform.

UNIT II IMAGE ENHANCEMENT (9)

Introduction – Spatial and frequency domain approaches – Frequency domain Techniques – Spatial domain Techniques, Spatial Filtering, Frequency domain – Gray Level to Color Transform.

UNIT III IMAGE COMPRESSION (9) Introduction – Coding Redundancy, Inter pixel redundancy, Psycho Visual redundancy,

Image compression models, The source Encoder and Decoder, The channel Encoder and Decoder, Information Theory, Classification, Huffman coding, Lossy compression

Techniques, Threshold coding, Vector quantization, Image compression standard (JPEG).

UNIT IV IMAGE SEGMENTATION (9) Introduction, Detection of isolated points, Line detection, Edge detection, Edge linking and

Boundary detection, Region oriented segmentation, Segmentation using threshold, Accumulative difference image.

UNIT V IMAGE RESTORATION, REPRESENTATION AND

DESCRIPTION

(9)

Introduction: Degradation model, Degradation model for continuous functions, Discrete Degradation Model, Estimation of Degradation function by experimentation and modeling,

Inverse filtering approach, LMS filter, Interactive Restoration, Constrained Least Square Restoration, Boundary Representation using chain codes, Linear Signature, Shape number, Fourier descriptors, Moments Region representation, Regional descriptor, Texture, Relational

Descriptors.


Text Books

1 Annadurai. S, Shanmugalakshmi. R, “Fundamentals of Digital Image Processing”,

Pearson Education (Singapore) Pvt. Ltd., 2007.

Reference Books

1 Rafael C. Gonzalez and Richard E. Woods, ―Digital Image Processing”, Third Edition, Pearson Education, 2008

2 S. Sridhar, “Digital Image Processing”, OXFORD University press, 2011 3 Madhuri A Joshi , “ Digital Image Processing: an algorithm approach”, PHI ,2006

12S7E4 GRID COMPUTING


L T P C

3 0 0 3

PREREQUISITES:

12S602 - Distributed computing


with:

Building block of grid and its evolution.

Grid architecture and its relationship with other technologies.

Open Grid Service Architecture.

Grid infrastructure with its protocols.

Analyzing toolkits used for developing Grid services.

COURSE OUTCOMES-Upon completion of this course the student will be able to

CO1: Explain the evolution of grid computing, its building blocks and application. [Familiarity]

CO2: Describe the grid architecture and its relationship with other technologies. [Assessment] CO3: Examine the use of Open Grid Service Architecture for e-science

application.[Usage] CO4: Implement GRAMprotocol, GFTP, file transfer and information service protocol.

[Usage] CO5: Develop grid services using Globus toolkit. [Assessment]

UNIT I THE GRID PAST, PRESENT AND FUTURE (9)

Definition of Grid – Building blocks of the Grid – Grid Applications – Grids on the Horizon – Evolution of the Grid – First Generation – Second Generation – Third Generation.

UNIT II GRID ARCHITECTURE AND TECHNOLOGIES (9)

Virtual organizations and the Grid – The Nature of Grid Architecture – Grid Architecture description – Grid Architecture in practice – the need for inter grid protocols – Relationship with other technologies – Implementing Grid Architecture – other perspectives on Grids.

UNIT III OPEN GRID SERVICE ARCHITECTURE (9) Introduction –Service oriented Grid Architecture - Significance of data for e-Science - Building on an OGSA platform – OGSA Services and Schema - Issues with OGSA – OGSA

Implementation - .OGSI - Grid Service – Using OGSA Mechanism to build VO structures

UNIT IV GRID PROTOCOLS (9) Grid Security Infrastructure – Grid Resource Allocation and Management Protocol – Grid

File Transfer Protocol – Grid Information Service Protocol

UNIT V GRID COMPUTING TOOLKITS (9) Globus Tool Kit 4 Architecture, Programming Model – Globus High Level Services GSI..Net

– Programming Model.


Text Books

1 Fran Berman, Geoffrey Fox and Tony Hey,”Grid Computing – Making the Global

Infrastructure a Reality‖, Wiley India, 2003. 2 Ian Foster and Carl Kesselman,‖The Grid 2 – Blue Print for a New Computing

Infrastructure‖, Morgan Kaufmann Publisher, 2004.

Reference Books

1 Joshy Joseph and Craig Fellenstein , “Grid Computing‖, Pearson Education, 2004

2 Ahmar Abbas, ” Grid Computing: A Practical Guide to Technology and

Applications”, Charles River Media, 2004

12S7E5 COMPONENT BASED TECHNIQUES


L T P C

3 0 0 3

PREREQUISITES :


12S501 - Object Oriented Analysis and Design

COURSE OBJECTIVES-Upon completion of this course the students will be Familiar with:

Basic terms and concepts of components based techniques.

Creation and usage of java based components.

Developing CORBA applications.

.Net based component technology.

COM frameworks for software development

COURSE OUTCOMES- Upon the end of the course, students will be able to:

CO1: Explain thebasic concepts and architecture of components based techniques. [Familiarity]

CO2: Create and use java based components. [Assessment] CO3: Develop CORBA Compliance application. [Assessment]

CO4: Develop software components using Component Object model (COM) and its services. [Assessment] CO5: Examine and use the COM frameworks for software development. [Usage]

UNIT I INTRODUCTION (9) Introduction – Standards – Terms and Concepts – Standardization and Normalization – Components and Interfaces – Callbacks – Contracts – Examples – Self interference and Object

reentrance – Polymorphism – Object vs. class composition– Patterns, Frameworks and architectures.

UNIT II JAVA BASED COMPONENT TECHNOLOGIES (9)

Java Beans – Java Services – Beans and Enterprise Beans – Advanced Java Services – Interfaces vs Classes in java - JXTA and Jini – Java and Web services.

UNIT III CORBA (9)

Object and component ―wiring‖ standards – CORBA – The object request broker – CORBA Services – CORBA Component Model – Portable object Adapter – CCM Components, Containers – CORBA Complaint implementations – CORBA facilities– Application objects –CORBA, UML,

XML and MDA.

UNIT IV NET BASED COMPONENT TECHNOLOGIES (9) COM - Object reuse - Interfaces and Polymorphism – COM object creation and COM Library –

initializing objects, persistence, structural storage, monikers – From COM to distributed COM -Meta- information and Automation – Other COM services- OLE containers and servers - Active X

controls - Contextual Composition and Services - .NET framework -.NET components -Assemblies - Common language Frameworks.

UNIT V COM OVERVIEW AND COMPONENT FRAMEWORKS

Component Architecture - Component Frameworks: Contribution of contextual component frameworks - Frameworks for contextual composition - Black box component framework - Black box and OLE - Portos - Component Development: Component oriented programming - Tools -

Component Distribution and Acquisition - Component Assembly.


1 Clemens Szyperski, DominikGruntz and Stephen Murer, ―Component Software:

BeyondObject-OrientedProgramming‖, Pearson Education publishers, second edition, 2002.

Reference Books 1 Ed Roman, ―Mastering Enterprise Java Beans‖, John Wiley & Sons Inc., Third edition,

2005 2 Thomas J Mowbray, William A Ruh―Inside CORBA‖, Pearson Education, 1997 3 Wayne S. Freeze, ―Visual Basic Development Guide for COM & COM+‖, SybexIncn,

1999 4 Hortsamann, Cornell, “CORE JAVA Vol-II” Sun Press, Eight edition, 2008.

12S7E6 PC HARDWARE AND TROUBLESHOOTING

L T P C

3 0 0 3

PREREQUISITES :

12S304 - Analog and Digital Communication

12S404 - Computer architecture

COURSE OBJECTIVES Upon completion of this course the students will be familiar with:

Components and configurations of PC.

Functional and physical architecture of motherboards.

Basics of Memories and storage devices.

Interconnecting a PC with I/O peripherals.

Assemblance, maintenance and troubleshooting a computer system.


CO1: Differentiate PC components and resolve resource conflicts. [Assessment] CO2: Upgrade motherboard and configure CMOS and BIOS setup. [Familiarity] CO3: Examine the evolutions of memories and their organizations. [Usage]

CO4: Interface of I/O peripherals and plug and play devices.[Usage] CO5: Assemble, maintain and troubleshoot the PC. [Assessment]

UNIT I INTRODUCTION TO PC (9) Introduction to PC: Types–System components. Processor: Processor specifications – Modes –

Features – Manufacturing– Physical packaging – Multi Core Processors – Processor Upgrades – Processor Troubleshooting Techniques. Motherboards and Buses: Motherboard form factors –Motherboard connectors - System Bus-Types Functions & Features - Types of I/O buses – System

resources - Resolving Resource Conflicts – Motherboard Selection Criteria-CPU essentials – processor modes – modern CPU concepts – Architectural performance features – the Intel’s CPU –

CPU over clocking – over clocking requirements – over clocking the system – over clocking the Intel processors

UNIT II MOTHERBOARDS (9)

Active motherboards – sockets and slots – Intel D850GB – Pentium4 mother board – expansion slots – form factor – upgrading a mother board – chipsets – north bridge – south bridge – CMOS – CMOS optimization tactics – configuring the standard CMOS setup – motherboard BIOS – POST

– BIOS features – BIOS and Boot sequences – BIOS shortcomings and compatibility issues – power supplies and power management – concepts of switching regulation – potential power

problems – power management.

UNIT III MEMORY AND STORAGE DEVICES (9) Essential memory concepts – memory organizations – memory packages – modules – logical

memory organizations – memory considerations – memory types – memory techniques – selecting and installing memory- The floppy drive – magnetic storage – magnetic recording principles –

data and disk organization – floppy drive – hard drive – data organization and hard drive – sector layout – IDE drive standard and features – Hard drive electronics – CD-ROM drive –

construction– CDROM electronics – DVD-ROM – DVD media – DVD drive and decoder.

UNIT IV I/O PERIPHERALS AND BUS ARCHITECTURE (9) Parallel port – signals and timing diagram – IEEE1284 modes – asynchronous communication -

serial port signals – video adapters – graphic accelerators – 3D graphics accelerator issues –

DirectX – mice – modems – keyboards – sound boards – audio bench marks - Buses – Industry

standard architecture (ISA), peripheral component Interconnect (PCI) – Accelerated Graphics port

(AGP) – plug-and-play devices – SCSI concepts – USB architecture.

UNIT V SYSTEM ASSEMBLING, MAINTENANCE AND TROUBLE SHOOTING

DevelopSystem Assembly – Motherboard Installation – Troubleshooting New Installations –

Installing the Operating Systems – PC Diagnostics – Diagnostics Software - PC Maintenance

Tools – Preventive Maintenance-Trouble Shooting PCS - Motherboards, CPU, monitor memory,

FDC, HDC, PC cards serials and parallel ports, preventive maintenance.


1 Scott Mueller, “Upgrading & Repairing PCs”, Pearson Education, 19th Edition, 2010.

2 Stephen J.Bigelow, “Trouble Shooting, maintaining and Repairing PCs”, Tata McGraw-Hill, New Delhi, 2001.

Reference Books 1 Michael Meyers, “Introduction to PC Hardware and Troubleshooting”, Tata McGraw-

Hill, New Delhi, 2003. 2 B.Govindarajulu, “IBM PC and Clones hardware trouble shooting and maintenance”,

Tata McGraw-Hill, New Delhi, second edition, 2002.

12S7E7 DATA WAREHOUSING AND DATA MINING


L T P C

3 0 0 3

PREREQUISITES :

12S403 - Database systems


Building data warehouse using data model, warehouse architecture and OLAP server.

Association mining techniques used for the development of efficient data mining system.

Classification and prediction methods.

Clustering the data using clustering techniques.

Concept of graph mining, text mining and multimedia data mining


CO1: Develop data warehouse using Star, snowflake, fact constellations schema and

OLAP concepts. [Assessment]

CO2: Transform data to normalized form and solve problems using association mining.

[Assessment] CO3: Apply classification techniques like decision tree induction, Bayesian classification, Rule based classification and back propagation to classify an unlabeled data. [Usage]

CO4: Apply model based clustering method and remove the irrelevant data using outlier analysis. [Usage]

CO5: Analyze graph mining, Multirelational data mining, spatial data mining and text mining and its applications. [Assessment]

UNIT I INTRODUCTION TO DATA WAREHOUSE (9)

Introduction- a multi dimensional data model – Data cube technology-Data warehouse architecture- Types of OLAP servers-Data warehouse implementation-Data warehousing to data mining.

UNIT II (9) Data mining – functionalities - Major issues - Data cleaning - Data integration and Transformation - Data reduction - Discretization and concept hierarchy generation-Efficient and scalable frequent

item set mining methods-Mining various kinds of association rules-Association mining to correlation analysis-Constraint based association mining

UNIT III CLASSIFICATION AND PREDICTION (9)

Introduction – Issues – Classification by decision tree induction - Bayesian classification- Rule based classification-Classification by back propagation- Other classification methods- Prediction-

Accuracy and error measures- Evaluating the accuracy.

UNIT IV CLUSTER ANALYSIS (9) Cluster analysis – Types of data – Partitioning methods – Hierarchical methods – Density based

methods-Grid based methods – Model based Clustering methods – Clustering High dimensional data – Constraint based cluster analysis – outlier analysis-Data mining Applications-Data mining system products-Additional themes on data mining.

UNIT V GRAPH MINING AND MULTIMEDIA MINING

Graph mining- Multirelational data mining-Multidimensional analysis and descriptive mining of complex data objects-Spatial data mining-Multimedia data mining-Text mining-Mining the world

wide web-Data mining applications.


1 Jiewei Han, MichelineKamber, “Data mining concepts and techniques”, Morgan

Kaufmann Pub, Third Edition, 2011. Reference Books

1 William H. Inmon, “Building the data ware house”, Wiley DreamtechPvt Ltd., Fourth Edition, 2005.

2 Ian H.Witten, Eibe Frank, “Data Mining: Practical M/c Learning tools and techniques with Javaimplementation”, Morgan Kaufmann Pub, Third Edition, 2011.

3 K.P.Soman,ShyamDiwakar,V.Ajay, “ Insight into Data Mining, theory and practice”, PHI

Pvt Ltd, 2006. 4 Ronen Feldman, James Sangee, “The Text Mining Handbook: Advanced Approaches in

analyzing unstructured data”, Cambridge University Press, 2007.

12S7E8 HIGH PERFORMANCE NETWORKS


L T P C

3 0 0 3

PREREQUISITES :

12S506 - Computer Networks

COURSE OBJECTIVES-Upon completion of this course, the students will be familiar with

Networking LAN standards and models.

ISDN architecture, services, interfaces and protocols.

Features, structure, working and application of ATM and frame relay.

Attain knowledge on advanced network architectures.

Optical networks, switching and modular switch designs

COURSE OUTCOMES-Upon completion of this course the students will be able to CO1: Analyze the applicability ofEthernet, Tokenring, WirelessLAN, FDDI network

topologies in framing networks. [Assessment] CO2: Describe ISDN architecture, services, interfaces and protocols. [Familiarity]

CO3: Explain Switching, transmission, congestion control features of ATM and frame relay, concepts. [Familiarity] CO4: Explain the Multi Protocol Label Switching (MPLS) and Resource Reservation

Protocol (RSP) schemes. [Familiarity] CO5: Explain the concept of modular switching in optical networks. [Familiarity]

UNIT I PACKET SWITCHED NETWORKS (9)

OSI and IP models, Ethernet (IEEE 802.3), Token ring (IEEE 802.5), Wireless LAN (IEEE 802.11) FDDI, DQDB, SMDS: Internetworking with SMDS

UNIT II ISDN AND BROADBAND ISDN (9)

ISDN - Overview, interfaces and functions, Layers and services - Signaling System 7 – Broadband ISDN architecture and Protocols

UNIT III ATM AND FRAME RELAY (9)

ATM: Main features -addressing, signaling and routing, ATM header structure-adaptation layer, management and control, ATM switching and transmission. Frame Relay: Protocols and

services, Congestion control, Internetworking with ATM, Internet and ATM, Frame relay via ATM.

UNIT IV ADVANCED NETWORK ARCHITECTURE (9)

IP forwarding architectures overlay model, Multi Protocol Label Switching (MPLS), integrated services in the Internet, Resource Reservation Protocol (RSVP), Differentiated services.

UNIT V OPTICAL NETWORKS AND SWITCHING (9) Optical links- WDM systems, cross-connects, optical LAN’s, optical paths and networks; TDS

and SDS: modular switch designs-Packet switching, distributed, shared, input and output buffers.


1 Jean Walrand and Pravinvaraiya ,‖High Performance Communication networks‖, Morgan

Kauffman Pub, 2nd Edition,2000. 2 SumitKasera, ―ATM Networks: Concepts and Protocols ―, Tata McGraw-Hill, New Delhi,

second edition, 2000.

Reference Books

1 William Stallings,‖ISDN and Broadband ISDN with Frame Relay and ATM”, , Pearson education, 4th Edition, 1999..

2 Leon Gracia, IndraWidjaja, “Communication networks: Fundamental Concepts and Key Architectures―,Tata McGraw-Hill, New Delhi, 2nd edition , 2006..

3 Rainer Handel, Manfred N.Huber, Stefan Schroder ,”ATM Networks:Concepts, Protocols,

Applications‖, Pearson education, 3rd Edition, 1999. 4 William Stallings,‖High-speed Networks and Internets”, Pearson education, 2nd

Edition,2002.

12S7E9 WIRELESSSENSOR NETWORKS


L T P C

3 0 0 3

PREREQUISITES :

12S506 - Computer Networks


with:

Gain basic knowledge on requirements, technologies and applications of sensor networks and differentiate sensor and mobile ad-hoc networks.

Acquire knowledge on Single-Node Architecture and Network Architecture

Learn about the MAC protocols used in networking of sensors.

Gain knowledge on topology and functioning of sensor network.

Gain knowledge on software and hardware platforms for establishing sensor.

COURSE OUTCOMES-Upon completion of this course, the students will be able to

CO1: Differentiatemobileadhocandsensor networks with respect to their characteristics

and technologies used .[ Assessment] CO2: Examine and analyze the performance ofSingle-Node and Network Architectures.[Usage]

CO3: Design and manage network of sensors using wireless networking protocols like Mediation Device protocol, addressing schemes and routing techniques. [Assessment]

CO4: Explain how topology, Clustering, Time Synchronizing, Localization and Positioning techniques are used to effectively establish the sensor network. [Assessment]

CO5: Simulate wireless sensor network usingNode-level Simulators and State-centric programming. [Assessment]

UNIT I OVERVIEW OF WIRELESS SENSOR NETWORKS (9)

Challenges for Wireless Sensor Networks-Characteristics requirements-required mechanisms, Difference between mobile ad-hoc and sensor networks, Applications of sensor networks-

Enabling Technologies for Wireless Sensor Networks.

UNIT II ARCHITECTURES (9) Single-Node Architecture - Hardware Components, Energy Consumption of Sensor Nodes ,

Operating Systems and Execution Environments, Network Architecture - Sensor Network Scenarios, Optimization Goals and Figures of Merit, Gateway Concepts

UNIT III NETWORKING OF SENSORS (9)

Physical Layer and Transceiver Design Considerations, MAC Protocols for Wireless Sensor Networks, Low Duty Cycle Protocols And Wakeup Concepts - S-MAC, The Mediation Device Protocol, Wakeup Radio Concepts, Address and Name Management, Assignment of

MAC Addresses, Routing Protocols- Energy-Efficient Routing, Geographic Routing.

UNIT IV INFRASTRUCTURE ESTABLISHMENT (9) Topology Control, Clustering, Time Synchronization, Localization and Positioning, Sensor

Tasking and Control.

UNIT V SENSOR NETWORK PLATFORMS AND TOOLS (9) Operating Systems for Wireless Sensor Networks, Sensor Node Hardware-Berkeley Motes,

Programming Challenges, Node- level software platforms, Node-level Simulators, State-centric programming.


1 Holger Karl, Andreas Willig, ― Protocols And Architectures for Wireless Sensor Networks” , John Wiley, 2005.

Reference Books

1 Feng Zhao & Leonidas J. Guibas, “Wireless Sensor Networks- An Information

Processing Approach”, Elsevier-Morgan Kaufmann, 2004. 2 KazemSohraby, Daniel ivlinoli, &TaiebZnati, “Wireless Sensor Networks-Technology,

Protocols, And Applications”, John Wiley, 2007.

3 Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003. 4 BhaskarKrishnamachari, “Networking Wireless Sensors”, Cambridge Press, 2005.

12S7I2 ENTERPRISE INFRASTRUCTURE MANAGEMENT


L T P C

3 0 0 3


with:

Basics of tiered architecture, technology and common network services.

Basic knowledge on desktop operating systems.

Concepts on Server operating systems.

Event Management and monitoring of components.

Basics of IT security and service management

COURSE OUTCOMES-Upon completion of this course, the students will be able to

CO1: Analyze the tiered architecture, technology and common network services. [Assessment]

CO2: Configure and manage windows 7 OS, establish LAN connectivity and troubleshoot [Assessment]

CO3: Manage windows server Os(2008&2012), perform device/disk management, configure firewalls, backup and restore the system. [Usage]

CO4: Examine the enterprise infrastructure, event management and monitoring of

components. [Assessment]

CO5: Analyze the security concepts and maintain a secured network. [Assessment]

UNIT I OVERVIEW OF ENTERPRISE INFRASTRUCTURE

MANAGEMENT

(9)

Enterprise Infrastructure Management - Big Picture - Service Components & Structure -

Technical and business Services, Case Study introduction.

Introduction to Tiered Architecture & Technology: Client Server Model, 3-tier Architecture

(presentation tier, Application Tier and & Data Tier) - Common Network Services: Network File System, Print, DHCP, DNS, Directory, Internet Hosting Services..

UNIT II DESKTOP OPERATING SYSTEM BASICS (9)

Introduction to Desktop operating systems - Configuring and Managing the Windows 7 Desktop - Windows 7 Networking and LAN Connectivity - Windows 7 in the Workgroup

Environment - Implementing Windows 7 Remote Capabilities and Utilities - Working with the Windows 7 NTFS File System and Its Features - Implementing Windows 7 Local, Network and Internet Security – Troubleshooting.

UNIT III SERVER OPERATING SYSTEM BASICS (WINDOWS 2008 &

2012) (9)

Introduction to Windows Server OS , versions & Licensing options, Windows 2008

Installation, Disk Management in 2008/2012, Device Management, Network Configura tion

and Windows Firewall, Sharing and Security, Remote Administration, Windows Networking Concepts (DHCP/DNS/IIS) concepts, Active Directory concept, User & Group & Printer

Administration, Backup & Restore, Performance Monitoring & Alerts.

UNIT IV ENTERPRISE INFRASTRUCTURE MANAGEMENT AND

MONITORING

(9)

Introduction to Event Management: Objectives and Scope of Event Management - Definitions : Service, Service Operation, SLM, SLA, OLA, UC- IT Infrastructure and its

components: Monitoring of Components - Event Management Process: Events, Significance of Events - Interfacing processes - Introduction to Event Management Tools.

UNIT V IT SECURITY & SERVICE MANAGEMENT (9)

IT Security : Introduction to Security: General Security Concepts, Information Security,

Access Control and Authentication, Identifying Security & Attacks TCP/IP, Attacks and

Malicious Code - Network Infrastructure Security and Connectivity: Understanding

Infrastructure Security, Monitoring Network and Intrusion Detection - Maintaining a Secure

Network & System Hardening: Securing the Network Environment, Basics of Cryptography,

Understanding Security Policies and Procedures, Privilege Management, Practicals on

Security Tools.

Service Management: Introduction to ITIL, History, Benefits - Basic concepts: Service,

Service management, Definition of process, procedures, Roles, RACI, Function, Service Owner, Process Owner, CI, SLA, OLA, UC - Major Process: Incident, Problem, Change,

Request Fulfillment, Event Management Service Desk, SOP's and Work Instructions, Run through the Event management System, Mock user-SD interaction

LECTURE: 45 TUTORIAL: 0 TOTAL: 45 References:

Resource materials by Tata Consultancy Services.

12S8E0 SOFTWARE TESTING


L T P C

3 0 0 3

PREREQUISITES :

12S703 Software Engineering

COURSE OBJECTIVES: Upon completion of this course the students will be familiar

with:

Basics and goals of Software testing.

Types and levels of Software testing.

Testing of object oriented systems.

Open problem issues in testing.

Tools for testing management and automation


CO1: Apply testing principles to Blackbox and Whitebox testing. [Assessment]

CO2: Perform testing at the level of integration, Acceptance, internationalization and Adhoc testing [Assessment]

CO3: Apply testing activities that are conducted from the point where two components are integrated to the point where all system components work together.

[Assessment]

CO4: Explain how to apply software testing techniques for information system development. [Assessment]

CO5: Identify the needs of software test automation and define and develop a test tool to support test automation. [Assessment]


Principles of testing – Software development life cycle models – Types of testing: Black box testing and White box testing

UNIT II LEVELS OF TESTING (9)

Integration testing – System testing - acceptance testing - Performance testing – Internationalization testing –Adhoc testing.

UNIT III SPECIALIZED TESTING (9)

Testing of object oriented systems: Introduction, Primer on object oriented software, differences in OO testing; Usability and accessibility testing.

UNIT IV PEOPLE AND ORGANIZATIONAL ISSUES IN TESTING (9) People and organizational issues in testing: Perceptions and misconceptions about testing,

Comparison between testing and development functions, Career paths, Role of eco systems; Organization structures for testing teams: Dimensions, Single product and multi product

companies, effects of globalization, testing service and success factors.

UNIT V TEST MANAGEMENT AND AUTOMATION (9) Test Planning, management, execution and reporting – software test automation – test metrics and measurements. Case Study: Testing tools


Text Books

1 Test Planning, management, execution and reporting – software test automation – test metrics and measurements. Case Study: Testing tools

Reference Books

1 Sandeep Desai, AbhisekSrivastava, ―Software testing: A Practical approach‖, Prentice Hall of India, 2012. (Covering units I,III)

2 Ilene Burnstein, “Practical Software Testing”, Springer International Edition, 2003.

(Covering Unit V) 3 Ron Patton, ― Software Testing‖, Second Edition, Sams Publishing, Pearson

Education, 2004. (Covering Units I,III,V) 4 RenuRajani, Pradeep Oak, “Software Testing – Effective Methods, Tools and

Techniques‖, Tata McGraw Hill, 2003. (Covering Units I,V)

5 Aditya P. Mathur, “Foundations of Software Testing – Fundamental algorithms and techniques”, Dorling Kindersley (India) Pvt. Ltd., Pearson Education, 2011. (Covering

Units II, III)

12S8E1 FUZZY LOGIC AND NEURAL NETWORKS


L T P C

3 0 0 3

PREREQUISITES :

12S302 Discrete Mathematics

12S505 Design and Analysis of Algorithm


Basic knowledge of fuzzy sets and fuzzy logic.

About fuzzy arithmetic.

Neural network training algorithms.

Different neural network architectures and applications.

Applications of neural networks and fuzzy logic.


CO1: Explain the fuzzification and defuzzification methods. [Familiarity]

CO2: Apply extension principle to perform fuzzy number arithmetic operations. [Usage]

CO3: Solve linearly separable problems. [Usage]

CO4: Apply BPN training algorithm for paint quality inspection and data compression [Usage]

CO5: Discuss the features of self organizing maps and its applications.[Familiarity]

CO6: Apply neural network for image compression. [Usage]

CO7: Apply fuzzy logic for pattern recognition [Usage]

UNIT I FUZZY LOGIC (9)

Introduction-Fuzzy Sets-Fuzzy Relations-Fuzzyfication and defuzzzyfication methods.

UNIT II FUZZY ARITHMETICS (9)

Fuzzy arithmetic, Vectors, Extension principle-Fuzzy rule based system-linguistic hedges-

Approximate Reasoning-Fuzzy optimization.

UNIT III INTRODUCTION TO NEURAL NETWORKS (9)

Introduction- Typical Architecture, Common Activation function ,McCulloch-pitts neuron,

Simple neural nets for pattern classification, Linear Separability-Learning Rules, Back Propagation Netwhitecture, Training algorithm-Applications.

UNIT IV TYPES OF NEURAL NETWORKS (9)

The BAM and Hopfield Memory-Simulated Annealing-The Counter propagation Network-Self Organizing Maps-Architecture, Algorithms and applications

UNIT V APPLICATIONS OF NEURAL NETWORK AND FUZZY LOGIC (9) Applications of Neural Networks: Pattern Recognition-Image Compression-Communication-

Control systems-Application of Fuzzy Logic: Fuzzy pattern Recognition-Fuzzy Image Compression-Fuzzy Logic controllers.


Text Books

1 Timothy J.Ross, “Fuzzy Logic with Engineering Applications”,3rd edition, McGraw Hill 2010. (Covering Units I, II, V)

2 James.A.Freeman and David.M.Skapura, “Neural Networks, Algorithms applications and Programming Techniques”, Pearson Education,1991. (Covering Units III, IV)

Reference Books

1 J.LaureneFausett,”Fundamentals of Neural Networks”, Pearson Education India, New

Delhi,2004. (Covering Units III, IV) 2 Zimmermann.H.J, “Fuzzy Set Theory and its Applications”, I Edition,Kluwer

Academic Publishers,Dordrecht,Germany,2001. (Covering Units I, II)

3 James J.Buckley and EsfandiarEslami,”Advances in Soft Computing-An Introduction to Fuzzy Logic andFuzzy Sets”, Springer Verlag Company, New Delhi,2002.(Covering Units I, II)

12S8E2 CLOUD COMPUTING


L T P C

3 0 0 3

PREREQUISITES :

12S602 Distributed Computing


Cloud architecture, advantages and disadvantages.

Service providers and their services of cloud computing.

Web-based application using cloud services.

Collaborating group projects using web tools.

Collaborating online using various communication tools.

Collaborating group projects using web tools.


CO1: Explain how cloud computing have evolved with their merits and demerits. [Assessment]

CO2: List anddescribe the various services offered by cloud. [ Familiarity]

CO3:Apply cloud computing services for collaborating schedules and group projects. [Usage]

CO4:Explain storing and sharing files in cloud services. [Assessment]

CO5: Articulate international collaborative learning using groupware to enhance e-

learning. [Usage]

CO6: Evaluate web conference tools [Assessment]

UNIT I UNDERSTANDING CLOUD COMPUTING (9)

Cloud Computing – History of Cloud Computing – Cloud Architecture – Cloud Storage – Why Cloud Computing Matters – Advantages of Cloud Computing – Disadvantages of Cloud Computing – Companies in the Cloud Today – Cloud Services

UNIT II DEVELOPING CLOUD SERVICES

(9)

Web-Based Application – Pros and Cons of Cloud Service Development – Types of Cloud Service Development – Software as a Service – Platform as a Service – Web Services – On-

Demand Computing – Discovering Cloud Services Development Services and Tools – Amazon Ec2 – Google App Engine – IBM Clouds.

UNIT III CLOUD COMPUTING FOR EVERYONE (9)

Centralizing Email Communications – Collaborating on Schedules – Collaborating on To-Do Lists – Collaborating Contact Lists – Cloud Computing for the Community – Collaborating

on Group Projects and Events – Cloud Computing for the Corporation.

UNIT IV USING CLOUD SERVICES (9)

Collaborating on Calendars, Schedules and Task Management – Exploring Online

Scheduling Applications – Exploring Online Planning and Task Management – Collaborating on Event Management – Collaborating on Contact Management – Collaborating on Project

Management – Collaborating on Word Processing - Collaborating on Databases – Storing and Sharing Files

UNIT V ADVANCED WAY TO COLLABORATE ONLINE (9)

Collaborating via Web-Based Communication Tools – Evaluating Web Mail Services – Evaluating Web Conference Tools – Collaborating via Social Networks and Groupware – Collaborating via Blogs and Wikis.


Text Books

1 Michael Miller, ―Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online”, Que Publishing, 2009.(Covering Units I – V)

Reference Books

1 Haley Beard, ―Cloud Computing Best Practices for Managing and Measuring Processes for On-demand Computing, Applications and Data centers in the Cloud with SLAs‖; 2nd edition, Emereo Pty Ltd,2009. (Covering Units III,IV)

12S8E3 SOFTWARE PROJECT MANAGEMENT

[Common to CSE&IT]

L T P C

3 0 0 3

PREREQUISITES :

12S703 Software Engineering


with:

Planning and various activities for project management.

Cost associated with a project.

Plan, schedule and monitor projects for the risk management.

Process of monitoring and controlling the software project.

Ways of managing the people and organizing the team


CO1: Identify the resources required for a online reservation project and producing a plan and work schedule. [Assessment]

CO2: Perform cost benefit analysis. [Assessment]

CO3: Categorize and prioritize actions for risk elimination or containment in a project planning model. [Assessment]

CO4: Monitor the progress of a project and assessing the risk of slippage and control changes to project requirements. [Assessment]

CO5: Explain the factors that influence people behavior in a project environment such

as selecting the right person for the right job. [Assessment]

UNIT I INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT (9)

Project Definition – Contract Management – Activities Covered by Software - Project

Management – Overview Of Project Planning – Stepwise Project Planning.

UNIT II PROJECT EVALUATION (9)

Strategic Assessment – Technical Assessment – Cost Benefit Analysis – Cash Flow

Forecasting – Cost Benefit Evaluation Techniques – Risk Evaluation. – software effort estimation.

UNIT III ACTIVITY PLANNING (9)

Objectives – Project Schedule – Sequencing and Scheduling Activities – Network Planning Models – Forward Pass – Backward Pass – Activity Float – Shortening Project Duration –

Activity on Arrow Networks – Risk Management – Nature Of Risk – Types Of Risk –

Managing Risk – Hazard Identification – Hazard Analysis – Risk Planning and Control

UNIT IV MONITORING AND CONTROL

(9)

Resource allocation - identifying and scheduling resources – Publishing resource and cost schedule – Scheduling sequence - Creating Framework – Collecting The Data – Visualizing

Progress – Cost Monitoring – Earned Value – Priortizing Monitoring – Getting Project Back To Target – Change Control – Managing Contracts – Introduction – Types Of Contract –

Stages In Contract Placement – Typical Terms Of A Contract – Contract Management – Acceptance.

UNIT V MANAGING PEOPLE AND ORGANIZING TEAMS (9)

Introduction – Understanding Behavior – Organizational Behaviour - Selecting The Right Person For The Job – Instruction In The Best Methods – Motivation – The Oldman – Hackman Job Characteristics Model – Working In Groups – Becoming A Team – Decision

Making – Leadership – Organizational Structures – Stress – Health And Safety – Case Studies.


Text Books

1 Bob Hughes, Mikecotterell, ―Software Project Management‖, Fifth Edition, Tata McGraw Hill, 2009.(Covering Units I – V)

Reference Books

1 Gopalaswamy Ramesh, ―Managing Global Software Projects‖, Tata McGraw Hill,

2006. (Covering Units I,II) 2 Walker Royce, ―Software Project Management‖, Pearson Education, 1999. (Covering

Unit –V). 3 PankajJalote, ―Software Project Management in Practice‖, Pearson Education, 2002.

(Covering Units III,IV, V)

4 Robert T. Futrell, Donald F. Shefer and Linda I. Shefer, ―Quality Software Project Management‖, Pearson Education, 2002. (Covering Unit III)

12S8E4 COMPUTER VISION


L T P C

3 0 0 3

PREREQUISITES : 12S504- Computer Graphics and Multimedia Systems


with:

Camera models and calibration.

Radiometry measuring light and shading model.

Linear filters, textures, edge detection and applications.

Geometry of multiple views.

Study the various segmentation methods and applications.

COURSE OUTCOMES-Upon the completion of this course, the student will be able to:

CO1: Apply the fundamental concepts of camera model and calibration to image

formation and image model [Assessment]

CO2: Explain the process of radiometry measuring light. [Usage]

CO3: Implement fundamental spatial filtering algorithms using convolution techniques.

[Usage]

CO4:Work with filters for finding pattern, edge detection and texture analysis.

[Familiarity]

CO5: Analyze the affine structure for motion [Usage]

CO6: Analyze the projective structure for motion. [Usage]

CO7: Discuss the segmentation by clustering techniques [Assessment]

CO8: Analyze problem of segmentation and fitting using probabilistic methods for vehicle tracking. [Usage]

UNIT I

(9)

Image Formation and Image Model: Cameras: Pinhole Cameras-Cameras with Lenses, Human Eye, Geometric Camera Models: Elements of Analytical Euclidean Geometry-

Camera Parameters and the Perspective Projection, Affine Cameras and Affine Projection Equations, Geometric Camera Calibration: Least Squares Parameter Estimation, A Linear

Approach to Camera Calibration, Taking Radial Distortion into Account.

UNIT II

(9)

Radiometry Measuring Light: Light in space, Light at Surfaces ,Important Special Cases,

Sources, Shadows and Shading: Qualitative Radiometry Sources and their effec ts, Local Shading Models, Color: The Physics of Color, Human Color Perception, Representing Color, A Model for Image Color, Surface Color from Image Color.

UNIT III (9) Linear Filters: Linear Filters and Convolution, Shift Invariant Linear System, Spatial

Frequency and Fourier Transforms, Sampling and Aliasing, Filters as Templates, Technique Normalizes Co- relation and Finding Pattern, Edge Detection: Noise, Estimating Derivatives,

Detecting Edges, Texture: Representing Texture, Analysis Using Oriented Pyramids, Application: Synthesizing Textures for Rendering, Shape From Texture

UNIT IV (9)

The Geometry of Multiple Views: Two Views, Three Views, More Views, Stereopsis: Reconstruction, Human Stereopsis, Binocular Fusion, sing More Camera, Affine Structure from Motion: Elements of Affine Geometry, Affine Structure and Motion from Two Images,

Affine Structure and Motion from Multiple Images, From Affine to Euclidean Images, Affine Motion Segmentation, Projective Structure from Motion: Elements of Projective Geometry,

Projective Structure and Motion from Binocular Correspondences, Projective Motion Estimation from Multi- linear Constraints.

UNIT V

(9)

Segmentation By Clustering: Human Vision: Grouping and Gestalt, Applications: short

Boundary detection and Background subtraction, Image Segmentation by Clustering Pixels, Segmentation By Graph- Theoretic Clustering, Segmentation By Fitting a Model: The Hough

Transform, Fitting Lines, fitting Curves, Segmentation and Fitting Using Probabilistic Methods: Missing Data Problems, Fitting and Segmentation, Tracking with linear dynamic models, Interference problem, kalman Filtering, Data Association, Application-Vehicle

Tracking..


1 David A.Forsyth, Jean Ponce, “Computer Vision A Modern Approach”, Prentice

Hall,2003.(Covering Units I-V)

Reference Books

1 Linda G. Shapiro, George C. Stockman ,“Computer Vision”,Published by Prentice Hall,2001. (Covering Units I,II)

2 Dana H. Ballard, Christopher M. Brown, “Computer Vision”, Prentice H, 1982. (Covering Units I, III, IV)

12S8E5 NANO TECHNOLOGY AND APPLICATIONS

L T P C

3 0 0 3

PREREQUISITES :

12S104- Materials Science

12S203- Engineering Physics


with:

Fundamental science of Nanotechnology and its applications to engineering,

biomedical, and environmental fields.

Interdisciplinary nature of the course and how the different basic sciences merge

into the field of Nanotechnology.

Background for the understanding, implementation, impact, future, and

implications of Nanotechnology.

Specific applications of nanotechnology in electronic devices, biomedical fields,

environmental solutions and energy production.


CO1: Determine the type of intermolecular forces that occur between molecules,

determine a molecule‟s polarizability, and estimate boiling points, vaporization temperature and solubility. [Assessment]

CO2: Analyze and critically evaluate ideas/information/data and apply relevant scientific principles to solve problems by creating hypotheses, testing theories and predictions, designing and carrying out experiments and analyzing reported data.

[Assessment] CO3: Identify the consequences of applying nanotechnologies to human health,

environment and society. [Assessment] CO4:Design and carry out experiments using both classical and novel science techniques and protocols [Assessment]

CO5: Generate a supportive, integrated learning community which provides the structure for scientific advancement. [Assessment]

CO6: Apply the concept of Nanotechnology in engineering, biomedical, energy, and environmental fields. [Usage]

UNIT I INTRODUCTION TO SOLID STATE PHENOMENON (9) Intermolecular Forces: Thermodynamics aspects - Quantum Mechanical Treatment of the

Many-Particle Problem - Potential Energy Surface - Pair Potential Approximation - Advantages and Limitations of the Pair Potential Approximation - Phenomenological Potentials - Pseudo-Potentials - Many-Body Potentials.

UNIT II FUNDAMENTALS OF NANOSCIENCE (9) Size dependence of properties - Particle size determination - Bulk to nano transition -

Semiconducting nanoparticles - Carbon nanostructures - Mechanical properties (hardness,

ductility, elasticity) - Optical properties of nanotubes - Electrical properties of nanotubes.

UNIT III PREPARATION OF NANOSYSTEMS (9)

Commercial and Agnostic design, Processing boundaries and control: Definition – Principle – measures – standards – design – risks – Case study.

UNIT IV STATELESSNESS, DISCOVERABILITY AND

COMPOSABILITY

(9)

Thermal Stability – Basic Material Properties – Mean Values and Correlation Funtion – X -

ray diffraction – Scanning Electron Microscopy – Scanning tunneling Microscopy – Electron

Microscopy - X-ray absorption spectroscopy – Photoelectron emission spectroscopy.

UNIT V NANO-ENGINEERING: APPLICATION (9)

Nanotubes, nanowires, nadnanodevices- introduction – Functional Nanostructures – Introduction to molecular electronics– Field emission and Shielding – Applications in computers – Applications in fuel cells – Applications in chemical sensors – Applications in

mechanical reinforcement – Microelectromechanical systems (MEMs) – Nanoelectromechanical systems (NEMs) – Molecular and Supramolecular Switches.


Text Books

1 Thomas Charles P.Poole and Frank J Owens, ―Introduction to Nanotechnology‖, John Wiley & sons, 2003.(Covering Units I,II).

2 P E J Flewitt, R K Wild, ― Physical Methods for Materials Characterization‖, 2nd Edition, Institute of Physics publishing, UK 2004. (Covering Unit III, IV)

3 Andrew N. Cleland,‖Foundation of Nanomechanics: From Solid-State Theory to

Device Application‖. Springer Verlog, (2002) (Covering Unit V)

Reference Books

1 B.C. Crandall, James Lewis , ―Nanotechnology:Research and perspectives‖, MIT Press, 1992. (Covering Unit V)

2 Gunter Gottstein, ―Physical Foundations of Material Science ‖, Springer Berlin Heidelberg, 2004. (Covering Unit I)

12S8E6 CRYPTOGRAPHY AND CRYPTANALYSIS

[Common to CSE & IT ]

L T P C

3 0 0 3

PREREQUISITES :

12S702 - Cryptography and Network Security


with:

Fundamentals concepts of number theory and cryptography.

Working principles of various symmetric encryption.

Public key cryptosystems.

Cryptanalysis techniques.

Complexity analysis of cryptanalysis techniques.


CO1: Perform encryption using classical encryption techniques such as Caesar cipher, playfair cipher, Hill cipher, row transposition. [Usage]

CO 2: Analyze the strength of DES, AES and Triple DES for encrypting data

[Assessment]

CO 3: Encrypt data using RSA and ECC algorithms. [Usage]

CO4: Compare the different cryptanalysis on algorithms like Monoalphabetic cipher, polyalphabetic ciphers, DES, RSA [Assessment]

CO5: Analyze the complexity of Brute force attack and improvise it using Genetic

Algorithms. [Assessment]

UNIT I INTRODUCTION TO CRYPTOGRAPHY (9)

Basic cryptographic Techniques: Classical encryption techniques, Stream Cipher, Block

Ciphers Shannon’s Theory. Modular Arithmetic - Euclidean Algorithm, Finite fields of the form GF(p) and GF(2n), Fermat’s and Euler’s theorem, Chinese remainder theorem, Discrete

Logarithms.

UNIT II SYMMETRIC ENCRYPTION

(9)

Fiestel Structure, Data encryption standard, Strength of DES, Avalanche effect, Modes of

operation, Advanced Encryption Standard, Triple DES, Confidentiality using Symmetric encryption.

UNIT III ASYMMETRIC ENCRYPTION

(9)

Asymmetric techniques: Public key Cryptosystem based on the Discrete Logarithm Problem, Algorithms for the Discrete Logarithm Problem, Public key cryptography- RSA, ECC.

UNIT IV CRYPTANALYSIS TECHNIQUES (9) Introduction to zero knowledge protocols, Brute Force Attack, Cryptanalysis of

Monoalphabetic and Polyalphabetic substitution ciphers – Linear and Differential cryptanalysis of DES, Attack on RSA, Birthday attacks.

UNIT V COMPLEXITY ANALYSIS (9)

Complexity analysis of Brute force and other cryptanalysis techniques. Reducing search space and complexity of cryptanalysis using Genetic algorithms.


Text Books

1 Douglas R. Stinson, Chapman & Hall/ CRC Press, ―Cryptography Theory and Practice‖, 3rd Edition 2005. (Covering Units I,II,III)

2 William Stallings,‖Cryptography and Network Security Principles and Practices ―, V Edition, Pearson, 2011. (Covering Units I,II, III, IV, V)

Reference Books

1 Wenbo Mao, “Modern Cryptography Theory and practice“, Pearson Education, 2004. (Covering Units I,II,III).

2 BruiceSchneier, “Applied Cryptography” ,John Wiley & sons, Second Edition, 2006. (Covering Units I,II,III)

12S8E7 SEMANTICWEB


L T P C

3 0 0 3

PRE-REQUISITES:

12S503 - Web Technology

12S7E7 - Data Warehousing And Data Mining


with:

Categories of ontologies.

Need and architecture of semantic web.

Languages for representing semantic web.

Ontology algorithm and evaluation.

Constructing ontology using different tools.

Potential applications of ontologies in web services.


CO1:Develop integrated, ontology-based or ontology-mediated, applications based on

knowledge level. [Assessment] CO2:Investigate foundational modeling aspects (such as core ontology‟s, characteristics of principal Relations, ontology design patterns). [Assessment]

CO3:Develop tools for ontology development. [Usage] CO4:Identify ontology-based data access and integration, combining rules with

ontology and computational linguistics. [Assessment] CO5:Apply fundamental concepts like importing and processing Ontology of the semantic web. [Assessment]

CO6:Create a case study of how Twittering was used to measure sentiment about the current elections in India. [Assessment]


Components – Types – Ontological Commitments – Ontological Categories –Philosophical Background - Knowledge Representation Ontologies – Top Level Ontologies – Linguistic

Ontologies – Domain Ontologies – Semantic Web – Need – Foundation – Layers – Architecture.

UNIT II LANGUAGES FOR SEMANTIC WEB AND ONTOLOGIES (9)

Web Documents in XML – RDF - Schema – Web Resource Description using RDF- RDF Properties – Topic Maps and RDF – Overview – Syntax Structure – Semantics – Pragmatics - Traditional Ontology Languages – LOOM- OKBC – OCML – Flogic Ontology Markup

Languages – SHOE – OIL - DAML + OIL- OWL

UNIT III ONTOLOGY LEARNING FOR SEMANTIC WEB (9)

Taxonomy for Ontology Learning – Layered Approach – Phases of Ontology Learning – Importing and Processing Ontologies and Documents – Ontology Learning Algorithms –

Evaluation

UNIT IV ONTOLOGY MANAGEMENT AND TOOLS

(9)

Overview – need for management – development process – target ontology – ontology

mapping – skills management system – ontological class – constraints – issues. Evolution – Development of Tools and Tool Suites – Ontology Merge Tools – Ontology based Annotation Tools.

UNIT V APPLICATIONS

(9)

Web Services – Semantic Web Services - Case Study for specific domain – Security issues – current trends.


Text Books

1 Asuncion Gomez-Perez, Oscar Corcho, Mariano Fernandez-Lopez, “Ontological Engineering: with examples from the areasof Knowledge Management, e-Commerce

and the Semantic Web” Springer, 2010 .(Covering Units I, II, III) 2 Grigoris Antoniou, Frank van Harmelen, “A Semantic Web Primer (Cooperative

Information Systems)”, The MIT Press, 2004 . (Covering Units IV, V)

Reference Books

1 Dieter Fensel, James Hendler, Henry Lieberman and Wolfgang Wahlster, Spinning the Semantic Web: Bringing the world wide web to its fullpotential. New Delhi: The MIT

Press, 2005. (Covering Unit I) 2 Shelley Powers, Practical RDF.1stEdition ,Mumbai: O’reilly publishers, 2003.

(Covering Units II)

12S8E8 QUANTUM COMPUTING

L T P C

3 0 0 3

PRE REQUISITE:

12S203 - Engineering Physics

12S401 - Probability, Random Processes and Queuing Theory

COURSE OBJECTIVES-: Upon completion of this course the students will be familiar

with:

Basic computing models like circuit model, linear algebra and quantum physics.

Knowledge about the state and operations of Quantum systems.

Different Quantum models and their efficiencies.

Application of Quantum Teleportation and their coding.

Knowledge of search and amplification algorithms.


CO1:Explain how Quantum physics gives us a new way to compute. [Familiarity]

CO2: Use linear algebra in a quantum computing context. [Usage] CO3:Describe how the fundamental units of quantum computing (qubits) are manipulated to solve hard problems. [Assessment]

CO4:Design simple quantum circuits using quantum gates and implement Quantum circuit measurements. [Assessment]

CO5: Familiar with the quantum information processing, including quantum teleportation and application of it. [Familiarity]

CO6: Compare and contrast probabilistic and quantum algorithms like phase kick -

Back, Deutsch algorithm, Grover‟s Quantum algorithm etc,.[Usage]

UNIT I INTRODUCTION (09) Overview - Strong Church–Turing Thesis - The Circuit Model of Computation - Linear

Algebra Formulation - Reversible Computation - Quantum Physics. MATHEMATICAL BACKGROUND: Dirac Notation and Hilbert Spaces - Dual Vectors – Operators - Spectral Theorem - Functions of Operators - Tensor Products - The Schmidt

Decomposition Theorem

UNIT II QUBITS AND MEASUREMENT (09)

The State of a Quantum System - Time-Evolution - Composite Systems – Measurement -

Mixed States and General Quantum Operations

UNIT III QUANTUM MODEL OF COMPUTATION (09)

The Quantum Circuit Model - Quantum Gates - Universal Sets of Quantum Gates -

Efficiency of Approximating Unitary Transformations - Implementing Measurements with

Quantum Circuits

UNIT IV QUANTUM INFORMATION (09)

Super dense Coding - Quantum Teleportation - An Application of Quantum TeleportationQUANTUM ALGORITHMS I: Probabilistic Versus Quantum Algorithms - Phase Kick-Back - The Deutsch Algorithm - The Deutsch - Jozsa Algorithm - Simon’s

Algorithm

UNIT V QUANTUM ALGORITHMS II (09)

Grover’s Quantum Search Algorithm - Amplitude Amplification - Quantum Amplitude

Estimation and Quantum Counting - Searching without knowing the success Probability.


Text Books

1 “An Introduction to Quantum Computing”, Phillip Kaye, Raymond Laflamme, Michele Mosca, Oxford University Press, 2007.(Covering Units I, II, III, IV, V)

Reference Books

1 Quantum computation and quantum information”, Michael A. Nielsen, Isaac L. Chuang, Cambridge University Press, 10th edition, 2010. (Covering Units II,III, IV, V)

2 “Six Easy Pieces”, Richard P. Feynman, Addison-Wesley Publishing Company, 1995.

12S8E9 SOFTWARE QUALITY ASSURANCE


L T P C

3 0 0 3

PREREQUISITES :

12S703 - Software Engineering


with:

Basic knowledge on standards of software quality assurance.

Software testing concepts, issues and techniques.

How to detect, classify, prevent and remove defects in the software.

Quality improvement, measurement and defect analysis in quality models.

Risk identification and reliability engineering.


CO1: Realize the importance of quality in software development life cycle. [Usage]

CO2: Evaluate software development and test plans, solve software problems by finding program bugs and creating solutions. [Assessment]

CO3: Compare QA techniques and activities in software projects. [Assessment]

CO4: Develop a quality-oriented model and analyze defects and classification. [Usage]

CO5: Compare and contrast between traditional and new risk identification techniques

[Assessment]

CO6: Identify the need of reliability engineering. [Assessment]


Overview – Software Quality – Quality Assurance – Quality assurance in Context – Quality Engineering.

UNIT II SOFTWARE TESTING (9)

Testing: Concepts, Issues and Techniques – Test activities, management and automation – Testing techniques: Adaptation, Specialization and Integration.

UNIT III SOFTWARE QUALITY ASSURANCE (9)

Defect prevention and process improvement – Software Inspection – Formal verification – Fault tolerance and failure containment – Comparing QA techniques and Activities

(9)

UNIT IV QUALITY IMPROVEMENT AND MODELS Feedback loop and activities for quantifiable quality improvement, Quality models and

measurements – Defect classification and analysis.

UNIT V RISK IDENTIFICATION AND RELIABILITY ENGINEERING (9) Basic ideas, Traditional statistical analysis techniques, New techniques for risk identificat ion – Software reliability engineering.


TextBooks

1 Jeff Tian, ―Software Quality Engineering”, A John Wiley & Sons, Publications, 2005.

ReferenceBooks

1 Watts S Humphrey, “Managing the Software Process”, Pearson Education Inc., 1999

2 Gordon G Schulmeyer, “Handbook of Software Quality Assurance”, Third Edition, Artech House Publishers 2007

3 Nina S Godbole, “Software Quality Assurance: Principles and Practice”, Alpha

Science International, Ltd, 2004

FIRST SEMESTER THEORY PRACTICAL - Government … syllabi.pdf · FIRST SEMESTER S. No Course Code...

Documents

Transcript of FIRST SEMESTER THEORY PRACTICAL - Government … syllabi.pdf · FIRST SEMESTER S. No Course Code...