Date post: | 08-Apr-2015 |
Category: |
Documents |
Upload: | godzilla3456 |
View: | 332 times |
Download: | 8 times |
2005-20062005-2006
1
JAW
AH
AR
LA
L N
EH
RU
TE
CH
NO
LO
GIC
AL
UN
IVE
RS
ITY
HY
DE
RA
BA
D.
B. T
EC
H. C
OM
PU
TE
R S
CIE
NC
E A
ND
EN
GIN
EE
RIN
GI Year
CO
UR
SE
ST
RU
CT
UR
E
Co
de
Su
bject
TP
C
HS
05231E
ng
lish2
+1
*-
4
MA
05363M
athematics – I
3+
1*
-6
MA
05361M
athematical M
ethods3
+1
*-
6
PY
05047A
pplied Physics
2+
1*
-4
CS
05106C
Program
ming and D
ata Structures
3+
1*
-6
EE
05068B
asic Electrical E
ngineering2
+1
*-
6
EC
05210E
lectronic Devices and C
ircuits3
+1
*-
6
ME
05220E
ngineering Draw
ing Practice Lab
-3
4
CS
05144C
omputer P
rogramm
ing Lab-
34
EE
05188E
lectrical and Electronics Lab
-3
4
HS
05232E
nglish Language comm
unication skills Lab-
34
CS
05337IT
Work-S
hop-
34
Total
25
15
56
II YearI S
emester
CO
UR
SE
ST
RU
CT
UR
E
Co
de
Su
bject
TP
C
MA
05476P
robability & S
tatistics4
+1
*-
4
CS
05360M
athematical Foundations of C
omputer Science
4+
1*
-4
CS
05007A
dvanced Data S
tructures4
+1
*-
4
CS
05175D
igital Logic Design
4+
1*
-4
CS
05140C
omputer O
rganization4
+1
*-
4
CS
05159D
ata Base M
anagement S
ystems
4+
1*
-4
CS
05008A
dvanced Data S
tructures (C+
+) Lab
-3
2
CS
05157D
ata Base M
anagement S
ystems Lab.
-3
2
Total
30
62
8
AC
AD
EM
IC R
EG
ULA
TIO
NS
CO
UR
SE ST
RU
CT
UR
EA
ND
DE
TA
ILE
D SY
LLA
BU
S
��
���
��
�
���
��
�
��
��
���
��
���
�
for
B.TE
CH
. FO
UR
YEA
R D
EG
RE
E C
OU
RSE
(Ap
plicab
le for th
e batch
es adm
itted fro
m 2005-2006)
���
��
��
�����
��
��
��
�
� �
���
���
���
���
�K
UK
AT
PAL
LY, HY
DE
RA
BA
D - 500 072 (A
.P.)
2005-20062005-2006
2
JAW
AH
AR
LA
L N
EH
RU
TE
CH
NO
LO
GIC
AL
UN
IVE
RS
ITY
HY
DE
RA
BA
D.
B. T
EC
H. C
OM
PU
TE
R S
CIE
NC
E A
ND
EN
GIN
EE
RIN
GII Year
II Sem
esterC
OU
RS
E S
TR
UC
TU
RE
Co
de
Su
bject
TP
C
CS
05521S
oftware E
ngineering4
+1
*-
4
CS
05160D
esign and Analysis of A
lgorithms
4+
1*
-4
CE
05239E
nvironmental S
tudies4
+1
*-
4
EC
05471P
rinciples of Com
munications
4+
1*
-4
EC
05400M
icroprocessors and Interfacing4
+1
*-
4
CS
05434O
OP
S through Java
4+
1*
-4
CS
05338Java Lab
-3
2
EC
05401M
icroprocessors Lab-
32
Total
30
62
8
III YearI S
emester
CO
UR
SE
ST
RU
CT
UR
E
Co
de
Su
bject
TP
C
CS
05263Form
al Languages and Autom
ata Theory
4+
1*
-4
CS
05432O
bject Oriented A
nalysis and Design
4+
1*
-4
HS
05353M
anagerial Econom
ics & F
inancial Analysis
4+
1*
-4
CS
05435O
perating System
s4
+1
*-
4
CS
05138C
omputer N
etworks
4+
1*
-4
CS
05475P
rinciples of Program
ming Languages
4+
1*
-4
CS
05564U
ML Lab
-3
2
CS
05139C
omputer N
etworks &
Operating S
ystem Lab
-3
2
Total
30
62
8
JAW
AH
AR
LA
L N
EH
RU
TE
CH
NO
LO
GIC
AL
UN
IVE
RS
ITY
HY
DE
RA
BA
D.
B. T
EC
H. C
OM
PU
TE
R S
CIE
NC
E A
ND
EN
GIN
EE
RIN
GIII Year
II Sem
esterC
OU
RS
E S
TR
UC
TU
RE
Co
de
Su
bject
TP
C
CS
05137C
omputer G
raphics4
+1
*-
4
CS
05130C
ompiler D
esign4
+1
*-
4
CS
05566U
NIX
Program
ming
4+
1*
-4
CS
05317Inform
ation Security
4+
1*
-4
CS
05424N
eural Netw
orks4
+1
*-
4
CS
05523S
oftware Testing M
ethodologies4
+1
*-
4
CS
05318Inform
ation Security Lab
-3
2
CS
05567U
NIX
Program
ming and C
ompiler D
esign Lab.-
32
Total
30
62
8
2005-20062005-2006
3
JAW
AH
AR
LA
L N
EH
RU
TE
CH
NO
LO
GIC
AL
UN
IVE
RS
ITY
HY
DE
RA
BA
D.
B. T
EC
H. C
OM
PU
TE
R S
CIE
NC
E A
ND
EN
GIN
EE
RIN
GIV
YearI S
emester
CO
UR
SE
ST
RU
CT
UR
E
Co
de
Su
bject
TP
C
CS
05216E
mbedded S
ystems
4+
1*
-4
CS
05579W
eb Technologies4
+1
*-
4
CS
05158D
ata Warehousing and D
ata Mining
4+
1*
-4
CS
05522S
oftware P
roject Managem
ent4
+1
*-
4
EL
EC
TIV
E - I :
4+
1*
-4
CS
05048A
rtificial Intelligence
CS
05412M
obile Com
puting
CS
05419M
ultimedia and A
pplication Developm
ent
EL
EC
TIV
E - II :
4+
1*
-4
CS
05004A
dvanced Com
puter Architecture
CS
05129C
lient server Com
puting
CS
05423N
etwork M
anagement S
ystems
CS
05217E
mbedded S
ystems Lab
-3
2
CS
05580W
eb Technologies Lab-
32
Total
30
62
8
JAW
AH
AR
LA
L N
EH
RU
TE
CH
NO
LO
GIC
AL
UN
IVE
RS
ITY
HY
DE
RA
BA
D.
B. T
EC
H. C
OM
PU
TE
R S
CIE
NC
E A
ND
EN
GIN
EE
RIN
GIV
YearII S
emester
CO
UR
SE
ST
RU
CT
UR
E
Co
de
Su
bject
TP
C
HS
05352M
anagement S
cience4
+1
*-
4
EL
EC
TIV
E III :
4+
1*
-4
CS
05302Im
age Processing
CS
05185E
-Com
merce
CS
05180D
istributed Databases
EL
EC
TIV
E – IV
:4
+1
*-
4
CS
05573V
irtual Reality
CS
05294H
uman C
omputer Interface
CS
05005A
dvanced Com
puting Concepts
CA
05315Industry O
riented Mini P
roject-
-2
CA
05515S
eminar
--
2
CA
05495P
roject Work
--
12
Total
15
-2
8
No
te:
All E
nd Exam
inations (Theory and P
ractical) are of three hours duration.
* - Tutorial
T - T
heoryP
- Practical
C - C
redits
2005-20062005-2006
4
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
T P CI Year B.Tech. CSE
2+1 0 4(HS 05231) ENG
LISH
1.INTRO
DUCTION :
In view of the grow
ing importance of English as a tool for global com
munication and the consequent
emphasis on training students to acquire com
municative com
petence, the syllabus has been designedto develop linguistic and com
municative com
petence of Engineering students. The prescribed booksand the exercises are m
eant to serve broadly as students’ handbooks, to encourage them to develop
their language skills. The two textbooks identified by the Board of Studies serve the purpose of
illustrating the conceptual framework within which the syllabus is to be adm
inistered in the classroom.
When a textbook is prescribed content is generally paid attention to. H
owever, the stress in this
syllabus is on language acquisition and skill development, calling for both the teacher and the taught
to go beyond the prescribed texts and innovate exercises and tasks.
2.O
BJECTIVES :
1.To prom
ote the language proficiency of the students with em
phasis on improving their LSR
W skills.
2.To im
part training to the students through the syllabus and its theoretical and practical components.
3.To im
prove comm
unication skills in formal and inform
al situations.
3.SYLLABUS :
Listening Skills :•
Listening for general content•
Listening to fill up information gaps
•Intensive listening
•Listening for specific inform
ation•
Note-taking - guided and unguided•
Post-listening testingSpeaking Skills :•
Oral practice
•Developing confidence
•Introducing oneself/others
•Asking for/ giving inform
ation•
Describing objects/offering solutions
•D
escribing situations•
Role play•
Expressing agreement/disagreem
entReading Com
prehension•
Skimm
ing the text•
Understanding the gist of an argum
ent•
Identifying the topic sentence
2005-20062005-2006
5
•Inferring lexical and contextual m
eaning•
Understanding discourse features•
Recognizing coherence/sequencing of sentencesNO
TE :The student, through the training imparted to him
/her by means of the text-based
approach, will be exam
ined in answering questions on an unseen passage.
Writing Skills :
•W
riting a sentence•
Use of appropriate vocabulary
•Paragraph writing
•Coherence and cohesiveness
•N
arration / description•
Interpreting data•
Formal and inform
al letter writing
•Sending e-m
ails•
Information transfer
•Editing a passage
4.TEXTBO
OKS PRESCRIBED :
In order to improve the proficiency of the student in the acquisition of the four skills m
entioned above,the follow
ing texts and course content, divided into Eight Units, are prescribed:
1.LEA
RN
ING
ENG
LISH: A C
omm
unicative Approach, Hyderabad: O
rient Longman,
2005.(Selected Lessons)
2.W
INGS O
F FIRE: An Autobiography – APJ Abdul Kalam, Abridged version w
ith Exercises,H
yderabad: Universities Press (India) Pvt. Ltd., 2004.
The following lessons from
the prescribed texts are recomm
ended for study :
A.
STUDY MATERIAL :
Unit – I
1.Astronom
y from LEARNING
ENGLISH: A Com
municative Approach, O
rient Longman, 2005.
2.C
hapters 1-4 from W
ings of Fire: An Autobiography – APJ Abdul Kalam, an abridged version
with Exercises, Universities Press (India) Pvt. Ltd., 2004
Unit – II
3.Inform
ation Technology from LEAR
NIN
G EN
GLISH
: A Com
municative Approach, O
rientLongm
an, 2005.
4.C
hapters 5-8 from W
ings of Fire: An Autobiography – APJ Abdul Kalam, an abridged version
with Exercises, Universities Press (India) Pvt. Ltd., 2004
Unit – III
5.H
umour from
LEARN
ING
ENG
LISH: A C
omm
unicative Approach, Orient Longm
an, 2005.
6.C
hapters 9-12 from W
ings of Fire: An Autobiography – APJ Abdul Kalam, an abridged version
with Exercises., Universities Press (India) Pvt. Ltd., 2004
Unit – IV
7.Environm
ent from LEAR
NIN
G EN
GLISH
: A Com
municative Approach, O
rient Longman, 2005.
8.C
hapters 13-16 from W
ings of Fire: An Autobiography – APJ Abdul Kalam, an abridged version
with Exercises, Universities Press (India) Pvt. Ltd., 2004
Unit – V
9.Inspiration from
LEARN
ING
ENG
LISH: A C
omm
unicative Approach, Orient Longm
an, 2005.
10.C
hapters 17-20 from W
ings of Fire: An Autobiography – APJ Abdul Kalam, an abridged version
with Exercises, Universities Press (India) Pvt. Ltd., 2004.
Unit – VI
11.H
uman Interest from
LEARN
ING
ENG
LISH : A C
omm
unicative Approach, Orient Longm
an,2005.
12.C
hapters 21-24 from W
ings of Fire: An Autobiography – APJ Abdul Kalam, an abridged version
with Exercises, Universities Press (India) Pvt. Ltd., 2004.
* Exercises from the lessons not prescribed shall also be used for classroom
tasks.
Unit – VII
Reading and W
riting SkillsReading Com
prehensionSituational dialoguesR
eport writing
Letter writing
Essay writing
Information transfer
Unit – VIIIRem
edial EnglishCom
mon errors
Subject-Verb agreement
Use of Articles and Prepositions
Tense and aspectVocabulary – Synonym
s & Antonyms, one-w
ord substitutes, prefixes & suffixes, Idioms &
phrases, words often confused.
BTEXT BOO
KS :1.
Effective Technical Comm
unication, M Ashraf R
izvi, Tata McG
raw-H
ill Publishing Com
panyLtd.
2.Everyday Dialogues in English, R
obert J Dixson, Prentice H
all of India Pvt Ltd., New
Delhi.
REFERENCES :1.
Strengthen Your English, Bhaskaran & Horsburgh, O
xford University Press
2.English for Technical Com
munication, K R
Lakshminarayana, SC
ITECH
3.Strategies for Engineering Com
munication, Susan Stevenson & Steve W
hitmore ( John W
ileyand sons).
4.English for Engineers: W
ith CD, Sirish Chaudhary, Vikas Publishing H
ouse Pvt. Ltd. With C
D.
5.Basic Com
munication Skills for Technology, Andrea J R
utherfoord, Pearson Education Asia.6.
Murphy’s English G
ramm
ar with CD, M
urphy, Cam
bridge University Press
7.A Practical Course in English Pronunciation, (w
ith two Audio cassettes), Sethi, Sadanand
& Jindal , Prentice –Hall of India Pvt Ltd., N
ew D
elhi.8.
English for Professional Students, by S S Prabhakara Rao.
9.The O
xford Guide to W
riting and Speaking, John Seely, Oxford.
10.G
ramm
ar Gam
es, Renvolucri M
ario, Cam
bridge University Press.
2005-20062005-2006
6
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C
3+1 0 6
(MA 05363) M
ATHEMATICS – I
UNIT – I
Sequences – series – Convergences and divergence – R
atio test – Com
parison test – Integral test –C
auchy’s root test – Raabe’s test – Absolute and conditional convergence. R
olle’s theorem – Lagrange’s
Mean Value Theorem
– Cauchy’s M
ean value Theorem – G
eneralized Mean Value theorem
(Taylor’sTheorem
).
UNIT – II
Functions of several variables – Functional dependence- Jacobian- Maxim
a and Minim
a of functions of twovariables w
ith constraints or without constraints- R
adius, Centre and C
ircle of Curvature – Evolutes and
Envelopes.
UNIT – III
Curve tracing – C
artesian , polar and Parametric curves - Applications of integration to lengths , volum
esand surface areas in C
artesian and polar coordinates.
UNIT – IV
Differential equations of first order and first degree – exact, linear and Bernoulli. Applications to N
ewton’s
Law of cooling, Law of natural growth and decay, Orthogonal trajectories-Non-hom
ogeneous linear differentialequations of second and higher order w
ith constant coefficients with R
HS term
of the type eax, Sin ax, cos
ax, polynomials in x, e
axV(x), xV(x), method of variation of param
eters.
UNIT – V
Laplace transform of standard functions – Inverse transform
– first shifting Theorem, Transform
s ofderivatives and integrals – Unit step function – second shifting theorem
– Dirac’s delta function – Convolutiontheorem
– Periodic function - Differentiation and integration of transforms-Application of Laplace transform
sto ordinary differential equations.
UNIT – VI
Multiple integrals - double and triple integrals – change of variables – change of order of integration.
UNIT – VII
Vector Calculus: G
radient- Divergence- C
url and their related properties of sums- products- Laplacian and
second order operators. Vector Integration - Line integral – work done – Potential function – area- surface
and volume integrals.
UNIT – VIII
Vector integral theorems: G
reen’s theorem- Stoke’s and G
auss’s Divergence Theorem
. Verification ofG
reen’s - Stoke’s and Gauss’s Theorem
s – Cylindrical, Spherical coordinates-Expressions G
rad, div, curlin spherical and cylindrical coordinates.
TEXT BOO
KS :
1.A text book of Engineering M
athematics Volum
e – 1, 2005
T.K.V.Iyengar, B.Krishna Gandhi and others, S.C
hand and Com
pany.
2.Engineering M
athematics, B.V.R
amana, Tata M
cGraw
-Hill 2003.
REFERENCES :
1.Engineering M
athematics–I, 2002, P.N
ageswara R
ao, Y.Narsim
hulu, Prabhakara Rao, D
eepthiPublishers
2.Engineering M
athematics- I, 2004, D
r.Shahnaz Bathul, Right Publishers.
3.Engineering M
athematics, S.K.V.S. Sri Ram
a Chary, M.Bhujanga Rao, Shankar, B.S. Publications
2000.
4.Engineering M
athematics-I R
ukmangadhachary, Pearson Education.
5.A Text book of Engineering M
athematics, VP M
ishra, Galgotia Publications.
6.Engineering M
athematics – I, Sankaraiah, VG
S Book Links, Hyderabad.
2005-20062005-2006
7
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C
3+1 0 6
(MA 05361) M
ATHEMATICAL M
ETHODS
UNIT - I
Solution of Algebraic and Transcendental Equations : Introduction – The Bisection Method – The M
ethodof False Position – The Iteration M
ethod – New
ton-Raphson M
ethod.
Interpolation : Introduction- Errors in Polynomial Interpolation – Finite differences- Forw
ard Differences-
Backward differences –C
entral differences – Symbolic relations and separation of sym
bols-Differences of
a polynomial-N
ewton’s form
ulae for interpolation – Central difference interpolation Form
ulae – Gauss’
Central Difference Formulae –Interpolation with unevenly spaced points-Lagrange’s Interpolation form
ula.
UNIT - II
Fitting a straight line –Nonlinear curve fitting –C
urve fitting by a sum of exponentials-W
eighted leastsquares approxim
ation-Linear weighted least squares approximation-Nonlinear weighted least squares.
Num
erical Differentiation and Integration: The C
ubic Spline Method – Trapezoidal rule – Sim
pson’s 1/3R
ule –Simpson’s 3/8 R
ule- Boole’s and Weddle’s R
ules .
UNIT - III
Num
erical solution of Ordinary D
ifferential equations: Solution by Taylor’s series-Picard’s Method of
successive Approximations-Euler’s M
ethod-Runge-Kutta Methods –Predictor-Corrector M
ethods- Adams-
Moulton M
ethod –Milne’s M
ethod.
UNIT – IV
Matrices and Linear system
s of equations: Elementary row
transformations-R
ank-Echelon form, N
ormal
form – Solution of Linear System
s – Direct M
ethods- LU D
ecomposotion- LU
Decom
position from G
aussElim
ination –Solution of Tridiagonal Systems-Solution of Linear System
s.
UNIT - V
Eigen values, eigen vectors – properties – Cayley-H
amilton Theorem
- Inverse and powers of a m
atrix byCayley-Ham
ilton theorem – Diagonolization of m
atrix. Calculation of powers of matrix – M
odal and spectralm
atrices.
UNIT - VI
Real m
atrices – Symm
etric, skew - sym
metric, orthogonal, Linear Transform
ation - Orthogonal
Transformation. C
omplex m
atrices: Herm
itian, Skew-H
ermitian and U
nitary – Eigen values and eigenvectors of com
plex matrices and their properties.
Quadratic form
s- Reduction of quadratic form
to canonical form – R
ank - Positive, negative definite - semi
definite - index - signature - Sylvester law.
UNIT – VII
Fourier Series: Determ
ination of Fourier coefficients – Fourier series – even and odd functions – Fourierseries in an arbitrary interval – even and odd periodic continuation – H
alf-range Fourier sine and cosineexpansions.
Fourier integral theorem (only statem
ent)– Fourier sine and cosine integrals. Fourier transform – Fourier
sine and cosine transforms – properties – inverse transform
s – Finite Fourier transforms.
UNIT - VIII
Formation of partial differential equations by elim
ination of arbitrary constants and arbitrary functions –solutions of first order linear (Lagrange) equation and nonlinear (standard type)equations . M
ethod ofseparation of variables.
z-transform – inverse z-transform
- properties – Dam
ping rule – Shifting rule – Initial and final valuetheorem
s. Convolution theorem
– Solution of difference equation by z-transforms.
TEXT BOO
KS :
1.A Text book of Engineering M
athematics Volum
e – II, 2005 T,K.V.Iyengar, B.Krishna Gandhi
and others, S.Chand and C
ompany.
2.Engineering M
athematics, B.V.R
amana, Tata M
cGraw
-Hill 2003.
REFERENCES :
1.Engineering M
athematics–II, 2002, P.N
ageswara R
ao, Y.Narsim
hulu, Prabhakara Rao
2.Engineering M
athematics, S.K.V.S. Sri Ram
a Chary, M.Bhujanga Rao, Shankar, B.S.Publications
2000.
3.Advanced Engineering M
athematics (eighth edition), Erw
in Kreyszig, John Wiley & Sons (ASIA)
Pvt. Ltd. 2001.
4.Advanced Engineering Peter V.O
’Neil Thom
son Brooks/Cole.
5. Advanced Engineering M
athematics, M
erle C.Potter, J.L.G
oldberg, E.F.Abrufadel, Oxford
University Press. Third Edition 2005.
6.N
umerical M
ethods: V N Vedam
urthy , Iyengar N C
h N Vikas pub. R
eprint 2005
7.N
umerical M
ethods: S.Arumugam
& others. Scitech pub.
8.Elem
entary Num
erical Analysis : An Algorithmic Approach: S.D
.Conte and C
arl.D.E.Boor, Tata
Mac-G
raw H
ill.
9.Introductory M
ethods of Num
erical Analysis: S.S.Sastry, Prentice Hall of India, Pvt Ltd.,
10.Engineering M
athematics – II, 2005, Sankaraiah, VG
S Book Links, Hyderabad.
11.N
umerical M
ethods for Scientific and Engineering Com
putation: M.K.Jain, S.R
.K. Iyengar,R
.K.Jain, New
Age International (P) Ltd.
2005-20062005-2006
8
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C
2+1 0 4(PY 05047) APPLIED PHYSICS
UNIT I
BONDING
IN SOLIDS : Introduction - Types of Bonding - Ionic bond - C
ovalent bond - Metallic bond
- Cohesive energy - C
alculation of Cohesive energy.
CRYSTAL STRUCTURES : Introduction -Space lattice - Basis - Unit cell - Lattice param
eter - Crystal
systems - Bravais lattices - Structure and Packing fractions of Sim
ple cubic - Body Centred C
ubic - FaceC
entred Cubic crystals - Structures of D
iamond, ZnS, N
aCl, C
sCl.
UNIT II
CRYSTAL PLANES & X-RAY DIFFRACTION : D
irections and Planes in crystals – Miller Indices
- Separation between successive [h k l] planes - D
iffraction of X-rays by Crystal planes - Bragg’s Law
-Laue m
ethod -Powder m
ethod.
UNIT III
DEFECTS IN SOLIDS : Im
perfections in Crystals - Point defects - Schottky and Frenkel defects -
Energy for formation of a Vacancy - Equilibrium
concentration of Schottky and Frenkel defects -Linedefects - Edge and Screw
dislocations - Burger’s Vectors.
PRINCIPLES OF Q
UANTUM M
ECHANICS : Waves and Particles - Planck’s quantum
theory - de-Broglie hypothesis – M
atter waves - Davisson and Germ
er experiment - Schroedinger’s Tim
e IndependentW
ave equation - Physical significance of the Wave function - Particle in a one dim
ensional potential box.
UNIT IV
ELECTRON THEO
RY OF M
ETALS : Classical free electron theory - M
ean free path - Relaxation tim
eand drift velocity - Ferm
i-Dirac distribution (descriptive) - Q
uantum free electron theory - Sources of
electrical resistance - Kronig-Penney model (qualitative treatm
ent) - Origin of energy band form
ation insolids - C
oncept of effective mass.
UNIT V
DIELECTRIC PROPERTIES:Introduction -
Dielectric constant - Electronic, Ionic and O
rientationpolarizabilities - Internal fields - C
lausius-Mossotti equation – Frequency dependence of the polarizability
- Ferro and Piezo electricity.
MAG
NETIC PROPERTIES : Perm
eability - Magnetization - O
rigin of magnetic m
oment - C
lassificationof m
agnetic materials - D
ia, Para and Ferro magnetism
- Hysteresis curve - Soft and H
ard magnetic
materials - anti-Ferro and Ferri m
agnetism - Ferrites and their applications.
UNIT VI
SEMICO
NDUCTORS : Introduction - Intrinsic sem
iconductor and carrier concentration – Equation forconductivity - Extrinsic sem
iconductor and carrier concentration - Drift and diffusion - Einstein’s equation
- Hall effect.
SUPERCONDUCTIVITY : G
eneral properties - Meissner effect - Penetration depth - Type I and Type
II superconductors - Flux quantization - Josephson Effect - BCS Theory - Applications of superconductors.
UNIT VII
LASERS : Introduction - Characteristics of Lasers - Spontaneous and Stim
ulated Emission of radiation
- Einstein’s coefficients - Population inversion - Ruby Laser - H
elium-N
eon Laser - Semiconductor
Laser - Applications of Lasers in Industry, Scientific and Medical fields.
UNIT VIII
FIBER OPTICS : Introduction - Principle of optical fiber - Acceptance angle and Acceptance cone -
Num
erical aperture - Step-Index fiber and transmission of signal in SI fiber - G
raded-Index fiber andtransm
ission of signal in GI fiber - Attenuation in optical fibers - Advantages of optical fibers in
comm
unication - Application of optical fibers in Medicine and Sensors.
TEXTBOO
KS :
1.Applied Physics by D
r. M.C
handra Shekar & Dr.P.Appala N
aidu; V.G.S. Book links.
2.Solid State Physics by P.K. Palanisam
y; Scitech Publications (India) Pvt.ltd.
REFERENCES :
1.M
aterials Science and Engineering by V. Raghavan; Prentice-H
all India
2.M
aterials Science by M.Arum
ugam; Anuradha Agencies
3.Solid State Physics by N
.W. Ashcroft & N
.David M
erwin, Thom
son Learning
4.Solid State Physics by D
r. B.S.Bellubbi & Dr. Adeel Ahm
ad; Premier Publishing house
5.Solid State Physics by M
ani Naidu; Vijayam
Publications
6.M
aterials Science by M.S.Vijaya & G
. Rangarajan; Tata M
cGraw
Hill
7.Introduction to Solid State Physics by C
.Kittel; Wiley Eastern lim
ited
2005-20062005-2006
9
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C
3+1 0 6
(CS 05106) C PROG
RAMM
ING AND DATA STRUCTURES
UNIT - IAlgorithm
, flowchart, program
development steps, basic structures of C
language, C tokens, data types
and sizes, declaration of variables, assigning values, arithmetic, relational and logical operator, increm
entand decrem
ent operators, conditional operator, bit-wise operators, type conversions, expressions, evaluation,input-output statem
ents, blocks, if and switch statem
ent, while, do-w
hile and for statements, C
programs
covering all the above aspects.UNIT - IIO
ne dimensional & Tw
o dimensional arrays, initialization, string variables-declaration, reading, w
riting,Basics of functions,Param
eter pasing,String handling function, user-defined functions, recursive functions,variables and storage classes, scope rules, block structure, header files, C
preprocessor, example C
programs.
UNIT - IIIPointer and Arrays : Pointers and addresses, Pointers and Arrays, Pointers And function argum
ents,Address arithm
etic, character pointers and functions, pointers to pointers, multi-dim
ensional arrays,initialization of pointer arrays, com
mand line argum
ents, pointers to functions.UNIT - IVStructures : Definition, initializing, assigning values, passing of structures as argum
ents, Arrays of structures,pointers to structures, self referential structures. Unions, typedef, bit fields, C program
examples.
UNIT - VConsole & File I/O
: Standard I/O, Form
atted I/O, opening & closing of files, I/O
operations on files.UNIT - VILinear DataStructures : Introduction to D
ataStructures, representing stacks and queues in C using
arrays, Infix, Postfix & Prefix programs, circular queues.
UNIT - VIILinked Lists : Singly linked list, D
oubly linked list, Circular List, representing stacks and Q
ueues in Cusing linked listsNon-Linear Data Structures : Binary trees: R
epresentation, tree traversals, graph representation, graphtraversal, Spanning trees.UNIT - VIIISorting & Searching : Searching M
ethods- Linear and binary search methods, Sorting m
ethods- Ex:Bubble sort, Selection sort, Insertion sort, heap sort, quick sort.
TEXT BOO
KS :1.
C And D
ata structures – P.Padmanabham
, BS Publications2.
C & D
ata Structures, Ashok N.Kam
thane, Pearson EducationREFERENCES :1.
C & D
ata Structures – Prof. P.S.DeshPande, Prof O
.G.Kakde, W
iley Dream
tech Pvt. Ltd.,NewDelhi.
2.D
ataStructures Using C
– A.S.Tanenbaum, PH
I/Pearson education.3.
The C Program
ming Language, B.W
. Kernighan, Dennis M
.Ritchie, PH
I/Pearson Education
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSE T P C
2+1 0 4
(EE 05068) BASIC ELECTRICAL ENGINEERING
UNIT - I
Introduction to Electrical Engineering : Essence of electricity, Conductors, sem
iconductors andinsulators (elem
entary treatment only); Electric field; electric current, potential and potential difference,
electromotive force, electric pow
er, ohm’s law
, basic circuit components, electrom
agnetism related law
s,M
agnetic field due to electric current flow ,force on a current carrying conductor placed in a m
agnetic field,Faradays law
s of electromagnetic induction. Types of induced EM
F’s, Kirchhoff’s laws. Sim
ple problems.
UN
IT-II
Network Analysis : Basic definitions, types of elem
ents , types of sources, resistive networks, inductive
networks, capacitive netw
orks, series parallel circuits, star delta and delta star transformation , N
etwork
theorems- Superposition , Thevenins’s, M
aximum
power transfer theorem
s and simple problem
s.
UN
IT-III
Magnetic Circuits : Basic definitions, analogy betw
een electric and magnetic circuits, m
agnetizationcharacteristics of Ferro m
agnetic materials, self inductance and m
utual inductance, energy in linearm
agnetic systems, coils connected in series, attracting force of electrom
agnets.
UN
IT-IV
Alternating Quantities : Principle of ac voltages , w
aveforms and basic definitions, relationship betw
eenfrequency, speed and num
ber of poles, root mean square and average values of alternating currents and
voltage, form factor and peak factor, phasor representation of alternating quantities, the J operator and
phasor algebra, analysis of ac circuits with single basic netw
ork element, single phase series circuits,
single phase parallel circuits, single phase series parallel circuits, power in ac circuits.
UN
IT-V
Transformers : Principles of operation, Constructional Details, Ideal Transform
er and Practical Transformer,
Losses, Transformer Test, Efficiency and Regulation Calculations (All the above topics are only elem
entarytreatm
ent and simple problem
s).
UN
IT-VI
Direct current machines : Principle of operation of dc m
achines, armature w
indings, e.m.f equation in
a dc machine, Torque production in a dc m
achine, Operation of a dc m
achine as a generator, operation ofa dc m
achine as a motor.
UN
IT-VII
A.C Machines : Three phase induction m
otor, principle of operation , slip and rotor frequency, torque(sim
ple problems).
Synchronous Machines: Principle of operation, EM
F equation (Simple problem
s on EMF). Synchronous
motor principle and operation (Elem
entary treatment only)
2005-20062005-2006
10
UNIT VIII
Basic Instruments : Introduction, classification of instrum
ents, operating principles, essential features ofm
easuring instruments, M
oving coil permanent m
agnet (PMM
C) instrum
ents, Moving Iron of Am
meters
and Voltmeters( elem
entary Treatment only)
TEXT BOO
KS :
1.Basic Electrical Engineering - By M
.S.Naidu and S. Kam
akshiah – TMH
.
2.Basic Electrical Engineering –By T.K.N
agasarkar and M.S. Sukhija O
xford University Press.
REFERENCES :
1.Theory and Problem
s of Basic Electrical Engineering by D.P.Kothari & I.J. N
agrath PHI.
2.Principles of Electrical Engineering by V.K M
ehta, S.Chand Publications.
3.Essentials of Electrical and C
omputer Engineering by D
avid V. Kerns, JR. J. D
avid Irwin
Pearson.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C
3+1 0 6
(EC 05210) ELECTRONIC DEVICES AND CIRCUITS
UNIT-I
ELECTRON DYNAM
ICS AND CRO : M
otion of charged particles in electric and magnetic fields. Sim
pleproblem
s involving electric and magnetic fields only. Electrostatic and m
agnetic focusing. Principles ofC
RT, deflection sensitivity (Electrostatic and m
agnetic deflection). Applications of CR
O: Voltage, C
urrentand Frequency M
easurements.
UNIT- II
JUNCTION DIO
DE CHARACTERISTICS : Review
of semi conductor Physics – n and p –type sem
iconductors, M
ass Action Law, C
ontinuity Equation, Hall Effect, O
pen-circuited p-n junction, The p-njunction as a rectifier (forward bias and reverse bias), The current com
ponents in p-n diode, Law of junction,Diode equation, Energy band diagram
of p-n diode, Volt-ampere characteristics of p-n diode, Tem
peraturedependence of VI characteristic, Transition and D
iffusion capacitances, Breakdown M
echanisms in Sem
iC
onductor Diodes, Zener diode characteristics, C
haracteristics of Tunnel Diode, Varactar D
iode.
UNIT- III
RECTIFIERS, FILTERS AND REGULATO
RS : Half w
ave rectifier, ripple factor, full wave rectifier,
Harm
onic components in a rectifier circuit, Inductor filter, C
apacitor filter, L- section filter, Õ- section filter,
Multiple L- section and M
ultiple Õ section filter, and com
parison of various filter circuits in terms of ripple
factors, Simple circuit of a regulator using zener diode, Series and Shunt voltage regulators
UNIT- IV
TRANSISTOR CHARACTERISTICS : C
onstruction, principle of operation, V-I characteristics, symbol,
equivalent circuit, parameter calculations, applications, and specifications of – BJT, FET, and M
OSFETS,
Enhancement and D
epletion mode M
OSFET, Salient features of different configuration of BJT and FET.
Introduction to SCR
, UJT, LED
and Photodiode.
UN
IT-V
BIASING AND STABILISATIO
N : BJT biasing, DC
equivalent model, criteria for fixing operating point,
methods of Bias stabilization, Therm
al run away, Therm
al stability, Biasing of JFET and MO
SFET,C
omparison of BJT, JFET and M
OSFET devices.
UNIT- VI
AMPLIFIERS : Sm
all signal low frequency transistor am
plifier circuits: h-parameter representation of a
transistor, Analysis of single stage transistor amplifier using h-param
eters: voltage gain, current gain, Inputim
pedance and Output im
pedance. FET and MO
SFET Small signal m
odel. (C.G, C.D, C.S configurations)
R.C
Coupled Am
plifiers using BJT and JFET, Concepts of f α , f β and f τ .
UNIT- VII
FEEDBACK AMPLIFIERS : C
oncept of feedback, Classification of feedback am
plifiers, General
characteristics of negative feedback amplifiers, Effect of Feedback on Am
plifier characteristics, Simple
problems.
2005-20062005-2006
11
UN
IT-VIII
OSCILLATO
RS : Condition for oscillations. R
C and LC
type Oscillators, C
rystal oscillators, Frequencyand am
plitude stability of oscillators, Generalized analysis of LC
oscillators, Quartz ,H
artley, and Colpitts
Oscillators, R
C-phase shift and W
ien-bridge oscillators.
TEXT BOO
KS :
1.Electronic D
evices and Circuits – J.M
illman and C
.C.H
alkias, Tata McG
raw H
ill, 1998.
2.Electronic D
evices and Circuits – R
.L. Boylestad and Louis Nashelsky, Pearson/Prentice
Hall,9
th Edition,2006.
REFERENCES :
1.Electronic D
evices and Circuits – T.F. Bogart Jr., J.S.Beasley and G
.Rico, Pearson Education,
6th edition, 2004.
2.Principles of Electronic C
ircuits – S.G.Burns and P.R
.Bond, Galgotia Publications, 2
nd Edn..,1998.
3.M
icroelectronics – Millm
an and Grabel, Tata M
cGraw
Hill, 1988.
4.Electronic D
evices and Circuits – K. Lal Kishore, B.S. Publications, 2
nd Edition, 2005.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C 0 3 4
(ME 05220) ENG
INEERING DRAW
ING PRACTICE LAB
UNIT – I
Introduction to engineering graphics – construction of ellipse, parabola and hyperbola – cylindrical curves.
UNIT – II
Orthographic projections of points, lines and planes – axis inclined to one planes and inclined to both the
planes.
UNIT – III
Orthographic projections of solids :
Cylinder, cone, prism
, pyramid and sphere positions and axis inclined to both the planes.
UNIT – IV
Isomeric projections of lines, planes and sim
ple solids
UNIT – V
Conversion of orthographic view
s into isometric view
s and vice-versa.
TEXT BOO
KS :
1.Engineering graphics By K.L. N
arayana & P.Kannayya
2.Engineering draw
ings By N.D
.Bhatt
2005-20062005-2006
12
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C0 3 4
(CS 05144) COM
PUTER PROG
RAMM
ING LAB
1.W
rite a C program
to evaluates the following algebraic expressions after reading necessary
values from the user:
a)ax+b/ax-b
b)2.5 log x + cos 32
° + | x2 –y
2 | + 2 xy
c)1/α
2 πe- (x-m/
2 σ) 2
2.W
rite a C program
for the following
a)Printing three given integers in ascending order
b)Sum
of 1 + 2+ 3 + _ _ _ _ _ n
c)1 + x
2/2! + x2/ 4!+ _ _ _ _ _ upto ten term
s
d)x +x
3/3! + x5/5!+ _ _ _ _ _ upto 7
th digit accuracy
e)R
ead x and compute Y =1 for x > 0
Y= 0 for x = 0
Y= -1 for x<0
3.W
rite C program
using FOR
statement to find the follow
ing from a given set of 20 integers.
i) Total num
ber of even integers.ii) Total num
ber of odd integers.
iii)Sum
of all even integers.iv) Sum
of all odd integers.
4.W
rite a C program
to obtain the product of two m
atrices A of size (3X3) and B of size (3X2). Theresultant m
atrix C is to be printed out along w
ith A and B. Assume suitable values for A & B.
5.U
sing switch-case statem
ent, write a C
program that takes tw
o operands and one operator fromthe user, perform
s the operation and then prints the answer. (consider operators +,-,/,* and %
).
6.W
rite C procedures to add, subtract, multiply and divide two com
plex numbers (x+iy) and (a+ib).
Also write the m
ain program that uses these procedures.
7.The total distance traveled by vehicle in ‘t’ seconds is given by distance = ut+1/2at 2 where ‘u’ and‘a’ are the initial velocity (m
/sec.) and acceleration (m/sec
2). Write C
program to find the
distance traveled at regular intervals of time given the values of ‘u’ and ‘a’. The program
shouldprovide the flexibility to the user to select his ow
n time intervals and repeat the calculations for
different values of ‘u’ and ‘a’.
8.A cloth show
room has announced the follow
ing seasonal discounts on purchase of items.
Purchase Amount
Discount (Percentage)
Mill C
lothHandloom
items
1-100-
5.0
101-2005.0
7.5
201-3007.5
10.0
Above 30010.0
15.0
Write a C
program using sw
itch and If statements to com
plete the net amount to be paid by a
customer.
9.G
iven a number, write C program
using while loop to reverse the digits of the number. Exam
ple1234 to be w
ritten as 4321.
10.The Fibonacci sequence of num
bers is 1,1,2,3,5,8… based on the recurrence relation f(n) = f (n-
1) + f (n-2) for n>2.
Write C
program using d0-w
hile to calculate and print the first m fibonacci num
bers.
11.W
rite C program
s to print the following outputs using for loop.
11
22
22
33
33
33
44
44
44
44
55
55
55
55
55
12.W
rite a C program
to extract a portion of a character string and print the extracted string. Assume
that m characters are extracted starting w
ith the nth character.
13.A M
aruthi Car dealer m
aintains a record of sales of various vehicles in the following form
:
Vehicle typeM
onth of SalesPrice (Rs).
Maruthi – 800
02/8775,000
Maruthi – D
X07/87
95,000
Gypsy
04/881,10,000
Maruthi Van
08/8885,000
Write a C
program to read this data into a table of strings and output the details of a particular
vehicle sold during a specified period. The program should request the user to input the vehicle
type and the period (Starting month & ending m
onth).
14.W
rite a function that will scan a character string passed as an argum
ent and covert all lower case
characters into their upper case equivalents.
15.Im
plement the follow
ing data structures using Arrays
i) Stacks ii) Linear Queues iii) C
ircular queues
2005-20062005-2006
13
16.Im
plement binary search tree using linked list and perform
the following operations.
i) Insertion ii) Deletion iii) Inorder Traversal iv) Preorder Traversal
v) Post Order Traversal.
17.Singly linked list and doubly linked lists
i) Insertion ii) D
eletion iii) Lookup
18.i) Im
plement stack using singly linked list.
ii) Implem
ent queue using singly linked list.
19.Im
plement the follow
ing sorting techniques.
i) Bubble sort ii) Insertion Sort iii) Quick Sort iv) H
eap Sort.
20.Im
plement the follow
ing searching method.
i) Sequential Search ii) Binary Search
21.i) C
onversion of Infix expression to Postfix notation.
ii) Simple expression evaluator, that can handle +,-,/ and *.
22.Im
plement the algorithm
s for the following iterative m
ethods using C to find one root of the
equation
9x1 +2x
2 +4x3 = 0
x1 +10x
2 +4x3 = 6
2x1 -4x
2 +10x3 = -15.
23.W
rite Computer program
s to implem
ent the Lagrange interpolation and Newton- Gregory forward
interpolation.
24.Im
plement in ‘C
’ the linear regression and polynomial regression algorithm
s.
25.Im
plement Traezoidal and Sim
pson methods.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C0 3 4
(EE 05188) ELECTRICAL AND ELECTRONICS LAB
PART - A1.
Serial and Parallel Resonance – Timing, Resonant frequency, Bandwidth and Q
-factor determination
for RLC
network.
2.Tim
e response of first order RC/RL network for periodic non-sinusoidal inputs – time constant and
steady state error determination.
3.Tw
o port network param
eters – Z-Y Parameters, chain m
atrix and analytical verification.
4.Verification of Superposition and R
eciprocity theorems.
5.Verification of m
aximum
power transfer theorem
. Verification on DC
, verification on AC w
ithR
esistive and Reactive loads.
6.Experim
ental determination of Thevenin’s and N
orton’s equivalent circuits and verification bydirect test.
7.M
agnetization characteristics of D.C
. Shunt generator. Determ
ination of critical field resistance.
8.Sw
inburne’s Test on DC
shunt machine (Predeterm
ination of efficiency of a given DC
Shuntm
achine working as m
otor and generator).
9.Brake test on D
C shunt m
otor. Determ
ination of performance characteristics.
10.O
C & SC
tests on Single-phase transformer (Predeterm
ination of efficiency and regulation atgiven pow
er factors and determination of equivalent circuit).
11.Brake test on 3-phase Induction m
otor (performance characteristics).
12.R
egulation of alternator by synchronous impedance m
ethod
PART - B1.
Identification, Specifications and Testing of R, L, C
Com
ponents (colour codes), Potentiometers,
Switches ( SPDT, DPDT and DIP ), Coils, Gang Condensers, Relays, Bread Boards. Identification
and Specifications of active devices, Diodes, BJTs, Low
power JFETs, M
OSFETs, LED
s,LC
Ds, SC
R, U
JT, Linear and Digital IC
s.
2.PN
Junction Diode C
haracteristics ( Forward bias, R
everse bias )
3.Zener D
iode Characteristics
4.Transistor C
E Characteristics ( Input and O
utput )
5.R
ectifier without Filters(Full w
ave & Half w
ave)
6.R
ectifier with Filters(Full w
ave & Half w
ave)
7.SC
R C
haracteristics
8.FET C
haracteristics
9.C
E and CC
Amplifier
10.Feedback Am
plifier(Voltage Series/Current series)
11.R
C Phase Shift O
scillator
12.H
artely/Colpitts O
scillator
2005-20062005-2006
14
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C0 3 4
(HS 05232) ENGLISH LANG
UAGE CO
MM
UNICATION SKILLS LAB
The language Lab focuses computer-aided m
ulti-media instruction and language acquisition to achieve the
following targets :
•To expose the students to a variety of self-instructional, learner-friendly m
odes of languagelearning.
•To help the students cultivate the habit of reading passages from
the computer m
onitor, thusproviding them
with the required facility to face com
puter-based competitive exam
s such GR
E,TO
EFL, GM
AT etc.
•To enable them
to learn better pronunciation through stress on word accent, intonation, and
rhythm.
•To train them
to use language effectively to face interviews, group discussions, public speaking.
•To initiate them
into greater use of the computer in resum
e preparation, report writing, form
at-m
aking etc.
How
ever, depending upon the available infrastructure and budget, the above targets can also beachieved by procuring the m
inimum
required equipment suggested for the establishm
ent of aC
onventional Lab the details of which are given below
. The lab should cater to the needs of thestudents to build up their confidence to help them
develop leadership qualities through theircom
municative com
petence.
SYLLABUS :
The following course content is prescribed for the English Language Laboratory Practice :
1.Introduction to Phonetics.
2.Introduction to Vow
els and Consonants and associated Phonetic sym
bols.
3.Introduction to Accent, Intonation and R
hythm.
4.Situational D
ialogues / Role Play.
5.Public Speaking.
6.Debate
7.G
roup discussions
8.Facing Interview
s
9.Resum
e preparation
10.e-correspondence
Minim
um Requirem
ent :
•C
omputer aided m
ulti media language lab w
ith 30 systems w
ith LAN facility.
•Conventional Language Lab. with audio and video system
s, speakers, head phones and a teacherconsole to accom
modate 30 students.
Suggested Software :
•C
ambridge Advanced Learners’ D
ictionary with exercises
•The R
osetta Stone English Library
•C
larity Pronunciation Power
•M
astering English in Vocabulary, Gram
mar, Spellings, C
omposition
•D
orling Kindersley series of Gram
mar, Punctuation, C
omposition etc.
•Language in U
se, Foundation Books Pvt Ltd
•Learning to Speak English - 4 C
Ds
•M
icrosoft Encarta
•M
urphy’s English Gram
mar, C
ambridge
•Tim
e series of IQ Test, Brain-teasers, Aptitude Test etc.
•English in M
ind, Herbert Puchta and Jeff Stranks w
ith Meredith Levy,C
ambridge.
BOO
KS SUGG
ESTED FOR ENG
LISH LAB :
1.D
eveloping Com
munication Skills by Krishna M
ohan & Meera Benerji (M
acmillan)
2.Speaking English Effectively by Krishna M
ohan & NP Singh (M
acmillan)
3.Better English Pronunciation by JD
O C
onnor (UBS – C
ambridge)
4.O
xford Practice Gram
mar w
ith Answers, John Eastw
ood, Oxford
5.H
andbook of English Gram
mar and U
sage, Mark Lester and Larry Beason, Tata M
cGraw
-Hill
6.A text book of English Phonetics for Indian Students by T.Balasubram
anian (Macm
illan)
7.Lingua TO
EFL CBT Insider, by D
reamtech
8.TO
EFL & GR
E( KAPLAN, AAR
CO
& BARR
ON
S, USA, C
racking GR
E by CLIFFS)
9.English Skills for Technical Students, W
BSCTE w
ith British Council, O
L
10.A H
andbook of English for Com
petitive Examinations, by B Shyam
ala Rao, Blakie Books,
Chennai.
DISTRIBUTION AND W
EIGHTAG
E OF M
ARKS :
ENG
LISH LAN
GU
AGE LABO
RATO
RY PR
ACTIC
E
1.The practical exam
inations for the English Language Laboratory practice shall be conducted asper the U
niversity norms prescribed for the core engineering practical sessions.
2.For the English Language lab sessions, there shall be a continuous evaluation during the year for25 sessional m
arks and 50 End Examination m
arks. Of the 25 m
arks, 15 marks shall be aw
ardedfor day-to-day w
ork and 10 marks to be aw
arded by conducting Internal Lab Test(s). The EndExam
ination shall be conducted by the teacher concerned with the help of another mem
ber of thestaff of the sam
e department of the sam
e institution.
2005-20062005-2006
15
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
I Year B.Tech. CSET P C0 3 4
(CS 05337) IT WO
RKSHOP
Objectives :
The IT Workshop for engineers is a 6 training lab course spread over 90 hours. The m
odules include trainingon PC
Hardw
are, Internet & World W
ide Web and Productivity tools including M
S Word, Excel, Pow
erPoint and Publisher.
PC Hardware introduces the students to a personal com
puter and its basic peripherals, the process ofassem
bling a personal computer, installation of system
software like W
indows XP, Linux and the required
device drivers. In addition hardware and softw
are level troubleshooting process, tips and tricks would be
covered.
Internet & World W
ide Web m
odule introduces the different ways of hooking the PC
on to the internetfrom
home and workplace and effectively usage of the internet. Usage of web browsers, em
ail, newsgroupsand discussion forum
s would be covered. In addition, aw
areness of cyber hygiene, i.e., protecting thepersonal com
puter from getting infected w
ith the viruses, worm
s and other cyber attacks would be
introduced.
Productivity tools module w
ould enable the students in crafting professional word docum
ents, excelspread sheets, pow
er point presentations and personal web sites using the M
icrosoft suite of office toolsand LaTeX.
PC Hardware
Week 1 – Task 1 : Identify the peripherals of a com
puter, components in a C
PU and its functions. D
rawthe block diagram
of the CPU
along with the configuration of each peripheral and subm
it to your instructor.
Week 2 – Task 2 : Every student should disassem
ble 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 show
s 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 w
indows XP on the personal com
puter. Labinstructor should verify the installation and follow
it up with a Viva.
Week 4 – Task 4 : Every student should install Linux on the com
puter. This computer should have
window
s installed. The system should be configured as dual boot w
ith both window
s and Linux. Labinstructors should verify the installation and follow
it up with a Viva
Week 5 – Task 5 : Several m
ini tasks would be that covers Basic com
mands in Linux and Basic system
administration in Linux w
hich includes: Basic Linux comm
ands in bash, Create hard and sym
bolic links,Text processing, U
sing wildcards
Week 6 – Task 6 : Hardw
are Troubleshooting : Students have to be given a PC w
hich does not bootdue to im
proper assembly or defective peripherals. They should identify the problem
and fix it to get thecom
puter back to working condition. The work done should be verified by the instructor and followed up witha Viva
Week 7 – Task 7 : Softw
are Troubleshooting : Students have to be given a malfunctioning C
PU due
to system softw
are problems. They should identify the problem
and fix it to get the computer back to
working condition. The w
ork done should be verified by the instructor and followed up w
ith a Viva.
Week 8 – Task 8 : The test consists of various system
s with H
ardware / Softw
are related troubles,Form
atted disks without operating system
s.
Internet & World W
ide Web
Week 9 - Task 1 : O
rientation & Connectivity Boot Camp : Students should get connected to their
Local Area Netw
ork and access the Internet. In the process they configure the TCP/IP setting. Finally
students should demonstrate, to the instructor, how
to access the websites and em
ail. If there is nointernet connectivity preparations need to be m
ade by the instructors to simulate the W
WW
on the LAN.
Week 10 - Task 2 : W
eb Browsers, Surfing the W
eb : Students customize their w
eb browsers w
iththe LAN
proxy settings, bookmarks, search toolbars and pop up blockers. Also, plug-ins like M
acromedia
Flash and JRE for applets should be configured.
Week 11 - Task 3 : Search Engines & Netiquette : Students should know
what search engines are and
how to use the search engines. A few
topics would be given to the students for w
hich they need to searchon G
oogle. This should be demonstrated to the instructors.
Week 12 - Task 4 : Cyber Hygiene : Students would be exposed to the various threats on the internet and
would be asked to configure their com
puter to be safe on the internet. They need to first install an anti virussoftw
are, configure their personal firewall and w
indows update on their com
puter. Then they need tocustom
ize their browsers to block pop ups, block active x dow
nloads to avoid viruses and/or worm
s.
Week 13 M
odule Test A test which sim
ulates all of the above tasks would be crafted and given to the
students.
LaTeX and Microsoft W
ordW
eek 14 – Word O
rientation : The mentor needs to give an overview
of LaTeX and Microsoft w
ord :Im
portance of LaTeX and MS W
ord as word Processors, D
etails of the four tasks and features that would
be covered in each, Using LaTeX and w
ord – Accessing, overview of toolbars, saving files, U
sing help andresources, rulers, form
at painter in word.
Task 1 : Using LaTeX and word to create project certificate. Features to be covered:-Form
atting Fontsin w
ord, Drop C
ap in word, Applying Text effects, U
sing Character Spacing, Borders and C
olors, InsertingH
eader and Footer, Using D
ate and Time option in both LaTeX and W
ord.
Week 15 - Task 2 : Creating project abstract Features to be covered:-Form
atting Styles, Inserting table,Bullets and N
umbering, C
hanging Text Direction, C
ell alignment, Footnote, H
yperlink, Symbols, Spell
Check , Track C
hanges.
Week 16 - Task 3 : Creating a New
sletter : Features to be covered:- Table of Content, N
ewspaper
columns, Im
ages from files and clipart, D
rawing toolbar and W
ord Art, Formatting Im
ages, Textboxes andParagraphs
Week 17 - Task 4 : Creating a Feedback form
- Features to be covered- Forms, Text Fields, Inserting
objects, Mail M
erge in Word.
Week 18 - LaTeX and W
ord Module Test - R
eplicate the given document inclusive of all features
Microsoft Excel
Week 19 - Excel O
rientation : The mentor needs to tell the im
portance of MS Excel as a Spreadsheet
tool, give the details of the four tasks and features that would be covered in each. U
sing Excel –Accessing, overview
of toolbars, saving excel files, Using help and resources
Task 1 : Creating a Scheduler - Features to be covered:- Gridlines, Form
at Cells, Sum
mation, auto fill,
Formatting Text
2005-20062005-2006
16
Week 20 - Task 2 : Calculating G
PA - .Features to be covered:- C
ell Referencing, Form
ulae in excel –average, std.deviation, C
harts, Renam
ing and Inserting worksheets, H
yper linking, Count function,
HLO
OKU
P/VLOO
KUP
Week 21 - Task 3 : Perform
ance Analysis - Features to be covered:- Split cells, freeze panes, group andoutline, Sorting, Boolean and logical operators, C
onditional formatting
Week 22 - Task 4 : Cricket Score Card - Features to be covered:-Pivot Tables, Interactive Buttons,
Importing D
ata, Data Protection, D
ata Validation,
Week 23 – Excel M
odule Test - Replicate the given docum
ent inclusive of all features
LaTeX and Microsoft Pow
er PointW
eek 24 - Task1 : Students will be working on basic power point utilities and tools which help them create
basic power point presentation.
Topic covered during this week includes :- PPT O
rientation, Slide Layouts, Inserting Text, Word Art,
Formatting Text, Bullets and N
umbering, Auto Shapes, Lines and Arrow
s in both LaTeX and Powerpoint.
Week 25 - Task 2 : Second w
eek helps students in making their presentations interactive.
Topic covered during this week includes : H
yperlinks, Inserting –Images, C
lip Art, Audio, Video, Objects,
Tables and Charts
Week 26 - Task 3 : C
oncentrating on the in and out of Microsoft pow
er point and presentations in LaTeX.H
elps them learn best practices in designing and preparing pow
er point presentation.
Topic covered during this week includes :- M
aster Layouts (slide, template, and notes), Types of view
s(basic, presentation, slide slotter, notes etc), Inserting – Background, textures, D
esign Templates, H
iddenslides.
Week 27 - Task 4 : Entire w
eek concentrates on presentation part of LaTeX and Microsoft pow
er point.
Topic covered during this week includes -U
sing Auto content wizard, Slide Transition, C
ustom Anim
ation,Auto Rehearsing
Week 28 - Task 5 : Pow
er point test would be conducted. Students w
ill be given model pow
er pointpresentation w
hich needs to be replicated (exactly how it’s asked).
Microsoft Publisher
Week 29 : H
elp students in preparing their personal website using M
icrosoft publisher.
Topic covered during this week includes - Publisher O
rientation, Using Tem
plates, Layouts, Inserting textobjects, Editing text objects, Inserting Tables, W
orking with m
enu objects, Inserting pages, Hyper linking,
Renam
ing, deleting, modifying pages, H
osting website.
REFERENCES :
1.C
omdex Inform
ation Technology course tool kit ‘Vikas Gupta, W
ILEY Dream
tech
2.The Com
plete Computer upgrade and repair book,3rd edition Cheryl A Schm
idt, WILEY Dream
tech
3.Introduction to Inform
ation Technology, ITL Education Solutions limited, Pearson Education.
4.PC
Hardw
are and A+Handbook – Kate J. C
hase PHI (M
icrosoft)
5.LaTeX C
ompanion – Leslie Lam
port, PHI/Pearson.
6.All LaTeX and others related m
aterial is available at
(a)w
ww
.sssolutions.in and
(b)w
ww
.sontisoftsolutions.org
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - I Semester
T P C 4+1 0 4
(MA 05476) PRO
BABILITY & STATISTICS
UNIT-I
Probability : Sample space and events – Probability – The axiom
s of probability - Some elem
entarytheorem
s - Conditional probability – Baye’s theorem
.
UN
IT-II
Random
variables – Discrete and continuous – D
istribution – Distribution function.
UN
IT-III
Distribution - Binom
ial, poisson and normal distribution – related properties.
UN
IT-IV
Sampling distribution : Populations and sam
ples - Sampling distributions of m
ean (known and unknown)proportions, sum
s and differences.
UN
IT-V
Estimation : Point estim
ation – interval estimation - Bayesian estim
ation.
UN
IT-VI
Test of Hypothesis – M
eans and proportions – Hypothesis concerning one and tw
o means – Type I and
Type II errors. One tail, tw
o-tail tests.
UN
IT-VII
Tests of significance – Student’s t-test, F-test, x2
test. Estimation of proportions.
UN
IT-VIII
Curve fitting : The method of least squares – Inferences based on the least squares estim
ations -C
urvilinear regression – multiple regressions – correlation for univariate and bivariate distributions.
TEXT BOO
KS :
1.Probability and statistics for engineers:Erw
in Miller And John E.Freund. Prentice-H
all of India /Pearson , Sixth edition.
2.Text book of Probability and Statistics by D
r.Shahnaz Bathul, V.G.S.Publishers 2003.
REFERENCES :
1.Probability, Statistics and R
andom Processes D
r.K.Murugesan & P.G
urusamy by Anuradha
Agencies, Deepti Publications.
2.Advanced Engineering M
athematics (Eighth edition), Erw
in Kreyszig, John Wiley and Sons (ASIA)
Pvt. Ltd., 2001.
3.Probability and Statistics for Engineers: G
.S.S.Bhishma R
ao,sitech., Second edition 2005.
2005-20062005-2006
17
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05360) MATHEM
ATICAL FOUNDATIO
N OF CO
MPUTER SCIENCE
UNIT-IM
athematical Logic : Statem
ents and notations, Connectives, W
ell formed form
ulas, Truth Tables,tautology, equivalence im
plication, Norm
al forms.
UN
IT-IIPredicates : Predicative logic, Free & Bound variables, R
ules of inference, Consistency, proof of
contradiction, Automatic Theorem
Proving.U
NIT-III
Set Theory : Properties of binary Relations, equivalence, com
patibility and partial ordering relations,H
asse diagram. Functions: Inverse Function C
omports of functions, recursive Functions, Lattice and its
Properties, Pigeon hole principles and its application.U
NIT-IV
Algebraic structures : Algebraic systems Exam
ples and general properties, Semi groups and m
onads,groups sub groups’ hom
omorphism
, Isomorphism
.U
NIT-V
Elementary Com
binatorics: Basis of counting, Combinations & Perm
utations, with repetitions, Constrainedrepetitions, Binom
ial Coefficients, Binom
ial Multinom
ial theorems, the principles of Inclusion – Exclusion.
UN
IT-VIRecurrence Relation : G
enerating Functions, Function of Sequences Calculating Coefficient of generatingfunction, R
ecurrence relations, Solving recurrence relation by substitution and Generating funds.
Characteristics roots solution of In hom
ogeneous Recurrence R
elation.U
NIT-VII
Graph Theory : R
epresentation of Graph, D
FS, BFS, Spanning Trees, planar Graphs
UN
IT-VIIIG
raph Theory and Applications, Basic Concepts Isom
orphism and Sub graphs, M
ulti graphs and Eulercircuits, H
amiltonian graphs, C
hromatic N
umbers
TEXT BOO
KS :1.
Discrete and C
ombinational M
athematics- An Applied Introduction-5th Edition – R
alph. P.Grim
aldi.Pearson Education
2.D
iscrete Mathem
atical Structures with applications to com
puter science Trembly J.P. & M
anohar.P, TM
HREFERENCES :1.
Discrete Mathem
atical Structures, Bernand Kolman, Roberty C. Busby, Sharn Cutter Ross, Pearson
Education/PHI.
2.M
athematical Foundations of com
puter science Dr D
.S.Chandrasekharaiaha Prism
books Pvt Ltd.3.
Discrete M
athematics, Lovasz, Springer.
4.D
iscrete Mathem
atics for Com
puter science, Garry H
aggard and others, Thomson.
5.D
iscrete Mathem
atics for Com
puter Scientists & Mathem
aticians, J.L. Mott, A. Kandel, T.P.
Baker Prentice Hall.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05007) ADVANCED DATA STRUCTURES
UNIT - I
Different strategies for problem
solving, need for OO
P, Overview
of OO
P Principles-Encapsulation,Inheritance, Polym
orphism. C
++ class overview- class definition, objects, class m
embers, access
control, class scope, constructors and destructors, inline functions, static class mem
bers, this pointer,friend functions, dynam
ic mem
ory allocation and deallocation (new and delete).
UNIT - II
Polymorphism
and Inheritance : Function overloading, operator overloading, generic programm
ing-function and class tem
plates, inheritance basics, base and derived classes, different types of inheritance,base class access control, virtual base class, function overriding, run tim
e polymorphism
using virtualfunctions, abstract classes.
UNIT - III
Streams, libraries and error handling – Stream
classes hierarchy, console i/o, formatted I/O
, file streams
and string streams, exception handling m
echanism, Standard Tem
plate Library.
UNIT - VI
Algorithms, perform
ance analysis-time com
plexity and space complexity, Review of basic data structures-
the list ADT, stack AD
T, implem
entation using template class in C
++, queue ADT, im
plementation using
template class, priority queues-definition, AD
T, heaps, definition, insertion and deletion, application-heapsort, disjoint sets-disjoint set AD
T, disjoint set operations, union and find algorithms.
UNIT - V
Skip lists and Hashing : Dictionaries, linear list representation, skip list representation, operations-
insertion, deletion and searching, hash table representation, hash functions, collision resolution-separatechaining, open addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing,com
parison of hashing and skip lists.
UNIT - VI
Search trees (part I) : Binary search trees, definition, ADT, im
plementation, operations Searching,
insertion and deletion, Balanced search trees- AVL trees, definition, height of an AVL tree, representation,operations-insertion, deletion and searching.
UNIT - VII
Search trees (prt II) : Red –Black trees-representation, insertion, deletion, searching Splay trees-
introduction, the splay operation, B-Trees-B-Tree of order m, height of a B-Tree, insertion, deletion and
searching.
UNIT - VIII
Pattern matching and Tries : Pattern m
atching algorithms-Brute force, the Boyer –M
oore algorithm, the
Knuth-Morris-Pratt algorithm
, Standard Tries, Com
pressed Tries, Suffix trees, Search engines-Invertedfiles.
2005-20062005-2006
18
TEXT BOO
KS :
1.D
ata structures, Algorithms and Applications in C
++, S.Sahni, University Press (India) Pvt.Ltd,
2nd edition, Orient Longm
an Pvt. Ltd.
2.D
ata structures and Algorithms in C
++, Michael T.G
oodrich, R.Tam
assia and D.M
ount, Wiley
student edition, John Wiley and Sons.
REFERENCES :
1.D
ata structures and Algorithm Analysis in C
++, Mark Allen W
eiss, Pearson Education Ltd.,Second Edition.
2.D
ata structures using C and C
++, Langsam, Augenstein and Tanenbaum
, PHI.
3.C
++ primer, 3rd edition, S.B.Lippm
an, Pearson education ltd.
4.Problem
solving with C
++, The OO
P, Fourth edition, W.Savitch, Pearson education.
5.D
ata structures and algorithms in C
++, 3rd Edition, Adam
Drozdek, Thom
son
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05175) DIGITAL LO
GIC DESIG
NUNIT-IB
INA
RY SYSTEM
S : Digital System
s, Binary Num
bers, Num
ber base conversions, Octal and
Hexadecimal Num
bers, complem
ents, Signed binary numbers, Binary codes, Binary Storage and Registers,
Binary logic.U
NIT-II
BOO
LEAN ALGEBRA AND LO
GIC G
ATES : Basic Definitions, Axiom
atic definition of BooleanAlgebra, Basic theorem
s and properties of Boolean algebra, Boolean functions canonical and standardform
s, other logic operations, Digital logic gages, integrated circuits.
UN
IT-IIIG
ATE – LEVEL MINIM
IZATION : The m
ap method, Four-variable m
ap, Five-Variable map, product of
sums sim
plification Don’t-care conditions, NAND and NOR im
plementation other Two-level im
plementnations,
Exclusive – Or function, H
ardward D
escription language (HD
L).UNIT - IVCO
MBINATIO
NAL LOG
IC : Com
binational Circuits, Analysis procedure D
esign procedure, BinaryAdder-Subtractor Decim
al Adder, Binary multiplier, m
agnitude comparator, Decoders, Encoders, M
ultiplexers,H
DL for com
binational circuits.UNIT - VSYNCHRO
NOUS SEQ
UENTIAL LOG
IC : Sequential circuits, latches, Flip-Flops Analysis of clockedsequential circuits, H
DL for sequential circuits, State R
eduction and Assignment, D
esign Procedure.UNIT - VIR
egisters, shift Registers, R
ipple counters synchronous counters, other counters, HD
L for Registers and
counters.UNIT - VIIIntroduction, R
andom-Access M
emory, M
emory D
ecoding, Error Detection and correction R
ead-onlym
emory, Program
mable logic Array program
mable Array logic, Sequential Program
mable D
evices.U
NIT-VIII
ASYNCHRONO
US SEQUENTIAL LO
GIC : Introduction, Analysis Procedure, C
ircuits with Latches,
Design Procedure, R
educiton of state and Flow Tables, R
ace-Free state Assignment H
azards, Design
Example.
TEXT BOO
KS :1.
DIG
ITAL DESIG
N – Third Edition , M
.Morris M
ano, Pearson Education/PHI.
2.FU
ND
AMEN
TALS OF LO
GIC
DESIG
N, R
oth,5th Edition,Thom
son.
REFERENCES :1.
Switching and Finite Autom
ata Theory by Zvi. Kohavi, Tata McG
raw H
ill.2.
Switching and Logic D
esign, C.V.S. R
ao, Pearson Education3.
Digital Principles and D
esign – Donald D
.Givone, Tata M
cGraw
Hill, Edition.
4.Fundam
entals of Digital Logic & M
icro Com
puter Design , 5
TH Edition, M. R
afiquzzaman John W
iley
2005-20062005-2006
19
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05140) COM
PUTER ORG
ANIZATION
UNIT-IBASIC STRUCTURE O
F COM
PUTERS : Com
puter Types, Functional unit, Basic OPER
ATION
ALconcepts, Bus structures, Softw
are, Performance, m
ultiprocessors and multi com
puters. Data
Representation. Fixed Point R
epresentation. Floating – Point Representation. Error D
etection codes.U
NIT-II
REGISTER TRANSFER LANG
UAGE AND M
ICROO
PERATIONS : R
egister Transfer language.R
egister Transfer Bus and mem
ory transfers, Arithmetic M
ircrooperatiaons, logic micro operations, shift
micro operations, Arithm
etic logic shift unit. Instruction codes. Com
puter Registers C
omputer instructions
– Instruction cycle.M
emory – R
eference Instructions. Input – Output and Interrupt. STAC
K organization. Instructionform
ats. Addressing modes. D
ATA Transfer and manipulation. Program
control. Reduced Instruction set
computer.
UN
IT-IIIM
ICRO PRO
GRAM
MED CO
NTROL : C
ontrol mem
ory, Address sequencing, microprogram
example,
design of control unit Hard w
ired control. Microprogram
med control
UN
IT-IVCO
MPUTER ARITHM
ETIC : Addition and subtraction, multiplication Algorithm
s, Division Algorithm
s,Floating – point Arithm
etic operations. Decim
al Arithmetic unit D
ecimal Arithm
etic operations.U
NIT-V
THE MEM
ORY SYSTEM
: Basic concepts semiconductor R
AM m
emories. R
ead-only mem
ories Cache
mem
ories performance considerations, Virtual m
emories secondary storage. Introduction to R
AID.
UN
IT-VIINPUT-O
UTPUT ORG
ANIZATION : Peripheral D
evices, Input-Output Interface, Asynchronous data
transfer Modes of Transfer, Priority Interrupt D
irect mem
ory Access, Input –Output Processor (IO
P)Serial com
munication; Introduction to peripheral com
ponent, Interconnect (PCI) bus. Introduction to
standard serial comm
unication protocols like RS232, U
SB, IEEE1394.U
NIT-VII
PIPELINE AND VECTOR PRO
CESSING : Parallel Processing, Pipelining, Arithm
etic Pipeline, InstructionPipeline, R
ISC Pipeline Vector Processing, Array Processors.
UN
IT-VIIIM
ULTI PROCESSO
RS : Characteristics or M
ultiprocessors, Interconnection Structures, InterprocessorArbitration. InterProcessor C
omm
unication and Synchronization Cache C
oherance. Shared Mem
oryM
ultiprocessors.TEXT BO
OKS :
1.C
omputer System
s Architecture – M.M
oris Mano, IIIrd Edition, Pearson/PH
I2.
Com
puter Organization – C
ar Ham
acher, Zvonks Vranesic, SafeaZaky, Vth Edition, McG
raw H
ill.REFERENCES :1.
Com
puter Organization and Architecture – W
illiam Stallings Sixth Edition, Pearson/PH
I2.
Structured Com
puter Organization – Andrew
S. Tanenbaum, 4
th Edition PHI/Pearson
3.Fundam
entals or Computer O
rganization and Design, - Sivaraama Dandam
udi Springer Int. Edition.4.
Com
puter Organization, Anjaneyulu, H
imalaya Pub house.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05159) DATA BASE MANAG
EMENT SYSTEM
S
UNIT – I
Data base System
Applications, data base System VS file System
– View of D
ata – Data Abstraction –
Instances and Schemas – data M
odels – the ER M
odel – Relational M
odel – Other M
odels – Database
Languages – DDL – DML – database Access for applications Program
s – data base Users and Administrator
– Transaction Managem
ent – data base System Structure – Storage M
anager – the Query Processor –
History of D
ata base Systems.D
ata base design and ER diagram
s – Beyond ER D
esign Entities,Attributes and Entity sets – R
elationships and Relationship sets – Additional features of ER
Model –
Concept D
esign with the ER
Model – C
onceptual Design for Large enterprises.
UNIT – II
Relational Model : Introduction to the R
elational Model – Integrity C
onstraint Over relations – Enforcing
Integrity constraints – Querying relational data – Logical data base D
esign – Introduction to Views –
Destroying /altering Tables and View
s.
Relational Algebra and Calculus : Relational Algebra – Selection and projection set operations –
renaming – Joins – D
ivision – Examples of Algebra overview
s – Relational calculus – Tuple relational
Calculus – D
omain relational calculus – Expressive Pow
er of Algebra and calculus.
UNIT – III
Form of Basic SQ
L Query – Exam
ples of Basic SQL Q
ueries – Introduction to Nested Q
ueries –C
orrelated Nested Q
ueries Set – Com
parison Operators – Aggregative O
perators – NU
LL values –C
omparison using N
ull values – Logical connectivity’s – AND
, OR
and NO
TR – Im
pact on SQL C
onstructs– O
uter Joins – Disallow
ing NU
LL values – Com
plex Integrity Constraints in SQ
L Triggers and Active Data
bases.
UNIT – IV
Schema refinem
ent – Problems Caused by redundancy – Decom
positions – Problem related to decom
position– reasoning about FD
S – FIRST, SEC
ON
D, TH
IRD
Norm
al forms – BC
NF – Lossless join D
ecomposition
– Dependency preserving D
ecomposition – Schem
a refinement in D
ata base Design – M
ulti valuedD
ependencies – forth Norm
al Form.
UNIT – V
Overview
of Transaction Managem
ent : ACID
Properties – Transactions and Schedules – Concurrent
Execution of transaction – Lock Based Concurrency C
ontrol – Performance Locking – Transaction
Support in SQL – Introduction to C
rash recovery.
UNIT – VI
Concurrency Control : Serializability, and recoverability – Introduction to Lock Managem
ent – LockConversions – Dealing with Dead Locks – Specialized Locking Techniques – Concurrency without Locking.
Crash recovery : Introduction to ARIES – the Log – O
ther Recovery related Structures – the W
rite-Ahead Log Protocol – C
heck pointing – re3covering from a System
Crash – M
edia recovery – Other
approaches and Interaction with C
oncurrency control.
2005-20062005-2006
20
UNIT – VII
Overview
of Storage and Indexing : Data on External Storage – File O
rganization and Indexing –C
luster Indexes, Primary and Secondary Indexes – Index data Structures – H
ash Based Indexing – Treebase Indexing – C
omparison of File O
rganizations – Indexes and Performance Tuning.
UNIT – VIII
Storing data: Disks and Files : The Mem
ory Hierarchy – R
edundant Arrays of Independent – Disks –
Disk Space M
anagement – Buffer M
anager – Files of records – Page Formats – record form
ats.
Tree Structured Indexing : Intuitions for tree Indexes – Indexed Sequential Access Methods (ISAM
) –B+ Trees: A D
ynamic Index Structure.
Hash Based Indexing : Static Hashing – Extendable hashing – Linear H
ashing – Exendble vs. Linerhashing.
TEXT BOO
KS :
1.D
ata base Managem
ent Systems, R
aghurama Krishnan, Johannes G
ehrke, TATA McG
rawH
ill3
rd Edition
2.D
ata base System C
oncepts, Silberschatz, Korth, McG
raw hill, IV edition.
REFERENCES :
1.Introduction to D
atabase Systems, C
.J.Date Pearson Education
2.Data base System
s design, Implem
entation, and Managem
ent, Rob & Coronel 5th Edition.Thom
son
3.D
ata base Managem
ent System, Elm
asri Navrate Pearson Education
4.D
ata base Managem
ent System M
athew Leon, Leon Vikas.
5.D
ata base Systems, C
onnoley Pearson education.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
II Year B.Tech. CSE - I Semester
T P C
0 3 2
(CS 05008) ADVANCED DATA STRUCTURES (C++) LAB
1.W
rite C++ program
s to implem
ent the following using an array.
a) Stack ADT b) Q
ueue ADT
2.W
rite C++ program
s to implem
ent the following using a singly linked list.
a) Stack ADT b) Q
ueue ADT
3.W
rite C++ program to im
plement the deque (double ended queue) ADT using a doubly linked list.
4. W
rite a C++ program
to perform the follow
ing operations :
a)Insert an elem
ent into a binary search tree.
b)D
elete an element from
a binary search tree.
c)Search for a key elem
ent in a binary search tree.
5.W
rite a C++ program
to implem
ent circular queue ADT using an array.
6.W
rite C++ program
s that use non-recursive functions to traverse the given binary tree in
a)Preorder b) inorder and c) postorder.
7.W
rite a C++ program
s for the implem
entation of bfs and dfs for a given graph.
8.W
rite C++ program
s for implem
enting the following sorting m
ethods :
a) Quick sort b) M
erge sort c) Heap sort
9.W
rite a C++ program
to perform the follow
ing operations
a) Insertion into a B-tree b) Deletion from
a B-tree
10.W
rite a C++ program
to perform the follow
ing operations
a) Insertion into an AVL-tree b) Deletion from
an AVL-tree
11.W
rite a C++ program
to implem
ent Kruskal’s algorithm to generate a m
inimum
spanning tree.
12.W
rite a C++ program
for implem
enting Knuth-Morris pattern m
atching algorithm .
Write a C
++ program to im
plement all the functions of a dictionary (AD
T) using hashing.
( Note : Use class tem
plates in all the above programs )
2005-20062005-2006
21
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - I Semester
T P C0 3 2
(CS 05157) DATABASE MANAG
EMENT SYSTEM
S LAB
1.C
reating tables for various relations (in SQL)
2.Im
plementing the queries in SQ
L for
a)Insertion
b)R
etrival (Implem
ent all the operation like Union, Intersect, M
inus, in, exist, aggregatefunctions (M
in.,Max…
) etc…
c)Updation
d)Deletion
3.C
reating Views
4.W
riting Assertions
5.W
riting Triggers
6.Im
plementing O
perations on relations (tables) using PL/SQL
7.C
reating FOR
MS
8.G
enerating REPO
RTS.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05521) SOFTW
ARE ENGINEERING
UNIT-I : Introduction to Software Engineering : The evolving role of softw
are, Changing N
ature ofSoftw
are, Software m
yths.A G
eneric view of process : Softw
are engineering- A layered technology, a process framew
ork, TheC
apability Maturity M
odel Integration (CM
MI), Process patterns, process assessm
ent, personal and teamprocess m
odels.UNIT-II : Process m
odels : The waterfall m
odel, Incremental process m
odels, Evolutionary processm
odels, The Unified process.
Software Requirem
ents : Functional and non-functional requirements, U
ser requirements, System
requirements, Interface specification, the softw
are requirements docum
ent.UNIT-III : Requirem
ents engineering process : Feasibility studies, Requirem
ents elicitation andanalysis, R
equirements validation, R
equirements m
anagement.
System m
odels : Context Models, Behavioral m
odels, Data models, O
bject models, structured m
ethods.UNIT-IV : Design Engineering : D
esign process and Design quality, D
esign concepts, the designm
odel.Creating an architectural design : Softw
are architecture, Data design, Architectural styles and patterns,
Architectural Design.
UNIT-V : Object-O
riented Design : Objects and object classes, An O
bject-Oriented design process,
Design evolution.Perform
ing User interface design : Golden rules, U
ser interface analysis and design, interfaceanalysis, interface design steps, D
esign evaluation.UNIT-VI : Testing Strategies : A strategic approach to softw
are testing, test strategies for conventionalsoftw
are, Black-Box and White-Box testing, Validation testing, System
testing, the art of Debugging.
Product metrics : Softw
are Quality, M
etrics for Analysis Model, M
etrics for Design M
odel, Metrics for
source code, Metrics for testing, M
etrics for maintenance.
UNIT-VII : Metrics for Process and Products : Softw
are Measurem
ent, Metrics for softw
are quality.Risk m
anagement : R
eactive vs Proactive Risk strategies, softw
are risks, Risk identification, R
iskprojection, R
isk refinement, R
MM
M, R
MM
M Plan.
UNIT-VIII : Quality M
anagement : Q
uality concepts, Software quality assurance, Softw
are Review
s,Form
al technical reviews, Statistical Softw
are quality Assurance, Software reliability, The ISO
9000quality standards.TEXT BO
OKS :
1.Softw
are Engineering, A practitioner’s Approach- Roger S. Pressm
an, 6th edition.M
cGraw
Hill
International Edition.2.
Software Engineering- Som
merville, 7
th edition, Pearson education.REFERENCES :1.
Software Engineering- K.K. Agarw
al & Yogesh Singh,New
Age International Publishers2.
Software Engineering, an Engineering approach- Jam
es F. Peters, Witold Pedrycz, John W
iely.3.
Systems Analysis and D
esign- Shely Cashm
an Rosenblatt,Thom
son Publications.4.
Software Engineering principles and practice- Wam
an S Jawadekar, The McG
raw-Hill Companies.
2005-20062005-2006
22
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
II Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05160) DESIGN AND ANALYSIS O
F ALGO
RITHMS
UNIT-IIntroduction: Algorithm
,Psuedo code for expressing algorithms,Perform
ance Analysis-Space complexity,Tim
ecom
plexity,Asymptotic N
otation- Big oh notation,Om
ega notation,Theta notation and Little ohnotation,Probabilistic analysis,Am
ortized analysis.U
NIT-II
Divide and conquer: G
eneral method ,applications-Binary search,Q
uick sort, Merge sort, Strassen’s
matrix m
ultiplication.U
NIT-III
Greedy m
ethod: General m
ethod, applications-Job sequencing with dead lines, 0/1 knapsack problem
,M
inimum
cost spanning trees, Single source shortest path problem.
UN
IT-VID
ynamic Program
ming: G
eneral method, applications-M
atrix chain multiplication,O
ptimal binary search
trees,0/1 knapsack problem, All pairs shortest path problem
,Travelling sales person problem, R
eliabilitydesign.U
NIT-V
Searching and Traversal Techniques: Efficient non recursive binary traversal algorithms, G
raph traversal-Breadth first search and D
epth first search, AND
/OR
graphs, game tree, Bi-connected com
ponents.U
NIT-VI
Backtracking: General m
ethod, applications-n-queen problem, sum
of subsets problem, graph coloring,
Ham
iltonian cycles.U
NIT-VII
Branch and Bound: General m
ethod, applications - Travelling sales person problem,0/1 knapsack problem
-LC
Branch and Bound solution, FIFO Branch and Bound solution.
UN
IT-VIIIN
P-Hard and N
P-Com
plete problems: Basic concepts, non determ
inistic algorithms, N
P - Hard and N
P-C
omplete classes,C
ook’s theorem.
TEXT BOO
KS :1.
Fundamentals of Com
puter Algorithms,Ellis Horowitz,Satraj Sahni and S.Rajasekharam
,Galgotia
publications pvt. Ltd.2.
Introduction to Algorithms,secondedition,T.H.Corm
en,C.E.Leiserson, R.L.Rivest,and C.Stein,PHIPvt. Ltd./ Pearson Education.
REFERENCES :1.
Algorithm
Design: Foundations,A
nalysis and Internet examples, M
.T.Goodrich and
R.Tom
assia,John wiley and sons.
2.Introduction to D
esign and Analysis of Algorithms A strategic approach, R
.C.T.Lee, S.S.Tseng,
R.C
.Chang and T.Tsai, M
c Graw
Hill.
3.D
ata structures and Algorithm Analysis in C
++, Allen Weiss, Second edition, Pearson education.
4.D
esign and Analysis of algorithms,Aho,U
llman and H
opcroft,Pearson education.5.
Algorithms – R
ichard Johnson baugh and Marcus Schaefer, Pearson Educatin
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
II Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CE 05239) ENVIRONM
ENTAL STUDIES
UNIT - I
Multidisciplinary nature of Environm
ental Studies: Definition, Scope and Im
portance – Need for
Public Awareness.
UNIT - II
Natural Resources : Renew
able and non-renewable resources – N
atural resources and associatedproblem
s – Forest resources – Use and over – exploitation, deforestation, case studies – Timber extraction
– Mining, dam
s and other effects on forest and tribal people – Water resources – U
se and over utilizationof surface and ground w
ater – Floods, drought, conflicts over water, dam
s – benefits and problems -
Mineral resources: U
se and exploitation, environmental effects of extracting and using m
ineral resources,case studies. - Food resources: W
orld food problems, changes caused by agriculture and overgrazing,
effects of modern agriculture, fertilizer-pesticide problem
s, water logging, salinity, case studies. - Energy
resources: Grow
ing energy needs, renewable and non-renew
able energy sources use of alternate energysources. Case studies. Land resources: Land as a resource, land degradation, m
an induced landslides, soilerosion and desertification. R
ole of an individual in conservation of natural resources. Equitable use ofresources for sustainable lifestyles.
UNIT - III
Ecosystems : C
oncept of an ecosystem. - Structure and function of an ecosystem
. - Producers,consum
ers and decomposers. - Energy flow in the ecosystem
- Ecological succession. - Food chains, foodw
ebs and ecological pyramids. - Introduction, types, characteristic features, structure and function of the
following ecosystem
:
a. Forest ecosystem
b. Grassland ecosystem
c. Desert ecosystem
d. Aquatic ecosystems (ponds, stream
s, lakes, rivers, oceans, estuaries)
UNIT - IV
Biodiversity and its conservation : Introduction - Definition: genetic, species and ecosystem
diversity.- Bio-geographical classification of India - Value of biodiversity: consum
ptive use, productive use, social,ethical, aesthetic and option values - . Biodiversity at global, N
ational and local levels. - . India as a mega-
diversity nation - Hot-sports of biodiversity - Threats to biodiversity: habitat loss, poaching of w
ildlife, man-
wildlife conflicts. - Endangered and endem
ic species of India - Conservation of biodiversity: In-situ and Ex-
situ conservation of biodiversity.
UNIT - V
Environmental Pollution : D
efinition, Cause, effects and control m
easures of :
2005-20062005-2006
23
a.Air pollution
b.W
ater pollution
c.Soil pollution
d.M
arine pollution
e.Noise pollution
f.Therm
al pollution
g.Nuclear hazards
Solid waste M
anagement : C
auses, effects and control measures of urban and industrial w
astes. - Role
of an individual in prevention of pollution. - Pollution case studies. - Disaster m
anagement: floods,
earthquake, cyclone and landslides.
UNIT - VI
Social Issues and the Environment : From
Unsustainable to Sustainable development -Urban problem
srelated to energy -W
ater conservation, rain water harvesting, w
atershed managem
ent -Resettlem
ent andrehabilitation of people; its problem
s and concerns. Case Studies -Environm
ental ethics: Issues andpossible solutions. -C
limate change, global w
arming, acid rain, ozone layer depletion, nuclear accidents
and holocaust. Case Studies. -W
asteland reclamation. -C
onsumerism
and waste products. -Environm
entProtection Act. -Air (Prevention and C
ontrol of Pollution) Act. -Water (Prevention and control of Pollution)
Act -Wildlife Protection Act -Forest C
onservation Act -Issues involved in enforcement of environm
entallegislation. -Public aw
areness.
UNIT - VII
Human Population and the Environm
ent : Population growth, variation am
ong nations. Populationexplosion - Fam
ily Welfare Program
me. -Environm
ent and human health. -Hum
an Rights. -Value Education.-H
IV/AIDS. -W
omen and C
hild Welfare. -R
ole of information Technology in Environm
ent and human
health. -Case Studies.
UNIT - VIII
Field work : Visit to a local area to docum
ent environmental assets R
iver /forest grassland/hill/mountain
-Visit to a local polluted site-Urban/R
ural/industrial/ Agricultural Study of comm
on plants, insects, birds. -Study of sim
ple ecosystems-pond, river, hill slopes, etc.
TEXTBOO
K :
Textbook of Environmental Studies for U
ndergraduate Courses by Erach Bharucha for U
niversity Grants
Comm
ission.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - II Semester
T P C4+1 0 4
(EC 05471) PRINCIPLES OF CO
MM
UNICATIONS
UNIT-I
Introduction : Block diagram of Electrical com
munication system
, Radio com
munication : Types of
comm
unications, Analog, pulse, and digital, Types of signals, Fourier Transform for various signals,
Fourier Spectrum, Pow
er spectral density, Autocorrelation, correlation, convolution.
UN
IT-II
Amplitude M
odulation : Need for m
odulation, Types of Amplitude m
odulation, AM, D
SB SC, SSB SC
,Pow
er and BW requirem
ents, generation of AM, D
SB SC, SSB SC
, Dem
odulation of AM : D
iodedetector, Product dem
odulation for DSB SC
& SSB SC.
UN
IT-III
Angle M
odulation : Frequency & Phase modulations, advantages of FM
over AM, Bandw
idthconsideration, N
arrow band and W
ide band FM, C
omparison of FM
& PM.
UN
IT-IV
Pulse Modulations : Sam
pling, Nyquist rate of sam
pling, Sampling theorem
for Band limited signals,
PAM, regeneration of base band signal, PW
M and PPM
, Time D
ivison Multiplexing, Frequency D
ivisonM
ultiplexing, Asynchronous Multiplexing.
UN
IT-V
Digital Comm
unication : Advantages, Block diagram of PC
M, Q
uantization, effect of quantization,quantization error, Base band digital signal, D
M, AD
M, AD
PCM
and comparison.
UN
IT-VI
Digital Modulation : ASK, FSK, PSK, D
PSK, QPSK dem
odulation, coherent and incoherent reception,M
odems.
UN
IT-VII
Information Theory : Concept of inform
ation, rate of information and entropy, Source coding for optim
umrate of inform
ation, Coding efficiency, Shanon-Fano and H
uffman coding.
UN
IT-VIII
Error control coding : Introduction, Error detection and correction codes, block codes, convolutioncodes.
TEXT BOO
KS :
1.C
omm
unication Systems Analog and D
igital – R.P. Singh, SD
Sapre, TMH
, 20th reprint, 2004.
2.Principle of C
omm
unications, Taub & Schilling, TMH
, 2003.
REFERENCES :
1.Electronic C
omm
unication Systems – Kennedy & D
avis, TMH
, 4th edition, 2004.
2.C
omm
unication Systems Engineering – John. G
. Proakis, Masoud and Salehi, 2
nd Ed. PHI/
Pearson.
2005-20062005-2006
24
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - II Semester
T P C4+1 0 4
(EC 05400) MICRO
PROCESSO
RS AND INTERFACING
UNIT-IAn over view of 8085, Architecture of 8086 M
icroprocessor. Special functions of General purpose registers.
8086 flag register and function of 8086 Flags.U
NIT-II
Addressing modes of 8086. Instruction set of 8086. Assem
bler directives, simple program
s, procedures,and m
acros.U
NIT-III
Assembly language program
s involving logical, Branch & Call instructions, sorting, evaluation of arithmetic
expressions, string manipulation.
UN
IT-IVPin diagram
of 8086-Minim
um m
ode and maxim
um m
ode of operation. Timing diagram
. Mem
ory interfacingto 8086 (Static R
AM & EPR
OM
). Need for D
MA. D
MA data transfer M
ethod. Interfacing with 8237/8257.
UN
IT-V8255 PPI – various m
odes of operation and interfacing to 8086. Interfacing Keyboard, Displays, Stepper
Motor and actuators. D
/A and A/D converter interfacing.
UN
IT-VIInterrupt structure of 8086. Vector interrupt table. Interrupt service routines. Introduction to D
OS and
BIOS interrupts. 8259 PIC Architecture and interfacing cascading of interrupt controller and its im
portance.U
NIT-VII
Serial data transfer schemes. Asynchronous and Synchronous data transfer schem
es. 8251 USAR
Tarchitecture and interfacing. TTL to R
S 232C and R
S232C to TTL conversion. Sam
ple program of serial
data transfer. Introduction to High-speed serial com
munications standards, U
SB.U
NIT-VIII
8051 Microcontroller Architecture, R
egister set of 8051, Modes of tim
er operation, Serial port operation,Interrupt structure of 8051, M
emory and I/O
interfacing of 8051.TEXT BO
OKS :
1.Advanced m
icroprocessor and Peripherals - A.K.Ray and K.M
.Bhurchandi, TMH
, 2000.2.
Microprocessors and interfacing - D
ouglas V. Hall, TM
H, 2
nd Edition, 1999.REFERENCES :1.
Micro com
puter systems, The 8086/8088 Fam
ily Architecture, Programm
ing and Design - Y.Liu
and G.A. G
ibson, PHI, 2
nd edition.2.
Microprocessors 8086/ 8088 - Avatar singh and Triebel, PH
I.3.
Assembly Language Techniques for the IBM
PC - Alan R
, Miller, BPB (for D
OS and BIO
Sinterrupts only)
4.M
icro Controllers - R
ajkamal, Pearson Education, 2005.
5.D
esign with PIC
Micro C
ontrollers – John B. Peatman, 2005.
6.8051 M
icro Controllers and Em
bedded Systems – D
r. Rajiv Kapadia, Jaico Publishers.
7.8086 M
icro Processor - Kenneth J. Ayala, Penram International/ Thom
son, 1995.8.
8051 Microcontroller - Kenneth J. Ayala, Penram
International/ Thomson, 3
rd Edition, 2005.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05434) OO
PS THROUG
H JAVA
UNIT-I
Introduction : Creation of Java, im
portance of Java to internet, byte code, Java buzzwords, O
OP
Principles, Encapsulation, Inheritance and Polymorphism
, data types, variables, declaring variables,dynam
ic initialization, scope and life time of variables, arrays, operators, control statem
ents, type conversionand casting, com
piling and running of simple Java program
.
UN
IT-II
Classes and Objects : C
oncepts of classes and objects, class fundamentals D
eclaring objects,assigning object reference variables, introducing m
ethods,constructors, usage of static with data and
methods, usage of final w
ith data, access control, this key word, garbage collection, overloading m
ethodsand constructors, param
eter passing – call by value, recursion,nested classes and inner classes,exploring the String class.
UN
IT-III
Inheritance : Basic concepts, mem
ber access rules, usage of super key word, form
s of inheritance,m
ethod overriding, abstract classes, dynamic m
ethod dispatch, using final with inheritance, the O
bjectclass.
UN
IT-IV
Packages and Interfaces : Defining, Creating and Accessing a Package, Understanding CLASSPATH,im
porting packages, differences between classes and interfaces, defining an interface, im
plementing
interface, applying interfaces, variables in interface and extending interfaces.
UN
IT-V
Exception Handling and Multithreading : C
oncepts of Exception handling, types of exceptions, usageof try, catch, throw
, throws and finally keyw
ords, Built-in exceptions, creating own exception sub classes,
Concepts of M
ultithreading, differences between process and thread, thread life cycle,creating m
ultiplethreads using Thread class, R
unnable interface, Synchronization, thread priorities, inter threadcom
munication, daem
on threads,deadlocks, thread groups.
UN
IT-VI
Event Handling : Events, Event sources, Event classes, Event Listeners, Delegation event m
odel,handling m
ouse and keyboard events, Adapter classes.
AWT : C
oncepts of components, container, panel, w
indow, fram
e, canvas, Font class, Color class and
Graphics.
UN
IT-VII
AWT Controls : Buttons, Labels, Text fields, Text area, C
heck boxes, Check box groups, Lists, C
hoice,Scrollbars, M
enus, Layout Managers – Flow
, Border,Grid, C
ard and Gridbag.
2005-20062005-2006
25
Swing – JApplet, JFram
e and JCom
ponent, Icons and Labels, Handling threading issues, text fields,
buttons – The JButton class, Check boxes, R
adio buttons, Com
bo boxes, Tabbed Panes, Scroll Panes,Trees, and Tables.
Applets – Concepts of Applets, differences betw
een applets and applications,life cycle of an applet, typesof applets, creating applets, passing param
eters to applets.
UN
IT-VIII
Networking and Java Library : Basics of N
etworking, Inetaddress, TC
P/IP sockets, Datagram
s,U
RL, U
RL connection, String handling, java.util, java.io and java.net packages.
TEXT BOO
KS :
1.The C
omplete R
eference Java J2SE 5th Edition, H
erbert Schildt, TMH
Publishing Com
pany Ltd,NewDelhi.
2.Big Java 2
nd Edition, Cay H
orstmann, John W
iley and Sons.
REFERENCES :
1.Java H
ow to Program
, Sixth Edition, H.M
.Dietel and P.J.D
ietel, Pearson Education/PHI
2.C
ore Java 2, Vol 1, Fundamentals, C
ay.S.Horstm
ann and Gary C
ornell, Seventh Edition,Pearson Education.
3.C
ore Java 2, Vol 2, Advanced Features, Cay.S.H
orstmann and G
ary Cornell, Seventh Edition,
Pearson Education.
4.Beginning in Java 2, Iver H
orton, Wrox Publications.
5.Java, Som
asundaram, Jaico.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - II Semester
T P C0 3 2
(CS 05338) JAVA LAB1.
Write a Java program
that prints all real solutions to the quadratic equation ax2 + bx + c = 0. R
eadin a, b, c and use the quadratic form
ula. If the discriminant b
2 -4ac is negative, display a message
stating that there are no real solutions.2.
The Fibonacci sequence is defined by the following rule. The fist tw
o values in the sequence are 1and 1. Every subsequent value is the run of the tw
o values preceding it. Write a Java program
thatuses both recursive and non recursive functions to print the nth value in the Fibonacci sequence.
3.W
rite a Java program that prom
pts the user for an integer and then prints out all prime num
bers upto that. Integer.
4.W
rite a Java program that checks w
hether a given string is a palindrome or not. Ex: M
ADAM
is apalindrom
e.5.
Write a Java program
for sorting a given list of names in ascending order.
6.W
rite a Java program to m
ultiply two given m
atrices.7.
Write a Java Program
that reads a line of integers, and then displays each integers, and the sum of
all the integers (use string to kenizer class)8.
Write a Java program
that reads on file name from
the user then displays information about w
hetherthe file exists, w
hether the file is readable, whether the file is w
ritable, the type of file and the lengthof the file in bytes.
9.W
rite a Java program that reads a file and displays a file and displays the file on the screen, w
ith aline num
ber before each line.10.
Write a Java program
that displays the number of characters, lines and w
ords in a text file.11.
Write a Java program
that:a)
Implem
ents stack ADT.
b) Converts infix expression into Postfix form
.12.
Write an applet that displays a sim
ple message.
13.W
rite an applet that computes the paym
ent of a loan based on the amount of the loan, the interest
rate and the number of m
onths. It takes one parameter from
the browser: M
onthly rate; if true, theinterest rate is per m
onth; Other w
ise the interest rate is annual.14.
Write a Java program
that works as a sim
ple calculator. Use a grid layout to arrange buttons for the
digits and for the + - X % operations. Add a text field to display the result.
15.W
rite a Java program for handling m
ouse events.16.
Write a Java program
for creating multiple threads
17.W
rite a Java program that correctly im
plements producer consum
er problem using the concept of
inter thread comm
unication.18.
Write a Java program
that lets users create Pie charts. Design your ow
n user interface (with sw
ings& AW
T)19.
Write a Java program
that allows the user to draw
lines, rectangles and OU
.als.20.
Write a Java program
that implem
ents a simple client/server application. The client sends data to
a server. The server receives the data, uses it to produce a result, and then sends the result backto the client. The client displays the result on the console. For ex: The data sent from
the client isthe radius of a circle, and the result produced by the server is the area of the circle.
21.W
rite a Java program that illustrates how
run time polym
orphism is achieved.
2005-20062005-2006
26
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
II Year B.Tech. CSE - II Semester
T P C0 3 2
(EC 05401) MICRO
PROCESSO
RS LAB
I.M
icroprocessor 8086 :
1.Introduction to M
ASM/TASM
.
2.Arithm
etic operation – Multi byte Addition and Subtraction, M
ultiplication and Division –
Signed and unsigned Arithmetic operation, ASC
II – arithmetic operation.
3.Logic operations – Shift and rotate – C
onverting packed BCD
to unpacked BCD
, BCD
to ASCII conversion.
4.By using string operation and Instruction prefix: M
ove Block, Reverse string, Sorting,
Inserting, Deleting, Length of the string, String com
parison.
5.DO
S/BIOS program
ming: Reading keyboard (Buffered with and without echo) – Display
characters, Strings.
II.Interfacing :
1.8259 – Interrupt C
ontroller:
Generate an interrupt using 8259 tim
er.
2.8279 – Keyboard D
isplay:
Write a sm
all program to display a string
of characters.
3.8255 – PPI
:W
rite ALP to generate sinusoidal wave
using PPI.
4.8251 – U
SART
:W
rite a program in ALP to establish
Com
munication betw
een two
processors.
III.M
icrocontroller 8051 :
1.R
eading and Writing on a parallel port.
2.Tim
er in different modes.
3.Serial com
munication im
plementation.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
III Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05263) FORM
AL LANGUAG
ES AND AUTOM
ATA THEORY
The purpose of this course is to acquaint the student with an overview
of the theoretical foundations ofcom
puter science from the perspective of form
al languages.
•C
lassify machines by their pow
er to recognize languages.
•Em
ploy finite state machines to solve problem
s in computing.
•Explain determ
inistic and non-deterministic m
achines.
•C
omprehend the hierarchy of problem
s arising in the computer sciences.
UNIT - I
Fundamentals : Strings, Alphabet, Language, O
perations, Finite state machine, definitions, finite autom
atonm
odel, acceptance of strings, and languages, deterministic finite autom
aton and non deterministic finite
automaton, transition diagram
s and Language recognizers.
UNIT - II
Finite Automata : N
FA with Î transitions - Significance, acceptance of languages. C
onversions andEquivalence : Equivalence betw
een NFA w
ith and without Î transitions, N
FA to DFA conversion,
minim
isation of FSM, equivalence betw
een two FSM
’s, Finite Automata w
ith output- Moore and M
elaym
achines.
UNIT - III
Regular Languages : Regular sets, regular expressions, identity rules, C
onstructing finite Automata for
a given regular expressions, Conversion of Finite Autom
ata to Regular expressions. Pum
ping lemm
a ofregular sets, closure properties of regular sets (proofs not required).
UNIT - IV
Gram
mar Form
alism : R
egular gramm
ars-right linear and left linear gramm
ars, equivalence between
regular linear gramm
ar and FA, inter conversion, Context free gram
mar, derivation trees, sentential form
s.R
ight most and leftm
ost derivation of strings,
UNIT - V
Context Free Gram
mars : Am
biguity in context free gramm
ars. Minim
isation of Context Free Gram
mars.
Chomsky norm
al form, G
reiback normal form
, Pumping Lem
ma for Context Free Languages. Enum
erationof properties of C
FL (proofs omitted).
UNIT - VI
Push Down Autom
ata : Push down autom
ata, definition, model, acceptance of C
FL, Acceptance byfinal state and acceptance by em
pty state and its equivalence. Equivalence of CFL and PDA, interconversion.(Proofs not required). Introduction to D
CFL and D
PDA.
UNIT - VII
Turing Machine : Turing M
achine, definition, model, design of TM
, Com
putable functions, recursivelyenum
erable languages. Church’s hypothesis, counter m
achine, types of Turing machines (proofs not
required).
2005-20062005-2006
27
UNIT VIII
Computability Theory : Chom
sky hierarchy of languages, linear bounded automata and context sensitive
language, LR(0) gram
mar, decidability of, problem
s, Universal Turing M
achine, undecidability of posts.C
orrespondence problem, Turing reducibility, D
efinition of P and NP problem
s, NP com
plete and NP hard
problems.
TEXT BOO
KS :
1.“Introduction to Autom
ata Theory Languages and Com
putation”. Hopcroft H
.E. and Ullm
an J. D.
Pearson Education
2.Introduction to C
omputer Theory, D
aniel I.A. Cohen, John W
iley.
REFERENCES :
1.Introduction to languages and the Theory of C
omputation ,John C
Martin, TM
H
2.“Elem
ents of Theory of Com
putation”, Lewis H
.P. & Papadimition C
.H. Pearson /PH
I.
3.Theory of C
omputer Science – Autom
ata languages and computation -M
ishra andC
handrashekaran, 2nd edition, PH
I
4.Introduction to Theory of C
omputation –Sipser 2
nd edition Thomson
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
III Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05432) OBJECT O
RIENTED ANALYSIS AND DESIGN
UNIT - I
Introduction to UML : Im
portance of modeling, principles of m
odeling, object oriented modeling,
conceptual model of the U
ML, Architecture, Softw
are Developm
ent Life Cycle.
UNIT - II
Basic Structural Modeling : C
lasses, Relationships, com
mon M
echanisms, and diagram
s.
Advanced Structural Modeling : Advanced classes, advanced relationships, Interfaces, Types and
Roles, Packages.
UNIT - III
Class & Object Diagram
s : Terms, concepts, m
odeling techniques for Class & O
bject Diagram
s.
UNIT- IV
Basic Behavioral Modeling-I : Interactions, Interaction diagram
s.
UNIT - V
Basic Behavioral Modeling-II : U
se cases, Use case D
iagrams, Activity D
iagrams.
UNIT - VI
Advanced Behavioral Modeling : Events and signals, state m
achines, processes and Threads, time
and space, state chart diagrams.
UN
IT-VII
Architectural Modeling : C
omponent, D
eployment, C
omponent diagram
s and Deploym
ent diagrams.
UNIT - VIII
Case Study : The Unified Library application.
TEXT BOO
KS :
1.G
rady Booch, James R
umbaugh, Ivar Jacobson : The U
nified Modeling Language U
ser Guide,
Pearson Education.
2.Hans-Erik Eriksson, M
agnus Penker, Brian Lyons, David Fado: UML 2 Toolkit, W
ILEY-Dreamtech
India Pvt. Ltd.
REFER
ENC
E BO
OK
S:
1.M
eilir Page-Jones: Fundamentals of O
bject Oriented D
esign in UM
L, Pearson Education.
2.Pascal R
oques: Modeling Softw
are Systems U
sing UM
L2, WILEY-D
reamtech India Pvt. Ltd.
3.Atul Kahate: O
bject Oriented Analysis & D
esign, The McG
raw-H
ill Com
panies.
4.M
ark Priestley: Practical Object-O
riented Design w
ith UM
L,TATA McG
rawH
ill
5.Appling U
ML and Patterns: An introduction to O
bject – Oriented Analysis and D
esign and Unified
Process, Craig Larm
an, Pearson Education.
2005-20062005-2006
28
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
III Year B.Tech. CSE - I Semester
T P C4+1 0 4
(HS 05353) MANAG
ERIAL ECONO
MICS AND FINANCIAL ANALYSIS
UNIT - I
Introduction to Managerial Econom
ics : Definition, N
ature and Scope Managerial Econom
ics–D
emand Analysis: D
emand D
eterminants, Law
of Dem
and and its exceptions.
UNIT - II
Elasticity of Demand : D
efinition, Types, Measurem
ent and Significance of Elasticity of Dem
and.D
emand Forecasting, Factors governing dem
and forecasting, methods of dem
and forecasting (surveym
ethods, statistical methods, expert opinion m
ethod, test marketing, controlled experim
ents, judgmental
approach to demand forecasting)
UNIT - III
Theory of Production and Cost Analysis : Production Function – Isoquants and Isocosts, MR
TS,Least C
ost Com
bination of Inputs, Production function, Laws of R
eturns, Internal and External Economies
of Scale.
Cost Analysis : Cost concepts, O
pportunity cost, Fixed Vs.Variable costs, Explicit costs Vs.Implicit
costs, Out of pocket costs vs. Im
puted costs. Break-even Analysis (BEA)-Determ
ination of Break-EvenPoint (sim
ple problems)-M
anagerial Significance and limitations of BEA.
UNIT IV
Introduction to Markets & Pricing strategies
Market structures: Types of com
petition, Features of Perfect competition, M
onopoly and Monopolistic
Com
petition. Price-Output D
etermination in case of Perfect C
ompetition and M
onopoly. Pricing Strategies
UNIT V
Business & New Econom
ic Environment : C
haracteristic features of Business, Features andevaluation of Sole Proprietorship, Partnership, Joint Stock C
ompany, Public Enterprises and their types,
Changing Business Environm
ent in Post-liberalization scenario
UNIT VI
Capital and Capital Budgeting : Capital and its significance, Types of C
apital, Estimation of Fixed and
Working capital requirem
ents, Methods and sources of raising finance.
Nature and scope of capital budgeting, features of capital budgeting proposals, M
ethods of Capital
Budgeting: Payback Method, Accounting R
ate of Return (AR
R) and N
et Present Value Method (sim
pleproblem
s)
UNIT VII
Introduction to Financial Accounting : Double-Entry Book Keeping, Journal, Ledger, Trial Balance-
Final Accounts (Trading Account, Profit and Loss Account and Balance Sheet with sim
ple adjustments).
UNIT VIII
Financial Analysis through ratios : Com
putation, Analysis and Interpretation of Liquidity Ratios
(Current R
atio and quick ratio), Activity Ratios (Inventory turnover ratio and D
ebtor Turnover ratio), Capital
structure Ratios (D
ebt-Equity ratio, Interest Coverage ratio), and Profitability ratios (G
ross Profit Ratio,
Net Profit ratio, O
perating Ratio, P/E R
atio and EPS).
TEXT BOO
KS :
1.Aryasri: M
anagerial Economics and Financial Analysis, 2/e, TM
H, 2005.
2.Varshney & M
aheswari: M
anagerial Economics, Sultan C
hand, 2003.
REFERENCES :
1.Am
brish Gupta, Financial Accounting for M
anagement, Pearson Education, N
ew D
elhi, 2004.
2.Shim
&Siegel: Financial Accounting (Schaum’s O
utlines), 2/e, TMH
,2004
3.C
hary: Production and Operations M
anagement, 3/e, TM
H, 2004.
4.D
omnick Salvatore: M
anagerial Economics In a G
lobal Economy, 4
th Edition, Thomson, 2003.
5.N
arayanaswam
y: Financial Accounting—A M
anagerial Perspective, PHI, 2005
6.Peterson & Lew
is: Managerial Econom
ics, 4th Edition, Pearson Education, 2004
7.R
aghunatha Reddy & N
arasimhachary: M
anagerial Economics& Financial Analysis, Scitech,
2005.
8.S.N
.Mahesw
ari & S.K. Mahesw
ari, Financial Accounting, Vikas, 2005.
9.Truet and Truet: M
anagerial Economics:Analysis, Problem
s and Cases, W
iley, 2004.
10.D
wivedi:M
anagerial Economics, 6
th Ed., Vikas, 2002
11.Yogesh M
aheswari:M
anagerial Economics, 2
nd Ed.,PHI, 2005.
2005-20062005-2006
29
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
III Year B.Tech. CSE - I Semester
T P C
4+1 0 4
(CS 05435) OPERATING
SYSTEMS
UNIT – I
Computer System
and Operating System
Overview
: Overview
of Com
puter System hardw
are –Instruction execution – I/O
function – Interrupts – Mem
ory hierarchy – I.O C
omm
unication techniques.O
perating System O
bjectives and functions – Evaluation of operating System – Exam
ple Systems.
UNIT - II
Process Description – Process Control –Process States- Process and Threads - Exam
ples of Processdescription and C
ontrol.
UNIT- III
Concurrency : Principles of Concurrency – M
utual Exclusion – Software and hardw
are approaches –sem
aphores – Monitors – M
essage Passing – Readers W
riters Problem.
UNIT- IV
Principles of deadlock – deadlock prevention, detection and avoidance dining philosophers problem –
example System
s.
UNIT – V
Mem
ory Managem
ent : Mem
ory Managem
ent requirements – loading program
mes in to m
ain mem
ory –virtual m
emory – hardw
are and Control structures – O
S Software – Exam
ples of Mem
ory Managem
ent.
UNIT – VI
Uniprocessor Scheduling : Types of Scheduling – Scheduling algorithms – I/O
managem
ent and Disc
Scheduling – I/o devices – organization – of I/O function – O
S design issues – I/O buffering – D
isk I/O –
disk scheduling Policies – examples System
.
UNIT – VII
File Managem
ent and Security : Overview
of file managem
ent – file organization and access – FileD
irectories – File sharing – record blocking – secondary Storage Managem
ent – example system
.
UNIT – VIII
Security : Security threats – Protection – intruders – Viruses – trusted System.
TEXT BOO
KS :1.
Operating System
s’ – Internal and Design Principles Stallings, Fifth Edition–2005, Pearson
education/PHI
2.O
perating System Principles- Abraham
Silberchatz, Peter B. Galvin, G
reg Gagne 7
th Edition,John W
iley.
REFERENCES :1.
Operating System
A Design Approach-C
rowley,TM
H.
2.M
odern Operating System
s, Andrew S Tanenbaum
2nd edition Pearson/PH
I.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
III Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05138) COM
PUTER NETWO
RKSUNIT – I
Introduction : OSI, TC
P/IP and other networks m
odels, Examples of N
etworks: N
ovell Netw
orks,Arpanet, Internet, N
etwork Topologies W
AN, LAN
, MAN
.
UNIT - II
Physical Layer : Transmission m
edia copper, twisted pair wireless, switching and encoding asynchronouscom
munications; N
arrow band, broad band ISD
N and ATM
.
UNIT - III
Data link layer : Design issues, fram
ing, error detection and correction, CR
C, Elem
entary Protocol-stopand w
ait, Sliding Window
, Slip, Data link layer in H
DLC
, Internet, ATM.
UNIT - IV
Medium
Access sub layer : ALOH
A, MAC
addresses, Carrier sense m
ultiple access. IEEE 802.XStandard Ethernet, w
ireless LANS. Bridges,
UNIT - V
Network Layer : Virtual circuit and D
atagram subnets-R
outing algorithm shortest path routing, Flooding,
Hierarchical routing, Broad cast, M
ulti cast, distance vector routing.
UNIT – VI
Dynam
ic routing – Broadcast routing. Rotary for m
obility. Congestion, C
ontrol Algorithms – G
eneralPrinciples – of C
ongestion prevension policies. Internet working: The N
etwork layer in the internet and in
the ATM N
etworks.
UNIT –VII
Transport Layer: Transport Services, Connection m
anagement, TC
P and UD
P protocols; ATM AAL
Layer Protocol.
UNIT – VIII
Application Layer – Netw
ork Security, Dom
ain name system
, SNM
P, Electronic Mail; the W
orld WEB,
Multi M
edia.
TEXT BOO
KS :
1.C
omputer N
etworks —
Andrew S Tanenbaum
,4th Edition. Pearson Education/PH
I
2.D
ata Com
munications and N
etworking – Behrouz A. Forouzan.Third Edition TM
H.
REFERENCES :
1.An Engineering Approach to C
omputer N
etworks-S.Keshav, 2
nd Edition, Pearson Education
2.U
nderstanding comm
unications and Netw
orks, 3rd Edition, W
.A. Shay, Thomson
2005-20062005-2006
30
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
III Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05475) PRINCIPLES OF PRO
GRAM
MING
LANGUAG
ES
UNIT-I
Preliminary Concepts: Reasons for studying, concepts of program
ming languages, Program
ming dom
ains,Language Evaluation C
riteria, influences on Language design, Language categories, Programm
ingParadigm
s – Imperative, O
bject Oriented, functional Program
ming , Logic Program
ming. Program
ming
Language Implem
entation – Com
pilation and Virtual Machines, program
ming environm
ents.
UNIT – II
Syntax and Semantics: general Problem
of describing Syntax and Semantics, form
al methods of describing
syntax - BNF, EBN
F for comm
on programm
ing languages features, parse trees, ambiguous gram
mars,
attribute gramm
ars, denotational semantics and axiom
atic semantics for com
mon program
ming language
features.
UN
IT-III
Data types: Introduction, prim
itive, character, user defined, array, associative, record, union, pointer andreference types, design and im
plementation uses related to these types. N
ames ,Variable, concept of
binding, type checking, strong typing, type compatibility, nam
ed constants, variable initialization.
UN
IT-IV
Expressions and Statements: Arithm
etic relational and Boolean expressions, Short circuit evaluationm
ixed mode assignm
ent, Assignment Statem
ents, Control Structures – Statem
ent Level, Com
poundStatem
ents, Selection, Iteration, Unconditional Statem
ents, guarded comm
ands.
UNIT-V:
Subprograms and Blocks: Fundam
entals of sub-programs, Scope and lifetim
e of variable, static anddynam
ic scope, Design issues of subprograms and operations, local referencing environm
ents, parameter
passing methods, overloaded sub-program
s, generic sub-programs, param
eters that are sub-programnam
es, design issues for functions user defined overloaded operators, co routines.
UN
IT-VI
Abstract Data types: Abstractions and encapsulation, introductions to data abstraction, design issues,
language examples, C
++ parameterized AD
T, object oriented programm
ing in small talk, C
++, Java, C#,
Ada 95
Concurrency: Subprogram level concurrency, sem
aphores, monitors, m
assage passing, Java threads, C#threads.
UNIT - VII
Exception handling : Exceptions, exception Propagation, Exception handler in Ada, C++ and Java.
Logic Programm
ing Language : Introduction and overview of logic program
ming, basic elem
ents ofprolog, application of logic program
ming.
UNIT - VIII
Functional Programm
ing Languages: Introduction, fundamentals of FPL, LISP, M
L, Haskell, application of
Functional Programm
ing Languages and comparison of functional and im
perative Languages.
TEXT BOO
KS :
1.C
oncepts of Programm
ing Languages Robert .W
. Sebesta 6/e, Pearson Education.
2.Program
ming Languages D
esign and Implem
entation – Pratt and Zelkowitz, Fourth Edition PH
I/Pearson Education.
REFERENCES :
1.Program
ming languages –G
hezzi, 3/e, John Wiley
2.Program
ming Languages –Louden, Second Edition, Thom
son.
3.Program
ming languages –W
att, Wiley D
reamtech
4.LISP Patric H
enry Winston And Paul H
orn Pearson Education.
5.Program
ming in PR
OLO
G C
locksin, Springer
2005-20062005-2006
31
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
III Year B.Tech. CSE - I Semester
T P C0 3 2
(CS 05564) UML LAB
1.The student should take up the case study of Unified Library application which is m
entioned in the
theory, and Model it in different views i.e Use case view, logical view, com
ponent view, Deployment
view, D
atabase design, forward and R
everse Engineering, and Generation of docum
entation of
the project.
2.Student has to take up another case study of his/her ow
n interest and do the same w
hat ever
mentioned in first problem
. Some of the ideas regarding case studies are given in reference books
which w
ere mentioned in theory syllabus can be referred for som
e idea.
Note :The analysis, design, coding, docum
entation, database design of mini project which will be carried
out in 4th year should be done in object-oriented approach using U
ML and by using appropriate
software w
hich supports UM
L, otherwise the m
ini project will not be evaluated.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
III Year B.Tech. CSE - I Semester
T P C0 3 2
(CS 05139) COM
PUTER NETRWO
RKS AND OPERATING
SYSTEMS LAB
Part - A
1.Im
plement the data link layer fram
ing methods such as character, character stuffing and bit
stuffing.
2.Im
plement on a data set of characters the three C
RC
polynomials – C
RC
12, CR
C 16 and C
RC
CC
IP .
3.Im
plement D
ijkstra ‘s algorithm to com
pute the Shortest path thru a graph.
4.Take an exam
ple subnet graph with weights indicating delay between nodes. Now obtain Routingtable art each node using distance vector routing algorithm
5.Take an exam
ple subnet of hosts . Obtain broadcast tree for it.
6.Take a 64 bit playing text and encrypt the sam
e using DES algorithm
.
7.W
rite a program to break the above D
ES coding
8.U
sing RSA algorithm
Encrypt a text data and Decrypt the sam
e .
Part - B
1.Sim
ulate the following C
PU scheduling algorithm
s
a) Round R
obin b) SJF c) FCFS d) Priority
2.Sim
ulate all file allocation strategies
a) Sequentialb) Indexedc) Linked
3.Sim
ulate MVT and M
FT
4.Sim
ulate all File Organization Techniques
a) Single level directory b) Two level c) H
ierarchical d) DAG
5.Sim
ulate Bankers Algorithm for D
ead Lock Avoidance
6.Sim
ulate Bankers Algorithm for D
ead Lock Prevention
7.Sim
ulate all page replacement algorithm
s
a) FIFOb) LR
Uc) LFU
Etc. …
8.Sim
ulate Paging Technique of mem
ory managem
ent.
2005-20062005-2006
32
JAWAHARLAL NEHRU TECHNO
LOG
ICAL UNIVERSITYHYDERABAD
III Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05137) COM
PUTER GRAPHICS
UNIT - I
Introduction, Application areas of Computer G
raphics, overview of graphics systems, video-display devices,
raster-scan systems, random
scan systems, graphics m
onitors and work stations and input devices
(p.nos 22-90 of text book-1).
UNIT - II
Output prim
itives : Points and lines, line drawing algorithms, m
id-point circle and ellipse algorithms.Filled
area primitives: Scan line polygon fill algorithm
, boundary-fill and flood-fill algorithms (p.nos 103-123,137-
145,147-150,164-171 of text book-1, p.nos. 72-99 of text book-2).
UNIT - III
2-D geometrical transform
s : Translation, scaling, rotation, reflection and shear transformations, m
atrixrepresentations and hom
ogeneous coordinates, composite transform
s, transformations between coordinate
systems. (p.nos 204-227 of text book-1).
UNIT - IV
2-D viewing :
The viewing pipeline, viewing coordinate reference frame, window to view-port coordinate
transformation, view
ing functions, Cohen-Sutherland and C
yrus-beck line clipping algorithms, Sutherland
–Hodgeman polygon clipping algorithm
(p.nos 237-249,257-261 of text book -1, p.nos. 111-126 of text book-2).
UNIT - V
3-D object representation : Polygon surfaces, quadric surfaces, spline representation, H
ermite curve,
Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination m
odels, polygonrendering m
ethods. (p.nos 324-331,340-342, 347-364, 516-531, 542-546 of text book-1, p.nos 473-529,721-739 of text book-2).
UNIT - VI
3-D Geom
etric transformations : Translation, rotation, scaling, reflection and shear transform
ations,com
posite transformations.
3-D viewing :
Viewing pipeline, view
ing coordinates, view volum
e and general projection transforms
and clipping (p.nos 427-443, 452-481 of text book -1).
UN
IT-VII
Visible surface detection methods : C
lassification, back-face detection, depth-buffer, scan-line, depthsorting, BSP-tree m
ethods, area sub-division and octree methods(p.nos 489-505 of text book -1, C
hapter15 of of text book-2).
UN
IT-VIII
Computer anim
ation : Design of anim
ation sequence, general computer anim
ation functions, rasteranim
ation, computer anim
ation languages, key frame system
s, motion specifications. ( p.nos 604-616 of
text book -1, chapter 21 of text book-2).
TEXT BOO
KS :
1.“C
omputer G
raphics C version”, D
onald Hearn and M
.Pauline Baker, Pearson Education.
2.“C
omputer G
raphics Principles & practice”, second edition in C, Foley, VanD
am, Feiner and
Hughes, Pearson Education.
REFERENCES :
1.“C
omputer G
raphics”, second Edition, Donald H
earn and M.Pauline Baker, PH
I/PearsonEducation.
2.“Com
puter Graphics Second edition”, Zhigand xiang, Roy Plastock, Schaum
’s outlines, Tata Mc-
Graw
hill edition.
3.Procedural elem
ents for Com
puter Graphics, D
avid F Rogers, Tata M
c Graw
hill, 2nd edition.
4.“Principles of Interactive C
omputer G
raphics”, Neum
an and Sproul, TMH
.
5.Principles of C
omputer G
raphics, Shalini Govil, Pai, 2005, Springer.
6.C
omputer G
raphics, Steven Harrington, TM
H
2005-20062005-2006
33
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
III Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05130) COM
PILER DESIGN
UNIT – IO
verview of Com
pilation : Phases of Com
pilation – Lexical Analysis, Regular G
ramm
ar and regularexpression for com
mon program
ming language features, pass and Phases of translation, interpretation,
bootstrapping, data structures in compilation – LEX lexical analyzer generator.
UNIT – IITop dow
n Parsing : Context free gram
mars, Top dow
n parsing – Backtracking, LL (1), recursivedescent parsing, Predictive parsing, Preprocessing steps required for predictive parsing.
UNIT – IIIBottom
up parsing : Shift Reduce parsing, LR
and LALR parsing, Error recovery in parsing , handling
ambiguous gram
mar, YAC
C – autom
atic parser generator.
UNIT – IV Sem
antic analysis : Intermediate form
s of source Programs – abstract syntax tree, polish notation and
three address codes. Attributed gramm
ars, Syntax directed translation, Conversion of popular Programm
inglanguages language C
onstructs into Intermediate code form
s, Type checker.
UNIT – VSym
bol Tables : Symbol table form
at, organization for block structures languages, hashing, treestructures representation of scope inform
ation. Block structures and non block structure storage allocation:static, R
untime stack and heap storage allocation, storage allocation for arrays, strings and records.
UNIT – VICode optim
ization : Consideration for O
ptimization, Scope of O
ptimization, local optim
ization, loopoptim
ization, frequency reduction, folding, DAG
representation.
UNIT – VIIData flow
analysis : Flow graph, data flow
equation, global optimization, redundant sub expression
elimination, Induction variable elem
ents, Live variable analysis, Copy propagation.
UNIT – VIIIO
bject code generation : Object code form
s, machine dependent code optim
ization, register allocationand assignm
ent generic code generation algorithms, D
AG for register allocation.
TEXT BOO
KS :1.
Principles of compiler design -A.V. Aho . J.D
.Ullm
an; Pearson Education.
2.M
odern Com
piler Implem
entation in C- Andrew
N. Appel, C
ambridge U
niversity Press.
REFERENCES :1.
lex &yacc – John R. Levine, Tony M
ason, Doug Brow
n, O’reilly
2.M
odern Com
piler Design- D
ick Grune, H
enry E. Bal, Cariel T. H
. Jacobs, Wiley dream
tech.
3.Engineering a C
ompiler-C
ooper & Linda, Elsevier.
4.C
ompiler C
onstruction, Louden, Thomson.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
III Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05566) UNIX PROG
RAMM
INGUNIT - IUnix utilities –1 : Introduction to unix file system
, vi editor, file handling utilities, security by fileperm
issions, process utilities, disk utilities, networking com
mands, cp, m
v, ln, rm, unlink, m
kdir, rmdir, du,
df, mount, um
ount, find, unmask, ulim
it, ps, who, w
, finger, arp, ftp, telnet, rlogin.UNIT - IIUnix utilities –2:Text processing utilities and backup utilities , detailed com
mands to be covered are cat,
tail, head , sort, nl, uniq, grep, egrep,fgrep, cut, paste, join, tee, pg, comm
, cmp, diff, tr, aw
k, tar, cpio.UNIT - IIIProblem
solving approaches in Unix : Using single com
mands, using com
pound. Com
mands, shell
scripts, C program
s, building own com
mand library of program
s.UNIT - IVW
orking with the Bourne shell : W
hat is a shell, shell responsibilities, pipes and input Redirection,
output redirection, here documents, the shell as a program
ming language, shell m
eta characters, shellvariables, shell com
mands, the environm
ent, control structures, shell script examples.
UNIT - VUnix Internals - 1 : U
nix file structure, directories, files and devices, System calls, library functions,low
level file access, usage of open, creat, read, write, close, lseek, stat, fstat,ioctl, um
ask, dup and dup2, thestandard i/o (fopen, fopen, fclose,fflush, fseek, fgetc, getc, getchar, fputc, putc, putchar, fgets, gets ),form
atted I/O, stream
errors, streams and file descriptors, file and directory m
aintenance (chmod, chow
n,unlink, link, sym
link, mkdir, rm
dir, chdir, getcwd), D
irectory handling system calls (opendir, readdir,
closedir,rewinddir, seekdir, telldir).
UNIT - VIU
nix Internals – 2 : Process and Signals : What is process, process structure, starting new
process,Waiting for a process, zom
bie process, process control, process identifiers, fork, Vfork, exit, wait,
exec, Signal functions, unreliable signals, interrupted system C
alls, kill and raise functions, alarm, pause
functions, abort, system, sleep functions.
UNIT - VIIUnix Internals – 3 : D
ata Managem
ent : Managem
ent of mem
ory (malloc, free, realloc, calloc), File
Locking (creating lock files, Locking regions, use of read/write locking, com
peting locks, other comm
ands,deadlocks)UNIT - VIIIUnix Internals – 4 : Inter-Process com
munication : Pipe, Process Pipes, the pipe call, parent-child process,
named pipes : FIFO
s, Semaphores, m
essage queues and shared mem
ory and applications of IPC.TEXT BO
OKS :
1.U
nix the ultimate guide, Sum
itabha Das, TM
H.
2.U
nix Netw
ork Programm
ing, W.R
.Stevens Pearson/PHI.
REFERENCES :1.
Advanced programm
ing in the Unix environm
ent, W.R
.Stevens, Pearson education.2.
Unix system
programm
ing using C++, T.C
han, PHI.
3.U
nix programm
ing environment, Kernighan and Pike, PH
I. / Pearson Education4.
Unix Internals The N
ew Frontiers, U
.Vahalia, Pearson Education.5.
Unix for program
mers and users, 3
rd edition, Graham
Glass, King Ables, Pearson Education.
2005-20062005-2006
34
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
III Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05317) INFORM
ATION SECURITY
UNIT - ISecurity Attacks (Interruption, Interception, M
odification and Fabrication), Security Services (Confidentiality,Authentication, Integrity, N
on-repudiation, access Control and Availability) and M
echanisms, A m
odel forInternetw
ork security, Internet Standards and RFC
s, Buffer overflow & form
at string vulnerabilities, TCP
session hijacking, ARP attacks, route table m
odification, UD
P hijacking, and man-in-the-m
iddle attacks.UNIT - IIConventional Encryption Principles, Conventional encryption algorithm
s, cipher block modes of operation,
location of encryption devices, key distribution Approaches of Message Authentication, Secure H
ashFunctions and H
MAC
.UNIT - IIIPublic key cryptography principles, public key cryptography algorithm
s, digital signatures, digital Certificates,C
ertificate Authority and key managem
ent Kerberos, X.509 Directory Authentication Service.
UNIT - IVEm
ail privacy: Pretty Good Privacy (PG
P) and S/MIM
E.UNIT - VIP Security O
verview, IP Security Architecture, Authentication H
eader, Encapsulating Security Payload,C
ombining Security Associations and Key M
anagement.
UNIT - VIW
eb Security Requirem
ents, Secure Socket Layer (SSL) and Transport Layer Security (TLS), SecureElectronic Transaction (SET).UNIT - VIIBasic concepts of SN
MP, SN
MPv1 C
omm
unity facility and SNM
Pv3.Intruders, Viruses and related threats.UNIT - VIIIFirew
all Design principles, Trusted System
s.Intrusion D
etection Systems.
TEXT BOO
KS :1.
Network Security Essentials (Applications and Standards) by William
Stallings Pearson Education.2.
Hack Proofing your netw
ork by Ryan R
ussell, Dan Kam
insky, Rain Forest Puppy, Joe G
rand,D
avid Ahmad, H
al Flynn Ido Dubraw
sky, Steve W.M
anzuik and Ryan Perm
eh, wiley D
reamtech,
REFERENCES :1.
Fundamentals of N
etwork Security by Eric M
aiwald (D
reamtech press)
2.N
etwork Security - Private C
omm
unication in a Public World by C
harlie Kaufman, R
adiaPerlm
an and Mike Speciner, Pearson/PH
I.3.
Cryptography and netw
ork Security, Third edition, Stallings, PHI/Pearson
4.Principles of Inform
ation Security, Whitm
an, Thomson.
5.N
etwork Security: The com
plete reference, Robert Bragg, M
ark Rhodes, TM
H6.
Introduction to Cryptography, Buchm
ann, Springer.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
III Year B.Tech. CSE II Semester
T P C4+1 0 4
(CS 05424) NEURAL NETWO
RKS
UNIT - I
INTRODUCTIO
N - w
hat is a neural network? H
uman Brain, M
odels of a Neuron, N
eural networks view
edas D
irected Graphs, N
etwork Architectures, Know
ledge Representation, Artificial Intelligence and N
euralN
etworks (p. no’s 1 –49)
UNIT - II
LEARNING PRO
CESS – Error Correction learning, Mem
ory based learning, Hebbian learing, Competitive,
Boltzmann learning, C
redit Asssignment Problem
, Mem
ory, Adaption, Statistical nature of the learningprocess, (p. no’s 50 –116)
UNIT - III
SINGLE LAYER PERCEPTRO
NS – Adaptive filtering problem, U
nconstrained Organization Techniques,
Linear least square filters, least mean square algorithm
, learning curves, Learning rate annealing techniques,perceptron –convergence theorem
, Relation betw
een perceptron and Bayes classifier for a Gaussian
Environment (p. no’s 117 –155)
UNIT - IV
MU
LTILAYER
PERC
EPTRO
N – Back propagation algorithm
XOR
problem, H
euristics, Output
representation and decision rule, Com
uter experiment, feature detection, (p. no’s 156 –201)
UNIT - V
BACK PROPAG
ATION
- back propagation and differentiation, Hessian m
atrix, Generalization, C
rossvalidation, N
etwork pruning Techniques, Virtues and lim
itations of back propagation learning, Acceleratedconvergence, supervised learning. (p. no’s 202 –234)
UNIT - VI
SELF ORG
ANIZATION M
APS – Two basic feature m
apping models, Self organization m
ap, SOM
algorithm, properties of feature m
ap, computer sim
ulations, learning vector quantization, Adaptive patterclassification. (p. no’s . 443 –469, 9.1 –9.8 )
UNIT - VII
NEURO DYNAM
ICS – Dynam
ical systems, stavility of equilibrium
states, attractors, neurodynamical
models , m
anipulation of attarctors as a recurrent network paradigm
(p. no’s 664 –680, 14.1 –14.6 )
UNIT - VIII
HOPFIELD M
ODELS – H
opfield models, com
puter experiment I. (p. no’s. 680 - 701, 14.7 –14.8 )
TEXT BOO
K :
1.N
eural networks A com
prehensive foundations, Simon H
haykin, Pearson Education 2nd edition 2004
REFERENCES :
1.Artifical neural netw
orks - B.Vegnanarayana Prentice Halll of India P Ltd 2005
2.N
eural networks in C
omputer intelligence, Li M
in Fu TMH
2003
3.N
eural networks Jam
es A Freeman D
avid M S kapura pearson education 2004
2005-20062005-2006
35
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
III Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05523) SOFTW
ARE TESTING M
ETHODO
LOG
IES
UNIT - I
Introduction : Purpose of testing, Dichotom
ies, model for testing, consequences of bugs, taxonom
y ofbugs
UNIT - II
Flow graphs and Path testing : Basics concepts of path testing, predicates, path predicates and
achievable paths, path sensitizing, path instrumentation, application of path testing.
UNIT - III
Transaction Flow Testing : Transaction flow
s, transaction flow testing techniques. D
ataflow testing:-
Basics of dataflow testing, strategies in dataflow
testing, application of dataflow testing.
UNIT - IV
Domain Testing:-dom
ains and paths, Nice & ugly dom
ains, domain testing, dom
ains and interfacestesting, dom
ain and interface testing, domains and testability.
UNIT - V
Paths, Path products and Regular expressions : Path products & path expression, reduction procedure,applications, regular expressions & flow
anomaly detection.
UNIT - VI
Logic Based Testing : Overview
, decision tables, path expressions, kv charts, specifications.
UNIT - VII
State, State Graphs and Transition testing : State graphs, good & bad state graphs, state testing,
Testability tips.
UNIT - VIII
Graph M
atrices and Application : Motivational overview
, matrix of graph, relations, pow
er of a matrix,
node reduction algorithm, building tools. ( Student should be given an exposure to a tool like JM
eter or Win-
runner).
TEXT BOO
KS :
1.Softw
are Testing techniques - Baris Beizer, Dream
tech, second edition.
2.Softw
are Testing Tools – Dr.K.V.K.K.Prasad, D
reamtech.
REFERENCES :
1.The craft of softw
are testing - Brian Marick, Pearson Education.
2.Softw
are Testing Techniques – SPD(O
reille)
3.Softw
are Testing in the Real W
orld – Edward Kit, Pearson.
4.Effective m
ethods of Software Testing, Perry, John W
iley.
5.Art of Softw
are Testing – Meyers, John W
iley.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
III Year B.Tech. CSE - II Semester
T P C0 3 2
(CS 05318) INFORM
ATION SECURITY LAB
1.W
orking with Sniffers for m
onitoring network com
munication (Ethereal)
2.U
nderstanding of cryptographic algorithms and im
plementation of the sam
e in C or C
++
3.U
sing openssl for web server - brow
ser comm
unication
4.U
sing GN
U PG
P
5.Perform
ance evaluation of various cryptographic algorithms
6.U
sing IPTABLES on Linux and setting the filtering rules
7.C
onfiguring S/MIM
E for e-mail com
munication
8.U
nderstanding the buffer overflow and form
at string attacks
9.U
sing NM
AP for ports monitoring
10.Im
plementation of proxy based security protocols in C
or C++ w
ith features like confidentiality,integrity and authentication
Following are som
e of the web links, w
hich help to solve the above assignments :
·http://linuxcom
mand.org/m
an_pages/openssl1.html
·http://w
ww
.openssl.org/docs/apps/openssl.html
·http://w
ww
.queen.clara.net/pgp/art3.html
·http://ww
w.ccs.ornl.gov/~hongo/main/resources/contrib/gpg-howto/gpg-howto.htm
l
·https://netfiles.uiuc.edu/ehow
es/ww
w/gpg/gpg-com
-0.htm
·http://w
ww
.ethereal.com/docs/user-guide/
2005-20062005-2006
36
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
III Year B.Tech. CSE - II Semester
T P C0 3 2
(CS 05567) UNIX Programm
ing and Compiler Design Lab
PART - A
1.W
rite a shell script tp generate a multiplication table.
2.W
rite a shell script that copies multiple files to a directory.
3.W
rite a shell script which counts the num
ber of lines and words present in a given file.
4.W
rite a shell script which displays the list of all files in the given directory.
5.W
rite a shell script(small calculator) that adds, subtracts, m
ultiplies and divides the given two
integers. There are two division options: one returns the quotient and the other returns reminder. The
script requires 3 arguments: The operation to be used and tw
o integer numbers. The options are
add(-a), subtract(-s), multiply(-m
), quotient(-c) and reminder(-r).
6.W
rite a shell script to reverse the rows and colum
ns of a matrix.
7.W
rite a C program
that counts the number of blanks in a text file.
a)using standard I/O
b)using system
calls.
8.Im
plement in C
the following U
nix comm
ands using system calls.
a) catb) ls
c) mv
9.W
rite a program that takes one or m
ore file/directory names as com
mand line input and reports the
following inform
ation on the file:
c) File type.d) N
umber of links.
e) Time of last access.
f) Read, W
rite and Execute permissions.
10.W
rite a C program that illustrates how to execute two com
mands concurrently with a com
mand pipe.
11.W
rite a C program
that illustrates the creation of child process using fork system call.
12.W
rite a C program
that displays the real time of a day every 60 seconds.
13.W
rite a C program
that illustrates file locking using semaphores.
14.W
rite a C program
that implem
ents a producer-consumer system
with tw
o processes.(usingsem
aphores)
15.W
rite a C program
that illustrates inter process comm
unication using shared mem
ory system calls.
16.W
rite a C program
that illustrates the following.
g) Creating a m
essage queue.
h) Writing to a m
essage queue.
i) Reading from
a message queue.
PART - B
Objective : To provide an understanding of the language translation peculiarities by designing a com
pletetranslator for a m
ini language.
Consider the follow
ing mini Language, a sim
ple procedural high-level language, only operating on integerdata, w
ith a syntax looking vaguely like a simple C
crossed with Pascal. The syntax of the language is
defined by the following BN
F gramm
ar:
<program> ::= <block>
<block> ::= { <variabledefinition> <slist> }
| { <slist> }
<variabledefinition> ::= int <vardeflist> ;
<vardeflist> ::= <vardec> | <vardec> , <vardeflist>
<vardec> ::= <identifier> | <identifier> [ <constant> ]
<slist> ::= <statement> | <statem
ent> ; <slist>
<statement> ::= <assignm
ent> | <ifstatement> | <w
hilestatement>
| <block> | <printstatement> | <em
pty>
<assignment> ::= <identifier> = <expression>
| <identifier> [ <expression> ] = <expression>
<ifstatement> ::= if <bexpression> then <slist> else <slist> endif
| if <bexpression> then <slist> endif
<whilestatem
ent> ::= while <bexpression> do <slist> enddo
<printstatement> ::= print ( <expression> )
<expression> ::= <expression> <addingop> <term> | <term
> | <addingop> <term>
<bexpression> ::= <expression> <relop> <expression>
<relop> ::= < | <= | == | >= | > | !=
<addingop> ::= + | -
<term> ::= <term
> <multop> <factor> | <factor>
<multop> ::= * | /
<factor> ::= <constant> | <identifier> | <identifier> [ <expression>]
| ( <expression> )
<constant> ::= <digit> | <digit> <constant>
<identifier> ::= <identifier> <letterordigit> | <letter>
<letterordigit> ::= <letter> | <digit>
<letter> ::= a|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w
|x|y|z
<digit> ::= 0|1|2|3|4|5|6|7|8|9
<empty> has the obvious m
eaning
Com
ments (zero or m
ore characters enclosed between the standard C
/Java-style comm
ent brackets /*...*/) can be inserted. The language has rudim
entary support for 1-dimensional arrays. The declaration
int a[3] declares an array of three elements, referenced as a[0], a[1] and a[2]. N
ote also that you shouldw
orry about the scoping of names.
A simple program
written in this language is:
{ int a[3],t1,t2;
t1=2;
a[0]=1; a[1]=2; a[t1]=3;
t2=-(a[2]+t1*6)/(a[2]-t1);
2005-20062005-2006
37
if t2>5 then
print(t2);
else {
int t3;
t3=99;
t2=-25;
print(-t1+t2*t3); /* this is a comm
ent
on 2 lines */
} endif }
1.D
esign a Lexical analyzer for the above language. The lexical analyzer should ignore redundantspaces, tabs and new
lines. It should also ignore comm
ents. Although the syntax specificationstates that identifiers can be arbitrarily long, you m
ay restrict the length to some reasonable value.
2. Im
plement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.
3.D
esign Predictive parser for the given language
4.D
esign LALR bottom
up parser for the above language.
5.C
onvert the BNF rules into Yacc form
and write code to generate abstract syntax tree.
6.W
rite program to generate m
achine code from the abstract syntax tree generated by the parser. The
following instruction set m
ay be considered as target code.
The following is a sim
ple register-based machine, supporting a total of 17 instructions. It has three
distinct internal storage areas. The first is the set of 8 registers, used by the individual instructionsas detailed below, the second is an area used for the storage of variables and the third is an area usedfor the storage of program
. The instructions can be preceded by a label. This consists of an integerin the range 1 to 9999 and the label is follow
ed by a colon to separate it from the rest of the
instruction. The numerical label can be used as the argum
ent to a jump instruction, as detailed below.
In the description of the individual instructions below, instruction argum
ent types are specified asfollow
s :
R
specifies a register in the form R
0, R1, R
2, R3, R
4, R5, R
6 or R7 (or r0, r1, etc.).
L
specifies a numerical label (in the range 1 to 9999).
V
specifies a “variable location” (a variable number, or a variable location pointed to by a register - see
below).
A
specifies a constant value, a variable location, a register or a variable location pointed to by a register(an indirect address). C
onstant values are specified as an integer value, optionally preceded by am
inus sign, preceded by a # symbol. An indirect address is specified by an @
followed by a register.
So, for example, an A-type argum
ent could have the form 4 (variable num
ber 4), #4 (the constant value4), r4 (register 4) or @
r4 (the contents of register 4 identifies the variable location to be accessed).
The instruction set is defined as follows:
LOAD A,R
loads the integer value specified by A into register R.
STOR
E R,V
stores the value in register R to variable V.
OUT Routputs the value in register R
.
NEG Rnegates the value in register R
.
ADD A,R
adds the value specified by A to register R, leaving the result in register R
.
SUB A,R
subtracts the value specified by A from register R
, leaving the result in register R.
MUL A,R
multiplies the value specified by A by register R
, leaving the result in register R.
DIV A,R
divides register R by the value specified by A, leaving the result in register R
.
JMP Lcauses an unconditional jum
p to the instruction with the label L.
JEQ R,L
jumps to the instruction w
ith the label L if the value in register R is zero.
JNE R,L
jumps to the instruction w
ith the label L if the value in register R is not zero.
JGE R,L
jumps to the instruction w
ith the label L if the value in register R is greater than or equal to zero.
JGT R,L
jumps to the instruction w
ith the label L if the value in register R is greater than zero.
JLE R,L
jumps to the instruction w
ith the label L if the value in register R is less than or equal to zero.
JLT R,L
jumps to the instruction w
ith the label L if the value in register R is less than zero.
NO
Pis an instruction with no effect. It can be tagged by a label.
STOPstops execution of the m
achine. All programs should term
inate by executing a STOP instruction.
2005-20062005-2006
38
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05216) EMBEDDED SYSTEM
SUnit - IEm
bedded Computing : Introduction, Com
plex Systems and M
icroprocessor, The Embedded System
Design Process, Formalism
s for System Design, Design Exam
ples. (Chapter I from Text Book 1, W
olf).Unit - IIThe 8051 Architecture : Introduction, 8051 M
icro controller Hardware, Input/Output Ports and Circuits, ExternalM
emory, Counter and Tim
ers, Serial data Input/Output, Interrupts. (Chapter 3 from Text Book 2, Ayala).
Unit - IIIBasic Assem
bly Language Programm
ing Concepts : The Assembly Language Program
ming Process,
Programm
ing Tools and Techniques, Programm
ing the 8051. Data Transfer and Logical Instructions.
(Chapters 4,5 and 6 from Text Book 2, Ayala).
Unit - IVArithm
etic Operations, D
ecimal Arithm
etic. Jump and C
all Instructions, Further Details on Interrupts.
(Chapter 7and 8 from Text Book 2, Ayala)
Unit - VApplications : Interfacing w
ith Keyboards, Displays, D
/A and A/D C
onversions, Multiple Interrupts,
Serial Data C
omm
unication. (Chapter 10 and 11 from Text Book 2, Ayala).
Unit - VIIntroduction to Real – Tim
e Operating System
s : Tasks and Task States, Tasks and Data, Semaphores,
and Shared Data; Message Q
ueues, Mailboxes and Pipes, Tim
er Functions, Events, Mem
ory Managem
ent,Interrupt R
outines in an RTO
S Environment. (Chapter 6 and 7 from
Text Book 3, Simon).
Unit - VIIBasic Design Using a Real-Tim
e Operating System
: Principles, Semaphores and Q
ueues, Hard
Real-Tim
e Scheduling Considerations, Saving M
emory and Pow
er, An example R
TOS like uC
-OS (O
penSource); Em
bedded Software Development Tools: Host and Target m
achines, Linker/Locators for Embedded
Software, G
etting Embedded Softw
are into the Target System; D
ebugging Techniques: Testing on Host
Machine, U
sing Laboratory Tools, An Example System
. (Chapter 8,9,10 & 11 from
Text Book 3, Simon).
Unit - VIIIIntroduction to advanced architectures : AR
M and SH
ARC
, Processor and mem
ory organization andInstruction level parallelism
; Netw
orked embedded system
s: Bus protocols, I 2C bus and C
AN bus;
Internet-Enabled Systems, D
esign Example-Elevator C
ontroller. (Chapter 8 from Text Book 1, W
olf).TEXT BO
OKS :
1.C
omputers and C
omponents, W
ayne Wolf, Elseveir.
2.The 8051 M
icrocontroller, Third Edition, Kenneth J.Ayala, Thomson.
REFERENCES :1.
Embedding system
building blocks, Labrosse, via CM
P publishers.2.
Embedded System
s, Raj Kam
al, TMH
.3.
Micro C
ontrollers, Ajay V Deshm
ukhi, TMH
.4.
Embedded System
Design, Frank Vahid, Tony G
ivargis, John Wiley.
5.M
icrocontrollers, Raj kam
al, Pearson Education.6.
An Embedded Softw
are Primer, D
avid E. Simon, Pearson Education.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05579) WEB TECHNO
LOG
IESUNIT - I : HTM
L Comm
on tags - List, Tables, images, form
s, Frames; C
ascading Style sheets.UNIT - II : Introduction to Java Scripts, O
bjects in Java Script, Dynam
ic HTM
L with Java Script
UNIT - III : XML : D
ocument type definition, XM
L Schemas, D
ocument O
bject model, Presenting XM
L,U
sing XML Processors: D
OM
and SAXUNIT - IV : Java Beans : Introduction to Java Beans, Advantages of Java Beans, BD
K Introspection,U
sing Bound properties, Bean Info Interface, Constrained properties
Persistence, Custom
izes, Java Beans API, Introduction to EJB’s.UNIT - V : W
eb Servers : Introduction to Servelets: Lifecycle of a Serverlet, JSDK, The Servelet API,
The javax.servelet Package, Reading Servelet param
eters, Reading Initialization param
eters. Thejavax.servelet H
TTP package, Handling H
ttp Request & R
esponses, Using C
ookies-Session Tracking,Security Issues.UNIT - VI : Introduction to JSP : The Problem
with Servelet. The Anatom
y of a JSP Page, JSPProcessing. JSP Application D
esign with M
VC Setting U
p and JSP Environment: Installing the Java
Software D
evelopment Kit, Tom
cat Server & Testing Tomcat
UNIT - VII : JSP Application Development : G
enerating Dynam
ic Content, U
sing Scripting Elements
Implicit JSP O
bjects, Conditional Processing – D
isplaying Values Using an Expression to Set an Attribute,
Declaring Variables and M
ethods Error Handling and D
ebugging Sharing Data Betw
een JSP pages,R
equests, and Users Passing C
ontrol and Date betw
een Pages – Sharing Session and Application Data
– Mem
ory Usage C
onsiderations.U
NIT - VIII : D
atabase Access : D
atabase Programm
ing using JDBC
, Studying Javax.sql.*package,Accessing a D
atabase from a JSP Page, Application – Specific D
atabase Actions,Deploying
JAVA Beans in a JSP Page, Introduction to struts framew
ork..TEXT BO
OKS :
1.W
eb Programm
ing, building internet applications, Chris Bates 2nd edition, W
ILEY Dreamtech(UNITs
1,2,3).2.
The complete R
eference Java 2 Fifth Edition by Patrick Naughton and H
erbert Schildt. TMH
(Chapters: 19, 20, 21, 22, 25, 27) (U
NIT 4).
REFERENCES :1.
Internet and World W
ide Web – H
ow to program
by Dietel and N
ieto PHI/Pearson Education Asia.
2.Jakarta Struts C
ookbook , Bill Siggelkow, S P D
O’R
eilly for chap 8.3.
Murach’s beginning JAVA JD
K 5, Murach, SPD
4.An Introduction to w
eb Design and Program
ming –W
ang-Thomson
5.W
eb Applications Technologies Concepts-Knuckles,John W
iley6.
Programm
ing world w
ide web-Sebesta,Pearson
7.Building W
eb Applications-NIIT,PH
I8.
Web W
arrior Guide to W
eb Programm
ming-Bai/Ekedaw
-Thomas
9.Beginning W
eb Programm
ing-Jon Duckett W
RO
X.10.
Java Server Pages, Pekowsky, Pearson.
11.Java Server Pages –H
ans Bergsten, SPD O
’Reilly (U
NITs 5,6,7,8).
2005-20062005-2006
39
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05158) DATA WAREHO
USING AND DATA M
INING
UNIT - I
Introduction : Fundamentals of data m
ining, Data M
ining Functionalities, Classification of D
ata Mining
systems, M
ajor issues in Data M
ining, Data W
arehouse and OLAP Technology for D
ata Mining D
ataW
arehouse, Multidim
ensional Data M
odel, Data W
arehouse Architecture, Data W
arehouseIm
plementation,Further D
evelopment of D
ata Cube Technology,
From D
ata Warehousing to D
ataM
ining,
UNIT - II
Data Preprocessing : Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation,
Data R
eduction, Discretization and C
oncept Hierarchy G
eneration.
UNIT - III
Data Mining Prim
itives, Languages, and System Architectures : D
ata Mining Prim
itives, Data
Mining Q
uery Languages, Designing G
raphical User Interfaces Based on a D
ata Mining Q
uery LanguageArchitectures of D
ata Mining System
s,
UNIT - IV
Concepts Description : Characterization and Comparison : Data G
eneralization and Summ
arization-Based C
haracterization, Analytical Characterization: Analysis of Attribute R
elevance, Mining C
lassC
omparisons: D
iscriminating betw
een Different C
lasses, Mining D
escriptive Statistical Measures in Large
Databases.
UNIT - V
Mining Association Rules in Large Databases : Association R
ule Mining, M
ining Single-Dim
ensionalBoolean Association R
ules from Transactional D
atabases, Mining M
ultilevel Association Rules from
Transaction Databases, M
ining Multidim
ensional Association Rules from
Relational D
atabases and Data
Warehouses, From
Association Mining to C
orrelation Analysis, Constraint-Based Association M
ining.
UNIT - VI
Classification and Prediction : Issues Regarding C
lassification and Prediction, Classification by
Decision Tree Induction, Bayesian Classification, Classification by Backpropagation, Classification Basedon C
oncepts from Association R
ule Mining, O
ther Classification M
ethods, Prediction, Classifier Accuracy.
UNIT - VII
Cluster Analysis Introduction : Types of Data in C
luster Analysis, A Categorization of M
ajor Clustering
Methods, Partitioning M
ethods, Density-Based M
ethods, Grid-Based M
ethods, Model-Based C
lusteringM
ethods, Outlier Analysis.
UNIT - VIII
Mining Com
plex Types of Data : Multim
ensional Analysis and Descriptive M
ining of Com
plex, Data
Objects, M
ining Spatial Databases, M
ining Multim
edia Databases, M
ining Time-Series and Sequence
Data, M
ining Text Databases, M
ining the World W
ide Web.
TEXT BOO
KS :
1.D
ata Mining – C
oncepts and Techniques - JIAWEI H
AN & M
ICH
ELINE KAM
BER H
arcourtIndia.
REFERENCES :
1.D
ata Mining Introductory and advanced topics –M
ARG
ARET H
DU
NH
AM, PEAR
SON
EDU
CATIO
N
2.D
ata Mining Techniques – AR
UN
K PUJAR
I, University Press.
3.D
ata Warehousing in the R
eal World – SAM
ANAH
OR
Y & DEN
NIS M
UR
RAY. Pearson Edn
Asia.
4D
ata Warehousing Fundam
entals – PAULR
AJ PON
NAIAH
WILEY STU
DEN
T EDITIO
N.
5.The D
ata Warehouse Life cycle Tool kit – R
ALPH KIM
BALL WILEY STU
DEN
T EDITIO
N.
2005-20062005-2006
40
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05522) SOFTW
ARE PROJECT M
ANAGEM
ENTUNIT - IConventional Softw
are Managem
ent : The waterfall m
odel, conventional software M
anagement
performance.
Evolution of Software Econom
ics : Software Econom
ics, pragmatic softw
are cost estimation.
UNIT - IIIm
proving Software Econom
ics : Reducing Softw
are product size, improving softw
are processes,im
proving team effectiveness, im
proving automation, Achieving required quality, peer inspections.
The old way and the new
: The principles of conventional software Engineering, principles of m
odernsoftw
are managem
ent, transitioning to an iterative process.UNIT - IIILife cycle phases : Engineering and production stages, inception, Elaboration, construction, transition phases.Artifacts of the process : The artifact sets, M
anagement artifacts, Engineering artifacts, program
matic artifacts.
UNIT - IVM
odel based software architectures : A M
anagement perspective and technical perspective.
Work Flow
s of the process : Software process w
orkflows, Iteration w
orkflows,
UNIT - VCheckpoints of the process : M
ajor mile stones, M
inor Milestones, Periodic status assessm
ents.Iterative Process Planning : W
ork breakdown structures, planning guidelines, cost and schedule
estimating, Iteration planning process, Pragm
atic planning.UNIT - VIProject O
rganizations and Responsibilities : Line-of-Business Organizations, Project O
rganizations,evolution of O
rganizations.Process Autom
ation : Automation Building blocks, The Project Environm
ent.UNIT - VIIProject Control and Process instrum
entation : The seven core Metrics, M
anagement indicators,
quality indicators, life cycle expectations, pragmatic Softw
are Metrics, M
etrics automation.
Tailoring the Process : Process discriminants.
UNIT - VIIIFuture Softw
are Project Managem
ent : Modern Project Profiles, N
ext generation Software econom
ics,m
odern process transitions.Case Study: The com
mand C
enter Processing and Display system
- Replacem
ent (CC
PDS-R
)TEXT BO
OK :
1.Softw
are Project Managem
ent, Walker R
oyce: Pearson Education, 2005.
REFERENCES :1.
Software Project M
anagement, Bob H
ughes and Mike C
otterell: Tata McG
raw-H
ill Edition.2.
Software Project M
anagement, Joel H
enry, Pearson Education.3.
Software Project M
anagement in practice, Pankaj Jalote, Pearson Education.2005.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C 4+1 0 4
(CS 05048) ARTIFICIAL INTELLIGENCE
(ELECTIVE I)
UNIT - I
Introduction : AI problems, foundation of AI and history of AI intelligent agents: Agents and Environm
ents,the concept of rationality, the nature of environm
ents, structure of agents, problem solving agents, problem
formulation.
UNIT - II
Searching : Searching for solutions, uniformed search strategies – Breadth first search, depth first
search, Depth lim
ited search, Iterative deepening depth first search bi-direction search - comparison.
Search with partial inform
ation (Heuristic search) G
reedy best first search, A* search, Mem
ory boundedheuristic search, H
euristic functions.
UNIT - III
Local search Algorithms, Hill clim
bing, simulated, annealing search, local beam
search, genetical algorithms.
Constrain satisfaction problems : Backtracking search for CSPs local search for constraint satisfaction
problems.
UNIT - IV
Gam
e Playing: Adversial search, Gam
es, minim
ax, algorithm, optim
al decisions in multiplayer gam
es,Alpha-Beta pruning, Evaluation functions, cutting of search.
UNIT - V
Knowledge R
epresentation & Reasons logical Agents, Know
ledge – Based Agents, the Wum
pus world,
logic, propositional logic, Resolution patterns in propos ional logic, R
esolution, Forward & Backw
ard.Chaining.
UNIT - VI
First order logic. Inference in first order logic, propositional Vs. first order inference, unification & liftsforw
ard chaining, Backward chaining, R
esolution.
UNIT - VII
Planning – Classical planning problem
, Language of planning problems, Expressiveness and extension,
planning with state – space search, Forw
ard states spare search, Backward states space search,
Heuristics for stats space search. Planning search, planning with state space search, partial order planningG
raphs.
2005-20062005-2006
41
UNIT - VIII
Learning – Forms of learning, Induction learning, Learning D
ecision Tree, Statistical learning methods,
learning with com
plex data, learning with H
idden variables – The EM Algorithm
, Instance Based learning,N
eural Netw
orks.
TEXT BOO
KS :
1.Artificial Intelligence – A M
odern Approach. Second Edition, Stuart Russel, Peter N
orvig, PHI/
Pearson Education.
2.Artificial Intelligence, 3
rd Edition, Patrick Henry W
inston., Pearson Edition.
REFERENCES :
1.Artificial Intelligence , 2
nd Edition, E.Rich and K.Knight (TM
H).
2.Artificial Intelligence and Expert System
s – Patterson PHI.
3.Expert System
s: Principles and Programm
ing- Fourth Edn, Giarrantana/ R
iley, Thomson.
4.PRO
LOG
Programm
ing for Artificial Intelligence. Ivan Bratka- Third Edition – Pearson Education.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C 4+1 0 4
(CS 05412) MO
BILE COM
PUTING(Elective - I)
UNIT - IIntroduction to M
obile Comm
unications and Computing : M
obile Com
puting (MC
) : Introduction toM
C, novel applications, lim
itations, and architecture.G
SM : M
obile services, System architecture, R
adio interface, Protocols, Localization and calling,H
andover, Security, and New
data services.UNIT - II(W
ireless) Medium
Access Control : Motivation for a specialized M
AC (H
idden and exposed terminals,
Near and far term
inals), SDM
A, FDM
A, TDM
A, CD
MA.
UNIT - IIIM
obile Network Layer : M
obile IP (Goals, assum
ptions, entities and terminology, IP packet delivery,
agent advertisement and discovery, registration, tunneling and encapsulation, optim
izations), Dynam
icH
ost Configuration Protocol (D
HC
P).UNIT - IVM
obile Transport Layer : Traditional TCP, Indirect TC
P, Snooping TCP, M
obile TCP, Fast retransm
it/fast recovery, Transm
ission /time-out freezing, Selective retransm
ission, Transaction oriented TCP.
UNIT - VDatabase Issues : H
oarding techniques, caching invalidation mechanism
s, client server computing w
ithadaptation, power-aware and context-aware com
puting, transactional models, query processing, recovery,
and quality of service issues.UNIT - VIData Dissem
ination: Com
munications asym
metry, classification of new
data delivery mechanism
s,push-based m
echanisms, pull-based m
echanisms, hybrid m
echanisms, selective tuning (indexing) techniques.
UNIT - VIIM
obile Ad hoc N
etworks (M
AN
ETs): Overview
, Properties of a MAN
ET, spectrum of M
ANET
applications, routing and various routing algorithms, security in M
ANETs.
UNIT - VIIIProtocols and Tools : W
ireless Application Protocol-WAP. (Introduction, protocol architecture, and
treatment of protocols of all layers), Bluetooth (U
ser scenarios, physical layer, MAC
layer, networking,
security, link managem
ent) and J2ME.
TEXT BOO
KS :1.
Jochen Schiller,“Mobile Com
munications”,Addison-W
esley. (Chapters 4,7,9,10,11),second edition, 2004.2.
Stojmenovic and Cacute, “H
andbook of Wireless N
etworks and M
obile Com
puting”, Wiley, 2002,
ISBN 0471419028. (C
hapters 11, 15, 17, 26 and 27)
REFER
ENC
ES :1.
Reza Behravanfar, “Mobile Com
puting Principles: Designing and Developing Mobile Applications with
UM
L and XML”, ISBN
: 0521817331, Cam
bridge University Press, O
ctober 2004,2.
Adelstein, Frank, Gupta, Sandeep KS, R
ichard III, Golden , Schw
iebert, Loren, “Fundamentals of
Mobile and Pervasive C
omputing”, ISBN
: 0071412379, McG
raw-H
ill Professional, 2005.3.
Hansmann, M
erk, Nicklous, Stober, “Principles of Mobile Com
puting”, Springer, second edition, 2003.4.
Martyn M
allick, “Mobile and W
ireless Design Essentials”, W
iley Dream
Tech, 2003.
2005-20062005-2006
42
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05419) MULTIM
EDIA AND APPLICATION DEVELO
PMENT
(ELECTIVE - I)
UNIT - IFundam
ental concepts in Text and Image: M
ultimedia and hyperm
edia, world w
ide web, overview
ofm
ultimedia software tools. G
raphics and image data representation graphics/im
age data types, file formats,
Color in im
age and video: color science, color models in im
ages, color models in video.
UNIT - IIFundam
ental concepts in video and digital audio: Types of video signals, analog video, digital video,digitization of sound, M
IDI, quantization and transm
ission of audio.UNIT - IIIAction Script I: ActionScript Features, O
bject-Oriented ActionScript, D
atatypes and Type Checking,
Classes, Authoring an ActionScript C
lass.UNIT - IVAction Script II : Inheritance, Authoring an ActionScript 2.0 Subclass, Interfaces, Packages, Exceptions.UNIT - VApplication Developm
ent : An OO
P Application Frame w
ork, Using C
omponents w
ith ActionScriptM
ovieClip Subclasses.
UNIT - VIM
ultimedia data com
pression : Lossless compression algorithm
: Run-Length C
oding, Variable LengthC
oding, Dictionary Based C
oding, Arithmetic C
oding, Lossless Image C
ompression, Lossy com
pressionalgorithm
: Quantization, Transform
Coding, W
avelet-Based Coding, Em
bedded Zerotree of Wavelet
Coefficients Set Partitioning in H
ierarchical Trees (SPIHT).
UNIT - VIIBasic Video C
ompression Techniques: Introduction to video com
pression, video compression based on
motion com
pensation, search for motion vectors, M
PEG, Basic Audio C
ompression Techniques.
UNIT - VIIIM
ultimedia Networks: Basics of M
ultimedia Networks, M
ultimedia Network Com
munications and Applications
: Quality of M
ultimedia D
ata Transmission, M
ultimedia over IP, M
ultimedia over ATM
Netw
orks, Transportof M
PEG-4, M
edia-on-Dem
and(MO
D).
TEXT BOO
KS :1.
Fudamentals of M
ultimedia by Ze-N
ian Li and Mark S. D
rew PH
I/Pearson Education.2.
Essentials ActionScript 2.0, Colin M
oock, SPD O
,REILLY.
REFERENCES :1.
Digital M
ultimedia, N
igel chapman and jenny chapm
an, Wiley-D
reamtech
2.M
acromedia Flash M
X Professional 2004 Unleashed, Pearson.
3.M
ultimedia and com
munications Technology, Steve H
eath, Elsevier(Focal Press).4.
Multim
edia Applications, Steinmetz, N
ahrstedt, Springer.5.
Multim
edia Basics by Weixel Thom
son6.
Multim
edia Technology and Applications, David H
ilman , G
algotia
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05004) ADVANCED COM
PUTER ARCHITECTURE(ELECTIVE - II)
Unit - I
Fundamentals of C
omputer design- Technology trends- cost- m
easuring and reporting performance
quantitative principles of computer design.
Unit - II
Instruction set principles and examples- classifying instruction set- m
emory addressing- type and size of
operands- addressing modes for signal processing-operations in the instruction set- instructions for control
flow- encoding an instruction set.-the role of com
piler
Unit - III
Instruction level parallelism (ILP)- over com
ing data hazards- reducing branch costs –high performance
instruction delivery- hardware based speculation- lim
itation of ILP
Unit - IV
ILP software approach- com
piler techniques- static branch protection - VLIW approach - H
.W support for
more ILP at com
pile time- H
.W verses S.W
solutions
Unit - V
Mem
ory hierarchy design- cache performance- reducing cache m
isses penalty and miss rate – virtual
mem
ory- protection and examples of VM
.
Unit - VI
Multiprocessors and thread level parallelism
- symm
etric shared mem
ory architectures- distributed sharedm
emory- Synchronization- m
ulti threading.
Unit - VII
Storage systems- Types – Buses - R
AID- errors and failures- bench m
arking a storage device- designinga I/O
system.
Unit - VIII
Inter connection networks and clusters- interconnection network media – practical issues in interconnecting
networks- exam
ples – clusters- designing a cluster.
TEXT BOO
K :
1.C
omputer Architecture A quantitative approach 3
rd edition John L. Hennessy & D
avid A. PattersonM
organ Kufmann (An Im
print of Elsevier)
REFERENCES :
1.“C
omputer Architecture and parallel Processing” Kai H
wang and A.Briggs International Edition
McG
raw-H
ill.2.
Advanced Com
puter Architectures, Dezso Sim
a, Terence Fountain, Peter Kacsuk, Pearson.
2005-20062005-2006
43
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C4+1 0 4
(CS 05129) CLIENT SERVER COM
PUTING(ELECTIVE - II)
UNIT - I
Introduction to client server computing : Evolution of corporate com
puting models from
centralized todistributed com
puting, client server models. Benefits of client server com
puting, pitfalls of client serverprogram
ming.
UNIT - II
Review of Java concepts : Java fundam
entals, Exceptions, Threads, Strings, Java applets, AWT,
Swings, stream
I/O, Socket interface, R
MI, R
MI API, JD
BC.
UNIT - III
CORBA w
ith Java : Client/Server C
OR
BA-style, The object web: C
OR
BA with Java, C
OR
BA / Java
UNIT - IV
Core CORBA / Java : Tw
o types of Client/ Server invocations-static, dynam
ic. The static CO
RBA, first
CO
RBA program
, OR
Blets with Applets, D
ynamic C
OR
BA-The portable count, the dynamic count m
ulticount.
UNIT - V
Other Technologies : C
reating client / server application using-java sockets, HTTP/C
GI, Servlets, R
MI,
Caffeine
UNIT - VI
Existential CORBA : C
OR
BA initialization protocol, CO
RBa activation services, C
OR
BAIDL m
appingC
OR
BA java- to- IDL m
apping, The introspective CO
RBA/Java object.
UNIT - VII
Java Bean Component M
odel : Events, properties, persistency, Intrespection of beans, CO
RBA
Beans.
UNIT - VIII
EJBs and CORBA : O
bject transaction monitors C
OR
BA OTM
’s, EJB and CO
RBA O
TM’s, EJB
container frame w
ork, Session and Entity Beans, The EJB client/server development Process The EJB
container protocol, support for transaction EJB packaging EJB design Guidelines.
TEXT BOO
KS :1.
Client/Server program
ming w
ith Java and CO
RBA R
obert Orfali and D
an Harkey, John W
iley & Sons,SPD
2nd Edition
2.Java program
ming w
ith CO
RBA 3
rd Edition, G.Brose, A Vogel and K.D
uddy, Wiley-dream
tech, IndiaJohn w
iley and sons
REFERENCES :1.
Distributed C
omputing, Principles and applications, M
.L.Liu, Pearson Education.2.
Client/Server Survival G
uide 3rd edition R
obert Orfali D
an Harkey & Jeri Edw
ards, John Wiley & Sons
3.C
lient/Server Com
puting D T D
ewire, TM
H.
4.IBM
Webspere Starter Kit R
on Ben Natan O
ri Sasson, TMh, N
ew D
elhi.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C 4+1 0 4
(CS 05423) NETWO
RK MANAG
EMENT SYSTEM
S(ELECTIVE - I)
UNIT - IData com
munications and Netw
ork Managem
ent Overview
: Analogy of Telephone Netw
orkM
anagement, Com
munications protocols and Standards, Case Histories of Networking and M
anagement,
Challenges of Information Technology M
anagers, Network Managem
ent: Goals, O
rganization, and Functions,N
etwork and System
Managem
ent, Netw
ork Managem
ent System Platform
, Current Status and future of
Network Managem
ent.UNIT - IISNM
PV1 Network M
anagement : O
rganization and Information and Inform
ation Models.
Managed netw
ork : Case H
istories and Examples, The H
istory of SNM
P Managem
ent, The SNM
PM
odel, The Organization M
odel, System O
verview, The Inform
ation Model.
UNIT - IIISNM
Pv1 Network M
anagement : C
omm
unication and Functional Models. The SN
MP C
omm
unicationM
odel, Functional model.
UNIT - IVSNM
P Managem
ent: SNMPv2 : M
ajor Changes in SN
MPv2, SN
MPv2 System
Architecture, SNM
Pv2Structure of M
anagement Inform
ation, The SNM
Pv2 Managem
ent Information Base, SN
MPv2 Protocol,
Com
patibility With SN
MPv1.
UNIT - VSNM
P Managem
ent : RMO
N : What is R
emote M
onitoring? , RM
ON
SMI and M
IB, RM
ON
1, RM
ON
2,ATM
Rem
ote Monitoring, A C
ase Study of Internet Traffic Using R
MO
NUNIT - VITelecom
munications M
anagement Netw
ork : Why TM
N? , O
perations Systems, TM
N C
onceptualM
odel, TMN
Standards, TMN
Architecture, TMN
Managem
ent Service Architecture, An Integrated Viewof TM
N, Im
plementation Issues.
UNIT - VIINetw
ork Managem
ent Tools and Systems:Network M
anagement Tools, Network Statistics M
easurement
Systems, H
istory of Enterprise Managem
ent, Netw
ork Managem
ent systems, C
omm
ercial Netw
orkm
anagement System
s, System M
anagement, Enterprise M
anagement Solutions.
UNIT - VIIIW
eb-Based Managem
ent:NM
S with W
eb Interface and Web-Based M
anagement, W
eb Interface toSNM
P Managem
ent, Embedded W
eb-Based Managem
ent, Desktop managem
ent Interface, Web-Based
Enterprise Managem
ent, WBEM
: Windows M
anagement Instrum
entation, Java managem
ent Extensions,M
anagement of a Storage Area N
etwork: , Future D
irections.TEXT BO
OK :
1.N
etwork M
anagement, Principles and Practice, M
ani Subrahmanian, Pearson Education.
REFERENCES :1.
Netw
ork managem
ent, Morris, Pearson Education.
2.Principles of N
etwork System
Administration, M
ark Burges, Wiley D
reamtech.
3.D
istributed Netw
ork Managem
ent, Paul, John Wiley.
2005-20062005-2006
44
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C
0 3 2
(CS 05217) EMBEDDED SYSTEM
S LAB (89CSI Developm
ent Board)
1.W
rite a program to
a)R
ead inputs from sw
itches
b)To m
ake LEDs blink
2.W
rite a Program for serial com
munication
3.W
rite a program for encruption/decruption
4.D
evelop necessary interfacing circuit to read data from a sensor and process using the 8051
board. The data has to be displayed on a PC m
onitor.
5.Sort R
TOs (m
CO
S) on to 89CS1 board and Verify.
6.Sim
ulate on elevator movem
ent using RTO
s on 89CSI board.
Ref. : KVKKF Prasad: ‘Em
bedded/Real-Tim
e Systems’, D
reamtech. Press.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - I Semester
T P C 0 3 2
(CS 05580) WEB TECHNO
LOG
IES LAB
1.D
evelop static pages (using Only H
TML) of an online Book store. The pages should resem
ble:w
ww
.amazon.com
The website should consist the follow
ing pages.•
Home page
•R
egistration and user Login•
User Profile Page
•Books catalog
•Shopping Cart
•Paym
ent By credit card•
Order C
onformation
2.Validate the R
egistration, user login, user profile and payment by credit card pages using
JavaScript.
3.C
reate and save an XML docum
ent at the server, which contains 10 users inform
ation. Write a
program, w
hich takes User Id as an input and returns the user details by taking the user
information from
the XML docum
ent.
4.Bean Assignm
entsa.
Create a JavaBean which gives the exchange value of INR(Indian Rupees) into equivalentAm
erican/Canadian/Australian Dollar value.b.
Create a sim
ple Bean with a label - w
hich is the count of number of clicks. Than create
a BeanInfo class such that only the “count” property is visible in the Property Window
.c.
Create tw
o Beans-a)KeyPad .b)DisplayPad .After that integrate the tw
o Beans to make
it work as a C
alculator.d.
Create tw
o Beans Traffic Light(Implem
ented as a Label with only three background
colours-Red,Green,Yellow) and Autom
obile(Implem
ented as a TextBox which states itsstate/m
ovement). The state of the Autom
obile should depend on the following Light
Transition Table.Light Transition
Automobile State
Red —
> YellowReady
Yellow —
> Green
Move
Green —
> Red
Stopped
5.Install TO
MC
AT web server. C
onvert the static web pages of assignm
ents 2 into dynamic w
ebpages using servlets and cookies. Hint: Users inform
ation (user id, password, credit card number)
would be stored in w
eb.xml. Each user should have a separate Shopping C
art.
6.R
edo the previous task using JSP by converting the static web pages of assignm
ents 2 intodynam
ic web pages. C
reate a database with user inform
ation and books information. The books
catalogue should be dynamically loaded from
the database. Follow the M
VC architecture w
hiledoing the w
ebsite.
7.Im
plement the “H
ello World!” program
using JSP Struts Framew
ork.
2005-20062005-2006
45
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - II Semester
T P C4+1 0 4
(HS 05352) MANAG
EMENT SCIENCE
Unit - I
Introduction to Managem
ent: Concepts of M
anagement and organization- nature, im
portance andFunctions of M
anagement, Taylor’s Scientific M
anagement Theory, Fayol’s Principles of M
anagement,
Mayo’s H
awthorne Experim
ents, Maslow
’s Theory of Hum
an Needs, D
ouglas McG
regor’s Theory X andTheory Y, H
erzberg’s Two-Factor Theory of M
otivation, Systems Approach to M
anagement, Leadership
Styles, Social responsibilities of Managem
ent.
Unit - II
Designing Organisational Structures : Basic concepts related to O
rganisation - Departm
entation andD
ecentralisation, Types of mechanistic and organic structures of organisation (Line organization, Line and
staff organization, functional organization, Comm
ittee organization, matrix organization, Virtual O
rganisation,C
ellular Organisation, team
structure, boundaryless organization, inverted pyramid structure, lean and flat
organization structure) and their merits, dem
erits and suitability.
Unit - III
Operations M
anagement : Principles and Types of Plant Layout-M
ethods of production (Job, batch andM
ass Production), Work Study -Basic procedure involved in M
ethod Study and Work M
easurement-
Statistical Quality C
ontrol: chart, R chart, c chart, p chart, (sim
ple Problems), Acceptance Sam
pling,D
eming’s contribution to quality.
Unit - VI
a)M
aterials Managem
ent: Objectives, N
eed for Inventory control, EOQ
, ABC Analysis, Purchase
Procedure, Stores Managem
ent and Stores Records.
b)M
arketing: Functions of Marketing, M
arketing Mix, M
arketing Strategies based on Product LifeC
ycle, Channels of distribution
Unit - V
Human Resources M
anagement (HRM
) : Concepts of H
RM
, HR
D and Personnel M
anagement and
Industrial Relations (PM
IR), H
RM
vs.PMIR
, Basic functions of HR
Manager: M
anpower planning,
Recruitm
ent, Selection, Training and Developm
ent, Placement, W
age and Salary Administration,
Promotion, Transfer, Separation, Perform
ance Appraisal, Grievance Handling and W
elfare Administration,
Job Evaluation and Merit R
ating.
Unit - VI
Project Managem
ent (PERT/CPM) : N
etwork Analysis, Program
me Evaluation and R
eview Technique
(PERT), C
ritical Path Method (C
PM), Identifying critical path, Probability of C
ompleting the project w
ithingiven tim
e, Project Cost Analysis, Project C
rashing. (simple problem
s)
Unit - VII
Strategic Managem
ent : Mission, G
oals, Objectives, Policy, Strategy, Program
mes, Elem
ents ofC
orporate Planning Process, Environmental Scanning, Value C
hain Analysis, SWO
T Analysis, Steps inStrategy Form
ulation and Implem
entation, Generic Strategy alternatives.
Unit - VIII
Contemporary M
anagement Practices : Basic concepts of M
IS, End User C
omputing, M
aterialsR
equirement Planning (M
RP), Just-In-Tim
e (JIT) System, Total Q
uality Managem
ent (TQM
), Six sigma
and Capability M
aturity Model (C
MM
) Levels, Supply Chain M
anagement, Enterprise R
esource Planning(ERP), Perform
ance Managem
ent, Business Process outsourcing (BPO), Business Process Re-engineering
and Bench Marking, Balanced Score C
ard.
TEXT BOO
KS :
1.Aryasri : M
anagement Science, TM
H, 2004.
2.Stoner, Freem
an, Gilbert, M
anagement, 6
th Ed, Pearson Education, New
Delhi, 2004.
REFERENCES :
1.Kotler Philip & Keller Kevin Lane: M
arketing Mangem
ent 12/e, PHI, 2005
2.Koontz & W
eihrich: Essentials of Managem
ent, 6/e, TMH
, 2005
3.Thom
as N.D
uening & John M.Ivancevich M
anagement —
Principles and Guidelines,
Biztantra,2003.
4.Kanishka Bedi, Production and O
perations Managem
ent, Oxford U
niversity Press, 2004.
5.M
emoria & S.V.G
auker, Personnel Managem
ent, Him
alaya, 25/e, 2005
6.Sam
uel C.C
erto: Modern M
anagement, 9/e, PH
I, 2005
7.Scherm
erhorn, Capling, Poole & W
iesner: Managem
ent, Wiley, 2002.
8.Parnell: Strategic M
anagement, Biztantra,2003.
9.Law
rence R Jauch, R
.Gupta &W
illiam F.G
lueck:Business Policy and Strategic Managem
ent,Frank Bros.2005.
10.L.S.Srinath: PER
T/CPM
,Affiliated East-West Press, 2005.
Unit VIII w
ill have only short questions, not essay questions.
2005-20062005-2006
46
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - II Semester
T P C4 0 4
(CS 05302) IMAG
E PROCESSING
(ELECTIVE III)
UNIT - I
Introduction : Examples of fields that use digital im
age processing, fundamental steps in digital im
ageprocessing, com
ponents of image processing system
.. Digital Im
age Fundamentals: A sim
ple image
formation m
odel, image sam
pling and quantization, basic relationships between pixels (p.nos. 15-17, 21-
44, 50-69).
UNIT - II
Image enhancem
ent in the spatial domain : Basic gray-level transform
ation, histogram processing,
enhancement using arithm
etic and logic operators, basic spatial filtering, smoothing and sharpening spatial
filters, combining the spatial enhancem
ent methods ( p.nos 76-141).
UNIT - III
Image restoration : A m
odel of the image degradation/restoration process, noise m
odels, restoration inthe presence of noise–only spatial filtering, W
einer filtering, constrained least squares filtering, geometric
transforms; Introduction to the Fourier transform
and the frequency domain, estim
ating the degradationfunction (p.nos 147-167, 220-243, 256-276).
UNIT - IV
Color Image Processing : C
olor fundamentals, color m
odels, pseudo color image processing, basics of
full–color image processing, color transform
s, smoothing and sharpening, color segm
entation (p.nos: 282-339).
UNIT - V
Image Com
pression : Fundamentals, im
age compression m
odels, error-free compression, lossy-
predictive coding, image com
pression standards (p.nos: 409-467,492-510).
UNIT - VI
Morphological Im
age Processing : Preliminaries, dilation, erosion, open and closing, hit or m
isstransform
ation, basic morphologic algorithm
s (p.nos:519-550).
UNIT - VII
Image Segm
entation : Detection of discontinuous, edge linking and boundary detection, thresholding,
region–based segmentation (p.nos: 567-617).
UNIT - VIII
Object Recognition : Patterns and patterns classes, recognition based on decision–theoretic m
ethods,m
atching, optimum
statistical classifiers, neural networks, structural m
ethods – matching shape num
bers,string m
atching (p.nos: 693-735).
TEXT BOO
K :
1.D
igital Image Processing, R
afeal C.G
onzalez, Richard E.W
oods, Second Edition, PearsonEducation/PH
I.
REFERENCES :
1.Im
age Processing, Analysis, and Machine Vision, M
ilan Sonka, Vaclav Hlavac and R
oger Boyle,Second Edition, Thom
son Learning.
2.Introduction to D
igital Image Processing w
ith Matlab, Alasdair M
cAndrew, Thom
son Course
Technology
3.C
omputer Vision and Im
age Processing, Adrian Low, Second Edition, B.S.Publications
4.Digital Im
age Processing using Matlab, Rafeal C.G
onzalez, Richard E.Woods, Steven L. Eddins,
Pearson Education.
5.D
igital Image Processing, W
illiam K. Prat, W
ily Third Edition
6.D
igital Image Processing and Analysis, B. C
handa, D. D
atta Majum
der, Prentice Hall of India,
2003.
2005-20062005-2006
47
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05185) E - COM
MERCE
(ELECTIVE - III)
UNIT - I
Electronic Com
merce-Fram
e work, anatom
y of E-Com
merce applications, E-C
omm
erce Consum
erapplications, E-C
omm
erce organization applications.
UNIT - II
Consum
er Oriented Electronic com
merce - M
ercantile Process models.
UNIT - III
Electronic payment system
s - Digital Token-Based, Sm
art Cards, C
redit Cards, R
isks in ElectronicPaym
ent systems.
UN
IT-IV
Inter Organizational C
omm
erce - EDI, ED
I Implem
entation, Value added networks.
UNIT - V
Intra Organizational C
omm
erce - work Flow
, Automation C
ustomization and internal C
omm
erce, Supplychain M
anagement.
UNIT - VI
Corporate D
igital Library - Docum
ent Library, digital Docum
ent types, corporate Data W
arehouses.Advertising and M
arketing - Information based m
arketing, Advertising on Internet, on-line marketing
process, market research.
UNIT - VII
Consum
er Search and Resource D
iscovery - Information search and R
etrieval, Com
merce C
atalogues,Inform
ation Filtering.
UNIT - VIII
Multim
edia - key multim
edia concepts, Digital Video and electronic Comm
erce, Desktop video processings,D
esktop video conferencing.
TEXT BOO
K :
1.Frontiers of electronic com
merce – Kalakata, W
hinston, Pearson.
REFERENCES :
1.E-C
omm
erce fundamentals and applications H
endry Chan, R
aymond Lee, Tharam
Dillon,
Ellizabeth Chang, John W
iley.
2.E-C
omm
erce, S.Jaiswal – G
algotia.
3.E-C
omm
erce, Efrain Turbon, Jae Lee, David King, H
.Michael C
hang.
4.Electronic C
omm
erce – Gary P.Schneider – Thom
son.
5.E-C
omm
erce – Business, Technology, Society, Kenneth C.Taudon, C
arol Guyerico Traver.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
IV Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05180) DISTRIBUTED DATABASES(ELECTIVE - III)
UNIT - I
Features of Distributed versus C
entralized Databases, Principles O
f Distributed D
atabases , Levels Of
Distribution Transparency, Reference Architecture for Distributed Databases , Types of Data Fragmentation,
Integrity Constraints in D
istributed Databases.
UNIT – II
Translation of Global Q
ueries to Fragment Q
ueries, Equivalence Transformations for Q
ueries, Transforming
Global Q
ueries into Fragment Q
ueries, Distributed Grouping and Aggregate Function Evaluation, Param
etricQ
ueries.
UNIT – III
Optim
ization of Access Strategies, A Framew
ork for Query O
ptimization, Join Q
ueries, General Q
ueries.
UNIT – IV
The Managem
ent of Distributed Transactions, A Fram
ework for Transaction M
anagement , Supporting
Atomicity of D
istributed Transactions, Concurrency C
ontrol for Distributed Transactions, Architectural
Aspects of Distributed Transactions.
UNIT - V
Concurrency Control, Foundation of Distributed Concurrency Control, Distributed Deadlocks, ConcurrencyC
ontrol based on Timestam
ps, Optim
istic Methods for D
istributed Concurrency C
ontrol.
UNIT – VI
Reliability, Basic C
oncepts, Nonblocking C
omm
itment Protocols, R
eliability and concurrency Control,
Determ
ining a Consistent View
of the Netw
ork, Detection and R
esolution of Inconsistency, Checkpoints
and Cold R
estart, Distributed D
atabase Administration, C
atalog Managem
ent in Distributed D
atabases,Authorization and Protection
UNIT - VII
Architectural Issues, Alternative Client/Server Architectures, C
ache Consistency O
bject Managem
ent,O
bject Identifier Managem
ent, Pointer Swizzling, O
bject Migration, D
istributed Object Storage, O
bjectQ
uery Processing, Object Q
uery Processor Architectures, Query Processing Issues, Q
uery Execution ,Transaction M
anagement, Transaction M
anagement in O
bject DBM
Ss , Transactions as Objects.
UNIT - VIII
Database Integration, Schem
e Translation, Scheme Integration, Q
uery Processing Query Processing
Layers in Distributed M
ulti-DBM
Ss, Query O
ptimization Issues. Transaction M
anagement Transaction
and Computation M
odel Multidatabase Concurrency Control, M
ultidatabase Recovery, Object O
rientationAnd Interoperability O
bject Managem
ent Architecture CO
RBA and D
atabase Interoperability Distributed
Com
ponent Model C
OM
/OLE and D
atabase Interoperability, PUSH
-Based Technologies
TEXT BOO
KS :1.
Distributed D
atabase Principles & Systems, Stefano C
eri, Giuseppe Pelagatti M
cGraw
-Hill
2.Principles of D
istributed Database System
s, M.Tam
er Ozsu, Patrick Valduriez - Pearson
Education.
2005-20062005-2006
48
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITY HYDERABAD
IV Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05573) VIRTUAL REALITY(ELECTIVE - IV)
UNIT-I
Introduction : The three I’s of virtual reality, comm
ercial VR technology and the five classic com
ponentsof a VR
system. (1.1, 1.3 and 1.5 of Text Book (1))
UNIT - II
Input Devices : (Trackers, Navigation, and G
esture Interfaces): Three-dimensional position trackers,
navigation and manipulation, interfaces and gesture interfaces. (2.1, 2.2 and 2.3 of Text Book (1)).
UNIT - III
Output Devices: G
raphics displays, sound displays & haptic feedback. (3.1,3.2 & 3.3 of Text Book (1))
UNIT - IV
Modeling : G
eometric m
odeling, kinematics m
odeling, physical modeling, behaviour m
odeling, model
managem
ent. (5.1, 5.2 and 5.3, 5.4 and 5.5 of Text Book (1)).
UNIT - V
Human Factors: M
ethodology and terminology, user perform
ance studies, VR health and safety issues.
(7.1, 7.2 and 7.3 of Text Book (1)).
UNIT - VI
Applications: Medical applications, m
ilitary applications, robotics applications.
(8.1, 8.3 and 9.2 of Text Book (1)).
UNIT - VII
VR Programm
ing-I : Introducing Java 3D, loading and m
anipulating external models, using a lathe to
make shapes.
(Chapters 14, 16 and 17 of Text Book (2))
UNIT - VIII
VR Programm
ing-II : 3D Sprites, anim
ated 3D sprites, particle system
s. (Chapters 18, 19 and 21 of
Text Book (2))
TEXT BOO
KS :
1.Virtual R
eality Technology, Second Edition, Gregory C
. Burdea & Philippe Coiffet, John W
iley &Sons, Inc.,
2.Killer G
ame Program
ming in Java, Andrew
Davison, O
reilly-SPD, 2005.
REFERENCES :1.
Understanding Virtual Reality, interface, Application and Design, William
R.Sherman, Alan Craig,
Elsevier(Morgan Kaufm
ann).2.
3D M
odeling and surfacing, Bill Fleming, Elsevier(M
organ Kauffman).
3.3D
Gam
e Engine Design, D
avid H.Eberly, Elsevier.
4.Virtual R
eality Systems, John Vince, Pearson Education.
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05294) HUMAN CO
MPUTER INTERFACE
(ELECTIVE - IV)
UNIT - I
Introduction : Importance of user Interface – definition, im
portance of good design. Benefits of gooddesign. A brief history of Screen design.
UNIT - II
The graphical user interface – popularity of graphics, the concept of direct manipulation, graphical
system, C
haracteristics, Web user – Interface popularity, characteristics- Principles of user interface.
UNIT - III
Design process – Hum
an interaction with com
puters, importance of hum
an characteristics human
consideration, Hum
an interaction speeds, understanding business junctions.
UNIT - IV
Screen Designing : Design goals – Screen planning and purpose, organizing screen elem
ents, orderingof screen data and content – screen navigation and flow
– Visually pleasing composition – am
ount ofinform
ation – focus and emphasis – presentation inform
ation simply and m
eaningfully – information
retrieval on web – statistical graphics – Technological consideration in interface design.
UNIT - V
Window
s – New
and Navigation schem
es selection of window
, selection of devices based and screenbased controls.
UNIT - VI
Com
ponents – text and messages, Icons and increases – M
ultimedia, colors, uses problem
s, choosingcolors.
UNIT - VII
Software tools – Specification m
ethods, interface – Building Tools.
UNIT - VIII
Interaction Devices – Keyboard and function keys – pointing devices – speech recognition digitization and
generation – image and video displays – drivers.
TEXT BOO
KS :
1.The essential guide to user interface design, W
ilbert O G
alitz, Wiley D
reamaTech.
2.D
esigning the user interface. 3rd Edition Ben Shneiderm
ann , Pearson Education Asia.
REFERENCES :
1.H
uman – C
omputer Interaction. ALAN
DIX, JAN
ET FINC
AY, GR
E GO
RYD
, ABOW
D,
RU
SSELL BEALG, PEAR
SON
.
2.Interaction D
esign PREC
E, RO
GER
S, SHAR
PS. Wiley D
reamtech,
3.U
ser Interface Design, Soren Lauesen , Pearson Education.
2005-20062005-2006
49
JAW
AH
AR
LAL N
EHR
U TEC
HN
OLO
GIC
AL U
NIVER
SITYHYDERABAD
IV Year B.Tech. CSE - II Semester
T P C4+1 0 4
(CS 05005) ADVANCED COM
PUTING CO
NCEPTS(ELECTIVE - IV)
UNIT I
Grid Com
puting : Data & C
omputational G
rids, Grid Architectures and its relations to various
Distributed Technologies
UNIT II
Autonomic C
omputing, Exam
ples of the Grid C
omputing Efforts (IBM
).
UNIT III
Cluster setup & its Advantages, Perform
ance Models & Sim
ulations; Netw
orking Protocols & I/O,
Messaging system
s.
UNIT IV
Process scheduling, Load sharing and Balancing; Distributed shared m
emory, parallel I/O
.
UNIT - V
Example cluster System
- Beowlf; C
luster Operating system
s: CO
MPaS and N
anOS
UNIT - VI
Pervasive Com
puting concepts & Scenarios; Hardw
are & Software; H
uman - m
achine interface.
UNIT - VII
Device connectivity; Java for Pervasive devices; Application exam
ples
UNIT - VIII
Classical Vs Q
uantum logic gates ;O
ne ,two & three Q
Ubit Q
uantum gates; Fredkin & Toffoli gates ;
Quantum
circuits; Quantum
algorithms.
TEXT BOO
K :
1.“Selected Topics in Advance com
puting” Edited by Dr P.Padm
anabham and D
r. M.B Srinivas,
2005 Pearson Education.
REFERENCES :
1.J. Joseph & C
. Fellenstein:’ Grid C
omputing ‘, Pearson Education.
2.J.Burkhardt et .al :’Pervasive com
puting’ Pearson Education
3.M
arivesar:’Approaching quantum com
puting ‘, Pearson Education.
4.R
aj Kumar Buyya:’H
igh performance cluster com
puting’, Pearson Education.
5.Neilsen & Chung L:’Q
uantum com
puting and Quantum
Information’, Cam
bridge University Press.
6.A netw
orking approach to Grid C
omputing , M
inoli, Wiley.