Bachelor of Technology (Computer Science & Engineering) › schools › wp-content › uploads...FIRST YEAR, (Common for all branches) SEMESTER I Course Periods Evaluation Scheme Course

1

Study & Evaluation

Scheme

of

Bachelor of Technology

(Computer Science & Engineering) [Effective from Academic Session 2014 - 2015]

I.E.C. UNIVERSITY

BADDI (SOLAN) H.P.

2

IEC University, Baddi SCHEME OF STUDY & EVALUATION FOR

B. TECH. PROGRAM FIRST YEAR,

(Common for all branches) SEMESTER I

Course Periods Evaluation Scheme Course Total

Sr.

No

Code Title L T P Sessional Marks Exam

marks

Marks Credits

MSE CA P Total ESE

Theory

1 EE-101/

ME-101

Basic Electrical

Engineering/

Engineering Mechanics

3 1 0 30 15 0 45 30 75 3.5

2 ECE-101/

ME- 102

Basic Electronics

Engineering/ Engg.

Graphics

3 1 0 30 15 0 45 30 75 3.5

3 MAT-101 Engineering

Mathematics-1

3 1 0 40 20 0 60 40 100 3.5

4 CSE-101 Fundamentals of

computer and

programming in C

3 1 0 30 15 0 45 30 75 3.5

5 HUM-101/

EVS-101

Communication Skills/

Environment Science and technology

2/

3

0/

1

0

0

30/

40

15/

20

0

0

45/

60

30/

40 75/

100 2/

3

6 PHY-101/

CHE-101

Engineering Physics/

Engg Chemistry

3 1 0 30 15 0 45 30 75 3.5

Practical/Training/Project

1 PHY-151/

CHE-151

Physics Lab./

Chemistry Lab 0 0 2 15 15 10 25 1

2 CSE-151 Programming in “C”

lab. 0 0 2 15 15 10 25 1

3 ECE-151/

ME-151

Basic Electronics lab./

Engg Mechanics Lab 0 0 2 15 15 10 25 1

4 EE-151/

ME-152

Basic Electrical

Engineering lab./

Workshop lab

0 0 2 15 15 10 25 1

5 HUM-151 Communication Lab 0 0 2 15 15 10 25 1

Total 18 6 8 200 100 60 360 240 600 24.5

SEMESTER II

Theory

1 MAT 201 Engineering

Mathematics-11

3 1 0 40 20 0 60 40 100 3.5

2 PHY-101/

CHE-101

Engineering Physics/

Engg Chemistry

3 1 0 30 15 0 45 30 75 3.5

3 EE-101/

ME-101

Basic Electrical

Engineering/

Engineering Mechanics

3 1 0 30 15 0 45 30 75 3.5

4 HUM-101/

EVS-101

Communication Skills/

Environment Science and technology

2/

3

0/

1

0

0

30/

40

15/

20

0

0

45/

60

30/

40 75/

100 2/

3

3

5 CSE-201 Programming in C++ 3 1 0 30 15 0 45 30 75 3.5

6 ECE-101/

ME- 102

Basic Electronics

Engineering/

Engg. Graphics

3 1 0 30 15 0 45 30 75 3.5

Practical/Training/Project 1 PHY-151/

CHE-151

Physics

Lab./Chemistry Lab 0 0 2 15 15 10 25 1

2 CSE-251 Programming in “C++”

lab. 0 0 2 15 15 10 25 1

3 ECE-151/

ME-151

Basic Electronics

lab./Engg Mechanics

Lab

0 0 2 15 15 10 25 1

4 EE-151/

ME-152

Basic Electrical

Engineering

lab./Workshop lab

0 0 2 15 15 10 25 1

5 HUM-151 Communication Lab 0 0 2 15 15 10 25 1

Total 18 6 8 200 100 60 360 240 600 24.5

COMPONENTS OF EVALUATION

The components of Evaluation for each course will be as under:

For Non-Practical Subjects:

(a) Continuous A ssessment (CA), -- 20 Marks in the form of:

(i) Assignments (15 Marks)

(ii) Attendance (05 Marks),

(b) Mid-Term Exams (MSE), ---------40 Marks

(i) First MSE to be held after completion of 35% - 40% course

coverage,

(ii) Second MSE to be held after completion of 70% - 80% course

coverage

(c) End- semester Exams (ESE), ------ 40 Marks

For Subjects with Practical Courses:

(a) Continuous A ssessment (CA), -- 15 Marks in the form of:

(i) Assignments (10 Marks)

(ii) Attendance (05 Marks),

(b) Mid-Term Exams (MSE), ---------30 Marks

(i) First MSE to be held after completion of 35% - 40% course

coverage,

(ii) Second MSE to be held after completion of 70% - 80% course

coverage

(c) End- semester Exam (ESE), ------ 30 Marks For Practical Courses:

(a) Continuous A ssessment (CA) -- 15 Marks

(b) End-semester Practical Exam----10

Total --25 Marks

4

B.Tech (Computer Science & Engineering)

Semester III


Sr.

No


Marks

Marks Credits

MSE CA P Total ESE

Theory

1 MAT-

301 Engineering

Mathematics III

3 1 0 40 20 0 60 40 100 3.5

2 ECE-

301 Digital

Electronics

3 1 0 30 15 0 45 30 75 3.5

3 CSE-

301 Data Structure

Using C

3 1 0 30 15 0 45 30 75 3.5

4 CSE-

302 Programming

Languages

3 1 0 40 20 0 60 40 100 3.5

5 CSE-

303 Computer

Organization

3 1 0 30 15 0 45 30 75 3.5

6 HUM-

302 Human Values

& Professional

Ethics

2 1 0 40 20 0 60 40 100 2.5

Practical/Training/Project

1 CSE-

351

Data Structure

Using C Lab 0 0 2 15 15 10 25 1

2 ECE-

351

Digital

Electronics Lab 0 0 2 15 15 10 25 1

3 CSE-

352

PC Hardware

Lab 0 0 2 15 15 10 25 1

Total 17 6 6 210 105 45 360 240 600 23

5


Semester IV


Sr.

No


Marks

Marks Credits

MSE CA P Total ESE

Theory

1 CSE-

401 Theory of

Computation

3 1 0 40 20 0 60 40 100 3.5

2 CSE-

402 Software

Engineering

3 1 0 40 20 0 60 40 100 3.5

3 CSE-

403 Data Base

Management

System

3 1 0 30 15 0 45 30 75 3.5

4 CSE-

404 E-Commerce 3 1 0 30 15 0 45 30 75 3.5

5 CSE-

405 Computer

Networks

3 1 0 30 15 0 45 30 75 3.5

6 MBA-

401

Human Resource

Management 2 1 0 40 20 0 60 40 100 2.5

Practical/Training/Project 1 CSE-

451

DBMS Lab 0 0 2 15 15 10 25 1

2 CSE-

452

Software Engg.

& Testing Lab 0 0 2 15 15 10 25 1

3 CSE-

453

Computer

Networks Lab 0 0 2 15 15 10 25 1

Total 18 7 6 210 105 45 360 240 600 23.0

6


Semester V


Sr.

No


Marks

Marks Credits

MSE CA P Total ESE

Theory

1 CSE-

501

Data Warehousing &

Data Mining

3 1 0 40 20 0 60 40 100 3.5

2 CSE-

502

Operating System 3 1 0 30 15 0 45 30 75 3.5

3 ECE-

501

Microprocessor & its

Applications 3 1 0 30 15 0 45 30 75 3.5

4 CSE-

503 Complier Design 3 1 0 40 20 0 60 40 100 3.5

5 CSE-

504

Web Development 3 1 0 30 15 0 45 30 75 3.5

6 MBA-

501 Managerial

Economics

2 1 0 40 20 0 60 40 100 2.5


551

Operating Systems

Lab 0 0 2 15 15 10 25 1

2 CSE-

552

Web Development

& Core java Lab 0 0 2 15 15 10 25 1

3 ECE-

551

Microprocessor Lab 0 0 2 15 15 10 25 1

Total 17 6 6 210 105 45 360 240 600 23.0

7


Semester VI


Sr.

No


Marks

Marks Credits

MSE CA P Total ESE

Theory

1 CSE-

601

Analysis & Design of

Algorithm

3 1 0 40 20 0 60 40 100 3.5

2 ECE-

601

Digital Image

Processing 3 1 0 30 15 0 45 30 75 3.5

3 CSE-

602

Computer Graphics 3 1 0 30 15 0 45 30 75 3.5

4 CSE-

603 Advance Java 3 1 0 30 15 0 45 30 75 3.5

5 CSE-

604 System Administration

3 1 0 40 20 0 60 40 100 3.5

6 HUM-

601 Principle of Management

2 1 0 40 20 0 60 40 100 2.5


651 Advance Java Lab 0 0 2 15 15 10 25 1

2 ECE-

651

Digital Image

Processing Lab 0 0 2 15 15 10 25 1

3 CSE-

652 Computer Graphics

Lab

0 0 2 15 15 10 25 1

Total 17 6 6 210 105 45 360 240 600 23.0

8


Semester VII

List of Electives Elective – I (1)Software Project Management (2) Fuzzy Logic (3) Object Oriented System Development


Sr.

No


Marks

Marks Credits

MSE CA P Total ESE

Theory

1 CSE-

701 Artificial Intelligence 3 1 0 30 15 0 45 30 75 3.5

2 CSE-

702

Net Technology 3 1 0 30 15 0 45 30 75 3.5

3 CSE-

703

Neural Networks 3 1 0 40 20 0 60 40 100 3.5

4 CSE-

704

Management

Information System

3 0 0 40 20 0 60 40 100 3.0

5 Elective – I 3 1 0 40 20 0 60 40 100 3.5


751 Artificial Intelligence

Lab

0 0 2 15 10 25 1

2 CSE-

752

.Net Technology Lab

0 0 2 15 10 25 1

3 CSE-

753

Minor Project 0 0 4 30 20 50 2

Total 15 4 8 180 90 60 330 220 550 21.0

9


Semester VIII

List of Electives Elective – II

(1) Software Testing

(2) Natural Language Processing

(3) Nano technology


Sr.

No


Marks

Marks Credits

MSE CA P Total ESE

Theory

1 CSE-

801 Distributed Operating

System

3 1 0 40 20 0 60 40 100 3.5

2 CSE-

802 Advanced Computer

Architecture

3 1 0 40 20 0 60 40 100 3.5

3 CSE-

803 Mobile Computing 3 1 0 40 20 0 60 40 100 3.5

4 Elective – II 3 1 0 40 20 0 60 40 100 3.5


851 Major Project 0 0 12 100 50 150 6

Total 12 4 12 160 80 0 340 210 550 20.0

10

DETAILED SYLLABUS B.Tech. Common for all branches of Engineering

Semester I L T P

Course Code: CHE 101 ENGINEERING CHEMISTRY 3 1 0

Unit I (Lectures 09) PHYSICAL CHEMISTRY: Rate of reaction, order & molecularity of reaction, Zero order, First

Order, concept of activation energy, energy barrier, cell potential, liquid junction potential,

conductance & its variation with dilution.

WATER CHEMISTRY: Introduction, Source of water, Impurities in water. Softness and hardness of

water, Causes, Determination of hardness of water. Treatment of Water for Domestic use. Removal of

Hardness of water: Lime soda method, Zeolite or Permutit method and Ion-exchange or Deionization

or Demineralization Method. Reverse Osmosis. Numerical Problems.

Unit-II (Lectures 6)

FUELS: Introduction, classification, solid, liquid and gas fuel; Nuclear energy- Breeder reactor and

light water nuclear reactor for power generation (Block diagram only), solar energy conservation and

solar cells; Fuel Cells- Introduction, types and their characteristics, alternate fuels.

LUBRICANTS: Introduction, Mechanisms of lubrication, Types and selection of lubricants,

synthetic lubricants, properties and different methods for testing of lubricating oils and greases.

Unit-III (Lectures 7)

POLYMERS: Introduction, classification, types of polymerization, synthesis and applications of

some important polymers. PVC, Polyamides, Polyurethane, Polyethylene, Poly propylene, PET,

Resins (Phenol Formaldehyde), PMMA, PAN. Conducting and Biodegradable polymers ;

Introduction: Rubber and different types of rubber, Vulcanization of rubber. Natural and synthetic

rubber. Some important rubber and its uses.

Unit-IV (Lectures 10)

CHARACTERIZATION TECHNIQUES

Introduction to spectroscopy: Titrimetric analysis with reference to acid-base, redox, precipitation

and complexometric titrations

UV-Visible spectroscopy- Absorption laws, Instrumentation, Beer,s Lambart’s law, Chromophore

and auxochrome concept, application of UV-Visible spectroscopy.

IR spectroscopy- Principle, spectral features of some classes of compounds, important features of IR

spectroscopy and applications;

NMR- Principle, shielding-desheilding effects, spin-spin coupling, applications of NMR;

MS spectroscopy- Basic principle, Instrumentation, important features of mass spectroscopy;

Chromatography- Introduction, types of chromatography: Instrumentation, principles and

applications of TGA, DTA and DSC.

Unit-V (Lectures 10)

Green Chemistry: Solvents: Reactions in solvent less systems, use of supercritical fluids such as CO2,

Ionic liquids.Catalysts: For increased selectivity, reduced energy requirement, photocatalytic reaction

and asymmetric synthesis. Synthetic Methodologies: New synthetic protocols using new energy

sources like Microwaves, Ultrasound etc.

Books

1. Organic Chemistry, P.Y. Bruice , Ninth Impression, 2011, Pearson India

2. Chemistry 3 , A. Burrows, john Holman, A, Parsons, G. Pilling, G.Price, Oxford Univ. Press, 2009

3. Engineering Chemistry, published by John Wiley and Sons, ,India 2011

4. Unit processes in Organic Synthesis by Groggins, Tata McGraw Hill, 2001

5. Spectroscopic Methods in Organic Chemistry, D H Williams and I. Fleming, Tata McGraw Hill,

1991

6. Applied Chemistry- A textbook for engineers and technologist by H.D. Gesser.

7. Engineering Chemistry: by P C Jain & Monika Jain

8. A Text Book of Engineering Chemistry: by Shashi Chawla

9. Fundamental of organic spectroscopy by Y. R. Sharma

10. Science and Engineering of Materials by Askeland and Phule

11

B.Tech. Common for all branches of Engineering

Semester I

Course Code: CHE 101 ENGINEERING CHEMISTRY LAB L T P

0 0 2

1. Determination of total, permanent and temporary hardness of water sample EDTA

method i)

2. Estimation of dissolved oxygen in water [winkler’s method]

3. Estimation of chloride content in water by argentometric method [mohr’s method]

4. Estimation of alkality in water sample.

5. Determination of viscosity of lubricant oils.

6. Determine the flash point and fire point of an oil.

7. Estimation of total iron in iron ore.

8. Estimate the residual chlorine.

References:

1. Vogel’s quantitative Analysis A I Vogel, G Svelha Seventh Edition longman Group ltd.

2. Elementary Practical Organic Chemistry Fifth Edition Quantitave analysis, A I Vogel,

Longman Group Ltd.

3. Practical Eng. Chemistry S. S. Dara , First edition S. Chand Company.

4. Engg. Chemistry Sudha Rani and S.K. Bhasin First edition Dhanpat rai Publication.

5. Saltcomindia.gov.in./NIDCCP- EstimatContent.html

12


Semester I

ENVIRONMENTAL SCIENCE AND TECHNOLOGY

Course Code: EVS 101 L T P

2 0 0

Unit I (10 hours)

INTRODUCTION: Definition and Scope: Importance, Public awareness and education.

Natural Resources: Introduction, Renewable and non-renewable, Forest, water, mineral,

food, energy and land resources, Conservation of resources, Equitable use of resources.

Human population and the environment: Population growth, Environment and human

health, Human rights, HIV/AIDS, Value education, Women and child welfare.

Unit II (7 hours)

ECOLOGY: Ecosystems, Concept, Structure, Function, Energy flow, Ecological pyramids,

Forest, grassland, desert and aquatic ecosystems - Introduction, characteristic features,

structure and function.

Biodiversity: Genetic, Species and ecological diversity, Threats to biodiversity, Conservation

of Biodiversity.

Unit III (8 hours)

SOCIAL ISSUES & ENVIRONMENTAL LEGISLATION: Social Issues: Sustainable

development, Water conservation, Climatic change, Concept of Green Computing, and Green

Building

Environmental Laws: Environmental ethics, EIA, Environmental protection acts and issues.

Unit IV (11 hours)

POLLUTION &WASTE MANAGEMENT

Pollution: Definition, Causes, effects and control measures of the pollution – Air, soil, Noise,

Water, Marine and Thermal and Nuclear Pollution.

Disaster management: Flood, Earthquake, Cyclone, Landslide, Drought.

Solid waste management: Waste Management hierarchy; Collection, transportation and

storage of MSW; Treatment and disposal of MSW.

Unit IV (6 hours)

ENVIRONMENTAL CHEMISTRY

General Chemistry: Review of concepts like oxidation-reduction, Gas laws, pH and Buffers.

Atmospheric Chemistry: Photochemical reactions in atmosphere, Major chemical pollutants

and their effects.

