COURSE STRUCTURE OF I YEAR BTECH I SEMESTER … · 5 IT735 Artificial Intelligence 100 4 S.No...

COURSE STRUCTURE OF I YEAR BTECH

I SEMESTER – CHEMISTRY CYCLE

Sl. Course

No. Course Name

Hours Total Marks

Credits Total Credits

Offering Dept. L T P L T P

1 MA131 Mathematics – I 3 1 0 100 3 1 0 4 SH

2 CH132 Applied Chemistry 3 1 2 100 3 1 1 5 SH

3 EC133 Basic Electronics 3 1 2 100 3 1 1 5 ECE

4 CS134 Basics of Computer Science and Engineering

3 1 2 100 3 1 1 5 CSE

5 ME135 Basics of Mechanical Engineering

3 1 0 100 3 0 0 3 MECH

6 ME 151

Workshop Practice 0 0 2 50 1 1 MECH

7 HE171 Holistic Education-I 1

--- 1

1

TOTAL

550

24

I SEMESTER – PHYSICS CYCLE

Sl. Course

No. Course Name

Hours Total Marks

Credits Total Credits L T P L T P

1 MA131 Mathematics – I 3 1 0 100 3 1

4

2 PH132 Applied Physics 3 1 2 100 3 1 1 5

3 EE133 Basics of Electrical Engineering

3 1 2 100 3 1 1 5

4 CE134 Basics of Civil Engineering & Engineering Mechanics

3 1 2 100 3 1 1 5

5 EG135 Engineering Graphics 2 2 2 100 2 1 1 4

6 PD136 Professional Development-I 3 1 0 100 3 0 0 3

HE171 Holistic Education-I 1

1

1

TOTAL

600

27

Christ University, Bengaluru

2

COURSE STRUCTURE OF I YEAR BTECH (2016-2017 BATCH)

II SEMESTER – CHEMISTRY CYCLE-

Sl. Course

No. Course Name

Hours Total Marks



1 MA231 Mathematics – II 3 1 0 100 3 1 0 4 SH

2 CH232 Applied Chemistry 3 1 2 100 3 1 1 5 SH

3 EC233 Basic Electronics 3 1 2 100 3 1 1 5 ECE

4 CS234 Basics of Computer Science and Engineering

3 1 2 100 3 1 1 5 CSE

5 ME235 Basics of Mechanical Engineering

3 0 0 100 3 0 0 3 MECH

6 ME251 Workshop Practice 0 0 2 50 1 MECH

7 HE271 Holistic Education-II

1

--- 1

1

TOTAL

550

24

II SEMESTER – PHYSICS CYCLE

Sl. Course

No. Course Name

Hours Total Marks



1 MA231 Mathematics – II 3 1 0 100 3 1 0 4 SH

2 PH232 Applied Physics 3 1 2 100 3 1 1 5 SH

3 EE233 Basics of Electrical Engineering

3 1 2 100 3 1 1 5 EEE

4 CE234

Basics of Civil Engineering & Engineering Mechanics

3 1 2 100 3 1 1 5 CE

5 EG235 Engineering Graphics 2 2 2 100 2 1 1 4 MECH

6 PD236 Professional Development-I

3 0 0 100 3 0 0 3 SH

HE271 Holistic Education-II 1

1

1

TOTAL

600

27

Syllabus 2016-2017- B Tech Information Technology

3

SEMESTER-III (2015-2016 BATCH)

S.No Course Code

Course Name Marks Credit

THEORY

1 MA334 Discrete Mathematics 100 3

2 CS332 Operating Systems 100 3

3 EC334 Digital Systems 100 4

4 CS334 Object Oriented Programming Concepts 100 3

5 CS335 Computer Organization and Architecture 100 4

6 CS336 Computer Graphics with Open GL 100 3

7 HE371 Holistic Education -III 1

PRACTICAL

8 CS351 Object Oriented Programming Concepts Laboratory

50 2

9 CS352 Operating Systems Laboratory 50 2

Total 700 25

SEMESTER IV (2015-2016 BATCH)

S.No Course Code Course Name Marks Credit

THEORY

1 CS431 Probability and Queuing Theory 100 3

2 CS432 Data Structures and Algorithms 100 3

3 CS433 Data Base Management Systems 100 3

4 CS434 Microprocessors and its Applications 100 4

5 CS435 Internet of Things 100 3

6 PD436 Professional Development-II 100 3

7 HE471 Holistic Education -IV 1

PRACTICAL

8 CS451 Data Structures and Algorithms Laboratory

50 2

9 CS452 DBMS Laboratory 50 2

Total 700 24


4

SEMESTER V (2014-2015 BATCH)

SEMESTER VI (2014-2015 BATCH)

SEMESTER VII (2013-2014 BATCH)

S.No Course Code

Course Name Marks Credit

THEORY

1 IT731 Elective – II 100 4

2 IT732 Elective – III 100 4

3 IT733 Elective – IV 100 4

4 IT734 Internet Programming 100 4

5 IT735 Artificial Intelligence 100 4


THEORY

1 IT631 Elective – I 100 4

2 IT632 Digital Signal Processing 100 4

3 IT633 System Software 100 4

4 IT634 Software Engineering 100 4

5 IT635 Numerical Methods 100 4

6 IT636 Graphics and Multimedia 100 4

PRACTICAL

7 IT651 Graphics and Multimedia Laboratory 50 2

8 IT652 System Software Laboratory 50 2

Total 700 28


THEORY

1 IT531 Discrete Mathematics 100 4

2 IT532 Database Management Systems 100 4

3 IT533 Computer Networks 100 4

4 IT534 Theory of Computation 100 4

5 IT535 Microprocessors and its Application 100 4

PRACTICAL

6 IT551 Network Laboratory 50 2

7 IT552 Microprocessors Laboratory 50 2

8 IT553 DBMS Laboratory 50 2

Total 650 26


5

6 IT736 Java Programming 100 4

PRACTICAL

8 IT751 Java Programming Laboratory 50 2

9 IT752 Internet Programming Laboratory 50 2

10 IT771 Internship

2

Total 700 30

SEMESTER VIII (2013-2014 BATCH)


1 IT831 Elective V 100 4

2 IT832 Elective VI 100 4

3 IT833 Elective VII 100 4

4 IT871 Project Work 200 6

6 IT872 Comprehension 50 2

7 BTCY01 Cyber Security

2

8 IC The Constitution of India

1

Total 550 23


6

Electives

SEMESTER VI (IT631)


1 IT631A UNIX Internals 100 4

2 IT631B Data Warehousing and Mining 100 4

3 IT631C Resource Management Techniques 100 4

4 IT631D High Performance Microprocessors 100 4

5 IT631E Embedded Systems 100 4

6 IT631F Advanced Databases 100 4

7 IT631G Intellectual Property Rights 100 4

8 IT631H Indian Constitution and Society 100 4

SEMESTER VII

Electives (IT731, IT732, IT733)

S.No Ref.No Course Name

Group Marks Credit

1 IT731A Advanced Operating Systems IT731

100 4

2 IT731B Real Time Systems 100 4

3 IT731C TCP/IP Design and Implementation 100 4

4 IT731D C# and .NET Framework 100 4

5 IT732A System Modeling and Simulation

IT732

100 4

6 IT732B Cryptography and Network Security 100 4

7 IT732C Natural Language Processing 100 4

8 IT732D Advanced Computer Architecture 100 4

9 IT732E Information Security 100 4

10 ITS733A User Interface Design

IT733

100 4

11 IT733B Graph Theory 100 4

12 IT733C Total Quality Management 100 4

13 IT733D Object Oriented Analysis and Design 100 4

SEMESTER VIII

Electives: (IT831,IT832, IT833)


7

S.No Ref.No Course Name

Group Marks Credit

1 IT831A Parallel Computing

IT831

100 4

2 IT831B High Speed Networks 100 4

3 IT831C Quantum Computing 100 4

4 IT831D Grid Computing 100 4

5 IT831E Mobile Computing 100 4

6 IT832A Soft Computing

IT832

100 4

7 IT832B Component Based Technology 100 4

8 IT832C Software Quality Management 100 4

9 IT832D Advanced JAVA Programming 100 4

10 IT833A Knowledge Based Decision Support

Systems

IT833 100 4

11 IT833B Robotics 100 4

12 IT833C Professional Ethics and Human Values 100 4

13 IT833D Digital Image Processing 100 4


8

15. DETAILED SYLLABUS

MATHEMATICS I – MA 131 -- Syllabus 2016-17 (Common for all branches)

COURSE DESCRIPTION: This paper contains five units which are Linear Algebra, Differential and Integral Calculus, Differential Equation and Vector Calculus. This paper aims at enabling the students to know numerical techniques of solving system of equations, various concepts of calculus of functions of several variables, application of calculus to find area, volume etc and drawing complicated curves, classification of different type of differential equation with an introduction to vector calculus are covered in this paper. COURSE OBJECTIVE: This course is outlined to those who intend to apply the subject at the proper place and time, while keeping him/her aware to the needs of the society where he/she can lend his/her expert service, and also to those who can be useful to the community without even going through the formal process of drilling through rigorous treatment of Mathematics. COURSE OUTCOMES: At the end of this course, students will

have a solid base of understanding elementary linear algebra as required for further undergraduate work in engineering.

be able to differentiate a function partially with respect to each of its variables in turn

be able to utilize methods of integration to compute length of arcs, surface area and volume of solids

be skilled in using integration to compute problems important in physics and engineering

learn the meaning and computation of the curl and divergence of a vector field.

be able to solve first order differential equations that are separable, linear or exact

Unit I: Linear Algebra 10 Hours Fundamental concepts of Matrix, Rank of a Matrix, Consistency of the system of equations, Solution of linear simultaneous equations: - Gauss elimination and Gauss Jordan methods. Gauss – Seidel iterative method. Eigen values and Eigen Vectors, Diagonalization, Computation of largest eigen value and the corresponding eigenvector by Rayleigh‟s power method. Unit II: Differential Calculus - I 12 Hours Partial Differentiation: Partial derivatives, Euler‟s theorem. Total differential coefficient, differentiation of composite and implicit functions, Jacobians and properties. Leibnitz‟s Rule of differentiation under integral sign.


9

UNIT - III: Integral Calculus – I 14 Hours

Reduction formulae for the integration of sinn x , cosn x , sin cosm nx x and evaluation of

these integrals with standard limits - Problems. Tracing of standard curves in Cartesian, Parametric and Polar form. Derivative of arc length, Applications of integration to find surfaces of revolution and volumes of solids of revolution. UNIT – IV: Differential Equation - I 12 Hours Solution of first order and first degree differential equations: Reducible to Homogeneous, Linear and Exact differential equation, Applications of differential equations. orthogonal trajectories. UNIT –V: Vector Calculus - I 12 Hours Vector differentiation. Velocity, Acceleration of a particle moving on a space curve. Vector point function. directional derivative, Gradient, Divergence, Curl, Laplacian. Solenoidal and Irrotational vectors - Problems. Standard vector identities. TEXT BOOKS

1. Dr. B. S. Grewal, “Higher Engineering Mathematics”, 39th Edition, Khanna Publishers, July 2005.

2. H. K. Das & Rajnish Verma, “Higher Engineering Mathematics”, S. Chand & Company Ltd., 2011.

REFERENCE BOOKS 1. Erwin Kreyszig, “Advanced Engineering Mathematics”, 8th Edition, John Wiley &

Sons, Inc, 2005 2. Thomas and Finney, “Calculus”, 9th Edition, Pearson Education, 2004 3. Peter V. O‟Neil, “Advanced Engineering Mathematics”, Thomson Publication,

Canada, 2007 4. B. V. Ramana, “Higher Engineering Mathematics”, Tata McGraw – Hill, 2009. 5. Michael Artin, “Algebra”, 2nd Edition, Prentice Hall of India Private Limited, New

Delhi, 2002 6. Kenneth Hoffman and Ray Kunze, “Linear Algebra”, 2nd Edition, Prentice Hall of

India Private Limited, New Delhi, 2002 7. George F. Simmons and Steven G. Krantz, “Differential Equation, Theory, Technique

and Practice”, Tata McGraw – Hill, 2006. 8. M. D. Raisinghania, “Ordinary and Partial Differential Equation”, Chand (S.) & Co.

Ltd., India, March 17, 2005. 9. K. A. Stroud, “Engineering Mathematics”, 5th Edition, Industrial Press, 2001.


10

APPLIED CHEMISTRY – CH 132 / CH 232 --Syllabus 2016-17 (Common for all branches)

PAPER DESCRIPTION: This paper contains five units which are Chemical Energy Sources, Electrochemical Energy Systems, Corrosion Science, Surface Chemistry & catalysis and Water Technology This paper aims at enabling the students to know various energy sources. Corrosion and its control, Basics of surface chemistry and their application in catalysis, water technology and instrumental analysis. COURSE OBJECTIVES:

1. To describe the students on application oriented themes like the chemistry of materials used in engineering discipline

2. To describe the students on the chemistry of compounds resulting from pollution, waste generation and environmental degradation and to apply the knowledge in solving these current environmental problems effectively.

COURSE OUTCOMES:

Students will gain an understanding of oxidation and reduction reactions as they relate to engineering applications, such as corrosion.

Students will understand the importance of Surface chemistry and Industrial catalysis and also they will recognize few characterization techniques in Material Sceinces.

Will understand the design and development of Photovoltaic devices.

Will be understanding some Instrumental methods of analysis.

LEVEL OF KNOWLEDGE: Basic Unit – I: Chemical Energy Sources 10 Hours Introduction to energy; Fuels - definition, classification, importance of hydrocarbons as fuels; Calorific value-definition, Gross and Net calorific values (SI units). Ultimate and proximate analysis of fuel, Determination of calorific value of a solid / liquid fuel using Bomb calorimeter. Petroleum cracking-fluidised catalytic cracking. Reformation of petrol. Knocking - mechanism, octane number, cetane number, prevention of knocking, anti-knocking agents, unleaded petrol; synthetic petrol – Bergius process and Fischer Tropsch process; power alcohol. Solar Energy : Photovoltaic cells- Introduction, definition, importance, working of a PV cell; solar grade silicon, physical and chemical properties of silicon relevant to photovoltaics, production of solar grade (crystalline) silicon and doping of silicon. Unit – II: Electrochemical Energy Systems (Electrode potential and cells) 8 Hours Conductance, Ionic conductance, Transport number, Ionic mobility, activity coefficient and mean activity coefficients. Single electrode potential- origin, sign conventions. Derivation of Nernst equation. Standard electrode potential Construction of Galvanic cell–classification - primary, secondary and concentration cells, Concentration cell with and without transference, EMF of a cell, notation and conventions. Reference electrodes –calomel electrode, Ag/AgCl electrode. Measurement of single electrode potential. Numerical problems on electrode potential and EMF. Ion-selective electrode- glass electrode, Determination of pH using glass electrode.


11

Conversion and Storage of Electrochemical Energy 7 Hours Battery Technology - Batteries-Basic concepts, battery characteristics. Classification of batteries –primary, secondary and reserve batteries. Classical Batteries–Construction working and applications of Zn–air, Nickel-Metal hydride and Lithium-MnO2 batteries, Fuel Cells - Introduction, types of fuel cells-Alkaline, Phosphoric acid and Molten carbonate fuel cells. Solid polymer electrolyte and solid oxide fuel cells. Construction and working of H2O2and Methanol-Oxygen fuel cell Unit III Corrosion Science 10 Hours Corrosion - definition, Chemical corrosion and Electro-chemical theory of corrosion, Types of corrosion, Differential metal corrosion, Differential aeration corrosion (pitting and water line corrosion), Stress corrosion. Factors affecting the rate of corrosion, Corrosion control: Inorganic coatings – Anodizing and Phosphating, Metal coatings –Galvanization and Tinning, Corrosion Inhibitors, Cathodic and Anodic protection, Tafel Plot. Unit – IV Surface chemistry & Catalysis 8 hours Introduction, Adsorption, Cause of adsorption, Basic terms in adsorption, Characteristics of adsorption (Variation of thermodynamic variables), Classification of adsorption, Effect of parameters on adsorption (Temperature, pressure, porosity, nature of gases), Adsorption isotherms, Catalysis, classification, types of catalysts (Acid and base catalysts), preparation methods (precipitation, co-precipitation, sol-gel and hydrothermal techniques), Kinetics of catalytic reactions, Applications-Catalytic activity. Unit – V Water Technology: 7 Hours Impurities in water, Water analysis - Determination of different constituents in water – Hardness & Alkalinity, Numerical problems on hardness and alkalinity. Biochemical Oxygen Demand and Chemical Oxygen Demand. Numerical problems on BOD and COD. Sewage treatment. Potable water, purification of water - Flash evaporation, Electro dialysis and Reverse Osmosis. Hazardous chemicals with ill effects. Principles of Electronic, Atomic and emission spectroscopy. Instrumental Methods of Analysis: 5 Hours Theory, Instrumentation and Applications of Colorimetry, Potentiometry and Conductometry Principles and Instrumentation of Atomic Absorption Spectroscopy (AAS) and UV-Visible Double Beam Spectrometer with diagram. Text Books 1. Dr. B.S. Jai Prakash, “Chemistry for Engineering Students”, Subhas Stores, Bangalore, Revised Edition 2009 2. M. M. Uppal, “Engineering Chemistry”, Khanna Publishers, Sixth Edition, 2001 3. Jain and Jain, “A text Book of Engineering Chemistry”, S. Chand & Company Ltd. New Delhi, 2009 Reference Books

• Alkins P.W. “physical chemistry” ELBS IV edition 1998, London


12

• G. W. Gray and P. A. Winsor, “Liquid crystals and plastic crystals”, Vol - I, Ellis Horwood series in Physical Chemistry, New York. (P. No. 106-142)

• M. G. Fontana, “Corrosion Engineering”, Tata Mc Graw Hill Publications 1994. • Stanley E. Manahan, “Environmental Chemistry”, Lewis Publishers, 2000 • B. R. Puri, L. R. Sharma & M. S. Pathania, ”Principles of Physical Chemistry”, S.

Nagin Chand & Co., 33rd Ed.,1992 • Kuriakose J.C. and Rajaram J. “ Chemistry in Engineering and Technology” Vol I &

II, Tata Mc Graw – Hill Publications Co Ltd, NewDelhi, 1996. • G. Ertl, H. Knozinger and J. Weitkamp, "Handbook of Heterogeneous Catalysis" Vol

1-5, Wiley - VCH. • B. Viswanathan, S. Sivasanker , A.V. Ramaswamy, "Catalysis : Principles &

Applications" CRC Press. Part II -CHEMISTRY LABORATORY COURSE DESCRIPTION: This course contains eleven experiments and aims at enabling the students to Practical Engineering Chemistry. COURSE OBJECTIVES:

1. To understand the students with the working knowledge of chemical principles, nature and transformation of materials and their applications.

2. To develop analytical capabilities of students so that they can understand the role of chemistry in the field of Engineering and Environmental Sciences.

3. COURSE OUTCOMES: Upon successful completion of the course, students will understand the

Importance of chemistry for the preparation of materials for research activities.

Instrumental methods of analysis like Conductometry, Colorimetry, Potentiometry and complexometry.

Quantitative analysis of industrial importance.

Transfer and measurement of chemicals.

Solution preparation.

Concentration of solution.

Safety measures. LEVEL OF KNOWLEDGE: Basic/working PART-A

1. Determination of viscosity coefficient of a given liquid using Ostwald‟s viscometer. 2. Determination of copper by spectrophotometric method. 3. Conductometric estimation of an acid using standard NaOH solution 4. Determination of pKa value of a weak acid using pH meter. 5. Potentiometric estimation of FAS using standard K2Cr2O7 solution.

PART-B

1. Determination of Total Hardness of a sample of water using disodium salt of EDTA. 2. Determination of Calcium Oxide (CaO) in the given sample of cement by Rapid EDTA method. 3. Determination of Carbonate, Bicarbonate and Chloride contents in water.


13

4. Determination of Iron in the given sample of Haematite ore solution using potassium dichromate crystals by external indication method. 5. Determination of Chemical Oxygen Demand (COD) of the given industrial waste Water sample.

REFERENCE BOOKS: 1. J. Bassett, R.C. Denny, G.H. Jeffery, “Vogels text book of quantitative inorganic analysis”,4th Edition 2. Sunita and Ratan Practical Engineering Chemistry, S.K. Kataria & Sons, 2010.


14

EC 133 / EC 233 BASIC ELECTRONICS

COURSE OBJECTIVES

To impart basic knowledge about electronic and digital systems

To give basic ideas about various communication systems SYLLABUS Unit – I :Basic Semiconductor and pn Junction Theory 9+3 Hours Atomic Theory – Atom, Electron Orbits and Energy Levels - Conduction in solids – Electron Motion and Hole Transfer, Conventional Current and Electron Flow –Conductors, Insulators and Semiconductors – Energy Band Diagrams – Variation of band gap with temperature. Intrinsic and Extrinsic Semiconductors – Doping, n type and p type material, Majority and minority carriers, Charge Carrier Density, Mass Action Law. Semiconductor Conductivity – Drift Current, Diffusion Current, Charge Carrier Velocity, Condyctivity.The pn Junction – Biased Junctions – Junction Currents and Voltages.VI Characteristics – Static and Dynamic Resistance.Zener diode characteristics, Zener and Avalanche breakdown. Unit – II :Diode Applications 9 + 3 Hours Diode Approximations – DC Load Line Analysis - DC voltage applied to diodes (Si and zener diodes only). (Simple analysis using KCL and KVL). Rectifiers – Half Wave rectifier – Full Wave Rectifier – Bridge Rectifier : dc load current and voltage, rms load current and voltage, ripple factor, efficiency, PIV. Simple Capacitor Filter(Analysis not expected) – Simple Shunt Zener Voltage Regulator Unit – III: Bipolar Junction Transistor 9+3 Hours Bipolar Junction Transistors: Transistor Construction – Operation – Common Base Configuration – Transistor Amplifying action – Common Collector – Common Emitter. Transistor currents.Common emitter current gain – Common Base Current gain – Relationship. Transistor Biasing : Operating Point – Significance – Fixed Bias and Voltage Divider Bias – Simple analysis. Unit – IV: Introduction to Operational Amplifiers 9+ 3 Hours Block diagram, Op-amp transfer characteristics, Basic Op-amp parameters and its value for IC 741- offset voltage and current, input and output impedance, Gain, slew rate, bandwidth, CMRR, Concept of negative feedback, Inverting and Non-inverting amplifiers, Summing Amplifier, Subtractor, Differential Amplifier, integrator, differentiator, Voltage follower, Introduction to Oscillators, the Barkhausen Criterion for Oscillations, Applications of Oscillator UNIT – V: Digital Electronics 9 + 3 Hours Sampling theorem, Introduction, decimal system, Binary, Octal and Hexadecimal number systems, addition and subtraction, fractional number, Binary Coded Decimal numbers. Boolean algebra, Logic gates, Two Variable and three variable K – maps - Half-adder, Full-adder, Logic Design based on two and three input variables only.


15

COURSE LEARNING OUTCOMES

Identify the applications and functions of electronics in Engineering.

Recognise basic electronic components and devices used for different electronic functions.

Be able to use basic techniques for analyzing analogue and digital electronic circuits.

Be able to design analogue and digital electronic circuits at block level.

TEXT BOOKS 1. David A. Bell, “Electronic Devices and Circuits” – Vth Edition, OUP 2. N. P. Deshpande, “Electronic Devices and Circuits – Principles and Applications”, TMH. 3. Robert L Boylestad& Louis Nashelsky, "Electronic Devices and Circuit Theory", 3rd

Edition. 4. Morris Mano, “Digital Logic and Computer Design”, PHI, EEE REFERENCE BOOKS 1. Donald A. Neamen, “Electronic Circuits”, 3rd Edition, TMH 2. Thomas L. Floyd, “Electronic Devices”, Seventh Edition, Pearson Education. 3. Albert Malvino, David. J. Bates, ―Electronic Principles‖, 7th Edition, Tata McGraw Hill, 2007


16

BASIC ELECTRONICS LABORATORY Use basic source and measuring instruments (Power supply, function generator, CRO, DMM), Familiarization of breadboard.

1. Measurement of Voltage and Frequency using CRO. Study of step down transformer. Measuring the secondary voltage.

2. Identify and test electrical/electronic active and passive components 3. Color Coding of resistors and Capacitor Coding 4. Study of Series and Parallel circuits – Using Bread Board and DC power supply. 5. Half Wave Rectifier and Full Wave Rectifier 6. Study different types of logic gates 7. Solder and de-solder electronic components on different types of PCB 8. Assembling of RG-35 cable with BNC connectorization 9. Assembly and study of grid parabolic antenna 10. PCB design using software tool: a single sided (pattern side only) layout design

of a simple circuit.


17

CS 134 / CS 234 Basics of Computer Science and Engineering

COURSE OBJECTIVES To develop skill in problem solving concepts through learning C/C++ programming.

SYLLABUS UNIT – I: INTRODUCTION TO COMPUTERS 9 + 3 Hours Introduction to Computers -Computer Systems, Basic organization of a computer, Computing Environments, Internet and World Wide Web, Information technology today, System software, Software engineering, Database management system, Computer network, Multimedia, IT in business, personal, social and ethical issues. Problem formulation and problem solving, Computer Languages, Creating and running programs, Program Development. Introduction to the C/C++ Language –Background, example C/C++ programs, Preprocessor commands. ALGORITHMS AND FLOWCHARTS Algorithms, Flowcharts, Divide and conquer strategy. Examples on algorithms and flowcharts. Constants, Variables, and Data types: Characters set, tokens, Keywords and Identifiers, Constants, Variables, Data types, Declaration of variables. UNIT – II: OPERATORS AND EXPRESSIONS: 9 + 3 Hours Arithmetic operators, Relational operators, Logical operators, Assignment operators, Increment and Decrement operators, Conditional operator, Bitwise operators, Special operators, Arithmetic expressions, Evaluation of expressions, Precedence of Arithmetic operators, Type conversions in expressions, Operator precedence and associatively. MANAGING INPUT AND OUTPUT OPERATIONS Reading a character, writing a character, Formatted Input, Formatted Output DECISION MAKING AND BRANCHING: Decision making with if statement, Simple if statement, The if…else statement, Nesting of if…else statements, The else … if ladder, The switch statement, The ?: operator, The Goto statement LOOPING: The while statement, The do statement, The for statement, Jumps in Loops Unit – III: ARRAYS 9 + 3 Hours One-dimensional Arrays, Declaration of one-dimensional Arrays, Initialization of one-dimensional Arrays, Two-dimensional Arrays, Initializing two-dimensional Arrays. USER-DEFINED FUNCTIONS: Need for User-defined Functions, A multi-function Program, Elements of user - defined Functions, Definition of Functions, Return Values and their types, Function Calls, Function Declaration, Category of Functions, No Arguments and no Return Values, Arguments but no Return Values, Arguments with Return Values, No Argument but Returns a Value, Functions that Return Multiple Value, Scope, Storage classes -auto, register, static, extern,


18

scope rules, type qualifiers, recursion –recursive functions, Limitations of recursion Unit – IV: POINTERS 9 + 3 Hours Understanding the pointers, Accessing the Address of a Variable, Declaring Pointer Variables, Initialization of Pointer Variables, Accessing a Variable through its Pointer, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays, Pointers and Character Strings, Pointers as Function Arguments, Functions Returning Pointers. Unit – V: STRINGS, STRUCTURE, UNION, FILES 9 + 3 Hours Strings: String concepts, C/C++ strings, String I/O functions, Array of strings, String manipulation function, Memory formatting, Derived types-Enumerated, Structure, and Union: The type definition, Enumerated types, Structure, Accessing structures, Complex structures, Array of structures, Structures and functions, Union , Files: Classification of Files, Standard Library Functions for Files.


Students will be able to read, understand and trace the execution of programs written in C/C++ language.

For a given algorithm students will be able to write the C/C++ code using a modular approach.

Students will be able to design programs involving decision structures, loops, functions, and pointers.

TEXT BOOKS

