noida international university programme structure

Noida International University Programme Structure (2017-2021)

B.Tech (CSE)

1

NOIDA INTERNATIONAL UNIVERSITY

PROGRAMME STRUCTURE BACHELOR OF TECHNOLOGY (CSE)

FIRST SEMESTER

S.No Course

Code

Course Period Evaluation Scheme Total

Credit

s Sessional Exam External

Exam

Subject

Total

L T P CA TA Total

1 ASH 101 Mathematics-1 3 1 0 20 20 40 60 100 4

2 ASH102/

ASH 103

Engineering

Physics/

Engineering

Chemistry

3 1 0 20 20 40 60 100 4

3 ASH 104 Industrial

Communication I 3 0 0 20 20 40 60 100 2

4 EEL105 /

EME 106

Basic Electrical

Engineering/

Mechanical

Engineering

3 1 0 20 20 40 60 100 4

5 ECS 107

/EEC108

Fundamentals of

Computer &

Programming/

Basic Electronics

Engineering

3 1 0 20 20 40 60 100 4

6 EBT 109 Environmental

Studies 1 0 0 20 20 40 60 100 2

7 ECS 110 Cyber Law 2 0 0 20 20 40 60 100 2

PRACTICALS

1 ASH122/

ASH 123 Physics/Chemistry 0 0 2 - - 40 60 100 1

2 EEL125/

EME126

Basic Electrical

Engineering /

Mechanical

Engineering

0 0 2 - - 40 60 100 1

3 ECP127 /

EEC128

Fundamentals of

Computer &

Programming / Basic

Electronics

Engineering

0 0 2 - - 40 60 100 1

4 EWS110

/EED111

Workshop Practice /

Engineering Drawing 0 0 2 - - 40 60 100 1

Total 1100 26


B.Tech (CSE)

2

SECOND SEMESTER

S.No Course

Code


Credits

Sessional Exam External

Exam

Subject

Total

L T P CA TA Total

1 ASH 201 Mathematics-II 3 1 0 20 20 40 60 100 4

2 ASH202/

ASH 203

Engg,Physics/

Engg.Chemistry 3 1 0 20 20 40 60 100 4

3 ECS 207

/EEC208

Fundamental of

Computers &

Programming /

Fundamentals of

Electronics

Engineering

2 0 0 20 20 40 60 100 4


Communication -II 3 0 0 20 20 40 60 100 2

5 EEL205/

EME206

Basic Electrical

Engineering/ Basic

Mechanical

Engineering

3 1 0 20 20 40 60 100 4

6 EBT 209 Environmental

Studies 1 0 0 20 20 40 60 100 2

7 ECS 210 Cyber Law 2 0 0 20 20 40 60 100 2

PRACTICALS

1 ASH222/

ASH 223

Physics/

Chemistry 0 0 2 - - 40 60 100 1

2 EEL225/

EME 226

Basic Electrical

Engineering /

Mechanical

Engineering

0 0 2 - - 40 60 100 1

3 ECP227 /

EEC 228

Fundamentals of

Computer &

Programming /

Basic Electronics

Engineering

0 0 2 - - 40 60 100 1

4

EWS 210

/

EED211

Workshop Practice

/ Engineering

Drawing

0 0 2 - - 40 60 100 1

Total 1100 26


B.Tech (CSE)

3

THIRD SEMESTER

S.No Course

Code


Credits


Exam

Subject

Total

L T P CA TA Total

1 ECS 301 Discrete Structures

3 1 0 20 20 40 60 100 4

2 ECS 302 Operating Systems

3 1 0 20 20 40 60 100 4

3 ECS 303 Data Structures 3 0 0 20 20 40 60 100 4

4 ECS 304

Digital Electronics

& Design Aspects 3 1 0 20 20 40 60 100 4

5 ECS 305

Object Oriented

Programming 3 1 0 20 20 40 60 100 4

6 ECS 306

Engineering

Economics 2 0 0 20 20 40 60 100 2

7 ASH-304

Industrial

Communication III 3 0 0 20 20 40 60 100 2

PRACTICALS

1 ECS 323 Data Structures Lab

0 0 2 - - 40 60 100 1

2 ECS 324

Digital Electronics

& Design Aspects

Lab

0 0 2 - - 40 60 100 1

3 ECS 325

Object Oriented

Programming Lab 0 0 2 - - 40 60 100 1

Total 1250 32


B.Tech (CSE)

4

FOURTH SEMESTER

S. No Course

Code


Credits


Exams

Subject

Total

L T P CA TA Total

1 ECS 401 Theory of

Automata &

computation

3 1 - 20 20 40 60 100 4

2 ECS 402 Database

management

systems

3 1 - 20 20 40 60 100 4

3 ECS 403

Computer Based

Numerical &

Statistical

Techniques

4 - - 20 20 40 60 100 4

4 ECS 404 Communication

Systems 3 - - 20 20 40 60 100 3

5 ECS 405 Computer

Graphics 4 - - 20 20 40 60 100 3


Communication

IV

2 - - 20 20 40 60 100 2

7 CBCS

3 - - 20 20 40 60 100 3

PRACTICALS

1 ECS-422 Database

management

system lab

- - 2 - - 40 60 100 1

2 ECS-423

Computer Based

Numerical &

Statistical

Techniques Lab

- - 2 - - 40 60 100 1

3 ECS-424 Communication

Systems lab - - 2 - - 40 60 100 1

4 ECS-425 Computer

Graphics Lab - - 2 - - 40 60 100 1

Total 1250 29


B.Tech (CSE)

5

FIFTH SEMESTER

SIXTH SEMESTER

S.No Course

Code


Credits


Exam

Subject

Total

L T P CA TA Total

1 ECS 501 Computer Networks 3 1 0 20 20 40 60 100 4

2 ECS 502

Analysis and

Design of

Algorithms

3 1 0 20 20 40 60 100 4

3 ECS 503

Computer

Architecture and

Organization

3 1 0 20 20 40 60 100 4

4 ECS 504 Software

Engineering 3 1 0 20 20 40 60 100 4

5 ASH504 Industrial

Communication -V 2 0 0 20 20 40 60 100 2

6 CBCS

3 - - 20 20 40 60 100 3

PRACTICALS

1 ECS 521 Computer Networks

Lab

0 0 2 - - 40 60 100 1

2 ECS 522 Analysis and

Design of Algorithm

Lab

0 0 2 - - 40 60 100 1

3 ECS 524 Software

Engineering Lab 0 0 2 - - 40 60 100 1

Total 1050 26


B.Tech (CSE)

6

S.No Course

Code


Credits


Exam

Subject

Total

L T P CA TA Total

1 ECS 601 Compiler

Construction 3 1 0 20 20 40 60 100 4

2 ECS 602 Introduction to

Microprocessor

3 1 0 20 20 40 60 100 4

3 ECS603 Artificial

Intelligence 3 1 0 20 20 40 60 100 4

4 ECS 604 DWDM 3 1 0 20 20 40 60 100 4

5 ECS605 Web Technology 3 1 0 20 20 40 60 100 4

6 ASH604 Industrial

Communication -VI 2 0 0 20 20 40 60 100 2

7 CBCS

3 - - 20 20 40 60 100 3

PRACTICALS

1 ECS 621 Compiler

Construction Lab

0 0 2 - - 40 60 100 1

2 ECS 622 Microprocessor Lab 0 0 2 - - 40 60 100 1

3 ECS623 Artificial

Intelligence Lab 0 0 2 - - 40 60 100 1

4 ECS625 Web Technology

Lab

0 0 2 - - 40 60 100 1

Total 1250 31


B.Tech (CSE)

7

SEVENTH SEMESTER

S.No Course

Code


Credits


Exam

Subject

Total

L T P CA TA Total

1 ECS 701 Cryptography &

Network Security 3 1 0 20 20 40 60 100 4

2 ECS 702 Software Project

Management 3 1 0 20 20 40 60 100 4

3 ECS 703 CSE-Elective-I

(Cloud Computing )

3 1 0 20 20 40 60 100 4

4 ECS704 CSE-Elective-II

(Mobile Computing) 3 1 0 20 20 40 60 100 4

5 ASH704 Industrial

Communication –

VII

2 0 0 20 20 40 60 100 2

6 CBCS

3 - - 20 20 40 60 100 3

PRACTICALS Online

Placement

Test

- - 2 20 20 40 60 100 2

1 ECS 721 Cryptography &

Network Security

Lab

0 0 2 - - 40 60 100 1

2 ECS 722 Software Project

Management Lab 0 0 2 - - 40 60 100 1

3. ECS 725 Project I 0 0 2 - - 40 60 100 2

4 ECS 726 Industrial Seminar 0 0 2 - - 40 60 100 2

Total 1150 29


B.Tech (CSE)

8

EIGHTH SEMESTER

List of Electives for B.Tech (Computer Science & Engineering)

CSE-Elective-I

ECS-071 Computational Geometry

ECS-072 Computational Complexity

ECS-073 Parallel Algorithms

ECS-074 Pattern Recognition

ECS 703 Cloud Computing

ECS-075 Big Data

CSE-Elective-II

ECS-704 Mobile Computing

ECS-076 Distributed Database

EIT-073 Bioinformatics

ECS-077 Data Compression

CS-Elective-III

ECS-081 Real Time System

S.No Course

Code

Subject Period Evaluation Scheme Total

Credits


Exam

Subject

Total

L T P CA TA Total

1 ECS 801 Distributed System

3 1 0 20 20 40 60 100 4

2 ECS 084 CSE-Elective-III

Artificial Neural

Network

3 1 0 20 20 40 60 100 4

3 EOE-

081

Open Elective-I

EDP 3 1 0 20 20 40 60 100 4

4 CBCS

3 - - 20 20 40 60 100 3

PRACTICALS Online

Placement

Test

- - 2 20 20 40 60 100 2

1 ECS 821 Distributed System

Lab 0 0 2 - - 40 60 100 2

2 ECS 825 Project II 0 0 2 - - 50 150 200 6

Total 950 27


B.Tech (CSE)

9

ECS-082 Soft Computing

ECS-083 Embedded Systems

ECS-084 Artificial Neural Network

OPEN ELECTIVE-I EOE -081 Entrepreneurship Development

EOE-082 Quality Management

EOE-083 Operations Research

EOE-084 Introduction to Biotechnology

Choice Based Credit System (CBCS)

Name of

School Programme 2nd Sem 4th Sem 6th Sem 8th Sem

Venue II sem Venue IV Venue VI Number of Seats

SET UG Intro to

Environmental Engineering

Building Construction Management

Environmental pollution & E -

waste management

NB201 NB211 NB212 50

SOS UG C Programing Business Statics Inventory

Management

NB101B NB312A NB312B 30

SBM

UG Business

Communication

Computer Applications in Business

Personality Development & Communication

Skills

AB001 AB002 AB105 50

PG

Corporate Social

Responsibility (CSR) and

Sustainability

Business Law System &

Procedures

AB110A AB110B 30

SLA UG Contemporary

Issues in Society

Indian Culture and Heritage

Human Rights and Duties

AB112B AB123B AB121B 30

SLLA UG Constitution of India

Environmental Law

Intellectual Property Rights

Family Law AB013 AB014 AB015 50

SJMC UG Introduction to Media Industry

Media writng

AB016 AB017 30

SOA UG Sustainable Habitat/ AV

Hall/40

Landscape/Lecture Room/40

Sustainable Architecture/Studio-

2/40

Ephemiral Urbanism/Studio-

3/40 AV Hall Lecture Room Studio -2 40

SOE

UG Drama and Art in Education-I

Life skills Education-I

105 Hall1 Hall2 30

PG Critical

understanding of ICT

Reading and reflecting on

Texts-II

Hall3 Hall4 Hall5 30

SFA UG Design-I Design-II Design-III Design-IV Studio-1 Studio-2 Studio -3 30

400


B.Tech (CSE)

10

MATHEMATICS-I

Course Code: ASH 101 Credits: 04

UNIT-1

Matrices: Elementary row and column transformations Rank of matrix, linear dependence,

Consistency of linear system of equations, Characteristic equation, Cayley-Hamilton

theorem, Eigen values and Eigen vectors, Diagonalization, Complex and unitary matrices.

UNIT-2

Differential Calculus-I : Leibnitz theorem, Partial Differentiation, Euler„s theorem,

Change of variables, Expansion of functions of several variables.

UNIT-3

Differential Calculus-II: Jacobian, Approximations and errors, Extrema of functions of

several variables, Lagrange method of multipliers

UNIT-4

Multiple Integrals & Vector Calculus: Double and triple integrals, Vector Calculus:

Point functions, Gradient, divergence and curl of a vector and their physical interpretation,

Line, surface and volume integrals, Green, Stokes and Gauss divergence theorem.

Reference Books:

1. Dr. H.K.Das Advanced Engineering Mathematics, Kreyszig, Wiley India

2. A Text book of Engineering Mathematics (Vol.1) by Peter V. O„ Neil, Cengage

Learning

3. B. S. Grewal: higher Engineering Mathematics, Khanna Publications.

4. N. Piskunov: Differential & Integral Calculus, Moscow Peace Publications.

5. G Shankar Rao, Text Book Of Engineering Mathematics, BS Publication, Hyderabad


B.Tech (CSE)

11

ENGINEERING PHYSICS

Course Code: ASH 102/202 Credits: 04

UNIT-I

Relativistic Mechanics: Inertial and Non-inertial Frames, Postulates of Special Theory of

Relativity, Lorentz Transformation, Length Contraction and Time Dilation,

Addition of Velocities, Mass Energy Equivalence and Variation of Mass with

Velocity. Radiation: Kirchhoff‟s Law, Stefan‟s law (only statement), Energy spectrum of

Blackbody Radiation.

UNIT-II

Interference: Coherent Sources, Conditions of Interference, Fresnel‟s Bi-prism

Experiment, Displacement of Fringes, Interference in Thin Films – Wedge Shaped

Film, Newton„s Rings. Diffraction: Single and n-Slit Diffraction, Diffraction Grating,

Raleigh„s Criterion of Resolution, Resolving Power of Grating.

UNIT-III

Polarization: Phenomenon of Double Refraction, Ordinary and Extra-ordinary Rays,

Nicol Prism, Production and Analysis of Plane, Circularly and Elliptically Polarized Light,

Optical Activity, Specific Rotation, Polari meter. Laser: Principle of Laser Action,

Einstein„s Coefficients, Construction and Working of He-Ne and Ruby Laser.

UNIT-IV

Electromagnetic: Ampere„s Law and Displacement Current, Maxwell„s Equations in

Integral and Differential Forms, Electromagnetic Wave Propagation in Free Space and

Conducting Media, Pointing Theorem. Phenomenon of Hysteresis and Its Applications

UNIT-V

Superconductivity:- Essential properties of superconductors (zero resistivity), penetration

depth and coherence length, Meissner effect, critical field , Type I and Type II superconductors,

applications of superconductors. Wave Mechanics: Wave Particle Duality, De Broglie Concept of

Matter Waves, Heisenberg Uncertainty Principle, Schrödinger Wave Equation and Its Applications:

Particle in a Box.

Reference Books:

1. Introduction to Special theory of Relativity Robert Resnick – Wiley India

2. Physics of Atoms, Wehr Richards &Adia

3. Fundamentals of Physics, Halliday, Wiley India

4. Engineering Electromagnetics, WilliamHayt, 7t h Ed,TMH

5. AshutoshAsthana, Engg. Physics, BS Publication, Hyderabad


B.Tech (CSE)

12

ENGINEERING CHEMISTRY

Course Code: ASH -103/203 Credits: 04

UNIT – I

General & Organic Chemistry:Molecular orbital theory, Molecular orbital diagram of

diatomic molecules, hybridization, hydrogen bonding, band theory of solids, liquid

crystals with their classification applications, Bragg„s Law, Fullerenes & their application ,

Nature of organic molecules, attacking reagents, inductive effect, electromeric,

mesomeric (resonance) effect, hyper conjugation, reaction intermediates types of

organic reaction (substitution, addition, elimination reaction &organic rearrangements),

Saytzeff‟s rule, organic name reactions (Cannizzaro‟s reaction, aldol condensation,

Pinnacol-pinnacolon rearrangement, Beckmann„s rearrangement, Hoffmann„s

rearrangement), Optical isomerism & confirmations, E-Z nomenclature, R-S configuration.

UNIT – II