Water and Wastewater Chemistry: Hardness, Residual chlorine, Dissolved oxygen, BOD,

COD, Solids.

Green Chemistry: Principles, Green materials, reactions, reagents and product.

Text Books:

• Environmental Studies by J.P.Sharma.

• Environmental studies by Smriti Srivastava.

Reference Books:

• Environment and Ecology by H.Kaur.

• Environmental Studies by Ranjit Daniels.

• Fundamentals of Ecology by P. Odum.

13


Semester I

Course Code: MAT 101 ENGINEERING MATHEMATICS I L T P

3 1 0

Units-I Differential calculus: a brief review of basic concepts, asymptotes(Cartesian

coordinates only) curvature, Rectification.

Unit-II Differential Calculus: Partial Differentiation, Euler’s Theorem on Homogeneous

Functions, Maxima and minima of two and more independent variables, Langrange’s Method

of Multipliers.

Unit-III Integral Calculus: Surface and volume of solids of revolutions, Double integral,

double integral by changing into polar form, area and volume by double integration, beta

function and gamma function (simple properties).

Unit-IV Differential Equations: Differential Equations of first order and first degree, linear

form, reducible to linear form, exact form and linear differential equation of higher order with

constant coefficient only.

Unit-V Differential Equations: Second order ordinary Differential Equations with variables

Coefficients, homogeneous and exact forms, change of dependent variable, change of

independent variable, method of variation of parameters.

Text Books:

1. Higher Engineering Mathematics, H.K. Dass, S.Chand.

2. A Text Book of Engineering Mathematics, N.P. Bali, Luxmi Publication.

3. Higher Engineering Mathematics, Dr. BS Grewal.

References:

1. Higher Engineering Mathematics, B.V. Ramana, Tata McGraw Hill.

14


Semester I

Course Code: ECE 101 BASIC ELECTRONICS ENGINEERING L T P

3 1 0

Unit I (12

lectures)

Semiconductors and Diodes: Conductors, semiconductors and insulators, doping in

semiconductors, n-type and p-type semiconductors, temperature effect on semiconductor,

Intrinsic and extrinsic semiconductors, Hall Effect and mass action law.

PN-Junction, Junction Theory, V-I characteristics of a PN-Junction Diode, Ideal Diode, Use

of Diode in Rectifiers: Half wave rectifiers, full wave rectifiers, breakdown of diode, Zener

Diode, Varacter Diode,. Diode as a switch, rectifiers, clipper and clamper circuits.

Unit II (8 lectures)

Bipolar junction transistors: Introduction, Junction Transistor Structure, Operation,

Transistor amplifying action, CB, CC and CE Configuration, characteristics, application of

transistor as an amplifier, transistor biasing.

Unit III (8 lectures)

Field effect transistors: Introduction, Types of FET’s, JFET’s, MOSFET’s, CMOS,

characteristics, working, applications.

Unit IV (6 lectures)

Operational amplifiers: Introduction to Op-amp, Inverting and non-inverting configuration,

Op-amp applications adder, sub tractor, integrator, differentiator and comparator, practical op

-amps.

Unit V (8 lectures)

Number System and Embedded system: Binary, Octal, Hexadecimal number systems and

their inter-conversion, Embedded system, introduction to microcontroller, introduction to

microprocessor, difference between microcontroller and microprocessor, 8085 and 8051.

Text Books

1. Electronics Devices and circuits by Millman & Halkias.

2. Electronics devices and circuit theory by Robert Boylestad

3. M. Morris Mano, Digital Design, Prentice Hall of India.

4. R.S. GAONKAR, Microprocessor Architecture, Programming and applications with the

8085/8080A.

15


Semester I

Course Code: ECE 151 BASIC ELECTRONICS LAB L T P

0 0 2

List of Experiments

1. To observe sine wave, square wave, triangular wave and ramp waveforms on the C.R.O.

and to measure amplitude and frequency of the waveforms.

2. To obtain V-I characteristics of PN junction diode.

3. To study observe waveform at the output of half wave rectifier.

4. To study observe waveform at the output of full wave bridge rectifier.

5. To obtain V-I characteristics of Zener diode.

6. To draw the input and output characteristics of NPN transistor for common base

configurations.

7. To draw the input and output characteristics of NPN transistor for common Emitter

configurations.

8. To observe waveforms at the output of clamper circuits.

9. To observe waveforms at the output of clipper circuits

16


Semester I

Course Code: EE 101 BASIC ELECTRICAL ENGINEERING L T P

3 1 0

UNIT I: Introduction to Electrical Engineering: Essence of electricity, Conductor,

semiconductor and insulator; Electric Field, Electric Current, Potential and Potential

difference, Electromotive Force, Electric Power, Ohm’s law, Basic circuit component and

Faradays law Electromagnetic Induction.

UNIT II: Network Analysis: Basic definition, type of elements, type of sources, Resistive

Network, Inductive Network, Capacitive Network, series parallel circuits, star-delta and

delta-star transformation. Network theorems: Norton’s, Superposition, Thevenin’s, Maximum

Power Transfer Theorem in dc circuit with simple problem.

UNIT III: Magnetic Circuits: Basic definitions, Analogy between electric and magnetic

circuits, series magnetic circuit, parallel magnetic circuit, magnetic circuits with air gap, self-

inductance and mutual inductance, magnetic coupling, coefficient of coupling.

UNIT IV: Study of AC circuits consisting of pure resistance, pure inductance, pure

capacitance and corresponding voltage current phasor diagram and waveforms, Development

of concept of reactance. Study of series R-L, R-C, R-L-C circuit and resonance, study of

parallel RL,RC and RLC circuit, concept of impedance, admittance, conductance and

susceptance in case of above combination and relevant voltage-current phasor diagrams,

concept of active, reactive and apparent power, power factor.

UNIT V: Basic concept of transformers and rotating electrical machines (operating principle,

construction and working ), Basic instrument: Introduction, classification of instruments,

operating principles, essential features of measuring instruments, Moving Coil Permanent

Magnet (PMMC) Instruments, Moving Iron of ammeters and voltmeters (elementary

treatment only).

Text Books:

1. Basic Electrical Engineering- By M.S. Naidu and S. Kamakshiah-TMH

2. Basic Electrical Engineering- By T.K. Nagasarkar and M.S. Sukhija Oxford

University Press.

References:

1. Theory and problems of Basic Electrical Engineering by D.P. Kothari and I.J. Nagrath

PHI.

2. Principles of Electrical Engineering by V.K. Mehta, S.Chand Publications.

3. Essentials of Electrical and computer Engineering by David V. Kerns, JR. J. David

Irwin Pearson.

17


Semester I

Course Code: EE 151 BASIC ELECTRICAL ENGINEERING LAB L T P

0 0 2

List of Experiments:

1. Verification of Kirchoffs laws.

2. Verification of Superpostion theorem and Thevenin’s theorem.

3. Verification of Maximun Power Transfer theorem.

4. Study of study of phenomenon of resonance in RLC series circuit and obtain resonance

frequency.

5. Measurement of power in a three phase circuit by two watt meter method and

determination

of its power factor.

6. To study VI characteristics of PN diode.

7. To study VI characteristics of NPN diode.

8. Determination of parameters in a single phase RLC circuit.

9. To study running and speed reversal of a three phase induction moter and record in both

directions.

10.Determination of

a)voltage ratio b)polarity c)efficiency

by load test of a single phase transformer.

11. Measurement of power and power factor in a single phase AC series inductive circuit and

study improvement of power factor using a capacitor.

12. Calibration of energy meter with the help of watt meter.

13. Short circuit/open circuit tests on single phase transformer.

14. Measure the armature and field resistance of a dc machine.

15. Starting and speed control of a DC shunt motor.

18


Semester I

Course Code: PHY 101 ENGINEERING PHYSICS L T P

3 1 0

UNIT I

Electromagnetic fields and em wave: Gradient of a scalar, divergence and cul of a vector,

Gauss’s law (integral and differential form) and its applications, Electric potential and

electric field (in vector form), Dieletrics, Polarization, Electric displacement, Susceptibility

and permittivity, Lorentz foce law, Magnetic field of a steady current (Biot-Savart’s law),

Faraday’s law, Ampere’s circuital law and its applications, Maxwell’s equations a dn their

significance, Electromagnetic Spectrum (basic idea of different regions).

UNIT II

Quantum Theory: Need of Quantum Mechanics, Davisson-Germer Experiment and Matter

waves, Group and Phase velocities. Uncertainity Principle and its applications, Time-

independent and Time-Dependent Schrödinger Wave equation, Eigen values and Eigen

Functions, Applications of Schrödinger Wave equation to Particle in a box (one dimensional).

UNIT III

Lasers and Optical Fibers: Spontaneous and Stimulated Emission, Einstein’s coefficients,

Population Inversion and Optical Pumping, Three-level and Four-level Lasers, Ruby, He-Ne,

CO2, Semiconductor Lasers, Application of lasers, Basic theory of fiber optics, accepatance

angle, numerical aperture, modes of propagation, material and pulse dispersion, application

of optical fibers.

UNIT IV

Magnetic materials and Superconductivity: Hard and soft magnetic materials and their

applications, Ferrites and their applications, Phenomenon of superconductivity, Magnetic

properties of superconductors (Meissner effect), Type-I and Type-II Superconductors,

Applications of Superconductivity.

UNIT V

Radiation Physics: A few X- and Gamma-radioisotopes (109Cd, 241Am, 60Co, 137Cs) and their

applications, Coolidge tube; Continuous and Characteristic X-rays; Moosley’s law; Absorption of X-

rays and gamma rays; X-ray Diffraction and Bragg’s law, EDXRF and WDXRF (qualitative idea).

19


Semester I

Course Code: PHY 151 ENGINEERING PHYSICS LAB L T P

0 0 2

List of Experiments

1. To determine the specific rotation of cane sugar solution with the help of polarimeter.

2. To determine Planck’s constant

3. To determine the dispersive power of the material of the prism using mercury light

with the help of a spectrometer.

4. To determine the wavelength of sodium light by Newton’s Ring.

5. To determine the Energy Band Gap of a Semiconductor by using Four probe method.

6. To measure the numerical aperture of the given an optical fiber.

7. To determine the specific resistance of a given wire using Carey Foster’s bridge.

8. To determine e/m ratio using Thompson’s method

9. To determine angle of divergence of Laser beam

10. To determine angle of prism and minimum deviation using spectrometer.

20


Semester I

Course Code: ME 101 ENGINEERING MECHANICS L T P

3 1 0

Unit I

(8hours)

Two Dimensional Concurrent Force Systems: Basic concepts, Units, Force systems, Laws

of motion, Moment and Couple, Vectors - Vectorial representation of forces and moments -

Vector operations. Principle of Transmissibility of forces,, Resultant of a force system,

Equilibrium and Equations of Equilibrium, Equilibrium conditions, Free body diagrams,

Determination of reaction, Resultant of Two dimensional concurrent forces, Applications of

concurrent forces

Unit II (13hours)

Two Dimensional Non-Concurrent Force Systems: Basic Concept, Varignon’s theorms,

Transfer of a force to parallel position, Distributed force system, Types of supports and their

reactions, converting force into couple and Vise versa Applications.

Friction: Introduction, Laws of Coulomb Friction, Equilibrium of Bodies involving

Dry-friction, Belt friction, ladder Friction, Applications of Friction in daily life.

Structure: Plane truss, perfect and imperfect truss, assumption in the truss analysis,

analysis of perfect plane trusses by the method of joints, method of section.

Unit III (8hours)

Centroid and Moment of Inertia: Centroid of plane, curve, area, volume and

composite bodies, Moment of inertia of plane area, Parallel Axes Theorem,

Perpendicular axes theorems, Mass Moment of Inertia of Circular Ring, Disc,

Cylinder, Sphere and Cone about their , Axis of Symmetry. Pappus theorems, polar

moment of inertia, Applications of Moment of Inertia in daily life.

Unit IV (8hours)

Kinematics of Rigid Body: Introduction, plane rectilinear motion of rigid body, Plane

curvilinear Motion of Rigid Body, Velocity and Acceleration under Translation and

Rotational Motion, Relative Velocity.

Unit V (8hours)

Kinetics of Rigid Body: Introduction, Force, Mass and Acceleration, Work and

Energy, Impulse and Momentum, D’Alembert’s Principles and Dynamic Equilibrium,

Friction in moving bodies

Text books:

1. Engineering Mechanics Statics , J.L Meriam , Wiley

2. Engineering Mechanics Dynamics , J.L Meriam , Wiley

3. Engineering Mechanics by Irving H. Shames, Prentice-Hall

4. Engineering Mechanics : Statics and Dynamics, R. C. Hibbler

5. Mechanics of Solids by Abdul Mubeen, Pearson Education Asia.

6. Mechanics of Materials by E.P.Popov, Prentice Hall of India Private limited.

21


Semester I

Course Code: ME 151 ENGINEERING MECHANICS LAB L T P

0 0 2

List of Experiments

1. To study the 2-stroke & 4-stroke I.C. Engine models.

2. Friction experiment(s) on inclined plane.

3. To determine the velocity ratio, mechanical advantage and efficiency of a simple

screw jack.

4. Simple & compound gear-train experiment.

5. Belt-Pulley experiment.

6. Torsion of rod/wire experiment.

7. Experiment on Trusses.

8. Dynamics experiment on momentum conservation.

9. Experiment on Moment of Inertia.

10. To draw the load-extension curve of a metallic wire and hence determine the modulus

of elasticity of the material of the wire.

11. To investigate the relationship between shear stress and shear strain for rubber and to

determine the modulus of rigidity of the material.

12. To determine the central deflection of a simply supported beam loaded by a

concentrated load at mid point and hence determine the modulus of elasticity of the

material of the beam.

13. To determine the central deflection of a fixed ended beam loaded at mid-span by

concentrated loads and to compare with theoretical value.

14. To verify the laws of shearing force and bending moment on a beam.

Outcome of the course:

The students are expected to compare experimental results with theoretical concepts,

speculate about reasons for discrepancies, and learn from deductive reasoning. The purposes

of experimentation as a subject in the curriculum are many, but perhaps the most important

ones are to provide opportunities for the student to:

1. Verify certain theories

2. Become familiar with methods of measurements

3. Organize his/her own work and carry it through systematically and carefully

4. Organize the work of a team

5. Analyze data, assess its reliability and draw conclusions.

References:

1. Applied Mechanics and Strength of Materials, U.C. Jindal, Galgotia Publications

2. Engineering Mechanics For Uptu With Experiments, D.S. Kumar, S.K. Kataria

publication

3. Advanced Practical Physics for Students, Worsenop & Flint

22


Semester I

Course Code: ME 102 ENGINEERING GRAPHICS L T P

3 1 0

Unit I (10hours)

Introduction: Sheet layout, Drawing instruments and their uses, Lettering and free hand

practicing, Dimensioning, Types of lines, BIS conventions.

Unit II (12hours)

Orthographic projections: Definitions, Planes of projection, Reference line and convention

employed, Projections of points, lines, True and apparent lengths, inclinations, Orthographic

projections of plane surfaces.

Unit III (8hours)

Projections of solids: Definitions, Projections of right regular tetrahedron, Projections of

hexahedron, Projections of prisms, Projections of pyramids, cylinders and cones.

Unit IV (10hours)

Isometric projections

Isometric scales, Isometric projections of simple figures, tetrahedron, hexahedron, right

regular prisms, pyramids, cylinder and cones, Spheres, cut spheres and combination of solids.

Unit V (8 hours)

Introduction to computer aided sketching: Computer screen: layout of menus/tool bars,

of 2D/3D Environment, .,

rectangle, circle, curves etc, Dimensioning.

Text books:

1. Engineering Drawing – N D Bhatt & V M Panchal, 48th edition, 2005 Charotar

Publishing House, Gujarat.

2. A Primer on Computer Aided Engineering Drawing – 2006, Published by VTU,

Belgaum.

3. A Textbook of Engineering Graphics, K. Venugopal and V. Prabhu Raja, New Age

International Publishers.

4. Engineering Drawing and Graphics using Auto Cad, T. Jeyapoovan, Vikas Publishing

House Pvt. Ltd.

Reference Books:

1. Computer Aided Engineering Drawing – S. Trymabaka Murthy, I K International

Publishing House Pvt. Ltd., New Delhi, 3rd revised edition – 2006.

2. Engineering Graphics – K R Gopalakrishna, 32nd edition, 2005 – Subhash Publishers,

Bangalore.

3. Fundamentals of Engineering Drawing with an introduction to Interactive Computer

Graphics for Design and Production – Luzadder Warren J., duff John M., Eastern

Economy Edition, 2005 - Prentice – Hall of India Pvt. Ltd., New Delhi.

23


Semester I

Course Code: ME 152 WORKSHOP PRACTICE L T P

0 0 3

List of Jobs

Carpentry Shop

Job No. 1

Objective: To Prepare a “T–LAP JOINT” as per sketch.

Job No. 2 Objective: To prepare a “Cross Lap Joint” as per given sketch.

24

Job No. 3 Objectives: To prepare Mortise and Tenon Joint

Fitting Shop

Job No. 1 Objectives: To Make Right Angle Fitting Job

25

Job No. 2 Objectives: To Make A Square Fitting Job

