DR. A.P.J.

ABDUL KALAM TECHNICAL

UNIVERSITY, LUCKNOW

Evaluation Scheme & Syllabus for

B. Tech.
(All Branches except Agriculture & Bio Tech)

AS PER
AICTE MODEL CURRICULUM

(Effective from the Session: 2018-19)

 B. Tech 1st Year (All branches except Bio Technology and Agriculture
Engg.) Structure in accordance with AICTE Model Curriculum
Effective w.e.f. Academic Session 2018-19
SEMESTER - I

Sl. Code SUBJECT PERIODS EVALUATION END TOTA CREDI

No SCHEME SEMESTE L T
. R
Tota P
L T P CT TA l S TE PE
3 WEEKS COMPULSORY INDUCTION PROGRAM
1 KAS101/
KAS102 Physics/Chemistry 3 1 3 30 20 50 25 100 25 200 5.5
2 KAS103 Mathematics-I 3 1 0 30 20 50 - 100 - 150 4
3 Basic Electrical
KEE 101/ Engineering/Programming
KCS101 for Problem Solving 3 1 2 30 20 50 25 100 25 200 5
4
KCE101/ Engineering Graphics &
KWS101 Design/Workshop Practices 1 0 4 - - - 25 - 25 50 3
MOOCs (For B.Tech. Hons. Degree)* 0
TOTAL 600 17.5

SEMESTER II
Sl. Code SUBJECT PERIODS EVALUATION END TOTAL CREDIT
No. SCHEME SEMESTER
L T P CT TA Total PS TE PE
1 KAS201/
KAS202 Physics/Chemistry 3 1 3 30 20 50 25 100 25 200 5.5
2 KAS203 Mathematics II 3 1 0 30 20 50 - 100 - 150 4
3 Basic Electrical
KEE201/ Engineering/Programming
KCS201 for Problem Solving 3 1 2 30 20 50 25 100 25 200 5
4 Engineering Graphics &
KCE201/ Design/Workshop
KWS201 Practices 1 0 4 - - - 25 - 25 50 3
5 KAS204 Professional English 2 0 2 30 20 50 - 100 - 150 3
MOOCs (For B.Tech. Hons. Degree)* 0
TOTAL 750 20.5
Mini Project or Internship (3-4 weeks) shall be conducted during summer break after II semester and will be
assessed during III semester

* List of MOOCs (NPTL) Based Recommended Courses for first year B. Tech Students
1. Developing Soft Skills and personality-Odd Semester-8 Weeks-3 Credits
2. Enhancing Soft Skills and personality-Even Semester-8 Weeks-3 Credits
* AICTE Guidelines in Model Curriculum:
After successful completion of 160 credits, a student shall be eligible to get Under Graduate degree in Engineering. A
student will be eligible to get Under Graduate degree with Honours only, if he/she completes additional university
recommended courses only (Equivalent to 20 credits; NPTEL Courses of 4 Weeks, 8 Weeks and 12 Weeks shall be of 2,
3 and 4 Credits respectively) through MOOCs. For registration to MOOCs Courses, the students shall follow NPTEL
Site http://nptel.ac.in/ as per the NPTEL policy and norms. The students can register for these courses through NPTEL
directly as per the course offering in Odd/Even Semesters at NPTEL. These NPTEL courses (recommended by the
University) may be cleared during the B. Tech degree program (not necessary one course in each semester). After
successful completion of these MooCs courses the students, shall, provide their successful completion NPTEL
status/certificates to the University (COE) through their college of study only. The student shall be awarded Hons.
Degree (on successful completion of MOOCS based 20 credit) only if he/she secures 7.50 or above CGPA and passed
each subject of that Degree Programme in single attempt without any grace marks.
 SEMESTER – I

A Guide to Induction Program

1 Introduction
(Induction Program was discussed and approved for all colleges by AICTE in March
2017. It was discussed and accepted by the Council of IITs for all IITs in August 2016. It
was originally proposed by a Committee of IIT Directors and accepted at the meeting of all
IIT Directors in March 2016.1 This guide has been prepared based on the Report of the
Committee of IIT Directors and the experience gained through its pilot implementation in
July 2016 as accepted by the Council of IITs. Purpose of this document is to help
institutions in understanding the spirit of the accepted Induction Program and
implementing it.)

Engineering colleges were established to train graduates well in the

branch/department of admission, have a holistic outlook, and have a desire to
work for national needs and beyond. The graduating student must have
knowledge and skills in the area of his study. However, he must also have broad
understanding of society and relationships. Character needs to be nurtured as an
essential quality by which he would understand and fulfill his responsibility as an
engineer, a citizen and a human being. Besides the above, several meta-skills and
underlying values are needed.

There is a mad rush for engineering today, without the student determining for
himself his interests and his goals. This is a major factor in the current state of
demotivation towards studies that exists among UG students. The success of
gaining admission into a desired institution but failure in getting the desired
branch, with peer pressure generating its own problems, leads to a peer
environment that is demotivating and corrosive. Start of hostel life without close
parental supervision at the same time, further worsens it with also a poor daily
routine.

To come out of this situation, a multi-pronged approach is needed. One will

have to work closely with the newly joined students in making them feel
comfortable, allow them to explore their academic interests and activities, reduce
competition and make them

A Committee of IIT Directors was setup in the 152nd Meeting of IIT Directors on
6th September 2015 at IIT Patna, on how to motivate undergraduate students at
IITs towards studies, and to develop verbal ability. The Committee submitted its
report on 19th January 2016. It was considered at the 153 rd Meeting of all IIT
Directors at IIT Mandi on 26 March 2016, and the accepted report came out on 31
March 2016. The Induction Program was an important recommendation, and its
pilot was implemented by three IITs, namely, IIT(BHU), IIT Mandi and IIT Patna
in July 2016. At the 50th meeting of the Council of IITs on 23 August 2016,
recommendation on the Induction Program and the report of its pilot
implementation were discussed and the program was accepted for all IITs, work
for excellence, promote bonding within them, build relations between teachers
and students, give a broader view of life, and build character.

2. Induction Program
When new students enter an institution, they come with diverse thoughts,
backgrounds and preparations. It is important to help them adjust to the new
environment and inculcate in them the ethos of the institution with a sense of
larger purpose. Precious little is done by most of the institutions, except for an
orientation program lasting a couple of days.

We propose a 3-week long induction program for the UG students entering the
institution, right at the start. Normal classes start only after the induction program
is over. Its purpose is to make the students feel comfortable in their new
environment, open them up, set a healthy daily routine, create bonding in the
batch as well as between faculty and students, develop awareness, sensitivity and
understanding of the self, people around them, society at large, and nature.2

The time during the Induction Program is also used to rectify some critical
lacunas, for example, English background, for those students who have deficiency
in it. The following are the activities under the induction program in which the
student would be fully engaged throughout the day for the entire duration of the
program.
2Induction Program as described here borrows from three programs running
earlier at different institutions: (1) Foundation Program running at IIT
Gandhinagar since July 2011, (2) Human Values course running at IIIT Hyderabad
since July 2005, and (3) Counselling Service or mentorship running at several IITs
for many decades. Contribution of each one is described next.

1. IIT Gandhinagar was the first IIT to recognize and implement a special 5-week
Foundation Program for the incoming 1st year UG students. It took a bold step
that the normal classes would start only after the five week period. It involved
activities such as games, art, etc., and also science and other creative
workshops and lectures by resource persons from outside.

2. IIIT Hyderabad was the first one to implement a compulsory course on Human
Values. Under it, classes were held by faculty through discussions in small
groups of students, rather than in lecture mode. Moreover, faculty from all
departments got involved in conducting the group discussions under the
 course. The content is non-sectarian, and the mode is dialogical rather than
sermonising or lecturing. Faculty were trained beforehand, to conduct these
discussions and to guide students on issues of life.

3. Counselling at some of the IITs involves setting up mentor-mentee network

under which 1st year students would be divided into small groups, each
assigned a senior student as a student guide, and a faculty member as a
mentor. Thus, a new student gets connected to a faculty member as well as a
senior student, to whom he/she could go to in case of any difficulty whether
psychological, financial, academic, or otherwise.

The Induction Program defined here amalgamates all the three into an
integrated whole, which leads to its high effectiveness in terms of building
physical activity, creativity, bonding, and character. It develops sensitivity
towards self and one‟s relationships, builds awareness about others and society
beyond the individual, and also in bonding with their own batch-mates and a
senior student besides a faculty member.

Scaling up the above amalgamation to an intake batch of 1000 plus students

was done at IIT(BHU), Varanasi starting from July 2016.

2.1 Physical Activity

This would involve a daily routine of physical activity with games and sports. It
would start with all students coming to the field at 6 am for light physical exercise
or yoga. There would also be games in the evening or at other suitable times
according to the local climate. These would help develop team work. Each student
should pick one game and learn it for three weeks. There could also be gardening
or other suitably designed activity where labour yields fruits from nature.

2.2 Creative Arts

Every student would choose one skill related to the arts whether visual arts or
performing arts. Examples are painting, sculpture, pottery, music, dance etc. The
student would pursue it every day for the duration of the program.

These would allow for creative expression. It would develop a sense of

aesthetics and also enhance creativity which would, hopefully, flow into
engineering design later.

2.3 Universal Human Values

It gets the student to explore oneself and allows one to experience the joy of
learning, stand up to peer pressure, take decisions with courage, be aware of
relationships with colleagues and supporting staff in the hostel and department,
be sensitive to others, etc. Need for character building has been underlined earlier.
A module in Universal Human Values provides the base.

Methodology of teaching this content is extremely important. It must not be

through do‟s and dont‟s, but get students to explore and think by engaging them
in a dialogue. It is best taught through group discussions and real life activities
rather than lecturing. The role of group discussions, however, with clarity of
thought of the teachers cannot be over emphasized. It is essential for giving
exposure, guiding thoughts, and realizing values.

The teachers must come from all the departments rather than only one
department like HSS or from outside of the Institute. Experiments in this direction
at IIT(BHU) are noteworthy and one can learn from them.3

Discussions would be conducted in small groups of about 20 students with a

faculty mentor each. It is to open thinking towards the self. Universal Human
Values discussions could even continue for rest of the semester as a normal
course, and not stop with the induction program.

Besides drawing the attention of the student to larger issues of life, it would build
relationships between teachers and students which last for their entire 4-year stay
and possibly beyond.

The Universal Human Values Course is a result of a long series of experiments at

educational institutes starting from IIT-Delhi and IIT Kanpur in the 1980s and
1990s as an elective course, NIT Raipur in late 1990s as a compulsory one-week off
campus program. The courses at IIT(BHU) which started from July 2014, are taken
and developed from two compulsory courses at IIIT Hyderabad first introduced
in July 2005.

2.4 Literary
Literary activity would encompass reading, writing and possibly, debating,
enacting a play etc.

2.5 Proficiency Modules

This period can be used to overcome some critical lacunas that students might
have,
for example, English, computer familiarity etc. These should run like crash
courses, so that when normal courses start after the induction program, the
student has overcome the lacunas substantially. We hope that problems arising
due to lack of English skills, wherein students start lagging behind or failing in
several subjects, for no fault of theirs, would, hopefully, become a thing of the
past.
2.6 Lectures by Eminent People
This period can be utilized for lectures by eminent people, say, once a week. It
would give the students exposure to people who are socially active or in public
life.

2.7 Visits to Local Area

A couple of visits to the landmarks of the city, or a hospital or orphanage could be
organized. This would familiarize them with the area as well as expose them to
the under privileged.

2.8 Familiarization to Dept./Branch & Innovations

The students should be told about different method of study compared to
coaching that is needed at IITs. They should be told about what getting into a
branch or department means what role it plays in society, through its technology.
They should also be shown the laboratories, workshops & other facilities.

3 Schedule
The activities during the Induction Program would have an Initial Phase, a
Regular Phase and a Closing Phase. The Initial and Closing Phases would be two
days each.

3.1 Initial Phase

Time Activity
Day 0
Whole day Students arrive - Hostel allotment. (Preferably do pre
allotment)
Day 1
09:00 am - 03:00 pm Academic registration
04:30 pm - 06:00 pm Orientation
Day 2
09:00 am - 10:00 am Diagnostic test (for English etc.)
10:15 am - 12:25 pm Visit to respective depts.
12:30 pm - 01:55 pm Lunch
02:00 pm - 02:55 pm Director‟s address
03:00 pm - 05:00 pm Interaction with parents
03:30 pm - 05:00 pm Mentor-mentee groups - Introduction within group.
(Same as Universal Human Values groups)

3.2 Regular Phase

After two days is the start of the Regular Phase of induction. With this phase there
would be regular program to be followed every day.
3.2.1 Daily Schedule
Some of the activities are on a daily basis, while some others are at specified
periods
within the Induction Program. We first show a typical daily timetable.
Session. Time Activity Remarks
Day 3 onwards
06:00 am Wake up call
I 06:30 am - 07:10 am Physical activity (mild exercise/
yoga)
07:15 am - 08:55 am Bath, Breakfast, etc.
II 09:00 am - 10:55 am Creative Arts / Universal Half the groups
Human Values do Creative
Arts
III 11:00 am - 12:55 pm Universal Human Values/ Complementary
Creative Arts alternate
01:00 pm - 02:25 pm Lunch
IV 02:30 pm - 03:55 pm Afternoon Session See below.
V 04:00 pm - 05:00 pm Afternoon Session See below.
05:00 pm - 05:25 pm Break / light tea
VI 05:30 pm - 06:45 pm Games / Special Lectures
06:50 pm - 08:25 pm Rest and Dinner
VII 08:30 pm - 09:25 pm Informal interactions (in hostels)

Sundays are off. Saturdays have the same schedule as above or have outings.

3.2.2 Afternoon Activities (Non-Daily)

The following five activities are scheduled at different times of the Induction
Program, and are not held daily for everyone:
1. Familiarization to Dept./Branch & Innovations
2. Visits to Local Area
3. Lectures by Eminent People
4. Literary
5. Proficiency Modules
Here is the approximate activity schedule for the afternoons (may be changed to
suit local needs):
Activity Session Remarks
Familiarization with IV For 3 days (Day 3 to 5)
Dept/Branch & Innovations

Visits to Local Area IV, V and For 3 days - interspersed (e.g., 3

VI Saturdays)
Lectures by Eminent People IV As scheduled - 3-5 lectures
Literary (Play / Book IV For 3-5 days
Reading / Lecture)
Proficiency Modules V Daily, but only for those who need it

3.3 Closing Phase

Time Activity
Last But One Day
08:30 am - 12 noon Discussions and finalization of presentation
within each group
02:00 am - 05:00 pm Presentation by each group in front of 4 other groups
besides their own (about 100 students)

Last Day
Whole day Examinations (if any). May be expanded to last 2 days,
in case needed.

3.4 Follow Up after Closure

A question comes up as to what would be the follow up program after the formal
3-week Induction Program is over? The groups which are formed should function
as mentor mentee network. A student should feel free to approach his faculty
mentor or the student guide, when facing any kind of problem, whether academic
or financial or psychological etc. (For every 10 undergraduate first year students,
there would be a senior student as a student guide, and for every 20 students,
there would be a faculty mentor.) Such a group should remain for the entire 4-5
year duration of the stay of the student. Therefore, it would be good to have
groups with the students as well as teachers from the same
department/discipline. Here we list some important suggestions which have
come up and which have been experimented with.

3.4.1 Follow Up after Closure – Same Semester

It is suggested that the groups meet with their faculty mentors once a month,
within the semester after the 3-week Induction Program is over. This should be a
scheduled meeting shown in the timetable. (The groups are of course free to meet
together on their own more often, for the student groups to be invited to their
faculty mentor‟s home for dinner or tea, nature walk, etc.)

3.4.2 Follow Up – Subsequent Semesters

It is extremely important that continuity be maintained in subsequent semesters.
It is suggested that at the start of the subsequent semesters (upto fourth semester),
three days be set aside for three full days of activities related to follow up to
Induction Program. The students be shown inspiring films, do collective art work,
and group discussions be conducted. Subsequently, the groups should meet at
least once a month.
4 Summary
Engineering institutions were set up to generate well trained manpower in
engineering with a feeling of responsibility towards oneself, one‟s family, and
society. The incoming undergraduate students are driven by their parents and
society to join engineering without understanding their own interests and talents.
As a result, most students fail to link up with the goals of their own institution.

The graduating student must have values as a human being, and knowledge and
meta skills related to his/her profession as an engineer and as a citizen. Most
students who get demotivated to study engineering or their branch, also lose
interest in learning.
The Induction Programis designed to make the newly joined students feel
comfortable, sensitize them towards exploring their academic interests and
activities, reducing competition and making them work for excellence, promote
bonding within them, build relations between teachers and students, give a
broader view of life, and building of character.

The Universal Human Valuescomponent, which acts as an anchor, develops

awareness and sensitivity, feeling of equality, compassion and oneness, draw
attention to society and we are aware that there are advantages in mixing the
students from different depts. However, in mixing, it is our experience that the
continuity of the group together with the faculty mentor breaks down soon after.
Therefore, the groups be from the same dept. but hostel wings have the mixed
students from different depts. For example, the hostel room allotment should be
in alphabetical order irrespective of dept. nature, and character to follow through.
It also makes them reflect on their relationshipwith their families and extended
family in the college (with hostel staff and others). It alsoconnects students with
each other and with teachers so that they can share any difficultythey might be
facing and seek help.

References:
Motivating UG Students Towards Studies, Rajeev Sangal, IITBHU Varanasi,
Gautam Biswas, IIT Guwahati, Timothy Gonsalves, IIT Mandi, Pushpak
Bhattacharya, IIT Patna, (Committee of IIT Directors), 31 March 2016, IIT
Directors‟ Secretariat, IIT Delhi.

Contact:

Prof. Rajeev Sangal

Director, IIT(BHU), Varanasi
([email protected])
18 June 2017
 PHYSICS
Module - 1 Relativistic Mechanics: [8]

Frame of reference, Inertial & non-inertial frames, Galilean transformations, Michelson-

Morley experiment, Postulates of special theory of relativity, Lorentz transformations,
Length contraction, Time dilation, Velocity addition theorem, Variation of mass with
velocity, Einstein‟s mass energy relation, Relativistic relation between energy and
momentum, Massless particle.

Module- 2 Electromagnetic Field Theory: [8]

Continuity equation for current density, Displacement current, Modifying equation for the
curl of magnetic field to satisfy continuity equation, Maxwell‟s equations in vacuum and in
non conducting medium, Energy in an electromagnetic field, Poynting vector and Poynting
theorem, Plane electromagnetic waves in vacuum and their transverse nature. Relation
between electric and magnetic fields of an electromagnetic wave, Energy and momentum
carried by electromagnetic waves, Resultant pressure, Skin depth.

Module- 3 Quantum Mechanics: [8]

Black body radiation, Stefan‟s law, Wien‟s law, Rayleigh-Jeans law and Planck‟s law, Wave
particle duality, Matter waves, Time-dependent and time-independent Schrodinger wave
equation, Born interpretation of wave function, Solution to stationary state Schrodinger
wave equation for one-Dimensional particle in a box, Compton effect.

Module- 4 Wave Optics: [10]

Coherent sources, Interference in uniform and wedge shaped thin films, Necessity of
extended sources, Newton‟s Rings and its applications. Fraunhoffer diffraction at single slit
and at double slit, absent spectra, Diffraction grating, Spectra with grating, Dispersive
power, Resolving power of grating, Rayleigh‟s criterion of resolution, Resolving power of
grating.

Module- 5Fibre Optics & Laser: [10]

Fibre Optics: Introduction to fibre optics, Acceptance angle, Numerical aperture,

Normalized frequency, Classification of fibre, Attenuation and Dispersion in optical fibres.
Laser: Absorption of radiation, Spontaneous and stimulated emission of radiation, Einstein‟s
coefficients, Population inversion, Various levels of Laser, Ruby Laser, He-Ne Laser, Laser
applications.

Course Outcomes:
1. To solve the classical and wave mechanics problems
2. To develop the understanding of laws of thermodynamics and their application
in various processes
3. To formulate and solve the engineering problems on Electromagnetism
& Electromagnetic Field Theory
4. To aware of limits of classical physics & to apply the ideas in solving the problems in
their parent streams
Reference Books:
1. Concepts of Modern Physics - AurthurBeiser (Mc-Graw Hill)
2. Introduction to Special Theory of Relativity- Robert Resnick (Wiley)
3. Optics - Brijlal& Subramanian (S. Chand )
4. Engineering Physics: Theory and Practical- Katiyar and Pandey (Wiley India)
5. Applied Physics for Engineers- Neeraj Mehta (PHI Learning, New)
6. Engineering Physics-Malik HK and Singh AK (McGrawHill)
 Physics Lab
List of Experiments

Any ten experiments (at least four from each group).

Group A

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

2. To determine the wavelength of different spectral lines of mercury light using plane
transmission grating.
3. To determine the specific rotation of cane sugar solution using polarimeter.
4. To determine the focal length of the combination of two lenses separated by a
distance and verify the formula for the focal length of combination of lenses.
5. To measure attenuation in an optical fiber.
6. To determine the wavelength of He-Ne laser light using single slit diffraction.
7. To study the polarization of light using He-Ne laser light.
8. To determine the wavelength of sodium light with the help of Fresnel‟s bi-prism.
9. To determine the coefficient of viscosity of a given liquid.
10. To determine the value of acceleration due to gravity (g) using compound
pendulum.

Group B

1. To determine the energy band gap of a given semiconductor material.

2. To study Hall effect and determine Hall coefficient, carrier density and mobility of a
given semiconductor material using Hall effect setup.
3. To determine the variation of magnetic field with the distance along the axis of a
current carrying coil and estimate the radius of the coil.
4. To verify Stefan‟s law by electric method.
5. To determine resistance per unit length and specific resistance of a given resistance
using Carey Foster's Bridge.
6. To study the resonance condition of a series LCR circuit.
7. To determine the electrochemical equivalent (ECE) of copper.
8. To calibrate the given ammeter and voltmeter by potentiometer.
9. To draw hysteresis (B-H curve) of a specimen in the form of a transformer and to
determine its hysteresis loss.
10. To measure high resistance by leakage method.

Reference Books

1. Practical Physics- K. K. Dey & B. N. Dutta (Kalyani Publishers New Delhi)

2. Engineering Physics-Theory and Practical- Katiyar& Pandey (Wiley India)
3. Engineering Physics Practical- S K Gupta ( KrishnaPrakashan Meerut)

Course Outcomes:
1. To determine the wavelength of sodium light by Newton‟s ring experiment
2. To determine the wavelength of sodium light with the help of Fresnel‟s bi-prism
3. To determine the variation of magnetic field with the distance along the axis of a
current carrying coil and estimate the radius of the coil.
4. To draw hysteresis (B-H curve) of a specimen in the form of a transformer and to
determine its hysteresis loss.
 CHEMISTRY

Module-1 [08]
Atomic and Molecular Structure:
Molecular orbital‟s of diatomic molecules. Band theory of solids. Liquid crystal and its
applications. Point defects in solids. Structure and applications of Graphite and Fullerenes.
Concepts of Nanomaterials and its application.

Module-2 [08]
Spectroscopic techniques and Applications:
Elementary idea and simple applications of Rotational, Vibrational, Ultraviolet& Visible and
Raman spectroscopy.

Module-3 [08]
Electrochemistry
Nernst Equation and application, relation of EMF with thermodynamic functions (∆H, ∆F
and ∆ S). Lead storage battery.
Corrosion; causes, effects and its prevention.
Phase Rule and its application to water system.

Module-4 [08]
Water Analysis; Hardness of water, Techniques for water softening (Lime-soda, Zeolite, Ion
exchange resin and Reverse osmosis method).
Fuels: classification of fuels, Analysis of coal, Determination of calorific value (Bomb
calorimeterand Dulong‟smethos).

Module-5 [08]
Polymer; Basic concepts of polymer-Blend and composites, Conducting and biodegradable
polymers. Preparation and application of some industrially important polymers (Buna-S,
Buna-N, Neoprene, Nylon-6, nylon-6,6 and Terylene). General methods of synthesis of
organometallic compounds (Grignard reagent) and their applications.

Course Outcomes:

1. Use of different analytical instruments.

2. Measure molecular/system properties such as surface tension, viscosity,
conductance of solution, chloride and iron content in water.
3. Measure hardness of water.
4. Estimate the rate constant of reaction.

Reference Books:

1. University Chemistry By B.H. Mahan

2. University Chemistry By C.N.R. Rao
3. Organic Chemistry By I.L. Finar
4. Physical Chemistry By S. Glasstone
5. Engineering Chemistry By S.S. Dara
6. Polymer Chemistry ByFre W., Billmeyer
7. Engineering ChemistryBy Satya Prakash
 CHEMISTRY- PRACTICAL
LIST OF EXPERIMENTS

1. Determination of alkalinity in the given water sample.

2. Determination of temporary and permanent hardness in water sample using
EDTA.
3. Determination of iron content in the given solution by Mohr‟s method.
4. Determination of viscosity of given liquid.
5. Determination of surface tension of given liquid.
6. Determination of chloride content in water sample.
7. Determination of available chlorine in bleaching powder.
8. Determination of pH by pH-metric titration.
9. Preparation of Phenol-formaldehyde and Urea-formaldehyde resin.
10. Determination of Cell constant and conductance of a solution.
11. Determination of rate constant of hydrolysis of esters.
12. Verification of Beer‟s law.

NOTE: Choice of any 10 experiments from the above. Institute can change any 02
experiments from the aforesaid experiments.

Course Outcomes:

1. Use of different analytical instruments.

2. Measure molecular/system properties such as surface tension, viscosity,
conductance of solution, chloride and iron content in water.
3. Measure hardness of water.
4. Estimate the rate constant of reaction.
 MATHEMATICS-I