Physical & Water Chemistry : Rate of reaction, order and molecularity of reaction,

Zero order, First Order, steady state approximation, concept of activation energy, energy

barrier, cell potential, liquid junction potential, conductance & its variation with

dilution, Transport no. Kohlraush‟s Law and its application, pH, buffer solution,

calculation of pH of buffer mixture solubility & solubility Product, Nernst distribution

law & its application, corrosion, its type, Mechanism & control , Theory of

Electrochemical corrosion. Hardness of water, boiler feed water, Softening of water

(Calgon Process, Zeolite process, Lime Soda process & Ion exchange process),

Reverse osmosis, treatment of boiler feed water.

UNIT – III

Chemistry Of Engineering Materials: Introduction & classification of polymers, Types

of Polymerization, bulk solution, suspension & emulsion, copolymers, vulcanization,

PVC, Polyamides, Polyurethane, Polyethylene, Poly propylene, PET, Resins (Phenol

Formaldehyde), PMMA, PAN, Rubber, Conducting and Biodegradable polymers, Pyro-

ceramics, Toughened glass, Strengthening of glass, Refractories, Nano Composites,

Protective Coatings, Fe, Al, Cu, Pb & Zn alloys, Organometallics & their applications.


B.Tech (CSE)

13

UNIT – IV

Fuels & Combustion: Classification of Fuels, calorific value of fuel, gross & net calorific

value, determination of calorific value using Bomb calorimeter, Coal, Biomass and Biogas,

Introduction of Lubricants, Mechanism of Lubrication, Classification of Lubricant, Bio

Lubricant, Flash and Fire Point, Pour Point, Cloud Point, Aniline point, Viscosity index.

UNIT – V

Analytical Methods And Applications: Titrimetric analysis with reference to acid-base,

redox, precipitation and complexometric titrations. Elementary ideas and simple

applications of UV, visible, mass and NMR spectral techniques H NMR spectral techniques.

Reference Books

1. Engineering Chemistry – Wiley India

2. Engineering chemistry by Sivasankar, TMH, New Delhi.

3. Organic Chemistry by Morrisson & Boyd, Pearson Publication.

4. Organic Chemistry by Loudon, Oxford University Press.

5. C. Parameswara Murthy, C V Agrawal et al., Engineering Chemistry, BS

Publication, Hyderabad

INDUSTRIAL COMMUNICATION-I


UNIT 1: Essentials of Grammar

Parts of Speech

One word substitution

Idioms and Phrases.

UNIT 2: Communication Skills

Developing Writing Skills

Developing Listening Skills

UNIT 3: Written English Communication

Paragraph Writing

Essay writing

Precise writing

UNIT 4: Self competency

Understanding of Self


B.Tech (CSE)

14

Self Confidence

Self-Image

UNIT 5: Building Positive Attitude

Meaning And Nature Of Attitude

Types of Attitude

Importance of Attitude.

Text and References:

1. Ramon & Prakash ,Business communication, oxford

2. Effective Technical Communication, M. Ashraf Rizvi

3. Organisational Behaviour , Davis ,K

4. Successful Communication, Malra Treece (Allyn and Bacon)

BASIC ELECTRICAL ENGINEERING

Course Code: EEL 105/205 Credits: 04

UNIT-1

D.C. Network Theory: Circuit theory concepts-Mesh and node analysis. Network

Theorems: Super-position theorem. Thevenin‟s theorem, Norton„s theorem, Maximum,

Power Transfer theorem, Star Delta transformation.

UNIT-2

Steady State Analysis of A.C. Circuits: Sinusoidal and phase or representation of

voltage and current: single phase A.C. circuit behavior of resistance, inductance and

capacitance and their combination in series & parallel and power factor, series parallel

resonance-band width and quality factor

UNIT-3

Three Phase A.C. Circuits : Star-Delta connections, line and phase voltage/current

relations, three phase power and its measurement.

UNIT-4

Transformer: Principle of operation, types of construction, phasor diagram, equivalent

circuit, efficiency and voltage regulation of single phase transformer, O.C. and S.C. tests.

UNIT-5


B.Tech (CSE)

15

Rotating Machine: Principle and construction of D.C. Machines, Synchronous motor and

induction motor.

Single phase Motors: Principle of operation and methods of starting of induction motor.

Special Machines: principle of operation and methods of starting of Stepper motor and

Universal motor

UNIT-6

Measuring Instruments: Construction and principle of operation of voltage and current

measuring instruments; introduction to power and energy meters.

Reference Books:

1. Dr. R. K. Singh and Dr. P.S. Subramanyam, Basic Electrical Engineering, BS

Publication, Hyderabad.

2. Gaikwad, Basic Electrical Engineering, Wiley India

3. A.E. Fitgerald, D.E., Higginbotham and A Grabel, “Basic Electrical Engineering”

4. McGraw Hill.

5. H. Cotton, ―Advanced Electrical Technology‖ Wheeler Publishing.

6.

BASIC MECHANICAL ENGINEERING

Course Code: EME 106/206 Credits: 04

UNIT-1

Fundamental Concepts and Definitions: Definition of thermodynamics, System,

Surrounding and universe, Phase, Concept of continuum, Macroscopic & microscopic point

of view. Density, Specific volume, Pressure, temperature. Thermodynamic equilibrium,

Property, State, Path, Process, Cyclic and non cyclic processes, Reversible and irreversible

processes, Quasi static process, Energy and its forms, Enthalpy.

UNIT-2

Law of Thermodynamics: Zeroth law, Different temperature scales and temperature

measurement. First law: First law of thermodynamics. Processes - flow and non-flow,

Control volume, Flow work and non-flow work, Steady flow energy equation, Unsteady

flow systems and their analysis. Second law: Limitations of first law of thermodynamics,

Essence of second law, Thermal reservoir, Heat engines. COP of heat pump and

refrigerator. Statements of second law and their equivalence, Carnot cycle, Carnot theorem,

Thermodynamic temperature scale, Clausius inequality. Concept of entropy.

UNIT-3

Properties of steam and Basic of IC engine: Properties of steam, Phase transformation

process and its graphical representation on P-V, T-V & T-s diagram, Mollier diagram and


B.Tech (CSE)

16

Steam Tables, Processes involving steam in closed and open systems. Introduction to I.C.

Engines: Two & four stoke S.I. and C.I. engines. Otto cycle, Diesel cycle and Dual cycle.

UNIT-4

Force system and Analysis: Force system and Analysis Basic concept: Review of laws of

motion, transfer of force to parallel position, resultant of planer force system, Free Body

Diagrams, Equilibrium. Friction: Introduction, Laws of Coulomb friction, Equilibrium of

bodies involving dry fiction. Structure Analysis Beams: Introduction, Shear force and

bending moment, Shear force and bending moment diagram for statically determinate

beams. Trusses: Introduction, Simple Trusses, Determination of forces in simple truss

members, Method of joints and Method of section.

UNIT-5

Stress and Strain Analysis: Simple stress and strain: Introduction, Normal shear stresses,

Stress-strain diagrams for ductile and brittle materials, Elastic constants, One dimensional

loading of members of varying cross section, Strain energy, Thermal stresses. Compound

stress and strains: Introduction, State of plane stress, Principal stress and strain, Mohr‟s

circle for stress and strain. Pure Bending of Beams: Introduction, Simple bending theory,

Stress in beams of different cross sections. Torsion: Introduction, Torsion of Shafts of

circular section, Torque and Twist, Shear stress due to Torque.

Reference Books:

1. Agarwal, Basic Mechanical Engineering, Wiley India

2. Holman, J.P.: Thermodynamics, McGraw Hill book Co. NY.

3. Singh Onkar, Bhavikatti S.S., Chandra Suresh : Introduction to Mechanical Engineering:

4. Thermodynamics, Mechanics and Strength of Materials, New Age International

Publishers

5. Yadav R.: Thermodynamics and Heat Engines, Vol I & II (SI Edition) Central

Publishing, House Allahabad.


B.Tech (CSE)

17

FUNDAMENTALS OF COMPUTER & PROGRAMMING

Course Code: ECS 107/207 Credits: 04

UNIT 1

Basics of Computer System Block Diagram of a Computer, Booting Process, Types of

Computer Systems, Introduction to the concepts: Bit, Byte, Word, hardware, Operating

System and Application Software, Compilers, Assemblers, Loaders and Linkers. ASCII &

EBCDIC codes, Binary, Octal, Decimal & Hexadecimal Number Systems & their

Conversions

UNIT 2

Introduction to Computer Operating System Features of DOS, Windows and UNIX

Operating System and their Comparison, Concept of Flowchart and Algorithm, Machine,

Assembly and high level languages, Structured Programming, Use of high level

programming languages for the systematic development of programs.

UNIT 3

C Fundamentals: Character Set, Identifiers & Keywords, Data Types, Constants,

Variables, Tokens, Operators & Expression, Library Functions, Statements, Symbolic

Constants, Preprocessor Directives, Functions.

UNIT 4

Arrays and Structure

Introduction, Classification of Array: One Dimensional Array, Multidimensional Array,

Two Dimensional Arrays. Defining a Structure, Array vs. Structure, Initialization of a

Structure, Nested Structure

UNIT 5

Pointers and File handling Pointers Variables, Pointer Operator, Pointer Expression, Array

of Pointers , Multiple Indirection, Pointers to functions, dynamic allocation functions, File

I/O: Streams and files, file System basic, fread, fwrite ,fseeek, random access I/O, fprintf(),

fscanf(), standard streams.

Reference Books

1. Let Us C : Yashwant Kanetkar [BPB]

2. Jones, C Programming with problem solving, Wiley India

3. Gupta: Computer Concepts & C Programming, Comdex


B.Tech (CSE)

18

BASIC ELECTRONIC ENGINEERING

Course Code: EEC 108/208 Credits: 04

UNIT 1

Semiconductor materials and properties :Group-IV materials, Covalent bond, electron-

hole concepts, Basic concepts of energy bands in materials, concepts of forbidden gap,

Intrinsic and extrinsic semiconductors, donors and acceptors impurities, Junction diode p-n

junction, depletion layer, v- i characteristics, diode resistance, capacitance diode ratings (

average current, repetitive peak current, non-repetitive current, peak-inverse voltage).

UNIT-2

Diode Applications: Rectifiers (half wave and full wave), calculation of transformer

utilization factor and diode ratings, Introduction to filters, calculation of ripple factor and

load regulation, clipping circuits, clamping circuits, voltage multipliers

Breakdown diodes breakdown mechanisms (zener and avalanche), breakdown

characteristics, zener resistance, zener diode ratings, zener diode application as shunt

regulator

UNIT-3

Bipolar Junction Transistor : Basic construction, transistor action, CB, CE and CC

configurations, input/output Characteristics, concept of Biasing of transistors-fixed bias,

emitter bias, potential divider bias, Transistor Amplifier, Graphical analysis of CE amplifier,

concept of voltage gain, current gain, h-parameter model (low frequency), computation of

Ai, Av, Ri, R O of single transistor CE and CC amplifier configurations.

UNIT-4

Field Effect Transistor : FET: Basic construction, transistor action, concept of pinch

off, maximum drain saturation current, input and transfer characteristics, characteristics

equation CG, CS and CD configurations, Introduction to self and fixed biasing .MOSFFT:

depletion and enhancement type MOSFET-construction, operation and characteristics.

Computation of Av, Ri, Ro, of single FET amplifiers using all the three configurations

UNIT-5

Switching theory and logic design : Number systems, conversions of bases, Boolean

algebra, logic gates, concept of universal gate, and concept of K- Map


B.Tech (CSE)

19

Operational Amplifiers: Concept of ideal operational amplifiers, ideal op-amp parameters,

inverting, non-inverting and unity gain amplifiers

Reference Books:

1. Robert Boylestad, Electronic Devices and Circuit theory, Pearson Educations.

2. R. K. Singh & Lal Kishor, Basic Electronics Engineering, B S Publication,

Hyderabad.

3. Gaikwad, Basic Electronics, Wiley India

4. A Mottershead, Electronic devices and circuits„. PHI, 2000.

5. M. Morris Mano, Digital Computer Design„, PHI, 2003.

ENVIRONMENTAL STUDIES

Course Code: EBT 109/209 Credits: 02

UNIT 1

NATURAL RESOURCES:

Renewable and Non-renewable Resources: Natural resources and associated problems.

a) Forest resources: Use and over-exploitation, deforestation, case studies. Timber

extraction, mining, dams and their effects on forest and tribal people.

b) Water resources: Use and over-utilization of surface and ground water, floods, drought,

conflicts over water, dams-benefits and problems.

c) Mineral resources: Use and exploitation, environmental effects of extracting and using

mineral resources, case studies.

d) Food resources: World food problems, changes caused by agriculture and over-grazing,

effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case

studies.

e) Energy resources: Growing energy needs, renewable and non renewable energy sources,

use of alternate energy sources, Case study.

f) Land resources: Land as a resource, land degradation, man induced landslides, soil

erosion and desertification.

• Role of an individual in conservation of natural resources.

• Equitable use of resources for sustainable lifestyles.

UNIT 2

ECOSYSTEMS

• Concept of an ecosystem.


B.Tech (CSE)

20

• Structure and function of an ecosystem.

• Producers, consumers and decomposers.

• Energy flow in the ecosystem.

• Ecological succession.

• Food chains, food webs and ecological pyramids.

• Introduction, types, characteristic features, structure and function of the following

ecosystems:-

a. Forest ecosystem

b. Grassland ecosystem

c. Desert ecosystem

d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)

UNIT 3

BIODIVERSITY AND ITS CONSERVATION

• Introduction – Definition: genetic, species and ecosystem diversity.

• Bio geographical classification of India

• Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic

and option values

• Biodiversity at global, National and local levels.

• India as a mega-diversity nation

• Hot-sports of biodiversity.

• Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts.

Endangered and endemic species of India

• Conservation of biodiversity: In-situ and Ex-sit conservation of biodiversity.

UNIT 4

ENVIRONMENTAL POLLUTION & SOCIAL ISSUES

Definition, Cause, effects and control measures of:-

Air pollution

Water pollution


B.Tech (CSE)

21

Soil pollution

Marine pollution

Noise pollution

Thermal pollution

Nuclear hazards

Disaster management: floods, earthquake, cyclone and landslides.

From Unsustainable to Sustainable development

Urban problems related to energy. Water conservation, rain water harvesting,

watershed management

Environmental ethics: Issues and possible solutions.

Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents

and holocaust. Case Study.

Wasteland reclamation.

Consumerism and waste products.

Reference Books

1. M Ajni Reddy, Text book of environmental Science, BS Publication, Hyderabad

2. Environmental Studies by Daniel, Wiley India

3. Environmental Studies by ErachBharucha, University Press.

4. Fundamental of Ecology, E.P.Odum, Cengage Learning.

5. Environmental Science and Engineering by Wright, Pearson Publication.

6. First Ecology by Beeby and Brennan, Oxford University Press.

7. Environment Science by Miller, Cengage Learning, New Delhi.

8. Hand book of Environmental laws, Rules, Guidelines, Compliances and Standards

Vol. 1 & Vol. 2, Bharat Publication, New Delhi.


B.Tech (CSE)

22

ENGINEERING DRAWING

Course Code: EED 111/211 Credits: 01

1. Graphics as a tool to communicate ideas, Lettering and dimensioning, Construction of

geometrical figures like pentagon and hexagon.

2. Orthographic Projection Principles of orthographic projections, Principal and auxiliary

planes, First and Third angle projections. Projection of points. Pictorial view. Projection of

lines parallel to both the planes. Parallel to one and inclined to other, Inclined to both the

planes. Application to practical problems. Projection of solid in simple position, Axis or

slant edge inclined to one and parallel to other plane, Solids lying on a face or generator on

a plane. Sectioning of solids lying in various positions, True shape of the section.

Development of lateral surfaces, sheet metal drawing.

3. Isometric Projection Principles of isometric projection, Isometric projection using box

and offset methods.

Reference books:

1. Bhatt. N.D.: Elementary Engineering Drawing, Charothar Publishing.

2. D A Hindoliya, Text book of Egg. Graphics, BS Publication, Hyderabad


B.Tech (CSE)

23

CYBER LAW

Course Code: ECS-110/ECS-210 Credits: 02

UNIT-1

Cyber Space, Technology & Social Issues : Evolution & Growth of ICT, Internet