Machine Shop Job No. 1

Objective: To prepare the job as per the given specifications provided for different operations on lathe machine

Swiveling angle = Half of the taper angle = 4°, All Dimensions are in mm, Tolerance = ± 0.5mm

26

Welding Shop

Job No. 1

Objective: Beading practice with arc welding

27

Job No. 2

Objective: To make a butt joint by arc welding.

28


Semester I

Course Code: HUM 101 COMMUNICATION SKILLS L T P

2 0 0

Unit I

Communication: Meaning of Communication, Types of Communication, Process of

Communication, Channels of Communication, modes of communication, Barriers to

communication, Role of communication in society.

Reading Skills: Characteristics of reading, Types of reading, Purpose of reading, Process of

reading, Rules for faster comprehension, Approach to reading, SQ3R, Comprehension

(Unseen passage).

Unit II

Listening Skills: Process of listening, Types of listening, and Barriers to effective listening,

Difference between hearing and listening, Feedback skills.

Speaking Skills: Study of Vowels symbols & diagram( Long, Short, Open, Close, Rounded,

Unrounded, Monophthongs, Diphthongs) , Consonants & symbols , Accent , Stress , Voice

Modulation

Unit III

Grammar: Abbreviations, Idioms & phrases, One word substitution, Antonyms, Synonyms,

Homophones, Homonyms, Word formation: prefix, suffix, Punctuation. Transformation of

sentences: Simple to compound, compound to Complex& vice versa.

.

Unit IV

Writing Skills: Business letters: principles, structure, Writing a memo, Job application letters,

preparing a personal resume; Writing notices, Agenda and Minutes of meetings; Paragraph

writing, Report writing: Characteristics, types of reports, structure of technical/research

reports, preparatory steps to report writing.

Text Books:

1. Bhattacharya, Inderjit, an Approach to Communication Skills. Dhanpat Rai, New

Delhi.

2. K.K.Sinha, Business Communication, Galgotia Publishing Company, New Delhi,

1999.

References:

1. Sheila H.A. Smith, M and Thomas, L., Methuen, Reading to Learn; London, 1982.

2. McGraw, SJ;Basic Managerial Skills for all, Prentice Hall of India, New Delhi 1991

3. Technical Reporting Writing British Association for commercial and Industrial

Education, BACIE, 1992

4. Chrissie Wright (Ed.); Handbook of Practical Communication Skills; JAICO Books

5. Common Errors in English, by Sudha Publication (P) Ltd., B-5, Prabhat Kiran

Building,

Rajendra Place, New Delhi – 110008.

6. Abul Hashem, Common Errors in English, Ramesh Pub. House, Daryagang New

Delhi.

7. Objective English by Tata McGraw Hill Publishing Co. Ltd., New Delhi.

8. R.K.Bansal & J.B. Harrison, spoken English for India, Orient Longman.

9. Veena Kumar, the Sounds of English, Makaav Educational Software, New Delhi.

29


Semester I

Course Code: HUM 151 COMMUNICATION SKILLS LAB L T P

0 0

2 Practical syllabus-

a) Group Discussion

b) Just a minutes session: Speaking Extempore for one minutes on given topics

c) Reading aloud of newspaper headlines and important articles.

d) Improving pronunciation through tongue twisters.

e) Soft Skills: Mannerism or Etiquette.

f) Mock Interview

g) Preparing PPTs

h) Telephonic Skills

i) Phonetics

30


Semester I

FUNDAMENTALS OF COMPUTERS & PROGRAMMING IN C

Course Code: CSE 101 L T P

3 1 0

Unit I (10hours)

An Overview of Computer System: Anatomy of a digital Computer, Memory Units, Main

and Auxiliary Storage Devices, Input Devices, Output Devices, Classification of Computers,

Introduction to microprocessor, commonly used CPUs, Input/output ports and connectors.

Radix Number System: Decimal, Binary, Octal, Hexadecimal numbers

Operating System: The user Interface, Running Programmes, Managing files, Introduction

to PC operating Systems: Unix/Linux, DOS, and Windows 2000.

Unit II (10hours)

Networking Basics: Introduction to the basic concepts of Networks and Data

Communications, Network topologies, Network Types (LAN, WAN and MAN), How

Internet works, Major features of internet, Emails, FTP, Using the internet.

Programming Languages: Machine-, Assembly-, High Level- Language, Assembler,

Compiler, Interpreter, debuggers, Programming fundamentals: problem definition, algorithms,

flow charts and their symbols, introduction to compiler, interpreter, assembler, linker and

loader and their inter relationship.

Unit III (10hours)

C Programming language: C fundamentals formatted input/ output, expressions, selection

statements, loops and their applications; Basic types, arrays, union, structure, functions,

including recursive functions, program organization: local and external variables and scope,

pointers & arrays.

Unit I (10hours)

Strings: strings literals, string variables, I/O of strings, arrays of strings; applications.

Structures, Unions and Enumerations: Structure variables and operations on structures;

Structured types, nested array structures; unions; enumeration as integers, tags and

types. Standard library: Input / output; streams, file operations, formatted I/O, character

I/O, line I/O, block, string I/O, Library support for numbers and character data, error

Handling:

TEXT BOOKS: 1. Using Information Technology, 5th Edi, Brian K Williams & Stacey C. Sawyer, 2003,

TMH

2. The C Programming Language by Dennis M Ritchie, Brian W. Kernigham, 1988, PHI.

3. C Programming – A modern approach by K.N. King, 1996, WW Norton & Co.

4. Fundamentals of Computing and C Programming, R. B. Patel, Tech Publications, New

Delhi.

31


Semester I

PROGRAMMING IN ‘C’ LAB


0 0 2

List of Experiments

(1) WAP TO ADD TWO NUMBERS.

(2) WAP TO SWAP TWO NUMBERS.

(3) WAP TO FIND SIMPLE INTEREST.

(4) WAP TO CHECK NO IS ODD/EVEN.

(5) WAP TO FIND GREATEST NO. OUT OF THREE NUMBERS.

(6) WAP TO FIND GREATEST & SECOND GREATEST OUT OF THREE NUMBERS.

(7) WAP TO FIND YEAR IS CENTUARY/LEAP YEAR OR NOT.

(8) WAP TO FIND GRADE WITH PERCENTAGE.

(9) WAP TO FIND INCOME TAX FROM TOTAL SALARY.

(10) WAP TO PRINT DAY OF WEEKS USING SWITCH STATEMENT.

(11) WAP TO PRINT NO OF DAYS OF MONTHS USING SWITCH STATEMENT.

(12) WAP TO PRINT ‘N’ NATURAL NUMBERS USING WHILE LOOP.

(13) WAP TO FIND NUMBER OF DIGITS IN AN INTEGER USING WHILE LOOP.

(14) WAP TO FIND REVERSE OF AN INTEGER USING WHILE LOOP.

(15) WAP TO CHECK WHEATHER NUMBER IS PALLINDROME OR NOT USING WHILE LOOP.

(16) WAP TO FIND SUM OF AN INTEGER USING DO-WHILE LOOP.

(17) WAP TO USE GOTO & CONTINUE STATEMENT

(18) WAP FOR LINEAR SEARCH

(19) WAP FOR BINARY SEARCH

(20) WAP FOR BUBBLE SORT

(21) WAP TO FIND ADDITION OF TWO MATRICES

(22) WAP TO FIND MULTIPLICATION OF TWO MATRICES

(23) WAP TO FIND TRANSPOSE OF A MATRIX

(24) WAP TO FIND WHEATHER THE MATRIX IS SYMMETRIC OR NOT

(25) WAP TO PRINT ADDRESS USING POINTERS

(26) WAP FOR STRUCTURE

(27) WAP FOR UNION

32


Semester II

ENGINEERING MATHEMATICS-II

Course Code: MAT 201 L T P

3 1 0

Unit I (10hours)

Matrices: Rank of a matrix, Rank of matrix by reducing to normal forms, Consistency of

systems of linear simultaneous equations and its solution, Eigen values and Eigen vectors,

Cayley-Hamilton theorem (without proof), Diagonalization of matrix.

Unit II (10hours)

Vector Calculus: Scalar and vector field, Differentiation & Integration of vector functions,

Gradient of a scalar field and directional derivative, Divergence and Curl of a vector field,

Line integral, Surface integral and volume integral. Application of Vector Calculus: Green’s

Theorem, Gauss’s Theorem and Stoke’s Theorem (without proof) and their Applications.

Unit III (11hours)

Laplace transform: Laplace transform of elementary functions, Laplace transform of

derivatives and integrals, multiplication by tn , division by t , Evaluation of integrals by

Laplace transform, Laplace transform of Unit step function, Inverse transforms, convolution

theorem, application to linear differential equations and simultaneous linear differential

equations with constant coefficients.

Unit IV (9hours)

Partial differential equations: Formation of partial differential equations, Lagrange’s linear

partial differential equations, First order non-linear partial differential equations

{ ),(),(,0),,(),,(,0),( 21 qyfpxfqpzfqpfqypxzqpf }, Charpit’s method

Unit V (9hours)

Application of Partial differential equations: Homogeneous linear equations with

constants coefficients, Non-homogeneous linear partial differential equations, Method of

separation of variables and its application, One dimensional wave equation, One dimensional

heat equation.

Suggested Readings:

1. Higher Engineering Mathematics, H.K. Dass, S. Chand, 11th

Edition.

2. Higher Engineering Mathematics, B.V. Ramana, Tata McGraw Hill.

3. Thomas Calculus, Maurice D. Weir, Joel Hass and others, Pearson, 11th

Edition.

4. A Text Book of Engineering Mathematics, N.P. Bali Laxmi publication.

5. Engineering Mathematics -1, (RTU), N.P. Bali Laxmi publication.

6. Higher Engineering Mathematics, Dr. B. S. Grewal, Khanna Publishers.

33


Semester II

PROGRAMMING IN C++


3 1 0

Unit I

Overview of C: C Fundementals, Selection Statements, Loops, Array, Pointer, Structure,

Union, Function, Recursion, Strings.

Introduction to C++, Preprocessors Directives, Illustrative Simple C++ Programs. Header

Files and Namespaces, Concept of objects, Object Oriented Analysis & Object Modeling

techniques.

Object Oriented Concepts: Encapsulation (Information Hiding), Access Modifiers:

Controlling access to a class, method, or variable (public, protected, private, package),

Polymorphism: Overloading, Inheritance, Overriding Methods, Abstract Classes, Reusability.

Unit II

Classes and Data Abstraction: Introduction, Structure Definitions, Accessing Members of

Structures, Class Scope and Accessing Class Members, Initializing Class Objects:

Constructors, Using Default Arguments With Constructors, Using Destructors, Classes:

Const (Constant) Object And Const Member Functions, Object as Member of Classes, Friend

Function and Friend Classes, Using This Pointer, Dynamic Memory Allocation with New and

Delete, Static Class Members, Function overloading.

Operator Overloading: Introduction, Fundamentals of Operator Overloading, Restrictions

On Operators Overloading, Operator Functions as Class Members vs. as Friend Functions,

Overloading, <<, >> Overloading Unary Operators, Overloading Binary Operators.

Unit III

Inheritance: Introduction, Inheritance: Base Classes and Derived Classes, Protected

Members, Casting Base- Class Pointers to Derived- Class Pointers, Overriding Base –Class

Members in a Derived Class, Public, Protected and Private Inheritance, Using Constructors

and Destructors in derived Classes.

Virtual Functions and Polymorphism: Introduction to Virtual Functions, Abstract Base

Classes and Concrete Classes, Polymorphism, New Classes and Dynamic Binding, Virtual

Destructors, Polymorphism, Dynamic Binding. Files and I/O Streams: Files and Streams,

Creating a Sequential Access File, e.g. , Random Access Files, Creating A Random Access

File, e.g. Stream Input/output Classes and Objects, e.g., Stream Manipulators.

Unit IV

Templates & Exception Handling: Function Templates, Class Template, Templates and

Inheritance, Basics of C++ Exception Handling: Try, Throw, Catch, Throwing an Exception,

Catching an Exception, Re-throwing an Exception

Text Books:

• C++ How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall

• Object Oriented Programming in Turbo C++ by Robert Lafore ,1994, The WAITE Group

Press.

• Programming with C++ By D Ravichandran, 2003, T.M.H

Reference books: • Object oriented Programming with C++ by E Balagurusamy, 2001, Tata

McGraw-Hill

• Computing Concepts with C++ Essentials by Horstmann, 2003, John Wiley,

• The Complete Reference in C++ By Herbert Schildt, 2002, TMH.

• C++ Programming Fundamentals by Chuck Easttom, Firewall Media.

34


Semester II

PROGRAMMING IN ‘C++

’ LAB


0 0 2

List of Experiments

(1) WAP FOR FUNCTION WITHOUT ARGUMENTS

(2) WAP FOR FUNCTION WITH ARGUMENTS

(3) WAP TO FIND FACTORAIL OF A NUMBER USING RECURSION

(4) WAP FOR PASSING AN ARRAY IN FUNCTION

(5) WAP FOR CALLBYVALUE & CALL BY REFERENCE

(6) WAP TO FIND LENGTH OS A STRING

(7) WAP TO FIND CONCETANATION OF TWO STRINGS

(8) WAP TO FIND COPY OF A STRING

(9) WAP TO FIND WHEATHER STRING IS PALINDROME OF NOT

(10) WAP TO FIND REVERSE OF A STRING

(11) WAP TO FIND SUM & AVERAGE OF A NUMBER IN C++

(12) WAP FOR INLINE FUNCTIONS

(13) WAP FOR FUNCTION OVERLOADING

(14) WAP FOR CLASSES DECLARTION

(15) WAP FOR SCOPE RESULTION OPERATOR

(16) WAP FOR STATIC DATA MEMBERS

(17) WAP FOR SATAIC MAMBERS FUNCTION

(18) WAP FOR CONSTRUCTOR

(19) WAP FOR CONSTRUCTOR OVERLOADING

(20) WAP FOR DESTRUCTORS

(21) WAP FOR FRIEND CLASSES

(22) WAP FOR CONTAINER CLASSES

(23) WAP FOR ABSTRACT CLASSES

(24) WAP FOR OPERATOR OVERLOADING

(25) WAP FOR VARIOUS TYPES OF INHERITENCE

(26) WAP FOR VIRTUAL BASE CLASSES

(27) WAP FOR POLYMORPHISM

(28) WAP FOR VIRTUAL FUNCTIONS

(29) WAP FOR FILE HANDLING

35

B.Tech. Computer Science Engineering

Semester III

ENGG. MATHEMATICS – III

Course Code: MAT 301 L T P

3 1 0

Question Paper will contain three sections of 100 marks, Section (A) is

compulsory & will contain 10 short questions each carrying weightage of 2

marks(Fill in the blanks/ True –false/ MCQ/One Word answer)

Section B will contain question no 2 and 3. Each question will have six sub

questions and candidate will attempt any four questions from each question

carrying weightage of 5 marks.)

Section C will contain question no 4 and 5. Each question will have four sub

questions and candidates will attempt any two questions from each question

carrying weightage of 10 marks.

UNIT-I Fourier Series: Periodic functions, Fourier series of period 2 , Euler’s formulas,

Dirichlet’s condition, Fourier series for discontinuous functions, Change of interval, Odd and

even function, Half- range sine and cosine series.

UNIT-II Fourier Transforms: Fourier integrals, Fourier transforms, Fourier cosine and sine

transforms, Properties of Fourier transforms, Convolution theorem, Perseval’s identity,

Relation between Fourier and Laplace transforms, Fourier transforms of the derivatives of a

function, Application to boundary value problems.

UNIT-III Functions of a Complex Variables: Functions of a complex variable,

Exponential function, limit and continuity of a function, Analytic function, Cauchy-Riemann

equations, Necessary and sufficient conditions for a function to be analytic, Polar form of the

Cauchy-Riemann equations, Harmonic functions, Cauchy integral theorem, Cauchy residue

theorem.

UNIT-IV Numerical analysis: Solution of algebraic and transcendental equations by the

Bisection, Regula-falsi and Newton-Raphsion methods, Solution of linear simultaneous

equations by Gauss elimination method, Iteration methods, Jacobi’s iteration method, Gauss-

seidel method, Relaxation method, Numerical integration methods, Trapezoidal rule,

Simpson’s one-third rule, Simpson’s three-eighth rule, Numerical solution of differential

equations, Picard’s method, Taylor’s series method, Euler’s method and forth-order Runge-

Kutta method.

UNIT-V Linear Programming: Linear programming problems formulation, Solution of

Linear Programming Problem using Graphical method, Simplex Method, Dual-Simplex

Method.

Text Book

1. Higher Engg. Mathematics : B.S. Grewal

2. Advanced Engg. Mathematics : E. Kreyzig

Reference Book

1. Complex variables and Applications : R.V. Churchil; Mc. Graw Hill

2. Engg. Mathematics Vol. II: S.S. Sastry; Prentice Hall of India.

3. Operation Research : H.A. Taha

4. Probability and statistics for Engineer : Johnson. PHI.

36


Semester III

DIGITAL ELECTRONICS

Course Code: ECE-301 L T P

3 1 0

Section -A

Number system and their inter conversion, Signed binary numbers, binary codes, cyclic codes,