(Common to all B. Tech. Courses except B. Tech. (Biotechnology)&B. Tech. (Agricultural Engineering)

Module 1: Matrices [08]

Types of Matrices: Symmetric, Skew-symmetric and Orthogonal Matrices; Complex

Matrices, Inverse and Rank of matrix using elementary transformations, Rank-Nullity
theorem; System of linear equations, Characteristic equation, Cayley-Hamilton Theorem and
its application, Eigen values and eigenvectors; Diagonalisation of a Matrix,

Module 2: Differential Calculus- I [08]

Introduction to limits, continuity and differentiability, Rolle’s Theorem, Lagrange’s Mean

value theorem and Cauchy mean value theorem, Successive Differentiation (nth order
derivatives), Leibnitz theorem and its application, Envelope, Involutes and Evolutes, Curve
tracing: Cartesian and Polar co-ordinates

Module 3: Differential Calculus-II [08]

Partial derivatives, Total derivative, Euler’s Theorem for homogeneous functions, Taylor and
Maclaurin’s theorems for a function of one and two variables, Maxima and Minima of
functions of several variables, Lagrange Method of Multipliers, Jacobians, Approximation of
errors.

Module 4: Multivariable Calculus-I [08]

Multiple integration: Double integral, Triple integral, Change of order of integration,

Change of variables, Application: Areas and volumes, Center of mass and center of gravity
(Constant and variable densities),

Module 5: Vector Calculus [08]

Vector differentiation: Gradient, Curl and Divergence and their Physical interpretation,
Directional derivatives, Tangent and Normal planes.

Vector Integration: Line integral, Surface integral, Volume integral, Gauss’s Divergence
theorem, Green’s theorem, Stoke’s theorem ( without proof) and their applications.

COURSE OUTCOMES
 1. Remember the concept of matrices and apply for solving linear simultaneous
equations.
2. Understand the concept of limit, continuity and differentiability and apply in
the study of Rolle,s , Lagrange,s and Cauchy mean value theorem and Leibnitz
theorems .
3. Identify the application of partial differentiation and apply for evaluating
maxima, minima, series and Jacobians.
4. Illustrate the working methods of multiple integral and apply for finding area,
volume, centre of mass and centre of gravity.
5. Remember the concept of vector and apply for directional derivatives, tangent
and normal planes. Also evaluate line, surface and volume integrals.
Text Books:-

1. B. V. Ramana, Higher Engineering Mathematics, Tata Mc Graw-Hill Publishing

Company Ltd., 2008.
2. B. S. Grewal, Higher Engineering Mathematics, Khanna Publisher, 2005.
3. R K. Jain & S R K. Iyenger , Advance Engineering Mathematics, Narosa Publishing
House 2002.
Reference Books-

1.E. Kreyszig, Advance Engineering Mathematics, John Wiley & Sons, 2005.
2.Peter V. O’Neil, Advance Engineering Mathematics, Thomson (Cengage) Learning, 2007.
3.Maurice D. Weir, Joel Hass, Frank R. Giordano, Thomas, Calculus, Eleventh Edition,
Pearson.
4.D. Poole, Linear Algebra : A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
5.Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi, 2008.
6.Ray Wylie C and Louis C Barret, Advanced Engineering Mathematics, Tata Mc-Graw-Hill;
Sixth Edition.
7.P. Sivaramakrishna Das and C. Vijayakumari, Engineering Mathematics, 1st Edition, Pearson
India Education Services Pvt. Ltd
8. Advanced Engineering Mathematics. Chandrika Prasad, Reena Garg, 2018.
9. Engineering Mathemathics – I. Reena Garg, 2018.

BASIC ELECTRICAL ENGINEERING

Module - 1: DC Circuits [08]

Electrical circuit elements (R, L and C), Concept of active and passive elements, voltage and
current sources, concept of linearity and linear network, unilateral and bilateral elements,
Kirchhoff‟s laws, Loop and nodal methods of analysis, Star-delta transformation,
Superposition theorem, Thevenin theorem, Norton theorem.

Module - 2: Steady- State Analysis of Single Phase AC Circuits [10]

Representation of Sinusoidal waveforms – Average and effective values, Form and peak
factors, Concept of phasors, phasor representation of sinusoidally varying voltage and
current.

Analysis of single phase AC Circuits consisting of R, L, C, RL, RC, RLC combinations (Series
and Parallel), Apparent, active & reactive power, Power factor, power factor improvement.
Concept of Resonance in series & parallel circuits, bandwidth and quality factor.

Three phase balanced circuits, voltage and current relations in star and delta connections.

Module - 3 : Transformers [08]

Magnetic materials, BH characteristics, ideal and practical transformer, equivalent circuit,

losses in transformers, regulation and efficiency. Auto-transformer and three-phase
transformer connections.

Module –4 : Electrical machines [08]

DC machines: Principle & Construction, Types, EMF equation of generator and torque
equation of motor, applications of DC motors (simple numerical problems)

Three Phase Induction Motor: Principle & Construction, Types, Slip-torque characteristics,
Applications (Numerical problems related to slip only)

Single Phase Induction motor: Principle of operation and introduction to methods of

starting, applications.

Three Phase Synchronous Machines: Principle of operation of alternator and synchronous

motor and their applications.

Module –5 : Electrical Installations [06]

Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, MCCB, Types of Wires
and Cables, Importance of earthing. Types of Batteries, Important characteristics for
Batteries.Elementary calculations for energy consumption and savings, battery backup.

COURSE OUTCOMES
 1. Apply the concepts of KVL/KCL and network theorems in solving DC
circuits.
2. Analyze the steady state behavior of single phase and three phase AC
electrical circuits.
3. Identify the application areas of a single phase two winding transformer as
well as an auto transformer and calculate their efficiency. Also identify the
connections of a three phase transformer.
4. Illustrate the working principles of induction motor, synchronous machine as
well as DC machine and employ them in different area of applications.
5. Describe the components of low voltage electrical installations and perform
elementary calculations for energy consumption.

Spoken Tutorial (MOOCs):

1. AC DC Circuit Analysis using NgSpice, Open Source Software (http://spoken-

tutorial.org)

Text Books:

1. Ritu Sahdev, “Basic Electrical Engineering”, Khanna Publishing House.

2. S. Singh, P.V. Prasad, “Electrical Engineering: Concepts and Applications” Cengage.

3. D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill.

4. D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill.

Reference Books:

1. E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.

2. L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press.

3. V. D. Toro, “Electrical Engineering Fundamentals”, Pearson India.

 ELECTRICAL ENGINEERING LABORATORY

LIST OF EXPERIMENTS

Note: A minimum of ten experiments from the following should be performed.

1. Verification of Kirchhoff‟s laws

2. Verification of Superposition and Thevenin Theorem.
3. Measurement of power and power factor in a single phase ac series inductive circuit and study
improvement of power factor using capacitor
4. Study of phenomenon of resonance in RLC series circuit and obtain resonant frequency.
5. Connection and measurement of power consumption of a fluorescent lamp (tube light).
6. Measurement of power in 3- phase circuit by two wattmeter method and determination of its power
factor for star as well as delta connected load.
7. Determination of parameters of ac single phase series RLC circuit
8. To observe the B-H loop of a ferromagnetic material in CRO.
9. Determination of (i) Voltage ratio (ii) polarity and (iii) efficiency by load test of a single phase
transformer
10. Determination of efficiency of a dc shunt motor by load test
11. To study running and speed reversal of a three phase induction motor and record speed in both
directions.
12. Demonstration of cut-out sections of machines: dc machine, three phase induction machine, single-
phase induction machine and synchronous machine.

COURSE OUTCOMES

1. Conduct experiments illustrating the application of KVL/KCL and network

theorems to DC electrical circuits.
2. Demonstrate the behavior of AC circuits connected to single phase AC supply and
measure power in single phase as well as three phase electrical circuits.
3. Perform experiment illustrating BH curve of magnetic materials.
4. Calculate efficiency of a single phase transformer and DC machine.
5. Perform experiments on speed measurement and reversal of direction of three
phase induction motor and Identify the type of DC and AC machines based on their
construction.
 Programming for Problem Solving
Module – 1 : (Introduction to Programming) [08]

Introduction to components of a computer system: Memory, processor, I/O Devices, storage,

operating system, Concept of assembler, compiler, interpreter, loader and linker.
Idea of Algorithm: Representation of Algorithm, Flowchart, Pseudo code with examples, From
algorithms to programs, source code.
Programming Basics: Structure of C program, writing and executing the first C program, Syntax
and logical errors in compilation, object and executable code. Components of C language.
Standard I/O in C, Fundamental data types, Variables and memory locations, Storage classes.

Module – 2 : (Arithmetic expressions & Conditional Branching) [08]

Arithmetic expressions and precedence:Operators and expression using numeric and relational
operators, mixed operands, type conversion, logical operators, bit operations, assignment
operator, operator precedence and associativity.

Conditional Branching: Applying if and switch statements, nesting if and else, use of break and
default with switch.

Module – 3 : (Loops & Functions) [08]

Iteration and loops: use of while, do while and for loops, multiple loop variables, use of break and
continue statements.
Functions: Introduction, types of functions, functions with array, passing parameters to functions,
call by value, call by reference, recursive functions.

Module – 4 : (Arrays & Basic Algorithms) [08]

Arrays: Array notation and representation, manipulating array elements, using multi dimensional
arrays. Character arrays and strings, Structure, union, enumerated data types, Array of structures,
Passing arrays to functions.
Basic Algorithms: Searching &Basic Sorting Algorithms (Bubble, Insertion and Selection),
Finding roots of equations, Notion of order of complexity.
Module – 5 :( Pointer& File Handling) [08]

Pointers:Introduction, declaration, applications, Introduction to dynamic memory allocation

(malloc, calloc, realloc, free), Use of pointers in self-referential structures, notion of linked list (no
implementation)
File handling:File I/O functions, Standard C preprocessors, defining and calling macros,
command-line arguments.

COURSE OUTCOMES

1. To develop simple algorithms for arithmetic and logical problems.

2. To translate the algorithms to programs & execution (in C language).
3. To implement conditional branching, iteration and recursion.
4. To decompose a problem into functions and synthesize a complete program using
divide and conquer approach.

5. To use arrays, pointers and structures to develop algorithms and programs.

Text books:
1. Schum‟s Outline of Programming with C by Byron Gottfried, McGraw-Hill
2. The C programming by Kernighan Brain W. and Ritchie Dennis M., Pearson
Education.
3. Computer Basics and C Programming by V.Rajaraman , PHI Learning Pvt. Limited,
2015.
4. Computer Concepts and Programming in C, R.S. Salaria, Khanna Publishing House
5. Computer Concepts and Programming in C, E Balaguruswami, McGraw Hill
6. Computer Science- A Structured Programming Approach Using C, by Behrouz A.
Forouzan, Richard F. Gilberg, Thomson, Third Edition , Cengage Learning - 2007.
7. Let Us C By Yashwant P. Kanetkar.
8. Problem Solving and Program Design in C, by Jeri R. Hanly, Elliot B. Koffman,
Pearson
Addison-Wesley, 2006.
9. Programming in C by Kochan Stephen G. Pearson Education – 2015.
10. Computer Concepts and Programming in C by D.S. Yadav and Rajeev Khanna, New
AgeInternational Publication.
11. Computer Concepts and Programming by Anami, Angadi and Manvi, PHI
Publication.
12. Computer Concepts and Programming in C by Vikas Gupta, Wiley India Publication
13. Computer Fundamentals and Programming in C. Reema Thareja, Oxford Publication
14. Problem Solving and Programming in C, R.S. Salaria, Khanna Publishing House
 Programming for Problem Solving Lab

Other Reference: -

1. Use C Open Source Software

referring Spoken Tutorial MOOC

1. WAP that accepts the marks of 5 subjects and finds the sum and percentage marks obtained
by the student.
2. WAP that calculates the Simple Interest and Compound Interest. The Principal, Amount, Rate
of Interest and Time are entered through the keyboard.
3. WAP to calculate the area and circumference of a circle.
4. WAP that accepts the temperature in Centigrade and converts into Fahrenheit using the formula
C/5=(F-32)/9.
5. WAP that swaps values of two variables using a third variable.
6. WAP that checks whether the two numbers entered by the user are equal or not.
7. WAP to find the greatest of three numbers.
8. WAP that finds whether a given number is even or odd.
9. WAP that tells whether a given year is a leap year or not.
10. WAP that accepts marks of five subjects and finds percentage and prints grades according to the
following criteria:
Between 90-100%--------------Print „A‟
80-90%----------------------------Print „B‟
60-80%---------------------------Print „C‟
Below 60%----------------------Print „D‟
11. WAP that takes two operands and one operator from the user and perform the operation and prints
the result by using Switch statement.
12. WAP to print the sum of all numbers up to a given number.
13. WAP to find the factorial of a given number.
14. WAP to print sum of even and odd numbers from 1 to N numbers.
15. WAP to print the Fibonacci series.
16. WAP to check whether the entered number is prime or not.
17. WAP to find the sum of digits of the entered number.
18. WAP to find the reverse of a number.
19. WAP to print Armstrong numbers from 1 to 100.
20. WAP to convert binary number into decimal number and vice versa.
 21. WAP that simply takes elements of the array from the user and finds the sum of these elements.
22. WAP that inputs two arrays and saves sum of corresponding elements of these arrays in a third array
and prints them.
23. WAP to find the minimum and maximum element of the array.
24. WAP to search an element in a array using Linear Search.
25. WAP to sort the elements of the array in ascending order using Bubble Sort technique.
26. WAP to add and multiply two matrices of order nxn.
27. WAP that finds the sum of diagonal elements of a mxn matrix.
28. WAP to implement strlen (), strcat (),strcpy () using the concept of Functions.
29. Define a structure data type TRAIN_INFO. The type contain Train No.: integer type Train name:
string Departure Time: aggregate type TIME Arrival Time: aggregate type TIME Start station: string End
station: string The structure type Time contains two integer members: hour and minute. Maintain a train
timetable and implement the following operations:
(i) List all the trains (sorted according to train number) that depart from a particular section.
(ii) List all the trains that depart from a particular station at a particular time.
(iii) List all he trains that depart from a particular station within the next one hour of a given time.
(iv) List all the trains between a pair of start station and end station.
30. WAP to swap two elements using the concept of pointers.
31. WAP to compare the contents of two files and determine whether they are same or not.
32. WAP to check whether a given word exists in a file or not. If yes then find the number of times it
occurs.
COURSE OUTCOMES

1. To write programs for arithmetic and logical problems.

2. To translate the algorithms to programs & execution (in C language).
3. To write programs for conditional branching, iteration and recursion.
4. To write programs using functions and synthesize a complete program using divide and
conquer approach.
5. write programs using arrays, pointers and structures.
 Engineering Graphics and Design

Module 1: Introduction to Engineering Drawing, Orthographic Projections [08]

Principles of Engineering Graphics and their significance, usage of Drawing instruments, lettering, Scales –
Plain and Diagonal Scales
Principles of Orthographic Projections – Conventions – Projections of Points and Lines inclined to both
planes; Projections of planes inclined Planes – Auxiliary Planes.

Module 2: Projections and Sections of Regular Solids [08]

Sections in lined to both the Planes – Auxiliary Views; Simple annotation, dimensioning and scale. Floor
plans the include: windows, doors and fixtures such as WC, Both, sink, shower, etc.
Prism, Cylinder, Pyramid, Cone – Auxiliary Vies: Development of surfaces of Right Regular Solids – Prism,
Pyramid, Cylinder and Cone.

Module 3: Isometric Projections [08]

Principles of Isometric projection – Isometric Scale, Isometric Views, Conventions; Isometric Views of lines,
Planes Simple and compound Solids; Conversion of Isometric Views to Orthographic Views and Vice-
versa, Conversions.

Module 4: Computer Graphics [08]

Listing the computer technologies the impact on graphical communication, Demonstration knowledge of
the theory of CAD software [such as: The Menu System, Tollbars (Standard, Object Properties, Draw,
Modify and Dimension), Drawing Area (Background, Crosshairs, Coordinate System), Dialog boxes and
windows, Shortcut menus (Button Bars), The Command Line (where applicable), The Status Bar, Different
methods of zoom as used in CAD, Select and erase objects: Isometric Views of lines, Planes, Simple and
compound Solids];

Set up of the drawing page and the printer, including scale settings, Setting up of units and drawing limits;
ISO and ANSI standards for coordinate dimensioning and tolerancing; Orthographic constraints, Snap to
objects manually and automatically; Producing drawings by using various coordinate input entry methods
to draw straight lines, Applying various ways of drawing circles:

Applying dimensions to objects, applying annotations to drawings; Setting up and use of Layers, layers to
create drawings, Create, edit and use customized layers; Changing line lengths through modifying existing
lines (extend/lengthen); Printing documents to pater using the print command: orthographic projection
techniques; Drawing sectional views of composite right regular geometric solids and project the true shape
of the sectioned surface; Drawing annotation, Computer-aided design (CAD) software modelling of parts
and assemblies. Parametric and non-parametric solid, surface, and wireframe models. Part editing and two-
dimensional documentation of models. Planar projection theory, including sketching of perspective,
isometric, Multiview, auxiliary, and section views. Spatial visualization exercises Dimensioning guidelines,
tolerancing techniques; dimensioning and scale multi views of dwelling:

Module 5: Demonstration of a simple team design project [08]

Geometry and topology of engineered components: creation of engineering models and their presentation
in standard 2D blueprint form and as 3D wire-frame and shaded solids; meshed topologies for engineering
analysis and tool-path generation for component manufacture; geometric dimensioning and tolerancing;
Use of solid-modelling software for creating associative models at the component and assembly levels;
floor plans that include: windows, doors, and fixtures such as WC, bath, sink, shower, etc. Applying colour
coding according to building drawing practice; Drawing sectional elevation showing foundation to ceiling;
Introduction to Building Information Modelling (BIM).

Course Outcomes

1: Understanding of the visual aspects of engineering design

2: Understanding of engineering graphics standards and solid modelling
3: Effective communication through graphics
4: Applying modern engineering tools necessary for engineering practice
5: Appling computer-aided geometric design
6: Analysis of Isometric views
7: Creating working drawings

Suggested Text/ Reference Books:

(i) Bhatt N.D., Panchal V.M. & Ingle P.R. (2014), Engineering Drawing, Charotar Publishing House.
(ii) Shah, M.B. & Rana B.C. (2008), Engineering Drawing and Computer Graphics, Pearson Education
(iii) Agrawal B. & Agrawal C.M. (2012), Engineering Graphics, TMH Publication
(iv) Engineering Graphics & Design, A.P. Gautam & Pradeep Jain, Khanna Publishing House
(v) Narayana, K.L. & P Kannaiah (2008), Text book on Engineering Drawing, Scitech Publishers.
(vi) (Corresponding set of) CAD Software Theory and User Manuals.
 WORKSHOP PRACTICE

LIST OF EXPERIMENTS

Machine shop:
 Study of machine tools in particular Lathe machine
 Demonstration of different operations on Lathe machine
 Practice of Facing, Plane Turning, step turning, taper turning, knurling and parting.
 Study of Quick return mechanism of Shaper.
Fitting shop:

 Preparation of T-Shape Work piece as per the given specifications.

 Preparation of U-Shape Work piece which contains: Filing, Sawing, Drilling, Grinding.
 Practice marking operations.
Carpentry:
 Study of Carpentry Tools, Equipment and different joints.
 Practice of Cross Half lap joint, Half lap Dovetail joint and Mortise Tenon Joint

Electrical & Electronics

 Introduction to House wiring, different types of cables. Types of power supply, types of motors,
Starters, distribution of power supply, types of bulbs, parts of tube light, Electrical wiring symbols.
 Soldering and desoldering of Resistor in PCB.
 Soldering and desoldering of IC in PCB.
 Soldering and desoldering of Capacitor in PCB

Welding:
 Instruction of BI standards and reading of welding drawings.
 Butt Joint
 Lap Joint
 TIG Welding
 MIG Welding
Casting:
 introduction to casting processes
Smithy

 Sharpening any arc and edge.

 Preparing small arc and edge,
 Repair of agricultural implements and power plough, use of power hammer etc.
 Plastic Moulding& Glass Cutting

 Introduction to Patterns, pattern allowances, ingredients of moulding sand and melting furnaces.
Foundry tools and their purposes
 Demo of mould preparation
 Practice – Preparation of mould
 Glass cutting

COURSE OUTCOMES

1. Study and practice on machine tools and their operations

2. Practice on manufacturing of components using workshop trades including fitting,
carpentry, foundry and welding
3. Identify and apply suitable tools for machining processes including turning, facing,
thread cutting and tapping
4. Welding and soldering operations
5. Apply basic electrical engineering knowledge for house wiring practice

Text Books:
1. Raghuwanshi B.S., Workshop Technology Vol. I & II, Dhanpath Rai & Sons.
2. Kannaiah P. and Narayana K.L., Workshop Manual, 2nd Edn, Scitech publishers.
3. John K.C., Mechanical Workshop Practice. 2nd Edn. PHI 2010.
4. JeyapoovanT.and Pranitha S., Engineering Practices Lab Manual, 3rd Edn. Vikas Pub.2008.
 SEMESTER - II
PHYSICS

Module - 1 Relativistic Mechanics: [8]

Frame of reference, Inertial & non-inertial frames, Galilean transformations, Michelson-Morley
experiment, Postulates of special theory of relativity, Lorentz transformations, Length contraction, Time
dilation, Velocity addition theorem, Variation of mass with velocity, Einstein‟s mass energy relation,
Relativistic relation between energy and momentum, Massless particle.

Module- 2 Electromagnetic Field Theory: [8]

Continuity equation for current density, Displacement current, Modifying equation for the curl of
magnetic field to satisfy continuity equation, Maxwell‟s equations in vacuum and in non-conducting
medium, Energy in an electromagnetic field, Poynting vector and Poynting theorem, Plane
electromagnetic waves in vacuum and their transverse nature. Relation between electric and magnetic
fields of an electromagnetic wave, Energy and momentum carried by electromagnetic waves, Resultant
pressure, Skin depth.

Module- 3 Quantum Mechanics: [8]

Black body radiation, Stefan‟s law, Wien‟s law, Rayleigh-Jeans law and Planck‟s law, Wave particle
duality, Matter waves, Time-dependent and time-independent Schrodinger wave equation, Born
interpretation of wave function, Solution to stationary state Schrodinger wave equation for one-
Dimensional particle in a box, Compton effect.

Module- 4 Wave Optics: [10]

Coherent sources, Interference in uniform and wedge shaped thin films, Necessity of extended sources,
Newton‟s Rings and its applications. Fraunhoffer diffraction at single slit and at double slit, Absent
spectra, Diffraction grating, Spectra with grating, Dispersive power, Resolving power of grating,
Rayleigh‟s criterion of resolution, Resolving power of grating.

Module- 5Fibre Optics & Laser: [10]

Fibre Optics: Introduction to fibre optics, Acceptance angle, Numerical aperture, Normalized frequency,
Classification of fibre, Attenuation and Dispersion in optical fibres.
Laser: Absorption of radiation, Spontaneous and stimulated emission of radiation, Einstein‟s coefficients,
Population inversion, Various levels of Laser, Ruby Laser, He-Ne Laser, Laser applications.
 Course Outcomes:
1. To solve the classical and wave mechanics problems
2. To develop the understanding of laws of thermodynamics and their application
in various processes
3. To formulate and solve the engineering problems on Electromagnetism
& Electromagnetic Field Theory
4. To aware of limits of classical physics & to apply the ideas in solving the problems in
their parent streams

Reference Books:
1. Concepts of Modern Physics - AurthurBeiser (Mc-Graw Hill)
2. Introduction to Special Theory of Relativity- Robert Resnick (Wiley)
3. Optics - Brijlal& Subramanian (S. Chand )
4. Engineering Physics: Theory and Practical- Katiyar and Pandey (Wiley India)
5. Applied Physics for Engineers- Neeraj Mehta (PHI Learning, New)
6. Engineering Physics-Malik HK and Singh AK (McGrawHill)
 PHYSICS LAB
List of Experiments (Any ten experiments (at least four from each group).

Group A

11. To determine the wavelength of sodium light by Newton‟s ring experiment.

12. To determine the wavelength of different spectral lines of mercury light using plane transmission
grating.
13. To determine the specific rotation of cane sugar solution using polarimeter.
14. To determine the focal length of the combination of two lenses separated by a distance and verify the
formula for the focal length of combination of lenses.
15. To measure attenuation in an optical fiber.
16. To determine the wavelength of He-Ne laser light using single slit diffraction.
17. To study the polarization of light using He-Ne laser light.
18. To determine the wavelength of sodium light with the help of Fresnel‟s bi-prism.
19. To determine the coefficient of viscosity of a given liquid.
20. To determine the value of acceleration due to gravity (g) using compound pendulum.

Group B

11. To determine the energy band gap of a given semiconductor material.

12. To study Hall effect and determine Hall coefficient, carrier density and mobility of a given
semiconductor material using Hall effect setup.
13. To determine the variation of magnetic field with the distance along the axis of a current carrying coil
and estimate the radius of the coil.
14. To verify Stefan‟s law by electric method.
15. To determine resistance per unit length and specific resistance of a given resistance using Carey Foster's
Bridge.
16. To study the resonance condition of a series LCR circuit.
17. To determine the electrochemical equivalent (ECE) of copper.
18. To calibrate the given ammeter and voltmeter by potentiometer.
19. To draw hysteresis (B-H curve) of a specimen in the form of a transformer and to determine its
hysteresis loss.
20. To measure high resistance by leakage method.

Course Outcomes:
1. To determine the wavelength of sodium light by Newton‟s ring experiment
2. To determine the wavelength of sodium light with the help of Fresnel‟s bi-prism
3. To determine the variation of magnetic field with the distance along the axis of a
current carrying coil and estimate the radius of the coil.
4. To draw hysteresis (B-H curve) of a specimen in the form of a transformer and to
determine its hysteresis loss.

Reference Books
1. Practical Physics- K. K. Dey & B. N. Dutta (Kalyani Publishers New Delhi)
2. Engineering Physics-Theory and Practical- Katiyar& Pandey (Wiley India)
3. Engineering Physics Practical- S K Gupta ( KrishnaPrakashan Meerut)
 CHEMISTRY
Module-1 [08]
Atomic and Molecular Structure:
Molecular orbital‟s of diatomic molecules. Band theory of solids. Liquid crystal and its
applications. Point defects in solids. Structure and applications of Graphite and Fullerenes.
Concepts of Nanomaterials and its application.

Module-2 [08]
Spectroscopic techniques and Applications:
Elementary idea and simple applications of Rotational, Vibrational, Ultraviolet& Visible and
Raman spectroscopy.

Module-3 [08]
Electrochemistry
Nernst Equation and application, relation of EMF with thermodynamic functions (∆H, ∆F
and ∆ S). Lead storage battery.
Corrosion; causes, effects and its prevention.
Phase Rule and its application to water system.

Module-4 [08]
Water Analysis; Hardness of water, Techniques for water softening (Lime-soda, Zeolite, Ion
exchange resin and Reverse osmosis method).
Fuels: classification of fuels, Analysis of coal, Determination of calorific value (Bomb
calorimeterand Dulong‟smethos).

Module-5 [08]
Polymer; Basic concepts of polymer-Blend and composites, Conducting and biodegradable
polymers. Preparation and application of some industrially important polymers (Buna-S,
Buna-N, Neoprene, Nylon-6, nylon-6,6 and Terylene). General methods of synthesis of
organometallic compounds (Grignard reagent) and their applications.

Course Outcomes:
1. Get an understanding of the theoretical principles understanding molecular structure,
bonding and properties.
2. Know the fundamental concepts of determination of structure with various techniques.
3. Know the fundamental concepts of chemistry applicable in industrial processes.

Reference Books:
1. University Chemistry By B.H. Mahan
2. University Chemistry By C.N.R. Rao
3. Organic Chemistry By I.L. Finar
4. Physical Chemistry By S. Glasstone
5. Engineering Chemistry By S.S. Dara
7. Polymer Chemistry ByFre W., Billmeyer
8. Engineering Chemistry By Satya Prakash
 CHEMISTRY- PRACTICAL
LIST OF EXPERIMENTS

1. Determination of alkalinity in the given water sample.

2. Determination of temporary and permanent hardness in water sample using
EDTA.
3. Determination of iron content in the given solution by Mohr‟s method.
4. Determination of viscosity of given liquid.
5. Determination of surface tension of given liquid.
6. Determination of chloride content in water sample.
7. Determination of available chlorine in bleaching powder.
8. Determination of pH by pH-metric titration.
9. Preparation of Phenol-formaldehyde and Urea-formaldehyde resin.
10. Determination of Cell constant and conductance of a solution.
11. Determination of rate constant of hydrolysis of esters.
12. Verification of Beer‟s law.

NOTE: Choice of any 10 experiments from the above. Institute can change any 02
experiments from the aforesaid experiments.

Course Outcomes:

1. Use of different analytical instruments.

2. Measure molecular/system properties such as surface tension, viscosity,
conductance of solution, chloride and iron content in water.
3. Measure hardness of water.
4. Estimate the rate constant of reaction.
 MATHEMATICS-II
(Common to all B. Tech. Courses except B. Tech., Biotechnology and Agricultural Engineering)

Module 1: Ordinary Differential Equation of Higher Order [10]

Linear differential equation of nth order with constant coefficients, Simultaneous linear
differential equations, Second order linear differential equations with variable coefficients,
Solution by changing independent variable, Reduction of order, Normal form, Method of
variation of parameters, Cauchy-Euler equation, Series solutions (Frobenius Method).

Module 2: Multivariable Calculus-II [08]

Improper integrals, Beta & Gama function and their properties, Dirichlet’s integral and its
applications, Application of definite integrals to evaluate surface areas and volume of
revolutions.

Module 3: Sequences and Series [08]

Definition of Sequence and series with examples, Convergence of sequence and series, Tests
for convergence of series, (Ratio test, D’ Alembert’s test, Raabe’s test). Fourier series, Half
range Fourier sine and cosine series.

Module 4: Complex Variable – Differentiation [08]

Limit, Continuity and differentiability, Functions of complex variable, Analytic functions,

Cauchy- Riemann equations (Cartesian and Polar form), Harmonic function, Method to find
Analytic functions, Conformal mapping, Mobius transformation and their properties

Module 5: Complex Variable –Integration [08]

Complex integrals, Contour integrals, Cauchy- Goursat theorem, Cauchy integral formula,
Taylor’s series, Laurent’s series, Liouvilles’s theorem, Singularities, Classification of
Singularities, zeros of analytic functions, Residues, Methods of finding residues, Cauchy
Residue theorem, Evaluation of real integrals of the type and
.

COURSE OUTCOMES

1. Understand the concept of differentiation and apply for solving differential equations.
2. Remember the concept of definite integral and apply for evaluating surface areas and
volumes.
3. Understand the concept of convergence of sequence and series. Also evaluate Fourier
series
4. Illustrate the working methods of complex functions and apply for finding analytic
functions.
5. Apply the complex functions for finding Taylor’s series, Laurent’s series and evaluation
of definite integrals.
Text Books:-

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

Company Ltd., 2008.
2. B. S. Grewal, Higher Engineering Mathematics, Khanna Publisher, 2005.
3. R. K. Jain & S. R. K. Iyenger , Advance Engineering Mathematics , Narosa
Publishing -House, 2002.

Reference Books:-

1. E. Kreyszig, Advance Engineering Mathematics, John Wiley & Sons, 2005.

2. Peter V. O’Neil, Advance Engineering Mathematics, Thomson (Cengage)
Learning, 2007.
3. Maurice D. Weir, Joel Hass, Frank R.Giordano, Thomas, Calculus, Eleventh
Edition, Pearson.
4. G.B Thomas, R L Finney, Calculus and Analytical Geometry, Ninth Edition
Pearson, 2002.
5. James Ward Brown and Ruel V Churchill, Fourier Series and Boundary Value
Problems, 8th Edition-Tata McGraw-Hill

6. D. Poole , Linear Algebra : A Modern Introduction, 2nd Edition, Brooks/Cole,

2005.
7. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New
Delhi, 2008.

8. Charles E Roberts Jr, Ordinary Diffrential Equations, Application, Model and

Computing, CRC Press T&F Group.
9. Ray Wylie C and Louis C Barret, Advanced Engineering Mathematics, 6th
Edition, Tata McGraw-Hill.
10. James Ward Brown and Ruel V Churchill, Complex Variable and Applications,
8th Edition, Tata McGraw-Hill.
11. P. Sivaramakrishna Das and C. Vijayakumari, Engineering Mathematics, 1st
Edition, Pearson India Education Services Pvt. Ltd.
12. Advanced Engineering Mathematics By Chandrika Prasad, Reena Garg Khanna
Publishing House, Delhi
 BASIC ELECTRICAL ENGINEERING

Module - 1: DC Circuits [08]

Electrical circuit elements (R, L and C), Concept of active and passive elements, voltage and
current sources, concept of linearity and linear network, unilateral and bilateral elements,
Kirchhoff‟s laws, Loop and nodal methods of analysis, Star-delta transformation,
Superposition theorem, Thevenin theorem, Norton theorem.

Module - 2: Steady- State Analysis of Single Phase AC Circuits [10]

Representation of Sinusoidal waveforms – Average and effective values, Form and peak
factors, Concept of phasors, phasor representation of sinusoidally varying voltage and
current.

Analysis of single phase AC Circuits consisting of R, L, C, RL, RC, RLC combinations (Series
and Parallel), Apparent, active & reactive power, Power factor, power factor improvement.
Concept of Resonance in series & parallel circuits, bandwidth and quality factor.

Three phase balanced circuits, voltage and current relations in star and delta connections.

Module - 3 : Transformers [08]

Magnetic materials, BH characteristics, ideal and practical transformer, equivalent circuit,

losses in transformers, regulation and efficiency. Auto-transformer and three-phase
transformer connections.

Module –4 : Electrical machines [08]

DC machines: Principle & Construction, Types, EMF equation of generator and torque
equation of motor, applications of DC motors (simple numerical problems)

Three Phase Induction Motor: Principle & Construction, Types, Slip-torque characteristics,
Applications (Numerical problems related to slip only)

Single Phase Induction motor: Principle of operation and introduction to methods of

starting, applications.

Three Phase Synchronous Machines: Principle of operation of alternator and synchronous

motor and their applications.

Module –5 : Electrical Installations [06]

Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, MCCB, Types of Wires
and Cables, Importance of earthing. Types of Batteries, Important characteristics for
Batteries.Elementary calculations for energy consumption and savings, battery backup.
COURSE OUTCOMES

1. Apply the concepts of KVL/KCL and network theorems in solving DC

circuits.
2. Analyze the steady state behavior of single phase and three phase AC
electrical circuits.
3. Identify the application areas of a single phase two winding transformer as
well as an auto transformer and calculate their efficiency. Also identify the
connections of a three phase transformer.
4. Illustrate the working principles of induction motor, synchronous machine as
well as DC machine and employ them in different area of applications.
5. Describe the components of low voltage electrical installations and perform
elementary calculations for energy consumption.

Spoken Tutorial (MOOCs):

1. AC DC Circuit Analysis using NgSpice, Open Source Software (http://spoken-

tutorial.org)

Text Books:

1. Ritu Sahdev, “Basic Electrical Engineering”, Khanna Publishing House.

2. S. Singh, P.V. Prasad, “Electrical Engineering: Concepts and Applications” Cengage.

3. D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill.

4. D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill.

Reference Books:

1. E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.

2. L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press.

3. V. D. Toro, “Electrical Engineering Fundamentals”, Pearson India.

 ELECTRICAL ENGINEERING LABORATORY
LIST OF EXPERIMENTS

Note: A minimum of ten experiments from the following should be performed.

1. Verification of Kirchhoff‟s laws

2. Verification of Superposition and Thevenin Theorem.
3. Measurement of power and power factor in a single phase ac series inductive circuit and study
improvement of power factor using capacitor
4. Study of phenomenon of resonance in RLC series circuit and obtain resonant frequency.
5. Connection and measurement of power consumption of a fluorescent lamp (tube light).
6. Measurement of power in 3- phase circuit by two wattmeter method and determination of its power
factor for star as well as delta connected load.
7. Determination of parameters of ac single phase series RLC circuit
8. To observe the B-H loop of a ferromagnetic material in CRO.
9. Determination of (i) Voltage ratio (ii) polarity and (iii) efficiency by load test of a single phase
transformer
10. Determination of efficiency of a dc shunt motor by load test
11. To study running and speed reversal of a three phase induction motor and record speed in both
directions.
12. Demonstration of cut-out sections of machines: dc machine, three phase induction machine, single-
phase induction machine and synchronous machine.

COURSE OUTCOMES

1. Conduct experiments illustrating the application of KVL/KCL and network theorems

to DC electrical circuits.
2. Demonstrate the behavior of AC circuits connected to single phase AC supply and
measure power in single phase as well as three phase electrical circuits.
3. Perform experiment illustrating BH curve of magnetic materials.
4. Calculate efficiency of a single phase transformer and DC machine.
5. Perform experiments on speed measurement and reversal of direction of three phase
induction motor and Identify the type of DC and AC machines based on their
construction.
 Programming for Problem Solving

Module – 1 : (Introduction to Programming) [08]

Introduction to components of a computer system: Memory, processor, I/O Devices, storage,

operating system, Concept of assembler, compiler, interpreter, loader and linker.
Idea of Algorithm: Representation of Algorithm, Flowchart, Pseudo code with examples, From
algorithms to programs, source code.
Programming Basics: Structure of C program, writing and executing the first C program, Syntax
and logical errors in compilation, object and executable code. Components of C language.
Standard I/O in C, Fundamental data types, Variables and memory locations, Storage classes.

Module – 2 : (Arithmetic expressions & Conditional Branching) [08]

Arithmetic expressions and precedence:Operators and expression using numeric and relational
operators, mixed operands, type conversion, logical operators, bit operations, assignment
operator, operator precedence and associativity.

Conditional Branching: Applying if and switch statements, nesting if and else, use of break and
default with switch.

Module – 3 : (Loops & Functions) [08]

Iteration and loops: use of while, do while and for loops, multiple loop variables, use of break and
continue statements.
Functions: Introduction, types of functions, functions with array, passing parameters to functions,
call by value, call by reference, recursive functions.

Module – 4 : (Arrays & Basic Algorithms) [08]

Arrays: Array notation and representation, manipulating array elements, using multi-dimensional
arrays. Character arrays and strings, Structure, union, enumerated data types, Array of structures,
passing arrays to functions.
Basic Algorithms: Searching &Basic Sorting Algorithms (Bubble, Insertion and Selection),
Finding roots of equations, Notion of order of complexity.
Module – 5 :( Pointer& File Handling) [08]

Pointers:Introduction, declaration, applications, Introduction to dynamic memory allocation

(malloc, calloc, realloc, free), Use of pointers in self-referential structures, notion of linked list (no
implementation)
File handling:File I/O functions, Standard C preprocessors, defining and calling macros,
command-line arguments.

COURSE OUTCOMES

1. To develop simple algorithms for arithmetic and logical problems.

2. To translate the algorithms to programs & execution (in C language).
3. To implement conditional branching, iteration and recursion.
4. To decompose a problem into functions and synthesize a complete program using
divide and conquer approach.

5. To use arrays, pointers and structures to develop algorithms and programs.

Text books:
1. Schum‟s Outline of Programming with C by Byron Gottfried, McGraw-Hill
2. The C programming by Kernighan Brain W. and Ritchie Dennis M., Pearson Education.
3. Computer Basics and C Programming by V.Rajaraman , PHI Learning Pvt. Limited,
2015.
4. Computer Concepts and Programming in C, R.S. Salaria, Khanna Publishing House
5. Computer Concepts and Programming in C, E Balaguruswami, McGraw Hill
6. Computer Science- A Structured Programming Approach Using C, by Behrouz A.
Forouzan, Richard F. Gilberg, Thomson, Third Edition , Cengage Learning - 2007.
7. Let Us C By Yashwant P. Kanetkar.
8. Problem Solving and Program Design in C, by Jeri R. Hanly, Elliot B. Koffman, Pearson
Addison-Wesley, 2006.
9. Programming in C by Kochan Stephen G. Pearson Education – 2015.
10. Computer Concepts and Programming in C by D.S. Yadav and Rajeev Khanna, New
AgeInternational Publication.
11. Computer Concepts and Programming by Anami, Angadi and Manvi, PHI Publication.
12. Computer Concepts and Programming in C by Vikas Gupta, Wiley India Publication
13. Computer Fundamentals and Programming in C. Reema Thareja, Oxford Publication
14. Problem Solving and Programming in C, R.S. Salaria, Khanna Publishing House
 Programming for Problem Solving Lab

Other Reference: -

1. Use C Open Source Software referring Spoken

Tutorial MOOC

1. WAP that accepts the marks of 5 subjects and finds the sum and percentage marks obtained

by the student.
2. WAP that calculates the Simple Interest and Compound Interest. The Principal, Amount, Rate
of Interest and Time are entered through the keyboard.
3. WAP to calculate the area and circumference of a circle.
4. WAP that accepts the temperature in Centigrade and converts into Fahrenheit using the formula
C/5=(F-32)/9.
5. WAP that swaps values of two variables using a third variable.
6. WAP that checks whether the two numbers entered by the user are equal or not.
7. WAP to find the greatest of three numbers.
8. WAP that finds whether a given number is even or odd.
9. WAP that tells whether a given year is a leap year or not.
10. WAP that accepts marks of five subjects and finds percentage and prints grades according to the
following criteria:
Between 90-100%--------------Print „A‟
80-90%----------------------------Print „B‟
60-80%---------------------------Print „C‟
Below 60%----------------------Print „D‟
11. WAP that takes two operands and one operator from the user and perform the operation and prints
the result by using Switch statement.
12. WAP to print the sum of all numbers up to a given number.
13. WAP to find the factorial of a given number.
14. WAP to print sum of even and odd numbers from 1 to N numbers.
15. WAP to print the Fibonacci series.
16. WAP to check whether the entered number is prime or not.
17. WAP to find the sum of digits of the entered number.
18. WAP to find the reverse of a number.
19. WAP to print Armstrong numbers from 1 to 100.
20. WAP to convert binary number into decimal number and vice versa.
21. WAP that simply takes elements of the array from the user and finds the sum of these elements.
22. WAP that inputs two arrays and saves sum of corresponding elements of these arrays in a third array
and prints them.
 23. WAP to find the minimum and maximum element of the array.
24. WAP to search an element in a array using Linear Search.
25. WAP to sort the elements of the array in ascending order using Bubble Sort technique.
26. WAP to add and multiply two matrices of order nxn.
27. WAP that finds the sum of diagonal elements of a mxn matrix.
28. WAP to implement strlen (), strcat (),strcpy () using the concept of Functions.
29. Define a structure data type TRAIN_INFO. The type contain Train No.: integer type Train name:
string Departure Time: aggregate type TIME Arrival Time: aggregate type TIME Start station: string End
station: string The structure type Time contains two integer members: hour and minute. Maintain a train
timetable and implement the following operations:
(i) List all the trains (sorted according to train number) that depart from a particular section.
(ii) List all the trains that depart from a particular station at a particular time.
(iii) List all he trains that depart from a particular station within the next one hour of a given time.
(iv) List all the trains between a pair of start station and end station.
30. WAP to swap two elements using the concept of pointers.
31. WAP to compare the contents of two files and determine whether they are same or not.
32. WAP to check whether a given word exists in a file or not. If yes then find the number of times it
occurs.

COURSE OUTCOMES

1. To write programs for arithmetic and logical problems.

2. To translate the algorithms to programs & execution (in C language).
3. To write programs for conditional branching, iteration and recursion.
4. To write programs using functions and synthesize a complete program using divide and
conquer approach.
5. write programs using arrays, pointers and structures.
 Engineering Graphics and Design

Module 1: Introduction to Engineering Drawing, Orthographic Projections [08]

Principles of Engineering Graphics and their significance, usage of Drawing instruments, lettering, Scales –
Plain and Diagonal Scales
Principles of Orthographic Projections – Conventions – Projections of Points and Lines inclined to both
planes; Projections of planes inclined Planes – Auxiliary Planes.

Module 2: Projections and Sections of Regular Solids [08]

Sections in lined to both the Planes – Auxiliary Views; Simple annotation, dimensioning and scale. Floor
plans the include: windows, doors and fixtures such as WC, Both, sink, shower, etc.
Prism, Cylinder, Pyramid, Cone – Auxiliary Vies: Development of surfaces of Right Regular Solids – Prism,
Pyramid, Cylinder and Cone.

Module 3: Isometric Projections [08]

Principles of Isometric projection – Isometric Scale, Isometric Views, Conventions; Isometric Views of lines,
Planes Simple and compound Solids; Conversion of Isometric Views to Orthographic Views and Vice-
versa, Conversions.

Module 4: Computer Graphics [08]

Listing the computer technologies the impact on graphical communication, Demonstration knowledge of
the theory of CAD software [such as: The Menu System, Tollbars (Standard, Object Properties, Draw,
Modify and Dimension), Drawing Area (Background, Crosshairs, Coordinate System), Dialog boxes and
windows, Shortcut menus (Button Bars), The Command Line (where applicable), The Status Bar, Different
methods of zoom as used in CAD, Select and erase objects: Isometric Views of lines, Planes, Simple and
compound Solids];

Set up of the drawing page and the printer, including scale settings, Setting up of units and drawing limits;
ISO and ANSI standards for coordinate dimensioning and tolerancing; Orthographic constraints, Snap to
objects manually and automatically; Producing drawings by using various coordinate input entry methods
to draw straight lines, Applying various ways of drawing circles:

Applying dimensions to objects, applying annotations to drawings; Setting up and use of Layers, layers to
create drawings, Create, edit and use customized layers; Changing line lengths through modifying existing
lines (extend/lengthen); Printing documents to pater using the print command: orthographic projection
techniques; Drawing sectional views of composite right regular geometric solids and project the true shape
of the sectioned surface; Drawing annotation, Computer-aided design (CAD) software modelling of parts
and assemblies. Parametric and non-parametric solid, surface, and wireframe models. Part editing and two-
dimensional documentation of models. Planar projection theory, including sketching of perspective,
isometric, Multi view, auxiliary, and section views. Spatial visualization exercises Dimensioning guidelines,
tolerancing techniques; dimensioning and scale multi views of dwelling:

Module 5: Demonstration of a simple team design project [08]

Geometry and topology of engineered components: creation of engineering models and their presentation
in standard 2D blueprint form and as 3D wire-frame and shaded solids; meshed topologies for engineering
analysis and tool-path generation for component manufacture; geometric dimensioning and tolerancing;
Use of solid-modelling software for creating associative models at the component and assembly levels;
floor plans that include: windows, doors, and fixtures such as WC, bath, sink, shower, etc. Applying colour
coding according to building drawing practice; Drawing sectional elevation showing foundation to ceiling;
Introduction to Building Information Modelling (BIM).

Course Outcomes

1: Understanding of the visual aspects of engineering design

2: Understanding of engineering graphics standards and solid modelling
3: Effective communication through graphics
4: Applying modern engineering tools necessary for engineering practice
5: Appling computer-aided geometric design
6: Analysis of Isometric views
7: Creating working drawings

Suggested Text/ Reference Books:

(i) Bhatt N.D., Panchal V.M. & Ingle P.R. (2014), Engineering Drawing, Charotar Publishing House.
(ii) Shah, M.B. & Rana B.C. (2008), Engineering Drawing and Computer Graphics, Pearson Education
(iii) Agrawal B. & Agrawal C.M. (2012), Engineering Graphics, TMH Publication
(iv) Engineering Graphics & Design, A.P. Gautam & Pradeep Jain Khanna Publishing House
(v) Narayana, K.L. & P Kannaiah (2008), Text book on Engineering Drawing, Scitech Publishers.
(vi) (Corresponding set of) CAD Software Theory and User Manuals.
 WORKSHOP PRACTICE

LIST OF EXPERIMENTS

Machine shop:
 Study of machine tools in particular Lathe machine
 Demonstration of different operations on Lathe machine
 Practice of Facing, Plane Turning, step turning, taper turning, knurling and parting.
 Study of Quick return mechanism of Shaper.
Fitting shop:

 Preparation of T-Shape Work piece as per the given specifications.

 Preparation of U-Shape Work piece which contains: Filing, Sawing, Drilling, Grinding.
 Practice marking operations.
Carpentry:
 Study of Carpentry Tools, Equipment and different joints.
 Practice of Cross Half lap joint, Half lap Dovetail joint and Mortise Tenon Joint

Electrical & Electronics

 Introduction to House wiring, different types of cables. Types of power supply, types of motors,
Starters, distribution of power supply, types of bulbs, parts of tube light, Electrical wiring symbols.
 Soldering and desoldering of Resistor in PCB.
 Soldering and desoldering of IC in PCB.
 Soldering and desoldering of Capacitor in PCB

Welding:
 Instruction of BI standards and reading of welding drawings.
 Butt Joint
 Lap Joint
 TIG Welding
 MIG Welding
Casting:
 introduction to casting processes
Smithy

 Sharpening any arc and edge.

 Preparing small arc and edge,
 Repair of agricultural implements and power plough, use of power hammer etc.
 Plastic Moulding& Glass Cutting

 Introduction to Patterns, pattern allowances, ingredients of moulding sand and melting furnaces.
Foundry tools and their purposes
 Demo of mould preparation
 Practice – Preparation of mould
 Glass cutting

COURSE OUTCOMES

1. Study and practice on machine tools and their operations

2. Practice on manufacturing of components using workshop trades including fitting,
carpentry, foundry and welding
3. Identify and apply suitable tools for machining processes including turning, facing,
thread cutting and tapping
4. Welding and soldering operations
5. Apply basic electrical engineering knowledge for house wiring practice

Text Books:
1. Raghuwanshi B.S., Workshop Technology Vol. I & II, Dhanpath Rai & Sons.
2. Kannaiah P. and Narayana K.L., Workshop Manual, 2nd Edn, Scitech publishers.
3. John K.C., Mechanical Workshop Practice. 2nd Edn. PHI 2010.
4. JeyapoovanT.and Pranitha S., Engineering Practices Lab Manual, 3rd Edn. Vikas Pub.2008.
 PROFESSIONAL ENGLISH
Module 1- Basics of Technical English [08]

Technical English: Definition; Extent& Coverage; Dimensions; Reading; Skimming;

Scanning; Churning & Assimilation; Writing: Methods: Inductive; Deductive; Exposition;
Linear; Interrupted; Spatial & Chronological etc; Technical Communication; Approaches:
Brevity; Objectivity; Simplicity; Utility & Clarity. Listening: Active; Passive; Thinking
strategies: Positive & Logical thinking; Speaking: Essentials Nuances & Modes of Speech
Delivery.

Module 2- Components of Technical Writing [08]

Vocabulary Building: Select words; Concept of word formation; Word formation; Root
words from foreign languages & their use in English; Prefixes & Suffixes: Derivatives;
Synonyms; Antonyms; Abbreviations. Homophones. One word substitutes; Requisites of
Sentences.

Module 3- Basic Technical Writing Skills [08]

Forms: Business writing: Principle; Purchase & Sales Letters; Drafts; Official Writing: Official
Letter; D.O. Letter; Notices; Agenda; Minutes of Meeting; Sentence Structure; Phrases &
Clauses in sentences; Coherence; Unity; Emphasis in Writing; Devices; Use of Writing
methods in Documents; Techniques of writing.

Module 4- Common Grammatical Errors & Technical Style [08]

Subject-verb agreement; Correct usage: Noun; Pronoun; Agreement; Modifiers; Articles;

Prepositions; Cliches; Redundancies; Technical Style: Features; Choice of words; Sentences:
Descriptive; Narrative; Expository; Defining & Classifying; Length of paragraph; Writing of
Introduction & Conclusion.

Module 5- Presentation Strategies & Oral Communications [08]Analysis of

locale; Audience; Modulating Style & Content; Speaking with confidence; Kinesics;
Paralinguistic features of Voice-Dynamics: Pitch; Intonation; Stress & Rhythm; Conversation
& dialogues; Communication at work-place; etc.

COURSE OUTCOMES

1. Students will be enabled to understand the basic objective of the course by being
acquainted with specific dimensions of communication skills i.e. Reading, Writing,
Listening, Thinking and Speaking.
2. Students would be able to create substantial base by the formation of strong
professional vocabulary for its application at different platforms and through numerous
modes as Comprehension, reading, writing and speaking etc.
3. Students will apply it at their work place for writing purposes such as
Presentation/official drafting/administrative communication and use it for
document/project/report/research paper writing.
 4. Students will be made to evaluate the correct & error-free writing by being well-
versed in rules of English grammar & cultivate relevant technical style of communication &
presentation at their work place & also for academic uses.
5. Students will apply it for practical and oral presentation purposes by being honed up
in presentation skills and voice-dynamics. They will apply techniques for developing inter-
personal communication skills and positive attitude leading to their professional
competence.

Text Books:
1. Technical Communication – Principles and Practices by Meenakshi Raman & Sangeeta
Sharma, Oxford Univ. Press, 2016, New Delhi.
2. Improve Your Writing ed. V.N. Arora and Laxmi Chandra, Oxford Univ. Press, 2001,
NewDelhi.

Reference Books:

1. Word Power Made Easy by Norman Lewis, W.R.Goyal Pub. & Distributors, 2009, Delhi.
2. Manual of Practical Communication by L.U.B. Pandey; A.I.T.B.S. Publications India Ltd.; Krishan Nagar,
2013, Delhi.
3. English Grammar and Usage by R.P.Sinha, Oxford University Press, 2005, New Delhi.
4. English Grammar, Composition and Usage by N.K.Agrawal&F.T.Wood, Macmillan India Ltd., New
Delhi.
5. Effective Communication Skill, Kulbhusan Kumar, RS Salaria, Khanna Publishing House
6. English Grammar & Composition by Wren & Martin, S.Chand& Co. Ltd., New Delhi.
7. Communication Skills for Engineers and Scientists, Sangeeta Sharma et.al. PHI Learning Pvt. Ltd, 2011,
New Delhi.
8. Personality Development, Harold R. Wallace &L.Ann Masters, Cengage Learning, New Delhi
9. Personality Development & Soft Skills, BarunK.Mitra, Oxford University Press, 2012 New Delhi.
10. Business Correspondence and Report Writing by Prof. R.C. Sharma & Krishna Mohan, Tata McGraw
Hill & Co. Ltd., 2001, New Delhi.
11. Developing Communication Skills by Krishna Mohan, Meera Bannerji- Macmillan India Ltd. 1990, Delhi.
12. Spoken English- A manual of Speech and Phonetics by R.K.Bansal&J.B.Harrison, Orient Blackswan,
2013, New Delhi.
13. Business English by Ken Taylor, Orient Blackswan, 2011, New Delhi.
 DR. A.P.J. ABDUL KALAM TECHNICAL
UNIVERSITY LUCKNOW

Study & Evaluation Scheme with Syllabus

For
B.Tech. Second Year
(Computer Science and Engineering, Computer Engg. & Information
Technology)

On
Choice Based Credit System

(Effective from the Session: 2017-18)

 2nd Year III-SEMESTER
S. ESE Sessional
Subject Code Subject Name L-T-P Total Credit
No. Marks CT TA
RAS301/
1. ROE030, 032 Mathematics-III/ Science Based OE 3-1-0 70 20 10 100 4
to 037, 039
Universal Human Values &
RVE301/
2. Professional Ethics / Environment & 3-0-0 70 20 10 100 3
RAS302
Ecology
3. REC301 Digital Logic Design 3-0-0 70 20 10 100 3
4. RCS301 Discrete Structures & Theory of Logic 3-0-0 70 20 10 100 3
Computer Organization and
5. RCS302 3-0-0 70 20 10 100 3
Architecture
6. RCS305 Data Structures 3-1-0 70 20 10 100 4
7. REC351 Digital Logic Design Lab 0-0-2 50 30 20 100 1
8. RCS351 Discrete Structure & Logic Lab 0-0-2 50 30 20 100 1
9. RCS352 Computer Organization Lab 0-0-2 50 30 20 100 1
10. RCS355 Data Structures Using C/ Java Lab 0-0-2 50 30 20 100 1
11. RME101* Elements of Mechanical Engineering* 3-1-0 70 20 10 100* --
Computer Aided Engineering
12. RCE151* 0-0-3 50 30 20 100* --
Graphics*
TOTAL 1000 24
CT: Class Test TA: Teacher Assessment L/T/P: Lecture/ Tutorial/ Practical

*B.Tech. IInd year lateral entry students belonging to B.Sc. Stream, shall clear the subjects
RCE151/RCE251 and RME101/201 of the first year Engineering Programme along with
the second year subjects.

Science Based Open Electives:

a. ROE030/040 Manufacturing Process
b. ROE032/042 Nano Science
c. ROE033/043 Laser System and Application
d. ROE034/044 Space Science
e. ROE035/045 Polymer Science & Technology
f. ROE036/046 Nuclear Science
g. ROE037/047 Material Science
h. ROE039/049 Applied Linear Algebra
 2nd Year IV-SEMESTER
S. Subject ESE Sessional
Subject Name L-T-P Total Credit
No. Code Marks CT TA
ROE040,
Science Based OE/ Mathematics-
1. 042 to 047, 3-1-0 70 20 10 100 4
III
049/ RAS401
Environment & Ecology/
2. RAS402/ Universal Human Values & 3-0-0 70 20 10 100 3
RVE401 Professional Ethics
3. REC405 Introduction to Microprocessor 3-0-0 70 20 10 100 3
4. RCS401 Operating Systems 3-0-0 70 20 10 100 3
5. RCS402 Software Engineering 3-0-0 70 20 10 100 3
Theory of Automata and Formal
6. RCS403 3-1-0 70 20 10 100 4
Languages
7. RCS451 Operating Systems Lab 0-0-2 50 30 20 100 1
8. RCS452 Software Engineering Lab 0-0-2 50 30 20 100 1
9. RCS453 TAFL Lab 0-0-2 50 30 20 100 1
Python Language Programming
10. 0-0-2 50 30 20 100 1
RCS454 Lab
Elements of Mechanical
11. RME201* 3-1-0 70 20 10 100* --
Engineering*
Computer Aided Engineering
12. RCE251* 0-0-3 50 30 20 100* --
Graphics*
TOTAL 1000 24
CT: Class Test TA: Teacher Assessment L/T/P: Lecture/ Tutorial/ Practical

*B.Tech. IInd year lateral entry students belonging to B.Sc. Stream, shall clear the subjects
RCE151/RCE251 and RME101/201 of the first year Engineering Programme along with
the second year subjects.

Science Based Open Electives:

a. ROE030/040 Manufacturing Process
b. ROE032/042 Nano Science
c. ROE033/043 Laser System and Application
d. ROE034/044 Space Science
e. ROE035/045 Polymer Science & Technology
f. ROE036/046 Nuclear Science
g. ROE037/047 Material Science
h. ROE039/049 Applied Linear Algebra
 RCS301: DISCRETE STRUCTURES & THEORY OF LOGIC

UNIT I
Set Theory: Introduction, Combination of sets, Multi sets, ordered pairs, Set Identities.
Relations: Definition, Operations on relations, Properties of relations, Composite Relations,
Equality of relations, Order of relations.
Functions: Definition, Classification of functions, Operations on functions, Recursively
defined functions.
Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction
with Nonzero Base cases.

UNIT II
Algebraic Structures: Definition, Groups, Subgroups and order, Cyclic Groups, Cosets,
Lagrange's theorem, Normal Subgroups, Permutation and Symmetric groups, Group
Homomorphism’s, Definition and elementary properties of Rings and Fields, Integers
Modulo n.

UNIT III
Partial order sets: Definition, Partial order sets, Combination of partial order sets, Hasse
diagram.
Lattices: Definition, Properties of lattices – Bounded, Complemented, Modular and
Complete Lattice, Morphisms of lattices.
Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic
manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps,
Logic gates, Digital circuits and Boolean algebra. Combinational and sequential Circuits.

UNIT IV
Propositional Logic: Proposition, well formed formula, Truth tables, Tautology,
Satisfiability, Contradiction, Algebra of proposition, Theory of Inference, Natural Deduction.
Predicate Logic: First order predicate, well formed formula of predicate, quantifiers,
Inference theory of predicate logic.

UNIT V
Trees: Definition, Binary tree, Binary tree traversal, Binary search tree.
Graphs: Definition and terminology, Representation of graphs, Multi graphs, Bipartite
graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian
paths, Graph coloring.
Recurrence Relation & Generating function: Recursive definition of functions, Recursive
algorithms, Method of solving recurrences.
Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle

References:
1. Liu and Mohapatra, “Elements of Discrete Mathematics”, McGraw Hill
2. Jean Paul Trembley, R Manohar, “Discrete Mathematical Structures with Application
to Computer Science”, McGraw-Hill
3. YN Singh, “Discrete Mathematical Structures”, Wiley India, New Delhi, First
Edition, August 2010.
4. RP Grimaldi, Discrete and Combinatorial Mathematics, Addison Wesley,
5. B. Kolman, R.C. Busby, and SC Ross, “Discrete Mathematical Structures”, PHI
Learning Private Limited, Delhi India.
6. Norman L. Biggs, “Discrete Mathematics”Oxford Higher Education.
7. Biswal, “Discrete Mathematics and Graph Theory, PHI Learning Private Limited,
Delhi India.
8. Goodaire and Parmenter, “Discrete Mathematics with Graph Theory”, PHI Learning
Private Limited, Delhi India.
9. Lipschutz, “Discrete Mathematics”, McGraw Hill
10. Deo N., “Graph Theory with Applications to Engineering and Computer Science”,
PHI Learning Private Limited, Delhi India
 RCS302: COMPUTER ORGANIZATION AND ARCHITECTURE

UNIT I
Functional units of digital system and their interconnections, buses, bus architecture, types of
buses and bus arbitration. Register bus and memory transfer, Processor organization, general
register organization, stack organization and addressing modes, Look ahead carry adders.
Multiplication: Signed operand multiplication, Booths algorithm and array multiplier.
Division and logic operations. Floating point arithmetic operation, Arithmetic & logic unit
design.

UNIT II
Instruction types, formats, instruction cycles and sub cycles (fetch, execute etc), micro-
operations, execution of a complete instruction, Hardwire and micro-programmed control:
micro-programme sequencing, concept of horizontal and vertical microprogramming.

UNIT III
1
Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 2 𝐷𝐷 memory
organization. ROM memories, Cache memories: concept and design issues & performance,
address mapping and replacement, Auxiliary memories: magnetic disk, magnetic tape and
optical disks, Virtual memory: concept implementation.

UNIT IV
Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt hardware, types of interrupts
and exceptions, Modes of Data Transfer: Programmed I/O, interrupt initiated I/O and Direct
Memory Access., I/O channels and processors, Serial Communication: Synchronous &
asynchronous communication, standard communication interfaces.

UNIT V
Architectural Classification Schemes, Flynn’s & Feng’s Classification, Performance
Metrics and Measures, Speedup Performance Laws, Pipelining and Memory Hierarchy
Basic and Intermediate Concepts, Linear and Nonlinear Pipeline Processors, Optimization
of Cache Performance.

Reference Books:
1. Patterson, “Computer Organization and Design” Elsevier Pub. 2009
2. William Stalling, “Computer Organization”, PHI
3. M. Morris Mano, “Computer System Architecture”, Pearson Learning
4. Miles Murdocca, Vincent Heuring “Computer Architecture and Organisation: An
Integrated Approch” 2nd Edition
5. Kai Hwang, “Advance Computer Architecture”, TMH
6. Vravice, Hamacher & Zaky, “Computer Organization”, TMH
7. John P Hays, “Computer Organization”, McGraw Hill
8. Tannenbaum, “Structured Computer Organization”, PHI
9. P Pal Chaudhry, “Computer Organization & Design” PHI
10. Dezso and Sima, “Advanced Computer Architecture”, Pearson
11. Alan Clements “Computer Organization and Architecture” , Cengage Learning
12. Behrooz Parhami “Computer Architecture”, Oxford
 RCS305/ RCS405: DATA STRUCTURES

UNIT I
Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an
Algorithm, Time and Space Complexity, Asymptotic notations: Big-Oh, Time-Space trade-
off.
Abstract Data Types (ADT), Arrays: Definition, Single and Multidimensional Arrays,
Representation of Arrays: Row Major Order, and Column Major Order, Application of
arrays, Sparse Matrices and their representations.
Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists,
Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion,
Traversal, Polynomial Representation and Addition, Generalized Linked List.

UNIT II
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions,
Evaluation of postfix expression, Recursion, Tower of Hanoi Problem, Simulating Recursion,
Principles of recursion, Tail recursion, Removal of recursion Queues, Operations on Queue:
Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of
queues in C, Dequeue and Priority Queue.

UNIT III
Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation
and Dynamic Representation, Complete Binary Tree, Algebraic Expressions, Extended
Binary Trees, Array and Linked Representation of Binary trees, Tree Traversal algorithms:
Inorder, Preorder and Postorder, Threaded Binary trees, Traversing Threaded Binary trees,
Huffman algorithm.

UNIT IV
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices,
Adjacency List, Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First
Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and
Kruskal algorithm. Transitive Closure and Shortest Path algorithm: Warshal Algorithm and
Dijikstra Algorithm, Introduction to Activity Networks.

UNIT V
Searching: Sequential search, Binary Search, Comparison and Analysis Internal Sorting:
Insertion Sort, Selection, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Radix
Sort, Practical consideration for Internal Sorting.
Search Trees: Binary Search Trees (BST), Insertion and Deletion in BST, Complexity of
Search Algorithm, AVL trees, Introduction to m-way Search Trees, B Trees & B+ Trees .
Hashing: Hash Function, Collision Resolution Strategies.
Storage Management: Garbage Collection and Compaction.

References:
1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data
Structures Using C and C++”, PHI Learning Private Limited, Delhi India
2. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt
Ltd Delhi India.
3. Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education
(India) Pvt. Ltd.
4. Thareja, “Data Structure Using C” Oxford Higher Education.
5. AK Sharma, “Data Structure Using C”, Pearson Education India.
6. Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.
7. Michael T. Goodrich, Roberto Tamassia, David M. Mount “Data Structures and
Algorithms in C++”, Wiley India.
8. P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication.
9. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education
10. Berztiss, AT: Data structures, Theory and Practice, Academic Press.
11. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with
applications”, McGraw Hill.
12. Adam Drozdek “Data Structures and Algorithm in Java”, Cengage Learning
 RCS351: DISCRETE STRUCTURE & LOGIC LAB
Understanding of mathematical computation software such as Mapple, Prolog to experiment
the followings:

1. Working of Computation software

2. Discover a closed formula for a given recursive sequence vice-versa
3. Recursion and Induction: Practice of proof techniques
4. Practice of various set operations
5. Testing of set operating using software
6. Counting
7. Combinatorial equivalence
8. Permutations and combinations
9. Difference between structures, permutations and sets
10. Implementation of a recursive counting technique
11. N digit binary sequences not having adjacent 1’s
12. Probability simulation
13. The Birthday problem
14. Poker Hands problem
15. Baseball best-of-5 series: Experimental probabilities
16. Comparison of theoretical probability with experimental probability
17. Baseball: Binomial Probability
18. Basketball: One and one
19. Expected value problem
20. Binary relations

RCS352: COMPUTER ORGANIZATION LAB

1. Implementing HALF ADDER, FULL ADDER using basic logic gates

2. Implementing Binary -to -Gray, Gray -to -Binary code conversions.
3. Implementing 3-8 line DECODER and Implementing 4x1 and 8x1
MULTIPLEXERS.
4. Verify the excitation tables of various FLIP-FLOPS.
5. Design of an 8-bit Input/ Output system with four 8-bit Internal Registers.
6. Design of an 8-bit ARITHMETIC LOGIC UNIT.
7. Design the data path of a computer from its register transfer language description.
8. Design the control unit of a computer using either hardwiring or microprogramming
based on its register transfer language description.
9. Write an algorithm and program to perform matrix multiplication of two n * n
matrices on the 2-D mesh SIMD model, Hypercube SIMD Model or multiprocessor
system.
10. Study of Scalability for Single board Multi-board, multi-core, multiprocessor using
Simulator.
 RCS355/RCS455: DATA STRUCTURE USING C/ JAVA LAB

Program in C or C++ for following:

1. To implement addition and multiplication of two 2D arrays.

2. To transpose a 2D array.
3. To implement stack using array.
4. To implement queue using array.
5. To implement circular queue using array.
6. To implement stack using linked list.
7. To implement queue using linked list.
8. To implement circular queue using linked list.
9. To implement binary tree using linked list.
10. To implement binary search tree using linked list.
11. To implement tree traversals using linked list.
12. To implement BFS using linked list.
13. To implement DFS using linked list.
14. To implement Linear Search.
15. To implement Binary Search.
16. To implement Bubble Sorting.
17. To implement Selection Sorting.
18. To implement Insertion Sorting.
19. To implement Merge Sorting.
20. To implement Heap Sorting.
 REC405: INTRODUCTION TO MICROPROCESSOR

UNIT I
Introduction to Microprocessor, Microprocessor architecture and its operations, Memory,
Input & output devices, Logic devices for interfacing, The 8085 MPU, Example of an 8085
based computer, Memory interfacing.

UNIT II
Basic interfacing concepts, Interfacing output displays, Interfacing input devices, Memory
mapped I/O, Flow chart symbols, Data Transfer operations, Arithmetic operations, Logic
Operations, Branch operation, Writing assembly language programs, Programming
techniques: looping, counting and indexing.

UNIT III
Additional data transfer and 16 bit arithmetic instruction, Arithmetic operations related to
memory, Logic operation: rotate, compare, counter and time delays, Illustrative program:
Hexadecimal counter, zero-to-nine, (module ten) counter, generating pulse waveforms,
debugging counter and time delay, Stack, Subroutine, Restart, Conditional call and return
instructions, Advance subroutine concepts, The 8085 Interrupts, 8085 vector interrupts.

UNIT IV
Program: BCD-to-Binary conversion, Binary-to-BCD conversion, BCD-to-Seven segment
code converter, Binary-to-ASCII and ASCII-to-Binary code conversion, BCD Addition, BCD
Subtraction, Introduction to Advance instructions and Application, Multiplication,
Subtraction with carry.

UNIT V
8255 Programmable peripheral interface, interfacing keyboard and seven segment display,
8254 (8253) programmable interval timer, 8259A programmable interrupt controller, Direct
Memory Access and 8237 DMA controller.
Introduction to 8086 microprocessor: Architecture of 8086 (Pin diagram, Functional block
diagram, Register organization).

References:
1. Ramesh Gaonkar, “Microprocessor Architecture, Programming, and Applications
with the 8085”, 5th Edition, Penram International Publication (India) Pvt. Ltd.
2. Douglas V. Hall, “Microprocessors and Interfacing”, Tata McGraw Hill.
3. Yu-cheng Liu, Glenn A. Gibson, “Microcomputer Systems: The 8086 / 8088 Family -
Architecture, Programming and Design”, Second Edition, Prentice Hall of India.
4. Barry B. Brey, “The Intel Microprocessors, 8086/8088, 80186/80188, 80286, 80386,
80486, Pentium, Pentium Pro Processor, Pentium II, Pentium III, Pentium IV,
Architecture, Programming & Interfacing”, Eighth Edition, Pearson Prentice Hall,
2009.
5. Peter Abel, “IBM PC Assembly language and programming”, Fifth Edition, Prentice
Hall of India Pvt. Ltd.
6. Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, “The 8051
Microcontroller and Embedded Systems: Using Assembly and C”, Pearson
education.
 RCS401: OPERATING SYSTEMS
UNIT I
Introduction : Operating system and functions, Classification of Operating systems- Batch,
Interactive, Time sharing, Real Time System, Multiprocessor Systems, Multiuser Systems,
Multiprocess Systems, Multithreaded Systems, Operating System Structure- Layered
structure, System Components, Operating System services, Re-entrant Kernels, Monolithic
and Microkernel Systems.

UNIT II
Concurrent Processes: Process Concept, Principle of Concurrency, Producer/ Consumer
Problem, Mutual Exclusion, Critical Section Problem, Dekker’s solution, Peterson’s solution,
Semaphores, Test and Set operation; Classical Problem in Concurrency- Dining Philosopher
Problem, Sleeping Barber Problem; Inter Process Communication models and Schemes,
Process generation.

UNIT III
CPU Scheduling: Scheduling Concepts, Performance Criteria, Process States, Process
Transition Diagram, Schedulers, Process Control Block (PCB), Process address space,
Process identification information, Threads and their management, Scheduling Algorithms,
Multiprocessor Scheduling. Deadlock: System model, Deadlock characterization, Prevention,
Avoidance and detection, Recovery from deadlock.

UNIT IV
Memory Management: Basic bare machine, Resident monitor, Multiprogramming with fixed
partitions, Multiprogramming with variable partitions, Protection schemes, Paging,
Segmentation, Paged segmentation, Virtual memory concepts, Demand paging, Performance
of demand paging, Page replacement algorithms, Thrashing, Cache memory organization,
Locality of reference.

UNIT V
I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering, Disk
storage and disk scheduling, RAID. File System: File concept, File organization and access
mechanism, File directories, and File sharing, File system implementation issues, File system
protection and security.

References:
1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
2. Andrew S. Tanenbaum, “Modern Operating System”, PHI Learning
3. Tanenbaum /Woodhaull “Operating System Design and Implementation”, Pearson
Publication.
4. Harvey M Dietel, “ An Introduction to Operating System”, Pearson Education
5. Flynn, “Understanding Operating System” , Cengage.
6. D M Dhamdhere, “Operating Systems : A Concept basedApproach”, McGraw Hill.
7. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw
Hill Education”.
8. Stuart E. Madnick& John J. Donovan.Operating Systems.McGraw Hill.
9. A. K. Sharma, “Operating System”, University Press.
10. Achyut S Godbole, Atul kahate , “Operating System”, McGraw Hill
 RCS402: SOFTWARE ENGINEERING

UNIT I
Introduction: Introduction to Software Engineering, Software Components, Software
Characteristics, Software Crisis, Software Engineering Processes, Similarity and Differences
from Conventional Engineering Processes, Software Quality Attributes. Software
Development Life Cycle (SDLC) Models: Water Fall Model, Prototype Model, Spiral Model,
Evolutionary Development Models, Iterative Enhancement Models.

UNIT II
Software Requirement Specifications (SRS): Requirement Engineering Process:
Elicitation, Analysis, Documentation, Review and Management of User Needs, Feasibility
Study, Information Modelling, Data Flow Diagrams, Entity Relationship Diagrams, Decision
Tables, SRS Document, IEEE Standards for SRS.
Software Quality Assurance (SQA): Verification and Validation, SQA Plans, Software
Quality Frameworks, ISO 9000 Models, SEI-CMM Model.

UNIT III
Software Design: Basic Concept of Software Design, Architectural Design, Low Level
Design: Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and
Cohesion Measures, Design Strategies: Function Oriented Design, Object Oriented
Design, Top-Down and Bottom-Up Design. Software Measurement and Metrics: Various
Size Oriented Measures: Halestead’s Software Science, Function Point (FP) Based Measures,
Cyclomatic Complexity Measures: Control Flow Graphs.

UNIT IV
Software Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance
Testing, Regression Testing, Testing for Functionality and Testing for Performance, Top-
Down and Bottom-Up Testing Strategies: Test Drivers and Test Stubs, Structural Testing
(White Box Testing), Functional Testing (Black Box Testing), Test Data Suit Preparation,
Alpha and Beta Testing of Products.
Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through, Code
Inspection, Compliance with Design and Coding Standards.

UNIT V
Software Maintenance and Software Project Management: Software as an Evolutionary
Entity, Need for Maintenance, Categories of Maintenance: Preventive, Corrective and
Perfective Maintenance, Cost of Maintenance, Software Re- Engineering, Reverse
Engineering. Software Configuration Management Activities, Change Control Process,
Software Version Control, An Overview of CASE Tools. Estimation of Various Parameters
such as Cost, Efforts, Schedule/Duration, Constructive Cost Models (COCOMO), Resource
Allocation Models, Software Risk Analysis and Management.

References:
1. RS Pressman, Software Engineering: A Practitioners Approach, McGraw Hill.
2. Pankaj Jalote, Software Engineering, Wiley
3. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.
4. KK Aggarwal and Yogesh Singh, Software Engineering, New Age International
Publishers.
5. Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHI
Publication.
6. Ian Sommerville, Software Engineering, Addison Wesley.
7. Kassem Saleh, “Software Engineering”, Cengage Learning.
8. P fleeger, Software Engineering, Macmillan Publication
 RCS403: THEORY OF AUTOMATA AND FORMAL LANGUAGES

UNIT I
Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic
finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph,
Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with
epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite
Automata, Distinguishing one string from other, Myhill-Nerode Theorem

UNIT II
Regular expression (RE), Definition, Operators of regular expression and their precedence,
Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA
to Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for
regular Languages . Application of Pumping Lemma, Closure properties of Regular
Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy
machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA.

UNIT III
Context free grammar (CFG) and Context Free Languages (CFL): Definition, Examples,
Derivation, Derivation trees, Ambiguity in Grammar, Inherent ambiguity, Ambiguous to
Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs: CNF
and GNF, Closure proper ties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness
and Membership, Pumping lemma for CFLs.

UNIT IV
Push Down Automata (PDA): Description and definition, Instantaneous Description,
Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic
PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA.

UNIT V
Turing machines (TM): Basic model, definition and representation, Instantaneous
Description, Language acceptance by TM, Variants of Turing Machine, TM as Computerof
Integer functions, Universal TM, Church’s Thesis, Recursive and recursively enumerable
languages, Halting problem, Introduction to Undecidability, Undecidable problems about
TMs. Post correspondence problem (PCP), Modified PCP, Introduction to recursive function
theory.

References:
1. Hopcroft, Ullman, “Introduction to Automata Theory, Languages and Computation”,
Pearson Education.
2. KLP Mishra and N. Chandrasekaran, “Theory of Computer Science: Automata,
Languages and Computation”, PHI Learning Private Limited, Delhi India.
3. Peter Linz, "An Introduction to Formal Language and Automata", Narosa Publishing
house.
4. YN Singh “Mathematical Foundation of Computer Science”, New Age International.
5. Malviya, AK "Theory of Computation and Application", BPaperback Publications
6. Papadimitrou, C. and Lewis, CL, “Elements of the Theory of Computation”, Pearson
Publication.
 7. K. Krithivasan and R. Rama; Introduction to Formal Languages, Automata Theory
and Computation; Pearson Education.
8. Harry R. Lewis and Christos H. Papadimitriou, Elements of the theory of
Computation, Second Edition, Prentice-Hall of India Pvt. Ltd.
9. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Learning.
10. Katuri Viswanath, “Introduction to Mathematical Computer Science, An” Universities
Press.

RCS451: OPERATING SYSTEMS LAB

1. To implement CPU Scheduling Algorithms
• FCFS
• SJF
• SRTF
• PRIORITY
• ROUND ROBIN
2. Simulate all Page Replacement Algorithms
• FIFO
• LRU
3. Simulate Paging Technique of Memory Management
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a
justified manner.

RCS452: SOFTWARE ENGINEERING LAB

For any given case/ problem statement do the following;
1. Prepare a SRS document in line with the IEEE recommended standards.
2. Draw the use case diagram and specify the role of each of the actors. Also state the
precondition, post condition and function of each use case.
3. Draw the activity diagram.
4. Identify the classes. Classify them as weak and strong classes and draw the class
diagram.
5. Draw the sequence diagram for any two scenarios.
6. Draw the collaboration diagram.
7. Draw the state chart diagram.
8. Draw the component diagram.
9. Perform forward engineering in java. (Model to code conversion)
10. Perform reverse engineering in java. (Code to Model conversion)
11. Draw the deployment diagram.
 RCS453: TAFL Lab
Understanding of software like JFLAP for experimenting with formal languages
1. Deterministic Finite Automata (DFA)
2. Nondeterministic Finite Automata (NFA)
3. Conversion of NFA to DFA
4. DFA Minimization
5. DFA to regular grammar conversion
6. DFA to regular expression conversion
7. Combining automata
8. Regular expression to DFA conversion
9. Mealy and Moore machine
10. Pushdown automata
11. Single tape Turing machine
12. Multi-tape Turing machine
13. Context free grammars (CFG) with single symbols
14. CFG with multiple symbols
15. LL Parsing
16. LR Parsing
17. Regular expressions
18. Regular pumping lemma
19. Context free pumping lemma
20. CFG to Chomsky Normal form transformation
 RCS454: PYTHON LANGUAGE PROGRAMMING LAB
Write a Python program to: -
1. Demonstrate the working of ‘id’ and ‘type’ functions
2. To find all prime numbers within a given range.
3. To print ‘n terms of Fibonacci series using iteration.
4. To demonstrate use of slicing in string
5.
a. To add 'ing' at the end of a given string (length should be at least 3). If the
given string already ends with 'ing' then add 'ly' instead. If the string length of
the given string is less than 3, leave it unchanged.
Sample String : 'abc'
Expected Result : 'abcing'
Sample String : 'string'
Expected Result : 'stringly'
b. To get a string from a given string where all occurrences of its first char have
been changed to '$', except the first char itself.
6.
a. To compute the frequency of the words from the input. The output should
output after sorting the key alphanumerically.
b. Write a program that accepts a comma separated sequence of words as input
and prints the words in a comma-separated sequence after sorting them
alphabetically.
7. Write a program that accepts a sequence of whitespace separated words as input and
prints the words after removing all duplicate words and sorting them
alphanumerically.
8. To demonstrate use of list & related functions
9. To demonstrate use of Dictionary& related functions
10. To demonstrate use of tuple, set& related functions
11. To implement stack using list
12. To implement queue using list
13. To read and write from a file
14. To copy a file
15. To demonstrate working of classes and objects
16. To demonstrate class method & static method
17. To demonstrate constructors
18. To demonstrate inheritance
19. To demonstrate aggregation/composition
20. To create a small GUI application for insert, update and delete in a table using Oracle
as backend and front end for creating form

The lab experiments for this course have to ensure that the following concepts of
PYTHON LANGUAGE are covered during lab classes:
Installing Python; basic syntax, interactive shell, editing, saving, and running a script, the
concept of data types; variables, assignments; immutable variables; numerical types;
arithmetic operators and expressions; reading input from console, writing to console,
comments in the program; understanding error messages; Conditions, Boolean logic, logical
operators; ranges; Control statements: if-else, loops (for, while);
String manipulations: subscript operator, indexing, slicing a string; other functions on strings:
string module, strings and number system, format functions: converting strings to numbers
and vice versa. Binary, octal, hexadecimal numbers
Lists, tuples, sets, and dictionaries: basic list operators, replacing, inserting, removing an
element; searching and sorting lists; dictionary literals, adding and removing keys, accessing
and replacing values; traversing dictionaries, Array in Python
Regular Expressions: re modules, match function, search function, modifiers and patterns
Design with functions: hiding redundancy, complexity; arguments and return values; formal
vs actual arguments, named arguments. Program structure and design. Recursive functions,
scope and global statements, Lambda expressions, Importing Modules, math Module &
Random Modules, creating own module.
Exception Handling: Exceptions, except clause, try and finally clause user defined exceptions
File Handling: manipulating files and directories, os and sys modules; text files:
reading/writing text and numbers from/to a file;
Simple Graphics: “turtle” module; simple 2d drawing - colors, shapes; digital images, image
file formats. Graphical user interfaces: event-driven programming paradigm; tkinter module,
creating simple GUI; buttons, labels, entry fields, dialogs; widget attributes - sizes, fonts,
colors layouts, nested frames.
Database: cx_ Oracle module, Connections, Executing Queries, calling procedure and
functions, Using GUI to access Database.
Object Oriented Programming: Concept of OOP: Abstraction, Encapsulation, Inheritance,
and Polymorphism in Python, classes, objects, attributes and methods; defining classes;
design with classes, constructors and destructors, inheritance, polymorphism, operator
overloading (_eq_, _str_, etc); abstract classes; aggregation and composition.

Reference books:
1. John M. Sewart, “Python for Scientist”, Cambridge Universities Press.
2. Reema Thareja, “Python Programming” Oxford Higher Education.
3. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in
Python” Pearson
4. Mrak Litz, “ Learning Python”,O’ Reilly
5. Mark Pilgrim, “Dive into Python”, Apress
6. James L. Young, “Python made Simple and Practical”, Kindle Edition (paperback)
7. Y. Daniel Liang “Introduction to Programming using Python” Pearson
DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY
LUCKNOW

Evaluation Scheme & Syllabus

For
B. Tech. Third Year
(Information Technology)

On

Choice Based Credit System

(Effective from the Session: 2018-19)

 B. Tech. (Information Technology)
FIFTH EMESTER
Th/Lab Sessional
Sl
Subject Code Subject Name L-T-P (ESE) Assig/ Total Credit
No. Test
Marks Att.
1 RAS501 MANEGERIAL ECONOMICS 3---0---0 70 20 10 100 3
RAS502/ INDUSTRIAL SOCIOLOGY /CYBER
2 RUC501 SECURITY 3---0---0 70 20 10 100 3
3 RCS-501 Database Management Systems 3---0---0 70 20 10 100 3
4 RCS-502 Design and Analysis of Algorithm 3---1---0 70 20 10 100 4
5 RCS-503 Principles of Programming Languages 3---0---0 70 20 10 100 3
6 IT-Elective-1 DEPTT ELECTIVE COURSE-1 3---1---0 70 20 10 100 4
7 RCS-551 Database Management Systems Lab 0---0---2 50 - 50 100 1
8 RCS-552 Design and Analysis of Algorithm Lab 0---0---2 50 - 50 100 1
9 Principles of Programming Languages 0---0---2 50 - 50 100 1
RCS-553
Lab
10 RIT-554 Object Oriented Techniques Lab 0---0---2 50 - 50 100 1
TOTAL 1000 24

SIXTH SEMESTER

Th/Lab Sessional
Sl
Subject Code Subject Name L-T-P (ESE) Assig/ Total Credit
No. Test
Marks Att.
1 RAS601 INDUSTRIAL MANAGEMENT 3---0---0 70 20 10 100 3
RAS602 / CYBER SECURITY/ INDUSTRIAL
2 RUC601 SOCIOLOGY 3---0---0 70 20 10 100 3
3 RCS-601 Computer Networks 3---0---0 70 20 10 100 3
4 RCS-602 Compiler Design 3---1---0 70 20 10 100 4
5 RCS-603 Web Technology 3---0---0 70 20 10 100 3
6 IT-Elective-2 DEPTT ELECTIVE COURSE-2 3---1---0 70 20 10 100 4
7 RCS-651 Computer Networks Lab 0---0---2 50 - 50 100 1
8 RCS-652 Compiler Design Lab 0---0---2 50 - 50 100 1
9 RCS-653 Web Technology Lab 0---0---2 50 - 50 100 1
10 RCS-654 Data Warehousing & Data Mining Lab 0---0---2 50 - 50 100 1
TOTAL 1000 24
 B. Tech. (Information Technology)
DEPARTMENTAL ELECTIVES

IT-ELECTIVE -1: Information Technology Elective-1

RIT-E11: SOFTWARE PROJECT MANAGEMENT

RIT-E12: SOFTWARE TESTING & AUDIT

RIT-E13: OBJECT ORIENTED TECHNIQUES

RCS-E11: OPERATION RESEARCH

IT-ELECTIVE-2: Information Technology Elective-2

RIT-E21: DESIGN AND DEVELOPMENT OF APPLICATIONS

RIT-E22: DATAWAREHOUSING & DATA MINING

RCS-E21: INTERNET OF THINGS

RCS-E22: NEURAL NETWORK

 RCS-501:Database Management Systems 3-0-0
Unit Topic Proposed
Lecture
Introduction: Overview, Database system Vs file system, Database system concept and
architecture, data model schema and instances, data independence and database language
and interfaces, data definitions language, DML, Overall Database Structure. Data Modeling
I using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping 08
constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization,
aggregation, reduction of an ER diagrams to tables, extended ER model, relationship of
higher degree.
Relational Data Model and Language: Relational data model Concepts, integrity
constraints, entity integrity, referential integrity, Keys constraints, Domain constraints,
relational algebra, relational calculus, tuple and domain calculus. Introduction on SQL:
II Characteristics of SQL, advantage of SQL. SQl data type and literals. Types of SQL 08
commands. SQL operators and their procedure. Tables, views and indexes. Queries and sub
queries. Aggregate functions. Insert, update and delete operations, Joins, Unions,
Intersection, Minus, Cursors, Triggers, Procedures in SQL/PL SQL
Data Base Design & Normalization: Functional dependencies, normal forms, first, second,
III third normal forms, BCNF, inclusion dependence, loss less join decompositions, 08
normalization using FD, MVD and JDs alternative approaches to database design
Transaction Processing Concept: Transaction system, Testing of serializability,
serializability of schedules, conflict & view serializable schedule, recoverability, Recovery
IV 08
from transaction failures, log based recovery, checkpoints, deadlock handling. Distributed
Database: distributed data storage, concurrency control, directory system.
Concurrency Control Techniques: Concurrency Control, Locking Techniques for
concurrency control, Time stamping protocols for concurrency control, validation based
V 08
protocol, multiple granularity, Multi version schemes, Recovery with concurrent transaction,
case study of Oracle.
References:
1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill
2. Date C J, “An Introduction to Database Systems”, Addision Wesley
3. Elmasri, Navathe, “ Fundamentals of Database Systems”, Addision Wesley
4. O’Neil, Databases, Elsevier Pub.
5. RAMAKRISHNAN"Database Management Systems",McGraw Hill
6. Leon & Leon,”Database Management Systems”, Vikas Publishing House
7. Bipin C. Desai, “ An Introduction to Database Systems”, Galgotia Publications
8. Majumdar & Bhattacharya, “Database Management System”, TMH
9. R.P. Mahapatra, Database Management System, Khanna Publishing House

9. Course on 'PHP & MySQL', Spoken Tutorial MOOC

 RCS-502: Design and Analysis of Algorithm 3-1-0
Unit Topic Proposed
Lecture

Introduction: Algorithms, Analyzing algorithms, Complexity of algorithms, Growth of

I functions, Performance measurements, Sorting and order Statistics - Shell sort, Quick sort, 08
Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear time.
Advanced Data Structures: Red-Black trees, B – trees, Binomial Heaps, Fibonacci Heaps,
II 08
Tries, skip list
Divide and Conquer with Examples such as Sorting, Matrix Multiplication, Convex hull
and Searching.
III Greedy methods with Examples such as Optimal Reliability Allocation, Knapsack, 08
Minimum Spanning trees – Prim’s and Kruskal’s algorithms, Single source shortest paths -
Dijkstra’s and Bellman Ford algorithms.
Dynamic Programming with Examples such as Knapsack. All pair shortest paths –
Warshal’s and Floyd’s algorithms, Resource allocation problem.
IV 08
Backtracking, Branch and Bound with examples such as Travelling Salesman Problem,
Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of subsets.
Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory
V 08
of NP-completeness, Approximation algorithms and Randomized algorithms

References:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of
India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
4. LEE "Design & Analysis of Algorithms (POD)",McGraw Hill
5. Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
6. Gajendra Sharma, Design & Analysis of Algorithms, Khanna Publishing House
7. Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
8. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples,
Second Edition, Wiley, 2006.
9. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997
10. Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
11. Harsh Bhasin,”Algorithm Design and Analysis”,First Edition,Oxford University Press.
12. Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995
 RCS-503: Principles of Programming Languages 3-0-0
Unit Topic Proposed
Lecture
Introduction : The Role of Programming Languages: Why Study Programming Languages,
Towards Higher-Level languages, Programming paradigms, Programming environments
I 08
Language Description: Syntactic structure, language Translation Issues: Programming
language Syntax, Stages in translation, Formal translation Models
Data, Data Types, and Basic Statements : Names , variables , binding, type checking,
scope, scope rules ,lifetime and garbage collection, primitive data types, strings, array
types, associative arrays ,record types, union types, pointers and references
II 08
, Arithmetic expressions , overloaded operators, type conversions , relational and boolean
expressions, assignment statements, mixed mode assignments, control structures, selection
,iterations, branching, guarded statements
Subprograms and Implementations : Subprograms ,design issues ,local referencing,
parameter passing, overloaded methods, generic methods, design issues for functions ,
III 08
semantics of call and return ,implementing simple subprograms , stack and dynamic local
variables, nested subprograms, , dynamic scoping.
Object-Orientation, Concurrency, and Event Handling : Grouping of data and Operations
— Constructs for Programming Structures, abstraction Information Hiding, Program Design
with Modules, Defined types, Object oriented programming — concept of Object,
IV 08
inheritance, Derived classes and Information hiding – Templates, Semaphores, Monitors,
Message passing, Threads,
statement level concurrency Exception handling (Using C++ and Java as example language).
Functional and Logic Programming Languages: Introduction to lambda calculus,
V fundamentals of functional programming languages, Programming with Programming with 08
ML, Introduction to logic and logic programming – Programming with Prolog.
References:
1. “Programming Languages: Design and Implementations” , Terrance W.Pratt, Marvin V. Zelkowitz,
T.V.Gopal,Fourth ed.,Prentice Hall
2. “Programming Language Design Concept”, David A. Watt, Willey India
3. “Programming languages: Concepts and Constucts”, Ravi Sethi, Second Ed.,Pearson.
4. “Types and programming Languages”, Benjamin C. Pierce. The MIT Press Cambridge, Massachusetts
London, England
5. Concepts of Programming Languages, Robert W. Sebesta, 10 th Ed.,Pearson
 IT-ELECTIVE -1: Information Technology Elective-1
RIT-E11: SOFTWARE PROJECT MANAGEMENT 3-0-0
Unit Topic Proposed
Lecture
Introduction and Software Project Planning: Fundamentals of Software Project
Management (SPM), Need Identification, Vision and Scope document, Project Management
I Cycle, SPM Objectives, Management Spectrum, SPM Framework, Software Project
08
Planning, Planning Objectives, Project Plan, Types of project plan, Structure of a Software
Project Management Plan, Software project estimation, Estimation methods, Estimation
models, Decision process.
Project Organization and Scheduling Project Elements: Work Breakdown Structure
(WBS), Types of WBS, Functions, Activities and Tasks, Project Life Cycle and Product Life
Cycle, Ways to Organize Personnel, Project schedule, Scheduling Objectives, Building the
II project schedule, Scheduling terminology and techniques, Network Diagrams: PERT, CPM, 08
Bar Charts: Milestone Charts, Gantt Charts. (SPI), Interpretation of Earned Value Indicators,
Error Tracking, Software Reviews, Types of Review: Inspections, Deskchecks,
Walkthroughs, Code Reviews, Pair Programming..
Project Monitoring and Control: Dimensions of Project Monitoring & Control, Earned
Value Analysis, Earned Value Indicators: Budgeted Cost for Work Scheduled (BCWS), Cost
Variance (CV), Schedule Variance (SV), Cost Performance Index (CPI), Schedule
III 08
Performance Index (SPI), Interpretation of Earned Value Indicators, Error Tracking,
Software Reviews, Types of Review: Inspections, Deskchecks, Walkthroughs, Code
Reviews, Pair Programming.
Software Quality Assurance and Testing Objectives: Testing Principles, Test Plans, Test
Cases, Types of Testing, Levels of Testing, Test Strategies, Program Correctness, Program
Verification & validation, Testing Automation & Testing Tools, Concept of Software
IV 08
Quality, Software Quality Attributes, Software Quality Metrics and Indicators, The SEI
Capability Maturity Model CMM), SQA Activities, Formal SQA Approaches: Proof of
correctness, Statistical quality assurance, Cleanroom process.
Project Management and Project Management Tools Software Configuration
Management: Software Configuration Items and tasks, Baselines, Plan for Change, Change
Control, Change Requests Management, Version Control, Risk Management: Risks and risk
V 08
types, Risk Breakdown Structure (RBS), Risk Management Process: Risk identification,
Risk analysis, Risk planning, Risk monitoring, Cost Benefit Analysis, Software Project
Management Tools: CASE Tools, Planning and Scheduling Tools, MS-Project.
References:
1. M. Cotterell, Software Project Management, Tata McGraw-Hill Publication.
2. Royce, Software Project Management, Pearson Education
3. Kieron Conway, Software Project Management, Dreamtech Press
4. S. A. Kelkar, Software Project Management, PHI Publication.
5. Harold R. Kerzner, Project Mangment “A Systems Approach to Planning, Scheduling, and Controlling” Wiley.
6. Mohapatra, Software Project Management, Cengage Learning.
7. P.K. Agarwal, SAM R., Software Project Management, Khanna Publishing House
 RIT-E12: SOFTWARE TESTING & AUDIT 3-0-0
Unit Topic Proposed
Lecture
Review of Software Engineering: Overview of Software Evolution, SDLC, Testing
Process, Terminologies in Testing: Error, Fault, Failure, Verification, Validation, Difference
Between Verification and Validation, Test Cases, Testing Suite, Test ,Oracles, Impracticality
I of Testing All Data; Impracticality of Testing AllPaths. 08
Verification: Verification Methods, SRS Verification, Source Code Reviews, User
Documentation Verification, Software, Project Audit, Tailoring Software Quality Assurance
Program by Reviews, Walkthrough, Inspection and Configuration Audits.
Functional Testing: Boundary Value Analysis, Equivalence Class Testing, Decision Table
Based Testing, Cause Effect Graphing Technique.
II Structural Testing: Control Flow Testing, Path Testing, Independent Paths, Generation of 08
Graph from Program, Identification of Independent Paths, Cyclomatic Complexity, Data
Flow Testing, Mutation Testing
Regression Testing: What is Regression Testing? Regression Test cases selection, Reducing
the number of test cases, Code coverage prioritization technique.
III 08
Reducing the number of test cases: Prioritization guidelines, Priority category, Scheme,
Risk Analysis.
Software Testing Activities: Levels of Testing, Debugging, Testing techniques and their
applicability, Exploratory Testing
IV Automated Test Data Generation: Test Data, Approaches to test data generation, test data 08
generation using genetic algorithm, Test Data Generation Tools, Software Testing Tools, and
Software test Plan.
Object Oriented Testing: Definition, Issues, Class Testing, Object Oriented Integration
and System Testing.
V 08
Testing Web Applications: Web Testing, User Interface Testing, Usability Testing,
Security Testing, Performance Testing, Database testing, Post Deployment Testing.
References:
1 Yogesh Singh, “Software Testing”, Cambridge University Press, New York, 2012
2. K..K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age International Publishers,
New Delhi, 2003.
3. Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, Fifth Edition,
McGraw-Hill International Edition, New Delhi,2001.
4. Marc Roper, “Software Testing”, McGraw-Hill Book Co., London, 1994.
5. M.C. Trivedi, Software Testing & Audit, Khanna Publishing House
6. Boris Beizer, “Software System Testing and Quality Assurance”, Van Nostrand Reinhold, New
York, 1984.
 RIT-E13: OBJECT ORIENTED TECHNIQUES 3-0-0
Unit Topic Proposed
Lecture
Introduction: The meaning of Object Orientation, object identity, Encapsulation, information
I hiding, polymorphism, generosity, importance of modelling, principles of modelling, object 08
oriented modelling, Introduction to UML, conceptual model of the UML, Architecture.
Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams. Class
&Object Diagrams: Terms, concepts, modelling techniques for Class & Object Diagrams.
Collaboration Diagrams: Terms, Concepts, depicting a message, polymorphism in collaboration
Diagrams, iterated messages, use of self in messages. Sequence Diagrams: Terms, concepts,
II depicting asynchronous messages with/without priority, call-back mechanism, broadcast messages. 08
Basic Behavioural Modeling: Use cases, Use case Diagrams, Activity Diagrams, State Machine ,
Process and thread, Event and signals, Time diagram, interaction diagram, Package diagram.
Architectural Modeling: Component, Deployment, Component diagrams and Deployment
diagrams.
Object Oriented Analysis: Object oriented design, Object design, Combining three models,
Designing algorithms, design optimization, Implementation of control, Adjustment of inheritance,
Object representation, Physical packaging, Documenting design considerations.
Structured analysis and structured design (SA/SD), Jackson Structured Development
III (JSD).Mapping object oriented concepts using non-object oriented language, Translating classes 08
into data structures, Passing arguments to methods, Implementing inheritance, associations
encapsulation.
Object oriented programming style: reusability, extensibility, robustness, programming in the
large. Procedural v/s OOP, Object oriented language features. Abstraction and Encapsulation.
C++ Basics : Overview, Program structure, namespace, identifiers, variables, constants, enum,
operators, typecasting, control structures
C++ Functions : Simple functions, Call and Return by reference, Inline functions, Macro Vs. Inline
IV 08
functions, Overloading of functions, default arguments, friend functions, virtual functions
Course on C and CPP (Spoken Tutorial MOOC)

Objects and Classes : Basics of object and class in C++, Private and public members, static data
and function members, constructors and their types, destructors, operator overloading, type
conversion.
V Inheritance : Concept of Inheritance, types of inheritance: single, multiple, multilevel, hierarchical, 08
hybrid, protected members, overriding, virtual base class
Polymorphism : Pointers in C++, Pointes and Objects, this pointer, virtual and pure virtual
functions, Implementing polymorphism
References:
1. James Rumbaugh et. al, “Object Oriented Modeling and Design”, PHI
2. Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User Guide”, Pearson Education
3. Object Oriented Programming With C++, E Balagurusamy, TMH
4. R. S. Salaria, Mastering Object Oriented Programming with C++, Khanna Publishing House
5. C++ Programming, Black Book, Steven Holzner, dreamtech
6. Object Oriented Programming in Turbo C++, Robert Lafore, Galgotia
7. Object Oriented Programming with ANSI and Turbo C++, Ashok Kamthane, Pearson
8. The Compete Reference C++, Herbert Schlitz, TMH
9. C++ and Object Oriented Programming Paradigm, PHI
10. C++ : How to Program, 9th Edition, Deitel and Deitel, PHI
11. Object Oriented Programming with C++, Saurav Sahay, Oxford
 RCS-E11: OPERATION RESEARCH 3-0-0
Unit Topic Proposed
Lecture

Definition and scope of operations research (OR), OR model, solving the OR model, art of
modelling, phases of OR study.
I Linear Programming: Two variable Linear Programming model and Graphical method of 08
solution, Simplex method, Dual Simplex method, special cases of Linear Programming,
duality, sensitivity analysis.
Transportation Problems: Types of transportation problems, mathematical models ,
II transportation algorithms, 08
Assignment: Allocation and assignment problems and models, processing of job through
machines.
Network Techniques: Shortest path model, minimum spanning Tree Problem, Max‐Flow
problem and Min‐cost problem.
III 08
Project Management:
Phases of project management, guidelines for network construction, CPM and PERT.
Theory of Games : Rectanagular games, Minimax theorem, graphical solution of 2 x n or m
x 2 games, game with mixed strategies, reduction to linear programming model.
IV 08
Quality Systems: Elements of Queuing model, generalized poisson queuing model, single
server models.
Control: Models of inventory, operation of inventory system, quantity discount.
V Replacement: Replacement models: Equipment’s that deteriorate with time, equipment’s that 08
fail with time.
References:
1. Wayne L. Winston, “Operations Research” Thomson Learning,2003.
2. Hamdy H. Taha, “Operations Research‐An Introduction” Pearson Education,2003.
3. R. Panneer Seevam, “Operations Research” PHI Learning, 2008.
4. V.K.Khanna, “Total Quality Management” New Age International, 2008.
5. T.Veerarajan "Operation Research" Universities Press
RCS-551 Database Management Systems Lab
Objectives:
1. Installing oracle/ MYSQL
2. Creating Entity-Relationship Diagram using case tools.
3. Writing SQL statements Using ORACLE /MYSQL:
 Writing basic SQL SELECT statements.
 Restricting and sorting data.
 Displaying data from multiple tables.
 Aggregating data using group function.
 Manipulating data.
 eCreating and managing tables.
4. Normalization
5. Creating cursor
6. Creating procedure and functions
7. Creating packages and triggers
8. Design and implementation of payroll processing system
9. Design and implementation of Library Information System
10. Design and implementation of Student Information System
11. Automatic Backup of Files and Recovery of Files

9. Course on 'PHP & MySQL', Spoken Tutorial MOOC

RCS-552 Design and Analysis of Algorithm Lab

Objective:-
1. Program for Recursive Binary & Linear Search.
2. Program for Heap Sort.
3. Program for Merge Sort.
4. Program for Selection Sort.
5. Program for Insertion Sort.
6. Program for Quick Sort.
7. Knapsack Problem using Greedy Solution
8. Perform Travelling Salesman Problem
9. Find Minimum Spanning Tree using Kruskal’s Algorithm
10. Implement N Queen Problem using Backtracking
RCS-553 Principles of Programming Languages Lab
Objective:-
1. Program for linear search in ML
2. Program for binary search in ML
3. Program for insertion sort in ML
4. Program for bubble sort in ML
5. Program for merge sort in ML
6. Program for Quick sort in ML
7. Program for making a dictionary in ML
8. Program for merging two unsorted-students-name-list in sorted order

RIT-554 Object Oriented Techniques Lab

It is expected that student should analyze, design and develop application based on object oriented techniques. The some
case studies are as follows (Subject Teacher may add more):
1. The Library System : This application will support the operations of a technical library for a university department.
This includes the searching for and lending of technical library materials, including books, videos, and technical journals.
All library items have registration code (research area code + running number). Each borrower can borrow up to 10 items.
Each type of library item can be borrowed for a different period of time (books 6 weeks, journals 3 days, videos 1 week). If
returned after their due date, the employee will be charged a fine, based on the type of item (books 5:-/day, journals and
videos 20:- /day). Materials will be lent to employees only if they have (1) no overdue lendables, (2) fewer than 10 articles
out, and (3) total fines less than 100. For this case, develop the following:
1.) Use case Diagram
2.) Conceptual/Domain Diagram – You will define your own fields as they are not specifically mentioned on the story.
2. The Downtown Rental System: DownTown Videos is a chain of 11 video stores scattered throughout a major
metropolitan area in the MidWest. The chain started with a single store several years ago and has grown to its present size.
Paul Lowes, the owner of the chain, knows that competing with the national chains will require a state-of-the-art movie
rental system. You have been asked to develop the system requirements for the new system.
Each store has a stock of movies and video games for rent. For the first iteration, just focus on the movies. It is important
to keep track of each movie title: to know and to identify its category (classical, drama, comedy, etc), its rental type (new
release, standard), movie rating, and other general information such as movie producer, release date, and cost. In addition
to tracking each title, the business must track individual copies to note their purchase their purchase date, condition, type
(VHS or DVD), and their rental status. Use functions must be provided to maintain this inventory information.
Customers, the lifeblood of the business, are also tracked. DownTown considers each household to be a customer, so special
mailings and promotions are offered to each household. For any given customer, several people may be authorized to rent
videos and games. The primary contact for each customer can also establish several parameters for other members of the
household. For example, the parent wants to limit a child’s rental authorization to only PG and PG-13 movies, the system
will track that.
Each time a movie is rented, the system must keep track of which copies of which movies are rented, the rental date &
time, and the household & person renting the movie. Each rental is considered to be open until all of the movies and games
have been returned. Customers pay for rentals when checking out videos at the store.
For this case, develop the following diagrams:
1.) A use-case diagram. Analyze user functions.
2.) A conceptual model
 B. Tech. (Information Technology)