ownership & Standards, Role of ISP, Data Security & Management, Data Encryption and

Decryption, Digital Signature Convergence, VoIP and VPN

UNIT-2

Indian Penal Law, Cyber Crime and Emerging Social Issue in Cyber Space:

(A) Fraud, Hacking, Mischief, Trespassing, , Defamation, Stalling & spam.

(B) Digital Divide, Promotion of Global censorship, open source movement.

UNIT-3

Privacy & Data Protection: The concept of privacy, Nation Legal framework on

protection privacy, Concept of security in cyber space, Vulnerabilities (Freedom of

expression in Internet issues of censorship, Hate speech, subversion, privacy, etc.)

UNIT-4

Regulation of Cyberspace: IT Act 2000, Amendment of IT Act 2000 (2006) & Cyber

Contracts Guidelines issued by various ministries, Online Dispute Resolution, Privacy,

Indian Law on Shrink Wrap Contracts.


B.Tech (CSE)

24

PHYSICS LAB


List of Experiments (Any Ten)

1. To determine the wavelength of monochromatic light by Newton‟s ring.

2. To determine the wavelength of monochromatic light with the help of Fresnel‟s bi-

prism.

3. To determine the focal length of two lenses by nodal slide and locate the position of

cardinal points.

4. To determine the specific rotation of cane sugar solution using half shade Polari

meter.

5. To determine the wavelength of spectral lines using plane transmission grating.

6. To determine the specific resistance of the material of given wire using Carey

Foster‟s bridge.

7. To determine the variation of magnetic field along the axis of a current carrying coil

and then to estimate the radius of the coil.

8. To verify Stefan‟s Law by electrical method.

9. To calibrate the given ammeter and voltmeter.

10. To study the Hall Effect and determine Hall coefficient, carnier density and mobility

of a given semiconductor material using Hall-effect set up.

11. To determine energy bank gap of a given semiconductor material.

12. To determine E.C.E. of copper using Tangent or Helmholtz galvanometer.

13. To draw hysteresis curve of a given sample of ferromagnetic material and from this

to determine magnetic susceptibility and permeability of the given specimen.

14. To determine the ballistic constant of a ballistic galvanometer.

15. To determine the viscosity of a liquid.

Note: Additional experiments may be added based on contents of syllabus.


B.Tech (CSE)

25

CHEMISTRY LAB



1. Determination of alkalinity in the given water sample.

2. Determination of temporary and permanent hardness in water sample using EDTA as

standard solution.

3. Determination of available chlorine in bleaching powder.

4. Determination of chloride content in the given water sample by Mohr‟s method.

5. Determination of iron content in the given ore by using external indictor.

6. PH-metric titration.

7. Determination of Equivalent weight of Iron by the chemical displacement method. The

equivalent weight of copper is 63.5

8. (Note : the procedure to be followed in carrying the above experiment is given as

annexure)

9. Viscosity of an addition polymer like polyester by Viscometer.

10. Determination of iron concentration in sample of water by colorimetric method. The

method involves the use of KCNS as color developing agent and the measurements are

carried out at l max 480 nm.

11. Note: The general procedure of estimation is given on pp653-8 of the textbook of

Quantitative Chemical Analysis by A.I. Vogel 6th Edition, Publisher: Pearson education

Ltd. 2000)

12. Determination of heat of neutralization of Hydrochloric acid and Sodium hydroxide

13. Determination of amount of dissolved oxygen in water

14. Separation of metal ions by paper chromatography

15. Preparation of iodoform from acetone

16. Preparation of Sodium Cobalt nitrile salt.

17. Element detection & functional group identification in organic compounds


B.Tech (CSE)

26

BASIC ELECTRICAL LAB

Course Code: EEL 125/225 Credits: 01


1. Verification of Kirchhoff‟s Law (KVL & KCL).

2. Study of phenomenon of resonance in RLC series circuit.

3. Verification of superposition theorem

4. Verification of Thevenin‟s theorem.

5. Verification of Norton‟s theorem.

6. Verification of maximum power transfer theorem.

7. Measurement of power in a three phase circuit by two wattmeter method.

8. Measurement of efficiency of a single phase transformer by load test.

9. Determination of parameters and losses in a single phase transformer by OC and SC

test.

10. Study running and reversing of a three phase induction motor.

11. Study of a single phase energy meter.


B.Tech (CSE)

27

BASIC MECHANICAL ENGINEERING LAB

Course Code: EME 126/226 Credits: 01


1. Study of Steam engine and steam turbine models.

2. Study of 2-stroke and 4 -stroke I.C Engine models.

3. Study of a vapor compression Refrigeration unit tutor/refrigerator.

4. Study of a window type air conditioner.

5. To conduct the tensile test on a UTM and determine ultimate Tensile strength,

percentage elongation for a steel specimen.

6. To conduct the compression test and determine the ultimate compressive strength for

a specimen.

7. To conduct the Impact test (Izod / charpy) on the Impact testing machine and to find

the impact strength.

8. To determine the value of acceleration due to gravity by Atwood‟s Machine

apparatus.

9. To verify the principle of moment by Bell Crank Lever Apparatus.

10. To determine the moment of inertia of a flywheel apparatus about its axis of rotation

11. To verify Newton‟s second law of motion by Fletcher‟s Trolley apparatus

12. To find out coefficient of friction by combined inclined plane & friction slide

apparatus

13. To determine the velocity ratio, mechanical advantage & efficiency of a single

purchase crab apparatus & draw graph between load vs effort, mechanical advantage

and efficiency.

14. To determine the velocity ratio, mechanical advantage & efficiency of a double

purchase crab apparatus.


B.Tech (CSE)

28

FUNDAMENTALS OF COMPUTER PROGRAMMING LAB

Course Code: ECP 127/227 Credits: 01


1. Practice of some internal and External DOS Commands

2. Write a program to determine whether given number is even or odd

3. File and program management in windows

4. Write a program to find hexadecimal and octal value of a number

5. Write a program to swap two numbers

6. Write a program to find sum of all the digits of a number

7. TO simulate calculator to perform the following operations on two numbers:

Addition, subtraction, Multiplication, division.

8. Write a program to read two matrixes and multiply them

9. Write a program to make a copy of a text file using EOF, FGETC and FPUTE

10. Write a program to generate table of any number using pointer

11. Write a program to find whether given number is Palindrome or not.

12. Write a program to calculate the simple interest for a set of values representing

principle, number of years and rate of interest.

Note: List may be modified according to new software available


B.Tech (CSE)

29

BASIC ELECTRONICS ENGINEERING LAB

Course Code: EEC 128/228 Credits: 01


1. Study of diode characteristics.

2. To study a half wave and full wave rectifier circuit.

3. Determination of ripple factor of capacitive and non-capacitive filter for HW and

FW diode rectifier circuit.

4. Study of characteristics of Zener Diode as constant voltage.

5. Verification of Application of Zener Diode as shunt regulator.

6. Study of Clipper and Clamper Circuit with different waveforms.

7. Determination of characteristics of BJT in CB and CE configuration.

8. Determination of characteristics of FET in CS and CD configuration.

9. Study of BJT as single stage amplifier and determination of Ai, Vi, Ri and Ro.

10. Study of AND, NAND, OR, NOR and EXOR gates.

11. Verification of Universal gates.


B.Tech (CSE)

30

WORKSHOP PRACTICES

Course Code: EWS 110/210 Credit: 01

1. Carpentry Shop:

a. Study of tools and operation and carpentry joints.

b. Simple exercise using jack plain.

c. To prepare half- lap corner joint, mortise and tennon joints.

d. Simple exercise on woodworking lathe.

2. Fitting Bench Working Shop:

a. Study of tools and operations

b. Simple exercises involving filling work.

c. Making perfect male-female joint

d. Simple exercise involving drilling/tapping/dyeing.

3. Black Smithy Shop:

a. Study of tools and operations

b. Simple exercises based on black smithy operations such as upsetting, drawing down,

punching, bending, fullering & swaging.

4. Welding Shop:

a. Study of tools and operations.

b. Simple butt joint.

c. Lap joint.

d. Oxy acetylene welding.

5. Sheet metal shop:


b. Making funnel complete with soldering.

c. Fabrication of tool box, tray, electrical panel box etc

6. Machine Shop:


b. Plane turning.

c. Step turning.

d. Taper turning

e. Threading.

f. Single point cutting tool grinding.

References Books::

1. Hajra, Bose, Roy: Workshop Technology Vol 1 & 2, Media Promotors

2. Raghuvanshi B.S.: Workshop Technology, Vol 1 & 2, Dhanpatrai


B.Tech (CSE)

31

MATHEMATICS-II

Course Code: ASH-201 Credits: 04

UNIT-1

Differential Equations: Ordinary differential equations of first order, Exact differential

equations, Linear differential equations of first order, Linear differential equations of nth

order with constant coefficients, Complementary functions and particular integrals,

Simultaneous linear differential equations, Solutions of second order differential equations

by changing the dependent and independent variables, Method of variation of parameters.

UNIT-2

Laplace Transform Laplace transform, Existence theorem, Laplace transform of

derivatives and integrals, Inverse Laplace transform, Laplace transform of periodic function,

Unit step function, Convolution theorem, Applications to solve simple linear and

simultaneous liner differential equations.

UNIT-3

Infinite Series: Introduction, Sequences, Series: Convergence, Series of positive terms,

Comparison tests, Integral tests, Comparison of ratio„s, D‟ Alembert ratio test, Raabe‟s

test, Cauchy root test, Alternating series: Leibnitz rule, Power series, Uniform convergence,

Weierstress‟s M-test, Properties of uniformly convergent series.

UNIT-4

Fourier series and Partial Differential Equations:

Periodic functions, Trigonometric series, Fourier series of periodic function, Euler„s

formula, Functions having arbitrary period, Change of intervals, Even and odd functions,

Half range sine and cosine series. Introduction to partial differential equations, Linear

partial differential equations with constant coefficients of second order and their

classifications: parabolic, hyperbolic and elliptic with illustrative examples.

UNIT-5

Applications of Partial Differential equations: Method of separation of variables for

solving partial differential equations, One dimensional wave equation, Laplace equation in

two dimensions, Heat conduction equations of one dimension and two dimension.

References Books:

1. A Text book of Engineering Mathematics (Vol.2) by Peter V. O„ Neil, CengageLearning.

2. B. S. Grewal: Higher Engineering Mathematics, Khanna Publications.

3. C. Prasad, Advanced Mathematics for Engineers, Prasad Mudralaya.


B.Tech (CSE)

32

4. E. Kreyszij: Advanced Engineering Mathematics, Wiley Eastern.

5. M.D. Raisinghania: Ordinary & Partial Differential Equations, S. Chand Publication.


B.Tech (CSE)

33

INDUSTRIAL COMMUNICATION-II


Course Objective:

To enable the students:

To understand the process of problem solving and creative thinking.

To facilitate and enhance skills required for decision-making. The workplace.

To form written communication strategies necessary in

Course Contents:

Unit 1:

A. Writing as an Effective Tool of Communication (a) Effective writing skills

Avoiding common errors

Paragraph writing

Note taking

B. Thinking as a Tool for Problem Solving

(a) What is thinking?

The mind

Brain

Behaviour

Thinking skills

(b) Critical thinking and learning, its importance

(c) How to make predictions, Importance of reasoning

(d) Role of emotions

Unit 2:

A. Letter Writing

Types

Formats

B. Problem Solving

Definition of a problem

Analyzing the problem

Solution

Barriers to problem solving: Emotions,

Expressions, Work environment

Unit 3:

A. Communication Tools

Memo

Agenda and Minutes


B.Tech (CSE)

34

Notice and Circular

B. Creative Thinking Definition of creative thinking

Convergent and divergent thinking

Debating

The six-phase model of creative thinking-ICEDIP

Model

Unit 4:

A. Report Writing

Fundamental principles of report writing

Purpose and scope of report writing

B. Plan of Action

Construction of POA

Monitoring

Reviewing and analyzing the outcome

Text Books and Reference Books:

1. Creative English For Communication, Krishnaswami N, Macmillan

2. Textbook of Business Communication, Ramaswami S, Macmillan


B.Tech (CSE)

35

ENGINEERING DRAWING

Course Code: EED 111/211 Credits: 01

1. Graphics as a tool to communicate ideas, Lettering and dimensioning, Construction of

geometrical figures like pentagon and hexagon.

2. Orthographic Projection Principles of orthographic projections, Principal and auxiliary

planes, First and Third angle projections. Projection of points. Pictorial view. Projection of

lines parallel to both the planes. Parallel to one and inclined to other, Inclined to both the

planes. Application to practical problems. Projection of solid in simple position, Axis or

slant edge inclined to one and parallel to other plane, Solids lying on a face or generator on

a plane. Sectioning of solids lying in various positions, True shape of the section.

Development of lateral surfaces, sheet metal drawing.

3. Isometric Projection Principles of isometric projection, Isometric projection using box

and offset methods.

Reference books:

3. Bhatt. N.D.: Elementary Engineering Drawing, Charothar Publishing.

4. D A Hindoliya, Text book of Egg. Graphics, BS Publication, Hyderabad


B.Tech (CSE)

36

DISCRETE STRUCTURES

Course Code: ECS 301 Credits: 04

UNIT-I

Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets

Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, equivalence relation, partial ordering relation.

Function: Definition, type of functions, one to one, into and onto function, inverse

function, composition of functions, recursively defined functions. Theorem proving Techn iques : mathematical i n d u c t i o n ( simple and strong), pigeonhole principle, prove by contradiction.

UNIT-II

Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets, factor group,

Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results.

UNIT-III

Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded I and complemented lattices.

UNIT-IV

Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Universal and existential quantifiers.

UNIT-V

Combinatorics & Graphs: Recurrence Relation, Generating function., Permutation & Combination, Probabilistic Permutation & Combination

Reference Book:

1. Y N Singh, “Discrete Mathematical Structures”, Wiley India 2. Liptschutz, Seymour, “ Discrete Mathematics”, McGraw Hill. 3rd edition 3. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to

Computer Science”, McGraw Hill, Reprint 2010

37

OPERATING SYSTEMS


UNIT- I

Introduction to operating system

Operating system and function, Evolution of operating system, Batch, Interactive,

multiprogramming, Time Sharing and Real Time System, multiprocessor system, Distributed

system, System protection. Operating System structure, Operating System Services, System

Program and calls.

UNIT- II

Process Management

Process concept, State model, and process scheduling, job and process synchronization,

structure of process management, Threads inter-process Communication and

Synchronization: Principle of Concurrency, Producer Consumer Problem, Critical Section

problem, Semaphores, Hardware Synchronization, Critical Regions, Conditional critical

region, Monitor, Inter Process Communication. CPU Scheduling: Job scheduling functions;

Process scheduling, Scheduling Algorithms, Non Preemptive and preemptive.-Strategies,

Algorithm Evaluation, Multiprocessor Scheduling. Deadlock: System Deadlock Model,

Deadlock Characterization, Methods for handling deadlock, Prevention strategies, voidance

and Detection, Recovery from deadlock combined approach.

UNIT- III

Memory Management

Single Contiguous Allocation: H/W support, S/W support, Advantages and disadvantages,

Fragmentation, Paging, Segmentation, Virtual memory concept, Demand paging,

Performance, Paged replaced algorithm, Allocation of frames, Thrashing, Cache memory,

Swapping, Overlays

UNIT- IV

Device management

Principles of I/O hardware, Device controller, Device Drivers, Memory mapped I/O, Direct

Access Memory, Interrupts, Interrupt Handlers, Application I/O interface, I/O Scheduling,

Buffering, Caching, Spooling, Disk organization, Disk space management, Disk allocation

Method, Disk Scheduling, Disk storage.

38

UNIT- V

File System and Protection and security

File Concept, File Organization and Access Mechanism, File Directories, Basic file system,

File Sharing, Allocation method, Free space management. Policy Mechanism,

Authentication, Internal excess Authorization.

Text Books & Reference Books:

1. Operating System by Galvin,

2. Operating System by Tenen Baum

3. Operating System by William Stalling

DATA STRUCTURES

Course Code: ECS 303 Credits: 04 UNIT – I

Introduction: Basic Terminology, Elementary Data O r g a n i z a t i o n , Structure Operations, Algorithm Complexity and Time-Space trade-off

Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, address calculation, application of arrays, Character String in C, Character string operation, Array as Parameters, Ordered List, Sparse Matrices and Vectors.

Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push