error detecting and correcting codes, hamming codes.

Logic Gates, Minimization of logic gates using K- map method and Quine Mc-Clusky

method (Tabular method)

Combinational circuits, analysis procedure, design procedure, binary adder-subtractor,

decimal adder, binary multiplier, magnitude comparator, decoders, encoders, multiplexers,

demultiplexers.

Section-B

Sequential circuits, Flip flops, SR flip flop JK flip flop.D Flip flop and T flip flop.

Registers and counters: Shift registers, ripple counter, synchronous counter, other counters

Section-C

Introduction and performance criteria for logic families, various logic families - DCTL, RTL, DTL,

TTL & ECL working and their characteristics in brief, MOS Gates and GMOS Gates, comparison of

various logic families.

Section-D Memory and programmable logic: Introduction, Memory organisation, Classification

and characteristics of memories, Sequential memories, RAM, ROM, PLA, and PAL.

Text Book:

• M. Morris Mano and M. D. Ciletti, “Digital Design”, 4th

Edition, Pearson Education

• Pedroni - Digital Electronics & Design, Elsevier

• R.P. Jain , “Modern digital electronics” , 3rd edition , 12th reprint TMH Pub, 2007.

• Digital Design and computer organization: Nasib Singh Gill & J. B. Dixit

Reference Books : • Grout - Digital Design using FPGA'S & CPLD's, Elsevier

• F. Vahid: Digital Design: Wiley Student Edition, 2006

• J. F. Wakerly, Digital Design Principles and Practices, Fourth Edn, Prentice-Hall, 2005.

• R. L. Tokheim, Digital electronics, Principles and applications, 6th Edition, Tata

McGraw Hill Edition, 2003

37


Semester III

DATA STRUCTURES USING C Course Code: CSE-301 L T P

3 1 0

Section-A

Overview of C, Introduction, Stacks and Queues Overview of ‘C’ :Introduction , Flow of Control, Input output functions, Arrays and

Structures, Functions

Data structures and Algorithms: an overview : concept of data structure, choice of right

data structures, types of data structures, basic terminology Algorithms, how to design and

develop an algorithm: stepwise refinement, use of accumulators and counters; algorithm

analysis, complexity of algorithms Big-oh notation.

Arrays : Searching Sorting: Introduction, One Dimensional Arrays, operations defined :

traversal, selection, searching, insertion, deletion, and sorting

Searching: linear search, binary search; Sorting : selection sort, bubble sort, insertion sort,

merge sort, quick sort, shell sort. Multidimensional arrays, address calculation of a location in

arrays.

Stacks and queues: Stacks, array representation of stack. Applications of stacks. Queues,

Circular queues, , array representation of Queues,. Deques, priority queues, Applications of

Queues.

Section-B

Pointers and Linked Lists; Pointers: Pointer variables, Pointer and arrays, array of pointers, pointers and structures,

Dynamic allocation.

Linked Lists: Concept of a linked list,. Circular linked list, doubly linked list, operations on

linked lists. Concepts of header linked lists. Applications of linked lists, linked stacks, linked

Queues.

Section-C

Trees and Graphs Trees: Introduction to trees, binary trees, representation and traversal of trees, operations on

binary trees, types of binary trees, threaded binary trees, B Trees, . Application of trees.

Graphs : Introduction, terminology, ‘set, linked and matrix’ representation, operations on

graphs, Applications of graphs.

Section-D

File Handling and Advanced data Structure Introduction to file handling, Data and Information, File concepts, File organization, files and

streams, working with files. AVL trees, Sets, list representation of sets, applications of sets,

skip lists

Text Book: • Data Structures using C by A. M. Tenenbaum, Langsam, Moshe J. Augentem, PHI Pub.

• Data Structures using C by A. K. Sharma, Pearson

Reference Books: • Data Structures and Algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman, Original

edition, Addison-Wesley, 1999, Low Priced Edition.

• Fundamentals of Data structures by Ellis Horowitz & Sartaj Sahni, Pub, 1983,AW

• Fundamentals of computer algorithms by Horowitz Sahni and Rajasekaran.

• Data Structures and Program Design in C By Robert Kruse, PHI,

• Theory & Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s outline by TMH

• Introduction to Computers Science -An algorithms approach , Jean Paul Tremblay, Richard

B. Bunt, 2002, T.M.H.

• Data Structure and the Standard Template library – Willam J. Collins, 2003, T.M.H

38


Semester III

PROGRAMMING LANGUAGES Course Code: CSE-302 L T P

3 1 0

Section A:

Introduction:

Syntactic and semantic rules of a Programming language, Characteristics of a good

programming language, Programming language translators compiler & interpreters ,

Elementary data types – data objects, variable & constants, data types, Specification &

implementation of elementary data types, Declarations ,type checking & type conversions ,

Assignment & initialization, Numeric data types, enumerations, Booleans & characters.

Section B:

Structured data objects, Subprograms and Programmer Defined Data Type : Structured data objects & data types , specification & implementation of structured data

types, Declaration & type checking of data structure ,vector & arrays, records Character

strings, variable size data structures , Union, pointer & programmer defined data objects, sets,

files.

Evolution of data type concept, abstraction, encapsulation & information hiding,

Subprograms, type definitions, abstract data types.

Section C:

Sequence Control and Data Control: Implicit & explicit sequence control, sequence control within expressions, sequence control

within statement, Subprogram sequence control: simple call return, recursive subprograms,

Exception & exception handlers, co routines, sequence control. Names & referencing

environment, static & dynamic scope, block structure, Local data & local referencing

environment, Shared data: dynamic & static scope. Parameter & parameter transmission

schemes.

Section D:

Storage Management, Programming languages: Major run time elements requiring storage ,programmer and system controlled storage

management & phases , Static storage management , Stack based storage management, Heap

storage management ,variable & fixed size elements.Introduction to procedural, non-

procedural ,structured, functional and object oriented programming language, Comparison of

C & C++ programming languages.

Text Book: • Programming languages Design & implementation by T. W. Pratt, 1996, Prentice Hall

• Programming Languages – Principles and Paradigms by Allen Tucker & Robert

Noonan, 2002, TMH,

Reference Books: • Fundamentals of Programming languages by Ellis Horowitz, 1984, Galgotia

publications (Springer Verlag),

• Programming languages concepts by C. Ghezzi, 1989, Wiley Publications.,

• Programming Languages – Principles and Pradigms Allen Tucker , Robert Noonan

2002, T.M.H.

39


Semester III

COMPUTER ORGANIZATION Course Code: CSE-303 L T P

3 1 0

Section A Boolean algebra and Logic gates, Combinational logic blocks(Adders, Multiplexers,

Encoders, de-coder), Sequential logic blocks(Latches, Flip-Flops, Registers, Counters) Store

program control concept, Flynn’s classification of computers (SISD, MISD, MIMD);

Multilevel viewpoint of a machine: digital logic, micro architecture, ISA, operating systems,

high level language; structured organization; CPU, caches, main memory, secondary memory

units & I/O; Performance metrics; MIPS, MFLOPS.

Section B

Instruction Set Architecture: Instruction set based classification of processors (RISC, CISC, and their comparison);

addressing modes: register, immediate, direct, indirect, indexed; Operations in the instruction

set; Arithmetic and Logical, Data Transfer, Control Flow; Instruction set formats (fixed,

variable, hybrid); Language of the machine: 8086 ; simulation using MSAM.

Section C

Basic non pipelined CPU Architecture and Memory Hierarchy & I/O Techniques CPU Architecture types (accumulator, register, stack, memory/ register) detailed data path of

a typical register based CPU, Fetch-Decode-Execute cycle (typically 3 to 5 stage);

microinstruction sequencing, implementation of control unit, Enhancing performance with

pipelining.

The need for a memory hierarchy (Locality of reference principle, Memory hierarchy in

practice: Cache, main memory and secondary memory, Memory parameters: access/ cycle

time, cost per bit); Main memory (Semiconductor RAM & ROM organization, memory

expansion, Static & dynamic memory types); Cache memory (Associative & direct mapped

cache organizations.

Section D

Introduction to Parallelism and Computer Organization [80x86]: Goals of parallelism (Exploitation of concurrency, throughput enhancement); Amdahl’s law;

Instruction level parallelism (pipelining, super scaling –basic features); Processor level

parallelism (Multiprocessor systems overview).

Instruction codes, computer register, computer instructions, timing and control, instruction

cycle, type of instructions, memory reference, register reference. I/O reference, Basics of

Logic Design, accumulator logic, Control memory, address sequencing, micro-instruction

formats, micro-program sequencer, Stack Organization, Instruction Formats, Types of

interrupts; Memory Hierarchy.

Text Books:

• Computer Organization and Design, 2nd

Ed., by David A. Patterson and John L.

Hennessy, Morgan 1997, Kauffmann.

• Computer Architecture and Organization, 3rd

Edi, by John P. Hayes, 1998, TMH.

Reference Books: • Operating Systems Internals and Design Principles by William Stallings,4th edition,

2001, Prentice-Hall Upper Saddle River, New Jersey

• Computer Organization, 5th Edi, by Carl Hamacher, Zvonko Vranesic,2002, Safwat

Zaky.

40

• Structured Computer Organisation by A.S. Tanenbaum, 4th edition, Prentice-Hall of

India, 1999, Eastern Economic Edition.

• Computer Organisation & Architecture: Designing for performance by W. Stallings,

4th edition, 1996, Prentice-Hall International edition.

• Computer System Architecture by M. Mano, 2001, Prentice-Hall.

• Computer Architecture- Nicholas Carter, 2002, T.M.H.

41


Semester III

HUMAN VALUES & ETHICS Course Code: HUM-302 L T P

2 1 0

SECTION-A

Course Introduction - Need, Basic Guidelines, Content and Process for Value Education

Understanding the need, basic guidelines, content and process for Value Education. Self

Exploration–what is it?- its content and process; „Natural Acceptance‟ and Experiential

Validation- as the mechanism for self exploration. Continuous Happiness and Prosperity- A

look at basic Human Aspirations Right understanding, Relationship and Physical Facilities-

the basic requirements for fulfillment of aspirations of every human being with their correct

priority Understanding Happiness and Prosperity correctly- A critical appraisal of the current

scenario Method to fulfill the above human aspirations: understanding and living in harmony

at various levels

SECTION-B

Understanding Harmony in the Human Being - Harmony in Myself! Understanding human

being as a co-existence of the sentient “I” and the material „Body‟ Understanding the needs

of Self („I‟) and „Body‟ - Sukh and Suvidha Understanding the Body as an instrument of „I‟

(I being the doer, seer and enjoyer) Understanding the characteristics and activities of „I‟ and

harmony in „I‟ Understanding the harmony of I with the Body: Sanyam and Swasthya;

correct appraisal of Physical needs, meaning of Prosperity in detail Programs to ensure

Sanyam and Swasthya)

SECTION-C

Understanding Harmony in the Family and Society- Harmony in Human-Human

Relationship Understanding harmony in the Family- the basic unit of human interaction

Understanding values in human-human relationship; meaning of Nyaya and program for its

fulfillment to ensure Ubhay-tripti; Trust (Vishwas) and Respect (Samman) as the

foundational values of relationship Understanding the meaning of Vishwas; Difference

between intention and competence Understanding the meaning of Samman, Difference

between respect and differentiation; the other salient values in relationship Understanding the

harmony in the society (society being an extension of family): Samadhan, Samridhi, Abhay,

Sah-astitva as comprehensive Human Goals Visualizing a universal harmonious order in

society- Undivided Society (Akhand Samaj), Universal Order (Sarvabhaum Vyawastha )-

from family to world family!

SECTION-D

Understanding Harmony in the Nature and Existence - Whole existence as Coexistence

Understanding the harmony in the Nature Interconnectedness and mutual fulfillment among

the four orders of naturerecyclability and self-regulation in nature Understanding Existence

as Co-existence (Sah-astitva) of mutually interacting units in all-pervasive space Holistic

perception of harmony at all levels of existence.

TEXT BOOKS

1. 1. Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall,

New Jersey,2004 (Indian Reprint)

2. Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics –

Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian

Reprint now available)

3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New

Delhi, 2003

42


Semester III

DATA STRUCTURES USING ‘C’ LAB Course Code: CSE-351 L T P

0 0 2

1. Write a program to search an element in a two-dimensional array using linear search.

2. Using iteration & recursion concepts write programs for finding the element in the array

using Binary Search Method

3. Write a program to perform following operations on tables using functions only

(a) Addition (b) Subtraction (c) Multiplication (d) Transpose

4. Using iteration & recursion concepts write the programs for Quick Sort Technique

5. Write a program to implement the various operations on string such as length of string

concatenation, reverse of a string & copy of a string to another.

6. Write a program for swapping of two numbers using ‘call by value’ and ‘call by reference

strategies.

7. Write a program to implement binary search tree.

( Insertion and Deletion in Binary search Tree)

8. Write a program to create a linked list & perform operations such as insert, delete, update,

reverse in the link list

9 . Write the program for implementation of a file and performing operations such as insert,

delete, update a record in the file.

10. Create a linked list and perform the following operations on it

(a) add a node (b) Delete a node

11. Write a program to simulate the various searching & sorting algorithms and compare their

timings for a list of 1000 elements.

12. Write a program to simulate the various graph traversing algorithms.

13. Write a program which simulates the various tree traversal algorithms.

43


Semester III

DIGITAL ELECTRONICS LAB Course Code: ECE-351 L T P

0 0 2

Objective:

To understand the digital logic and create various systems by using these logics.

1. Introduction to digital electronics lab- nomenclature of digital ICs, specifications, study of

the data sheet, concept of Vcc and ground, verification of the truth tables of logic gates using

TTL ICs.

2. Implementation and verification of various logic gates..

3. Verification of state tables of RS, JK, T and D flip-flops.

4. Implementation and verification of Decoder/De-multiplexer and Encoder using logic gates.

5. Implementation of 4x1 multiplexer using logic gates.

6. Implementation of 4-bit parallel adder using 7483 IC.

7. Design, and verify the 4-bit synchronous counter.

NOTE :

Ten experiments are to be performed, out of which at least seven experiments should be

performed from above list. Remaining three experiments may either be performed from

the above list or designed & setup by the concerned institution as per the scope of the

syllabus.

44


Semester III

PC HARDWARE LAB Course Code: CSE-352 L T P

0 0 2

PC Software:

Application of basics of MS Word 2000, MS Excel 2000, MS Power Point 2000, MS

Access 2000. 1. To prepare the Your Bio Data using MS Word

2. To prepare the list of marks obtained by students in different subjects and show with the

help of chart/graph the average, min and max marks in each subject.

3. Prepare a presentation explaining the facilities/infrastructure available in your

college/institute.

4. Create a database of books in the library on a mini scale w.r.t. Computers and manipulate

the database using different forms and reports.

PC Hardware: 1. To check and measure various supply voltages of PC.

2. To make comparative study of motherboards.

3. To observe and study various cables, connections and parts used in computer

communication.

4. To study various cards used in a system viz. display card, LAN card etc.

5. To remove, study and replace floppy disk drive.

6. To remove, study and replace hard disk.

7. To remove, study and replace CD ROM drive.

8. To study monitor, its circuitry and various presents and some elementary fault detection.

9. To study printer assembly and elementary fault detection of DMP and laser printers.

10. To observe various cables and connectors used in networking.

11. To study parts of keyboard and mouse.

12. To assemble a PC.

13. Troubleshooting exercises related to various components of computer like monitor,

drives, memory and printers etc.

Reference Books: • Complete PC upgrade & maintenance guide, Mark Mines, BPB publ.

• PC Hardware: The complete reference, Craig Zacker & John Rouske, TMH

• Upgrading and Repairing PCs, Scott Mueller, 1999, PHI,

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

45


Semester IV

THEORY OF COMPUTATION

Course Code: CSE-401 L T P

3 1 0

Section-A Finite Automata and Regular Expressions: Finite State Systems, Basic Definitions Non-

Deterministic finite automata (NDFA), Deterministic finite automata (DFA), Equivalence of

DFA and NDFA Conversion of NFA to DFA Finite automata with E- moves, Regular

Expressions, Equivalence of finite automata and Regular Expressions, Regular expression

conversion and vice versa.

Introduction to Machines: Concept of basic Machine, Properties and limitations of FSM.

Moore and mealy Machines, Equivalence of Moore and Mealy machines, state and prove

Arden‟s Method.

Section-B

Properties of Regular Sets: The Pumping Lemma for Regular Sets, Applications of the

pumping lemma, Closure properties of regular sets, Myhill-Nerode Theorem and

minimization of finite Automata, Minimization Algorithm.

Grammars: Definition, Context free and Context sensitive grammar, Ambiguity regular

grammar, Reduced forms, Removal of useless Symbols, unit production and null production

Chomsky Normal Form (CNF), Griebach Normal Form (GNF).

Section-C

Pushdown Automata: Introduction to Pushdown Machines, Application of Pushdown

Machines

Turing Machines: Deterministic and Non-Deterministic Turing Machines, Design of T.M,

Halting problem of T.M., PCP Problem.

Section-D Chomsky Hierarchies: Chomsky hierarchies of grammars, Unrestricted grammars, Context