SIXTH EMESTER (DETAILED SYLLABUS)

RCS-601: COMPUTER NETWORKS 3-0-0

Unit Topic Proposed
Lecture
Introduction Concepts: Goals and Applications of Networks, Network structure and
Architecture, The OSI reference model, services, Network Topology Design - Delay
I 08
Analysis, Back Bone Design, Local Access Network Design, Physical Layer Transmission
Media, Switching methods, ISDN, Terminal Handling
Medium Access Sub Layer: Medium Access Sub Layer - Channel Allocations, LAN
II Protocols - ALOHA protocols - Overview of IEEE standards - FDDI. Data Link Layer - 08
Elementary Data Link Protocols, Sliding Window protocols, Error Handling.
Network Layer: Network Layer - Point - to Pont Networks, routing, Congestion control
III 08
Internetworking -TCP / IP, IP packet, IP address, IPv6.
Transport Layer: Transport Layer - Design issues, connection management, session Layer-
IV Design issues, remote procedure call. Presentation Layer-Design issues, Data compression 08
techniques, cryptography - TCP - Window Management.
Application Layer: Application Layer: File Transfer, Access and Management, Electronic
V mail, Virtual Terminals, Other application. Example Networks - Internet and Public 08
Networks
References:
1. Forouzen, "Data Communication and Networking", TMH
2. A.S. Tanenbaum, Computer Networks, Pearson Education
3. W. Stallings, Data and Computer Communication, Macmillan Press
4. Gary R.Wright,W.Richard Stevens "TCP/IP Illustrated,Volume2 The Implementation" Addison-Wesley
5. Michael A. Gallo and William M. Hancock "Computer communucation and Networking Technology" Cengage
Learning
6. Bhavneet Sidhu, An Integrated approach to Computer Networks, Khanna Publishing House
7. Anuranjan Misra, “Computer Networks”, Acme Learning
8. G. Shanmugarathinam, ”Essential of TCP/ IP”, Firewall Media
 RCS-602: COMPILER DESIGN 3-1-0