& Pop, Array Representation of Stack, Linked Representation of Stack, Operations

Associated with Stacks, Application of stack: Conversion of Infix to Prefix

and Postfix Expressions, Evaluation of postfix expression using stack.

Recursion: Recursive definition and processes, recursion, example of recursion,

Tower of Hanoi Problem, simulating recursion, Backtracking, recursive algorithms.

UNIT – II

Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, D-queues and Priority Queues.

Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Linked List in Array, Polynomial representation and addition, Garbage Collection and Compaction.

39

UNIT –III

Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, path length algorithm. Huffman Algorithm. Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of Search Algorithm.

UNIT –IV

Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation.

Sorting: Insertion Sort, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort,

Sorting on Different Keys.

UNIT – V

File Structures: Physical Storage Media File Organization, Organization of records into Blocks, Sequential Files, Indexing and Hashing, Primary indices, Secondary indices, B+ Tree index Files, B Tree index Files, Indexing and Hashing Comparisons.

Reference Books: 1. Shukla, “Data Structures using C and C++”, Wiley India 2. A M. Tenenbaum, “Data Structures using C & C++”, Prentice-Hall of India Pvt.

Ltd., New Delhi.(2 nd ed).

3. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education Asia,

Delhi-2002. Reprint 2010. DIGITAL ELECTRONICS & DESIGN ASPECTS


UNIT-I

Introduction

Characteristics of digital system, Types of Digital circuits, Number system: Direct

conversion between bases Negative numbers & BCD and their arithmetic‟s, Boolean

algebra, Minimization of Boolean Functions: K Map up to 6 variable and multiple

output circuits error detection & correcting codes, Hamming & cyclic codes quine

mcclusky method

40

UNIT-II

Combinational Logic Circuits

Design Procedure, adders, subtractions & code conversion,

Multiplexers/demultiplexers, encoder/decoders, decimal adders & amplitude

comparators, ROM as decoder, PLA & PAL. UNIT-III

Sequential Logic Circuits

Flip-Flops and their conversions, analysis and synthesis of synchronous sequential

circuit, excitation table, state table & diagram. Design of synchronous counters, shift

registers and their applications. UNIT-IV

Logic Families

Diode, BJT & MOS as a switching element concept of transfer characteristics,

Input characteristics and output characteristics of logic gates, TTL,

IIL,ECL,NMOS,CMOS Tri-state logic, open collector output, Interfacing between

logic families, packing density, power consumption & gate delay.

UNIT-V

Hazard, Fault Detection &Memories Hazard and Fault Detection: Static and dynamic Hazard: Gate delay, Generation of spikes, Determination of hazard in combinational circuits, Fault detection methods: Fault Table & Path sensitizing methods. Memories: Sequential, Random Access, NMOS & CMOS Static and Dynamic Memory elements, one and multi-dimensional selection arrangement, Read-only memories, Formation of memory banks, internal & External address decoding

Reference Books: 1. Maini, “Digital Electronics: Principles and Integrated Circuits”, Wiley India 2. Digital Systems: Principles and Design, Raj Kamal, Pearson 3. Balbanian, Digital logic design, Wiley India. 4. M. Morris Mano and M. D. Ciletti, Digital Design, M. Morris Mano and M. D.

i. Ciletti, 4th Edition, pearson 5. Switching Circuit & Logic Design, Hill & Peterson, Wiley

41

OBJECT ORIENTED PROGRAMMING

Course Code: ECS 305 Credits: 04 Unit-I

Object Modeling: Introduction of Object Modeling, Objects and classes, links and

association, generalization and inheritance, aggregation, polymorphism, encapsulation,

abstract class, multiple inheritance. Modeling: Class, Dynamic, Functional, Events and

states, operations, concurrency, advanced dynamic modeling concepts, a sample dynamic

model, OMT Phases.

Unit-II

Object Oriented Programming Concepts: Introduction of C++, Procedural Language

and Object Oriented approach, Characteristics of OOP- Class, Object, Inheritance, Data

Abstraction, polymorphism (Operator overloading and function overloading), and

encapsulation. C++: syntax, data types, variables, string, function, operators, flow control,

array and pointer, structure, union.

Unit-III

42

Classes and objects: Introduction to class, Class Definition, Classes and Objects, Access

specifiers – Private, Public and Protected, Member functions of the class- declaring inside

the class and outside the class.

Abstracting Mechanism: classes, private and public, Constructor and Destructor, copy

constructer, Overloading Constructors, static members, references

Memory Management: new, delete, object copying, assignment operator, this

input/output.

Unit-IV

Inheritance and Polymorphism: Derived Class and Base Class, Different types of

Inheritance, Overriding member function, Abstract Class, Public and Private Inheritance,

Ambiguity in Multiple inheritance , Virtual function, Friend function, Static function.

File handling (File Input Output): Input/Output with files. Open a file, closing a file,

Reading & Write Content in the file using functions and constructor. Other special

functions related to file

Unit -V

Exception Handling: Exception and derived class, function exception declaration,

unexpected exception, exception when handling exception, resource capture and release.

Template and Standard Template Library: Template classes, declaration, template

functions, string, iterators, hashes.

References:

Herbert Schildts : C++ - The Complete Reference, Tata McGraw Hill Publications.

Balaguru Swamy : C++, Tata McGraw Hill Publications.

Balaguruswamy : Object Oriented Programming and C++, TMH.

Shah & Thakker : Programming in C++, ISTE/EXCEL.

ENGINEERING ECONOMICS


UNIT-I

Introduction: Meaning, Nature and Scope of Economics, Meaning of Science,

Engineering and Technology, Engineering Economics and its scope in engineering

perspective.

43

UNIT-II

Basic Concepts: Demand Analysis, Law of Demand, Determinates of Demand, Elasticity

of Demand-Price, Income and cross Elasticity. Uses of concepts of elasticity of demand in

managerial decision.

UNIT-III

Demand forecasting: Meaning, significance and methods of demand forecasting,

production function, laws of returns to scale & Law of Diminishing returns scale. An

overview of Short and Long run cost curves-fixed cost, variable cost, average cost,

marginal cost, Opportunity cost, Relevant Cost for decision making.

UNIT-IV

Market Structure: Perfect Competition, Imperfect competition-Monopolistic, Oligopoly,

duopoly sorbent features of price determination in various market conditions, Break-even

analysis.

UNIT-V

National Income, Inflation and Business Cycles: Concept of N.I. and Measurement,

Meaning of Inflation, Type causes & prevention methods, Phases of business cycle.

Reference Books:

1. Koutsoylannis A: Modern Microeconomics, ELBS.

2. Managerial Economics for Engineering: Prof . D.N. Kakkar

3. Managerial Economics : D.N. Dwivedi

4. Managerial Economics : Mahaeshwari

Industrial Communication-III


Course objectives:

To Understand the nature of industries

To understand official decorum / Behavior

To develop executive official skills

Unit-1 Introduction of Organizational Structure

44

Elements of Orgizational structure, division of labours, span of Control, organizational

based employee behavior

Unit II Quality of working Life (Q.W.L)

Definition of Q.W.L, Evolution and development of the control of Q.W.L, Constitutants of

Q.W.L, Q.W.L in the Indians and European context.

Unit III International industrial behavior

Culture differences in industrial organization , Group Behaviour, Industrial Change and

managerial career, Theory and culture

Unit IV Accidents and safety

Definition / Causes of accidents(Macinery), theory of accidental programs, accident

prevention programmes, legal provisions safety of workers

Unit V JOB Analysis

Objectives of job analysis, Official writing and its need, problems in job analysis, The

process/ effectiveness of job analysis.

DATA STRUCTURE LAB

Course Code: ECS 323 Credits: 01 Write Program in C or C++ for the following:

1. Program for Stack 2. Program Queue, Circular Queue 3. Program demonstrating Stack operation 4. Program for Stack Using Linked List 5. Program for Queue Using Linked List 6. Traversing of Tree Using Linked List

7. Queue Using Array

8. Program for Tree Structure, Binary Tree, Binary Search Tree

9. Program for Heap Sort

10. Program for Quick Sort

11. Graph Implementation BFS,DFS

12. Deletion in BST 13. Insertion in BST

45

DIGITAL ELECTRONICS & DESIGN ASPECTS LAB


1. Bread-board implementation of various flip-flops.

2. Bread-board implementation of counters & shift registers.

3. Determination of Delay time and NAND, NOR, Ex-OR, AND & OR Gates.

4. Bread Board Implementation of Flip-Flops.

5. Experiments with clocked Flip-Flop.

6. Design of Counters.

7. Bread Board implementation of counters & shift registers.

8. Implementation of Arithmetic algorithms.

9. Bread Board implementation of Adder/Subtractor (Half, Full)

10. Transfer characteristics of TTL inverters & TTL Schmitt Trigger inverter.

11. Transfer characteristics of CMOS inverters series and CD40 series and

12. Estimation of Gate delay of CD40 series CMOS inverter.

13. Mono-shot multi-vibrators using 74121 and 74123.

14. Clock circuit realization using 555 and CMOS inverter and quartz crystal.

15. Adder/ subtractor operation using IC7483 4 bit/ 8 bit.

16. Demultiplexer / Decoder operation using IC-74138.

46

OBJECT ORIENTED PROGRAMMING


1. To become familiar with classes that represents entities that can interact with the

user.

2. To successfully write simple programs that involve if statements.

3. To gain practice in the use of Boolean operators like && and ||.

4. Write a program to implement 4 types of pyramid.

5. Write a new program called Options that will request that the user enter an integer

and then will display the message positive, negative or zero. If the value that was

entered was greater than zero, less than zero, or equal to zero, respectively.

6. Write a simple program implement constructor.

7. Write a program to implement inheritance.

8. Write a program to implement function overloading.

47

THEORY OF AUTOMATA AND COMPUTATION


UNIT-I

Introduction to Languages and Automata: Formal Grammars and Chomsky Hierarchy,

Regular Expression Deterministic and Nondeterministic Finite Automata, Regular

Expression, Two way Finite Automata, Finite Automata with output, Properties of regular

sets, pumping lemma for regular sets, My-Hill-Nerode Theorem.

UNIT-II

Context Free Grammars and Pushdown Automata: CFG: Formal Definition, Derivation

and Syntax trees, Simplification Forms, Ambiguous Grammar, Properties of CFL, Normal

Forms (CNF and GNF) Pushdown Automata: Definitions, Relationship between PDA and

context free language, Decision Algorithms.

UNIT-III

Turing Machine: The Turing Machine Model, Language acceptability of Turing Machine,

Design of TM, Variation of TM, Universal TM, Church„s Machine. Recursive and

recursively enumerable language, unrestricted grammars, Context Sensitive Language,

Linear Bounded Automata (LBA).

UNIT-IV

Undecidability: Turing machine halting Problem, undecidable problems for recursive

enumerable language, Post correspondence problems (PCP) and Modified Post

correspondence problems, Undecidable problems for CFL.

UNIT-V

Computability: Partial and Total Functions, Primitive Recursive functions, Recursive

functions.

Text Books:

1. Theory of Automata by K.L.P. Mishra

2. Theory of Automata by Hopcraft and Ullman

Reference Books:

1. An Introduction to Formal Languages by Peterlinz

2. Introduction to theory computation by Michaelsipser

48

DATABASE MANAGEMENT SYSTEMS

Course Code: ECS-402 Credit: 04

UNIT-I: Introduction

Concept and goals of DBMS, Database Languages, Database Users, Database Abstraction.

Basic Concepts of ER Model, Relationship sets, Keys, Mapping, Design of ER Model.

UNIT-II: Hierarchical model & Network Model

Concepts, Data definition, Data manipulation and implementation. Network Data Model,

DBTG Set Constructs, and Implementation

UNIT-III: Relational Model

Relational databases, Relational Algebra, Relational & Tuple Calculus.

UNIT-IV: Relational Database Design and Query Language

SQL, QUEL, QBE, Normalization using Functional Dependency, Multivalued dependency

and Join dependency.

UNIT-V: Concurrency Control and New Applications

Lock Based Protocols; Time Stamped Based Protocols, Deadlock Handling, and Crash

Recovery. Distributed Database, Objective Oriented Database, Multimedia Database, Data

Mining, Digital Libraries.

Text Books:

1. Data base system & concept by Korth, silbesschatz

2. Introduction to database system by Date C.J

3. Fundamental of Database system by Navathe

Reference Books:

1. Oracle & Architecture by Steve Bobrowski

2. PL/ SQL by Ivan Bayross

49

COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES Course Code: ECS 403 Credits: 04 UNIT-I

Introduction: Numbers and their accuracy, Computer Arithmetic, Mathematical preliminaries,

Errors and their Computation, General error formula, Error in a series approximation.

Solution of Algebraic and Transcendental Equation:

Bisection Method, Iteration method, Method of false position, Newton-Raphson method,

Methods of finding complex roots, Muller‟s method, Rate of convergence of Iterative methods,

Polynomial Equations. UNIT-II

Interpolation: Finite Di f ferences , Di f ference tab les Po lyno mia l Interpolation:

Newton‟s forward and backward formula Central Difference Formulae: Gauss forward and backward formula, Stirling‟s, Bessel‟s, Everett‟s formula.

Interpolation with unequal intervals: Langrange‟s Interpolation, Newton Divided difference

formula, Hermite‟s Interpolation UNIT-III

Numerical Integration and Differentiation: Introduction, Numerical differentiation Numerical Integration: Trapezoidal rule, Simpson‟s 1/3 and 3/8 rule, Boole‟s rule, Waddle‟s rule.

Solution of differential Equations: Picard‟s Method, Euler‟s Method, Taylor‟s Method,

Runge-Kutta Methods, Predictor Corrector Methods, Automatic Error Monitoring and Stability

of solution.

UNIT-IV

Statistical Computation: Frequency chart, Curve fitting by method of least squares, fitting of straight lines, polynomials, exponential curves etc, Data fitting with Cubic splines, Regression Analysis, Linear and Non linear Regression, Multiple regression, Statistical Quality Control methods.

Reference Books

1. Yang, “Applied Numerical Methods using MATLAB”, Wiley India

2. Pradip Niyogi, “Numerical Analysis and Algorithms”, TMH, 1st

Edition. 3. Gerald & Whealey, “Applied Numerical Analyses”, AW

4. Grewal B S, “Numerical methods in Engineering and Science”, Khanna Publishers,

Delhi.

5. Numerical Method Principles, analysis and algorithms ,Srimamta Pal (Oxford Higher ed) 6. Rajaraman V, “Computer Oriented Numerical Methods”, PHI, 3rd edition.

50

COMMUNICATION SYSTEMS


UNIT- I

Introduction: Communication Process, Source of Information, Communication channels,

base-band and pass-band signals, Review of Fourier transforms, Random variables, different

types of PDF, need of modulation process, primary Communication resources, analog

versus digital communications

UNIT- II

Amplitude modulation: Amplitude modulation with full carrier, suppressed carrier

systems, single side band transmission, switching Modulators, synchronous detection,

envelope detection, effect of frequency and phase errors in synchronous detection,

comparison of various AM systems, vestigial side band transmission.

UNIT- III

Angle Modulation: Narrow and wide band FM, BW calculations using Carlson rule, Direct

& Indirect FM generations, phase modulation, Demodulation of FM signals, noise reduction

using pre & de-emphasis.

UNIT- IV

Pulse Modulation: Pulse amplitude, width & position modulation, generation & detection

of PAM, PWM & PPM, Comparison of frequency division and time division multiplexed

systems, Basics of digital communications: ASK, PSK, FSK, QPSK basics & waveform

with brief mathematical Introduction.

UNIT- V

Noise: Different types of noise, noise calculations, equivalent noise band width, noise

figures, effective noise temperature, noise figure.

UNIT- VI

Introduction to Information Theory: Measurement of Information, mutual, Shannon„s

theorem, Source coding, channel coding and channel capacity theorem, Huffman code

Text Books:

1. Modern digital and analog communication system

51

2. Analog and digital communication by B.P. Lathi

3. Analog Communication by V.Chandra Sekar.

Reference Books:

Digital communication by Simon Haykin

Analog communication by Singh and Sappre

COMPUTER GRAPHICS


UNIT-I

Introduction to Graphics and Graphics Hardware System: Video display devices, CRT,