sensitive languages, Relation between languages of classes.

Computability: Basic concepts, Primitive Recursive Functions.

Text Book: 1. Introduction to automata theory, language & computations- Hopcroaft & O.D.Ullman,

R Mothwani, 2001, AW

Reference Books: 1. Theory of Computer Sc.(Automata, Languages and computation):K.L.P.Mishra &

N.Chandrasekaran, 2000, PHI.

2. Introduction to formal Languages & Automata-Peter Linz, 2001, Narosa Publ..

3. Fundamentals of the Theory of Computation- Principles and Practice by

RamondGreenlaw and H. James Hoover, 1998, Harcourt India Pvt. Ltd..

46


Semester IV

SOFTWARE ENGINEERING Course Code: CSE-402 L T P

3 1 0

Section-A Introduction: The process, software products, emergence of software engineering, evolving

role of software, software life cycle models, Software Characteristics, Applications, Software

crisis.

Software project management: Project management concepts, software process and project

metrics Project planning, project size estimation metrics, project estimation Techniques,

empirical estimation techniques, COCOMO- A Heuristic estimation techniques, staffing level

estimation, team structures, staffing, risk analysis and management, project scheduling and

tracking.

Section-B Requirements Analysis and specification requirements engineering, system modeling and

simulation Analysis principles modeling, partitioning Software, prototyping: , Prototyping

methods and tools; Specification principles, Representation, the software requirements

specification and reviews Analysis Modeling: Data Modeling, Functional modeling and

information flow: Data flow diagrams, Behavioral Modeling; The mechanics of structured

analysis: Creating entity/ relationship diagram, data flow model, control flow model, the

control and process specification; The data dictionary; Other classical analysis methods.

System Design: Design concepts and principles: the design process: Design and software

quality, design principles; Design concepts: Abstraction, refinement, modularity, software

architecture, control hierarchy, structural partitioning, data structure, software procedure,

information hiding; Effective modular design: Functional independence, Cohesion, Coupling;

Design Heuristics for effective modularity; The design model; Design documentation.

Section-C Architectural Design: Software architecture, Data Design: Data modeling, data structures,

databases and the data warehouse, Analyzing alternative Architectural Designs ,architectural

complexity; Mapping requirements into a software architecture; Transform flow, Transaction

flow; Transform mapping: Refining the architectural design.

Testing and maintenance: Software Testing Techniques, software testing fundamentals:

objectives, principles, testability; Test case design, white box testing, basis path testing:

Control structure testing: Black box testing, testing for specialized environments

,architectures and applications. Software Testing Strategies: Verification and validation, Unit

testing, Integration testing,; Validation testing, alpha and beta testing; System testing:

Recovery testing, security testing, stress testing, performance testing; The art of debugging,

the debugging process debugging approaches. Software re-engineering , reverse engineering

,restructuring, forward engineering.

Section-D Software Reliability and Quality Assurance :Quality concepts, Software quality assurance ,

SQA activities; Software reviews: cost impact of software defects, defect amplification and

removal; formal technical reviews: The review meeting, review reporting and record keeping,

review guidelines; Formal approaches to SQA; Statistical software quality assurance;

software reliability: Measures of reliability and availability ,The ISO 9000 Quality standards:

The ISO approach to quality assurance systems, The ISO 9001 standard, Software

Configuration Management. Computer Aided software Engineering: CASE, building blocks,

integrated case environments and architecture, repository.

Text Book: 1. Software Engineering – A Practitioner‟s Approach, Roger S. Pressman, 1996, MGH.

47

Reference Books: 1. Fundamentals of software Engineering, Rajib Mall, PHI

2. Software Engineering by Ian sommerville, Pearson Edu, 5th edition, 1999, AW,

3. Software Engineering – David Gustafson, 2002, T.M.H

4. Software Engineering Fundamentals Oxford University, Ali Behforooz and Frederick

J. Hudson 1995 JW&S,

48


Semester IV

DATA BASE MANAGEMENT SYSTEM Course Code: CSE-403 L T P

3 1 0

Section - A

Introduction, Client Server Arch., E-R Diagram and Keys Overview of database Management System; Various views of data, data Models, Introduction

to Database Languages. Advantages of DBMS over file processing systems, Responsibility of

Database Administrator,

Introduction to Client/Server architecture, Three levels architecture of Database Systems, E-R

Diagram (Entity Relationship), mapping Constraints, Keys, Reduction of E-R diagram into

tables.

Section - B

File Organization and Relational Model and Calculus: Sequential Files, index sequential files, direct files, Hashing, B-trees Index files.

Relational Model, Relational Algebra & various operations, Relational and Tuple calculus.

Section - C

Introduction to Query Languages: QLB , QBE, Structured query language – with special reference of (SQL of ORACLE),

integrity constraints, functional dependencies & NORMALISATION – (up to 4th

Normal

forms), BCNF (Boyce – code normal forms)

Section - D Introduction to Distributed Data processing, parallel Databases, data mining & data

warehousing, network model & hierarchical model, Introduction to transaction, properties of

transaction and life cycle of transaction, Introduction to Concurrency control and Recovery

systems., need of concurrency control and recovery system, problems in concurrent

transactions.

Text Books: • Database System Concepts by A. Silberschatz, H.F. Korth and S. Sudarshan, 3rd

edition, 1997, McGraw-Hill, International Edition.

• Introduction to Database Management system by Bipin Desai, 1991, Galgotia Pub.

Reference Books: • Fundamentals of Database Systems by R. Elmasri and S.B. Navathe, 3rd edition, 2000,

Addision-Wesley, Low Priced Edition.

• An Introduction to Database Systems by C.J. Date, 7th edition, Addison-Wesley, Low

Priced Edition, 2000.

• Database Management and Design by G.W. Hansen and J.V. Hansen, 2nd edition, 1999,

Prentice-Hall of India, Eastern Economy Edition.

• Database Management Systems by A.K. Majumdar and P. Bhattacharyya, 5th edition,

1999, Tata McGraw-Hill Publishing.

49


Semester IV

E-COMMERCE Course Code: CSE-404 L T P

3 1 0

Section A

Introduction: Definition of Electronic Commerce, E-Commerce: technology and prospects,

Incentives for engaging in electronic commerce, needs of E-Commerce, advantages and

Disadvantages, framework, Impact of E-commerce on business, E-Commerce Models.

Network Infrastructure for E- Commerce:

Internet and Intranet based E-commerce- Issues, problems and prospects, Network

Infrastructure, Network Access Equipments, Broadband telecommunication (ATM, ISDN,

and FRAME RELAY).

Section B

Mobile Commerce: Introduction, Wireless Application Protocol, WAP technology, Mobile

Information device. Web Security: Security Issues on web, Importance of Firewall, components of Firewall,

Transaction security, Emerging client server, Security Threats, Network Security, Factors to

Consider in Firewall design, Limitation of Firewalls.

Section C

Encryption: Encryption techniques, Symmetric Encryption: Keys and data encryption

standard, Triple encryption, Secret key encryption; Asymmetric encryption: public and

private pair key encryption, Digital Signatures, Virtual Private Network.

Section D

Electronic Payments: Overview, The SET protocol, Payment Gateway, certificate, digital

Tokens, Smart card, credit card, magnetic strip card, E-Checks, Credit/Debit card based EPS,

online Banking.

EDI Application in business, E- Commerce Law, Forms of Agreement, Govt. policies and

Agenda.

Text Book & Reference Books: 1. Ravi Kalakota, Andrew Winston, “Frontiers of Electronic Commerce”, Addison- Wesley.

2. Pete Lohsin , John Vacca “Electronic Commerce”, New Age International

3. Goel, Ritendra “E-commerce”, New Age International

4. Laudon, “E-Commerce: Business, Technology, Society”, Pearson Education

5. Bajaj and Nag, “E-Commerce the cutting edge of Business”, TMH

6. Turban, “Electronic Commerce 2004: A Managerial Perspective”, Pearson Education

50


Semester IV

COMPUTER NETWORKS Course Code: CSE-405 L T P

3 1 0

Section-A OSI Reference Model and Network Architecture: Introduction to Computer Networks,

Example networks ARPANET, Internet, Private Networks, Network Topologies: Bus-, Star-,

Ring-, Hybrid -, Tree -, Complete -, Irregular –Topology; Types of Networks : Local Area

Networks, Metropolitan Area Networks, Wide Area Networks; Layering architecture of

networks, OSI model, Functions of each layer, Services and Protocols of each layer

Section-B TCP/IP: Introduction, History of TCP/IP, Layers of TCP/IP, Protocols, Internet Protocol,

Transmission Control Protocol , User Datagram Protocol, IP Addressing, IP address classes,

Subnet Addressing, Internet Control Protocols, ARP, RARP, ICMP, Application Layer,

Domain Name System, Email – SMTP, POP,IMAP; FTP, NNTP, HTTP, Overview of IP

version 6.

Section-C Local Area Networks: Introduction to LANs, Features of LANs, Components of LANs,

Usage of LANs, LAN Standards, IEEE 802 standards, Channel Access Methods, Aloha,

CSMA, CSMA/CD, Token Passing, Ethernet, Layer 2 & 3 switching, Fast Ethernet and

Gigabit Ethernet, Token Ring, LAN interconnecting devices: Hubs, Switches, Bridges,

Routers, Gateways.

Wide Area Networks: Introduction of WANs, Routing, Congestion Control, WAN

Technologies, Distributed Queue Dual Bus (DQDB),

Section-D Synchronous Digital Hierarchy (SDH)/ Synchronous Optical Network (SONET),

Asynchronous Transfer Mode (ATM), Frame Relay.,Wireless Links.

Introduction to Network Management: Remote Monitoring Techniques: Polling, Traps,

Performance Management, Class of Service, Quality of Service, Security management,

Firewalls, VLANs, Proxy Servers, Introduction to Network Operating Systems: Client-Server

infrastructure, Windows NT/2000.

Text Book: 1. Computer Networks (3rd edition), Tanenbaum Andrew S., International edition, 1996.

Reference Books: 1. Data Communications, Computer Networks and Open Systems (4th edition), Halsall

Fred, 2000,

2. Addison Wesley, Low Price Edition.

3. Business Data Communications, Fitzgerald Jerry,.

51


Semester IV

HUMAN RESOURCES MANAGEMENT Course Code: HUM-401 L T P

2 1 0

SECTION-A

Human Resources Management (HRM) : Meaning, Nature and Scope, Difference between

HRM and Personnel Management, HRM functions and objectives, Evolution of HRM

environment – external and internal.

Human Resources Development in India: evolution and principles of HRD, HRD Vs.

Personnel functions, Role of HR managers.

Strategic Human Resource Management : Nature of Strategies and Strategic Management,

Strategic Management Process – Environmental Scanning, Strategy Formulation,

implementation and evaluation.

SECTION-B

Human Resources planning: Definition, purposes, processes and limiting factors; Human

Resources Information system (HRIS): HR accounting and audit, Job Analysis – Job

Description, Job Specification.

The systematic approach to recruitment: recruitment policy, recruitment procedures,

recruitment methods and evaluation.

The systematic approach to selection: the selection procedure, the design of application form,

selection methods, the offer of employment, and evaluation of process.

SECTION-C Training and Development: Purpose, Methods and issues of training and management

development programmes.

Performance Appraisal: Definition, Purpose of appraisal, Procedures and Techniques

including 360 degree Performance Appraisal, Job Evaluation.

Compensation Administration: Nature and Objectives of compensation, components of pay

structure in India, Wage Policy in India – Minimum Wage, Fair Wage and Living Wage.

Incentive Payments : Meaning and Definition, Prerequisites for an effective incentive system,

Types and Scope of incentive scheme, Incentive Schemes in Indian Industries, Fringe

Benefits.

SECTION-D Discipline and Grievance Procedures: Definition, Disciplinary Procedure, Grievance

Handling Procedure.

Industrial Relations: Nature, importance and approaches of Industrial Relations.

Promotion, Transfer and Separation: Promotion – purpose, principles and types; Transfer –

reason, principles and types; Separation – lay-off, resignation, dismissal, retrenchment,

Voluntary Retirement Scheme.

Text Books: 1. Human Resources and Personal Management-K . Aswathappa-Tata McGraw Hill

Publishing Company Ltd.

2. Personnel Management : C.B. Mamoria, Himalaya Publishing House.

3. Organisational Behaviour – Dr. L.M Prasad (Sultan Chand & Sons)

Reference Books: 1. Personnel Management & Industrial Relations : Dr. T.N. Bhagoliwal : Sahitya Bhawan

Agra.

2. Personnel Management : V.G. Karnik, Jaico Publishing House.

3. Personnel Management & Industrial Relation: Tripathi: Sultan, Chand & Sons.

52


Semester IV

DATABASE MANAGEMENT SYSTEMS LAB Course Code: CSE-451 L T P

0 0 2

I. Create a database and write the programs to carry out the following operation: 1. Add a record in the database

2. Delete a record in the database

3. Modify the record in the database

4. Generate queries

5. Generate the report

6. List all the records of database in ascending order.

II Develop two menu driven project for management of database system: 1. Library information system

a. Engineering

b. MCA

2. Inventory control system

a. Computer Lab

b. College Store

3. Student information system

c. Academic

d. Finance

4. Time table development system

e. CSE, IT & MCA Departments

f. Electrical & Mechanical Departments

Usage of S/w: 1. VB, ORACLE and/or DB2

2. VB, MSACCESS

3. ORACLE, D2K

4. VB, MS SQL SERVER 2000


53


Semester IV

SOFTWARE ENGG. & TESTING LAB Course Code: CSE-452 L T P

0 0 2

EXPERIMENT-1Phases in software development project, overview, need, coverage of topics EXPERIMENT-2 To assign the requirement engineering tasks EXPERIMENT-3 To perform the system analysis: Requirement analysis, SRS EXPERIMENT-4 To perform the function oriented diagram: DFD and Structured chart EXPERIMENT-5 To perform the user’s view analysis: Use case diagram EXPERIMENT-6 To draw the structural view diagram: Class diagram, object diagram EXPERIMENT-7 To draw the behavioral view diagram: Sequence diagram, Collaboration diagram EXPERIMENT-8 To draw the behavioral view diagram: State-chart diagram, Activity diagram EXPERIMENT-9 To draw the implementation view diagram: Component diagram EXPERIMENT-10 To draw the environmental view diagram : Deployment diagram EXPERIMENT-11 To perform various testing using the testing tool unit testing, integration testing

54


Semester IV

COMPUTER NETWORKS LAB Course Code: CSE-453 L T P

0 0 2

This course provides students with hands on training regarding the design, troubleshooting,

modeling and evaluation of computer networks. In this course, students are going to

experiment in a real test-bed networking environment, and learn about network design and

troubleshooting topics and tools such as: network addressing, Address Resolution Protocol

(ARP), basic troubleshooting tools (e.g. ping, ICMP), IP routing (e,g, RIP), route discovery

(e.g. traceroute), TCP and UDP, IP fragmentation and many others. Student will also be

introduced to the network modeling and simulation, and they will have the opportunity to

build some simple networking models using the tool and perform simulations that will help

them evaluate their design approaches and expected network performance.

55


Semester V

DATA WAREHOUSING & DATA MINING Course Code: CSE-501 L T P

3 1 0

Section-A

Overview, Motivation (for Data Mining), Data Mining-Definition & Functionalities, Data

Processing, Form of Data Preprocessing, Data Cleaning: Missing Values, Noisy

Data,(Binning, Clustering, Regression, Computer and Human inspection),Inconsistent Data,

Data Integration and Transformation. Data Reduction:-Data Cube Aggregation,

Dimensionality reduction, Data Compression, Numerosity Reduction, Clustering,

Discretization and Concept hierarchy generation

Section-B

Concept Description:- Definition, Data Generalization, Analytical Characterization, Analysis

of attribute relevance, Mining Class comparisons, Statistical measures in large Databases.

Measuring Central Tendency, Measuring Dispersion of Data, Graph Displays of Basic

Statistical class Description, Mining Association Rules in Large Databases, Association rule

mining, mining Single-Dimensional Boolean Association rules from Transactional

Databases– Apriori Algorithm, Mining Multilevel Association rules from Transaction

Databases and Mining Multi-Dimensional Association rules from Relational Databases

Section-C

Classification and Predictions:

What is Classification & Prediction, Issues regarding Classification and prediction, Decision

Tree, Bayesian Classification, Classification by Back propagation, Multilayer feed-forward

Neural Network, Back propagation Algorithm, Classification methods K-nearest neighbor

Classifiers, Genetic Algorithm.

Cluster Analysis:

Data types in cluster analysis, Categories of clustering methods, Partitioning methods.

Hierarchical Clustering- CURE and Chameleon, Density Based Methods-DBSCAN,

OPTICS, Grid Based Methods- STING, CLIQUE, Model Based Method –Statistical

Approach, Neural Network approach, Outlier Analysis

Section-D

Data Warehousing: Overview, Definition, Delivery Process, Difference between Database

System and Data Warehouse, Multi Dimensional Data Model, Data Cubes, Stars, Snow

Flakes,Fact Constellations, Concept hierarchy, Process Architecture, 3 Tier Architecture,

Data Marting.

Aggregation, Historical information, Query Facility, OLAP function and Tools. OLAP