1. Deitel and Deitel, "C How to Program", Prentice Hall 2010 (Reprint). 2. Herbert Schildt, "C++ : The Complete Reference", Mcgraw - Hill Osborne Media; 3rd

edition 2012 ( Reprint). 3. Yashvant Kanetkar, “Let Us C 13E”, BPB Publications – 13th Edition, 2013.

REFERENCE BOOKS

1. Shelly and Junt, “Computers and Commemsense”, 4th edition, Prentice Hall of India, 2010 (Reprint).

2. Deniis P. Curtin, KIMfolly, Kunal Sen, Cathleen Morin, “Information Technology”, Tata MC GrawHill Companies, 2010 (Reprint).

3. Peter Norton, “Introduction to Computers”, 2011 (Reprint).


19

COMPUTER PROGRAMMING LABORATORY COURSE OBJECTIVES

To impart the basic concepts of computer and information technology.

To develop skill in problem solving concepts through learning C/C++ programming in practical approach.

SYLLABUS

1. To understand and realize the use of Constants, Variables, and Data types: Characters set, C/C++ tokens, Keywords and Identifiers, Constants, Variables, Data types, Declaration of variables.

2. To understand and realize the use of Arithmetic operators, Relational operators, Logical operators, Assignment operators, Increment and Decrement operators, Conditional operator, Bitwise operators, Special operators, Arithmetic expressions, Evaluation of expressions, Precedence of Arithmetic operators, Type conversions in expressions, Operator precedence and associativity.

3. To understand and implement concepts of Decision making with if statement, Simple if statement, The if…else statement, Nesting of if…else statements, The else … if ladder, The switch statement, The ?: operator, The Goto statement.

4. To understand and implement concepts of the while statement, The do statement, The for statement, Jumps in Loops.

5. To understand and implement concepts of One-dimensional Arrays, Declaration of one-dimensional Arrays, Initialization of one-dimensional Arrays, Two-dimensional Arrays, Initializing two-dimensional Arrays.

6. To understand and implement concepts of A multi-function Program, Category of Functions, recursion –recursive functions.

7. Understanding the pointers, Accessing the Address of a Variable, Declaring Pointer Variables, Initialization of Pointer Variables, Accessing a Variable through its Pointer, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays, Pointers and Character Strings, Pointers as Function Arguments, Functions Returning Pointers.

8. To understand and implement concepts of String , String I/O functions, Array of strings, String manipulation function.

9. To understand and implement concepts of Derived types-Enumerated, Structure, and Union.

10. To understand and implement File concepts in C/C++.

HARDWARE EXPERIMENTS:

Assembling and de-assembling personal computers

Types of Ports-Types of Connectors

Overview of the preventive maintenance

Operating system installations

Basic networking concept



20

Ability to analyze the problem and breading them into problem solving steps

Ability to implement the a algorithm using procedural language constructs

Ability to write a program for solving generic problems which could be solved using procedural based steps

REFERENCE BOOKS

1. Deitel and Deitel, "C How to Program", Prentice Hall 2010 (Reprint). 2. Herbert Schildt, "C++ : The Complete Reference", Mcgraw - Hill Osborne Media;

3rd edition 2012 ( Reprint). 3. Yashvant Kanetkar, “Let Us C 13E”, BPB Publications – 13th Edition, 2013.


21

ME 135 / ME 235 ELEMENTS OF MECHANICAL ENGINEERING

COURSE OBJECTIVES To familiarize with

The Source of conventional and renewable energy recourses

Fundamental concepts of thermodynamics and heat transfer

Elementary concepts on prime movers like IC Engines and turbines

Basic principles of refrigeration and air-conditioning.

Concepts of power transmission system

The various metal joining process.

The Basic theory of machine tools. SYLLABUS UNIT-I ENERGY and its UTILISATION Energy Resources 5 Hours Conventional Resources- Petroleum based solid, liquid and gaseous fuels. Combustion and atmospheric pollution due to combustion of fuels. Brief on Emission norms. Non Conventional Resources: 5 Hours Solar Power, Solar Thermal energy harvesting, solar collectors, solar pond (principle of operation only), Solar photovoltaic principle. Wind Energy, Ocean Thermal, Geo- thermal, Tidal energy and bio mass energy- working principle. Brief on bio-fuels. Merits and demerits of different energy resources. UNIT-II THERMODYNAMICS and HEAT TRANSFER Thermodynamics 6 Hours Basic concepts: State, path, process (reversible and irreversible), and cycle, System, surroundings and boundary. Closed system, Open system and Isolated Systems. I Law of Thermodynamics (conservation of energy). Concept of Internal energy and Enthalpy. Limitations of I Law and Introduction to II law (statements and brief description). Heat engine and Heat pump – Carnot cycle. Concept of entropy. (Simple problems on Carnot efficiency and COP) Heat Transfer 6 Hours Applications of heat transfer. Modes of Heat transfer. Description of conduction, convection and radiation heat transfer-basic governing equations. Fins – types and applications. Heat exchangers-types. (only descriptions) UNIT-III PRIME MOVERS IC Engines Classification, I.C. Engines parts, 2 Stroke and 4 stroke operations. SI and CI engines, Problems on indicated power, brake power, indicated thermal efficiency, brake thermal efficiency, mechanical efficiency, and specific fuel consumption. 6 Hours

A brief description of CRDI, MPFI, GDI and Hybrid Vehicles 2 Hours Turbines 8 Hours


22

Steam Turbine: Properties steam, boilers, fire and water tube boilers (Lancashire and Babcock and Will Cox boiler-working) Classifications of steam turbines, Principle of operation of Impulse and reaction turbines, Delaval‟ s turbine, Parson‟ s turbine – working principles Gas Turbine: Working principles and operations of Open cycle and closed cycle gas turbines Water turbines: Classification, Principles and operations of Pelton wheel, Francis turbine and Kaplan turbine UNIT-IV Refrigeration and Air-Conditioning 5 Hours Refrigeration-History and applications. Refrigerants and its properties. Refrigerating effect and unit of Refrigeration. Principle and working of vapor Compression refrigeration and vapour absorption refrigeration: Air-conditioning 4 Hours Psychometry - different temperatures and humidity. Components of an air conditioner. Principles and applications of air conditioners, Room air conditioner. Introduction on cryogenics UNIT-V Machine Tools and Metal Joining 7 Hours Lathe Machine, Types, Parts, and different operations like-turning, facing, knurling, tapering and thread cutting. Drilling Machine- Drilling,, Boring, Counter Boring , and Reaming operation. Radial and vertical drilling machines (simple sketches) Milling Machine – up milling, down milling, Plane milling, End milling, Slot milling and gear cutting (sketches only for operations) Material Joining 6 Hours Soldering, Brazing and Welding : Definitions, classification and method of soldering, Brazing and welding. Differences between soldering, Brazing and Welding. Description of Electric, Arc Welding and Oxy-Acetylene Welding. COURSE LEARNING OUTCOMES

a) To be able to distinguish between different energy recourses b) To demonstrate basic thermodynamic and heat transfer concepts c) To distinguish between SI and CI engines and their working principles d) To explain the working of turbines and their applications e) To describe the functioning of refrigeration and air-conditioning f) To be able to demonstrate work with machine tools and metal joining operations

TEXT BOOKS

1. K.R. Gopalkrishna, “A text Book of Elements of Mechanical Engineering”, Subhash Publishers, Bangalore.

2. S. Trymbaka Murthy, “A Text Book of Elements of Mechanical Engineering”, 3rd revised edition,I .K. International Publishing House Pvt. Ltd., New Delhi. 2010.

3. Dr. R. P. Reddy, N. Kapilan, “Elements of Mechanical Engineering”, 1st Edition, Himalaya Publishing House, New Delhi.


23

REFERRENCE BOOKS

1. SKH Chowdhary, AKH Chowdhary, Nirjhar Roy, “The Elements of Workshop Technology”, Vol. I & II, Media Promotors and Publishers, Mumbai.

2. Ghosh Mallik, “Manufacturing Technology”, TMH. HMT, Production Technology, TMH

ME 151 / ME 251 WORKSHOP PRACTICE

PART-A

COURSE OBJECTIVES To provide the students with the hands on experience on different trades of engineering like fitting, welding, carpentary & sheet metal. SYLLABUS 1. Fitting a) Study of fitting tools b) Study of fitting operations & joints c) 3- 5 models involving rectangular, triangular, semi circular and dovetail joints. 2. Welding d) Study of electric arc welding tools & equipments e) 2-3models - electric arc welding - Butt joint, Lap joint, T joint & L joint. 3. Sheet Metal f) Study of development of surfaces g) Minimum 01 models (Tray,Funnel,Cone) 4. Study and demonstration of Carpentry tools, joints and operations. TEXT BOOKS S. K. H. Choudhury, A. K. H. Choudhury, Nirjhar Roy, “The Elements of Workshop Technology”, Vol 1 & 2, Media Publishers, Mumbai


24

MATHEMATICS II – MA 231 -- Syllabus 2016-17 (Common for all branches)

COURSE DESCRIPTION: This paper contains five units which are Differential Calculus, Multiple integrals, Differential Equation of higher order and Laplace transformation and its Inverse with Vector integration. This paper aims at enabling the students to study the application of integration to various fields along with the different techniques to solve higher order linear differential equation. COURSE OBJECTIVE: Mathematics is a necessary avenue to scientific knowledge which opens new vistas of mental activity. A sound knowledge of engineering Mathematics is a „sine qua non‟ for the modern engineer to attain new heights in all aspects of engineering practice. This course provides the student with plentiful opportunities to work with and apply the concepts, and to build skills and experience in mathematical reasoning and engineering problem solving. COURSE OUTCOMES: At the end of this course, the students will

be introduced to the tools of integration of multivariate functions over areas and volumes.

learn the technique of multidimensional change of variables to transform the coordinates over which integration proceeds by utilizing Jacobian. Specifically, students will learn how to transform between an integral over an area or volume in Cartesian coordinates to polar coordinates.

be able to solve higher order homogenous/ non-homogenous linear differential equations with constant coefficients

be able to solve Cauchy’s and Legendre’s equations.

learn the fundamental vector calculus integral theorems of Green, Stokes’ and Divergence. Students will also learn how these theorems represent conservation principles for physical vector fields important in gravitation and electric fields.

be able to perform operations with Laplace and inverse Laplace transforms to solve higher order differential equations

UNIT – I: Differential Calculus – II 10 Hours Polar curves and angle between Polar curves. Pedal equations of polar curves, Radius of curvature – Cartesian, parametric, polar and pedal forms. UNIT –II: Integral Calculus – II 14 Hours Double integrals, Cartesian and polar co – ordinates, change of order of integration, change of variables between cartesian and polar co – ordinates, triple integration, area as a double integral, volume as a triple integral Beta and Gamma Function: Definition, Relation between Beta and Gamma Function, properties Application Problems.


25

UNIT –III: Differential Equations - II 12 Hours Linear differential equations of second and higher order with constant coefficients. Method of undetermined coefficients. Method of variation of parameters. Legendre‟a and Cauchy‟s homogeneous differential equations, phase plane, critical point, stability. UNIT -IV: Laplace Transforms 14 Hours Definition - Transforms of elementary functions. Derivatives and integrals of transforms- Problems. Periodic function. Unit step function and unit impulse function Inverse transforms – Properties. Convolution theorem, Solutions of linear differential equations. UNIT -V: Vector Calculus - II 10 Hours Vector Integration - Green‟s theorem in a plane, Gauss‟s divergence theorems, Stoke‟s, (without proof) and simple application. TEXT BOOKS

1. Dr. B. S. Grewal, “Higher Engineering Mathematics”, 39th Edition, Khanna Publishers, July 2005. 2. H. K. Das & Rajnish Verma, “Higher Engineering Mathematics”, S. Chand & Company Ltd., 2011.

REFERENCE BOOKS

1. Erwin Kreyszig, “Advanced Engineering Mathematics”, 8th Edition, John Wiley & Sons, Inc, 2005 2. Thomas and Finney, “Calculus”, 9th Edition, Pearson Education, 2004 3. Peter V. O‟Neil, “Advanced Engineering Mathematics”, Thomson Publication, Canada, 2007 4. B. V. Ramana, “Higher Engineering Mathematics”, Tata McGraw – Hill, 2009. 5. George F. Simmons and Steven G. Krantz, “Differential Equation, Theory, Technique and Practice”, Tata McGraw – Hill, 2006. 6. M. D. Raisinghania, “Ordinary and Partial Differential Equation”, Chand (S.) & Co. Ltd., India, March 17, 2005.

7. Paras Ram, “Engineering Mathematics through Applications”, 1st Edition, CBS Publisher, 2011.


26

Applied Physics PH 132 / PH 232 - Syllabus 2016 – 2017 ( Common for all branches)

COURSE DESCRIPTION This paper contains five UNITS which are Modern Physics, Quantum Mechanics, Conductivity in Metals( Electrical and Thermal), Elastic, Dielectric and Optical Properties of Materials, Lasers, Optical Fibers and Ultrasonics, This paper aims at enabling the students to understand the fundamentals covered in this paper. COURSE OBJECTIVES:

To extend student‟s knowledge on the basic concepts and ideas in physics.

To develop scientific attitudes and enable the students to apply the concepts of Physics with the core programmes.

COURSE OUTCOME : At the end of the course, the students would be able to

Identify the fundamental aspects of modern physics and quantum mechanics.

Compare classical and quantum free electron theory.

Outline the salient properties of elastic and dielectric materials.

Apply the concepts learnt in Laser, Fiber optics and Ultrasonics in the field of Engineering.

Apply optical phenomenon in technology. UNIT – I 14 Hours Modern Physics Introduction, Planck‟s theory - Deduction of Wien‟s displacement law and Rayleigh Jean‟s law from Planck‟s law, Compton effect, de Broglie hypothesis – extension to electron particle. Phase velocity, group velocity, expression for group velocity based on superposition of waves, relation between group velocity and particle velocity. Scanning electron microscope. Problems. UNIT – II 12 Hours Quantum Mechanics Heisenberg‟s uncertainty principle and its physical significance. Application of uncertainty principle (Non-existence of electron in the nucleus). Second order differential equation for a travelling wave. Wave function. Properties and Physical significance of a wave function Schrodinger - Time independent wave equation – Application: Setting up of a one dimensional Schrödinger wave equation of a particle in a potential well of infinite depth : Probability density and Normalization of wave function – Energy Eigen values and Eigen function. Problems. UNIT – III 12 Hours Electrical and Thermal Conductivities of metals Classical free-electron theory. Introduction, assumptions and limitation of classical free-electron theory. Thermal Conductivity. Wiedemann - Franz law, calculation of Lorentz number. Quantum free-electron theory – Postulates of quantum fee electron theory, Fermi - Dirac Statistics. Fermi-energy – Fermi factor. Density of states. Carrier concentration in metals. Expression for electrical resistivity/conductivity Temperature dependence of resistivity of metals. Band theory of solids - Merits of Quantum free electron theory. Problems. UNIT – IV 12 Hours Materials Science and Ultrasonics


27

Elasticity : Introduction, types of moduli of elasticity - Bending of beams – Single Cantilever - Young‟s modulus-Non uniform bending. Problems. Dielectrics : Dielectric constant and polarisation of dielectric materials. Types of polarisation. Equation for internal fields in liquids and solids (one dimensional). Clausius – Mossotti equation. Ferro and Piezo – electricity(qualitative). Frequency dependence of dielectric constant. Important applications of dielectric materials. Ultrasonics : Ultrasonics production – Magnetostriction and Piezoelectric methods – Application (NDT) non-destructive testing of materials- Flaw detection- Measurement of velocity in liquids. Determination of elastic constants in liquids using Ultrasonic Interferometer. Problems. UNIT – V 10 Hours Applied Optics Optics : Interference – thin films - Air wedge theory and experiment-Testing of flat surfaces. Anti reflection coating single and multi layer. Problems. Lasers : Principle and production. Einstein‟s coefficients (expression for energy density). Requisites of a Laser system. Condition for Laser action. Principle, Construction and working of Nd YAG and semiconductor diode Laser. Applications of Laser – Laser welding, cutting and drilling. Measurement of atmospheric pollutants. Problems. Optical Fibers : Introduction, Principle and Propagation of light in optical fibers. Angle of acceptance. Numerical aperture. Types of optical fibers and modes of propagation. Applications –optical fiber communication system. Problems. TEXT BOOKS:

1. M.N.Avadhanulu and P.G. Kshirsagar, “A Text Book of Engineering Physics”, S.Chand & Company Ltd, 9th Edition 2012.

2. John Wiley “Engineering Physics”,Wiley India Pvt. Ltd, 1st Edition 2014. 3. S.O. Pillai, “Solid State Physics”, New Age International, 6th Edition 2009. 4. S.P. Basavaraju, “ Engineering Physics”, Revised Edition 2009. 5. Charles Kittel, “Introduction to Solid State Physics” , 8th Edition. 6. Arthur Beiser, “Concepts of Modern Physics” , Special Indian Edition 2009. 7. Ajoy Ghatak, “Optics”,4th Edition 2009.

REFERENCE BOOKS:

1. R.K. Gaur and S.L. Gupta, "Engineering Physics", Dhanpatrai and Sons, New Delhi, 2001.

2. Sehgal Chopra Sehgal, “ Modern Physics ", Tata McGraw-Hill, 6th Edition, 2005. 3. Halliday, Resnick and Krane, "Fundamentals of Physics Extended",

John Wiley and Sons Inc., New York, 5th Edition, 1997. 4. P.Mani, “Engineering Physics”, Dhanam publishers, Revised Edition 2011. 5. H.J. Sawant, "Engineering Physics", Technical Publications, 1st Edition, 2010. 6. V. Rajendran, “Engineering Physics”, Tata Mcgraw Hill Publishing Company Limited,

1st Edition, 2009. 7. K.Eric Drexler, “Nanosystems - Molecular Machinery, Manufacturing and

Computation”, John Wiely & Sons, 2005. 8. J David, N Cheeke , “Fundamentals and Applications of Ultrasonic Waves”, CRC

Press 1st Edition, 2002. 9. Frederick J Bueche and Eugene Hecht “Schaum Outline of Theory and Problems of

College Physics”, Tata McGraw-Hill, 11th Edition, 2012.


28

10. M. Ali Omar, “ Elementary Solid State Physics”, Addison-Wesley 1st Edition, 1993.

Part – II- Physics Laboratory COURSE DESCRIPTION:

This paper contains ten experiments and aims at enabling the students to Practical Engineering Physics. COURSE OBJECTIVES:

To develop scientific and experimental skills of the students

To employ the theoretical principles with application based studies. LEARNING OUTCOME:

At the end of the course, the students will be familiarized with basic measuring instruments and will be able to relate the theoretical concepts through experiments.

LIST OF EXPERIMENTS

(Any Eight to be performed)

Basic Measuring Instruments

Vernier Callipers

Screw Gauge Travelling Microscope

1 Verification of Stefan‟s law 2 Planck‟s Constant (Determination of Planck‟s constant using LED or using the principle

of photoelectric effect) 3 Thermal Conductivity of a bad conductor – Lee‟s disc apparatus 4 Determination of Fermi energy 5 Young‟s modulus – Non-uniform bending 6 Measurement of Dielectric Constant (Charging & discharging of capacitor) 7 Ultrasonic Interferometer 8 Interference at a wedge 9 Laser Diffraction (Determination of grating constant and number of rulings per inch

using diffraction grating) 10 Frequency determination – Melde‟s apparatus 11 Photo Multiplier Tube – Demonstration only Text Books:

1. Physics Laboratory Manual for the First / Second Semester B.Tech, CUFE, 2015. Reference Book :

1. Sathyaseelan H, “Laboratory Manual in Applied Physics”, New Age International, 3rd Edition, 2012.


29

EE 133 / EE 233 BASICS OF ELECTRICAL ENGINEERING

COURSE OBJECTIVES At the end of the course students will be able

To identify and understand the electrical components.

To solve the AC and DC electrical network

To know the basic concepts of electrical power systems

To explain the working principle, construction, applications of power system components.

To understand the importance of renewable energy

To apply electrical knowledge in day-to-day life. SYLLABUS Unit-I: Basic Electrical Concepts 9 + 3 Hours Introduction to basic electrical quantities: Charge, Voltage, Current, Power and Energy. Active and passive elements – Basic Laws: Ohm‟s law - Kirchhoff‟s laws – Analysis of DC circuits– Direct method (only Branch current method) and Network Reduction method : Resistances in series, parallel, star and delta topology – Electromagnetism and its Applications - Faraday's Laws of electromagnetic induction - Lenz's law - Fleming's Right and Left Hand Rule. Unit-II: Single Phase AC Circuits 9 + 3 Hours Introduction to AC signal – Derivation of RMS, average, peak value of sinusoidal signal -Representation of AC signal - Relationship between voltage and current in circuits containing individual and combination of R, L and C- Impedance, Active, Reactive, Apparent power and Power Factor. Unit-III: Basics of Electrical Power System 9 + 3 Hours General structure of electrical power system - power transmission & distribution voltage levels - Power system components: Alternator, Transformer, Transmission line, Fuse, Miniature Circuit breaker (Construction and Working principle) – Introduction to three phase network, Comparison of Overhead and underground distribution System. Unit-IV: Electrical Energy Utilization 9 + 3 Hours Types of Loads and Tariff structure - Domestic wiring and its components: Incandescent lamp, fluorescent lamp, heater, protective devices and switches, Single phase Induction motors –Safety measures - Electrical engineering materials–conductor, insulator and semiconductor materials in electrical system - Electrical Energy conservation: Necessity and Measures.


30

Unit-V: Renewable and Non-renewable Energy Sources 9 + 3 Hours Sources of energy - Power generation: thermal, hydel, nuclear - Advantages of renewable energy sources - Power generation: solar, wind, tidal, biomass, OTEC, geothermal – Electrical characteristics of PV cell. COURSE LEARNING OUTCOMES At the end of the course students

Will be able to identify and analyze the different types of dc and ac circuitsand determine the various electrical quantities related to it.

Gain the thorough knowledge of power system components, generation, transmission and distribution system.

Will be able to explain the different types of loads and tariff schemes.

Describe the importance of Electrical Energy conservation and Effective usage of Electrical energy.

Will be able to explain the principle of various generating plant both renewable and non-renewable.

TEXT BOOKS 1. Arthur Eugene Fitzgerald, David E. Higginbotham, Arvin Grabel, “Basic electrical engineering: circuits, electronics, machines, controls”, McGraw-Hill, Fifth Edition. 2. E. Hughes; “Electrical Technology",9th Edition”, Pearson, 2005. REFERENCE BOOKS 1. Dr. K Uma Rao and Dr. A Jayalakshmi, “Basic Electrical Engineering”, Revised Edition,

Sanguine Technical publishers, 2014. 2. Kothari D. P. & Nagarath I. J, “Basic Electrical Technology”, TMH, 2004 3. Rajendra Prasad, “Fundamentals of Electrical Engineering”, Prentice Hall of India Pvt.

Ltd., 2005 4. K.A. Krishnamurthy and M.R Raghuveer, “Electrical, Electronics and Computer

Engineering”, 2nd Edition, T.M.H., 2001 5. D C Kulshreshtha, “Basic Electrical Engineering”, TMH. 6. Abhijit Chakrabarti, Sudipta Nath & Chandan Kumar Chanda, “Basic Electrical

Engineering”, TMH, 2009.

ELECTRICAL ENGINEERING EXPERIMENTS:

COURSE OBJECTIVESS

To develop scientific and experimental skills of the students

To correlate the theoretical principles with application based studies. (60% of syllabus by Electrical Engineering and 40 % of syllabus by Civil Engineering)

SYLLABUS

List of Experiments

1. Circuit Laws: a. Verification of Kirchhoff‟s Voltage Law. b. Verification of Kirchhoff‟s Current Law.

2. Wiring Practice and its cost estimation:


31

a. Multiple switching operation b. Two way switching operation c. AND/OR logic implementation

3. Measurement of Electrical Energy: a. Single Phase AC circuit with R Load b. Single Phase AC circuit with R L Load

4. Measurement of phase angle difference (Power Factor) between supply voltage and supply current:

a. Single Phase R-L circuit b. Single Phase R-C circuit

5. Fault Detection and Rectification of home appliances such as Ceiling Fan, Table Fan, Electric Iron, and Electric Stove.

6. Determination of Electrical Characteristics of Photovoltaic Cells. 7. Demonstration of Assembling of Electrical Machines.

REFERENCES 1. Electrical Workshop Laboratory Manual for the First / Second Semester B. Tech,

CUFE, 2015. 2. Nagasarkar T. K. &Sukhija M. S., “Basic Electrical Engineering”, OUP 2005 3. Kothari D. P. &Nagarath I. J, “Basic Electrical Technology”, TMH 2004 4. Rajendra Prasad, “Fundamentals of Electrical Engineering”, Prentice Hall of India Pvt.

Ltd., 2005


32

CE 134 /CE 234 BASICS OF CIVIL ENGINEERING AND ENGINEERING MECHANICS

COURSE OBJECTIVES

The students will understand the basics of civil engineering and Engineering Mechanics

The students will understand the basic principles, laws, measurements, calculations and SI units.

The students will understand mechanics that studies the effects of forces and moments acting on rigid bodies that are either at rest or moving with constant velocity along a straight path for static condition only.

The students will understand the basic concepts of forces in the member, centriod, moment of inertia & friction

SYLLABUS UNIT – I 5 Hours

Scope of different fields of Civil Engineering: Structural Engineering, Geotechnical Engineering, Environmental Engineering, Water Resources Engineering, Transportation Engineering. Materials of construction - Stones, Bricks, Tiles, Timber, PCC, RCC, PSC and composite materials.

UNIT-II 10 Hours

Introduction to Engineering Mechanics: Rigid and deformable bodies, Definition of Force, classification of force systems, couples and their characteristics, Composition (resultant) and resolution (components) of forces, Resultant of coplanar concurrent and non concurrent force systems.

UNIT-III: 12 Hours

Equilibrium of force systems: Equilibrium of coplanar concurrent and non-concurrent system of forces, conditions of equilibrium, types of loads and supports, types of beams. Support Reactions of single span beams and trusses.

UNIT-IV: 9 Hours

Centroid and moment of inertia: Definition of centroid and centre of gravity, Centroid of simple plane figures, centroid of built up sections, definition of Moment of inertia / Second Moment of area, radius of gyration, Parallel axis theorem and Perpendicular axis theorem, MI of compound areas, Polar MI and radius of gyration.

UNIT-V: 9 Hours

Friction: Introduction, Laws of static friction, limiting friction, angle of friction, angle of repose, block friction on horizontal and inclined planes, ladder and wedge friction.

COURSE LEARNING OUTCOMES On completion of the course the student would able to:


33

Solve problems dealing with forces in a plane or space and equivalent force system in equilibrium. The student would be able to determine the support reactions for various types of structural supports of a determinate structure with point load, uniformly distributed load and uniformly varying loads. The student would also be able to determine centroids and moment of Inertia of regular and irregular bodies and solve problems involving bodies in frictional contact. COURSE LEARNING OUTCOMES At the end of this course, students should be able

To demonstrate the relationship between voltage and current in resistive as well as inductive circuit.

To demonstrate various wiring topologies of house hold applications such as stair-case wiring, three wire control etc.

To familiarize the significance of power factor in an AC circuit and its improvement.

To understand working of a single phase transformer and various losses associated with the same.

To measure energy using an energy meter.

CIVIL ENGINEERING EXPERIMENTS

1. Test on Building Bricks: Compressive strength and Water Absorption test on Bricks with

reference to IS: 3495(Part-1 and 2)-1992

2. Test on Flooring and Roofing Tiles: Abrasion value test on flooring tile and Water

absorption test on roofing tiles with reference to IS 1237 : 2012 and IS 654-1992

3. Tests on Fine aggregates: Water absorption/Moisture content, Specific gravity and Sieve

analysis with reference to IS: 383-1970

4. Tests on Coarse aggregates: Water absorption/Moisture content, Specific gravity and Sieve

analysis with reference to IS: 383-1970

5. To measure the distance between two points using direct ranging.

6. To set out perpendiculars at various points on given line using cross staff, optical square and