LCD Display devices Raster scan displays, Random scan displays, Raster scan systems,

Random scan Systems. Input devices, keyboard, mouse, Trackball and space ball, Joystick,

Data glove, Digitizers, Image scanners, Touch panels, Light pens, Voice systems. Hardware

devices, Printers, Plotters.

UNIT- II

Output Primitives and Clipping operations: Algorithms for drawing 2D Primitives lines

(DDA and Bresenham‟s line algorithm), circles (Bresenham‟s and Midpoint circle

algorithm), ellipses (midpoint ellipse algorithm), other curves(conic sections, polynomials

and spline curves). Antialiasing and filtering techniques. Line clipping (cohen-sutherland

algorithm), clip windows, circles, ellipses, polygon, clipping with Sutherland Hodgeman

algorithm.

UNIT-III

Geometric transformation: 2D Transformation: Basic transformation, Translation,

Rotation, scaling, Matrix Representations and Homogeneous coordinates, window to

viewport transformation.3D Concepts: Parallel projection and Perspective projection, 3 D

Transformation.

UNIT-IV

3-D Object Representation, Color models and rendering: Polygon meshes in 3 D,

Spheres, Ellipsoid, Bezier curves and Bezier surfaces, B-spline curves and surfaces, solid

modeling, sweep representation, constructive solid geometry methods. Achromatic and

color models. Shading, rendering techniques and visible surface detection method: Basic

illumination, diffuse reflect ion, specular reflection, transparency, shadows. Polygon

rendering method, Gouraud & Phong shading, Ray tracing method, recursive ray tracing,

radio-sity method. Depth-buffer method, A-buffer method, Depth-sorting Method (painter„s

algorithm), Oct-tres method.

UNIT-V

52

Introduction to multimedia: File formats for BMP, GIF, TIFF, IPEG, MPEG-II,

Animation techniques and languages. Design of animation sequences, Computer Animation

languages, Elementary filtering techniques and elementary Image Processing techniques

Text Books:

1. Computer Graphics Principles and Practice by Foley et. al 2. Computer Graphics by D. Hearn and P. Baker

Reference Books:

1. Principles of interactive computer Graphics by W. Newman and R. Sproul

2. computer Graphics by Tyagrajan

INDUSTRIAL COMMUNICATION-IV

(Problem Solving, Creative Thinking and Communication Skills)

Course Code: ASH 404 Credit Units: 02

Course Objective:

To understand the basis of interpersonal relationship

To understand the various communication style

To learn the strategies for effective interpersonal relationship

To enhance the skills needed to work in an English speaking global business environment

Course Contents:

Unit 1: A. Understanding Relationship , Medium and sources of relationship

Importance of relationship

Role and Relationship

Maintaining healthy relationship

Drafting letters /reports / minutes of

meeting/Agenda

B. Business/Tactical Language Development

Advanced grammar-Syntax, Tenses, Voices

Punctuation

Unit 2: A. Interpersonal Relationship Development

Importance of Interpersonal Relationship

Types of Interpersonal Relationship

53

Interpersonal Relationship Skills

Body Language/prescode/formal exposing skills

B. Social Communication

Building relationship through communication

Entertainment and Communication

Technical Communication

Formal/Buissness/presentational Behaviour

Unit 3: Theories of Interpersonal Relationship

Theories; Social Exchange, Uncertainty Reduction

Theory

Factors affecting Interpersonal relationship

Improving Interpersonal relationship

Media or practical layout of impressional impact

Self introspectional and exposure skills

Unit 4: Impression Management

Meaning and Components of Impression

Management

Impression Management Technique

Text & References:

Text:

Business Vocabulary in Use: Advanced, Muscull, Cambridge

Business Communication, Rodgers, Cambridge

References:

Interpersonal Communication Everyday Encounter, Julia T.Wood

3. Informative Writing,1995 1st Edn.,Goddart,Ken

54

DATABASE MANAGEMENT SYSTEMS LAB

Course Code: ECS-422 Credits: 01

Software Required: Oracle 9i

Topics covered in lab will include:

1. Database Design

2. Data Definition (SQL)

3. Data Retrieval (SQL)

4. Data Modification (SQL)

5. Views

6. Triggers and Procedures

7. PL\SQL

COMPUTER BASED NUMERICAL & STATISTICAL TECHNIQUES LAB

Course Code: ECS 423 Credits:

01

Write a program in C language:

1. To deduce error involved in polynomial equation. 2. To Find out the root of the Algebraic and Transcendental equations 3. To implement Newton‟s Forward and Backward Interpolation formula. 4. To implement Gauss Forward and Backward , Bessel‟s, Sterling‟s and

Evertt‟s Interpolation formula. 5. To implement Newton‟s Divided Difference and Lagrange‟s Interpolation formula. 6. To implement Numerical Differentiations.

To implement Numerical Integration using Trapezoidal, Simpson 1/3 and Simpson 3/8 rule.

7. To implement Least Square Method for curve fitting. 8. To draw frequency chart like histogram, frequency curve and pie-chart etc. 9. To estimate regression equation from sampled data and evaluate values of

standard deviation, t-statistics, regression coefficient, value of R2 for at least two independent variables.

55

COMMUNICATION SYSTEMS LAB


List of Experiments:

1. To study the sampling and reconstruction of a given signal.

2. To study amplitude modulation and demodulation.

3. To study frequency modulation and demodulation.

4. To study time division multiplexing.

5. To study pulse amplitude modulation.

6. To study delta and adaptive delta modulation and demodulation.

7. To study carrier modulation techniques using amplitude shift keying and Frequency shift

keying.

8. To study carrier modulation techniques using binary phase shift keying and differential

shift keying.

9. To study pulse code modulation & differential pulse code modulation as well as relevant

demodulations.

10. To study quadrature phase shift keying & quadrature amplitude modulation.

56

COMPUTER GRAPHICS LAB


Software Required: Turbo C++

Course Contents:

Assignments will be provided for the following:

1. Geometrical shapes based on graphics algorithms

2. 2D Geometric transformation translation, rotation, scaling, reflection.

3. Clipping

4. Animation

List of Experiments

1. To draw line using DDA

2. To draw line using Bresenhams line drawing algorithm

3. To draw circle using Bresenhams algorithm

4. To draw circle using mid-point circle algorithm

5. To translate a polygon along y and x axis

6. To apply scaliy on a polygon along x and y axis

7. To rotate a polygon about origin

8. Write a program to generate ellipse using mid-point algorithm

9. Write a program to implement the two dimensional transformation

10. Write a program to implement the line using Chen Sultherlocl line clipping

algorithm

57

COMPUTER NETWORKS

Course Code: ECS 501 Credit: 04

UNIT I

Introduction

Goals and Applications of Networks, Network structure and architecture, The OSI reference model,

services, Network Topology Design - Delay Analysis, Back Bone Design, Local Access Network

Design. Physical Layer Transmission Media, Switching methods, ISDN, Terminal Handling.

UNIT II

Medium Access sub layer

Channel Allocations, LAN protocols - ALOHA protocols - Overview of IEEE standards - FDDI.

Data Link Layer - Elementary Data Link Protocols, Sliding Window protocols, Error Handling.

UNIT III

Network Layer

Point - to Pont Networks, routing, Congestion control, Internetworking -TCP / IP - IP packet, IP

address, IPv6.

UNIT IV

Transport Layer

Transport Layer Design issues, connection management, Session Layer-Design issues, remote

procedure call. Presentation Layer-Design issues, Data compression techniques, Cryptography, TCP

- Window Management.

UNIT V

Application Layer

File Transfer Protocol, Access and Management, Electronic mail, Virtual Terminals, Other

application, Example of Networks - Internet and Public Networks.

References:

1. Forouzen, "Data Communication and Networking", TMH

2. A.S. Tanenbaum, “Computer Networks”, 3rd Edition, Prentice Hall India, 1997.

3. S. Keshav, “An Engineering Approach on Computer Networking”, Addison Wesley,

1997

4. W. Stallings, “Data and Computer Communication”, Macmillan Press, 1989.

58

ANALYSIS AND DESIGN OF ALGORITHMS


UNIT I

Introduction Algorithm Design paradigms - motivation, concept of algorithmic efficiency, run time

analysis of algorithms, Asymptotic Notations. Recurrences- substitution method, recursion tree

method, master method.

UNIT II

Divide and Conquer Structure of divide-and-conquer algorithms: examples; Binary search, quick

sort, Merge sort, Strassen Multiplication; Analysis of divide and conquer run time recurrence

relations. Greedy Method : Overview of the greedy paradigm examples of exact optimization

solution (minimum cost spanning tree), Approximate solution (Knapsack problem), Single source

shortest paths, Traveling Salesman Problem.

UNIT III

Dynamic Programming Overview, difference between dynamic programming and divide and

conquer, Applications: Shortest path in graph, chain Matrix multiplication, Traveling salesman

Problem, longest Common sequence, knapsack problem.

UNIT IV

Graph Searching and Traversal Overview, Representation of graphs, strongly connected

components, Traversal methods (depth first and breadth first search). Back tracking : Overview, 8-

queen problem, and Knapsack problem. Branch and Bound : LC searching Bounding, FIFO branch

and bound, LC branch and bound application: 0/1 Knapsack problem, Traveling Salesman Problem

UNIT V

Computational Complexity

Complexity measures, Polynomial vs non-polynomial time complexity; NP-hard and NP-complete

classes, examples.

Text Books & References Books:

1. E. Horowitz, S. Sahni, and S. Rajsekaran, ―Funadmentals of Computer Algorithms, Galgotia

Publication.

2. T. H. Cormen, Leiserson, Rivest and Stein, ―“Introduction of Computer algorithm”,

3. Sara Basse, A. V. Gelder, ―“Computer Algorithms”, Addison W.

4. J.E Hopcroft, J.D Ullman, ―“Design and analysis of algorithms”.

59

COMPUTER ARCHITECTURE AND ORGANISATION


UNIT I

Register Transfer Language

Register Transfer, Bus and Memory Transfers, Arithmetic Micro-operations, Logic Micro-

operations, Shift Micro-operations, Arithmetic Logic shift UNIT-.

UNIT II

Basic Computer Organizations and Design

Instruction Codes, Computer Registers, Computer Instructions, Timing and Control,

Instruction Cycle, Memory-Reference Instructions, Input-Output and Interrupt, Design of

Accumulator Logic. Hardwired and Microprogrammed control: Control Memory, Address

Sequencing, Design of Control UNIT-.

UNIT III

Central Processing

Introduction, General Register Organization, Stack Organization, Instruction representation,

Instruction Formats, Instruction type, Addressing Modes, Data Transfer and Manipulation,

Program Control, Reduced Instruction Set Computer RISC and CISC.

Computer Arithmetic: Introduction, Multiplication Algorithms, Division Algorithms,

Floating-Point Arithmetic Operations.

UNIT IV

Memory and Intra-system Communication and Input output organization

Memory: Memory types and organization Memory Hierarchy, Main Memory, Auxiliary

Memory, Associative Memory, Cache Memory, Virtual Memory, Memory Management

Hardware. Intra-system communication and I/O: Peripheral Devices, Input-Output.

Controller and I/O driver, IDE for hard disk, I/O port and Bus concept, Bus cycle,

Synchronous and asynchronous transfer, Interrupt handling in PC, Parallel Port, RS – 232

interface, Serial port in PC, Serial I/O interface, Universal serial bus IEEE 1394, Bus

Arbitration Techniques, Uni-bus and multi-bus architectures EISA Bus, VESA Bus.

UNIT V

Pipelining, Vector Processing and Multiprocessors

60

Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline,

Vector Processing, Array Processors.

Multiprocessors: Characteristics of Multiprocessors, Interconnection Structures,

Interprocessor Arbitration, Interprocessor Communication and Synchronization, Advanced

computer architecture, Pentium and Pentinum –Pro, Power PC Architecture.

Text Books & References Books:

1. Morris Mano, Computer System Architecture, 3rd Edition – 1999, Prentice-Hall of India

Private Limited.

2. Harry & Jordan, Computer Systems Design & Architecture, Edition 2000, Addison

Wesley, Delhi.

3. WIliam Stallings, Computer Organization and Architecture, 4th Edition-2000, Prentice-

Hall of India Private Limited.

4. Kai Hwang-McGraw-Hill, Advanced Computer Architecture.

5. Kai Hwang & Faye a Briggs, McGrew Hill, inc., Computer Architecture & Parallel

Processing.

6. John D. Carpinelli, Computer system Organization & Architecture, Edition 2001,

Addison Wesley, Delhi

7. John P Hayes, McGraw-Hill Inc, Computer Architecture and Organization.

8. M. Morris Mano and Charles, Logic and Computer Design Fundamentals, 2nd Edition

Updated, Pearson Education, ASIA.

9. Hamacher, ―“Computer Organization”, McGraw hill.

10. Tennenbaum,. “Structured Computer Organization”,. PHI

11. B. Ram, ―“Computer Fundamentals architecture and organization”, New age

international Gear C. w., ―“Computer Organization and Programming”, McGraw hill.

61

SOFTWARE ENGINEERING


UNIT I

Introduction Software life cycle models: Waterfall, Prototype,Evolutionary and Spiral

models, Overview of Quality Standards like ISO 9001, SEI-CMM.

UNIT II

Software Metrics and Project Planning Size Metrics like LOC, Token Count, Function

Count, Design Metrics, Data Structure Metrics, Information Flow Metrics. Cost estimation,

static, Single and multivariate models, COCOMO model, Putnam Resource Allocation

Model, Risk management.

UNIT III

Software Requirement Analysis, design and coding Problem Analysis, Software

Requirement and Specifications, Behavioural and non-behavioural requirements, Software

Prototyping Cohesion & Coupling, Classification of Cohesiveness & Coupling, Function

Oriented Design, Object Oriented Design, User Interface Design Top-down and bottom-up

Structured programming, Information hiding.

UNIT IV

Software Reliability, Testing and Maintenance Failure and Faults, Reliability Models:

Basic Model, Logarithmic Poisson Model, Software process, Functional testing: Boundary

value analysis, Equivalence class testing, Decision table testing, Cause effect graphing,

Structural testing: path testing, Data flow and mutation testing, UNIT- testing, integration

and system testing, Debugging, Testing Tools, & Standards. Management of maintenance,

Maintenance Process, Maintenance Models, Reverse Engineering, Software RE-

engineering.

UNIT V

UML: Introduction to UML, Use Case Diagrams, Class Diagram: State Diagram in UML

Activity Diagram in UML. Sequence Diagram in UML Collaboration Diagram in UML

Text Books:

1. K. K. Aggarwal & Yogesh Singh, .Software Engineering., 2nd Ed, New Age

International, 2005.

2. R. S. Pressman, ―Software Engineering – A practitioner„s approach‖, 5th Ed., McGraw

Hill Int. Ed., 2001.

3. R. Fairley, ―“Software Engineering Concepts”, Tata McGraw Hill, 1997.

62

4. P. Jalote, .An Integrated approach to Software Engineering., Narosa, 1991.

5. Stephen R. Schach, .Classical & Object Oriented Software Engineering., IRWIN,

1996.,James Peter, W. Pedrycz, ―“Software Engineering”, John Wiley & Sons.

INDUSTRIAL COMMUNICATION-V


Objective – The Module provide the ways and means of enhancing innovative ideas and

providing solutions and enhance employability.

Unit -1: Soft Skills & hard skills

Introduction

Soft skills & Hard skills difference

What is Mentoring

Soft skills at Work place

Unit -2: Resume Designing

What is a Resume?

Types of Resumes

Writing of resumes

Unit – 3: Interview Preparation

Interview tips

Common Interview Questions

Enhancing employability

Training & Grooming

Unit -4: English Literature

Nectar in Sieve – Kamala Markandaya (Novel )

“Purdah” - Silvia Plath (Modern English Poetry)

Hope is the thing with feathers – Dickenson (American Literature)

63

COMPUTER NETWORKS LAB

Course Code: ECS 521 Credit Units: 01

Equipments Required:

Switch Network Cables, Patch Chord- Fiber optical and twisted pair cable, LAN cards, RJ-

45 connectors etc.

Platforms required: Linux Server.

Course Contents:

Introduction and Installation of Linux

Administrating Linux

Setting up a Local Area Network

Connecting to the Internet

Setting up Print Server

Setting up File Server

Setting up Mail Server