Servers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery,

Tuning Data Warehouse, Testing Data Warehouse.

Books:

1. M.H.Dunham,”Data Mining:Introductory and Advanced Topics” Pearson

Education

2. Jiawei Han, Micheline Kamber, ”Data Mining Concepts & Techniques” Elsevier

3. Sam Anahory, Dennis Murray, “Data Warehousing in the Real World : A Practical Guide

for Building Decision Support Systems, Pearson Education

4. Mallach,”Data Warehousing System”,McGraw –Hill

56


Semester V

OPERATING SYSTEM Course Code: CSE-502 L T P

3 1 0

Section-A Introduction: Introduction to Operating System Concepts (including Multitasking,

multiprogramming, multi user, Multithreading

etc)., Types of Operating Systems: Batch operating system, Time-sharing systems,

Distributed OS, Network OS, Real Time OS; Various Operating system services,

architecture, System programs and calls.

Process Management: Process concept, process scheduling, operation on processes; CPU

scheduling, scheduling criteria, scheduling algorithms -First Come First Serve (FCFS),

Shortest-Job-First (SJF), Priority Scheduling, Round Robin(RR), Multilevel Queue

Scheduling.

Section-B

Memory Management: Logical & Physical Address Space, swapping, contiguous memory

allocation, non-contiguous memory allocation paging and segmentation techniques,

segmentation with paging; virtual memory management - Demand Paging & Page-

Replacement Algorithms; Demand Segmentation.

Section-C

File System: Different types of files and their access methods, directory structures, various

allocation methods, disk scheduling and management and its associated algorithms,

Introduction to distributed file system.

Process-Synchronization & Deadlocks: Critical Section Problems, semaphores; methods

for handling deadlocks-deadlock

prevention, avoidance & detection; deadlock recovery.

Section - D

I/O Systems: I/O Hardware, Application I/O Interface, Kernel, Transforming I/O requests,

Performance Issues and Thresds

Unix System And Windows NT Overview Unix system call for processes and file system management, Shell interpreter, Windows NT

architecture overview, Windows NT file system.

Text Books:

1. Operating System Concepts by Silberchatz et al,5th

edition, 1998, Addison-Wesley.

2. Modern Operating Systems by A. Tanenbaum, 1992, Prentice-Hall. Th

3. Operating Systems Internals and Design Principles by William Stallings,4 edition,

2001, Prentice-Hall

4. Operating System By Peterson , 1985, AW. Operating System By Milankovic, 1990,

TMH.

57


Semester V

MICROPROCESOR & ITS APPLICATIONS Course Code: ECE-501 L T P

3 1 0

Section-A Introduction to Microprocessor, Microprocessor architecture and its operations, Memory,

Input & output devices, Logic devices for interfacing, The 8085 MPU, Example of an 8085

based computer, Memory interfacing.

Basic interfacing concepts, Interfacing output displays, Interfacing input devices, Memory

mapped I/O, Flow chart symbols, Data Transfer operations, Arithmetic operations, Logic

Operations, Branch operation, Writing assembly language programs, Programming

techniques: looping, counting and indexing

Section-B Additional data transfer and 16 bit arithmetic instruction, Arithmetic operations related to

memory, Logic operation: rotate, compare, counter and time delays, Illustrative program:

Hexadecimal counter, zero-to-nine, (module ten) counter, generating pulse waveforms,

debugging counter and time delay, Stack, Subroutine, Restart, Conditional call and return

instructions, Advance subroutine concepts, The 8085 Interrupts, 8085 vector interrupts

Section-C Program: BCD-to-Binary conversion, Binary-to-BCD conversion, BCD-to- Seven segment

code converter, Binary-to-ASCII and ASCII-to-Binary code conversion, BCD Addition, BCD

Subtraction, Introduction to Advance instructions and Application, Multiplication,

Subtraction with carry.

Section-D 8255 Programmable peripheral interface, interfacing keyboard and seven segment display,

8254 (8253) programmable interval timer, 8259A programmable interrupt controller, Direct

Memory Access and 8237 DMA controller. Introduction to 8086 microprocessor:

Architecture of 8086 (Pin diagram, Functional block diagram, Register organization).

TEXT BOOKS : 1. Microprocessor Architecture, Programming & Applications with 8085 : Ramesh S

Gaonkar; Wiley Eastern Ltd.

2. The Intel Microprocessors 8086- Pentium processor : Brey; PHI

REFERENCE BOOKS: 1. Microprocessors and interfacing : Hall; TMH

2. The 8088 & 8086 Microprocessors-Programming, interfacing,Hardware &

Applications :Triebel & Singh; PHI

3. Microcomputer systems: the 8086/8088 Family: architecture, Programming & Design :

Yu-Chang Liu & Glenn A Gibson; PHI.

4. Advanced Microprocessors and Interfacing : Badri Ram; TMH

58


Semester V

COMPLIER DESIGN Course Code: CSE-503 L T P

3 1 0

SECTION A

Introduction to Compilers:Need for translators – Structure of a compiler – Error handling –

Compiler writing tools.

Lexical Analysis:

The role of lexical analyze – Design – Languages for specifying lexical analyzer

implementation.

SECTION B

Parsing:Parsers – Shift reduce parsers – Operator Precedence parsing – Top down

Parsing – Predictive parsers.

Automatic Construction of Efficient Parsers:

LR Parsers – Construction SLR, Canonical LR and LALR Parsing tables –

Automatic parser generation – Implementation of LR parsing tables.

SECTION C

Syntax Directed Translation:

Schemes – Implementation – Intermediate code – Parse trees and syntax trees – Three

Address code – Quadruples and triples – Translation of assignment statements – Boolean

expressions.

Symbol tables and runtime storage:

Contents of Symbol table – Data structures for symbol table – Representation of scope

information – Implementation of stack allocation schemes – Block Structured languages and

storage allocation.

SECTION D

Introduction to Code Optimization:

Principal sources – Loop optimization – Global data flow analysis.

Code Generation:Object program – Problems in code generation – A simple code generator -

Register allocation and assignment.

Text Books:

Alfred V.Aho & Jeffrey D. Ullman : PRINCIPLES OF COMPILER DESIGN; Narosa Publishing

House, 1990

References:

1. Alfred V. Aho et.al. : COMPILERS:PRINCIPLES, TECHNIQUES AND

TOOLS; Addison Wesley Publishing Company, 1986

2. Dhamdhere D.M.: COMPILER CONSTRUCTION-PRINCIPLES AND PRACTICE;

McMillan India Ltd.

1. Ravi Sethi & Ullman: COMPILER DESIGN; Narosa Publishing House.

2. David Gries :COMPILER CONSTRUCTION FOR DIGITALCOMPUTERS; John Wiley

&Sons

59


Semester V

WEB DEVELOPMENT Course Code: CSE-504 L T P

3 1 0

Section A JAVA: Introduction to JAVA, Basics Data Types, Operators, Classes and Methods, Access

Specifiers, Arrays, Inheritance, Polymorphism, Threads, Package and Interfaces, Exception

Handling, IO Applets, Generics and Collections

Section B

Basic terms: WWW, XML, HTML, XHTML, W3C. Descriptive markup: Meta tags for common tasks, semantic tags for aiding search, the

doubling code and RDF. Separating style from structure with style sheets: Internal style

specifications within HTML, External linked style specification using CSS, page and site

design considerations.

Client side programming: Introduction to the JavaScript syntax, the JavaScript object

model, Event handling, Output in JavaScript, Forms handling, miscellaneous topics such as

cookies, hidden fields, and images; Applications.

Section C Server side programming: Introduction to Server Side Technologies CGI/ASP/JSP.,

Programming languages for server Side Scripting, Configuring the server to support CGI, its

applications; Input /output operations on the WWW. Forms processing, (using PERL /

VBScript / JavaScript)

Section D Other dynamic content Technologies: Introduction to ASP & JSP, Delivering multimedia

over web pages, The VRML idea, The Java phenomenon-applets and Servlets, issues and

web development.

Introduction to Microsoft .NET Technology and its comparison with the competing

Technologies

Text Books: 1. JAVA: The Complete Reference, Herbert Schildt

2. Beginning XHTML by Frank Boumpery, Cassandra Greer, Dave Raggett, Jenny

Raggett, Sebastian Schnitzenbaumer & ted Wugofski, 2000, WROX press (Indian

Shroff Publ. SPD) 1st edition

3. HTML & XHTML: The Definitive Guide by Chuck Musciano, Bill Kennedy, 2000,

4th Edi.

Reference books: 1. XHTML Black Book by Steven Holzner, 2000

2. CGI Programming on the World Wide Web. O’Reilly Associates.

3. Web Technologies By Achyut S Godbole , Atul Kahate, 2003, T.M.H

60


Semester V

MANEGERIAL ECONOMICS Course Code: HUM-501 L T P

2 1 0

Section-A

Introduction to Economics; Nature and Scope of Management Economics, Significance in

decision-making and fundamental concepts. Objectives of a firm.

Section-B

Demand Analysis; Law of Demand, Exceptions to the law of Demand, Determinants of

Demand. Elasticity of Demand- Price, Income, Cross and Advertising Elasticity; Uses of

Elasticity of Demand for managerial decision making, measurement of Elasticity of Demand.

Demand forecasting meaning, significance and methods.

Supply Analysis; Law of Supply, Supply Elasticity; Analysis and its uses for managerial

decision making.

Production concepts & analysis; Production function, single variable-law of variable

proportion, two variable-Law of returns to scale.

Cost concept and analysis, short-run and long-run cost curves and its managerial use.

Section-C

Market Equilibrium and Average Revenue Concept.

Market Structure: Perfect Competition, features, determination of price under perfect

competition.

Monopoly: Feature, pricing under monopoly, Price Discrimination.

Monopolistic: Features, pricing under monopolistic competition, product differentiation.

Oligopoly: Features, kinked demand curve, cartels, price leadership.

Pricing Strategies; Price determination, full cost pricing, product line pricing, price

skimming, penetration pricing.

Section-D

National Income; Concepts and various methods of its measurement, Inflation, types and

causes, Business Cycle, Profit concept and major theories of profits; Dynamic Surplus theory,

Risk & Uncertainty bearing theory and Innovation theory.

Text Books: 1. Principles of Economics : P.N. Chopra (Kalyani Publishers).

2. Modern Economic Theory – K.K. Dewett (S.Chand)

Reference Books : 1. A Text Book of Economic Theory Stonier and Hague (Longman’s Landon)

2. Micro Economic Theory – M.L. Jhingan (S.Chand)

61


Semester V

OPERATING SYSTEM LAB Course Code: CSE-551 L T P

0 0 2

Study of WINDOWS 2000 Operating System.

Administration of WINDOWS 2000 (including DNS,LDAP, Directory Services)