tape

7. Setting out of rectangle, hexagon using tape/chain and other accessories.

TEXT BOOKS 1. Bhavikatti S.S. “Elements of Civil Engineering (IV Edition) and Engineering

Mechanics”,2/E, Vikas Publishing House Pvt. Ltd., New Delhi, 2008 2. Jagadeesh T.R. and Jay Ram, “Elements of Civil Engineering and Engineering

Mechanics”, 2/E, Sapana Book House, Bangalore, 2008. 3. Shesh Prakash and Mogaveer, “Elements of Civil Engineering and Engineering

Mechanics”, 1/E, PHI learning Private Limited, New Delhi, 2009. REFERENCE BOOKS


34

1. Bansal R. K, “Engineering Mechanics”, LaxmiPublications(P) Ltd, New Delhi, 1995 2. Ferdinand P. Beer and E. Russel Johnston Jr., “Mechanics for Engineers: Statics”,8/E, McGraw-Hill Book Company, New Delhi. 2007 3. Goyal and Raghuvanshi., “Engineering Mechanics”, New Edition, PHI learning

Private Limited, New Delhi. 4. Irvingh H Shames, “Engineering Mechanics”, 4/E, PHI learning Private Limited,

New Delhi, 2008 5. Jivankhachane&Ruchishrivasatava, “Engineering Mechanics”, Ane‟s Student

Edition, Anne Book India, New Delhi, 2006. 6. Kolhapure B.K., “Elements of Civil Engineering & Engineering Mechanics”, 1/E,

EBPB Publications, Belgaum, 2003. 7. Lakshmana Rao, et al., “Engineering Mechanics - Statics and Dynamics”, New

Edition, PHI learning Private Limited, 2009. 8. Meriam J. L, and Kraige., L. G , “Engineering Mechanics”, 5/E, Volume I, Wiley

India Edition, India, 2009. 9. Nelson, “Engineering Mechanics”, New Edition, Tata McGraw-Hill Education Pvt.

Ltd, 2009 10. Palanichamy M.S., “Engineering Mechanics (Statics & Dynamic)”, 3/E, Tata

McGraw-Hill Education Pvt. Ltd, New Delhi, 2008. 11. Sawant H. J, &Nitsure.,“Elements of Civil Engineering (IV Edition) and Engineering

Mechanics”, New Edition, Technical publications, Pune, India, 2010. 12. Sawhney, “Engineering Mechanics”, New Edition, PHI learning Private Limited,

New Delhi, 2008. Timoshenko and Yong, “Engineering Mechanics”, 5/E, Tata McGraw-Hill Book Company, New Delhi, 2007.

13. Kukreja C.B., Kishore K.Ravi Chawla., “Material Testing Laboratory Manual”,

Standard Publishers & Distributors 1996

14. Gambhir M.L., “Concrete Manual”, Dhanpat Rai & Sons, New Delhi.

15. Duggal S.K., “Surveying”, Vol-I”, Tata McGraw Hill - Publishing Co. Ltd. New

Delhi.

16. Punmia. B.C., “Surveying Vol–1”, Laxmi Publications, New Delhi


35

PROFESSIONAL DEVELOPMENT- I PD136/PD236 COURSE OBJECTIVES Upon Successful completion of this course, the student will have reliably demonstrated the ability to respond effectively, efficiently, and appropriately to writing in ways that demonstrate comprehension and evaluation of its purpose and meaning. Able to make an organized and complete oral presentation to meet the needs of individuals and small groups. SYLLABUS Unit-I Business Communication 12 Hours Introduction: Role of communication – defining and classifying communication – purpose of communication – process of communication – characteristics of successful communication –Barriers of Communication- Importance of communication in management – communication structure in organization :Formal and informal communication– Communication in crisis. HR interaction on Business communication Oral communication: Principles of successful oral communication – barriers to communication –conversation control – reflection and empathy: two sides of effective oral communication – effective listening – non – verbal communication. Unit-II Soft Skills and Employment Communication 12 Hours Personality development, Emotional intelligence, Lateral thinking, Leadership skills, Assertiveness, Teams man ship , Time management, Presentation skills, Group discussions and personal interviews. Business etiquette. , Body Language, Understanding Personal Space, Cross Cultural Communication, Conflict Resolution, Stress Management, Appropriate humour at workplace. HR interaction on presentation skills Unit - III Functional English Grammar 12 Hours Parts of Speech, Phrases & Clauses ,Tenses, Concord ,Passive and Active Voice, Run on, fragments, Parallel Structure, Vocabulary – Commonly confused and misused words. Idioms, Misplaced & Dangling Modifiers. Unit- IV Reading and Case method of learning 12 Hours Regular & Extended paragraphs, Types of paragraphs, Topic sentence, supporting evidence. Analysis of regular & extended Paragraphs. Different types of paragraphs. HR interaction

on case study. Understanding the case method of learning – different types of cases – analyzing a case . (Previewing, skimming, reading, scanning). – Do‟s and don‟ts for case preparation. Purpose of writing – clarity in writing –Principles of effective writing. Pre writing – Writing – Revising – Editing. Specific writing features – Unity & coherence in writing. Business letters: Introduction to business letters – writing routine and persuasive letters – positive and negative messages- writing memos – what is a report, types of reports- purpose and objectives of reports. Unit- V Academic Writing 12 Hours Patterns of Essay development-Analysis of academic essays- Pre writing techniques. Thesis statement and supporting details. Purpose of writing – clarity in writing –Principles of effective writing - unity , coherence, support &sentence skill in writing. Essay outline.


36

Different types of Academic Essays. Narratives, descriptive, classification, comparison and contrast. Argumentative and process essays. COURSE LEARNING OUTCOMEs

Ability to communicate and interact

Ability to write essays and improve the articulation of writing TEXT BOOK

1. Business communication: Concepts , cases and applications – P D Chaturvedi, mukesh Chaturvedi Pearson Education 1/e,2004 (module1,2,4,5,&7)

REFERENCE BOOKS 1. College Writing Skills with Readings: John Langan. 2. Business Communication, process and Product – Mary Ellen Guffey – Thomson

Learning, 3/E, 2002 (Module 3) 3. Basic Business Communication – Lesikar , Flatley TMH10/E, 2005 (Module

1,2,4,5,&7) 4. Business Communication, M K Sehgal & V Khetrapal, Excel Books. 5. Effective Technical Communication By M Ashraf Rizvi – TMH 2005 6. Business Communication Today by Bovee Thill Scatzman – Pearson & Education , 7th

Ed,2003 7. Contemporary Business Communication – Scot Ober-Bitztanntra,5/e 8. Business Communication – Krizan , Merrier, Jones- Thomson Learning , 6/e, 2005 9. Business Communication – Meenakshi Raman. Prakash Singh.


37

ME 136 / ME 236 ENGINEERING GRAPHICS

COURSE OBJECTIVES

To draw and interpret various projections of 1D, 2D and 3D objects..

To prepare and interpret the drawings.

Hands on training in Solid Edge.

SYLLABUS UNIT - I Introduction to Computer Aided Sketching 6 Hours Introduction, Drawing Instruments and their uses, BIS conventions, Lettering, Dimensioning and free hand practicing. Computer screen, layout of the software, standard tool bar/menus and description of most commonly used tool bars, navigational tools. Co-ordinate system and reference planes. Definitions of HP, VP, RPP & LPP. Creation of 2D/3D environment. Selection of drawing size and scale. Commands and creation of Lines, Co-ordinate points, axes, poly-lines, square, rectangle, polygons, splines, circles, ellipse, text, move, copy, off-set, mirror, rotate, trim, extend, break, chamfer, fillet, curves, constraints viz. tangency, parallelism, inclination and perpendicularity. Dimensioning, line conventions, material conventions and lettering UNIT – II Orthogonal Projections 15 Hours Introduction, Definitions - Planes of projection, reference line and conventions employed, Projections of points in all the four quadrants, Projections of straight lines (located in First quadrant/first angle only), True and apparent lengths, True and apparent inclinations to reference planes (No application problems). UNIT – III Orthographic Projections of Plane Surfaces (First Angle Projection Only) 15 Hours Introduction, Definitions – projections of plane surfaces – triangle, square, rectangle, rhombus, pentagon, hexagon and circle, planes in different positions by change of position method only (No problems on punched plates and composite plates) UNIT – IV PROJECTIONS OF SOLIDS 18 Hours Introduction, Definitions – Projections of right regular tetrahedron, hexahedron (cube), prisms, pyramids, cylinders and cones in different positions. (No problems on octahedrons and combination solid). UNIT – V Sections And Development of Lateral Surfaces of Solids 15 Hours Introduction, Section planes, Sections, Section views, Sectional views, Apparent shapes and True shapes of Sections of right regular prisms, pyramids, cylinders and cones resting with base on HP. (No problems on sections of solids) Development of lateral surfaces of above solids, their frustums and truncations. (No problems on lateral surfaces of trays, tetrahedrons, spheres and transition pieces). UNIT – VI Isometric Projection (Using Isometric Scale Only) 15 Hours Introduction, Isometric scale, Isometric projection of simple plane figures, Isometric projection of tetrahedron, hexahedron(cube), right regular prisms, pyramids, cylinders, cones, spheres, cut spheres and combination of solids (Maximum of three solids).


38


o Will be in a position to convert vision /imagination into reality. o Acquires knowledge of scaling. o Can develop plan and elevation of geometrical objects. o Can produce development of surfaces. o Draw isomertic projection of objects.

TEXT BOOKS 1. K.R. Gopalakrishna, “Engineering Graphics”, 15th Edition, Subash Publishers Bangalore. 2. Basant Agrawal, C. M. Agrawal, “Engineering Drawing”, TMH. 3. N.D. Bhatt, “Engineering Graphics, Elementary Engineering Drawing”, 48th Edition, Charotar Publishing House, 2005. 4. S. Trymbaka Murthy, “Computer Aided Engineering Drawing”, I.K. International Publishing House Pvt. Ltd., New Delhi. 5. P. J. Shah, “A Text Book og Engineering Graphics”, S. Chand & Company Ltd., New Delhi 6. Arunoday Kumar, “Engineering Graphics – I and II”, Tech – Max Publication, Pune. 7. T. Jeyapoovan, “Engineering Drawing & Graphics using Auro CAD 2000”, Vikas Publishing Hoise Pvt. Ltd. , New Delhi. 8. R. K. Dhawan, “A Text Book of Engineering Drawing”, by S. Chand & Company Ltd., New Delhi. 9. P. S. Gill, “A Text Book of Engineering Drawing”, S K Kataria & sons, Delhi. 10. D. A. Jolhe, “Engineering Drawing with an Introduction to Auto CAD”, D. A. Jolhe Tata McGraw – Hill Publishing Co. Ltd., New Delhi. 11. S. Trymbaka Murthy, “Computer Aided Engineering Drawing”, I.K. International Publishing House Pvt. Ltd., New Delhi. NOTE: Examination comprise 30% manual drawing and 70% using software


39

SEMESTER III L : T: P (45 Hrs)

MA 334 DISCRETE MATHEMATICS (CSE, IT)

COURSE DESCRIPTION: To extend student‟s mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems. COURSE OBJECTIVE: The objective of the paper is to develop:

the knowledge of the concepts needed to test the logic of a program.

knowledge which has application in expert system, in data base and a basic for the prolog language.

an understanding in identifying patterns on many levels.

awareness about a class of functions which transform a finite set into another finite set that relates to input output functions in computer science.

UNIT – I: PROPOSITIONAL CALCULUS 12 HOURS

Propositions – Logical connectives – Compound propositions – Conditional and bi conditional propositions – Truth tables – Tautologies and contradictions – Contrapositive – Logical equivalences and implications – De Morgan‟s Laws - Normal forms – Principal conjunctive and disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.

UNIT – II: PREDICATE CALCULUS 12 HOURS

Predicates – Statement function – Variables – Free and bound variables – Quantifiers – Universe of discourse – Logical equivalences and implications for quantified statements – Theory of inference – The rules of universal specification and generalization – Validity of arguments.

UNIT – III: SET THEORY 12 HOURS

Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and Cartesian product – Relations on sets –Types of relations and their properties – Matrix and Graph representation of a relation – Partial ordering – Poset – Hasse diagram – Lattices and their properties – Sublattices – Boolean algebra.

UNIT – IV: FUNCTIONS 12 HOURS

Definitions of functions – Classification of functions –Types of functions - Examples – Composition of functions – Inverse functions – Characteristic function of a set – Hashing functions – Permutation functions.

UNIT – V: GROUPS 12 HOURS


40

Groups - Properties – Subgroups - Cosets and Lagrange‟s theorem – Normal subgroups – Algebraic system with two binary operations – Preliminaries of Coding - Hamming Metric - group codes: – Basic notions of error correction - Error recovery in group codes.

COURSE OUTCOMES: At the end of the course the students would be exposed to concepts and properties of algebraic structures such as semigroups, monoids and groups. Also students would be capable of understanding the concept and applications of propositional and predicate calculus. TEXT BOOKS 1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to

Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003. 2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied

Introduction”, Fourth Edition, Pearson Education Asia, Delhi, 2002. REFERENCE BOOKS 1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical

Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Fifth Edition, Tata McGraw – Hill Pub. Co. Ltd., New Delhi, 2003.

2. Richard Johnsonbaugh, “Discrete Mathematics”, Fifth Edition, Pearson Education Asia, New Delhi, 2002.


41

CS332 OPERATING SYSTEMS L : T : P (45Hrs) COURSE OBJECTIVES 3: 0 : 1

To have an overview of different types of operating systems To know the components of an operating system. To have a thorough knowledge of process management To have a thorough knowledge of storage management To know the concepts of I/O and file systems.

UNIT 9+3 Hours

Introduction: Categories of Operating Systems, Computer-System Organization, Computer-System Architecture, Operating-System Structure, Operating-System Operations.

System Structures: Operating-System Services, User Operating-System Interface, System Calls, Types of System Calls, System Programs.

Process Management: Process Concept, Process Scheduling, Operations on Processes, Cooperating Processes, Inter-process Communication.

UNIT II 9+3 Hours

Multithreaded Programming: Overview, Multithreading models, threading issues.

Process Scheduling: CPU Scheduling, Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread Scheduling, Multiple-Processor Scheduling.

Synchronization: The Critical-Section Problem, Peterson‟s Solution, Synchronization Hardware, Semaphores, Classic problems of Synchronization, Monitors.

UNIT III 9+3 Hours

Deadlocks: System Model, Deadlock Characterization, Methods for handling Deadlocks -Deadlock Prevention, Deadlock avoidance, Deadlock detection, Recovery from Deadlocks.

Memory Management Strategies: Swapping, Contiguous Memory allocation, Paging, Structure of the Page Table, Segmentation.

UNIT IV 9+3 Hours

Virtual Memory Management: Demand Paging, Copy-on-Write, Page Replacement, Allocation of frames, Thrashing.

File System: File Concept, Access Methods, Directory and Disk Structure, File System Mounting, File Sharing, Protection.


42

UNIT V 9+3 Hours

Implementing File Systems: File System Structure, File System Implementation, Directory Implementation, allocation Methods, Free-space Management.

Secondary Storage Structure: Disk Structure, Disk Attachment, Disk Scheduling, Disk Management and Swap-Space Management. Case study.


Demonstrate the working of an OS, explain the structure of operating systems, applications, and the relationship between them.

Able to implement/ simulate some process/ memory management function of OS.

TEXT BOOK

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, Ninth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2013..

REFERENCE BOOKS

1. Harvey M. Deitel, “Operating Systems”, Third Edition, Pearson Education Pvt. Ltd, 2007.

2. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2009.

3. William Stallings, “Operating System”, Pearson Education 2009 4. Pramod Chandra P. Bhatt – “An Introduction to Operating Systems, Concepts

and Practice”, PHI, 2010.


43

EC334 DIGITAL SYSTEMS L : T : P (45+15 Hrs)

3 : 1 : 0 COURSE OBJECTIVES

To study the switching theory and the realization of logic gates. To study minimization methods. To study combinational circuits. To study sequential circuits.

UNIT I INTRODUCTION 9 + 3 Hours

Switching Theory: Laws of Boolean algebra, Theorems of Boolean algebra, Switching functions, Methods for specification of switching functions - Truth tables and Algebraic forms, Realization of functions using logic gates. Digital Logic Elements: Electronic logic gates, Positive and negative logic, Logic families -TTL, ECL and CMOS, Realization of logic gates.

UNIT II BOOLEAN ALGEBRA 9 + 3 Hours

Simplification of Boolean Expressions and Functions: Algebraic methods, Canonical forms of Boolean functions, Minimization of functions using Karnaugh maps, Minimization of functions using Quine-McClusky method.

UNIT III COMBINATIONAL CIRCUITS 9 + 3 Hours

Design of Combinational Logic Circuits: Gate level design of Small Scale Integration (SSI) circuits, Modular combinational logic elements - Decoders, Encoders, Priority encoders, Multiplexers and Demultiplexers. Design of Integer Arithmetic Circuits using Combinational Logic: Integer adders - Ripple carry adder and Carry look ahead adder, Integer subtractors using adders, Unsigned integer multipliers - Combinational array circuits, Signed integer multipliers - Booth's coding, Bit-pair recoding, Carry save addition and Wallace tree multiplier, Signed integer division circuits - Combinational array circuits, Complexity and propagation delay analysis of circuits. Design of Combinational Circuits using Programmable Logic Devices (PLDs): Programmable Read Only Memories (PROMs), Programmable Logic Arrays (PLAs), Programmable Array Logic (PAL) devices, Design of multiple output circuits using PLDs.

UNIT IV SEQUENTIAL CIRCUITS 9 + 3 Hours

Sequential Circuit Elements: Latches -RS latch and JK latch, Flip-flops-RS, JK, T and D flip flops, Master-slave flip flops, Edge-triggered flip-flops. Analysis and Design of Synchronous Sequential Circuits: Models of sequential circuits - Moore machine and Mealy machine, Flip-flops - Characteristic table, Characteristic equation and Excitation table, Analysis of sequential circuits- Flipflop input expressions, Next state equations, Next state maps, State table and State transition diagram, Design of sequential circuits


44

- State transition diagram, State table, Next state maps, Output maps, Expressions for flip-flop inputs and Expressions for circuit outputs, Modular sequential logic circuits- Shift registers, Registers, Counters and Random access memories, Design using programmable logic sequencers (PLSs). Design of Arithmetic Circuits using Sequential Logic : Serial adder for integers, Unsigned integer multiplier, Unsigned integer division circuits, Signed integer division, Floating-pint adder/subtractor - Design of control circuit, Floating - point multiplier.

UNIT V CASE STUDY AND INFORMAL LABORATORY 9 + 3 Hours

Case study: Learn the Fundamentals of Digital Logic Design with VHDL

Informal Laboratory:

Design and implementation of binary adder / subtractor using basic gates Design and implementation of applications using multiplexers Design and implementation of Synchronous & Asynchronous Counters Design and implementation of Shift Registers Coding Combinational Circuits using Hardware Description Language

(HDL)


Students will be able to design and implement new circuits with their understanding of the basics of switching theory, combinational circuits and sequential circuits.

TEXT BOOKS

1. Donald P Leach, Albert Paul Malvino & Goutam Saha, “Digital Principles and Applications” , Tata McGraw Hill 7th Edition, 2010.

REFERENCE BOOKS

Stephen Brown. Zvonko Vranesic, “Fundamentals of Digital Logic Design with VHDL”, Tata McGraw Hill, 2nd Edition 2005.

R D Sudhaker Samuel, “Illustrative Approach to Logic Design. Sanguine-Pearson”, 2010.

Charles H. Roth, “Fundamentals of Logic Design”, Cengage Learning, 5th Edition, 2004.

Ronald J. Tocci, Neal S. Widmer. Gregory L. Moss, “Digital Systems Principles and Applications, ” 10th Edition. Pearson Education, 2007.

M Morris Mano, “Digital Logic and Computer Design”, Pearson Education, 10th Edition, 2008.


45

CS334 OBJECT ORIENTED PROGRAMMING CONCEPTS L : T : P (45 Hrs)

3 : 0 : 1

COURSE OBJECTIVES:

Software development in business environment has become more sophisticated, the software implementation is becoming increasingly complex and requires the best programming paradigm which helps to eliminate complexity of large projects. Object Oriented Programming (OOP) has become the predominant technique for writing software at present. Many other important software development techniques are based upon the fundamental ideas captured by object-oriented programming. By the end of this COURSE, the student should acquire the basic knowledge and skills necessary to implement object-oriented programming techniques in software development.

UNIT I: AN INTRODUCTION TO JAVA 9 Hours Java As a Programming Platform – The Java “White COURSE” Buzzwords – Java Applets and the Internet – A Short History of Java – Common Misconceptions about Java – Installing the Java Development Kit – Choosing a Development Environment – Using the Command-Line Tools – Using an Integrated Development Environment – A Simple Java Program –Comments – Data Types – Variables – Operators – Strings – Input and Output – Control Flow – Big Numbers – Arrays.

UNIT II: OBJECTS, CLASSES AND INHERITANCE 9 Hours

Introduction to Object-Oriented Programming – Using Predefined Classes – Defining Your Own Classes – Static Fields and Methods – Method Parameters – Object Construction – Packages – The Class Path – Documentation Comments – Class Design Hints – Classes, Superclasses, and Subclasses – Object: The Cosmic Superclass – Generic Array Lists – Object Wrappers and Autoboxing – Methods with a Variable Number of Parameters – Enumeration Classes – Reflection – Design Hints for Inheritance

UNIT III: INTERFACES, INNER CLASSES, EXCEPTIONS, DEBUGGING 9 Hours Interfaces – Object Cloning – Interfaces and Callbacks – Inner Classes – Proxies – Dealing with Errors – Catching Exceptions – Tips for Using Exceptions – Using Assertions – Logging Debugging Tips – Using a Debugger UNIT IV: COLLECTION 9 Hours Collection Interfaces – Concrete Collections – The Collections Framework – Algorithms – Legacy Collections UNIT V: GENERICS, INTRODUCTION TO OBJECT-ORIENTED MODELING 9 Hours Why Generic Programming? – Defining a Simple Generic Class – Generic Methods – Bounds for Type Variables – Generic Code and the Virtual Machine – Restrictions and Limitations – Inheritance Rules for Generic Types – Wildcard Types – Reflection and Generics – Case Study: Introduction - A Short Tour of UML - The Use Case Diagram -


46

The Class Diagram - The State Machine Diagram - The Sequence Diagram - The Activity Diagram - All Together Now COURSE LEARNING OUTCOMES

At the end of this course student will:

1. Solve problems using object oriented programming principles. 2. Develop the ability to solve real-world problems through software development

in high-level programming language like Java. 3. Illustrate understanding of the fundamentals and programming skills in the Java

language. TEXT BOOKS 1. Cay S. Horstmann, Gary Cornell, “Core Java, Volume I – Fundamentals”, Prentice Hall, Ninth Edition, November 2012. 2. Seidl, M., Scholz, M., Huemer, C., Kappel, G , “UML @ Classroom An Introduction to Object-Oriented Modeling Series: Undergraduate Topics in Computer Science”, Springer, 2014, XII. REFERENCE BOOKS

1. Cay S. Horstmann , “Java SE8 for the Really Impatient: A Short Course on the Basics (Java Series)”, January 24, 2014 2. Herbert Schildt, “Java: The Complete Reference (Complete Reference Series)”,

Ninth Edition – March 11, 2014 3. Bruce Eckel, “Thinking in Java”, 4th Edition, February 20, 2006, 4. Doug Rosenberg, Matt Stephens, “Use Case Driven Object Modeling with UML:

Theory and Practice (Expert's Voice in UML Modeling)”, January 16, 2013.


47

CS335 COMPUTER ORGANIZATION AND ARCHITECTURE L : T : P (45 + 15) 3 : 1 : 0 COURSE OBJECTIVES To have a thorough understanding of the basic structure and operation of a digital

computer. To discuss in detail the operation of the arithmetic unit including the algorithms &

implementation of fixed-point and floating-point addition, subtraction, multiplication & division.

To study in detail the different types of control and the concept of pipelining. To study the hierarchical memory system including cache memories and virtual

memory. To study the different ways of communicating with I/O devices and standard I/O

interfaces. UNIT I FUNDAMENTALS OF A COMPUTER SYSTEM 9+3 Hours Functional Units of a Digital Computer – Hardware – Software Interface –Translation from a High Level Language to the Hardware Language – Instruction Set Architecture – Styles and features – RISC and CISC Architectures – Performance Metrics – Amdahl‟s Law – Case Studies of ISA. UNIT II BASIC PROCESSING UNIT 9+3 Hours Components of the Processor – Datapath and Control – Execution of a Complete Instruction – Hardwired and Micro programmed Control – Instruction Level Parallelism – Basic Concepts of Pipelining – Pipelined Implementation of Datapath and Control – Hazards – Structural, Data and Control Hazards –Exception handling. UNIT III ADVANCED CONCEPTS IN ILP AND CURRENT TRENDS

9+3 Hours Exploitation of more ILP – Hardware and Software Approaches – Dynamic Scheduling – Speculation – Compiler Approaches – Multiple Issue Processors. – ILP and Thread Level Parallelism – Current Trends – Multicore Processors – Graphics and Computing GPUs. UNIT IV ARITHMETIC FOR COMPUTERS 9+3 Hours Addition and Subtraction – Fast Adders – Binary Multiplication – Binary Division – Floating Point Numbers – Representation, Arithmetic Operations. UNIT V MEMORY AND I/O 9+3 Hours Need for a hierarchical memory system – Types and characteristics of memories – Cache memories – Improving cache performance – Virtual memory – Memory management techniques – Associative memories. Accessing I/O devices – Programmed Input/Output – Interrupts – Direct Memory Access – Interface circuits – Need for Standard I/O Interfaces like PCI, SCSI, USB. COURSE LEARNING OUTCOMES Analyze and implement basic units of a digital computer. Describe the different ways of control unit design. Demonstrate the arithmetic unit including the algorithms & implementation of fixed-

point and floating-point addition, subtraction, multiplication & division.


48

Demonstrate different ways of communicating with I/O devices and standard I/O interfaces.

Demonstrate the hierarchical memory system including cache memories and virtual memory.

TEXT BOOKS

1. David A. Patterson and John L. Hennessy, “Computer Organization and Design: The Hardware/Software Interface”, Fourth Edition, Morgan Kaufmann / Elsevier, 2009.Ed REFERENCE BOOKS

1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian, “Computer Organization and Embedded Systems”, Sixth Edition, Tata McGraw Hill, 2012.

2. William Stallings, “Computer Organization and Architecture – Designing for Performance”, Sixth Edition, Pearson Education, 2003.

3. John P. Hayes, “Computer Architecture and Organization”, Third Edition, Tata McGrawHill, 1998.

4. John L. Hennessey and David A. Patterson, “Computer Architecture – A Quantitative Approach”, Morgan Kaufmann / Elsevier Publishers, Fifth Edition, 2012.


49

CS336 COMPUTER GRAPHICS WITH OPEN GL L : T : P (45 Hrs) 3 : 0 : 0 COURSE OBJECTIVES

To provide a strong foundation on concept of Computer Graphics

To understand the techniques of transformations

To study the various graphics devices

To study OpenGL in Java and JOGL

UNIT – I 7 Hours A survey of Computer Graphics, Video Display Devices, Raster-Scan Systems, Graphics Workstation and Viewing Systems, Input Devices, Hard-Copy Devices, Graphics Networks, Graphics on the Internet. UNIT – II 11 Hours Line Drawing Algorithms, DDA Algorithms, Bresenham's Line Algorithm, Circle-Generating Algorithms, Midpoint Circle Algorithms, Ellipse Algorithms, Basic Two Dimensional Transformations, Matrix Representation, Three Dimensional Translation, Three Dimensional Rotation, Three Dimensional Scaling, Other Three Dimensional Transformations - Reflection and Shears. UNIT – III 10 Hours Java Graphics in 2D, Two-Dimensional Graphics in Java, Transformations and Modeling, Basics of OpenGL and JOGL, Basic OpenGL 2D Programs, Into the Third Dimension, Drawing in 3D, Normal and Textures UNIT – IV 8 Hours Geometry, Vectors, Matrices and Homogeneous Coordinates, Primitives, Polygonal Meshes, Drawing Primitives, Viewing and Projections, Perspective Projection, Orthographic Projection, The Viewing Transform, A Simple Avatar, Viewer Nodes in Scene Graphics UNIT – V 9 Hours Light and Material, Vision and Color, OpenGL Materials, OpenGL Lighting, Lights and Materials in Scenes, Case Study: Textures, Texture targets, Mipmaps and Filtering, Texture Transformations, Creating Texture with OpenGL, Loading Data into Texture, Texture Coordinate Generation, Texture Objects COURSE LEARNING OUTCOMES

1. Students will be able to implement algorithms for drawing basic graphics shapes

2. Students will be able to implement transformation algorithms

3. Students will be able to program in Java OpenGL and JOGL

4. Students will be able to implement various projections using JOGL

5. Students will be able to create graphics with texture and lighting

TEXT BOOKS:


50

1. David J. Eck, “Fundamentals of Computer Graphics with Java, OpenGL and JOGL”, 2010.

2. Donald Hearn, Pauline Baker, Warren Carithers, “Computer Graphics with OpenGL”, 4th Edition Pearson, 2010

REFERENCE BOOKS:

1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, PearsonEducation, 2003.

2. Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”,Pearson Education, second edition 2003.


51

CS351 OBJECT ORIENTED PROGRAMMING CONCEPTS LABORATORY 1. Implementation of Simple Java programs to understand data types, variables, operators, strings, input and output, control flow, arrays. 2. Implementation of Classes and Objects – static fields, methods, method parameters, object construction. 3. Implementation of Packages, its use, how to create a package with several classes in different locations. 4. Implementation of Inheritance – how inheritance is handled using java keywords: extends and implements. 5. Implementation of Interfaces – programs on usage, its requirement e.g. callbacks. 6. Implementation of Inner classes – programs on inner classes, proxies. 7. Implementation of Exceptions. 8. Implementation of Debugging using Assertions, logging and using a debugger. 9. Implementation of Generic programming. 10. Implementation of Collections. COURESE LEARNING OUTCOMES:

Ability to implement the object oriented concepts like inheritance, polymorphism ,etc.,

Ability to implement collections and genetic programming.


52

CS352 OPERATING SYSTEM LABORATORY

(Implement the following on LINUX platform. Use C for high level language 1. Shell programming

a. command syntax b. write simple functions c. basic tests

2. Shell programming a. expansions b. substitutions

3. Write programs using system calls of UNIX operating system. 4. Write programs using the I/O system calls of UNIX operating system. 5. Implement the following CPU scheduling algorithm compute average waiting time and average turnaround time

a. FCFS b. Round Robin c. Shortest Job First d. Priority 6. Implement the Inter Process Communication. (Creation of Shared memory Segment/Semaphores). 7. Implement Bankers Algorithm. 8. Implement some memory management schemes – I 9. Implement some memory management schemes – II 10. Implement File Locking.

COURESE LEARNING OUTCOMES:

Ability to implement the different CPU scheduling algorithms.

Ability to implement various memory management techniques.


53

SEMESTER IV CS431 PROBABILITY AND QUEUING THEORY L : T : P (45 Hrs) 3 : 0 : 0 COURSE OBJECTIVES At the end of the course, the students would Have a fundamental knowledge of the basic probability concepts. Have a well – founded knowledge of standard distributions which can describe real life phenomena. Acquire skills in handling situations involving more than one random variable and functions of random variables. Understand and characterize phenomena which evolve with respect to time in a probabilistic manner. Be exposed to basic characteristic features of a queuing system and acquire skills in analyzing queuing models. UNIT – I: PROBABILITY AND RANDOM VARIABLE 9Hrs Axioms of probability - Conditional probability - Total probability – Baye‟s theorem Random variable - Probability mass function - Probability density function - Properties – Moments - Moment generating functions and their properties. UNIT – II: STANDARD DISTRIBUTIONS 9Hrs Binomial, Poisson, Geometric, Negative Binomial, Uniform, Exponential, Gamma, Weibull and Normal distributions and their properties - Functions of a random variable. UNIT – III: TWO DIMENSIONAL RANDOM VARIABLES 9Hrs Joint distributions - Marginal and conditional distributions – Covariance – Correlation and regression - Transformation of random variables - Central limit theorem. UNIT – IV: Random Processes and Markov Chains 9Hrs Classification - Stationary process - Markov process - Poisson process - Birth and death process - Markov chains - Transition probabilities - Limiting distributions. Transition Diagram. UNIT – V: QUEUING THEORY 9+3 Markovian models – M/M/1, 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. Single and Multiple Server System. COURSE LEARNING OUTCOMES Upon successful completion of the course, students would be able to :

1. Develop analytical capability in Statistical methods and Queuing theory

2. Analyze real world problems using the knowledge of Statistical methods and its applications.


54

TEXT BOOKS 1. Ross, S., “A first course in probability”, Pearson Education, Sixth Edition, Delhi, 2002. 2. Medhi J., “Stochastic Processes”, New Age Publishers, New Delhi, 1994. (Chapters 2, 3,4) 3. T.Veerarajan, “Probability, Statistics and Random process”, Tata McGraw Hill, Second Edition, New Delhi, 2003 REFERENCE BOOKS 1. Allen., A.O., “Probability, Statistics and Queuing Theory”, Academic press, New Delhi, 1981. 2. Taha, H. A., “Operations Research-An Introduction”, Pearson Education Edition Asia, Seventh Edition, Delhi, 2002. 2. Gross, D. and Harris, C.M., “Fundamentals of Queuing theory”, John Wiley


55

CS432 DATA STRUCTURES AND ALGORITHMS L : T : P (45 Hrs) 3 : 0 : 1 COURSE OBJECTIVES

To learn the systematic way of solving problems To understand the different methods of organizing large amounts of data To efficiently implement the different data structures To efficiently implement solutions for specific problems

UNIT I: INTRODUCTION 8 Hrs Definition- Classification of data structures: primitive and non-primitive- Operations on data structures- Algorithm Analysis- Simple Generic Classes and Interfaces UNIT II: LISTS, STACKS AND QUEUES 11 Hrs Abstract Data Type (ADT) – The List ADT – The Stack ADT: Definition, Array representation of stack, Operations on stack: Infix, prefix and postfix notations Conversion of an arithmetic Expression from Infix to postfix. Applications of stacks. The Queue ADT: Definition, Array representation of queue, Types of queue: Simple queue, circular queue, double ended queue (de-queue) priority queue, operations on all types of Queues UNIT III: TREES 10 Hrs Preliminaries – Binary Trees – The Search Tree ADT – Binary Search Trees – AVL Trees – Tree Traversals – Hashing – General Idea – Hash Function – Separate Chaining – Open Addressing –Linear Probing – Priority Queues (Heaps) – Model – Simple implementations – Binary Heap UNIT IV: SORTING 8 Hrs Preliminaries – Insertion Sort – Shell sort – Heap sort – Merge sort – Quicksort – External Sorting UNIT V: GRAPHS 8 Hrs Definitions – Topological Sort – Shortest-Path Algorithms – Unweighted Shortest Paths – Dijkstra‟s Algorithm – Minimum Spanning Tree – Prim‟s Algorithm – Applications of Depth-First Search – Undirected Graphs – Bi-connectivity – Introduction to NP-Completeness-case study COURSE LEARNING OUTCOMES

Upon successful completion of the course, students would be able to : Judge the importance of organization of data according to purpose Develop skills in selection of appropriate data structures in complex

programming Implement efficient algorithms for storing, sorting and accessing data.

TEXT BOOKS

1. Mark Allen Weiss , “Data Structures and Algorithm Analysis in Java”, 3rd Edition , 2013 (Chapters : 1,2,3,4,5,6,7,9) REFERENCE BOOKS


56

1. Michael T. Goodrich , Roberto Tamassia , Michael H. Goldwasser , “Data Structures and Algorithms in Java™”, Wiley Publications, Sixth Edition, 2012.

2. Duane A. Bailey , “Java Structures- Data Structures in Java for the Principled Programmer”, 7th Edition, 2012

3. Pat Morin, “Open Data Structures (in Java)”, 0.1G Edition


57

CS433 DATABASE MANAGEMENT SYSTEMS L : T : P (45 Hrs) 3 : 0 : 1 COURSE OBJECTIVES

To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram.

To make a study of SQL and relational database design. To understand the internal storage structures using different file and indexing

techniques which will help in physical DB design. To know the fundamental concepts of transaction processing- concurrency

control techniques and recovery procedure. To have an introductory knowledge about the emerging trends in the area of

distributed DB- OO DB- Data mining and Data Warehousing and XML. UNIT I: INTRODUCTION AND CONCEPTUAL MODELING 9+3 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: RELATIONAL MODEL 9+3 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+3 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+3 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 V: CURRENT TRENDS 9+3 Object Oriented Databases – Need for Complex Data types- OO data Model- Nested relations- Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing. COURSE LEARNING OUTCOMES

Assemble the information that is needed to design a database management system for a business information problem.

Create conceptual and logical database designs for a business information problem.


58

Design a database management system that satisfies relational theory and provides users with business queries, business forms, and business reports.

Analyze the core terms, concepts, and tools of relational database management systems.

Work in teams and utilize effective group techniques to manage a complex project.

TEXT BOOKS

1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”, Sixth Edition, McGraw-Hill, 2010.

REFERENCE BOOKS

1. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2008.

2. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003.


59

CS434 MICROPROCESSORS AND ITS APPLICATIONS L : T : P (45 Hrs) 3 : 1 : 0 COURSE OBJECTIVES

To introduce the architecture and programming of 8086 microprocessor. To introduce the interfacing of peripheral devices with 8086 microprocessor. To introduce the architecture and programming of 80286, 80386 and 80486

microprocessor. UNIT I: 8086 MICROPROCESSOR 9+3 Intel 8086 Microprocessor - Internal architecture – Block diagram – Minimum and maximum mode operation – Interrupt and Interrupt applications – DMA data transfer –8086 memory organization – even and odd memory banks – segment registers - logical and physical address – advantages and disadvantages of physical memory. UNIT II: 8086 MICROPROCESSOR I/O INTERFACING 9+3 Intel 8086 microprocessor – Architecture – Instruction set and assembler directives – Addressing modes – Assembly language programming- Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface – Timer – Keyboard /display controller – Interrupt controller – DMA controller – Programming and applications. UNIT III: 80286 MICROPROCESSOR 9+3 Intel 80286 Microprocessor - 80286 Architecture, system connection – Real address mode operation – Protected mode operation UNIT IV: 80386 MICROPROCESSOR 9+3 Intel 80386 Microprocessor - 80386 Architecture and system connection – Real operating mode – 386 protected mode operation – segmentation and virtual memory – segment privilege levels and protection – call gates – I/O privilege levels – Interrupts and exception handling – task switching – paging mode – 80386 virtual 86 mode operation. UNIT V: 80486 MICROPROCESSOR AND INFORMAL LABORATORY 9+3 Advanced Intel Microprocessors - 80486 – Processor model – Reduced Instruction cycle – five stage instruction pipe line – Integrated coprocessor – On board cache – Burst Bus mode. Pentium – super scalar architecture – u-v pipe line – branch prediction logic – cache structure – BIST (built in self-test) – Introduction to MMX technology. Case Study. Informal Laboratory:

1. Programs for 8/16 bit Arithmetic operations (Using 8086).

2. Programs for Sorting and Searching (Using 8085, 8086).

3. Programs for String manipulation operations (Using 8086). COURSE LEARNING OUTCOMES Upon successful completion of the course, students would be able to :

Implement basic operations- arithmetic, sorting, searching on 8086 Microprocessor.

Appraise basic modes of operations and its suitability for applications.


60

TEXT BOOKS

1. Ramesh S.Gaonkar, “Microprocessor - Architecture, Programming and Applications with the 8085”, Penram International publishing private limited, fifth edition.

2. A.K. Ray & K.M.Bhurchandi, “Advanced Microprocessors and peripherals- Architectures, Programming and Interfacing”, Tata McGraw Hill, 2002 reprint.

3. Barry B. Brey, “The Intel Microprocessors”, Pearson Education India., 8th Edition REFERENCE BOOKS

1. Douglas V. Hall “Microprocessor and Interfacing”, Tata McGraw Hill, 2006 revised, 2003.

2. Gibson, “Microprocessor and Interfacing” Tata McGraw Hill, II edition


61

CS435 INTERNET OF THINGS L: T : P (45 Hrs) 3 : 0 : 0 COURSE OBJECTIVES

1. To understand the concepts and protocols related to Internet of Things.

2. To get an idea where the application areas are available for the Internet of Things to be applied.

3. To understand the middleware for Internet of Things

4. To understand the concepts of Web of Things

5. To understand the concepts of Cloud of Things with emphasis on Mobile cloud computing

6. To understand where the market connected to the network lies.

UNIT I INTRODUCTION 9 Hrs Definitions and Functional Requirements –Motivation – Architecture - Web 3.0 View of IoT– Ubiquitous IoT Applications – Four Pillars of IoT – DNA of IoT - The Toolkit Approach for end-user. Participation in the Internet of Things. Middleware for IoT: Overview– communication middleware for IoT –IoT Information Security UNIT II IOT PROTOCOLS 9 Hrs Protocol Standardization for IoT – Efforts – M2M and WSN Protocols – SCADA and RFID protocols – Issues with IoT Standardization – Unified Data Standards – Protocols – IEEE 802.15.4 – BACNet Protocol – Modbus – KNX – Zigbee Architecture – Network layer – APS layer – Security. Proximity Sensors-Magnetic Sensors-Gravity Sensors-Light Sensors. UNIT III WEB OF THINGS 9 Hrs Web of Things versus Internet of Things – Two Pillars of the Web – Architecture standardization for WoT– Platform Middleware for WoT – Unified Multitier WoT Architecture – WoT Portals and Business Intelligence. Cloud of Things: Grid/SOA and Cloud Computing – Cloud Middleware – Cloud Standards – Cloud Providers and Systems – Mobile Cloud Computing – The Cloud of Things Architecture. UNIT IV NETWORK CROWDS AND MARKET 9 Hrs Integrated Billing Solutions in the Internet of Things Business Models for the Internet of Things - Network Dynamics: Population Models – Information Cascades - Network Effects – Network Dynamics: Structural Models - Cascading Behavior in Networks - The Small-World phenomenon UNIT V APPLICATIONS 9 Hrs User Centered Design- Open source Development- End User Programming- Crowd Sourcing-living Labs-Existing tool kits- - Resource Management in the Internet of Things: Clustering, Data Synchronization and Software Agents. Real time Web Of Things- Finding and Describing Smart Things- Sharing Smart Things. Applications - Smart Grid – Electrical Vehicle Charging COURSE LEARNING OUTCOMES


62

Upon completion of the course, the students will be able to

Identify the scopes of IoT and related new models for market strategic interaction.

Design business intelligence and information security for WoT using the protocols.

Analyze the market scenario based on the network utilization.

Implement middleware required for the Internet of Things and Web of Things.

TEXT BOOKS: 1. Honbo Zhou, “The Internet of Things in the Cloud: A Middleware Perspective”, CRC Press – 2012. 2. David Easley and Jon Kleinberg, “Networks, Crowds, and Markets: Reasoning About a Highly Connected World”, Cambridge University Press – 2010. 3. Dieter Uckelmann; Mark Harrison; Florian Michahelles, “ Architecting the Internet of Things” Springer – 2011. REFERENCE BOOKS: 1. The Internet of Things: Applications to the Smart Grid and Building Automation by –

Olivier Hersent, Omar Elloumi and David Boswarthick – Wiley Publications -2012.


63

PD436 PROFESSIONAL DEVELOPMENT-II L: T : P (45 Hrs) 3 : 0 : 0 COURSE DESCRIPTION The subject makes an attempt to incorporate all basic concepts and practices of management, Business functions and economics that provides the foundation framework to guide the formative knowledge of Management Concepts and also the Concepts of Economic Systems, Economic behaviour of individuals and organizations. COURSE OBJECTIVE At the end of the course the students would be capable of relating the principles of management and economics with the Environment of Business & economics, personal experiences and cases which will be attempted in the class Unit 1 (8 hours) Part A – Principles of Management Management: Introduction: Definition of management, nature, purpose and functions, level and types of managers, Manager/Non-Manager, Managerial Roles, Essential Managerial Skills, Key personal characteristics for Managerial success. Evolution and various schools to management thoughts, continuing management themes – quality and performance excellence, global awareness, learning organization, Characteristics of 21st century Executives. Social responsibility of managers. Unit 2 (16 Hours) Planning: Meaning and nature of planning, types of plans, steps in planning process; Objectives: meaning, setting and managing objectives – MBO method: concept and process of managing by objectives; Strategies: definition, levels of strategies, its importance in an Organization; Policies: meaning, formulation of policies; Programs: meaning, nature; Planning premises: concept, developing effective planning premises; Decision making, steps in decision making, approaches to decision making, types of decisions and various techniques used for decision making. Organizing: Organizing as managerial function – organization structure, formal and informal organization. Traditional Organization Structures – Functional, Divisional and Matrix Structure Directions in organizational Structures – Team structure, network structure, boundary less structure Organizing Trends and Practices – Chain of command, unity of command, span of control, delegation and empowerment, decentralization and use of staff, organizational design and organizational configuration. Unit 3 (14 Hours) Leading as a function of management, Leadership and vision, Leadership traits, classic Leadership styles, Leaders behaviour – Likert‟s four systems, Managerial Grid. Overlapping role of leader and managers. The organizational context of communication, Directions of communications, channels of communication, Barriers to communication. Motivation and


64

rewards, rewards and performance. Hierarchy of need theory and two factor theory. Integrated model of motivation. Controlling: Control function in management, The basic control process. Types of control – feed forward, concurrent and feedback controls. Factors in control effectiveness. UNIT 4 (6 Hours) Finance – introduction to financial management and scope of financial management, sources of funds. Marketing – introduction to marketing management, marketing mix- 4p‟s and services marketing. HRM- introduction , organisation structure, types of resource selection. Operations management – introduction to operations management , project management – cpm & pert. Unit 5 (14 Hours) Entrepreneurship Introduction- Definition, Nature and importance of Entrepreneurs, Role of entrepreneurship in economic development, Challenges faced by entrepreneurs - individuals - from family - from groups - from community - from society, Entrepreneurial process: Identify and evaluate opportunities, Develop a Business plan, Determine the resources required, Manage the Enterprise, Ethics and Social responsibility of Entrepreneurship. Intrapreneurship, Establishment of Intrapreneurship in organizations, The legal forms of entrepreneurial organization. Intellectual Property: Trademark, Copyright, Patents, Geographical Indications (GI) of goods, Design. RECOMMENDED BOOKS:

1. Management– J.R. Schermerhorn Jr. Wiley India, New Delhi 2004. 2. Management-Concepts and Cases-V.S.P.Rao, Excel Books 3. Management - A Global and Entrepreneurial Perspective - Harold Koontz, Heinz

Weihrich - TMH 12th edition, 2008. 4. Management – Stephen P. Robbins, M. Caulter, Pearson, PHI, 9e, 2008. 5. Management - Ricky W. Griffin Eigth Edition, 2005, Biztantra 6. Fundamentals of Management-Stephen P Robbins et all, Pearson Publications,Fifth

edition 7. Management-Richard L. Daft, Cegage learning 8. Chandra, P. (2010). Fundamentals of financial management. Tata McGraw-Hill

Education. 9. Kotler,P. Marketing management, New Delhi: Prentice Hall of India Publications 10. Human Resource Management, Text & Cases – VSP Rao, Excel Books, 2005 11. Human Resource Management – Text & Cases – K. Ashwatappa; 5th Edition, 12. TMH. 13. Chase, R. B. & Nicholas, A. J., & et al. (2010). Operations management for competitive

advantage. New Delhi: Tata McGraw Hill. 14. Entrepreneurship – Robert D Hisrich, Michael P Peters, Dean A Shepherd – 6th

Edition. 15. Entrepreneurship - Kuratko. Donald F &Hodgetts, Richard M, (2007).New Delhi:

Thomson. 16. Entrepreneurship – Rajeev Roy, Oxford higher education,2009 17. Entrepreneurship text and cases – P.Narayana Reddy, 2012


65

CS451 DATA STRUCTURES AND ALGORITHMS LABORATORY

COURSE OBJECTIVES

To write data structure construct and algorithm based programs in JAVA SYLLABUS 3. Implement the applications Stack ADT 4. Implement the applications for Queue ADT 5. Operations on stack[e.g.: infix to postfix, evaluation of postfix] 6. Search Tree ADT - Binary Search Tree 7. Heap Sort 8. Quick Sort 9. Applications of Probability and Queuing Theory Problems to be implemented using

data structures 10. To determine the time complexity of a given logic. 11. Implementing a Hash function/Hashing Mechanism. 12. Implementing any of the shortest path algorithms.

COURESE LEARNING OUTCOMES:

Ability to implement the data structure algorithms using JAVA language.

Ability to implement various searching and sorting techniques using JAVA language

TEXT BOOKS 1. Mark Allen Weiss , “Data Structures and Algorithm Analysis in Java”, 3rd Edition . (Chapters : 1,2,3,4,5,6,7,9) REFERENCE BOOKS 1. Michael T. Goodrich , Roberto Tamassia , Michael H. Goldwasser , “Data Structures

and Algorithms in Java™”, Wiley Publications, Sixth Edition. 2. Duane A. Bailey , “Java Structures- Data Structures in Java for the Principled

Programmer”, 7th Edition 3. Pat Morin, “Open Data Structures (in Java)”, 0.1G Edition


66

CS452 DBMS LABORATORY COURSE OBJECTIVES

To implement the design of the tables in DBMS

To write queries to get optimized outputs

To store, retrieve and view the contents

To generate report based on customized need LIST OF EXPERIMENTS 1. Data Definition Language (DDL) commands in RDBMS 2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS. 3. High-level language extension with Cursors. 4. High level language extension with Triggers 5. Procedures and Functions. 6. Embedded SQL. 7. Database design using E-R model and Normalization. 8. Design and implementation of Payroll Processing System. 9. Design and implementation of Banking System. 10. Design and implementation of Library Information System. COURSE LEARNING OUTCOMES Upon successful completion of the course, students would be able to :

Identify the information that is needed to design a database management system for a business information problem.


Construct a database management system that satisfies relational theory and provides users with business queries, business forms, and business reports.

Analyze the core terms, concepts, and tools of relational database management systems.

Demonstrate skills to work in teams in teams and utilize effective group techniques to manage a complex project.


67

IT531 DISCRETE MATHEMATICS PAPER DESCRIPTION: To extend student‟s mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems. PAPER OBJECTIVE: At the end of the course, students would

Have knowledge of the concepts needed to test the logic of a program.

Have gained knowledge which has application in expert system, in data base and a basic for the prolog language.

Have an understanding in identifying patterns on many levels.

Be aware of a class of functions which transform a finite set into another finite set which relates to input output functions in computer science.

Be exposed to concepts and properties of algebraic structures such as semigroups, monoids and groups.

UNIT – I: PROPOSITIONAL CALCULUS 9+3 Hours

Propositions – Logical connectives – Compound propositions – Conditional and bi conditional propositions – Truth tables – Tautologies and contradictions – Contrapositive – Logical equivalences and implications – De Morgan‟s Laws - Normal forms – Principal conjunctive and disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.

UNIT – II: PREDICATE CALCULUS 9+3 Hours

Predicates – Statement function – Variables – Free and bound variables – Quantifiers – Universe of discourse – Logical equivalences and implications for quantified statements – Theory of inference – The rules of universal specification and generalization – Validity of arguments.

UNIT – III: SET THEORY 9+3 Hours

Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and Cartesian product – Relations on sets –Types of relations and their properties – Relational matrix and the graph of a relation – Partitions – Equivalence relations – Partial ordering – Poset – Hasse diagram – Lattices and their properties – Sublattices – Boolean algebra – Homomorphism.

UNIT – IV: FUNCTIONS 9+3 Hours

Definitions of functions – Classification of functions –Type of functions - Examples – Composition of functions – Inverse functions – Binary and n - ary operations – Characteristic function of a set – Hashing functions – Recursive functions – Permutation functions.

UNIT – V: GROUPS 9+3 Hours

Algebraic systems – Semigroups - Monoids – Groups - Properties – Subgroups and Homomorphisms - Cosets and Lagrange‟s theorem – Normal subgroups – Algebraic system


68

with two binary operations - Codes and group codes – Basic notions of error correction - Error recovery in group codes.

TEXT BOOKS 13. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to

Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003. 14. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied

Introduction”, Fourth Edition, Pearson Education Asia, Delhi, 2002.

REFERENCE BOOKS 3. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical

Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003. 4. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Fifth Edition, Tata

McGraw – Hill Pub. Co. Ltd., New Delhi, 2003. 5. Richard Johnsonbaugh, “Discrete Mathematics”, Fifth Edition, Pearson Education

Asia, New Delhi, 2002.


69

IT532 DATABASE MANAGEMENT SYSTEM AIM To provide a strong foundation in database technology and an introduction to the current trends in this field. OBJECTIVES

To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram.

To make a study of SQL and relational database design.

To understand the internal storage structures using different file and indexing techniques which will help in physical DB design.

To know the fundamental concepts of transaction processing- concurrency control techniques and recovery procedure.

To have an introductory knowledge about the emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML.

OUTCOMES:

Identify and define the information that is needed to design a database management system for a business information problem.


Build a database management system that satisfies relational theory and provides users with business queries, business forms, and business reports.

Understand the core terms, concepts, and tools of relational database management systems.

Work in teams and utilize effective group techniques to manage a complex project.

UNIT I INTRODUCTION AND CONCEPTUAL MODELING 9+3 Hours 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 RELATIONAL MODEL 9+3 Hours 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+3 Hours 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+3 Hours


70

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 V CURRENT TRENDS 9+3 Hours Object Oriented Databases – Need for Complex Data types- OO data Model- Nested relations- Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing.

L=45; T=15; TOTAL= 60 TEXT BOOKS

1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”, sixth Edition, McGraw-Hill, 2010.

REFERENCES

1. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2008.

2. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003.

3. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System Implementation”- Pearson Education- 2003.

4. Peter Rob and Corlos Coronel- “Database System, Design, Implementation and Management”, Thompson Learning Course Technology- Fifth edition, 2003.


71

IT533 COMPUTER NETWORKS

AIM To introduce the concepts, terminologies and technologies used in modern days data communication and computer networking. OBJECTIVES

To understand the concepts of data communications.

To study the functions of different layers.

To introduce IEEE standards employed in computer networking.

To make the students to get familiarized with different protocols and network components.

OUTCOMES:

The students will be familiar with the protocols, standards and interfaces of layered ISO/OSI model and TCP/IP model. They will be in a position to apply this knowledge in developing a secured application.

UNIT I DATA COMMUNICATIONS 8 + 3 Hours Components – Direction of Data flow – networks – Components and Categories – types of Connections – Topologies –Protocols and Standards – ISO / OSI model – Transmission Media – Coaxial Cable – Fiber Optics – Line Coding – Modems – RS232 Interfacing sequences. UNIT II DATA LINK LAYER 10 + 3 Hours Error – detection and correction – Parity – LRC – CRC – Hamming code – low Control and Error control - stop and wait – go back-N ARQ – selective repeat ARQ- sliding window – HDLC. - LAN - Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.11 – FDDI - SONET – Bridges. UNIT III NETWORK LAYER 10 + 3 Hours Internetworks – Packet Switching and Datagram approach – IP addressing methods – Subnetting – Routing – Distance Vector Routing – Link State Routing – Routers. UNIT IV TRANSPORT LAYER 9 + 3 Hours Duties of transport layer – Multiplexing – Demultiplexing – Sockets – User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) – Congestion Control – Quality of services (QOS) – Integrated Services. UNIT V APPLICATION LAYER 8 + 3 Hours Domain Name Space (DNS) – SMTP – FTP – HTTP - WWW – Security – Cryptography.



72

1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw-Hill, 2006.

REFERENCES

1. James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, Pearson Education, 2012.

2. Larry L.Peterson and Peter S. Davie, “Computer Networks”, Harcourt Asia Pvt. Ltd., Second Edition.

3. Andrew S. Tanenbaum, “Computer Networks”, 5th Edition, Pearson 2012. 4. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson

Education, 2007.


73

IT534 THEORY OF COMPUTATION AIM To have a introductory knowledge of automata, formal language theory and computability. OBJECTIVES

To have an understanding of finite state and pushdown automata.

To have a knowledge of regular languages and context free languages.

To know the relation between regular language, context free language and corresponding recognizers.

To study the Turing machine and classes of problems. OUTCOMES: Students will be able to:

Construct finite state machines and the equivalent regular expressions.

Construct pushdown automata and the equivalent context free grammars.

Prove the equivalence of languages described by pushdown automata and context free grammars.

To develop Turing machines solve problems Be familiar with thinking analytically and intuitively for problem‐solving situations in related areas of theory in computer science

UNIT I AUTOMATA 9 + 3 Hours Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA)– Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions. UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9 + 3 Hours Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular languages – Equivalence and minimization of Automata. UNIT III CONTEXT-FREE GRAMMAR AND LANGUAGES 9 + 3 Hours Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown automata and CFG, Deterministic Pushdown Automata. UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 9 + 3 Hours Normal forms for CFG – Pumping Lemma for CFL - Closure Properties of CFL – Turing Machines – Programming Techniques for TM. UNIT V UNDECIDABILITY 9 + 3 Hours A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems about Turing Machine – Post‟s Correspondence Problem - The classes P and NP.