Unit Topic Proposed
Lecture
Introduction to Compiler: Phases and Passes, Bootstrapping, Finite state machines and
regular expressions and their applications to lexical analysis, Optimization of DFA-Based
Pattern Matchers implementation of lexical analyzers, lexical-analyzer generator, LEX
I 08
compiler, Formal grammars and their application to syntax analysis, BNF notation,
ambiguity, YACC. The syntactic specification of programming languages: Context free
grammars, derivation and parse trees, capabilities of CFG.
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top
down parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers,
II the canonical Collection of LR(0) items, constructing SLR parsing tables, constructing 08
Canonical LR parsing tables, Constructing LALR parsing tables, using ambiguous
grammars, an automatic parser generator, implementation of LR parsing tables.
Syntax-Directed Translation: Syntax-directed Translation schemes, Implementation of
Syntax-directed Translators, Intermediate code, postfix notation, Parse trees & syntax trees,
three address code, quadruple & triples, translation of assignment statements, Boolean
III 08
expressions, statements that alter the flow of control, postfix translation, translation with a
top down parser. More about translation: Array references in arithmetic expressions,
procedures call, declarations and case statements.
Symbol Tables: Data structure for symbols tables, representing scope information. Run-
Time Administration: Implementation of simple stack allocation scheme, storage allocation
IV 08
in block structured language. Error Detection & Recovery: Lexical Phase errors, syntactic
phase errors semantic errors.
Code Generation: Design Issues, the Target Language. Addresses in the Target Code, Basic
Blocks and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code optimization:
V 08
Machine-Independent Optimizations, Loop optimization, DAG representation of basic
blocks, value numbers and algebraic laws, Global Data-Flow analysis.
REFRENCES:
1. Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools”, Pearson Education
2. V Raghvan, “ Principles of Compiler Design”, TMH
3. Kenneth Louden,” Compiler Construction”, Cengage Learning.
4. Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson Education
5. .K. Muneeswaran,Compiler Design,First Edition,Oxford University Press.
6. J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, Tata McGraw-Hill,2003.
7. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, PHI, 2001
 RCS-603: WEB TECHNOLOGIES 3-0-0