Setting up FTP Server

Setting up Web Server

Setting up MySQL Database Server

64

ANALYSIS AND DESIGN OF ALGORITHMS LAB


Programming Language: C/C++

List of Programs:

1. Programs for binary search and Quick backtracking.

2. Programs on algorithm based on Brach and sort by using divide and conquer techniques.

3. Programs on algorithm based on greedy method.

4. Programs on algorithm based on Dynamic programming.

5. Programs on Depth First and Breadth Search traversals of graphs.

6. Programs on algorithm based on Bound.

65

SOFTWARE ENGINEERING LAB


Software Required: Rational Rose

Assignments will be provided for the following:

1. Use of Rational Rose for visual modeling.

2. Creating various UML diagrams such as use case, sequence, collaboration, activity, state

diagram, and class diagrams.

66

COMPILER CONSTRUCTION


UNIT I

Introduction

Definition, functions of Compiler in Linux / Unix / TC etc environments, other associated

terms e.g. Text formatter, Text Editors, Phases and Passes, FSM & RE„s and their

application to Lexical Analysis, Implementation of Lexical Analyzers, Lexical- Analyzer

Generator, Lex – Compiler including case study, Formal Grammar and their application to

Syntax Analysis, BNF Notation, YACC including case study. The Syntactic specification of

Languages: CFG, Derivation and Parse Trees, Capabilities of CFG.

UNIT II

Basic Parsing Techniques

Parsers, Shift Reduce Parsing, Operator precedence parsing, top-down Parsing, Predictive

Parsers.

UNIT III

Automatic Construction of efficient Parsers

LR Parsers, the canonical collection of LR(0) items, constructing SLR Parsing Tables,

Constructing canonical LR Parsing tables and LALR parsing tables, An Automatic

Parser Generator, Implementation of LR parsing Tables, Constructing LALR sets of items.

UNIT IV

Syntax Directed Translation

Syntax directed Translation Schemes, Implementation of Syntax directed translators,

Intermediate Code, Postfix notation, Parse Trees and Syntax Trees, Three address Code,

Quadruple & Triples, Translation of Assignment Statements, Boolean expressions,

Control Statements, Postfix Translation, Translation with a Top Down Parser, Array

references in Arithmetic expressions, Procedure Calls, Declarations and Case statements

Translations.

Symbol Tables: Data structure for symbols tables, representing scope information. Run-

Time Administration: Implementation of simple stack allocation scheme, storage allocation

in block structured language.

UNIT V

67

Error detection and Recovery: Lexical phase errors, syntax phase errors, semantic errors

Code Optimization: Loop optimization, the DAG representation of basic blocks, value

numbers and Algebraic Laws, Global Data – Flow Analysis.

Text Books:

1. Alfread V. Aho, Ravi Sethi & J.D. Ullman, ―Compiler Design, Addison Wesley

2. Ullman, Principles of Compiler Design, Narosa publications.

3. K. C. Louden, “Compiler Construction, Principle and Practice” Thomson Books, 2006

4. Alfred V. Aho, Ravi Sethi & Jeffrey D. Ullman, “Compilers Priciples, Techniques &

Tools”. Pearson, 1998.

5. Levine, Mason, and Brown, “Lex & Yacc”, O‟ Reilly, 1998.

Reference Books:

1. D.M. Dhamdhere, Compiler Construction – Principles & Practice., Macmillan India

2. Holub, ―Compiler Design in C, PHI. Tremblay K.P & Sorenson P.G., ―The Theory

and practice of Compiler writing McGraw Hill

3. S. S. Muchnick Harcourt Asra, “Advanced Compiler Design implementation”, Morgan

Kaufman, 2006.

4. Allen, “Modern Compiler Implementation in C”, Cambridge Uty. Press 1997

5. Alan Holub, “Compiler Design in C”, PHI, 2004.

6. Vinu V. Das, “Compiler Design using FLEX and YACC” PHI, 2005

68

INTRODUCTION TO MICROPROCESSOR


UNIT-I

Introduction to Microcomputer Systems: Introduction to Microprocessors and microcomputers,

Study of 8 bit Microprocessor, 8085 pin configuration, Internal Architecture and operations,

interrupts, Stacks and subroutines, various data transfer schemes.

UNIT-II

ALP and Timing Diagrams: Introduction to 8085 instruction set, advance 8085 programming,

Addressing modes, Counters and time Delays, Instruction cycle, machine cycle, T-states, timing

diagram for 8085 instruction.

UNIT-III

Memory System Design & I/O Interfacing: Interfacing with 8085.Interfacing with input/output

devices (memory mapped, peripheral I/O), Cache memory system. Study of the following peripheral

devices 8255, 8253, 8257, 8255, 8251.

UNIT-IV

Architecture of 16-Bit Microprocessor: Difference between 8085 and 8086, Block diagram and

architecture of 8086 family, pin configuration of 8086, Minimum mode & Maximum mode

Operation. Internal architecture of 8086, Bus Interface Unit, Register Organization, Instruction

Pointer, Stack & Stack pointer, merits of memory segmentation, Execution Unit, Register

Organization.

UNIT-V

Pentium Processors: Internal architecture of 8087, Operational overview of 8087, Introduction to

80186, 80286, 80386 & 80486 processors, Pentium processor.

Text Books:

1. Ramesh. S. Gaonkar, ―“Microprocessor architecture Programming and Application with 8085”

Penram International Publishing, 4th Edition

2. B. Ram, ―“Fundamentals of microprocessors and microcomputer” Dhanpat Rai, 5th Edition.

Reference Books:

1. M. Rafiquzzaman, ―“Microprocessor Theory and Application” PHI – 10th Indian Reprint.

2. Naresh Grover, ―“Microprocessor comprehensive studies Architecture, Programming and

Interfacing” Dhanpat Rai, 2003.

69

ARTIFICIAL INTELLIGENCE


UNIT I

INTRODUCTION TO ARTIFICIAL INTELLIGENCE

Basic concept of artificial intelligence (AI), history of AI, AI and consciousness, weak and

strong AI, comparison of computer and human skills, practical systems based on AI,

Development of logic, Components of AI.

UNIT II

PROBLEM SOLVING THROUGH AI

Defining problem as state space search, analyzing the problem, representing the problems

from AI viewpoint, Production system, characteristics of production system, algorithm for

problem solving using AI technique.

UNIT III

SEARCH TECHNIQUES

Use of search in AI problem solution, blind search techniques, heuristic search techniques,

concept of heuristic knowledge, Types of heuristic search techniques: generate and test,

best first search, problem reduction using AND – OR graph, local search technique, branch

and bound search, memory bounded search technique, local beam search, properties of

heuristic search techniques, overestimation and under-estimation of heuristic function, hill

climbing search, simulated annealing search, constraint satisfaction, means ends analysis.

UNIT IV

INTRODUCTION TO LOGIC

Introduction, propositional calculus, syntax of propositional calculus, semantics of

propositional calculus, well-formed formula, properties of statements, inferencing of

propositional logic.

Predicate logic: syntax of predicate logic, semantics of predicate logic, representation of

facts First Order Predicate Logic (FOPL), concept of resolution, resolution algorithm, Types

of resolution, unit resolution, binary resolution, Forward chaining & Backward chaining.

UNIT V

LEARNING & BASICS OF SOFT COMPUTING

70

Learning: An Introduction, Types of learning. Supervised, Unsupervised & reinforced

learning.

Introduction to soft computing: Definition, goals and importance. Fuzzy Computing:

Classical set theory, crisp & non- crisp sets. Neural Network: Biological model, Information

flow in neural cell. Genetic Algorithm. Applications of AI

Reference books:

1. Artificial Intelligence, Elaine Rich & Kevin Knight: Tata McGraw-Hill

2. Artificial intelligence, Russell and Norvig, Prentice Hall Publication

3. Artificial Intelligence, Ela Kumar, I. K. International Publishing House

DATA WAREHOUSING AND DATA MINING


UNIT I

Data Warehousing: An Introduction to data ware housing and characteristics of a data

warehouse, various aspects of data marts.

On Line Analytical processing: OLTP and OLAP systems, Data Modeling, OLAP Tools,

web OLAP, Decision support system.

UNIT II

Developing a Data Ware house: Architectural strategies and Organization Issues, Design

Considerations, Tools for Data Warehousing, crucial decisions in designing a Data Ware

house using ORACLE 8i / SQL server.

UNIT III

Data Mining: From Data ware housing to Data Mining, Objectives of Data Mining, the

Business context for Data mining, Process improvement, marketing and Customer

Relationship Management (CRM), the Technical context for Data Mining, machine

learning, decision support and computer technology.

UNIT IV

Data Mining Techniques and Algorithms: Process of data mining, Algorithms, Data base

segmentation or clustering, predictive modeling, Link Analysis, Data Mining Techniques,

Automatic Cluster Detection, Decision trees and Neural Networks.

UNIT V

71

Data Mining Environment: Case studies in building business environment, Application of

data ware housing and Data mining in Government, National Data ware houses and case

studies.

Text Books:

1. “Mastering Data Mining: The Art and Science of Customer Relationship Management”,

by Berry and Lin off, John Wiley and Sons, 2001.

2. “Data Ware housing: Concepts, Techniques, Products and Applications”, by C.S.R.

Prabhu, Prentice Hall of India, 2001.

Reference Books:

1. “Data Mining: Concepts and Techniques”, J.Han, M.Kamber, Academic Press, Morgan

Kanf man Publishers, 2001.

2. “Data Mining”, by Pieter Adrians, Dolf Zantinge, Addison Wesley, 2000.

3. “Data Mining with Microsoft SQL Server”, by Seidman, Prentice Hall of India, 2001.

4.

WEB TECHNOLOGY


UNIT I

Introduction to Web: History of Web, Introduction and Web Development Strategies,

protocols governing the web, web applications, web project, web team, Planning and

Process Development.

UNIT II

Web Page Designing: HTML: list, table, images, frames, forms, CSS; Introduction to

SGML – features – XML, XML as a subset of SGML –HTML vs XML

XML: Views of an XML document – simple XML documents, Starting & Ending of Tags,

Attributes of Tags, Entity References, Comments, Document type definition, XML

schemes, Object Models, Presenting XML;

Processors: DOM and SAX.

UNIT III

Client-Side Programming: Java Beans: Introduction to Java Beans, Advantage,

Properties, Introduction to EJB, Java Beans API;

Java script: Introduction, documents, forms, statements, functions, objects; Event and event

handling; introduction to AJAX, VB Script & PHP

UNIT IV

72

Server Side Programming: Introduction to Servlets, Lifecycle, JSDK, Servlet API,

Introduction to active server pages (ASP), ASP.NET, java server pages (JSP), JSP

application design, tomcat server, JSP objects, declaring variables and methods, debugging,

sharing data between JSP pages, Session, introduction to COM/DCOM.

UNIT V

Database Connectivity: Database Programming using JDBC, Studying Javax.sql.*package,

Application-specific, Database Action, Developing Java Beans in a JSP page, Introduction

to Struts framework.

Reference Books:

1. Xavier, C, “ Web Technology and Design” , New Age International

2. Deitel, “Java for programmers”, Pearson Education

3. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication.

4. Ramesh Bangia, “Internet and Web Design” , New Age International

5. Jackson, “Web Technologies” Pearson Education

6. P.K. Subramnium “Web Technology” Technical publication.

Text Books:

I. Jacobson, “Object-Oriented Software Engineering: A Use Case Driven

Approach”, Pearson, 1992

B. Breugge and A. H. Dutoit, “Object Oriented Software Engineering: Using UML,

Patterns, and Java”, Prentice Hall, 2004.

G. Booch, J. Rumbaugh and I. Jacboson, “The Unified Modeling Language User

Guide” Addison-Wesley, 2005

INDUSTRIAL COMMUNICATION-VI


Objective – This Module is a combination of Technical paper writing and literature

features

Unit -1: Reports

Types of Reports

Significance of Reports

Structure & Style

Report writing

73

Exercise

Unit – 2: Proposals & Technical Paper

Types of proposals

Writing of proposals

Technical paper

Unit-3: Dissertation & Thesis

Abstract

Synopsis

Dissertation

Thesis

Features of Thesis

Methods & Writing

Unit -4: English literature

Arms and the man - George Bernard Shaw (Drama)

All things will die – Lord Alfred Tennyson (Poem)

The Flower - – Lord Alfred Tennyson (Poem)

74

COMPILER CONSTRUCTION LAB


Programming Language: C/C++

List of Programs:

1. WAP to check whether string is accepted or not for entered grammar.

2. WAP to convert Infix to Postfix notation.

3. WAP to convert Infix to Prefix notation.

4. WAP to convert Regular Expression to NFA.

5. WAP to convert NFA to DFA.

6. WAP to calculate LEADING and TRAILING of a grammar.

7. WAP calculate FIRST and FOLLOW of a grammar.

8. WAP to implement shift reduce parser.

9. WAP to implement top down parser.

75

MICROPROCESSOR LAB

Course Code: ECS 622 Credits:

01

List of Experiments

1. To study 8085 microprocessor System.

2. To study 8086 microprocessor System.

3. To develop and run a programme to find out largest and smallest number.

4. To develop and run a programme for converting temperature from F to C degree.

5. To develop and run a programme to compute square root of a given number.

6. To develop and run a programme for computing ascending/descending order of a

number.

7. To perform interfacing of RAM chip to 8085/8086.

8. To perform interfacing of keyboard controller.

9. To perform interfacing of DMA controller.

10. To perform interfacing of UART/USART.

76

ARTIFICIAL INTELLIGENCE PROGRAMMING LAB


Software Required: PROLOG


1. Introduction to Prolog.

2. Write simple fact for following.

3. Write simple queries for following facts.

4. Write compound query for Cat and Fish problem.

5. Write predicates for following facts.

6. Write predicates one converts centigrade temperatures to Fahrenhit.

7. Write a prolog program for factorial recursion.

8. Write a program for implementation of a given tree.

9. Write a prolog program to find length of a given list.

10. Write a program to solve the Monkey Banana Problem.

77

WEB TECHNOLOGY LAB



1. Create Web Page and apply some block level tags, text level tags

2. Create Web Page and apply background color, text color, horizontal rules and special

characters.

3. Create Web Page and include Ordered list, Unordered list, Definite list and Nested list.

4. Create Web Page and include links to

a) Local page in same folder.

b) Page in different folder

c) Page on the Web

d) Specific location within document

5. Create Web Page and include images with different alignment and wrapped text

6. Create tables and format tables using basic table tags and different attributes.

7. Create a frameset that divides browser window into horizontal and vertical framesets.

8. Develop and demonstrate a XHTML document that illustrates the use external style

sheet, ordered list, table, borders, padding, color, and the <span> tag.

Develop and demonstrate a XHTML file that includes Javascript script for the

following problems:

a) Input : A number n obtained using prompt

b) Output : The first n Fibonacci numbers

c) Input : A number n obtained using prompt

d) Output : A table of numbers from 1 to n and their squares using alertClass Diagram

9. Design an XML document to store information about a student in an engineering

college affiliated to VTU.

The information must include USN, Name, Name of the College, Brach, Year of

Joining, and e-mail id. Make up sample data for 3 students. Create a CSS style sheet

and use it to display the document.

Activity Diagram

78

CRYPTOGRAPHY & NETWORK SECURITY


UNIT-I

Introduction to security attacks and its Mitigation Techniques, services and mechanism,

Classical encryption techniques substitution ciphers and transposition ciphers, Hill Ciphers,

cryptanalysis, steganography, Stream and block ciphers. Modern Block Ciphers: Block

ciphers principles, Shannon‟s theory of confusion and diffusion, Fiestal structure, Data

encryption standard (DES), Strength of DES, Idea of differential cryptanalysis, block cipher

modes of operations, Triple DES

UNIT-II

Introduction to group, field, finite field of the form GF(p), modular arithmetic, prime and

relative prime numbers, Extended Euclidean Algorithm, Advanced Encryption Standard

(AES) encryption and decryption Fermat‟s and Euler‟s theorem, Primarily testing, Chinese

Remainder theorem, Discrete Logarithmic Problem, Principals of public key crypto systems,

RSA algorithm, security of RSA

UNIT-III

Message Authentication Codes: Authentication requirements, authentication functions,

message authentication code, hash functions, birthday attacks, security of hash functions,

secure hash algorithm (SHA).