L=45; T=15; TOTAL= 60 TEXT BOOK


74

1. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages and Computations”, Pearson Education, 2008.

REFERENCES

1. H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”, Second Edition, Pearson Education/PHI, 2003

2. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, TMH, 2003.

3. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.


75

IT535 MICROPROCESSORS AND ITS APPLICATIONS

AIM

To learn the architecture programming and interfacing of microprocessors.

OBJECTIVES

To introduce the architecture and programming of 8086 microprocessor.

To introduce the interfacing of peripheral devices with 8086 microprocessor.

To introduce the architecture and programming of 80286, 80386 and 80486 microprocessor.

UNIT I 8086 MICROPROCESSOR 9+3 Hours Intel 8086 Microprocessor - Internal architecture – Block diagram – Minimum and maximum mode operation – Interrupt and Interrupt applications – DMA data transfer –8086 memory organization – even and odd memory banks – segment registers - logical and physical address – advantages and disadvantages of physical memory. UNIT II 8086 MICROPROCESSOR I/O INTERFACING 9+3 Hours Intel 8086 microprocessor – Architecture – Instruction set and assembler directives – Addressing modes – Assembly language programming- Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface – Timer – Keyboard /display controller – Interrupt controller – DMA controller – Programming and applications.

UNIT III 80286 MICROPROCESSOR 9+3 Hours Intel 80286 Microprocessor - 80286 Architecture, system connection – Real address mode operation – Protected mode operation UNIT IV 80386 MICROPROCESSOR 9+3 Hours Intel 80386 Microprocessor - 80386 Architecture and system connection – Real operating mode – 386 protected mode operation – segmentation and virtual memory – segment privilege levels and protection – call gates – I/O privilege levels – Interrupts and exception handling – task switching – paging mode – 80386 virtual 86 mode operation. UNIT V 80486 MICROPROCESSOR 9+3 Hours Advanced Intel Microprocessors - 80486 – Processor model – Reduced Instruction cycle – five stage instruction pipe line – Integrated coprocessor – On board cache – Burst Bus mode. Pentium – super scalar architecture – u-v pipe line – branch prediction logic – cache structure – BIST (built in self test) – Introduction to MMX technology.

L=45 ; T=15; TOTAL= 60


76

REFERENCES

1. Ramesh S.Gaonkar, “Microprocessor - Architecture, Programming and Applications with the 8085”, Penram International publishing private limited, fifth edition.

2. A.K. Ray & K.M.Bhurchandi, “Advanced Microprocessors and peripherals- Architectures, Programming and Interfacing”, Tata McGraw Hill, 2002 reprint.

3. Barry B. Brey, “The Intel Microprocessors” Pearson Education India., 8th Edition 4. Douglous V. Hall “Microprocessor and Interfacing” Tata McGraw Hill, 2006 revised,

2003. 5. Gibson, “Microprocessor and Interfacing” Tata McGraw Hill,II edition


77

IT551 NETWORK LABORATORY (All the programs are to be written using C)

1. Simulation of ARP / RARP.

2. Write a program that takes a binary file as input and performs bit stuffing and CRC Computation.

3. Develop an application for transferring files over RS232.

4. Simulation of Sliding-Window protocol.

5. Simulation of BGP / OSPF routing protocol.

6. Develop a Client – Server application for chat.

7. Develop a Client that contacts a given DNS Server to resolve a given host name.

8. Write a Client to download a file from a HTTP Server. 9 &10 Study of Network Simulators like NS2/Glomosim / OPNET .


78

MICROPROCESSORS LABORATORY IT552 1. Programs for 8/16 bit Arithmetic operations (Using 8085). 2. Programs for Sorting and Searching (Using 8085, 8086). 3. Programs for String manipulation operations (Using 8086). 4. Programs for Digital clock and Stop watch (Using 8086). 5. Interfacing ADC and DAC. 6. Parallel Communication between two MP Kits using Mode 1 and Mode 2 of 8255. 7. Interfacing and Programming 8279, 8259, and 8253. 8. Serial Communication between two MP Kits using 8251. 9. Interfacing and Programming of Stepper Motor and DC Motor Speed control.


79

DATABASE MANAGEMENT SYSTEMS LABORATORY - IT553

LIST OF EXPERIMENTS

1. Data Definition Language (DDL) commands in RDBMS.

2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS.

3. High-level language extension with Cursors.

4. High level language extension with Triggers

5. Procedures and Functions.

6. Embedded SQL.

7. Database design using E-R model and Normalization.

8. Design and implementation of Payroll Processing System.

9. Design and implementation of Banking System.

10. Design and implementation of Library Information System.


80

SEMESTER VI (IT631)


1 IT631A UNIX Internals 100 4 2 IT631B Data Warehousing and Mining 100 4 3 IT631C Resource Management Techniques 100 4 4 IT631D High Performance Microprocessors 100 4 5 IT631E Embedded Systems 100 4 6 IT631F Advanced Databases 100 4 7 IT631G Intellectual Property Rights 100 4 8 IT631H Indian Constitution and Society 100 4


81

DIGITAL SIGNAL PROCESSING - IT632

AIM To review signals and systems, study DFT and FFT, discuss the design of IIR & FIR filters and study typical applications of digital signal processing. OBJECTIVES

To have an overview of signals and systems.

To study DFT & FFT

To study the design of IIR filters.

To study the design of FIR filters.

To study the effect of finite word lengths & applications of DSP

UNIT I SIGNALS AND SYSTEMS 9 + 3 Hours 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 +3 Hours 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 algorithms – Use of FFT algorithms in Linear Filtering and correlation. UNIT III IIR FILTER DESIGN 9 + 3 Hours 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.


82

UNIT IV FIR FILTER DESIGN 9 + 3 Hours Symmetric & 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 + 3 Hours 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.

L=45; T=15; TOTAL= 60

TEXT BOOK

1. John G Proakis and Dimtris G Manolakis, “Digital Signal Processing Principles, Algorithms and Application”, PHI/Pearson Education, 2000, 3rd Edition.

REFERENCES 1. Alan V Oppenheim, Ronald W Schafer and John R Buck, “Discrete Time Signal

Processing”, PHI/Pearson Education, 2000, 2nd Edition. 2. Johny R.Johnson, “Introduction to Digital Signal Processing”, Prentice Hall of

India/Pearson Education, 2002. 3. Sanjit K.Mitra, “Digital Signal Processing: A Computer – Based Approach”, Tata

McGraw-Hill, 2001, Second Edition.


83

SYSTEM SOFTWARE - IT633 AIM To have an understanding of foundations of design of assemblers, loaders, linkers, and macro processors. OBJECTIVES

To understand the relationship between system software and machine architecture.

To know the design and implementation of assemblers

To know the design and implementation of linkers and loaders.

To have an understanding of macroprocessors.

To have an understanding of system software tools. OUTCOMES

Demonstrate the relation between System Software and the Machine Architecture.

Demonstrate and implement assemblers.

Demonstrate and implement loaders and linkers.

Demonstrate and implement macroprocessors.

Demonstrate and implement text editors.

Demonstrate the phases of a compiler.

UNIT-I MACHINE STRUCTURE AND EVOLUTION OF A PROGRAMMING SYSTEM 8+3 Hours Introduction to System Software, Components of System Software, Evolution of System Software, Assembler, Loader, Macros, Compilers, Simplified Instructional Computer: SIC machine architecture, SIC/XE machine architecture, SIC programming examples. UNIT=II ASSEMBLER 10+3 Hours Basic assembler functions (SIC assembler, algorithm and data structure), Machine dependent

assembler features (Instruction formats and addressing modes, program relocation), Machine


84

independent assembly features (Literals, Symbol defining statements, expressions, program blocks, control sections and program linking), Assembler design options (One pass assembler, multi pass assembler)

UNIT=III LOADERS AND LINKERS 9+3 Hours Basic loader functions (Design of an absolute loader, simple bootstrap loader), Machine dependent loader features (Relocation, program linking, algorithm and data structures for a linking loader), Machine independent loader features (Automatic library search, loader options), Loader design options (Linkage editor, dynamic linking, bootstrap loaders).

UNIT-IV MACRO PROCESSOR 8+3 Hours

Macro Instructions, Features of a macro facility (Macro instruction arguments, Conditional macro expansion, Macro calls within macro, Macro instructions defining macros), Implementation (Two pass algorithm, Single pass algorithm)

UNIT V COMPILERS 10+3 Hours

Part1: Basic elements, Syntactic units and interpreting meaning, Intermediate form (Arithmetic statements, Non-arithmetic statements, Non-executable statements), Storage allocation, Code generation, Optimization (Machine independent, Machine dependent, Assembly phase).

Part2: Phases of the compiler (Lexical phase, Syntax phase, Interpretation phase, Optimization, Storage assignment, Code generation, Assembly phase), Passes of a compiler.

TEXT BOOKS:

1. Donovan, John, System programming, Tata McGraw-Hill, 2003 2. Beck, Leland, System Software An Introduction to System Programming, Addison-

Wesley, 3rd Edition, 1997 REFERENCE BOOK:

1. Dhamdhere D M, Systems programming and operating systems, Tata McGraw-Hill, 1994. SOFTWARE ENGINEERING - IT634

AIM To introduce the methodologies involved in the development and maintenance of software (i.e) over its entire life cycle. OBJECTIVES: To be aware of

Different life cycle models

Requirement dictation process

Analysis modeling and specification

Architectural and detailed design methods

Implementation and testing strategies

Verification and validation techniques

Project planning and management


85

Use of CASE tools OUTCOMES:

Students will be able to understand the Different life cycle models,Requirement dictation process, Analysis modeling and specification, Architectural and detailed design methods, Implementation and testing strategies, Verification and validation techniques, Project planning and management, Use of CASE tools.

Students will demonstrate the ability to manage a project including planning, scheduling and risk assessment/management.

Students will understand and author the software requirements document.

Students will author a formal specification for a software system.

Students will demonstrate proficiency in rapid software development techniques.

Students will be able to identify specific components of a software design that can be targeted for reuse.

Students will demonstrate proficiency in software development cost estimation.

Students will author a software testing plan.


86

UNIT I SOFTWARE PROCESS 9 + 3 Hours 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 SOFTWARE REQUIREMENTS 9 + 3 Hours 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 III DESIGN CONCEPTS AND PRINCIPLES 9 + 3 Hours 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. Real time systems - Real time software design – system design – real time executives – data acquisition system - monitoring and control system. SCM – Need for SCM – Version control – Introduction to SCM process – Software configuration items. UNIT IV TESTING 9 + 3 Hours 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. UNIT V SOFTWARE PROJECT MANAGEMENT 9 + 3 Hours Measures and measurements – S/W complexity and science measure – size measure – data and logic structure measure – information flow measure. Software cost estimation – function point models – COCOMO model- Delphi method.- Defining a Task Network – Scheduling – Earned Value Analysis – Error Tracking - Software changes – program evolution dynamics – software maintenance – Architectural evolution. Taxonomy of CASE tools.

L=45; T=15; TOTAL= 60 TEXT BOOK

1. Roger S.Pressman, Software engineering- A practitioner‟s Approach, McGraw-Hill International Edition, 2009.

REFERENCES

2. Ian Sommerville, Software engineering, Pearson education Asia, 2010.


87

3. Pankaj Jalote- An Integrated Approach to Software Engineering, Narosa publishing house 2011.

4. James F Peters and Witold Pedryez, “Software Engineering – An Engineering Approach”, John Wiley and Sons, New Delhi, 2007.

5. Ali Behforooz and Frederick J Hudson, “Software Engineering Fundamentals”, OUP India 2012.


88

NUMERICAL METHODS IT635 PAPER DESCRIPTION: With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically. PAPER OBJECTIVE: At the end of the course, the students would be acquainted with the basic concepts in numerical methods,

The roots of nonlinear (algebraic or transcendental) equations, solutions of large system of linear equations and eigenvalue problem of a matrix can be obtained numerically where analytical methods fail to give solution.

When huge amounts of experimental data are involved, the methods discussed on interpolation will be useful in constructing approximate polynomial to represent the data and to find the intermediate values.

The numerical differentiation and integration find application when the function in the analytical form is too complicated or the huge amounts of data are given such as series of measurements, observations or some other empirical information.

Since many physical laws are couched in terms of rate of change of one/two or more independent variables, most of the engineering problems are characterized in the form of either nonlinear ordinary differential equations or partial differential equations. The methods introduced in the solution of ordinary differential equations and partial differential equations will be useful in attempting any engineering problem.

UNIT – I: SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 12 Hours Introduction to Errors and their computations. Linear interpolation methods (method of false position) – Newton‟s method, Solution of linear system by Gaussian elimination and Gauss-Jordon methods- Iterative methods: Gauss Jacobi and Gauss-Seidel methods- Inverse of a matrix by Gauss Jordon method – Eigenvalue of a matrix by power method. UNIT – II: INTERPOLATION AND APPROXIMATION 9+3 Hours Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton‟s forward and backward difference formulas. UNIT – III: NUMERICAL DIFFERENTIATION AND INTEGRATION 9+3 Hours Derivatives from difference tables – Divided differences and finite differences –Numerical integration by trapezoidal and Simpson‟s 1/3 and 3/8 rules – Romberg‟s method – Two and Three point Gaussian quadrature formulas – Double integrals using trapezoidal and Simpson‟s rules.


89

UNIT – IV: INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS 9+3 Hours

Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order Runge – Kutta method for solving first and second order equations – Multistep methods: Milne‟s and Adam‟s predictor and corrector methods.

UNIT – V: BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL EQUATIONS 9+3 Hours

Finite difference solution of second order ordinary differential equation – Finite difference solution of one dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two dimensional Laplace and Poisson equations. TEXT BOOKS 1. Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson

Education Asia, New Delhi, 2002. 2. Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub. Co. Ltd, New Delhi,

1999.

REFERENCE BOOKS 1. Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand

Co. Ltd., New Delhi, 2003.

2. Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt. Ltd., Singapore, 2002.


90

GRAPHICS AND MULTIMEDIA - IT636 AIM To impart the fundamental concepts of Computer Graphics and Multimedia. OBJECTIVES

To study the graphics techniques and algorithms.

To study the multimedia concepts and various I/O technologies.

To enable the students to develop their creativity OUTCOMES:

Students will be able to create image that can translate, scale and rotate.

Students will be able to create repeatable images for use as backgrounds, texture etc. 3.Evaluate graphic projects, identify items for improvements and implement changes.

Students will be able to write programs on Compression and Decompression algorithm.

Multimedia allow students to function as designers, using tools for analyzing the world, accessing and interpreting information and representing what they know to others.

UNIT I OUTPUT PRIMITIVES 9 + 3 Hours Introduction - Line - Curve and Ellipse Drawing Algorithms – Attributes – Two-Dimensional Geometric Transformations – Two-Dimensional Clipping and Viewing. UNIT II THREE-DIMENSIONAL CONCEPTS 9 + 3 Hours Three-Dimensional Object Representations – Three-Dimensional Geometric and Modeling Transformations – Three-Dimensional Viewing – Color models – Animation. UNIT III MULTIMEDIA SYSTEMS DESIGN 9 + 3 Hours An Introduction – Multimedia applications – Multimedia System Architecture – Evolving technologies for Multimedia – Defining objects for Multimedia systems – Multimedia Data interface standards – Multimedia Databases. UNIT IV MULTIMEDIA FILE HANDLING 9 + 3 Hours Compression & Decompression – Data & File Format standards – Multimedia I/O technologies - Digital voice and audio – Video image and animation – Full motion video – Storage and retrieval Technologies. UNIT V HYPERMEDIA 9 + 3 Hours Multimedia Authoring & User Interface – Hypermedia messaging - Mobile Messaging – Hypermedia message component – Creating Hypermedia message – Integrated multimedia message standards – Integrated Document management – Distributed Multimedia Systems.


91


1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, Pearson Education, 2011. (UNIT I : Chapters 1 to 6; UNIT 2: Chapter 9 – 12, 15, 16)

2. Prabat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2009. (UNIT 3 to 5)

REFERENCES

4. Judith Jeffcoate, “Multimedia in practice technology and Applications”, Pearson 2006

5. Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”, Pearson Education, second edition 2003.


92

GRAPHICS AND MULTIMEDIA LABORATORY - IT651

1. To implement Bresenham‟s algorithms for line, circle and ellipse drawing

2. To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing.

3. To implement Cohen-Sutherland 2D clipping and window-viewport mapping

4. To perform 3D Transformations such as translation, rotation and scaling.

5. To visualize projections of 3D images.

6. To convert between color models.

7. To implement text compression algorithm

8. To implement image compression algorithm

9. To perform animation using any Animation software

10. To perform basic operations on image using any image editing software


93

SYSTEM SOFTWARE LABORATORY - IT652 (Using C or C++)

1. Implement a symbol table with functions to create, insert, modify, search, and display.

2. Implement pass one of a two pass assembler.

3. Implement pass two of a two pass assembler.

4. Implement a single pass assembler.

5. Implement a macro processor.

6. Implement an absolute loader.

7. Implement a relocating loader.

8. Implement pass one of a direct-linking loader.

9. Implement pass two of a direct-linking loader.

10. Implement a simple text editor with features like insertion / deletion of a character, word, sentence.

(For loader exercises, output the snap shot of the main memory as it would be, after the loading has taken place)


94

INTERNET PROGRAMMING - IT734

AIM To explain Internet Programming concepts and related programming and scripting languages. OBJECTIVES

To describe basic Internet Protocols.

Explain JAVA and HTML tools for Internet programming.

Describe scripting languages – Java Script.

Explain dynamic HTML programming.

Explain Server Side Programming tools. OUTCOMES:

The course provides knowledge of and proficiency in basic techniques necessary for the development of web-based applications so that students can design and construct animated web pages and client-server applications.

UNIT I BASIC NETWORK AND WEB CONCEPTS 9 + 3 Hours

Internet standards – TCP and UDP protocols – URLs – MIME – CGI – Introduction to SGML. UNIT II JAVA PROGRAMMING 9 + 3 Hours

Java basics – I/O streaming – files – Looking up Internet Address - Socket programming – client/server programs – E-mail client – SMTP - POP3 programs – web page retrieval – protocol handlers – content handlers - applets – image handling - Remote Method Invocation.


95

UNIT III SCRIPTING LANGUAGES 9 + 3 Hours

HTML – forms – frames – tables – web page design - JavaScript introduction – control structures – functions – arrays – objects – simple web applications UNIT IV DYNAMIC HTML 9 + 3 Hours

Dynamic HTML – introduction – cascading style sheets – object model and collections – event model – filters and transition – data binding – data control – ActiveX control – handling of multimedia data UNIT V SERVER SIDE PROGRAMMING 9 + 3 Hours

Servlets – deployment of simple servlets – web server (Java web server / Tomcat / Web logic) – HTTP GET and POST requests – session tracking – cookies – JDBC – simple web applications – multi-tier applications.


1. Deitel, Deitel and Nieto, “Internet and World Wide Web – How to program”, Pearson Education Publishers, 2009.

2. Elliotte Rusty Harold, “Java Network Programming”, O‟Reilly Publishers, 2005

REFERENCES

1. R. Krishnamoorthy & S. Prabhu, “Internet and Java Programming”, New Age International Publishers, 2002.

2. Thomno A. Powell, “The Complete Reference HTML and XHTML”, fourth edition, Tata McGraw Hill, 2010.

3. “The Complete Reference – Java2”, Tata McGraw-Hill, 8rd edition, 2011. Herbert Scheldt


96

ARTIFICIAL INTELLIGENCE - IT735 AIM Artificial Intelligence aims at developing computer applications, which encompasses perception, reasoning and learning and to provide an in-depth understanding of major techniques used to simulate intelligence. OBJECTIVES

To provide a strong foundation of fundamental concepts in Artificial Intelligence

To provide a basic exposition to the goals and methods of Artificial Intelligence

To enable the student to apply these techniques in applications which involve perception, reasoning and learning.

OUTCOMES:

Understand fundamental AI concepts and current issues.

Understand and apply a range of symbolic and non-symbolic AI techniques including search and planning procedures, logic-based reasoning, neural networks, genetic programming and reasoning with uncertain information.

Recognize computational problems suited to an AI solution and implement solutions.

Know of applications in different areas of computing including the web and human interaction.

Understand the design issues inherent in different AI approaches Implement basic AI algorithms (e.g., standard search algorithms or dynamic

programming). Design and carry out an empirical evaluation of different algorithms on a problem

formalisation, and state the conclusions that the evaluation supports.


97

UNIT I INTRODUCTION 8 + 3 Hours Intelligent Agents – Agents and environments - Good behavior – The nature of environments – structure of agents - Problem Solving - problem solving agents – example problems – searching for solutions – uniformed search strategies - avoiding repeated states – searching with partial information. UNIT II SEARCHING TECHNIQUES 10 + 3 Hours Informed search and exploration – Informed search strategies – heuristic function – local search algorithms and optimistic problems – local search in continuous spaces – online search agents and unknown environments - Constraint satisfaction problems (CSP) – Backtracking search and Local search for CSP – Structure of problems - Adversarial Search – Games – Optimal decisions in games – Alpha – Beta Pruning – imperfect real-time decision – games that include an element of chance. Unit III KNOWLEDGE REPRESENTATION 10 + 3 Hours First order logic – representation revisited – Syntax and semantics for first order logic – Using first order logic – Knowledge engineering in first order logic - Inference in First order logic – prepositional versus first order logic – unification and lifting – forward chaining – backward chaining - Resolution - Knowledge representation - Ontological Engineering - Categories and objects – Actions - Simulation and events - Mental events and mental objects UNIT IV LEARNING 9 + 3 Hours Learning from observations - forms of learning - Inductive learning - Learning decision trees - Ensemble learning - Knowledge in learning – Logical formulation of learning – Explanation based learning – Learning using relevant information – Inductive logic programming - Statistical learning methods - Learning with complete data - Learning with hidden variable - EM algorithm - Instance based learning - Neural networks - Reinforcement learning – Passive reinforcement learning - Active reinforcement learning - Generalization in reinforcement learning. UNIT V APPLICATIONS 8 + 3 Hours Communication – Communication as action – Formal grammar for a fragment of English – Syntactic analysis – Augmented grammars – Semantic interpretation – Ambiguity and disambiguation – Discourse understanding – Grammar induction - Probabilistic language processing - Probabilistic language models – Information retrieval – Information Extraction – Machine translation.

L=45; T=15; TOTAL= 60


98

TEXT BOOK

1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, 2nd Edition, Pearson Education / Prentice Hall of India, 2004.

REFERENCES

2. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd., 2000.

3. Elaine Rich and Kevin Knight, “Artificial Intelligence”, 2nd Edition, Tata McGraw-Hill, 2012.

4. George F. Luger, “Artificial Intelligence-Structures And Strategies For Complex Problem Solving”, Pearson Education / PHI, 2008.


99

JAVA PROGRAMMING IT736

AIM

Learn the Java programming language: its syntax, idioms, patterns, and styles. Become comfortable with object oriented programming: Learn to think in objects Learn the essentials of the Java class library, and learn how to learn about other parts

of the library when you need them. Introduce event driven Graphical User Interface (GUI) programming

OBJECTIVES

Introduce the Java programming language, its syntax, structures and libraries. Develop object-oriented design and programming techniques. Practice robustness and transparency in software design and implementation.

OUTCOME

Writing robust, object-oriented console and Graphical User Interface (GUI) applications in Java and familiarity with the Java object-class hierarchy provided with the Java Development Kit (JDK) Standard Edition (Java SE) tools. Design and implement an application that demonstrates their competency with Java syntax, structure and programming logic, incorporating basic features of the language as well as some features from the I/O (Input/Output) or GUI libraries.

UNIT I 9+3 Hours INTRODUCTION TO JAVA PROGRAMMING History of Java. Characteristics of Java. The Java Environment – JVM, JDK & JRE. Different versions of Java. OOP Principles. Comparison of Java with C and C++. LANGUAGE FUNDAMENTALS Data Types, Expressions, Keywords, Operators and Control Flow Statements. Arrays – Special Types. Java File Structure. Creating and Running Java Programs. Comments in Java. CLASS AND OBJECTS Creating class and Objects, Methods, this keyword, Constructors. Garbage Collection, the finalize() method. Access Control. Static Blocks. Finals. Nested and Inner Classes. String Class. Command Line Arguments UNIT II 10+3 Hours INHERITANCE IN JAVA Inheritance in classes, Using super, Method overriding, Dynamic Method Dispatch. Abstract Classes, Using final with inheritance, the Object Class. INTERFACES AND PACKAGES


100

Inheritance in java with Interfaces – Defining Interfaces, Implementing Interfaces, Extending Interfaces. Creating Packages, CLASSPATH variable, Access protection, Importing Packages EXCEPTION HANDLING IN JAVA try-catch-finally mechanism, throw statement, throws statement. Packages and Classes for Exception Handling UNIT III INPUT / OUTPUT IN JAVA 10+3 Hours java.io package, I/O Streams, Readers and Writers, Tokenizing input, Using various I/O classes and FilenameFilter class. MULTITHREADING Life cycle of a thread, Java thread priorities, Runnable interface and Thread Class. Sharing limited Resources, Shared Object with Synchronization. APPLETS Life cycle of Applet, Applet Architecture, Applet restrictions, Applet advantages. Creation and Execution of java Applets.


101

UNIT IV GUI COMPONENTS (AWT & SWING) 8+3 Hours GUI concepts in java, Basic GUI Components in AWT, Container Classes, Layout Managers. Difference between AWT and SWING. SWING Components an Introduction Writing GUI programs in java (with AWT or SWING). GUI Programming with Applications and Applets, Event Handling. UNIT V DISTRIBUTED COMPUTING AN INTRODUCTION 8+3 Hours Network Programming with Java. JDBC (Java Database Connectivity). Servlets. Java Server Pages. RMI (Remote Method Invocation). TEXT BOOKS:

1. Schildt Herbert, Java 2: The Complete Reference, Tata McGraw-Hill, 4th Edition, 2002 2. Deitel & Deitel, Java How to Program, Pearson Education Asia, 3rd Edition, 2001

REFERENCE BOOKS:

1. Horton Ivor, Beginning Java2, Wiley publishing Inc., 1st Edition, 2005. 2. Holzner Steven, Java2 Black Book, dreamtech press, 1st Edition, 2002. 3. Gaddis Tony, Starting out with Java, dreamtech press, 2004. 4. Eckel Bruce, Thinking in Java, Pearson Education Asia, 2nd Edition, 2001 5. Flanagan David, Java in a nutshell, O‟REILLY, 4th Edition, 2002