Unit Topic Proposed
Lecture
Introduction: Introduction and Web Development Strategies, History of Web and Internet,
Protocols governing Web, Writing Web Projects, Connecting to Internet, Introduction to
Internet services and tools, Introduction to client-server computing. Core Java: Introduction,
I 08
Operator, Data type, Variable, Arrays, Methods & Classes, Inheritance, Package and Interface,
Exception Handling, Multithread programming, I/O, Java Applet, String handling, Event
handling, Introduction to AWT, AWT controls, Layout managers
Web Page Designing: HTML: list, table, images, frames, forms, CSS, Document type
II definition, XML: DTD, XML schemes, Object Models, presenting and using XML, Using XML 08
Processors: DOM and SAX, Dynamic HTML
Scripting: Java script: Introduction, documents, forms, statements, functions, objects;
introduction to AJAX,
III 08
Networking: Internet Addressing, InetAddress, Factory Methods, Instance Methods, TCP
/IP Client Sockets, URL, URL Connection, TCP/IP Server Sockets, Datagrams.
Enterprise Java Bean: Preparing a Class to be a JavaBeans, Creating a JavaBeans, JavaBeans
Properties, Types of beans, State full Session bean, Stateless Session bean, Entity bean
Java Database Connectivity (JDBC): Merging Data from Multiple Tables: Joining, M
IV 08
anipulating ,Databases with JDBC, Prepared Statements, Transaction Processing, Stored
Procedures.
Servlets: Servlet Overview and Architecture, Interface Servlet and the Servlet Life Cyc
le, HandlingHTTP get Requests, Handling HTTP post Requests, Redirecting Requests t
o Other Resources, Session Tracking, Cookies, Session Tracking with HttpSession
V 08
JavaServer Pages (JSP): Introduction, JavaServer Pages Overview,
A First JavaServer Page Example, Implicit Objects, Scripting, Standard Actions, Directives,
Custom Tag Libraries..
References:
1. Burdman, Jessica, “Collaborative Web Development” Addison Wesley
2. Xavier, C, “ Web Technology and Design” , New Age International
3. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication
4. Bhave, “Programming with Java”, Pearson Education
5. Herbert Schieldt, “The Complete Reference:Java”, TMH.
6. Hans Bergsten, “Java Server Pages”, SPD O’Reilly
7. Tanveer Alam, Internet and Java Programming, Khanna Publishing House
8. Margaret Levine Young, “The Complete Reference Internet”, TMH
9. Naughton, Schildt, “The Complete Reference JAVA2”, TMH
10. Balagurusamy E, “Programming in JAVA”, TMH
11. . Ramesh Bangia, “Internet and Web Design” , New Age International
12. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication
13. Deitel, “Java for programmers”, Pearson Education
14. Chris Bates, “Web Programing Building Internet Applications”, 2nd Edition, WILEY, Dreamtech
15. Joel Sklar , “Principal of web Design” Vikash and Thomas Learning
16. Horstmann, “CoreJava”, Addison Wesley
 IT-ELECTIVE-2: Information Technology Elective-2