Digital Signatures: Digital Signatures, Elgamal Digital Signature Techniques, Digital

signature standards (DSS), proof of digital signature algorithm,

UNIT-IV

Key Management and distribution: Symmetric key distribution, Diffie-Hellman Key

Exchange, Public key distribution, X.509 Certificates, Public key Infrastructure.

Authentication Applications: Kerberos Electronic mail security: pretty good privacy (PGP),

S/MIME.

UNIT-V

IP Security: Architecture, Authentication header, Encapsulating security payloads,

combining security associations, key management. Introduction to Secure Socket Layer,

Secure electronic, transaction (SET) System Security: Introductory idea of Intrusion,

Intrusion detection, Viruses and related threats, firewalls

References Books:

1. William Stallings, “Cryptography and Network Security: Principals and Practice”,

2. Pearson Education.

3. Mahtab Alam: “Information Security and Cryptography”, BOOKSHELF

79

4. Bruce Schiener, “Applied Cryptography”. John Wiley & Sons

5. Bernard Menezes,” Network Security and Cryptography”, Cengage Learning.

6. Atul Kahate, “Cryptography and Network Security”, TMH

80

SOFTWARE PROJECT MANAGEMENT


UNIT-I

Introduction and Software Project Planning

Fundamentals of Software Project Management (SPM), Need Identification, Vision and

Scope document, Project Management Cycle, SPM Objectives, Management Spectrum,

SPM Framework, Software Project Planning, Planning Objectives, Project Plan, Types of

project plan, Structure of a Software Project Management Plan, Software project estimation,

Estimation methods, Estimation models, Decision process.

UNIT-II

Project Organization and Scheduling

Project Elements, Work Breakdown Structure (WBS), Types of WBS, Functions, Activities

and Tasks, Project Life Cycle and Product Life Cycle, Ways to Organize Personnel, Project

schedule, Scheduling Objectives, Building the project schedule, Scheduling terminology

and techniques, Network Diagrams: PERT, CPM, Bar Charts: Milestone Charts, Gantt

Charts.

UNIT-III

Project Monitoring and Control

Dimensions of Project Monitoring & Control, Earned Value Analysis, Earned Value

Indicators: Budgeted Cost for Work Scheduled (BCWS), Cost Variance (CV), Schedule

Variance (SV), Cost Performance Index (CPI), Schedule Performance Index (SPI),

Interpretation of Earned Value Indicators, Error Tracking, Software Reviews, Types of

Review: Inspections, Deskchecks, Walkthroughs, Code Reviews, Pair Programming.

UNIT-IV

Software Quality Assurance and Testing

Testing Objectives, Testing Principles, Test Plans, Test Cases, Types of Testing, Levels of

Testing, Test Strategies, Program Correctness, Program Verification & validation, Testing

Automation & Testing Tools, Concept of Software Quality, Software Quality Attributes,

Software Quality Metrics and Indicators, The SEI Capability Maturity Model CMM), SQA

Activities, Formal SQA Approaches: Proof of correctness, Statistical quality assurance,

Cleanroom process.

UNIT-V

Project Management and Project Management Tools

81

Software Configuration Management: Software Configuration Items and tasks, Baselines,

Plan for Change, Change Control, Change Requests Management, Version Control, Risk

Management: Risks and risk types, Risk Breakdown Structure (RBS), Risk Management

Process: Risk identification, Risk analysis, Risk planning, Risk monitoring, Cost Benefit

Analysis, Software Project Management Tools: CASE Tools, Planning and Scheduling

Tools, MS-Project.

Reference Books:

1. M. Cotterell, Software Project Management, Tata McGraw-Hill Publication.

2. Royce, Software Project Management, Pearson Education

3. Kieron Conway, Software Project Management, Dreamtech Press

4. S. A. Kelkar, Software Project Management, PHI Publication.

82

CLOUD COMPUTING


UNIT I

Introduction: Cloud-definition, benefits, usage scenarios, History of Cloud Computing -

Cloud Architecture- Types of Clouds - Business models around Clouds – Major Players in

Cloud Computing- issues in Clouds - Eucalyptus - Nimbus - Open Nebula, Cloud Sim.

UNIT II

Cloud Services, Types of Cloud services: Software as a Service-Platform as a Service –

Infrastructure as a Service, Database as a Service - Monitoring as a Service –

Communication as services. Service providers- Google, Amazon, Microsoft Azure, IBM,

Sales force.

UNIT III

Collaborating Using Cloud Services, Email Communication over the Cloud - CRM

Management - Project Management-Event, Management - Task Management – Calendar -

Schedules - Word Processing – Presentation– Spreadsheet - Databases – Desktop - Social

Networks and Groupware.

UNIT IV

Virtualization For Cloud, Need for Virtualization – Pros and cons of Virtualization – Types

of Virtualization –System Vm, Process VM, Virtual Machine monitor – Virtual machine

properties - Interpretation and binary, translation, HLL VM - Hypervisors – Xen, KVM ,

VMWare, Virtual Box, Hyper-V.

UNIT V

Security, Standards And Applications, Security in Clouds: Cloud security challenges –

Software as a Service Security, Common, Standards: The Open Cloud Consortium – The

Distributed management Task Force – Standards, for application Developers – Standards for

Messaging – Standards for Security, End user access, to cloud computing, Mobile Internet

devices and the cloud.

Text Books:

1. John Rittinghouse & James Ransome, Cloud Computing, Implementation, Management

83

and Strategy, CRC Press, 2010.

2. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You

Work and Collaborate Que Publishing, August 2008.

3. James E Smith, Ravi Nair, Virtual Machines, Morgan Kaufmann Publishers, 2006.

REFERENCES:

1. David E.Y. Sarna Implementing and Developing Cloud Application, CRC press 2011.

2. Lee Badger, Tim Grance, Robert Patt-Corner, Jeff Voas, NIST, Draft cloud computing

synopsis and recommendation, May 2011.

3. Anthony T Velte, Toby J Velte, Robert Elsenpeter, Cloud Computing : A Practical

Approach, Tata McGraw-Hill 2010.

4. Haley Beard, Best Practices for Managing and Measuring Processes for On-demand

Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited.

84

MOBILE COMPUING


UNIT-I

Introduction, issues in mobile computing, overview of wireless telephony: cellular concept,

GSM: air-interface, channel structure, location management: HLR-VLR, hierarchical,

handoffs, channel allocation in cellular systems, CDMA, GPRS.

UNIT-II

Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth,

Wireless multiple access protocols, TCP over wireless, Wireless applications, data

broadcasting, Mobile IP, WAP: Architecture, protocol stack, application environment,

applications.

UNIT-III

Data management issues, data replication for mobile computers, adaptive clustering for

mobile wireless networks, file system, disconnected operations.

UNIT-IV

Mobile Agents computing, security and fault tolerance, transaction processing in mobile

computing environment.

UNIT-V

Ad-hoc networks, localization, MAC issues, Routing protocols, global state routing (GSR),

Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad

Hoc on demand distance vector routing (AODV), Temporary ordered routing algorithm

(TORA), QoS in Ad Hoc Networks, applications.

Reference Books:

1. J. Schiller, Mobile Communications, Addison Wesley.

2. Charles Perkins, Mobile IP, Addison Wesley.

3. Charles Perkins, Ad hoc Networks, Addison Wesley.

4. Upadhyaya, “Mobile Computing”, Springer.

85

INDUSTRIAL COMMUNICATION-VII

Course Code: ASH-704 Credits: 2 UNIT I: Dynamics of Group Discussion

Methodology of G.D

Role of a Leader in Group Discussion,

Functions of Group Discussion;

Mannerism and Guidelines for effective Group Discussion. UNIT II: Communication through Electronic Channels

Technology based Communication Tools,

Video Conferencing and Web Conferencing

Selection of the Effective Tool for Communication Purpose, E-mails, etc. UNIT III: Effective Public Speaking

Types and Essentials in Public Speaking ;

Dos and Don„ts in Public Speaking

Stage Fright and ways to overcome it. Textbooks/References: 1. Jermy Comfort, Speaking effectively, et.al, Cambridge

2. Krishnaswamy, N, Creative English for Communication, Macmillan 3. Raman-Prakash, Business Communication, Oxford.

4. Taylor, Conversation in Practice, Tata McGraw-Hill Education

86

CRYPTOGRAPHY AND NETWORK SECURITY LAB


List of Programs in WAP in C to implement RSA Algorithm.

1. Program WAP in C++ using Ceaser Cipher

2. WAP in C using Transposition Cipher

3. WAP in C to encrypt 64-bit text using DES algorithm

4. Program using RABIN MILER Algorithm

5. Write a C program for Extended Euclid Theorem

6. WAP in C to encrypt 64-bit text using DES algorithm

87

SOFTWARE PROJECT MANAGEMENT LAB


List of Experiments

1. Defining the problem statement of Global Positioning System.

2. To construct 0, 1 level DFD of GPS system

3. To construct E-R Diagram of GPS System

4. Write the Software Requirement of Specification of GPS System

5. To Construct Use Case Diagram of GPS System.

6. To Construct Class Diagram for GPS system.

7. To Construct Transition Diagram of GPS System

8. To Construct Collaboration Diagram of GPS System.

9. To Construct Sequence Diagram of GPS System.

10. Write the Program to calculate the project total cost

88

DISTRIBUTED SYSTEM Course Code: ECS 801 Credit Units: 04

Unit–I

Characterization of Distributed Systems: Introduction, Examples of distributed Systems,

Resource sharing and the Web Challenges. Architectural models, Fundamental Models.

Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of

global clock, shared memory, Lamport‟s & vectors logical clocks.

Concepts in Message Passing Systems: causal order, total order, total causal order,

Techniques for Message Ordering, Causal ordering of messages, global state, and termination

detection.

unit-II

Distributed Mutual Exclusion: Classification of distributed mutual exclusion, Requirement of

mutual exclusion theorem, Token based and non-token based algorithms, performance metric

for distributed mutual exclusion algorithms.

Distributed Deadlock Detection: system model, resource vs communication deadlocks,

deadlock prevention, avoidance, detection & resolution, centralized dead lock detection,

distributed dead lock detection, path pushing algorithms, edge chasing algorithms.

Unit–III

Agreement Protocols: Introduction, System models, classification of Agreement Problem,

Byzantine agreement problem, Consensus problem, Interactive consistency Problem, Solution to

Byzantine Agreement problem, Atomic Commit in Distributed Database system.

Distributed Resource Management: Issues in distributed File Systems, Mechanism for

building of Distributed Shared Memory.

Unit–IV

Failure Recovery in Distributed Systems: Concepts in Backward and Forward recovery,

Recovery in Concurrent systems, Obtaining consistent Checkpoints, Recovery in Distributed

Database Systems.

Fault Tolerance: Issues in Fault Tolerance, Commit Protocols, Voting protocols, Dynamic

voting protocols.

Unit –V

Transactions and Concurrency Control: Transactions, Nested transactions, Locks, Optimistic

Concurrency control,

Distributed Transactions: Flat and nested distributed transactions, Atomic Commit protocols,

Concurrency control in distributed group communication, transactions, Distributed deadlocks,

Transaction recovery.

References: 1. Singhal & Shivaratri, "Advanced Concept in Operating Systems", McGraw Hill

2. Ramakrishna,Gehrke,” Database Management Systems”, Mc Grawhill

3. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design”, Pearson

Education

4. Tenanuanbaum, Steen,” Distributed Systems”, PHI

5. Gerald Tel, "Distributed Algorithms", Cambridge University Press.

89

ELECTIVE - I

COMPUTATIONAL GEOMETRY Course Code: ECS 071 Credit Units: 04

UNIT-I

Convex hulls: construction in 2d and 3d, lower bounds; Triangulations: polygon

triangulations, representations, point-set triangulations, planar graphs;

UNIT-II

Voronoi diagrams: construction and applications, variants; Delayney triangulations: divide-

and-conquer, flip and incremental algorithms, duality of Voronoi diagrams, min-max angle

properties;

UNIT-III

Geometric searching: point-location, fractional cascading, linear programming with prune

and search, finger trees, concatenable queues, segment trees, interval trees; Visibility:

algorithms for weak and strong visibility, visibility with reflections, art-gallery problems;

UNIT-IV

Arrangements of lines: arrangements of hyper planes, zone theorems, many-faces

complexity and algorithms; Combinatorial geometry: Ham-sandwich cuts.

UNIT-V

Sweep techniques: plane sweep for segment intersections, Fortune's sweep for Voronoi

diagrams, topological sweep for line arrangements; Randomization in computational

geometry: algorithms, techniques for counting; Robust geometric computing;

Applications of computational geometry;

Books:

1. Computational Geometry: An Introduction by Franco P. Preparata and Michael Ian

Shamos;

SpringerVerlag , 1985.

2. Computational Geometry, Algorithms and Applications by Mark de Berg, Marc

vanreveld,

Mark Overmars, and Otfried Schwarzkopf; Springer-Verlag, 1997. from Springer.

3. Algorithmische Geometrie (auf deutsch)by Rolf Klein Addison-Wesley, 1996

4. Computational Geometry and Computer Graphics in C++ by Michael J. Laszlo (Nova

Southeastern University ) Prentice-Hall, 1996.

5. Computational Geometry: An Introduction Through Randomized Algorithms by Ketan

ulmuley

Prentice-Hall, 1994

6. Computational Geometry in C by Joseph O'Rourke Cambridge University Press,

seconddition, 1998.

90

COMPUTATIONAL COMPLEXITY Course Code: ECS 072 Credit Units: 04

UNIT-I

Models of Computation Deterministic Turing machines, Equivalent Turing machines, Register machines

Languages Language recognition, Language acceptance, Recursive languages, Recursively enumerable

languages

UNIT – II

Undecidability The Halting Problem, Problem reduction, Undecidability of the tiling problem,

Undecidability of first-order logic, Other unsolvable problems

UNIT – III

Non-determinism Non-deterministic Turing machines, Polynomial-time reduction, Elementary properties of

polynomial time reduction, The complexity classes P, NP, NP-complete, Cook's theorem

How to prove NP-hardness of various problems

UNIT – IV

Probabilistic Algorithms Examples of probabilistic algorithms, How to make 'almost sure' your algorithm is correct

Complexity analysis of probabilistic algorithms, The complexity classes PP and BPP

UNIT – V

Other Complexity Classes Space complexity, Savitch‟s theorem, Exponential time. , Non-elementary problems.

Text Books

1. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of

NP-Completeness, Freeman 1986.

2. V.J. Rayward-Smith: A first Course in Computability, Blackwell Scientific Publications,

1986.

3. H. Lewis and C. Papadimitriou: Elements of the Theory of Computation, Prentice Hall,

1998.

4. J Hopcroft and J Ullman: Introduction to automata theory, languages, and computation,

Addison-Wesley, 1979.

5. Michael Sipser: Introduction to the Theory of Coputation

91

PARALLEL ALGORITHMS Course Code: ECS 073 Credit Units: 04

Unit-I:

Sequential model, need of alternative model, parallel computational models such as PRAM,

LMCC, Hypercube, Cube Connected Cycle, Butterfly, Perfect Shuffle Computers, Tree

model, Pyramid model, Fully Connected model, PRAM-CREW, EREW models, simulation

of one model from another one.

Unit-II:

Performance Measures of Parallel Algorithms, speed-up and efficiency of PA, Cost-

optimality,An example of illustrate Cost- optimal algorithms- such as summation, Min/Max

on various models.

Unit-III:

Parallel Sorting Networks, Parallel Merging Algorithms on CREW/EREW/MCC, Parallel

Sorting Networks on CREW/EREW/MCC/, linear array

Unit-IV:

Parallel Searching Algorithm, Kth element, Kth element in X+Y on PRAM, Parallel Matrix

Transportation and Multiplication Algorithm on PRAM, MCC, Vector-Matrix

Multiplication, Solution of Linear Equation, Root finding.

Unit-V:

Graph Algorithms - Connected Graphs, search and traversal, Combinatorial Algorithms-

Permutation, Combinations, Derangement‟s.

References:

1. M.J. Quinn, “Designing Efficient Algorithms for Parallel Computer”, McGrawHill.

2. S.G. Akl, “Design and Analysis of Parallel Algorithms”

3. S.G. Akl, ”Parallel Sorting Algorithm” by Academic Press

92

ELECTIVE - II