102

JAVA PROGRAMMING LABORATORY - IT751

Section – A

1. Write a program to demonstrate various data types and operators. 2. Demonstrate arrays with arraycopy() method. 3. Demonstrate method overloading and constructor overloading. 4. Demonstrate the usage of static keyword in java – use static data and static block. 5. Demonstrate final keyword with respect to variable, method and class. 6. Demonstrate inner classes in java. 7. Write a program to demonstrate multilevel inheritance and usage of the keywords

this & super. 8. Demonstrate abstract class. 9. Demonstrate the usage of interface for multiple inheritance. 10. Differentiate the usage of throw, throws and try-catch-finally by writing a java

program. Section – B

11. Demonstrate various I/O streams in java. 12. Demonstrate the Reader/Writer classes in java. 13. Demonstrate the multithreading concept by implementing Runnable interface. 14. Demonstrate the multithreading concept by extending Thread class. 15. Write an applet program and using paint function make some graphics. 16. Write a program to demonstrate the usage of different Layouts in java. 17. Write a java program to demonstrate various GUI components in java (AWT /

SWING) with appropriate Event Handling.


103

INTERNET PROGRAMMING LABORATORY - IT752 LIST OF EXPERIMENTS 1. Write programs in Java to demonstrate the use of following components Text fields,

buttons, Scrollbar, Choice, List and Check box 2. Write Java programs to demonstrate the use of various Layouts like Flow Layout,

Border Layout, Grid layout, Grid bag layout and card layout 3. Write programs in Java to create applets incorporating the following features:

Create a color palette with matrix of buttons

Set background and foreground of the control text area by selecting a color from color palette.

In order to select Foreground or background use check box control as radio buttons

To set background images

4. Write programs in Java to do the following.

Set the URL of another server.

Download the homepage of the server.

Display the contents of home page with date, content type, and Expiration date. Last modified and length of the home page.

5. Write programs in Java using sockets to implement the following:

HTTP request

FTP

SMTP

POP3

6. Write a program in Java for creating simple chat application with datagram sockets and datagram packets.


104

7. Write programs in Java using Servlets:

To invoke servlets from HTML forms

To invoke servlets from Applets 8. Write programs in Java to create three-tier applications using servlets

for conducting on-line examination.

for displaying student mark list. Assume that student information is available in a database which has been stored in a database server.

9. Create a web page with the following using HTML

To embed a map in a web page

To fix the hot spots in that map

Show all the related information when the hot spots are clicked.

10. Create a web page with the following.

Cascading style sheets.

Embedded style sheets.

Inline style sheets.

Use our college information for the web pages.


105

INTERNSHIP IT771

Assessment of Internship (B.Tech)

All students should complete 60 days of internship before 7th semester. This component carries 2 credits.

Continuous Internal Assessment:2 credits o Presentation assessed by Panel Members

PROJECT WORK IT871 Assessment of Project Work

Continuous Internal Assessment:100 Marks

Presentation assessed by Panel Members

Assessed by Guide

End Semester Examination:100 Marks

Viva Voce

Demonstration

Project Report

COMPREHENSION IT872

Assessment of Comprehension Continuous Internal Assessment:50 Marks

Presentation assessed by Panel Members


106

CYBER SECURITY BTCY 01 Mandatory course

Total teaching Hours/Semester: 30 No. of credits: 2 No of Lecture Hours/Week: 02 AIM: This course is aimed at providing a comprehensive overview of the different facets of Cyber Security. In addition, the course will detail into specifics of Cyber Security with Cyber Laws both in Global and Indian Legal environments. OBJECTIVES: Providing knowledge about different Cyber Crimes, Threats and Laws .Creating awareness about risk management and protection from the cyber threats. UNIT I: Security Fundamentals-4 As Architecture Authentication Authorization Accountability, Social Media, Social Networking and Cyber Security. Cyber Laws, IT Act 2000-IT Act 2008-Laws for Cyber-Security, Comprehensive National Cyber-Security Initiative CNCI – Legalities. UNIT II: Cyber Attack and Cyber Services Computer Virus – Computer Worms – Trojan horse. Vulnerabilities - Phishing - Online Attacks – Pharming - Phoarging – Cyber Attacks - Cyber Threats - Zombie- stuxnet - Denial of Service Vulnerabilities - Server Hardening-TCP/IP attack-SYN Flood. UNIT III: Cyber Security Management Risk Management and Assessment - Risk Management Process - Threat Determination Process -Risk Assessment - Risk Management Lifecycle.Security Policy Management - Security Policies UNIT-IV: Vulnerability - Assessment and Tools: Vulnerability Testing - Penetration Testing Black box- white box. Architectural Integration: Security Zones - Devicesviz Routers, Firewalls, DMZ. Configuration Management - Certification and Accreditation for Cyber-Security. UNIT V:


107

Authentication and Cryptography: Authentication - Cryptosystems - Certificate Services Securing Communications: Securing Services - Transport – Wireless - Steganography and NTFS Data Streams. Intrusion Detection and Prevention Systems: Intrusion - Defense in Depth - IDS/IPS -IDS/IPS Weakness and Forensic Analysis CyberEvolution:CyberOrganizationCyber Future REFERENCES 1. Matt Bishop, Introduction to Computer Security, Pearson, 6th impression, ISBN: 978-81-

7758-425-7.

2. Thomas R, Justin Peltier, John, Information Security Fundamentals, Auerbach Publications.

3. AtulKahate, Cryptography and Network Security 2nd Edition, Tata McGrawHill.

4. Nina Godbole, SunitBelapure, Cyber Security, Wiley India 1st Edition 2011.

5. Jennifer L. Bayuk and Jason Healey and Paul Rohmeyer and Marcus Sachs, Cyber Security Policy Guidebook, Wiley; 1 edition , 2012, ISBN-10: 1118027809

6. Dan Shoemaker and Wm. Arthur Conklin, Cybersecurity: The Essential Body Of Knowledge, Delmar Cengage Learning; 1 edition (May 17, 2011) ,ISBN-10: 1435481690

7. Stallings, “Cryptography & Network Security - Principles & Practice”, Prentice Hall, 3rd Edition 2002.

http://www.amazon.com/Jennifer-L.-Bayuk/e/B004O8Q4RC/ref=sr_ntt_srch_lnk_6?qid=1360247739&sr=1-6

http://www.amazon.com/Cyber-Security-Policy-Guidebook-Jennifer/dp/1118027809/ref=sr_1_6?s=books&ie=UTF8&qid=1360247739&sr=1-6&keywords=cyber+security



http://www.amazon.com/Dan-Shoemaker/e/B001IQWF94/ref=ntt_athr_dp_pel_1

http://www.amazon.com/Wm.-Arthur-Conklin/e/B0032L8506/ref=ntt_athr_dp_pel_2


108

UNIX INTERNALS – IT631A AIM To understand the kernel, I/O & files, process control, scheduling and memory management policies in UNIX. OBJECTIVES

To get thorough understanding of the kernel..

To understand the file organization and management.

To know the various system calls.

To have knowledge of process architecture, process control & scheduling and memory management.

UNIT I GENERAL OVERVIEW OF THE SYSTEM 9 + 3 Hours 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 – Summary and Preview. UNIT II BUFFER CACHE 9 + 3 Hours 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 + 3 Hours 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 UNIT IV THE STRUCTURE OF PROCESSES 9 + 3 Hours Process states and transitions – Layout of system memory – The context of a process – Saving the context of a process. Process Control: Process creation – Signals – Process termination – Awaiting process termination – Invoking other programs – The shell – System boot and the INIT process. UNIT V PROCESS SCHEDULING AND MEMORY MANAGEMENT POLICIES 9 + 3 Hours Process Scheduling – Memory Management Policies : Swapping – A hybrid system with swapping and demand paging. The I/O Subsystem : Driver Interfaces– Disk Drivers-Terminal Drivers.

L=45; T=15; TOTAL= 60


109

TEXT BOOKS

1. Maurice J. Bach, “The Design of the Unix Operating System”, Prentice Hall of India, 2012.

REFERENCES

3. Vahalia, “Unix Internals: The New Frontiers”, Pearson Education Inc, 2003.


110

DATA WAREHOUSING AND MINING – IT631B AIM To serve as an introductory course to under graduate students with an emphasis on the design aspects of Data mining and Data Warehousing OBJECTIVE This course has been designed with the following objectives:

To introduce the concept of data mining with in detail coverage of basic tasks, metrics, issues, and implication. Core topics like classification, clustering and association rules are exhaustively dealt with.

To introduce the concept of data warehousing with special emphasis on architecture and design.

OUTCOMES:

Analyze, design, build and deploy data warehousing systems using a variety of current application technologies and architectures.

Evaluate and select appropriate technologies and tools for building and deploying modern computer systems.

Manage the data mining development process in an individual or team context.

Plan, design and deploy the necessary data mining technologies to support a software system.

Design, build and manage Business Intelligence computer and communications systems fit for a given business purpose.

UNIT I INTRODUCTION AND DATA WAREHOUSING 8 + 3 Hours Introduction, Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Implementation, Further Development, Data Warehousing to Data Mining. UNIT II DATA PREPROCESSING, LANGUAGE, ARCHITECTURES, CONCEPT DESCRIPTION 8 + 3 Hours Why Preprocessing, Cleaning, Integration, Transformation, Reduction, Discretization, Concept Hierarchy Generation, Data Mining Primitives, Query Language, Graphical User Interfaces, Architectures, Concept Description, Data Generalization, Characterizations, Class Comparisons, Descriptive Statistical Measures. UNIT III ASSOCIATION RULES 9 + 3 Hours Association Rule Mining, Single-Dimensional Boolean Association Rules from Transactional Databases, Multi-Level Association Rules from Transaction Databases UNIT IV CLASSIFICATION AND CLUSTERING 12 + 3 Hours


111

Classification and Prediction, Issues, Decision Tree Induction, Bayesian Classification, Association Rule Based, Other Classification Methods, Prediction, Classifier Accuracy, Cluster Analysis, Types of data, Categorisation of methods, Partitioning methods, Outlier Analysis. UNIT V RECENT TRENDS 8 + 3 Hours Multidimensional Analysis and Descriptive Mining of Complex Data Objects, Spatial Databases, Multimedia Databases, Time Series and Sequence Data, Text Databases, World Wide Web, Applications and Trends in Data Mining


1. J. Han, M. Kamber, “Data Mining: Concepts and Techniques”, Harcourt India / Morgan Kauffman, 2011.


112

REFERENCES

1. Margaret H.Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education 2004.

2. Sam Anahory, Dennis Murry, “Data Warehousing in the real world”, Pearson Education 2003.

3. David Hand, Heikki Manila, Padhraic Symth, “Principles of Data Mining”, PHI 2004.

4. W.H.Inmon, “Building the Data Warehouse”, 3rd Edition, Wiley, 2003.

5. Alex Bezon, Stephen J.Smith, “Data Warehousing, Data Mining & OLAP”, MeGraw-Hill Edition, 2001

6. Paulraj Ponniah, “Data Warehousing Fundamentals”, Wiley-Interscience Publication, 2003.


113

RESOURCE MANAGEMENT TECHNIQUES – IT631C

UNIT I LINEAR PROGRAMMING: 9 + 3 Hours Principal components of decision problem – Modeling phases – LP Formulation and graphic solution – Resource allocation problems – Simplex method – Sensitivity analysis.

UNIT II DUALITY AND NETWORKS: 9 + 3 Hours

Definition of dual problem – Primal – Dual relation ships – Dual simplex methods – Post optimality analysis – Transportation and assignment model shortest route problem. UNIT III INTEGER PROGRAMMING: 9 + 3 Hours

Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming. UNIT IV CLASSICAL OPTIMISATION THEORY: 9 + 3 Hours

Unconstrained external problems, Newton – Ralphson method – Equality constraints – Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems.

UNIT V OBJECT SCHEDULING: 9 + 3 Hours

Network diagram representation – Critical path method – Time charts and resource leveling – PERT.

L=45; T=15; TOTAL= 60 REFERNECES:

1. Anderson „Quantitative Methods for Business‟, 8th Edition, Thomson Learning, 2002.

2. Winston „Operation Research‟, Thomson Learning, 2003.

3. H.A.Taha, „Operation Research‟, Prentice Hall of India, 2002.

4. Vohra, „Quantitative Techniques in Management‟, Tata McGraw Hill, 2002.

5. Anand Sarma, „Operation Research‟, Himalaya Publishing House, 2003.


114

HIGH PERFORMANCE MICROPROCESSORS - IT631D AIM To do a detailed study of CISC and RISC principles, study the architecture & special features of the Pentium processors and typical RISC processors and to study the architecture of special purpose processors. OBJECTIVES

To study the principles of CISC

To study the Pentium processor family

To study the principles of RISC

To study the architecture & special features of typical RISC processors.

To study the architecture & function of special purpose processors. UNIT I CISC PRINCIPLES 9 + 3 Hours Classic CISC microprocessors, Intel x86 Family: Architecture - register set - Data formats - Addressing modes - Instruction set - Assembler directives – Interrupts - Segmentation, Paging, Real and Virtual mode execution – Protection mechanism, Task management 80186, 286, 386 and 486 architectures. UNIT II PENTIUM PROCESSORS 10 + 3 Hours Introduction to Pentium microprocessor – Special Pentium Registers – Pentium Memory Management – New Pentium instructions – Introduction to Pentium Pro and its special features – Architecture of Pentium-II, Pentium-III and Pentium4 microprocessors. UNIT III RISC PRINCIPLES 10 + 3 Hours RISC Vs CISC – RISC properties and evaluation – On chip register File Vs Cache evaluation – Study of a typical RISC processor – The PowerPC – Architecture & special features – Power PC 601 – IBM RS/6000, Sun SPARC Family – Architecture – Super SPARC. UNIT IV RISC PROCESSOR 8 + 3 Hours MIPS Rx000 family – Architecture – Special features – MIPS R4000 and R4400 – Motorola 88000 Family – Architecture – MC 88110 – MC 88100 and MC 88200. UNIT V SPECIAL PURPOSE PROCESSORS 8 + 3 Hours EPIC Architecture – ASIPs – Network Processors – DSPs – Graphics / Image Processors.


1. Daniel Tabak, “Advanced Microprocessors”, Tata McGraw-Hill, 2011, 2nd Edition. REFERENCES 1. www.intel.com/products/server/processors/server/itanium2 (Unit V:EPIC)


115

2. www.hpl.hp.com/techreports/1999/HPL-1999-111.html (Unit V: Network Processor)

3. www.intel.com/design/network/products/npfamily (Unit V: Network Processor)

4. www.national.com/appinfo/imaging/processors.html(Unit V: Image Processor)

5. Barry B.Brey, “The Intel Microprocessors, 8086/8088, 80186/80188, 80286, 80386, 80486, Pentium, PentiumPro Processor, PentiumII, PentiumIII, PentiumIV, Architecture, Programming & Interfacing”, 6th Edition, Pearson Education/PHI, 2002.


116

EMBEDDED SYSTEMS – IT631E

AIM To give sufficient background for undertaking embedded systems design. OBJECTIVES

To introduce students to the embedded systems, its hardware and software.

To introduce devices and buses used for embedded networking.

To explain programming concepts and embedded programming in C and C++.

To explain real time operating systems, inter-task communication and an exemplary case of MUCOS – IIRTOS.

UNIT I INTRODUCTION TO EMBEDDED SYSTEMS 9 + 3 Hours Definition and Classification – Overview of Processors and hardware units in an embedded system – Software embedded into the system – Exemplary Embedded Systems – Embedded Systems on a Chip (SoC) and the use of VLSI designed circuits UNIT II DEVICES AND BUSES FOR DEVICES NETWORK 9 + 3 Hours I/O Devices - Device I/O Types and Examples – Synchronous - Iso-synchronous and Asynchronous Communications from Serial Devices - Examples of Internal Serial-Communication Devices - UART and HDLC - Parallel Port Devices - Sophisticated interfacing features in Devices/Ports- Timer and Counting Devices - „12C‟, „USB‟, „CAN‟ and advanced I/O Serial high speed buses- ISA, PCI, PCI-X, cPCI and advanced buses. UNIT III PROGRAMMING CONCEPTS AND EMBEDDED PROGRAMMING IN C, C++ 9 + 3 Hours Programming in assembly language (ALP) vs. High Level Language - C Program Elements, Macros and functions -Use of Pointers - NULL Pointers - Use of Function Calls – Multiple function calls in a Cyclic Order in the Main Function Pointers – Function Queues and Interrupt Service Routines Queues Pointers – Concepts of EMBEDDED PROGRAMMING in C++ - Objected Oriented Programming – Embedded Programming in C++, „C‟ Program compilers – Cross compiler – Optimization of memory codes. UNIT IV REAL TIME OPERATING SYSTEMS – PART - 1 9 + 3 Hours Definitions of process, tasks and threads – Clear cut distinction between functions – ISRs and tasks by their characteristics – Operating System Services- Goals – Structures- Kernel - Process Management – Memory Management – Device Management – File System Organisation and Implementation – I/O Subsystems – Interrupt Routines Handling in RTOS, REAL TIME OPERATING SYSTEMS : RTOS Task scheduling models - Handling of task scheduling and latency and deadlines as performance metrics – Co-operative Round Robin Scheduling – Cyclic Scheduling with Time Slicing (Rate Monotonics Co-operative Scheduling) – Preemptive Scheduling Model strategy by a Scheduler – Critical Section Service by a Preemptive Scheduler – Fixed (Static) Real time scheduling of tasks - INTER PROCESS COMMUNICATION AND SYNCHRONISATION – Shared data problem – Use of Semaphore(s) – Priority Inversion Problem and Deadlock Situations – Inter Process


117

Communications using Signals – Semaphore Flag or mutex as Resource key – Message Queues – Mailboxes – Pipes – Virtual (Logical) Sockets – Remote Procedure Calls (RPCs). UNIT V REAL TIME OPERATING SYSTEMS – PART - 2 9 + 3 Hours Study of Micro C/OS-II or Vx Works or Any other popular RTOS – RTOS System Level Functions – Task Service Functions – Time Delay Functions – Memory Allocation Related Functions – Semaphore Related Functions – Mailbox Related Functions – Queue Related Functions – Case Studies of Programming with RTOS – Understanding Case Definition – Multiple Tasks and their functions – Creating a list of tasks – Functions and IPCs – Exemplary Coding Steps.

L=45; T=15; TOTAL= 60

TEXT BOOKS 1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA

McGraw-Hill, First reprint Oct. 2003 REFERENCES

1. Steve Heath, Embedded Systems Design, Second Edition-2003, Newnes,

2. David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2002

3. Wayne Wolf, Computers as Components; Principles of Embedded Computing System Design – Harcourt India, Morgan Kaufman Publishers, First Indian Reprint 2001

4. Frank Vahid and Tony Givargis, Embedded Systems Design – A unified Hardware / Software Introduction, John Wiley, 2002.


118

ADVANCED DATABASES – IT631F

AIM Advanced database aims at developing computer application with different kinds of data models. It is also deals with the Transaction management of these different databases. OBJECTIVES

To study the needs of different databases.

To understand about different data models that can be used for these databases.

To make the students to get familiarized with transaction management of the database

To develop in-depth knowledge about web and intelligent database.

To provide an introductory concept about the way in which data can be stored in geographical information systems etc.,

UNIT I DISTRIBUTED DATABASES 9 + 3 Hours Distributed DBMS Concepts and Design – Introduction – Functions and Architecture of DDBMS – Distributed Relational Database Design – Transparency in DDBMS – Distributed Transaction Management – Concurrency control – Deadlock Management – Database recovery – The X/Open Distributed Transaction Processing Model – Replication servers – Distributed Query Optimisation - Distribution and Replication in Oracle. UNIT II OBJECT ORIENTED DATABASES 9 + 3 Hours Object Oriented Databases – Introduction – Weakness of RDBMS – Object Oriented Concepts Storing Objects in Relational Databases – Next Generation Database Systems – Object Oriented Data models – OODBMS Perspectives – Persistence – Issues in OODBMS – Object Oriented Database Management System Manifesto – Advantages and Disadvantages of OODBMS – Object Oriented Database Design – OODBMS Standards and Systems – Object Management Group – Object Database Standard ODMG – Object Relational DBMS –Postgres - Comparison of ORDBMS and OODBMS. UNIT III WEB DATABASES 9 + 3 Hours Web Technology And DBMS – Introduction – The Web – The Web as a Database Application Platform – Scripting languages – Common Gateway Interface – HTTP Cookies – Extending the Web Server – Java – Microsoft‟s Web Solution Platform – Oracle Internet Platform – Semi structured Data and XML – XML Related Technologies – XML Query Languages UNIT IV INTELLIGENT DATABASES 9 + 3 Hours Enhanced Data Models For Advanced Applications – Active Database Concepts And Triggers – Temporal Database Concepts – Deductive databases – Knowledge Databases. UNIT V CURRENT TRENDS 9 + 3 Hours Mobile Database – Geographic Information Systems – Genome Data Management – Multimedia Database – Parallel Database – Spatial Databases - Database administration – Data Warehousing and Data Mining.


119


1. Thomas M. Connolly, Carolyn E. Begg, “Database Systems - A Practical Approach to Design , Implementation , and Management”, Third Edition , Pearson Education, 2009

REFERENCES

1. Ramez Elmasri & Shamkant B.Navathe, “Fundamentals of Database Systems”, Fourth Edition , Pearson Education , 2004.

2. M.Tamer Ozsu , Patrick Ualduriel, “Principles of Distributed Database Systems”, Second Edition, Pearso nEducation, 2003.

3. C.S.R.Prabhu, “Object Oriented Database Systems”, PHI, 2003.

4. Peter Rob and Corlos Coronel, “Database Systems – Design, Implementation and Management”, Thompson Learning, Course Technology, 5th Edition, 2003


120

.INTELLECTUAL PROPERTY RIGHTS (IPR) – IT631G UNIT I 5 + 3 Hours Introduction – Invention and Creativity – Intellectual Property (IP) – Importance – Protection of IPR – Basic types of property (i. Movable Property ii. Immovable Property and iii. Intellectual Property). UNIT II 10 + 3 Hours IP – Patents – Copyrights and related rights – Trade Marks and rights arising from Trademark registration – Definitions – Industrial Designs and Integrated circuits – Protection of Geographical Indications at national and International levels – Application Procedures. UNIT III 10 + 3 Hours International convention relating to Intellectual Property – Establishment of WIPO – Mission and Activities – History – General Agreement on Trade and Tariff (GATT). UNIT IV 10 + 3 Hours Indian Position Vs WTO and Strategies – Indian IPR legislations – commitments to WTO-Patent Ordinance and the Bill – Draft of a national Intellectual Property Policy – Present against unfair competition. UNIT V 10 + 3 Hours Case Studies on – Patents (Basumati rice, turmeric, Neem, etc.) – Copyright and related rights – Trade Marks – Industrial design and Integrated circuits – Geographic indications – Protection against unfair competition. TEXT BOOKS

1. Subbaram N.R. “Handbook of Indian Patent Law and Practice “, S. Viswanathan (Printers and Publishers) Pvt. Ltd., 1998.

2. Indian Patent Law and Practice by Kalyan C. Kankanala, Arun k. Narasani, Vinita Radhakrishnan Publisher: Oxford University Press 2012

REFERENCES

1. Eli Whitney, United States Patent Number : 72X, Cotton Gin, March 14, 1794. 2. Intellectual Property Today : Volume 8, No. 5, May 2001, [www.iptoday.com]. 3. Using the Internet for non-patent prior art searches, Derwent IP Matters, July 2000.