RIT-E21: DESIGN AND DEVELOPMENT OF APPLICATIONS 3-0-0
Unit Topic Proposed
Lecture
INTRODUCTION: Introduction to mobile applications – Embedded systems - Market and
I business drivers for mobile applications – Publishing and delivery of mobile applications – 08
Requirements gathering and validation for mobile applications
BASIC DESIGN: Introduction – Basics of embedded systems design – Embedded OS -
Design constraints for mobile applications, both hardware and software related – 08
II Architecting mobile applications – User interfaces for mobile applications – touch events
and gestures – Achieving quality constraints – performance, usability, security, availability
and modifiability.
ADVANCED DESIGN: Designing applications with multimedia and web access
capabilities – Integration with GPS and social media networking applications – Accessing 08
III
applications hosted in a cloud computing environment – Design patterns for mobile
applications.
TECHNOLOGY I – ANDROID: Introduction – Establishing the development
environment – Android architecture – Activities and views – Interacting with UI – Persisting 08
IV
data using SQLite – Packaging and deployment – Interaction with server side applications –
Using Google Maps, GPS and Wi-Fi – Integration with social media applications.
TECHNOLOGY II –iOS: Introduction to Objective C – iOS features – UI implementation
– Touch frameworks – Data persistence using Core Data and SQLite – Location aware 08
V applications using Core Location and Map Kit – Integrating calendar and address book with
social media application – Using Wi-Fi - iPhone marketplace. Swift: Introduction to Swift,
features of swift.
References:
1. Charlie Collins, Michael Galpin and Matthias Kappler, “Android in Practice”, DreamTech, 2012
2. AnubhavPradhan , Anil V Despande Composing Mobile Apps,Learn ,explore,apply
3. James Dovey and Ash Furrow, “Beginning Objective C”, Apress, 2012
4. Jeff McWherter and Scott Gowell, "Professional Mobile Application Development", Wrox, 2012
5. David Mark, Jack Nutting, Jeff LaMarche and Frederic Olsson, “Beginning iOS
6 .Development: Exploring the iOS SDK”, Apress, 2013.
 RIT-E22: DATAWAREHOUSING & DATA MINING 3-0-0
Unit Topic Proposed
Lecture

Data Warehousing: Overview, Definition, Data Warehousing Components, Building a

Data Warehouse, Warehouse Database, Mapping the Data Warehouse to a Multiprocessor
I 08
Architecture, Difference between Database System and Data Warehouse, Multi Dimensional
Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept
Data Warehouse Process and Technology: Warehousing Strategy, Warehouse
/management and Support Processes, Warehouse Planning and Implementation, Hardware
II and Operating Systems for Data Warehousing, Client/Server Computing Model & Data 08
Warehousing. Parallel Processors & Cluster Systems, Distributed DBMS implementations,
Warehousing Software, Warehouse Schema Design,
Data Mining: Overview, Motivation, Definition & Functionalities, Data Processing, Form
of Data Pre-processing, Data Cleaning: Missing Values, Noisy Data, (Binning, Clustering,
Regression, Computer and Human inspection), Inconsistent Data, Data Integration and
III 08
Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality reduction, Data
Compression, Numerosity Reduction, Discretization and Concept hierarchy generation,
Decision Tree.
Classification: Definition, Data Generalization, Analytical Characterization, Analysis of
attribute relevance, Mining Class comparisons, Statistical measures in large Databases,
Statistical-Based Algorithms, Distance-Based Algorithms, Decision Tree-Based
Algorithms. Clustering: Introduction, Similarity and Distance Measures, Hierarchical and
IV 08
Partitioned Algorithms. Hierarchical Clustering- CURE and Chameleon. Density Based
Methods-DBSCAN, OPTICS. Grid Based Methods- STING, CLIQUE. Model Based
Method –Statistical Approach, Association rules: Introduction, Large Itemsets, Basic
Algorithms, Parallel and Distributed Algorithms, Neural Network approach.
Data Visualization and Overall Perspective: Aggregation, Historical information, Query
Facility, OLAP function and Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data
V Mining interface, Security, Backup and Recovery, Tuning Data Warehouse, Testing Data 08
Warehouse. Warehousing applications and Recent Trends: Types of Warehousing
Applications, Web Mining, Spatial Mining and Temporal Mining
References:
1. Alex Berson, Stephen J. Smith “Data Warehousing, Data-Mining & OLAP”, TMH
2. Mark Humphries, Michael W. Hawkins, Michelle C. Dy, “ Data Warehousing: Architecture and Implementation”,
Pearson
3. I Singh, Data Mining and Warehousing, Khanna Publishing House
4. Margaret H. Dunham, S. Sridhar,”Data Mining:Introductory and Advanced Topics” Pearson Education
5. Arun K. Pujari, “Data Mining Techniques” Universities Press
6. Pieter Adriaans, Dolf Zantinge, “Data-Mining”, Pearson Education
 RCS-E21: INTERNET OF THINGS 3-0-0
Unit Topic Proposed
Lecture
Internet of Things (IoT): Vision, Definition, Conceptual Framework, Architectural view,
technology behind IoT, Sources of the IoT, M2M Communication, IoT Examples .
I Design Principles for Connected Devices: IoT/M2M systems layers and design 08
standardization, communication technologies, data enrichment and consolidation, ease of
designing and affordability.
Hardware for IoT: Sensors, Digital sensors, actuators, radio frequency identification
(RFID) technology, wireless sensor networks, participatory sensing technology.
II Embedded Platforms for IoT: Embedded computing basics, Overview of IOT supported 08
Hardware platforms such as Arduino, NetArduino, Raspberry pi, Beagle Bone, Intel Galileo
boards and ARM cortex.
Network & Communication aspects in IoT: Wireless Medium access issues, MAC
III protocol survey, Survey routing protocols, Sensor deployment & Node discovery, Data 08
aggregation & dissemination
Programming the Ardunio: Ardunio Platform Boards Anatomy, Ardunio IDE, coding,
IV 08
using emulator, using libraries, additions in ardunio, programming the ardunio for IoT.
Challenges in IoT Design challenges: Development Challenges, Security Challenges, Other
challenges
V IoT Applications : Smart Metering, E-health, City Automation, Automotive Applications, 08
home automation, smart cards, Communicating data with H/W units, mobiles, tablets,
Designing of smart street lights in smart city.
References:
1. Olivier Hersent,DavidBoswarthick, Omar Elloumi“The Internet of Things key applications and protocols”,
willey
2. Jeeva Jose, Internet of Things, Khanna Publishing House
3. Michael Miller “The Internet of Things” by Pearson
4. Raj Kamal “INTERNET OF THINGS”, McGraw-Hill, 1ST Edition, 2016
5. ArshdeepBahga, Vijay Madisetti “ Internet of Things( A hands on approach)” 1ST edition, VPI
publications,2014
6. Adrian McEwen,Hakin Cassimally “Designing the Internet of Things” Wiley India
 RCS-E22: NEURAL NETWORK 3-0-0
Unit Topic Proposed
Lecture
Neuro Computing and Neuroscience: Historical notes, human Brain, neuron Mode l,
Knowledge representation, Al and NN. Learning process: Supervised and unsupervised
I 08
learning, Error correction learning, competitive learning, adaptation, statistical nature of the
learning process.
Data Processing Scaling: Normalization, Transformation (FT/FFT), principal component
analysis, regression, co-variance matrix, Eigen values &Eigen vectors. Basic Models of
II Artificial neurons, activation Functions, aggregation function, single neuron computation, 08
multilayer perceptron, least mean square algorithm, gradient descent rule, nonlinearly
separable problems and bench mark problems in NN.
Multilayered Network Architecture: Back propagation algorithm, heuristics for making
BP-algorithm performs better. Accelerated learning BP (like recursive least square, quick
III 08
prop, RPROP algorithm), approximation properties of RBF networks and comparison with
multilayer perceptron.
Recurrent Network and Temporal Feed-Forward Network: Implementation with BP,
self organizing map and SOM algorithm, properties of feature map and computer simulation.
IV 08
Principal component and Independent component analysis, application to image and signal
processing
Complex Valued NN and Complex Valued BP: Analyticity of Activation function,
V application in 2D information processing. Complexity analysis of network models. Soft 08
computing. Neuro-Fuzzy-genetic algorithm Integration
References:
1.J.A. Anderson, An Introduction to Neural Networks, MIT
2. Hagen Demuth Beale, Neural Network Design, Cengage Learning
3. Munesh Chandra Trivedi, NN Jani, Artificial Neural Network Technology, Khanna Publishing House
4. Laurene V. Fausett, "Fundamentals of Neural Networks : Architectures, Algorithms and Applications", Pearson India
5. Kosko, Neural Network and Fuzzy Sets, PHI 5. Hagan, Neural Network Design w/CD,Cengage Learning
RCS-651: COMPUTER NETWORKS LAB

1. To learn handling and configuration of networking hardware like RJ-45 connector, CAT-6 cable, crimping tool, etc.
2. Configuration of router, hub, switch etc. (using real devices or simulators)
3. Running and using services/commands like ping, traceroute, nslookup, arp, telnet, ftp, etc.
4. Network packet analysis using tools like Wireshark, tcpdump, etc.
5. Network simulation using tools like Cisco Packet Tracer, NetSim, OMNeT++, NS2, NS3, etc.
6. Socket programming using UDP and TCP (e.g., simple DNS, data & time client/server, echo client/server, iterative &
concurrent servers)
7. Programming using raw sockets
8. Programming using RPC

Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner.

RCS-652: COMPILER DESIGN LAB

1. Implementation of LEXICAL ANALYZER for IF STATEMENT

2. Implementation of LEXICAL ANALYZER for ARITHMETIC EXPRESSION
3. Construction of NFA from REGULAR EXPRESSION
4. Construction of DFA from NFA
5. Implementation of SHIFT REDUCE PARSING ALGORITHM
6. Implementation of OPERATOR PRECEDENCE PARSER
7. Implementation of RECURSIVE DESCENT PARSER
8. Implementation of CODE OPTIMIZATION TECHNIQUES
9. Implementation of CODE GENERATOR

Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner.

RCS-653 Web Technology Lab

It is expected that student will apply concept of Java and Advance Java in Lab :
1. Write HTML/Java scripts to display your CV in navigator, your Institute website, Department Website and Tutorial
website for specific subject
2. Design HTML form for keeping student record and validate it using Java script.
3. Write an HTML program to design an entry form of student details and send it to store at database server like SQL,
Oracle or MS Access.
4. Write programs using Java script for Web Page to display browsers information.
5. Write a Java applet to display the Application Program screen i.e. calculator and other.
6. Writing program in XML for creation of DTD, which specifies set of rules. Create a style sheet in CSS/ XSL & display
the document in internet explorer.
7. Program to illustrate JDBC connectivity. Program for maintaining database by sending queries. Design and implement
a simple servlet book query with the help of JDBC & SQL. Create MS Access Database, Create on ODBC link, Compile
& execute JAVA JDVC Socket.
8. Install TOMCAT web server and APACHE. Access the above developed static web pages for books web site, using
these servers by putting the web pages developed .
9. Assume four users user1, user2, user3 and user4 having the passwords pwd1, pwd2, pwd3 and pwd4 respectively. Write
a servlet for doing the following. Create a Cookie and add these four user id’s and passwords to this Cookie. 2. Read the
user id and passwords entered in the Login form and authenticate with the values available in the cookies.
10. Install a database (Mysql or Oracle). Create a table which should contain at least the following fields: name, password,
email-id, phone number Write a java program/servlet/JSP to connect to that database and extract data from the tables and
display them. Insert the details of the users who register with the web site, whenever a new user clicks the submit button in
the registration page.
11. Write a JSP which insert the details of the 3 or 4 users who register with the web site by using registration form.
Authenticate the user when he submits the login form using the user name and password from the database
12. Design and implement a simple shopping cart example with session tracking API.

RCS-654: Data Warehousing & Data Mining Lab

It is expected that student should implement concept of Data Mining and Warehousing. The open source
Data Mining Tools like Rapid Miner, Weka etc. can be used to implement the concept of Data Mining and Warehousing.
Some examples are as follows (Subject Teacher may add more):

1. Implementation of OLAP operations

2. Implementation of Varying Arrays
3. Implementation of Nested Tables
4. Demonstration of any ETL tool
5. Write a program of Apriori algorithm using any programming language.
6. Create data-set in .arff file format. Demonstration of preprocessing on WEKA data-set.
7. Demonstration of Association rule process on data-set contact lenses.arff /supermarket (or any other data set) using
apriori algorithm.
8. Demonstration of classification rule process on WEKA data-set using j48 algorithm.
9. Demonstration of classification rule process on WEKA data-set using Naive Bayes algorithm.
10. Demonstration of clustering rule process on data-set iris.arff using simple k-means.
 Dr.A.P.J.Abdul
kalam Technical University,UttarPardesh,Lucknow
(Formerly Uttar Pradesh Technical University)
STUDY EVALUATION SCHEME
INFORMATION TECHNOLOGY
YEAR forth, SEMESTER –VII
(Effective from the session: 2016-17)

S.No. Subject Subject Period Evaluation Scheme Total

Code
Sessional Exam
Credit
CT TA Total

Open Elective I 4
1 3-1-0 30 20 50 100 150
2 NIT-701 Cryptography & Network Security 3-1-0 30 20 50 100 150 4

3 NCS-702 Artificial Intelligence 3-1-0 30 20 50 100 150 4

Departmental Elective III 4
4 3-1-0 30 20 50 100 150
Departmental Elective IV 4
5 3-1-0 30 20 50 100 150
Practical / Training /Projects

Cryptography & Network 1

6 NIT-751 Security* 0-0-2 - 20 20 30 50

7 NCS-752 Project 0-0-6 - 100 100 - 100

3
8 NCS-753 Industrial Training 0-0-2 - 50 50 - 50 1

9 GP-701 General Proficiency - - - - - 50

Total 15-5-10 1000 25

1. Practical Training done after 6th Semester would be evaluated in 7th semester through Report and Viva-voce.
2. Project has to be initiated in 7th semester beginning and completed by the end of 8th semester with proper report and demonstration.

* At least 10 problems are to be considered based on corresponding theory course.

B. TECH. INFORMATION TECHNOLOGY forth Page 1

 Dr.A.P.J.Abdulkalam Technical University,UttarPardesh,Lucknow
(Formerly Uttar Pradesh Technical University)
STUDY EVALUATION SCHEME
INFORMATION TECHNOLOGY
YEAR forth, SEMESTER –VIII
(Effective from the session: 2016-17)

SNo Subject Code Subject Period Evaluation Scheme Total

Sessional Exam

CT TA Total Credit

Open Elective II 4

1 3-1-0 30 20 50 100 150

2 NIT-801 Mobile Computing 3-1-0 30 20 50 100 150 4

Departmental Elective V 4
3 3-1-0 30 20 50 100 150

Departmental Elective VI
4 3-1-0 30 20 50 100 150
4
Practicals / Training /Projects

5 NIT-851
Seminar 0-0-3 - 50 50 - 50 2
6 NCS-852
7
Project 0-0-12 - 100 100 200 300
7 GP-801 General Proficiency - - - - - 50

Total 12-4-15 1000 25

* At least 10 problems are to be considered based on corresponding theory course.

B. TECH. INFORMATION TECHNOLOGY forth Page 2

Open Elective I

NOE-071 Entrepreneurship Development

NOE-072 Quality Management
NOE-073 Operations Research
NOE-074 Introduction to Bio Technology
NOE-075 Mobile Application Development
NOE-076 Ethical Hacking and Prevention
NOE-077 Software Project Management

Open Elective II

1. NOE-081 Non Conventional Energy Resources

2. NOE-082 Non Linear Dynamics Systems
3. NOE-083 Product Development
4. NOE-084 Automation and Robotics

Departmental Elective III

1. NCS-071 Software Testing and Audit

2. NCS-072 Neural Network
3. NIT-071 IT in Forensic Science

Departmental Elective IV

1. NCS-074 High Speed Network

2. NCS-075 Android Operating System
3. NCS-076 Service Oriented Architecture
4. NCS-701 Distributed System
5. NCS-073 Computer Vision

Departmental Elective V

1. NCS-080 Pattern Recognition

2. NCS-082 Real Time System
3. NCS-084 Grid Computing
4. NCS-801 Digital Image Processing
5. NIT-080 Natural Language Processing

Departmental Elective VI

1. NCS-085 Data Compression

2. NCS-087 Embedded Systems
3. NCS-088 Semantic Web and Web
Services
4. NIT-081 Software Quality Engineering
5. NIT-082 Software Reliability

B. TECH. INFORMATION TECHNOLOGY forth Page 3

 ENTREPRENEURSHIP DEVELOPMENT

NOE‐071 LTP
310
UNIT ‐I

Entrepreneurship‐ definition. growth of small scale industries in developing countries and their
positions vis‐a‐vis large industries; role of small scale industries in the national economy;
characteristics and types of small scale industries; demand based and resources based
ancillaries
and sub‐control types. 5
Government policy for small scale industry; stages in starting a small scale industry. 2
UNIT ‐II
Project identification‐ assessment of viability, formulation, evaluation, financing, field‐study
and collection of information, preparation of project report, demand analysis, material balance
and output methods, benefit cost analysis, discounted cash flow, internal rate of return and net
present value methods. 8
UNIT ‐III
Accountancy‐ Preparation of balance sheets and assessment of economic viability, decision
making, expected costs, planning and production control, quality control, marketing, industrial
relations, sales and purchases, advertisement, wages and incentive, inventory control,
preparation
of financial reports, accounts and stores studies. 9
UNIT ‐IV
Project Planning and control:
The financial functions, cost of capital approach in project planning and control. Economic
evaluation, risk analysis, capital expenditures, policies and practices in public enterprises. profit
planning and programming, planning cash flow, capital expenditure and operations. control of
financial flows, control and communication. 9
U NIT ‐V
Laws concerning entrepreneur viz, partnership laws, business ownership, sales and income
taxes
and workman compensation act. 5
Role of various national and state agencies which render assistance to small scale industries. 2
Text / Reference Books:
1. Forbat, John, “Entrepreneurship” New Age International.
2. Havinal, Veerbhadrappa, “Management and Entrepreneurship” New Age International
3. Joseph, L. Massod, “Essential of Management", Prentice Hall of India.

B. TECH. INFORMATION TECHNOLOGY forth Page 4

 QUALITY MANAGEMENT

NOE‐072
LTP
310
UNIT‐I

Quality Concepts:
Evolution of Quality Control, concept change, TQM Modern concept, Quality concept in design,
Review of design, Evolution of proto type. 3
Control on Purchased Product
Procurement of various products, evaluation of supplies, capacity verification, Development of
sources, procurement procedure. 2
Manufacturing Quality
Methods and techniques for manufacture, inspection and control of product, quality in sales
and
services, guarantee, analysis of claims. 5
UNIT‐II
Quality Management
Organization structure and design, quality function, decentralization, designing and fitting,
organization for different type products and company, economics of quality value and
contribution, quality cost, optimizing quality cost, seduction program. 3
Human Factor in quality
Attitude of top management, cooperation of groups, operators attitude, responsibility, causes
of
apparatus error and corrective methods. 2
UNIT‐III Control
Charts
Theory of control charts, measurement range, construction and analysis of R charts, process
capability study, use of control charts. 5
Attributes of Control Chart
Defects, construction and analysis of charts, improvement by control chart, variable sample size,
construction and analysis of C charts. 5
UNIT ‐IV
Defects diagnosis and prevention defect study, identification and analysis of defects, correcting
measure, factors affecting reliability, MTTF, calculation of reliability, building reliability in the
product, evaluation of reliability, interpretation of test results, reliability control,
maintainability,
zero defects, quality circle. 8
UNIT –V
ISO‐9000 and its concept of Quality Management
7
ISO 9000 series, Taguchi method, JIT in some details.
Text / Reference Books:
1. Lt. Gen. H. Lal, “Total Quality Management”, Eastern Limited, 1990.
2. Greg Bounds, “Beyond Total Quality Management”, McGraw Hill, 1994.
3. Menon, H.G, “TQM in New Product manufacturing”, McGraw Hill 1992.

B. TECH. INFORMATION TECHNOLOGY forth Page 5

 OPERATIONS RESEARACH

NOE‐073
LTP
310
UNIT‐I
Introduction:
Definition and scope of operations research (OR), OR model, solving the OR model, art of
modeling, phases of OR study.
Linear Programming:
Two variable Linear Programming model and Graphical method of solution, Simplex method,
Dual Simplex method, special cases of Linear Programming, duality, sensitivity analysis.
UNIT‐II
Transportation Problems:
Types of transportation problems, mathematical models , transportation algorithms,
Assignment:
Allocation and assignment problems and models, processing of job through machines.
UNIT‐III
Network Techniques:
Shortest path model, minimum spanning Tree Problem, Max‐Flow problem and Min‐cost
problem.
Project Management:
Phases of project management, guidelines for network construction, CPM and PERT.
UNIT‐IV
Theory of Games :
Rectanagular games, Minimax theorem, graphical solution of 2 x n or m x 2 games, game with
mixed strategies, reduction to linear programming model.
Quality Systems:
Elements of Queuing model, generalized poisson queuing model, single server models.
UNIT‐V Inventory
Control:
Models of inventory, operation of inventory system, quantity discount.
Replacement:
Replacement models: Equipment’s that deteriorate with time, equipment’s that fail with time.

Text / Reference Books:

1. Wayne L. Winston, “Operations Research” Thomson Learning,2003.
2. Hamdy H. Taha, “Operations Research‐An Introduction” Pearson Education,2003.
3. R. Panneer Seevam, “Operations Research” PHI Learning, 2008.
4. V.K.Khanna, “Total Quality Management” New Age International, 2008.

B. TECH. INFORMATION TECHNOLOGY forth Page 6

 INTRODUCTION TO BIOTECHNOLOGY

NOE‐074 LTP

310
UNIT‐I
Introduction: Concept nature and scope of biotechnology.
Cell Structure and Function: Eukaryotic and prokaryotic cells, cell wall, membrane organization,
cell organelles, Nucleus, Mitochondria, endoplasmic reticulum, chloroplast, viruses and toxins
into cells.
Cell Division: Mitosis and Meiosis. 8
UNIT‐II
Biomolecules: A brief account of structure of carbohydrates, Lipids and Proteins.
Genes: Brief idea about Mendel’s laws and chromosomes, nature of genetic materials, DN A and
RNA, DNA replication. 7
UNIT‐III
Gene Expression: Central dogma, genetic code, molecular mechanism on mutations, regulations
of gene expression, house keeping genes, differentiation and development mutations and their
molecular basic.
Genetic Engineering: Introduction, cloning (vectors and enzymes), DNA and genomic libraries,
Transgenics, DNA fingerprinting, genomics. 9
UNIT‐IV
Applications of Biotechnology: Bioprocess and fermentation technology, cell culture, Enzyme
technology, biological fuel generation, sewage treatment, environmental biotechnology,
biotechnology and medicine, biotechnology in agriculture, food and beverage technology,
production of biological invention. 9
UNIT‐V
Safety and Ethics: Safety, social, moral and ethic considerations, environmental ethics,
bioethics and stem cell research, safety of new biotechnology foods, agro biodiversity and
donor
policies.

Text Books/ Reference Books:

1. Smith, “Biotechnology” Cambridge Press.
2. P.K. Gupta, “Elements of Biotechnology” Rastogi
3. H. D. Kumar, “Modern concepts of Biotechnology” Vikas publishing House.

B. TECH. INFORMATION TECHNOLOGY forth Page 7

 MOBILE APPLICATION DEVELOPMENT
NOE-075 L T P
3 1 0

UNIT I
5
INTRODUCTION: Introduction to mobile applications – Embedded systems - Market and business
drivers for mobile applications – Publishing and delivery of mobile applications – Requirements
gathering and validation for mobile applications

UNIT II
10
BASIC DESIGN: Introduction – Basics of embedded systems design – Embedded OS - Design
constraints for mobile applications, both hardware and software related – Architecting mobile
applications – User interfaces for mobile applications – touch events and gestures – Achieving
quality constraints – performance, usability, security, availability and modifiability.

UNIT III
10
ADVANCED DESIGN: Designing applications with multimedia and web access capabilities –
Integration with GPS and social media networking applications – Accessing applications hosted in a
cloud computing environment – Design patterns for mobile applications.

UNIT IV
10
TECHNOLOGY I – ANDROID: Introduction – Establishing the development environment –
Android architecture – Activities and views – Interacting with UI – Persisting data using SQLite –
Packaging and deployment – Interaction with server side applications – Using Google Maps, GPS
and Wifi – Integration with social media applications.

UNIT V
10
TECHNOLOGY II – iOS: Introduction to Objective C – iOS features – UI implementation – Touch
frameworks – Data persistence using Core Data and SQLite – Location aware applications using
Core Location and Map Kit – Integrating calendar and address book with social media application –
Using Wifi - iPhone marketplace. Swift: Introduction to Swift, features of swift.

TOTAL LECTURE: 45

REFERENCES:
1. Charlie Collins, Michael Galpin and Matthias Kappler, “Android in Practice”, DreamTech, 2012
2. AnubhavPradhan , Anil V Despande Composing Mobile Apps,Learn ,explore,apply
3. James Dovey and Ash Furrow, “Beginning Objective C”, Apress, 2012
4. Jeff McWherter and Scott Gowell, "Professional Mobile Application Development", Wrox, 2012
5. David Mark, Jack Nutting, Jeff LaMarche and Frederic Olsson, “Beginning iOS 6 Development:
Exploring the iOS SDK”, Apress, 2013.

B. TECH. INFORMATION TECHNOLOGY forth Page 8

 ETHICAL HACKING AND PREVENTION

NOE-076 L T P
3 1 0

Unit-I10

Ethical Hacking: Introduction, Networking & Basics, Foot Printing, Google Hacking, Scanning,
Windows Hacking, Linux Hacking, Trojans & Backdoors, Virus & Worms,

Unit-II10
Proxy & Packet Filtering, Denial of Service, Sniffer, Social Engineering System and Network
Vulnerability and Threats to Security , Various types of attack and the various types of attackers in
the context of the vulnerabilities associated with computer and information systems and networks
Physical Security, Steganography,

Unit-III 10
Cryptography, Wireless Hacking, Firewall & Honeypots, IDS & IPS, Vulnerability, Penetration
Testing, Session Hijacking, Hacking Web Servers, SQL Injection, Cross Site Scripting, Exploit
Writing, Buffer Overflow,