MOBILE COMPUING Course Code: ECS 704 Credit Units: 04

Unit – I

Introduction, issues in mobile computing, overview of wireless telephony: cellular concept,

GSM: air-interface, channel structure, location management: HLR-VLR, hierarchical,

handoffs, channel allocation in cellular systems, CDMA, GPRS.

Unit - II

Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth,

Wireless multiple access protocols, TCP over wireless, Wireless applications, data

broadcasting, Mobile IP, WAP: Architecture, protocol stack, application environment,

applications.

Unit – III

Data management issues, data replication for mobile computers, adaptive clustering for

mobile wireless networks, File system, Disconnected operations.

Unit - IV

Mobile Agents computing, security and fault tolerance, transaction processing in mobile

computing environment.

Unit – V

Adhoc networks, localization, MAC issues, Routing protocols, global state routing (GSR),

Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad

Hoc on demand distance vector routing (AODV), Temporary ordered routing algorithm

(TORA), QoS in Ad Hoc Networks, applications.

References:

1. J. Schiller, Mobile Communications, Addison Wesley.

2. Charles Perkins, Mobile IP, Addison Wesley.

3. Charles Perkins, Ad hoc Networks, Addison Wesley.

4. Upadhyaya, “Mobile Computing”, Springer.

93

DISTRIBUTED DATABSE Course Code: ECS 076 Credit Units: 04

Unit-I:

Introduction Architecture of distributed systems: A detailed review of distributed system

architecture (network operating system, distributed operating systems, etc.) will be

presented leading to distributed database systems. This will then be categorized into (a)

federated database systems, (b) multidatabase systems, and (c) Client/Server systems.

Advanced transaction model : For managing data processing on distributed platform the

conventional transaction model needs some improvements. Discussion of some advanced

transaction models suitable for different types of distributed database systems.

Unit-II:

Workflow It is a unit of business processing. From conventional viewpoint it is a set of

tightly linked atomic processing units which requires special concurrency control and

commit protocols. Discussion of existing ways of handling workflows.

Unit-III:

Query processing and Optimization: On distributed systems a query may be fragmented for

processing on multiple nodes. This give rise to the problem of query fragmentation and

distribution which must be addressed for improving performance.

Unit-IV:

Application distribution: To support parallel and concurrent processing of transactions

processing application have to be distributed. This gives rise to application recovery

problem. This course will explore new ways of managing application recovery which is

more complex than database recovery.

Unit-V: Transaction management, commit protocol and database recovery: These are system related

issues. We will discuss commonly used schemes and advanced protocols for managing these

activities.

Buffer management: Database maintains their own buffer for processing transactions. We

will discuss the buffer architecture and buffer management schemes (replacement,

allocation, etc.)

BOOKS

1. Distributed Systems: Concept and Design. Coulouris, Dollimore, and Kindberg.

AW.

2. Distributed Database Principles and Systems. Ceri and Pelagatti. McGraw Hill.

3. Recovery Mechanisms in Database Systems. Kumar and Hsu, Prentice Hall.

4. Concurrency Control and Recovery in Database Systems. Bernstein, Hadzilacos and

Goodman, AW.

94

BIOINFORMATICS Course Code: ECS 077 Credit Units: 04

Unit I:

Introduction: Bioinformatics objectives and overviews, Interdisciplinary nature of

Bioinformatics, Data integration, Data analysis, Major Bioinformatics databases and tools.

Metadata: Summary & reference systems, finding new type of data online.

Molecular Biology and Bioinformatics: Systems approach in biology, Central dogma of

molecular biology, problems in molecular approach and the bioinformatics approach,

Overview of the bioinformatics applications.

Unit II:

The Information Molecules and Information Flow Basic chemistry of nucleic acids,

Structure of DNA, Structure of RNA, DNA Replication, -Transcription, -Translation,

Genes- the functional elements in DNA, Analyzing DNA,DNA sequencing. Proteins:

Amino acids, Protein structure, Secondary, Tertiary and Quaternary structure, Protein

folding and function, Nucleic acid-Protein interaction.

Unit III:

Perl Perl Basics, Perl applications for bioinformatics- Bioperl, Linux Operating System,

Understanding and Using Biological Databases, Java clients, CORBA, Introduction to

biostatics.

Unit IV:

Nucleotide sequence data Genome, Genomic sequencing, expressed sequence tags, gene

expression, transcription factor binding sites and single nucleotide polymorphism.

Computational representations of molecular biological data storage techniques: databases

(flat, relational and object oriented), and controlled vocabularies, general data retrieval

techniques: indices, Boolean search, fuzzy search and neighboring, application to biological

data warehouses.

Unit V:

Biological data types and their special requirements: sequences, macromolecular structures,

chemical compounds, generic variability and its connection to clinical data. Representation

of patterns and relationships: alignments, regular expressions, hierarchies and graphical

models.

Books:

1. O‟Reilly, “ Developing Bio informatics computer skills”, Indian Edition‟s

publication

2. Rastogi, Mendiratta, Rastogi, “Bioinformatics concepts, skills & Applications”, CBS

Publishers

3. Rashidi, Hooman and Lukas K. Buehler,“Bioinformatics Basic Applications” CRC

Press.

”

95

DATA COMPRESSION Course Code: ECS 078 Credit Units: 04

Unit - I: Introduction

Compression Techniques: Loss less compression, Lossy Compression, Measures of

performance, Modeling and coding, Mathematical Preliminaries

for Lossless compression: A brief introduction to information theory, Models: Physical

models, Probability models, Markov models, composite source model, Coding: uniquely

decodable codes, Prefix codes.

Unit – II: Huffman coding The Huffman coding algorithm: Minimum variance Huffman codes, Adaptive Huffman

coding: Update procedure, Encoding procedure, Decoding procedure. Golomb codes,

Rice codes, Tunstall codes, Applications of Hoffman coding: Loss less image

compression, Text compression, Audio Compression.

Unit-III: Arithmetic Coding

Coding a sequence, Generating a binary code, Comparison of Binary and Huffman

coding, Applications: Bi-level image compression-The JBIG standard, JBIG2, Image

compression. Dictionary Techniques: Introduction, Static Dictionary: Diagram Coding,

Adaptive Dictionary. The LZ77 Approach, The LZ78 Approach, Applications: File

Compression-UNIX compress, Image Compression: The Graphics Interchange Format

(GIF), Compression over Modems: V.42 bits,

Predictive Coding: Prediction with Partial match (ppm): The basic algorithm, The

ESCAPE SYMBOL, length of context, The Exclusion Principle, The Burrows-Wheeler

Transform: Move-to-front coding, CALIC, JPEG-LS, Multi-resolution Approaches,

Facsimile Encoding, Dynamic Markoy Compression.

Unit – IV: Mathematical Preliminaries for Lossy Coding

Distortion criteria, Models, Scalar Ouantization: The Quantization problem,

Uniform Quantizer, Adaptive Quantization, Non uniform Quantization.

Unit-V: Vector Quantization

Advantages of Vector Quantization over Scalar Quantization, The Linde-Buzo-

Gray Algorithm, Tree structured Vector Quantizers. Structured Vector Quantizers.

Books:

1. Khalid Sayood, Introduction to Data Compression, Morgan Kaufmann

Publishers

96

ELECTIVE - III

DIGITAL IMAGE PROCESSING Course Code: ECS 081 Credit Units: 04

UNIT-I

Introduction and Fundamentals: Motivation and Perspective, Applications, Components of

Image Processing System, Element of Visual Perception, A Simple Image Model,

Introduction; Basic Gray Level Functions – Piecewise-Linear Transformation Functions:

Contrast Stretching; Histogram Specification; Histogram Equalization; Local Enhancement;

Enhancement using Arithmetic/Logic Operations – Image Subtraction, Image Averaging;

Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic

Filter.

UNIT-II

Image Enhancement in Frequency Domain Fourier Transform and the Frequency Domain,

Basis of Filtering in Frequency Domain, Filters – Low-pass, High-pass; Correspondence

Between Filtering in Spatial and Frequency Domain; Smoothing Frequency Domain Filters

– Gaussian Low pass Filters; Sharpening Frequency Domain Filters – Gaussian Highpass

Filters; Holomorphic Filtering. Image Restoration A Model of Restoration Process,

Arithmetic Mean filter, Geometric Mean Filter, Order Statistic Filters – Median Filter, Max

and Min filters; Periodic Noise Reduction by Frequency Domain Filtering – Bandpass

Filters.

UNIT-III

Color Image Processing Color Fundamentals, Color Models, and Converting Colors to

different models, Color Transformation, Smoothing and Sharpening, Color Segmentation.

Morphological Image Processing Introduction, Logic Operations involving Binary Images,

Dilation and Erosion, Region Filling, Extraction of Connected Components, Convex Hull,

Thinning, Thickening.

UNIT-IV

Registration Introduction, Geometric Transformation – Plane to Plane transformation,

Mapping, Stereo Imaging – Algorithms to Establish Correspondence, Algorithms to

Recover Depth Segmentation Introduction, Region Extraction, Pixel-Based Approach,

Multi-level Thresholding, Local Thresholding, Region-based Approach, Edge Linking and

Edge Following, Edge Elements Extraction by Thresholding, Edge Detector Performance,

Line Detection, Corner Detection.

UNIT-V

Feature Extraction Representation, Topological Attributes, Geometric Attributes

Description Boundary-based Description, Region-based Description, and Relationship.

Object Recognition Deterministic Methods, Clustering, , Tree Search, Graph Matching

Books:

1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard E.Woods.

Published by: Pearson Education.

2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: John Wiley

and Sons, NY.

3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice Hall, Upper

Saddle River, NJ

97

SOFT COMPUTING Course Code: ECS 082 Credit Units: 04

Unit-I:

ARTIFICIAL NEURAL NETWORKS: Basic concepts - Single layer perception - Multilayer

Perception - Supervised and Unsupervised learning – Back propagation networks - Kohnen's

self-organizing networks- Hopfield network. Unit-II:

FUZZY SYSTEMS: Fuzzy sets and Fuzzy reasoning - Fuzzy matrices - Fuzzy functions -

Decomposition -Fuzzy automata and languages - Fuzzy control methods - Fuzzy decision

making. Unit-III:

NEURO - FUZZY MODELING: Adaptive networks based Fuzzy interface systems -

Classification and Regression Trees -Data clustering algorithms - Rule based structure

identification - Neuro-Fuzzy controls -Simulated annealing – Evolutionary computation.

Unit-IV:

GENETIC ALGORITHMS: Survival of the Fittest - Fitness Computations - Cross over -

Mutation - Reproduction - Rank method - Rank space method. Unit-V:

SOFTCOMPUTING AND CONVENTIONAL AI: AI search algorithm - Predicate calculus -

Rules of interference – Semantic networks -Frames - Objects - Hybrid models - Applications.

Books:

1. Jang J.S.R., Sun C.T. and Mizutani E, "Neuro-Fuzzy and Soft computing", Prentice Hall

1998.

2. Timothy J. Ross, "Fuzzy Logic with Engineering Applications", McGraw Hill, 1997.

3. Laurene Fausett, "Fundamentals of Neural Networks", Prentice Hall, 1994.

4. George J. Klir and Bo Yuan, "Fuzzy sets and Fuzzy Logic", Prentice Hall, USA 1995.

5. N. J. Nelsson, "Artificial Intelligence - A New Synthesis", Harcourt Asia Ltd.,1998.

6. D.E. Goldberg, "Genetic Algorithms: Search, Optimization and Machine Learning", Addison

Wesley, N.Y, 1989.

98

REAL TIME SYSTEM Course Code: ECS 083 Credit Units: 04

Unit-I

Introduction to Real Time Systems, Prioritites, Embedded Systems, Task, Classification

& Requirements, Deadlines, Soft, Hard.

Unit-II

Firm Real Time Systems, Introduction to Real Time Operating Systems, Task

Management, Inter Process Communication, Case Studies of Maruti II, HART OS,

VRTX etc.

Unit-III

Characterizing Real Time Systems and Task, Task Assignment & Scheduling Theory,

Fixed and Dynamic Priority Scheduling Uniprocessor (RM and EDF), Multiprocessor

Utilization Balancing, Next-fit for RM & Bin-Packing Assignment for EDF) Scheduling

Unit-IV

Programming Languages and Tools, Real Time Databases Real Time Communication,

FDDI, Specification and Verification using Duration Calculus, Flow Control, Protocols

for Real Time (VTCSMA, Window, IEEE802.3, IEEE 802.4, IEEE 802.5, Stop and Go

Protocol, Media Access Protocol),

Unit-V Fault, Fault Classes, Fault Tolerant Real Time System, Clocks, Clock Synchronization,

Issues in Real Time Software Design.

References

1.Krishna, C.M, “Real Time Systems”, McGraw Hill

2.Jane W.S. Liu, “Real Time Systems”, Pearson Education Asia

3.Levi and Agarwal, “Real Time Systems”, McGraw Hill

4.Mathi & Joseph, “Real Time System: Specification, Validation & Analysis”, PHI

99

NEURAL NETWOK Course Code: EOE-084 Credit Units: 04

Unit – I

Introduction: Neural network, Human brain, biological and artificial Neurons, model of

Neuron Knowledge representation, Artificial intelligence and Neural network, Network

architecture, Basic Approach of the working of ANN – training, Learning and

generalization.

Unit – II

Supervised learning: Single- layer networks, perception-linear separability, limitations

of multi layer network architecture, back propagation algorithm (BPA) and other

training algorithms, applications of adaptive multi-layer network architecture, recurrent

network, feed-forword networks, radial- basis-function (RBF) networks.

Unit – III

Unsupervised learning: Winner-takes-all networks , Hamming networks, maxnet, simple

competitive learning vector-quantization, counter-propagation network, adaptive

resonance theory, Kohonen‟s self organizing maps, principal component analysis.

Unit – IV

Associated models: Hopfield networks, brain-in-a-box network, Boltzman machine.

Unit - V Optimization methods: Hopfield networks for-TSP, solution of simultaneous linear

equations, Iterated radiant descent, simulated annealing, fenetic algorithm.

Text Books:

Simon Haykin, “Neural Networks – A Comprehensive Foundation”, Macmillan

Publishing Co., New York, 1994.

2.K. Mahrotra, C.K. Mohan and Sanjay Ranka, “Elements of Artificial Neural

Networks”, MIT Press, 1997 – Indian Reprint Penram International Publishing (India),

1997 .

Reference Books: 1. A Cichocki and R. Unbehauen, “Neural Networks for optimization and Signal

processing”, John Wiley and Sons, 1993.

2. J.M. Zurada, “Introduction to Artificial Neural networks”, (Indian edition) Jaico

Publishers, Mumbai, 1997.

3. Limin Fu. “Neural Networks in Computer Intelligence”, TMH.

100

OPEN ELECTIVE-I

ENTREPRENEURSHIP DEVELOPMENT Course Code: EOE-081 Credit Units: 04

UNIT -I Entrepreneurship- definition. growth of small scale industries in developing countries and

their positions vis-a-vis large industries; role of small scale industries in the national

economy; characteristics and types of small scale industries; demand based and resources

based ancillaries and sub-control types. Government policy for small scale industry.

UNIT -II

Project identification - assessment of viability, formulation, evaluation, financing, field-

study and collection of information, preparation of project report, demand analysis, material

balance and output methods, benefit cost analysis, discounted cash flow, internal rate of

return and net present value methods.

UNIT -III

Accountancy- Preparation of balance sheets and assessment of economic viability, decision

making, expected costs, planning and production control, quality control, marketing,

industrial relations, sales and purchases, advertisement, wages and incentive, inventory

control, preparation of financial reports, accounts and stores studies.

UNIT -IV

Project Planning and control: The financial functions cost of capital approach in project

planning and control. Economic evaluation, risk analysis, capital expenditures, policies and

practices in public enterprises. profit planning and programming, planning cash flow, capital

expenditure and operations. control of financial flows, control and communication.

UNIT -V

Laws concerning entrepreneur viz, partnership laws, business ownership, sales and income

taxes and workman compensation act. Role of various national and state agencies which

render assistance to small scale industries.

Text / Reference Books:

1. Forbat, John, “Entrepreneurship” New Age International.

2. Havinal, Veerbhadrappa, “Management and Entrepreneurship” New Age International

3. Joseph, L. Massod, “Essential of Management", Prentice Hall of India

noida international university programme structure

Documents