[www.ipmatters.net/features/000707_gibbs.html.


121

INDIAN CONSTITUTION AND SOCIETY – IT631H

UNIT I 9 + 3 Hours Historical Background – Constituent Assembly of India – Philosophical foundations of the Indian Constitution – Preamble – Fundamental Rights – Directive Principles of State Policy – Fundamental Duties – Citizenship – Constitutional Remedies for citizens.

UNIT II 9 + 3 Hours Union Government – Structures of the Union Government and Functions – President – Vice President – Prime Minister – Cabinet – Parliament – Supreme Court of India – Judicial Review. UNIT III 9 + 3 Hours State Government – Structure and Functions – Governor – Chief Minister – Cabinet – State Legislature – Judicial System in States – High Courts and other Subordinate Courts.

UNIT IV 9 + 3 Hours Indian Federal System – Center – State Relations – President‟s Rule – Constitutional Amendments – Constitutional Functionaries - Assessment of working of the Parliamentary System in India. UNIT V 9 + 3 Hours Society : Nature, Meaning and definition; Indian Social Structure; Castle, Religion, Language in India; Constitutional Remedies for citizens – Political Parties and Pressure Groups; Right of Women, Children and Scheduled Castes and Scheduled Tribes and other Weaker Sections. TEXT BOOKS

1. Durga Das Basu, “Introduction to the Constitution of India “, Prentice Hall of India, New Delhi.

2. R.C.Agarwal, “(1997) Indian Political System “, S.Chand and Company, New Delhi. 3. Maciver and Page, “Society: An Introduction Analysis “, Mac Milan India Ltd., New Delhi. 4. K.L.Sharma, “(1997) Social Stratification in India: Issues and Themes “, Jawaharlal Nehru

University, New Delhi.

REFERENCES

1. Sharma, Brij Kishore, “Introduction to the Constitution of India:, Prentice Hall of India, New Delhi.

2. U.R.Gahai, “(1998) Indian Political System “, New Academic Publishing House,. 3. Jalaendhar..R.N. Sharma, “Indian Social Problems “, Media Promoters and

Publishers Pvt. Ltd. 4. Yogendra Singh, “(1997) Social Stratification and Charge in India “, Manohar, New

Delhi.


122

ADVANCED OPERATING SYSTEMS – IT731A

AIM To understand the principles in the design of modern operating systems, distributed and multiprocessor operating systems OBJECTIVES

To get a comprehensive knowledge of the architecture of distributed systems.

To understand the deadlock and shared memory issues and their solutions in distributed environments.

To know the security issues and protection mechanisms for distributed environments.

To get a knowledge of multiprocessor operating system and database operating systems.

UNIT I 9 + 3 Hours Architectures of Distributed Systems - System Architecture types - issues in distributed operating systems - communication networks – communication primitives. Theoretical Foundations - inherent limitations of a distributed system – lamp ports logical clocks – vector clocks – casual ordering of messages – global state – cuts of a distributed computation – termination detection. Distributed Mutual Exclusion – introduction – the classification of mutual exclusion and associated algorithms – a comparative performance analysis. UNIT II 9 + 3 Hours Distributed Deadlock Detection -Introduction - deadlock handling strategies in distributed systems – issues in deadlock detection and resolution – control organizations for distributed deadlock detection – centralized and distributed deadlock detection algorithms –hierarchical deadlock detection algorithms. Agreement protocols – introduction-the system model, a classification of agreement problems, solutions to the Byzantine agreement problem, applications of agreement algorithms. Distributed resource management: introduction-architecture – mechanism for building distributed file systems – design issues – log structured file systems. UNIT III 9 + 3 Hours Distributed shared memory-Architecture– algorithms for implementing DSM – memory coherence and protocols – design issues. Distributed Scheduling – introduction – issues in load distributing – components of a load distributing algorithm – stability – load distributing algorithm – performance comparison – selecting a suitable load sharing algorithm – requirements for load distributing -task migration and associated issues. Failure Recovery and Fault tolerance: introduction– basic concepts – classification of failures – backward and forward error recovery, backward error recovery- recovery in concurrent systems – consistent set of check points – synchronous and asynchronous check pointing and recovery – check pointing for distributed database systems- recovery in replicated distributed databases.


123

UNIT IV 9 + 3 Hours Protection and security -preliminaries, the access matrix model and its implementations.-safety in matrix model- advanced models of protection. Data security – cryptography: Model of cryptography, conventional cryptography- modern cryptography, private key cryptography, data encryption standard- public key cryptography – multiple encryption – authentication in distributed systems. UNIT-V 9 + 3 Hours Multiprocessor operating systems - basic multiprocessor system architectures – inter connection networks for multiprocessor systems – caching – hypercube architecture. Multiprocessor Operating System - structures of multiprocessor operating system, operating system design issues- threads- process synchronization and scheduling. Database Operating systems :Introduction- requirements of a database operating system Concurrency control : theoretical aspects – introduction, database systems – a concurrency control model of database systems- the problem of concurrency control – serializability theory- distributed database systems, concurrency control algorithms – introduction, basic synchronization primitives, lock based algorithms-timestamp based algorithms, optimistic algorithms – concurrency control algorithms, data replication.


1. Mukesh Singhal, Niranjan G.Shivaratri, "Advanced concepts in operating systems: Distributed, Database and multiprocessor operating systems", TMH, 2001

REFERENCES

1. Andrew S.Tanenbaum, "Modern operating system", PHI, 2003

2. Pradeep K.Sinha, "Distributed operating system-Concepts and design", PHI, 2003.

3. Andrew S.Tanenbaum, "Distributed operating system", Pearson education, 2003


124

REAL TIME SYSTEMS – IT731B

AIM To understand the basic concepts, design and integration of Real Time Systems.

OBJECTIVES

To know about the specification and design techniques of a Real Time System.

To understand about real time task communication and synchronization

To have a vast knowledge of queuing models and Real Time System integration. UNIT I BASIC REAL TIME CONCEPTS 9 + 3 Hours Basic computer architecture – some terminology - real time design issues – example real time systems – input and output – other devices – language features. UNIT II REAL TIME SPECIFICATION AND DESIGN TECHNIQUES 9 + 3 Hours Natural languages – mathematical specification – flow charts – structured charts – pseudocode and programming design languages – finite state automata – data flow diagrams – petri nets – Warnier Orr notation – state charts – polled loop systems – phase / sate driven code – coroutines – interrupt – driven systems – foreground/background system – full featured real time operating systems UNIT III INTERTASK COMMUNICATION AND SYNCHRONIZATION

9 + 3 Hours Buffering data – mailboxes – critical regions – semaphores – deadlock – process stack management – dynamic allocation – static schemes – response time calculation – interrupt latency – time loading and its measurement – scheduling is NP complete – reducing response times and time loading – analysis of memory requirements – reducing memory loading – I/O performance UNIT IV QUEUING MODELS 9 + 3 Hours Probability functions – discrete- basic buffering calculation – classical queuing theory – little's law – erlong's formula – faults, failures, bugs and effects – reliability-testing – fault tolerance – classification of architecture – distributing systems – Non Von Neuman architecture UNIT V HARDWARE/SOFTWARE INTEGRATION 9 + 3 Hours Goals of real time system integration – tools - methodology -software Heinsberg uncertainity principle – real time applications


1. Philip A.Laplante, “Real time system design and analysis – an engineer's handbook 2006 wiley India Pvt Ltd.,

REFERENCES


125

1. C.M.Krishna and Kang G Shin, "Real time systems", TMH, 2009

2. Stuart Bennelt, "Real time computer control – and introduction", Pearson education, 2003.

3. Allen Burns, Andy Wellings, “Real Time Systems and Programming Languages”, Pearson Education, 2003.


126

TCP / IP DESIGN AND IMPLEMENTATION – IT731C

AIM Having learned about computer networks, this subject helps the students to learn TCP/IP protocol indepth considering design alternatives and implementation techniques. OBJECTIVES

To understand the internals of the TCP/IP protocols

To understand how TCP/IP is actually implemented

To understand the interaction among the protocols in a protocol stack. UNIT I INTRODUCTION 9 + 3 Hours Internetworking concepts and architectural model- classful Internet address – CIDR-Subnetting and Supernetting –ARP- RARP- IP – IP Routing –ICMP – Ipv6 UNIT II TCP 9 + 3 Hours Services – header – connection establishment and termination- interactive data flow- bulk data flow- timeout and retransmission – persist timer - keepalive timer- futures and performance UNIT III IP IMPLEMENTATION 9 + 3 Hours IP global software organization – routing table- routing algorithms-fragmentation and reassembly- error processing (ICMP) –Multicast Processing (IGMP) UNIT IV TCP IMPLEMENTATION I 9 + 3 Hours Data structure and input processing – transmission control blocks- segment format- comparison-finite state machine implementation-Output processing- mutual exclusion-computing the TCP data length. UNIT V TCP IMPLEMENTATION II 9 + 3 Hours Timers-events and messages- timer process- deleting and inserting timer event- flow control and adaptive retransmission-congestion avoidance and control – urgent data processing and push function.


1. Douglas E.Comer – “Internetworking with TCP/IP Principles, Protocols and Architecture”, Vol. 1 & 2 fourth edition, PHI 2010. (Unit I in Comer Vol. I, Units II, IV & V – Comer Vol. II )

2. W.Richard Stevens “TCP/IP illustrated” Volume 1 Pearson Education, 2012 (Unit II ) REFERENCES

1. TCP/IP protocol suite, Forouzan, 2nd edition, TMH, 2003


127

2. W.Richard Stevens “TCP/IP illustrated” Volume 2 Pearson Education 2003. C # AND .NET FRAMEWORK – IT731D

AIM To cover the fundamental concepts of the C# language and the .NET framework. OBJECTIVE

The student will gain knowledge in the concepts of the .NET framework as a whole and the technologies that constitute the framework.

The student will gain programming skills in C# both in basic and advanced levels.

By building sample applications, the student will get experience and be ready for large-scale projects.

UNIT I INTRODUCTION TO C# 8 + 3 Hours Introducing C#, Understanding .NET, Overview of C#, Literals, Variables, Data Types, Operators, Expressions, Branching, Looping, Methods, Arrays, Strings, Structures, Enumerations. UNIT II OBJECT ORIENTED ASPECTS OF C# 9 + 3 Hours Classes, Objects, Inheritance, Polymorphism, Interfaces, Operator Overloading, Delegates, Events, Errors and Exceptions. UNIT III APPLICATION DEVELOPMENT ON .NET 8 + 3 Hours Building Windows Applications, Accessing Data with ADO.NET. UNIT IV WEB BASED APPLICATION DEVELOPMENT ON .NET 8 + 3 Hours Programming Web Applications with Web Forms, Programming Web Services. UNIT V THE CLR AND THE .NET FRAMEWORK 12+3 Hours Assemblies, Versioning, Attributes, Reflection, Viewing MetaData, Type Discovery, Reflecting on a Type, Marshaling, Remoting, Understanding Server Object Types, Specifying a Server with an Interface, Building a Server, Building the Client, Using SingleCall, Threads.


1. E. Balagurusamy, “Programming in C#”, Tata McGraw-Hill, 2010 (Unit I, II)

2. J. Liberty, “Programming C#”, 2nd ed., O‟Reilly, 2008. (Unit III, IV, V)


128

REFERENCES

1. Herbert Schildt, “The Complete Reference: C#”, Tata McGraw-Hill, 2004.

2. Robinson et al, “Professional C#”, 2nd ed., Wrox Press, 2002.

3. Andrew Troelsen, “C# and the .NET Platform”, A! Press, 2003.

4. S. Thamarai Selvi, R. Murugesan, “A Textbook on C#”, Pearson Education, 2003.


129

SYSTEM MODELING AND SIMULATION – IT732A AIM To build knowledge on system modeling and system study on various applications. OBJECTIVES

To provide a strong foundation on concept of simulation, and modeling.

To understand the techniques of random number generations.

To understand the techniques of testing randomness.

To design simulation models for various case studies like inventory, traffic flow networks, etc.

To practice on simulation tools and impart knowledge on building simulation systems.

UNIT I INTRODUCTION 8 + 3 Hours Systems, modeling, general systems theory, Concept of simulation, Simulation as a decision making tool, types of simulation. UNIT II RANDOM NUMBERS 9 + 3 Hours Pseudo random numbers, methods of generating random variables, discrete and continuous distributions, testing of random numbers. UNIT III DESIGN OF SIMULATION EXPERIMENTS 10 + 3 Hours Problem formulation, data collection and reduction, time flow mechanism, key variables, logic flow chart, starting condition, run size, experimental design consideration, output analysis and interpretation validation.


130

UNIT I V SIMULATION LANGUAGES 8 + 3 Hours Comparison and selection of simulation languages, study of anyone simulation language.

UNIT V CASE STUDIES 10 + 3 Hours Development of simulation models using simulation language studied for systems like queuing systems, Production systems, Inventory systems, maintenance and replacement systems and Investment analysis.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Geoffrey Gordon, “System Simulation”, 2nd Edition, Prentice Hall, India, 2011

2. Narsingh Deo, “System Simulation with Digital Computer, “Prentice Hall, India, 2009.

REFERENCES

1. Jerry Banks and John S.Carson, Barry L. Nelson, David M.Nicol, “Discrete Event System Simulation”, 3rd Edition, Prentice Hall, India, 2002.

2. Shannon, R.E. Systems simulation, The art and science, Prentice Hall, 1975.

3. Thomas J. Schriber, Simulation using GPSS, John Wiley, 1991.


131

CRYPTOGRAPHY AND NETWORK SECURITY – IT732B AIM To understand the principles of encryption algorithms; conventional and public key cryptography. To have a detailed knowledge about authentication, hash functions and application level security mechanisms. OBJECTIVES

To know the methods of conventional encryption.

To understand the concepts of public key encryption and number theory

To understand authentication and Hash functions.

To know the network security tools and applications.

To understand the system level security used.

OUTCOME

Understand the principles and practices of cryptographic techniques.

Understand the theory of fundamental cryptography, encryption, and decryption algorithms,

Understand a variety of generic security threats and vulnerabilities, and identify and analyse particular security problems for a given application.

Build simple cryptosystems by applying encryption algorithms,

Comprehend secure identity management (authentication), message authentication, and digital signature techniques.


OSI Security Architecture - Classical Encryption techniques – Cipher Principles – Data Encryption Standard – Block Cipher Design Principles and Modes of Operation - Evaluation criteria for AES – AES Cipher – Triple DES – Placement of Encryption Function – Traffic Confidentiality UNIT II PUBLIC KEY CRYPTOGRAPHY 10 + 3 Hours

Key Management - Diffie-Hellman key Exchange – Elliptic Curve Architecture and Cryptography - Introduction to Number Theory – Confidentiality using Symmetric Encryption – Public Key Cryptography and RSA. UNIT III AUTHENTICATION AND HASH FUNCTION 9 + 3 Hours

Authentication requirements – Authentication functions – Message Authentication Codes – Hash Functions – Security of Hash Functions and MACs – MD5 message Digest algorithm - Secure Hash Algorithm – RIPEMD – HMAC Digital Signatures – Authentication Protocols – Digital Signature Standard


132

UNIT IV NETWORK SECURITY 8 + 3 Hours Authentication Applications: Kerberos – X.509 Authentication Service – Electronic Mail Security – PGP – S/MIME - IP Security – Web Security. UNIT V SYSTEM LEVEL SECURITY 8 + 3 Hours Intrusion detection – password management – Viruses and related Threats – Virus Counter measures – Firewall Design Principles – Trusted Systems.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. William Stallings, “Cryptography And Network Security – Principles and Practices”, Pearson Education, 2011

REFERENCES

1. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.

2. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons Inc, 2001.

3. Charles B. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Third Edition, Pearson Education, 2003.


133

NATURAL LANGUAGE PROCESSING – IT732C AIM

The aim is to expose the students to the basic principles of language processing and typical applications of natural language processing systems OBJECTIVE

To provide a general introduction including the use of state automata for language processing

To provide the fundamentals of syntax including a basic parse

To explain advanced feature like feature structures and realistic parsing methodologies

To explain basic concepts of remotes processing

To give details about a typical natural language processing applications UNIT I INTRODUCTION 6 + 3 Hours Introduction: Knowledge in speech and language processing – Ambiguity – Models and Algorithms – Language, Thought and Understanding. Regular Expressions and automata: Regular expressions – Finite-State automata. Morphology and Finite-State Transducers: Survey of English morphology – Finite-State Morphological parsing – Combining FST lexicon and rules – Lexicon-Free FSTs: The porter stammer – Human morphological processing. UNIT II SYNTAX 10 + 3 Hours Word classes and part-of-speech tagging: English word classes – Tag sets for English – Part-of-speech tagging – Rule-based part-of-speech tagging – Stochastic part-of-speech tagging – Transformation-based tagging – Other issues. Context-Free Grammars for English: Constituency – Context-Free rules and trees – Sentence-level constructions – The noun phrase – Coordination – Agreement – The verb phase and sub categorization – Auxiliaries – Spoken language syntax – Grammars equivalence and normal form – Finite-State and Context-Free grammars – Grammars and human processing. Parsing with Context-Free Grammars: Parsing as search – A Basic Top-Down parser – Problems with the basic Top-Down parser – The early algorithm – Finite-State parsing methods.

UNIT III ADVANCED FEATURES AND SYNTAX 11 + 3 Hours Features and Unification: Feature structures – Unification of feature structures – Features structures in the grammar – Implementing unification – Parsing with unification constraints – Types and Inheritance. Lexicalized and Probabilistic Parsing: Probabilistic context-free grammar – problems with PCFGs – Probabilistic lexicalized CFGs – Dependency Grammars – Human parsing. UNIT IV SEMANTIC 10 + 3 Hours


134

Representing Meaning: Computational desiderata for representations – Meaning structure of language – First order predicate calculus – Some linguistically relevant concepts – Related representational approaches – Alternative approaches to meaning. Semantic Analysis: Syntax-Driven semantic analysis – Attachments for a fragment of English – Integrating semantic analysis into the early parser – Idioms and compositionality – Robust semantic analysis. Lexical semantics: relational among lexemes and their senses – WordNet: A database of lexical relations – The Internal structure of words – Creativity and the lexicon. UNIT V APPLICATIONS 8 + 3 Hours Word Sense Disambiguation and Information Retrieval: Selectional restriction-based disambiguation – Robust word sense disambiguation – Information retrieval – other information retrieval tasks. Natural Language Generation: Introduction to language generation – Architecture for generation – Surface realization – Discourse planning – Other issues. Machine Translation: Language similarities and differences – The transfer metaphor – The interlingua idea: Using meaning – Direct translation – Using statistical techniques – Usability and system development.


1. Daniel Jurafsky & James H.Martin, “ Speech and Language Processing”, Pearson Education (Singapore) Pte. Ltd., 2002.

REFERENCES

1. James Allen, “Natural Language Understanding”, Pearson Education, 2003.

ADVANCED COMPUTER ARCHITECTURE – IT732D


135

AIM To do an advanced study of the Instruction Set Architecture, Instruction Level Parallelism with hardware and software approaches, Memory and I/O systems and different multiprocessor architectures with an analysis of their performance. OBJECTIVES

To study the ISA design, instruction pipelining and performance related issues.

To do a detailed study of ILP with dynamic approaches.

To do a detailed study of ILP with software approaches.

To study the different multiprocessor architectures and related issues.

To study the Memory and I/O systems and their performance issues.

UNIT I INTRODUCTION 9 + 3 Hours Fundamentals of Computer Design – Measuring and reporting performance – Quantitative principles of computer design. Instruction set principles – Classifying ISA – Design issues. Pipelining – Basic concepts – Hazards – Implementation – Multicycle operations. UNIT II INSTRUCTION LEVEL PARALLELISM WITH DYNAMIC APPROACHES

9 + 3 Hours Concepts – Dynamic Scheduling – Dynamic hardware prediction – Multiple issue – Hardware based speculation – Limitations of ILP. UNIT III INSTRUCTION LEVEL PARALLELISM WITH SOFTWARE APPROACHES

9 + 3 Hours Compiler techniques for exposing ILP – Static branch prediction – VLIW – Advanced compiler support – Hardware support for exposing more parallelism – Hardware versus software speculation mechanisms. UNIT IV MEMORY AND I/O 9 + 3 Hours Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time – Main memory and performance – Memory technology. Types of storage devices – Buses – RAID – Reliability, availability and dependability – I/O performance measures – Designing an I/O system. UNIT V MULTIPROCSSORS AND THREAD LEVEL PARALLELISM 9 + 3 Hours

Symmetric and distributed shared memory architectures – Performance issues – Synchronization – Models of memory consistency – Multithreading.

L=45; T=15; TOTAL= 60

TEXT BOOKS


136

1. John L. Hennessey and David A. Patterson," Computer Architecture: A Quantitative Approach", Third Edition, Elsevier 2011. REFERNCES 1. D. Sima, T. Fountain and P. Kacsuk, " Advanced Computer Architectures: A Design Space Approach", Pearson 2002.

2. Kai Hwang " Advanced computer architecture Parallelism Scalability Programmability" Tata Mcgraw Hill Edition 2001.

3. Vincent P.Heuring, Harry F.Jordan, “ Computer System Design and Architecture” ,


137

INFORMATION SECURITY – IT732E

AIM

To study the critical need for ensuring Information Security in Organizations OBJECTIVES

To understand the basics of Information Security

To know the legal, ethical and professional issues in Information Security

To know the aspects of risk management

To become aware of various standards in this area

To know the technological aspects of Information Security UNIT 1 INTRODUCTION 9 + 3 Hours

History, what is Information Security, Critical Characteristics of Information, NSTISSC Security Model, Components of an Information System, Securing the Components, Balancing Security and Access, The SDLC, The Security SDLC UNIT II SECURITY INVESTIGATION 9 + 3 Hours Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional Issues UNIT III SECURITY ANALYSIS 9 + 3 Hours Risk Management: Identifying and Assessing Risk, Assessing and Controlling Risk UNIT IV LOGICAL DESIGN 9 + 3 Hours Blueprint for Security, Information Security Poicy, Standards and Practices, ISO 17799/BS 7799, NIST Models, VISA International Security Model, Design of Security Architecture, Planning for Continuity. UNIT V PHYSICAL DESIGN 9 + 3 Hours Security Technology, IDS, Scanning and Analysis Tools, Cryptography, Access Control Devices, Physical Security, Security and Personnel

L=45; T=15; TOTAL= 60 TEXT BOOKS:

1. Michael E Whitman and Herbert J Mattord, “Principles of Information Security”, Cengage Learning India 2011.

1. Micki Krause, Harold F. Tipton, “Handbook of Information Security Management”, Vol 1-3 CRC Press LLC, 2004.

2. Stuart Mc Clure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw-Hill, 2003

3. Matt Bishop, “Computer Security Art and Science”, Pearson/PHI, 2002.

USER INTERFACE DESIGN – IT733A


138

AIM To implement the basics and in-depth knowledge about UID. It enables the students to take up the design the user interface, design, menu creation and windows creation and connection between menu and windows. OBJECTIVES

To study the concept of menus, windows, interfaces.

To study about business functions.

To study the characteristics and components of windows.

To study the various controls for the windows.

To study about various problems in windows design with color, text, graphics.

To study the testing methods

UNIT I 8 + 3 Hours Introduction-Importance-Human-Computer interface-characteristics of graphics interface-Direct manipulation graphical system - web user interface-popularity-characteristic & principles. UNIT II 10 + 3 Hours User interface design process- obstacles-usability-human characteristics in design - Human interaction speed-business functions-requirement analysis-Direct-Indirect methods-basic business functions-Design standards-system timings - Human consideration in screen design - structures of menus - functions of menus-contents of menu-formatting -phrasing the menu - selecting menu choice-navigating menus-graphical menus. UNIT III 9 + 3 Hours Windows: Characteristics-components-presentation styles-types-managements-organizations-operations-web systems-device-based controls: characteristics-Screen -based controls: operate control - text boxes-selection control-combination control-custom control-presentation control. UNIT IV 9 + 3 Hours Text for web pages - effective feedback-guidance & assistance-Internationalization-accesssibility-Icons-Image-Multimedia -coloring. UNIT V 9 + 3 Hours Windows layout-test :prototypes - kinds of tests - retest - Information search - visualization - Hypermedia - www - Software tools.


1. Wilbent. O. Galitz ,“The Essential Guide to User Interface Design”, John Wiley& Sons, 2002.


139

REFERENCES

1. Ben Sheiderman, “Design the User Interface”, Pearson Education, 1998.

2. Alan Cooper, “The Essential of User Interface Design”, Wiley – Dream Tech Ltd., 2002.


140

GRAPH THEORY – IT733B

AIM To provide fundamental ideas on graph theory required for the study of Computer Science. OBJECTIVES

Understand basic notions of Graph Theory

Knowing Fundamental Theorems in Graph Theory

Study of algorithmic Graph Theory UNIT I 9 + 3 Hours Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits – Connectedness – Components – Euler Graphs – Hamiltonian Paths and Circuits – Trees – Properties of trees – Distance and Centers in Tree – Rooted and Binary Trees. UNIT II 9 + 3 Hours Spanning trees – Fundamental Circuits –Spanning Trees in a Weighted Graph – Cut Sets – Properties of Cut Set – All Cut Sets – Fundamental Circuits and Cut Sets – Connectivity and Separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and Geometric Graphs – Planer Graphs – Different Representation of a Planer Graph. UNIT III 9 + 3 Hours Incidence matrix – Submatrices – Circuit Matrix – Path Matrix – Adjacency Matrix – Chromatic Number – Chromatic partitioning – Chromatic polynomial - Matching - Covering – Four Color Problem – Directed Graphs – Types of Directed Graphs – Digraphs and Binary Relations – Directed Paths and Connectedness – Euler Graphs – Adjacency Matrix of a Digraph. UNIT IV 9 + 3 Hours Algorithms: Connectedness and Components – Spanning tree – Finding all Spanning Trees of a Graph –Set of Fundamental Circuits – Cut Vertices and Separability – Directed Circuits. UNIT V 9 + 3 Hours Algorithms: Shortest Path Algorithm – DFS – Planarity Testing – Isomorphism


1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”, PHI, 2009.

REFERENCES


141

1. R.J. Wilson, “Introduction to Graph Theory”, Fourth Edition, Pearson Education, 2003.

TOTAL QUALITY MANAGEMENT – IT733C OBJECTIVE

To understand the Total Quality Management concept and principles and the various tools available to achieve Total Quality Management.

To understand the statistical approach for quality control.

To create an awareness about the ISO and QS certification process and its need for the industries.

UNIT I INTRODUCTION 9 + 3 Hours Definition of Quality, Dimensions of Quality, Quality Planning, Quality costs - Analysis Techniques for Quality Costs, Basic concepts of Total Quality Management, Historical Review, Principles of TQM, Leadership – Concepts, Role of Senior Management, Quality Council, Quality Statements, Strategic Planning, Deming Philosophy, Barriers to TQM Implementation. UNIT II TQM PRINCIPLES 9 + 3 Hours Customer satisfaction – Customer Perception of Quality, Customer Complaints, Service Quality, Customer Retention, Employee Involvement – Motivation, Empowerment, Teams, Recognition and Reward, Performance Appraisal, Benefits, Continuous Process Improvement – Juran Trilogy, PDSA Cycle, 5S, Kaizen, Supplier Partnership – Partnering, sourcing, Supplier Selection, Supplier Rating, Relationship Development, Performance Measures – Basic Concepts, Strategy, Performance Measure.

UNIT III STATISTICAL PROCESS CONTROL (SPC) 9 + 3 Hours The seven tools of quality, Statistical Fundamentals – Measures of central Tendency and Dispersion, Population and Sample, Normal Curve, Control Charts for variables and attributes, Process capability, Concept of six sigma, New seven Management tools. UNIT IV. TQM TOOLS 9 + 3 Hours Benchmarking – Reasons to Benchmark, Benchmarking Process, Quality Function Deployment (QFD) – House of Quality, QFD Process, Benefits, Taguchi Quality Loss Function, Total Productive Maintenance (TPM) – Concept, Improvement Needs, FMEA – Stages of FMEA. UNIT V QUALITY SYSTEMS 9 + 3 Hours Need for ISO 9000 and Other Quality Systems, ISO 9000:2000 Quality System – Elements, Implementation of Quality System, Documentation, Quality Auditing, TS 16949, ISO 14000 – Concept, Requirements and Benefits.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Dale H.Besterfiled, et al., Total Quality Management, Pearson Education, Inc. 2003. (Indian reprint 2004). ISBN 81-297-0260-6.


142

REFERENCES

1. James R.Evans & William M.Lidsay, The Management and Control of Quality, (5th Edition), South-Western (Thomson Learning), 2002 (ISBN 0-324-06680-5).

2. B Valarmathi, N Srinivasa Gupta. “Total Quality Management, McGraw-Hill, 2009

3. Oakland.J.S. “Total Quality Management Butterworth – Publisher: Elsevier Butterworth-Heinemann Released: 06-2004

4. Narayana V. and Sreenivasan, N.S. Quality Management – Concepts and Tasks, New Age International 1996.

5. Zeiri. “Total Quality Management for Engineers Wood Head Publishers, 1991.


143

OBJECT ORIENTED ANALYSIS AND DESIGN IT733D

AIM To understand the concepts of object oriented analysis and design. OBJECTIVES

To understand the object oriented life cycle.

To know how to identify objects, relationships, services and attributes through UML.

To understand the use-case diagrams.

To know the Object Oriented Design process.

To know about software quality and usability.

UNIT I INTRODUCTION 8 + 3 Hours An Overview of Object Oriented Systems Development - Object Basics – Object Oriented Systems Development Life Cycle. UNIT II OBJECT ORIENTED METHODOLOGIES 12 + 3 Hours Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks – Unified Approach – Unified Modeling Language – Use case - class diagram - Interactive Diagram - Package Diagram - Collaboration Diagram - State Diagram - Activity Diagram. UNIT III OBJECT ORIENTED ANALYSIS 9 + 3 Hours Identifying use cases - Object Analysis - Classification – Identifying Object relationships - Attributes and Methods. UNIT IV OBJECT ORIENTED DESIGN 8 + 3 Hours Design axioms - Designing Classes – Access Layer - Object Storage - Object Interoperability. UNIT V SOFTWARE QUALITY AND USABILITY 8 + 3 Hours Designing Interface Objects – Software Quality Assurance – System Usability - Measuring User Satisfaction

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 2008 (Unit I, III, IV, V).

2. Martin Fowler, “UML Distilled”, Second Edition, PHI/Pearson Education, 2002. (UNIT II) REFERENCES


144

1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw-Hill, 2003.

2. James Rumbaugh, Ivar Jacobson, Grady Booch “The Unified Modeling Language Reference Manual”, Pearson, 2005.

3. Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, “UML Toolkit”, OMG Press Wiley Publishing Inc., 2004.


145

PARALLEL COMPUTING - IT831A AIM To study the scalability & clustering issues, understand the technologies used for parallel computation, study the different inter connection networks and the different software programming models. OBJECTIVES

To study the scalability and clustering issues and the technology necessary for them.

To understand the technologies enabling parallel computing.

To study the different types of interconnection networks.

To study the different parallel programming models.

To study the software support needed for shared memory programming. UNIT I SCALABILITY AND CLUSTERING 9 + 3 Hours 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 + 3 Hours 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 + 3 Hours Basics of Interconnection Networks – Network Topologies and Properties – Buses, Crossbar and Multistage Switches, Software Multithreading – Synchronization Mechanisms. UNIT IV PARALLEL PROGRAMMING 9 + 3 Hours Paradigms And Programmability – Parallel Programming Models – Shared Memory Programming. UNIT V MESSAGE PASSING PROGRAMMING 9 + 3 Hours Message Passing Paradigm – Message Passing Interface – Parallel Virtual Machine.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw-Hill, New Delhi, 2003.

REFERENCES


146

1. David E. Culler & Jaswinder Pal Singh, “Parallel Computing Architecture: A Hardware/Software Approach”, Morgan Kaufman Publishers, 1999.

2. Michael J. Quinn, “Parallel Programming in C with MPI & OpenMP”, Tata McGraw-Hill, New Delhi, 2003.

3. Kai Hwang, “Advanced Computer Architecture” Tata McGraw-Hill, New Delhi, 2003.


147

HIGH SPEED NETWORKS – IT831B AIM To highlight the features of different technologies involved in High Speed Networking and their performance. OBJECTIVES

Students will get an introduction about ATM and Frame relay.

Students will be provided with an up-to-date survey of developments in High Speed Networks.

Enable the students to know techniques involved to support real-time traffic and congestion control.

Students will be provided with different levels of quality of service (Q.S) to different applications.

UNIT I HIGH SPEED NETWORKS 8 + 3 Hours Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture, ATM logical Connection, ATM Cell – ATM Service Categories – AAL. High Speed LAN‟s: Fast Ethernet, Gigabit Ethernet, Fibre Channel – Wireless LAN‟s: applications, requirements – Architecture of 802.11 UNIT II CONGESTION AND TRAFFIC MANAGEMENT 8 + 3 Hours Queuing Analysis- Queuing Models – Single Server Queues – Effects of Congestion – Congestion Control – Traffic Management – Congestion Control in Packet Switching Networks – Frame Relay Congestion Control. UNIT III TCP AND ATM CONGESTION CONTROL 12 + 3 Hours TCP Flow control – TCP Congestion Control – Retransmission – Timer Management – Exponential RTO backoff – KARN‟s Algorithm – Window management – Performance of TCP over ATM. Traffic and Congestion control in ATM – Requirements – Attributes – Traffic Management Frame work, Traffic Control – ABR traffic Management – ABR rate control, RM cell formats, ABR Capacity allocations – GFR traffic management. UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 8 + 3 Hours Integrated Services Architecture – Approach, Components, Services- Queuing Discipline, FQ, PS, BRFQ, GPS, WFQ – Random Early Detection, Differentiated Services UNIT V PROTOCOLS FOR QOS SUPPORT 8 + 3 Hours RSVP – Goals & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms – Multiprotocol Label Switching – Operations, Label Stacking, Protocol details – RTP – Protocol Architecture, Data Transfer Protocol, RTCP.

L=45; T=15; TOTAL= 60

TEXT BOOKS


148

1. William Stallings, “HIGH SPEED NETWORKS AND INTERNET”, Pearson Education, Second Edition, 2002. [Chapter – 4-6, 8, 10, 12, 13, 17,18]

REFERENCES

1. Warland & Pravin Varaiya, “HIGH PERFORMANCE COMMUNICATION NETWORKS”, Jean Harcourt Asia Pvt. Ltd., II Edition, 2001.

2. Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “MPLS and VPN architecture”, Cisco Press, Volume 1 and 2, 2003


149

QUANTUM COMPUTING – IT831C AIM To understand the fundamental principles of quantum computing. OBJECTIVES

To understand the building blocks of a quantum computer. To understand the principles, quantum information and limitation of quantum

operations formalizing. To understand the quantum error and its correction.

UNIT I FUNDAMENTAL CONCEPTS 9 + 3 Hours Global Perspectives, Quantum Bits, Quantum Computation, Quantum Algorithms, Quantum Information, Postulates of Quantum Mechanisms. UNIT II QUANTUM COMPUTATION 9 + 3 Hours Quantum Circuits – Quantum algorithms, Single Orbit operations, Control Operations, Measurement, Universal Quantum Gates, Simulation of Quantum Systems, Quantum Fourier transform, Phase estimation, Applications, Quantum search algorithms – Quantum counting – Speeding up the solution of NP – complete problems – Quantum Search for an unstructured database. UNIT III QUANTUM COMPUTERS 9 + 3 Hours Guiding Principles, Conditions for Quantum Computation, Harmonic Oscillator Quantum Computer, Optical Photon Quantum Computer – Optical cavity Quantum electrodynamics, Ion traps, Nuclear Magnetic resonance. UNIT IV QUANTUM INFORMATIONS 9 + 3 Hours Quantum noise and Quantum Operations – Classical Noise and Markov Processes, Quantum Operations, Examples of Quantum noise and Quantum Operations – Applications of Quantum operations, Limitations of the Quantum operations formalism, Distance Measures for Quantum information. UNIT V QUANTUM ERROR CORRECTION 9 + 3 Hours Introduction, Shor code, Theory of Quantum Error –Correction, Constructing Quantum Codes, Stabilizer codes, Fault – Tolerant Quantum Computation, Entropy and information – Shannon Entropy, Basic properties of Entropy, Von Neumann, Strong Sub Additivity, Data Compression, Entanglement as a physical resource.


1. Micheal A. Nielsen. & Issac L. Chiang, “Quantum Computation and Quantum Information”, Cambridge University Press 2007


150

GRID COMPUTING – IT831D

AIM To understand the technology application and tool kits for grid computing OBJECTIVES

To understand the genesis of grid computing To know the application of grid computing To understanding the technology and tool kits to facilitated the grid computing

· UNIT I GRID COMPUTING 9 + 3 Hours Introduction - Definition and Scope of grid computing UNIT II GRID COMPUTING INITIALIVES 9 + 3 Hours Grid Computing Organizations and their roles – Grid Computing analog – Grid Computing road map. UNIT III GRID COMPUTING APPLICATIONS 9 + 3 Hours Merging the Grid sources – Architecture with the Web Devices Architecture. UNIT IV TECHNOLOGIES 9 + 3 Hours OGSA – Sample use cases – OGSA platform components – OGSI – OGSA Basic Services. UNIT V GRID COMPUTING TOOL KITS 9 + 3 Hours Globus GT 3 Toolkit – Architecture, Programming model, High level services – OGSI .Net middleware Solutions.


1. Joshy Joseph & Craig Fellenstein, “Grid Computing”, Pearson/PHI PTR-2004.

REFERENCES

1. Ahmar Abbas, “Grid Computing: A Practical Guide to technology and Applications”, Laxmi Publications 2006.


151

MOBILE COMPUTING – IT831E

AIM To provide basics for various techniques in Mobile Communications and Mobile Content services. OBJECTIVES

To learn the basics of Wireless voice and data communications technologies.

To build working knowledge on various telephone and satellite networks.

To study the working principles of wireless LAN and its standards.

To build knowledge on various Mobile Computing algorithms.

To build skills in working with Wireless application Protocols to develop mobile

content applications. UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9 + 3 Hours Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks. UNIT II TELECOMMUNICATION NETWORKS 11 + 3 Hours Telecommunication systems – GSM – GPRS – DECT – UMTS – IMT-2000 – Satellite Networks - Basics – Parameters and Configurations – Capacity Allocation – FAMA and DAMA – Broadcast Systems – DAB - DVB. UNIT III WIRLESS LAN 9 + 3 Hours Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE 802.11a - 802.11b standards – HIPERLAN – Blue Tooth. UNIT IV MOBILE NETWORK LAYER 9 + 3 Hours Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR – Alternative Metrics. UNIT V TRANSPORT AND APPLICATION LAYERS 7 + 3 Hours Traditional TCP – Classical TCP improvements – WAP, WAP 2.0.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second Edition, 2003. (Unit I Chap 1,2 &3- Unit II chap 4,5 &6-Unit III Chap 7.Unit IV Chap 8-Unit V Chap 9&10.)

2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2009. (Unit I Chapter – 7&10-Unit II Chap 9)

REFERENCES


152

1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson Education, 2003.

2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile Computing”, Springer, New York, 2003.

3. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons Ltd, 2002.


153

SOFT COMPUTING – IT832A AIM To introduce the techniques of soft computing and adaptive neuro-fuzzy inferencing systems which differ from conventional AI and computing in terms of its tolerance to imprecision and uncertainty. OBJECTIVES

To introduce the ideas of fuzzy sets, fuzzy logic and use of heuristics based on human experience

To become familiar with neural networks that can learn from available examples and generalize to form appropriate rules for inferencing systems

To provide the mathematical background for carrying out the optimization associated with neural network learning

To familiarize with genetic algorithms and other random search procedures useful while seeking global optimum in self-learning situations

To introduce case studies utilizing the above and illustrate the intelligent behavior of programs based on soft computing

UNIT I FUZZY SET THEORY 10 + 3 Hours Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets – Basic Definition and Terminology – Set-theoretic Operations – Member Function Formulation and Parameterization – Fuzzy Rules and Fuzzy Reasoning – Extension Principle and Fuzzy Relations – Fuzzy If-Then Rules – Fuzzy Reasoning – Fuzzy Inference Systems – Mamdani Fuzzy Models – Sugeno Fuzzy Models – Tsukamoto Fuzzy Models – Input Space Partitioning and Fuzzy Modeling.

UNIT II OPTIMIZATION 8 + 3 Hours Derivative-based Optimization – Descent Methods – The Method of Steepest Descent – Classical Newton‟s Method – Step Size Determination – Derivative-free Optimization – Genetic Algorithms – Simulated Annealing – Random Search – Downhill Simplex Search. UNIT III NEURAL NETWORKS 10 + 3 Hours Supervised Learning Neural Networks – Perceptrons - Adaline – Backpropagation Mutilayer Perceptrons – Radial Basis Function Networks – Unsupervised Learning Neural Networks – Competitive Learning Networks – Kohonen Self-Organizing Networks – Learning Vector Quantization – Hebbian Learning. UNIT IV NEURO FUZZY MODELING 9 + 3 Hours

Adaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm – Learning Methods that Cross-fertilize ANFIS and RBFN – Coactive Neuro Fuzzy Modeling – Framework Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum. UNIT V APPLICATIONS OF COMPUTATIONAL INTELLIGENCE 8 + 3 Hours


154

Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency Prediction – Soft Computing for Color Recipe Prediction.


1. J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI, 2004, Pearson Education 2004.

REFERENCES

1. Timothy J.Ross,”Fuzzy Logic with Engineering Application “, Wiley 2011.

2. Davis E.Goldberg,”Genetic Algorithms:Search, Optimization and Machine Learning” Pearson 2002.

3. S.Rajasekaran and G.A.V.Pai,”Neural Networks, Fuzzy Logic and Genetic Algorithms”,PHI, 2003.

4. R.Eberhart, P.simpson and R.Dobbins,”Computional Intelligence” PC Tools”,AP Professional,Boston 1996.


155

COMPONENT BASED TECHNOLOGY - IT832B

AIM To introduce different software components and their application. OBJECTIVES

Introduces in depth JAVA, Corba and .Net Components Deals with Fundamental properties of components, technology and architecture and

middleware. Component Frameworks and Development are covered in-depth.


Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks – directory services – component architecture – components and middleware UNIT II JAVA BASED COMPONENT TECHNOLOGIES 9 + 3 Hours Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP UNIT III CORBA COMPONENT TECHNOLOGIES 9 + 3 Hours Java and CORBA – Interface Definition language – Object Request Broker – system object model – portable object adapter – CORBA services – CORBA component model – containers – application server – model driven architecture UNIT IV NET BASED COMPONENT TECHNOLOGIES 9 + 3 Hours COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces – connectable objects – OLE containers and servers – Active X controls – .NET components - assemblies – appdomains – contexts – reflection – remoting UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT 9 + 3 Hours Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component framework – directory objects – cross-development environment – component-oriented programming – Component design and implementation tools – testing tools - assembly tools


1. Clemens Szyperski, “Component Software: Beyond Object-Oriented Programming”, Pearson Education publishers, 2003


156

REFERENCES

1. Ed Roman, “Enterprise Java Beans”,3rd Edition, Wiley, 2004. 2. Andreas Vogel, Keith Duddy, “Java Programming with CORBA”, John Wiley & Sons

2009 3. Corry, Mayfield, Cadman, “COM/DCOM Primer Plus”, Bpb Publicatons 2008.


157

SOFTWARE QUALITY MANAGEMENT – IT832C

AIM To introduce an integrated approach to software development incorporating quality management methodologies. OBJECTIVES

Software quality models Quality measurement and metrics Quality plan, implementation and documentation Quality tools including CASE tools Quality control and reliability of quality process Quality management system models Complexity metrics and Customer Satisfaction International quality standards – ISO, CMM

UNIT I INTRODUCTION TO SOFTWARE QUALITY 9 + 3 Hours Software Quality – Hierarchical models of Boehm and McCall – Quality measurement – Metrics measurement and analysis – Gilb‟s approach – GQM Model UNIT II SOFTWARE QUALITY ASSURANCE 9 + 3 Hours Quality tasks – SQA plan – Teams – Characteristics – Implementation – Documentation – Reviews and Audits UNIT III QUALITY CONTROL AND RELIABILITY 9 + 3 Hours Tools for Quality – Ishikawa‟s basic tools – CASE tools – Defect prevention and removal – Reliability models – Rayleigh model – Reliability growth models for quality assessment UNIT IV QUALITY MANAGEMENT SYSTEM 9 + 3 Hours Elements of QMS – Rayleigh model framework – Reliability Growth models for QMS – Complexity metrics and models – Customer satisfaction analysis. UNIT V QUALITY STANDARDS 9 + 3 Hours Need for standards – ISO 9000 Series – ISO 9000-3 for software development – CMM and CMMI – Six Sigma concepts.


1. Allan C. Gillies, “Software Quality: Theory and Management”, Thomson Learning, 2003. (UI : Ch 1-4 ; UV : Ch 7-8)

2. Stephen H. Kan, “Metrics and Models in Software Quality Engineering”, Pearson Education (Singapore) Pte Ltd., 2002. (UI : Ch 3-4; UIII : Ch 5-8 ; UIV : Ch 9-11)


158

REFERENCES 1. Norman E. Fenton and Shari Lawrence Pfleeger, “Software Metrics” Thomson, 2003 2. Mordechai Ben – Menachem and Garry S.Marliss, “Software Quality”, Thomson Asia

Pte Ltd, 2003.

3. Mary Beth Chrissis, Mike Konrad and Sandy Shrum, “CMMI”, Pearson Education (Singapore) Pte Ltd, 2003.

4. ISO 9000-3 “Notes for the application of the ISO 9001 Standard to software development”.


159

ADVANCED JAVA PROGRAMMING – IT832D

AIM To enable the students to design and develop enterprise strength distributed and multi-tier applications – Using Java Technology. OBJECTIVES

To learn advanced Java programming concepts like reflection, native code interface, threads, etc.

To develop network programs in Java

To understand Concepts needed for distributed and multi-tier applications

To understand issues in enterprise applications development.

UNIT I JAVA FUNDAMENTALS 9 + 3 Hours Java I/O streaming – filter and pipe streams – Byte Code interpretation - reflection – Dynamic Reflexive Classes – Threading – Java Native Interfaces- Swing. UNIT II NETWORK PROGRAMMING IN JAVA 9 + 3 Hours Sockets – secure sockets – custom sockets – UDP datagrams – multicast sockets – URL classes – Reading Data from the server – writing data – configuring the connection – Reading the header – telnet application – Java Messaging services UNIT III APPLICATIONS IN DISTRIBUTED ENVIRONMENT 9 + 3 Hours Remote method Invocation – activation models – RMI custom sockets – Object Serialization – RMI – IIOP implementation – CORBA – IDL technology – Naming Services – CORBA programming Models - JAR file creation UNIT IV MULTI-TIER APPLICATION DEVELOPMENT 9 + 3 Hours Server side programming – servlets – Java Server Pages - Applet to Applet communication – applet to Servlet communication - JDBC – Using BLOB and CLOB objects – storing Multimedia data into databases – Multimedia streaming applications – Java Media Framework. UNIT V ENTERPRISE APPLICATIONS 9 + 3 Hours Server Side Component Architecture – Introduction to J2EE – Session Beans – Entity Beans – Persistent Entity Beans – Transactions.

L=45; T=15; TOTAL= 60

TEXT BOOKS


160

1. Elliotte Rusty Harold, “ Java Network Programming”, O‟Reilly publishers, 2004 (UNIT II)

2. Ed Roman, “Mastering Enterprise Java Beans”, John Wiley & Sons Inc., 2006. (UNIT III and UNIT V)

3. Hortsmann & Cornell, “CORE JAVA 2 ADVANCED FEATURES, VOL II”, Pearson Education, 2008. (UNIT I and UNIT IV)

REFERENCES

1. Web reference: http://java.sun.com. 2. Patrick Naughton, “COMPLETE REFERENCE: JAVA2”, Tata McGraw-Hill, 2003.


161

KNOWLEDGE BASED DECISION SUPPORT SYSTEM – IT833A

AIM There has been a radical shift in the management parlance. Organizations can use Intranets and Internets to analyze various aspects about the performance and predict the future. This course aims at exposing the student to one of the important applications of the computer. OBJECTIVES The course has been so designed as to include.

Development of support system Methods of managing knowledge Intelligent decision system development


Decision making, Systems, Modeling, and support – Introduction and Definition – Systems – Models – Modeling process – Decision making: The intelligence phase – The design phase - The choice phase – Evaluation: The implementation phase –Alternative Decision – Making models – Decision support systems – Decision makers - Case applications. UNIT II DECISION SUPPORT SYSTEM DEVELOPMENT 9 + 3 Hours

Decision Support System Development: Introduction - Life cycle – Methodologies – prototype – Technology Levels and Tools – Development platforms – Tool selection – Developing DSS Enterprise systems: Concepts and Definition – Evolution of information systems – Information needs – Characteristics and capabilities – Comparing and Integrating EIS and DSS – EIS data access, Data Warehouse, OLAP, Multidimensional analysis, Presentation and the web – Including soft information enterprise on systems - Organizational DSS – supply and value chains and decision support – supply chain problems and solutions – computerized systems MRP, ERP, SCM – frontline decision support systems. UNIT III KNOWLEDGE MANAGEMENT 9 + 3 Hours

Introduction – Organizational learning and memory – Knowledge management –Development –methods, Technologies, and Tools – success –Knowledge management and Artificial intelligence – Electronic document management. Knowledge acquisition and validation: Knowledge engineering – Scope – Acquisition methods - Interviews – Tracking methods – Observation and other methods – Grid analysis – Machine Learning: Rule induction, case-based reasoning – Neural computing – Intelligent agents – Selection of an appropriate knowledge acquisition methods – Multiple experts – Validation and verification of the knowledge base – Analysis, coding, documenting, and diagramming – Numeric and documented knowledge acquisition – Knowledge acquisition and the Internet/Intranets.


162

Knowledge representation: Introduction – Representation in logic and other schemas – Semantic networks – Production rules – Frames – Multiple knowledge representation – Experimental knowledge representations - Representing uncertainty. UNIT IV INTELLIGENT SYSTEM DEVELOPMENT 9 + 3 Hours

Inference Techniques: Reasoning in artificial intelligence – Inference with rules: The Inference tree – Inference with frames – Model-based and case-based reasoning - Explanation and Meta knowledge – Inference with uncertainty – Representing uncertainty – Probabilities and related approaches – Theory of certainty – Approximate reasoning using fuzzy logic. Intelligent Systems Development: Prototyping: Project Initialization – System analysis and design – Software classification: Building expert systems with tools – Shells and environments – Software selection – Hardware –Rapid prototyping and a demonstration prototype - System development –Implementation – Post implementation. UNIT V MANAGEMENT SUPPORT SYSTEMS 9 + 3 Hours Implementing and integrating management support systems – Implementation: The major issues - Strategies – System integration – Generic models MSS, DSS, ES – Integrating EIS, DSS and ES, and global integration – Intelligent DSS – Intelligent modeling and model management – Examples of integrated systems – Problems and issues in integration. Impacts of Management Support Systems – Introduction – overview – Organizational structure and related areas – MSS support to business process reengineering – Personnel management issues – Impact on individuals – Productivity, quality, and competitiveness – decision making and the manager manager‟s job – Issues of legality, privacy, and ethics – Intelligent systems and employment levels – Internet communication – other societal impacts – managerial implications and social responsibilities.


1. Efrain Turban, Jay E.Aronson, “Decision Support Systems and Intelligent Systems” 6th Edition, Pearson Education, 2001.

REFERENCES

1. Ganesh Natarajan, Sandhya Shekhar, “Knowledge management – Enabling Business Growth”, Tata McGraw-Hill, 2002.

2. George M.Marakas, “Decision Support System”, Prentice Hall, India, 2003.

3. Efrem A.Mallach, “Decision Support and Data Warehouse Systems”, Tata McGraw-Hill, 2002.

ROBOTICS – IT833B


163

AIM Robots are slowly and steadily replacing human beings in many fields. The aim of this course is to introduce the students into this area so that they could use the same when they enter the industries. OBJECTIVES The course has been so designed to give the students an overall view of the mechanical components:

The mathematics associated with the same.

Actuators and sensors necessary for the functioning of the robot. UNIT I ROBOTIC MANIPULATION 8 + 3 Hours Robotic manipulation – Automation and Robots – Robot Classification – Applications – Robot Specifications – Notation. Direct Kinematics: The ARM Equation – Dot and Cross products – Coordinate frames – Rotations – Homogeneous coordinates – Link coordinates – The arm equation – A five-axis articulated robot (Rhino XR-3) – A four-axis SCARA Robot (Adept One) – A six-axis articulated Robot (Intelledex 660). Inverse Kinematics: Solving the arm equation – The inverse kinematics problem – General properties of solutions – Tool configuration – Inverse kinematics of a five-axis articulated robot (Rhino XR-3) – Inverse kinematics of a four-axis SCARA robot (Adept one) - Inverse kinematics of a six-axis articulated robot (Intelledex 660) - Inverse kinematics of a three-axis articulated robot – A robotic work cell. UNIT II DYNAMIC OF ROBOTS 12 + 3 Hours Workspace analysis and trajectory planning: Workspace analysis – Work envelop of a five-axis articulated robot – Work envelope of a four-axis SCARA robot – Workspace fixtures – The pick-and-place operation – Continuous-path motion – Interpolated motion – Straight-line motion. Differential motion and statics: The tool-configuration Jacobian matrix – Joint-space singularities – Generalized Inverses – Resolved-Motion rate control:n<=6 – Rate control of redundant robots:n>6 – rate control using {1}-inverses – The manipulator Jacobian – Induced joint torques and forces. Manipulator Dynamics: Lagrange‟s equation – Kinetic and Potential energy – Generalized force – Lagrange -Euler dynamic model – Dynamic model of a two-axis planar articulated robot - Dynamic model of a three-axis SCARA robot – Direct and Inverse dynamics – Recursive Newton-Euler formulation – Dyamic model of a one-axis robot. UNIT III ROBOT CONTROL 6 + 3 Hours Robot control: The control problem – State equation – Constant solutions – Linear feedback systems - Single-axis PID control – PD-Gravity control – Computed-Torque control – Variable-Structure control – Impedance control UNIT IV SENSORS AND ACTUATORS 9 + 3 Hours


164

Actuators - Introduction – Characteristics of actuating systems – Comparison of actuating systems – Hydraulic devices – Pneumatic devices – Electric motors – Microprocessor control of electric motors – Magnetostricitve actuators – Shape-memory type metals – Speed reduction. Sensors – Introduction – Sensor characteristics – Position sensors – Velocity sensors – Acceleration sensors – Force and pressure sensors – Torque sensors – Microswitches – Light and Infrared sensors – Touch and Tactile sensors – Proximity sensors – Range-finders – Sniff sensors – Vision systems – Voice Recognition devices – Voice synthesizers – Remote center compliance device. UNIT V VISION AND TASK PLANNING 9 + 3 Hours Robot vision – Image representation – Template matching – Polyhedral objects – Shape analysis – Segmentation – Iterative processing – Perspective Transformations – Structured illumination –Camera calibration. Task planning: Task-level programming – Uncertainty – Configuration space – Gross-Motion planning – Grasp planning – Fine- Motion planning – Simulation of planar motion – A task-planning problem.

L=45; T=15; TOTAL= 60 TEXT BOOKS 1. Robert J.Schilling, “Fundamentals of Robotics – Analysis & Control”, Prentice Hall of

India Pvt. Ltd., 2002. (Chapters 1 to 9 – Unit I, II, III, V) 2. Saeed B.Niku, “Introduction to Robotics – Analysis, Systems, Applications”, Prentice

Hall of India Pvt. Ltd., 2003. (Chapters 6 & 7 – Unit IV)


165

PROFESSIONAL ETHICS AND HUMAN VALUES – IT833C

OBJECTIVE

To create an awareness on Engineering Ethics and Human Values. To instill Moral and Social Values and Loyalty To appreciate the rights of Others

UNIT I HUMAN VALUES 10 + 3 Hours Morals, Values and Ethics – Integrity – Work Ethic – Service Learning – Civic Virtue – Respect for Others – Living Peacefully – caring – Sharing – Honesty – Courage – Valuing Time – Co-operation – Commitment – Empathy – Self-Confidence – Character – Spirituality UNIT II ENGINEERING ETHICS 9 + 3 Hours Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories. UNIT III ENGINEERING AS SOCIAL EXPERIMENTATION 9 + 3 Hours Engineering as experimentation - engineers as responsible experimenters - codes of ethics - a balanced outlook on law - the challenger case study UNIT IV SAFETY, RESPONSIBILITIES AND RIGHTS 9 + 3 Hours Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk - the Three Mile Island and Chernobyl case studies. Collegiality and loyalty - respect for authority - collective bargaining - confidentiality - conflicts of interest - occupational crime - professional rights - employee rights - Intellectual Property Rights (IPR) - discrimination. UNIT V GLOBAL ISSUES 8 + 3 Hours Multinational corporations - Environmental ethics - computer ethics - weapons development - engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral leadership-sample code of Ethics like ASME, ASCE, IEEE, Institution of Engineers (India), Indian Institute of Materials Management, Institution of electronics and telecommunication engineers (IETE),India, etc.


1. Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw-Hill, New York 1996.

2. Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi, 2004.

REFERENCES

1. Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall, New Jersey, 2004 (Indian Reprint)


166

2. Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now available)

