B TechITCST PDF
B TechITCST PDF
in
ACADEMIC REGULATIONS
COURSE STRUCTURE
AND
DETAILED SYLLABUS
te s
d a
INFORMATION
U p
TECHNOLOGY / COMPUTER
i t y
e r s
SCIENCE TECHNOLOGY
For
U
JAWAHARLAL NEHRU TECHNOLOGY UNIVERSITY HYDERABAD
KUKATPALLY, HYDERABAD - 500 085.
1
-
C
4
6
te s
Mathematical Methods
Engineering Physics
Engineering Chemistry
3
3
3
-
-
-
6
d
6
6 a
Computer Programming
Engineering Drawing
Computer Programming Lab.
U p 3
2
-
3
3
- 6
6
4
ti y
Engineering Physics / Engineering Chemistry Lab. - 3 4
English Language Communication Skills Lab. - 3 4
IT Workshop / Engineering Workshop - 3 4
Total
r s
II YEAR I SEMESTER
Code
e
Subject
19
L
16
T/P/D
56
II YEAR II SEMESTER
Code Subject L T/P/D C
Principles of Programming Languages 4 - 4
Database Management Systems 4 - 4
s
Java Programming 4 - 4
te
Environmental studies 4 - 4
Data Communication 4 - 4
Design and Analysis of Algorithms 4 - 4
Java Programming Lab
Database Management Systems Lab
Total
-
-
24
3
3
6
2
2
d
28
a
III YEAR I SEMESTER
Code Subject
Automata and Compiler Design
Linux Programming
U
L
p
4
4
T/P/D
-
-
C
4
4
y
Software Engineering 4 - 4
Operating Systems
Computer Networks
s i t
Managerial Economics and Financial Analysis
4
4
4
-
-
-
4
4
4
r
Operating Systems Lab - 3 2
Computer Networks Lab (Through Linux) - 3 2
i v e
Total
III YEAR II SEMESTER
Code Subject
24
L
6
T/P/D
28
n
Web Technologies 4 - 4
OPEN ELECTIVE 4 - 4
Human Values and Professional Ethics
IV YEAR I SEMESTER
s
Mobile Application Development 4 - 4
Information Retrieval Systems 4 - 4
te
ELECTIVE – I 4 - 4
Wireless Networks and Mobile Computing
a
Image Processing and Pattern Recognition
Soft Computing
d
Semantic Web and Social Networks
Operations Research
p
ELECTIVE – II 4 - 4
Software Project Management
Computer Graphics
U
Human Computer Interaction
Scripting Languages
Computer Forensics
Total
i t y
Case Tools and Software Testing Lab
Mobile Applications Development Lab
-
-
24
3
3
6
2
2
28
IV YEAR II SEMESTER
Code
e r
Subject
Management Science
ELECTIVE III
s L
4
4
T/P/D
-
-
C
4
4
n i v Web Services
E – Commerce
Middleware Technologies
Ad hoc and Sensor Networks
ELECTIVE IV 4 - 4
U
Multimedia & Rich Internet Applications
Artificial Intelligence
Storage Area Networks
Machine Learning
Industry Oriented Mini Project - - 2
Seminar - 6 2
Project Work - 15 10
Comprehensive Viva - - 2
Total 12 21 28
Note: All End Examinations (Theory and Practical) are of three hours duration.
T-Tutorial L – Theory P – Practical D-Drawing C – Credits
te s
a
linguistic and communicative competencies of Engineering students. The
prescribed books and the exercises are meant to serve broadly as students'
d
handbooks.
In the English classes, the focus should be on the skills of reading, writing,
U p
listening and speaking and for this the teachers should use the text prescribed
for detailed study. For example, the students should be encouraged to read
the texts/selected paragraphs silently. The teachers can ask comprehension
questions to stimulate discussion and based on the discussions students
can be made to write short paragraphs/essays etc.
y
The text for non-detailed study is for extensive reading/reading for pleasure.
t
Hence, it is suggested that they read it on their own the topics selected for
i
discussion in the class. The time should be utilized for working out the
s
exercises given after each section, as also for supplementing the exercises
with authentic materials of a similar kind for example, from newspaper articles,
r
advertisements, promotional material etc.. However, the stress in this syllabus
is on skill development, fostering ideas and practice of language skills.
i v
Objectives:
e
To improve the language proficiency of the students in English with
emphasis on LSRW skills.
To equip the students to study academic subjects more effectively
U n
SYLLABUS:
using the theoretical and practical components of the English syllabus.
To develop the study skills and communication skills in formal and
informal situations.
Listening Skills:
Objectives
1. To enable students to develop their listening skill so that they may
appreciate its role in the LSRW skills approach to language and
improve their pronunciation
2. To equip students with necessary training in listening so that they
te s
a
Listening for specific information
Speaking Skills:
Objectives
1.
2.
p d
To make students aware of the role of speaking in English and its
contribution to their success.
To enable students to express themselves fluently and appropriately
U
in social and professional contexts.
Oral practice
y
Describing objects/situations/people
i t
Role play – Individual/Group activities (Using exercises from the five
units of the prescribed text: Skills Annexe -Functional English for
Success)
s
Just A Minute(JAM) Sessions.
Reading Skills:
Objectives
e r
v
1. To develop an awareness in the students about the significance of
i
silent reading and comprehension.
2. To develop the ability of students to guess the meanings of words
n
from context and grasp the overall message of the text, draw
inferences etc.
U
Skimming the text
Understanding the gist of an argument
Identifying the topic sentence
Inferring lexical and contextual meaning
Understanding discourse features
Scanning
Recognizing coherence/sequencing of sentences
NOTE : The students will be trained in reading skills using the prescribed
text for detailed study.
te s
Writing sentences
Use of appropriate vocabulary
Paragraph writing
d a
Coherence and cohesiveness
Narration / description
Note Making
Formal and informal letter writing
U p
TEXTBOOKS PRESCRIBED:
i t y
Describing graphs using expressions of comparison
s
four skills mentioned above, the following texts and course content, divided
r
into Five Units, are prescribed:
For Detailed study: First Textbook: “Skills Annexe -Functional English for
i v1.
e
Success”, Published by Orient Black Swan, Hyderabad
For Non-detailed study
Second text book “Epitome of Wisdom”, Published by Maruthi
Publications, Guntur
U n
Unit –I:
1.
2.
The course content and study material is divided into Five Units.
W- Writing Paragraphs
G- Types of Nouns and Pronouns
V- Homonyms, homophones synonyms, antonyms
Unit –II
s
1. Chapter entitled “Cyber Age” from “Skills Annexe -Functional
English for Success” Published by Orient Black Swan, Hyderabad.
te
2. Chapter entitled 'Three Days To See' from “Epitome of Wisdom”,
Published by Maruthi Publications, Hyderabad.
a
L– Listening for themes and facts
S – Apologizing, interrupting, requesting and making polite conversation
R-
W-
G-
for theme and gist
Describing people, places, objects, events
Verb forms
p d
U
V- noun, verb, adjective and adverb
Unit –III
1. Chapter entitled 'Risk Management' from “Skills Annexe -
2.
Hyderabad
i y
Functional English for Success” Published by Orient Black Swan,
t
Chapter entitled 'Leela's Friend' by R.K. Narayan from “Epitome
s
of Wisdom”, Published by Maruthi Publications, Hyderabad
r
L– for main points and sub-points for note taking
S– giving instructions and directions; Speaking of hypothetical situations
i v
R–
W–
G– e
reading for details
note-making, information transfer, punctuation
present tense
n
V– synonyms and antonyms
Unit –IV
U
1. Chapter entitled 'Human Values and Professional Ethics' from
“Skills Annexe -Functional English for Success” Published by
Orient Black Swan, Hyderabad
2. Chapter entitled 'The Last Leaf' from “Epitome of Wisdom”,
Published by Maruthi Publications, Hyderabad
L- Listening for specific details and information
S- narrating, expressing opinions and telephone interactions
R- Reading for specific details and information
W- Writing formal letters and CVs
s
Functional English for Success” Published by Orient Black Swan,
Hyderabad
te
2. Chapter entitled 'The Convocation Speech' by N.R. Narayanmurthy'
from “Epitome of Wisdom”, Published by Maruthi Publications,
Hyderabad
L-
S-
R-
Critical Listening and Listening for speaker's tone/ attitude
Group discussion and Making presentations
Critical reading, reading for reference
d a
W-
G-
V-
Adjectives, prepositions and concord
Collocations and Technical vocabulary
U p
Project proposals; Technical reports, Project Reports and Research
Papers
y
Using words appropriately
*
classroom tasks.
REFERENCES :
s i t
Exercises from the texts not prescribed shall also be used for
r
1. Contemporary English Grammar Structures and Composition by
David Green, MacMillan Publishers, New Delhi. 2010.
i v
2.
3.
4. e
Innovate with English: A Course in English for Engineering Students,
edited by T Samson, Foundation Books.
English Grammar Practice, Raj N Bakshi, Orient Longman.
Technical Communication by Daniel Riordan. 2011. Cengage
n
Publications. New Delhi.
5. Effective English, edited by E Suresh Kumar, A RamaKrishna
U
Rao, P Sreehari, Published by Pearson
6. Handbook of English Grammar& Usage, Mark Lester and Larry
Beason, Tata Mc Graw –Hill.
7. Spoken English, R.K. Bansal & JB Harrison, Orient Longman.
8. Technical Communication, Meenakshi Raman, Oxford University
Press
9. Objective English Edgar Thorpe & Showick Thorpe, Pearson
Education
10. Grammar Games, Renuvolcuri Mario, Cambridge University Press.
15.
Basic Vocabulary Edgar Thorpe & Showick Thorpe, Pearson
Education
Effective Technical Communication, M Ashraf Rizvi, Tata Mc Graw –
Hill.
te s
16.
17.
Hemlatha Nagarajan , Frank Bros & CO
d a
An Interactive Grammar of Modern English, Shivendra K. Verma and
p
Pearson Education
18. Enrich your English, Thakur K B P Sinha, Vijay Nicole Imprints Pvt
U
Ltd.,
19. A Grammar Book for You And I, C. Edward Good, MacMillan Publishers
Outcomes:
i t y
Usage of English Language, written and spoken.
Enrichment of comprehension and fluency
s
Gaining confidence in using language in verbal situations.
e r
n i v
U
te s
a
if exist.
The concept of eigenvalues and eigenvectors of a matrix is to reduce
geometrically
p
The mean value theorems and to understand the concepts
d
a quadratic form into a canonical form through a linear transformation.
y U
The evaluation of improper integrals, Beta and Gamma functions
i t
The applications of the differential equations to Newton's law of
cooling, Natural growth and decay, Bending of beams etc
s
The definition of integral transforms and Laplace Transform
e r
Properties of Laplace transform
Inverse Laplace Transform
Convolution theorem
n i v
UNIT-I
Solution of Differential equations using Laplace transform
te s
a
Mean Value Theorem – Cauchy's mean value Theorem – (all theorems
without proof but with geometrical interpretations), verification of the
p
U
UNIT – III
Improper integration, Multiple integration & applications: Gamma and Beta
y
Functions –Relation between them, their properties – evaluation of improper
t
integrals using Gamma / Beta functions
i
Multiple integrals – double and triple integrals – change of order of integration-
change of variables (polar, cylindrical and spherical) Finding the area of a
UNIT – IV
e s
region using double integration and volume of a region using triple integration.
r
Differential equations and applications Overview of differential equations-
exact, linear and Bernoulli (NOT TO BE EXAMINED). Applications of first
v
order differential equations – Newton's Law of cooling, Law of natural growth
i
and decay, orthogonal trajectories.
Linear differential equations of second and higher order with constant
2.
Advanced engineering Mathematics by Kreyszig, John Wiley & Sons
Publishers.
Higher Engineering Mathematics by B.S. Grewal, Khanna Publishers.
te s
REFERENCES:
1. Advanced Engineering Mathematics by R.K. Jain & S.R.K. Iyengar,
3rd edition, Narosa Publishing House, Delhi.
d a
p
2. Engineering Mathematics – I by T.K. V. Iyengar, B. Krishna Gandhi &
Others, S. Chand.
U
3. Engineering Mathematics – I by D. S. Chandrasekhar, Prison Books
Pvt. Ltd.
4. Engineering Mathematics – I by G. Shanker Rao & Others I.K.
5.
y
International Publications.
t
Advanced Engineering Mathematics with MATLAB, Dean G. Duffy,
i
3rd Edi, CRC Press Taylor & Francis Group.
s
6. Mathematics for Engineers and Scientists, Alan Jeffrey, 6ht Edi, 2013,
r
Chapman & Hall/ CRC
7. Advanced Engineering Mathematics, Michael Greenberg, Second
i v
Outcome:
e
Edition. Pearson Education.
After learning the contents of this Unit the student is able to write the
matrix representation of a set of linear equations and to analyze solutions
n
of system of equations.
The student will be able to understand the methods of differential
U
calculus to optimize single and multivariable functions.
The student is able to evaluate the multiple integrals and can apply the
concepts to find the Areas, Volumes, Moment of Inertia etc., of regions
on a plane or in space.
The student is able to identify the type of differential equation and uses
the right method to solve the differential equation. Also able to apply
the theory of differential equations to the real world problems.
The student is able to solve certain differential equations using Laplace
Transform. Also able to transform functions on time domain to frequency
domain using Laplace transforms.
The objective is to find the relation between the variables x and y out
of the given data (x,y).
This unit also aims to find such relationships which exactly pass
te s
a
through data or approximately satisfy the data under the condition of
least sum of squares of errors.
The aim of numerical methods is to provide systematic methods for
p
solving problems in a numerical form using the given initial data.
d
This topic deals with methods to find roots of an equation and solving
a differential equation.
U
The numerical methods are important because finding an analytical
procedure to solve an equation may not be always available.
y
In the diverse fields like electrical circuits, electronic communication,
t
mechanical vibration and structural engineering, periodic functions
i
naturally occur and hence their properties are very much required.
s
Indeed, any periodic and non-periodic function can be best analyzed
in one way by Fourier series and transforms methods.
e r
The unit aims at forming a partial differential equation (PDE) for a
function with many variables and their solution methods. Two
important methods for first order PDE’s are learnt. While separation
v
of variables technique is learnt for typical second order PDE’s such
i
as Wave, Heat and Laplace equations.
In many Engineering fields the physical quantities involved are vector-
U n
UNIT – I:
valued functions.
Hence the unit aims at the basic properties of vector-valued functions
and their applications to line integrals, surface integrals and volume
integrals.
te s
– Newton-Raphson Method .
Solving system of non-homogeneous equations by L-U Decomposition
method(Crout’s Method)Jacobi’s and Gauss-Seidel Iteration method
d a
p
Numerical Differentiation, Integration, and Numerical solutions of First
order differential equations: Numerical differentiation, Numerical
integration - Trapezoidal rule, Simpson’s 1/3rd and 3/8 Rule , Generalized
Quadrature.
U
Numerical solution of Ordinary Differential equations: Solution by Taylor’s
y
series method –Picard’s Method of successive Approximation- single step
t
methods-Euler’s Method-Euler’s modified method, Runge-Kutta Methods
i
,Predictor –corrector methods(Milne’s Method and Adams-Bashforth methods
only).
UNIT – III:
r s
Fourier series and Fourier Transforms: Definition of periodic function.
e
Fourier expansion of periodic functions in a given interval of length 2
Determination of Fourier coefficients – Fourier series of even and odd
U UNIT-IV:
Partial differential equations : Introduction and Formation of partial
differential equation by elimination of arbitrary constants and arbitrary
functions, solutions of first order linear (Lagrange) equation and non-linear
equations (Charpit’s method), Method of separation of variables for second
order equations –Applications of Partial differential equations-Two
dimensional wave equation., Heat equation.
UNIT – V
Vector Calculus: Vector Calculus: Scalar point function and vector point
te s
REFERENCES:
1. Mathematical Methods by T.K.V. Iyengar, B.Krishna Gandhi & Others,
S. Chand.
d a
p
2. Introductory Methods by Numerical Analysis by S.S. Sastry, PHI
Learning Pvt. Ltd.
U
3. Mathematical Methods by G.Shankar Rao, I.K. International
Publications, N.Delhi
4. Mathematical Methods by V. Ravindranath, Etl, Himalaya Publications.
5.
6.
y
Advanced Engineering Mathematics with MATLAB, Dean G. Duffy,
t
3rd Edi, 2013, CRC Press Taylor & Francis Group.
i
Mathematics for Engineers and Scientists, Alan Jeffrey, 6ht Edi, 2013,
s
Chapman & Hall/ CRC
r
7. Advanced Engineering Mathematics, Michael Greenberg, Second
Edition. Pearson Education.
i v
Outcomes:
e
From a given discrete data, one will be able to predict the value of the data
at an intermediate point and by curve fitting, can find the most appropriate
formula for a guessed relation of the data variables. This method of analysis
n
data helps engineers to understand the system for better interpretation and
decision making
U
After studying this unit one will be able to find a root of a given equation
and will be able to find a numerical solution for a given differential
equation.
Helps in describing the system by an ODE, if possible. Also, suggests
to find the solution as a first approximation.
One will be able to find the expansion of a given function by Fourier
series and Fourier Transform of the function.
Helps in phase transformation, Phase change and attenuation of
coefficients in acoustics.
After studying this unit, one will be able to find a corresponding Partial
Differential Equation for an unknown function with many independent
variables and to find their solution.
Most of the problems in physical and engineering applications,
problems are highly non-linear and hence expressing them as PDEs’.
Hence understanding the nature of the equation and finding a suitable
solution is very much essential.
After studying this unit, one will be able to evaluate multiple integrals
(line, surface, volume integrals) and convert line integrals to area
te s
a
integrals and surface integrals to volume integrals.
It is an essential requirement for an engineer to understand the
behavior of the physical system.
p d
y U
s i t
e r
n i v
U
te s
determine the conductivity and specific heat values of the solids
d a
to understand the behavior of electron in a solid and thereby one can
p
core and Electromagnetic machinery
to help the student to design powerful light sources for various
Engineering Applications and also enable them to develop
y U
communication systems using Fiber Technology
to understand the working of Electronic devices, how to design
acoustic proof halls and understand the behavior of the materials at
t
Nano scale
i
UNIT-I
s
Crystallography: Ionic Bond, Covalent Bond, Metallic Bond, Hydrogen Bond,
Vander-Waal’s Bond, Calculation of Cohesive Energy of diatomic molecule-
e r
Space Lattice, Unit Cell, Lattice Parameters, Crystal Systems, Bravais
Lattices, Atomic Radius, Co-ordination Number and Packing Factor of SC,
BCC, FCC, Miller Indices, Crystal Planes and Directions, Inter Planar Spacing
v
of Orthogonal Crystal Systems, Structure of Diamond and NaCl.
U
UNIT-II
Principles of Quantum Mechanics: Waves and Particles, de Broglie
Hypothesis , Matter Waves, Davisson and Germer’ Experiment, Heisenberg’s
Uncertainty Principle, Schrödinger’s Time Independent Wave Equation -
Physical Significance of the Wave Function – Infinite square well potential,
extension to three dimensions
Elements of Statistical Mechanics& Electron theory of Solids: Phase
space, Ensembles, Micro Canonical , Canonical and Grand Canonical
Ensembles - Maxwell-Boltzmann, Bose-Einstein and Fermi-Dirac Statistics
(Qualitative Treatment), Concept of Electron Gas, , Density of States, Fermi
te s
a
electricity and Ferro- electricity.
Magnetic Properties & Superconducting Properties: Permeability, Field
p
Ferro Magnetic Materials on the basis of Magnetic Moment, Domain Theory
d
Intensity, Magnetic Field Induction, Magnetization, Magnetic Susceptibility,
Origin of Magnetic Moment, Bohr Magneton, Classification of Dia, Para and
of Ferro Magnetism on the basis of Hysteresis Curve, Soft and Hard Magnetic
Materials, Properties of Anti-Ferro and Ferri Magnetic Materials and their
U
Applications, Superconductivity, Meissner Effect, Effect of Magnetic field,
Type-I & Type-II Superconductors, Applications of Superconductors
UNIT-IV
y
t
Optics: Interference-Interference in thin films(Reflected light), Newton rings
i
experiment- Fraunhofer diffraction due to single slit, N-slits, Diffraction grating
s
experiment , Double refraction-construction and working of Nicol’s Prism
r
Lasers & Fiber Optics: Characteristics of Lasers, Spontaneous and
Stimulated Emission of Radiation, Einstein’s Coefficients and Relation
e
between them, Population Inversion, Lasing Action, Ruby Laser, Helium-
Neon Laser, Semiconductor Diode Laser, Applications of Lasers- Principle
U
Semiconductor Physics: Fermi Level in Intrinsic and Extrinsic
Semiconductors, Calculation of carrier concentration in Intrinsic &, Extrinsic
Semiconductors, Direct and Indirect Band gap semiconductors, Hall Effect-
Formation of PN Junction, Open Circuit PN Junction, Energy Diagram of PN
Diode, Diode Equation, I-V Characteristics of PN Junction diode, Solar cell,
LED & Photo Diodes. Acoustics of Buildings & Acoustic Quieting:,
Reverberation and Time of Reverberation, Sabine’s Formula for
Reverberation Time, Measurement of Absorption Coefficient of a Material,
Factors Affecting The Architectural Acoustics and their Remedies
Nanotechnology: Origin of Nanotechnology, Nano Scale, Surface to Volume
te s
a
Walker by John Wiley & Sons
2. Sears and Zemansky’s University Physics (10th Edition) by Hugh D.
d
Young Roger A. Freedman, T. R. Sandin, A. Lewis FordAddison-
Wesley Publishers;
3.
4.
5. p
Applied Physics for Engineers – P. Madhusudana Rao (Academic
Publishing company, 2013)
U
Solid State Physics – M. Armugam (Anuradha Publications).
Modern Physics – R. Murugeshan & K. Siva Prasath – S. Chand &
Co. (for Statistical Mechanics).
6.
7.
i t y
A Text Book of Engg Physics – M. N. Avadhanulu & P. G. Khsirsagar–
S. Chand & Co. (for acoustics).
Modern Physics by K. Vijaya Kumar, S. Chandralingam: S. Chand &
8.
9.
10.
Co.Ltd
e r s
Nanotechnology – M.Ratner & D. Ratner (Pearson Ed.).
Introduction to Solid State Physics – C. Kittel (Wiley Eastern).
Solid State Physics – A.J. Dekker (Macmillan).
n i v11.
Outcomes:
Applied Physics – Mani Naidu Pearson Education
U
The knowledge on Fundamentals of Quantum Mechanics, Statistical
Mechanics enables the student to apply to various systems like
Communications Solar Cells, Photo Cells and so on.
Design, Characterization and study of properties of materials help
the student to prepare new materials for various Engineering
applications.
This course also helps the student exposed to non destructive testing
methods.
Finally, Engineering Physics Course helps the student to develop
problem solving skills and analytical skills
te s
a
our environment has a molecular make up. Engineering requires the
concepts of applied chemistry and the more chemistry an engineer
d
understands, the more beneficial it is. In the future, global problems and
issues will require an in-depth understanding of chemistry to have a global
p
solution. This syllabus aims at bridging the concepts and theory of chemistry
with examples from fields of practical application, thus reinforcing the
connection between science and engineering. It deals with the basic
y U
principles of various branches of chemistry which are fundamental tools
t
Electrochemistry & Corrosion: Electro Chemistry – Conductance - Specific,
i
Equivalent and Molar conductance and their Units; Applications of
s
Conductance (Conductometric titrations). EMF: Galvanic Cells, types of
Electrodes – (Calomel, Quinhydrone and glass electrodes); Nernst equation
r
and its applications ; concept of concentration cells, electro chemical series,
Potentiometric titrations, determination of PH using glass electrode-Numerical
i v
problems.
e
Batteries: Primary cells (ry cells) and secondary cells (lead-Acid cell, Ni-Cd
cell, Lithium cells). Applications of batteries. Fuel cells – Hydrogen – Oxygen
fuel cell; methanol – oxygen fuel cell ; Advantages and Applications.
te s
a
acid - Cement: composition of Portland cement, setting & hardening of
cement (reactions), Lubricants: Classification with examples- Characterstics
d
of a good lubricant & mechanism of lubrication (thick film , thin film and
extreme pressure) – properties of lubricants: viscosity , Cloud point, flash
p
and fire points. Refractories: Classification, characteristics of a good
refractory and applications.
Nanomaterials: Introduction, preparation by sol-gel & chemical vapour
deposition methods. Applications of nanomaterials.
UNIT III:
y U
Water and its Treatment: Hardness of Water: Causes of hardness,
t
expression of hardness – units – types of hardness, estimation of temporary
i
& permanent hardness of water by EDTA method - numerical problems.
s
Boiler troubles – Scale & sludges, Priming and foaming, caustic enbrittlement
and boiler corrosion; Treatment of boiler feed water – Internal treatment (
e r
Phosphate, Colloidal and calgon conditioning) – External treatment – Lime
Soda process, Zeolite process and ion exchange process. Numerical
Problems. Potable Water- Its Specifications – Steps involved in trtament of
v
potable water – Disinfection of water by chlorination and ozonisation. Reverse
i
osmosis & its significance.
Unit – IV :
te s
a
1. Engineering Chemistry by R.P. Mani,K.N. Mishra, B. Rama Devi /
CENGAGE learning.
2.
1.
Engineering Chemistry by P.C Jain & Monica Jain, Dhanpatrai
Publishing Company (2008).
REFERENCE BOOKS
p d
Engineering Chemistry by B. Siva Shankar Mc.Graw Hill Publishing
2.
Company Limited, New Delhi (2006)
U
Engineering Chemistry J.C. Kuriacase & J. Rajaram, Tata McGraw
y
Hills Publishing Company Limited, New Delhi (2004).
t
3. Text Book of Engineering Chemistry by S.S. Dara & Mukkati S. Chand
i
& Co Publishers, New Delhi(2006)
s
4. Chemistry of Engineering Materials by CV Agarwal,C.P Murthy,
A.Naidu, BS Publications.
Outcome:
e r
Students will demonstrate a depth of knowledge and apply the
methods of inquiry in a discipline of their choosing, and they will
n i v
demonstrate a breadth of knowledge across their choice of varied
disciplines.
Students will demonstrate the ability to access and interpret
information, respond and adapt to changing situations, make complex
decisions, solve problems, and evaluate actions.
te s
To learn to write programs (using structured programming approach)
in C to solve problems.
d a
To introduce the students to basic data structures such as lists, stacks
p
and queues.
To make the student understand simple sorting and searching
U
methods.
UNIT - I
Introduction to Computers – Computer Systems, Computing Environments,
Development.
i y
Computer Languages, Creating and running programs, Program
t
Introduction to the C Language – Background, C Programs, Identifiers, Types,
s
Variables, Constants, Input / Output, Operators(Arithmetic, relational, logical,
r
bitwise etc.), Expressions, Precedence and Associativity, Expression
Evaluation, Type conversions, Statements- Selection Statements(making
e
decisions) – if and switch statements, Repetition statements ( loops)-while,
for, do-while statements, Loop examples, other statements related to looping
U
functions, Limitations of recursion, example C programs, Preprocessor
commands.
Arrays – Concepts, using arrays in C, inter function communication, array
applications, two – dimensional arrays, multidimensional arrays, C program
examples.
UNIT - III
Pointers – Introduction (Basic Concepts), Pointers for inter function
communication, pointers to pointers, compatibility, Pointer Applications-Arrays
and Pointers, Pointer Arithmetic and arrays, Passing an array to a function,
te s
a
unions, bit fields, C programming examples, command –line arguments,
Input and Output – Concept of a file, streams, text files and binary files,
d
Differences between text and binary files, State of a file, Opening and Closing
p
files, file input / output functions (standard library input / output functions for
files), file status functions (error handling),Positioning functions, C program
examples.
U
UNIT – V
Searching and Sorting – Sorting- selection sort, bubble sort, Searching-linear
y
and binary search methods.
t
Lists- Linear list – singly linked list implementation, insertion, deletion and
i
searching operations on linear list, Stacks-Push and Pop Operations,
Queues- Enqueue and Dequeue operations.
TEXT BOOKS:
1.
2.
r s
Computer Science: A Structured Programming Approach Using C,
e
B.A.Forouzan and R.F. Gilberg, Third Edition, Cengage Learning.
Programming in C. P. Dey and M Ghosh , Oxford University Press.
n i vREFERENCE BOOKS:
1.
2.
C& Data structures – P. Padmanabham, Third Edition, B.S.
Publications.
C for All, S. Thamarai Selvi, R.Murugesan, Anuradha Publications.
U
3. Problem Solving and Program Design in C, J.R. Hanly and E.B.
Koffman, 7th Edition, Pearson education.
4. Programming in C, Ajay Mittal, Pearson.
5. Programming with C, B.Gottfried, 3rd edition, Schaum’s outlines, TMH.
6. Problem solving with C, M.T.Somasekhara, PHI
7. Programming with C, R.S.Bickar, Universities Press.
8. Computer Programming & Data Structures, E.Balagurusamy, 4 th
edition, TMH.
9. Programming in C – Stephen G. Kochan, III Edition, Pearson
Education.
10. The C Programming Language, B.W. Kernighan and Dennis
M.Ritchie, PHI.
11. C Programming with problem solving, J.A. Jones & K.
Harrow,Dreamtech Press.
Outcomes:
Demonstrate the basic knowledge of computer hardware and software.
Ability to apply solving and logical skills to programming in C language and
te s
a
also in other languages.
p d
y U
s i t
e r
n i v
U
te s
a
Curves: Constructions of Curves used in Engineering Practice:
a) Conic Sections including the Rectangular Hyperbola – General
b)
c)
method only.
Cycloid, Epicycloid and Hypocycloid
Involute.
p d
U
Scales: Construction of different types of Scales, Plain, Diagonal, Vernier
scale.
UNIT – II
i y
Orthographic Projections in First Angle
t
Projection: Principles of Orthographic Projections – Conventions – First
and Third Angle projections.
s
Projections of Points. including Points in all four quadrants.
r
Projections of Lines - Parallel, perpendicular, inclined to one plan and
inclined to both planes. True length and true angle of a line. Traces of a line.
e
Projections of Planes: Plane parallel, perpendicular and inclined to one
v
reference plane. Plane inclined to both the reference planes.
n i UNIT – III
Projections of Solids: Projections of regular solids, cube, prisms, pyramids,
tetrahedran, cylinder and cone, axis inclined to both planes.
Sections and Sectional Views: Right Regular Solids – Prism, Cylinder,
U
Pyramid, Cone – use of Auxiliary views.
UNIT – IV
Development of Surfaces: Development of Surfaces of Right, Regular
Solids – Prisms, Cylinder, Pyramids, Cone and their parts. frustum of solids.
Intersection of Solids:- Intersection of Cylinder Vs Cylinder, Cylinder Vs
Prism, Cylinder Vs Cone.
UNIT – V
Isometric Projections : Principles of Isometric Projection – Isometric Scale
– Isometric Views– Conventions – Plane Figures, Simple and Compound
te s
2. Engineering Drawing, N.D. Bhatt
REFERENCES :
1. Engineering Graphics. P I Varghese Tata McGraw Hill Education
d a
2.
3.
4.
Pvt. Ltd.
U p
Engineering drawing – P.J. Shah .S.Chand Publishers.
Engineering Drawing- Johle/Tata Macgraw Hill Book Publishers.
Engineering Drawing – M.B. Shah and B.C. Rana, Pearson.
y
5. Engineering Drawing by K.Venu Gopal& V.Prabu Raja New Age
t
Publications.
i
6. Engineering Drawing By John. PHI Learning Publisher.
e r s
n i v
U
te s
Recommended Systems/Software Requirements:
Intel based desktop PC
ANSI C Compiler with Supporting Editors
d a
Week l
U p
a) Write a C program to find the sum of individual digits of a positive integer.
b) A Fibonacci sequence is defined as follows: the first and second terms in
the sequence are 0 and 1. Subsequent terms are found by adding the
y
preceding two terms in the sequence. Write a C program to generate the
t
first n terms of the sequence.
i
c) Write a C program to generate all the prime numbers between 1 and n,
where n is a value supplied by the user.
Week 2
a)
r s
Write a C program to calculate the following Sum:
e
Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10!
v
b) Write a C program to find the roots of a quadratic equation.
i
Week 3
a) The total distance travelled by vehicle in ‘t’ seconds is given by distance s
n
= ut+1/2at2 where ‘u’ and ‘a’ are the initial velocity (m/sec.) and acceleration
(m/sec2). Write C program to find the distance travelled at regular intervals
of time given the values of ‘u’ and ‘a’. The program should provide the flexibility
U to the user to select his own time intervals and repeat the calculations for
different values of ‘u’ and ‘a’.
b) Write a C program, which takes two integer operands and one operator
from the user, performs the operation and then prints the result. (Consider
the operators +,-,*, /, % and use Switch Statement)
Week 4
a) Write C programs that use both recursive and non-recursive functions
i) To find the factorial of a given integer.
s
b) Write a C program that uses functions to perform the following:
i) Addition of Two Matrices
te
ii) Multiplication of Two Matrices
Week 6
a) Write a C program that uses functions to perform the following operations:
i)
a
To insert a sub-string in to a given main string from a given
position.
d
p
ii) To delete n Characters from a given position in a given string.
b) Write a C program to determine if the given string is a palindrome or not
U
Week 7
a) Write a C program that displays the position or index in the string S where
the string T begins, or – 1 if S doesn’t contain T.
text.
Week 8
i y
b) Write a C program to count the lines, words and characters in a given
t
s
a) Write a C program to generate Pascal’s triangle.
r
b) Write a C program to construct a pyramid of numbers.
Week 9
e
Write a C program to read in two numbers, x and n, and then compute the
U
Perform error checking. For example, the formula does not make sense for
negative exponents – if n is less than 0. Have your program print an error
message if n<0, then go back and read in the next pair of numbers of without
computing the sum. Are any values of x also illegal? If so, test for them too.
Week 10
a) 2’s complement of a number is obtained by scanning it from right to left
and complementing all the bits after the first appearance of a 1. Thus 2’s
complement of 11100 is 00100. Write a C program to find the 2’s complement
of a binary number.
b) Write a C program to convert a Roman numeral to its decimal equivalent.
Week 11
Write a C program that uses functions to perform the following operations:
i) Reading a complex number
ii) Writing a complex number
s
iii) Addition of two complex numbers
te
iv) Multiplication of two complex numbers
(Note: represent complex number using a structure.)
Week 12
a) Write a C program which copies one file to another.
b) Write a C program to reverse the first n characters in a file.
(Note: The file name and n are specified on the command line.)
d a
Week 13
a) Write a C program to display the contents of a file.
U p
b) Write a C program to merge two files into a third file (i.e., the contents of
the first file followed by those of the second are put in the third file)
y
Week 14
t
a) Write a C program that uses non recursive function to search for a Key
i
value in a given list of integers using Linear search.
s
b) Write a C program that uses non recursive function to search for a Key
value in a given sorted list of integers using Binary search.
Week 15
e r
a) Write a C program that implements the Selection sort method to sort a
given array of integers in ascending order.
n i vb) Write a C program that implements the Bubble sort method to sort a
given list of names in ascending order.
Week 16
Write a C program that uses functions to perform the following operations:
U
i) Create a singly linked list of integer elements.
ii) Traverse the above list and display the elements.
Week 17
Write a C program that implements stack (its operations) using a singly
linked list to display a given list of integers in reverse order. Ex. input: 10 23
4 6 output: 6 4 23 10
Week 18
Write a C program that implements Queue (its operations) using a
singly linked list to display a given list of integers in the same order. Ex.
input: 10 23 4 6 output: 10 23 4 6
Week 19
Write a C program to implement the linear regression algorithm.
Week 20
s
Write a C program to implement the polynomial regression algorithm.
te
Week 21
Write a C program to implement the Lagrange interpolation.
Week 22
Week 23
Write a C program to implement Trapezoidal method.
d a
Write C program to implement the Newton- Gregory forward interpolation.
Week 24
Write a C program to implement Simpson method.
TEXT BOOKS:
1.
U p
C programming and Data Structures, P. Padmanabham, Third Edition,
y
BS Publications
t
2. Computer Programming in C, V. Rajaraman, PHI Publishers.
3.
4.
5.
s i
C Programming, E.Balagurusamy, 3rd edition, TMH Publishers.
C Programming, M.V.S.S.N.Prasad, ACME Learning Pvt. Ltd.
r
C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand
Publishers
i v
6.
e
Mastering C, K.R. Venugopal and S.R. Prasad, TMH Publishers.
U n
Objectives
ENGINEERING PHYSICS LAB
(Any TEN experiments compulsory)
te s
This course on Physics lab is designed with 13 experiments in an academic
year. It is common to all branches of Engineering in B.Tech Ist year.
d a
The objective of the course is that the student will have exposure to various
p
experimental skills which is very essential for an Engineering student.
The experiments are selected from various area of Physics like Physical
U
Optics, Lasers, Fiber Optics, Sound, Mechanics, Electricity & Magnetism
and Basic Electronics.
Also the student is exposed to various tools like Screw gauge, Vernier
1.
2.
t y
Callipers, Physics Balance , Spectrometer and Microscope.
Dispersive power of the material of a prism – Spectrometer
i
Determination of wavelength of a source – Diffraction Grating.
3.
4.
5.
6.
s
Newton’s Rings - Radius of curvature of plano convex lens.
r
Melde’s experiment – Transverse and longitudinal modes.
e
Time constant of an R-C circuit.
L-C-R circuit.
n i v7.
8.
9.
Magnetic field along the axis of current carrying coil – Stewart and
Gees method.
Study the characteristics of LED and LASER sources.
Bending losses of fibres & Evaluation of numerical aperture of a given
fibre.
U 10.
11.
12.
13.
Energy gap of a material of p-n junction.
Torsional pendulum.
Wavelength of light –diffraction grating - using laser.
Characteristics of a solar cell
LABORATORY MANUAL:
1. Laboratory Manual of Engineering Physics by Dr.Y.Aparna &
Dr.K.Venkateswara Rao (V.G.S Publishers)
Outcomes
The student is expected to learn from this laboratory course the concept of
error and its analysis. It also allows the student to develop experimental
skills to design new experiments in Engineering.
With the exposure to these experiments the student can compare the theory
and correlate with experiment.
te s
a
List of Experiments ( Any 12 of the following) :
Titrimetry:
1.
2.
Estimation of ferrous iron by dichrometry.
Estimation of hardness of water by EDTA method.
Mineral analysis:
3. Determination of percentage of copper in brass.
p d
4.
Instrumental Methods:
Colorimetry:
y U
Estimation of manganese dioxide in pyrolusite.
5.
6.
i t
Determination of ferrous iron in cement by colorimetric method
Estimation of copper by colorimetric method.
Conductometry:
s
7.
8.
e r
Conductometric titration of strong acid vs strong base.
Conductometric titration of mixture of acids vs strong base.
v
Potentiometry:
i
9. Titration of strong acd vs strong base by potentiometry.
10. Titration of weak acid vs strong base by potentiometry.
U n Physical properties:
11.
12.
Determination of viscosity of sample oil by redwood / oswald’s
viscometer.
Determination of Surface tension of lubricants.
Preparations:
13. Preparation of Aspirin
14. Preparation of Thiokol rubber
Adsorption:
15. Adsorption of acetic acid on charcoal.
TEXT BOOKS:
1. Practical Engineering Chemistry by K. Mukkanti, etal, B.S.
Publications, Hyderabad.
2. Inorganic quantitative analysis, Vogel.
s
REFERENCE BOOKS:
1. Text Book of engineering chemistry by R. N. Goyal and Harrmendra
te
Goel, Ane Books Private Ltd.,
2. A text book on experiments and calculation Engg. S.S. Dara.
a
3. Instrumental methods of chemical analysis, Chatwal, Anand, Himalaya
Publications.
p d
y U
s i t
e r
n i v
U
te s
To facilitate computer-aided multi-media instruction enabling
individualized and independent language learning
d
To sensitise the students to the nuances of English speech sounds,
a
p
word accent, intonation and rhythm
To bring about a consistent accent and intelligibility in their
U
pronunciation of English by providing an opportunity for practice in
speaking
To improve the fluency in spoken English and neutralize mother
tongue influence
i t y
To train students to use language appropriately for interviews, group
discussion and public speaking
parts:
a.
b.
e r s
Syllabus: English Language Communication Skills Lab shall have two
U
Consonants
ICS Lab: Ice-Breaking activity and JAM session
Articles, Prepositions, Word formation- Prefixes & Suffixes, Synonyms &
Antonyms
Exercise – II
CALL Lab: Structure of Syllables - Past Tense Marker and Plural Marker –
Weak Forms and Strong Forms - Consonant Clusters.
ICS Lab: Situational Dialogues – Role-Play- Expressions in Various Situations
s
Exercise - III
CALL Lab: Minimal Pairs- Word accent and Stress Shifts- Listening
te
Comprehension.
ICS Lab: Descriptions- Narrations- Giving Directions and guidelines.
Sequence of Tenses, Question Tags and One word substitutes.
Exercise – IV
CALL Lab: Intonation and Common errors in Pronunciation.
d a
ICS Lab: Extempore- Public Speaking
Exercise – V
U p
Active and Passive Voice, –Common Errors in English, Idioms and Phrases
y
Practice
t
ICS Lab: Information Transfer- Oral Presentation Skills
i
Reading Comprehension and Job Application with Resume preparation.
s
Minimum Requirement of infra structural facilities for ELCS Lab:
1.
e r
Computer Assisted Language Learning (CALL) Lab:
The Computer aided Language Lab for 40 students with 40 systems, one
master console, LAN facility and English language software for self- study
n i vby learners.
System Requirement (Hardware component):
Computer network with Lan with minimum 60 multimedia systems with the
following specifications:
U
P – IV Processor
Speed – 2.8 GHZ
RAM – 512 MB Minimum
Hard Disk – 80 GB
Headphones of High quality
2. Interactive Communication Skills (ICS) Lab :
The Interactive Communication Skills Lab: A Spacious room with movable
chairs and audio-visual aids with a Public Address System, a T. V., a digital
s
Suresh Kumar, E. & Sreehari, P. 2009. A Handbook for English Language
Laboratories. New Delhi: Foundation
te
Speaking English Effectively 2nd Edition by Krishna Mohan and N. P. Singh,
2011. Macmillan Publishers India Ltd. Delhi.
a
Sasi Kumar, V & Dhamija, P.V. How to Prepare for Group Discussion and
Interviews. Tata McGraw Hill
CUP
d
Hancock, M. 2009. English Pronunciation in Use. Intermediate. Cambridge:
p
Spoken English: A Manual of Speech and Phonetics by R. K. Bansal & J. B.
Harrison. 2013. Orient Blackswan. Hyderabad.
CUP
y U
Hewings, M. 2009. English Pronunciation in Use. Advanced. Cambridge:
t
Nambiar, K.C. 2011. Speaking Accurately. A Course in International
i
Communication. New Delhi : Foundation
s
Soundararaj, Francis. 2012. Basics of Communication in English. New Delhi:
r
Macmillan
e
Spoken English (CIEFL) in 3 volumes with 6 cassettes, OUP.
English Pronouncing Dictionary Daniel Jones Current Edition with CD.
2.
The practical examinations for the English Language Laboratory shall
be conducted as per the University norms prescribed for the core
engineering practical sessions.
For the Language lab sessions, there shall be a continuous evaluation
during the year for 25 sessional marks and 50 year-end Examination
marks. Of the 25 marks, 15 marks shall be awarded for day-to-day
s
Outcomes:
Better Understanding of nuances of language through audio- visual
te
experience and group activities
Neutralization of accent for intelligibility
a
Speaking with clarity and confidence thereby enhancing employability
skills of the students
p d
y U
s i t
e r
n i v
U
te s
a
PC Hardware introduces the students to a personal computer and its basic
peripherals, the process of assembling a personal computer, installation of
system software like MS Windows, Linux and the required device drivers. In
p
would be covered. The students should work on working PC to
disassemble and assemble to working condition and install Windows d
addition hardware and software level troubleshooting process, tips and tricks
U
and Linux on the same PC. Students are suggested to work similar
tasks in the Laptop scenario wherever possible.
Internet & World Wide Web module introduces the different ways of hooking
y
the PC on to the internet from home and workplace and effectively usage of
t
the internet. Usage of web browsers, email, newsgroups and discussion
i
forums would be covered. In addition, awareness of cyber hygiene, i.e.,
s
protecting the personal computer from getting infected with the viruses, worms
and other cyber attacks would be introduced.
e r
Productivity tools module would enable the students in crafting professional
word documents, excel spread sheets and power point presentations using
the Microsoft suite of office tools and LaTeX. (Recommended to use
v
Microsoft office 2007 in place of MS Office 2003)
i
PC Hardware
Week 1 – Task 1 : Identify the peripherals of a computer, components in a
U n CPU and its functions. Draw the block diagram of the CPU along with the
configuration of each peripheral and submit to your instructor.
Week 2 – Task 2 : Every student should disassemble and assemble the PC
back to working condition. Lab instructors should verify the work and follow
it up with a Viva. Also students need to go through the video which shows
the process of assembling a PC. A video would be given as part of the
course content.
Week 3 – Task 3 : Every student should individually install MS windows on
the personal computer. Lab instructor should verify the installation and follow
it up with a Viva.
Week 4 – Task 4 : Every student should install Linux on the computer. This
computer should have windows installed. The system should be configured
as dual boot with both windows and Linux. Lab instructors should verify the
installation and follow it up with a Viva
Week 5 – Task 5: Hardware Troubleshooting: Students have to be given
a PC which does not boot due to improper assembly or defective peripherals.
They should identify the problem and fix it to get the computer back to working
condition. The work done should be verified by the instructor and followed
up with a Viva
Week 6 – Task 6 : Software Troubleshooting : Students have to be given
a malfunctioning CPU due to system software problems. They should identify
te s
a
the problem and fix it to get the computer back to working condition. The
work done should be verified by the instructor and followed up with a Viva.
Internet & World Wide Web
p d
Week 7 - Task 1 : Orientation & Connectivity Boot Camp : Students should
get connected to their Local Area Network and access the Internet. In the
process they configure the TCP/IP setting. Finally students should
U
demonstrate, to the instructor, how to access the websites and email. If
there is no internet connectivity preparations need to be made by the
instructors to simulate the WWW on the LAN.
y
Week 8 - Task 2 : Web Browsers, Surfing the Web : Students customize
t
their web browsers with the LAN proxy settings, bookmarks, search toolbars
i
and pop up blockers. Also, plug-ins like Macromedia Flash and JRE for
s
applets should be configured.
r
Week 9 - Task 3 : Search Engines & Netiquette : Students should know
what search engines are and how to use the search engines. A few topics
e
would be given to the students for which they need to search on Google.
This should be demonstrated to the instructors by the student.
U
to avoid viruses and/or worms.
Week 11- Task 5: Develop your home page using HTML Consisting of your
photo, name, address and education details as a table and your skill set as
a list.
Productivity tools
LaTeX and Word
Week 12 – Word Orientation: The mentor needs to give an overview of
LaTeX and Microsoft (MS) office 2007/ equivalent (FOSS) tool word:
Importance of LaTeX and MS office 2007/ equivalent (FOSS) tool Word as
word Processors, Details of the three tasks and features that would be
covered in each, using LaTeX and word – Accessing, overview of toolbars,
saving files, Using help and resources, rulers, format painter.
Task 1 : Using LaTeX and Word to create project certificate. Features to be
covered:-Formatting Fonts in word, Drop Cap in word, Applying Text effects,
Using Character Spacing, Borders and Colors, Inserting Header and Footer,
Using Date and Time option in both LaTeX and Word.
Week 13 - Task 2: Creating project abstract Features to be covered:-
Formatting Styles, Inserting table, Bullets and Numbering, Changing Text
te s
a
Direction, Cell alignment, Footnote, Hyperlink, Symbols, Spell Check, Track
Changes.
p d
Week 14 - Task 3 : Creating a Newsletter : Features to be covered:- Table
of Content, Newspaper columns, Images from files and clipart, Drawing
toolbar and Word Art, Formatting Images, Textboxes, Paragraphs and Mail
Merge in word.
U
Excel
Week 15 - Excel Orientation: The mentor needs to tell the importance of
MS office 2007/ equivalent (FOSS) tool Excel as a Spreadsheet tool, give
y
the details of the two tasks and features that would be covered in each.
t
Using Excel – Accessing, overview of toolbars, saving excel files, Using
help and resources.
i
s
Task 1: Creating a Scheduler - Features to be covered:- Gridlines, Format
r
Cells, Summation, auto fill, Formatting Text
Week 16 - Task 2 : Calculating GPA - .Features to be covered:- Cell
e
Referencing, Formulae in excel – average, std. deviation, Charts, Renaming
and Inserting worksheets, Hyper linking, Count function, LOOKUP/VLOOKUP,
U Word Art, Formatting Text, Bullets and Numbering, Auto Shapes, Lines and
Arrows in both LaTeX and Power point. Students will be given model power
point presentation which needs to be replicated (exactly how it’s asked).
Week 18- Task 2: Second week helps students in making their presentations
interactive. Topic covered during this week includes: Hyperlinks, Inserting –
Images, Clip Art, Audio, Video, Objects, Tables and Charts
Week 19 - Task 3: Concentrating on the in and out of Microsoft power point
and presentations in LaTeX. Helps them learn best practices in designing
and preparing power point presentation. Topic covered during this week
includes: - Master Layouts (slide, template, and notes), Types of views (basic,
presentation, slide slotter, notes etc), Inserting – Background, textures,
Design Templates, Hidden slides.
REFERENCE BOOKS:
1. Introduction to Information Technology, ITL Education Solutions
2.
3.
limited, Pearson Education.
LaTeX Companion – Leslie Lamport, PHI/Pearson.
Introduction to Computers, Peter Norton, 6/e Mc Graw Hill Publishers.
te s
a
4. Upgrading and Repairing, PC’s 18th e, Scott Muller QUE, Pearson
Education
d
5. Comdex Information Technology course tool kit Vikas Gupta, WILEY
Dreamtech
6.
7.
Outcomes:
Education.
U p
IT Essentials PC Hardware and Software Companion Guide Third
Edition by David Anfinson and Ken Quamme. – CISCO Press, Pearson
i t y
Apply knowledge for computer assembling and software installation.
Ability how to solve the trouble shooting problems.
s
Apply the tools for preparation of PPT, Documentation and budget
sheet etc.
e r ENGINEERING WORKSHOP
v
1. TRADES FOR EXERCISES:
i
At least two exercises from each trade:
1. Carpentry
U n 2.
3.
4.
5.
6.
7.
Fitting
Tin-Smithy and Development of jobs carried out and soldering.
Black Smithy
House-wiring
Foundry
Welding
8. Power tools in construction, wood working, electrical engineering and
mechanical Engineering.
s
TEXT BOOK:
te
1. Work shop Manual - P.Kannaiah/ K.L.Narayana/ Scitech Publishers.
2. Workshop Manual / Venkat Reddy/ BS Publications/Sixth Edition
d a
U p
i t y
e r s
n i v
U
te s
a
In the discrete case, study of the binomial and the Poisson random
variables and the Normal random variable for the continuous case
predominantly describe important probability distributions. Important
statistical properties for these random variables provide very good
p
insight and are essential for industrial applications.
Most of the random situations are described as functions of many d
U
single random variables. In this unit, the objective is to learn functions
of many random variables through joint distributions.
The types of sampling, Sampling distribution of means,Sampling
y
distribution of variance,Estimations of statistical parameters, Testing
t
of hypothesis of few unknown statistical parameters.
i
The mechanism of queuing system ,The characteristics of queue,The
s
mean arrival and service rates
r
The expected queue length, The waiting line
The random processes, The classification of random processes,
i v
UNIT-I
e
Markov chain, Classification of states
Stochastic matrix ( transition probability matrix),Limiting probabilities,
Applications of Markov chains
te s
distribution of varience.
Parameter estimations – likelihood estimate, interval estimations.
d
Testing of hypothesis: Null hypothesis, Alternate hypothesis, type I, & type
a
p
II errors – critical region, confidence interval, Level of significance. One
sided test, two sided test,
U
Large sample tests:
(i) Test of Equality of means of two samples equality of sample mean
and population mean (cases of known varience & unknown varience,
(ii)
y
equal and unequal variances)
t
Tests of significance of difference between sample S.D and population
S.D.
i
s
(iii) Tests of significance difference between sample proportion and
r
population proportion&difference between two sample proportions.
Small sample tests:
i v e
Student t-distribution,its properties; Test of significance difference between
sample mean and population mean; difference between means of two small
samples
Snedecor's F- distribution and it's properties. Test of equality of two population
n
variences
Chi-square distribution , it's properties, Chi-square test of goodness of fit
U
UNIT-IV
Queuing Theory: Structure of a queuing system, Operating Characteristics
of queuing system, Transient and steady states, Terminology of Queuing
systems, Arrival and service processes- Pure Birth-Death process
Deterministic queuing models- M/M/1 Model of infinite queue, M/M/1 model
of finite queue .
UNIT-V
Stochastic processes: Introduction to Stochastic Processes –Classification
of Random processes, Methods of description of random processes,
2)
Higher Engineering Mathematics by Dr. B.S. Grewal, Khanna
Publishers
Probability and Statistics for Engineers and Scientists by Sheldon
M.Ross, Academic Press
te s
3) Operations Research by S.D. Sarma,
REFERENCE BOOKS:
1. Mathematics for Engineers by K.B.Datta and M.A S.Srinivas,Cengage
d a
p
Publications
2. Probability and Statistics by T.K.V.Iyengar & B.Krishna Gandhi Et
U
3. Fundamentals of Mathematical Statistics by S C Gupta and
V.K.Kapoor
4. Probability and Statistics for Engineers and Scientists by Jay l.Devore.
Outcomes:
i t y
Students would be able to identify distribution in certain realistic
situation. It is mainly useful for circuit as well as non-circuit branches
r
engineering.
e s
of engineering. Also able to differentiate among many random variable
involved in the probability models. It is quite useful for all branches of
v
and large sample) and to make important decisions from few samples
i
which are taken out of unmanageably huge populations .It is Mainly
useful for non-circuit branches of engineering.
n
The students would be able to find the expected queue length, the
ideal time, the traffic intensity and the waiting time. These are very
useful tools in many engineering and data management problems in
U
the industry. It is useful for all branches of engineering.
The student would able to understand about the random process,
Markov process and Markov chains which are essentially models of
many time dependent processes such as signals in communications,
time series analysis, queuing systems. The student would be able to
find the limiting probabilities and the probabilities in nth state. It is
quite useful for all branches of engineering.
•
To explain with examples the basic terminology of functions, relations,
and sets.
To perform the operations associated with sets, functions, and
te s
a
relations.
• To relate practical examples to the appropriate set, function, or relation
•
•
model, and interpret the associated operations and terminology in
context.
p
To describe the importance and limitations of predicate logic.
To relate the ideas of mathematical induction to recursion and
d
•
UNIT-I
recursively defined structures.
To use Graph Theory for solving problems.
y U
t
Mathematical Logic : Statements and notations, Connectives, Well formed
i
formulas, Truth Tables, tautology, equivalence implication, Normal forms,
s
Quantifiers, universal quantifiers. Predicates : Predicative logic, Free & Bound
variables, Rules of inference, Consistency, proof of contradiction, Automatic
Theorem Proving.
UNIT-II
e r
v
Relations: Properties of Binary Relations, equivalence, transitive closure,
compatibility and partial ordering relations, Lattices, Hasse diagram.
U
UNIT-III
Elementary Combinatorics: Basis of counting, Combinations &
Permutations, with repetitions, Constrained repetitions, Binomial Coefficients,
Binomial Multinomial theorems, the principles of Inclusion – Exclusion. Pigeon
hole principles and its application.
UNIT-IV
Recurrence Relation : Generating Functions, Function of Sequences
Calculating Coefficient of generating function, Recurrence relations, Solving
recurrence relation by substitution and Generating funds. Characteristics
te s
2.
Mott, A. Kandel, T.P. Baker, PHI.
REFERENCE BOOKS :
d a
Discrete Mathematics for Computer Scientists & Mathematicians, J.L.
1.
2.
3.
p
Discrete Mathematics and its Applications, Kenneth H. Rosen, Fifth
Edition.TMH.
U
Discrete Mathematical structures Theory and application-Malik & Sen,
Cengage.
Discrete Mathematics with Applications, Thomas Koshy, Elsevier.
4.
Outcomes:
t y
Logic and Discrete Mathematics, Grass Man & Trembley, Pearson
Education.
i
•
• s
Ability to Illustrate by examples the basic terminology of functions,
r
relations, and sets and demonstrate knowledge of their associated
operations.
e
Ability to Demonstrate in practical applications the use of basic
v
counting principles of permutations, combinations, inclusion/exclusion
i
principle and the pigeonhole methodology.
• Ability to represent and Apply Graph theory in solving computer
U n science problems.
To understand the basic concepts such as Abstract Data Types, Linear
and Non Linear Data structures.
To understand the notations used to analyze the Performance of
te s
a
algorithms.
To understand the behavior of data structures such as stacks, queues,
trees, hash tables, search trees, Graphs and their representations.
p
To choose the appropriate data structure for a specified application.
To understand and analyze various searching and sorting algorithms.
d
U
To write programs in C to solve problems using data structures such
as arrays, linked lists, stacks, queues, trees, graphs, hash tables,
search trees.
UNIT- I
t y
Basic concepts- Algorithm Specification-Introduction, Recursive algorithms,
i
Data Abstraction Performance analysis- time complexity and space
s
complexity, Asymptotic Notation-Big O, Omega and Theta notations,
Introduction to Linear and Non Linear data structures.
e r
Singly Linked Lists-Operations-Insertion, Deletion, Concatenating singly
linked lists, Circularly linked lists-Operations for Circularly linked lists, Doubly
Linked Lists- Operations- Insertion, Deletion.
te s
UNIT- V
d
Search Trees-Binary Search Trees, Definition, Operations- Searching,
a
Insertion and Deletion, AVL Trees-Definition and Examples, Insertion into
p
an AVL Tree ,B-Trees, Definition, B-Tree of order m, operations-Insertion
and Searching, Introduction to Red-Black and Splay Trees(Elementary
treatment-only Definitions and Examples), Comparison of Search Trees.
(examples only).
TEXT BOOKS:
y U
Pattern matching algorithm- The Knuth-Morris-Pratt algorithm, Tries
1.
2.
t
Fundamentals of Data structures in C, 2nd Edition, E.Horowitz,
i
S.Sahni and Susan Anderson-Freed, Universities Press.
s
Data structures A Programming Approach with C, D.S.Kushwaha and
r
A.K.Misra, PHI.
REFERENCE BOOKS:
i v
1.
2.
e
Data structures: A Pseudocode Approach with C, 2nd edition,
R.F.Gilberg And B.A.Forouzan, Cengage Learning.
Data structures and Algorithm Analysis in C, 2nd edition, M.A.Weiss,
Pearson.
U n 3.
4.
5.
Data Structures using
M.J.Augenstein, Pearson.
C, A.M.Tanenbaum,Y. Langsam,
s
problems in respective language.
Ability to solve problems independently and think critically.
a te
p d
y U
s i t
e r
n i v
U
To understand the basic theoretical concepts of digital systems like
the binary system and Boolean algebra.
To express real life problem in logic design terminology.
te s
o use Boolean algebraic formulations to design digital systems.
To design using combinational/sequential circuits
To understand the Instruction execution stages.
d a
UNIT- I
components.
U p
To explain the functions of the various computer hardware
i y
multiprocessors and multi computers, Computer Generations.
t
Data Representation: Binary Numbers, Fixed Point Representation. Floating
– Point Representation. Number base conversions, Octal and Hexadecimal
s
Numbers, complements, Signed binary numbers, Binary codes.
r
UNIT- II
Digital Logic Circuits-I: Basic Logic Functions, Logic gates, universal logic
i v e
gates, Minimization of Logic expressions. Flip-flops, Combinational Circuits.
Digital Logic Circuits -II: Registers, Shift Registers, Binary counters,
Decoders, Multiplexers, Programmable Logic Devices.
UNIT- III
U n Computer Arithmetic: Algorithms for fixed point and floating point addition,
subtraction, multiplication and division operations. Hardware Implementation
of arithmetic and logic operations, High performance arithmetic.
Instruction Set & Addressing: Memory Locations and Addresses,
Machine addresses and sequencing, Various Addressing Modes, Instruction
Formats, Basic Machine Instructions. IA-32 Pentium example.
UNIT- IV
Processor Organization: Introduction to CPU, Register Transfers,
Execution of Instructions, Multiple Bus Organization, Hardwired Control,
Microprogrammed Control
Memory Organization: Concept of Memory, RAM, ROM memories, memory
te s
2.
3.
Computer Architecture and Organization- An Integrated Approach,
Miles Murdocca, Vincent Heuring, Second Edition, Wiley India.
Computer Systems Architecture – M.Moris Mano, IIIrd Edition,
d a
p
Pearson.
REFERENCE BOOKS:
U
1. Computer Organization and Architecture – W illiam Stallings Sixth
Edition, Pearson
2. Computer- organization and Design- David A. Paterson and John
3.
L.Hennessy-Elsevier.
i t y
Fundamentals or Computer Organization and Design, - Sivarama
Dandamudi Springer Int. Edition.
4.
5.
Outcomes:
PHI.
s
Digital Design – Third Edition, M.Morris Mano, Pearson Education/
r
Fundamentals of Logic Design, Roth, 5th Edition, Thomson.
e
n i v
Student could able to design, understand the number systems,
combinational sequential circuits. And they should be in a position to
continue with computer organization.
Students understand in a better way the I/O and memory organization
in depth. They should be in a position to write assembly language
U
programs for various applications.
te s
a
To familiarize the student with the principle of operation, analysis and
design of Junction diode, BJT and FET amplifier circuits, transistors
d
and field effect transistors.
To understand diode as rectifier.
UNIT -I
U p
To study basic principle of filter circuits and various types.
y
dependence of VI characteristic, Ideal versus Practical – Resistance levels
t
(Static and Dynamic), Transition and Diffusion Capacitances, Diode
i
Equivalent Circuits, Load Line Analysis, Breakdown Mechanisms in
s
Semiconductor Diodes, Zener Diode Characteristics.
r
Special Purpose Electronic Devices: Principle of Operation and
Characteristics of Tunnel Diode (with the help of Energy Band Diagram),
i v
UNIT -II
e
Varactor Diode, SCR and Semiconductor Photo Diode.
Rectifiers and Filters : The P-N junction as a Rectifier, Half wave Rectifier,
n
Full wave Rectifier, Bridge Rectifier, Harmonic components in a Rectifier
Circuit, Inductor Filters, Capacitor Filters, L- Section Filters, p- Section
Filters, Comparision of Filters, Voltage Regulation using Zener Diode.
U UNIT -III
Bipolar Junction Transistor and UJT: The Junction Transistor, Transistor
Current Components, Transistor as an Amplifier, Transistor Construction,
BJT Operation, BJT Symbol, Common Base, Common Emitter and Common
Collector Configurations, Limits of Operation , BJT Specifications, BJT Hybrid
Model, Determination of h-parameters from Transistor Characteristics,
Comparison of CB, CE, and CC Amplifier Configurations, UJT and
Characteristics.
UNIT -IV
Transistor Biasing and Stabilization: Operating Point, The DC and AC
Load lines, Need for Biasing, Fixed Bias, Collector Feedback Bias, Emitter
Feedback Bias, Collector - Emitter Feedback Bias, Voltage Divider Bias,
s
Bias Stability, Stabilization Factors, Stabilization against variations in VBE
and ß, Bias Compensation using Diodes and Transistors, Thermal Runaway,
te
Thermal Stability, Analysis of a Transistor Amplifier Circuit using h-
Parameters.
a
UNIT -V
Field Effect Transistor and FET Amplifiers
p
U
and Depletion modes.
FET Amplifiers:
y
FET Common Source Amplifier, Common Drain Amplifier, Generalized FET
t
Amplifier, Biasing FET, FET as Voltage Variable Resistor, Comparison of
BJT and FET.
i
TEXT BOOKS:
1.
2.
r s
Millman's Electronic Devices and Circuits – J. Millman, C.C.Halkias,
e
and Satyabrata Jit, 2 Ed.,1998, TMH.
Electronic Devices and Circuits – Mohammad Rashid, Cengage
n i v3.
Learing, 2013
Electronic Devices and Circuits – David A. Bell, 5 Ed, Oxford.
REFERENCE BOOKS:
1. Integrated Electronics – J. Millman and Christos C. Halkias, 1991
U
Ed., 2008, TMH.
2. Electronic Devices and Circuits – R.L. Boylestad and Louis Nashelsky,
9 Ed., 2006, PEI/PHI.
3. Electronic Devices and Circuits – B. P. Singh, Rekha Singh, Pearson,
2 Ed, 2013.
4. Electronic Devices and Circuits --K. Lal Kishore, 2 Ed., 2005, BSP.
5. Electronic Devices and Circuits – Anil K. Maini, Varsha Agarwal, 1
Ed., 2009, Wiley India Pvt. Ltd.
s
its characteristics.
te
Design and analyse the DC bias circuitry of BJT and FET.
Design biasing circuits using diodes and transistors.
a
To analyze and design diode application circuits, amplifier circuits
and oscillators employing BJT, FET devices.
p d
y U
s i t
e r
n i v
U
te s
a
knowledge about measuring instruments operation in detail.
UNIT – I
Introduction to Electrical Engineering: Ohm's law, basic circuit
components, Kirchhoff's laws. Simple problems.
p
Network Analysis: Basic definitions, types of elements, types of sources,
resistive networks, inductive networks, capacitive networks, and series d
U
parallel circuits, star delta and delta star transformation. , Network theorems-
Superposition, Thevenins's, Maximum power transfer theorems and simple
problems.
UNIT-II
i t y
Alternating Quantities: Principle of ac voltages, waveforms and basic
definitions, root mean square and average values of alternating currents
s
and voltage, form factor and peak factor, phasor representation of alternating
r
quantities, the J operator and phasor algebra, analysis of ac circuits with
single basic network element, single phase series circuits.
UNIT-III
e
v
Transformers : Principles of operation, Constructional Details, Ideal
i
Transformer and Practical Transformer, Losses, Transformer Test, Efficiency
and Regulation Calculations (All the above topics are only elementary
n
treatment and simple problems).
UNIT-IV
U
D.C. and A.C. Machines:
D.C generators: Principle of operation of dc machines, types of D.C
generators, EMF equation in D.C generator.
D.C motors: Principle of operation of dc motors, types of D.C motors, losses
and torque equation, losses and efficiency calculation in D.C generator. A.C
Machines: Three phase induction motor, principle of operation, slip and rotor
frequency, torque (simple problems).
UNIT V
Basic Instruments: Introduction, classification of instruments, operating
2.
Publications.
Basic Electrical Engineering, S.N. Singh, PHI.
REFERENCE BOOKS:
te s
a
1. Basic Electrical Engineering, Abhijit Chakrabarthi, Sudipta nath,
Chandrakumar Chanda, Tata-McGraw-Hill.
d
2. Principles of Electrical Engineering, V.K Mehta, Rohit Mehta, S.Chand
Publications.
3.
4.
5. p
Basic Electrical Engineering, T.K.Nagasarkar and M.S. Sukhija, Oxford
University Press.
U
Fundamentals of Electrical Engineering, RajendraPrasad, PHI.
Basic Electrical Engineering by D.P.Kothari , I.J. Nagrath, McGraw-
Hill.
Outcomes:
i t y
After going through this course the student gets a thorough knowledge on
basic electrical circuits, parameters, and operation of the transformers in
r s
the energy conversion process, electromechanical energy conversion,
construction operation characteristics of DC and AC machines and the
constructional features and operation of operation measuring instruments
e
like voltmeter, ammeter, wattmeter etc...With which he/she can able to apply
the above conceptual things to real-world electrical and electronics problems
n i vand applications.
te s
4.
5.
6.
Magnetization characteristics of D.C. Shunt generator.
Swinburne's Test on DC shunt machine.
Brake test on DC shunt motor.
d a
7.
8.
OC and SC tests on Single-phase transformer.
Brake test on 3-phase Induction motor.
PART - B
1.
U p
PN Junction Diode Characteristics (Forward bias, Reverse bias).
2.
3.
4.
y
Zener Diode Characteristics.
t
Transistor CE Characteristics (Input and Output).
i
Rectifier without Filters (Full wave & Half wave).
5.
s
Rectifier with Filters (Full wave & Half wave).
e r
n i v
U
te s
a
To write and execute write programs in C to implement various sorting
and searching methods.
Recommended Systems/Software Requirements:
p
Intel based desktop PC with minimum of 166 MHZ or faster processor
with at least 64 MB RAM and 100 MB free disk space.
C compiler.
d
Week1:
U
Write a C program that uses functions to perform the following:
y
a) Create a singly linked list of integers.
Week2:
i t
b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion.
s
e r
Write a C program that uses functions to perform the following:
a) Create a doubly linked list of integers.
v
b) Delete a given integer from the above doubly linked list.
i
c) Display the contents of the above list after deletion.
Week3:
Week 6 :
Write a C program that uses functions to perform the following:
a) Create a binary search tree of integers.
b) Traverse the above Binary search tree non recursively in inorder.
s
Week 7:
te
Write C programs for implementing the following sorting methods to arrange
a list of integers in Ascending order :
a) Insertion sort b) Merge sort
Week 8 :
a
Write C programs for implementing the following sorting methods to arrange
a list of integers in ascending order:
d
p
a) Quick sort b) Selection sort
Week 9:
U
i) Write a C program to perform the following operation:
a)Insertion into a B-tree.
ii) Write a C program for implementing Heap sort algorithm for sorting a
Week 10:
i y
given list of integers in ascending order.
t
Write a C program to implement all the functions of a dictionary (ADT) using
hashing.
Week 11:
e r s
Write a C program for implementing Knuth-Morris- Pratt pattern matching
algorithm.
n i vWeek 12:
Write C programs for implementing the following graph traversal algorithms:
a)Depth first traversal
TEXT BOOKS:
b)Breadth first traversal
U
1. C and Data Structures, Third Edition, P.Padmanabham, BS
Publications.
2. C and Data Structures, Prof. P.S.Deshpande and Prof. O.G. Kakde,
Dreamtech Press.
3. Data structures using C, A.K.Sharma, 2nd edition, Pearson.
4. Data Structures using C, R.Thareja, Oxford University Press.
5. C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand.
6. C Programming and Data Structures, P.Radha Krishna, Hi-Tech
Publishers.
Outcomes:
Ability to identify the appropriate data structure for given problem.
Graduate able to design and analyze the time and space complexity
of algorithm or program.
s
Ability to effectively use compilers includes library functions,
debuggers and trouble shooting.
a te
p d
y U
s i t
e r
n i v
U
te s
•
UNIT- I
To introduce the power of scripting languages
d a
p
languages, Programming domains, Language Evaluation Criteria, influences
on Language design, Language categories, Programming Paradigms –
Imperative, Object Oriented, functional Programming , Logic Programming.
U
Programming Language Implementation – Compilation and Virtual Machines,
programming environments. Syntax and Semantics: general Problem of
y
describing Syntax and Semantics, formal methods of describing syntax -
t
BNF, EBNF for common programming languages features, parse trees,
i
ambiguous grammars, attribute grammars, denotational semantics and
axiomatic semantics for common programming language features.
UNIT- II
r s
Data types: Introduction, primitive, character, user defined, array, associative,
record, union, pointer and reference types, design and implementation uses
e
related to these types. Names, Variable, concept of binding, type checking,
v
strong typing, type compatibility, named constants, variable initialization.
i
Expressions and Statements: Arithmetic relational and Boolean expressions,
Short circuit evaluation mixed mode assignment, Assignment Statements,
n
Control Structures – Statement Level, Compound Statements, Selection,
Iteration, Unconditional Statements, guarded commands.
UNIT-III
te s
a
Functional Programming Languages: Introduction, fundamentals of FPL,
LISP, ML, Haskell, application of Functional Programming Languages and
d
comparison of functional and imperative Languages.
Scripting Language: Pragmatics, Key Concepts, Case Study : Python –
p
Values and Types, Variables , Storage and Control, Bindings and Scope,
Procedural Abstraction, Data Abstraction, Separate Compilation, Module
Library.
TEXT BOOKS:
1.
U
Concepts of Programming Languages Robert .W. Sebesta 8/e,
Pearson Education,2008.
y
2.
dreamtech,rp-2007.
REFERENCE BOOKS:
s i t
Programming Language Design Concepts, D. A. W att, W iley
r
1. Programming Languages, 2nd Edition, A.B. Tucker, R.E. Noonan,
TMH.
i v
2.
3.
4.
e
Programming Languages, K. C.Louden, 2nd Edition, Thomson, 2003.
LISP, Patric Henry Winston and Paul Horn, Pearson Education.
Programming in Prolog, W.F. Clocksin,& C.S.Mellish, 5th Edition,
Springer.
U n 5.
6.
7.
Outcomes:
•
Programming Python, M.Lutz, 3rd Edition, O’reilly,SPD, rp-2007.
Core Python Programming, Chun, II Edition, Pearson Education,
2007.
Guide to Programming with Python, Michael Dawson, Thomson, 2008
To understand the basic concepts and the applications of database
systems.
To master the basics of SQL and construct queries using SQL.
te s
To understand the relational database design principles.
d
To become familiar with the basic issues of transaction processing
a
p
To become familiar with database storage structures and access
techniques.
U
UNIT- I
Introduction-Database System Applications, Purpose of Database Systems,
View of Data – Data Abstraction, Instances and Schemas, Data Models,
y
Database Languages – DDL, DML, Database Access from Application
t
Programs, Transaction Management, Data Storage and Querying, Database
i
Architecture, Database Users and Administrators, History of Data base
s
Systems.
Introduction to Data base design, ER diagrams, Beyond ER Design, Entities,
e r
Attributes and Entity sets, Relationships and Relationship sets, Additional
features of ER Model, Conceptual Design with the ER Model, Conceptual
Design for Large enterprises. Relational Model: Introduction to the Relational
v
Model – Integrity Constraints over Relations, Enforcing Integrity constraints,
i
Querying relational data, Logical data base Design, Introduction to Views –
Destroying /altering Tables and Views.
U n UNIT- II
Relational Algebra and Calculus: Relational Algebra – Selection and
Projection, Set operations, Renaming, Joins, Division, Examples of Algebra
Queries, Relational calculus – Tuple relational Calculus – Domain relational
calculus – Expressive Power of Algebra and calculus.
Form of Basic SQL Query – Examples of Basic SQL Queries, Introduction to
Nested Queries, Correlated Nested Queries, Set – Comparison Operators,
Aggregate Operators, NULL values – Comparison using Null values – Logical
connectives – AND, OR and NOT – Impact on SQL Constructs, Outer Joins,
Disallowing NULL values, Complex Integrity Constraints in SQL Triggers
and Active.
UNIT- III
Introduction to Schema Refinement – Problems Caused by redundancy,
Decompositions – Problem related to decomposition, Functional
Dependencies - Reasoning about FDS, Normal Forms – FIRST, SECOND,
THIRD Normal forms – BCNF –Properties of Decompositions- Loss less-
join Decomposition, Dependency preserving Decomposition, Schema
Refinement in Data base Design – Multi valued Dependencies – FOURTH
Normal Form, Join Dependencies, FIFTH Normal form, Inclusion
Dependencies.
te s
a
UNIT- IV
Transaction Management-Transaction Concept- Transaction State-
serializability.
p d
Implementation of Atomicity and Durability – Concurrent – Executions –
Serializability- Recoverability – Implementation of Isolation – Testing for
U
Validation- Based Protocols – Multiple Granularity.
Recovery System-Failure Classification-Storage Structure-Recovery and
Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions
y
– Buffer Management – Failure with loss of nonvolatile storage-Advance
t
Recovery systems- Remote Backup systems.
UNIT- V
i
s
Overview of Storage and Indexing: Data on External Storage, File
r
Organization and Indexing – Clustered Indexes, Primary and Secondary
Indexes, Index data Structures – Hash Based Indexing, Tree based Indexing,
e
Comparison of File Organizations.
v
Tree Structured Indexing: Intuitions for tree Indexes, Indexed Sequential
i
Access Methods (ISAM) B+ Trees: A Dynamic Index Structure, Search,
Insert ,Delete.
n
Hash Based Indexing: Static Hashing, Extendable hashing, Linear Hashing,
Extendible vs. Linear Hashing.
TEXT BOOKS:
U 1.
2.
Data base Management Systems, Raghu Ramakrishnan, Johannes
Gehrke, TMH, 3rd Edition,2003.
Data base System Concepts, A.Silberschatz, H.F. Korth, S.Sudarshan,
McGraw hill, VI edition,2006.
REFERENCE BOOKS:
1. Database Systems, 6 th edition., Ramez Elmasri, Shamkant
B.Navathe, Pearson Education,2013.
2. Database Principles, Programming, and Performance, P.O’Neil,
E.O’Neil, 2nd ed., ELSEVIER
6.
Fundamentals of Relational Database Management Systems,
S.Sumathi, S.Esakkirajan, Springer.
Database Management System Oracle SQL and PL/SQL, P.K.Das
Gupta, PHI.
te s
7.
8.
Introduction to Database Management, M.L.Gillenson and others,
Wiley Student Edition.
Database Development and Management, Lee Chao, Auerbach
d a
p
publications, Taylor & Francis Group.
9. Introduction to Database Systems, C.J.Date, Pearson Education.
U
10. Database Management Systems, G.K.Gupta, TMH.
Outcomes:
Demonstrate the basic elements of a relational database management
system.
i t y
Ability to identify the data models for relevant problems.
Ability to design entity relationship and convert entity relationship
data.
s
diagrams into RDBMS and formulate SQL queries on the respect
r
Apply normalization for the development of application software’s.
e
n i v
U
To understand object oriented programming concepts, and apply them
in problem solving
To learn the basics of java Console and GUI based programming
te s
UNIT- I
OOP concepts – Data abstraction, encapsulation, inheritance, benefits of
inheritance, polymorphism, classes and objects, Procedural and object
d a
oriented programming paradigms
U p
Java programming - History of Java, comments, data types, variables,
constants, scope and life time of variables, operators, operator hierarchy,
expressions, type conversion and casting, enumerated types, control flow -
block scope, conditional statements, loops, break and continue statements,
y
simple java stand alone programs, arrays, console input and output,
t
formatting output, constructors, methods, parameter passing, static fields
i
and methods, access control, this reference, overloading methods and
s
constructors, recursion, garbage collection, building strings, exploring string
r
class.
UNIT- II
i v e
Inheritance - Inheritance hierarchies, super and sub classes, Member access
rules, super keyword, preventing inheritance: final classes and methods,
the Object class and its methods
Polymorphism- dynamic binding, method overriding, abstract classes and
U n methods.
Interfaces – Interfaces vs. Abstract classes, defining an interface,
implementing interfaces, accessing implementations through interface
references, extending interface.
Inner classes – Uses of inner classes, local inner classes, anonymous inner
classes, static inner classes, examples.
Packages - Defining, Creating and Accessing a Package, Understanding
CLASSPATH, importing packages.
UNIT- III
Exception handling – Dealing with errors, benefits of exception handling,
s
Multithreading - Differences between multiple processes and multiple
threads, thread states, creating threads, interrupting threads, thread priorities,
te
synchronizing threads, inter-thread communication, producer consumer
pattern.
UNIT- IV
Collection Framework in Java – Introduction to Java Collections, Overview
of Java Collection frame work, Generics, Commonly used Collection classes–
d a
Array List, Vector, Hashtable, Stack, Enumeration, Iterator, StringTokenizer,
p
Random, Scanner, calendar and Properties.
Files – streams- byte streams, character streams, text Input/output, binary
U
input/output, random access file operations, File management using File
class.
Connecting to Database - JDBC Type 1 to 4 drivers, connecting to a
with JDBC.
UNIT- V
i y
database, querying a database and processing the results, updating data
t
s
GUI Programming with Java - The AWT class hierarchy, Introduction to
r
Swing, Swing vs. AW T, Hierarchy for Swing components, Containers –
e
JFrame, JApplet, JDialog, JPanel, Overview of some swing components-
Jbutton, JLabel, JTextField, JTextArea, simple swing applications, Layout
v
management - Layout manager types – border, grid and flow
U
and applications, life cycle of an applet, passing parameters to applets, applet
security issues.
TEXT BOOK:
1. Java Fundamentals – A comprehensive Introduction, Herbert Schildt
and Dale Skrien, TMH.
REFERENCE BOOKS:
1. Java for Programmers, P.J.Deitel and H.M.Deitel, Pearson education
(OR) Java: How to Program P.J.Deitel and H.M.Deitel, PHI.
s
Press.
Outcomes:
te
Understanding of OOP concepts and basics of java programming
(Console and GUI based)
further on his/her own.
d a
The skills to apply OOP and Java programming in problem solving
Should have the ability to extend his knowledge of Java programming
U p
i t y
e r s
n i v
U
2.
Understanding the importance of ecological balance for sustainable
development.
Understanding the impacts of developmental activities and mitigation
measures.
te s
a
3. Understanding of environmental policies and regulations
UNIT-I :
Ecosystems: Definition, Scope and Importance of ecosystem. Classification,
p
structure and function of an ecosystem, Food chains, food webs and
ecological pyramids. Flow of energy, Biogeochemical cycles,
Bioaccumulation, Biomagnification, ecosystem value, services and carrying d
U
capacity, Field visits.
UNIT-II:
y
Natural Resources: Classification of Resources: Living and Non-Living
t
resources, water resources: use and over utilization of surface and ground
i
water, floods and droughts, Dams: benefits and problems. Mineral
resources: use and exploitation, environmental effects of extracting and
s
using mineral resources, Land resources: Forest resources, Energy
r
resources: growing energy needs, renewable and non renewable energy
sources, use of alternate energy source, case studies.
UNIT-III:
e
v
Biodiversity and Biotic Resources: Introduction, Definition, genetic, species
i
and ecosystem diversity. Value of biodiversity; consumptive use, productive
use, social, ethical, aesthetic and optional values. India as a mega diversity
n
nation, Hot spots of biodiversity. Field visit. Threats to biodiversity: habitat
loss, poaching of wildlife, man-wildlife conflicts; conservation of biodiversity:
In-Situ and Ex-situ conservation. National Biodiversity act.
U UNIT-IV:
Environmental Pollution and Control Technologies: Environmental
Pollution: Classification of pollution, Air Pollution: Primary and secondary
pollutants, Automobile and Industrial pollution, Ambient air quality standards.
Water pollution: Sources and types of pollution, drinking water quality
standards. Soil Pollution: Sources and types, Impacts of modern agriculture,
degradation of soil. Noise Pollution: Sources and Health hazards, standards,
Solid waste: Municipal Solid W aste management, composition and
characteristics of e-W aste and its management. Pollution control
te s
a
Legal aspects Air Act- 1981, Water Act, Forest Act, Wild life Act, Municipal
solid waste management and handling rules, biomedical waste management
p d
and handling rules, hazardous waste management and handling rules. EIA:
EIA structure, methods of baseline data acquisition. Overview on Impacts of
air, water, biological and Socio-economical aspects. Strategies for risk
assessment, Concepts of Environmental Management Plan (EMP). Towards
Sustainable Future: Concept of Sustainable Development, Population and
U
its explosion, Crazy Consumerism, Environmental Education, Urban Sprawl,
Human health, Environmental Ethics, Concept of Green Building, Ecological
y
Foot Print, Life Cycle assessment (LCA), Low carbon life style.
t
SUGGESTED TEXT BOOKS:
1.
2.
i
Textbook of Environmental Studies for Undergraduate Courses by
s
Erach Bharucha for University Grants Commission.
r
Environmental Studies by R. Rajagopalan, Oxford University Press.
REFERENCE BOOKS:
i v
a.
b.
e
Environmental Science: towards a sustainable future by Richard
T.Wright. 2008 PHL Learning Private Ltd. New Delhi.
Environmental Engineering and science by Gilbert M.Masters and
Wendell P. Ela .2008 PHI Learning Pvt. Ltd.
U n c.
d.
e.
Environmental Science by Daniel B.Botkin & Edward A.Keller, Wiley
INDIA edition.
Environmental Studies by Anubha Kaushik, 4 th Edition, New age
international publishers.
Text book of Environmental Science and Technology - Dr. M. Anji
Reddy 2007, BS Publications.
Outcomes:
Based on this course, the Engineering graduate will understand /evaluate /
develop technologies on the basis of ecological principles and environmental
regulations which inturn helps in sustainable development
te s
a
networks i.e., the students can easily understand the concept of
computer networks.
UNIT- I
p
Introduction To Data Communications And Networking: Standards
Organizations for Data Communications, Layered Network Architecture, Open
d
Systems Interconnection, Data Communications Circuits, Serial and parallel
U
Data Transmission, Data communications Circuit Arrangements, Data
communications Networks, Alternate Protocol Suites.
Signals, noise, modulation, and demodulation: Signal Analysis, Electrical
y
Noise and Signal-to-Noise Ratio, Analog Modulation Systems, Information
t
Capacity, Bits, Bit Rate, Baud, and M-ary Encoding, Digital Modulation.
UNIT- II
i
s
Multiplexers: Advantage of multiplexers, Frequency division multiplexing,
r
Time division multiplexing, Statistical Time division multiplexing,
Concentrators, Switching Techniques.
e
Transmission Media: Introduction, Communication Channel- Channel
v
Bands, Channel Services, Channel Standard Interfaces, Open wirelines,
i
Twisted pair wires/cables, Coaxical cables, Optical fiber communication
advantages and disadvantages of optical fiber communication, wireless
n
communication-satellite and cellular radio communication, Typical broadband
LANs.
UNIT-III
UNIT- IV
Cellular Telephone Systems: First- Generation Analog Cellular Telephone,
Personal Communications system, Second-Generation Cellular Telephone
Systems, N-AMPS, Digital Cellular Telephone, Interim Standard, North
American Cellular and PCS Summary, Global system for Mobile
Communications, Personal Communications Satellite System.
Data Communications Codes, Error Control, And Data Formats: Data
Communications Character Codes, Bar Codes, Error Control, Error Detection,
Error Correction, Character Synchronization.
te s
a
UNIT- V
Data Communications Equipment: Digital Service Unit and Channel
Service Unit, Voice- Band Data Communication Modems, Bell Systems-
p
Compatible Voice- Band Modems, Voice- Band Modern Block Diagram,
Voice- Band Modem Classifications, Asynchronous Voice-Band Modems,
Synchronous Voice-Band Modems, Modem Synchronization, ITU-T Voice- d
U
Band Modem Specifications, 56K Modems, Modem Control: The AT
Command Set, Cable Modems, Probability of Error and Bit Error Rate.
TEXT BOOKS:
1.
2.
Pearson Education.
i t y
Introduction to Data Communications and Networking, Wayne Tomasi,
REFERENCE BOOKS:
1.
e r s
singhal , CRC Press
n i v2.
3.
4.
Understanding Data Communications And Networks, 3 rd Edition,
William A Shay, B.S Publications.
Computer Communications and Networking Technologies, Gallow,
Second Edition Thomson.
Computer Networking and Internet, Fred Halsll, Lingana Gouda
U
Kulkarni, Fifth Edition, Pearson Education
Outcomes:
The student will know the functioning of various ways of different
communication systems. He will be in a position to practical
understanding the working mechanism of telephone, satellite and
other communication systems.
Learn to evaluate and compare different algorithms using worst,
average and best case analysis.
Understand the algorithm design methods such as divide and conquer,
te s
a
greedy method, dynamic programming, backtracking, branch and
bound.
Choose an appropriate algorithm design method for a specified
application.
p
Understand the differences between tractable and intractable
problems and identify the basic classes, such as P,NP and NP- d
U
complete.
UNIT- I
y
Introduction: Algorithm, Pseudo code for expressing algorithms, Performance
t
Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh
i
notation, Omega notation, Theta notation and Little oh notation, Probabilistic
analysis, Amortized complexity.
s
Sets and Disjoint set Union –Introduction, Union and find operations and
r
algorithms, Connected Components and Spanning trees, Bi-connected
components.
e
Divide and conquer: General method, applications-Binary search, Quick sort,
v
Merge sort, Strassen’s Matrix Multiplication.
n i UNIT- II
Greedy method: General method, applications-Job sequencing with dead
lines, 0/1 knapsack problem, Minimum cost spanning trees-Prim’s and
Kruskal’s algorithms, Single source shortest path problem.
U
UNIT- III
Dynamic Programming: General method, applications-Multistage
graphs,Optimal binary search trees,0/1 knapsack problem, All pairs shortest
path problem, Traveling sales person problem, Reliability design.
UNIT- IV
Backtracking: General method, applications-8-queens problem, sum of
subsets problem, graph coloring, Hamiltonian cycles.
Branch and Bound: General method, applications - Traveling sales person
problem,0/1 knapsack problem-LC Branch and Bound solution, FIFO Branch
te s
a
2. Design and Analysis of Algorithms, P.H.Dave and H.B.Dave, 2 nd
edition, Pearson Education.
d
3. Algorithm Design: Foundations, Analysis and Internet examples,
M.T.Goodrich and R.Tomassia, John Wiley and sons.
REFERENCE BOOKS:
1.
2.
Jones and Bartlett Learning.
U p
Foundations of Algorithms,4th edition, R.Neapolitan and K.Naimipour,
4.
Education.
i t y
Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson
5.
Outcomes:
r s
Sara Baase, Allen, Van Gelder, Pearson Education.
Introduction to the Design and Analysis of Algorithms, A.Levitin,
Pearson Education.
e
n i v
Ability to analyze algorithms and improve the efficiency of algorithms.
Apply different designing methods for development of algorithms to
realistic problems, such as divide and conquer, greedy and etc.
Ability to understand and estimate the performance of algorithm.
te s
1.
2.
Use Linux and MySQL for the Lab Experiments. Though not
mandatory, encourage the use of Eclipse platform
The list suggests the minimum program set. Hence, the
d a
p
concerned staff is requested to add more problems to the list as
needed
U
1) Use Eclipse or Netbean platform and acquaint with the various menus.
Create a test project, add a test class and run it. See how you can
use auto suggestions, auto fill. Try code formatter and code refactoring
y
like renaming variables, methods and classes. Try debug step by
t
step with a small program of about 10 to 15 lines which contains at
i
least one if else condition and a for loop.
s
2) Write a Java program that works as a simple calculator. Use a grid
layout to arrange buttons for the digits and for the +, -,*, % operations.
r
Add a text field to display the result. Handle any possible exceptions
like divided by zero
i v
3a)
b)
e
Develop an applet in Java that displays a simple message.
Develop an applet in Java that receives an integer in one text field,
and computes its factorial Value and returns it in another text field,
when the button named “Compute” is clicked.
8)
or “Ready” or “Go” should appear above the buttons in selected color.
Initially, there is no message shown.
Write a Java program to create an abstract class named Shape that
contains two integers and an empty method named printArea().
te s
a
Provide three classes named Rectangle, Triangle and Circle such
that each one of the classes extends the class Shape. Each one of
d
the classes contains only the method print Area () that prints the area
of the given shape.
9)
10)
p
Suppose that a table named Table.txt is stored in a text file. The first
line in the file is the header, and the remaining lines correspond to
rows in the table. The elements are separated by commas. Write a
U
java program to display the table using Labels in Grid Layout.
Write a Java program that handles all mouse events and shows the
y
event name at the center of the window when a mouse event is fired
t
(Use Adapter classes).
11)
i
Write a Java program that loads names and phone numbers from a
s
text file where the data is organized as one line per record and each
field in a record are separated by a tab (\t). It takes a name or phone
r
number as input and prints the corresponding other value from the
e
hash table (hint: use hash tables).
12) Implement the above program with database instead of a text file.
n i v13)
14)
Write a Java program that takes tab separated data (one record per
line) from a text file and inserts them into a database.
Write a java program that prints the meta-data of a given table
TEXT BOOK:
1. Java Fundamentals – A comprehensive Introduction, Herbert Schildt
U 2.
and Dale Skrien, TMH.
REFERENCE BOOKS:
1. Java for Programmers, P.J.Deitel and H.M.Deitel, Pearson education
(OR) Java: How to Program P.J.Deitel and H.M.Deitel, PHI.
Object Oriented Programming through Java, P.Radha Krishna,
Universities Press.
3. Thinking in Java, Bruce Eckel, Pearson Education
te s
d a
U p
i t y
e r s
n i v
U
te s
a
the designing, developing and querying a database in the context of example
database “Roadway travels”. Students are expected to use “Mysql” database.
Roadway Travels
p d
“Roadway Travels” is in business since 1997 with several buses connecting
different places in India. Its main office is located in Hyderabad.
The company wants to computerize its operations in the following areas:
Reservations and Ticketing
Cancellations
Reservations & Cancellation:
y U
t
Reservations are directly handled by booking office. Reservations
i
can be made 30 days in advance and tickets issued to passenger. One
s
Passenger/person can book many tickets (to his/her family).
r
Cancellations are also directly handed at the booking office.
In the process of computerization of Roadway Travels you have to design
i v e
and develop a Database which consists the data of Buses, Passengers,
Tickets, and Reservation and cancellation details. You should also develop
query’s using SQL to retrieve the data from the database.
The above process involves many steps like 1. Analyzing the problem and
n
identifying the Entities and Relationships, 2. E-R Model 3. Relational Model
4. Normalization 5. Creating the database 6. Querying. Students are
supposed to work on these steps week wise and finally create a
U
complete “Database System” to Roadway Travels. Examples are given
at every experiment for guidance to students.
Experiment 1: E-R Model
Analyze the problem carefully and come up with the entities in it. Identify
what data has to be persisted in the database. This contains the entities,
attributes etc.
Identify the primary keys for all the entities. Identify the other keys like
candidate keys, partial keys, if any.
Example: Entities:
1. BUS
2. Ticket
3. Passenger
s
Relationships:
te
1. Reservation
2. Cancellation
PRIMARY KEY ATTRIBUTES:
1.
2.
3.
Ticket ID (Ticket Entity)
Passport ID (Passenger Entity)
Bus_NO(Bus Entity)
d a
and Keys to the lab teacher.
Experiment 2: Concept design with E-R Model
U p
Apart from the above mentioned entities you can identify more. The above
mentioned are few.
Note: The student is required to submit a document by writing the Entities
i t y
Relate the entities appropriately. Apply cardinalities for each relationship.
Identify strong entities and weak entities (if any). Indicate the type of
relationships (total / partial). Try to incorporate generalization, aggregation,
s
specialization etc wherever required.
r
Example: E-R diagram for bus
i v e
U n
Note: The student is required to submit a document by drawing the E-R
Diagram to the lab teacher.
Experiment 3: Relational Model
Represent all the entities (Strong, Weak) in tabular fashion. Represent
relationships in a tabular fashion. There are different ways of representing
te s
a
Name Age Sex Address Ticket_id Passport ID
p
Note: The student is required to submit a document by Represent
relationships in a tabular fashion to the lab teacher.
Experiment 4: Normalization d
U
Database normalization is a technique for designing relational database
tables to minimize duplication of information and, in so doing, to safeguard
y
the database against certain types of logical or structural problems, namely
t
data anomalies. For example, when multiple instances of a given piece of
i
information occur in a table, the possibility exists that these instances will
not be kept consistent when the data within the table is updated, leading to
s
a loss of data integrity. A table that is sufficiently normalized is less vulnerable
r
to problems of this kind, because its structure reflects the basic assumptions
for when multiple instances of the same information should be represented
e
by a single instance only.
For the above table in the First normalization we can remove the multi valued
n i vattribute Ticket_id and place it in another table along with the primary key of
passenger.
First Normal Form: The above table can be divided into two tables as
shown below.
Passenger
U Name
Passport ID
Age
Ticket_id
Sex Address Passport ID
You can do the second and third normal forms if required. Any how
Normalized tables are given at the end.
Experiment 5: Installation of Mysql and practicing DDL commands
Installation of MySql. In this week you will learn Creating databases, How to
create tables, altering the database, dropping tables and databases if not
required. You will also try truncate, rename commands etc.
Example for creation of a normalized “Passenger” table.
CREATE TABLE Passenger (
te s
a
Passport_id INTEGER PRIMARY KEY,
Name VARCHAR (50) Not NULL,
Age Integer Not NULL,
Sex Char,
Address VARCHAR (50) Not NULL);
Similarly create all other tables.
p d
Experiment 6: Practicing DML commands
y U
Note: Detailed creation of tables is given at the end.
DML commands are used to for managing data within schema objects. Some
examples:
s i t
SELECT - retrieve data from the a database
INSERT - insert data into a table
e r
UPDATE - updates existing data within a table
DELETE - deletes all records from a table, the space for the records
remain
U
Insert into Bus values (45,’Tirupathi,’Banglore’);
Insert into Bus values (34,’hyderabd’,’Chennai’);
Inserting values into “Passenger” table:
Insert into Passenger values (1, 45,’ramesh’, 45,’M’,’abc123’);
Insert into Passenger values (2, 78,’geetha’, 36,’F’,’abc124’);
Insert into Passenger values (45, 90,’ram’, 30,’M’,’abc12’);
Insert into Passenger values (67, 89,’ravi’, 50,’M’,’abc14’);
Insert into Passenger values (56, 22,’seetha’, 32,’F’,’abc55’);
s
In this week you are going to practice queries (along with sub queries) using
ANY, ALL, IN, Exists, NOT EXISTS, UNION, INTERSECT, Constraints etc.
te
Practice the following Queries:
1. Display unique PNR_no of all passengers.
2.
3.
4.
Display all the names of male passengers.
Display the ticket numbers and names of all the passengers.
d a
Find the ticket numbers of the passengers whose name start with ‘r’
p
and ends with ‘h’.
5. Find the names of passengers whose age is between 30 and 45.
U
6. Display all the passengers names beginning with ‘A’
7. Display the sorted list of passengers names
Experiment 8 and Experiment 9: Querying (continued…)
i t y
You are going to practice queries using Aggregate functions (COUNT, SUM,
AVG, and MAX and MIN), GROUP BY, HAVING and Creation and dropping
of Views.
1.
2.
s
Write a Query to display the Information present in the Passenger
r
and cancellation tables. Hint: Use UNION Operator.
Display the number of days in a week on which the 9W 01 bus is
e
available.
v
3. Find number of tickets booked for each PNR_no using GROUP BY
i
CLAUSE. Hint: Use GROUP BY on PNR_No.
4. Find the distinct PNR numbers that are present.
U n 5.
6.
Find the number of tickets booked by a passenger where the number
of seats is greater than 1. Hint: Use
HAVING CLAUSES.
Find the total number of cancelled seats.
Experiment 10: Triggers
GROUP BY, W HERE and
In this week you are going to work on Triggers. Creation of insert trigger,
delete trigger, update trigger. Practice triggers using the above database.
Eg: CREATE TRIGGER updcheck BEFORE UPDATE ON passenger
FOR EACH ROW
BEGIN
IF NEW.TickentNO > 60 THEN
s
END;
te
Experiment 11: Procedures
In this session you are going to learn Creation of stored procedure, Execution
of procedure and modification of procedure. Practice procedures using the
a
above database.
Eg:CREATE PROCEDURE myProc()
BEGIN
SELECT COUNT(Tickets) FROM Ticket WHERE age>=40;
End;
p d
U
Experiment 12: Cursors
In this week you need to do the following: Declare a cursor that defines a
result set.
y
Open the cursor to establish the result set. Fetch the data into local variables
t
as needed from the cursor, one row at a time. Close the cursor when done
i
CREATE PROCEDURE myProc(in_customer_id INT)
BEGIN
DECLARE v_id INT;
e r s
DECLARE v_name VARCHAR(30);
DECLARE c1 CURSOR FOR SELECT stdId,stdFirstname FROM
U
END;
Tables
BUS
Bus No: Varchar: PK (public key)
Source : Varchar
Destination : Varchar
Passenger
PPNO: Varchar(15)) : PK
Name: Varchar(15)
s
PPNO: Varchar(15)) : PK
te
Ticket_No: Numeric (9)
Reservation
PNR_No: Numeric(9) : FK
Journey_date : datetime(8)
No_of_seats : int (8)
Address : Varchar (50)
d a
Status: Char (2) : Yes / No
Cancellation
U p
Contact_No: Numeric (9) —> Should not be less than 9 and Should not
accept any other character other than Integer
y
PNR_No: Numeric(9) : FK
t
Journey_date : datetime(8)
No_of_seats : int (8)
Address : Varchar (50)
r s i
Contact_No: Numeric (9) —> Should not be less than 9 and Should not
accept any other character other than Integer
i v
Ticket
e
Status: Char (2) : Yes / No
Tech.
5. Oracle Database 11g PL/SQL Programming, M.Mc Laughlin, TMH.
6. SQL Fundamentals, J.J.Patrick, Pearson Education.
Outcomes:
s
Ability to design and implement a database schema for given problem.
te
Be capable to Design and build a GUI application.
Apply the normalization techniques for development of application
software to realistic problems.
Ability to formulate queries using SQL DML/DDL/DCL commands
d a
U p
i t y
e r s
n i v
U
te s
a
converts it into a machine understandable format. The push down automata
is the major one it’s a five tuple set containing states, alphabets, transition
d
function and accept states
UNIT-I
U p
Formal Language and Regular Expressions: Languages, Definition
Languages regular expressions, Finite Automata – DFA, NFA. Conversion
of regular expression to NFA, NFA to DFA. Applications of Finite Automata
UNIT-II
i y
parse trees, ambiguity LL(K) grammars and LL(1) parsing
t
Bottom up parsing handle pruning LR Grammar Parsing, LALR parsing,
s
parsing ambiguous grammars, YACC programming specification.
r
Semantics : Syntax directed translation, S-attributed and L-attributed
grammars, Intermediate code – abstract syntax tree, translation of simple
e
statements and control flow statements.
v
UNIT-III
U
Run time storage: Storage organization, storage allocation strategies scope
access to now local names, parameters, language facilities for dynamics
storage allocation.
Code optimization: Principal sources of optimization, optimization of basic
blocks, peephole optimization, flow graphs, Data flow analysis of flow graphs.
UNIT-V
Code generation: Machine dependent code generation, object code forms,
generic code generation algorithm, Register allocation and assignment. Using
DAG representation of Block.
TEXT BOOKS:
1. Introduction to Theory of computation. Sipser, 2nd Edition, Thomson.
2. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethi,
Pearson Education.
s
REFERENCES:
1. Modern Compiler Construction in C , Andrew W.Appel Cambridge
te
University Press.
2. Compiler Construction, LOUDEN, Cengage Learning.
a
3. Elements of Compiler Design, A.Meduna, Auerbach Publications,
Taylor and Francis Group.
4.
5.
6.
Principles of Compiler Design, V.Raghavan, TMH.
p
Engineering a Compiler, K.D.Cooper, L.Torczon, ELSEVIER.
Introduction to Formal Languages and Automata Theory and
Computation – Kamala Krithivasan and Rama R, Pearson. d
7.
8.
U
Modern Compiler Design, D.Grune and others,Wiley-India.
A Text book on Automata Theory, S.F.B.Nasir, P.K.Srimani, Cambridge
Univ. Press.
y
9.
Outcomes:
o
s t
Automata and Languages, A.Meduna, Springer.
i
Graduate should be able to understand the concept of abstract
r
machines and their power to recognize the languages.
o Attains the knowledge of language classes & grammars relationship
i v
o
o e
among them with the help of Chomsky hierarchy.
Ability to understand the design of a compiler given features of the
languages.
Ability to implement practical aspects of automata theory.
To understand and make effective use of Linux utilities and Shell
scripting language (bash) to solve Problems.
To implement in C some standard Linux utilities such as ls, mv, cp
te s
a
etc. using system calls.
To develop the skills necessary for systems programming including
file system programming, process and signal management, and
interprocess communication.
p
To develop the basic skills required to write network programs using
Sockets. d
UNIT- I
U
Linux Utilities-File handling utilities, Security by file permissions, Process
y
utilities, Disk utilities, Networking commands, Filters, Text processing utilities
t
and Backup utilities.
i
Sed-Scripts, Operation, Addresses, Commands, , awk-Execution, Fields and
s
Records,
Scripts, Operation, Patterns, Actions, Associative Arrays, String and
e r
Mathematical functions, System commands in awk, Applications.
Shell programming with Bourne again shell(bash)- Introduction, shell
responsibilities, pipes and Redirection, here documents, running a shell
n i vscript, the shell as a programming language, shell meta characters, file name
substitution, shell variables, command substitution, shell commands, the
environment, quoting, test command, control structures, arithmetic in shell,
shell script examples, interrupt processing, functions, debugging shell scripts.
UNIT-II
U
Files and Directories- File Concept, File types, File System Structure, file
metadata-Inodes, kernel support for files, system calls for file I/O operations-
open, create, read, write, close, lseek, dup2,file status information-stat family,
file and record locking- fcntl function, file permissions - chmod, fchmod, file
ownership-chown, lchown, fchown, links-soft links and hard links – symlink,
link, unlink.
Directories-Creating, removing and changing Directories-mkdir, rmdir, chdir,
obtaining current working directory-getcwd, Directory contents, Scanning
Directories-opendir, readdir, closedir, rewinddir functions.
UNIT- III
Process – Process concept, Layout of a C program image in main memory,
Process environment-environment list, environment variables, getenv, setenv,
Kernel support for process, process identification, process control - process
creation, replacing a process image, waiting for a process, process
termination, zombie process, orphan process, system call interface for
process management-fork, vfork, exit, wait, waitpid, exec family, Process
Groups, Sessions and Controlling Terminal, Differences between threads
and processes.
te s
a
Signals – Introduction to signals, Signal generation and handling, Kernel
support for signals, Signal function, unreliable signals, reliable signals, kill,
d
raise , alarm, pause, abort, sleep functions.
UNIT IV
U p
Interprocess Communication - Introduction to IPC, IPC between processes
on a single computer system, IPC between processes on different systems,
pipes-creation, IPC between related processes using unnamed pipes, FIFOs-
creation, IPC between unrelated processes using FIFOs(Named pipes),
differences between unnamed and named pipes, popen and pclose library
y
functions.
client/server example.
s t
Message Queues- Kernel support for messages, APIs for message queues,
i
Semaphores-Kernel support for semaphores, APIs for semaphores, file
r
locking with semaphores.
UNIT- V
i v e
Shared Memory- Kernel support for shared memory, APIs for shared memory,
shared memory example.
Sockets- Introduction to Berkeley Sockets, IPC over a network, Client-Server
model, Socket address structures (Unix domain and Internet domain),Socket
n
system calls for connection oriented protocol and connectionless protocol,
example-client/server programs-Single Server-Client connection, Multiple
simultaneous clients, Socket options-setsockopt and fcntl system calls,
2. Unix for programmers and users, 3rd Edition, Graham Glass, King
Ables, Pearson.
3. System Programming with C and Unix, A.Hoover, Pearson.
4. Unix System Programming, Communication, Concurrency and
Threads, K.A.Robbins and S.Robbins, Pearson Education.
5.
6.
Unix shell Programming, S.G.Kochan and P.Wood, 3 rd edition,
Pearson Education.
Shell Scripting, S.Parker, Wiley India Pvt. Ltd.
te s
a
7. Advanced Programming in the Unix Environment, 2 nd edition,
W.R.Stevens and S.A.Rago, Pearson Education.
d
8. Unix and Shell programming, B.A.Forouzan and R.F.Gilberg, Cengage
Learning.
9.
10.
p
Linux System Programming, Robert Love, O’Reilly, SPD.
C Programming Language, Kernighan and Ritchie,PHI
Outcomes:
Work confidently in Linux environment.
U
y
W ork with shell script to automate different tasks as Linux
t
administration.
r s i
i v e
U n
To understanding of software process models such as waterfall and
evolutionary models.
To understanding of software requirements and SRS document.
te s
To understanding of different software architectural styles.
d
To understanding of software testing approaches such as unit testing
a
p
To understanding on quality control and how to ensure good quality
software.
U
UNIT- I
Introduction to Software Engineering: The evolving role of software, Changing
Nature of Software, legacy software, Software myths.
y
A Generic view of process: Software engineering- A layered technology, a
t
process framework, The Capability Maturity Model Integration (CMMI),
i
Process patterns, process assessment, personal and team process models.
s
Process models: The waterfall model, Incremental process models,
r
Evolutionary process models, Specialized process models, The Unified
process.
i v
UNIT- II
e
Software Requirements: Functional and non-functional requirements, User
requirements, System requirements, Interface specification, the software
requirements document.
n
Requirements engineering process: Feasibility studies, Requirements
elicitation and analysis, Requirements validation, Requirements
management.
te s
a
Product metrics: Software Quality, Frame work for Product metrics, Metrics
for Analysis Model, Metrics for Design Model, Metrics for source code, Metrics
for testing, Metrics for maintenance.
d
p
Metrics for Process and Products: Software Measurement, Metrics for
software quality.
UNIT- V
U
Risk management: Reactive vs Proactive Risk strategies, software risks,
Risk identification, Risk projection, Risk refinement, RMMM, RMMM Plan.
y
Quality Management: Quality concepts, Software quality assurance, Software
t
Reviews, Formal technical reviews, Statistical Software quality Assurance,
i
Software reliability, The ISO 9000 quality standards.
s
TEXT BOOKS:
r
1. Software Engineering, A practitioner’s Approach, Roger S Pressman,
sixth edition. McGrawHill International Edition.
i v
2.
e
Software Engineering, Ian Sommerville, seventh edition, Pearson
education.
REFERENCE BOOKS:
U n 1.
2.
3.
4.
Software Engineering, A Precise Approach, Pankaj Jalote,W iley
India,2010.
Software Engineering : A Primer, Waman S Jawadekar, Tata McGraw-
Hill, 2008
Fundamentals of Software Engineering, Rajib Mall, PHI, 2005
Software Engineering, Principles and Practices, Deepak Jain, Oxford
University Press.
5. Software Engineering1: Abstraction and modeling, Diner Bjorner,
Springer International edition, 2006.
6. Software Engineering2: Specification of systems and languages,
Diner Bjorner, Springer International edition , 2006.
10.
Design, D.Bjorner, Springer International Edition.
Introduction to Software Engineering, R.J.Leach, CRC Press.
Outcomes:
te s
a
Ability to identify the minimum requirements for the development of
application.
d
Ability to develop, maintain, efficient, reliable and cost effective
software solutions
U p
Ability to critically thinking and evaluate assumptions and arguments.
i t y
e r s
n i v
U
te s
To understand the different memory management techniques
To understand process concurrency and synchronization
To understand the concepts of input/output, storage and file
d a
UNIT- I
management
U p
To study different OS and compare their features
y
Computer System Architecture, OS Structure, OS Operations, Evolution of
t
Operating Systems - Simple Batch, Multi programmed, time-shared, Personal
i
Computer, Parallel, Distributed Systems, Real-Time Systems, Special -
Purpose Systems, Operating System services, User OS Interface, System
s
Calls, Types of System Calls, System Programs, Operating System Design
r
and Implementation, OS Structure, Virtual Machines.
UNIT- II
i v e
Process and CPU Scheduling - Process concepts-The Process, Process
State, Process Control Block, Threads, Process Scheduling-Scheduling
Queues, Schedulers, Context Switch, Pre-emptive Scheduling, Dispatcher,
Scheduling Criteria, Scheduling algorithms, Multiple-Processor Scheduling,
n
Real-Time Scheduling, Thread scheduling, Case studies: Linux, Windows.
Process Coordination – Process Synchronization, The Critical Section
Problem, Peterson’s solution, Synchronization Hardware, Semaphores, and
UNIT- III
Memory Management and Virtual Memory - Logical & Physical Address
Space, Swapping, Contiguous Allocation, Paging, Structure of Page Table,
Segmentation, Segmentation with Paging, Virtual Memory, Demand Paging,
Performance of Demanding Paging, Page Replacement Page Replacement
Algorithms, Allocation of Frames, Thrashing.
UNIT- IV
File System Interface - The Concept of a File, Access methods, Directory
Structure, File System Mounting, File Sharing, Protection, File System
Implementation - File System Structure, File System Implementation,
Allocation methods, Free-space Management, Directory Implementation,
Efficiency and Performance.
Mass Storage Structure – Overview of Mass Storage Structure, Disk
Structure, Disk Attachment, Disk Scheduling, Disk Management, Swap space
Management
te s
a
UNIT- V
Deadlocks - System Model, Deadlock Characterization, Methods for Handling
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection
and Recovery from Deadlock.
p d
Protection – System Protection, Goals of Protection, Principles of Protection,
Domain of Protection, Access Matrix, Implementation of Access Matrix,
U
Access Control, Revocation of Access Rights, Capability-Based Systems,
Language-Based Protection.
y
TEXT BOOKS:
t
1. Operating System Principles , Abraham Silberchatz, Peter B. Galvin,
i
Greg Gagne, 8th Edition, Wiley Student Edition
s
2. Operating Systems – Internals and Design Principles, W. Stallings,
6th Edition, Pearson.
1.
2.
r
REFERENCE BOOKS:
e
Modern Operating Systems, Andrew S Tanenbaum, 3rd Edition, PHI
Operating Systems A concept-based Approach, 2nd Edition,
n i v3.
4.
D.M.Dhamdhere, TMH.
Principles of Operating Systems , B.L.Stuart, Cengage learning, India
Edition.
Operating Systems, A.S.Godbole,2nd Edition, TMH
U
5. An Introduction to Operating Systems, P.C.P. Bhatt, PHI.
6. Operating Systems, S.Haldar and A.A.Aravind, Pearson Education.
7. Operating Systems, R.Elmasri, A,G.Carrick and D.Levine, Mc Graw
Hill.
8. Operating Systems in depth,T.W. Doeppner,Wiley.
Outcomes:
Apply different techniques for the improvement of system
performance.
te s
d a
U p
i t y
e r s
n i v
U
te s
UNIT-I
To introduce UDP and TCP Models.
d a
Overview of the Internet: Protocol, Layering Scenario, TCP/IP Protocol Suite:
U p
The OSI Model, Internet history standards and administration; Comparison
of the OSI and TCP/IP reference model.
Physical Layer: Guided transmission media, wireless transmission media.
Data Link Layer – design issues, CRC Codes, Elementary Data link Layer
protocols, sliding window protocol
UNIT-II
i t y
Multiple Access Protocols –ALOHA, CSMA, Collision free protocols,
Ethernet- Physical Layer, Ethernet Mac Sub layer, data link layer switching
s
& use of bridges, learning bridges, spanning tree bridges, repeaters , hubs,
r
bridges , switches, routers and gateways.
UNIT-III
e
Network Layer: Network Layer Design issues, store and forward packet
v
switching connection less and connection oriented networks-routing
i
algorithms-optimality principle, shortest path, flooding, Distance Vector
Routing, Count to Infinity Problem, Hierarchical Routing, Congestion control
n
algorithms, admission control.
UNIT-IV
U
Internetworking: Tunneling, Internetwork Routing, Packet fragmentation, IPv4,
Ipv6 Protocol, IP addresses, CIDR, IMCP, ARP, RARP, DHCP.
Transport Layer: Services provided to the upper layers elements of transport
protocol-addressing connection establishment, connection release,
Connection Release, Crash Recovery.
UNIT-V
The Internet Transport Protocols UDP-RPC, Real Time Transport Protocols,
The Internet Transport Protocols- Introduction to TCP, The TCP Service
Model, The TCP Segment Header, The Connection Establishment, The TCP
Connection Release, The TCP Connection Management Modeling, The TCP
2.
Data Communications and Networking – Behrouz A. Forouzan, Fifth
Edition TMH, 2013.
Computer Networks — Andrew S Tanenbaum, 4th Edition, Pearson
Education.
te s
a
REFERENCE BOOKS:
1. An Engineering Approach to Computer Networks-S.Keshav, 2nd
2.
3.
Edition, Pearson Education.
Cengage Learning.
p d
Understanding communications and Networks, 3rd Edition, W.A.Shay,
U
(John) Wu, J. David Irwin, CRC Press.
4. Computer Networks, L.L.Peterson and B.S.Davie, 4 th edition,
ELSEVIER.
5.
Outcomes:
i t y
Computer Networking: A Top-Down Approach Featuring the Internet,
James F.Kurose,K.W.Ross,3rd Edition, Pearson Education.
s
Students should be understand and explore the basics of Computer
r
Networks and Various Protocols. He/She will be in a position to
understand the World Wide Web concepts.
e
Students will be in a position to administrate a network and flow of
information further he/she can understand easily the concepts of
te s
a
forms of business organisations, capital budgeting and financial accounting
and financial analysis.
Unit I :
p
Introduction & Demand Analysis: Definition, Nature and Scope of
Managerial Economics. Demand Analysis: Demand Determinants, Law of
Demand and its exceptions. Elasticity of Demand: Definition, Types, d
U
Measurement and Significance of Elasticity of Demand. Demand Forecasting,
Factors governing demand forecasting, methods of demand forecasting.
Unit II :
i t y
Production & Cost Analysis: Production Function – Isoquants and Isocosts,
MRTS, Least Cost Combination of Inputs, Cobb-Douglas Production function,
Laws of Returns, Internal and External Economies of Scale. Cost Analysis:
s
Cost concepts. Break-even Analysis (BEA)-Determination of Break-Even
r
Point (simple problems) - Managerial Significance.
Unit III :
i v e
Markets & New Economic Environment: Types of competition and Markets,
Features of Perfect competition, Monopoly and Monopolistic Competition.
Price-Output Determination in case of Perfect Competition and Monopoly.
Pricing: Objectives and Policies of Pricing. Methods of Pricing. Business:
n
Features and evaluation of different forms of Business Organisation: Sole
Proprietorship, Partnership, Joint Stock Company, Public Enterprises and
their types, New Economic Environment: Changing Business Environment
U
in Post-liberalization scenario.
Unit IV :
Capital Budgeting: Capital and its significance, Types of Capital, Estimation
of Fixed and Working capital requirements, Methods and sources of raising
capital - Trading Forecast, Capital Budget, Cash Budget. Capital Budgeting:
features of capital budgeting proposals, Methods of Capital Budgeting:
Payback Method, Accounting Rate of Return (ARR) and Net Present Value
Method (simple problems).
Unit V :
Introduction to Financial Accounting & Financial Analysis: Accounting
concepts and Conventions - Introduction IFRS - Double-Entry Book Keeping,
Journal, Ledger, Trial Balance- Final Accounts (Trading Account, Profit and
Loss Account and Balance Sheet with simple adjustments). Financial
Analysis: Analysis and Interpretation of Liquidity Ratios, Activity Ratios, and
Capital structure Ratios and Profitability ratios. Du Pont Chart.
TEXT BOOK:
1. Varshney & Maheswari: Managerial Economics, Sultan Chand, 2009.
te s
2.
3.
S.A. Siddiqui & A.S. Siddiqui, Managerial Economics and Financial
Analysis, New Age international Publishers, Hyderabad 2013.
M. Kasi Reddy & Saraswathi, Managerial Economics and Financial
d a
p
Analysis, PHI New Delhi, 2012.
REFERENCES:
U
1. Ambrish Gupta, Financial Accounting for Management, Pearson
Education, New Delhi.2012.
2. H. Craig Peterson & W. Cris Lewis, Managerial Economics, Pearson,
3.
4.
2012.
t y
Lipsey & Chrystel, Economics, Oxford University Press, 2012
i
Domnick Salvatore: Managerial Economics in a Global Economy,
s
Thomson, 2012.
r
5. Narayanaswamy: Financial Accounting—A Managerial Perspective,
Pearson, 2012.
i v
6.
7.
8.
e
S.N.Maheswari & S.K. Maheswari, Financial Accounting, Vikas, 2012.
Truet and Truet: Managerial Economics: Analysis, Problems and
Cases, Wiley, 2012.
Dwivedi: Managerial Economics, Vikas, 2012.
U n 9.
10.
11.
12.
Shailaja & Usha : MEFA, University Press, 2012.
Aryasri: Managerial Economics and Financial Analysis, TMH, 2012.
Vijay Kumar & Appa Rao, Managerial Economics & Financial Analysis,
Cengage 2011.
J. V. Prabhakar Rao & P.V. Rao, Managerial Economics & Financial
Analysis, Maruthi Publishers, 2011.
Outcomes:
At the end of the course, the student will
Understanding the market dynamics namely, demand and supply,
demand forecasting , elasticity of demand and supply, pricing methods
and pricing in different market structures.
s
Understand the framework for both manual and computerised
accounting process
te
Know how to analyse and interpret the financial statements through
ratio analysis.
d a
U p
i t y
e r s
n i v
U
te s
List of Programs:
1. Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
d a
2.
3.
4.
Simulate all file allocation strategies
a) Sequential b) Indexed c) Linked
Simulate MVT and MFT
Simulate all File Organization Techniques
U p
y
a) Single level directory b) Two level c) Hierarchical d) DAG
5.
6.
7.
t
Simulate Bankers Algorithm for Dead Lock Avoidance
i
Simulate Bankers Algorithm for Dead Lock Prevention
s
Simulate all page replacement algorithms
r
a) FIFO b) LRU c) LFU etc. …
e
8. Simulate Paging Technique of memory management.
Outcomes:
n i v
The course objectives ensure the development of students applied
skills in operating systems related areas.
Students will gain knowledge in writing software routines, modules
for implementing various concepts of operating systems.
te s
Intel based desktop PCs LAN CONNECTED with minimum of 166
MHZ or faster processor with atleast 64 MB RAM and 100 MB free
disk space
d a
p
Computer Networks Lab:
1. Implement the data link layer framing methods such as character,
U
character stuffing and bit stuffing.
2. Implement on a data set of characters the three CRC polynomials –
CRC 12, CRC 16 and CRC CCIP .
3.
4.
graph.
i y
Implement Dijkstra‘s algorithm to compute the Shortest path thru a
t
Take an example subnet graph with weights indicating delay between
s
nodes. Now obtain Routing table art each node using distance vector
r
routing algorithm
5. Take an example subnet of hosts. Obtain broadcast tree for it.
i v
6.
7.
8.
e
Take a 64 bit playing text and encrypt the same using DES algorithm.
Write a program to break the above DES coding
Using RSA algorithm Encrypt a text data and Decrypt the same.
n
Outcomes:
Ability to understand the encryption and decryption concepts in Linux
environment
te s
UNIT- I
To introduce Client side scripting with Javascript and AJAX.
d a
handling results, Handling sessions and cookies
U p
operators, expressions, control structures, functions, Reading data from web
form controls like text boxes, radio buttons, lists etc., Handling File Uploads,
Connecting to database (MySQL as reference), executing simple queries,
File Handling in PHP: File operations like opening, closing, reading, writing,
UNIT- II
i y
appending, deleting etc. on text and binary files, listing directories
t
XML: Introduction to XML, Defining XML tags, their attributes and values,
s
Document Type Definition, XML Schemas, Document Object Model, XHTML
r
Parsing XML Data - DOM and SAX Parsers in java.
UNIT- III
i v e
Introduction to Servlets: Common Gateway Interface (CGI), Lifecycle of a
Servlet, deploying a servlet, The Servlet API, Reading Servlet parameters,
Reading Initialization parameters, Handling Http Request & Responses,
Using Cookies and Sessions, connecting to a database using JDBC.
U n UNIT- IV
Introduction to JSP: The Anatomy of a JSP Page, JSP Processing,
Declarations, Directives, Expressions, Code Snippets, implicit objects, Using
Beans in JSP Pages, Using Cookies and session for session tracking,
connecting to database in JSP.
UNIT- V
Client side Scripting: Introduction to Javascript: Javascript language -
declaring variables, scope of variables, functions, event handlers (onclick,
onsubmit etc.), Document Object Model, Form validation.
Simple AJAX application.
TEXT BOOKS:
1. Web Technologies, Uttam K Roy, Oxford University Press
2. The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill
REFERENCE BOOKS:
s
1. Web Programming, building internet applications, Chris Bates 2 nd
edition, W iley Dreamtech
te
2. Java Server Pages –Hans Bergsten, SPD O’Reilly
3. Java Script, D.Flanagan, O’Reilly,SPD.
4.
5.
6.
Beginning Web Programming-Jon Duckett WROX.
a
Programming world wide web, R.W.Sebesta, Fourth Edition, Pearson.
d
Internet and World Wide Web – How to program, Dietel and Nieto,
p
Pearson.
Outcomes:
U
gain knowledge of client side scripting, validation of forms and AJAX
programming
have understanding of server side scripting with PHP language
Data with Java
i t y
have understanding of what is XML and how to parse and use XML
e r s
n i v
U
te s
a
prosperity which are the core aspirations of all human beings.
b. To facilitate the development of a Holistic perspective among students
towards life, profession and happiness, based on a correct
p d
understanding of the Human reality and the rest of Existence. Such a
holistic perspective forms the basis of Value based living in a natural
way.
U
c. To highlight plausible implications of such a Holistic understanding in
terms of ethical human conduct, trustful and mutually satisfying human
behavior and mutually enriching interaction with Nature.
Unit I:
i t y
Course Introduction - Need, Basic Guidelines, Content and Process for Value
Education: Understanding the need, basic guidelines, content and process
r s
for Value Education. Self Exploration–what is it? - its content and process;
‘Natural Acceptance’ and Experiential Validation- as the mechanism for self
exploration. Continuous Happiness and Prosperity- A look at basic Human
e
Aspirations. Right understanding, Relationship and Physical Facilities- the
basic requirements for fulfillment of aspirations of every human being with
s
intention and competence. Understanding the meaning of Samman,
Difference between respect and differentiation; the other salient values in
te
relationship. Understanding the harmony in the society (society being an
extension of family): Samadhan, Samridhi, Abhay, Sah-astitva as
comprehensive Human Goals. Visualizing a universal harmonious order in
society- Undivided Society (Akhand Samaj), Universal Order (Sarvabhaum
Vyawastha )- from family to world family!
Unit IV:
d a
p
Understanding Harmony in the Nature and Existence - Whole existence as
Co-existence : Understanding the harmony in the Nature. Interconnectedness
and mutual fulfillment among the four orders of nature- recyclability and
U
self-regulation in nature. Understanding Existence as Co-existence (Sah-
astitva) of mutually interacting units in all-pervasive space. Holistic perception
y
of harmony at all levels of existence.
t
Unit V:
i
Implications of the above Holistic Understanding of Harmony on Professional
Ethics : Natural acceptance of human values. Definitiveness of Ethical
a)
e r s
Human Conduct. Basis for Humanistic Education, Humanistic Constitution
and Humanistic Universal Order. Competence in professional ethics:
Ability to utilize the professional competence for augmenting universal
human order,
n i vb)
c)
Ability to identify the scope and characteristics of people-friendly and
eco-friendly production systems,
Ability to identify and develop appropriate technologies and
management patterns for above production systems.
Case studies of typical holistic technologies, management models and
U
production systems. Strategy for transition from the present state to Universal
Human Order:
a) At the level of individual: as socially and ecologically responsible
engineers, technologists and managers
b) At the level of society: as mutually enriching institutions and
organizations
TEXT BOOKS
1. R R Gaur, R Sangal, G P Bagaria, 2009, A Foundation Course in
Human Values and Professional Ethics.
3.
E.F. Schumacher, 1973, Small is Beautiful: a study of economics as
if people mattered, Blond & Briggs, Britain.
A Nagraj, 1998, Jeevan Vidya ek Parichay, Divya Path Sansthan,
Amarkantak.
te s
4.
5.
Sussan George, 1976, How the Other Half Dies, Penguin Press.
Reprinted 1986, 1991
PL Dhar, RR Gaur, 1990, Science and Humanism, Commonwealth
d a
p
Purblishers.
6. A.N. Tripathy, 2003, Human Values, New Age International Publishers.
U
7. Subhas Palekar, 2000, How to practice Natural Farming,
Pracheen(Vaidik) Krishi Tantra Shodh, Amravati.
8. Donella H. Meadows, Dennis L. Meadows, Jorgen Randers, William
9.
Universe Books.
i y
W. Behrens III, 1972, Limits to Growth – Club of Rome’s report,
t
E G Seebauer & Robert L. Berry, 2000, Fundamentals of Ethics for
s
Scientists & Engineers, Oxford University Press
r
10. M Govindrajran, S Natrajan & V.S. Senthil Kumar, Engineering Ethichs
(including Human Values), Eastern Economy Edition, Prentice Hall
i v1.
2.
e
of India Ltd.
Relevant CDs, Movies, Documentaries & Other Literature:
Value Education website, http://www.uptu.ac.in
Story of Stuff, http://www.storyofstuff.com
U n 3.
4.
5.
Al Gore, An Inconvenient Truth, Paramount Classics, USA
Charlie Chaplin, Modern Times, United Artists, USA
IIT Delhi, Modern Technology – the Untold Story
UNIT – I
(Open Elective)
te s
a
property rights.
UNIT – II
Trade Marks : Purpose and function of trade marks, acquisition of trade
p
mark rights, protectable matter, selecting and evaluating trade mark, trade
mark registration processes.
UNIT – III
d
U
Law of copy rights : Fundamental of copy right law, originality of material,
rights of reproduction, rights to perform the work publicly, copy right ownership
y
issues, copy right registration, notice of copy right, international copy right
t
law.
i
Law of patents : Foundation of patent law, patent searching process,
s
ownership rights and transfer
UNIT – IV
e r
Trade Secrets : Trade secrete law, determination of trade secrete status,
liability for misappropriations of trade secrets, protection for submission,
trade secrete litigation.
U
International overview on intellectual property, international – trade mark
law, copy right law, international patent law, international development in
trade secrets law.
TEXT BOOKS & REFERENCES:
1. Intellectual property right, Deborah. E. Bouchoux, cengage learing.
2. Intellectual property right – Unleashing the knowledge economy,
prabuddha ganguli, Tate Mc Graw Hill Publishing company ltd.,
Unit-I
(Open Elective)
te s
a
Environmental Hazards, Environmental stress & Environmental Disasters.
Different approaches & relation with human Ecology - Landscape Approach
- Ecosystem Approach - Perception approach - Human ecology & its
application in geographical researches.
Unit –II
p d
Types of Environmental hazards & Disasters: Natural hazards and Disasters
U
- Man induced hazards & Disasters - Natural Hazards- Planetary Hazards/
Disasters - Extra Planetary Hazards/ disasters - Planetary Hazards-
Endogenous Hazards - Exogenous Hazards –
Unit –III
i t y
Endogenous Hazards - Volcanic Eruption – Earthquakes – Landslides -
Volcanic Hazards/ Disasters - Causes and distribution of Volcanoes -
r s
Hazardous effects of volcanic eruptions - Environmental impacts of volcanic
eruptions - Earthquake Hazards/ disasters - Causes of Earthquakes -
Distribution of earthquakes - Hazardous effects of - earthquakes - -
e
Earthquake Hazards in India - - Human adjustment, perception & mitigation
of earthquake.
n i vUnit –IV
Exogenous hazards/ disasters - Infrequent events- Cumulative atmospheric
hazards/ disasters
Infrequent events: Cyclones – Lightning – Hailstorms
U
Cyclones: Tropical cyclones & Local storms - Destruction by tropical cyclones
& local storms (causes , distribution human adjustment, perception &
mitigation) Cumulative atmospheric hazards/ disasters : - Floods- Droughts-
Cold waves- Heat waves Floods:- Causes of floods- Flood hazards India-
Flood control measures (Human adjustment, perception & mitigation)
Droughts:- Impacts of droughts- Drought hazards in India- Drought control
measures- Extra Palnetary Hazards/ Disasters- Man induced Hazards /
Disasters- Physical hazards/ Disasters-Soil Erosion
Soil Erosion:— Mechanics & forms of Soil Erosion- Factors & causes of Soil
Erosion- Conservation measures of Soil Erosion
te s
a
2. Emergency Stage
3. Post Disaster stage-Rehabilitation
TEXT BOOKS:
1.
2.
p d
Disaster Mitigation: Experiences And Reflections by Pardeep Sahni
Natural Hazards & Disasters by Donald Hyndman & David Hyndman
– Cengage Learning
REFERENCES
1.
U
R.B.Singh (Ed) Environmental Geography, Heritage Publishers New
Delhi,1990
y
2.
3.
1997
s t
Savinder Singh Environmental Geography, Prayag Pustak Bhawan,
i
Kates,B.I & W hite, G.F The Environment as Hazards, oxford, New
York, 1978
4.
r
R.B. Singh (Ed) Disaster Management, Rawat Publication, New Delhi,
2000
e
v
5. H.K. Gupta (Ed) Disaster Management, Universiters Press, India,
2003
n i 6.
7.
R.B. Singh, Space Technology for Disaster Mitigation in India (INCED),
University of Tokyo, 1994
Dr. Satender , Disaster Management t in Hills, Concept Publishing
Co., New Delhi, 2003
U 8.
9.
10.
A.S. Arya Action Plan For Earthquake,Disaster, Mitigation in V.K.
Sharma (Ed) Disaster Management IIPA Publication New Delhi, 1994
R.K. Bhandani An overview on Natural & Man made Disaster & their
Reduction,CSIR, New Delhi
M.C. Gupta Manuals on Natural Disaster management in India,
National Centre for Disaster Management, IIPA, New Delhi, 2001
te s
a
operation, association, association role, multiplicity, association class,
abstract class, concrete class, class-scope attribute, abstract
d
operation, method, polymorphism, overriding, multiple classification,
aggregation, and composition.
development life cycle.
U p
Describe the activities in the different phases of the object-oriented
EER models.
i t y
Model a real-world application by using a UML class diagram.
Provide a snapshot of the detailed state of a system at a point in time
r
relationships.
e s
using a UML (Unified Modeling Language) object diagram.
Recognize when to use generalization, aggregation, and composition
n i vUNIT- I
Introduction to UML: Importance of modeling, principles of modeling, object
oriented modeling, conceptual model of the UML, Architecture, Software
Development Life Cycle.
UNIT- II
te s
a
Patterns and Frameworks, Artifact Diagrams. Case Study: The Unified Library
application
d
TEXT BOOKS:
1. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified
2.
p
Modeling Language User Guide, Pearson Education 2nd Edition.
Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML
2 Toolkit, WILEY-Dreamtech India Pvt. Ltd.
REFERENCE BOOKS:
U
y
1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML,
t
Pearson Education.
i
2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-
Dreamtech India Pvt. Ltd.
3.
4.
5.
e s
Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hill
r
Companies.
Mark Priestley: Practical Object-Oriented Design with UML, TMH.
Appling UML and Patterns: An introduction to Object – Oriented
n i v6.
Analysis and Design and Unified Process, Craig Larman, Pearson
Education.
Object-Oriented Analysis and Design with the Unified Process By
John W. Satzinger, Robert B Jackson and Stephen D Burd, Cengage
Learning.
U
7. UML and C++, R.C.Lee, and W.M.Tepfenhart, PHI.
8. Object Oriented Analysis, Design and Implementation, B.Dathan,
S.Ramnath, Universities Press.
9. OODesign with UML and Java, K.Barclay, J.Savage, Elsevier.
10. Learning UML 2.0, Russ Miles and Kim Hamilton, O’Reilly, SPD.
Outcomes: Graduate can able to take up the case studies and model it in
different views with respect user requirement such as use case, logical,
component and deployment and etc, and preparation of document of the
project for the unified Library application.
te s
a
UNIT-I
Data warehouse: Introduction to Data warehouse, Difference between
operational database systems and data warehouses, Data warehouse
p
Characteristics, Data warehouse Architecture and its Components,
Extraction-Transformation-Loading, Logical(Multi-Dimensional), Data
Modeling, Schema Design, Star and Snow-Flake Schema, Fact Consultation, d
U
Fact Table, Fully Addictive, Semi-Addictive, Non Addictive Measures; Fact-
Less-Facts, Dimension Table Characteristics; OLAP Cube, OLAP Operations,
OLAP Server Architecture-ROLAP, MOLAP and HOLAP.
UNIT-II
i t y
Introduction to Data Mining: Introduction, What is Data Mining, Definition,
KDD, Challenges, Data Mining Tasks, Data Preprocessing, Data Cleaning,
s
Missing data, Dimensionality Reduction, Feature Subset Selection,
r
Discretization and Binaryzation, Data Transformation; Measures of Similarity
and Dissimilarity- Basics.
i v
UNIT-III
e
Association Rules: Problem Definition, Frequent Item Set Generation, The
APRIORI Principle, Support and Confidence Measures, Association Rule
Generation; APRIOIRI Algorithm, The Partition Algorithms, FP-Growth
n
Algorithms, Compact Representation of Frequent Item Set- Maximal Frequent
Item Set, Closed Frequent Item Set.
UNIT-IV
2)
Data Mining- Concepts and Techniques- Jiawei Han, Micheline
Kamber, Morgan Kaufmann Publishers Elsevier 2 Edition, 2006.
Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael
Steinbanch, Pearson Education
te s
REFERENCE BOOKS:
1)
2)
d a
Data Mining Techniques, Arun K Pujari, 3rd Edition, Universities Press.
Data Warehousing Fundamentals, Pualraj Ponnaiah, Wiley Student
p
Edition.
3) The Data Warehouse Life Cycle Toolkit – Ralph Kimball, Wiley Student
U
Edition.
4) Data Mining, Vikaram Pudi, P Radha Krishna, Oxford University Press.
Outcomes:
i t y
Student should be able to understand why the data warehouse in
addition to database systems.
Ability to perform the preprocessing of data and apply mining
techniques on it.
r
large data sets.
e s
Ability to identify the association rules, classification and clusters in
v
information using data mining
n i
U
te s
a
UNIT - I
Introduction:- Purpose of testing, Dichotomies, model for testing,
consequences of bugs, taxonomy of bugs.
p
Flow graphs and Path testing:- Basics concepts of path testing, predicates,
d
path predicates and achievable paths, path sensitizing, path instrumentation,
application of path testing.
UNIT - II
U
Transaction Flow Testing:-transaction flows, transaction flow testing
techniques.
y
t
Dataflow testing:- Basics of dataflow testing, strategies in dataflow testing,
i
application of dataflow testing.
UNIT - III
s
r
Domain Testing:-domains and paths, Nice & ugly domains, domain testing,
domains and interfaces testing, domain and interface testing, domains and
e
testability.
v
UNIT-IV
i
Paths, Path products and Regular expressions:- path products & path
expression, reduction procedure, applications, regular expressions & flow
n
anomaly detection.
Logic Based Testing:- overview, decision tables, path expressions, kv charts,
specifications.
U UNIT - V
State, State Graphs and Transition testing:- state graphs, good & bad state
graphs, state testing, Testability tips.
Graph Matrices and Application:-Motivational overview, matrix of graph,
relations, power of a matrix, node reduction algorithm, building tools. (Student
should be given an exposure to a tool like JMeter or Win-runner).
TEXT BOOKS:
1. Software Testing techniques – Boris Beizer, Dreamtech, second
edition.
s
(Dist.by SPD).
3. Software Testing, N.Chauhan, Oxford University Press.
te
4. Introduction to Software Testing, P.Ammann&J.Offutt, Cambridge
Univ.Press.
a
5. Effective methods of Software Testing, Perry, John Wiley, 2nd Edition,
1999.
6.
7.
8.
Software Testing Concepts and Tools, P.Nageswara Rao, dreamtech
Press.
Software Testing, M.G.Limaye, TMH.
Software Testing, S.Desikan, G.Ramesh, Pearson.
p d
9.
10.
Learning.
y U
Foundations of Software Testing, D.Graham & Others, Cengage
i t
Ability to apply the process of testing and various methodologies in testing
for developed software.
s
r
Ability to write test cases for given software to test it before delivery to the
customer.
i v e
U n
te s
UNIT- I
To describe the security aspects in cloud.
d a
p
Models and Enabling Technologies, Computer Clusters for Scalable Parallel
Computing, Virtual Machines and Virtualization of Clusters and Data centers.
U
UNIT- II
Foundations: Introduction to Cloud Computing, Migrating into a Cloud,
Enriching the ‘Integration as a Service’ Paradigm for the Cloud Era, The
UNIT- III
i y
Enterprise Cloud Computing Paradigm.
t
Infrastructure as a Service (IAAS) & Platform and Software as a Service
s
(PAAS / SAAS): Virtual machines provisioning and Migration services, On
r
the Management of Virtual machines for Cloud Infrastructures, Enhancing
Cloud Computing Environments using a cluster as a Service, Secure
e
Distributed Data Storage in Cloud Computing.
v
Aneka, Comet Cloud, T-Sytems’, Workflow Engine for Clouds, Understanding
Scientific Applications for Cloud Environments.
n i UNIT- IV
Monitoring, Management and Applications: An Architecture for Federated
Cloud Computing, SLA Management in Cloud Computing, Performance
Prediction for HPC on Clouds, Best Practices in Architecting Cloud
3.
Enterprise Cloud Computing, Gautam Shroff, Cambridge University
Press, 2010.
Cloud Computing: Implementation, Management and Security, John
W. Rittinghouse, James F.Ransome, CRC Press, rp2012.
te s
4.
5.
Cloud Application Architectures: Building Applications and
d a
Infrastructure in the Cloud, George Reese, O’Reilly, SPD, rp2011.
Cloud Security and Privacy: An Enterprise Perspective on Risks and
p
Compliance, Tim Mather, Subra Kumaraswamy, Shahed Latif, O’Reilly,
SPD, rp2011.
U
Outcomes:
Ability to understand the virtualization and cloud computing concepts.
i t y
e r s
n i v
U
te s
a
Demonstrate the working of algorithms for data mining tasks such association
rule mining, classification, clustering and regression, Exercise the data mining
techniques with varied input values for different parameters.
Credit Risk Assessment
p
Description: The business of banks is making loans. Assessing the credit
worthiness of an applicant is of crucial importance. You have to develop a d
U
system to help a loan officer decide whether the credit of a customer is
good, or bad. A bank’s business rules regarding loans must consider two
opposing factors. On the one hand, a bank wants to make as many loans as
y
possible. Interest on these loans is the banks profit source. On the other
t
hand, a bank cannot afford to make too many bad loans. Too many bad
i
loans could lead to the collapse of the bank. The bank’s loan policy must
s
involve a compromise: not too strict, and not too lenient.
r
To do the assignment, you first and foremost need some knowledge about
the world of credit. You can acquire such knowledge in a number of ways.
i v
1.
2. e
Knowledge Engineering. Find a loan officer who is willing to talk.
Interview her and try to represent her knowledge in the form of
production rules.
Books. Find some training manuals for loan officers or perhaps a
n
suitable textbook on finance. Translate this knowledge from text form
to production rule form.
3. Common sense. Imagine yourself as a loan officer and make up
U 4.
reasonable rules which can be used to judge the credit worthiness of
a loan applicant.
Case histories. Find records of actual cases where competent loan
officers correctly judged when, and when not to, approve a loan
application.
The German Credit Data: Actual historical credit data is not always easy to
come by because of confidentiality rules. Here is one such dataset, consisting
of 1000 actual cases collected in Germany. credit dataset (original) Excel
spreadsheet version of the German credit data (Down load from web). In
spite of the fact that the data is German, you should probably make use of it
for this assignment. (Unless you really can consult a real loan officer !)
A few notes on the German dataset
• DM stands for Deutsche Mark, the unit of currency, worth about 90
cents Canadian (but looks and acts like a quarter).
•
•
owns_telephone. German phone rates are much higher than in
Canada so fewer people own telephones.
foreign_worker. There are millions of these in Germany (many from
Turrkey). It is very hard to get German citizenship if you were not
te s
•
born of German parents.
d a
There are 20 attributes used in judging a loan applicant. The goal is
the classify the applicant into one of two categories, good or bad.
p
Subtasks : (Turn in your answers to the following tasks)
1. List all the categorical (or nominal) attributes and the real-valued
U
attributes separately.
2. What attributes do you think might be crucial in making the credit
assessment ? Come up with some simple rules in plain English using
3.
your selected attributes.
t y
One type of model that you can create is a Decision Tree - train a
i
Decision Tree using the complete dataset as the training data. Report
s
the model obtained after training.
r
4. Suppose you use your above model trained on the complete dataset,
and classify credit good/bad for each of the examples in the dataset.
e
What % of examples can you classify correctly? (This is also called
testing on the training set) Why do you think you cannot get 100 %
n i v5.
6.
training accuracy ?
Is testing on the training set as you did above a good idea ? Why or
Why not ?
One approach for solving the problem encountered in the previous
question is using cross-validation? Describe what is cross-validation
U
briefly. Train a Decision Tree again using cross-validation and report
your results. Does your accuracy increase/decrease? W hy? (10
marks)
7. Check to see if the data shows a bias against „foreign workers“
(attribute 20),or „personal-status“ (attribute 9). One way to do this
(perhaps rather simple minded) is to remove these attributes from
the dataset and see if the decision tree created in those cases is
significantly different from the full dataset case which you have already
done. To remove an attribute you can use the preprocess tab in
W eka’s GUI Explorer. Did removing these attributes have any
9.
had removed two attributes in problem 7. Remember to reload the
arff data file to get all the attributes initially before you start selecting
the ones you want.)
Sometimes, the cost of rejecting an applicant who actually has a
te s
a
good credit (case 1) might be higher than accepting an applicant
who has bad credit (case 2). Instead of counting the misclassifications
d
equally in both cases, give a higher cost to the first case (say cost 5)
and lower cost to the second case. You can do this by using a cost
p
matrix in Weka. Train your Decision Tree again and report the Decision
Tree and cross-validation results. Are they significantly different from
results obtained in problem 6 (using equal cost)?
10
U
Do you think it is a good idea to prefer simple decision trees instead
of having long complex decision trees ? How does the complexity of
y
a Decision Tree relate to the bias of the model?
t
11. You can make your Decision Trees simpler by pruning the nodes.
i
One approach is to use Reduced Error Pruning - Explain this idea
briefly. Try reduced error pruning for training your Decision Trees
12.
r s
using cross-validation (you can do this in Weka) and report the
Decision Tree you obtain? Also, report your accuracy using the pruned
model. Does your accuracy increase?
e
(Extra Credit): How can you convert a Decision Trees into „if-then-
v
else rules“. Make up your own small Decision Tree consisting of 2-3
i
levels and convert it into a set of rules. There also exist different
classifiers that output the model in the form of rules - one such
n
classifier in Weka is rules.PART, train this model and report the set of
rules obtained. Sometimes just one attribute can be good enough in
making the decision, yes, just one ! Can you predict what attribute
Decision Trees)
Weka resources:
o Introduction to Weka (html version) (download ppt version)
o Download Weka
s
o Weka Tutorial
te
o ARFF format
o Using Weka from command line
Outcomes:
Ability to understand the various kinds of tools.
d a
Demonstrate the classification, clusters and etc. in large data sets
Objectives:
technologies
HTML
U p
To enable the student to program web applications using the following
y
Javascript
t
AJAX
PHP
Tomcat Server
Servlets
JSP
r s i
i v
Note:
3.
e
Use LAMP Stack (Linux, Apache, MySQL and PHP) for the Lab
Experiments. Though not mandatory, encourage the use of
Eclipse platform wherever applicable
U n 4.
1.
The list suggests the minimum program set. Hence, the
concerned staff is requested to add more problems to the list as
needed
Install the following on the local machine
Apache Web Server (if not installed)
Tomcat Application Server locally
Install MySQL (if not installed)
Install PHP and configure it to work with Apache web server and
MySQL (if not already configured)
2. Write an HTML page including any required Javascript that takes a
number from one text field in the range of 0 to 999 and shows it in
4.
should show the number of characters, words and lines in the text
entered using an alert message. Words are separated with white
space and lines are separated with new line character.
Write an HTML page that contains a selection box with a list of 5
te s
a
countries. When the user selects a country, its capital should be
printed next to the list. Add CSS to customize the properties of the
d
font of the capital (color, bold and font size).
5. Create an XML document that contains 10 users information. Write a
6.
U p
Java program, which takes User Id as input and returns the user
details by taking the user information from the XML document using
(a) DOM Parser and (b) SAX parser
Implement the following web applications using (a) PHP, (b) Servlets
and (c) JSP:
i.
i t y
A user validation web application, where the user submits the login
name and password to the server. The name and password are
checked against the data already available in Database and if the
s
data matches, a successful login page is returned. Otherwise a failure
message is shown to the user.
ii.
iii.
e r
Modify the above program to use an xml file instead of database.
Modify the above program to use AJAX to show the result on the
same page below the submit button.
n i viv.
v.
A simple calculator web application that takes two numbers and an
operator (+, -, /, * and %) from an HTML page and returns the result
page with the operation performed on the operands.
Modify the above program such that it stores each query in a database
and checks the database first for the result. If the query is already
U vi.
available in the DB, it returns the value that was previously computed
(from DB) or it computes the result and returns it after storing the
new query and result in DB.
A web application takes a name as input and on submit it shows a
hello <name> page where <name> is taken from the request. It shows
the start time at the right top corner of the page and provides a logout
button. On clicking this button, it should show a logout page with
Thank You <name> message with the duration of usage (hint: Use
session to store name and time).
vii. A web application that takes name and age from an HTML page. If
the age is less than 18, it should send a page with “Hello <name>,
you are not authorized to visit this site” message, where <name>
should be replaced with the entered name. Otherwise it should send
“Welcome <name> to this site” message.
viii. A web application for implementation:
The user is first served a login page which takes user’s name and password.
After submitting the details the server checks these values against the data
from a database and takes the following decisions.
If name and password matches, serves a welcome page with user’s full
te s
a
name.
If name matches and password doesn’t match, then serves “password
mismatch” page
p
If name is not found in the database, serves a registration page, where
d
user’s full name is asked and on submitting the full name, it stores, the login
name, password and full name in the database (hint: use session for storing
U
the submitted login name and password)
ix. A web application that lists all cookies stored in the browser on clicking
y
“List Cookies” button. Add cookies if necessary.
t
TEXT BOOKS:
i
1. Web Technologies, Uttam K Roy, Oxford University Press
s
2. The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill
r
REFERENCE BOOKS:
1. Web Programming, building internet applications, Chris Bates 2 nd
i v
2.
3.
4.
e
edition, W iley Dreamtech
Java Server Pages –Hans Bergsten, SPD O’Reilly
Java Script, D.Flanagan, O’Reilly,SPD.
Beginning Web Programming-Jon Duckett WROX.
U n 5.
6.
Programming world wide web, R.W.Sebesta, Fourth Edition, Pearson.
Internet and World Wide Web – How to program, Dietel and Nieto,
Pearson.
Outcomes:
The student should be able to:
Use LAMP Stack for web applications
Use Tomcat Server for Servlets and JSPs
Write simple applications with Technologies like HTML, Javascript,
AJAX, PHP, Servlets and JSPs
Connect to Database and get results
Parse XML files using Java (DOM and SAX parsers)
te s
a
and write in English both for their professional and interpersonal
communication in the globalised context.
The proposed course should be a laboratory course to enable students to
use ‘good’ English and perform the following:
coherently.
p
Gathering ideas and information to organise ideas relevantly and
d
U
Engaging in debates.
Participating in group discussions.
y
Facing interviews.
i t
Writing project/research reports/technical reports.
Making oral presentations.
s
Writing formal letters.
r
Transferring information from non-verbal to verbal texts and vice-
versa.
i v
Objectives:
e
Taking part in social and professional communication.
U n
To improve the students’ fluency in English, through a well-developed
vocabulary and enable them to listen to English spoken at normal
conversational speed by educated English speakers and respond
appropriately in different socio-cultural and professional contexts.
Further, they would be required to communicate their ideas relevantly
and coherently in writing.
To prepare all the students for their placements.
Syllabus:
The following course content to conduct the activities is prescribed for the
Advanced Communication Skills (ACS) Lab:
1. Activities on Fundamentals of Inter-personal Communication and
s
idioms and phrases, collocations & usage of vocabulary.
te
2. Activities on Reading Comprehension –General Vs Local
comprehension, reading for facts, guessing meanings from context,
scanning, skimming, inferring meaning, critical reading & effective
a
googling.
3. Activities on Writing Skills – Structure and presentation of different
d
types of writing – letter writing/Resume writing/ e-correspondence/
Technical report writing/ Portfolio writing – planning for writing –
p
improving one’s writing.
4. Activities on Presentation Skills – Oral presentations (individual
and group) through JAM sessions/seminars/PPTs and written
5.
y U
presentations through posters/projects/reports/ e-mails/assignments
etc.
Activities on Group Discussion and Interview Skills – Dynamics
t
of group discussion, intervention, summarizing, modulation of voice,
i
body language, relevance, fluency and organization of ideas and
rubrics for evaluation- Concept and process, pre-interview planning,
s
opening strategies, answering strategies, interview through tele-
r
conference & video-conference and Mock Interviews.
e
Minimum Requirement:
The Advanced Communication Skills (ACS) Laboratory shall have the
U
LCD Projector
Public Address system
P – IV Processor, Hard Disk – 80 GB, RAM–512 MB Minimum,
Speed – 2.8 GHZ
T. V, a digital stereo & Camcorder
Headphones of High quality
Prescribed Lab Manual: A book titled A Course Book of Advanced
Communication Skills (ACS) Lab published by Universities Press,
Hyderabad.
Suggested Software:
The software consisting of the prescribed topics elaborated above should
be procured and used.
s
Oxford Advanced Learner’s Compass, 7th Edition
DELTA’s key to the Next Generation TOEFL Test: Advanced Skill
te
Practice.
Lingua TOEFL CBT Insider, by Dreamtech
a
TOEFL & GRE( KAPLAN, AARCO & BARRONS, USA, Cracking GRE
by CLIFFS)
The following software from ‘train2success.com’
Preparing for being Interviewed
Positive Thinking
Interviewing Skills
p d
Telephone Skills
Time Management
Books Recommended:
y U
1.
2.
i t
Technical Communication by Meenakshi Raman & Sangeeta Sharma,
Oxford University Press 2009.
s
Advanced Communication Skills Laboratory Manual by Sudha Rani,
r
D, Pearson Education 2011.
3. Technical Communication by Paul V. Anderson. 2007. Cengage
i v
4.
e
Learning pvt. Ltd. New Delhi.
Business and Professional Communication: Keys for Workplace
Excellence. Kelly M. Quintanilla & Shawn T. Wahl. Sage South Asia
Edition. Sage Publications. 2011.
U n 5.
6.
7.
The Basics of Communication: A Relational Perspective. Steve Duck
& David T. McMahan. Sage South Asia Edition. Sage Publications.
2012.
English Vocabulary in Use series, Cambridge University Press 2008.
Management Shapers Series by Universities Press(India)Pvt Ltd.,
Himayatnagar, Hyderabad 2008.
8. Handbook for Technical Communication by David A. McMurrey &
Joanne Buckley. 2012. Cengage Learning.
9. Communication Skills by Leena Sen, PHI Learning Pvt Ltd., New
Delhi, 2009.
10. Handbook for Technical Writing by David A McMurrey & Joanne
s
13. English for Technical Communication for Engineering Students, Aysha
Vishwamohan, Tata Mc Graw-Hil 2009.
te
14. Books on TOEFL/GRE/GMAT/CAT/ IELTS by Barron’s/DELTA/
Cambridge University Press.
a
15. International English for Call Centres by Barry Tomalin and Suhashini
Thomas, Macmillan Publishers, 2009.
d
DISTRIBUTION AND WEIGHTAGE OF MARKS:
Advanced Communication Skills Lab Practicals:
1.
2.
engineering practical sessions.
U p
The practical examinations for the ACS Laboratory practice shall be
conducted as per the University norms prescribed for the core
y
Examination marks. Of the 25 marks, 15 marks shall be awarded for
t
day-to-day work and 10 marks to be awarded by conducting Internal
i
Lab Test(s). The End Examination shall be conducted by the teacher
s
concerned, by inviting the External Examiner from outside. In case of
the non-availability of the External Examiner, other teacher of the
r
same department can act as the External Examiner.
e
Mini Project: As a part of Internal Evaluation
1. Seminar/ Professional Presentation
n i v2.
*
*
A Report on the same has to be prepared and presented.
Teachers may use their discretion to choose topics relevant and
suitable to the needs of students.
Not more than two students to work on each mini project.
U
* Students may be assessed by their performance both in oral
presentation and written report.
Outcomes
Accomplishment of sound vocabulary and its proper use contextually.
Flair in Writing and felicity in written expression.
Enhanced job prospects.
Effective Speaking Abilities
te s
Understand various cryptographic algorithms.
d
Understand the basic categories of threats to computers and networks
Describe public-key cryptosystem.
a
Understand Intrusions and intrusion detection
U p
Describe the enhancements made to IPv4 by IPSec
y
send an encrypted e-mail message.
t
Discuss Web security and Firewalls
i
UNIT – I
s
Attacks on Computers and Computer Security: Introduction, The need
for security, Security approaches, Principles of security, Types of Security
Security
e r
attacks, Security services, Security Mechanisms, A model for Network
U
Blowfish), Differential and Linear Cryptanalysis, Block cipher modes of
operation, Stream ciphers, RC4,Location and placement of encryption
function, Key distribution Asymmetric key Ciphers: Principles of public key
cryptosystems, Algorithms(RSA, Diffie-Hellman,ECC), Key Distribution
UNIT – III
Message Authentication Algorithms and Hash Functions: Authentication
requirements, Functions, Message authentication codes, Hash Functions,
Secure hash algorithm, W hirlpool, HMAC, CMAC, Digital signatures,
knapsack algorithm Authentication Applications: Kerberos, X.509
te s
firewalls Case Studies on Cryptography and security: Secure Inter-branch
d a
and related threats, Countermeasures, Firewall design principles, Types of
p
TEXT BOOKS:
1. Cryptography and Network Security : W illiam Stallings, Pearson
Education,4th Edition
2.
Edition
REFERENCE BOOKS:
y U
Cryptography and Network Security : Atul Kahate, Mc Graw Hill, 2nd
1.
2.
t
Cryptography and Network Security: C K Shyamala, N Harini, Dr T R
i
Padmanabhan, Wiley India, 1st Edition.
s
Cryptography and Network Security : Forouzan Mukhopadhyay, Mc
r
Graw Hill, 2nd Edition
3. Information Security, Principles and Practice: Mark Stamp, Wiley India.
i v
4.
5.
6.
e
Principles of Computer Sceurity: WM.Arthur Conklin, Greg White,
TMH
Introduction to Network Security: Neal Krawetz, CENGAGE Learning
Network Security and Cryptography: Bernard Menezes, CENGAGE
U n
Learning
Outcomes:
Student will be able to understand basic cryptographic algorithms,
message and web authentication and security issues.
Ability to identify information system requirements for both of them
such as client and server.
Ability to understand the current legal issues towards information
security.
Understand the design patterns that are common in software
applications.
Understand how these patterns are related to Object Oriented design.
te s
UNIT-I
Introduction : What Is a Design Pattern?, Design Patterns in Smalltalk MVC,
Describing Design Patterns, The Catalog of Design Patterns, Organizing
d a
p
the Catalog, How Design Patterns Solve Design Problems, How to Select a
Design Pattern, How to Use a Design Pattern.
UNIT-II
U
A Case Study : Designing a Document Editor : Design Problems, Document
Structure, Formatting, Embellishing the User Interface, Supporting Multiple
y
Look-and-Feel Standards, Supporting Multiple W indow Systems, User
t
Operations Spelling Checking and Hyphenation, Summary .
i
Creational Patterns : Abstract Factory, Builder, Factory Method, Prototype,
s
Singleton, Discussion of Creational Patterns.
UNIT-III
e r
Structural Pattern Part-I : Adapter, Bridge, Composite.
Structural Pattern Part-II : Decorator, açade, Flyweight, Proxy.
v
UNIT-IV
i
Behavioral Patterns Part-I : Chain of Responsibility, Command, Interpreter,
Iterator.
s
5. Peeling Design Patterns, Prof. Meda Srinivasa Rao, Narsimha
Karumanchi, CareerMonk Publications.
te
6. Design Patterns Explained By Alan Shalloway,Pearson Education.
7. Pattern Oriented Software Architecture, F.Buschmann&others, John
a
Wiley & Sons.
Outcomes:
o
o
Ability to understand and apply common design patterns to
incremental / iterative development.
p d
Ability to identify appropriate patterns for design of given problem.
y U
s i t
e r
n i v
U
te s
a
customers from various mobile software distribution platforms, or delivered
as web applications using server-side or client-side processing (e.g.
d
JavaScript) to provide an “application-like” experience within a Web browser.
Application software developers also have to consider a lengthy array of
p
screen sizes, hardware specifications and configurations because of intense
competition in mobile software and changes within each of the platforms.
Objectives:
U
On completion of this course the students should be able to:
1. Design, implement and evaluate a User Interface for a mobile
application using J2ME.
y
2.
3.
computing devices.
s t
Create a small but realistic working mobile application for small
i
Categorise the challenges posed by developing mobile applications
r
and be able to propose and evaluate and select appropriate
solutions.
i v
UNIT- I
e
J2ME Overview : Java 2 Micro Edition and the World of Java, Inside J2ME,
J2ME and Wireless Devices
Small Computing Technology: Wireless Technology, Radio Data Networks,
n
Microwave Technology, Mobile Radio Networks, Messaging, Personal Digital
Assistants
U
UNIT- II
J2ME Architecture and Development Environment: J2ME Architecture,
Small Computing Device Requirements, Run-Time Environment, MIDlet
Programming, Java Language for J2ME, J2ME Software Development Kits,
Hello World J2ME Style, Multiple MIDlets in a MIDlet Suite, J2ME Wireless
Toolkit
J2ME Best Practices and Patterns: The Reality of Working in a J2ME World,
Best Practices
UNIT- III
Commands, Items, and Event Processing: J2ME User Interfaces, Display
te s
Listener
d
JDBC Objects: The Concept of JDBC, JDBC Driver Types, JDBC Packages,
a
Overview of the JDBC Process, Database Connection, statement Objects,
p
Result set, Transaction Processing, Metadata, Data Types, Exceptions.
JDBC and Embedded SQL: Model Programs, Tables, Indexing, Inserting
Data into Tables, Selecting Data from a Table, Metadata, Updating Tables,
y U
Deleting Data form a Table, Joining Tables, Calculating Data, Grouping and
t
Generic Connection Framework: The Connection, Hypertext Transfer
i
Protocol, Communication Management Using HTTP Commands, Session
s
Management, Transmit as a Background Process
TEXT BOOKS:
1.
2.
e r
J2ME: The Complete Reference, James Keogh, Tata McGrawHill.
Programming for Mobile and Remote Computers, G.T.Thampi,
dreamtech press.
n i vREFERENCE BOOKS:
1.
2.
Enterprise J2ME: Developing Mobile Java Applications – Michael
Juntao Yuan, Pearson Education, 2004
Beginning Java ME Platform, Ray Rischpater, Apress, 2009
U
3. Beginning J2ME: From Novice to Professional, Third Edition, Sing
Li, Jonathan B. Knudsen, Apress, 2005
4. Kicking Butt with MIDP and MSA:Creating Great Mobile
Applications,1st edition, J.Knudsen, Pearson.
Outcomes:
Ability to evaluate and select appropriate solutions to the mobile
computing platform.
Ability to develop the user interface.
Ability design a simple mobile phone game.
te s
To expose the students to the notions of structured and semi structured
data
To learn about web search
d a
UNIT-I
Models.
UNIT-II
U p
Introduction, Retrieval Strategies: Vector space model, Probabilistic retrieval
strategies: Simple term weights, Non binary independence model, Language
analysis, Thesauri.
UNIT-III
i t y
Retrieval Utilities: Relevance feedback, Clustering, N-grams, Regression
s
Retrieval Utilities: Semantic networks, Parsing
r
Cross-Language Information Retrieval: Introduction, Crossing the language
barrier.
UNIT-IV
e
n i vEfficiency: Inverted index, Query processing, Signature files, Duplicate
document detection.
UNIT-V
Integrating Structured Data and Text: A Historical progression, Information
retrieval as a relational application, Semi-structured search using a relational
U schema
Distributed Information Retrieval: A Theoretical model of distributed retrieval,
Web search.
TEXT BOOK:
1. David A. Grossman, Ophir Frieder, Information Retrieval – Algorithms
and Heuristics, Springer, 2nd Edition (Distributed by Universities Press),
2004.
REFERENCE BOOKS:
1. Gerald J Kowalski, Mark T Maybury. Information Storage and Retrieval
Systems, Springer, 2000
2. Soumen Chakrabarti, Mining the Web : Discovering Knowledge
from Hypertext Data, Morgan-Kaufmann Publishers, 2002
3. Christopher D. Manning, Prabhakar Raghavan, Hinrich Schütze, An
Introduction to Information Retrieval, Cambridge University Press,
Cambridge, England, 2009
Outcomes:
te s
Possess the ability to store and retrieve textual documents using
appropriate models
d a
Possess the ability to use the various retrieval utilities for improving
p
search
Possess an understanding of indexing and compressing documents
U
to improve space and time efficiency
Possess the skill to formulate SQL like queries for unstructured data
Understand issues in web search
i t y
e r s
n i v
U
Objectives:
(ELECTIVE - I)
te s
To understand Mobile network layer and transport layer
To understand Bluetooth technology
UNIT – I
d a
U p
Introduction to Network Technologies and Cellular Communications
HIPERLAN: Protocol Architecture, Physical Layer, Channel Access Control
Sub-layer, MAC Sub-layer, Information Bases and Networking
WLAN: Infrared vs. Radio Transmission, Infrastructure and Ad Hoc Networks,
y
IEEE 802.11. Bluetooth.: User Scenarios, Physical Layer, MAC layer,
t
Networking, Security, Link Management
i
GSM: Mobile Services, System Architecture, Radio Interface, Protocols,
Localization and calling, Handover, Security, and New Data Services.
and Architecture
UNIT –II
e s
Mobile Computing (MC): Introduction to MC, Novel Applications, Limitations,
r
(Wireless) Medium Access Control (MAC): Motivation for a Specialized MAC
n i v(Hidden and Exposed Terminals, Near and Far Terminals), SDMA, FDMA,
TDMA, CDMA. MAC Protocols for GSM, W ireless LAN (IEEE802.11),
Collision Avoidance (MACA, MACAW) Protocols.
UNIT –III
Mobile IP Network Layer: IP and Mobile IP Network Layers, Packet Delivery
U
and Handover Management, Location Management, Registration, Tunnelling
and Encapsulation, Route Optimization, DHCP.
Mobile Transport Layer: Conventional TCP/IP Protocols, Indirect TCP,
Snooping TCP, Mobile TCP, Other Transport Layer Protocols for Mobile
Networks.
UNIT- IV
Database Issues: Database Hoarding & Caching Techniques, Client–Server
Computing & Adaptation, Transactional Models, Query processing, Data
Recovery Process & QoS Issues.
te s
a
Protocols and Platforms for Mobile Computing WAP, Bluetooth, XML, J2ME,
JavaCard, PalmOS, Windows CE, SymbianOS, Linux for Mobile Devices.
TEXT BOOKS
1.
2.
p d
Raj Kamal, “Mobile Computing”, Oxford University Press, 2007, ISBN:
0195686772
Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second
1.
Edition, 2004
REFERENCE BOOKS
y U
Stojmenovic and Cacute, “Handbook of Wireless Networks and Mobile
t
Computing”, Wiley, 2002, ISBN 0471419028.
2.
i
Reza Behravanfar, “Mobile Computing Principles: Designing and
s
Developing Mobile Applications with UML and XML”, ISBN:
0521817331, Cambridge University Press, Oct 2004,
Outcomes:
r
i v e
Ability to understand the strengths and limitations of mobile/wireless networks
Ability to design and analyze the performance of location update algorithms
for cellular networks;
U n
Objectives:
(ELECTIVE - I)
te s
Practical knowledge and skills about image processing and pattern
recognition tools
Necessary knowledge to design and implement a prototype of an
d a
p
image processing and pattern recognition application.
UNIT – I
U
Fundamental steps of image processing, components of an image processing
of system. The image model and image acquisition, sampling and
quantization, relationship between pixels, distance functions, scanner.
y
Statistical and spatial operations, Intensity functions transformations,
t
histogram processing, smoothing & sharpening – spatial filters Frequency
i
domain filters, homomorphic filtering, image filtering & restoration. Inverse
s
and weiner filtering, FIR weiner filter, Filtering using image transforms,
smoothing splines and interpolation.
UNIT – II
e r
Morphological and other area operations, basic morphological operations,
opening and closing operations, dilation erosion, Hit or Miss transform,
U
UNIT –III
Image compression: Types and requirements, statistical compression, spatial
compression, contour coding, quantizing compression, image data
compression-predictive technique, pixel coding, transfer coding theory, lossy
and lossless predictive type coding, Digital Image Water marking.
UNIT –IV
Representation and Description: Chain codes, Polygonal approximation,
Signature Boundary Segments, Skeltons, Boundary Descriptors, Regional
Descriptors, Relational Descriptors, Principal components for Description,
Relational Descriptors
UNIT- V
Pattern Recognition Fundamentals: Basic Concepts of pattern recognition,
Fundamental problems in pattern recognition system, design concepts and
methodologies, example of automatic pattern recognition systems, a simple
automatic pattern recognition model
Pattern classification: Pattern classification by distance function: Measures
of similarity, Clustering criteria, K-means algorithm, Pattern classification by
likelihood function: Pattern classification as a Statistical decision problem,
te s
a
Bayes classifier for normal patterns.
TEXT BOOKS
1.
2.
Digital Image Processing Third edition, Pearson Education, Rafael
C. Gonzalez, Richard E. Woods.
p d
Pattern recognition Principles: Julus T. Tou, and Rafel C. Gonzalez,
Addision-Wesly Publishing Company.
3.
Publications.
REFERENCE BOOKS:
y U
Digital Image Processing, M.Anji Reddy, Y.Hari Shankar, BS
1.
2.
t
Image Processing, Analysis and Machine Vision, Second Edition,
i
Milan Sonka, Vaclav Hlavac and Roger Boyle. Thomson learning
s
Digital Image Processing – William k. Pratl –John Wiley edition.
r
3. Fundamentals of digital image processing – by A.K. Jain, PHI.
4. Pattern classification, Richard Duda, Hart and David strok John Wiley
i v
5.
6.
e
publishers.
Digital Image Processing,
T.Veerakumar, TMH.
S.Jayaraman,S.
U n Outcomes:
Ability to apply computer algorithms to practical problems.
Ability to image segmentation, reconstruction and restoration.
Ability to perform the classification of patterns
Objectives:
(ELECTIVE - I)
te s
a
and genetic algorithms.
UNIT-I
AI Problems and Search: AI problems, Techniques, Problem Spaces and
p d
Search, Heuristic Search Techniques- Generate and Test, Hill Climbing, Best
First Search Problem reduction, Constraint Satisfaction and Means End
Analysis. Approaches to Knowledge Representation- Using Predicate Logic
U
and Rules.
UNIT-II
y
Artificial Neural Networks: Introduction, Basic models of ANN, important
t
terminologies, Supervised Learning Networks, Perceptron Networks,
i
Adaptive Linear Neuron, Back propagation Network. Associative Memory
Networks. Training Algorithms for pattern association, BAM and Hopfield
Networks.
UNIT-III
e r s
Unsupervised Learning Network- Introduction, Fixed Weight Competitive
Nets, Maxnet, Hamming Network, Kohonen Self-Organizing Feature Maps,
v
Learning Vector Quantization, Counter Propagation Networks, Adaptive
i
Resonance Theory Networks. Special Networks-Introduction to various
networks.
U n UNIT-IV
Introduction to Classical Sets ( crisp Sets)and Fuzzy Sets- operations and
Fuzzy sets. Classical Relations -and Fuzzy Relations- Cardinality, Operations,
Properties and composition. Tolerance and equivalence relations.
Membership functions- Features, Fuzzification, membership value
assignments, Defuzzification.
UNIT-V
Fuzzy Arithmetic and Fuzzy Measures, Fuzzy Rule Base and Approximate
Reasoning Fuzzy Decision making
Fuzzy Logic Control Systems. Genetic Algorithm- Introduction and basic
operators and terminology. Applications: Optimization of TSP, Internet Search
Technique
TEXT BOOKS:
1. Principles of Soft Computing- S N Sivanandam, S N Deepa, Wiley
India, 2007.
s
2. Soft Computing and Intelligent System Design -Fakhreddine O Karray,
Clarence D Silva, Pearson Edition, 2004.
te
REFERECE BOOKS :
1. Artificial Intelligence and SoftComputing- Behavioural and Cognitive
a
Modelling of the Human Brain- Amit Konar, CRC press, Taylor and
Francis Group.
d
2. Artificial Intelligence – Elaine Rich and Kevin Knight, TMH, 1991,
rp2008.
3.
4.
5.
p
Artificial Intelligence – Patric Henry Winston – Third Edition, Pearson
Education.
U
A first course in Fuzzy Logic-Hung T Nguyen and Elbert A Walker,
CRC. Press Taylor and Francis Group.
Artificial Intelligence and Intelligent Systems,N.P.Padhy, Oxford Univ.
Press.
Outcomes:
i t y
Ability to build intelligent machines using soft computing techniques
r s
Ability to apply fuzzy logic to handle uncertainty problems.
Ability to apply neural networks for classifications.
e
n i v
U
Objectives:
(ELECTIVE – I)
te s
To learn Ontology Engineering
To learn Semantic Web Applications, Services and Technology
To learn Social Network Analysis and semantic web
d a
UNIT- I
U p
Thinking and Intelligent Web Applications, The Information Age ,The World
Wide Web, Limitations of Today’s Web, The Next Generation Web.
Machine Intelligence, Artificial Intelligence, Ontology, Inference engines,
y
Software Agents, Berners-Lee www, Semantic Road Map, Logic on the
t
semantic Web.
i
UNIT- II
s
Ontologies and their role in the semantic web, Ontologies Languages for
the Semantic Web –Resource Description Framework(RDF) / RDF Schema,
e r
Ontology Web Language(OWL),UML,XML/XML Schema.
Ontology Engineering, Constructing Ontology, Ontology Development Tools,
Ontology Methods, Ontology Sharing and Merging, Ontology Libraries and
v
Ontology Mapping.
n i UNIT- III
Logic, Rule and Inference Engines. Semantic Web applications and services,
Semantic Search, e-learning, Semantic Bioinformatics, Knowledge Base.
UNIT- IV
U XML Based Web Services, Creating an OWL-S Ontology for Web Services,
Semantic Search Technology, Web Search Agents and Semantic Methods,
W hat is social Networks analysis, development of the social networks
analysis, Electronic Sources for Network Analysis – Electronic Discussion
networks.
UNIT- V
Blogs and Online Communities, Web Based Networks. Building Semantic
Web Applications with social network features.
TEXT BOOKS:
1. Thinking on the W eb - Berners Lee,Godel and Turing, W iley
interscience,2008.
2. Social Networks and the Semantic Web ,Peter Mika,Springer,2007.
s
REFERENCE BOOKS:
1. Semantic Web Technologies, Trends and Research in Ontology
te
Based Systems, J.Davies, Rudi Studer, Paul Warren, John Wiley &
Sons.
a
2. Semantic Web and Semantic Web Services -Liyang Lu Chapman
and Hall/CRC Publishers,(Taylor & Francis Group)
d
3. Information Sharing on the semantic Web - Heiner Stuckenschmidt;
Frank Van Harmelen, Springer Publications.
4.
Outcomes:
U p
Programming the Semantic Web, T.Segaran, C.Evans, J.Taylor,
O’Reilly, SPD.
i t y
Ability to create ontology.
Ability to build a blogs and social networks
e r s
n i v
U
UNIT – I
(ELECTIVE-I)
te s
Allocation: Linear Programming Problem Formulation – Graphical solution
– Simplex method – Artificial variables techniques: Two–phase method, Big-
M method.
d a
p
UNIT – II
Transportation Problem – Formulation – Optimal solution, unbalanced
transportation problem – Degeneracy.
y U
Assignment problem – Formulation – Optimal solution - Variants of
t
Sequencing – Introduction – Flow –Shop sequencing – n jobs through two
i
machines – n jobs through three machines – Job shop sequencing – two
jobs through ‘m’ machines
s
r
Replacement: Introduction – Replacement of items that deteriorate with
time – when money value is not counted and counted – Replacement of
e
items that fail completely- Group Replacement.
v
UNIT – IV
i
Theory of Games: Introduction –Terminology– Solution of games with saddle
points and without saddle points- 2 x 2 games – dominance principle – m x
n
2 & 2 x n games -graphical method.
Inventory: Introduction – Single item, Deterministic models – Purchase
inventory models with one price break and multiple price breaks –Stochastic
te s
a
1. Introduction to O.R /Taha/PHI
2. Operations Research/ NVS Raju/ SMS Education/3rd Revised Edition
3.
4.
5.
Operations Research /A.M.Natarajan, P.Balasubramaniam, A.
Tamilarasi/Pearson Education.
p
Operations Research / Wagner/ PHI Publications.
d
Operations Research/M.V. Durga Prasad, K, Vijaya Kumar Reddy, J.
Suresh Kumar/ Cengage Learning.
y U
s i t
e r
n i v
U
Objectives:
(Elective-II)
te s
given costs. For achieving this goal, models are required for determining
target values and for continuously controlling these values. This course
focuses on principles, techniques, methods & tools for model-based
d a
p
management of software projects, assurance of product quality and process
adherence (quality assurance), as well as experience-based creation &
improvement of models (process management). The goals of the course
can be characterized as follows:
1.
U
Understanding the specific roles within a software organization as
y
related to project and process management
2.
3.
t
Understanding the basic infrastructure competences (e.g., process
i
modeling and measurement)
s
Understanding the basic steps of proj ect planning, proj ect
r
management, quality assurance, and process management and their
relationships
i v
UNIT- I
e
Conventional Software Management: The waterfall model, conventional
software Management performance. Evolution of Software Economics:
Software Economics, pragmatic software cost estimation.
U n UNIT- II
Improving Software Economics: Reducing Software product size, improving
software processes, improving team effectiveness, improving automation,
Achieving required quality, peer inspections.
The old way and the new: The principles of conventional software engineering,
principles of modern software management, transitioning to an iterative
process.
UNIT- III
Life cycle phases: Engineering and production stages, inception, Elaboration,
construction, transition phases.
s
Work Flows of the process : Software process workflows, Inter trans
workflows. Checkpoints of the Process : Major Mile Stones, Minor Milestones,
te
Periodic status assessments. Iterative Process Planning: Work breakdown
structures, planning guidelines, cost and schedule estimating, Interaction
planning process, Pragmatic planning.
d a
Project Organizations and Responsibilities : Line-of-Business Organizations.
p
Process Automation : Automation Building Blocks, The Project Environment.
UNIT- V
Project Control and Process instrumentation : The server care Metrics,
U
Management indicators, quality indicators, life cycle expectations pragmatic
Software Metrics, Metrics automation. Tailoring the Process: Process
discriminants, Example.
y
generation .
s t
Future Software Project Management : Modern Project Profiles Next
i
Software economics, modern Process transitions.
r
Case Study : The Command Centre Processing and Display System-
Replacement(CCPDS-R).
i v
TEXT BOOKS:
1.
2. e
Software Project Management, Walker Royce, Pearson Education.
Software Project Management, Bob Hughes & Mike Cotterell, fourth
n
edition,Tata Mc-Graw Hill.
REFERENCE BOOKS:
U
1. Applied Software Project Management, Andrew Stellman & Jennifer
Greene,O’Reilly, 2006
2. Head First PMP, Jennifer Greene & Andrew Stellman, O’Reilly,2007
3. Software Engineering Project Managent, Richard H. Thayer & Edward
Yourdon, second edition, Wiley India, 2004.
4. Agile Project Management, Jim Highsmith, Pearson education, 2004
5. The art of Project management, Scott Berkun, O’Reilly, 2005.
6. Software Project Management in Practice, Pankaj Jalote, Pearson
Education,2002.
Outcomes:
At the end of the course, the student shall be able to:
Describe and determine the purpose and importance of project
management from the perspectives of planning, tracking and
s
completion of project.
Compare and differentiate organisation structures and project
te
structures.
Implement a project to manage project schedule, expenses and
a
resources with the application of suitable project management tools.
p d
y U
s i t
e r
n i v
U
Objectives:
(Elective- II)
te s
UNIT- I
To make the student present the content graphically.
d
Introduction: Application areas of Computer Graphics, overview of graphics
a
p
systems, video-display devices, raster-scan systems, random scan systems,
graphics monitors and work stations and input devices
Output primitives: Points and lines, line drawing algorithms, mid-point
U
circle and ellipse algorithms. Filled area primitives: Scan line polygon fill
algorithm, boundary-fill and flood-fill algorithms.
UNIT- II
y
t
2-D Geometrical transforms: Translation, scaling, rotation, reflection and
i
shear transformations, matrix representations and homogeneous
coordinates, composite transforms, transformations between coordinate
systems.
r s
2-D Viewing: The viewing pipeline, viewing coordinate reference frame,
window to view-port coordinate transformation, viewing functions, Cohen-
e
Sutherland and Cyrus-beck line clipping algorithms, Sutherland –Hodgeman
v
polygon clipping algorithm.
i
UNIT- III
3-D Object representation: Polygon surfaces, quadric surfaces, spline
n
representation, Hermite curve, Bezier curve and B-spline curves, Bezier and
B-spline surfaces, sweep representations, octrees BSP Trees,
3-D Geometric transformations: Translation, rotation, scaling, reflection
UNIT- V
Computer animation: Design of animation sequence, general computer
animation functions, raster animation, computer animation languages, key
frame systems, motion specifications
TEXT BOOKS:
1.
2.
“Computer Graphics C version”, Donald Hearn and M. Pauline Baker,
Pearson education.
“Computer Graphics Second edition”, Zhigand xiang, Roy Plastock,
Schaum’s outlines, Tata Mc Graw hill edition.
te s
a
REFERENCE BOOKS:
1. “Computer Graphics Principles & practice”, second edition in C, Foley,
2.
3.
VanDam, Feiner and Hughes, Pearson Education.
p d
“Procedural elements for Computer Graphics”, David F Rogers, Tata
U
TMH.
4. “Principles of Computer Graphics”, Shalini, Govil-Pai, Springer.
5. “Computer Graphics”, Steven Harrington, TMH
6.
7.
y
Computer Graphics, F.S.Hill, S.M.Kelley, PHI.
t
Computer Graphics, P.Shirley, Steve Marschner & Others, Cengage
Learning.
i
s
8. Computer Graphics & Animation, M.C.Trivedi, Jaico Publishing House.
r
9. An Integrated Introduction to Computer Graphics and Geometric
Modelling, R.Goldman, CRC Press, Taylor&Francis Group.
i v
10.
e
Computer Graphics, Rajesh K.Maurya, Wiley India.
Outcomes:
Students can animate scenes entertainment.
Will be able work in computer aided design for content presentation.
n
Better analogy data with pictorial representation.
Objectives:
(Elective - II)
te s
a
traditional „keyboard and mouse“ computing; become familiar with the
vocabulary associated with sensory and cognitive systems as relevant to
task performance by humans; be able to apply models from cognitive
psychology to predicting user performance in various human-computer
p
interaction tasks and recognize the limits of human performance as they
apply to computer operation; appreciate the importance of a design and d
U
evaluation methodology that begins with and maintains a focus on the user;
be familiar with a variety of both conventional and non-traditional user
interface paradigms, the latter including virtual and augmented reality, mobile
y
and wearable computing, and ubiquitous computing; and understand the
t
social implications of technology and their ethical responsibilities as engineers
i
in the design of technological systems. Finally, working in small groups on a
product design from start to finish will provide you with invaluable team-work
experience.
UNIT- I
e r s
Introduction: Importance of user Interface – definition, importance of good
design. Benefits of good design. A brief history of Screen design.
U
characteristics human consideration, Human interaction speeds,
understanding business junctions.
Screen Designing:- Design goals – Screen planning and purpose, organizing
screen elements, ordering of screen data and content – screen navigation
and flow – Visually pleasing composition – amount of information – focus
and emphasis – presentation information simply and meaningfully –
information retrieval on web – statistical graphics – Technological
consideration in interface design.
UNIT- III
Windows – New and Navigation schemes selection of window, selection of
devices based and screen based controls.
Components – text and messages, Icons and increases – Multimedia, colors,
uses problems, choosing colors.
UNIT- IV
Software tools – Specification methods, interface – Building Tools.
UNIT- V
te s
a
Interaction Devices – Keyboard and function keys – pointing devices – speech
recognition digitization and generation – image and video displays – drivers.
TEXT BOOKS:
1.
2.
p d
The essential guide to user interface design, Wilbert O Galitz, Wiley
DreamTech.
Designing the user interface. 3rd Edition Ben Shneidermann, Pearson
U
Education Asia.
REFERENCE BOOKS:
y
1. Human – Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd,
t
Abowd, Russell Bealg, Pearson Education
i
2. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech.
s
3. User Interface Design, Soren Lauesen , Pearson Education.
r
4. Human –Computer Interaction,D.R.Olsen, Cengage Learning.
5. Human –Computer Interaction, Smith - Atakan, Cengage Learning.
i v
Outcomes:
e
Ability to apply HCI and principles to interaction design.
Ability to design certain tools for blind or PH people.
U n
s
(Elective – II)
Objectives:
te
The course demonstrates an in depth understanding of the tools and the
scripting languages necessary for design and development of applications
a
dealing with Bio-information/ Bio-data. The instructor is advised to discuss
examples in the context of Bio-data/ Bio-information application development.
d
UNIT – I
Introduction to PERL and Scripting: Scripts and Programs, Origin of
p
Scripting , Scripting Today, Characteristics of Scripting Languages, Uses for
Scripting Languages, W eb Scripting, and the universe of Scripting
Languages. PERL- Names and Values, Variables, Scalar Expressions,
expressions, subroutines.
UNIT – II
y U
Control Structures, arrays, list, hashes, strings, pattern and regular
t
Advanced perl: Finer points of looping, pack and unpack, filesystem, eval,
i
data structures, packages, modules, objects, interfacing to the operating
system, Creating Internet ware applications, Dirty Hands Internet
PHP Basics
s
Programming, security Issues.
r
PHP Basics- Features, Embedding PHP Code in your Web pages, Outputting
e
the data to the browser, Datatypes, Variables, Constants, expressions, string
v
interpolation, control structures . Function, Creating a Function, Function
i
Libraries, Arrays, strings and Regular Expressions.
UNIT – III
n
Advanced PHP Programming: PHP and W eb Forms, Files, PHP
Authentication and Methodologies -Hard Coded, File Based, Database
Based, IP Based, Login Administration, Uploading Files with PHP, Sending
U Email using PHP, PHP Encryption Functions, the Mcrypt package, Building
Web sites for the World.
UNIT – IV
TCL : TCL Structure, syntax, Variables and Data in TCL, Control Flow, Data
Structures, input/output, procedures , strings , patterns, files, Advance TCL-
eval, source, exec and uplevel commands, Name spaces, trapping errors,
event driven programs, making applications internet aware, Nuts and Bolts
Internet Programming, Security Issues, C Interface.
Tk-Visual Tool Kits, Fundamental Concepts of Tk, Tk by example, Events
te s
a
2. Python Web Programming , Steve Holden and David Beazley, New
Riders Publications.
3.
Publications (Dream tech.).
REFERENCE BOOKS:
1.
p
Open Source Web Development with LAMP using Linux, Apache,d
Beginning PHP and MySQL , 3rd Edition , Jason Gilmore, Apress
U
MySQL, Perl and PHP, J.Lee and B.Ware(Addison Wesley) Pearson
Education.
2. Programming Python,M.Lutz,SPD.
3.
4.
y
PHP 6 Fast and Easy Web Development, Julie Meloni and Matt Telles,
t
Cengage Learning Publications.
i
PHP 5.1, I.Bayross and S.Shah, The X Team, SPD.
s
5. Core Python Programming, Chun, Pearson Education.
r
Outcomes:
Ability to understand the differences between scripting languages.
i v
e
Ability to apply your knowledge of the weaknesses of scripting
languages to select implementation.
Master an understanding of python especially the object oriented
concepts
U n
Objectives:
(Elective-II)
te s
a
In order to understand the objectives of computer forensics, first of
all, people have to recognize the different roles computer plays in a
certain crime.
d
p
According to a snippet from the United States Security Service, the
functions computer has in different kinds of crimes.
UNIT – I
U
Computer Forensics Fundamentals: What is Computer Forensics?, Use
of Computer Forensics in Law Enforcement, Computer Forensics Assistance
y
to Human Resources/Employment Proceedings, Computer Forensics
t
Services, Benefits of Professional Forensics Methodology, Steps taken by
i
Computer Forensics Specialists
s
Types of Computer Forensics Technology: Types of Military Computer
Forensic Technology, Types of Law Enforcement – Computer Forensic
r
Technology – Types of Business Computer Forensic Technology
e
Computer Forensics Evidence and Capture: Data Recovery Defined –
Data Back-up and Recovery – The Role of Back-up in Data Recovery – The
v
Data-Recovery Solution
n i UNIT – II
Evidence Collection and Data Seizure: Why Collect Evidence? Collection
Options – Obstacles – Types of Evidence – The Rules of Evidence – Volatile
Evidence – General Procedure – Collection and Archiving – Methods of
U
Collection – Artifacts – Collection Steps – Controlling Contamination: The
Chain of Custody
Duplication and Preservation of Digital Evidence: Preserving the Digital
Crime Scene – Computer Evidence Processing Steps – Legal Aspects of
Collecting and Preserving Computer Forensic Evidence
Computer Image Verification and Authentication: Special Needs of
Evidential Authentication – Practical Consideration – Practical Implementation
UNIT – III
Computer Forensics analysis and validation: Determining what data to
te s
a
evidence, obtaining a digital hash, reviewing a case
UNIT – IV
p
E-Mail Investigations: Exploring the role of e-mail in investigation, exploring
U
the roles of the client and server in e-mail, investigating e-mail crimes and
violations, understanding e-mail servers, using specialized e-mail forensic
tools
i t y
Cell phone and mobile device forensics: Understanding mobile device
forensics, understanding acquisition procedures for cell phones and mobile
devices.
UNIT – V
r s
Working with Windows and DOS Systems: understanding file systems,
exploring Microsoft File Structures, Examining NTFS disks, Understanding
e
whole disk encryption, windows registry, Microsoft startup tasks, MS-DOS
v
start up tasks, virtual machines.
i
TEXT BOOKS:
1. Computer Forensics, Computer Crime Investigation by John R. Vacca,
U n 2.
1.
Firewall Media, New Delhi.
Computer Forensics and Investigations by Nelson, Phillips Enfinger,
Steuart, CENGAGE Learning
REFERENCE BOOKS:
Real Digital Forensics by Keith J. Jones, Richard Bejtlich, Curtis W.
Rose, Addison- Wesley Pearson Education
2. Forensic Compiling, A Tractitioneris Guide by Tony Sammes and Brian
Jenkinson, Springer International edition.
3. Computer Evidence Collection & Presentation by Christopher L.T.
Brown, Firewall Media.
4. Homeland Security, Techniques & Technologies by Jesus Mena,
Firewall Media.
5. Software Forensics Collecting Evidence from the Scene of a Digital
Crime by Robert M.Slade, TMH 2005
6. Windows Forensics by Chad Steel, Wiley India Edition.
s
Outcomes:
Students will be understanding the usage of computers in forensic,
te
and how to use various forensic tools for a wide variety of
investigations.
a
It gives an opportunity to students to continue their zeal in research
in computer forensics
p d
y U
s i t
e r
n i v
U
te s
Understand the procedure to write test plan and execution.
Understand different software testing tools and their features
CASE TOOLS LAB
d a
is given below.
UML diagrams to be developed are:
U p
Students are divided into batches of 5 each and each batch has to
draw the following diagrams using UML for an ATM system whose description
y
1. Use Case Diagram.
t
2. Class Diagram.
i
3. Sequence Diagram.
s
4. Collaboration Diagram.
r
5. State Diagram
6. Activity Diagram.
i v
7.
8.
9. e
Component Diagram
Deployment Diagram.
Test Design.
n
Description for an ATM System
The software to be designed will control a simulated automated teller machine
(ATM) having a magnetic stripe reader for reading an ATM card, a customer
U console (keyboard and display) for interaction with the customer, a slot for
depositing envelopes, a dispenser for cash (in multiples of Rs. 100, Rs. 500
and Rs. 1000), a printer for printing customer receipts, and a key-operated
switch to allow an operator to start or stop the machine. The ATM will
communicate with the bank’s computer over an appropriate communication
link. (The software on the latter is not part of the requirements for this
problem.)
The ATM will service one customer at a time. A customer will be required to
insert an ATM card and enter a personal identification number (PIN) - both
of which will be sent to the bank for validation as part of each transaction.
The customer will then be able to perform one or more transactions. The
card will be retained in the machine until the customer indicates that he/she
desires no further transactions, at which point it will be returned - except as
noted below.
The ATM must be able to provide the following services to the customer:
1. A customer must be able to make a cash withdrawal from any suitable
account linked to the card, in multiples of Rs. 100 or Rs. 500 or Rs.
1000. Approval must be obtained from the bank before cash is
dispensed.
te s
a
2. A customer must be able to make a deposit to any account linked to
the card, consisting of cash and/or checks in an envelope. The
p
by an operator. Approval must be obtained from the bank before
physically accepting the envelope. d
customer will enter the amount of the deposit into the ATM, subject to
manual verification when the envelope is removed from the machine
U
3. A customer must be able to make a transfer of money between any
two accounts linked to the card.
4. A customer must be able to make a balance inquiry of any account
5.
linked to the card.
i t y
A customer must be able to abort a transaction in progress by pressing
the Cancel key instead of responding to a request from the machine.
r s
The ATM will communicate each transaction to the bank and obtain verification
that it was allowed by the bank. Ordinarily, a transaction will be considered
complete by the bank once it has been approved. In the case of a deposit, a
e
second message will be sent to the bank indicating that the customer has
deposited the envelope. (If the customer fails to deposit the envelope within
U
will be permanently retained by the machine, and the customer will have to
contact the bank to get it back.
If a transaction fails for any reason other than an invalid PIN, the ATM will
display an explanation of the problem, and will then ask the customer whether
he/she wants to do another transaction.
The ATM will provide the customer with a printed receipt for each successful
transaction
The ATM will have a key-operated switch that will allow an operator to start
and stop the servicing of customers. After turning the switch to the „on“
position, the operator will be required to verify and enter the total cash on
hand. The machine can only be turned off when it is not servicing a customer.
When the switch is moved to the „off“ position, the machine will shut down,
so that the operator may remove deposit envelopes and reload the machine
with cash, blank receipts, etc.
Outcomes:
Ability to understand the history, cost of using and building CASE
tools.
Ability to construct and evaluate hybrid CASE tools by integrating
te s
a
existing tools.
Ability to deliver the product with qualitative.
SOFTWARE TESTING LAB
List of Experiments
1.
p
Write programs in ‘C’ Language to demonstrate the working of thed
U
following constructs:
i) do...while ii) while….do iii) if…else iv) switch v) for
2. “A program written in ‘C’ language for Matrix Multiplication fails”
3.
reasons for its failure.
i y
Introspect the causes for its failure and write down the possible
t
Take any system (e.g. ATM system) and study its system specifications
s
and report the various bugs.
r
4. W rite the test cases for any known application (e.g. Banking
application)
i v
5.
6.
7.
e
Create a test plan document for any application (e.g. Library
Management System)
Study of any testing tool (e.g. Win runner)
Study of any web testing tool (e.g. Selenium)
U n 8.
9.
10.
11.
Study of any bug tracking tool (e.g. Bugzilla, bugbit)
Study of any test management tool (e.g. Test Director)
Study of any open source-testing tool (e.g. Test Link)
Take a mini project (e.g. University admission, Placement Portal) and
execute it. During the Life cycle of the mini project create the various
testing documents* and final test report document.
*Note: To create the various testing related documents refer to the text
“Effective Software Testing Methodologies by W illiam E. Perry”
te s
Week - 2 Working with J2ME Features
Week - 3 Threads & High Level UI
Week - 4 Working on Drawing and Images
d a
Week - 7 & 8 Web Application using J2ME
Outcomes:
U p
Week - 5 Developing Networked Applications using the Wireless Toolkit
Week - 6 Authentication with a Web Server
1.
2.
y
Ability to install J2ME toolkit.
t
Ability to develop the user interface and authenticate with a Web
Server..
i
3.
s
Ability to design Web application using J2ME.
r
Mobile Application Development (Through J2ME) LABORATORY
Objective:
e
In this lab, a student is expected to design, implement, document and present
v
a mobile client/server system using standard Java and Java 2 Micro Edition
i
(J2ME) platform. Specifically it is required to design and implement a system
that consists mainly of a mobile client (MC) and a Proxy Server (PS). MC will
n
be written in J2ME, MIDP 2.0, while PS will be written in standard Java. It is
necessary to use a mobile phone emulator to develop and demonstrate the
experiments.
te s
a
and run the following program in the toolkit.
Steps to run this program in toolkit:
1.
2.
3.
Start -> All Programs -> Sun Java Tool Kit -> Wireless Tool Kit
p
Click New Project – Enter Project Name -> Enter Class Name ->
Click on Create Project.
Choose appropriate API Selection and Configurations.
d
4.
5.
6.
Build the Project.
Run the Project.
y U
Place Java Source file in WTK2.1 / WTK2.2\ apps\ projectname\ src
i t
import javax.microedition.lcdui.*;
import javax.microedition.midlet.*;
s
public class HelloWorld extends MIDlet{
e r
private Form form;
private Display display;
v
public HelloWorld(){
i
super();
}
U n public void startApp(){
form = new Form(“Hello World”);
String msg = ”Hello World!!!!!!!”;
form.append(msg);
display = Display.getDisplay(this);
display.setCurrent(form);
}
public void pauseApp(){}
public void destroyApp(boolean unconditional){
notifyDestroyed();
}
}
Week - 2 Working with J2ME Features:
W orking with J2ME Features: Say, creating a Hello World program
Experiment with the most basic features and mobile application interaction
concepts (lists, text boxes, buttons, radio boxes, soft buttons, graphics, etc)
2.1 Create a program which creates to following kind of menu.
* cut
te s
a
* copy
* past
* delete
* select all
* unselect all
2.2 Event Handling.
p d
Create a menu which has the following options:
* cut - can be on/off
* copy - can be on/off
y U
t
* paste - can be on/off
i
* delete - can be on/off
* select all - put all 4 options on
s
* unselect all - put all 4 options off
r
2.3. Input checking
Create an MIDP application which examine, that a phone number, which a
i v e
user has entered is in the given format.
* Area code should be one of the following: 040, 041, 050, 0400, 044
* There should 6-8 numbers in telephone number (+ area code)
U n
Week - 3 Threads & High Level UI:
3.1. Create a slide show which has three slides, which includes only text.
Program should change to the new slide after 5 seconds. After the third
te s
3.2 High-level UI
d a
p
Create a MIDP application, which show to the user 5-10 quiz questions. All
questions have 4 possible options and one right option exactly. Application
counts and shows to the user how many right answers were right and shows
them to user.
y U
s i t
e r
n i v3.3 Create a MIDP application, where the user can enter player name and
points. The program saves the information to the record using RMS at MIDP
device. Program should also print out the top 10 player list to the end user.
You can use this class in your game if you made own class for saving and
reading record sets.
te s
d a
values can be given at int[] array.
U p
4.2 Create a MIDP application, which draws a bar graph to the display. Data
i t y
e r s
4.3 Create a MIDP application, which draws a bar graph to the display. Data
values can be given at int[] array. You can enter four data (integer) values to
v
the input text field.
n i
U Week - 5 Developing Networked Applications using the Wireless Toolkit
Creating a Simple Client-Server Application
Create, compile and run a basic UDP-based client-server application.
s
3) Enter project name as ‘DatagramServer’. Enter MIDlet name as
‘DatagramServer’. Note that the Midlet name is the same as the name of
te
the class in the source code, which extends the MIDlet class, otherwise the
application won’t run.
a
4) Another window pops up where it is required to select a target platform.
Select ‘MIDP 1.0’ from the drop down list.
d
5) After clicking OK, the project is created; and the Wireless Toolkit tells that
the name of the folder where source code files are created. The path of the
p
source code folder is displayed in the debug output window.
Creating and Compiling the DatagramServer source files
U
The Wireless Toolkit does not come with an IDE by default so Use any IDE
or a text editor like Notepad.
1) Create a new text file called DatagramServer.java in the source folder of
window.
2)
i y
the project. The exact path of this folder is displayed in the Wireless Toolkit
t
Paste contents DatagramServer.java from into the source file.
1)
2)
r s
Running your Server application on the Phone simulator
After compiling the project successfully, click on the Run button in
the Wireless Toolkit window.
e
A graphical window depicting a phone handset will appear with the
v
name of your application highlighted on its screen as shown below.
n i 3)
4)
To start the application, click on the right soft-key (marked with a dot)
below the ‘Launch’ command.
The phone simulator might ask if it is OK to run the network application.
Select ‘Yes’ by clicking on the appropriate soft-key. The server is
U
now up and running.
5) Keep the server running during the creation, compilation and running
of the Datagram Client application.
Creating the DatagramClient project
1) Use the same instance of the Wireless Toolkit that is used for creating
and compiling the Datagram Server project.
2) Click on ‘New Project...’ button.
3) A new window pops up. Enter project name as ‘DatagramClient’.
Enter MIDlet name as ‘DatagramClient’. Note that the Midlet name
is the same as the name of the class in the source code, which extends
the MIDlet class.
4) Another window pops up where one has to select a target platform.
Select ‘MIDP 1.0’ from the drop down list.
5) After clicking OK, the project is created and the Wireless Toolkit tells
1)
where to place the source code files. The path of the source code
folder is displayed in the debug output window as explained before.
Creating and Compiling the DatagramClient source files
Create a new text file called DatagramClient.java in the source folder
te s
2)
3)
of the project.
Paste contents DatagramClient.java into the source file.
d a
Then click on the Build button in the Wireless Toolkit window. If the
p
compilation is OK, it will say Build Complete in the window’s debug
output window, otherwise it will show the errors. Note: In the source
code, use the System.out.println() statement to output debug
1)
information to this window.
y U
Running your Client application on the Phone simulator
After compiling the project successfully, click on the Run button in
t
the Wireless Toolkit window.
2)
3)
i
A graphical window depicting a phone handset will appear with the
s
name of the application highlighted on its screen.
r
To start the application, click on the right soft-key (marked with a dot)
below the ‘Launch’ command.
i v
4)
5) e
The phone simulator might ask if it is OK to run the network application.
Select ‘Yes’ by clicking on the appropriate soft-key. The client is now
up and running.
When the client executes on the phone simulator, one should see a
n
text box with the caption ‘Message’. Enter any message and press
the right soft-key (corresponding to Send). If the client-server
application is working properly, the screen of the server phone will
U
display the message sent by the client and the client screen will now
display a message sent by the server in response. The response
message from the server is the original client message in reverse.
6) Try various features of the phone simulator including the different
look-and feel options.
Week - 6 Authentication with a Web Server
6.1 Write a sample program to show how to make a SOCKET Connection
from j2me phone.
This J2ME sample program shows how to how to make a SOCKET
te s
Note: Use Apache Tomcat Server as Web Server and Mysql as Database
Server.
Week - 7 & 8 Web Application using J2ME
d a
p
The following should be carried out with respect to the given set of application
domains: (Assume that the Server is connected to the well-maintained
database of the given domain. Mobile Client is to be connected to the Server
and fetch the required data value/information)
Students Marks Enquiry
Town/City Movie Enquiry
y U
i t
Railway/Road/Air (For example PNR) Enquiry/Status
Sports (say, Cricket) Update
s
Town/City Weather Update
r
Public Exams (say Intermediate or SSC)/ Entrance (Say EAMCET)
Results Enquiry
i v e
Divide Students into Batches and suggest them to design database according
to their domains and render information according to their requests.
U n
te s
marketing, Human resource Management, product management and
strategy.
UNIT -I:
d a
p
Introduction to Management and Organisation: Concepts of Management
and organization- nature, importance and Functions of Management,
Systems Approach to Management - Taylor’s Scientific Management Theory
U
– Fayal’s Principles of Management – Maslow’s theory of Hierarchy of Human
Needs – Douglas McGregor’s Theory X and Theory Y – Hertzberg Two Factor
y
Theory of Motivation - Leadership Styles, Social responsibilities of
t
Management. Designing Organisational Structures: Basic concepts related
i
to Organisation - Departmentation and Decentralisation, Types and
s
Evaluation of mechanistic and organic structures of organisation and
suitability.
UNIT -II:
e r
Operations and Marketing Management: Principles and Types of Plant
Layout-Methods of production (Job, batch and Mass Production), Work Study
U
Management and Stores Records – JIT System, Supply Chain Management,
Functions of Marketing, Marketing Mix, and Marketing Strategies based on
Product Life Cycle, Channels of distribution.
UNIT -III:
Human Resources Management (HRM): Concepts of HRM, HRD and
Personnel Management and Industrial Relations (PMIR), HRM vs PMIR,
Basic functions of HR Manager: Manpower planning, Recruitment, Selection,
Training and Development, Placement, Wage and Salary Administration,
Promotion, Transfer, Separation, Performance Appraisal, Grievance Handling
s
Evaluation and Review Technique (PERT), Critical Path Method (CPM),
Identifying critical path, Probability of Completing the project within given
te
time, Project Cost Analysis, Project Crashing (simple problems).
UNIT -V:
a
Strategic Management and Contemporary Strategic Issues: Mission,
Goals, Objectives, Policy, Strategy, Programmes, Elements of Corporate
d
Planning Process, Environmental Scanning, Value Chain Analysis, SWOT
Analysis, Steps in Strategy Formulation and Implementation, Generic
TEXT BOOKS:
1.
U p
Strategy alternatives. Bench Marking and Balanced Score Card as
Contemporary Business Strategies.
y
New Delhi, 2004
t
2. P. Vijaya Kumar, N. Appa Rao and Ashima B. Chhalill, Cengage
i
Learning India Pvt Ltd, 2012.
s
REFERENCE BOOKS:
r
1. Kotler Philip and Keller Kevin Lane: Marketing Management, Pearson,
2012.
i v
2.
3.
4.
e
Koontz and Weihrich: Essentials of Management, McGraw Hill, 2012.
Thomas N.Duening and John M.Ivancevich Management—Principles
and Guidelines, Biztantra, 2012.
Kanishka Bedi, Production and Operations Management, Oxford
U n 5.
6.
7.
University Press, 2012.
Samuel C.Certo: Modern Management, 2012.
Schermerhorn, Capling, Poole and Wiesner: Management, W iley,
2012.
Parnell: Strategic Management, Cengage,2012.
8. Lawrence R Jauch, R.Gupta andWilliam F.Glueck: Business Policy
and Strategic Management, Frank Bros.2012.
9. Aryasri: Management Science, McGraw Hill, 2012
Outcomes:
By the end of the course, the student will be in a position to
s
ensure quality for a given product or service
te
plan and control the HR function better
plan, schedule and control projects through PERT and CPM
evolve a strategy for a business or service organisation
d a
U p
i t y
e r s
n i v
U
Objectives:
(Elective – III)
te s
To explore interoperability between different frameworks.
To learn basic concepts of SOA.
d a
To learn how to implement and deploy web service clients and servers.
UNIT- I
U p
Evolution and Emergence of Web Services - Evolution of distributed
computing, Core distributed computing technologies – client/server, CORBA,
JAVA RMI, Microsoft DCOM, MOM, Challenges in Distributed Computing,
role of J2EE and XML in distributed computing, emergence of Web Services
y
and Service Oriented Architecture (SOA).
t
Introduction to Web Services – The definition of web services, basic
i
operational model of web services, tools and technologies enabling web
s
services, benefits and challenges of using web services.
r
Web Services Architecture – W eb services Architecture and its
characteristics, core building blocks of web services, standards and
e
technologies available for implementing web services, web services
communication models, basic steps of implementing web services.
n i vUNIT- II
Core fundamentals of SOAP – SOAP Message Structure, SOAP encoding,
SOAP message exchange models, SOAP communication and messaging,
SOAP security.
Developing Web Services using SOAP – Building SOAP Web Services,
U developing SOAP Web Services using Java and Axis, limitations of SOAP.
UNIT- III
Describing Web Services – WSDL – WSDL in the world of Web Services,
Web Services life cycle, anatomy of W SDL definition document, W SDL
bindings, WSDL Tools, limitations of WSDL.
Discovering Web Services – Service discovery, role of service discovery
in a SOA, service discovery mechanisms, UDDI – UDDI Registries, uses of
UDDI Registry, Programming with UDDI, UDDI data structures, Publishing
API, Publishing, searching and deleting information in a UDDI Registry,
limitations of UDDI.
UNIT- IV
Web Services Interoperability – Means of ensuring Interoperability,
Overview of .NET, Creating a .NTE client for an Axis Web Service, Creating
java client for a web service, Challenges in Web Services Interoperability.
Web Services Security – XML security frame work, Goals of Cryptography,
Hash Cipher, Symmetric Cipher, Asymmetric Cipher, XML encryption, Digital
signature, Digital Certificate, XML Encryption, SAML, structure.
UNIT- V
te s
Overview of Service Oriented Architecture – SOA concepts, Key Service
Characteristics, Technical Benefits of a SOA.
SOA and Web Services – Web Services Platform, Service-Level Data
d a
p
Models, Discovery, Security and Interaction Patterns, Atomic and Composite
services, Service-level communication and alternative transports.
U
TEXT BOOKS:
1. Developing Java Web Services, R. Nagappan, R. Skoczylas, R.P.
Sriganesh, Wiley India, rp – 2008.
2.
3.
y
Understanding SOA with Web Services, Eric Newcomer and Greg
t
Lomow, Pearson Edition – 2009
i
Java Web Service Architecture, James McGovern, Sameer Tyagi et
s
al., Elsevier - 2009
r
REFERENCE BOOKS:
1. Building Web Services with Java, 2nd Edition, S. Graham and others,
i v
2.
3.
e
Pearson Edn., 2008.
Java Web Services, D.A. Chappell & T. Jewell, O’Reilly,SPD.
McGovern, et al., “Java W eb Services Architecture”, Morgan
Kaufmann Publishers, 2005.
U n 4.
5.
6.
7.
J2EE Web Services, Richard Monson-Haefel, Pearson Education.
Web Services, G. Alonso, F. Casati and others, Springer, 2005.
Developing Enterprise Web Services, S. Chatterjee, J. Webber,
Pearson Education, 2008.
XML, Web Services, and the Data Revolution, F.P.Coyle, Pearson
Education.
Outcomes:
Basic details of WSDL, UDDI, SOAP
Implement WS client and server with interoperable systems
Objectives:
(Elective – III)
te s
Identify several factors and web store requirements needed to
succeed in e-commerce.
d a
Discuss the benefits and trade-offs of various e-commerce clicks and
p
bricks alternatives.
Understand the main technologies behind e-commerce systems and
U
how these technologies interact.
Discuss the various marketing strategies for an online business.
Define various electronic payment types and associated security risks
UNIT - I
i y
and the ways to protect against them.
t
Electronic Commerce-Frame work, anatomy of E-Commerce applications,
applications.
s
E-Commerce Consumer applications, E-Commerce organization
r
Consumer Oriented Electronic commerce - Mercantile Process models.
UNIT - II
e
n i vElectronic payment systems - Digital Token-Based, Smart Cards, Credit
Cards, Risks in Electronic Payment systems.
Inter Organizational Commerce - EDI, EDI Implementation, Value added
networks.
UNIT - III
s
1. Frontiers of electronic commerce – Kalakata, Whinston, Pearson.
REFERENCES :
te
1. E-Commerce fundamentals and applications Hendry Chan, Raymond
Lee, Tharam Dillon, Ellizabeth Chang, John Wiley.
a
2. E-Commerce, S.Jaiswal – Galgotia.
3. E-Commerce, Efrain Turbon, Jae Lee, David King, H.Michael Chang.
4.
5.
Electronic Commerce – Gary P.Schneider – Thomson.
p
E-Commerce – Business, Technology, Society, Kenneth C.Taudon,
Carol Guyerico Traver.
Outcomes:
d
and their customers
y U
Ability to identify the business relationships between the organizations
s i t
e r
n i v
U
Objectives:
(Elective – III)
IT systems are more and more integrated with other software systems.
The knowledge of integrating these systems by using middleware
te s
technologies can be a key competence for IT engineers. Middleware
is commonly understood as an intermediary software layer between
the application and the operating system, which encapsulates the
d a
p
heterogeneity of the underlying communication network, operating
system or hardware platform.
This course provides details about the modern component platforms.
U
Based on practical examples, details about modern middleware
technologies are studied.
y
Students get the chance to gain in-depth knowledge popular
t
middleware platforms.
i
UNIT-I
s
Introduction to client server computing: Evolution of corporate computing
models from centralized to distributed computing, client server models.
r
Benefits of client server computing, pitfalls of client server programming.
e
UNIT-II
CORBA with Java: Review of Java concept like RMI, RMI API, JDBC. Client/
s
EJBs and CORBA: Object transaction monitors CORBA OTM’s, EJB and
CORBA OTM’s, EJB container frame work, Session and Entity Beans, The
te
EJB client/server development Process The EJB container protocol, support
for transaction EJB packaging EJB design Guidelines.
TEXT BOOKS :
1.
2.
Client/Server programming with Java and CORBA Robert Orfali and
Dan Harkey, John Wiley & Sons ,SPD 2nd Edition
Java programming with CORBA 3rd Edition, G.Brose, A Vogel and
d a
p
K.Duddy, Wiley-dreamtech, India John wiley and sons
REFERENCE BOOKS:
U
1. Distributed Computing, Principles and applications, M.L.Liu, Pearson
Education
2. Client/Server Survival Guide 3rd edition Robert Orfali Dan Harkey &
3.
4.
i t y
Jeri Edwards, John Wiley & Sons
Client/Server Computing D T Dewire, TMH.
IBM Webspere Starter Kit Ron Ben Natan Ori Sasson, TMh, New
5.
6.
Delhi
r s
Programming C#, Jesse Liberty, SPD-O’Reilly.
e
C# Preciesely Peter Sestoft and Henrik I. Hansen, Prentice Hall of
India
n i v7.
8.
9.
Intoduction to C# Using .NET Pearson Education
C# How to program, Pearson Education
C# and the .NET Platform Andrew Troelsen, Apress Wiley-dreamtech,
India Pvt Ltd
Outcomes:
U
Ability to design the integrated system with different software’s.
Ability to create simple interface between the software and hardware.
Objectives:
(Elective – III)
te s
UNIT- I
To understand the security of sensor networks
To understand the applications of adhoc and sensor networks
d a
U p
Introduction to Ad Hoc Wireless Networks: Characteristics of MANETs,
Applications of MANETs, Challenges.
Routing in MANETs: Topology-based versus Position-based approaches,
Topology based routing protocols, Position based routing, Other Routing
Protocols.
UNIT- II
i t y
Data Transmission in MANETs: The Broadcast Storm, Multicasting,
Geocasting
s
TCP over Ad Hoc Networks: TCP Protocol overview, TCP and MANETs,
r
Solutions for TCP over Ad Hoc
UNIT- III
e
Basics of Wireless Sensors and Applications: The Mica Mote, Sensing
U
UNIT- IV
Security : Security in Ad hoc Wireless Networks, Key Management, Secure
Routing, Cooperation in MANETs, Intrusion Detection Systems.
Sensor Network Platforms and Tools: Sensor Network Hardware, Sensor
Network Programming Challenges, Node-Level Software Platforms
UNIT- V
Operating System – TinyOS
Imperative Language: nesC, Dataflow style language: TinyGALS, Node-
te s
1.
2.
Murthy, B.S.Murthy, Pearson Education, 2004
d a
Adhoc Wireless Networks – Architectures and Protocols, C.Siva Ram
p
Cao, An Auerbach book, CRC Press, Taylor & Francis Group, 2010
3. Wireless Ad hoc Mobile Wireless Networks – Principles, Protocols
U
and Applications, Subir Kumar Sarkar, et al., Auerbach Publications,
Taylor & Francis Group, 2008.
4. Ad hoc Networking, Charles E.Perkins, Pearson Education, 2001.
5.
6.
y
Wireless Ad hoc Networking, Shih-Lin Wu, Yu-Chee Tseng, Auerbach
t
Publications, Taylor & Francis Group, 2007
i
Wireless Ad hoc and Sensor Networks – Protocols, Performance and
s
Control, Jagannathan Sarangapani, CRC Press, Taylor & Francis
r
Group, 2007, rp 2010.
7. Security in Ad hoc and Sensor Networks, Raheem Beyah, et al., World
i v
8.
9. e
Scientific Publications / Cambridge University Press, 2010
Ad hoc Wireless Networks – A communication-theoretic perspective,
Ozan K.Tonguz, Gialuigi Ferrari, Wiley India,2006, rp2009.
Wireless Sensor Networks – Signal processing and communications
n
perspectives, Ananthram Swami, et al., Wiley India, 2007, rp2009.
Outcomes:
U
Ability to understand the concept of ad-hoc and sensor networks,
their applications and typical node and network architectures.
Ability to design a protocol for wireless sensor networks
Ability to evaluate measurements of protocol performance in wireless
sensor networks
Objectives:
(Elective-IV)
te s
a
students with the basic concepts and techniques of interactive authoring. It
also introduces students with the advanced scripting skills necessary for
p d
implementing highly interactive, rich internet applications using multimedia
technologies and authoring tools. Students will develop aesthetic value and
competencies in multimedia authoring. Artistic visual style and layout design
are stressed, as well as the editing and integration of graphic images,
U
animation, video and audio files. The course allows students to master
industry-wide software and technologies to create highly interactive, rich
internet applications.
UNIT - I
t y
Fundamental concepts in Text and Image: Multimedia and hypermedia, World
i
Wide Web, overview of multimedia software tools. Graphics and image data
s
representation graphics/image data types, file formats, Color in image and
video: color science, color models in images, color models in video.
UNIT- II
e r
Fundamental concepts in video and digital audio: Types of video signals,
analog video, digital video, digitization of sound, MIDI, quantization and
n i vtransmission of audio.
Multimedia Data Compression: Lossless compression algorithms, Lossy
compression algorithms, Image compression standards.
UNIT- III
U
Basic Video compression techniques, Case study: MPEG Video Coding I,
Basic Audio compression techniques, Case study: MPEG Audio compression.
Web 2.0
W hat is web 2.0, Search, Content Networks, User Generated Content,
Blogging, Social Networking, Social Media, Tagging, Social Marking, Rich
Internet Applications, Web Services, Mashups, Location Based Services,
XML, RSS, Atom, JSON, and VoIP, Web 2.0 Monetization and Business
Models, Future of the Web.
UNIT - IV
Rich Internet Applications(RIAs) with Adobe Flash : Adobe Flash-
Introduction, Flash Movie Development, Learning Flash with Hands-on
Examples, Publish your flash movie, Creating special effects with Flash,
Creating a website splash screen, action script, web sources.
Rich Internet Applications(RIAs) with Flex 3 - Introduction, Developing
with Flex 3, Working with Components, Advanced Component Development,
Visual Effects and Multimedia.
UNIT - V
te s
Ajax- Enabled Rich Internet Application : Introduction, Traditional Web
a
Applications vs Ajax Applications, Rich Internet Application with Ajax, History
d
of Ajax, Raw Ajax example using xmlhttprequest object, Using XML, Creating
p
a full scale Ajax Enabled application, Dojo ToolKit.
TEXT BOOKS:
1. Fundamentals of Multimedia by Ze-Nian Li and Mark S. Drew PHI
2.
Learning, 2004
U
Professional Adobe Flex 3, Joseph Balderson, Peter Ent, et al, Wrox
y
Publications, Wiley India, 2009.
t
3. AJAX, Rich Internet Applications, and W eb Development for
i
Programmers, Paul J Deitel and Harvey M Deitel, Deitel Developer
s
Series, Pearson Education.
REFERENCE BOOKS:
1.
2.
e r
Multimedia Communications: Applications, Networks, Protocols and
Standards, Fred Halsall, Pearson Education, 2001, rp 2005.
Multimedia Making it work, Tay Vaughan, 7th edition, TMH, 2008.
n i v3.
4.
Introduction to multimedia communications and Applications,
Middleware, Networks, K.R.Rao, Zoran, Dragored, Wiley India, 2006,
rp. 2009.
Multimedia Computing, Communications & Applications, Ralf
Steinmetz and Klara Nahrstedt, Pearson Education, 2004
U 5.
6.
7.
8.
Principles of Multimedia, Ranjan Parekh, TMH, 2006.
Multimedia in Action, James E.Shuman, Cengage Learning, 198, rp
2008.
Multimedia Systems design, Prabhat K. Andleigh, Kiran Thakrar, PHI,
1986.
Multimedia and Communications Technology, Steve Heath, Elsevier,
1999, rp 2003.
9. Adobe Flash CS3 Professional, Adobe press, Pearson Education,
2007.
s
13. Flex 4 Cookbook, Joshua Noble, et.al, O’Reilly,SPD 2010.
14. Flex3 – A beginner’s guide, Michele E.Davis, Jon A.Phillips, TMH,
te
2008.
15. Mastering Dojo,R.Gill,C.Riecke and A.Russell,SPD.
a
Outcomes:
Ability to design a short films and teaching material for better
understanding.
p d
Ability to apply different multimedia development tools to produce
web based and stand-alone user interfaces.
y U
s i t
e r
n i v
U
Objectives:
(Elective- IV)
te s
To understand the notions of state space representation, exhaustive
a
search, heuristic search along with the time and space complexities.
To learn different knowledge representation techniques.
d
p
To understand the applications of AI: namely Game Playing, Theorem
Proving, Expert Systems, Machine Learning and Natural Language
Processing.
UNIT-I
U
Introduction, History, Intelligent Systems, Foundations of AI, Sub areas of
y
AI, Applications Problem Solving - State-Space Search and Control
t
Strategies: Introduction, General Problem Solving, Characteristics of
i
Problem, Exhaustive Searches, Heuristic Search Techniques, Iterative-
Deepening A*, Constraint Satisfaction Game Playing, Bounded Look-ahead
s
Strategy and use of Evaluation Functions, Alpha-Beta Pruning.
r
UNIT-II
Logic Concepts and Logic Programming: Introduction, Propositional Calculus,
i v e
Propositional Logic, Natural Deduction System, Axiomatic System, Semantic
Tableau System in Propositional Logic, Resolution Refutation in Propositional
Logic, Predicate Logic, Logic Programming.
Knowledge Representation: Introduction, Approaches to Knowledge
n
Representation, Knowledge Representation using Semantic Network,
Extended Semantic Networks for KR, Knowledge Representation using
Frames.
U UNIT-III
Expert System and Applications: Introduction, Phases in Building Expert
Systems, Expert System Architecture, Expert Systems vs Traditional Systems,
Truth Maintenance Systems, Application of Expert Systems, List of Shells
and Tools.
Uncertainty Measure - Probability Theory: Introduction, Probability Theory,
Bayesian Belief Networks, Certainty Factor Theory, Dempster-Shafer Theory.
UNIT-IV
Machine-Learning Paradigms: Introduction. Machine Learning Systems.
te s
a
Semantic Web.
Natural Language Processing: Introduction, Sentence Analysis Phases,
d
Grammars and Parsers, Types of Parsers, Semantic Analysis, Universal
Networking Knowledge.
TEXT BOOKS:
1.
2.
U p
Saroj Kaushik. Artificial Intelligence. Cengage Learning. 2011
Russell, Norvig: Artificial intelligence, A Modern Approach, Pearson
Education, Second Edition. 2004
y
REFERENCE BOOK:
t
1. Rich, Knight, Nair: Artificial intelligence, Tata McGraw Hill, Third Edition
i
2009.
Outcomes:
r s
Possess the ability to formulate an efficient problem space for a
problem expressed in English.
Possess the ability to select a search algorithm for a problem and
e
characterize its time and space complexities.
v
Possess the skill for representing knowledge using the appropriate
i
technique
Possess the ability to apply AI techniques to solve problems of Game
Objectives:
(Elective – IV)
te s
To become familiar with the SAN vendors and their products
To learn Fibre Channel protocols and how SAN components use them
to communicate with each other
d a
p
To become familiar with Cisco MDS 9000 Multilayer Directors and
Fabric Switches Thoroughly learn Cisco SAN-OS features.
U
To understand the use of all SAN-OS commands. Practice variations
of SANOS features
UNIT- I
y
Review data creation and the amount of data being created and understand
t
the value of data to a business, challenges in data storage and data
i
management, Solutions available for data storage, Core elements of a data
s
centre infrastructure, role of each element in supporting business activities
e r
Hardware and software components of the host environment, Key protocols
and concepts used by each component ,Physical and logical components
of a connectivity environment ,Major physical components of a disk drive
U
RAID 4, RAID 5, RAID 0+1, RAID 1+0, RAID 6, Compare and contrast
integrated and modular storage systems ,High-level architecture and working
of an intelligent storage system
Evolution of networked storage, Architecture, components, and topologies
of FC-SAN, NAS, and IP-SAN, Benefits of the different networked storage
options, understand the need for long-term archiving solutions and describe
how CAS fulfills the need, understand the appropriateness of the different
networked storage options for different application environments
UNIT- III
List reasons for planned/unplanned outages and the impact of downtime,
Impact of downtime, Differentiate between business continuity (BC) and
disaster recovery (DR) ,RTO and RPO, Identify single points of failure in a
storage infrastructure and list solutions to mitigate these failures.
UNIT- IV
Architecture of backup/recovery and the different backup/recovery topologies
, replication technologies and their role in ensuring information availability
and business continuity, Remote replication technologies and their role in
te s
a
providing disaster recovery and business continuity capabilities
UNIT- V
p
centre. Information security, Critical security attributes for information
U
systems, Storage security domains, List and analyzes the common threats
in each domain Virtualization technologies, block-level and file-level
virtualization technologies and processes.
Case Studies:
i t y
The technologies described in the course are reinforced with EMC examples
of actual solutions.
TEXT BOOK:
1.
e r s
Realistic case studies enable the participant to design the most appropriate
solution for given sets of criteria.
n i vREFERENCE BOOKS:
1.
2.
Robert Spalding, “Storage Networks: The Complete Reference“, Tata
McGraw Hill , Osborne, 2003.
Marc Farley, “Building Storage Networks”, Tata McGraw Hill,Osborne,
2001.
Objectives:
(Elective – IV)
te s
To understand a range of machine learning algorithms along with
their strengths and weaknesses.
To understand the basic theory underlying machine learning.
d a
p
UNIT – I
Introduction: An illustrative learning task, and a few approaches to it. What
U
is known from algorithms? Theory, Experiment. Biology. Psychology.
Concept Learning: Version spaces. Inductive Bias. Active queries. Mistake
bound/ PAC model. basic results. Overview of issues regarding data sources,
success criteria.
UNIT –II
i t y
Decision Tree Learning: - Minimum Description Length Principle. Occam’s
s
razor. Learning with active queries
r
Neural Network Learning: Perceptions and gradient descent back
propagation.
i v
UNIT –III
e
Sample Complexity and Over fitting: Errors in estimating means. Cross
Validation and jackknifing VC dimension. Irrelevant features: Multiplicative
rules for weight tuning.
2. Trevor Has tie, Robert Tibshirani & Jerome Friedman. The Elements
of Statically Learning, Springer Verlag, 2001
REFERENCE BOOKS:
1. Machine Learning Methods in the Environmental Sciences, Neural
Networks, William W Hsieh, Cambridge Univ Press.
2.
3.
Richard o. Duda, Peter E. Hart and David G. Stork, pattern
classification, John Wiley & Sons Inc.,2001
Chris Bishop, Neural Networks for Pattern Recognition, Oxford
University Press, 1995
te s
Outcomes:
d a
Student should be able to understand the basic concepts such as
decision trees and neural networks.
problems.
complexity
U p
Ability to formulate machine learning techniques to respective
i t y
e r s
n i v
U
te s
IV Year B.Tech. IT/CST-II Sem L
-
T/P/D
-/6/-
C
d
2
a
p
SEMINAR
y U
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
s i t
IV Year B.Tech. IT/CST-II Sem
PROJECT WORK
L
-
T/P/D
-/15/-
C
10
e r
n i vJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV Year B.Tech. IT/CST-II Sem
COMPREHENSIVE VIVA
L
-
T/P/D
-/-/-
C
2