View
233
Download
7
Category
Preview:
Citation preview
SYLLABI
B.TECH. (COMPUTER ENGINEERING)
REVISED WITH EFFECT FROM 2017-18
DEPARTMENT OF COMPUTER ENGINEERING
ALIGARH MUSLIM UNIVERSITY, ALIGARH
2017-2018
DEPARTMENT OF APPLIED CHEMISTRY
B. Tech. (for all branches)
Course Title Applied Chemistry
Course Number : ACS1110
Credits : 4
Course Category : BS
Credits : 04
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Course Work (Home Assignment & Quizzes (15%)
Midsem Examination (1 Hour) (25%)
Endsem Examination (2 Hours) (60%)
Course Objectives
To impart the knowledge of applications of chemical sciences in the field of engineering and technology.
Course Outcomes
After completion of the course the students shall be able to understand:
1. The basic knowledge of methods of chemical analysis and the instrumentation involved
2. Water treatment procedures for municipal and industrial uses.
3. About solid, liquid and gaseous fuels
4. About lubricants, types and their applications
5. About corrosion and techniques to control corrosion
6. About polymers and their applications
Syllabus
UNIT-I: METHODS OF CHEMICAL ANALYSIS (10 L)
Introduction to chemical analysis, Classification, Qualitative and gravimetric analysis, (quantitative analysis) Principle
of gravimetry. The steps involved in gravimetric analysis, with special emphasis on precipitation, Digestion, Favorable
conditions for precipitation, Von-Wiemarn ratio, Types of precipitates, Impurities in precipitates and their
minimization.Volumetric Analysis, Titration, Titrant, Analyte Basic requirements of titrimetric method. Primary and
Secondary standards, Basic requirements of primary standard. Types of titrations, Acid-Base Titration (strong acid
versus strong base, pH Titration curve) Redox titration (Iodimetry, Iodometry), Precipitation titration (Silver nitrate
versus sodium chloride), Chelometric titration (Ca2+
/Mg2+
versus EDTA). Absorption Spectrophotometry, Beer and
Lambert‘s law (definition and units of terms involved, deviation from Beer Lambert‘s law, numerical problems), block
diagram of single beam UV – Visible Spectrophotometer. Definition of chromatography, Stationary and mobile
phases, Classification of chromatography on the basis of physical mode and mechanism (adsorption, partition, size
exclusion and ion exchange), RF Value.
UNIT-II: TREATMENT OF WATER FOR MUNICI PAL AND INDUSTRIAL USE (10 L)
Uses of water for municipal and industrial purposes, Sources of water, Impurities in water, Requirements of water for
municipal use, Municipal water treatment methods, Plain sedimentation, Sedimentation with coagulation and
filtration. Disinfection, Requirements of a good disinfectant, Types of disinfecting agents (Bleaching powder, Liquid
chlorine, Ozone, UV radiations and Chloramine), Break point chlorination, Advantages of break point chlorination,
super chlorination and dechlorinationRequirements of water for industrial use, Hardness of water, Units of hardness,
Calculation on hardness, Theories of estimation of hardness by soap and EDTA methods.Boiler defects (Sludge and
scale formation, Priming and foaming), Boiler corrosion and caustic embrittlement (Causes and prevention). Removal
of hardness, Lime-soda process, Zeolite process, Ion-exchange process Advantages and limitations of the process,
Calculations based on lime – soda process.
UNIT-III: FUELS AND COMBUSTION (10 L)
Definition of fuels, Classification of fuels, Calorific value and its determination by bomb calorimeter, Dulong‘s
formula. Coal, Coal analysis (Boximate and ultimate analysis), Significance of constituents of coal Petroleum,
Classification and important fractions of petroleum and their uses (Petrol, Diesel, Lubricating oils), Synthetic petrol
(Synthesis by polymerization, by cracking by Fisher Tropsch process by Bergius process) Gaseous fuels (CNG,
LPG), Advantages and disadvantages of gaseous fuels, Combustion calculations based on solid and liquid fuels.
UNIT-IV: LUBRICANTS AND LUBRICATION (10 L)
Definition and classification of lubricants, Functions of lubricants, Lubrication (Types of lubrication and their
mechanisms). Liquid lubricants (Mineral oils, Fatty oils, Compounded oils and Silicone fluids) Greases types of
greases and conditions of their use, Testing of greases, Solid lubricants and conditions of their use. Testing of liquid
lubricants (Viscosity and viscosity index, Flash and fire points, cloud, pour and setting points, Saponification value,
Aniline point), Selection of lubricants (Cutting tools, Internal combustion engine, Transformer, Refrigerators).
UNIT- V: CORROSION AND ITS PREVENTION (10 L)
Definition, Significance (Economic aspect), Classification of corrosion. Dry corrosion, Mechanism of dry corrosion,
Types of oxide film, Pilling Bedworth rule. Electrochemical corrosion, mechanism of electrochemical corrosion,
Factors influencing corrosion rate. Electrochemical series and Galvanic series Corrosion control methods (proper
design, important designing principles, selection materials cathodic protection, metallic coatings (galvanizing, tinning)
Organic Coatings, types, Paints, (Constituents of paints, Drying mechanism of oil).
UNIT-VI: POLYMERS (10 L)
Definition and classification of polymers (On the basis of origin, synthesis, thermal response, physical state,
applications, chemical structure) Polymerization (Addition and condensation), Mechanism of free radical addition
polymerization of vinyl chloride, Difference between thermoplastics and thermosetting. Thermoplastics (Preparation,
properties and uses of PE, PVC, Nylons, PTFE) Thermosetting plastics (Preparation, properties and uses of bakelite,
polyesters) Elastomers (Preparation, properties and uses of NR, BUNA rubbers), vulcanization.
Suggested Readings/Text/References
1. Analytical Chemistry by G.D. Christian, John Wiley and Sons, New York.
2. Quantitative Analysis by R.A. Day and A.L. Underwood.
3. A Text Book of Engineering Chemistry by S.S. Dara, S. Chand & Co., New Delhi (India).
4. Engineering Chemistry by B.K. Sharma, Krishna Prakashan Media (P) Ltd., Meerut (India).
5. Engineering Chemistry by P.C. Jain, Dhanpat Rai Publishing Company, New Delhi.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x x
4 x x
5 x x x
6 x x
2017-2018
DEPARTMENT OF APPLIED MATHEMATICS
B. Tech. (for all branches)
Course Title : Mathematics -I
Course Number : AMS1110
Credits : 04
Course Category : BS
Pre-requisite(s) : Nil
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Course Work (Home Assignments) (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hours) (60%)
Course Objectives
To learn the fundamental concepts of matrices, differential and integral calculus, the theory of differential equations,
applications.
Course Outcomes
After completing this course the students should be able to:
1. apply tools of the theory of matrices to relevant fields of Engineering.
2. understand curve tracing and regions between different curves.
3. expand important mathematical functions in power series and their applications.
4. apply tools of integration to find length, surface area and volume.
5. express real life problems into mathematical models using differential equations and analyse their solutions.
Syllabus
Unit-1 Rank of a matrix with applications to consistency of a system of linear equations, eigen-values and
eigen vectors of a matrix, Caley-Hamilton theorem.
Unit-2 Asymptotes and simple curve tracing. successive differentiation, Leibnitz‘s theorem, Taylor and
Maclaurin series with remainder terms.
Unit-4 Applications of integration to lengths of curves, surfaces and volumes of solids of revolution.
Unit-5 Solution of exact differential equations, linear differential equations of second and higher order with
constant coefficients, homogeneous differential equations, simultaneous linear differential equations,
applications to physical problems.
Text Book(s)/Reference Book(s)
1 Chandrika Prasad , ″A First Course in Mathematics for Engineers″, Pothishala Pvt. Ltd., Allahabad.
2 Chandrika Prasad, ″ Mathematics for Engineers″, Pothishala Pvt. Ltd., Allahabad.
3 Erwin Kreyszig, ″Advanced Engineering Mathematics″, John Wiley & Sons, INC.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x x
4 x x x
5 x x x x
2017-2018
DEPARTMENT OF APPLIED MATHEMATICS
B. Tech. (for all branches)
Course Title : Mathematics –II
Course Number : AMS1120
Credits : 04
Course Category : BS
Pre-requisite(s) : Nil
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Course Work (Home Assignments) (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hours) (60%)
Course Objectives
To learn partial differentiation, multiple integration, polar forms of conics, various forms of general equation of
second degree and its tracing, applications.
Course Outcomes
After completing this course the students should be able to:
1. understand the the theory of functions of saveral variables and its applications .
2. understand double and triple integrals and use it to find surface area and volume.
3. learn various forms of general equation of second degree and its tracing
4. understand polar forms of conics.
Syllabus
Unit-1 Partial differentiation, Euler‘s theorem, total differential, small errors, change of variables, Jacobians.
Unit-2 Taylor series of functions of two variables, approximate calculations, maxima and minima of functions
of two variables, Lagrange‘s multipliers.
Unit-3 Double and triple integrals, change of variables, change of order of integration, applications to area and
volume.
Unit-4 General equation of second degree, tracing of conics, introduction to polar form of conics.
Text Book(s)/Reference Book(s)
1 Chandrika Prasad , ″A First Course in Mathematics for Engineers″, Pothishala Pvt. Ltd., Allahabad.
2 Chandrika Prasad, ″ Mathematics for Engineers″, Pothishala Pvt. Ltd., Allahabad.
3 Erwin Kreyszig , ″Advanced Engineering Mathematics″ , John Wiley & Sons, INC.
4 Gorakh Prasad, ″ A text book of coordinate geometry″, Pothishala Pvt. Ltd., Allahabad.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x x
4 x x x
2017-2018
DEPARTMENT OF APPLIED PHYSICS
B. Tech. (for all branches)
Course Title Applied Physics
Course Number : APS1110
Credits : 4
Course Category : BS
Pre-requite(s) : None
Contact Hours : 3-1-0
Type of Course : Theory
Course Work : Home Assignments (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hourss) (60%)
Course Objective:
To equip the student with a strong understanding of the fundamentals of physics so as to enable him/her to apply it to
his/her field of study.
This course should enable the student to-
1. explain the behaviour of the physical world around him/her
2. apply the concepts of physics in his/her field of study
3. relate the concepts of physics to the advancement of technology.
4. understand and relate the different phenomena in the world.
5. approach problems, predict their results in advance, and solve them in quantitative and qualitative manner.
6. gain a broader understanding of other sciences.
Course Outcomes:
Upon completion of the course, the student will be able to:
1. recognize and present real life examples of the aforementioned concept and interrelate some of them.
2. describe the link between physics and the technology.
3. identify technological applications of some of the aforementioned concepts.
4. describe how he/she can harness the benefits of some of the aforementioned concepts to his /her area of
specialization.
5. understand the professional and ethical responsibilities of the subject.
6. communicate effectively while speaking, employing graphics and writing.
Syllabus
Unit 1 Masers and Lasers: Basic principle, Einstein coefficients for Induced absorption, Spontaneous emission and
Induced emission, Ammonia maser and its applications, Ruby and He-Ne Lasers, Semiconductor laser,
Spatial and temporal coherence, Characteristics of lasers and its applications based on these characteristics
(such as in Industry, Science,
Medicine, Communications, Surveying, Holography, Fusion reactors, Isotope separation, etc.).
Fibre Optics: Basic principle, Fibre construction and dimensions, Light propagation in fibres, Numerical
aperture of the fibre, Step index and graded index fibres, Signal distortion in optical fibres, Transmission
losses, Light wave communication in optical fibres, Fibre optics in medicine and industry.
Unit 2 Semiconductors: Elemental and compound semiconductors, Energy bands, Direct and indirect
semiconductors, Electrons and holes, Effective mass, Intrinsic material, Extrinsic material, Fermi level,
Electron and hole concentration at equilibrium, Temperature dependence of carrier concentrations,
Compensation and space charge neutrality, Conductivity and mobility, Hall effect in semiconductors.
Superconductivity: Zero resistivity, Meissner effect, Type I and Type II Superconductors, High
temperature superconductors, BCS theory (qualitative), Josephson effect, SQUIDS.
Unit 3 Particles and Waves: Mechanism of X- ray production (continuous and characteristic X- rays, Duane- Hunt
limit), Compton effect, Pair production, Phase and group velocities, Uncertainty principle.
Quantum Mechanics: Introduction to quantum mechanics, Wave function, Conditions necessary for
physically acceptable wavefunction, Probability density and probability, Schrödinger equation (Time
dependent form and Steady state or time independent form), Eigenvalues and eigenfunctions, Expectation
values, Particle in a box (Infinite square potential well), Tunnel effect (qualitative).
Unit4 Statistical Mechanics : Statistical distributions, Maxwell–Boltzmann statistics, Molecular
energies in an ideal gas, Quantum statistics, Specific heats of solids, Free electron in a metal,
Electron- energy distribution.
Nuclear Physics : Q-value and threshold energy of nuclear reactions, Cross section of a
nuclear reaction and reaction rate, Breeder reactors, Fusion reactors, Nuclear detectors
(names and general working principle), Gas filled detectors, Scintillation detectors.
Text and Reference Books
1. Ben G. Streetman, ―Solid State Electronic Devices‖ 5th
edition (2000), Prentice-Hall of India Private
Limited, New Delhi.
2. Arthur Beiser, ―Concepts of Modern Physics‖ 6th
edition (2003), Mc. Graw Hills Inc. International Edition.
3. M.R. Wehr, J.A. Richards Jr. and TW Adair III, ―Physics of the Atom‖ 4th
edition (1984), Addison Wesley /
Narosa.
4. M.R. Srinivasan, ―Physics for Engineers‖ 1st edition (1996), New Age International (P) Limited, Publishers.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x
3 x x x x
4 x x
5 x x x x x
6 x x x
2017-2018
DEPARTMENT OF CIVIL ENGINEERING
B. Tech. (for all branches)
Course Title : Environmental Studies Course Number : CEA1110
Department : Civil Engineering
Designation : Required Course (ESA)
Pre-requisites : No Prerequisite required for first Year Course
Contact Hours : Lecture 3- Tutorial 1
Assessment Method : Mid Semester , Home Assignment and End Semester Examination
Course Objectives:
1. To understand the basic concept of ecology, atmospheric structure and its chemistry involved.
2. To have a knowledge about the air quality and its standards and how to control air pollution.
3. To have knowledge about Water Quality: Physical, Chemical and Biological parameters.
4. To understand the Water purification processes in natural systems and introduction to Water Treatment
Technologies.
5. To know about the wastewater characteristics and wastewater treatment technologies.
6. To have a knowledge about the solid waste management.
Course Outcomes:
Upon successfully completing this course in environmental studies, it is expected that student will be able to:
1. Understand fundamental physical and biological principles that govern natural processes.
2. Demonstrate an in-depth understanding of the sub disciplines within environmental studies (i.e. Biology.
Chemistry, Physics etc).
3. Communicate environmental scientific information to both professional and lay audiences.
4. Demonstrate an understanding of current environmental challenges.
5. Develop a basic fundamental background for the higher environmental engineering courses offered in civil
engineering department.
Syllabus
Unit I
Concepts of Ecology: Ecosystem, Energy and nutrient flow in ecosystem, Food chain, Environmental Segments:
Atmospheric Structure, Classification of air pollutants, sources of air pollution and their effects on human health and
property. Atmospheric chemistry, Photochemical Smog, Ozone depletion.
Unit II
Air Quality and Standards, Meteorological phenomena and their influence on Air Quality, Lapse rates, Dispersion of
Pollutants.
Air Pollution Control: Introduction to Particulate and Gaseous pollutant control.
Unit III
Water Quality: Physical, Chemical and Biological parameters. Water quality standards, Biochemical (BOD) and
Chemical Oxygen Demand (COD). BOD/COD Calculations
Environmental Analyses: pH, Alkalinity, Conductivity, Ammonia, Fluoride, Sulphate, Chloride. Analysis and
measurement of gaseous pollutants.
Unit IV
Water purification processes in natural systems: Dissolved Oxygen (DO), Impact of wastewater discharge on streams,
Oxygen Sag Curve.
Introduction to Water Treatment Technologies: Sedimentation, Coagulation and Flocculation, Hardness Reduction,
Filtration and Disinfection.
Unit V
Wastewater Characteristics, Introduction to wastewater treatment technologies. Primary Treatment: Screening, Grit
Removal, Flow measurement, Flow equalization. Secondary Treatment: Microbial growth curve, Suspended and
Attached growth systems.
Unit VI
Solid Waste: Classification, Sources and Characteristics.
Waste Management: Solid Waste Generation, Collection, Processing and Disposal Methods.
Resource Recovery in Waste Management, Biological and Thermal Conversion Processes.
Text Books, Reference Books:
1. Venugopala Rao, P., 2006, Principles of Environmental Science and Engineering, Prentice-Hall of India
Private Limited, New Delhi.
2. Masters, G.M., 1991, Introduction to Environmental Engineering and Science, Prentice-Hall International,
Inc., Englewood Cliffs, NJ.
3. Peavy, H.S., D.R. Rowe and G. Tchobanoglous, 1985, Environmental Engineering, McGraw-Hill Book
Company, New York.
4. Henry, J.G. and G.W. Heinke, 1989, Environmental Science and Engineering, Prentice-Hall International,
Inc., Englewood Cliffs, NJ.
5. Sawyer, C.N. and P.L. McCarty, 1978, Chemistry for Environmental Engineering, 3rd
Edition, McGraw-Hill
Book Company, New York.
6. Tchobanoglous, G., H. Theisen and S. Vigil, 1993, Integrated Solid Waste Management, McGraw-Hill Inc.
Singapore.
Course outcomes- program outcomes relationship matrix
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
x
2 x x
3 x x
4
x x
5 x x
2017-2018
DEPARTMENT OF ENGLISH
B. Tech. (for all branches)
Course Number and Title : EZH1110 English
Credits : 3
Course Category : Humanities (HM)
Pre-requisite(s) :
Contact Hours (L-T-P) : 2-1-0
Type of Course : Theory
Course Assessment : Home Assignments (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hourss) (60%)
Course Objectives
To develop reading, writing, communication and presentation skills.
Course Outcomes
Upon successful completion of this course, it is expected that students will be able to:
1. Develop reading and writing skills.
2. Develop comprehension and interpretative skills.
3. Communicate one‘s point of view in both written and verbal formats with clarity and grammatically correct
language.
4. Express themselves clearly and appropriately in social and professional fields and strengthen professional
etiquette.
5. Develop effective communication and presentation skills so as to maximize their scope for employability.
6. Enhance attitude for observational and analytical learning.
Syllabus
Unit-I: Comprehensive questions, summary type as well as short answer type and questions on vocabulary for 10
passages of ‘Basic Scientific English‘ by Ewer and Latorre.
Unit-II: Comprehensive questions, summary type or short answer type from ’Animal Farm‘ by G. Orwell.
Unit III: Comprehensive questions, summary type or short answer type from ’Time Machine‘ by H. G. Wells.
Unit IV: Note taking, note making exercises, report and precise writing exercises.
Unit V: Grammar, Composition and Spoken English
Text Book(s)
1. Ewer and Latorre, ―Basic Scientific English‖, Longman Press.
2. George Orwell, ―Animal Farm‖
3. H. G. Wells, ―The Time Machine‖, Macmillan Press
Relationship of COs with Pos
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x
3 x x
4 x x
5 x
6 x x x
2017-2018
DEPARTMENT OF ELECTRICAL ENGINEERING
B. Tech. (for all branches)
Course Title Basics of Electrical Engineering Course number EEA1110
Credit Value 2
Course Category ESA
Pre-requisite Nil
Contact Hours (L-T-P) 2-1-0
Type of Course Theory
Course
Objectives
The objective of this course is to set a firm and solid foundation in Electrical & Electronics
Engineering with strong analytical skills and conceptual understanding of theorems and analysis
methods in electrical and magnetic circuits, electronic devices, circuits, measuring instruments.
The course will familiarize students with various motors, transformers, power generation
system.
Course
Outcomes
After successful completion of this course, the students will be able to:
1. Analyse electrical and magnetic circuits with moderate complexity applying
fundamental laws and theorems in steady-state as well as transient operation.
2. Analyse AC circuits using phasors.
3. Converse with transformers, motors, measuring instruments.
4. Understand various methods of electrical generation
5. Identify schematic symbols and understand the working principles of electronic
devices e.g. Diode, Zener Diode, LED, BJT, JFET and MOSFET etc.
6. Understand the working principles of electronic circuits e.g. Rectifiers, Amplifiers and
Operational Amplifiers etc.
7. understand methods to analyse and characterize these circuits
Syllabus
Part A
Unit I:
Circuit and Transformers: Review of dc circuits and theorems, 1-phase circuits,
superposition theorem, thevenin‘s theorem and norton‘s theorem for ac circuits, RLC series
and parallel circuits, 3-phase balanced ac circuits.
Magnetic circuits, magnetization curve, hysteresis & eddy current effect/losses.
Transformer construction, equivalent circuit, calculation of losses and efficiency.
Unit II:
Introduction to electrical machines, instruments and power system: 3-phase induction
motor and 1-phase induction motors.
Basic elements of an instrument: MC, MI instruments, dynamometer wattmeter, digital energy
meter.
Elements of power system, layout of thermal, hydro, nuclear and gas plants.
Introduction to renewable energy sources and recent trends in generation.
Part B
Unit III:
Diode and BJT: Terminal characteristics of diodes, diodes models; Ideal, constant voltage and
piecewise linear, load line concept, Diode applications; Rectifier, logic gates, Zener diode;
Operation, characteristics, voltage regulation. Bipolar Junction Transistor; Construction,
operation, configurations, characteristics of common emitter configuration, DC load analysis.
Unit IV:
MOSFET and OpAmp: Introduction to MOSFET; Depletion MOSFET construction,
operation, Enhancement MOSFET construction, Operation, amplifiers, Operational
Amplifiers; equivalent circuit, ideal behavior, open loop and closed loop concept, concept of
virtual short, simple Opamp applications; Unity gain amplifier, inverting, non-inverting,
integrator, differentiator, subtractor, summer.
Books/
References
1. Ashfaq Husain*: Fundamentals of Electrical Engineering, 3rd
Edition, Dhanpat Rai & Sons
2. R. Boylestad & L. Nashelsky*: Electronic Devices and Circuits, Prentice Hall, 1995
3. Hughes: Electrical Technology. 7th
edition, Addison Wesley
4. A.K. Sawhney: A course in Electrical & Electronics Meas. & Inst., Dhanpat Rai & Sons
5. B.R. Gupta: Electrical Power Systems, Wiley Eastern
6. Mathur, Chadda and Kulshresta: Electronic Devices, Applications and Integrated Circuits,
Umesh Publications.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x x x
3
4 x x
5 x x x
6 x x x x x
7 x x
2017-2018
DEPARTMENT OF ELECTRICAL ENGINEERING
B. Tech. (for all branches)
Course Title Principles of Electronics Engineering Course number ELA1110
Credit Value 3
Course Category ESA
Pre-requisite Nil
Contact Hours (L-T-P) 2-1-0
Type of Course Theory
Course
Objectives
The objective of this course is to set a firm and solid foundation in Electrical & Electronics
Engineering with strong analytical skills and conceptual understanding of theorems and analysis
methods in electrical and magnetic circuits, electronic devices, circuits, measuring instruments.
The course will familiarize students with various motors, transformers, power generation
system.
Course
Outcomes
After successful completion of this course, the students will be able to:
8. Analyse electrical and magnetic circuits with moderate complexity applying
fundamental laws and theorems in steady-state as well as transient operation.
9. Analyse AC circuits using phasors.
10. Converse with transformers, motors, measuring instruments.
11. Understand various methods of electrical generation
12. Identify schematic symbols and understand the working principles of electronic
devices e.g. Diode, Zener Diode, LED, BJT, JFET and MOSFET etc.
13. Understand the working principles of electronic circuits e.g. Rectifiers, Amplifiers and
Operational Amplifiers etc.
14. understand methods to analyse and characterize these circuits
Syllabus
Part A
Unit I:
Circuit and Transformers: Review of dc circuits and theorems, 1-phase circuits,
superposition theorem, thevenin‘s theorem and norton‘s theorem for ac circuits, RLC series
and parallel circuits, 3-phase balanced ac circuits.
Magnetic circuits, magnetization curve, hysteresis & eddy current effect/losses.
Transformer construction, equivalent circuit, calculation of losses and efficiency.
Unit II:
Introduction to electrical machines, instruments and power system: 3-phase induction
motor and 1-phase induction motors.
Basic elements of an instrument: MC, MI instruments, dynamometer wattmeter, digital energy
meter.
Elements of power system, layout of thermal, hydro, nuclear and gas plants.
Introduction to renewable energy sources and recent trends in generation.
Part B
Unit III:
Diode and BJT: Terminal characteristics of diodes, diodes models; Ideal, constant voltage and
piecewise linear, load line concept, Diode applications; Rectifier, logic gates, Zener diode;
Operation, characteristics, voltage regulation. Bipolar Junction Transistor; Construction,
operation, configurations, characteristics of common emitter configuration, DC load analysis.
Unit IV:
MOSFET and OpAmp: Introduction to MOSFET; Depletion MOSFET construction,
operation, Enhancement MOSFET construction, Operation, amplifiers, Operational
Amplifiers; equivalent circuit, ideal behavior, open loop and closed loop concept, concept of
virtual short, simple Opamp applications; Unity gain amplifier, inverting, non-inverting,
integrator, differentiator, subtractor, summer.
Books/
References
7. Ashfaq Husain*: Fundamentals of Electrical Engineering, 3rd
Edition, Dhanpat Rai & Sons
8. R. Boylestad & L. Nashelsky*: Electronic Devices and Circuits, Prentice Hall, 1995
9. Hughes: Electrical Technology. 7th
edition, Addison Wesley
10. A.K. Sawhney: A course in Electrical & Electronics Meas. & Inst., Dhanpat Rai & Sons
11. B.R. Gupta: Electrical Power Systems, Wiley Eastern
12. Mathur, Chadda and Kulshresta: Electronic Devices, Applications and Integrated Circuits,
Umesh Publications.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x x x
3
4 x x
5 x x x
6 x x x x x
7 x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for all branches)
Course Title : Thermal Science
Course Number : MEA1110
Credits : 4
Course Category : ESA
Pre-Requisites : -
Contact Hours : 3-1-0
Type of Course : Theory
Course Work : Home Assignments 15%
Mid-Sem Examination (1 hour) 25%
End-Sem Examination (2 Hourss) 60%
Course Objectives:
At the end of this course the student will
1. Be able to have the basic concepts of thermal sciences and their application to in formulating the thermal
engineering problems.
2. Have a good understanding of first and second laws of thermodynamics and will be in
3. Be a position to fully understand the analysis to be taught at the higher levels.
4. Be in a position to check the feasibility of proposed processes and cycles using the ideas of second law
of thermodynamics and entropy.
5. Have the understanding of basic principles of heat transfer and related simple problems.
Course outcomes:
After taking this course the students shall be able to have:
1. The basic concepts of units and dimensions, systems(open and closed systems and control volumes) and its
boundaries, properties, state, process, cycle, quasi-static process etc.- required as foundation for development
of principles and laws of thermodynamics
2. Intuitive problem solving technique
3. Knowledge of two property rule and hence thermodynamic tables, thermodynamic diagrams and concept of
equation of state; also their simple application.
4. Heat, work and first law of thermodynamics. Application of energy balance
5. Second law of thermodynamics and its corollaries viz. absolute (thermodynamic) temperature scale,
reversibility, entropy, feasibility of a process based on first law and second law, isentropic efficiency of
adiabatic machines.
6. Introductory knowledge of power and refrigeration cycles. Their efficiencies and coefficients of performance.
7. Introductory ideas of heat transfer in conduction, convection and radiation modes. Application of these
concepts to heat transfer in single and combined modes.
Syllabus:
Unit –I
Dimensions and units, system, boundary, types of systems and boundaries, property, cycle , thermodynamic
equilibrium and quasi-static process.Pressure and its measurement, zero‘th law of thermodynamics, temperature
and its measurement, numerical problems.
Unit-II
Thermodynamic and mechanics‘ definition of work, displacement work and its expressions, engine indicator and
indicated work, introduction to 2-stroke and 4-stroke engines, heat, work and heat as energy interactions, Joule‘s
experiment & mechanical equivalent of heat, first law of thermodynamics for cyclic and non cyclic processes,
definition of energy as a property, internal energy, enthalpy, specific heats, first law for a control volume, steady
flow energy Equation ( SFEE ), and it‘s applications, numerical problems.
Unit-III
Pure substance, different phases of pure substance, two-property rule, property diagrams, tables and charts,
equation of state of an ideal gas, t~τ , t~p, p~v, and p~h diagrams, phase boundaries,
S-L-V region, CP and TP, dryness fraction and its measurement using throttling calorimeter, limitation of
throttling calorimeter, separating & throttling calorimeter, numerical problems.
Unit-IV
Limitations of first law , heat engine, heat pump, refrigerator, second law of thermodynamics- Kelvin Planck‘s
and Clausius statements and their equivalence, efficiency of heat engine and coefficient of performance of heat
pump and refrigerator, reversible and irreversible processes, Carnot cycle and its efficiency, corollaries of second
law, the thermodynamic temperature scale. inequality of Clausius, entropy, principle of increase of entropy,
isentropic process, t~s and h~s diagrams ( Mollier chart), second law applications, air standard otto, diesel, dual,
simple Brayton and steam power cycles (Rankine ycle), numerical problems.
Unit V
Modes of heat transfer, Fourier‘s law of steady state heat conduction ( one dimensional conduction), thermal
conductivity and its unit, conduction through slab or plane wall, hollow cylinders and spheres conduction through
composite walls and hollow cylinders and spheres with multi-layers, convective heat transfer, Newton‘s law of
cooling, electrical analogy and overall heat transfer coefficient, combined conductive and convective heat
transfer, radiation and radiation properties of surfaces, black body, emissive power, Stefan Boltzmann‘s law,,
emissivity, monochromatic emissive power and monochromatic emissivity, grey body, Kirchoff‘s law, Wien‘s
displacement law, numerical problems.
Reference Books:
1. Thermodynamics, An Engineering Approach by Yunus A. Cengel and Michael A Boles
2. Engineering Thermodynamics by D.B. Spalding and E. H. Cole.
3 .Engineering Thermodynamics by R. Joel
4. Engineering Thermodynamics by P.K.Nag.
5. Engineering Heat Transfer by C.P.Gupta and R. Prakash.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x x
3
4 x
5 x x x
6 x x x x x x
7 x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for all branches)
Course Title : Engineering Mechanics
Course Number : MEA1120
Credits : 3
Course Category : ESA
Pre-Requisites(s) : None
Contact Hours : 2 – 1 – 0
Type of Course : Theory
Course Work : Home Assignments 15%
MidSem Examination (1 Hour) 25%
EndSem Examination (2 Hourss) 60%
Course Objectives:
1. To give students practice in applying their knowledge of mathematics, science, and engineering and to
expand this knowledge into the vast area of Applied Mechanics.
2. To enhance students‘ ability to design by requiring the solution of open ended problems.
3. To prepare the students for higher level courses such as courses in Mechanics of Solids, Mechanical
Design and Structural Analysis.
Course Outcomes:
After taking this course students should be able to:
1. Work comfortably with basic engineering mechanics concepts required for analyzing static structures.
2. Identify an appropriate structural system to study a given problem and isolate it from its environment.
3. Model the problem using good free-body diagrams and accurate equilibrium equations
4. Identify and model various types of loading and support conditions that act on structural systems.
5. Apply pertinent mathematical, physical and engineering mechanical principles to the system to solve and
analyze the problem.
6. Communicate the solution to all problems in an organized and coherent manner and elucidate the
meaning of the solution in the context of the problem.
7. develop concepts of rigid body kinematics and dynamics with an emphasis on the modeling, analysis,
and simulation of how forces produce motion of rigid body systems.
8. Determine simple dynamic variables and solve simple dynamic problems involving kinematics, energy
and momentum.
9. Determine internal actions in statically determinate structures and draw internal action diagrams –Shear
Force (SFD) and Bending Moment Diagrams (BMD) for these structures.
Syllabus:
Unit 1:
Fundamental Concepts and principles of Mechanics. Reduction of a system of forces to a force couple system, Free
body diagrams, equilibrium of rigid bodies in 3 dimensions, reactions, loading indeterminacy and solvability. Friction
forces and laws of dry friction. Principle and application of virtual work.
Unit 2:
Analysis of Multiple particle system: Aplication of Newton‘s laws, linear and angular momentum, kinetic energy and
work energy principle, principle of impulse and momentum to a system of particles.
Unit 3:
Translation and rotation about a fixed axis, general plane motion, absolute and relative velocity in plane motion,
angular momentum of rigid body in plane motion. Problems of motion of rigid bodies and system of rigid bodies,
principle of work and energy, conservation of energy for rigid body and a system of rigid bodies.
Unit 4:
Analysis of stress and strain: Mechanical properties, analysis of simple state of stress and strains, elastic constants,
example of state of tension, compression and shear.
Unit 5:
Bending shear and torsion: Concept of bending and shear forces in simple beams, Relationship between load, bending
moment and shear force. Bending and shear stresses in simple beams, concepts of torsion in circular shafts.
Text Books:
1. Beer Ferdinand P. and Johnston Jr. E Russel, Vector Mechanics of Engineering: Statics and Dynamics, Metric
edition, Mc. Graw Hill, New Delhi.
2. Popov E., Engineering Mechanics of Solids, PHI, Delhi.
Reference Books:
1. Merium, JL, Engineering Mechanics (Volume I and II), 3rd edition, (SI version) John Wiley and sons, Inc, NT.
2. Timoshenko S. and Young DH, Elements of strength of materials, DYNC, New York.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x x
3
4 x
5 x x x
6 x x x x x x
7 x x
8 x x x x
9 x x
2017-2018
DEPARTMENT OF APPLIED CHEMISTRY
B. Tech. (for all branches)
Course Title : Applied Chemistry Lab
Course Number : ACS1910
Credits : 1.5
Course Category : BS
Pre-Requisites(s) :
Contact Hours (L-T-P) : 0-0-3
Type of Course : Lab
Course Assessment : Evaluation by viva Voce (60%)
Endsem Examination (2 Hourss) (40%)
Course Objectives
To train the students for the applications of the chemical sciences in the field of engineering and technology.
Course Outcomes
After completion of the course the students shall be able to understand:
1. The basic methods of chemical analysis and the instrumentation involved.
2. To estimate the hardness of water.
3. To carry out the proximate analysis of coal and grade the coal for indisutrial purposes.
4. To estimate the drop point of grease and its applications.
5. To study and explore the nature of the corrosion and its control.
6. About the determination of the molecular weight by viscometer.
Syllabus
1. Determine total, permanent and temporary hardness of water in ppm by versenate method.
2. To determine the amount of dissolved oxygen in water in ppm units.
3. To determine the cloud point, pour point and setting point of an oil.
4. To determine the percentage of available chlorine in the given sample of bleaching powder.
5. To carry out proximate analysis of the given sample of coal.
6. To determine the saponification value and percentage of fatty oil in the given sample of compounded oil.
7. To determine the aniline point of a given sample of an oil.
8. To determine the relative viscosity of an oil by redwood viscometer and to study the variation of viscosity
with change in temperature.
9. To demaonstrate and explore the electrochemical nature of aqueous corrosion. To study the electrochemical
methods of corrosion control.
10. To determine the flash point of an oil by Abel‘s and Pensky Marten‘s apparatus.
11. Determination of iron in a given sample of water with 1, 10 phenanthroline by spectrophotometry.
Suggested Readings/Text/References
1. Lab Manuals provided by the Department.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x
3 x
4 x
5 x
6 x
2017-2018
DEPARTMENT OF APPLIED PHYSICS
B. Tech. (for all branches)
Course Title Applied Physics Lab.
Course Number : APS1910
Credits : 1.5
Course Category : BS
Pre-Requisites(s) : None
Contact Hours (L-T-P) : 0-0-3
Type of Course : Lab.
Course Work :
Regular Lab. Assignments (42% record book+18% viva-voce) (60%)
Endsem Examination (2 hour) (40%)
Course Objective:
This course should enable the student to-
1. build an understanding of the fundamental concepts with the help of experiments.
2. familiarize the student with the various experiments of the physical world around him/her.
3. apply the concepts of physics in his/her field of study.
4. relate the concepts of physics to the advancement of technology.
5. allow the student to gain expertise in design and maintenance of experiment setup.
Course Outcomes:
Upon completion of the course, the student will be able to:
1. recognize and present real life examples of various experiment performed.
2. describe the link between physics and the technology.
3. understand and explain data analysis and identify technological applications of the experiments.
4. describe how he/she can harness the benefits of some of the experiments to his /her area of specialization.
5. understand the professional and ethical responsibilities of the subject.
6. communicate effectively while speaking, employing graphics and writing.
Syllabus
List of Experiments
1. To determine the moment of inertia, I of a flywheel about its axis of rotation.
2. To determine resistance per unit length, σ of a Carey Foster‘s Bridge wire and hence to find the difference
between the two nearly equal unknown resistances.
3. To determine the modulus of rigidity of the material of a wire, η by statical (vertical) method.
4. To determine the refractive index, µ of the material of a prism for parrot green line in the mercury
spectrum.
5. To study the variation of semiconductor resistance with temperature and hence to find the energy- gap, Eg
of the semiconductor.
6. a) To study the V-I and power characteristics of a solar cell and also to determine its fill factor.
b) To study the current versus voltage characteristics of two light emitting diodes (LED) and hence to
determine their cut in voltages.
7. To determine the diameters of three thin wires with the help of a He-Ne Laser.
8. To determine the coefficient of thermal conductivity, K of rubber in the form of a tube.
9. To convert a Weston type galvanometer into an ammeter (ranges 5, 10 and 15 A) and a voltmeter (ranges 5, 10
and 15 V).
10. To determine the wavelength, λ of yellow line of shorter wavelength in the mercury spectrum with plane
transmission grating.
11. To determine the specific rotation, αt of cane sugar solution in water using a biquartz polarimeter.
12. To calibrate a given thermo-couple with the help of a potentiometer.
13. To find the operating voltage of a G.M. counter and to determine the absorption coefficient, μ of copper
for gamma rays from 137
Cs source.
14. a) To draw the graph between various values of capacitance and the corresponding frequencies of a given
oscillator and to determine the value of unknown capacitance by using Lissajous Figures.
b) To draw the graph between various values of inductance and the corresponding frequencies of a given
oscillator and to determine the value of unknown inductance by using Lissajous Figures.
15. To determine Hall coefficient, RH and majority carrier concentration of a given semiconductor sample.
Text and Reference Books
1. Prof. D.S. Srivastava & Dr. Ameer Azam, Laboratory Manual of Applied Physics Experiments, AMU,
Aligarh
2. Indu Prakash and Ramakrishna, A Text Book of Practical Physics, Kitab Mahal, New Delhi.
3. D. P. Khandelwal, A Laboratory Manual of Physics for Undergraduate Classes, Vani Publication House,
New Delhi.
4. K. K. Dey, B. N. Dutta, Practical Physics, Kalyani Publishers, 1981, New Delhi.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x x
4 x x
5 x x x
6 x x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for all branches)
Course Title : Engineering Graphics Lab
Course Number : MEA1910
Credits : 2
Course Category : ESA
Pre-Requisites(s) : None
Contact Hours (L-T-P) : 0 – 1 – 2
Type of Course : Lab
Course Work : Home Assignments 60%
EndSem Examination (2 hours) 40%
Course Objectives:
1. To understand and appreciate the importance of Engineering Graphics.
2. To understand the basic principles of Technical/Engineering Drawing.
3. To understand the different steps in producing drawings according to BIS.
4. To learn basic engineering drawing formats.
Course Outcomes:
After taking this course students should be able to:
1. Understand the theory of plane geometric projection and its classifications.
2. Use Plane/diagonal/isometric scales in engineering graphics.
3. Apply various concepts like dimensioning, conventions and standards related to engineering graphics in order
to become professionally efficient.
4. Read and interpret drawings of simple machine parts/ sectional views in first and third angle of projection
systems.
5. Explain the conventions and the methods of orthographic projection and isometric projection.
6. Improve their visualization skills so that they can apply these skills in developing new products.
7. Model simple machine parts in isometric projections.
8. Develop skills to communicate ideas and information through engineering drawing.
Syllabus:
Unit-1:
Introduction to graphic language, Instruments and their use, Conventional Lines and their uses. Printing of letters and
numerals, Methods of dimensioning. Construction and use of scales, Construction of cycloidal curves and involutes.
Unit-2:
Necessity for orthographic projections 1st & 3rd angle methods of projection. Projection of points & lines on three
coordinate planes, Projections of plane surfaces.
Unit-3:
Orthographic projections of simple machine parts on different planes. Choice of view, Hidden lines, Preparation of
multi view drawings. Necessity of sectional views and their drawings.
Unit-4:
Axonometric Projections. Drawing of isometric projection of simple solids; Development of surfaces of simple solids.
Use and methods of drawing.
BOOKS:
1. P.S. Gill, ―A Test Book of Geometrical Drg., Katson Pub. House, Ludhiana.
2. Warren J. Lucadder, ―Fundamentals of Engg. Drg., Pren. Hall, N. Delhi.
3. N.D. Bhatt, Elementary Engg. Drg., Charotar Pub. House, Anand, India.
Web Links : http://nptel.iitm.ac.in/courses.php, www.cognifront.com/engdrawing.html
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x x x
3 x x
4 x
5 x x x
6 x x x x x
7 x x
8 x x x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for all branches)
Course Title : Manufacturing Process Laboratory
Course Number : MEA1920
Credits : 1.5
Course Category : ESA
Pre-Requisites(s) : None
Contact Hours (L-T-P) : 0-0-3
Type of Course : Laboratory
Course Work : Reports/Viva-Voces (60 Marks) &
End Semester Examination (40 Marks)
Course Outcomes:
1. Knowledge and understanding of various types of ferrous and non-ferrous materials used for manufacturing
processes.
2. Understanding and selection of processes based upon jobs drawings used for manufacturing.
3. Basic knowledge of hot and cold working processes.
4. Selection and knowledge of various tools applied for cold and hot working processes.
5. Exposure and understanding of machine tools required for manufacturability.
6. Analyze the job manufactured from practical relevance point of view.
Syllabus:
1. To prepare through tennon and mortise joint.
2. To prepare a funnel of GI sheet.
3. To perform filling, drilling and tapping operations.
4. To perform electroplating.
5. Preparation of green sand mould and to perform casting process.
6. To prepare a square headed bolt.
7. To carry out gear cutting by simple indexing.
8. To prepare a single V-butt joint by arc welding and study of gas welding process.
9. To perform facing, simple turning, taper turning, threading and knurling operations on a lathe machine.
10. To perform plaining and slot cutting operations on shaper and slotter machines.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x x
3 x
4 x
5 x x x
6 x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech. (for all branches)
Course Title Computer Programming Laboratory
Course Number : COA1910
Credits : 1.5
Course Category : ESA
Pre-requisite(s) : -
Contact Hours (L-T-P) : 0-0-3
Type of Course : Practical
Course Objective
To make students of all branches of B.Tech familiar with the programming concepts and to implement the algorithmic
approach of problem solving in C language to gain working knowledge of C programming.
Course Outcome
Students will be able to:
1. Understand programming concepts and C language constructs such as operators and data types, control
statements, functions etc.
2. Gain algorithm development skills
3. Implement programming problems in C Language
Syllabus
Introduction to Programming Environment, experiments to be conducted in the laboratory consist of, but not limited
to, the following:
Practice of Turbo C as the development environment
Simple introductory algorithms and programs for getting input, printing formatted output etc.
Programs introducing elementary C concepts, like variable and names
Programs using operators
Programs using control structures
Programs for repetitive tasks and iterations
Programs on arrays and strings
Programs introducing the use of function calls
Programs introducing basic concept of file handling and storage classes
Books:
1. Kemighan, Brian W., and Dennis M. Ritchie. "The C programming language."Prentice-Hall, Englewood
Cliffs, New Jersey (I978).
2. Gottfried ―Theory and Problem of Programming with C‖ Schaum‘s Outline Series, TMC (Text book)
3. E. Balagurusamy ―Programming in ANSI C‖, McGraw Hill Education India Private Limited (2016) (Text
Book)
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x
3 x
2017-2018
DEPARTMENT OF APPLIED MATHEMATICS
B. Tech. (for Computer Engineering)
Course Number & Title : AMS2610, Higher Mathematics
Credits : 04
Course Category : BS
Pre-requisite(s) : AM-111, AM-112
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment Course Work (Home Assignments) (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hours) (60%)
Course Objectives:
To learn mathematical tools in complex variables and functions, complexr integration and vector calculus.
Course Outcomes:
After completing the course the students are expected to be able to
1. Understand and apply the basics of complex variables, functions and contour integration to various
engineering problems.
2. understand vector differentiation and apply it in relevant problems
3. understand and apply vector integration in engineering problems
Syllabus
Unit-1 Functions of a complex variable, analytic functions, Cauchy-Riemann equations, complex integration of
functions of a complex variable, line integrals, Cauchy‘s theorem, and Cauchy‘s integral formula.
Unit-2 Taylor series, Laurent‘s series, zeros and singular points, residues and residue theorem, evaluation of real
integrals by contour integration.
Unit-3 Vector differentiation, gradient of a scalar field and its physical significance, divergence and curl of a vector
field and their physical significance, solenoidal and irrotational fields, determination of potential functions.
Unit-4 Integration of vector functions, line integrals, conservative fields, surface and volume integrals, Gauss
divergence theorem, Stokes‘ theorem, Green‘s theorem, applications.
Text Book(s)/Reference Book(s)
1 Chandrika Prasad, ″ Mathematics for Engineers″, Pothishala Pvt. Ltd., Allahabad.
2 M. K. Venkataraman, ″ Engineering Mathematics″ , Third Year (Part A, B), National Publishing Co. Madras.
3 Erwin Kreyszig , ″Advanced Engineering Mathematics″ , John Wiley & Sons, INC.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x x
3 x x x
2017-2018
DEPARTMENT OF APPLIED MATHEMATICS
B. Tech. (for Computer Engineering)
Course Number and Title : AMS2620, Numerical Analysis, Transforms & Probability
Credits : 04
Course Category : BS
Pre-requisite(s) : AM-111, AM-112
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Course Work (Home Assignments) (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hours) (60%)
Course Objectives:
To learn tools of Mathematics in Laplace transforms, numerical techniques and theory of probability.
Course Outcomes:
After completing the course the students are expected to be able to:
1. understand and apply Laplace transform methods for solving ordinary differential equations.
2. apply numerical methods for solving system of linear equations, non-linear equations, interpolation
methods in engineering problems.
3. evaluate derivatives , areas, and numerical solutions of differential equations.
4. understand the basic concepts of probability and apply them in engineering problems.
Syllabus:
Unit-1 Laplace transforms of important functions, shifting theorems and other important properties, inverse
Laplace transform, applications to single and system of linear differential equations.
Unit-2 Errors, solution of nonlinear equations by Newton Raphson and general iteration methods and their
convergence, solution of system of linear equations by Gauss elimination and Gauss-Seidel methods;
finite-difference operators, interpolation and extrapolation., Newton‘s divided difference & Lagranges
interpolation formulas and Newton‘s forward and backward difference interpolation formulae.
Unit-3 Numerical differentiation for tabular & non-tabular values and integration by Trapezoidal, Simpson‘s
methods, Gaussian quadrature, solution of first order initial value problems by Taylor‘s , modified
Euler‘s and Runge-Kutta methods, numerical solution of two point boundary value problems.
Unit-4 Probability: sample space, laws of probability, addition and multiplication theorems, solution of simple
problems, conditional probability, Bayes‘ theorem, dependent and independent events, .random
variables, binomial and normal distributions.
Text Book(s)/Reference Book(s)
1. M. K. Jain, S.R.K. Iyenger and R.K. Jain,″ Numerical Methods for Scientific and Engineering Computations″ ,
New age International Publication (P) Ltd.
2. S. S. Sastry, ″Introductory Numerical Methods″, Prentice Hall India Ltd.
3. Erwin Kreyszig, ″Advanced Engineering Mathematics″, John Wiley & Sons, INC.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x
3 x x x x
4 x x x
2017-2018
DEPARTMENT OF APPLIED MATHEMATICS
B. Tech. (for Computer Engineering)
Course Number and Title : AMS2630, Discrete Structures
Credits : 04
Course Category : BS
Pre-requisite(s) : AMS1110
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Course Work (Home Assignments) (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hours) (60%)
Course Objectives
To learn some discrete algebraic structure such as groups, rings, fields, basics of Graph theory and combinatorics. and
also linear programming problems.
Course Outcomes
After completing this course, the students shall be able to:
1. understand algebraic structures and apply them in the field of computer engineering
2. understand the basics of Graph theory and some optimization problems such as shortest path
problem, max flow problems etc.
3. understand the basics of combinatorics and solve the recurrence relations.
4. solve optimization problems using linear programming and simplex algorithm.
Syllabus:
UNIT –1 ALGEBRAIC STRUCTURE
Relations and functions, monoids, semi groups and groups, rings and fields.
UNIT-II GRAPH THEORY
Formal definition of graphs, directed and unidirected graphs, cycles, chain, path, connectivity,
adjacency and incidence matrices, shortest path algorithm, elements of transport networks, flows in
networks.
UNIT-III COMBINATORICS Introduction to permutations and combinations, recursion. introduction to some common recurrence
relations, generating functions, solution of recurrence relations using generating functions.
UNIT-IV LINEAR PROGRAMMING
Formation of linear programming problem and its solution by graphical methods and simplex
algorithm, duality.
Text Book(s)/Reference Book(s)
1. Narsingh Deo, Graph Theory with applications to engineering and computer science, Prentice-Hall of India,
New-Delhi
2. B. Kolman etal, Discrete Mathematical Structures, Pearson Education
3. Kanti Swaroop etal, Operations Research, Sultan Chand and Sons, Educational Publishers, New-Delhi
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x
3 x x x x
4 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title OBJECT ORIENTED PROGRAMMING
Course Number : COC2030
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : COA1910 Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
The objective of this course is to have students learn basic concepts of object-oriented programming and its difference
from procedural programming, implementation of OO concepts and techniques and writing simple application, in both
C++ and JAVA. Practice the concepts of OOD (Object Oriented Design) with UML (Unified Modeling Language).
Course Outcome
Students will be able to:
1. Describe the principles of Object Oriented Programming (OOP).
2. Explain the model of OOP: abstraction, encapsulation, inheritance and polymorphism.
3. Apply the concepts of abstraction, encapsulation, inheritance and polymorphism in C++ and JAVA.
4. Distinguish between Procedural programming and Object Oriented Programming.
5. Apply accepted good practices related to the construction of object oriented programs.
6. Develop simple applications in C++ and JAVA.
7. Develop applications with GUI.
8. Explain association, aggregation and generalization in UML.
9. Design UML based designs (based on Use Case, class, sequence and, state diagrams).
SYLLABUS:
UNIT-I Object Oriented Concepts
Encapsulation, Data Hiding, Procedure Oriented Programming vs Object oriented Programming, Objects, Classes,
Polymorphism, Inheritance, Abstract Classes, Constructor, Destructor, Class Members, Overloading, Exception
Handling, Virtual Function
UNIT-II Object Oriented Programming in C++
Program structure, Class, Derived class, Overloading, Template, Exception handling, Scope operator, Virtual function
UNIT-III Object Oriented Programming in Java
Program Structure, Java Architecture, Statements, Classes, Inheritance, Polymorphism, Arrays, API and Packages,
GUI in Java
UNIT-IV UML
Class diagram, Representing association, Generalization, Aggregation, State diagram, Use case diagram, Scenario,
Sequence diagram, Activity Diagram etc.
Reference:
1. Robert Lafore; ―Object Oriented Programming in C++; Pearson Education
2. Rumbaugh and Blaha; ―Object Oriented Modeling and design with UML‖, Pearson Education
3. Bruce Eckel; ―Thinking in Java‖; Prentice Hall
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x
3 x x
4 x
5 x
6 x x x
7 x x x x
8 x x
9 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title DATA STRUCTURES AND ALGORITHMS
Course Number : COC2060
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : COA1910
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
To introduce the concept of data structures including arrays, linked lists, stacks, queues, binary trees, heaps, binary
search trees, and graphs etc, and apply these data structures in problem solving. To introduce applications of various
data structures and its use in a manner that adds to the efficiency of an algorithm in writing effective programs.
Course Outcome
The student will be able to
1. Learn how the choice of data structures and algorithm design methods impact the performance of programs.
2. Analyze the importance and use of Abstract Data Types (ADTs)
3. Design and implement elementary Data Structures such as arrays, trees, Stacks, Queues, and Hash Tables.
4. Identify algorithms as a pseudo-code to solve some common problems.
5. Explain best, average, and worst-cases of an algorithm using Big-O notation.
Syllabus:
UNIT I : INTRODUCTION
Concept of Data Structures, Basic Terminologies related to data structures, linear and non-linear data structure.
Concept and properties of algorithms, How to develop an algorithm, Complexity, Time-Space Tradeoff, Algorithm
analysis, Rate of growth: Big Oh notation, other asymptotic notations for complexity of algorithms.
UNIT II: ARRAYS
Arrays, one-dimensional arrays: traversal, selection, searching, insertion and deletion. Sorting: Bubble sort, selection
sort, insertion sort, merge sort, quicksort, other sorting methods and their analysis. Multi-dimensional arrays,
Representation of arrays in physical memory, Application of arrays.
UNIT III: Abstract Data Types (ADTs)
Abstract Data Types, Stacks, Applications of Stacks - prefix and postfix notations, Queue, Circular Queue, Priority
Queue, Dequeue, Linked Lists, Operations on Linked Lists, Circular linked lists, doubly linked lists, concept of
dummy nodes.
UNIT IV: Trees & Graphs
Basic terminologies, Binary Tree, representation and traversal of binary tree; in-order, preorder, and post-order
traversal. Different types of binary trees: binary search tree, Heap trees and its application to sorting. Graph,
representation and its applications. Other related topics.
Books:
1. A.K.Sharma, ―Data Structure using C‖, Pearson, 2011
*2. Lipschutz, ―Data structures‖ Tata McGraw Hill.
3. Goodrich M. Tamassia R., ―Data Structures and Algorithms in Java‖, 3rd
ed. Wiley
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x x
4 x
5 x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title DIGITAL LOGIC AND SYSTEM DESIGN
Course Number : COC2070
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : AMS1110
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
Provide introduction to Fundamentals of digital systems in terms of both computer organization and logic level design.
Provide understanding of design and implementation of digital circuits, Organization of digital computers, Boolean
algebra, Analysis and Synthesis of combinational and sequential circuits.
This course includes Boolean algebra, combinational circuits, sequential circuits and Architecture and organization of
digital computer.
Course Outcome
Students will be able to:
1. Explain Boolean logic operation and minimization of a Boolean function.
2. Utilize the digital gates to implement a Boolean function.
3. Explain and classify the digital circuit and its behaviour.
4. Design of digital circuits for general functions like counter, sequence generator, parity checker, shift
register with different functioning, ALU, Decoder, Multiplex, etc
5. Visualize, explore, design, and build combinational and sequential digital logic solutions to general
problems.
6. Identify and explain the components, and their interaction, in a typical modern day processor and its
architecture.
Syllabus
UNIT I. BOOLEAN ALGEBRA AND LOGIC GATES
Introduction, Binary numbers, Base-conversions, Octal and hexadecimal numbers, complements, binary
codes, Basic Theorems and properties, Boolean functions and representation in canonical and standard
forms, SOP and POS forms, other logic operations, Digital logic gates, Function minimization:
Karnaugh map methods, Limitations of K-maps for larger variables, POS-simplification, NAND/NOR
implementation, other 2-level implementations, Don‘t-care conditions, Tabular method.
UNIT II. COMBINATIONAL SYSTEMS
Hardware aspect of arithmetic logic functions, Half-Adder, Full-Adder, Binary Adder/Subtractor,
Parallel Adder, Magnitude, Comparator, Demultiplexer, Multiplexer, Parity Checker/Generator, ROM.
UNIT III. SEQUENTIAL SYSTEMS
Definition and state representation of Flip-Flops, RS, D, JK-M/S, their working characteristics, State
Tables, Excitation Tables and triggering, Asynchronous and Synchronous Counters-Design and
Analysis, Counter Applications, Description and Operations of Shift Registers, Shift Register/Counters.
UNIT IV. COMPUTER ORGANIZATION
Introduction to Architecture and organization of digital computer, ALU, I/O-Unit, Control Unit, CPU,
Microprocessor and Microcomputer, Data and Instruction Formats.
Books:
*1. M. Morris Mano, ―Digital Logic and Computer Design‖, PHI.
*2. A.P. Malvino, ―Digital Computer Electronics‖, McGraw Hill.
3. W. I. Fletcher. ―An Engineering Approach to Digital Design‖, PHI.
4. R.J. Tocci, ―Digital Systems: Principles, and Applications‖, PHI.
5. T.C. Bartee, ―Digital Computer Fundamentals‖, McGraw Hill,
*Text Book
Table: Mapping of Program Outcomes and Course Outcomes for CO-207
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x
3 x x
4 x x x
5 x x
6 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title COMPUTER ARCHITECTURE
Course Number : COC2080
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : COC2070
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
To know the theory of components of a computer and its operation, and to learn applying the knowledge for designing
a minimal computer system.
Course Outcome
Students will be able to:
1. Explain the philosophy of digital systems
2. Interpret the micro-operations
3. Explain and design arithmetic and logic unit
4. Classify various storage devices
5. Design the control and execution unit to execute a binary instruction
6. Acquire the knowledge of advanced concepts of performance measure and speeding-up of computing
Syllabus
UNIT I INTRODUCTION TO BASIC COMPUTER ARCHITECTURE
Philosophy of digital computers, Method of register, bus and memory transfer, Micro-operations:
Arithmetic, Logic and Shift, Introduction to execution of unit-register, ALU design and shift register
design, division of unsigned integers, IEEE 754 standard of floating point numbers, Floating point
arithmetic operations.
UNIT II MEMORY AND PROCESSOR ORGANIZATION
Introduction to main, cache, auxiliary and virtual memory, concept of address mapping, Instruction and
Interrupt cycles, Timing and Control, Design of accumulator logic, Central Processing Unit (CPU):
Single accumulator, General register and Stack organization, assembly language, RISC and CISC
characteristics.
UNIT III HARDWIRED & MICROPROGRAMMED CONTROL LOGIC DESIGN
Hardwired control design: Computer instruction execution, Design of computer registers, Design of
basic computer, PLA Controller. Microprogrammed control design: Basic concepts of
Microprogrammed Control Design, Microprogrammed Control design of an example computer,
Microprogram sequencer.
UNIT IV ADVANCED CONCEPTS IN COMPUTER ARCHITECTURE
CPU performance measures and Benchmarks, Introduction to pipeline and parallel processor,
Parallelism in conventional computers, classification of parallel computers, Pipelining: general
consideration and speedup, pipeline structures: arithmetic and instruction pipeline, Introduction to
different types of available computers.
Books:
1. *M. Morris Mano ―Computer System Architecture‖ Third edition, Pearson Education India, Pvt.
Ltd, reprint 2007
2. *David A. Patterson and John. L. Hennessey ―Computer Organization and Design, The
Hardware/Software Interface‖, 3rd
Edition, Morgan Kaufmann Publishers.
3. *Mohamed Rafiquzzaman and Rajan Chandra ―Modern Computer Architecture‖, Galgotia
publication Pvt. Ltd.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x x x
3 x x x
4 x x x
5 x x x x
6 x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Software Engineering
Course Number : COC2090
Credits : 4
Course Category : DC
Pre-requisite(s) : COA1910
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
This course covers practices which are applied during software development. These practices help in developing large
size and complex software. With concepts and knowledge gained from this course, one can easily become part of
industrial software production.
Course Outcomes
Upon completing the course, the student will:
1. be familiar with software development process model, metrics, requirement specification, design, coding,
testing and object oriented development
2. be able to apply software engineering practices to software development
3. be able to estimate effort in software development
4. be able to do requirement analysis, design, coding and testing of software
5. be able to quantify, analyze and improve upon software development
6. be able to develop software cooperatively in a team
Syllabus
UNIT I INTRODUCTION TO SOFTWARE ENGINEERING AND SOFTWARE PROCESS
Program Vs Software; Characteristics of Software; Evolution of Software Engineering, Software categories; Software
Development life cycle; Software Quality; Software Development Processes; Waterfall model, Prototyping
Incremental Methods, Evolutionary Models - Spiral Model, Component Based Development; Fourth Generation
Techniques, Unified Process
UNIT-II SOFTWARE PROJECT PLANNING AND SOFTWARE METRICS
Software measurement and metrics, Size oriented metrics, Function oriented metric; Function Point and Feature Point;
Planning a software project; Software Requirement specification; Team Structure, Software Cost Estimation and
Evaluation techniques.
UNIT-III SOFTWARE DESIGN
Software Design Objectives and Principles, Module level concepts Coupling and Cohesion, Design notation and
specification; Architectural Design, Component Level Design, Interface Design; Structured Design Methodology,
Design Heuristics, Verification, Concepts of Object Oriented Design.
UNIT-IV CODING, TESTING AND OTHER TOPICS IN SOFTWARE ENGINEERING
Programming practice, Programming Style, Code verification; Testing fundamentals, Test cases and test criteria,
Black box testing, White box testing; Cyclomatic complexity, Structural testing. Software Risk Management;
Configuration Management; Software Re-Engineering.
BOOKS:
1. Roger S. Pressman, ―Software Engineering: A Practitioner's Approach‖, 7th International edition, Mc Graw
Hill, 2009
2. Pankaj Jalote, ―An Integrated Approach to Software Engineering‖, Narosa publishing House, New Delhi, 1995.
3. Fairley, R.E. ―Software Engineering Concepts‖, McGraw Hill, 1992.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x x
3 x x x
4 x x x x x
5 x x x x
6 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title DESIGN AND ANALYSIS OF ALGORITHMS
Course Number : COC2140
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : COC2060
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
After taking this course the students should be able to:
1. Design algorithms for the problems that are encountered in the area of Computer Engineering.
2. Analyze the time and space complexity of algorithms.
3. Use different paradigms for designing algorithms depending on the problem to be solved.
4. Design an algorithm that is efficient and decide which algorithm may result in a better solution for a given
problem.
Course Outcome
Students who completed the course have demonstrated the ability to:
1. Argue about the correctness of algorithms using inductive proofs and invariants.
2. Analyze running times of algorithms using asymptotic analysis.
3. Use different paradigms such as divide-and-conquer, greedy, dynamic programming, etc.
4. Decide whether a solution to the problem exists in a reasonable amount of time. If no such solution exists, one
can consider algorithms that try to solve the problem approximately.
5. Develop efficient algorithms for the problems in the area of Computer Engineering and other engineering
disciplines.
Syllabus
UNIT I INTRODUCTION
Review of algorithmic analysis, Asymptotic Notations; Solving Recurrences: Substitution methods,
Recursion-Tree method and Master method.
UNIT II ALGORITHM DESIGN TECHNIQUES
Divide and Conquer Approach, Dynamic Programming, Greedy Algorithms, Greedy versus
Dynamic Programming.
UNIT III GRAPH ALGORITHMS
Breadth First Search, Depth First Search; Minimum Spanning Trees, Shortest Path Algorithms,
Dijkstra‘s Algorithm, The Bellman-Ford Algorithm, The Floyd-Warshall‘s Algorithm; Maximum
Flow; Flow Networks, The Ford-Fulkerson Algorithm.
UNIT IV NP COMPLETENESS
P and NP classes, Unsolvable problems, NP Completeness and Reducibility, Circuit Satisfiability,
Examples and Proofs of NP-Complete problem.
Books:
*1) Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, ―Introduction to Algorithms‖,
Third Edition, September 2009, MIT Press USA.
2) Alfred V. Aho, John E. Hopcroft, Jeffery D. Ullman, "The Design and Analysis of Computer Algorithms",
Addison-Wesley, 2001.
3) Ellis Horowitz, Sartaj Sahni, "Fundamentals of Computer Algorithms", Galgotia Publications, 2001.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x
3 x x x
4 x
5 x x x
2017-2018
DEPARTMENT OF ELECTRONICS ENGINEERING
B. Tech. (for Computer Engineering)
Course Title ELECTRONIC DEVICES AND CIRCUITS
Course number ELA2110
Credit Value 4
Course Category ESA
Pre-requisite ELA1110
Contact Hours (L-T-P) 3-1-0
Type of Course Theory
Course Objectives The objective of this course is to help the student to understand the fundamental devices
of electronics engineering such as diode, transistor, amplifier and oscillators etc. Further
this course discusses the characteristics of amplifiers at low frequencies and high
frequencies.
Course
Outcomes
After completing this course the students should be able to:
1. Understand the behaviour of fundamental electronic devices.
2. Understand different applications of electronic devices.
3. Understand and analyse different types of transistor based circuits at low and
high frequencies.
Syllabus
Unit 1. Devices: Varactor diode, Schottky barrier diode, Tunnel diode, review of BJT
characteristics and parameters, minority carrier profile in BJT, base-width
modulation, BJT as a switch, review of MOSFEET and its operation,
MOSFET as a resistor and as a switch, channel length modulation.
Unit 2. Biasing and Stabilization: Operating point, Bias stability of BJT and MOSFETs, Biasing circuits of BJT
and MOSFETs, Stabilization against various parameters, Bias compensation.
Unit 3. Small signal and low frequency amplifiers:
Low frequency models for BJT‘s and MOSFETs, Small signal-low frequency
analysis of BJT and MOSFET amplifiers in various configurations and their
compensation.
Unit 4. Frequency response of amplifiers: Frequency response, Effects of coupling
and bypass capacitors, Introduction to high frequency response using hybrid
models of BJT‘s and MOSFETs, high frequency response of common source
amplifier.
Unit 5. Feedback amplifiers and Oscillators:
Feedback concept, Negative feedback and its effect on various amplifier
characteristics, Positive feedbacks, Principle of oscillator circuits, Popular BJT
and FET oscillators, Colpitt and Hartleys oscillator, Crystal oscillators,
Negative resistance oscillators.
Books*/References
1. *A.S. Sedra and K.C. Smith, Microelectronic Circuits, Oxford University
Press, Vth
Edition, 2004.
2. J. Millman and C.C. Halkias, Integrated Electronics, McGraw Hill, 2005
3. R. Boylested and L. Nashelsky, Electronic Devices and Circuits, PHI, 1996.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x x
3 x x x
2017-2018
DEPARTMENT OF ELECTRONICS ENGINEERING
B. Tech. (for Computer Engineering)
Course Number &Title : ELA2410 Signals and Systems
Credits : 4
Course Category : ESA
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Home Assignments (including MATLAB based problems and
Quizzes) (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hourss) (60%)
Course Objectives
To understand basics of signals and systems, classifications of signals and systems; time and frequency domain
analysis of signals and systems using various transforms.
Course Outcomes
After completing this course the students should be able to:
1. Independently evaluate parameters of signals such as energy, power, period etc.
2. Identify various properties of signals and systems and classify them on the basis of these properties.
3. Compute convolution of continuous and discrete-time signals.
4. Evaluate Fourier series and (Forward and Inverse) Fourier transforms of signals and therefore plot frequency
(magnitude and phase) response of LTI systems.
5. Compute Laplace and Z-transform of continuous and discrete-time signals respectively and identify their region
of convergences.
6. Use Nyquist sampling theorem to choose adequate sampling rate.
7. Evaluate transfer function of complex systems using block diagram reduction technique and Mason‘s gain
formula.
8. Understand the concept of random signals and random process and Evaluate statistical properties, correlation
functions and power spectral densities of random signals.
Syllabus
Unit 1: Introduction to Signals and Systems
Definition and examples of signals and Systems; Mathematical modeling; Classification of Signals and Systems;
Singularity functions; Representation of signals using basis functions; Exponential Fourier series and its application in
signal theory; Concept of Frequency spectra; Convolution integral and its applications; Concept of system impulse
response and its properties
Unit 2: Transform Techniques
Frequency domain representation of continuous time signals; Fourier transform and its properties; Hilbert Transform;
Bandpass signals and their mathematical description; Laplace transform and its relationship with Fourier transform;
Overview of sampling; Z-transform and its properties; Inverse z-transform; Discrete-time Fourier transform; Discrete
Fourier Transform
Unit 3: Analysis using Transforms System representation using transfer function; Feedback and stability of system; Block diagram reduction techniques;
Signal flow graph and Mason‘s gain formula; Time and frequency response of I and II order systems; Discrete-time
system representations; Analysis of discrete-time systems
Unit 4: Random Signals Review of random variables; Probability distribution and probability density functions; Classification of random
variables (according to their distribution); Statistical Averages; Functions of random variables; Introduction to random
process; Stationarity, mean, correlation and covariance function; Ergodicity and central limit theorem; Power spectral
density; Gaussian random process and its properties; Analysis of LTI systems with random inputs; Noise and its
representation
Text Book(s)
4. A. V. Oppenheim and A. S. Willisky, ―Signals and Systems‖, 2nd
Edition, Prentice Hall India, 2010.
5. B. P. Lathi, ―Linear systems and Signals‖, Oxford University Press, India, 2010.
Reference Book(s)
1. B. P. Lathi, ―Signal Processing and Linear Systems‖, Oxford Univ. Press, 2000.
2. M. Mandal and Amir Asif, ―Continuous and Discrete Time Signals and Systems‖, Cambridge Univ. Press, 2007.
3. S. Haykin, ―Communication Systems‖, 4th
Edition, John Wiley, 2001.
4. G. R. Cooper and C D McGillen, ―Probabilistic methods of signals and system analysis‖, Oxford Univ. Press,
1998.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x x
3 x x x x
4 x x x
5 x x x
6 x x x
7 x x x x
8 x x x
2017-2018
DEPARTMENT OF ENGLISH
B. Tech. (for all branches)
Course Number and Title : EZH2910 Communication Skills Laboratory
Credits : 2
Course Category : Humanities (HM)
Pre-requisite(s) :
Contact Hours (L-T-P) : 0-1-2
Type of Course : Laboratory
Course Assessment : Course works, viva voce (60%)
Endsem Examination (2 Hourss) (40%)
Course Objectives
To develop communication and presentation skills using modern tools.
Course Outcomes
Upon successful completion of this course, it is expected that students will be able to:
1. Analyze and apply the basic concepts of communication effectively.
2. Develop written and spoken communication skills.
3. Able to present their ideas rationally and logically.
4. Use modern communication tools for effective communication and presentation.
5. Describe the importance of constructive feedback for consistent self-development.
6. Communicate one‗s point of view with clarity duly attributing courtesy and formality to their conveying.
7. Engage in debates, group discussions and personal interviews.
8. Deliver oral presentation, and seminars confidently.
Syllabus
Unit I. Writing Official Letters: Basic principles, format and type: employment letters, placing orders enquiry
and response letters, letters of complaint and apology, persuasive letters, curriculum vitae.
Unit II. Business Working:
(a) Glossary of business terms
(b) Drafting business messages: memos, telexes, e-mails, press notice references, tenders and bids,
employment advertisements.
Unit III. Academic Writing:
(a) Note-making and note-taking, abstracting, use of graphics (tables and free diagrams) preparing
bibliography.
(b) Writing academic papers and reports
Unit IV. Oral Communication in Business Setup: Attending interviews, telephonic conversation, reception of
visitors, holding meetings.
Unit V. Oral Communication in Academic Setup: Participating in group discussions, Presenting prepared papers
and reports, Seminar Strategies.
Relationship of COs with POs
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x
3 x
4 x
5 x x
6 x x
7 x x
8 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title DATA STRUCTURES AND OOP LABORATORY
Course Number : COC2910
Credits : 2
Course Category : DC (Departmental Core)
Pre-requisite(s) :
Contact Hours (L-T-P) : 0-1-2
Type of Course : Practical
Course Objective
The objective of this course is to teach the students about the core C programming concepts.
1. Familiarize the students with programming environments- TurboC, DosBox, Linux GCC etc.
2. Explain the main concepts of C language- Data Types, Operators, Functions, I/O, File handling, Graphics etc.
3. Explain the syntax and semantics of major C Construct
4. Familiarize the students with main in-built C library functions
5. Develop the problem-solving ability using C in students
Course Outcome
Upon successful completion of this course, the student will be able to:
1. Design, implement and debug programs in C
2. Understand how to write and use functions, how the stack is used to implement function calls, and parameter
passing options
3. Understand and use the common data structures typically found in C programs — namely arrays, strings,
structures, union etc
4. Use all the main C constructs in their programs
5. Use pointers, File concepts and C graphic concepts in their programs
Syllabus:
List of Experiments conducted in the Lab
1. Given a word and a sentence, find the location(s) (index of sentence where the word starts) of word in the
sentence.
2. Using array of structure pointers, prepare a set of questions. Each question has a question ID, question text,
four possible answers and one correct answer. Implement following operations:
I. Store a new question
II. Display a stored question by Question ID
3. Simulate the movement of a ball if it is set free on an inclined plane (see figure).
4. Find the number of days between two give dates. Assume that every month except February has 30 days and
February always has 29 days.
5. Write a program to implement a dictionary which stores words in alphabetical order. Program takes input a
word, if that word exists in the dictionary show the message ‗duplicate entry‘ otherwise save that word at its
correct position.
6. Construct a telephone diary using structures. The diary contain name of person, phone number (s), Nickname,
group, email address, postal address. A person can have more than one phone numbers. Perform the
following operations on the telephone diary:
I. Store a new person detail
II. List the person details belonging to a given group
III. List all the phone numbers of a given person name
7. Simulate the functioning of an analog clock.
8. There are 16 players in a knockout tennis tournament. Players are numbered 1 though 16. In the first stage,
each odd number player n plays with player number n+1. In the later stages, winner of a match plays with the
winner of the next match. Simulate the tournament. Use random number generator to identify the winner in a
match.
9. Write a program to merge two arrays and restricting common elements to occur only once.
10. Write a C function that compare and concatenate two user input strings, using pointers. It will return 0, if
strings are same; -1, if string1 is smaller than string2 otherwise +1.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x
3 x x
4 x x
5 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title DIGITAL DESIGN AND SIMULATION LAB
Course Number : COC2920
Credits : 2
Course Category : DC (Departmental Core)
Pre-requisite(s) : COC2070
Contact Hours (L-T-P) : 0-1-2
Type of Course : Lab
Course Objective
After taking this course the students should be able to:
Experiment with the concepts of data structures learned in theory.
Implement data structures in a programming language.
Implement different types of sorting and searching algorithms.
Use appropriate data structures to solve a problem.
Course Outcome
Students who completed the course have demonstrated the ability to:
1. Apply different data structures in real-life problems.
2. Use appropriates sorting and searching algorithms in programming problems.
3. Enhance their problem solving approaches.
4. Gain insight and improvement of programming skills.
Syllabus
Students are expected to implement various data structures and algorithms. The outlines of the course are as follows.
Arrays, Linked Lists, Stacks, Queues, Heaps,
Binary Tree, Tree Traversals, Binary Search Trees, Graphs,
Searching: Linear Search, Binary Search,
Sorting: Bubble Sort, Quick Sort, Heap Sort, Merge Sort, Radix Sort
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x
3 x
4 x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title DIGITAL ELECTRONICS
Course Number : COC3080
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : ELA1110, ELA2110
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
This course is designed to teach students the theory of digital electronics, the logic and the implementation of modules
required for digital systems. The course will also discuss the industry specifications for the digital integrated circuits
and using it for building digital systems. It includes the description and the structure of various fundamental
components of digital systems like logic gates, memory cells, interfacing units etc.
Course Outcome
Upon successful completion of this course, students should be able to:
1. Understand the functionality of logic gates and simplifying digital circuits.
2. Explain the structure and fundamental components of digital systems.
3. Demonstrate a clear understanding of important concepts in TTL, CMOS technology.
4. Design an IC of any given arbitrary logic function at the transistor-level.
5. Design and explain of different types of memory: RAM, ROM, PLA, PAL etc.
6. Describe the fundamental architecture of analog-digital interfacing units such as data converters, data
acquisition system etc.
Syllabus:
UNIT I: IC LOGIC FAMILIES
Digital IC Terminology and Logic Circuit Families; MOS and CMOS Logic Circuits and Characteristics; CMOS
Inverter, NAND, NOR, X-OR, X-NOR Gates; CMOS Complex Gates; CMOS Transmission Gate; CMOS Clocked S-
R and D-Flip-Flops; Pseudo NMOS Logic Circuits; Pseudo NMOS Inverter and other Gates; Pass Transistor Logic
(PTL) and Complementary Pass Transistor Logic (CPTL); Realization of Different Gates in PTL and CPTL; Bi-
CMOS Digital Circuits; Bi-CMOS Inverter and Logic Gates; Comparison of various Logic Families.
UNIT II: MEMORY DEVICES
Memory Terminology, General Memory Operation; CPU Memory Connections; Semiconductors Memories; Types
and Architecture; Memory Chip Organization; ROM -- Architecture, Addressing and Timing; MOS ROM; PROM,
EPROM EEPROM (EAPROM), CD-ROM; ROM Applications; Programmable Logic Device Arrays (PAL and PLA);
ROM/PLD Based Combinational Design; Semiconductor RAM -- RAM Organization; Static RAM, Dynamic RAM;
DRAM Structure and Operation; Read/Write Cycles; DRAM Refreshing; Expanding Word Size and Capacity;
Sequential Memories.
UNIT III: DYNAMIC LOGIC CIRCUIT AND MEMORY CELLS
Dynamic Logic Circuits; Basic Structure of Dynamic-MOS Logic Circuits; Cascading Dynamic Logic Gates;
Dynamic CMOS Ratio-Less Shift Register Stage; Domino CMOS Logic; CMOS SRAM Memory Cell; One Transistor
Dynamic RAM Cell; Differential Voltage Sense Amplifier and Address Decoders for SRAM and DRAM; Charge
Coupled Device (CCD); Basic Operation of 3-Phase and 2-Phase CCD, CCD Memory Organization.
UNITIV: INTERFACING WITH THE ANALOG WORLD
Principal of operation of Digital-to-Analog Converters (DACs); Basic Circuits Using Binary Weighted Resistors and
R/2R Ladder; DAC specification; DAC Applications; Analog to Digital converters (ADCs); Digital Ramp ADC;
Up/Down Digital Ramp ADC, (Tracking ADC), Successive Approximation ADC; Flash ADC, Dual Slope Integrated
ADC, Data Acquisition, Sample and Hold Circuits: Multiplexed ADC.
Books:
*1. Ronald. J. Tocci, And Neal. S. Widmer, ―Digital Systems – Principles And Applications‖, Eighth Edition,
Pearson Education, New Delhi, 2001.
2. A.S. Sedra and K. C. Smith, ―Microelectronic Circuits‖, Oxford University Press, Vth
Edition, 2004.
3. J. Millman and Grabel, ―Microelectronics‖, McGraw Hill, 1987.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x x
3 x
4 x
5 x x x
6 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title MICROPROCESSOR THEORY AND APPLICATION
Course Number : COC3090
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : COC2070, COC2080
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
To have a knowledge of some actually implemented computing systems, and to know how theory applies on these
practically.
Course Outcome
Students will perform a case study of Intel's 8085 microprocessor architecture and will be able to:
1. interpret the literature supplied with microprocessors for designing MP-based systems
2. write and analyze machine level programs
3. interface memory and I/O devices with the help of interfacing devices
4. express the features of, and extend the programming skills to, microcontrollers
5. explain extended microprocessors
Syllabus
UNIT 1 INTRODUCTION & ORGANIZATION Review, Organization and architecture of 8085 Microprocessor, Instruction Set of and programming
techniques, Machine Language vs. Assembly Language, Basic Concepts of Timing and Control
Unit, Timing Diagrams of 8085.
UNIT II INTERFACING MEMORY AND I/O DEVICES, AND DATA TRANSFER SCHEMES Minimal System, Necessity for interfacing, Address Space Partitioning- Memory mapped I/O & I/O
mapped I/O, Advantages & Disadvantages, Types of interfacing devices- I/O ports, 8255 PPI, Brief
discussion of 8251 USART & 8253 Timer, Coprocessors. Hardware schemes for data transfer-
Programmed data transfer, Interrupt data transfer, Various Interrupt schemes, 8259 PIC, DMA data
transfer scheme DMA Controller.
UNIT III MICROPROCESSOR BASED APPLICATIONS Some popular 8085 based applications, Introduction to Microcontroller, Brief discussion of some
popular microcontrollers, Study of some important 8-bit microprocessors and their comparison.
UNIT IV ARCHITECTURE OF ADVANCED MICROPROCESSORS Introduction to 16-bit microprocessors-8086/88, 80186, 80286, Introduction to 32-bit
microprocessors-80386, 80486, Pentium etc., RISC philosophy.
BOOKS:
*1. R.L Gaonkar- ―Microprocessor Architecture, Programming and Applications‖, Wiley Eastern Ltd.
*2. K.L Short- ―Microprocessor and Programmed Logic‖- PHI Ltd.
3. A.P Mathur- ―Introduction to Microprocessors‖,- Tata McGraw Hill.
4. B.Ram- ―Fundamentals of Microprocessors and Microcomputers‖,- Dhanpat Rai and Sons.
5. Barry B. Brey- ―The Intel Microprocessors, Architecture Programming and Interfacing‖,- PHI Ltd.
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x x x x
3 x x x x x x x x
4 x x x x x x x x
5 x x x x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title OPERATING SYSTEMS
Course Number : COC3100
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : COC2080
Contact Hours (L-T-P) : 4 (3-1-0)
Type of Course : Theory
Course Objective
Consider and address the issues in the design of modern operating systems. The course explains the main components
of modern operating system and their organization schemes. It discusses various issues and problems in the design and
implementation of main components-process management, Main Memory Management, File System management,
Secondary Storage Management; and methods, algorithms to solve them efficiently. Students will learn modern OS
concepts through examples of Linux and Windows XP Operating Systems.
Course Outcome
Upon successful completion of this course, the student will be able to:
1. Grasp a fundamental understanding of goals, components and evolution of operating systems
2. Explain the concepts and creation of processes and threads
3. Learn the scheduling policies of modern operating systems
4. Understand critical section problem and various synchronization schemes
5. Understand Paging, segmentation and virtual memory concepts in modern OSs
6. Understand the concepts of data input/output, storage and file management
7. Understand the main design concepts of Linux and Windows XP OSs
Syllabus:
UNIT I INTRODUCTION
Evolution of Operating Systems- Simple Batch Systems, Multiprogramming system, Time-sharing systems, Parallel &
Distributed systems, Real Time system; Operating System Structure: System components, Services, Interface to user
& programs, concept of virtual machines, System Structure.
UNIT II PROCESS MANAGEMENT
Process states, control block, operations on process, Cooperating process, Concepts of Threading, IPC, Process
Scheduling- Basic concept, Type of schedulers, Scheduling criteria, scheduling algorithm, Multiple processor
scheduling, Real time scheduling; Process Synchronization: Critical section problem, synchronization hardware,
Semaphores, classical problem of synchronization, Monitors.
UNIT III DEADLOCK AND MEMORY MANAGEMENT
Deadlock- Characterization, Methods of handling: Deadlock prevention, Deadlock avoidance, Deadlock detection &
Recovery; Memory Management- Contiguous allocation, Swapping, Non Contiguous allocation: Paging,
Segmentation, Virtual Memory- Basic Concepts, page allocation & replacement policies, Thrashing.
UNIT IV STORAGE MANAGEMENT & CASE STUDIES
File System- Concept, Access Methods, Directory, Protection, Implementation of File systems; Storage Structure-
Overview, Disk Scheduling, Disk Management, Swap Space Management, Case Studies- Linux, Windows XP.
Books:
*1. Peterson: Silberschatz, Galvin ―Operating System Concepts‖, Addison Wasely, Vth Addition.
2. William Stallings, ―Operating Systems‖
3. Milenkovic, Milan: Operating system concepts and Design, McGraw Hill.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x x x
3 x x x x x
4 x x x x x
5 x x x
6 x x x x x
7 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title THEORY OF COMPUTATION
Course Number : COC3110
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : AMS2630, COC2070
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
To build a strong theoretical background for computer science, and to know practical implications of the theory
Course Outcome
Students will be able to:
1. Explain and classify mathematical models for representing finite state systems
2. Explain and anlayze state diagrams for finite automata
3. Design various types of automata and write regular expressions for regular languages, and interconvert
automata and regular expressions
4. Explain, analyze, and design context free grammars for context free languages
5. Design and analyze Turing machines
6. Interpret and explain the limits of computing
Syllabus
UNIT I INTRODUCTION TO FINITE AUTOMATA & REGULAR LANGUAGES Strings, Alphabets and Languages, Graphs & Trees, Sequential machine, State tables & diagram,
Mealy & Moore machines, State and Machine equivalence. Deterministic and Non-deterministic
Finite Automata, Regular Expressions, Regular grammar, Minimization of DFA, Pumping Lemma
for Regular sets, Properties of Regular Languages.
UNIT II CONTEXT FREE GRAMMARS & LANGUAGES Context free Grammar, Chomsky Normal form and Greibach Normal form, Pushdown Automata,
Context Free languages, Chomsky Classification of languages, Pumping Lemma for context free
languages, properties of context free languages.
UNIT III TURING MACHINES Turing Machines, Computing with Turing Machines, Nondeterministic Turing Machines, Church's
Thesis, Universal Turing Machines.
UNIT IV UNCOMPUTABILITY & COMPUTATIONAL COMPLEXITY Halting Problems, Unsolvable Problems about Turing Machines, Time bound Turing Machines, The
Class P and NP Languages, NP Completeness, Some NP Complete Problems.
Books:
* 1. J.E. Hopcroft, Motwani & J.D. Ullmann, "Introduction to Automata Theory, Languages and Computation",
Narosa Publications
2. H.R. Lewis & C.H. Papadimitrou, "Elements of the Theory of Computation", PHI
3. John C. Martin, "Introduction to Languages and the Theory of Computation", McGraw-Hill International
4. Michael Sipser , "Introduction to the Theory of Computation ",Thomson Learning, PWS publishing company
5. D.A. Cohen , "Introduction to Computer Theory", John Wiley
6. Zvi Kohavi, "Switching and Finite Automata Theory" , Tata McGraw-Hill
(*Text Book)
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x x
2 x x x x x x
3 x x x x x x x
4 x x x x x x x
5 x x x x x x
6 x x x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title DATA BASE MANAGEMENT SYSTEM
Course Number : COC3120
Credits : 4
Course Category : DC (Departmental Core)
Pre-requisite(s) : AMS2630, COC2060
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
Though we may not recognize them in our everyday activities, databases are everywhere. They are hidden behind
your online banking profile, airline reservation systems, medical records, and even employment records. This course
will provide students with a general overview of databases, introducing you to database history, modern database
systems, the different models used to design a database, and Structured Query Language (SQL), which is the standard
language, used to access and manipulates databases. Many of the principles of database systems carry to other areas
in computer science, especially operating systems. Databases are often thought of as one of the core computer science
topics, since many other areas in the discipline have been derived from this area.
Course Outcome
Upon successful completion of this course, the student will be able to:
1. Compare and contrast the database approach and the file system approach.
2. Explain what a database management system is as well as the various components.
3. Identify the various people involved in database management systems.
4. Explain the various database models: entity-relationship and relational model.
5. Explain the three-schema database architecture.
6. Describe what tables, indexes, and views are as well as discuss the differences among them.
7. Explain the process of normalization.
8. Convert an entity-relationship diagram to a set of normalized relations.
9. Identify how relational algebra is used to construct queries.
10. Describe and use of data definition commands and data manipulation commands in SQL.
Syllabus
UNIT I INTRODUCTION TO DATA BASE CONCEPTS
Data Base Systems and their needs, Components of DBS, DBS architecture, Data Base Administrator and his
role, DBMS and its Components, Data Models – Classification, Physical Model- Storage structure, Indexing
Techniques; Conceptual Modeling- E/R Model.
UNIT II RELATIONAL MODEL
Relational Model – Definitions, Relational algebra and calculus, Integrity; SQL, Database Programming-
Embedded SQL, Dynamic SQL, PL/SQL.
UNIT III NORMALIZATION, RECOVERY & CONCURRENCY
Concept of Normalization- Functional Dependencies (FD), First, Second and Third normal forms, BCNF,
Fourth & Fifth normal forms; Recovery- Transaction, Commit and Rollback, Sync. Points, Systems and Media
recovery; Concurrency- problems, Locking, Serializability, Deadlock.
UNIT IV FURTHER TOPICS IN DATABASES
Security- General considerations, Security in SQL, Views, Grant and Revoke mechanism; Query optimization,
Relational Database System Design, Data Mining, Data Warehousing, Parallel & Distributed Data Bases.
Books:
1. Date, C. J. : "Introd. To Data Base Systems", Addison Wesley 6th ed.
2. Elmasri & Navathe ―Fundamentals of Database Systems‖ 5th Edition
3. Abraham Silberchatz, "Data Base System Concepts", McGraw Hill Int.
4. Ullman, "Principles of Database Systems". Galgotia Pub.
5. Ivan Bayross. "Oracle Developer 2000", B. P. B. Publication
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x x x
4 x x x
5 x x
6 x x
7 x x
8 x x
9 x x x
10 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Computer Networks
Course Number : COC3130
Credits : 4
Course Category : DC
Pre-requisite(s) : COC2080, ELA3400
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
Data communications, network architectures, communication protocols, data link control, medium access control;
introduction to local area networks metropolitan area networks and wide area networks; introduction to Internet and
TCP/IP.
Course Outcomes
Upon completing the course, the student will:
1. be familiar with the basics of data communication
2. be familiar with various types of computer networks
3. have experience in designing communication protocols
4. be exposed to the TCP/IP protocol suite
Syllabus
Unit-I Introduction
Introduction to Computer Networks, , ARPANET, Protocol Layers and Their Service Models, OSI Model,
TCP/IP Model, LAN, WAN, MAN, PAN, Network Topologies
Unit-II Physical Layer, Data Link Layer
Circuit Switching and Packet Switching, Multiplexing, Transmission Media, Connectors, Virtual Circuit and
Datagram Networks, Error Detection and Correction Techniques, Go-Back-N ARQ, Selective Repeat ARQ,
HDLC, PPP, Multiple Access Protocols, CSMA/CD, CSMA/CA, MAC Addresses, Ethernet, Wireless LAN,
Hubs and Switches, Routers
Unit-III Network Layer, Transport Layer
IPv4 Addressing, CIDR, IPv6, Internet Protocol, ARP, RARP, DHCP, Routing Algorithms: IGP, EGP, Link-
State Routing, Distance Vector Routing, Path Vector Routing, RIP, OSPF, BGP. Connectionless and
Connection-Oriented Transport, UDP and TCP, Congestion Control, QoS
Unit-IV Application Layer, Emerging Technologies
DNS, DHCP, DDNS, Telnet, www & HTTP, FTP, email, SMTP, SNMP, Audio & Video Streaming, VoIP,
Wireless and Mobile Networks, GSM, CDMA, Cellular Internet Access and Mobility Management, Internet
Phone, etc.
Books
1. Behrouz Forouzan, Data Communications and Networking, 5th
edition, McGraw Hill, 2012
2. J.F. Kurose, K.W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet, 5th
Edition,
Pearson, 2012
3. A.S. Tanenbaum, Computer Networks, 5th
Edition, Pearson, 2012.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x x x
3 x x x x x x
4 x x x x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Computer Graphics
Course Number : COC3150
Credits : 4
Course Category : DC
Pre-requisite(s) : AMS1110, AMS1120
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
This objective of this course is to introduce the fundamentals of computer graphics and its underlying principles. The
course aims to explain a number of algorithms that are employed to create the most basic objects in order to render a
graphical scene.
Course Outcomes:
At the end of this course, the student can be expected to:
1. Define what is computer graphics, plotting techniques, geometric and viewing transformations and
projections, object and surface rendering.
2. Be aware of the evolution of comptuer graphics technology over the past decades
3. Understand various graphics packages and standards
4. Explain the alogorithms that form the foundation of computer graphics
5. Analyse various point and line drawing algorithms
6. Classify transformation techniques
7. Interpret parallel and oblique projections and their applications
8. Differentiate between object representation techniques
9. Design an illumination scene based on ambient, diffused and specular lighting
Syllabus
UNIT I INTRODUCTION TO COMPUTER GRAPHICS & GRAPHICS HARDWARE
A Survey of Computer Graphics, Video Display Devices – raster scan and random scan displays, Display
processing units, graphics input devices, Graphics Software packages and standards.
UNIT II POINT PLOTTING TECHNIQUES
Coordinate systems, Line drawing algorithms: DDA, Bresenham‘s line drawing Algorithm, Mid Point Circle
Algorithm, Maintaining geometric properties of displayed objects, Fill area primitives, polygon fill areas,
output primitives in OpenGL, point, line and character attributes, colour models, antialiasing
UNIT III GEOMETIRC & VIEWING TRANSFORMATIONS
Basic 2-D Geometric Transformation: Translation, Rotation and Scaling, Matrix representation of
transformation in homogenous co-ordinates, Composite transformations, Reflection, Shear, Geometric
transformations in 3-D space. 2-D viewing, Clipping window; Normalization and viewport transformation,
Clipping algorithms: Cohen-Sutherland line clipping algorithm etc; Sutherland-Hodgman Polygon clipping
algorithm, Weiler and Atherton‘s algorithm etc., 3-D viewing Concepts: Projection Transformations,
Orthogonal, Oblique parallel and Perspective projections.
UNIT IV OBJECT REPRESENTATION AND SURFACE RENDERING
Polyhedra, Curved surfaces, spline representations, Cubic spline interpolation methods, Bezier and B-Spline
Curves, Visible surface detection algorithms: depth buffer, A- Buffer Scan-Line, depth sorting, Ray casting
methods etc. Basic illumination models, Diffuse Reflection, Specular Reflection, Gouraud and Phong
Surface Rendering, Ray Tracing Methods, Interactive Picture construction techniques: dragging, rubber
banding etc.
Books:
1. Hearn & Baker, ―Computer Graphics with OpenGL‖ 3rd
Ed., Pearson education *
2. Foley, Dam, Feiner and Hughes ―Computer Graphics: Principle and Practice‖, 2nd
Ed., Pearson
Education
3. Edward Angel, ―Interactive Computer Graphics: A Top-Down Approach Using OpenGL, 5/E,
Addison-Wesley.
4. Neuman & Sproull, ―Principle of Interactive Computer Graphics‖, McGraw Hill Int.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h I j k
1 x x x
2 x x x
3 x x
4 x x x
5 x x
6 x x x
7 x x x
8 x x x
9 x x x x
2017-2018
DEPARTMENT OF ELECTRONICS ENGINEERING
B. Tech. (for Computer Engineering)
Course Number and Title : ELA3400 Communication Engineering
Credits : 4
Course Category : ESA
Pre-requisite(s) : ELA2410
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Home Work (assignments and Quizzes) (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hourss) (60%)
Course Objectives
To understand the principles of communication engineering and apply them in practical communication systems;
Course Outcomes
After completing this course the students should be able to:
1. Understand the concept and need of modulation.
2. Use modulation as a tool to facilitate transmission of signals.
3. Convert analog signals into digital signals through the process of sampling and quantization.
4. Understand the effect of noise on the performance of communication systems
5. Understand the design challenges of the cotemporary communication systems.
Syllabus
Unit 1
Overview of Communication System; Channels and Their Characteristics; Modulation and its Benefits; Amplitude
Modulations: AM, DSBSC, SSB, and VSB modulation; Frequency and Phase Modulation; Frequency Division
Multiplexing (FDM), Radio Receiver Principle.
Unit 2
Introduction to Pulse Modulation; Digital Pulse Modulations: Pulse Code Modulation (PCM), Differential PCM, and
Delta Modulation (DM); Time Division Multiplexing (TDM); Overview of Baseband Communication.
Unit 3 Overview of Digital Modulation; Modulation Techniques: Amplitude Shift Keying (ASK), Phase Shift Keying (PSK),
Frequency Shift Keying, Quaternary PSK (QPSK); Quadrature Amplitude Modulation (QAM); Comparison of
Different Modulation Techniques.
Unit 4 Source Coding and Data Compression; Channel Capacity; Error Detection and Correction; Cyclic Redundancy Check
(CRC) Codes; Overview of Spread Spectrum Communication and Code Division Multiple Access (CDMA);
Introduction to Mobile Communication.
References:
1. Simon Haykin, Communication Systems, 4th
Edition, John Wily & Sons Asia Pte. Ltd., 2001.
2. B. P. Lathi and Z. Ding, Modern Digital and Analog Communication Systems, OUP, India, 4th
Edition, 2010.
3. R. Blake, Electronic Communication System. Thomson Asia Pte. Ltd., 2002.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x x x
3 x x x x x
4 x x x x x
5 x x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for Computer Engineering)
Course Title : Economics and Management
Course Number : MEH3110
Credits : 4
Course Category : HM
Pre-Requisites(s) : None
Contact Hours : 3-1-0
Type of Course : Theory
Course Work : Home Assignments 40%
EndSem Examination (2 Hourss) 60%
Course Objectives:
1. Prepare engineering students to analyze cost/revenue data and carry out economic analysis for decision
making and to justify or reject alternatives/projects on an economic basis.
2. To familiarize the student with the basic concepts of management issues related to the management of
contemporary organizations.
Course Outcomes:
At the end of this course, the student will be able to
1. Make technically and financially sound decisions by comparing and analysing alternative projects.
2. Optimise the resources available in a given situation.
3. Develop a working knowledge of money management.
4. Learn and apply techniques, skills and modern engineering tools necessary for engineering management
practice in contemporary organizations.
5. Utilise and manage resources using different operation strategies with a view to stay ahead in offering
competitive products/services
6. Understand and exercise social responsibility and ethics in the practical context.
Syllabus:
Unit 1:
Introduction to Engineering economics; Time value of money; Present worth, future worth and annual worth
comparisons
Unit 2:
General replacement studies; Benefit cost analysis; Depreciation-purpose and use; Inflation and its effects
Unit 3:
Introduction to management; Environmental and ethical issues in decision making; Management of information
Unit 4:
Planning and strategic management; Organising; Leadership and motivation; Controlling
Unit 5:
Operations management; Marketing management; Financial management; Human resource management;
Management of international business
Suggested Text books:
1. DeGarmo, E. P., Sullivan, W. G. and Bontadelli, J. A., 1988, Engineering Economy, ed.viii, Macmillan.
2. Riggs, J. I., Bedworth, D. B. and Randhawa, S. U., 1996, Engineering Economics, ed. iv, TMH.
3. Stoner, J. A. F., Freeman, R.E. and Gilbert, D. R., 2003, Management, ed. vi, PH
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x x
2 x x x x
3 x x x x
4 x x x x
5 x x x
6 x x x
2017-2018
DEPARTMENT OF APPLIED CHEMISTRY
B. Tech. (for all branches)
Course Title Atmospheric Chemistry
Course Number : AC-308
Credits : 4
Course Category : OE
Credits : 04
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Course Work (Home Assignment & Quizzes (15%)
Midsem Examination (1 Hour) (25%)
Endsem Examination (2 Hours) (60%)
Course Objectives
To impart knowledge about atmospheric structure, pollutants and their hazardous effects.
Course Outcomes
After completion of the course the students shall be able to understand:
1. About the basic composition of the atmosphere, atmospheric structure and photo oxidants
2. About the air pollutants and their sources
3. About the significance of PM2.5 and PM10
4. About sampling and monitorring of gaseous pollutants
5. About control devices for particulate matter
6. About Green House effects and its control
Syllabus
Unit-I: Atmosphere Structure (8 L)
Basic atmospheric properties, composition of the atmosphere. Physical, thermal and electrical state of the atmosphere
(Troposphere, Stratosphere, Mesosphere and ionosphere). Photochemical oxidants and formation of photochemical
smog. Alternative fuels. Indoor air quality.
Unit-II.: Air Pollutants (8 L)
Classification of air pollutants. Clean Air Act. Criteria pollutants CO, oxides of nitrogen, oxides of sulphur and
hydrocarbons. Particulate matter; physical, chemical and biological characteristics of particulates. Significance of
PM10 and PM25.
Unit-III.: Monitoring of Air Pollutants (8 L)
Sampling and monitoring of gaseous pollutants: Grab sampling, condensation, adsorption and absorption techniques.
Methods of air pollution analysis. Chemical methods (volumetric and gravimetric methods). Instrumental methods:
Principle of spectrometry. Infrared absorption and molecular structure. Principle and instrumentation. Fourier
Transform infrared spectrometers. Atomic absorption spectrometry: principle and instrumentation. Quantitative
estimation of CO, CO2, SO2, H2S, O3 and NH3.
Unit-IV: Air Pollution Control (8 L)
Source correction method, diffusion, vegetation and zoning. Control devices for particulate pollutants: Gravitational
settling chamber, cyclone separators, fabric filters and electrostatic precipitator. General Principle of wet collectors
(scrubbers): spray tower, venture scrubber and cyclone scrubber.
Unit-V: Natural cycles (8 L)
Hydrologic cycle, nitrogen cycle oxygen cycle and carbon cycle.
Unit-VI Global Atmospheric Change (8 L)
Green house effect, regional impacts of temperature change. Changes in stratospheric zone, catalytic destruction of
Ozone, impacts of increased exposure to UV radiations.
Books Recommended:
1. N. Manivasakam. Environmental Pollution. National Book Trust, India.
2. S.M. Khopkar, Environmental Pollution Analysis. Wiley Eastern Limited.
3. S.S. Dara, A Text Book of Environmental Chemistry and Pollution Control. S. Chand and Company Ltd.
4. Suresh K. Dhameja, Environmental Engineering and Management. S.K. Kataria and Sons.
5. Gilbert M. Masters. Introduction to Environmental Engineering and Science. Prentice Hall of India, New
Delhi.
6. A.K. De, Environmental Chemistry, New Age International Publishers, New Delhi.
7. Howard S. Peavy, Donald R. Rowe, George Tchobanoglous, Environmental Engineering. McGraw Hill
International, New York.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x
4 x x
5 x
6 x x
2017-2018
DEPARTMENT OF APPLIED MATHEMATICS
B. Tech. (for all branches)
Course Number and Title AM-351, Numerical Techniques
Credits : 04
Course Category : OE (Open Elective)
Pre-requisite(s) : AM-111, AM-112
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Asseeement : Course Work (Home Assignments) (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hours) (60%)
Course Objectives
To learn advanced numerical methods in system of equations, interpolation, approximation and study linear
programming problem
Course Outcomes
After completing this course the students should be able to
1 solve linear equations and eigen value problems
2 understand the interpolation techniques of different kind
3 approximate data, functions by least square methods
4 formulate linear programming problem and solve it
Syllabus
Unit-1
Matrices and linear equations: LU factorization & pivoting, singular value decompoutions. Numerical approach to
eigen value problems.
Unit-2
Interpolation: Polynomial, Rational function & spline interpolation with error analysis.
Unit-3
Least square approximations for discrete and continuous data. Minimax techniques for approximations. Randam
number generations.
Unit-4
Formulation of linear programming problem. Solution by graphical simplormethod. Duality. Introduction to nonlinear
programming.
Books:
1 M. K. Jain, S.R.K. Iyenger and R.K. Jain,″ Numerical Methods for Scientific and Engineering Computations″ ,
New age International Publication (P) Ltd.
2 S.S. Sastry, ″Introductory Numerical Methods″, Prentice Hall India Ltd.
3 Erwin Kreyszig , ″Advanced Engineering Mathematics″ , John Wiley & Sons, INC.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x
3 x x x
4 x x x
2017-2018
DEPARTMENT OF APPLIED PHYSICS
B. Tech. (for all branches)
Course Title Bio- Physics
Course Number : AP-304
Credits : 4
Course Category : Open Elective
Pre-requite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Course Work (Home Assignments & Quizzes) (15%)
Mid-Sem. Examination (1 hour) (25%)
End-Sem. Examination (2 Hours) (60%)
Course Objective
To put on an understanding of the fundamental concepts of biological systems and in turn the basic life phenomena. It
tends to be studied by those who have a background in physics and engineering, and who may thus be bringing useful
expertise to the investigation of living things.
Course Outcomes
After completing this course the students should be able to:
1. Understand a qualitative account of the processes which occur on a number of different size scales, which
lead to the overall functioning of the body.
2. Design building and spaces which create, support, and enhance life and living systems (BioArchitecture).
3. Identify and establish a synergy between electronics and biology (Bioelectronics).
4. Design and construction of unit processes that involve biological organisms or molecules (Biochemical).
5. Identify the different ways of crafting biocomputers, biosensors and biochips.
6. Development of effective written and oral communication skills.
Syllabus
Unit 1. Energies, Forces and Bonds: Interactive Potentials for strong and Weak Bonds, Non central forces, Bond
Energies and Spring constants.
Techniques and Methods : X-ray diffraction and Molecular structure, Nuclear Magnetic Resonance,
Scanning Tunnelling Microscopy, Atomic Force Microscopy, Optical Tweezers.
Unit 2. Biological Polymers & Biological Membranes: Nucleic Acids, DNA and RNA, Proteins, Proteins folding
Biological Membranes, Membrane Chemistry and Structure, Membrane Physics, Excitable Membranes,
diffusion and Mobility of ions, Resting Potential
Nerve Signals: Passive Response, Nerve impulses, Nervous System Memory
Vertebrate heart: Role of the vertebrate circulatory system, blood pressure and veocities, the veretebrate
heart, the heart sequence, Electrocardiography, Heart as a pump.
Unit 3. Chemical Spectroscopy: Absorption, spectroscopy and Molecular structure, Atomic and Molecular energy
levels, vibration of polyatomic molecules, Raman spectra, characteristics bond frequency, Electronic energy
level, Electronic energy spectra of polyatomic molecules, UV absorption by proteins and nucleic acids.
Photoacoustic spectroscopic technique and its application to Biomolecules. Laser and its applications.
Unit 4. Radiation, Health and Traces : Absorption of radiation by body tissues, Damage because of neutrons, Radio
dose units, Relativge Biological Effectiveness ( RBE), Radiation detection and measurements.
Radioactive Traces, Requirements of a Tracer, Application of Traces, Chemical applications : Tracer method
and its limitations, Rate of chemical exchange reaction, Analytical applications : Neutron activation analysis,
Analysis with ion beams, PIXE technique.
Text Book(s)/Reference Book(s)
1. Biophysics- An Introduction by Rodney Cotterill, John Wiley & Sons Ltd (Ed. 2002).
2. Nuclear and Radiochemistry, Gerhart Friedlander, Joseph w. Kenedy, Ed ward S. Macias and J.M.
MillerJones, Wiley & Sons
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x
3 x x x
4 x
5 x x
6 x x
2017-2018
DEPARTMENT OF APPLIED PHYSICS
B. Tech. (for all branches)
Course Title Engg. Materials & Material Science
Course Number : AP-308
Credits : 4
Course Category : OE
Pre-requite(s) :
Contact Hours : 3-1-0
Type of Course : Theory
Course Work : Home Assignments (15%)
Midsem Examination (1 hour) (25%)
Endsem Examination (2 Hourss) (60%)
Course Objective
1. To know the fundamentals and engineering principles relevant to the materials.
2. Understand the relationship between characterization, properties and processing and design of materials.
3. Be able to have the experimental and theoretical skills for a professional career or graduate study in materials.
4. Possess knowledge of the significance of research, the value of continued learning and environmental/social
issues surrounding materials.
5. Be able to communicate effectively, to work in teams and to assume positions as leaders.
Course Outcomes Upon completion of the course, the student will be able to:
1. apply general math, science and engineering skills to the solution of engineering problems.
2. apply core concepts in Materials Science to solve engineering problems and possess the skills and techniques
necessary for modern materials engineering practice.
3. knowledgeable of contemporary issues relevant to Materials Science and Engineering and to select the
materials for design, construction, conduct experiments and to analyze data.
4. aware of the social, safety and environmental consequences of their work, and be able to engage in public
debate regarding these issues.
5. understand the professional and ethical responsibilities of a materials scientist and engineer.
6. communicate effectively while speaking, employing graphics and writing.
Syllabus
Unit 1. Dielectrics (D.C. Field): Polarization & Dielectric Constant, Atomic interpretation of dielectric
constant of monoatomic gases, Electronic & ionic polarization, Orientational polarization and dielectric
constant of polyatomic gases, Permanent electric dipole moment of polar gases, Internal field in solids
& Lorentz field, Static dielectric constant of solids, Ferroelectric materials & Curie Law,
Piezoelectricity.
Unit 2 (a). Dielectric (Alternating Fields): Behaviour of dielectrics in alternating fields – frequency dependence
of polarization, Complex nature of polarizabilities, Variation of polarizabilities with frequency of A.C.
field, Dipolar Relaxation, Dielectric Losses.
Unit 2(b). Semiconductor (p-n junction): Drift & diffusion currents and continuity equation for minority carriers,
Einstein‘s equation Potential barrier, Thickness and capacitance of depletion layer, Display devices.
Unit 3. Magnetic Materials: Origins of magnetism in solids, Classification of magnetism materials, Theories
of para-, ferro-antiferro- and ferrimagnetic materials, Ferrites – composition, properties and
applications, Soft and hard magnetic materials – composition properties and applications.
Unit 4. Superconductivity: Thermal properties of superconductivity, Energy gap and temperature dependence
of energy gap Thermodynamics of the superconducting transition, London equation, Superconducting
ring, Coherence length Single particle tunneling, Expressions for current across Josephson junction in
different situations, High temperature superconductors- compositions, properties & applications.
Text and Reference Books
1. Kittel C., Introduction to Solid State Physics (Wiley Eastern Pvt. Ltd.)
2. Streetman Ben G. & Banerjee, S., Solid State Electronic Devices (Prentice Hall of India)
3. Dekker A.J., Electrical Engg. Materials (Prentice Hall of India)
4. Dekker A.J., Solid State Physics (Macmillan & Co.)
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x x
3 x x x
4 x x
5 x x
6 x x
2017-2018
DEPARTMENT OF CHEMICAL ENGINEERING
B. Tech. (for all branches)
Course Number and Titile CH 337 Solid Waste Management
Credit : 4
Course Type : OE (Open Elective)
Pre-requisite : CE 111
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Assessment : Course Work ( Home Assignments & Quizzes ) (15%)
Midsem Examination ( 1 hr) (25%)
Endsem Examination (3 hr) (60%)
Course Objectives
To get an understanding of the basics of solid waste management. To gain an insight in Various state of art
technologies and its application in solid waste management.
Course Outcomes
After completing this course the students shall be able to:
1. Understand the scope and challenges of solid waste management in present scenario.
2. Learn and apply Engineering Principles in analyzing quantities of solid waste.
3. Understand and analyze waste collection system
4. Analyze and quantize landfill gas generation.
5. Analyze and quantize leachate generation, analysis of landfill cover.
6. Application and design of various thermal technologies.
7. Application and design of various Biochemical conversion technologies.
Course Syllabus:
UnitI : Functional Elements of Solid Waste Management, Sources and Types of Waste, Composition of MSW,
Integrated Solid Waste Management, Physical, Geotechnical, Chemical & Biological Properties of
MSW, Material Balance Analysis, Load Count Analysis, Legal Frame work, Hazardous Waste in MSW.
UnitII : Waste Collection. Types of Collection Systems, Equipment & Personnel Requirements, Analysis of
Collection Systems, Collection Routes and Their Layout
UnitIII : Landfills, Types of landfills. Components of a Landfill, Landfill Gas, Various Phases of LFG- Generation
and Volume of gas Produced, Variation of Gas Production with Time, Movement of Landfill Gases,
Landfill Area Requirements.
Leachate Management: Leachate Characteristics, Old & fresh Leachate, Leachate Management System.
Determination of Leachate Quantities, Water Balance Method and HELP Model.
Cover : Various Layers of final Cover. Main Elements in the design of Final Cover.
UnitIV : Thermal Technologies: Combustion, Stoichiometric Combustion, Excess Air Combustion, Combustion
Systems, Heat Recovery Systems. Pyrolysis, Operational Problems with Pyrolysis Sytems. Gasification
Systems, Types of Gasifiers.
Biochemical Conversion Technologies: Nutritional Requirements, Types of microbial Metabolism,
Aerobic Biological transformations, Anaerobic Biological transformations.
Textbook(s)/ Reference Book(s):
1. Tchobanoglous G, Theisen H.,Vigil, S A ‗Integrated Solid Waste Management‘, ‗International Edition,
1993,McGraw- Hill International Editions.
2. Wentz, C.A., ‗Hazardous Waste Management, 2nd
Edition, 1995, McGraw Hill International.
3. Solid Waste Management Source Book/Asia (2002) Prepared by UNEP(United Nations Environment Program.
4. White Paper on Delhi Pollution (2002) Released by the Parliament of India.
5. I. H. Khan & N Ahsan, ―Textbook of Solid Wastes Management‖, CBS Publishers & Distributers, 2003.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x
3 x x
4 x x
5 x x x
6 x x x
7 x x
2017-2018
DEPARTMENT OF ELECTRICAL ENGINEERING
B. Tech. (for all branches)
Course Title Power Electronics
Course number EE-301 Credit Value 4 Course Category OE
Pre-requisite EE-111
Contact Hours (L-T-P) 3-1-0
Type of Course Theory
Course Objectives To introduce the basic concepts of power electronics, types of converters, their
characteristics, turn-on of SCR, gate characteristics, AC-DC Converters, DC - DC
Converters, AC-AC and DC-AC Converters.
Course
Outcomes
At the end of the course the students will be able to
1. Articulate the basics of power electronic devices
2. Express the design and control of rectifiers, inverters.
3. Design of power electronic converters in power control applications
4. Ability to express characteristics of SCR, BJT, MOSFET and IGBT.
5. Ability to express communication methods.
6. Ability design AC voltage controller and Cyclo-Converter.
7. Ability to design Chopper circuits.
8. Ability to design Inverter circuit.
Syllabus Unit I Power Semiconductor Devices: Applications of power electronics; types of converters,
ideal switch; power diodes, SCR, Triac and their characteristics, di/dt, dv/dt limitations
and snubber circuits, other power semiconductor devices and their characteristics.
Unit II Gate Drive Circuits: Methods of turn-on of SCR, gate characteristics, simple R, RC and
UJT trigger circuits, driver and isolation circuits, cosine and ramp control circuits, simple
digital trigger circuit, commutation of SCR
Unit III AC-DC Converters: Principle of ac phase control, circuit configurations, waveforms for
1-ph mid-point and bridge converters, full and semi converters, analysis of single phase
ac-dc converter with R and RL loads, performance evaluation of phase controlled
converters, introduction to three phase converters: semi and full converter topologies,
dual-converters.
Unit IV DC - DC Converters: Basic principle of d.c. choppers: TRC and CLC methods;
switching regulators: buck and boost converters, basic principles of SMPS and UPS,
Introduction to resonant converters.
Unit V AC-AC and DC-AC Converters: Introduction to AC voltage regulators, integral cycle
control and phase control, cyclo-converters. Series, parallel and bridge inverter circuits,
PWM inverters: types of control and harmonic reduction.
Books*/References
1 *M.H. Rashid Power Electronics; PHI, Learning
2 *G.K.Dubey,
S.R.Doradla, A.Joshi and
R.M.K.Sinha
Thyristorised Power Controllers; New Age International,
New Delhi
3 M.H. Rashid (Ch. Editor) Power Electronics Hand Book, Acedemic Press, California
4 Jai P Agarwal Power Electronics Systems, Pearson.
5 M. S. Jamil Asghar Power Electronics, PHI Learning
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x x x
3 x x x
4 x x
5 x x x
6 x x x x
7 x
8 x x
2017-2018
DEPARTMENT OF ELECTRICAL ENGINEERING
B. Tech. (for all branches)
Course Title New and Renewable Energy Sources
Course number EE-325/472
Credit Value 4
Course Category OE
Pre-requisite EE-111
Contact Hours (L-T-P) 3-1-0
Type of Course Theory
Course Objectives To introduce fundamentals of various renewable energy source and their technologie used
to harness usable energy from solar, wind, ocean and Biomass energy sources.
Course
Outcomes
At the end of the course the students will be able to
1. Identify renewable energy sources.
2. Understand the mechanism of solar, wind and ocean energy sources.
3. Demonstrate the understanding of various technologies involved in power
generation from renewable energy sources.
4. Understand the methods to handle the biomass in a productive way.
Syllabus UNIT-1
Introduction: Energy resources and their classification, oil crisis of late 20th
century and
its impacts on energy planning, consumption trend of primary energy sources, world
energy future, energy audit and energy conservation, energy storage.
UNIT- 2
Solar Energy Conversion: Solar resources, passage through atmosphere, solar thermal
energy conversion: solar energy collectors, solar thermal power plant, solar PV
conversion: solar PV cell, V-I characteristics, MPPT, Solar PV power plant and
applications.
UNIT-3 Biomass Energy Conversion: Usable forms of Bio Mass, Biomass energy resources,
biomass energy conversion technologies, ethanol blended petrol and diesel, biogas plants.
Energy farming.
UNIT-4
Wind Energy Conversion: Wind Power: Energy estimation, Power extraction, lift and
drag forces, horizontal axis wind turbine, vertical axis wind turbine, wind energy
conversion and control schemes, environmental aspects.
UNIT-5
Other Alternate Energy Sources/Technologies: Geothermal Energy: geothermal fields,
types, geothermal energy generation systems, ocean tidal energy systems, fuel cell: basic
operation and classification, principle of MHD generation, output voltage and power,
environmental aspects.
Books*/References
1. *B.H. Khan Non conventional Energy Resources, 2nd
edition, 2009.
2. G.D. Rai Non Conventional Sources of Energy, (Khanna Publishers).
3. J.W. Twidell& A.D. Weir Renewable Energy Resources, (ELBS / E. & F.N. Spon., London).
4. Godfrey Boyle Renewable Energy, Oxford, 2nd
edition 2010.
Edition.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x
3 x x
4 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title ALGORITHMS AND OPERATING SYSTEMS LAB
Course Number : COC3930
Credits : 2
Course Category : DC
Pre-requisite(s) :
Contact Hours (L-T-P) : 0-1-2
Type of Course : Laboratory
Course Objectives
This course is helpful in making students learn the basic building blocks of software such as data structures and logic
development. This course also provides them with an opportunity to apply software engineering techniques when
building software.
Course Outcomes
At the end of this course, the student can be expected to:
1. Design basic algorithms using data structures
2. Understand the procedures defined under software engineering
3. Apply various programming concepts to create simple software
4. Analyse programs in order to understand their functioning
5. Interpret various errors when developing software and to trace their causes.
Syllabus/ List of experiments
1. Implement the Bubble Sort algorithm with early detection for termination
2. Implement a linked list and perform the following operations on it: (i) Insert a node (ii) Delete a node ( iii)
Search for a node
3. Write a program to implement the Breadth First Search (BFS) algorithm.
4. Write a program to create a Binary Tree and perform inorder, preorder and postorder traversal on it.
5. Write a program to implement the Heapsort algorithm.
6. Minimize a given Boolean expression using the K-map method
7. Implement the insertion sort algorithm
8. Write a program to implement the Depth First Search (DFS) algorithm.
9. Write a program to insert and delete a given node in a Binary Search Tree (BST).
10. Write a program to implement the Mergesort algorithm and use it to implement merging.
Text Book(s)/ Reference Book(s)
1. A.K.Sharma, ―Data Structure using C‖, Pearson, 2011
2. M. Morris Mano, ―Digital Logic and Computer Design‖, PHI.
3. W. S Jawadekar, Software Engineering- Principles and Practices, Tata McGraw Hill, 5th
Edition
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x x
3 x x x
4 x x x x x
5 x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title MICROPROCESSOR LABORATORY
Course Number : COC3940
Credits : 2
Course Category : DC (Departmental Core)
Pre-requisite(s) : COC3090
Contact Hours (L-T-P) : 0-1-2
Type of Course : Lab
Course Objective
To develop a practical understanding of machine- and assembly-language programming 8085 and 8086
microprocessors and interfacing external systems with the 8085.
Course Outcome
Students will be able to:
1. Design device-independent algorithms for machine language programs
2. Implement and execute machine language programs
3. Interface various digital devices with 8085
4. Implement assembly language programs on 8086 and later microprocessors from Intel
5. Develop the skill of working within a limited capacity processing environment and explain the efficiency-related
issues
Syllabus
Experiments to be conducted in this lab include, but are not limited to, writing and executing programs, and
interfacing if necessary, for:
1. 8085: to find minimum in given list of ‗n‘ numbers.
2. 8085: to find square of a number.
3. 8085: to find a square root of a number.
4. 8085: to convert given HEX number into DECIMAL and vice versa.
5. 8085: to evaluate n!/7, where the result can be up to 16-bits, using subroutines for multiplication and
division.
6. 8085: to find third largest in given list of ‗n‘ numbers.
7. 8085: to glow alternate LEDs using Digital I/O card.
8. 8085: to perform multi-byte addition on two given byte strings.
9. 8085: to remove multiple occurrences of numbers in a given list of numbers.
10. 8085: to determine the frequencies of distinct numbers in a given list of numbers.
11. 8085: to evaluate the value of ab
for given values of a and b.
12. 8085: to generate Tribonacci series for a given value of n. The Tribonacci series is defined as: fn=fn-1+fn-2+fn-3
for n≥3 and f0=0,f1=1,f2=1.
13. 8085: to generate a square wave using SOD line of 8085 and display it on a CRO.
14. 8086: to perform multi-byte addition on two given byte strings.
15. 8086: to remove multiple occurrences of numbers in a given list of numbers.
16. 8086: to determine the frequencies of distinct numbers in a given list of numbers.
17. 8086: to evaluate the value of ab
for given values of a and b.
18. 8086: to add two 3x3 matrices.
19. 8086: to multiply two 3x3 matrices.
20. 8086: to implement bubble sort.
21. 8086: to implement selection sort.
BOOKS:
*1. R.L Gaonkar- ―Microprocessor Architecture, Programming and Applications‖, Wiley Eastern Ltd.
*2. K.L Short- ―Microprocessor and Programmed Logic‖- PHI Ltd.
3. A.P Mathur- ―Introduction to Microprocessors‖,- Tata McGraw Hill.
4. B.Ram- ―Fundamentals of Microprocessors and Microcomputers‖,- Dhanpat Rai and Sons.
5. Barry B. Brey- ―The Intel Microprocessors, Architecture Programming and Interfacing‖,- PHI Ltd.
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x
2 x x x x x x x
3 x x x x x x x x
4 x x x x x x x x
5 x x x x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Minor Project Lab
Course Number : COC3950
Credits : 3
Course Category : DC (Departmental Core)
Pre-requisite(s) : COC2090
Contact Hours (L-T-P) : 6 (0-0-6)
Type of Course : Practical
Course Objective
The objective of this lab is to make the students understand the software engineering paradigm by working on a minor
project.
1. Familiarize the students with software development life cycle stages
2. Learn to apply the design methodologies
3. Learn to implement, test and deploy the project efficiently
4. Develop the understanding and use of some application development environment like .Net, JVM, Eclipse etc
5. Gain in-depth knowledge on some specific concept
6. Develop the ability to work in a team
Course Outcome
Upon successful completion of this course, the student will be able to:
1. Apply software development practices in projects
2. Express project requirements in IEEE SRS format
3. Design using standard design methodologies
4. Implement the project using a programming language and platform
5. Test and debug the project
Syllabus:
List of Minor projects conducted in the Lab
Implementation of MOST architecture for neural network design optimization
Online examination system
Auto Sync Utility
Social networking website for information sharing
Social network analysis using NetworkX
Identify trends in data using HADOOP
Auditing software for database
Gadget review website
Promotional website for small scale business
Online job search website
Network communication on Android
Audio/video file splitter
Adaptive e-test
TPO Management
Mobile application for course management
Dynamic news alert application on android
Development of 'skyset' mobile game
Blog website for AMU
An improved Steganography scheme
Adaptive CPU scheduling algorithm
Game for PC 'Beware of Balls'
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x x x x x x
3 x x x x x x
4 x x x
5 x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title ADVANCED COMPUTING LAB
Course Number : COC3960
Credits : 2
Course Category : DC
Pre-requisite(s) :
Contact Hours (L-T-P) : 0-1-2
Type of Course : Laboratory
Course Objectives
This course is helpful in making students learn advanced tools for software development. The student is expected to
learn programming and debugging tools on windows and non-windows platforms such as Linux/Unix.
Course Outcomes
At the end of this course, the student can be expected to:
1. Be comfortable with programming on the Linux platform
2. Understand programming tools for software development
3. Apply software development tools to debug software
4. Develop algorithms that satisfy various constraints
5. Analyse software behaviour to isolate anomalies
Syllabus/ List of experiments
1. Implement the Least Frequently Used (LFU) CPU scheduling algorithm
2. Implement the Least Recently Used (LRU) CPU scheduling algorithm
3. Implement the Round Robin (RR) CPU scheduling alogrithm
4. Implement the Shortest Job First (SJF) CPU scheduling alogrithm
5. Write a shell script in Linux to print the operating system environment variables
6. Write a shell script determine if a given number is a magic number based on certain conditions
7. Write a program to create three threads to manipulate a shared global array
8. Write a program to synchonise mulitple threads to avoid data inconsistency
9. Write a program to implement the producer-consumer problem
10. Set up a simple web server in Java to support HTTP
11. Extened the server developed in the previous experiment to a multi-threaded (or concurrent) Web server.
Text Book(s)/ Reference Book(s)
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts, 7th
Edition, Wiley
2. Richard Blum, Linux Command Line And Shell Scripting Bible 2nd Edition, Wiley India, 2011
3. Elliot Rusty Harold, Java Network Programming: Developing Networked Applications, 4th
Edition, O‘Reilly
Media, 2013
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x
3 x x x x
4 x x x
5 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title COLLOQUIUM
Course Number : COC3800
Credits : 2
Course Category : DC (Departmental Core)
Pre-requisite(s) : EZH1110, EZH2910
Contact Hours (L-T-P) : 0-2-0
Type of Course : Seminar
Course Objective
To promote students for research and innovative work and to develop skills to present technical topics in front of high
technical audience.
Course Outcome
On successful completion of the course the students will be able to
1. Demonstrate, present and discuss core technical topics
2. Expose to current researches in various fields of computer science & engineering
3. Develop teaching and research skills
4. Learn professional development skills and professionalisms
5. Be a practicing professional and sustain in academic and corporate world.
Syllabus
The colloquium is structured in manner that there is a suitable mix of presentations of the students on diversified areas
of computer engineering. The colloquium will be coordinated by a faculty of the department.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x
3 x x
4 x
5 x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title DISTRIBUTED AND PARALLEL SYSTEMS
Course Number : COE4590
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) : COC2080, COC3100
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
This course will introduce students to fundamentals parallel and distributed programming. The course will cover the
current parallel and distributed architecture, basic issues in parallel/distributed application development,
parallel/distributed algorithms, data-structures and programming methodologies, and current technologies. The course
will be a "hands-on" course with programming assignments and a final project.
Course Outcome
Upon successful completion of this course, the student will be able to know the following topics:
1. Limitations of sequential computers.
2. SISD, SIMD, MIMD and networked computers
3. Shared memory and distributed memory computers
4. Static and dynamic interconnections
5. Message passing schemes
6. Performance and scalability: speedup, granularity, cost-optimality, Amdahl's law and its suitability
7. Different Parallel Algorithms.
Syllabus:
UNIT I INTRODUCTION
Need for high performance computers; Limitations of Von Neumann Architecture, Pipelining, Interleaved memory
Organizations, cache, Flynn's and other Classifications; Amdahls Law; Gustufson-Barsis Law; Comparison of two
laws, efficiency and speed up Curves; performance measures & metrices.
UNIT II SIMD MODELS
SIMD configurations, Shared memory and mesh- Connected models, Processor organizations - mesh, shuffle, inverse
shuffle, butterfly, Hypercube; Inter connection networks & performance parameters, Sorting Algorithm on SIMD
models.
UNIT III PIPELINED VECTOR PROCESSOR & MULTIPROCESSORS
Vector Operations; General pipelines, concept of reservation tables; Pipelining of Vector operations; Vectorizing
Compilers, case study of Vector Computers- CRAY -1, CRAY –XMP, VP 200, IRAM etc. Tightly coupled and
Loosely Coupled Systems; Shared memory and message, Passing models; Properties & Characteristics of
Multiprocessors, UMA and NUMA models, Task scheduling, deadlock, cache coherency/ consistency, and their
solutions.
UNIT IV PARALLEL ALGORITHMS
Abstract m/c Models; RAM & PRAM Models Analysis of Parallel, Algorithms, Cost Optical algorithms, Concepts of
Complexity of algorithms; NP- hard Problem etc, Searching & Sorting algorithms on PRAM Models, Practical models
of parallel Computation; BSP, Log GP models, Heterogeneous processing, Parallel programming environments,
concept of Grid & Cloud computing.
Books:
*1. Hwang and Briggs, "Computer Architecture and Parallel Processing", McGraw Hill International.
2. Kai Hwang , "Advanced Computer Architecture", McGraw Hill International
3. Quinn M. J., "Designing Efficient Algorithms for Parallel Computers", McGraw-Hill International
4. Saing Soo, YL. Ching, ―Parallel processing and parallel Algorithms, springs Publications.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x
3 x
4 x
5 x
6 x
7 x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Compiler Design
Course Number : COC4060
Credits : 4
Course Category : DC
Pre-requisite(s) : AMS2630, COC3110
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
This course aims to familiarize students with compiler techniques. It covers how to build compiler of programming
languages. It discusses important language issues, their syntax verification and translation to machine language. But
these techniques also find application in several other problems such as string parsing, translator etc.
Course Outcomes
Upon completing the course, the student will:
1. be familiar with the techniques used in lexical analysis, syntax analysis, semantic analysis, intermediate code
generation, code optimization and code generation
2. be able to build compiler
3. be able to apply compiler techniques in other domain such as in building translator, parser etc.
Syllabus
UNIT-I Introduction to Compiler & Lexical Analysis
Introduction, Structure of Compiler, Elements of Programming Language, Grammar, Derivation, Syntax Tree, Parse
Tree, Ambiguous Grammar, Symbol Table, Lexical Analysis – Specification and Recognition of Tokens, Lookahead
Operator, Lexical Errors.
UNIT-II Syntax Analysis and Syntax Directed Translation
Syntax Analysis – Top Down Parsing, Predictive Parser, Bottom Up Parsing, SLR, Canonical and LALR Parsing,
Error Handling in Top Down and Bottom Up Parsing, Syntax Directed Definition, Synthesized and Inherited
Attribute, S-Attributed Definition, L-Attributed Definition.
UNIT-III Intermediate Code Generation
Type Checking, Intermediate Code Forms, Intermediate Code Generation for Arithmetic Expression, Boolean
Expression, if-then-else, goto, while statements etc. Run-Time Environment
UNIT-IV Code Generation & Code Optimization
Issues in the design of Code Generator, Basic Blocks and Flow Graph, Register Allocation and Assignment. Sources
of Optimization, Optimization of Basic Blocks, Global Data Flow Analysis – Reaching Definition, Available
Expression, Live Variable etc. Loops in Flow Graph.
REFERENCES
1. Aho, Lam, Sethi, Ullman, ―Compilers : Principles, Techniques and Tools‖, Pearson Education.
2. Aho, Ullman, ― Principles of Compiler Design‖, Narosa Publising House.
3. Steven S. Muchnick, ―Advanced Compiler Design Implementation‖, Harcourt Asia Pte Ltd.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x x x
3 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Design of Prgoramming Languages
Course Number : COE4030
Credits : 4
Course Category : DE
Pre-requisite(s) : COC2030, COC2060
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
The objectives of this course are the following:
1. To increase capacity of expressing ideas
2. To improve background for choosing appropriate languages
3. To increase ability of learning new languages
4. To better understanding of the significance of implementation
5. To overall advancement of computing
Course Outcomes
On completion of this course, the student will be able to:
1. Explain the different categories of programming languages
2. Remember the history of few well known programming lanugages
3. Analyze semantic issues associated with language implementations
4. Determine basic constructs of designing a programming language
5. Differentiate the imperative, functional, and object oriented languages
6. Describe key features of abstract data types and object oriented paradigms
7. Illustrate the essential for scripting and logic programming languages
Syllabus
UNIT I PROGRAMMING LANGUAGE CONCEPTS
Programming languages design concepts and trade-offs; Evolution of major PLs: functional, object oriented
and scripting languages; Basic building block of PLs: constants, variables, expressions and statements;
Names, binding, type checking, scope rules, syntax and semantics of PLs
UNIT II BASIC CONSTRUCTS OF PROGRAMMING LANGUAGES
PLs primitive, character, array, record, union, pointer and reference type data types; PLs expressions,
Selection and Iterative statements; Unconditional branching; Guarded commands; Subprograms, Parameter
passing methods, Subprograms Implementation
UNIT III OBJECT ORIENTED AND MODERN PROGRMMING LANGUAGES
Characteristics of object-oriented programming; Abstraction and Encapsulation constructs; Support for
object-oriented programming in Smalltalk, C++, JAVA and Ruby; Concurrency levels, Java and C# Threads,
Exception & Event handling in C++ and in Java
UNIT IV FUCNTIONAL AND LOGIC PROGRAMMING LANGUAGES
Fundamental of Functional programming languages: lambda expression; An introduction to LISP, Scheme,
ML and Haskell, Introduction to predicates calculus and logic programming; PROLOG and its elements;
Application of logic programming.
Text Book(s)/ Reference Book(s)
1. *Robert W. Sebesta, ―Concepts of Programming Languages‖ Ninth edition, Pearson Education India, Pte.
Ltd, 2010.
2. M. Morris Mano and Charles Kime, ―Logic and Computer Design Fundamentals‖, Fourth edition, PHI, Pvt.
Ltd. 2007.
3. W William Stalling, ―Computer Organization and Architecture Designing for Performance‖, Seven edition,
Pearson education, Ltd, 2006.
4. Mohamed Rafiquzzaman, ―Fundamentals of Digital Logic and Microcomputer Design‖, Fifth edition, Wiley
Interscience, A John Wile & Sons Inc. publication, 2005.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x x
3 x x
4 x x
5 x x
6 x x
7 x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Soft Computing
Course Number : COE4440
Credits : 4
Course Category : DE
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
The objectives of this course are the following:
1. To construct computational intelligence
2. To develop intelligent machines
3. To provide solutions to real world problems
4. To exploit the tolerance for approximation, uncertainty, imprecision, and partial truth
Course Outcomes
On completion of this course, the student will be able to:
1. Define & describe the soft computing and its approaches
2. Design & construct the roles of soft computing in building intelligent machines
3. Identify and select a suitable Soft Computing methodology to solve the problem
4. Understand & define fuzzy sets and represent these sets by membership functions
5. Describe the relation between real brains and simple artificial neural network models
6. Design genetic algorithms for single and multiple objective optimization problem
7. Combine atleast two soft computing approaches for the advancement in computing
Syllabus
UNIT I INTRODUCTION
An overview of Soft Computing, Constituents of Soft Computing and conventional Artificial Intelligence,
Introduction to Artificial Neural Networks, Perceptron, Neural Networks Learning Rules, Activation
Functions, Derivation of generalized delta learning rule (backpropagation) for Multilayer perceptron.
UNIT II FUZZY LOGIC
Fuzzy Sets, Basic Definitions and Terminology, membership function Set-theoretic operation. Fuzzy union,
intersection and complement, various T-norm and T-conorm operators, Fuzzy Relations.
Fuzzy Logic, Approximate Reasoning, Compositional Rule of Inference, Mamdani Fuzzy model, Sugeno
Fuzzy model, Fuzzy decision making, Fuzzy Control.
UNIT III GENETIC ALGORITHMS
Fundamentals of Genetic Algorithm, Encoding, Reproduction, Roulette Wheel, Tournament Selection, Rank
Selection etc. Cross over and mutation operators, Introduction to Simulated Annealing. Recent Trends
UNIT IV HYBRID SYSTEMS
Hybrid Systems, GA based Fuzzy Systems and Neural Networks Training, Any other applications of soft
computing.
Text Book(s)/ Reference Book(s)
Books:
1. *Neural Networks, Fuzzy Logic and Genetic Algorithms: Synthesis and Applications, S. Rajasekaran and G.
A. Vijayalakshmi Pai, Prentice Hall India
2. *Fuzzy Logic and its Engineering Applications, T.J. Ross, Mc Graw Hill
3. *Introduction to Artificial Neural Networks, J.M. Zorada, Jaico Publishing House
4. Neuro-Fuzzy and Soft Computing, Jang, Sun and Mizutani, Pearson Education Asia
5. Genetic Algorithms, D. E. Goldberg, Pearson Education Asia
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x
4 x x x x
5 x x
6 x x
7 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title EMBEDDED SYSTMS
Course Number : COE4480
Credits : 4
Course Category : DE (Department Elective)
Pre-requisites :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
1. Provide Basic terminology and concepts of Embedded system.
2. Introduce FPGA and CPLD and UML in embedded system design.
3. Introduce Microprocessor/microcontroller architectures and instruction sets.
4. ARM and SHARC processors and Programming concepts.
5. Provide explanation of Design constraints: low power, speed, memory size, real-time behavior.
6. Introduction to real-time operating systems
7. Provide understanding of Basic network and communication protocols.
Course Outcome
Students will be able to:
1. Comprehend important embedded system terminology
2. describe the special requirements that are imposed on embedded systems
3. Compare RISC and CISC architectures.
4. sketch a design of an embedded system around a microprocessor or microcontroller.
5. Compare ARM and SHARC processor.
6. explain how microprocessor, memory, peripheral components and buses interact in an embedded system.
7. Interface to peripherals, knowledge of general interfacing standards.
8. evaluate how architectural and implementation decisions influence performance and power dissipation.
9. Describe requirement for a real-time embedded system.
Syllabus
UNIT I. INTRODUCTION TO EMBEDDED SYSTEMS
Overview of Embedded systems, Design model for Embedded systems, Design description with Unified
Modeling Language (UML), Introduction to FPGA and CPLD.
UNIT II. SMALL SCALE EMBEDDED PROCESSOR Embedded systems Architecture: RISC/CISC Architecture, Von-Neumann and Harvard Architecture,
PIC Microcontroller: Architecture, Instruction Set and Interrupt Logic.
UNIT III. ADVANCED EMBEDDED PROCESSORS Study of ARM and SHARC processors: Architecture, Programming Concepts, CPU performance, CPU
power consumption, CPU buses, ARM bus, SHARC bus, Some other Embedded systems processors.
UNIT IV. EMBEDDED SYSTEMS SOFTWARE
Program Design and Analysis, Control and Data Flow graphs, Embedded Operating Systems,
Scheduling, Networks for Embedded systems, Various network protocols.
Books:
*1. Computers as Components: principles of embedded computing system design, Wayne Wolf, Morgan
Kaufman (Harcourt India).
2. Design with PIC Microcontrollers, John B. Peatman, Pearson Education.
*3. Programming for Embedded Systems by Prasad, Gupta, Das and Sharma, Wiley DreamTech India
Pvt Ltd.
4. Embedded System Design: a unified hardware/software by Vahid and Givargis, John Wiley.
5. The design of small-scale embedded systems, Tim Wilmhurst, Palgrave.
*Text books.
Table: Mapping of Program Outcomes and Course Outcomes for CO-448
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x
3 x
4 x x
5 x
6 x
7 x x
8 x
9 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title COMPUTER NETWORK DESIGN
Course Number : COE4510
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) : Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
After taking this course the students should be able to:
1. Understand principles of network services and applications.
2. Identify and analyze delays and losses in networks.
3. Design reliable data transfer protocols.
4. Understand how to analyze of congestion control and flow control mechanisms.
5. Design and develop applications that run over networks.
Course Outcome
Students who completed the course have demonstrated the ability to:
1. Understand principles of network services and applications.
2. Compute and analyze delays and losses in networks.
3. Design protocols for reliable data transfer.
4. Analyze mechanisms of congestion control and flow control.
5. Design and develop network applications.
Syllabus
UNIT I INTRODUCTION
Introduction to Computer Networks, Circuit Switching and Packet Switching, Protocol Layers and
Their Service Models, Introductory Concepts of Queuing Theory: Queuing Delays and Losses,
Introduction to Application Layer, Application Layer Services and Protocols: The Web and HTTP,
FTP, Electronic Mail, DNS.
UNIT II TRANSPORT LAYER
Introduction and Transport Layer Services, Connectionless Transport, Principles of Reliable Data
Transfer: Go-Back-N and Selective Repeat, Connection-Oriented Transport, Principles of
Congestion Control, TCP Congestion Control.
UNIT III NETWORK LAYER
Introduction, Virtual Circuit and Datagram Networks, The Internet Protocol: Forwarding and
Addressing, What is Inside a Router?, Routing Algorithms: Link-State Routing, Distance Vector
Routing, Hierarchical Routing, Routing in the Internet: RIP, OSPF, BGP.
UNIT IV LINK LAYER
Introduction to Link Layer Services, Error Detection and Correction Techniques, Multiple Access
Protocols, Link-Layer Addressing: MAC Addresses, ARP, DHCP, Ethernet, Interconnections: Hubs
and Switches, The Point-to-Point Protocol.
Books:
*1. J.F. Kurose, K.W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet, 6th Edition,
Pearson Education, 2012.
2. Andrew S. Tanenbaum, David J. Wetherall, Computer Networks, 5th Edition, Pearson Education, 2012.
3. K.S. Trivedi, Probability and Statistics with Reliability and Queuing and Computer Science Applications,
Second Edition, John Wiley, 2002.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x
3 x x
4 x x x
5 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Mobile Computing
Course Number : COE4520
Credits : 4
Course Category : DE
Pre-requisite(s) : CO-313, EL-340
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
Mobile computing and wireless networks is a young and dynamic field. Ubiquitous access to information, anywhere,
anyplace, and anytime, will characterize whole new kinds of information systems in the 21st century. These are being
enabled by rapidly emerging wireless communications systems such as Cellular transmissions, Personal
Communications Systems, Mobile IP, Wireless Local Area networks (LANs). Moreover, the next generation
communication systems are expected to provide a range of services to mobile users to support voice, video,
multimedia, conventional data, and Internet access in an integrated fashion.
Course Outcomes
At the end of this course students will be able to:
1. examine the area of wireless networking and mobile computing,
2. looking at the unique network protocol challenges and opportunities presented by wireless
communications and host or router mobility.
3. give a brief overview of fundamental concepts in mobile wireless systems and mobile computing,
mobile IP, as well as issues associated with small handheld portable devices and new applications that
can exploit mobility and location information.
Syllabus
Unit-I INTRODUCTION
Introduction to Wireless Communication Systems: Evolution of mobile radio communications,
examples of wireless communication systems, PCS Architecture, Cellular Telephony, 2G, 3G and 4G
Networks, AMPS, D-AMPS, GSM, CDMA
Unit-II MOBILITY MANAGEMENT
Handoff, Inter-BS Handoff, Intersystem Handoff, Roaming Management, Handoff Management,
MCHO, NCHO, MAHO, Hard Handoff, Soft Handoff
Unit-III 2G/2.5G/2.75G NETWORKS
D-AMPS, Cellular Digital Packet Data, CDPD Architecture, GSM System Overview, GSM Short
Message Service (SMS), GPRS Architecture, GGSN, SGSN, EDGE, Mobile Number Portability, VoIP
service for Mobile Networks
Unit-IV 3G AND 4G NETWORKS
UMTS, W-CDMA, CDMA2000, Field Trials, IP for 3G, HSDPA, HSUPA, WiMAX, LTE, Advanced
LTE, Circuit Switched Fallback (CSFB)
Text Book(s)/ Reference Book(s)References:
1. T.S. Rappaport, ―Wireless Communication: Principles and Practice‖, 2nd
ed, Pearson, 2002
2. Yi-Bing Lin, ―Wireless & Mobile Network Architectures‖, John Wiley & Sons, 2001
3. Jochen Schiller, ―Mobile Communication‖, Pearson Education
4. Dave Wisely, Philip Eardley and Louise Burness ―IP for 3G - Networking Technologies for Mobile
Communications‖, John Wiley & Sons, 2002
5. Andreas Molisch, ―Wireless Communications‖, 2nd
ed, Wiley, 2005
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x x
3 x x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech. (for all branches)
Course Title SELECTED TOPICS IN COMPUTER ENGINEERING-I
Course Number : COO4600
Credits : 4
Course Category : OE (Open Elective)
Pre-requisite(s) : Contact Hours (L-T-P) : 4 (3-1-0)
Type of Course : Theory
Course Objective
The objective of this course is to develop a basic understanding of cryptography, how it has evolved, and some key
encryption techniques used today, concept of processes in operating system and basic idea of wireless and mobile
communication also a brief idea about pervasive computing.
Course Outcome
Students will be able to:
1. Learn how the choice of data structures and algorithm design methods impact the performance of programs.
2. Analyze the importance and use of Abstract Data Types (ADTs)
3. Design and implement elementary Data Structures such as arrays, trees, Stacks, Queues, and Hash Tables.
4. Identify algorithms as a pseudo-code to solve some common problems.
5. Explain the process concept and various process scheduling algorithms in operating system.
6. Explain the concept of memory management like swapping, paging, segmentation, page replacement algorithms
etc in a given constraints.
SYLLABUS:
UNIT I INTRODUCTION
Concept of Data Structures, Basic Terminologies related to data structures, linear and non-linear
data structure. Concept and properties of algorithms, How to develop an algorithm, Complexity,
Time-Space Tradeoff, Algorithm analysis, Rate of growth: Big Oh notation, other asymptotic
notations for complexity of algorithms.
UNIT II ARRAYS
Arrays, one-dimensional arrays: traversal, selection, searching, insertion and deletion. Sorting:
Bubble sort, selection sort, insertion sort, merge sort, quicksort, other sorting methods and their
analysis. Multi-dimensional arrays, Representation of arrays in physical memory, Application of
arrays.
UNIT III ABSTRACT DATA TYPES (ADTs)
Abstract Data Types, Stacks, Applications of Stacks - prefix and postfix notations, Queue, Circular
Queue, Priority Queue, Dequeue, Linked Lists, Operations on Linked Lists, Binary Tree,
representation and traversal of binary tree.
UNIT IV OPERATING SYSTEM & MEMORY MANAGEMENT
Introduction, Process Concept, Process States, Process Control Block, Process Scheduling,
Scheduling Algorithms, Memory management: swapping, paging, segmentation, virtual memory,
page replacements algorithms.
References:
*1. Aho, Hopcroft, Ullman, ―Data Structures and Algorithms‖, Pearson Education
*2. Lipschutz, ―Data structures‖ Tata McGraw Hill.
*3. Silberschatz, Galvin ―Operating System Concepts‖, 7th
ed, Addisson Wesley, 2006
4. A.K.Sharma, ―Data Structure using C‖, Pearson, 2011
5. Goodrich M. Tamassia R., ―Data Structures and Algorithms in Java‖, 3rd
ed. Wiley
* Text Books
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x x x
3 x x x
4 x x
5 x x
6 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech. (for all branches)
Course Title SELECTED TOPICS IN COMPUTER ENGINEERING-II
Course Number : COO4470
Credits : 4
Course Category : OE (Open Elective)
Pre-requisite(s) :
Contact Hours (L-T-P) : 4 (3-1-0)
Type of Course : Theory
Course Objective
The objective of this course is to study the fundamental concepts of Computer networking and Database Management
Systems. in this course, students will learn about protocols governing various layers of OSI and TCP/IP models like
flow control, techniques for routing information in packets and data organization in relational databases and
maintaining its atomicity, consistency, isolation, durability.
Course Outcome
Students will be able to:
1. Define computer network concepts and vocabulary.
2. Describe the layers of OSI and TCP/IP Model.
3. Explain the protocols of various layers.
4. Explain data link layer emphasizing on multiple access of media and collision detection.
5. Explain network layer emphasizing on routing algorithm.
6. Explain transport layer emphasizing on connection creation, management and crash recovery.
7. Describe architecture and fundamental elements of Relational Database management system.
8. Recognize a bad database design and improve it using Normalization Techniques.
9. Tell how to ensure atomicity, consistency, isolation, durability.
SYLLABUS:
UNIT I COMPUTER NETWORKS
Protocol and Protocol Structure, Layered Architecture, ISO-OSI Reference Model, TCP/IP
Reference Model, Physical and Data Layer Concepts: Transmission Media, MAC Layer, Flow
Control , CSMA/CD
UNIT II TCP/IP PROTOCOLS & ROUTING ALGORITHMS
Networks Layer : IP, Family & Protocol, Routing Algorithms Transport layer : QOS, Connection
Management; Flow Control, Buffering and Crash Recovery Introduction to Telnet, FTP, SMTP,
SNMP, PPP, SLIP
UNIT III DATA BASE MANAGEMENT SYSTEM
Data Base Systems and their needs, Components of DBS, DBS architecture, Data Base
Administrator and his role, DBMS and its Components, Relational Model: Domains, Attributes &
keys, Extension, Intension, Integrity Rules and Constraints, SQL
UNIT IV NORMALIZATION, RECOVERY AND CONCURRENCY
Normalization & Functional Dependencies, Introduction to Recovery, Transaction, Commit,
Rollback, Sync, Concurrency control problems
References:
*1. A.S. Tanenbaum , ―Computer Networks‖ 4th edition,
*2. Abraham Silberchatz, ― Data Base System Concepts‖, McGraw Hill
3. Forouzan, ―Data Communication and Networking‖, Tata McGraw Hill
4. Willian Stalbings , ―Data Communication and Networks‖,
5. Date, C.J.: ―Introduction to Data base System‖, Addison Wesley
6. Elmasri & Navathe ―Fundamentals of Database Systems‖ 5th
Edition
*Text Books
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x
3 x x
4 x x
5 x x
6 x x
7 x x x
8 x x x x
9 x x x x
2017-2018
DEPARTMENT OF CIVIL ENGINEERING
B. Tech. (for all branches)
Course Title Water Resources and Watershed Management
Course No. : CE – 483
Course category : OE
Contact Hours : 4
Course Assessment : Continuous and Semester End Assessment
Objectives
1. To develop an appreciation of Water as a vital commodity for survival of mankind, and of Land for sustainable
watershed management: (a) Hydrologic cycle and its effect on man‘s activity (b) characteristics of watersheds
(c) Erosion process, erosion control and sediment yield (d) soil conservation practices.
2. To develop an understanding of the maintenance of fresh water resources and optimal water use for sustainable
development of the country.
3. To understand and experience physical, chemical and pathological properties of water for the health survival
and health hazard mitigation.
4. To understand and be able to apply the project economics in cost benefit analysis, Economic evaluation, project
implementation and management, problems of execution and management.
5. To understand rain water harvesting, river Interlinking, Water rights, Water disputes and legislation.
Course Outcomes:
After the completion of this course the students will be able to:
1. Apply fundamental concepts of Water and Land resources management to the solution water shortage
problems. The knowledge gained by the students will benefit in understanding the importance of the
water resources.
2. Understand the importance of optimal water use. The society will keep the water resources afresh and
will use water resources optimally.
3. Apply collection and storage of water through rainwater harvesting for sustainable development in the
perspective of increasing population and changing life styles of the people.
4. River interlinking studied in this subject will solve the dual problems i.e. shortage of water in drought
prone areas and safety of area against floods due to flood prone rivers. The flood mitigation studied in
this subject will safeguard the people and minimize the flood damages.
5. To be able to apply the knowledge in the management and development the water resources and to be
able understand the importance of water quality and water born diseases to solve the health and
environmental hazards problems.
Syllabus
Unit 1: Types of watershed and their characteristics, Purpose of planning of watershed projects, Guidelines for
project formulation, Management strategies, system concept, systems components.
Unit 2: Hydrologic cycle and its effect on man‘s activity, surface and sub - surface runoff, erosion process,
erosion control and sediment yield, sediment transport, Soil conservation practices.
Unit 3: Water resources and environmental problems, water quality management Design of water resources
systems, Water management, rain water harvesting, river Interlinking, Water rights, Water disputes and
legislation.
Unit 4: Flood and its mitigation, Environmental impact assessment, adverse effects of dams and reservoir on
environment, watershed management with multiple use concepts.
Unit 5: Project economics: pattern of financing and credit, cost benefit analysis, Economic evaluation, project
implementation and management, problems of execution and management.
Text / Reference Books:
1. K.C. Patra, ―Hydrology and water Resources Engineering‖
2. Wurbs & James ―Water resources Engineering‖
3. S. K., ―Garg Irrigation Engg. and Hydraulic Structures‖
4. K.C. Patra, ―Hydrology and water Resources Engineering‖
5. K G Ranga Raju, ―Flow through open channel‖
6. K.Subramanya‖Engineering Hydrology.‖
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x x
2 x x x x x
3 x x x x x
4 x x x x x x
5 x x x
2017-2018
DEPARTMENT OF CIVIL ENGINEERING
B. Tech. (for all branches)
Course Title DISASTER MANAGEMENT
Course No. : CE – 444 N
Course category : OE
Contact Hours : 4
Course Assessment : Continuous and Semester End Assessment
Objectives
1. To create awareness amongst students to basic issues of natural and manmade disasters.
2. To ensure the understanding of the disaster management cycle and relationship amongst vulnerability,
preparedness, prevention and mitigation.
3. To invoke minimum ability and sensitivity amongst students to respond to disasters in their area of living and
working.
4. To develop technical prowess and to mitigate the effects of disasters by capacity building amongst
engineering fraternity towards formulation and implementation of disaster management strategies.
5. To relate amongst the basic approaches adopted in disaster risk reduction and institutional mechanism
adopted in country towards creating resilient society.
Course Outcomes:
After the completion of this course the students will be able to:
1. Understand genesis and causes of natural and manmade disaster within the framework of fundamental concepts of
basic sciences and engineering.
2. Perceive the vulnerability of their living and working places and level of preparedness within the existing setup of
disaster management.
3. Analyze and critically examine the vulnerability of a region and to employ adequate strategy and tools of
intervention.
4. Build capacity to use specialized problem solving skills, methodologies and technology.
5. Setup priorities to develop coherent and adaptable disaster management plan.
6. To produce technical reports and database for effective communication amongst stakeholders to comprehend the
problems of disaster management and to device improved technologies for future interventions.
Syllabus:
UNIT I - Natural and Man Made Disasters:
Meaning and nature of natural disasters, their types and effects. Floods, drought, cyclone, earthquakes, landslides,
avalanches, volcanic eruptions, Climatic change and extreme climate. Global warming, Sea level rise, ozone depletion.
Nuclear disasters, chemical disasters, biological disasters, building fire, coal fire, forest fire, oil fire, Pollution and
environmental degradation. Road, rail, sea and air accidents.
UNIT II - Earthquake and Cyclone:
Understanding dynamics of earth‘s interior and plate tectonics. Causes and classification of earthquakes. Seismology
and methods of earthquake measurement. Concept of seismic zonation and micro-zonation. Earthquake and associated
hazards. Preparedness, mitigations and civil engineering interventions.
Climatology, Cyclones and tropical cyclones, Naming and radius of cyclone, monitoring of cyclone, Categories of
Cyclonic disturbances, Causes of disaster during cyclone, damage and vulnerability assessment due to cyclone.
UNIT III - Landslide and Flood:
Understanding mass wasting and movement. Causes and classification of landslides. Landslide monitoring and
landslide hazard zonation. Slope stability analysis and stabilization methods. Preparedness, mitigations and civil
engineering interventions.
Understanding hydrosphere and hydrologic cycle. Causes and classification of floods. Preparedness, mitigations and
civil engineering interventions.
UNIT IV - Disaster Preparedness and Mitigation: Human behavior and response. International and National
Strategies for disaster reduction. Concept of disaster management. National disaster management framework. Central,
state, district and local administration; Armed forces, police, NDRF in disaster response, rescue and relief. Role of
NGOs, community based organizations and media. Role of different engineering disciplines in preparedness, response,
rescue, rehabilitation recovery, prevention and mitigation.
Books and Reading Material:
1. Bryant Edwards (2005): Natural Hazards, Cambridge University Press, U.K.
2. Carter, W. Nick (1991): Disaster Management – A Disaster Manager‘s Handbook, A.D.B., Manila.
3. Goel, S.L. (2006): Encyclopedia of Disaster Management, Deep & Deep Publications, New Delhi.
4. Government of India (2009): National Disaster Management Policy, New Delhi.
5. Gupta et. al. (2001): Manual of Natural Disaster Management, IIPA, New Delhi.
6. Harsh Gupta (2003): Disaster Management, Universities Press.
7. Kapur, Anu (2010): Vulnerable India: A Geographical Study of Disasters, Sage Publishers, New Delhi.
8. Monappa, K.C. (2004): Disaster Preparedness, Akshay Public Agencies, New Delhi.
9. Narayan, B. (2000): Disaster Management, Asia Publishing House, New Delhi.
10. Sahni, Pardeep et. al. (2002): Disaster Mitigation Experiences and Reflections, Prentice Hall of India, New
Delhi.
11. Turner, B. & Andnick, F. (1997): Man Made Disasters, Betterworth Heinemann, Oxford.
12. Vinod K. Sharma (ed.) (2010): Disaster Management, IIPA, New Delhi.
Web Resources
1. https://www.ndma.gov.in
2. https://www.nidm.gov.in
3. https://www.nicee.org
4. http://nptel.iitk.ac.in/
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2
3 x x x
4 x x
5 x x x
6 x x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for all branches)
Course Title Air Pollution Technology
Course No. : ME-425 (OE)
Type of Course : Theory
Credits : 4
Pre-requisites : None
Contact hours : 3-1-0
Course Work : Home Assignment/quiz - 15%
Mid-sem Exam. (1 hour) - 25%
End-sem Exam (2 Hourss) - 60%
Course Objectives:
1. To impart complete knowledge of causes, effects and control of Air Pollution due to combustion systems.
2. To discuss pollutant monitoring techniques and control strategies.
3. To analyze the automotive emissions, their reduction technologies and emission standards.
Course Outcomes:
After taking this course the students should be able to
1. Understand and explain the global consequences of air pollution, effect of meteorological conditions on
pollutants dispersion and vice versa.
2. Calculate the air pollution severity in terms of PINDEX
3. Understand the formation mechanism and control strategies of combustion generated pollutants
4. Carry out sampling and analysis of combustion generated pollutants using modern on-line
techniques/instruments.
5. Identify the type and extent of emissions from mobile sources.
6. Select and design pollutant control devices for various applications.
Syllabus: NO. OF PERIOD
Unit 1: Introduction
-Introduction, Theories on the Global Consequences of Pollution 2
-Global Oxygen-Carbon Dioxide Balance 2
-Atmospheric & Meteorological effect, Lapse rate & Stability considerations 3
-General Characteristics of Stack Plume 2
-Assessment of Air Pollution Severity (PINDEX Scheme) 2
Unit 2: Pollutant Formation & Control
-General considerations of Combustion Generated Pollutants & their Control 2
-Formation & Control of Oxides of Nitrogen (Thermal, Prompt and Fuel Bound) 2
-Formation & Control of Oxides of Sulphur 1
-Formation & Control of Carbon Monoxide 1
-Formation & Control of UHC, soot/Particulate 2
-Photochemical Smog 2
Unit 3: Sampling & Analytical Techniques
-Methodology for Sampling and Analysis of Combustion Generated Pollutants 4
- Emission instrumentation used for NOx, CO, SOx, CO2 UHC and O2 analysis 4
Unit 4: Pollution from Mobile Sources
-Emission Standards for Automobiles 1
-Emission from Gasoline Engines 2
-Crank case & Evaporative Emissions 1
-External (Catalytic) Reactors 2
-Emissions from Diesel Engines 2
-Emissions from Gas Turbines & Jet Engines 1
-Emissions Reduction Technologies 3
Unit 5: Air Pollution Control Techniques -Types of Air Pollution Control Equipment & Source Correction 2
-Mechanical Fabric Filters 1
-Wet Scrubbers 2
-Electrostatic Precipitators 1
-Afterburners / Incinerators 2
-Catalytic Combustion 1
-Flare System
1
Extra Topics:
- The effect of Air Pollution on Weather and Climate Changes 1
- An assessment of the fact that ―Clean Air Costs Money-Dirty Air Cause 1
More Money
-Ambient Air Quality Standards 1
-Indoor Air Quality 1
Text Book: ―Air Pollution Control Engineering― by Noel de Nevers. Mc Graw Hill Int. Edition
References: 1. ―Air Pollution‖, by Wark & Warner, Harper & Collins Publishers
2. ―Air Pollution‖, by Rao and Rao, Tata Mc Graw Hill
3. ―Air Pollution Control Theory‖, by Crawford , Tata Mc Graw Hill
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x x
3 x x x x
4 x x
5 x x
6 x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for all branches)
Course Title : FINITE ELEMENT METHODS
Course Number : ME-435
Credits : 4
Course Category : OE
Pre-Requisites(s) : None
Contact Hours : 3 – 1 – 0
Type of Course : Theory
Course Work : Home Assignments 15%
MidSem Examination (1 Hour) 25%
EndSem Examination (2 Hourss) 60%
Course Objectives:
The objectives of this course are to:
1. Equip the students with the Finite Element Analysis fundamentals.
2. Enable the students to formulate the design problems into FEA.
3.Enable the students to perform engineering simulations using Finite Element Analysis software (ANSYS &
ABAQUS).
4. Enable the students to understand the ethical issues related to the utilization of FEA in the industry.
Course Outcomes:
Upon completing this course, the students should be able to:
1. Identify mathematical model for solution of common engineering problems.
2. Formulate simple problems into finite elements.
3. Solve structural, thermal, fluid flow and impact problems.
4. Solve complicated 2D structural problems for stress analysis under various loads.
5. Solve Fluid Structure Interaction problems.
6. Appreciate the importance of ethical issues pertaining to the effective utilization of FEA.
Syllabus:
Unit 1:
Basic concept of finite element method, approximate solution; Basic principle of structural dynamics, boundary, initial
and eigen value problems, Integral relations, functional, the variational symbols; Weak formulation of boundary value
problems; Rayleigh-Ritz method, Galerkin‘s method and method of weighted residuals.
Unit 2:
Finite element analysis of one dimensional problems-second order boundary value problems, basic steps of finite
element analysis
e.g. modeling of boundary value problems, Discretisation of domain, derivation of element equations, connectivity of
elements, imposition of boundary conditions, solution of equations; Application of finite element analysis to heat
transfer, fluid mechanics and solid mechanics.
Unit 3:
Bending of beams, Finite element error analysis, approximation errors, various measures of errors, conversions of
solutions, accuracy of solutions, problems based on error analysis, Eigen value and time dependant problems.
Unit 4:
Isoperimetric formulations and numerical integration, natural coordinates, approximation of geometry, Preprocessor,
calculation of element matrices, assembly of element equations, imposition of boundary conditions, solution of
equations and post-processing.
Unit 5:
Finite element analysis of two dimensional problems, Interpolation functions, numerical integration and modelling
considerations, Application of finite element 2-D analysis to heat transfer, fluid mechanics and solid mechanics.
BOOKS:
1. Tripathi R. Chandrupatla & Ashoke D. Belegundu; Introduction to Finite Element in Engineering, Prentice Hall of
India,Pvt. Ltd.
2. O.C. Zienkiewiez & K. Morgan; Fnite Elements & Approximations, John Willey & Sons, New York.
3. C.S. Krishnamorthy, Finite Element Analysis, Theory & Programming, Tata McGraw Hills.
4. J.N. Reddy; An introduction to Finite Element Methods 2nd
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x x
3 x x x
4 x
5 x x
6 x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for all branches)
Course Title : Pumps, Blowers and Compressors
Course Number : ME-437
Credits : 4
Course Category : OE
Pre-Requisites(s) : None
Contact Hours : 3 – 1 – 0
Type of Course : Theory
Course Work : Home Assignments 15%
MidSem Examination (1 Hour) 25%
EndSem Examination (2 Hourss) 60%
Course Objectives:
1. The students will be able understand the basics working of rotodynamics machines
2. The will be able to undertsand the design of positive displacement pumps.
3. They will learn the basic design analysis of axial flow compressors and their performance characteristics.
4. They will learn the design principles of blowers, both centrifugal and axial type.
Course Outcomes:
1. The students understand the basics working of single and multi-stage centrifugal pumps and blowers.
2. The undertsand the performance and design of positive displacement pumps.
3. They learn the basic design analysis of axial flow compressors and their performance characteristics.
4. They understand the physics of the internal rotating flows.
5. They are able to appropriately select the turbomachines based on their applications.
Syllabus:
Unit 1:
Pumps: Classification, Centrifugal and Axial Flow Pumps, Working Principle, Heads, Efficiencies, Cavitations,
Performance; Multi-stage Pumps; Applications.
Unit 2:
Positive Displacement Pumps: Reciprocating Pump, Gear Pump, Vane Pump, Screw Pump; Industrial & General
Applications of Pumps.
Unit 3:
Blowers: Centrifugal Blowers, Single & Multi-stage theory, adiabatic efficiency, performance; Applications.
Unit 4:
Compressors: Axial Flow Multi-stage compressors, Overall efficiency stage efficiency, symmetrical blading, aerofoil
blades; surging, choking and stalling, performance; Applications.
Unit 5:
Similarity Laws : Specific Speed, Model Testing of Pumps and Compressors in Laboratory, Predicting Performance of
Prototype, Scale Effect.
BOOKS:
1. Jagdish Lal; Hydraulic Machines.
2. Cherkarsky; Pumps, Fans, Compressors, Mir Publishers.
3. Vasandani; Heat Engineering.
4. Govinda Rao, T.M.H.; Fluid Flow Machines.
5. Stepanoff; Turboblowers, John Wiley / Chapman & Hall
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x x
3 x x x
4 x x
5 x x x
2017-2018
DEPARTMENT OF MECHANICAL ENGINEERING
B. Tech. (for all branches)
Course Title : Heating Ventilation and Air Conditioning
Course Number : ME 461
Credits : 4
Course Category : OE
Pre- Requisites : ME 101- Basic Thermal Science, ME 221- Applied
Thermodynamics, ME423- Heat and Mass Transfer
Contact Hours : 3-1-0
Course Type : Theory
Course Work : Home Assignment 15%
Mid Sem. Examination ( 1 Hour) 25%
: End Sem. Examination (2 Hourss) 60 %
Course Objectives:
At the end of this course, the students
1. Will understand well, the importance of maintaining the thermal environment for human comfort which
ultimately enhances the working efficiency.
2. Will be in a position to understand the necessity of maintaining the temperature and humidity for various
processes in process and pharmaceutical industries.
3. Will become fully aware of the techniques for controlling the contamination of environment which is a must
for modern A C systems.
Course Outcomes:
After taking this course, the student shall be capable of
1. Understanding the need and importance of HVAC, handling of different HVAC systems.
2. Understanding thermal comfort its principles and practices, clothing and activities and their impact on
comfort and productivity
3. Understanding ventilation-its impact on human comfort, productivity and health.
4. Understanding psychrometry and its application to HVAC engineering, design of different HVAC systems.
5. Understanding of air and water/refrigeranr flow in ducts and pipes, duct and piping design, air distribution in
rooms.
6. Understanding control of HVAC systems- automatic and manual, different control systems used.
Syllabus:
Unit 1:
Human Comfort, requirements of comfort, comfort chart applied psychrometrics of air conditioning systems,
components of A.C. System, Central and Unitary A.C. Systems, Industrial and human comfort air conditioning,
Cogeneration of power and refrigeration.
Unit 2:
Heat transmission in buildings, building survey and locations of equipment, considerations for heating and cooling
loads, load calculation procedures
Unit 3:
Air Transmission and distribution systems, fans, pressure losses in ducts and duct sizing methods, Natural supply and
extraction systems of ventilation and their combinations, Selection of Air distributions and extraction systems for
ventilation, Air Cleaners and Scrubbers.
Unit 4:
Fluid distribution System; open loop & close loop, pipe sizing and layout, Hot water and Steam Heating Systems.
Unit 5:
A.C. Controls: Elements of basic control system, pneumatic, electric and electronic control, Thermostats and
humidistat, Building-up of control system, Summer-Winter Changeover, Dampers, freeze protection, sequencing of
operations, Temperature reset based on zone load.
BOOKS:
1. W.F. Stocker & J.w. Jones; Refrigeration & Air Conditioning, McGraw Hills Inc. Intl. Student’s Edition.
2. F.C. Quiston & Jerald J. Parker; HVAC Analysis & Design, John Wiley & Sons.
3. HVAC Systems & Equipment, 1992, ASHRAE Handbook.
4. HVAC Fundamentals, 1993, ASHRAE Handbook.
5. Carrier’s Handbook of A.C. System, Design, Carrier D/c Co.
6. C.P. Arora; Refrigeration and Air Conditioning, Tata McGraw Hill, New Delhi
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x x
3 x x x
4 x
5 x x
6 x x
2017-2018
DEPARTMENT OF PETRO CHEMICAL ENGINEERING
B. Tech. (for all branches)
Course Title Structure Property Relationship
Course Number : PK-428(E)
Credits : 4
Course Category : OE
Pre-requisite(s) : Nil
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
Build-up of fundamental understanding about the properties of polymer
Course Outcomes
1. Build-up of fundamental understanding about the properties of polymer such as (i). Mechanical properties
(ii). Rheological properties (iii). Thermal properties (iv). Chemical properties (v). Electrical properties of
polymers.
2. To develop the understanding about the relationship between the structure and properties of polymer. The
students are expected to understand the effect of various structural factors that affects the properties of
polymers.
3. At the of this course students will be equipped with knowledge to customize the properties of polymer as per
requirement by varying the structural factors.
4. The students will be equipped with knowledge to select the most appropriate polymeric material for a given
application.
Syllabus
Linear, branched, cross linked and other polymer structures, Homochain and heterochain polymers, random,
alternate, block and graft copolymers. Pressure volume temperature (PVT) relationship. Prediction of
polymer properties.
Mechanical and Rheological properties - Stress-strain relationship in polymer. Introduction to modulus,
tensile strength, yield strength, percentage elongation, toughness, creep, fatigue and stress relaxation. Effect
of additives on mechanical properties of polymers. Flow Behaviour of non – Newtonian fluids. Rheological
models like power law, truncated power law, Bird – Carreau model etc. Effect of structure on viscometeric
plot (shear rate vs. true viscosity). Introduction to Rheometers.
Thermal and Chemical Properties – Transition temperature in polymers, glass transition (Tg), melt transition
(Tm), relationship between Tg and Tm. Heat Deflection Temperature (HDT) and its significance. Thermal
characterization techniques like DSC, TGA, etc. Effect of polymer structure on thermal properties of
polymer. Cohesive energy, cohesive energy density, solubility parameter, Prediction of solubility parameter -
Effect of polymer structure on solubility of polymer. Influence of structure in prediction of flame retardancy,
water repellency.
Electrical properties - Effect of polymer structure on dielectric constant, power factor, dissipation factor, and
loss factor - effect of frequency of voltage and temperature on dielectric properties. Effect of additives on
electrical properties of polymers
Text Book(s)/ Reference Book(s)
1. Norbert M. Bikales, “Mechanical Properties of Polymers” Encyclopedia Reprints, Wiley Interscience, New
York , ISBN: 0-471-07234-6.
2. Johan J. Aklonis, William J. Macknights, M. Shen, “Introduction to Polymer Viscoelasticity” Wiley
Interscience, New York , ISBN: 0-471-01860-0.
3. W. Van Krevelen And P.J. Hoftyzen, "Properties Of Polymer , 3rd Edition Elsevier Scientific
PublishingCompany Amsterdam - Oxford - Newyork. 1990.
4. D.A. Seanor, ed., Electrical properties of polymers, Acadamic press, Newyork, 1982.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x
3 x x x
4 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title B.Tech. Project Part-I
Course Number : COC4980
Credits : 4
Course Category : DC
Pre-requisite(s) : COC2090
Contact Hours (L-T-P) : 0-0-8
Type of Course : Lab
Course Objectives
1. An opportunity to apply the acquired knowledge into practical.
2. Ability to get hands on experience and exposure.
3. Ability to acquire writing and presentation skills.
4. Ability for project planning and execution.
Course Outcomes
1. Implement innovative ideas.
2. Prepare good technical project reports.
3. Write technical papers for journals and conferences.
4. Work and show a good team spirit.
Syllabus:
Text Book(s)/ Reference Book(s)
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x x
2 x x x x x x
3 x x x
4 x x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Project
Course Number : COC4990
Credits : 6
Course Category : DC
Pre-requisite(s) : COC2090
Contact Hours (L-T-P) : 0-0-12
Type of Course : Lab
Course Objectives
1. An opportunity to apply the acquired knowledge into practical.
2. Ability to get hands on experience and exposure.
3. Ability to acquire writing and presentation skills.
4. Ability for project planning and execution.
Course Outcomes
1. Implement innovative ideas.
2. Prepare good technical project reports.
3. Write technical papers for journals and conferences.
4. Work and show a good team spirit.
Syllabus
Text Book(s)/ Reference Book(s)
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x x x
2 x x x x x x
3 x x x
4 x x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title ARTIFICIAL INTELLIGENCE AND NEURAL NETWORKS
Course Number : COE4300
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
Introduce students to artificial intelligence and neural network concepts and foster their abilities in designing and
implementing solutions for AI problems. Emphasis on intelligent systems - problem solving, logic, reasoning, decision
making, learning, and knowledge representation. The main goal is to achieve a thorough understanding of the
foundations of these paradigms, and also to experiment with their use and practical application in a number of
problems.
Course Outcome
Students will be able to:
1. Explain underlying AI concepts and its achievements.
2. Understand neural networks and its role in computation for target results and apply it for particular problem
like pattern classification and recognition problems.
3. Discuss problem solving methods and strategies.
4. Develop an ability to write programs for AI problem solutions.
5. Deal with prepositional and predicate logic.
6. Address the basic issues of knowledge representation. Extending it to the understanding of some of the more
advanced topics of AI such as learning, natural language processing, agents and expert systems, and planning.
Incorporation of all these techniques for extending the capabilities of the technologies to more effective and efficient
problem solving methodologies.
Syllabus
UNIT I INTRODUCTION TO ARTIFICIAL INTELLEGENCE
Introduction, Problem Solving, Problem definition as a State Space Search, Production Systems, Control
strategies, Heuristic Search, Basic problem solving method, Search strategies-BFS, DFS, Hill Climbing
etc., Problem Reduction, Mini-Max Search, Alpha-Beta Pruning.
UNIT II PREPOSITIONAL, PREDICATE LOGIC AND KNOWLEDGE REPRESENTATION
Preposition and Predicate Logic, Knowledge representation using predicate logic, Interpretation of
formula in predicate logic, Resolution Principle-conversion to Clausal form, Resolution in predicate
logic, Unification, Resolution Refutation System.
Structure representation of knowledge techniques, Introduction to expert Systems.
UNIT III FUNDAMENTALS OF ARTIFICIAL NEURAL NETWORK
Fundamentals of ANN, Artificial Neuron Vs Biological Neuron, Activation Function, Single layer
ANN, Multi-Layer ANN, Perceptrons, XOR problem.
UNIT IV AI APPLICATIONS AND BACKPROPAGATION
Study of AI Languages such as PROLOG and LISP to design and implement AI Techniques.
Backpropagation, Training Algorithms, Hopfield Networks, Applications-ALVINN, Pattern
Recognition, Handwritten Character Recognition, Travelling Salesman Problem.
Books:
*1. Elaine Rich and Kevin Knight ―Artificial Intelligence‖, Tata McGraw Hill
2. D.W. Patterson ―Artificial Intelligence and Expert Systems‖, PHI Ltd.
*3. N.K. Bose and P. Liang ―Neural Network Fundamentals with Graphs, Algorithms‖, Tata McGraw
Hill.
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x
3 x x
4 x x x
5 x x
6 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title INTERNET TOOLS
Course Number : COE4310
Credits : 4
Course Category : DE
Pre-requisites :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
1. Basic terminology and concepts of the World Wide Web.
2. Give a sound understanding of the impact the Internet has had on communication.
3. Topics include how to connect to the Internet, how to communicate with others, how to find and share
information productively
4. Introduces the Internet from a user's perspective, with emphasis on productive, professional access.
5. Access information on the Internet and search for, identify, download, decompress and view useful
information using web browsers, search engines, FTP, telnet and other internet tools.
6. Communicate with others asynchronously using electronic mail, attachments, newsgroups and in real time
using chat, talk, video conferencing and other software.
7. Introduction of JAVA, HTML and Databases.
Course Outcome
Students will be able to:
1. Use the Internet efficiently, productively and professionally.
2. Connect to the Internet, communicate with others, find and share information.
3. Install of INTERNET services, Netscape, Mosaic, create Mail boxes.
4. Use JAVA , HTML and Database to create basic web pages.
Syllabus
UNIT I. Retrieving Files Via E-mail: Archive Servers, FTP by Mail Services, E-mail, FTP, Basic Commands, Use
Net News.
Telnet Publishing Accessible Library Hytelnet. Database Directories. Databases and other Resources.
UNIT II. Internet: Origin, history, growth and significance, Basic operations on web surfing and downloading, Internet
Tools, Finger, Ping, Talk.
UNIT III. JAVA & HTML Language, Designing web pages, Electronic Journals. Clarinet News, BUNYIP information
Services Commercial Databases, On Line Services.
UNIT IV. Installation of INTERNET services, WWW browser like Netscape, Mosaic, e-mail installation including
creating Mail boxes, future trends.
Books :
*1. Comer, D: ―Internetworking with TCP/IP‖, PHI, 1997. Vol. I, II & III.
2. Breudans P.Kehoe: Zen and Art of Internet-A Beginner‘s Guide: PTR Prentice Hall (1994).
3. H.M. Deital: ―Java How to Program‖, McGraw Hill, 1998.
4. Rennie: CC: ―Mail Plain & Simple‖, Ist Ed., B.P.B., 1992.
* Text Book
Table: Mapping of Program Outcomes and Course Outcomes for CO-431
Course Outcomes Program Outcomes (POs)
a b c d e f g h I j k
1 x x
2 x x x
3 x x
4 x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Image Processing
Course Number : COE4320
Credits : 4
Course Category : DE
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
The primary objective of this course is to introduce basic principles of digital images, image data structures, and image
processing algorithms.
Course Outcomes
On completion of this course, the student will be able to:
1. Understand the basic fundamental of digital image processing
2. Cover the essential theory and algorithms that are usually used in image processing
3. Apply image processing techniques in both the spatial and frequency domains
4. Expose technologies and issues that are specific to image processing systems
5. Develop hands-on experience in using computers to process images
6. Write image processing programs in a high-level language such as C++, Java, Matlab
7. Perform image manipulations and analysis in many different fields
8. Develop significant thoughts about lacks of the modern in image processing
Syllabus
UNIT I FUNDAMENTAL OF IMAGE PROCESSING
Basic Image Models and Definitions, image perception, image representation, operations, perspective
transformation; Image Transformation: 2-D Fourier Transform and spectral analysis, Discrete Cosine
Transform, Discrete Wavelet Transform
UNIT II IMAGE ENHANCEMENT & COMPRESSION
Image enhancement: histogram processing, spatial-filtering, frequency-domain filtering; image restoration:
linear degradation model, inverse filtering, Wiener filtering; image compression: lossy and lossless
compression, entropy coding, transform coding, subband coding, image compression standards
UNIT III IMAGE SEGMENTATION, REPRESENTATION & ANALYSIS
Derivative of Gaussian, Line & Canny edge detection, Edge linking & boundary detection, Border Tracing,
Region based segmentation, , Image representation Schemes: AR, MA and ARMA representation, Image
decomposition, Feature extraction, Image texture analysis
UNIT IV ADVANCED TOPICS IN IMAGE PROCESSING
Morphological image processing: binary morphology- erosion, dilation, opening and closing operations,
applications; Basic gray-scale morphology operations; color models and color image processing, Case
Studies and experimentation
Text Book(s)/ Reference Book(s)
Books:
1. *Rafael C. Gonzalez and Richard E. Woods, ―Digital Image Processing‖, 3/E, Prentice Hall Publisher, 2008.
2. Maria Petrou and Costas Petrou, ―Image Processing The Fundamentals‖, Second Edition, John Wiley & Sons
Ltd, 2010.
3. Dwayne Philips, ―Image Processing in C‖, Second Edition, R & D Publication, Electronic Edition, 2000.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h I j k
1 x x x
2 x x x
3 x x
4 x x x
5 x x
6 x x x
7 x x x
8 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title INFORMATION TECHNOLOGY
Course Number : COE4360
Credits : 4
Course Category : DE
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
The objective of this course is to have students learn the importance of information system, information privacy and
security and also identify trends in the world of IT; Interacting with computer systems and cultivate skills in
development and implementation of information system.
Course Outcome
Students will be able to:
1. Define Information, its need and quality value.
2. Understand the basic concepts and technologies used in the field of information systems.
3. Describe how information technology is used in business and the trends of the technologies.
4. Use various input and output devices of computer systems.
5. Analyze performance of drives and its interface standards.
6. Do system analysis.
7. Explain the need of information security and various techniques for the same.
8. Use current techniques, skills and tools necessary for computing practice.
SYLLABUS:
UNIT I INTRODUCTION
Information concepts and processing, definition of Information, need of Information. Quality, value,
concept of Information, Categories and levels of information, Introduction to Information Technology,
Technological convergence, developments in Comp. & Communication technology. Practical uses of
communication & connectivity.
UNIT II INTERACTING WITH THE COMPUTER Standard methods of input, Alternative methods of input, Optical I/p devices, Output devices-Monitors,
Sound systems, Printers & Plotters, CPU's used in personal computers, Types of storage devices –
Magnetic & Optical storage devices. Measuring drive performance, drive interface standards.
UNIT III DESIGN AND ANALYSIS OF INFORMATION SYSTEM System planning, Approaches to system planning. Role of a system Analyst, File design – Type of file,
file structure & organization, structure method, design considerations, Management Information
Systems.
UNIT IV INTERNET
Principles of data security, Maintenance and troubleshooting, security concepts, security software,
Failure & recovery, security on the Internet or Network, Viruses & the Internet, Firewall, Web
Techniques: WAP, ASP, Sampling.
UNIT V APPLICATIONS OF INFORMATION TECHNOLOGY Introduction to information representation in digital Media, Graphics, Animation, audio, video,
Introduction to JPEG, MPEG, Office Automation, CAD, Business data processing, Scientific
computations, Application packages, Use of computers in Entertainment and Education, Multimedia,
Multilingual Applications, Railway Reservation Systems, E-Commerce, Major IT Projects in India, E-
governance, Nicnet, Ernet.
REFERENCE:
*1. Peter Norton's "Introduction to Computers.", Tata Mc Graw Hill 2001.
2. J. Kanter, "Management Information Systems", Prentice Hall, 1995.
3. Curtin, Foley, Sen, Morin "Information Technology – The breaking wave".
Tata Mc Graw Hill 1999.
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h I j k
1 x x
2 x x
3 x
4 x
5 x x
6 x
7 x
8 x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title ADVANCED MICROPROCESSOR SYSTEMS AND DESIGN
Course Number : COE4390
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
This course aims to develop background knowledge as well as core expertise in microprocessor and microcontroller.
Topics covered are 16 bit microprocessors, 32 bit microprocessors and some modern microprocessors.
Course Outcome
Students will be able to
1. Explain the concepts and basic architecture of 8086 family.
2. Understand the differences between 16 bit and 32 bit microprocessors.
3. Write assembly language program in 8086 for various application.
4. Explain the use of a memory hierarchy to reduce effective memory access times.
5. Discuss the problems of using caches in a multiprocessor environment, know the operation of several cache
coherency protocols and be able to predict the bus traffic given a sequence of CPU "memory" accesses.
6. Know about the different computer architectures SISD, MISD, SIMD, MIMD.
7. Design new microprocessor based systems.
Syllabus:
UNIT I 16 BIT MICROPROCESSOR
Introduction to 16 bit microprocessors-the 8086 family; 8086 architecture, instruction set, simple
programming examples, interrupts and interfacing; 8086 architecture, addressing modes, memory
management, protection mechanisms and interrupt handling.
UNIT II 32 BIT MICROPROCESSOR SYSTEMS
Introduction to 32 bit microprocessors, architectures-conventional, unconventional, memory and
storage devices; communications interfaces; software options and development systems,
applications.
UNIT III INTRODUCTION TO ARCHITECTURES
Conventional computer architectures-the Von Neumann architectures, alternative computer
architectures-Dataflow architectures, SIMD, MIMD, Classifications-control flow program
organization, Dataflow program organization, reduction program organization, Machine
organization-centralized, packet communication, expression manipulation, Multiprocessing systems;
systolic and wavefront arrays, pipelines, cache memory inter leaving, virtual memory management,
extended processing sets, reduced instruction set computers, High integrity processors, digital signal
processing chips-Harvard architecture, Hypercube architectures for supercomputers.
UNIT IV SURVEY OF ADVANCED MICROPROCESSORS
Survey of advanced microprocessors like MC68020, Z80000, Intel 80386, Inmos T414, Am29300,
NCR/32-000, Fairchild clipper and TMS 34010 Graphics system processor.
BOOKS:
*1. Yu-Ching liu and G.A. Gikson ―Microcomputer Systems; The 8086/8088 Family‖, Prentice
Hall,1994.
2. Ed. Titus and Laurson, ―16-bit Microprocessors‘, Howard & Co., 1995.
*3. A.P. Mathur, ―Introduction to Microprocessors‖ , McGraw Hill, 1996.
*Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x
3 x
4 x
5 x
6 x x x
7 x x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title PATTERN RECOGNITION AND COMPUTER VISION
Course Number : COE4410
Credits : 4
Course Category : DE (Departmental Elective)
Prerequisites :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
1. introduce basic concepts of Pattern recognition
2. present various feature extraction and classification methods
3. Illustrate the fundamental concepts, theories, and algorithms for pattern recognition and machine learning,
which are used in computer vision.
4. Illustrate different pre and post image processing Techniques and Transformations.
5. Introduction to Bayesian decision theory, Feed Forward Neural Nets and Recurrent Networks, nearest
neighbor indexing and hashing and some transformation techniques.
Course Outcome
Students will be able to:
1. Explain basic theories and techniques in computer vision and pattern recognition
2. Identify various approaches of computer vision and pattern recognition and design the components of the
systems for computer vision and pattern recognition
3. Describe and discuss the basic functions and methods for image processing.
4. Design simple systems for computer vision and pattern recognition which can handle certain problem.
5. Gain skills in evaluating, experimenting with, and optimizing the performance of the systems for computer
vision and pattern recognition
Syllabus
UNIT I. Introduction to Pattern Recognition and concept learning from examples, Features, Feature spaces, Pattern
classes / concepts, Decision Regions and decision boundaries, Bay‘s decision theory.
UNIT II. Maximum likelihood estimation, Supervised learning in Feed Forward Neural Nets and Recurrent Networks
Unsupervised learning – Self – organizing feature extraction. Adaptation rename theory, Theory of feature
mapping, Application to character and image pattern recognition.
UNIT III. Image formation and image acquisition, Edge deletion, Image segmentation and feature extraction, Hough
transform, Reflections map, Photometric stereo, shape for shading, Extended Gaussian image, Shape from
contours, Stereo vision – Imaging geometries, Camera calibration, matching and interpolation Range image
analysis techniques.
UNIT IV. Motion field and Optical Flow, Structure from motion, Image sequence analysis, Shape descriptions and
recognition of 2 – D and 3 – D objects, Applications – Inspection systems, Document image understanding.
BOOKS:
*1 T. Mitchall, ―machine Learning‖, Tata McGraw Hill, 1997.
2 Fukunaga K. ―Introduction to Statistical Pattern Recognition‖, (2nd
edition), Academic Press, Boston,
1990.
* Text Book
Table: Mapping of Program Outcomes and Course Outcomes for CO-441
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x x
3 x x
4 x x x x
5 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title VLSI DESIGN TOOLS & TECHNIQUES
Course Number : COE4420
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) : Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
This course is designed to teach students the theory of VLSI, the logic and the implementation of modules required for
digital systems. The course will also discuss the industry specifications for the digital integrated circuits and using it
for building digital systems. It includes the description and the structure of various fundamental components of digital
systems like logic gates, memory cells, interfacing units etc.
Course Outcome
Upon successful completion of this course, students should be able to:
1. Understand the functionality of logic gates and simplifying digital circuits.
2. Explain the structure and fundamental components of VLSI design.
3. Demonstrate a clear understanding of important concepts in Logic Gate Design, Combinational Logic
Network, Layout Design Methods, and Standard Cell Layout Design.
4. Design an IC of any given arbitrary logic function at the transistor-level.
5. Design and explain of different types of digital component: Adder, Multiplier etc.
6. Describe the fundamental architecture of physical design portioning system level, board level and chip level.
Syllabus
UNIT I Introduction to VLSI Design; ― Design Abstraction, Design Hierarchy, Design Flow, Tools foe VLSI
Design, Introduction to VLSI Technology, Layout Design Rules, Stick Diagram, Transistor
Parasitic, Wires and Vias‖.
UNIT II Logic Gate Design, Combinational Logic Network, Layout Design Methods, Standard Cell Layout
Design, Combinational network Delays, Power Optimization, Sequential machines, Sequential
system and Clocking Disciplines, Sequential System Design, design Validation.
UNIT III Subsystem Design, Adder, Multiplier, Graph Algorithms for Physical Design – Classes of Graph in
Physical Design, Graph Problems in Physical Design, Algorithm For interval Graphs.
UNIT IV Physical Design – Partitioning- System level, board level and chip level Partitioning Floorplanning
Methods, Block Placement, Routing- Global Routing and Detailed Routing.
BOOKS:
*1. Wayne Wolf, Modern VLSI Design System on Silicon, Second edition ―PHI‖.
2. N Sherwani Algorithm for VLSI Design Automation ―Springer‖.
3. Sabih H Gerez, Algorithm for VLSI Design Automation ―J Wiley‖.
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x x
3 x x
4 x x
5 x x x
6 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title NETWORK SECURITY
Course Number : COE4450
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
To develop an understanding of information assurance as practiced in computer operating systems, distributed
systems, networks and representative applications. Develop a basic understanding of cryptography, how it has
evolved, and some key encryption techniques used today. Develop an understanding of security policies (such as
authentication, integrity and confidentiality), as well as protocols to implement such policies in the form of message
exchanges.
Course Outcome
After completion of this course, the student shall be able to:
1. Describe computer and network security fundamental concepts and principles.
2. Describe the inner-workings of popular encryption algorithms, digital signatures, certificates and anti-
cracking techniques.
3. Demonstrate the ability to select among available network security technology and protocols such as IDS,
IPS, firewalls, VPNs etc.
4. Describe Operating system security models E.g. UNIX, LINUX WINDOWS security and methods for web
application and database security.
5. Identify ethical, professional responsibilities, risks and liabilities in computer and network environment, and
best practices to write a security policy.
Syllabus
UNIT I CONVENTIONAL ENCRYPTION:
Conventional Encryption: Classical and Modern Techniques, DES, AES, Contemporary Symmetric
Ciphers, Public-Key Cryptography RSA, Key Management Deffie-Hellman Key exchange algorithm.
UNIT II PUBLIC-KEY ENCRYPTION & HASH FUNCTIONS:
Elliptic Curve Cryptography, Message Authentication and Hash Functions, Security of hash functions,
Digital Signatures.
UNIT III NETWORK SECURITY FOUNDATIONS:
Network Security overview, Security Methodology, Risk Analysis, Defense models: Lollipop, Onion
Model, Sample Security Policy Topics, Security Organization, Security Audit, Physical Security,
Authentication and authorization Controls.
UNIT IV NETWORK ARCHITECTURE AND OPERATING SYSTEM SECURITY:
Network Design Consideration: Design, performance, Availability, Network Device security, Firewalls,
VPN, Wireless network security, IDS, Network role based security: E-mail, DNS etc. Operating system
security models, CASE: UNIX, LINUX WINDOWS security. Web Application security, Regular
Application security, writing secure software, Database security.
Books
Stallings, W. Cryptography and Network Security, Principles and Practice, 3rd
edition, Prentice Hall, 2002.
Network Security The Complete Reference, TATA McGraw Hill Publication., 2004
Tanenbaum, A.S., Computer Networks, 4th
edition, prentice Hall
Stinson, D., Cryptography. Theory and practice, 2nd
edition, CRC Press
Network Security Private Communication in Public World, C. Kaufman, R. Perlman, M. Spicier, 2nd
edition PHI.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x x
3 x
4 x x
5 x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title INTERNET PROTOCOLS
Course Number : COE4490
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisites : CO-313
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
1. To learn how the Internet is structured into layers and the various protocols at each layer with emphasis on
the transport and application layers.
2. To explores the development of TCP/IP applications and their associated protocols. It utilizes hands-on
programming and makes use of network monitoring tools. It includes detailed coverage of TCP, UDP, HTTP,
FTP, and SMTP protocols.
3. To master the development of client-server Internet applications using the sockets and other higher-level
APIs.
Course Outcome
Students will be able to:
1. Demonstrate understanding of the TCP/IP model and relevant protocols in each layer.
2. Describe the IP addressing, Internet domain names and recognize the role of the DNS servers.
3. Explain the operation and related issues of various common Internet applications and protocols including:
HTTP, SMTP, POP, FTP, Telnet, IGMP, etc.
4. Identify and apply various socket programming concepts and mechanisms.
5. Use effectively the socket interface to develop Client-Server Internet applications.
6. Practice software engineering principles and methods in building network-aware applications.
Syllabus
UNIT-I INTRODUCTION
Internet Architecture, Addresses IPV4 & IPV6,IP, BOOTP,ICMP
UNIT-II TCP & UDP
TCP: Connections, Flow Control, Segment Format, Retransmission, TCP state
machine, Other features
UDP: Format checksum computation, UDP multiplexing and other features
UNIT-III MAJOR PROTOCOLS
GGP EGP, RIP, OSPF, HELLO, IGMP , SNMP, Telnet DHCP, WAP
UNIT-IV SOCKET PROGRAMMING AND APPLICATIONS.
Internet programming.
Unix System Calls.
Socket Programming, Introduction to Web server & search engine.
Introduction to Internet Languages like Java & HTML.
Books:
1. Internetworking with TCP/IP (Vol. I) by Douglas E. Comer PHI
2. Computer Networks by A. S. Tannenbaum PHI
3. Unix Network Programming by W.R. Stevens. PHI
4. TCP/IP Protocol Suite by Forouzan B. A TMH
Table: Mapping of Program Outcomes and Course Outcomes for CO-449
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x
2 x
3 x
4 x x x
5 x x x
6 x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Multimedia Technologies
Course Number : COE4500
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objectives
The primary objective of this course is to introduce basic principles of multimedia, image data structures, and
multimedia technologies.
Course Outcomes
On completion of this course, the student will be able to:
1. Understand the basic fundamental of multimedia
2. Cover the essential theory and algorithms that are usually used in multimedia
3. Apply multimedia techniques
4. Expose technologies and issues that are specific to multimedia
5. Develop hands-on experience in using computers to process images
6. Perform audio and video compression
7. Develop significant thoughts about lacks of the modern in streaming multimedia
Syllabus
UNIT I INTRODUCTORY CONCEPTS
Definition of ‗multimedia‘, Multimedia systems, and components, Multimedia applications, Digitization
principles for text, images, audio and video, Basic compression principles, Text compression, Repetition
suppression, Statistical Encoding Dictionary Modeling, Image formats & representation schemes, colour
schemes, Image compression principal
UNIT III AUDIO COMPRESSION
Audio compression techniques, Sub-band coding, DPCM, Adaptive Sub-Band Coding, Predictive
Coding, CELP Coding Perceptual Coding, Voice Recognition , Types of voice recognition systems,
Voice recognition performance
UNIT IV VIDEO COMPRESSION
Fundamentals of video compression, temporal redundancy, spatial redundancy, Frame Types, Motion
estimation and compensation, Overview of some video coding standards
UNIT V STREAMING MULTIMEDIA
Principles of streaming multimedia, Scalability, Streaming Servers, Streaming Protocols, QoS
parameters, Timing relationships in networked multimedia, transcoders
BOOKS
*1. ―Multimedia Communications-Applications, Networks, Protocols & Standards‖, Fred Halsall, Pearson
Education.
2. Introduction to Data Compression, Khalid Sayood, Elsevier, 2nd
Edition, 2005
3. Information Theory Coding and Cryptography, Ranjan Bose, Tata McGraw-Hill, 3rd
Reprint, 2004.
3. Fundamentals of Multimedia, Ze-Nain Li, Mark S. Drew, Pearson Eductation, Indian Reprint, 2005.
4. Principles of Multimedia, Ranjan parekh, Tata McGraw-Hill, 1st Reprint, 2006.
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x
2 x x x
3 x x
4 x x x
5 x x
6 x x x
7 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title ARTIFICIAL INTELLIGENCE & SOFT COMPUTING
Course Number : COE4530
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) :
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
Introduce students to artificial intelligence and soft computing concepts and techniques and foster their abilities in
designing and implementing solutions for real-world problems. Emphasis on intelligent systems - problem solving,
reasoning, decision making, learning, logical foundation. The main goal is to achieve a thorough understanding of the
foundations of these paradigms, and also to experiment with their use and practical application in a number of
problems.
Course Outcome
Students will be able to:
1. Explain underlying AI concepts and its achievements.
2. Develop an ability to write programs for AI problem solutions.
3. Address the basic issues of knowledge representation Extending it to the understanding of some of the more
advanced topics of AI such as learning, natural language processing, agents and expert systems, and planning.
4. Describe soft computing techniques and their roles in making intelligent machines and applying it for a
particular problem.
5. Define fuzzy logic and reasoning to handle uncertainty.
6. Apply genetic algorithms to combinatorial optimization problems.
7. Understand neural networks concepts and apply for pattern classification and regression problems.
Syllabus
UNIT I INTRODUCTION TO ARTIFICIAL INTELLEGENCE
Introduction, Problem Solving, Problem definition as a State Space Search, Production Systems,
Heuristic Search, Search strategies-BFS, DFS etc., Mini-Max Search, Alpha-Beta Pruning.
UNIT II KNOWLEDGE PRESENTATION AND EXPERT SYSTEMS
Preposition and Predicate Logic, Knowledge representation using predicate logic, Interpretation of
formula in predicate logic, Resolution Principle, Resolution in predicate logic, Unification, Structured
Knowledge representation, Introduction to expert System, Intelligence Agents
UNIT III SOFT COMPUTING AND ARTIFICIAL NEURAL NETWORK
Soft Computing Techniques-an Overview, Fuzzy Sets and Fuzzy Logic: Basic Definitions and
Terminology, Fuzzy Decision Making, Rough Sets, Applications in Knowledge Discovery.
Fundamentals of ANN, Neuron Networks Architecture, Perceptrons, Backpropagation, Self Organizing
Maps (SOM), Applications in Image Processing.
UNIT IV EVOLUTIONARY COMPUTATION
Introduction, Evolution Techniques-Inherent Features, Genetic Algorithms Evolutionary Programming,
Swarm Intelligence, Applications in Optimization Problems.
Books:
1. Elaine Rich and Kevin Knight ―Artificial Intelligence‖, Tata McGraw Hill
2. Neural Networks, Fuzzy Logic and Genetic Algorithms: Synthesis and Applications, S. Rajasekaran
and G.A. Vijayalakshmi pai, Prentic Hall India
3. D.W. Patterson ―Artificial Intelligence and Expert Systems‖, PHI Ltd.
* Text Book
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x
2 x x
3 x x x
4 x x
5 x x
6 x x
7 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Software Testing
Course Number : COE4540
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) : Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
Course Outcome
On successful completion of this course, students will be able to:
1. Characterise real-time systems and describe their functions 2. Understand Real Time System requirement, design, and performance analysis
3. Apply formal methods to the analysis and design of real-time systems
Syllabus
Unit 1: Introduction to real time system, Issues in real-time computing. A basic model of a Real-Time
system. Types of Real Time Systems. Timing Constraints. Classification of Timing Constraints. Modeling
Timing Constraints. Hard and soft real time systems.
Unit 2: Real-Time Task Scheduling. Types of Real-Time tasks and their characteristics. Different Task
Scheduling algorithms
Unit3: Handling Resource sharing and dependencies among real-time tasks. Features of Real-Time
Operating Systems. Real-Time Communications. Real-Time Databases..
Unit 4: Computer Controlled Systems. Real-Time Control. Discrete PID Controller. Fuzzy Controller. Real-
Time modeling and case studies.
BOOKS:
References
1.R.Mall, Real Time Systems: Theory and Practice, Pearson Education,2007.
2.C.M.Krishna and K.G.Shin, Real Time Systems, Tata McGraw Hill,2010.
3.Jane Liu, Real Time Systems, Pearson Education, 2000
2017-2018
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Big Data Analytics
Course Number : COE4560
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) : Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective The purpose of this course is to introduce the students with big data storage systems and important
algorithms that form the basis of big data processing. The course also introduces the students with major application
areas of big data analytics.
Course Outcome On successful completion of this course, students will be able to:
1. Understand the concept and challenges of big data
2. Explain the basics of big data storage systems
3. Explain the various algorithms used for big data processing.
4. Describe and use the large-scale analytics tools available to solve big data problems
5. Describe the major application areas of big data.
Syllabus
Unit 1: Introduction to big data: introduction to big data, the four dimensions of big data,:- volume, velocity, variety,
veracity, drivers for big data, introducing the storage, query stack, revisit useful technologies and concepts, real-time
big data analytics
Unit 2: Distributed file systems: Hadoop Distributed File System, Google File System, Data Consistency, Distributed
Hash-table, Key-value Storage Model, Document Storage Model, Graph Storage Models
Unit3: Scalable algorithms:- Mining large graphs, with focus on social networks and web graphs, Centrality,
similarity, all-distance sketches, community detection, link analysis, spectral techniques. Map-reduce, Pig Latin, and
NoSQL, Algorithms for detecting similar items. Recommendation systems, Data stream analysis algorithms,
Clustering algorithms, Detecting frequent items.
Unit 4: Big Data Applications/ Issues: Advertising on the web, web page quality ranking, mining social-networking
group, human interaction with big-data. Privacy, Visualization, Compliance and Security, Structured vs Unstructured
Data.
BOOKS:
1. Mining of massive datasets, Anand Rajaraman, Jure Leskovec and Jeffrey Ullman, 2014.
2 An introduction to information retrieval, Christopher D. Manning, Prabhakar Rahgavan, Hinrich Schutze,
2009
3 Data-Intensive Text Processing with MapReduce, Jimmy Lin and Chris Dyer, 2010.
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Cloud Computing
Course Number : COE4580
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) : Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective This course will cover the study of various algorithms involved in better implementing the
cloud-based systems starting through fundamentals of deployment.
Course Outcome On successful completion of this course, students will be able to:
1. Learn algorithms involved in better implementing the cloud-based systems.
2. Learn the fundamentals of deployment in cloud computing.
3. Be able to develop application in cloud environment.
Syllabus
Unit 1: Introduction: Distributed Computing and Enabling Technologies, Cloud Fundamentals: Cloud
Definition, Evolution, Architecture, Applications, deployment models, and service models.
Unit 2: Virtualization: Issues with virtualization, virtualization technologies and architectures, Internals of
virtual machine monitors/hypervisors, virtualization of data centers, and Issues with Multi-tenancy.
Unit3: Interoperability and Service Monitoring: Issues with interoperability, Vendor lock-in, Interoperability
approaches. SLA Management, Metering Issues, and Report generation. Resource Management and
Load Balancing: Distributed Management of Virtual Infrastructures, Server consolidation, Dynamic
provisioning and resource management, Resource Optimization, Resource dynamic reconfiguration,
Scheduling Techniques for Advance Reservation, Capacity Management to meet
Unit 4: Migration and Fault Tolerance: Broad Aspects of Migration into Cloud, Migration of virtual Machines
and techniques. Fault Tolerance Mechanisms, Security, Advances: Grid of Clouds, Green Cloud, Mobile
Cloud Computing.
BOOKS:
1. Cloud Computing Principles and Paradigms, Rajkumar Buyya, James Broberg, Andrzej
Goscinski, Wiley Publishers, 2011.
2. Cloud Computing Bible, Barrie Sosinsky, Wiley Publishers, 2010.
3. Mastering Cloud computing, Rajkumar Buyya, Christian Vacchiola, S Thamarai Selvi, McGraw
Hill, 2013.
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Principles of Cyber Physical Systems
Course Number : COE4600
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) : CO – 309
Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective This course aims to develop an understanding of the underlying principles behind integration of
computation (software), networking, and physical processes to design useful engineering systems. It primarily deals
with effective orchestration of software and physical processes.
Course Outcome On successful completion of this course, students will be able to:
1. Understand the significance of the integration of computation with the physical process.
2. Build high confidence systems with real-time and concurrent behaviors.
3. Analyze computational systems that interact with physical processes.
4. Design useful applications of cyber physical systems.
Syllabus
Unit 1: Foundations of Cyber Physical Systems, Modeling Dynamic Behaviours, Continuous Dynamics:
Properties of Systems, Feedback Control, Discrete Dynamics: The notion of state, Finite-State
Machines, Extended State Machines, Hybrid Systems, Composition of State Machine, Concurrent
Models of Computation.
Unit 2: Models of sensors and actuators, Common Sensors, actuators, Embedded Processors, Types of
Processor, Parallelism, Memory Technologies,
Unit 3: Input and Output, Real-Time Task Scheduling. Types of Real-Time tasks and their characteristics.
Multitasking, Different Task Scheduling algorithms
Unit 4: Analysis and verification: Invariants and temporal logic, Equivalence and refinement, reachability
analysis and model checking, Quantitative analysis, Security and Privacy, applications of Cyber
Physical Systems
BOOKS:
1. E. A. Lee and S. A. Seshia, Introduction to Embedded Systems - A Cyber-Physical Systems Approach,
Second Edition, MIT Press, 2017.
2. R.Mall, Real Time Systems: Theory and Practice, Pearson Education,2007.
3. Hermann Kopetz and Gunther Bauer, The Time-Triggered Architecture, Proceedings of the IEEE 91(1):
112 - 126, 2013.
4. Edward A. Lee. Cyber-Physical Systems: Design Challenges. IRORC 2008.
Course Outcomes Program Outcomes (POs)
a b c d e f g h i j k
1 x x x x
2 x x x
3 x x x
4 x x x
2017-2018
DEPARTMENT OF COMPUTER ENGINEERING
B. Tech.
Course Title Principles of Machine Learning
Course Number : COE4610
Credits : 4
Course Category : DE (Departmental Elective)
Pre-requisite(s) : AM – 261, AM – 262 Contact Hours (L-T-P) : 3-1-0
Type of Course : Theory
Course Objective
The objective of this course is to introduce concepts, techniques, and algorithms in machine learning. The course will
give the student the basic ideas and intuition behind modern machine learning methods as well as formal
understanding of how, why, and when they work
Course Outcome At the end of this course, the student can be expected to:
1. Define what is machine learning and its application.
2. Comprehend various supervised learning algorithms and be able to select feature sets and detect anomalies in
the algorithm. 3. Explain unsupervised learning algorithms and reinforcement learning techniques. 4. Be familiar with various advance topics of machine learning and their case studies.
Syllabus
UNIT 1: INTRODUCTION
Introduction to Machine Learning, Application, Recent Development, Classification of Machine
learning algorithms
UNIT 2: SUPERVISED LEARNING
Supervised learning, Linear and Logistic regression, Neural Network, Back Propagation Algorithm,
Generative learning algorithms, Gaussian discriminant analysis, Naive Bayes, Support vector
machines, Model selection and feature selection, Ensemble methods: Bagging, boosting, Evaluating and
debugging learning algorithms.
UNIT 3: UNSUPERVISED LEARNING & REINFORCEMENT LEARNING
Clustering, K-means, Mixture of Gaussians, Factor analysis, PCA (Principal components analysis), ICA
(Independent components analysis), Markov Decision Process, Value iteration and policy iteration,
Linear quadratic regulation (LQR), Q-learning, Value function approximation, Policy search.
UNIT 4: ADVANCE TOPICS
Introduction to Deep learning, Graphical Model, Case Studies-Application to Computer Vision, Big
Data
BOOKS:
2. Machine Learning: A Probabilistic Perspective. Kevin Murphy. MIT Press, 2012.
3. Pattern Recognition and Machine Learning. Christopher Bishop. First Edition, Springer, 2006.
4. Pattern Classification. Richard Duda, Peter Hart and David Stock. Second Edition, Wiley-Interscience, 2000.
5. Machine Learning. Tom Mitchell. First Edition, McGraw-Hill, 1997
Recommended