Unit-IV15
Reverse Engineering, Email Hacking, Incident Handling & Response, Bluetooth Hacking, Mobile
Phone Hacking Basic ethical hacking tools and usage of these tools in a professional environment.
Legal, professional and ethical issues likely to face the domain of ethical hacking. Ethical
responsibilities, professional integrity and making appropriate use of the tools and techniques
associated with ethical hacking.

TOTAL LECTURE: 45

REFERENCES:
1. Dominic Chell , Tyrone Erasmus, Shaun Colley, Oflie Whitehouse, The Mobile Application
Hacker’s Handbook , Wiley
2. Michael Gregg, "Certified Ethical Hacker (CEH) Cert Guide", Pearson India, 2014
3. Rafay Baloch, “Ethical Hacking and Penetration Testing Guide” CRC Press
4. Allen Harper , Shome Harris, Jonathan Ness ,Chris Eagle, Gideon Lenkey,TerronVilliams “Gray
Hat Hacking The Ethical Hakers Handbook.” TMH
5. Patrick Engebretson, “The Basics of Hacking and Penetration Testing, Second Edition:Ethical
Hacking and Penetration Testing Made Easy, 2nd Edition, Elsevier
6. Jon Erickson “HACKING, The art of Exploitation”, William Pollock.

SOFTWARE PROJECT MANAGEMENT

B. TECH. INFORMATION TECHNOLOGY forth Page 9

 NOE-077 L T P
3 1 0

UNIT-I:
Introduction and Software Project Planning
Fundamentals of Software Project Management (SPM), Need Identification, Vision and Scope
document, Project Management Cycle, SPM Objectives, Management Spectrum, SPM Framework,
Software Project Planning, Planning Objectives, Project Plan, Types of project plan, Structure of a
Software Project Management Plan, Software project estimation, Estimation methods, Estimation
models, Decision process.

UNIT-II:
Project Organization and Scheduling 10
Project Elements, Work Breakdown Structure (WBS), Types of WBS, Functions, Activities and
Tasks, Project Life Cycle and Product Life Cycle, Ways to Organize Personnel, Project schedule,
Scheduling Objectives, Building the project schedule, Scheduling terminology and techniques,
Network Diagrams: PERT, CPM, Bar Charts: Milestone Charts, Gantt Charts.

UNIT-III:
Project Monitoring and Control10
Dimensions of Project Monitoring & Control, Earned Value Analysis, Earned Value Indicators:
Budgeted Cost for Work Scheduled (BCWS), Cost Variance (CV), Schedule Variance (SV), Cost
Performance Index (CPI), Schedule Performance Index (SPI), Interpretation of Earned Value
Indicators, Error Tracking, Software Reviews, Types of Review: Inspections, Deskchecks,
Walkthroughs, Code Reviews, Pair Programming.

UNIT-IV:
Software Quality Assurance and Testing10

Testing Objectives, Testing Principles, Test Plans, Test Cases, Types of Testing, Levels of Testing,
Test Strategies, Program Correctness, Program Verification & validation, Testing Automation &
Testing Tools, Concept of Software Quality, Software Quality Attributes, Software Quality Metrics
and Indicators, The SEI Capability Maturity Model CMM), SQA Activities, Formal SQA
Approaches: Proof of correctness, Statistical quality assurance, Cleanroom process.

UNIT-V:
Project Management and Project Management Tools10
Software Configuration Management: Software Configuration Items and tasks, Baselines, Plan for
Change, Change Control, Change Requests Management, Version Control, Risk Management: Risks
and risk types, Risk Breakdown Structure (RBS), Risk Management Process: Risk identification,
Risk analysis, Risk planning, Risk monitoring, Cost Benefit Analysis, Software Project Management
Tools: CASE Tools, Planning and Scheduling Tools, MS-Project.

TOTAL LECTURE: 45

REFERENCES:
1. M. Cotterell, Software Project Management, Tata McGraw-Hill Publication.
2. Royce, Software Project Management, Pearson Education
3. Kieron Conway, Software Project Management, Dreamtech Press
4. S. A. Kelkar, Software Project Management, PHI Publication.

B. TECH. INFORMATION TECHNOLOGY forth Page 10

 5. Harold R. Kerzner, Project Mangment “A Systems Approach to Planning, Scheduling, and
Controlling” Wiley.
6. Mohapatra, Software Project Management, Cengage Learning.

CRYPTOGRAPHY & NETWORK SECURITY

NIT-701 L T P
3 1 0

Unit-I 10
Introduction to security attacks, services and mechanism, Classical encryption techniques-substitution
ciphers and transposition ciphers, cryptanalysis, steganography, Stream and block ciphers.
Modern Block Ciphers: Block ciphers principles, Shannon’s theory of confusion and diffusion, fiestal
structure, Data encryption standard(DES), Strength of DES, Idea of differential cryptanalysis, block
cipher modes of operations, Triple DES

Unit-II 10
Introduction to group, field, finite field of the form GF(p), modular arithmetic, prime and relative prime
numbers, Extended Euclidean Algorithm,
Advanced Encryption Standard (AES) encryption and decryptionFermat’s and Euler’s theorem, Primarily
testing, Chinese Remainder theorem, Discrete Logarithmic Problem,Principals of public key crypto
systems, RSA algorithm, security of RSA

Unit-III 10
Message Authentication Codes: Authentication requirements, authentication functions, message
authentication code, hash functions, birthday attacks, security of hash functions, Secure hash algorithm
(SHA)
Digital Signatures: Digital Signatures, Elgamal Digital Signature Techniques, Digital signature standards
(DSS), proof of digital signature algorithm,
Unit-IV 10
Key Management and distribution: Symmetric key distribution, Diffie-Hellman Key Exchange, Public
key distribution, X.509 Certificates, Public key Infrastructure.
Authentication Applications:
Kerberos, Electronic mail security: pretty good privacy (PGP), S/MIME.

Unit-V 10
IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security
associations, key management.
Introduction to Secure Socket Layer, Secure electronic, transaction (SET)
System Security: Introductory idea of Intrusion, Intrusion detection, Viruses and related threats, firewalls

TOTAL: 45 PERIODS
Text Books:

B. TECH. INFORMATION TECHNOLOGY forth Page 11

 1. William Stallings, “Cryptography and Network Security: Principals and Practice”, Pearson
Education.
2. Behrouz A. Frouzan: Cryptography and Network Security, Tata McGraw Hill
3. C K Shyamala, N Harini, Dr. T.R.Padmnabhan Cryptography and Security ,Wiley
4. Bruce Schiener, “Applied Cryptography”. John Wiley & Sons
5. Bernard Menezes,” Network Security and Cryptography”, Cengage Learning.
6. AtulKahate, “Cryptography and Network Security”, Tata McGraw Hill

B. TECH. INFORMATION TECHNOLOGY forth Page 12

 ARTIFICIAL INTELLIGENCE
NCS-702 L T P
3 1 0
Unit-I
Introduction : Introduction to Artificial Intelligence, Foundations and History of Artificial Intelligence,
Applications of Artificial Intelligence, Intelligent Agents, Structure of Intelligent Agents. Computer
vision, Natural Language Possessing.
Unit-II
Introduction to Search : Searching for solutions, Uniformed search strategies, Informed search strategies,
Local search algorithms and optimistic problems, Adversarial Search, Search for games, Alpha - Beta
pruning.
Unit-III
Knowledge Representation & Reasoning: Propositional logic, Theory of first order logic, Inference in
First order logic, Forward & Backward chaining, Resolution, Probabilistic reasoning, Utility theory,
Hidden Markov Models (HMM), Bayesian Networks.
Unit-IV
Machine Learning : Supervised and unsupervised learning, Decision trees, Statistical learning models,
Learning with complete data - Naive Bayes models, Learning with hidden data - EM algorithm,
Reinforcement learning,
Unit-V
Pattern Recognition : Introduction, Design principles of pattern recognition system, Statistical Pattern
recognition, Parameter estimation methods - Principle Component Analysis (PCA) and Linear
Discriminant Analysis (LDA), Classification Techniques – Nearest Neighbor (NN) Rule, Bayes
Classifier, Support Vector Machine (SVM), K – means clustering.

TOTAL LECTURE: 45

Text Books:
1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson Education
2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, McGraw-Hill
3. E Charniak and D McDermott, “Introduction to Artificial Intelligence”, Pearson Education
4. Dan W. Patterson, “Artificial Intelligence and Expert Systems”, Prentice Hall of India,

B. TECH. INFORMATION TECHNOLOGY forth Page 13

 SOFTWARE TESTING AND AUDIT
NCS-071 L T P
3 1 0
Unit-I
Review of Software Engineering:10
Overview of software evolution, SDLC, Testing Process, Terminologies in Testing: Error, Fault, Failure,
Verification, Validation, Difference between Verification and Validation, Test Cases, Testing Suite, Test
Oracles, Impracticality of Testing All data; Impracticality of testing AllPaths.
Verification:
Verification methods, SRS verification, Source code reviews, User documentation verification, Software
project audit, Tailoring Software Quality Assurance Program by Reviews, Walkthrough, Inspection, and
Configuration Audits.

Unit –II
Functional Testing::10
Boundary Value Analysis, Equivalence Class Testing, Decision Table Based Testing, Cause Effect
Graphing Technique.
Structural Testing:
Control flow testing, Path testing, Independent paths, Generation of graph from program, Identification
of independent paths, Cyclomatic Complexity, Data Flow Testing, Mutation Testing.

Unit-III
Regression Testing::10
What is Regression Testing? Regression Test cases selection, Reducing the number of test cases, Code
coverage prioritization technique.
Reducing the number of test cases:
Prioritization guidelines, Priority category, Scheme, Risk Analysis.

Unit-IV:10
Software Testing Activities: Levels of Testing, Debugging, Testing techniques and theirApplicability,
Exploratory Testing
Automated Test Data Generation:
Test Data, Approaches to test data generation, test data generation using genetic algorithm, Test Data
Generation Tools, Software Testing Tools, and Software test Plan.

Unit-V:5
Object oriented Testing: Definition, Issues, Class Testing, Object Oriented Integration and System
Testing.
Testing Web Applications: What is Web testing?, User interface Testing, Usability Testing, Security
Testing, Performance Testing, Database testing, Post Deployment Testing. (8 hrs)

TOTAL LECTURE: 45

Text Books:
1. Yogesh Singh, “Software Testing”, Cambridge University Press, New York, 2012
2. K.K. Aggarwal&Yogesh Singh, “Software Engineering”, New Age International Publishers, New
Delhi, 2003.
3. Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, Fifth Edition,
McGraw-Hill International Edition, New Delhi, 2001.
4. Marc Roper, “Software Testing”, McGraw-Hill Book Co., London, 1994.
5. Boris Beizer, “Software System Testing and Quality Assurance”, Van NostrandReinhold, New
York, 1984.

B. TECH. INFORMATION TECHNOLOGY forth Page 14

 NEURAL NETWORKS
NCS-072 L T P
3 1 0
Unit-I:
Neuro Computing and Neuroscience 10
Historical notes, human Brain, neuron Mode l, Knowledge representation, Al and NN. Learning process:
Supervised and unsupervised learning, Error correction learning,competitive learning, adaptation,
statistical nature of the learning process.

Unit-II:
Data processing 10
Scaling, normalization, Transformation (FT/FFT), principal component analysis, regression, co-variance
matrix, eigen values &eigen vectors. Basic Models of Artificial neurons, activation Functions,
aggregation function, single neuron computation, multilayer perceptron, least mean square algorithm,
gradient descent rule, nonlinearly separable problems and bench mark problems in NN.
Unit-III 10
Multilayered network architecture, back propagation algorithm, heuristics for making BP-algorithm
performs better. Accelerated learning BP (like recursive least square, quick prop, RPROP algorithm),
approximation properties of RBF networks and comparison with multilayer perceptran.
Unit-IV 10
Recurrent network and temporal feed-forward network, implementation with BP, self organizing map and
SOM algorithm, properties of feature map and computer simulation. Principal component and
Independent component analysis, application to image and signal processing.
Unit-V 5
Complex valued NN and complex valued BP, analyticity of activation function, application in 2D
information processing. Complexity analysis of network models. Soft
computing. Neuro-Fuzzy-genetic algorithm Integration.

TOTAL LECTURE: 45

REFERENCES:
1. J.A. Anderson, An Introduction to Neural Networks, MIT
2. Hagen Demuth Beale, Neural Network Design, Cengage Learning
3. Laurene V. Fausett, "Fundamentals of Neural Networks : Architectures, Algorithms and
Applications", Pearson India
4. Kosko, Neural Network and Fuzzy Sets, PHI
5. Hagan, Neural Network Design w/CD,Cengage Learning

B. TECH. INFORMATION TECHNOLOGY forth Page 15

 IT IN FORENSIC SCIENCE
NIT-071 L T P
3 1 0
UNIT I 8
Overview of Biometrics, Biometric Identification, Biometric Verification, Biometric Enrollment,
Biometric System Security. Authentication and Biometrics: Secure Authentication Protocols, Access
Control Security Services, Matching Biometric Samples, Verification by humans. Common biometrics:
Finger Print Recognition, Face Recognition, Speaker Recognition, Iris Recognition, Hand Geometry,
Signature Verification
UNIT II 8
Introduction to Information Hiding: Technical Steganography, Linguistic Steganography, Copy Right
Enforcement, Wisdom from Cryptography Principles of Steganography: Framework for Secret
Communication, Security of Steganography System, Information Hiding in Noisy Data , Adaptive versus
non-Adaptive Algorithms, Active and Malicious Attackers, Information hiding in Written Text.
UNIT III 8
A Survey of Steganographic Techniques: Substitution systems and Bit Plane Tools, Transform Domain
Techniques: - Spread Spectrum and Information hiding, Statistical Steganography, Distortion Techniques,
Cover Generation Techniques. Steganalysis: Looking for Signatures: - Extracting hidden Information,
Disabling Hidden Information.
UNIT IV 12
Watermarking and Copyright Protection: Basic Watermarking, Watermarking Applications,
Requirements and Algorithmic Design Issues, Evaluation and Benchmarking of Watermarking system.
Transform Methods: Fourier Transformation, Fast Fourier Transformation, Discrete Cosine
Transformation, Mellin-Fourier Transformation, Wavelets, Split Images in Perceptual Bands.
Applications of Transformation in Steganography.
UNIT V 8
Computer Forensics, Rules of evidence, Evidence dynamics, Evidence collection, Data recovery,
Preservation of digital evidence, surveillance tools for future warfare,

TOTAL LECTURE: 44

Text Books:

1. Katzendbisser, Petitcolas, " Information Hiding Techniques for Steganography and Digital
Watermarking", Artech House.
2. Peter Wayner, "Disappearing Cryptography: Information Hiding, Steganography and
Watermarking 2/e", Elsevier
3. Bolle, Connell et. al., "Guide to Biometrics", Springer
4. John Vecca, “Computer Forensics: Crime scene Investigation”, Firewall Media 5. Christopher
L.T. Brown, “Computer Evidence: Collection and Preservation”, Firewall Media

B. TECH. INFORMATION TECHNOLOGY forth Page 16

 HIGH SPEED NETWORKS
NCS-074 L T P
3 1 0
UNIT I 8
Frame Relay Networks – Asynchronous transfer mode–ATM Protocol Architecture ,ATM logical
Connection – ATM Cell – ATM Service Categories – AAL. High Speed LAN’s: Fast Ethernet – Gigabit
Ethernet– Fiber Channel – Wireless LAN’s, WiFiand WiMax Networks applications, requirements –
Architecture of 802.11.

UNIT II 8
Queuing Analysis – Queuing Models – Single Server Queues – Effects of Congestion –Congestion
Control – Traffic Management – Congestion Control in Packet SwitchingNetworks – Frame
Relay Congestion Control.

UNIT III12
TCP Flow control – TCP Congestion Control – Retransmission – Timer Management –Exponential RTO
backoff – KARN’s Algorithm – Window management – Performance ofTCP over ATM. Traffic and
Congestion control in ATM – Requirements – Attributes –Traffic Management Frame work, Traffic
Control – ABR traffic Management – ABR ratecontrol, RM cell formats – ABR Capacity allocations –
GFR traffic management.

UNIT IV 8
Integrated Services Architecture – Approach, Components, Services- Queuing Discipline– FQ – PS –
BRFQ – GPS – WFQ – Random Early Detection – Differentiated Services.

UNIT V 8
RSVP – Goals & Characteristics, Data Flow, RSVP operations – Protocol Mechanisms– Multiprotocol
Label Switching – Operations, Label Stacking – Protocol details – RTP– Protocol Architecture – Data
Transfer Protocol– RTCP.

TOTAL: 44 PERIODS
.
Text Books:
1. William Stallings, “High speed networks and internet”, Second Edition, Pearson Education, 2002
2. Warland, Pravin Varaiya, “High performance communication networks”, Second Edition , Jean
Harcourt Asia Pvt. Ltd., , 2001
3. Irvan Pepelnjk, Jim Guichard, Jeff Apcar, “MPLS and VPN architecture”, Cisco Press, Volume 1
and 2, 2003.
4. Abhijit S. Pandya, Ercan Sea, “ATM Technology for Broad Band Telecommunication
Networks”, CRC Press, New York, 2004.

B. TECH. INFORMATION TECHNOLOGY forth Page 17

 ANDROID OPERATING SYSTEM
NCS-075 L T P
3 1 0

UNIT I
Android OS
Android Software Stack, Activities and Applications, Activity Life Cycles, Activity Stacks, Activity
States, Resources, Android OS vs. IOS
UNIT II
User Interfaces
Views, Layouts, Android Widgets, UI XML Specifications, Explicit Intents, Implicit Intents, Event
Broadcasting with Intents, Event Reception with Broadcast Receivers, Adapters and Data Binding.
UNIT III
Multimedia
Audio, Video, Camera, Playing Audio and Video, Recording Audio and Video, Using the Camera to
Take and Process Pictures
UNIT IV
Networking
Internet Access, HTML and XML Parsing, Wi-Fi
UNIT V
Touchscreen
Capturing Touch Events, Touchscreen Gesture Recognition

TOTAL: 44 PERIODS
Text Books:
1. Rito Meier. "Professional Android 2 Application Development." Wiley Publishing, Inc.
2. SayedHashimi, SatyaKomatineni, Dave MacLean. "Pro Android 2." APRESS.
3. Mark Murphy. "Beginning Android 2." APRESS.
4. Carmen Delessio,LaurenDarcey ”Android Application Development” Pearson
5. J.F.DiMarzio “Android a programming guide” TMH

B. TECH. INFORMATION TECHNOLOGY forth Page 18

 SERVICE ORIENTED ARCHITECTURE
NCS-076 L T P
3 1 0

UNIT I 10
Roots of SOA – Characteristics of SOA - Comparing SOA to client-server and distributed internet
architectures – Anatomy of SOA- How components in an SOA interrelate -Principles of service
orientation

UNIT II 10
Web services – Service descriptions – Messaging with SOAP –Message exchange Patterns –
Coordination –Atomic Transactions – Business activities – Orchestration
Choreography - Service layer abstraction – Application Service Layer – Business Service Layer –
Orchestration Service Layer

UNIT III 10
Service oriented analysis – Business-centric SOA – Deriving business services- service modeling -
Service Oriented Design – WSDL basics – SOAP basics – SOA composition guidelines – Entity-centric
business service design – Application service design – Taskcentric business service design

UNIT IV 10
SOA platform basics – SOA support in J2EE – Java API for XML-based web services (JAX-WS) - Java
architecture for XML binding (JAXB) – Java API for XML Registries (JAXR) - Java API for XML based
RPC (JAX-RPC)- Web Services Interoperability Technologies (WSIT) - SOA support in .NET –
Common Language Runtime - ASP.NET web forms – ASP.NET web services – Web Services
Enhancements (WSE).
UNIT V 5
WS-BPEL basics – WS-Coordination overview - WS-Choreography, WS-Policy, WSSecurity
TOTAL: 45 PERIODS
Text Books:
1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, andDesign”,Pearson
Education, 2005.
2. Newcomer, Lomow“Understanding SOA with Web Services”, Pearson Education,
2005.
3. SandeepChatterjee, James Webber, “Developing Enterprise Web Services, AnArchitect’s Guide”,
Pearson Education, 2005.
4. Dan Woods and Thomas Mattern,“ Enterprise SOA Designing IT for BusinessInnovation”
O’REILLY, First Edition, 2006
5. Kambhampaty Service Oriented Architecture for Enterprise and cloud applications , Wiley

B. TECH. INFORMATION TECHNOLOGY forth Page 19

 DISTRIBUTED SYSTEMS
NCS-701 L T P
3 1 0
Unit–I 10
Characterization of Distributed Systems: Introduction, Examples of distributed Systems, Resource
sharing and the Web Challenges. Architectural models, Fundamental Models.
Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of global clock,
shared memory, Logical clocks,Lamport’s& vectors logical clocks.
Concepts in Message Passing Systems: causal order, total order, total causal order, Techniques
for Message Ordering, Causal ordering of messages, global state, termination detection.

Unit-II 10
Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirement of mutual
exclusion theorem, Token based and non token based algorithms, performance metric for distributed
mutual exclusion algorithms.
Distributed Deadlock Detection: system model, resource Vs communication deadlocks,
deadlockprevention, avoidance, detection & resolution, centralized dead lock detection, distributed dead
lock detection, path pushing algorithms, edge chasing algorithms.

Unit–III 10
Agreement Protocols: Introduction, System models, classification of Agreement Problem,Byzantine
agreement problem, Consensus problem, Interactive consistency Problem, Solution to Byzantine
Agreement problem, Application of Agreement problem, Atomic Commit in Distributed Database
system.
Distributed Resource Management: Issues in distributed File Systems, Mechanism for buildingdistributed
file systems, Design issues in Distributed Shared Memory, Algorithm for Implementation of Distributed
Shared Memory.
Unit–IV 10
Failure Recovery in Distributed Systems: Concepts in Backward and Forward recovery, Recoveryin
Concurrent systems, Obtaining consistent Checkpoints, Recovery in Distributed Database Systems.
Fault Tolerance: Issues in Fault Tolerance, Commit Protocols, Voting protocols,
Dynamicvotingprotocols.
Unit –V5
Transactions and Concurrency Control: Transactions, Nested transactions, Locks, OptimisticConcurrency
control, Timestamp ordering, Comparison of methods for concurrency control.
Distributed Transactions: Flat and nested distributed transactions, Atomic Commit protocols,Concurrency
control in distributed transactions, Distributed deadlocks, Transaction recovery. Replication: System
model and group communication, Fault - tolerant services, highly available services, Transactions with
replicated data.

TOTAL LECTURE: 45

Text Books:

1. Singhal & Shivaratri, "Advanced Concept in Operating Systems", McGraw Hill

2. Ramakrishna, Gehrke,” Database Management Systems”, McGraw Hill
3. Vijay K.Garg Elements of Distributed Compuitng , Wiley
4. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design”, Pearson Education
5. Tenanuanbaum, Steen,” Distributed Systems”, PHI
6. Gerald Tel, "Distributed Algorithms", Cambridge University Press

B. TECH. INFORMATION TECHNOLOGY forth Page 20

 COMPUTER VISION
NCS-073 L T P
3 1 0

UNIT 1
IMAGE FORMATION MODEL 10
Monocular Imaging System, Orthographic & Perspective Projection, Camera model and Camera
calibration , Binocular imaging systems

UNIT 2
IMAGE PROCESSING AND FEATURE EXTRACTION 10
Image representations (continuous and discrete), Edge detection

UNIT3
MOTION ESTIMATION 5
Regularization Theory, Optical Computation, Stereo Vision, Motion Estimation, Structure from Motion.

UNIT 4
SHAPE REPRESENTATION AND SEGMENTATION 10
Shape Representation and Segmentation, Deformable curves and surfaces, Snakes and active contours,
Level set representations, Fourier and Wavelet Descriptors, Medial Representations ,Multiresolution
analysis

UNIT 5
OBJECT RECOGNITION 10
Hough transforms and other simple object recognition Methods, Shape Correspondence and Shape
Matching, Principal component analysis , Shape priors for recognition

TOTAL LECTURE: 45

Text Books:

1. Richard Szeliski, Computer Vision: Algorithms and Applications, 2010

2. Forsyth and Ponce, Computer Vision, A Modern Approach, 2nd ed., 2011
3. Trucco and Verri, Introductory Techniques for 3D Computer Vision, 1998
4. David A. Forsyth, "Computer Vision: : A Modern Approach", 2nd Edn, Pearson India 2015

B. TECH. INFORMATION TECHNOLOGY forth Page 21

 CRYPTOGRAPHY AND NETWORK SECURITY LAB

NIT-751 L T P
0 0 2

The following programs should be implemented preferably on ‘UNIX’ platform using ‘C’
language (for 1-5) and other standard utilities available with ‘UNIX’ systems (for 6-8) :-
1. Implement the encryption and decryption of 8-bit data using ‘Simplified DES Algorithm’
2. (created by Prof. Edward Schaefer) in ‘C’.
3. Implement ‘Linear Congruential Algorithm’ to generate 5 pseudo-random numbers in‘C’.
4. Implement Rabin-Miller Primality Testing Algorithm in ‘C’.
5. Implement the Euclid Algorithm to generate the GCD of an array of 10 integers in ‘C’.
6. Implement RSA algorithm for encryption and decryption in ‘C’
7. Configure a mail agent to support Digital Certificates, send a mail and verify the correctness of
this system using the configured parameters.
8. Configure SSH (Secure Shell) and send/receive a file on this connection to verify the correctness
of this system using the configured parameters.
9. Configure a firewall to block the following for 5 minutes and verify the correctness of this system
using the configured parameters:
(a) Two neighborhood IP addresses on your LAN
(b) All ICMP requests

B. TECH. INFORMATION TECHNOLOGY forth Page 22

 NON‐CONVENTIONAL ENERGY RESOURCES

NOE‐081 LTP
310
UNIT‐I
Introduction
Various non‐conventional energy resources‐ Introduction, availability, classification, relative
merits and demerits. 3
Solar Cells:
Theory of solar cells. solar cell materials, solar cell array, solar cell power plant, limitations. 4
UNIT‐II
Solar Thermal Energy:
Solar radiation, flat plate collectors and their materials, applications and performance, focussing
of collectors and their materials, applications and performance; solar thermal power plants,
thermal energy storage for solar heating and cooling, limitations. 9
UNIT‐III Geothermal
Energy:
Resources of geothermal energy, thermodynamics of geo‐thermal energy conversion‐electrical
conversion, non‐electrical conversion, environmental considerations. 4
Magneto‐hydrodynamics (MHD):
Principle of working of MHD Power plant, performance and limitations. 2
Fuel Cells:
Principle of working of various types of fuel cells and their working, performance and
limitations. 3
UNIT‐IV
Thermo‐electrical and thermionic Conversions:
Principle of working, performance and limitations. 2
Wind Energy:
Wind power and its sources, site selection, criterion, momentum theory, classification of rotors,
concentrations and augments, wind characteristics. performance and limitations of energy
conversion systems. 6
UNIT‐V
Bio‐mass:
Availability of bio‐mass and its conversion theory. 2
Ocean Thermal Energy Conversion (OTEC):
Availability, theory and working principle, performance and limitations.
Wave and Tidal Wave:
Principle of working, performance and limitations.
Waste Recycling Plants. 3
Text/References Books:
1. Raja etal, “Introduction to Non‐Conventional Energy Resources” Scitech Publications.
2. John Twideu and Tony Weir, “Renewal Energy Resources” BSP Publications, 2006.
3. M.V.R. Koteswara Rao, “ Energy Resources: Conventional & Non‐Conventional “ BSP
Publications,2006.
4. D.S. Chauhan,”Non‐conventional Energy Resources” New Age International. 5. C.S. Solanki,
“Renewal Energy Technologies: A Practical Guide for Beginners” PHI
Learning.
6. Peter Auer, "Advances in Energy System and Technology". Vol. 1 & II Edited by Academic
Press.