3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003.

4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, Oxford, 2001.


167

DIGITAL IMAGE PROCESSING – IT833D AIM To introduce the student to various image processing techniques. OBJECTIVES

To study the image fundamentals and mathematical transforms necessary for image processing.

To study the image enhancement techniques

To study image restoration procedures.

To study the image compression procedures.

To study the image segmentation and representation techniques. UNIT I: DIGITAL IMAGE FUNDAMENTALS AND TRANSFORMS 9 + 3 Hours Elements of visual perception – Image sampling and quantization Basic relationship between pixels – Basic geometric transformations-Introduction to Fourier Transform and DFT – Properties of 2D Fourier Transform – FFT – Separable Image Transforms -Walsh – Hadamard – Discrete Cosine Transform, Haar, Slant – Karhunen – Loeve transforms. UNIT II : IMAGE ENHANCEMENT TECHNIQUES 9 + 3 Hours Spatial Domain methods: Basic grey level transformation – Histogram equalization – Image subtraction – Image averaging –Spatial filtering: Smoothing, sharpening filters – Laplacian filters – Frequency domain filters: Smoothing – Sharpening filters – Homomorphic filtering.

UNIT III IMAGE RESTORATION 9 + 3 Hours Model of Image Degradation/restoration process – Noise models – Inverse filtering -Least mean square filtering – Constrained least mean square filtering – Blind image restoration – Pseudo inverse – Singular value decomposition. UNIT IV IMAGE COMPRESSION 9 + 3 Hours Lossless compression: Variable length coding – LZW coding – Bit plane coding- predictive coding-DPCM. Lossy Compression: Transform coding – Wavelet coding – Basics of Image compression standards: JPEG, MPEG,Basics of Vector quantization. UNIT V IMAGE SEGMENTATION AND REPRESENTATION 9 + 3 Hours Edge detection –Thresholding - Region Based segmentation – Boundary representation: chair codes- Polygonal approximation –Boundary segments –boundary descriptors: Simple descriptors-Fourier descriptors - Regional descriptors –Simple descriptors- Texture


1. Rafael C Gonzalez, Richard E Woods 2nd Edition, Digital Image Processing - Pearson Education 2003.


168

REFERENCES

1. William K Pratt, Digital Image Processing John Willey (2001)

2. Image Processing Analysis and Machine Vision – Millman Sonka, Vaclav hlavac, Roger Boyle, Broos/colic, Thompson Learniy (1999).

3. A.K. Jain, PHI, New Delhi (1995)-Fundamentals of Digital Image Processing.

4. Chanda Dutta Magundar – Digital Image Processing and Applications, Prentice Hall of India, 2000.

COURSE STRUCTURE OF I YEAR BTECH I SEMESTER … · 5 IT735 Artificial Intelligence 100 4 S.No...

Documents

Transcript of COURSE STRUCTURE OF I YEAR BTECH I SEMESTER … · 5 IT735 Artificial Intelligence 100 4 S.No...