Study of LINUX Operating System (Linux kernel, shell, basic commands pipe& filter

Administration of LINUX Operating System.

Writing of Shell Scripts (Shell programming).

AWK programming.

62


Semester V

WEB DEVELOPMENT & CORE JAVA LAB Course Code: CSE-552 L T P

0 0 2

Java programs using classes & objects and various control constructs such as loops etc , and

data structures such as arrays , structures and functions.

Java programs for creating Applets for display of Images ,Texts and Animation Programs

related to interfaces & packages

Input output & Random files programs in java Java programs using Event driven concept

Programs related to

Network Programming

Development of Web site for the college or newspaper agency.

Books recommended for Lab. 1. Java Elements – Principles of Programming in Java , Duane A. Bailey , Duane W.

Bailey, 2000, T.M.H

2. The Java Handbook by Patrick Naughton, TMH, N.Delhi

63


Semester V

MICROPROCESSOR LAB Course Code: ECE-551 L T P

0 0 2

List of Experiments:-

1.Simple programs for sorting a list of numbers in ascending and descending order.

2. To find the largest and smallest number in an array of data using 8085 instruction set.

3. Sorting a list without destroying the original list.

4. Code conversion - Binary to Gray/Gray to Binary.

5. Program for addition of BCD numbers.

6. Program for multiplication of 8-bit numbers .

7. Interface an LED array and 7-segment display through 8255 and display a specified bit

pattern/character sequence at an interval of 2 seconds.

8. Interface the given microprocessor kit to a personal computer through R.S-232C. The band

rate is specified. Verify data transfer in both directions ( P - PC and PC - P)

9. Assembly language programming of 8086

Note: At least ten experiments have to be performed in the semester out of which seven

experiments should be performed from above list.

Remaining three experiments may either be performed from the above list or designed & set

by the concerned institution as per the scope of the syllabus of EE-309-C.

64


Semester VI

ANALYSIS & DESIGN OF ALGORITHM Course Code: CSE-601 L T P

3 1 0

Section-A Brief Review of Graphs, Sets and disjoint sets, union, sorting and searching algorithms and

their analysis in terms of space and time complexity.

Divide and Conquer: General method, binary search, merge sort, qick sort, selection sort,

Strassen‟s matrix multiplication algorithms and analysis of algorithms for these problems.

Section-B Greedy Method: General method, knapsack problem, job sequencing with dead lines,

minimum spanning trees, single souce paths and analysis of these problems.

Dynamic Programming: General method, optimal binary search trees, O/I knapsack, the

traveling salesperson problem.

Section-C Back Tracking: General method, 8 queen‟s problem, graph colouring, Hamiltonian cycles,

analysis of these problems.

Branch and Bound: Method, O/I knapsack and traveling salesperson problem, efficiency

considerations. Techniques for algebraic problems, some lower bounds on parallel

computations.

Section-D NP Hard and NP Complete Problems: Basic concepts, Cook‟s theorem, NP hard graph and

NP scheduling problems some simplified NP hard problems.

Text Books: 1. Fundamental of Computer algorithms, Ellis Horowitz and Sartaj Sahni, 1978, Galgotia

Publ.

2. Introduction To Algorithms, Thomas H Cormen, Charles E Leiserson And Ronald L

Rivest: 1990, TMH

Reference Books: 1. The Design and Analysis of Computer Algorithm, Aho A.V. Hopcroft J.E., 1974,

Addison Wesley.

2. Algorithms-The Construction, Proof and Analysis of Programs, Berlion, P.Bizard, P.,

1986. Johan Wiley & Sons,

3. Writing Efficient Programs, Bentley, J.L., PHI

4. Introduction to Design and Analysis of Algorithm, Goodman, S.E. & Hedetnieni, 1997,

MGH.

5. Introduction to Computers Science- An algorithms approach , Jean Paul Trembley,

Richard B.Bunt, 2002, T.M.H.

65


Semester VI

DIGITAL IMAGE PROCESSING Course Code: ECE-601 L T P

3 1 0

SECTION – A

Introduction and Fundamentals

Motivation and Perspective, Applications, Components of Image Processing System, Element

of Visual Perception, a Simple Image Model, Sampling and Quantization.

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 High pass Filters; Homomorphism Filtering.

SECTION – B

Image Enhancement in Spatial Domain

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; Sharpening –

The Laplacian.

SECTION – C

Image Restoration

A Model of Restoration Process, Noise Models, Restoration in the presence of Noise only-

Spatial Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order

Statistic Filters –Median Filter, Max and Min filters; Periodic Noise Reduction by Frequency

Domain Filtering –Band pass Filters; Minimum Mean-square Error Restoration.

Morphological Image Processing

Introduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening and

Closing, Morphological Algorithms – Boundary Extraction, Region Filling, Extraction of

Connected Components, Convex Hull, Thinning, Thickening

SECTION – D

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 and Line Detection: Edge Detection, Edge

Operators, Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements

Extraction by Thresholding, Edge Detector Performance, Line Detection, Corner Detection.

Text Books: 1. Digital Image Processing 2ndEdition, 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.

66


Semester VI

COMPUTER GRAPHICS


3 1 0

Section-A Introduction to Computer Graphics: What is Computer Graphics, Computer Graphics

Applications, Computer Graphics Hardware and software, Two dimensional Graphics

Primitives: Points and Lines, Line drawing algorithms: DDA, Bresenham‟s; Circle drawing

algorithms: Using polar coordinates, Bresenham‟s circle drawing, midpoint circle drawing

algorithm; Filled area algorithms: Scan line: Polygon filling algorithm, boundary filled

algorithm.

Section-B

Two/Three Dimensional Viewing: The 2-D viewing pipeline, windows, viewports, window

to view port mapping; Clipping: point, clipping line (algorithms):- 4 bit code algorithm,

Sutherland-cohen algorithm, parametric line clipping algorithm (Cyrus Beck).

Polygon clipping algorithm: Sutherland-Hodgeman polygon clipping algorithm. Two

dimensional transformations: transformations, translation, scaling, rotation, reflection,

composite transformation.

Section-C

Three-dimensional transformations: Three dimensional graphics concept, Matrix

representation of 3-D Transformations, Composition of 3-D transformation.

Viewing in 3D: Projections, types of projections, the mathematics of planner geometric

projections, coordinate systems.

Hidden surface removal: Introduction to hidden surface removal. The Z- buffer algorithm,

scanline algorithm, area sub-division algorithm.

Section-D

Representing Curves and Surfaces: Parametric representation of curves: Bezier curves, B-

Spline curves. Parametric representation of surfaces; Interpolation method.

Illumination, shading, image manipulation: Illumination models, shading models for

polygons, shadows, transparency. What is an image? Filtering, image processing, geometric

transformation of images.

Text Books: & Reference Books: 1. Computer Graphics Principles and Practices second edition by James D. Foley,

Andeies van Dam, Stevan K. Feiner and Johb F. Hughes, 2000, Addision Wesley.

2. Computer Graphics by Donald Hearn and M.Pauline Baker, 2nd

Edition, 1999, PHI

3. Procedural Elements for Computer Graphics – David F. Rogers, 2001, T.M.H Second

Edition Fundamentals of 3Dimensional Computer Graphics by Alan Watt, 1999,

Addision Wesley. Computer Graphics: Secrets and Solutions by Corrign John, BPB

67


Semester VI

ADVANCED JAVA Course Code: CSE-603 L T P

3 1 0

SECTION-A

Core Java

Introduction to Java, Data types, variables, operators, Arrays, Control Statements, Classes &

Methods, Inheritance, Exception Handling, Multithreading, Collections, I/O streams, AVVT

& Apolet Programming.

Networking

Connecting to a Server, Implementing Servers, Sending E-Mail, Making URL Connections,

Advanced Socket Programming

SECTION-B

Database Networking

The Design of JDBC. The Structured Query Language, JDBC Installation, Basic JDBC

Programming Concepts, Query Execution, Scrollable and Updatable Result Sets, Matadata,

Row Sets, Transactions, Advanced Connection Management, Introduction of LDAP

Distributed Objects The Roles of Client and Server, Remote Method Invocations, Setup for Remote Method

Invocation, Parameter Passing in Remote Methods Server Object Activation, Java IDL and

CCRA, Remote Method Calls with SOAP

SECTION-C

Swing Lists, Trees, Tables, Styled Text Components, Progress Indicators, Component Organizers

AWT The Rendering Pipeline, Shapes, Areas, Strokes, Paint, Coordinate Transformations,

Clipping, Transparency and Composition, Rendering Hints, Readers and Writers for Images,

Image Manipulation, Printing. The Clipboard, Drag and Drop

SECTION-D

Javabeans Components Beans, The Bean-Writing Process, Using Beans to Build an Application, Naming Patterns for

Bean Components and Events Bean Property Tubes Beaninfo Classes Property Editors

Cuatomizes

Security Class Loaders, Bytecode Verification, Security Managers and Permissions, Digital

Signatures, Code Signing, Encryption

Text Book:

Core JavaTM

2, Volume II-Advanced Features, 7th

Edition by Cay Horetmann, Gary Cornelll

Pearson Publisher, 2004

Reference Books: 1. Professional Java Programming by Brett Spell, WROX Publication

2. Advanced Java 2 Platform, How to Program, 2nd

Edition, Harvey. M. Dietal, Prentice

Hall

68


Semester VI

PRINCIPLE OF MANEGEMENT Course Code: HUM-601 L T P

2 1 0

Section-A Management: Concept, Nature, Importance; Management: Art and Science, Management As

a Profession, Management Vs. Administration, Management Skills, Levels of Management,

And Characteristics of Quality Managers. Evolution of Management: Early contributions,

Taylor and Scientific Management, Fayol’s Administrative Management, Bureaucracy,

Hawthorne Experiments and Human Relations, Social System Approach, Decision Theory

Approach. Social Responsibility of Managers and Ethics in Managing.

Section-B Introduction to Functions of Management Planning: Nature, Scope, Objectives and

Significance of Planning, Types of Planning, Process of Planning, Barriers to Effective

Planning, Planning Premises and Forecasting, Key to Planning, Decision Making.

Organizing: Concept, Organization Theories, Forms of Organizational Structure, Combining

Jobs: Departmentation, Span of Control, Delegation of Authority, Authority &

Responsibility, and Organizational Design.

Section-C Staffing: Concept, System Approach, Manpower Planning, Job Design, Recruitment &

Selection, Training & Development, Performance Appraisal Directing: Concept, Direction

and Supervision Motivation: Concept, Motivation and Performance, Special Motivational

techniques: Money, participation, reward systems, Quality of Work Life, Job Enrichment &

Morale Building.

Section-D Leadership: Concept and Functions, Process and models of Leadership Development,

Contemporary views on Leadership: Transformational-Transactional, Charismatic-Visionary

leadership. Controlling: Concept, Types of Control, Methods: Pre-control: Concurrent

Control: Post-control, An Integrated Control System, The Quality Concept Factors affecting

Quality, Developing a Quality Control System, Total Quality Control, Pre-control of Inputs,

Concurrent Control of Operations. Post Control of Outputs.

Reference Books: 1. Stoner, Freeman & Gilbert Jr - Management (Prentice Hall of India, 6

Th Edition)

2. Koontz Harold & Weihrich Heinz – Essentials of management (Tata Mc Graw Hill, 5th

Edition 2008)

3. Robbins & Coulter - Management (Prentice Hall of India, 9th

Edition)

4. Robbins S.P. and Decenzo David A. - Fundamentals of Management: Essential

Concepts and Applications (Pearson Education, 6th

Edition)

5. Weihrich Heinz and Koontz Harold - Management: A Global and Entrepreneurial

Perspective (McGraw Hill, 12th

Edition 2008)

69


Semester VI

SYSTEM ADMINISTRATION (UNIX)


3 1 0

Section A

Introduction to LINUX and UNIX, Architecture of UNIX operating system, System Structure,

User perspective, Essential tasks of system administrator, LINUX installation

Booting and shutting down : Boot strapping /Booting/Boot Loaders (LILO, GRUB), booting

single user mode, rebooting and shutting down

System Management : Super user, choosing root password, system configuration, system

directories & files, Performance analysis tools & processes

Section B

User management : Password files, managing user environment, adding user, removing user,

login access, disabling user, account management utilities, managing groups, light weight

directory access protocol.File Management : Path names, mounting and unmounting files

systems, file tree, file types, file attributes, configuring RAID devices,

Process management: components of a process, (PID, PPID, UID, EUID,) signals, send

signals, (kill, killall), process states, nice and renice, monitor processes, (ps, top), runway

processes

Section C

Adding a Disk : Disk interfaces, disk installation procedure, ext2 and ext3 file

systems,FSCK(check and repair file systems), Adding a disk to linux

Devices and printer : serial standard, alternative connectors, hard and soft carriers, serial

device files, software configuration for serial devices, configuration of hardware terminals,

special character and terminal drivers, modems, common I/O ports multimedia devices(sound,

video and DVD ), installing sound, network & other cards

Section D

Backup devices and media ,setting up backup using dump, restore.System and Log files:

logging policies, LINUX LOG files, LOGROTATE, SYSLOG, condensing log files to useful

information. Kernal Administration: precautionary steps for modifying kernel, kernal

adaptation, configuration methods, building a LINUX kernel

TEXT BOOKS:

1. Richard L. Petersen " LINUX the complete reference "

2. Maurice J. Bach " The design of UNIX operating System "

3. Evi Nemath, Garth Snyder , Trent R Hein " Linux Administration Hand Book "

REFERENCE BOOKS:-

1. “The UNIX programming Environment “Brain Kernighem & Rob Pike

2. “Introduction to UNIX & LINUX “ John Muster

3. Advanced UNIX programmer’s Guide “ Stephen Prato

4. “UNIX concepts & Applications Featuring SCO UNIX & LINUX “ 2nd Ed. Sumitabha

D

70


Semester VI

ADVANCED JAVA LAB Course Code: CSE-651 L T P

0 0 2

Development of programs relating to:

• JDBC

• Servlets

• Beans

• RMI

• JSP

71


Semester VI

DIGITAL IMAGE PROCESSING LAB Course Code: ECE-651 L T P

0 0 2

The following programs should be developed in ‘C’ language preferably on ‘UNIX

‘platform.

The graphical development environment can be created using some appropriate library like

‘OpenGL’:

1. Implement the spatial image enhancement functions on a bitmap image –

(a) Mirroring (Inversion) (b) Rotation

(Clockwise) (c) Enlargement (Double Size)

2. Implement (a) Low Pass Filter (b) High Pass Filter

3. Implement (a) Arithmetic Mean Filter (b) Geometric Mean Filter

4. Implement Smoothing and Sharpening of an eight bit color image

5. Implement (a) Boundary Extraction Algorithm (b) Graham's Scan Algorithm

6. Implement (a) Edge Detection (b) Line Detection

72


Semester VI

COMPUTER GRAPHICS LAB Course Code: CSE-652 L T P

0 0 2

List of programs to be developed 1. Write a program for 2D line drawing as Raster Graphics Display.

2. Write a program for circle drawing as Raster Graphics Display.

3. Write a program for polygon filling as Raster Graphics Display

4. Write a program for line clipping.

5. Write a program for polygon clipping.

6. Write a program for displaying 3D objects as 2D display using perspective

transformation.

7. Write a program for rotation of a 3D object about arbitrary axis.

8. Write a program for Hidden surface removal from a 3D object.


73


Semester VII

ARTIFICAL INTELLIGENCE & EXPERT SYSTEM Course Code: CSE-701 L T P

3 1 0

SECTION-A

Introduction to Artificial intelligence: Scope, history & applications: AI as

representation and search the predicate calculus inference rules. Logic based financial

advisor, structures and strategies for state space search graph theory, strategies for

space search, using state space to represent reasoning with the predicate calculus.

Heuristic Search: An algorithm for heuristic search, admissibility monotonicity and

informed ness heuristics in games, complexity issues, control and implementation of

state space search recursion based search, pattern directed search. Production systems,

predicate calculus and planning the black board architecture for problems solving.

SECTION-B

LISP and PROLOG: Knowledge representation languages issues in knowledge

representation, network representation language, structured representations,

introduction to LISP, Search in LISP: a functional approach to the farmer, Wolf, Goat

and cabbage problem, higher order functions & procedural abstraction, search

strategies in LIPS.

SECTION-C

Expert systems: Introduction, History basic concepts, structure of expert systems, the

human element in ES how ES works, problem areas addressed by ES, ES success

factors, types of expert systems, ES and the internet interacts web, knowledge

engineering, scope of knowledge, difficulties, in knowledge acquisition methods of

knowledge acquisition, machine learning, intelligent agents, selecting an appropriate

knowledge acquisition method, knowledge acquisition form multiple experts

validation and verification of the knowledge base, analyzing coding, documenting &

diagramming.

SECTION-D Expert systems- II, societal impacts reasoning in artificial intelligence, inference with

rules, with frames: model based reasoning, case based rezoning, explanation & meta

knowledge inference with uncertainty representing uncertainty probabilities and

related approaches, theory of certainty (certainty factors) Qualitative reasoning, the

development life cycle, phases I, II, III, IV, V, VI the future of expert system

development process societal impacts.

Text Books:

1. Efrain Turban and Jay E Aranson: Decision support systems & intelligent systems (5th

Edn.) Prentice hall, 1998.

2. Donald A Waterman: A Guide to expert Systems, Addison -Wesley 1995

3. G.F. Luger & W.A Stubble Field -Artificial Intelligence structures and Strategies for

complex problem solving, 3 rd Edn. Addision Wesley 1998.

4. E.Rich and Knight, Artificial Intelligence, Second Edn, Tata Mc. Graw Hill Publishing,

1981.

74


Semester VII

SOFTWARE PROJECT MANAGEMENT Course Code: CSE-705 L T P

3 1 0

SECTION-A Introduction to Software Project Management (SPM): Definition of a Software Project

(SP), SP Vs. other types of projects activities covered by SPM, categorizing SPs, project as a

system, management control, requirement specification, information and control in

organization.

Stepwise Project planning: Introduction, selecting a project, identifying project scope and

objectives, identifying project infrastructure, analyzing project characteristics, identifying

project products and activities, estimate efforts each activity, identifying activity risk, allocate

resources, review/ publicize plan.

SECTION-B Project Evaluation & Estimation: Cost benefit analysis, cash flow forecasting, cost benefit

evaluation techniques, risk evaluation. Selection of an appropriate project report; Choosing

technologies, choice of process model, structured methods, rapid application development,

water fall-, V-process-, spiral- models. Prototyping, delivery. Albrecht function point

analysis.

Activity planning & Risk Management: Objectives of activity planning, project schedule,

projects and activities, sequencing and scheduling activities, network planning model,

representation of lagged activities, adding the time dimension, backward and forward pass,

identifying critical path, activity throat, shortening project , precedence networks.

Risk Management: Introduction, the nature of risk, managing risk, risk identification, risk

analysis, reducing the risks, evaluating risks to the schedule, calculating the z values..

SECTION-C

Resource allocation &Monitoring the control: Introduction, the nature of resources,

identifying resource requirements, scheduling resources creating critical paths, counting the

cost, being specific, publishing the resource schedule, cost schedules, the scheduling

sequence.

Monitoring the control: Introduction, creating the frame work, collecting the data,

visualizing progress, cost monitoring, earned value, prioritizing monitoring, getting the

project back to target, change control.

Managing contracts and people: Introduction, types of contract, stages in contract,

placement, typical terms of a contract, contract management, acceptance, Managing people

and organizing terms: Introduction, understanding behavior, organizational behavior: a back

ground, selecting the right person for the job, instruction in the best methods, motivation,

working in groups, becoming a team, decision making, leadership, organizational structures,

conclusion, further exercises..

SECTION-D

Software quality: Introduction, the place of software quality in project planning, the

importance of software quality, defining software quality, ISO 9126, Practical software

quality measures, product versus process quality management, external standards, techniques

to help enhance software quality.

Study of Any Software Project Management software: viz Project 2000 or equivalent

Text Book:

• Software Project Management (2nd

Edition), by Bob Hughes and Mike Cotterell, 1999,

TMH

75

Reference Books:

• Software Engineering – A Practitioner’s approach, Roger S. Pressman (5th

edi), 2001,

MGH

• Software Project Management, Walker Royce, 1998, Addison Wesley.

• Project Management 2/c. Maylor

• Managing Global software Projects, Ramesh, 2001, TMH.

76


Semester VII

.NET TECHNOLOGY Course Code: CSE-702 L T P

3 1 0

SECTION-A

Introduction to .NET Technology, Introduction to VB.NET, Software development and

Visual Basic .NET, Visual Basic .NET and .NET frame.

Visual Basic fundamentals: The Visual Basic .NET Development Environment, The element

of VB.NET, VB.NET operators, Software design, Conditional structure and control flow,

Methods.

SECTION-B

Classes and Objects: Types, Structure and Enumeration, Classes, Interfaces, Exception

handling and Classes, Collections, Arrays and other Data Structure.

SECTION-C

Advance design concepts, Patterns, Roles and Relationships, Advanced Interface Patterns:

Adapters and Delegates and Events Data Processing and I/O.

SECTION-D

Writing Software with Visual Basic .NET, Interfacing with the End User, Introduction to

ASP.NET and C#.NET and their features.

BOOKS

1. Jeffrey R. Shapiro “The Complete Reference Visual Basic .NET” Tata Mcgraw Hill

(2002 Edition).

2. Rox “Beginner and Professional Edition VB.NET” Tata Mcgraw Hill.

3. Steven Holzner “Visual Basic .NET Black Book” Wiley Dreamtech Publication.

4. Alex Homer, Dave Sussman “Professional ASP.NET1.1” Wiley Dreamtech

5. Bill Evzen,Bill Hollis “Professional VB.NET 2003” Wiley Dreamtech

6. Tony Gaddis “Starting Out VB.NET PROG.2nd

Edition” Wiley Dreamtech

77


Semester VII

NEURAL NETWORKS Course Code: CSE-703 L T P

3 1 0

SECTION-A

Overview of biological neurons: Structure of biological neurons relevant to ANNs.

Fundamental concepts of Artificial Neural Networks: Models of ANNs; Feedforward &

feedback networks; learning rules; Hebbian learning rule, perception learning rule, delta

learning rule, Widrow-Hoff learning rule, correction learning rule, Winner –lake all elarning

rule, etc.

SECTION-B

Single layer Perception Classifier: Classification model, Features & Decision regions;

training & classification using discrete perceptron, algorithm, single layer continuous

perceptron networks for linearlyseperable classifications.

Multi-layer Feed forward Networks: linearly non-seperable pattern classification, Delta

learning rule for multi-perceptron layer, Generalized delta learning rule, Error back-

propagation training, learning factors, Examples.

SECTION-C

Single layer feed back Networks: Basic Concepts, Hopfield networks, Training &

Examples.

Associative memories: Linear Association, Basic Concepts of recurrent Auto associative

memory: rentrieval algorithm, storage algorithm; By directional associative memory,

Architecture, Association encoding & decoding, Stability.

SECTION-D

Self organizing networks: UN supervised learning of clusters, winner-take-all learning,

recall mode, Initialisation of weights, seperability limitations

Text Books: • Introduction to artificial Neural systems by Jacek M. Zurada, 1994, Jaico Publ. House.

Reference Books: • “Neural Networks :A Comprehensive formulation”, Simon Haykin, 1998, AW

• “Neural Networks”, Kosko, 1992, PHI.

• “Neural Network Fundamentals” – N.K. Bose , P. Liang, 2002, T.M.H

78


Semester VII

FUZZY LOGIC Course Code: CSE-706 L T P

3 1 0

SECTION-A

Classical and Fuzzy Sets: Overview of Classical Sets, Membership Function, a-cuts,

Properties of a-cuts, Decomposition, Theorems, Extension Principle,

Operations on Fuzzy Sets:Compliment, Intersections, Unions, Combinations of Operations,

Aggregation Operations

SECTION-B

Fuzzy Arithmetic:Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on intervals

& Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations.

Fuzzy Relations: Crisp & Fuzzy Relations, Projections & Cylindric Extensions, Binary

Fuzzy Relations, Binary Relations on single set, Equivalence, Compatibility & Ordering

Relations, Morphisms, Fuzzy Relation Equations.

SECTION-C

Possibility Theory:Fuzzy Measures, Evidence & Possibility Theory, Possibility versus

Probability Theory.

Fuzzy Logic: Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers,

Linguistic Hedges.

SECTION-D

Uncertainty based Information:Information & Uncertainity, Nonspecificity of Fuzzy &

Crisp sets, Fuzziness of Fuzzy Sets.

Applications of Fuzzy Logic in soft computing.

Text / Reference books :

•Fuzzy Sets, Uncertainty & Information by G.J.Klir & T.A. Folyger, PHI, 1988. •Fuzzy sets & Fuzzy logic by G.J.Klir & B.Yuan, PHI, 1995

79


Semester VII

OBJECT ORIENTED SYSTEM DEVELOPMENT Course Code: CSE-707 L T P

3 1 0

SECTION-A

Introduction:Review of the Traditional Methodologies, Advantages of Object Oriented

Methodologies over Traditional Methodologies, Classes, Objects, Encapsulation,

Association, Aggregation, Inheritance, Polymorphism, States and Transitions.

Visual Modelling using Unified Modelling Language (UML):

What is Visual Modelling? Object Oriented Modelling, Introduction to Unified Modelling

Language (UML): History of UML, Overview of UML – Capabilities, Usage of UML.

Introduction to Rational Rose CASE tool: Introduction – Importance of Rational Rose,

Capabilities of Rational Rose Case Tool.

Introduction to Objectory Software Development Process:Introduction, Benefits, Phases

and Iterations, Elaboration Stage, Construction Stage, Transition Stage.

SECTION-B

Creating Use Case Diagrams:Actors and Use Cases, Use Case Relationships, Types of

Relationships, Use Case Diagrams: Creating Main Use Case -,Relationships - , Additional

Use Case - Diagrams in Rational Rose, Activity Diagrams Activities, Transitions, Decision

Points, Swimlanes

Identifying Classes ,Packages and drawing a Class Diagram: State, Behaviour, Identity of

Objects, Stereotypes and Classes,Creating and Documenting Classes inrational Rose,

Packages, Drawing a Class Diagram Specifying Relationships : The Need of Defining

Relationships, Association and Aggregation Relationships, Naming Relationships, Role

Names, Multiplicity Indicators, Reflexive Relationships, Package Relationships, Inheritance,

Finding Relationships, Creating Relationships in Rational Rose

SECTION-C

Discovering Object Interactions:Documenting Scenarios using Interaction Diagrams, Types

of Interaction Diagrams, Adding Behaviour and Structure: Representing Behaviour and

Structure, Creating Attributes & operations and documenting them, Displaying attributes and

operations, Association Classes, Analysing Object Behaviour: Modelling Dynamic

Behaviour, States

SECTION-D

Checking the Model:Making the Model Homogeneous, Combining Classes, Splitting

Classes,

Eliminating Classes, Consistency Checking, Scenario Walk-through, Event Tracing,

Documentation Review,

Designing the System Architecture : The need for Architecture, The “4+1” viewof

Architecture, The Logical view, The Component View, The Process View, The Deployment

View, The Use Case view.

The Iteration Planning Process:Benefits, Goals, Design the User Interface, Adding Design

80

Classes, The Emergence of Patterns, Designing Relationships, Designing Attributes and

Operations, Designing for Inheritance, Coding, Testing, and Documenting the Iteration.

Text Books:

•“UML User Guide”, Grady Booch, James Rumbaugh, Ivar Jacobson, 2000, Addison

Wesley. •Visual Modeling with Rational Rose 2000 and UMLBy Terry Quatrani Foreword by Grady

Booch, 2000 Reference Books:

•“UML Reference Guide”, James Rumbaugh, Ivar Jacobson, Grady Booch, 2000, Addison

Wesley.

•“The Objectory Software Development Process”, Ivar Jacobson, Grady Booch, James

Rumbaugh, 1999,

Addison Wesley.

•UML Distiled by Maxtin Fowler with Kendall Scott,2000 ,Second Edition

•Sams Teach Yourself “UML” In 24Hours By Joseph Schmuller ,2000

81


Semester VII

MANGEMENT INFORMATION SYSTEM Course Code: CSE-704 L T P

3 1 0

SECTION-A

Organisation & Types, Decision Making, Data & information, Characteristics &

Classification of information, Cost & value of information, Various channels of information

& MIS. 6

Foundation of Information System : Introduction to Information System in Business

Fundamentals of Information System, Solving Business Problems with Information System,

Concept of Balanced MIS, Effectiveness & Efficiency Criteria. Tool and Techniques of MIS-

dataflow diagram, flow chart etc. 10

SECTION-B

Business application of information technology, electronic commerce, Internet, Intranet,

Extranet & Enterprise Solutions, Information System for Business Operations, Information

system for managerial Decision Support, Information System for Strategic Advantage.

SECTION-C

Managing Information Technology, Enterprise & Global Management, Security & Ethical

Challenges, Planning & Implementing Change.Reports: Various types of MIS reports, GUI &

Other Presentation tools. 6

SECTION-D

Advanced concepts in information system: Enterprise Resource Planning: introduction,

various modules like Human Resources, Finance, Accounting, Production & Logistics.

Supply Chain Management, CRM, Procurement Management System Object Oriented

modeling case studies. 10

Books

1. O.Brian, “Introduction to Information System”, Mc-Graw Hill.

2. O.Brian, “Management Information System”, TMH.

3. Alter, “Information Systems : A Management Perspective”, Addison Wesley.

82


Semester VII

AI LAB Course Code: CSE-751 L T P

0 0 2

1. Study of PROLOG. Write the following programs using PROLOG.

2. Write a program to solve 8 queens problem.

3. Solve any problem using depth first search.

4. Solve any problem using best first search.

5. Solve 8-puzzle problem using best first search

6. Solve Robot (traversal) problem using means End Analysis.

7. Solve traveling salesman problem.


83


Semester VII

.NET TECHNOLOGY LAB Course Code: CSE-752 L T P

0 0 2

C#

Getting Started with .Net Framework, Exploring Visual Studio .NET, Inside a C#

Program, Data Types, Statements, Arrays, Using Strings, Objects, Classes and

Structs, Properties, Inheritance, Indexers, Delegates, Events, Namespaces, Generics,

Collections and Data Structures, Exception Handling, Threading, Using Streams and

Files, Reflection, Assemblies, versioning, Windows Forms, Controls, Data binding to

Controls, Advanced Database Programming using ADO.net, Using GDI +,

Networking, .net Remoting, Manipulating XML.

VB.net

Creating Applications with Visual Basic.NET, Variables, Constants, and

Calculations, Making Decisions and Working with Strings, Lists, Loops, Validation,

Sub Procedures and Functions, Multiple Forms, Standard Modules, and Menus,

Arrays, Timers, Form Controls, File Handling,

Exception Handling, Working with Databases, Advanced Database Programming using

ADO.net, Classes, Generics, Collections, Inheritance, Custom Controls, Packaging &

deployment, Using Crystal Reports.

ASP.net

Building a Web Application, Examples Using Standard Controls, Using HTML

Controls, Validating Form Input Controls using Validation Controls, Understanding

Applications and State, Applying Styles, Themes, and Skins, Creating a Layout Using

Master Pages, Binding to Databases using Controls, Data Management with ADO.net

, Creating a Site Navigation Hierarchy, Navigation Controls, Membership and Role

Management, Login Controls, Securing Applications, Caching For Performance,

Working with XML, Using Crystal Reports in Web Forms

84


Semester VIII

DISTRIBUTED OPERATING SYSTEM Course Code: CSE-801 L T P

3 1 0

SECTION-A

Introduction: Introduction to Distributed System, Goals of Distributed system, Hardware

and Software concepts, Design issues. Communication in distributed system: Layered

protocols, ATM networks, Client – Server model, Remote Procedure Calls and Group

Communication. Middleware and Distributed Operating Systems.

SECTION-B

Synchronization in Distributed System: Clock synchronization, Mutual Exclusion,

Election algorithm, the Bully algorithm, a Ring algorithm, Atomic Transactions, Deadlock in

Distributed Systems, Distributed Deadlock Prevention, Distributed Deadlock Detection.

Processes and Processors in distributed systems: Threads, System models, Processors

Allocation, Scheduling in Distributed System, Real Time Distributed Systems.

SECTION-C

Distributed file systems: Distributed file system Design, Distributed file system

Implementation, Trends in Distributed file systems.

Distributed Shared Memory: What is shared memory, Consistency models, Page based

distributed shared memory, shared variables distributed shared memory.

SECTION-D

Case study MACH: Introduction to MACH, process management in MACH,

communication in MACH, UNIX emulation in MACH.

Text Book: • Distributed Operating System – Andrew S. Tanenbaum, PHI.

85


Semester VIII

ADVANCED COMPUTER ARCHITECTURE Course Code: CSE-802 L T P

3 1 0

SECTION-A

Architecture And Machines: Some definition and terms, interpretation and

microprogramming. The instruction set, Basic data types, Instructions, Addressing and

Memory. Virtual to real mapping. Basic Instruction Timing.

Time, Area And Instruction Sets: Time, cost-area, technology state of the Art, The

Economics of a processor project: A study, Instruction sets, Professor Evaluation Matrix

SECTION-B

Cache Memory Notion: Basic Notion, Cache Organization, Cache Data, adjusting the data

for cache organization, write policies, strategies for line replacement at miss time, Cache

Environment, other types of Cache. Split I and D-Caches, on chip caches, Two level Caches,

write assembly Cache, Cache references per instruction, technology dependent Cache

considerations, virtual to real translation, overlapping the Tcycle in V-R Translation, studies.

Design summary.

SECTION-C

Memory System Design: The physical memory, models of simple processor memory

interaction, processor memory modeling using queuing theory, open, closed and mixed-queue

models, waiting time, performance, and buffer size, review and selection of queueing models,

processors with cache.

SECTION-D

Concurrent Processors: Vector Processors, Vector Memory, Multiple Issue Machines,

Comparing vector and Multiple Issue processors.

Shared Memory Multiprocessors: Basic issues, partitioning, synchronization and

coherency, Type of shared Memory multiprocessors, Memory Coherence in shared Memory

Multiprocessors.

Text Book: • Advance computer architecture by Hwang & Briggs, 1993, TMH.

Reference Books: • Pipelined and Parallel processor design by Michael J. Fiynn – 1995, Narosa.

86


Semester VIII

MOBILE COMPUTING Course Code: CSE-803 L T P

3 1 0

SECTION-A

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.

SECTION-B

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.

SECTION-C

Data management issues, data replication for mobile computers, adaptive clustering for

mobile wireless networks, File system, Disconnected operations.

Mobile Agents computing, security and fault tolerance, transaction processing in mobile

computing environment.

SECTION-D

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.

Books:

1. J. Schiller, Mobile Communications, Addison Wesley.

2. A. Mehrotra , GSM System Engineering.

3. M. V. D. Heijden, M. Taylor, Understanding WAP, Artech House.

4. Charles Perkins, Mobile IP, Addison Wesley.

5. Charles Perkins, Ad hoc Networks, Addison Wesley.

87


Semester VIII

SOFTWARE TESTING Course Code: CSE-804 L T P

3 1 0

SECTION-A

Fundamentals of Testing Human and errors, Testing and Debugging, Software Quality, Requirement Behavior and

Correctness, Fundamentals of Test Process, Psychology of Testing, General Principles of

Testing, Test Metrics

Role of Testing in SDLC Review of software development models (Waterfall Models, Spiral Model, W Model, V

Model) Agile Methodology and Its Impact on testing, Test Levels (Unit, Component,

Module, Integration, System, Acceptance, Generic)

SECTION-B

Approaches to Testing - I Static Testing ,Structured Group Examinations, Static Analysis ,Control flow & Data flow,

Determining Metrics ,Dynamic Testing ,Black Box Testing ,Equivalence Class Partitioning,

Boundary Value Analysis, State Transition Test, Cause Effect Graphing and Decision Table

Technique and Used Case Testing and Advanced black box techniques ,White Box Testing

Statement Coverage, Branch Coverage, Test of Conditions, Path Coverage, Advanced White

Box Techniques, Instrumentation and Tool Support ,Gray Box Testing, Intuitive and

Experience Based Testing

SECTION-C

Test Management Test Organization ,Test teams, tasks and Qualifications ,Test Planning ,Quality Assurance

Plan, Test Plan, Prioritization Plan, Test Exit Criteria ,Cost and economy Aspects ,Test

Strategies ,Preventive versus Reactive Approach, Analytical versus heuristic Approach

Test Activity Management, Incident Management, Configuration Management

Test Progress Monitoring and Control

Specialized Testing: Performance, Load, Stress & Security Testing

SECTION-D

Testing Tools Automation of Test Execution, Requirement tracker, High Level Review ,Types of test Tools

Tools for test management and Control, Test Specification, Static Testing, Dynamic Testing,

Non functional testing ,Selection and Introduction of Test Tools

Tool Selection and Introduction, Cost Effectiveness of Tool Introduction

Testing Object Oriented Software Introduction to OO testing concepts, Differences in OO testing

References: 1. Software Testing Foundations, Andreas Spillner, Tilo Linz, Hans Schaefer, Shoff Pub.

2. Software Testing: Principles and Practices by Srinivasan D and Gopalswamy R, PearsonEd,

3. Foundations of Software Testing by Aditya P. Mathur – Pearson Education custom edition

4. Testing Object Oriented Systems: models, patterns and tools, Robert V Binder, Addison

Wesley, 1996

5. Software Engineering – A practitioner’s approach by Roger S. Pressman, 5th Ed, McGraw Hill

6. The art of software testing by GJ Myers, Wiley.

88


Semester VIII

NATURAL LANGUAGE PROCESSING Course Code: CSE-805 L T P

3 1 0

SECTION-A

Components of natural language processing: lexicography, syntax, semantics, pragmatics:

word level representation of natural languages prosoty & natural languages.

Formal languages and grammars: chomsky hierarchy, Left-Associative grammars,

ambiguousgrammars, resolution of ambiguities.

SECTION-B Computation linguistics: recognition and parsing of natural language structures: ATN &

RTN,General techniques of parsing: CKY, Earley & Tomitas algorithm.

SECTION-C Semantics-knowledge representation semantic networks logic and inference pragmatics,

graph models and optimization, prolog for natural language semantic.

SECTION-D Application of NLP: intelligent work processors: Machine translation, user interfaces, Man-

Machine interfaces, natural language querying, tutoring and authoring systems, speech

recognition, commercial use of NLP.

Text Book:

•“Natural Language Understanding” James Allen ,Benjamin-1995, cummings Pub. Comp.

Ltd.,

Reference Books:

•“Language as a cognitive process”, Terry Winograd 1983, AW

•“Natural Language processing in prolog” G. Gazder, 1989, Addison Wesley.

•“ Introduction of Formal Language Theory, Mdlj Arbib & Kfaury, 1988, Springer Verlog

89


Semester VIII

NANO TECHNOLOGY Course Code: CSE-806 L T P

3 1 0

SECTION-A Introduction To Nanotech Crystalline noncrystalline materials, fundamental of Nano

Technology & Nano-materials in metals, other materials & Biosystem molecular recognition,

quantum mechanics and quantum idea in nanotechnology,semiconductor nano particles.

SECTION-B Preparation And Characterization Of Nanoparticles Nanoscale lithography,dip pen

lithography,e-beam lithography,nanosphere life off,lithography,molecular

synthesis,nanocrystal growth,polymerization nanobricks & building block: tool for measuring

nanostructures-scanning probe instrument,spectroscopy,electrochemistry, electronmicroscopy

tools to make nanostructure.

SECTION-C Properties & Application Of Nano Crystalline Materials

Application in sensors, nanoscale biostructure electronics, magnets, optics, fabrication

medical application, smart materials self healling structures, heterogeneous nano structure &

composites encapsulation carbon nanotubes.

SECTION-D Synthesis of semiconductor nanocluster,processing of nanomaterials,nanobusiness-boom,bust

&

nanotechnology,nanoethics

References

1.Camarata. R.C. Nanomaterials synthesis, properties and application Institute of Physics

Publication.

2.Madou. Fundamentals of microfabrication, Mcgraw Hill.

3.Sibelia, J.P. A Guide to material characterization, Prentice Hall.

4.Mark Ratner, Deniel Ratner – Nano Technology – A gentle Introduction to the Next Big

Idea.

Documents

Bachelor of Technology (Computer Science & Engineering) › schools › wp-content › uploads...FIRST YEAR, (Common for all branches) SEMESTER I Course Periods Evaluation Scheme Course