B. TECH. INFORMATION TECHNOLOGY forth Page 23

 NON‐LINEAR DYNAMIC SYSTEMS

NOE‐082 LTP
310
UNIT‐I
Dynamic systems:
Concept of dynamic systems, importance of non‐linearity, nonlinear dynamics of flows (in 1,
2, and 3 dimensions) and Maps (1 and 2 dimensions) in phase space, Equilibrium,
Periodicity.
Picard’s theorem, Peano’s theorem, boundedness of solutions, omega limit points of
bounded
trajectories. 8
UNIT‐II
STABILITY‐I:
Stability via Lyapunov’s indirect method, converse Lyapunov functions, sublevel sets of
Lyapunow functions, Lasalle’s invariance principle. 7
UNIT‐III
Stability‐II
Lyapunov’s direct method, converse Lyapunov’s theorems, Brokett’s theorem, applications
to control system, stable manifold theorem, centre manifold theorem, normal form theory
and
applications to nonlinear systems. 8
UNIT‐IV
Bifurcation:
Elementary Bifurcation theory, catastrophe, strange attractor, fractals, fractal geometry and
fractal dimension. 8
UNIT‐V
Chaos:
Deterministic Chaos, routes to chaos (period doubling, quasiperiodicity, intermittency,
universality, renormalization); Measurement of Chaos (Poincare section, Lyapunov index,
entropy);.control of chaos. 9
Reference Books:
1. D.K. Arrowsmith and C.M. Place, “An Introduction to Dynamical Systems” Cambridge
University press, London, 1990.
2. K.T. Alligood, T.D. Sauer, and J.A Yorke, “CHAOS: An Introduction to Dynamical System”
Springer Verlag, 1997.
3. H.K. Khalis, “Nonlinear Systems” Prentice Hall, 1996.
4. R. R. Mohler, “Non linear systems, Vol‐I: Dynamics and Control” Prentice Hall, 1991.
5. J.M. T. Thomson and H.B. Stewart, “Nonlinear Dynamics and Chaos” John Wiley & Sons,
1986.
6. Stanislaw H. Zak, “Systems and control” Oxford University Press, 2003.

B. TECH. INFORMATION TECHNOLOGY forth Page 24

 PRODUCT DEVELOPMENT

NOE‐ 083 LTP

310
UNIT‐1
Concept of Product, definition and scope.
Design definitions, old and new design methods, design by evolution, examples such as
evolution of sewing M/C, bicycle, safety razor etc., need based developments, technology based
developments physical relaibility & economic feasibility of design concepts.
UNIT –II
Murphology of design, divergent, transformation and convergent phases of product design,
identification of need, Analysis of need. Design criteria; functional, aesthetics, ergonomics,
form, shape, size, colour.
Mental blocks, Removal blocs, Ideation techniques, Creativity, Check list.
UNIT –III
Transformations, Brainstorming& Synetics, Morephological techniques.
Utility Concept, Utility Valaue, Utility Index, Decision making under Multiple Criteria.
Economic aspects, Fixed and variable costs, Break‐even analysis.
UNIT‐IV
Reliability considerations, Bath tub curve, Reliability of systems in series and parallel, Failure
rate, MTTF and MTBF, Optimum spares from Reliability considerations.
Design of display and controls, Man‐ machine interface, Compatibility of displays and
controls. Ergonomic aspects, Anthroprometric data and its importance in design.
Application of Computers in Product development & design.
UNIT‐V
Existing techniques, such as work‐study, SQC etc. for improving method & quality of product.
Innovation versus Invention. Technological Forecasting.
Use of Standards for Design.
Text/Reference Books:
3. A.K. Chitab& R.C. Gupta “Product design & Manufacturing” – Prentice Hall (EE)
4. R.P. Crewford, “The Technology of creation Thinking” Prentice Hall.
5. C.D. Cain, “Product Design & Decision” Bussiness Books.
7. C.D. Cain, “Engg. Product Design” Bussiness Books.

B. TECH. INFORMATION TECHNOLOGY forth Page 25

 AUTOMATION AND ROBOTICS
NOE‐084 LTP
310

1. Introduction: Definition, Classification of Robots, geometric classification and control

classification.
2. Robot Elements: Drive system, control system, sensors, end effectors, gripper actuators and
gripper design.
3. Robot Coordinate Systems and Manipulator Kinematics: Robot co‐ordinate system
representation, transformation, homogenous transform and its inverse, relating the robot to
its world.
Manipulators Kinematics, parameters of links and joints, kinematic chains, dynamics of
kinematic chains, trajectory planning and control, advanced techniques of kinematics and
dynamics of mechanical systems, parallel actuated and closed loop manipulators.
4. Robot Control: Fundamental principles, classification, position, path velocity and force
control systems, computed torque control, adaptive control, Seroo system for robot
control,
and introduction to robot vision.
5. Robot Programming: Level of robot programming, language based programming, task level
programming, robot programming synthesis, robot programming for welding, machine
tools, material handing, assembly operations, collision free motion planning.
6. Applications: Application of robot in welding, machine tools, material handling, assembly
operations parts sorting and parts inspection.
Text/Reference Books:
1. Coifet Chirroza, “An Introduction to Robot Technology” Kogan Page.
2. Y. Koren “Robotics for Engineers” Mcgraw Hill.
3. K. S. Fu, R.C. Gonzalez Y& CSG Lee, “Robotics” McGraw Hill.
4. J.J. Craig, “Robotics” Addison‐Wesley.
5. Grover, Mitchell Weiss, Nagel Octrey, “Industrial Robots” Mcgraw Hill.
6. Asfahl, “Robots & Manufacturing Automat (c)All TCP SYN Packets

B. TECH. INFORMATION TECHNOLOGY forth Page 26

 MOBILE COMPUTING
NIT-801 L T P
3 1 0

Unit – I 8
Introduction, issues in mobile computing, overview of wireless telephony: cellular concept, GSM: air-
interface, channel structure, location management: HLR-VLR, hierarchical, handoffs, channel allocation
in cellular systems, CDMA, GPRS.
Unit – II 12
Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth, Wireless
multiple access protocols, TCP over wireless, Wireless applications, data broadcasting, Mobile IP,
WAP: Architecture, protocol stack, application environment, applications.
Unit – III 8
Data management issues, data replication for mobile computers, adaptive clustering for mobile wireless
networks, File system, Disconnected operations.
Unit – IV 8
Mobile Agents computing, security and fault tolerance, transaction processing in mobile computing
environment.
Unit – V 8
Ad-hoc networks, localization, MAC issues, Routing protocols, global state routing (GSR), Destination
sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc on demand distance
vector routing (AODV), Temporary ordered routing algorithm (TORA), QoS in Ad Hoc Networks,
applications.

TOTAL: 44 PERIODS
Text Books:

1. Thampi - Mobile Communications and Computing ,Wiley

2. J. Schiller, Mobile Communications, Addison Wesley.
3. Charles Perkins, Mobile IP, Addison Wesley.
4. Charles Perkins, Ad hoc Networks, Addison Wesley.
5. Upadhyaya, “Mobile Computing”, Springer
6. Stojmenovic, Handbook of Wireless Networks and Mobile Computing, Wiley India.

B. TECH. INFORMATION TECHNOLOGY forth Page 27

 PATTERN RECOGNITION

NCS-080 L T P
3 1 0

Unit-I
Introduction: 8
Basics of pattern recognition, Design principles of pattern recognition system,Learning and adaptation,
Pattern recognition approaches, Mathematical foundations – Linear algebra, Probability Theory,
Expectation, mean and covariance, Normal distribution, multivariate normal densities, Chi squared test.
Unit-II
Statistical Patten Recognition: 8
Bayesian Decision Theory, Classifiers, Normal density anddiscriminant functions,

Unit – III
Parameter estimation methods:12
Maximum-Likelihood estimation, Bayesian Parameterestimation, Dimension reduction methods -
Principal Component Analysis (PCA), Fisher Linear discriminant analysis, Expectation-maximization
(EM), Hidden Markov Models (HMM), Gaussian mixture models.
Unit - IV
Nonparametric Techniques:8
Density Estimation, Parzen Windows, K-Nearest NeighborEstimation, Nearest Neighbor Rule, Fuzzy
classification.

Unit - V
Unsupervised Learning & Clustering: 8
Criterion functions for clustering, Clustering Techniques:Iterative square - error partitional clustering –
K means, agglomerative hierarchical clustering, Cluster validation.

TOTAL: 44 PERIODS
Text Books:
1. Richard O. Duda, Peter E. Hart and David G. Stork, “Pattern Classification”, 2 nd Edition, John
Wiley, 2006.
2. C. M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2009.
3. S. Theodoridis and K. Koutroumbas, “Pattern Recognition”, 4th Edition, Academic Press, 2009.

4. Pattern Recognition,Narasimha Murty,Universities Press.

5. Pattern Recognition and Image Analysis,Gose, Johnsonbaugh & Jost,PHI Learning.

6. PATTERN RECOGNITION: TECHNIQUES AND APPLICATIONS,SHINGHAL,OXFORD

UNIVERSITY PRESS.

B. TECH. INFORMATION TECHNOLOGY forth Page 28

 REAL TIME SYSTEM
NCS-082 L T P
3 1 0

UNIT-I:
Introduction 5
Definition, Typical Real Time Applications: Digital Control, High Level Controls, Signal Processing
etc., Release Times, Deadlines, and Timing Constraints, Hard Real Time Systems and Soft Real Time
Systems, Reference Models for Real Time Systems: Processors and Resources, Temporal Parameters of
Real Time Workload, Periodic Task Model, Precedence Constraints and Data Dependency.

UNIT-II:
Real Time Scheduling 10
Common Approaches to Real Time Scheduling: Clock Driven Approach, Weighted Round Robin
Approach, Priority Driven Approach, Dynamic Versus Static Systems, Optimality of Effective-
Deadline-First (EDF) and Least-Slack-Time-First (LST) Algorithms, Rate Monotonic Algorithm,
Offline Versus Online Scheduling, Scheduling Aperiodic and Sporadic jobs in Priority Driven and Clock
Driven Systems.

UNIT-III:
Resources Sharing 10
Effect of Resource Contention and Resource Access Control (RAC), Non-preemptive Critical Sections,
Basic Priority-Inheritance and Priority-Ceiling Protocols, Stack Based Priority-Ceiling Protocol, Use of
Priority-Ceiling Protocol in Dynamic Priority Systems, Preemption Ceiling Protocol, Access Control in
Multiple-Unit Resources, Controlling Concurrent Accesses to Data Objects.

UNIT-IV:
Real Time Communication 10
Basic Concepts in Real time Communication, Soft and Hard RT Communication systems, Model of Real
Time Communication, Priority-Based Service and Weighted Round-Robin Service Disciplines for
Switched Networks, Medium Access Control Protocols for Broadcast Networks, Internet and Resource
Reservation Protocols

UNIT-V:
Real Time Operating Systems and Databases 10
Features of RTOS, Time Services, UNIX as RTOS, POSIX Issues, Characteristic of Temporal data,
Temporal Consistency, Concurrency Control, Overview of Commercial Real Time databases

TOTAL: 45 PERIODS
Text Books:
1. Real Time Systems by Jane W. S. Liu, Pearson Education Publication.
2. Phillip A Laplanta,SeppoJ.Ovaska Real time System Design and Analysis Tools for practitioner,
Wiley
3. Mall Rajib, “Real Time Systems”, Pearson Education
4. Albert M. K. Cheng , “Real-Time Systems: Scheduling, Analysis, and Verification”, Wiley.
5. KRISHNA, Real-Time Systems, Mc Graw Hills

B. TECH. INFORMATION TECHNOLOGY forth Page 29

 GRID COMPUTING
NCS-084 L T P
3 1 0

UNIT I
CONCEPTS AND ARCHITECTURE 10
Introduction-Parallel and Distributed Computing-Cluster Computing-Grid Computing- Anatomy and
Physiology of Grid-Review of Web Services-OGSA-WSRF.

UNIT II
GRID MONITORING 10
Grid Monitoring Architecture (GMA) - An Overview of Grid Monitoring Systems- GridICE – JAMM -
MDS-Network Weather Service-R-GMA-Other Monitoring Systems- Ganglia and GridMon

UNIT III
GRID SECURITY AND RESOURCE MANAGEMENT 10
Grid Security-A Brief Security Primer-PKI-X509 Certificates-Grid Security-Grid Scheduling and
Resource Management-Scheduling Paradigms- Working principles of Scheduling -A Review of Condor,
SGE, PBS and LSF-Grid Scheduling with QoS.

UNIT IV
DATA MANAGEMENT AND GRID PORTALS 10
Data Management-Categories and Origins of Structured Data-Data Management Challenges-
Architectural Approaches-Collective, Data Management Services-Federation Services-Grid Portals-
First-Generation Grid Portals-Second-Generation Grid Portals.

UNIT V
GRID MIDDLEWARE 5
List of globally available Middlewares - Case Studies-Recent version of Globus Toolkit and gLite -
Architecture, Components and Features

TOTAL: 45 PERIODS
Text Books:
1. JoshyJoseph, CraigFellenstein—Grid Computing, Pearson Education, 2004.
2. Vladimir Silva—Grid Computing for Developers,DreamtechPress, 2006.
3. Fran Berman, Geoffrey C. Fox, Anthony J.G Hey Grid Computing making the global
infrastructure a Reality
4. AhmarAbbas--Grid Computing —A Practical Guide to Technology and Applications,
Firewall Media, 2006.
5. Joshy Joseph, Craig Fellenstein, Grid Computing, Pearson Education.
6. Grid Computing Security, Anirban Chakrabarti, Springer, 2007.

B. TECH. INFORMATION TECHNOLOGY forth Page 30

 Digital Image Processing

NCS-801 L T P
3 1 0

UNIT-I
Introduction and Fundamentals 10
Motivation and Perspective, Applications, Components of Image Processing System, Element of
Visual Perception, A Simple Image Model, Sampling and Quantization.
Image Enhancement in Frequency Domain
Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, Filters – Low-
pass, High-pass; Correspondence Between Filtering in Spatial and Frequency Domain; Smoothing
Frequency Domain Filters – Gaussian Lowpass Filters; Sharpening Frequency Domain Filters –
Gaussian Highpass Filters; Homomorphic Filtering.

UNIT-II 10
Image Enhancement in Spatial Domain
Introduction; Basic Gray Level Functions – Piecewise-Linear Transformation Functions: Contrast
Stretching; Histogram Specification; Histogram Equalization; Local Enhancement; Enhancement using
Arithmetic/Logic Operations – Image Subtraction, Image Averaging; Basics of Spatial Filtering;
Smoothing - Mean filter, Ordered Statistic Filter; Sharpening – The Laplacian.

UNIT-III
Image Restoration 10
A Model of Restoration Process, Noise Models, Restoration in the presence of Noise only-Spatial
Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order Statistic Filters – Median
Filter, Max and Min filters; Periodic Noise Reduction by Frequency Domain Filtering – Bandpass
Filters; Minimum Mean-square Error Restoration.

UNIT-IV 10
Morphological Image Processing
Introduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening and Closing,
Morphological Algorithms – Boundary Extraction, Region Filling, Extraction of Connected
Components, Convex Hull, Thinning, Thickening

UNIT-V Registration 5
Introduction, Geometric Transformation – Plane to Plane transformation, Mapping, Stereo Imaging –
Algorithms to Establish Correspondence, Algorithms to Recover Depth
Segmentation
Introduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, Local Thresholding,
Region-based Approach, Edge and Line Detection: Edge Detection, Edge Operators, Pattern Fitting
Approach, Edge Linking and Edge Following, Edge Elements Extraction by Thresholding, Edge
Detector Performance, Line Detection, Corner Detection.

TOTAL: 45 PERIODS
Text Books:
1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard E. Woods. Published by:
Pearson Education.
2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: John Wiley and
Sons, NY.
3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice Hall, Upper Saddle
4. Sonka, Digital Image Processing and Computer Vision, Cengage Learning
5. Gonzalez and Woods, Digital Image Processing, Addison Wesley.

B. TECH. INFORMATION TECHNOLOGY forth Page 31

 Natural Language Processing

NIT-080 L T P
3 1 0

Unit-I

Introduction to Natural Language Understanding: The study of Language, Applications of NLP,

Evaluating Language Understanding Systems, Different levels of Language Analysis,
Representations and Understanding, Organization of Natural language Understanding Systems,
Linguistic Background: An outline of English syntax.

Unit-II

Introduction to semantics and knowledge representation, Some applications like machine

translation, database interface.

Unit-III

Grammars and Parsing: Grammars and sentence Structure, Top-Down and Bottom-Up Parsers,
Transition Network Grammars, Top- Down Chart Parsing. Feature Systems and Augmented
Grammars: Basic Feature system for English, Morphological Analysis and the Lexicon, Parsing
with Features, Augmented Transition Networks.

Unit-IV

Grammars for Natural Language: Auxiliary Verbs and Verb Phrases, Movement Phenomenon in
Language, Handling questions in Context-Free Grammars. Human preferences in Parsing,
Encoding uncertainty, Deterministic Parser.

Unit-V

Ambiguity Resolution: Statistical Methods, Probabilistic Language Processing, Estimating

Probabilities, Part-of-Speech tagging, Obtaining Lexical Probabilities, Probabilistic Context-Free
Grammars, Best First Parsing. Semantics and Logical Form, Word senses and Ambiguity,
Encoding Ambiguity in Logical Form.

References:

1. Akshar Bharti, Vineet Chaitanya and Rajeev Sangal, NLP: A Paninian Perspective,
Prentice Hall, New Delhi
2. James Allen, Natural Language Understanding, Pearson Education
3. D. Jurafsky, J. H. Martin, Speech and Language Processing, Pearson Education
4. L.M. Ivansca, S. C. Shapiro, Natural Language Processing and Language Representation
5. T. Winograd, Language as a Cognitive Process, Addison-Wesley

B. TECH. INFORMATION TECHNOLOGY forth Page 32

 DATA COMPRESSION
NCS-085 L T P
3 1 0

Unit - I: 10
Compression Techniques: Loss less compression, Lossy Compression, Measures of
performance, Modeling and coding, Mathematical Preliminaries for Lossless compression: A
brief introduction to information theory, Models: Physical models,
Probability models, Markov models, composite source model, Coding: uniquely decodable
codes, Prefix codes.
Unit – II: 10
The Huffman coding algorithm: Minimum variance Huffman codes, Adaptive Huffman coding:
Update procedure, Encoding procedure, Decoding procedure. Golomb codes, Rice codes,
Tunstall codes, Applications of Hoffman coding: Loss less image compression, Text
compression, Audio Compression.
Unit-III: 10
Coding a sequence, Generating a binary code, Comparison of Binary and Huffman coding,
Applications: Bi-level image compression-The JBIG standard, JBIG2, Image compression.
Dictionary Techniques: Introduction, Static Dictionary: Diagram Coding, Adaptive Dictionary.
The LZ77 Approach, The LZ78 Approach, Applications: File Compression-UNIX compress,
Image Compression: The Graphics Interchange Format (GIF), Compression over Modems:
V.42 bits, Predictive Coding: Prediction with Partial match (ppm): The basic algorithm, The
ESCAPE SYMBOL, length of context, The Exclusion Principle, The Burrows-Wheeler
Transform: Move-to-front coding, CALIC, JPEG-LS, Multi-resolution Approaches, Facsimile
Encoding, Dynamic Markoy Compression.

Unit – IV: 10
Distortion criteria, Models, Scalar Ouantization: The Quantization problem, Uniform Quantizer,
Adaptive Quantization, Non uniform Quantization.

Unit-V: 5

Advantages of Vector Quantization over Scalar Quantization, The Linde-Buzo-Gray Algorithm,

Tree structured Vector Quantizers. Structured VectorQuantizers.

TOTAL: 45 PERIODS
Text Books:
1. Khalid Sayood, Introduction to Data Compression, Morgan Kaufmann Publishers
2. Elements of Data Compression,Drozdek, Cengage Learning
3. Introduction to Data Compression, Second Edition,Khalid Sayood, The Morgan aufmann Series
4.Data Compression: The Complete Reference 4th Edition by David Salomon, Springer
5.T ext Compression1st Edition by Timothy C. Bell Prentice Hall.

B. TECH. INFORMATION TECHNOLOGY forth Page 33

 EMBEDDED SYSTEMS
NCS-087 L T P
3 1 0

Unit-I 10
Introduction to embedded systems: Classification, Characteristics and requirements, Applications
Unit-II 10
Timing and clocks in Embedded systems, Task Modeling and management, Real time operating system
issues.
Unit-III 10
Signals, frequency spectrum and sampling, digitization (ADC, DAC), Signal Conditioning and
Processing.Modeling and Characterization of Embedded Computation System.
Unit-IV 10
Embedded Control and Control Hierarchy, Communication strategies for embedded systems: Encoding
and Flow control.
Unit-V 5
Fault-Tolerance, FormalVerification , Trends in Embedded Processor, OS,Development Language

References:
1. Prasad, Embedded /Real Time System,Concept,Design and Programming Black Book, Wiley
India
2. H.Kopetz, “Real-Time Systems”, Kluwer
3. R.Gupta, “Co-synthesis of Hardware and Software for Embedded Systems”, Kluwer
4. Shibu K.V., “Introduction to Embedded Systems”, TMH
5. Marwedel, “Embedded System Design”, Springer

B. TECH. INFORMATION TECHNOLOGY forth Page 34

 SEMANTIC WEB AND WEB SERVICES
NCS-088 L T P
3 1 0

UNIT I 12
Introduction to Semantic Web: History of Semantic Web, goals and vision, problems, Semantic Web
Technologies, Layered Approach, Syntactic vs semantic web, Applications of semantic web.

UNIT II 8
Architecture: XML with Document Type Definitions and Schema, addressing and querying XML
documents, RDF (Resource Description Framework), basic idea and syntax, quering in RQL, URI(8
Hrs.)

UNIT III 8
Ontologies: Role of Ontology in intelligent information retrieval on web, OWL, Ontologies for different
applications. Ontology engineering: constructing ontologies manually, reusing existing ontologies.

UNIT IV 8
Semantics: Kinds of
semantics, use of semantics, Search Engines: Role of search Engines in intelligent retrieval of
information on web, Semantic web browsers.

UNIT V 8
Logic and inference: examples of Monotonic rules: family relationships, monotonic rules: syntax and
semantics, Non-monotonic rules: Motivation and syntax, Non-monotonic rule example: and Brokered
Trade, Rule Mark-up XML: Monotonic and Non-Monotonic rules.(8 Hrs.)

References:-
1. Salam, A. F., ed. SemanticWeb Technologies and E-Business: Toward the Integrated Virtual
Organization and Business Process Automation:. IGI Global, 2006.
2. Cardoso, Jorge, ed. Semantic Web Services: Theory, Tools and Applications: Theory, Tools and
Applications. IGI Global, 2007.
3. Antoniou, Grigoris, and Frank Van Harmelen. A semantic web primer. MIT press, 2004.
4. Pascal Hitzler, Markus Krotzsch, Sebastian Rudolph, Foundations of Semantic Web
Technologies, CRC Press
5. Daconta, Michael C., Leo J. Obrst, and Kevin T. Smith. The semantic web: a guide to the future
of XML, web services, and knowledge management. John Wiley & Sons, 2003.

B. TECH. INFORMATION TECHNOLOGY forth Page 35

 SOFTWARE QUALITY ENGINEERING
NIT-081 L T P
3 1 0

UNIT-I:
Introduction 8
Defining Software Quality, Software Quality Attributes and Specification, Cost of Quality, Defects,
Faults, Failures, Defect Rate and Reliability, Defect Prevention, Reduction, and Containment, Overview
of Different Types of Software Review, Introduction to Measurement and Inspection Process,
Documents and Metrics.
UNIT-II:
Software Quality Metrics 8
Product Quality Metrics: Defect Density, Customer Problems Metric, Customer Satisfaction Metrics,
Function Points, In-Process Quality Metrics: Defect Arrival Pattern, Phase-Based Defect Removal
Pattern, Defect Removal Effectiveness, Metrics for Software Maintenance: Backlog Management Index,
Fix Response Time, Fix Quality, Software Quality Indicators.
UNIT-III:
Software Quality Management and Models 8
Modeling Process, Software Reliability Models: The Rayleigh Model, Exponential Distribution and
Software Reliability Growth Models, Software Reliability Allocation Models, Criteria for Model
Evaluation, Software Quality Assessment Models: Hierarchical Model of Software Quality Assessment.
UNIT-IV:
Software Quality Assurance 12
Quality Planning and Control, Quality Improvement Process, Evolution of Software Quality Assurance
(SQA), Major SQA Activities, Major SQA Issues, Zero Defect Software, SQA Techniques, Statistical
Quality Assurance, Total Quality Management, Quality Standards and Processes.
UNIT-V:
Software Verification, Validation & Testing: 8
Verification and Validation, Evolutionary Nature of Verification and Validation, Impracticality of
Testing all Data and Paths, Proof of Correctness, Software Testing, Functional, Structural and Error-
Oriented Analysis & Testing, Static and Dynamic Testing Tools, Characteristics of Modern Testing
Tools.
TOTAL: 44 PERIODS
Text Books
1. Jeff Tian, Software Quality Engineering (SQE), Wiley
2. Stephen H. Kan, Metrics and Models in Software Quality Engineering,
Addison-Wesley
3. M. Cotterell, Software Project Management, Tata McGraw-Hill Publication.
4. Royce, Software Project Management, Pearson Education
5. Kieron Conway, Software Project Management, Dreamtech Press
6. S. A. Kelkar, Software Project Management, PHI Publication.

B. TECH. INFORMATION TECHNOLOGY forth Page 36

 SOFTWARE RELIABILITY
NIT-082 L T P
3 1 0

UNIT-I:
Introduction 8
Defining Software Reliability, Software Reliability Attributes and Specification, Concept of Defects,
Faults, Failures, Defect Rate and Reliability, Defect Prevention, Reduction, and Containment, Overview
of Different Types of Software Review, Introduction to Measurement and Inspection Process,
Documents and Metrics.
UNIT-II:
Software Reliability Metrics 8
Collection of fault and failure data, Measurement of internal and external product attributes, Customer
Problems Metric, Customer Satisfaction Metrics, In-Process Quality Metrics: Defect Arrival Pattern,
Phase-Based Defect Removal Pattern, Defect Removal Effectiveness, Metrics for Software
Maintenance, Software Reliability indicators, Software Reliability Metrics, Static Code Metrics,
Dynamic Metrics.
UNIT-III:
Software Reliability Assessment Models 8
Basics of Reliability Theory, Software Reliability Problem, Modeling Process, Software Reliability
Models, Parametric Reliability Growth Models, The Rayleigh Model, Exponential Distribution and
Software Reliability Growth Models, Software Quality Assessment Models: Hierarchical Model of
Software Quality Assessment.
UNIT-IV:
Software Reliability Allocation Models 8
Software Reliability Allocation Models, Criteria for Model Evaluation, Optimal Reliability Allocation,
Quality Planning and Control, Quality Improvement Process, Evolution of Software Quality Assurance
(SQA), Major SQA Activities, Major SQA Issues, Zero Defect Software.
UNIT-V:
Software Reliability Techniques 12
Reliability Techniques: Trending Reliability Techniques, Predicting Reliability Techniques, Error
Seeding, Failure Rate, Curve Fitting, Reliability Growth, Models and Tools: Study of tools like CASRE,
SARA, SMERFS.
TOTAL: 44 PERIODS
Text Books

1. John Musa, “Software Reliability Engineering”, McGraw-Hill

2. Fenton, and Pfleeger, “Software Metrics: A Rigorous and Practical Approach”,
International Thomson Computer Press
3. Jeff Tian, Software Quality Engineering (SQE), Wiley
4. Stephen H. Kan, Metrics and Models in Software Quality Engineering, Addison-Wesley

B. TECH. INFORMATION TECHNOLOGY forth Page 37