Page 1 of 93

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA. B. TECH. INFORMATION TECHNOLOGY I Year COURSE STRUCTURE __________________________________________________________________________________ Code Subject T P/D C __________________________________________________________________________________ English 2+1* 4 Mathematics – I 3+1* 6 Mathematical Methods 3+1* 6 Applied Physics 2+1* 4 C Programming and Data Structures 3+1* 6 Basic Electrical Engineering 2+1* 4 Electronic Devices and Circuits 3+1* 6 Engineering Drawing 3 4 Computer Programming Lab 3 4 Electrical and Electronics Lab 3 4 English Language Communication Skills Lab 3 4 IT Work-Shop 3 4 Total 20 15 56 ___________________________________________________________________________________

1

Page 2 of 93
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA. B. TECH. INFORMATION TECHNOLOGY II YEAR COURSE STRUCTURE Code Subject T P C ______________________________________________________________________________________ Probability and Statistics 4+1* 0 4 Mathematical Foundations of Computer Science 4+1* 0 4 Advanced Data Structures and Algorithms 4+1 * 0 4 Digital Logic Design 4+1 * 0 4 Unix and Shell Programming 4+1 * 0 4 Managerial Economics and Financial Analysis4+1* 0 4 Advanced Data Structures and Algorithms Lab 0 3 2 Unix and Shell Programming Lab 0 3 2 Total 30 6 28 _____________________________________________________________________________________ II YEAR COURSE STRUCTURE Code Subject T P C ______________________________________________________________________________________ Object Oriented Programming 4+1* 0 4 Computer Organization 4+1 * 0 4 Database Management systems 4+1 * 0 4 Operating System 4+1 * 0 4 Environmental Studies 4+1 * 0 4 Software Engineering 4+1 * 0 4 Object Oriented Programming Lab 0 3 2 Database Management Systems Lab 0 3 2 Total 30 6 28 ______________________________________________________________________________________ II Semester I Semester

2

Page 3 of 93
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA. B. TECH. INFORMATION TECHNOLOGY III YEAR COURSE STRUCTURE Code Subject T P C ______________________________________________________________________________________ Automata and Compiler Design 4+1* 0 4 Data Communication Systems 4+1* 0 4 Microprocessor and Interfacing 4+1 * 0 4 Computer Graphics 4+1 * 0 4 Distributed Databases 4+1 * 0 4 Software Testing Methodologies 4+1 * 0 4 Advanced English Communication Skills Lab 0 3 2 Microprocessors and interfacing Lab 0 3 2 Total 30 6 28 ______________________________________________________________________________________ III YEAR COURSE STRUCTURE Code Subject T P C ______________________________________________________________________________________ Web Technologies 4+1* 0 4 Computer Networks 4+1 * 0 4 E-Commerce 4+1 * 0 4 Middleware Technologies 4+1 * 0 4 Data Warehousing and Data Mining 4+1 * 0 4 Object Oriented Analysis and Design 4+1 * 0 4 Computer Networks and Case Tools Lab 0 3 2 Web Technologies Lab 0 3 2 Total 30 6 28 ______________________________________________________________________________________ II Semester I Semester

3

* .Tutorial T – Theory P – Practical C .III : Multimedia Databases Network Management Systems Biometrics ELECTIVE – IV : Bio-informatics Design Patterns Pattern Recognition Industry Oriented Mini Project Seminar Project Work Comprehensive Viva 4+1* 0 4 II Semester 4+1* 0 4 0 0 0 0 0 0 2 0 0 2 10 2 Total 15 – 28 ______________________________________________________________________________________ Note : All End Examinations (Theory and Practical) are of three hours duration. TECH. B.Page 4 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA.I : Information Retrieval Systems Information Security Virtual Reality Human Computer Interaction 4+1* 0 4 I Semester ELECTIVE . B. INFORMATION TECHNOLOGY IV YEAR COURSE STRUCTURE Code Subject T P C ______________________________________________________________________________________ Multimedia and Application Development 4+1* 0 4 Embedded Systems 4+1 * 0 4 Network Programming 4+1* 0 4 Mobile Computing 4+1 * 0 4 ELECTIVE . INFORMATION TECHNOLOGY IV YEAR COURSE STRUCTURE Code Subject T P C ______________________________________________________________________________________ Management Science 4+1* 0 4 ELECTIVE .II : 4+1* 0 4 Software Project Management Advanced computing concepts Image Processing Network Programming lab 0 3 2 Multimedia and Application Development Lab 0 3 2 Total 30 6 28 ______________________________________________________________________________________ JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA. TECH.Credits 4 .

IT P 0 C 4 1. The text for non-detailed study is for extensive reading/reading for pleasure by the students. draw inferences etc. the students should be encouraged to read the texts/selected paragraphs silently. However. promotional material etc. 3. as also for supplementing the exercises with authentic materials of a similar kind for example. the focus should be on the skills of reading. Hence. it is suggested that they read it on their own with topics selected for discussion in the class. • Listening for general content • Listening to fill up information • Intensive listening • Listening for specific information Speaking Skills : Objectives 1. The teachers can ask comprehension questions to stimulate discussion and based on the discussions students can be made to write short paragraphs/essays etc. the syllabus has been designed to develop linguistic and communicative competence of Engineering students. to distinguish between them to mark stress and recognise and use the right intonation in sentences. To equip students with necessary training in listening so that can comprehend the speech of people of different backgrounds and regions Students should be given practice in listening to the sounds of the language to be able to recognise them. INTRODUCTION : In view of the growing importance of English as a tool for global communication and the consequent emphasis on training students to acquire communicative competence.Page 5 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 2+1* ENGLISH I Year B. To make students aware of the role of speaking in English and its contribution to their success. listening and speaking and for this the teachers should use the text prescribed for detailed study. writing. advertisements.) • Just A Minute(JAM) Sessions. To equip the students to study academic subjects with greater facility through the theoretical and practical components of the English syllabus. To develop the study skills and communication skills in formal and informal situations. 2. OBJECTIVES: a. 2. To improve the language proficiency of the students in English with emphasis on LSRW skills. In the English classes. To enable students to develop their listening skill so that they may appreciate its role in the LSRW skills approach to language and improve their pronunciation 2. from newspaper articles. • Skimming the text 5 . To enable students to express themselves fluently and appropriately in social and professional contexts. b. To develop the ability of students to guess the meanings of words from context and grasp the overall message of the text. • Oral practice • Describing objects/situations/people • Role play – Individual/Group activities (Using exercises from all the nine units of the prescribed text: Learning English : A Communicative Approach. SYLLABUS : Listening Skills: Objectives 1. The time should be utilized for working out the exercises given after each section . the stress in this syllabus is on skill development and practice of language skills.Tech. For example. 2. c. To develop an awareness in the students about the significance of silent reading and comprehension.. Reading Skills: Objectives 1. The prescribed books and the exercises are meant to serve broadly as students’ handbooks.

Unit –II Chapters 1-4 from Wings of Fire: An Autobiography – APJ Abdul Kalam. Orient Longman. Writing Skills : Objectives 1. Inspiration from LEARNING ENGLISH: A Communicative Approach.. divided into Eight Units. To develop an awareness in the students about writing as an exact and formal skill 2. Astronomy from LEARNING ENGLISH: A Communicative Approach. Abridged version with Exercises. 2004. WINGS OF FIRE: An Autobiography – APJ Abdul Kalam. 8. an abridged version with Exercises.. 2. Chapters 5-8 from Wings of Fire: An Autobiography – APJ Abdul Kalam.2004 Humour from LEARNING ENGLISH: A Communicative Approach.. 2005. are prescribed: For Detailed study 1. Chapters 13-16 from Wings of Fire: An Autobiography – APJ Abdul Kalam. an abridged version with Exercises. Universities Press (India) Pvt. Universities Press (India) Pvt. the following texts and course content. Universities Press (India) Pvt. beginning with the lower order ones. 6 . such as magazines/newspaper articles. Universities Press (India) Pvt. Unit –III 5. TEXTBOOKS PRESCRIBED: In order to improve the proficiency of the student in the acquisition of the four skills mentioned above.2004 Environment from LEARNING ENGLISH: A Communicative Approach. Ltd. 2005. Orient Longman. Universities Press (India) Pvt. Chapters 9-12 from Wings of Fire: An Autobiography – APJ Abdul Kalam. LEARNING ENGLISH: A Communicative Approach. Orient Longman. Unit –IV 7. Orient Longman. Ltd. 6. They will be examined in reading and answering questions using ‘unseen’ passages which may be taken from the non-detailed text or other authentic texts.. (Six Selected Lessons) For Non-detailed study 2. Ltd. 2005. A. an abridged version with Exercises.. Ltd.2004 3. 2006. To equip them with the components of different forms of writing. STUDY MATERIAL: Unit –I 1. 2005. Ltd. • Writing sentences • Use of appropriate vocabulary • Paragraph writing • Coherence and cohesiveness • Narration / description • Note Making • Formal and informal letter writing • Editing a passage 4. Orient Longman.2004 Information Technology from LEARNING ENGLISH: A Communicative Approach. 2005. Unit –V 9. 4.. an abridged version with Exercises. KAKINADA: Orient Longman.Page 6 of 93 • Understanding the gist of an argument • Identifying the topic sentence • Inferring lexical and contextual meaning • Understanding discourse features • Recognizing coherence/sequencing of sentences NOTE : The students will be trained in reading skills using the prescribed text for detailed study.

Eliah. Oxford University Press 2. one-word substitutes. 10. Oxford 7 . Unit – VII Exercises on Reading and Writing Skills Reading Comprehension Situational dialogues Letter writing Essay writing Unit – VIII Practice Exercises on Remedial Grammar covering Common errors in English. Human Interest from LEARNING ENGLISH: A Communicative Approach. 6..Page 7 of 93 10. 8. Basic Communication Skills for Technology. Murphy.. an abridged version with Exercises. 9. S. John Seely. Cambridge University Press English Skills for Technical Students by Orient Longman Everyday Dialogues in English by Robert J. Tense and aspect Vocabulary development covering Synonyms & Antonyms. * Exercises from the lessons not prescribed shall also be used for classroom tasks.. Ltd.2004. Idioms & phrases. P. Sci tech. 2004. Lakshmi Narayanan. 2006. Publications. 1 & 2. 2005. English For Technical Communication. 4. Prentice-Hall of India Ltd. Publications. 2007. Universities Press (India) Pvt. 12. Vol. Ltd. Francis Soundararaj. Chapters 17-20 from Wings of Fire: An Autobiography – APJ Abdul Kalam. 7. Bhaskaran & Horsburgh. Strengthen Your English. prefixes & suffixes. Orient Longman. A Hand book of English for Engineers & Technologists by Dr. by K. MacMillan India Ltd. Universities Press (India) Pvt. 3. Andrea J Rutherfoord. Chapters 21-24 from Wings of Fire: An Autobiography – APJ Abdul Kalam. an abridged version with Exercises. B.. Pearson Education Asia. The Oxford Guide to Writing and Speaking. 5. REFERENCES : 1. Unit – VI 11. Subject-Verb agreement. Murphy’s English Grammar with CD. Use of Articles and Prepositions. Dixson. R. Developing Communication Skills by Krishna Mohan & Meera Benerji (Macmillan) Speaking and Writing for Effective Business Communication. words often confused.

Page 8 of 93
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 3+1* MATHEMATICS – I

I Year B.Tech. IT

P 0

C 6

UNIT – I Differential equations of first order and first degree – exact, linear and Bernoulli. Applications to Newton’s Law of cooling, Law of natural growth and decay, orthogonal trajectories. UNIT – II Non-homogeneous linear differential equations of second and higher order with constant coefficients with RHS term of the type e ax , Sin ax, cos ax, polynomials in x, e ax V(x), xV(x), method of variation of parameters. UNIT – III Rolle’s Theorem – Lagrange’s Mean Value Theorem – Cauchy’s mean value Theorem – Generalized Mean Value theorem (all theorems without proof) Functions of several variables – Functional dependence- JacobianMaxima and Minima of functions of two variables with constraints and without constraints UNIT – IV Radius, Centre and Circle of Curvature – Evolutes and Envelopes Curve tracing – Cartesian , polar and Parametric curves. UNIT – V Applications of integration to lengths, volumes and surface areas in Cartesian and polar coordinates multiple integrals - double and triple integrals – change of variables – change of order of integration. UNIT – VI Sequences – series – Convergences and divergence – Ratio test – Comparison test – Integral test – Cauchy’s root test – Raabe’s test – Absolute and conditional convergence UNIT – VII Vector Calculus: Gradient- Divergence- Curl 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 Vector integral theorems: Green’s theorem-Stoke’s and Gauss’s Divergence Theorem (With out proof). Verification of Green’s - Stoke’s and Gauss’s Theorems. UNIT – VIII Laplace transform of standard functions – Inverse transform – first shifting Theorem, Transforms of derivatives and integrals – Unit step function – second shifting theorem – Dirac’s delta function – Convolution theorem – Periodic function - Differentiation and integration of transforms-Application of Laplace transforms to ordinary differential equations Partial fractions-Heaviside’s Partial fraction expansion theorem. Text Books: 1. A text Book of Engineering Mathematics, Vol-1 T. K. V. Iyengar, B. Krishna Gandhi and Others, S. Chand & Company. 2. A text Book of Engineering Mathematics, C. Sankaraiah, V. G. S. Book Links. 3. A text Book of Engineering Mathematics, Shahnaz Bathul, Right Publishers. 4. A text Book of Engineering Mathematics, P. Nageshwara Rao, Y. Narasimhulu & N. Prabhakar Rao, Deepthi Publications. References: 1. A text Book of Engineering Mathematics, B. V. Raman, Tata Mc Graw Hill. 2. Advanced Engineering Mathematics, Irvin Kreyszig, Wiley India Pvt. Ltd. 3. A text Book of Engineering Mathematics, Thamson Book Collection.

8

Page 9 of 93
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 3+1* MATHEMATICAL METHODS

I Year B.Tech. IT

P 0

C 6

UNIT – I Matrices and Linear systems of equations: Elementary row transformations-Rank-Echelon form, Normal form – Solution of Linear Systems – Direct Methods- LU Decomposition- LU Decomposition from Gauss Elimination – Solution of Tridiagonal Systems-Solution of Linear Systems UNIT – II Eigen values, eigen vectors – properties – Cayley-Hamilton Theorem - Inverse and powers of a matrix by Cayley-Hamilton theorem – Diagonolization of matrix. Calculation of powers of matrix – Modal and spectral matrices. UNIT – III Real matrices – Symmetric, skew - symmetric, orthogonal, Linear Transformation – Orthogonal Transformation. Complex matrices: Hermitian, Skew-Hermitian and Unitary – Eigen values and eigen vectors of complex matrices and their properties. Quadratic forms- Reduction of quadratic form to canonical form – Rank - Positive, negative definite - semi definite - index - signature - Sylvester law. UNIT – IV . Solution of Algebraic and Transcendental Equations: Introduction – The Bisection Method – The Method of False Position – The Iteration Method – Newton-Raphson Method. Interpolation: Introduction- Errors in Polynomial Interpolation – Finite differences- Forward DifferencesBackward differences –Central differences – Symbolic relations and separation of symbols-Differences of a polynomial-Newton’s formulae for interpolation – Central difference interpolation Formulae – Gauss Central Difference Formulae –Interpolation with unevenly spaced points-Lagrange’s Interpolation formula. UNIT – V Curve fitting: Fitting a straight line –Second degree curve-exponentional curve-power curve by method of least squares. Numerical Differentiation and Integration– Trapezoidal rule – Simpson’s 1/3 Rule –Simpson’s 3/8 Rule. UNIT – VI Numerical solution of Ordinary Differential equations: Solution by Taylor’s series-Picard’s Method of successive Approximations-Euler’s Method-Runge-Kutta Methods –Predictor-Corrector Methods- AdamsMoulton Method –Milne’s Method. UNIT – VII Fourier Series: Determination of Fourier coefficients – Fourier series – even and odd functions – Fourier series in an arbitrary interval – even and odd periodic continuation – Half-range Fourier sine and cosine expansions. Fourier integral theorem (only statement)– Fourier sine and cosine integrals. Fourier transform – Fourier sine and cosine transforms – properties – inverse transforms – Finite Fourier transforms. UNIT – VIII Formation of partial differential equations by elimination of arbitrary constants and arbitrary functions – solutions of first order linear (Lagrange) equation and nonlinear (standard type) equations. Method of separation of variables. z-transform – inverse z-transform - properties – Damping rule – Shifting rule – Initial and final value theorems. Convolution theorem – Solution of difference equation by z-transforms. Text Books: 1. Mathematical Methods, T. K. V. Iyengar, B. Krishna Gandhi and Others, S. Chand & Company. 2. Mathematical Methods, C. Sankaraiah, V. G. S. Book Links. 3. A text book of Mathematical Methods, V. Ravindranath, A. Vijayalaxmi, Himalaya Publishers. 4. A text book of Mathematical Methods, Shahnaz Bathul, Right Publisshers. References: 1. A text Book of Engineering Mathematics, B. V. Raman, Tata Mc Graw Hill. 2. Advanced Engineering Mathematics, Irvin Kreyszig, Wiley India Pvt. Ltd. 3. Numerical Methods for Scientific and Engineering Computation, M. K. Jain, S. R. K. Iyengar & R. K. Jain, New Age International Publishers. 4. Elementary Numerical Analysis, Aitkinson & Han, Wiely India, 3rd Edition, 2006

9

Page 10 of 93
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 2+1* APPLIED PHYSICS

I Year B.Tech. IT UNIT I

P 0

C 4

BONDING IN SOLIDS : Introduction - Types of bonding in solids - Estimation of cohesive energy – Madelung constant. CRYSTAL STRUCTURES AND X-RAY DIFFRACTION: Introduction -Space lattice - Basis - Unit cell - Lattice parameter - Bravais lattices – Crystal systems - Structure and packing fractions of Simple cubic - Body centered cubic – Face centered cubic crystals - Directions and planes in crystals – Miller indices - Separation between successive [h k l] planes - Diffraction of X-rays by crystal planes - Bragg’s law - Laue method Powder method. UNIT II PRINCIPLES OF QUANTUM MECHANICS: Waves and particles - Planck’s quantum theory – de Broglie hypothesis – Matter waves - Davisson and Germer experiment – G. P. Thomson experiment – Heisenberg uncertainty principle - Schrödinger’s time independent wave equation - Physical significance of the wave function - Particle in one dimensional potential box. UNIT III ELECTRON THEORY OF METALS: Classical free electron theory - Mean free path - Relaxation time and drift velocity - Quantum free electron theory - Fermi-Dirac distribution (analytical) and its dependence on temparature – Fermi energy – Electron scattering and resistance. BAND THEORY OF SOLIDS: Bloch theorem - Kronig-Penney model (qualitative treatment) - Origin of energy band formation in solids – Classification of materials into conductors, semi conductors & insulators - Concept of effective mass of an electron. UNIT IV DIELECTRIC PROPERTIES: Introduction - Dielectric constant - Electronic, ionic and orientational polarizations - Internal fields in solids – Clausius - Mossotti equation – Dielectrics in alternating fields – Frequency dependence of the polarizability - Ferro and Piezo electricity. MAGNETIC PROPERTIES : Permeability - Magnetization - Origin of magnetic moment – Classification of magnetic materials - Dia, para and ferro magnetism - Hysteresis curve - Soft and hard magnetic materials. UNIT V SEMICONDUCTORS : Introduction - Intrinsic semiconductor and carrier concentration – Equation for conductivity - Extrinsic semiconductor and carrier concentration - Drift and diffusion - Einstein’s equation - Hall effect – Direct & indirect band gap semiconductors. SUPERCONDUCTIVITY: General properties - Meissner effect - Penetration depth - Type I and Type II superconductors - Flux quantization – DC and AC Josephson effect –BCS Theory - Applications of superconductors. UNIT VI LASERS: Introduction - Characteristics of Lasers - Spontaneous and stimulated emission of radiation Einstein’s coefficients - Population inversion - Ruby laser - Helium-Neon Laser – CO2 laser -Semiconductor Laser – Applications of lasers. UNIT VII FIBER OPTICS AND HOLOGRAPHY: Introduction - Principle of optical fiber - Acceptance angle and acceptance cone - Numerical aperture – Types of optical fibers and refractive index profiles – Attenuation in optical fibers - Application of optical fibers – Basic principles of holography – Construction and reconstruction of image on hologram – Applications of holography.

10

International.Mittal. Pearson Education.K. Vijay Kumar & T. V.S. Bandyopadhyay. Rangarajan. Materials Science and Engineering by V. S. Applied Physics by P. Thomson Learning. REFERENCES: 1. 3.K. Wiley Eastern Ltd.Vijaya & G. 6. Introduction to Solid State Physics by C. Chandra Shekar. Applied Physics by K. Arumugam. Ltd. 8. 2. Applied Physics 2nd edition by Dr. Scitech Publications (India) Pvt.K. Book links. Prentice-Hall India. 5. Ashcroft & N. Raghavan.G. 7. P. Tata McGraw Hill. Solid State Physics by P.Page 11 of 93 UNIT VIII SCIENCE & TECHNOLOGY OF NANOMATERIALS: Introduction to Nano materials . Nanotechnology by Mark Ratner and Daniel Ratner. Materials Science by M. Sreekanth. Solid State Physics by N. 4. Nano Materials by A. TEXTBOOKS: 1. Anuradha Agencies. 3.S. David Merwin. Palanisamy. Kittel . 2. New Age International Publishers. M.W.Basic principles of Nanoscience & Technology – Fabrication of nano materials – Physical & chemical properties of nanomaterials – Carbon nanotubes – Applications of nanotechnology. Chand & Company Ltd. 11 .K. Materials Science by M. I. Appala Naidu & Dr.

definition. address arithmetic. C program examples. programming examples. Kochan.L. conditional expressions.S. Forouzan and R. self referential structures. singly linked lists. Y. C Programming with problem solving.F. IT P 0 C 6 UNIT . twodimensional and multi-dimensional arrays. pointers to structures. static. precedence and order of evaluation. UNIT . file I/o operations. 5. conditional operator.Kruse. B. program development steps. structures and functions. UNIT . expressions. Computer science. basics. C& Data structures – P. initialization of pointer variables. register. The C Programming Language. error handling. bit-wise operators. variables. J. PHI/Pearson Education 3.S. Data Structures and Program Design in C. storing elements. assignment operators. representing stacks and queues in C using arrays and linked lists. postfix expression evaluation. Shashi M. A Simple C program. B. type conversions.A. Publications. UNIT . 12 . arrays and functions. UNIT .W. increment and decrement operators. bitfields. relational and logical operators. representation. Pearson Education. Augenstein. identifiers. B. statements and blocks. basic data types and sizes. loops. doubly linked lists. header files.I Algorithm / pseudo code. Jones & K. storage classes.V Input and output – concept of a file. auto. Functions. 2. and M. definition and initialization of structures.Page 12 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 3+1* C PROGRAMMING AND DATA STRUCTURES I Year B. Insertion sort. typedef. infix to post fix conversion. scope rules. Harrow.A. arithmetic. pointers and multidimensional arrays.Tanenbaum. goto and labels.IV Derived types.Ritchie.concepts. selection sort. block structure. do-while and for statements. example c programs. c program examples. declaration. user defined functions.III Arrays. merge sort.VIII Trees. pointers. Dennis M. R. Thomson.extern. structure of C program. parameter passing. pointers to pointers. UNIT . Tondo. Langsam. nested structures.declaration. command line arguments. Second Edition. C program examples. Formatted I/o. representation. flowchart. A structured programming approach using C. sorting – Bubble sort. Kernighan. circular list. Quick sort. text files and binary files.while.Binary tress.VI Searching – Linear and binary search methods. BP Leung. Padmanabham.structures. Character pointers and functions. streams. continue. UNIT – VII Introduction to data structures. break. Input-output statements. standard library functions. UNIT . terminology. pointers and function arguments. III Edition. 2. dreamtech Press 4. REFERENCES : 1. PHI/Pearson education. Programming in C – Stephen G. Gilberg. dynamic memory managements functions. Third edition. Pearson Eductaion. graph TEXT BOOKS : 1. graphstraversals (dfs & bfs) terminology.II Designing structured programs. standard I/o. recursive functions.concepts. accessing elements. C preprocessor. traversals. if and switch statements. accessing structures. unions. DataStructures Using C – A. arrays of structures. applications of arrays. C. Constants.Tech.J.

coils connected in series. principle of operation. REFERENCES : 1. Kirchhoff’s laws.Naidu and S. star delta and delta star transformation . Moving coil permanent magnet (PMMC) instruments. relationship between frequency.Kothari & I. S. Transformer Test. energy in linear magnetic systems. Simple problems. single phase parallel circuits. slip and rotor frequency. electric current. e. Ideal Transformer and Practical Transformer.C Machines : Three phase induction motor. Magnetic field due to electric current flow . Electric field. Principles of Electrical Engineering by V. electromotive force.By M. form factor and peak factor. UNIT-IV Alternating Quantities : Principle of ac voltages . series parallel circuits. Basic Electrical Engineering . 2. Losses. semiconductors and insulators (elementary treatment only). EMF equation (Simple problems on EMF). power in ac circuits. Network theorems. JR. Thevenins’s. IT P 0 C 6 UNIT . single phase series circuits. ohm’s law. types of elements . basic circuit components.Nagasarkar and M. Sukhija Oxford University Press. analogy between electric and magnetic circuits. Moving Iron of Ammeters and Voltmeters (elementary Treatment only) TEXT BOOKS : 1. Basic Electrical Engineering –By T. essential features of measuring instruments. UNIT-V Transformers : Principles of operation. Maximum power transfer theorems and simple problems. Synchronous motor principle and operation (Elementary treatment only) UNIT VIII Basic Instruments : Introduction. speed and number of poles. UNIT-VII A. Nagrath PHI. Essentials of Electrical and Computer Engineering by David V. the J operator and phasor algebra. Constructional Details. 3.K Mehta. Kamakshiah – TMH. David Irwin Pearson. single phase series parallel circuits.J.K.S.force on a current carrying conductor placed in a magnetic field. magnetization characteristics of Ferro magnetic materials. potential and potential difference. attracting force of electromagnets.S. Operation of a dc machine as a generator. operation of a dc machine as a motor. capacitive networks. UNIT-II Network Analysis : Basic definitions. classification of instruments. resistive networks. analysis of ac circuits with single basic network element. 13 . self inductance and mutual inductance. UNIT-III Magnetic Circuits : Basic definitions. 2. electric power. armature windings. Torque production in a dc machine.P. torque (simple problems). J.m.I Introduction to Electrical Engineering : Essence of electricity. Efficiency and Regulation Calculations (All the above topics are only elementary treatment and simple problems). Theory and Problems of Basic Electrical Engineering by D. Types of induced EMF’s. phasor representation of alternating quantities. root mean square and average values of alternating currents and voltage.f equation in a dc machine. waveforms and basic definitions. operating principles. types of sources. Kerns. UNIT-VI Direct current machines : Principle of operation of dc machines. Conductors.Page 13 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 3+1* BASIC ELECTRICAL ENGINEERING I Year B. inductive networks. Faradays laws of electromagnetic induction.Tech. Synchronous Machines: Principle of operation.Superposition . electromagnetism related laws.Chand Publications.

Π. (Compensation against variation in VBE. Breakdown Mechanisms in Semi Conductor (Avalanche and Zener breakdown) Diodes. Input impedance and Output impedance. Transistor alpha. Mass Action Law. Simple problems involving electric and magnetic fields only. Common Emitter. S'’). Comparison of transistor configurations in terms of AI . Principles of CRT. UNIT. Varactar Diode. UNIT. Fermi level in intrinsic and extrinsic semiconductors. Stabilization factors. current series.section filter. Effect of Feedback on input and output characteristics. Introduction to SCR and UJT. and current shunt feedback amplifiers with discrete components and their analysis UNIT-VIII OSCILLATORS : Condition for oscillations. UNIT. deflection sensitivity (Electrostatic and magnetic deflection). (S. Relation between Alpha and Beta. ripple factor. Thermal stability. Harmonic components in a rectifier circuit. current gain. Inductor filter. S '. Capacitor filter. Temperature dependence of VI characteristic. Transistor current components. UNIT-V BIASING AND STABILISATION : BJT biasing. and comparison of various filter circuits in terms of ripple factors.section filter. typical transistor junction voltage values. Voltage series. Collector to base bias. Self bias techniques for stabilization. Law of junction. IT P 0 C 6 UNIT-I ELECTRON DYNAMICS AND CRO: Motion of charged particles in electric and magnetic fields. Volt-ampere characteristics of p-n diode. Series and Shunt voltage regulators UNIT.II JUNCTION DIODE CHARACTERISTICS : Review of semi conductor Physics – n and p –type semi conductors.VI AMPLIFIERS : Small signal low frequency transistor amplifier circuits: h-parameter representation of a transistor.Tech. Hall Effect. Transistor construction. criteria for fixing operating point. Transition and Diffusion capacitances. Wein bridge oscillator. Small signal model of JFET. JFET characteristics (Qualitative and Quantitative discussion). MOSFET characterisitics (Enhancement and depletion mode). General characteristics of negative feedback amplifiers. Classification of feedback amplifiers. Ri . FILTERS AND REGULATORS : Half wave rectifier. The current components in p-n diode. Zener diode characteristics. Compensation techniques. Ro. and Common collector configurations.) Thermal run away. Fixed bias. Hartley and Colpitts oscillators. Detailed study of currents in a transistor. Open-circuited p-n junction. Characteristics of Tunnel Diode with the help of energy band diagrams. DC equivalent model. Electrostatic and magnetic focusing. Multiple Lsection and Multiple Πsection filter. Perpendicular Electric and Magnetic fields. PN diode as as a rectifier (forward bias and reverse bias). Symbols of MOSFET. voltage shunt. Ico. RC-phase shift oscillators with Transistor and FET. Simple circuit of a regulator using zener diode. Parallel Electric and Magnetic fields. Comparison of Transistors. Crystal oscillators. Transistor as an amplifier.Page 14 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 3+1* ELECTRONIC DEVICES AND CIRCUITS I Year B. Step graded junction. Av . And photo diode UNIT. TEXT BOOKS : 14 . Input and Output characteristics of transistor in Common Base. Diode equation. Analysis of single stage transistor amplifier using h-parameters: voltage gain.III RECTIFIERS. LCD. The p-n junction Energy band diagram of PN diode. full wave rectifier. Frequency and amplitude stability of oscillators. L.IV TRANSISTOR and FET CHARACTERISTICS : Junction transistor.VII FEEDBACK AMPLIFIERS : Concept of feedback. LED. Continuity Equation.

L. REFERENCES : 1. Tata McGraw Hill. Electronic Devices and Circuits – T.. Principles of Electronic Circuits – S. Lal Kishore. K. 1988..Page 15 of 93 1. Microelectronics – Millman and Grabel. and Satyabratha Jit Tata McGraw Hill. J..Ltd 2006 15 . Galgotia Publications. Boylestad and Louis Nashelsky. Electronic Devices and Circuits – J.F. 2007. 4.Bond. 5.C.G.S. Bogart Jr. 2nd Edn.9th Edition.Rico.Burns and P. B. 2005.Prof GS N Raju I K International Publishing House Pvt . Publications. 2. Electronic Devices and Circuits – R.R. Electronic Devices and Circuits. 2nd Ed. Electronic Devices and Circuits – Dr. C. 3.Halkias.S. 6th edition. 2nd Edition.Millman. 2. Pearson/Prentice Hall. 1998. Pearson Education. 2004.Beasley and G..2006.

Bhatt 2 Engineering graphics By K. UNIT – IV Isomeric projections of lines. lines and planes – axis inclined to one planes and inclined to both the planes. UNIT – III Orthographic projections of solids : Cylinder. planes and simple solids UNIT – V Conversion of orthographic views into isometric views and vice-versa. Engineering drawing : Johle / TMH 16 .Tech.D.L.Page 16 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 0 ENGINEERING DRAWING I Year B. prism. Engineering drawings By N. parabola and hyperbola – cylindrical curves. Engineering drawing and graphics: Venugopal/ New age 2. IT P 3 C 4 UNIT – I Introduction to engineering graphics – construction of ellipse. cone.Kannayya REFERENCES:1. pyramid and sphere positions and axis inclined to both the planes. UNIT – II Orthographic projections of points. TEXT BOOKS : 1. Narayana & P.

Week 2. ii) To find the GCD (greatest common divisor) of two given integers. words and characters in a given text.Page 17 of 93 I Year B. b) Write a C program that uses functions to perform the following: i) Addition of Two Matrices ii) Multiplication of Two Matrices Week 6 a) Write a C program that uses functions to perform the following operations: i) To insert a sub-string in to given main string from a given position. b) A Fibonacci Sequence is defined as follows: the first and second terms in the sequence are 0 and 1. Recommended Systems/Software Requirements: • • Intel based desktop PC ANSI C Compiler with Supporting Editors Week l. c) Write a C program to generate all the prime numbers between 1 and n. iii) To solve Towers of Hanoi problem. 17 . b) Write a C program. Write a C program to generate the first n terms of the sequence. % and use Switch Statement) Week 5 a) Write a C program to find both the larges and smallest number in a list of integers.-.*. Write C program to find the distance travelled at regular intervals of time given the values of ‘u’ and ‘a’. queues. trees and graphs. Week 3 a) Write C programs that use both recursive and non-recursive functions i) To find the factorial of a given integer. • To teach the student to write programs in C solve the problems • To Introduce the student to simple linear and non linear data structures such as lists. stacks. a) Write a C program to find the sum of individual digits of a positive integer. or – 1 if S doesn’t contain T. (Consider the operators +. Week 4 a) The total distance travelled by vehicle in ‘t’ seconds is given by distance = ut+1/2at2 where ‘u’ and ‘a’ are 2 the initial velocity (m/sec. which takes two integer operands and one operator form the user.Tech. b) Write a C program to determine if the given string is a palindrome or not Week 7 a) Write a C program that displays the position or index in the string S where the string T begins. Subsequent terms are found by adding the preceding two terms in the sequence. b) Write a C program to count the lines. where n is a value supplied by the user. /. IT JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 0 COMPUTER PROGRAMMING LAB P 3 C 4 Objectives: • To make the student learn a programming language. performs the operation and then prints the result. The program should provide the flexibility to the user to select his own time intervals and repeat the calculations for different values of ‘u’ and ‘a’. ii) To delete n Characters from a given position in a given string. a) Write a C program to calculate the following Sum: Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10! b) Write a C program toe find the roots of a quadratic equation.) and acceleration (m/sec ).

then the program computes 1+5+25+125. Week 9 Write a C program to read in two numbers. b) Write a C program to construct a pyramid of numbers. n.) Week 12 a) Write a C program which copies one file to another. 18 . x and n. test for them too.Page 18 of 93 Week 8 a) Write a C program to generate Pascal’s triangle. b) Write a C program to reverse the first n characters in a file. and then compute the sum of this geometric progression: 1+x+x2+x3+…………. Have your program print an error message if n<0. the sum Perform error checking. (Note: The file name and n are specified on the command line. Week 11 Write a C program that uses functions to perform the following operations: i) Reading a complex number ii) Writing a complex number iii) Addition of two complex numbers iv) Multiplication of two complex numbers (Note: represent complex number using a structure.) Week 13 Write a C program that uses functions to perform the following operations on singly linked list.: i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways Week 15 Write C programs that implement stack (its operations) using i) Arrays ii) Pointers Week 16 Write C programs that implement Queue (its operations) using i) Arrays ii) Pointers Week 17 Write a C program that uses Stack operations to perform the following: i) Converting infix expression into postfix expression ii) Evaluating the postfix expression Week 18 Write a C program that uses functions to perform the following: i) Creating a Binary Tree of integers ii) Traversing the above binary tree in preorder. b) Write a C program to convert a Roman numeral to its decimal equivalent. Are any values of x also illegal ? If so. the formula does not make sense for negative exponents – if n is less than 0. Week 10 a) 2’s complement of a number is obtained by scanning it from right to left and complementing all the bits after the first appearance of a 1. Write a C program to find the 2’s complement of a binary number. For example. Thus 2’s complement of 11100 is 00100. Print x.+xn For example: if n is 3 and x is 5.: i) Creation ii) Insertion iii) Deletion iv) Traversal Week 14 Write a C program that uses functions to perform the following operations on doubly linked list. inorder and postorder. then go back and read in the next pair of numbers of without computing the sum.

Gregory forward interpolation. Padmanabham. P.Page 19 of 93 Week 19 Write C programs that use both recursive and non recursive functions to perform the following searching operations for a Key value in a given list of integers : i) Linear search ii) Binary search Week 20 Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Bubble sort ii) Quick sort Week 21 Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Insertion sort ii) Merge sort Week 22 Write C programs to implement the Lagrange interpolation and Newton. TMH publications. Ghosh. Forouzan 3. Programming in C. C and Data Structures.F. Week 23 Write C programs to implement the linear regression and polynomial regression algorithms.Dey & M. Data Structures: A pseudo code approach with C.A. Third Edition. second edition R. Gilberg and B. P. Text Books 1. E Balaguruswamy. 4. Week 24 Write C programs to implement Trapezoidal and Simpson methods. 19 . BS Publications 2. Oxford Univ. C programming and Data Structures.Press.

RC Phase Shift Oscillator 12. PN Junction Diode Characteristics (Forward bias. DPDT and DIP). Time response of first order RC/RL network for periodic non-sinusoidal inputs – time constant and steady state error determination. 6. 3.Tech. BJTs. Potentiometers. Switches (SPDT. Lowpower JFETs. Serial and Parallel Resonance – Timing. Gang Condensers. Feedback Amplifier (Voltage Series/Current series) 11. 5. OC & SC tests on Single-phase transformer (Predetermination of efficiency and regulation at given power factors and determination of equivalent circuit). 2. Swinburne’s Test on DC shunt machine (Predetermination of efficiency of a given DC Shunt machine working as motor and generator). 8. 4. Diodes. LEDs. Reverse bias) 3. 10. Verification of maximum power transfer theorem. Identification and Specifications of active devices. 7. Two port network parameters – Z-Y Parameters. Experimental determination of Thevenin’s and Norton’s equivalent circuits and verification by direct test. MOSFETs. UJT. Rectifier without Filters (Full wave & Half wave) 6.B 1. 12. SCR. 9. Specifications and Testing of R. Rectifier with Filters (Full wave & half wave) 7.Page 20 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 0 ELECTRICAL AND ELECTRONICS LAB I Year B.A 1. C Components (colour codes). CE and CC Amplifier 10. Verification of Superposition and Reciprocity theorems. Bread Boards. Identification. chain matrix and analytical verification. Bandwidth and Q-factor determination for RLC network. IT P 3 C 4 PART . LCDs. Transistor CE Characteristics (Input and Output) 5. Zener Diode Characteristics 4. 2. Regulation of alternator by synchronous impedance method PART . Shunt generator. L. 11. Verification on DC. Relays. SCR Characteristics 8.C. FET Characteristics 9. Linear and Digital ICs. Brake test on DC shunt motor. Coils. Hartely/Colpitts Oscillator 20 . Resonant frequency. verification on AC with Resistive and Reactive loads. Brake test on 3-phase Induction motor (performance characteristics). Determination of critical field resistance. Magnetization characteristics of D. Determination of performance Characteristics.

‘Just A Minute’ Sessions (JAM). Cambridge Books Suggested for English Language Lab Library (to be located within the lab in addition to the CDs of the text book which are loaded on the systems): 1. TOEFL.Vowels. 4. 7. 7th Edition • Learning to Speak English . To initiate them into greater use of the computer in resume preparation.8 GHZ b) RAM – 512 MB Minimum c) Hard Disk – 80 GB ii) Headphones of High quality Suggested Software: • Cambridge Advanced Learners’ English Dictionary with CD. 2. 5. • Language in Use. Introduction to the Sounds of English. Oral Presentations. Herbert Puchta and Jeff Stranks with Meredith Levy. Spellings. Giving Directions. To help the students cultivate the habit of reading passages from the computer monitor. learner-friendly modes of language learning. Introduction to Stress and Intonation. 10. To expose the students to a variety of self-instructional. LAN facility and English language software for self.A System. Information Transfer 8. Grammar. a digital stereo –audio & video system and camcorder etc. 4. Foundation Books Pvt Ltd with CD. IT P 3 C 4 The Language Lab focuses on the production and practice of sounds of language and familiarises the students with the use of English in everyday situations and contexts.study by learners. Situational Dialogues / Role Play. • Oxford Advanced Learner’s Compass. Describing Objects / Situations / People. and rhythm. formatmaking etc. public speaking. 5. GMAT etc.Page 21 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 0 ENGLISH LANGUAGE COMMUNICATION SKILLS LAB I Year B.Prepared and Extempore. group discussions. Minimum Requirement: The English Language Lab shall have two parts: i) The Computer aided Language Lab for 60 students with 60 systems. intonation.Tech. a T. 21 . V. ii) The Communication Skills Lab with movable chairs and audio-visual aids with a P. Cambridge with CD  English in Mind. Telephoning Skills. Diphthongs & Consonants. one master console. System Requirement ( Hardware component): Computer network with Lan with minimum 60 multimedia systems with the following specifications: i) P – IV Processor a) Speed – 2. report writing. Punctuation. To enable them to learn better pronunciation through stress on word accent.. • The Rosetta Stone English Library • Clarity Pronunciation Power – Part I • Mastering English in Vocabulary. Composition • Dorling Kindersley series of Grammar. Composition etc. Objectives: 1.4 CDs • Microsoft Encarta with CD • Murphy’s English Grammar. 3. 2. 6. thus providing them with the required facility to face computer-based competitive exams such GRE. To train them to use language effectively to face interviews. 3. Spoken English (CIEFL) in 3 volumes with 6 cassettes. OUP. Debate 9. SYLLABUS : The following course content is prescribed for the English Language Laboratory sessions: 1.

. B. 4. there shall be a continuous evaluation during the year for 25 sessional marks and 50 year-end Examination marks. The year. For the Language lab sessions. A text book of English Phonetics for Indian Students by T. Bansal and J. K. Dr G Natanam & Prof SA Sankaranarayanan. Sethi. Orient Longman 2006 Edn. Harrison. 6. OL DISTRIBUTION AND WEIGHTAGE OF MARKS English Language Laboratory Practical Paper: 1.V. Chennai Speaking English Effectively by Krishna Mohan & NP Singh (Macmillan) A Practical Course in English Pronunciation. New Delhi. 8. (with two Audio cassettes) by J. WBSCTE with British Council. 15 marks shall be awarded for day-to-day work and 10 marks to be awarded by conducting Internal Lab Test(s). 22 . English Language Communication : A Reader cum Lab Manual Dr A Ramakrishna Rao. Jindal. Prentice-Hall of India Pvt. Of the 25 marks.Page 22 of 93 2.end Examination shall be conducted by the teacher concerned with the help of another member of the staff of the same department of the same institution.R. Ltd. English Pronouncing Dictionary Daniel Jones Current Edition with CD. 7.Balasubramanian (Macmillan) English Skills for Technical Students. The practical examinations for the English Language Laboratory shall be conducted as per the University norms prescribed for the core engineering practical sessions. Kamlesh Sadanand & D. 2. 5. Anuradha Publications. 3. Spoken English.

If there is no internet connectivity preparations need to be made by the instructors to simulate the WWW on the LAN. tips and tricks would be covered.Tech. Usage of web browsers.. email. Internet & World Wide Web Week 9 . 23 . Week 2 – Task 2 : Every student should disassemble and assemble the PC back to working condition. IT P 3 C 4 Objectives : The IT Workshop for engineers is a 6 training lab course spread over 90 hours. Week 8 – Task 8 : The test consists of various systems with Hardware / Software related troubles. Excel.Task 2 : Web Browsers. power point presentations and personal web sites using the Microsoft suite of office tools and LaTeX. Draw the block diagram of the CPU along with the configuration of each peripheral and submit to your instructor. In the process they configure the TCP/IP setting. Productivity tools module would enable the students in crafting professional word documents. components in a CPU and its functions. The work done should be verified by the instructor and followed up with a Viva. Power Point and Publisher. installation of system software like MS Windows . Surfing the Web : Students customize their web browsers with the LAN proxy settings. Internet & World Wide Web module introduces the different ways of hooking the PC on to the internet from home and workplace and effectively usage of the internet. PC Hardware introduces the students to a personal computer and its basic peripherals. They should identify the problem and fix it to get the computer back to working condition. The modules include training on PC Hardware. Using wildcards Week 6 – Task 6 : Hardware Troubleshooting : Students have to be given a PC which does not boot due to improper assembly or defective peripherals. Text processing. The system should be configured as dual boot with both windows and Linux. excel spread sheets. the process of assembling a personal computer. In addition hardware and software level troubleshooting process.Task 1 : Orientation & Connectivity Boot Camp : Students should get connected to their Local Area Network and access the Internet.Page 23 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA T 0 IT WORKSHOP I Year B. bookmarks.e. Week 10 . Formatted disks without operating systems. Week 3 – Task 3 : Every student should individually install MS windows on the personal computer. plug-ins like Macromedia Flash and JRE for applets should be configured. They should identify the problem and fix it to get the computer back to working condition. i. A video would be given as part of the course content. Also students need to go through the video which shows the process of assembling a PC. In addition. PC Hardware Week 1 – Task 1 : Identify the peripherals of a computer. Finally students should demonstrate. The work done should be verified by the instructor and followed up with a Viva Week 7 – Task 7 : Software Troubleshooting : Students have to be given a malfunctioning CPU due to system software problems. Also. search toolbars and pop up blockers. Internet & World Wide Web and Productivity tools including Word. Lab instructor should verify the installation and follow it up with a Viva. to the instructor. awareness of cyber hygiene. Create hard and symbolic links. Lab instructors should verify the work and follow it up with a Viva. how to access the websites and email. protecting the personal computer from getting infected with the viruses. worms and other cyber attacks would be introduced. Linux and the required device drivers. Week 4 – Task 4 : Every student should install Linux on the computer. Lab instructors should verify the installation and follow it up with a Viva Week 5 – Task 5 : Several mini tasks would be that covers Basic commands in Linux and Basic system administration in Linux which includes: Basic Linux commands in bash. newsgroups and discussion forums would be covered. This computer should have windows installed.

Details of the four tasks and features that would be covered in each. Count function. This should be demonstrated to the instructors.Task 3 : Search Engines & Netiquette : Students should know what search engines are and how to use the search engines. Week 18 . Images from files and clipart. Hyperlink. Conditional formatting Week 22 . Week 12 . Inserting table.deviation. configure their personal firewall and windows update on their computer. They need to first install an anti virus software. Tables and Charts 24 . Formulae in excel – average. Inserting Header and Footer.Task 2 : Second week helps students in making their presentations interactive. Inserting objects. Footnote. Track Changes. block active x downloads to avoid viruses and/or worms. Formatting Text Week 20 . give the details of the four tasks and features that would be covered in each. Task 1 : Using LaTeX and word to create project certificate.Replicate the given document inclusive of all features LaTeX and MS/equivalent (FOSS) tool Power Point Week 24 .. Symbols. Week 13 Module Test A test which simulates all of the above tasks would be crafted and given to the students. auto fill. Week 15 .Table of Content. Using help and resources Task 1 : Creating a Scheduler . freeze panes. Auto Shapes. Formatting Images.Features to be covered:. Changing Text Direction. Word Art. Video.Page 24 of 93 Week 11 . Borders and Colors. Format Cells. LaTeX and Word Week 14 – Word Orientation : The mentor needs to give an overview of LaTeX and Microsoft/ equivalent (FOSS) tool word : Importance of LaTeX and MS/ equivalent (FOSS) tool Word as word Processors. Cell alignment. Formatting Text.Task 4 : Cyber Hygiene : Students would be exposed to the various threats on the internet and would be asked to configure their computer to be safe on the internet.Topic covered during this week includes : Hyperlinks. Data Validation Week 23 – Excel Module Test . Topic covered during this week includes :. overview of toolbars.Features to be covered:. Week 25 . Drop Cap in word.Replicate the given document inclusive of all features Excel Week 19 . Sorting.PPT Orientation. Applying Text effects. Week 16 . Hyper linking.Excel Orientation : The mentor needs to tell the importance of MS/ equivalent (FOSS) tool Excel as a Spreadsheet tool. Charts. Renaming and Inserting worksheets.Task 4 : Cricket Score Card . Inserting –Images.Features to be covered:. Using Excel – Accessing. Bullets and Numbering. Lines and Arrows in both LaTeX and Powerpoint.Task 4 : Creating a Feedback form . group and outline. Slide Layouts. Clip Art. Newspaper columns. Features to be covered:-Formatting Fonts in word. overview of toolbars. Using Character Spacing. Drawing toolbar and Word Art. Textboxes and Paragraphs Week 17 .Split cells.Task1 : Students will be working on basic power point utilities and tools which help them create basic power point presentation. LOOKUP/VLOOKUP Week 21 . Using Date and Time option in both LaTeX and Word. A few topics would be given to the students for which they need to search on Google. rulers. Then they need to customize their browsers to block pop ups. std. Using LaTeX and word – Accessing.Task 2 : Calculating GPA . Using help and resources.LaTeX and Word Module Test . Bullets and Numbering. Text Fields.Forms. Boolean and logical operators. format painter in word. Mail Merge in Word.Features to be covered:-Pivot Tables. Spell Check .Task 3 : Creating a Newsletter : Features to be covered:. Interactive Buttons. Summation.Task 2 : Creating project abstract Features to be covered:-Formatting Styles.Gridlines. saving files.Features to be covered. Audio. Inserting Text. Importing Data.Task 3 : Performance Analysis .Cell Referencing. saving excel files. Objects. Data Protection.

notes etc). The Complete Computer upgrade and repair book.org 25 .Task 5 : Power point test would be conducted. textures.sssolutions. Comdex Information Technology course tool kit Vikas Gupta.Master Layouts (slide.Task 4 : Entire week concentrates on presentation part of LaTeX and power point. Publisher Week 29 : Help students in preparing their personal website using Microsoft/ equivalent (FOSS) tool publisher. REFERENCES : 1. slide slotter. Students will be given model power point presentation which needs to be replicated (exactly how it’s asked). Inserting – Background. Types of views (basic. Inserting Tables. Auto Rehearsing Week 28 . 6.in and (b) www.3rd edition Cheryl A Schmidt. Chase PHI (Microsoft) 5. Inserting text objects.sontisoftsolutions. template. WILEY Dreamtech 2. Topic covered during this week includes . Editing text objects. Topic covered during this week includes :. Slide Transition. All LaTeX and others related material is available at (a) www.Page 25 of 93 Week 26 . presentation. and notes). Pearson Education. Introduction to Information Technology. Hidden slides. deleting. PC Hardware and A+Handbook – Kate J.Publisher Orientation. 4. modifying pages. Design Templates. WILEY Dreamtech 3. Inserting pages. ITL Education Solutions limited. Helps them learn best practices in designing and preparing power point presentation. LaTeX Companion – Leslie Lamport. Hyper linking. Custom Animation. Using Templates. Week 27 . Hosting website. Working with menu objects. Topic covered during this week includes -Using Auto content wizard.Task 3 : Concentrating on the in and out of Microsoft power point and presentations in LaTeX. Renaming. PHI/Pearson. Layouts.

Page 26 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B.Bayesian estimation. Iyengar. K. S.Sampling distributions of mean (known and unknown) proportions. Arnold O. UNIT-VII Tests of significance – Student’s t-test. Guru Swamy. 3. V. UNIT-IV Sampling distribution: Populations and samples . UNIT-VI Test of Hypothesis – Means– Hypothesis concerning one and two means– Type I and Type II errors. Mendan Hall. Anuradha Publishers. Probability & Statistics. D. UNIT-VIII Queuing Theory: Pure Birth and Death Process M/M/1 Model and Simple Problems. 2.Conditional probability – Baye’s theorem. Allen. B. Probability & Statistics. Probability & Statistics for Engineers. Academic Press. Text Books: 1. Chand & Company. Book Links. 4. P 0 C 4 UNIT-II Random variables – Discrete and continuous – Distribution – Distribution function. K. Freund. S. two-tail tests. 26 . Krishna Gandhi and Others. A text book of Probability & Statistics.Tech. T. V. sums and differences. References: 1. Shahnaz Bathul. UNIT-V Estimation: Point estimation – interval estimation . Probability & Statistics. 2. G. One tail. Miller and John E. Probability & Statistics. Estimation of proportions. F-test. Beaver Thomson Publishers. Distribution UNIT-III Binomial and poison distributions Normal distribution – related properties. Prentice Hall of India. IT I-Sem T 4+1* PROBABILITY AND STATISTICS UNIT-I Probability: Sample space and events – Probability – The axioms of probability – Some Elementary theorems . χ 2 test. Murugeson & P.

Pigeon hole principles and its application. compatibility and partial ordering relations. Free & Bound variables.P. 3. Binomial Coefficients. tautology. & Manohar . 5. Bernand Kolman. UNIT-VI Recurrence Relation : Generating Functions.Page 27 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. T. UNIT-II Predicates : Predicative logic. REFERENCES : 1. Elsevier 2. DFS. Kenneth H. Truth Tables. UNIT-V Elementary Combinatorics: Basis of counting. the principles of Inclusion – Exclusion. Fifth Edition. equivalence implication. Spanning Trees. Grass Man & Trembley. Constrained repetitions. 6. Function of Sequences Calculating Coefficient of generating function. Baker Prentice Hall. Multi graphs and Euler circuits. Rosen. 27 . proof of contradiction. with repetitions. Mott. Isomorphism. Binomial Multinomial theorems. UNIT-IV Algebraic structures : Algebraic systems Examples and general properties. P. Functions: Inverse Function Comports of functions. Discrete Mathematical Structures. Recurrence relations. Person Education. Thomson. equivalence. groups sub groups’ homomorphism. UNIT-III Set Theory : Properties of binary Relations. A. Consistency. Lattice and its Properties. Garry Haggard and others. IT I-Sem T 4+1* MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE P 0 C 4 UNIT-I Mathematical Logic : Statements and notations.TMH. Characteristics roots solution of In homogeneous Recurrence Relation. Discrete and Combinational Mathematics. TMH 3. Chromatic Numbers TEXT BOOKS : 1. Pearson Education/PHI. Discrete Mathematics for Computer science. Sharn Cutter Ross. Automatic Theorem Proving. Hasse diagram. Basic Concepts Isomorphism and Sub graphs.Grimaldi. Solving recurrence relation by substitution and Generating funds. Connectives.P. BFS. Discrete Mathematics with Applications. Combinations & Permutations. Busby. Well formed formulas. Discrete Mathematical structures Theory and application-Malik & Sen 4. Kandel. Discrete Mathematical Structures with applications to computer science Trembly J. Semi groups and monads. Roberty C. Hamiltonian graphs.Discrete Mathematics and its Applications.Tech. Discrete Mathematics for Computer Scientists & Mathematicians. planar Graphs UNIT-VIII Graph Theory and Applications. Normal forms. Thomas Koshy.P.Pearson Education 2.An Applied Introduction-5th Edition – Ralph. UNIT-VII Graph Theory : Representation of Graph. recursive Functions. J. Rules of inference.L. Logic and Discrete Mathematics.

Savitch. collision resolution-separate chaining. Omega notation and Theta notation. deletion and searching. The Complete Reference. Data Structures and Algorithms in C++.O-notation.University press (India) pvt ltd. Search trees (part II) : Introduction to Red –Black trees and Splay Trees. merge sort.Model for external sorting. exception handling. Realizing a Priority Queue using Heaps. quadratic probing. Definition. External Sorting. Inheritance basics. sparse matrix representation. deletion and searching. representation. queue ADT. Inline functions. open addressing-linear probing. Unit VI:Search trees (part I) : Binary search trees. inheritance types. Strassen’s matrix multiplication Efficient non recursive tree traversal algorithms. The OOP. Ordering Matrix Multiplications TEXT BOOKS : 1. Langsam. hash functions. 2nd edition. Unit V:Priority Queues – Definition. Unit II:Function Overloading. Orient Longman pvt. linear list representation. Thomson 3. abstract classes. 28 . Adam Drozdek. Unit IV:Dictionaries. John Wiley and Sons. implementation.Function and class templates. Pearson education. hash table representation. base and derived classes.extendible hashing. static class members. Unit III:Algorithms. skip list representation. C++. second edition. Constructors and destructors. Deletion. R. PHI/Pearson Education. performance analysis-time complexity and space complexity. parameter passing methods.AVL trees. Operator Overloading. definition.Goodrich. Generic Programming. Problem solving with C++. Class Scope. Job sequencing with deadlines. Michael T. Biconnected components. Seventh Edition Wiley student edition.Sahni. Augenstein and Tanenbaum. Polyphase merge. deletion and searching. Algorithms and Applications in C++.Tech. operations.insertion. streams I/O. TMH. Class Members. General method (Dynamic Programming). B-Trees-B-Tree of order m. definition. Objects. Data Structures and Algorithm Analysis in C++. Access Control. Minimum cost spanning trees. Optimal binary search trees. insertion.Mount. runtime polymorphism using virtual functions.ltd. Third Edition. Data structures using C and C++. Comparison of Search Trees. ADT. Disjoint set operations. Multiway merge. 4th Edition. Data structures and Algorithms in C++. rehashing. 5. IT I-Sem T 4+1* ADVANCED DATA STRUCTURES AND ALGORITHMS P 0 C 4 Unit I:C++ Class Overview.Page 28 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA. Review of basic data structures . height of an AVL tree.General method. insertion and deletion. 4. Herbert Schildt.the list ADT. operations-insertion. double hashing. dynamic memory allocation and deallocation (new and delete). quick sort. ADT. Balanced search trees. this pointer. REFERENCE : 1. 0/1 knapsack problem. Unit VIII:Greedy method and Dynamic programming : General method (Greedy).Tamassia and D. operations-searching. stack ADT. Data structures. W. implementation using template classes in C++. 2.S. union and find algorithms. Unit VII:Divide and Conquer. II Year B. Fourth edition. applications – Binary search. Mark Allen Weiss. base class access control. insertion. 2. friend functions. Pearson Education. comparison of hashing and skip lists. Application-Heap Sort.Class Definition. height of a B-Tree.

Five-Variable map. integrated circuits. Flip-Flops Analysis of clocked sequential circuits. Binary Storage and Registers. Boolean functions canonical and standard forms. UNIT . UNIT . IT I-Sem T P C 4+1* 0 4 DIGITAL LOGIC DESIGN UNIT .VI Registers. product of sums simplification Don’t-care conditions. UNIT . Edition. Design Procedure. Circuits with Latches.Page 29 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. M. Binary multiplier. Signed binary numbers. State Reduction and Assignment. 2. Pearson Education 3. Reduciton of state and Flow Tables. Exclusive – Or function. Pearson Education/PHI. Rao. Number base conversions. Digital Principles and Design – Donald D. other logic operations. TEXT BOOKS : 1. UNIT . Sequential Programmable Devices. Random-Access Memory. magnitude comparator. M. Encoders. complements. Basic theorems and properties of Boolean algebra. Error Detection and correction Read-only memory. HDL for Registers and counters. HDL for combinational circuits.II BOOLEAN ALGEBRA AND LOGIC GATES : Basic Definitions.VIII ASYNCHRONOUS SEQUENTIAL LOGIC : Introduction. Binary logic. other counters. REFERENCES : 1. Hardward Description language (HDL).5th Edition.Tech.I BINARY SYSTEMS : Digital Systems. 4. Binary Numbers. Memory Decoding. Design Example. Octal and Hexadecimal Numbers. Programmable logic Array programmable Array logic. Race-Free state Assignment Hazards. Fundamentals of Digital Logic & Micro Computer Design . Analysis procedure Design procedure. Tata McGraw Hill. Binary AdderSubtractor Decimal Adder. 2. Decoders.IV COMBINATIONAL LOGIC : Combinational Circuits. shift Registers.Givone. Switching and Finite Automata Theory by Zvi.Thomson. Multiplexers.Morris Mano.V. FUNDAMENTALS OF LOGIC DESIGN. HDL for sequential circuits.VII Introduction. Tata McGraw Hill. DIGITAL DESIGN – Third Edition . UNIT . Switching and Logic Design.V SYNCHRONOUS SEQUENTIAL LOGIC : Sequential circuits. Kohavi. UNIT . Design Procedure. Ripple counters synchronous counters. latches. C. Digital logic gages. UNIT .III GATE – LEVEL MINIMIZATION : The map method.S. Rafiquzzaman John Wiley 29 . Binary codes. NAND and NOR implementation other Two-level implementnations. Analysis Procedure. Four-variable map. 5TH Edition. Roth. Axiomatic definition of Boolean Algebra.

diff. cat. lstat. Two Special Files. Comparing Files. Debugging Scripts.Thomson 30 . ps. tar. uname. Unit VI : Interactive Korn Shell : Korn Shell Features. gzip. Korn Shell Programming : Basic Script concepts. process utilities.Introduction to unix file system. Associative Arrays. Sorting. disk utilities. eval Command.Page 30 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. Command History. chmod. Command Execution Process. cp. unlink. Tee Command. grep Family. od. cut. Options. lseek. printf. Directory API – opendir. unmask. Features of Unix . eval Command. w. String Functions. Repetition. Count characters. find. Variables. unlink. detailed commands to be covered are tail. rmdir. On-Off Variables. Expressions. Unit V : awk: Execution. telnet.Architecture of Unix. mv. Unix and shell Programming Behrouz A. write. Predefined Variables. special Parameters and Variables. Repetition. fgrep. Patterns. head . umount. Environmental Variables. C Shell Programming : Basic Script concepts. awk. comm. uniq. Pipes. open. Display Beginning and End of files. Actions. Variables. Sed : Scripts. symlink. IT I-Sem T 4+1* UNIX AND SHELL PROGRAMMING P 0 C 4 Unit I: Introduction to Unix:. Fields and Records. Startup Scripts. Unit VIII : File Management : File Structures. Translating Characters. fstat. changing Positional Parameters. Input.Tech. Expressions.Text processing utilities and backup utilities . lp. security by file permissions. Unit VII : Interactive C Shell : C shell features. cd. Options. Unix Commands – PATH. vi editor. Script Examples. pwd. Command Execution. file handling utilities. df. Exit Status of a Command. Richard F. Output. Scripts. mount. Filters : Filters and Pipes. Environmental Variables. Cut and Paste. changing Positional Parameters. nl. Exit Status of a Command. Gilberg. Debugging Scripts. Command History. Mathematical Functions. finger. sed and awk. Concatenating files. ftp. commands. User – Defined Functions. TEXT BOOKS : 1. umask. Redirection. Operation. Decisions: Making Selections. sort. ls. Decisions: Making Selections. Forouzan. special Parameters and Variables. read. Variables. mkdir. passwd. stat. join. pg. Command-Line Editing. more. chown. tee. du. mkdir. script. System Calls for File Management – create. Applications. Addresses. Command Substitution. Applications. man. Two Special Files. wc. networking commands. stty. rmdir. awk and grep. Input. date. Words or Lines. Files with Duplicate Lines. Job Control. Unit II : Unix Utilities:. rlogin. close. closedir. Quotes. Shell/Environment Customization. link. Standard Streams. who. egrep. Operations. ulimit. String Functions. arp. Script Examples. grep. rm. Using System commands in awk. Output. cpio Unit III : Introduction to Shells : Unix Session. Aliases. readdir. paste. Startup and Shutdown Scripts. Searching for File Content. Command Execution Scripts. echo. cmp. grep and sed. tr. Unit IV : Grep : Operation. Argument Validation. Argument Validation.

Graham Glass. King Ables. TMH. Sumitabha Das. Pearson Education. PHI. TMH. Unix for programmers and users. 2nd Edition. 31 .Page 31 of 93 2. Rosen. Rosinski. Second Edition. / Pearson Education 3. Klee. REFERENCES : 1. 2. Unix programming environment. Farber. Your Unix the ultimate guide. 3rd edition. Kernighan and Pike. The Complete Reference Unix. Host.

Demand Forecasting. IT I-Sem T 4+1* MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS P 0 C 4 Unit I Introduction to Managerial Economics: Definition. Managerial Economics. Cost Analysis: Cost concepts. Journal. Laws of Returns.Final Accounts (Trading Account. Break-even Analysis (BEA)-Determination of Break-Even Point (simple problems). judgmental approach to demand forecasting) Unit III Theory of Production and Cost Analysis: Production Function – Isoquants and Isocosts. controlled experiments. expert opinion method. Siddiqui & A. Types. features of capital budgeting proposals. Peak Load Pricing. Net Profit ratio. Changing Business Environment in Post-liberalization scenario. Features and evaluation of Sole Proprietorship. 4. Ledger. Penetration Pricing. P/E Ratio and EPS). Trial Balance. H.Tech. Financial Accounting for Management. Managerial Economics. Analysis and Interpretation of Liquidity Ratios (Current Ratio and quick ratio). Variable costs. Nature and Scope of Managerial Economics–Demand Analysis: Demand Determinants. Ambrish Gupta. New Delhi. test marketing. MRTS. Implicit costs. Unit II Elasticity of Demand: Definition. Lipsey & Chrystel. and Profitability ratios (Gross Profit Ratio. 5. Activity Ratios (Inventory turnover ratio and Debtor Turnover ratio). Unit IV Introduction to Markets & Pricing Policies: Market structures: Types of competition. Measurement and Significance of Elasticity of Demand. Internal and External Economies of Scale. Operating Ratio. Economics. Varshney & Maheswari: Managerial Economics. Public Enterprises and their types. Partnership. Siddiqui. 3. PHI. Joint Stock Company. Cross Subsidization. S. TMH. Limit Pricing.Managerial Significance and limitations of BEA. Managerial Economics & Financial Analysis. Estimation of Fixed and Working capital requirements. Sealed Bid Pricing. Two-Part Pricing. Unit VI Capital and Capital Budgeting: Capital and its significance. New age International Space Publications. Marginal Cost Pricing. Sultan Chand. Capital structure Ratios (Debt. TEXT BOOKS: 1. Price-Output Determination in case of Perfect Competition and Monopoly. statistical methods.Methods of Pricing: Cost Plus Pricing. S.Equity ratio. Factors governing demand forecasting. Nature and scope of capital budgeting. methods of demand forecasting (survey methods. Going Rate Pricing. Imputed costs. Accounting Rate of Return (ARR) and Net Present Value Method (simple problems) Unit VII Introduction to Financial Accounting: Double-Entry Book Keeping. Methods and sources of raising finance. Interest Coverage ratio). Features of Perfect competition. Market Skimming Pricing. Unit VIII Financial Analysis through ratios: Computation. Opportunity cost. Unit V Business & New Economic Environment: Characteristic features of Business. Law of Demand and its exceptions. Craig Peterson & W. Objectives and Policies of Pricing. 4th Ed.Page 32 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. 2005. Methods of Capital Budgeting: Payback Method. Explicit costs Vs. 2003. Cobb-Douglas Production function. A. Pearson Education. Oxford University Press. Profit and Loss Account and Balance Sheet with simple adjustments). Types of Capital. Oxford University Press. Bundling Pricing. 2. 2. REFERENCES: 1. Block Pricing. 32 . Out of pocket costs vs. Aryasri: Managerial Economics and Financial Analysis. Cris Lewis. Suma Damodaran. 2/e. Fixed vs. Monopoly and Monopolistic Competition. Least Cost Combination of Inputs.

Maheswari. Thomson. Each question should not have more than 3 bits. Problems and Cases. PHI. 6th Ed. Financial Accounting. Prerequisites: Nil Objective: To explain the basic principles of managerial economics. Scitech. Truet and Truet: Managerial Economics:Analysis.N. 10.K. 8. Domnick Salvatore: Managerial Economics In a Global Economy. Codes/Tables: Present Value Tables need to be permitted into the examinations Hall. 33 . 4th Edition.Maheswari & S.. 11. 9. Raghunatha Reddy & Narasimhachary: Managerial Economics& Financial Analysis. Dwivedi:Managerial Economics. Question Paper Pattern: 5 Questions to be answered out of 8 questions. Wiley. 7. Narayanaswamy: Financial Accounting—A Managerial Perspective. S. Vikas.Page 33 of 93 6. Vikas. accounting and current business environment underlying business decision making.

• To make the student write ADTS for all data structures. Thomson. Week12-. Week 4-Write a C++ program to perform the following operations: a) Insert an element into a binary search tree. Week7.Write C++ programs to implement the following using a singly linked list. Thomson 34 .Write C++ programs that use non-recursive functions to traverse the given binary tree in a) Preorder b) inorder and c) postorder.Tech. b) Delete an element from a binary search tree.Write a C++ program to perform the following operations a) Insertion into a B-tree b) Deletion from a B-tree Week9-.Write C++ programs for implementing the following sorting methods: a) Merge sort b) Heap sort Week8-. Malik. Third Edition. Week6-. Adam Drozdek.Write C++ programs for the implementation of bfs and dfs for a given graph. (Note: Use Class Templates In the above Programs) TEXT BOOKS : 1.Data Structures and Algorithms in C++.Write a C++ program to perform the following operations a) Insertion into an AVL-tree b) Deletion from an AVL-tree Week10-Write a C++ program to implement Kruskal’s algorithm to generate a minimum cost spanning tree. Week5-. c) Search for a key element in a binary search tree. 2. Recommended Systems/Software Requirements: • • Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space C++ compiler and STL Recommended P 3 C 2 Week1. • To make the student learn different algorithm design techniques. IT I-Sem T 0 ADVANCED DATA STRUCTURES AND ALGORITHMS LAB Objectives: • To make the student learn a object oriented way of solving problems. a) Stack ADT b) Queue ADT Week3. a) Stack ADT b) Queue ADT Week2. Week11-Write a C++ program to implement Prim’s algorithm to generate a minimum cost spanning tree.C++ programs to implement the following using an array.Data Structures using C++.Write a C++ program to implement all the functions of a dictionary (ADT) using hashing.Page 34 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B.Write C++ programs to implement the deque (double ended queue) ADT using a doubly linked list and an array. D.S.

IT I-Sem UNIX AND SHELL PROGRAMMING LAB Objectives: • To teach students various unix utilities and shell scripting Recommended Systems/Software Requirements: • Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space LAN Connected • Any flavour of Unix / Linux Week1 Session-1 a)Log into the system b)Use vi editor to create a file called myfile. mytable. mytable i)Logout of the system.86 c)Use the cat command to display the file. 2) a)Write a sed command that deletes the first character in each line in a file. e)Use the sort command to sort the file mytable according to the first field. d)Use the who command and redirect the result to a file called myfile1. Week3 1) a)Login to the system b)Use the appropriate command to determine your login shell c)Use the /etc/passwd file to verify the result of step b. Call the sorted file my table (same name) f)Print the file mytable g)Use the cut and paste commands to swap fields 2 and 3 of mytable. 1425 Ravi 15.15 1450 Raju 21. Call it my table (same name) h)Print the new file. Use the more command to see the contents of myfile1.Page 35 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B.65 4320 Ramu 26. c)correct typing errors during creation. e)Use the date and who commands in sequence (in one line) such that the output of date will display on the screen and the output of who will be redirected to a file called myfile2. d)Use the vi command to correct any errors in the file. d)Save the file e)logout of the system Session-2 a)Log into the system b)open the file created in session 1 c)Add some text d)Change some text e)Delete some text f)Save the Changes g)Logout of the system Week2 a)Log into the system b)Use the cat command to create a file containing the following data.txt which contains some text. mytable. Use the more command to check the contents of myfile2.Tech.27 6830 Sita 36. Call it mytable use tabs to separate the fields. T 0 P 3 C 2 35 .

c)Write a sed command that swaps the first and second words in each line in a file. Week6 a)Write a shell script that accepts a file name starting and ending line numbers as arguments and displays all the lines between the given line numbers. Week10 Write a C program that takes one or more file or directory names as command line input and reports the following information on the file: i)File type ii)Number of links iii)Read. and print out the home directory of each user. b)Write a shell script that accepts one or more file name as arguments and converts all of them to uppercase. It should check whether the two file contents are same or not. or linking files. such as the file name. b)Write a shell script that accepts two integers as its arguments and computers the value of first number raised to the power of the second number. write and execute permissions iv)Time of last access (Note : Use stat/fstat system calls) Week11 36 . c)Write a shell script to perform the following string operations: i)To extract a sub-string from a given string. a file. b)Write a shell script that deletes all lines containing a specified word in one or more files supplied as arguments to it. or something else. Week4 a)Pipe your /etc/passwd file to awk. Week9 a)Write a shell script that displays a list of all the files in the current directory to which the user has read. b)Develop an interactive grep script that asks for a word and a file name and then tells how many lines contain that word. provided they exist in the current directory. Week8 a)Write an interactive file-handling shell program. write and execute permissions. Week7 a)Write a shell script that computes the gross salary of a employee according to the following rules: i)If basic salary is < 1500 then HRA =10% of the basic and DA =90% of the basic. If they are same then second file should be deleted. b)Write shell script that takes a login name as command – line argument and reports when that person logs in c)Write a shell script which receives two file names as arguments. new name and so on. Let it offer the user the choice of copying. b)Develop an interactive script that ask for a word and a file name and then tells how many times that word occurred in the file. c)Repeat d)Part using awk Week5 a)Write a shell script that takes a command –line argument and reports on whether it is directory. c)Write a shell script that determines the period for which a specified user is working on the system. ii)To find the length of a given string. removing. ii)If basic salary is >=1500 then HRA =Rs500 and DA=98% of the basic The basic salary is entered interactively through the key board. have the program ask the user for the necessary information.Page 36 of 93 b)Write a sed command that deletes the character before the last character in each line in a file. renaming. Once the user has made a choice.

Fourth Edition. 5)Beginning shell scripting. 3)Unix for programmers and users. Foster – Johnson & other. B. Sumitabha Das.India.Page 37 of 93 Write C programs that simulate the following unix commands: a)mv b)cp (Use system calls) Week12 Write a C program that simulates ls Command (Use system calls / directory API) TEXT BOOKS 1)Introduction to UNIX & SHELL programming. Ables. Gaham Glass & K.F. Pearson Education. 3rd edition. Venkatesh Murthy. Giberg. 37 . pearson education.G. TMH. E. 2)Unix concepts and applications. Thomson. Forouzan & R. 4)Unix and shell Programming –A text book.A. Wile Y. M.

abstraction mechanisms. Understanding CLASSPATH. construction. TEXT BOOKS : 1. variables. Delegation event model. classes and objects – concepts of classes. simple java program. scrollbars. pearson eduction. Budd. simple client server program. datatypes. TMH. containers. throws and finally. UNIT VIII : Networking – Basics of network programming. T. Combo boxes. choices. recursion. addresses. canvas. Event classes. built in exceptions. components. the complete reference. specification. costs of inheritance. multiple clients. applying interfaces. updated edition. arrays. defining an interface. creating applets.Tech. Herbert schildt. method binding. Java buzzwords. type conversion and costing. coping with complexity. Scroll Panes. this keyword. limitation. UNIT IV : Packages and Interfaces : Defining. classes and instances. thread life cycle. limitations of AWT. string handling. 7th editon. throw. forms of inheritance. text fields. UNIT III : Inheritance – Hierarchical abstractions. graphics. substitutability.specialization. using final with inheritance. Member access rules. variables in interface and extending interfaces. button.net package Packages – java.Concepts of exception handling.labels. Event Listeners. differences between applets and applications. responsibility.Page 38 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. access control. messages. overriding and exceptions. A way of viewing world – Agents.The AWT class hierarchy. Java . synchronizing threads. subtype. Exploring packages – Java. Java. UNITVI : Event Handling : Events. JFrame and JComponent. combination. passing parameters to applets. parameter passing. buttons – The JButton class.Need for oop paradigm. UNIT II : Java Basics History of Java. inner classes. handling mouse and keyboard events. card and grib bag. Trees. expressions. methods. differences between classes and interfaces. IT II-Sem T P C 4+1* 0 4 OBJECT ORIENTED PROGRAMMING UNIT I : Object oriented thinking :. super uses. scope and life time of variables. Termination or resumptive models. lists panels – scrollpane. grid. types of applets. MVC architecture. UNIT VII : Applets – Concepts of Applets. text components. benefits of exception handling. creating own exception sub classes. usage of try. abstract classes. and Tables. menubar. daemon threads. user interface components. java.util. overloading methods and constructors. Radio buttons. implementing interface. Tabbed Panes. Event sources. check box. 2. thread groups. life cycle of an applet. Check boxes. catch. Differences between multi threading and multitasking. exploring swingJApplet. operators.util. Swing – Introduction. polymorphism. control statements. class hierarchies (Inheritance). constructors. objects. benefits of inheritance. importing packages. flow. Icons and Labels. 38 . exception hierarchy. Adapter classes. Creating and Accessing a Package. creating threads. garbage collection. methods. layout manager – layout manager types – boarder. dialogs. extension. check box groups. Base class object. ports. subclass.io. sockets.method overriding. UNIT V : Exception handling and multithreading . summary of oop concepts. Understanding OOP with Java.

Pearson Education. Cay. 6 . Pearson Education 7.Page 39 of 93 REFERENCES : An Introduction to programming and OO design using Java. 5. pearson education. Seventh Edition. Vol 1.Nino and F. Budd.Horstmann and Gary Cornell. Vol 2. T.Horstmann and Gary Cornell. An introduction to Java programming and object oriented application development. University Press. Advanced Features. Y. R. Fundamentals.Core Java 2. John wiley & sons. 2. 4. P.S. J. Core Java 2. Hosch.S.A. 3. Radha Krishna. 39 . JohnsonThomson. Introduction to Java programming 6th edition. 1.A. pearson education. Daniel Liang. An Introduction to OOP. Object Oriented Programming through Java. Cay. seventh Edition. second edition.

UNIT VIII : MULTI PROCESSORS : Characteristics or Multiprocessors. Array Processors. Data Representation. USB.Moris Mano. Bus structures.Tech. design of control unit Hard wired control. Vth Edition. Priority Interrupt Direct memory Access. Microprogrammed control UNIT IV : COMPUTER ARITHMETIC : Addition and subtraction. Edition. IEEE1394. Pearson/PHI 2. Interconnect (PCI) bus. Pipelining. UNIT II : REGISTER TRANSFER LANGUAGE AND MICROOPERATIONS : Register Transfer language. multiprocessors and multi computers. TEXT BOOKS : 1. Arithmetic logic shift unit. Basic OPERATIONAL concepts. Virtual memories secondary storage. Floating – point Arithmetic operations. Asynchronous data transfer Modes of Transfer. Software. Reduced Instruction set computer. Interconnection Structures. Arithmetic Pipeline. 4. Introduction to standard serial communication protocols like RS232. Fundamentals or Computer Organization and Design. Tanenbaum.Register Transfer Bus and memory transfers. IT II-Sem T 4+1* COMPUTER ORGANIZATION P 0 C 4 UNIT I : BASIC STRUCTURE OF COMPUTERS : Computer Types.Computer Architecture: Fundamentals and principles of Computer Design. Computer Registers Computer instructions – Instruction cycle. SafeaZaky. 4th Edition PHI/Pearson 3. Introduction to RAID. Introduction to peripheral component. multiplication Algorithms.Sivaraama Dandamudi Springer Int. Program control. 40 . Instruction formats. Floating – Point Representation. Computer Organization – Carl Hamacher. Arithmetic Mircrooperatiaons. Address sequencing. .Page 40 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. Joseph D. microprogram example. Fixed Point Representation. logic micro operations. Computer Organization and Architecture – William Stallings Sixth Edition. shift micro operations. McGraw Hill. STACK organization. 2. Read-only memories Cache memories performance considerations. Functional unit. Addressing modes. Division Algorithms. Computer Architecture a quantitative approach. Fourth Edition Elsevier 5. Hennessy and David A. Pearson/PHI REFERENCES : 1. Error Detection codes. Interprocessor Arbitration. UNIT V : THE MEMORY SYSTEM : Basic concepts semiconductor RAM memories. BS Publication. Shared Memory Multiprocessors. Computer Systems Architecture – M. Structured Computer Organization – Andrew S. Input – Output and Interrupt. Dumas II. Instruction codes. Input –Output Processor (IOP) Serial communication. InterProcessor Communication and Synchronization Cache Coherance. IIIrd Edition. UNIT VII : PIPELINE AND VECTOR PROCESSING : Parallel Processing. Zvonks Vranesic. Decimal Arithmetic unit Decimal Arithmetic operations. UNIT III : MICRO PROGRAMMED CONTROL : Control memory. DATA Transfer and manipulation. Performance. UNIT-VI INPUT-OUTPUT ORGANIZATION : Peripheral Devices. John L. Patterson. Memory – Reference Instructions. RISC Pipeline Vector Processing. Instruction Pipeline. Input-Output Interface.

Page 41 of 93
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B.Tech. IT II-Sem T 4+1* DATABASE MANAGEMENT SYSTEMS

P 0

C 4

UNIT I : Data base System Applications, data base System VS file System – View of Data – Data Abstraction – Instances and Schemas – data Models – the ER Model – Relational Model – Other Models – Database Languages – DDL – DML – database Access for applications Programs – data base Users and Administrator – Transaction Management – data base System Structure – Storage Manager – the Query Processor UNIT II : History of Data base Systems. Data base design and ER diagrams – Beyond ER Design Entities, Attributes and Entity sets – Relationships and Relationship sets – Additional features of ER Model – Concept Design with the ER Model – Conceptual Design for Large enterprises. UNIT III : Introduction to the Relational Model – Integrity Constraint Over relations – Enforcing Integrity constraints – Querying relational data – Logical data base Design – Introduction to Views – Destroying /altering Tables and Views. Relational Algebra – Selection and projection set operations – renaming – Joins – Division – Examples of Algebra overviews – Relational calculus – Tuple relational Calculus – Domain relational calculus – Expressive Power of Algebra and calculus. UNIT IV : Form of Basic SQL Query – Examples of Basic SQL Queries – Introduction to Nested Queries – Correlated Nested Queries Set – Comparison Operators – Aggregative Operators – NULL values – Comparison using Null values – Logical connectivity’s – AND, OR and NOT – Impact on SQL Constructs – Outer Joins – Disallowing NULL values – Complex Integrity Constraints in SQL Triggers and Active Data bases. UNIT V : Schema refinement – Problems Caused by redundancy – Decompositions – Problem related to decomposition – reasoning about FDS – FIRST, SECOND, THIRD Normal forms – BCNF – Lossless join Decomposition – Dependency preserving Decomposition – Schema refinement in Data base Design – Multi valued Dependencies – FORTH Normal Form. UNIT VI : Transaction Concept- Transaction State- Implementation of Atomicity and Durability – Concurrent – Executions – Serializability- Recoverability – Implementation of Isolation – Testing for serializability- Lock – Based Protocols – Timestamp Based Protocols- Validation- Based Protocols – Multiple Granularity. UNIT VII : Recovery and Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions – Buffer Management – Failure with loss of nonvolatile storage-Advance Recovery systems- Remote Backup systems. UNIT VIII : Data on External Storage – File Organization and Indexing – Cluster Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based Indexing – Tree base Indexing – Comparison of File Organizations – Indexes and Performance Tuning- Intuitions for tree Indexes – Indexed Sequential Access Methods (ISAM) – B+ Trees: A Dynamic Index Structure. TEXT BOOKS : 1. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill 3rd Edition 2. Data base System Concepts, Silberschatz, Korth, McGraw hill, V edition. REFERENCES : 1. Data base Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7th Edition. 2. Fundamentals of Database Systems, Elmasri Navrate Pearson Education 3. Introduction to Database Systems, C.J.Date Pearson Education

41

Page 42 of 93
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B.Tech. IT II-Sem T 4+1* OPERATING SYSTEMS UNIT I : Computer System and Operating System Overview: Overview of computer operating systems functions protection and security distributed systems special purpose systems structures and systems calls operating systems generation

P 0

C 4

systems operating operating systems

UNIT II : Process Management – Process concepts threads, scheduling-criteria algorithms, their evaluation, Thread scheduling, case studies UNIX, Linux, Windows UNIT III : Concurrency : Process synchronization, the critical- section problem, Peterson’s Solution, synchronization Hardware, semaphores, classic problems of synchronization, monitors, Synchronization examples, atomic transactions. Case studies UNIX, Linux, Windows UNIT IV : Memory Management : Swapping, contiguous memory allocation, paging, structure of the page table , segmentation, virtual memory, demand paging, page-Replacement, algorithms, case studies UNIX, Linux, Windows UNIT V : Principles of deadlock – system model, deadlock characterization, deadlock prevention, detection and avoidance, recovery form deadlock, I/O systems, Hardware, application interface, kernel I/O subsystem, Transforming I/O requests Hardware operation, STREAMS, performance. UNIT VI : File system Interface- the concept of a file, Access Methods, Directory structure, File system mounting, file sharing, protection. File System implementation- File system structure, file system implementation, directory implementation, directory implementation, allocation methods, free-space management, efficiency and performance, case studies. UNIX, Linux, Windows UNIT VII : Mass-storage structure overview of Mass-storage structure, Disk structure, disk attachment disk scheduling, swap-space management, RAID structure, stable-storage implementation, Tertiary storage structure. UNIT VIII : Protection : Protection, Goals of Protection, Principles of Protection, Domain of protection Access Matrix, Implementation of Access Matrix, Access control, Revocation of Access Rights, Capability- Based systems, Language – Based Protection, Security- The Security problem, program threats, system and network threats cryptography as a security tool, user authentication, implementing security defenses, firewalling to protect systems and networks, computer – security classifications, case studies UNIX, Linux, Windows TEXT BOOKS : 1. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th Edition, John Wiley. 2. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd Edition, TMH REFERENCES : 1. Operating Systems’ – Internal and Design Principles Stallings, Fifth Edition–2005, Pearson education/PHI 2. Operating System A Design Approach-Crowley, TMH. 3. Modern Operating Systems, Andrew S Tanenbaum 2nd edition Pearson/PHI.

42

Page 43 of 93
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B.Tech. IT II-Sem T P C 4+1* 0 4 ENVIRONMENTAL STUDIES UNIT I : Multidisciplinary nature of Environmental Studies: Definition, Scope and Importance – Need for Public Awareness. UNIT II : Natural Resources : Renewable and non-renewable resources – Natural resources and associated problems – Forest resources – Use and over – exploitation, deforestation, case studies – Timber extraction – Mining, dams and other effects on forest and tribal people – Water resources – Use and over utilization of surface and ground water – Floods, drought, conflicts over water, dams – benefits and problems - Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources, case studies. - Food resources: World food problems, changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. – Energy resources: Growing energy needs, renewable and non-renewable energy sources use of alternate energy sources. Case studies. Land resources: Land as a resource, land degradation, man induced landslides, soil erosion and desertification. Role of an individual in conservation of natural resources. Equitable use of resources for sustainable lifestyles. UNIT III : Ecosystems : Concept of an ecosystem. - Structure and function of an ecosystem. - Producers, consumers and decomposers. - Energy flow in the ecosystem - Ecological succession. - Food chains, food webs 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, streams, lakes, rivers, oceans, estuaries) UNIT IV : Biodiversity and its conservation : Introduction - Definition: genetic, species and ecosystem diversity. - Biogeographical classification of India - Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values - . Biodiversity at global, National and local levels. - . India as a megadiversity nation - Hot-sports of biodiversity - Threats to biodiversity: habitat loss, poaching of wildlife, manwildlife conflicts. - Endangered and endemic species of India - Conservation of biodiversity: In-situ and Exsitu conservation of biodiversity. UNIT V : Environmental Pollution : Definition, Cause, effects and control measures of a. Air pollution b. Water pollution c. Soil pollution d. Marine pollution e. Noise pollution f. Thermal pollution g. Nuclear hazards Solid waste Management : Causes, effects and control measures of urban and industrial wastes. – Role of an individual in prevention of pollution. - Pollution case studies. - Disaster management: floods, earthquake, cyclone and landslides. UNIT VI : Social Issues and the Environment : From Unsustainable to Sustainable development -Urban problems related to energy -Water conservation, rain water harvesting, watershed management -Resettlement and rehabilitation of people; its problems and concerns. Case Studies -Environmental ethics: Issues and possible solutions. -Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Case Studies. -Wasteland reclamation. -Consumerism and waste products. -Environment Protection Act. -Air (Prevention and Control of Pollution) Act. -Water (Prevention and control of Pollution) Act -Wildlife Protection Act -Forest Conservation Act -Issues involved in enforcement of environmental legislation. -Public awareness.

43

-Human Rights. UNIT VIII : Field work : Visit to a local area to document environmental assets River /forest grassland/hill/mountain -Visit to a local polluted site . river. insects. -Case Studies. Oxford University Press. etc.Urban/Rural/industrial/ Agricultural Study of common plants.Page 44 of 93 UNIT VII : Human Population and the Environment : Population growth. birds. BS Publication. -Environment and human health. hill slopes. -HIV/AIDS. -Women and Child Welfare. -Value Education. -Role of information Technology in Environment and human health. variation among nations.Family Welfare Programme. Population explosion . Anji Reddy. Rajagopalan. REFERENCE: 1 Textbook of Environmental Sciences and Technology by M. 2 Environmental Studies by R. TEXT BOOK: 1 Textbook of Environmental Studies for Undergraduate Courses by Erach Bharucha for University Grants Commission. 44 . Study of simple ecosystems-pond.

test strategies for conventional software. A Generic view of process : Software engineering. New Age International Publishers 2. interface design steps. Software Engineering. Architectural styles and patterns. REFERENCES : 1. A practitioner’s Approach. Software Engineering principles and practice.Sommerville. IT II-Sem T 4+1* SOFTWARE ENGINEERING P 0 C 4 UNIT I : Introduction to Software Engineering : The evolving role of software.Tech. Peters. Requirements elicitation and analysis. structured methods. System requirements. Metrics for Analysis Model. Architectural Design. Software quality assurance. Software Engineering. Software myths. Software Reviews.Page 45 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. Agarwal & Yogesh Singh. Performing User interface design : Golden rules. Design evolution. The Capability Maturity Model Integration (CMMI). the design model. The McGraw-Hill Companies. interface analysis. Systems Analysis and Design. 7th edition. Pearson education. BlackBox and White-Box testing. Data models.Waman S Jawadekar. Witold Pedrycz. Risk identification. Metrics for maintenance. 2.K. The ISO 9000 quality standards. UNIT IV : Design Engineering : Design process and Design quality. Software Requirements : Functional and non-functional requirements. the art of Debugging. Metrics for testing. 3. Pressman. Proactive Risk strategies.James F. Statistical Software quality Assurance. Requirements management. Software Engineering. The Unified process. John Wiely. Metrics for software quality. Object models. Validation testing. Risk management : Reactive vs. User requirements. RMMM.Roger S. UNIT II : Process models : The waterfall model. Interface specification.McGrawHill International Edition. personal and team process models.Shely Cashman Rosenblatt. Design evaluation. UNIT III : Requirements engineering process : Feasibility studies. Software Engineering. the software requirements document. TEXT BOOKS : 1. Changing Nature of Software. An Object-Oriented design process. Process patterns. Creating an architectural design : Software architecture. Metrics for source code. 6th edition. System testing. process assessment. Evolutionary process models. UNIT VI : Testing Strategies : A strategic approach to software testing. Risk refinement. Formal technical reviews. System models : Context Models. Product metrics : Software Quality. a process framework. software risks. Requirements validation. Software reliability. an Engineering approach. Incremental process models.K.A layered technology. UNIT VII : Metrics for Process and Products : Software Measurement. 4. UNIT VIII : Quality Management : Quality concepts. Risk projection. 45 . User interface analysis and design. Design concepts. Metrics for Design Model. RMMM Plan. Behavioral models. UNIT V : Object-Oriented Design : Objects and object classes. Data design.Thomson Publications.

Week 5 : a) Write a Java program that: i) Implements stack ADT. b) Develop an applet that receives an integer in one text field. c and use the quadratic formula. and then displays each integer. Add a text field to display the result. % operations. Ex: MADAM is a Week 4 : a) Write a Java program that reads a file name from the user. -. Write a Java program that uses both recursive and non recursive functions to print the nth value in the Fibonacci sequence. Week 9 : 46 .Tech. Every subsequent value is the sum of the two values preceding it. IT II-Sem T 0 OBJECT ORIENTED PROGRAMMING LAB Objectives: • To make the student learn a object oriented way of solving problems. Recommended P 3 C 2 Week1 : a) Write a Java program that prints all real solutions to the quadratic equation ax2 + bx + c = 0. Week 2 : a) Write a Java program that prompts the user for an integer and then prints out all prime numbers up to that integer. when the button named “Compute” is clicked. Use a grid layout to arrange buttons for the digits and for the +. b. c) Write a Java program to make frequency count of words in a given text. with a line number before each line. Week 8 : a) Write a Java program for handling mouse events. b) The Fibonacci sequence is defined by the following rule: The fist two values in the sequence are 1 and 1. ii) Converts infix expression into Postfix form iii) Evaluates the postfix expression Week 6 : a) Develop an applet that displays a simple message. b) Write a Java program to multiply two given matrices. lines and words in a text file. and computes its factorial Value and returns it in another text field. Week 7 : Write a Java program that works as a simple calculator. c) Write a Java Program that reads a line of integers. If the discriminant b2 -4ac is negative. the type of file and the length of the file in bytes. b) Write a Java program that reads a file and displays the file on the screen. then displays information about whether the file exists.*. b) Write a Java program for sorting a given list of names in ascending order. and the sum of all the integers (Use StringTokenizer class of java. whether the file is writable. • To teach the student to write programs in Java to solve the problems Recommended Systems/Software Requirements: • • Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space JDK Kit. c) Write a Java program that displays the number of characters.util) Week 3 : a) Write a Java program that checks whether a given string is a palindrome or not. whether the file is readable.Page 46 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. palindrome. Read in a. display a message stating that there are no real solutions.

Num1 and Num2.J. b) Suppose that a table named Table. Each one of the classes contains only the method numberOfSides ( ) that shows the number of sides in the given geometrical figures.Page 47 of 93 a) Write a Java program that creates three threads. 2nd edition. Sixth Edition. The client sends data to a server.Dietel and P. Pearson Education 3. Big Java. Week 11 : Write a Java program that implements a simple client/server application. TEXT BOOKS : 1. Introduction to Java programming. b) Write a Java program that allows the user to draw lines. and then sends the result back to the client. The client displays the result on the console. For ex: The data sent from the client is the radius of a circle. If Num1 or Num2 were not an integer. The first line in the file is the header. the program would throw a NumberFormatException. the light is turned on. the second thread displays “Hello” every two seconds and the third thread displays “Welcome” every three seconds. The division of Num1 and Num2 is displayed in the Result field when the Divide button is clicked. Week 13 : a) Write a java program to create an abstract class named Shape that contains an empty method named numberOfSides ( ). and the remaining lines correspond to rows in the table. Java How to Program.net) Week 12 : a) Write a java program that simulates a traffic light. and the result produced by the server is the area of the circle. Sixth edition. When a radio button is selected. The program lets the user select one of three lights: red.M. b) Write a Java program that correctly implements producer consumer problem using the concept of inter thread communication.Dietel. Wiley Student Edition. Pearson Education/PHI 2. If Num2 were Zero. uses it to produce a result. Cay Horstmann. The user enters two numbers in the textfields. Triangle and Hexagon such that each one of the classes extends the class Shape. Wiley India Private Limited. 47 . (Use java. or green. H. the program would throw an ArithmeticException Display the exception in a message dialog box. The server receives the data. The elements are seperated by commas. yellow. and only one light can be on at a time No light is on when the program starts.Daniel Liang. First thread displays “Good Morning” every one second. Week 10 : Write a program that creates a user interface to perform integer divisions. Write a java program to display the table using JTable component. rectangles and ovals.txt is stored in a text file. Y.Provide three classes named Trapezoid.

BUILT –IN Exceptions. 3)SQL & PL/SQL for Oracle 10g. add_months. to_number and to_date). rtrim. numeric FOR LOOPS. to_date) i)Creation of simple PL/SQL program which includes declaration section. string functions (Concatenation. 11) Develop programs using features parameters in a CURSOR.Page 48 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA II Year B. 12) Develop Programs using BEFORE and AFTER Triggers. greatest. initcap. Row and Statement Triggers and INSTEAD OF Triggers TEXT BOOKS : 1)ORACLE PL/SQL by example. last_day. NOTEXISTS. Tata McGraw Hill. length. CASE and CASE expression. private objects. GROUP BY. RAISE. nested loops using ERROR Handling.P. FOR UPDATE CURSOR. 48 . ROLLBACK and SAVEPOINT in PL/SQL block. AVG. lower. MAX and MIN). package variables and cursors and calling stored packages.Tech. Example:. SUM.APPLICATION ERROR. invoke functions in SQL Statements and write complex functions. 8) Programs development using creation of procedures. trunc. date functions (Sysdate. Dr. altering and droping of tables and inserting rows into a table (use constraints while creating tables) examples using SELECT command. Queries (along with sub Queries) using ANY.S. Queries using Conversion functions (to_char. HAVING and Creation and dropping of Views. Deshpande. UNION. WHERE CURRENT of clause and CURSOR variables. next_day. USE defined Exceptions. IN. Black Book. Pearson Education 3rd Edition 2)ORACLE DATA BASE LOG PL/SQL Programming SCOTT URMAN.Select the roll number and name of the student who secured fourth rank in the class. executable section and exception –Handling section (Ex. IT II-Sem T 0 DATABASE MANAGEMENT SYSTEMS LAB Objectives: • To teach the student database design and query and PL/SQL. rpad. Recommended Systems/Software Requirements: • • 1) 2) 3) 4) Intel based desktop PC Mysql /Oracle latest version Recommended Creation. EXISTS. package bodies. passing parameters IN and OUT of PROCEDURES. Elena Silvestrova. INTERSET. Benjamin Rosenzweig. P 3 C 2 5) 6) Develop a program that includes the features NESTED IF. round. least. months_between. upper. ltrim. The program can be extended using the NULLIF and COALESCE functions. Queries using Aggregate functions (COUNT. Student marks can be selected from the table and printed for those who secured first class and an exception can be raised if no records were found) ii)Insert data into student table and use COMMIT. lpad. 7) Program development using WHILE LOOPS. 9) Program development using creation of stored functions. Constraints. 10) Program development using creation of package specification. substr and instr). to_char. ALL.

UNIT-VIII Code generation : Machine dependent code generation. equivalence of type expressions.Thomson. overloading of functions and operations. Compiler Construction. Ullman. parse trees. Using DAG representation of Block. Andrew W. object code forms. UNIT-VII Code optimization : Principal sources of optimization. Compilers Principles. Ravisethi. optimization of basic blocks. YACC programming specification. NFA to DFA. 2. UNIT-II Context Free grammars and parsing : Context free grammars. translation of simple statements and control flow statements. LALR parsing. Data flow analysis of flow graphs. derivation. language facilities for dynamics storage allocation. lex tools. 49 .Page 49 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B.2nd Edition. S-attributed and L-attributed grammars. UNIT-V Context Sensitive features – Chomsky hierarchy of languages and recognizers. 2. generic code generation algorithm. parsing ambiguous grammars. Register allocation and assignment. UNIT-VI Run time storage : Storage organization. Thomson. flow graphs. Modern Compiler Construction in C . Applications of Finite Automata to lexical analysis. Finite Automata – DFA. Definition Languages regular expressions. Techniques and Tools Aho. Intermediate code – abstract syntax tree.Sipser. TEXT BOOKS : 1. Pearson Education. NFA. LOUDEN.Tech. REFERENCES : 1. type conversions. IT I-Sem T P C 4+1* 0 4 AUTOMATA AND COMPILER DESIGN UNIT-I Formal Language and Regular Expressions : Languages.Appel Cambridge University Press. Type checking. Introduction to Theory of computation. parameters. ambiguity LL(K) grammars and LL(1) parsing UNIT-III Bottom up parsing handle pruning LR Grammar Parsing. UNIT-IV Semantics : Syntax directed translation. storage allocation strategies scope access to now local names. Conversion of regular expression to NFA. peephole optimization.

Personal Communications Satellite System. Frame Synchronization. Baud. Velocity of Propagation. Units of Powers Measurement. Global system for Mobile Communications. Electronic Telephones. Electromagnetic Radiation. T Carrier systems. Telephone Message. Crosstalk. Standard Telephone Set. OPTICAL FIBER TRANSMISSION MEDIA : Advantages of Optical Fiber Cables. Alternate Protocol Suites. N-AMPS. Digital Modulation. Transverse Electromagnetic Waves. Light sources. Delta Modulation PCM and Differential PCM. Light Detectors. T1 Digital Carrier System. Companding. Microwave Communications Systems. Cordless Telephones. Metallic Transmission Line Equivalent Circuit.Division Multiplexing. Serial and parallel Data Transmission. Optical Properties of Radio Waves. Bit Rate. Optical Fiber Modes and Classifications. Analog Modulation Systems. MULTIPLEXING AND T CARRIERS : Time. Unit VI : CELLULAR TELEPHONE SYSTEMS: First. Digital Cellular Telephone. Satellite Communications Systems. European Time. Wave Propagation on Metallic Transmission Lines. Disadvantages of Optical Fiber Cables.Generation Analog Cellular Telephone. North American Cellular and PCS Summary. Open Systems Interconnection. Caller ID. Wavelength. Pulse code Modulation. AND DEMODULATION : Signal Analysis.Division Multiplexing. Terrestrial Propagation of Electromagnetic Waves. Data communications Circuit Arrangements. Optical Fiber Comparison. Call Progress Tones and Signals. Unit V : TELEPHONE INSTRUMENTS AND SIGNALS: The Subscriber Loop. Frequency. Bits. and M-ary Encoding. Unit III : DIGITAL TRANSMISSION : Pulse Modulation. North American Digital Multiplexing Hierarchy.Page 50 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. THE TELEPHONE CIRCUIT: The Local Subscriber Loop. Digital Line Encoding. Interim Standard. Basic Telephone Call Procedures. Signal Voltage –to-Quantization Noise Voltage Ration. MODULATION. Linear Versus Nonlinear PCM Codes. Electrical Noise and Signal-to-Noise Ratio. Personal Communications system. Unit VII: 50 . Free-Space Path Loss. SIGNALS. Paging systems. Rays and Wavefronts. IT I-Sem T 4+1* DATA COMMUNICATION SYSTEMS P 0 C 4 Unit I : INTRODUCTION TO DATA COMMUNICATIONS AND NETWORKING: Standards Organizations for Data Communications. Characteristics of Electromagnetic Waves. Voice-Frequency Circuit Arrangements. Losses in Optical Fiber Cables. Unit II : METALLIC CABLE TRANSMISSION MEDIA : Metallic Transmission Lines.Division Multiplexing. Statistical Time – Division Multiplexing. Transmission Parameters and Private-Line Circuits.Division Multiplexing. Data Communications Circuits. Metallic Transmission Line Types.Tech. Metallic Transmission Line Losses. Transmission Line Classifications. Spherical Wavefront and the Inverse Square Law. The Physics of Light. Second-Generation Cellular Telephone Systems. Synchronous Optical Network Unit IV : WIRLESS COMMUNICATIONS SYSTEMS : Electromagnetic Polarization. Electromagnetic spectrum. NOISE. Optical Fiber Communications System Block Diagram. Optical Fiber construction. wave Attenuation and Absorption. Skip Distance. Lasers. Dynamic Range.Channel Noise and Noise Weighting. Information Capacity. Layered Network Architecture. Propagation of Light Through an Optical fiber Cable. PCM Line Speed. Data communications Networks.

Fifth Edition.Band Modem Classifications.TMH. Behrouz A Forouzan. Modem Synchronization. Asynchronous Voice-Band Modems. Fred Halsll. Lingana Gouda Kulkarni. 2.Page 51 of 93 DATA COMMUNICATIONS CODES. Asynchronous Data – Link Protocols. Voice. Modem Control: The AT Command Set. Unit VIII: DATA –LINK PROTOCOLS: Data –Link Protocol Functions.Band Modern Block Diagram. DATA COMMUNICATIONS EQUIPMENT: Digital Service Unit and Channel Service Unit.Band Modems.Oriented Protocols. Cable Modems. 56K Modems. Synchronous Data – Link Protocols. Character Synchronization. Synchronous Voice-Band Modems. Voice. Character –and Bit. Error Control. Reference Books 1.Band Modem Specifications. Pearson Education 51 . Bar Codes. Second Edition Thomson 3. Computer Networking and Internet. High – Level Data – Link Control. Error Detection. ERROR CONTROL. Wayne Tomasi. Data Transmission Modes. Gallow. Probability of Error and Bit Error Rate. Data Communications and Networking. Synchronous Data – Link Control. Error Correction. Computer Communications and Networking Technologies. Voice.Band Data Communication Modems. Pearson Education. AND DATA FORMATS: Data Communications Character Codes. ITU-T Voice. TEXT BOOKS: 1. Bell SystemsCompatible Voice. Introduction to Data Communications and Networking. Fourth Edition.

3. Interfacing with 8237/8257. 2nd Ed. UNIT-VI Serial data transfer schemes. 8279 Stepper Motor and actuators. UNIT-VIII 8051 Microcontroller Architecture. REFERENCES : 1. evaluation of arithmetic expressions. Assembler directives.. DMA data transfer Method.A. sorting. 8251 USART architecture and interfacing. UNIT-VII Advanced Micro Processors . Overview of RISC Processors. Micro Computer System 8086/8088 Family Architecture. 2007. 4th Edition. Introduction to High-speed serial communications standards. Advanced microprocessor and Peripherals . procedures. UNIT-IV 8255 PPI – various modes of operation and interfacing to 8086. Memory and I/O interfacing of 8051. Asynchronous and Synchronous data transfer schemes.M. Real and Protected Mode Segmentation & Paging. 2. 2003. UNIT-V Interrupt structure of 8086. UNIT-II Assembly language programs involving logical. Addressing modes of 8086. Special functions of General purpose registers.Introduction to 80286. Need for DMA. Micro Processors & Interfacing – Douglas U. TEXT BOOKS : 1. 52 .Page 52 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. Micro Controllers – Deshmukh. Instruction set of 8086. Sample program of serial data transfer. Programming and Design . Interrupt structure of 8051. PHI. simple programs.By Liu and GA Gibson. D/A and A/D converter interfacing.Bhurchandi. Tata McGraw Hill Edition. Hall. Modes of timer operation. IT I-Sem T P C 4+1* 0 4 MICROPROCESSORS AND INTERFACING UNIT-I An over view of 8085. Serial port operation. Salient Features of 80386. UNIT-III Pin diagram of 8086-Minimum mode and maximum mode of operation.Tech. Salient Features of Pentium. Vector interrupt table. Register set of 8051. 8259 PIC Architecture and interfacing cascading of interrupt controller and its importance.K. TMH. USB. Memory interfacing to 8086 (Static RAM & EPROM). 2000. TTL to RS 232C and RS232C to TTL conversion. Interfacing Keyboard. Interrupt service routines. 2. The 8088 and 8086 Micro Processors – PHI. Introduction to DOS and BIOS interrupts. Timing diagram. string manipulation. 8086 flag register and function of 8086 Flags. Branch & Call instructions. Architecture of 8086 Microprocessor. Displays. and macros. Branch Prediction.Ray and K.

Tata Mc Graw hill. 6. computer animation languages. scaling. polygon rendering methods.Filled area primitives: Scan line polygon fill algorithm. UNIT II : Output primitives : Points and lines.Pauline Baker. depth-buffer.nos.147-150. Bezier and B-Spline surfaces. Cohen-Sutherland and Cyrus-beck line clipping algorithms. video-display devices. second edition in C. p. “Computer Graphics Second edition”. Springer. 347-364. 516-531. Pearson Education.Graw hill edition. UNIT VIII : Computer animation : Design of animation sequence. Donald Hearn and M. 3.nos 237-249. raster-scan systems. Zhigand xiang. p. UNIT III : 2-D geometrical transforms : Translation. 111-126 of text book-2). 542-546 of text book-1. (p. UNIT IV : 2-D viewing : The viewing pipeline. 2. 4. mid-point circle and ellipse algorithms. matrix representations and homogeneous coordinates. REFERENCES : 1. rotation. Feiner and Hughes. 72-99 of text book-2). Pearson Education. UNIT VI : 3-D Geometric transformations : Translation. (p. view volume and general projection transforms and clipping (p. scan-line. viewing coordinate reference frame. IT I-Sem T P C 4+1* 0 4 COMPUTER GRAPHICS UNIT I : Introduction. “Computer Graphics C version”. 452-481 of text book -1). “Computer Graphics”.164-171 of text book-1. Shalini Govil.nos 427-443. Schaum’s outlines. Sutherland – Hodgeman polygon clipping algorithm(p. motion specifications.nos 22-90 of text book-1). Tata Mc. Neuman and Sproul. graphics monitors and work stations and input devices (p. PHI/Pearson Education. TMH 53 . window to view-port coordinate transformation. key frame systems. Principles of Computer Graphics. overview of graphics systems. 3-D viewing : Viewing pipeline. quadric surfaces.340-342. Steven Harrington. Bezier curve and B-Spline curves.nos 324-331. 2005. scaling. UNIT VII : Visible surface detection methods : Classification. Donald Hearn and M. second Edition.nos.nos 604-616 of text book -1. “Computer Graphics Principles & practice”.nos 489-505 of text book -1. Pai. Computer Graphics. depth sorting.137145.nos 103-123. boundary-fill and flood-fill algorithms (p. ( p. Roy Plastock.257-261 of text book -1. p. Basic illumination models. line drawing algorithms.Page 53 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. TMH. VanDam.nos 204-227 of text book-1). composite transformations. back-face detection. reflection and shear transformations. rotation.Tech. random scan systems. UNIT V : 3-D object representation : Polygon surfaces. TEXT BOOKS : 1. David F Rogers. general computer animation functions. reflection and shear transformations. Application areas of Computer Graphics.nos 473-529. area sub-division and octree methods(p.721-739 of text book-2). composite transforms. Chapter 15 of of text book-2). BSP-tree methods. viewing coordinates. Hermite curve. viewing functions. transformations between coordinate systems. 2. raster animation.Pauline Baker. Procedural elements for Computer Graphics. 2nd edition. spline representation. “Principles of Interactive Computer Graphics”. chapter 21 of text book-2). 5. Foley.

Nonblocking Commitment Protocols.V Concurrency Control. Join Queries. Principles of Distributed Database Systems. Authorization and Protection UNIT .VIII Database Integration. Distributed Object Storage. Scheme Translation. IT I-Sem T P C 4+1* 0 4 DISTRIBUTED DATABASES UNIT . Integrity Constraints in Distributed Databases. Object Query Processing. UNIT – III Optimization of Access Strategies.VII Architectural Issues. Object Orientation And Interoperability Object Management Architecture CORBA and Database Interoperability Distributed Component Model COM/OLE and Database Interoperability. Query Optimization Issues. Cache Consistency Object Management. M. Transforming Global Queries into Fragment Queries. Determining a Consistent View of the Network. Multidatabase Recovery. Alternative Client/Server Architectures. 54 . Reference Architecture for Distributed Databases . Foundation of Distributed Concurrency Control. UNIT – II Translation of Global Queries to Fragment Queries. Equivalence Transformations for Queries. Architectural Aspects of Distributed Transactions. Basic Concepts. Distributed Grouping and Aggregate Function Evaluation. Concurrency Control for Distributed Transactions. Checkpoints and Cold Restart. Concurrency Control based on Timestamps.Tamer Ozsu. Optimistic Methods for Distributed Concurrency Control. Object Query Processor Architectures.Tech. Query Processing Issues. Giuseppe Pelagatti McGraw-Hill REFERENCES: 1. Catalog Management in Distributed Databases. Distributed Deadlocks. UNIT . Parametric Queries. Scheme Integration. Transaction Management in Object DBMSs . Types of Data Fragmentation. PUSH-Based Technologies TEXT BOOKS : 1. Transaction Management Transaction and Computation Model Multidatabase Concurrency Control. UNIT – VI Reliability. Patrick Valduriez – Pearson Education.Page 54 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. Query Execution . Query Processing Query Processing Layers in Distributed Multi-DBMSs. Reliability and concurrency Control. Distributed Database Principles & Systems. Stefano Ceri. Levels Of Distribution Transparency. Pointer Swizzling. Distributed Database Administration. UNIT . Transaction Management. Supporting Atomicity of Distributed Transactions. Object Migration. Detection and Resolution of Inconsistency. UNIT – IV The Management of Distributed Transactions.I Features of Distributed versus Centralized Databases. General Queries. A Framework for Transaction Management . A Framework for Query Optimization. Transactions as Objects. Object Identifier Management. Principles Of Distributed Databases .

path predicates and achievable paths. 5. Testability tips. UNIT . path instrumentation. State Graphs and Transition testing : State graphs. domains and testability. 2. path expressions. The craft of software testing . application of dataflow testing. transaction flow testing techniques.II Flow graphs and Path testing : Basics concepts of path testing. Usage of JMeter and Winrunner tools for functional / Regression testing. Software Testing Tools – Dr. UNIT . Dreamtech. taxonomy of bugs UNIT . 55 .IV Domain Testing:-domains and paths. Nice & ugly domains.V Paths. domain and interface testing. Pearson Education. Pearson. reduction procedure.VI Logic Based Testing : Overview. regular expressions & flow anomaly detection. Path products and Regular expressions : Path products & path expression. good & bad state graphs. strategies in dataflow testing. Performance testing of a data base application and HTTP connection for website access. specifications. Perry. UNIT VIII : Graph Matrices and Application : Motivational overview.K. 2. 4.Brian Marick. TEXT BOOKS : 1. creation of test script for unattended testing.K.V. path sensitizing. node reduction algorithm.Baris Beizer. John Wiley.Tech. UNIT . matrix of graph. Dichotomies. Art of Software Testing – Meyers. predicates. Software Testing techniques . Software Testing Techniques – SPD(Oreille) 3. domains and interfaces testing. building tools. power of a matrix. REFERENCES : 1. domain testing. applications. application of path testing. Effective methods of Software Testing. Dataflow testing:. relations. Rapid testing. UNIT . UNIT . synchronization of test case.Prasad. Software Testing in the Real World – Edward Kit.K. model for testing. consequences of bugs. Dreamtech.I Introduction : Purpose of testing. kv charts. state testing. IT I-Sem T P C 4+1* 0 4 SOFTWARE TESTING METHODOLOGIES UNIT .III Transaction Flow Testing : Transaction flows.VII State.Page 55 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B.Basics of dataflow testing. John Wiley. decision tables. second edition.

Page 56 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. • Write project/research reports/technical reports. Introduction The introduction of the English Language Lab is considered essential at 3 rd year level.. analysis. At this stage the students need to prepare themselves for their careers which may require them to listen to. skimming. • Face interviews. • Make oral presentations. critical reading.  Interview Skills – concept and process. subject matter – organization.  Resume’ writing – structure and presentation. answering strategies. body language. • Participate in group discussions. ii) The Communication Skills Lab with movable chairs and audio-visual aids with a P. defining the career objective. System Requirement ( Hardware component): Computer network with Lan with minimum 60 multimedia systems with the following specifications: iii) P – IV Processor a) Speed – 2. study of word origin. opening strategies. scanning. planning. relevance. read. 2.A System. 3. a T. planning. pre-interview planning. one master console. speak and write in English both for their professional and interpersonal communication in the globalised context. to organise ideas relevantly and coherently. • Engage in debates.study by learners. letter-writing. V. LAN facility and English language software for self. guessing meanings from context. they would be required to communicate their ideas relevantly and coherently in writing. 4. through a well-developed vocabulary and enable them to listen to English spoken at normal conversational speed by educated English speakers and respond appropriately in different socio-cultural and professional contexts.8 GHZ b) RAM – 512 MB Minimum c) Hard Disk – 80 GB iv) Headphones of High quality  56 . analogy.Tech. • Further. formats and styles. The proposed course should be an integrated theory and lab course to enable students to use ‘good’ English and perform the following: • Gather ideas and information. Syllabus: The following course content is prescribed for the Advanced Communication Skills Lab: Functional English . data-collection. summary. modulation of voice.  Reading comprehension – reading for facts. tools. IT I-Sem T 0 ADVANCED ENGLISH COMMUNICATION SKILLS LAB P 3 C 2 1. projecting ones strengths and skill-sets. one-word substitutes. fluency and coherence.  Group Discussion – dynamics of group discussion . coherence and style.  Technical Report writing – Types of formats and styles.starting a conversation – responding appropriately and relevantly – using the right body language – role play in different situations. idioms and phrases. word roots. inferring meaning. summarizing. interview through tele and video-conferencing. a digital stereo –audio & video system and camcorder etc. clarity. Minimum Requirement: The English Language Lab shall have two parts: i) The Computer aided Language Lab for 60 students with 60 systems. Objectives: This Lab focuses on using computer-aided multimedia instruction for language development to meet the following targets: • To improve the students’ fluency in English.  Vocabulary building – synonyms and antonyms. • To take part in social and professional communication. • Transfer information from non-verbal to verbal texts and vice versa. prefixes and suffixes. • Write formal letters. intervention.

Suggested Software: The software consisting of the prescribed topics elaborated above should be procured and used.Your Success Mantra by Dr. Prentice-Hall of India. Cambridge • • • • 6. 2007. 2005. For the English Language lab sessions. Prentice-Hall of India. 15. Lingua TOEFL CBT Insider. 14. DISTRIBUTION AND WEIGHTAGE OF MARKS: Advanced Communication Skills Lab Practicals: 1. 2004. London & New York. 6. 7. Oxford University Press. 9. Tata Mc.. Herbert Puchta and Jeff Stranks with Meredith Levy. 2nd edition. M. 10.com’  Preparing for being Interviewed. IELTS series with CDs by Cambridge University Press. Communication Skills by Leena Sen. by Dreamtech TOEFL & GRE( KAPLAN.Page 57 of 93 5.  Interviewing Skills. Pearson Education. Shalini Verma. AARCO & BARRONS. DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice. Graw-Hill Publishing Company Ltd. Rontledge Falmer. 2. Biztantra Publishers. 57 . 3. 2005. 15 marks shall be awarded for day-to-day work and 10 marks to be awarded by conducting Internal Lab Test(s). Cambridge Preparation for the TOEFL Test by Jolene Gear & Robert Gear. 13. Technical Communication by Meenakshi Raman & Sangeeta Sharma. Pauley.  Telephone Skills. Rutherford. Anuradha Publications.  Time Management  Team Building. Communication Skills for Engineers by Sunita Mishra & C. Pearson Education. Chennai Body Language. New Age International (P) Ltd. 5. USA. Suggested Software: • • • Clarity Pronunciation Power – part II Oxford Advanced Learner’s Compass. Cracking GRE by CLIFFS) The following software from ‘train2success. 11. The End Examination shall be conducted by the teacher concerned with the help of another member of the staff of the same department of the same institution. Books Recommended: 1. Effective Technical Communication. 2nd Edition. 2007. Publishers. 7th Edition DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice. 4. Communication Skills for Technology by Andra J. 2007. Ashraf Rizvi. S. New Delhi. Pearson Education. Objective English by Edgar Thorpe & Showick Thorpe. Riordan & Steven E.A Practical guide for students by Stephen Bailey.  Positive Thinking. Of the 25 marks. 2006. The practical examinations for the English Language Laboratory practice shall be conducted as per the University norms prescribed for the core engineering practical sessions.  Decision making English in Mind. Academic Writing. Dr G Natanam & Prof SA Sankaranarayanan. Technical Report Writing Today by Daniel G. Books on TOEFL/GRE/GMAT/CAT by Barron’s/cup 8. 2007. 4th Edition. Chand. English Language Communication : A Reader cum Lab Manual Dr A Ramakrishna Rao. Muralikrishna. there shall be a continuous evaluation during the year for 25 sessional marks and 50 End Examination marks. A Course in English communication by Madhavi Apte. Basic 12. 2.

2. 4. 2. 3. Arithmetic operation – Multi byte Addition and Subtraction. and Equipment required for Laboratories: 1. 6. Logic operations – Shift and rotate – Converting packed BCD to unpacked BCD. Length of the string. Introduction to MASM/TASM. 5. Sorting. 2. IT I-Sem T P C 0 3 2 MICROPROCESSORS AND INTERFACING LAB I. Strings. ASCII – arithmetic operation. By using string operation and Instruction prefix: Move Block. 4. 3. 8086 µP Kits 2. 8255 – PPI : Write ALP to generate sinusoidal wave using PPI. 3. Reverse string. Inserting.Tech. 8259 – Interrupt Controller : Generate an interrupt using 8259 timer. II. III. Microprocessor 8086 : 1. ADC Interface DAC Interface Traffic Controller Interface Elevator Interface 58 . Microcontroller 8051 1. Timer in different modes. Serial communication implementation. BCD to ASCII conversion. 5. Multiplication and Division – Signed and unsigned Arithmetic operation. Deleting. 8051 Micro Controller kits 3. 7. 8279 – Keyboard Display : Write a small program to display a string of characters. Interfaces/peripheral subsystems i) 8259 PIC ii) 8279-KB/Display iii) 8255 PPI iv) 8251 USART 4. Reading and Writing on a parallel port. 8251 – USART : Write a program in ALP to establish Communication between two processors. DOS/BIOS programming: Reading keyboard (Buffered with and without echo) – Display characters. String comparison. Interfacing : 1.Page 58 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B.

Introduction to Servelets: Lifecycle of a Serverlet. WILEY Dreamtech (UNIT s 1. The complete Reference Java 2 Fifth Edition by Patrick Naughton and Herbert Schildt. And also XML and web servers and database interfacing. The Anatomy of a JSP Page.Accessing a Database from a JSP Page. Java Server Pages –Hans Bergsten. Cascading Style sheets. Conditional Processing – Displaying Values Using an Expression to Set an Attribute.. forms.Page 59 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. Processors: DOM and SAX UNIT-IV: Java Beans: Introduction to Java Beans. Advantages of Java Beans. Frames. Reading Initialization parameters. Bean Info Interface. Using Scripting Elements Implicit JSP Objects. Requests. JSPs. Customizes. Using Cookies-Session Tracking. Introduction to EJB’s UNIT-V: Web Servers and Servlets: Tomcat web server. UNIT-I: HTML Common tags.6.servelet Package. UNIT-VI: Introduction to JSP: The Problem with Servelet. The javax.sql.Tech. Studying Javax. building internet applications. Application – Specific Database Actions. UNIT-II: Introduction to Java Scripts. Java Beans API. Declaring Variables and Methods Error Handling and Debugging Sharing Data Between JSP pages. Security Issues. JSP Application Design with MVC Setting Up and JSP Environment: Installing the Java Software Development Kit. Tomcat Server & Testing Tomcat UNIT-VII: JSP Application Development: Generating Dynamic Content. Dynamic HTML with Java Script UNIT-III: XML: Document type definition.servelet HTTP package. Chris Bates 2nd edition. JSDK. Using Bound properties. IT II-Sem T 4+1* WEB TECHNOLOGIES Objectives: P 0 C 4 This course demonstrate an in-depth understanding of the tools and Web technologies necessary for business application design and development.2 .7.* package. The course covers client side scripting like HTML. The Servelet API. JSP Processing. JavaScript and server side scripting like servlets. Constrained properties Persistence. Web Programming.8) Presenting XML. SPD O’Reilly (UNITs 5. BDK Introspection. images. Introduction to struts framework. Tables. TMH (Chapters: 25) (UNIT 4) 3. and Users Passing Control and Date between Pages – Sharing Session and Application Data – Memory Usage Considerations UNIT VIII: Database Access : Database Programming using JDBC. Reading Servelet parameters. The javax. TEXT BOOKS: 1. Handling Http Request & Responses.3) 2. Using XML 59 . Objects in Java Script. XML Schemas.Deploying JAVA Beans in a JSP Page.List. Document Object model.

Jakarta Struts Cookbook . Beginning Web Programming-Jon Duckett WROX. 4. Pekowsky. 60 . Web Applications Technologies Concepts-Knuckles. Web Warrior Guide to Web Programmming-Bai/Ekedaw-Thomas 10.Pearson Core SERVLETS ANDJAVASERVER PAGES VOLUME 1: CORE TECHNOLOGIES By Marty Hall and Larry Brown Pearson 3.Page 60 of 93 REFERENCE BOOKS: Programming world wide web-Sebesta. An Introduction to web Design and Programming –Wang-Thomson 7. 2. Murach. 11. SPD 6. Internet and World Wide Web – How to program by Dietel and Nieto PHI/Pearson Education Asia. Programming world wide web-Sebesta. S P D O’Reilly for chap 8. Bill Siggelkow. Java Server Pages.John Wiley 8.Pearson 9. Pearson. 1. 5. Murach’s beginning JAVA JDK 5.

error detection and correction. distance vector routing.3rd Edition.A. Control Algorithms – General Principles – of Congestion prevension policies. Flooding. CRC. broad band ISDN and ATM. ATM. twisted pair wireless. UNIT –VIII Application Layer – Network Security. UNIT –VI Dynamic routing – Broadcast routing. UNIT-V Network Layer : Virtual circuit and Datagram subnets-Routing algorithm shortest path routing. IEEE 802. IT II-Sem T P C 4+1* 0 4 COMPUTER NETWORKS UNIT –I Introduction : OSI. Congestion. Narrow band.Keshav. Internet working: The Network layer in the internet and in the ATM Networks. ATM AAL Layer Protocol. TEXT BOOKS : 1. MAN. the World WEB. switching and encoding asynchronous communications. Multi Media. LAN. Pearson Education/PHI 2. Computer Networks — Andrew S Tanenbaum. W.Page 61 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B.Third Edition TMH. UNIT-IV Medium Access sub layer : A LOHA. REFERENCES: 1. TCP and UDP protocols.Understanding communications and Networks.Tech. SNMP. Broad cast. An Engineering Approach to Computer Networks-S. Thomson 61 . Connection management. Slip. framing.4th Edition. Multi cast. Elementary Protocol-stop and wait. UNIT –VII Transport Layer : Transport Services. Hierarchical routing. Forouzan. Examples of Networks: Novell Networks .2nd Edition. Network Topologies WAN. UNIT-III Data link layer : Design issues. TCP/IP and other networks models. wireless LANS.Shay. Bridges. Electronic Mail. UNIT-II Physical Layer : Transmission media copper. Internet. Sliding Window. Rotary for mobility. Carrier sense multiple access. Domain name system. Data Communications and Networking – Behrouz A.X Standard Ethernet. Internet. Data link layer in HDLC. MAC addresses.Arpanet. Pearson Education 2.

Tech. H. David King.Digital Token-Based. corporate Data Warehouses.II Consumer Oriented Electronic commerce .I Electronic Commerce-Frame work.III Electronic payment systems .VII Consumer Search and Resource Discovery . E-Commerce Consumer applications. 4.Taudon. Digital Video and electronic Commerce. S. 5. on-line marketing process. anatomy of E-Commerce applications. Risks in Electronic Payment systems. Electronic Commerce – Gary P.Mercantile Process models. 62 . UNIT . E-Commerce. Efrain Turbon. UNIT . UNIT-IV Inter Organizational Commerce .work Flow.Information search and Retrieval. UNIT .Schneider – Thomson. UNIT . market research. Ellizabeth Chang.key multimedia concepts. Frontiers of electronic commerce – Kalakata.Document Library. EDI Implementation.Jaiswal – Galgotia. Technology. TEXT BOOK : 1.Michael Chang. Value added networks. E-Commerce organization applications. Smart Cards. UNIT . Tharam Dillon. IT II-Sem T P C 4+1* 0 4 E – COMMERCE UNIT . Advertising on Internet. Desktop video processings. 2. Whinston. REFERENCES : 1. Carol Guyerico Traver.VI Corporate Digital Library . E-Commerce – Business. Credit Cards. UNIT . Information Filtering. Society. digital Document types. Kenneth C. Jae Lee. Automation Customization and internal Commerce. Pearson.VIII Multimedia .Information based marketing.Page 62 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. Raymond Lee. Supply chain Management. Advertising and Marketing .EDI.V Intra Organizational Commerce . Desktop video conferencing. John Wiley. E-Commerce. 3. E-Commerce fundamentals and applications Hendry Chan. Commerce Catalogues.

NET Pearson Education 8.NET. dynamic. M.NET Platform. ORBlets with Applets. properties. Distributed Computing. Principles and applications. The EJB client/server development Process The EJB container protocol. C# Preciesely Peter Sestoft and Henrik I. Client/Server CORBA-style. Dynamic CORBA-The portable count. and Attribute-Based Programming. UNIT IV Building c# applications: Type Reflection. 4. TEXT BOOKS : 1. support for transaction EJB packaging EJB design Guidelines. India Pvt Ltd 63 . 6. TMH.NET Assemblies. Java programming with CORBA 3rd Edition.L. C# How to program. C# and the . Callback Interfaces. Session and Entity Beans. CORBA Beans. Jesse Liberty. Understanding . Pearson Education 2. Benefits of client server computing. UNIT-VIII EJBs and CORBA: Object transaction monitors CORBA OTM’s. TMh.NET Remoting Layer. IBM Webspere Starter Kit Ron Ben Natan Ori Sasson.SPD 2nd Edition 2. UNIT-II CORBA with Java: Review of Java concept like RMI. Client/Server Survival Guide 3rd edition Robert Orfali Dan Harkey & Jeri Edwards. Delegates. The introspective CORBA/Java object. and Events. CORBAIDL mapping CORBA java. Hansen.Page 63 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. Intoduction to C# Using . client server models. India John wiley and sons REFERENCES : 1. UNIT-VII Java Bean Component Model : Events.Brose. Client/Server Computing D T Dewire. first CORBA program. EJB container frame work. Client/Server programming with Java and CORBA Robert Orfali and Dan Harkey. the dynamic count multi count.to. IT II-Sem T P C 4+1* 0 4 MIDDLEWARE TECHNOLOGIES UNIT-I Introduction to client server computing: Evolution of corporate computing models from centralized to distributed computing. John Wiley & Sons . Data Access with ADO.Tech.NET Platform Andrew Troelsen. pitfalls of client server programming. Object Serialization and the . The static CORBA. Prentice Hall of India 7. The object web: CORBA with Java. EJB and CORBA OTM’s. A Vogel and K.Liu. Programming C#. persistency. New Delhi 5. SPD-O’Reilly. CORBa activation services. XML Web Services. Wiley-dreamtech. UNIT III Introducing C# and the . Pearson Education 9. G. UNIT-VI Existential CORBA : CORBA initialization protocol. Intrespection of beans. Late Binding. Apress Wiley-dreamtech.IDL mapping. JDBC. UNIT-V Core CORBA / Java: Two types of Client/ Server invocations-static. Object –Oriented Programming with C#.Duddy. RMI API. John Wiley & Sons 3.

UNIT .JIAWEI HAN & MICHELINE KAMBER Harcourt India. REFERENCES : 1. UNIT . Density-Based Methods. PEARSON EDUCATION 2. Major issues in Data Mining. Classifier Accuracy. Data Mining Functionalities.VII Cluster Analysis Introduction : Types of Data in Cluster Analysis. Data Mining Query Languages. Classification Based on Concepts from Association Rule Mining.Tech. Classification of Data Mining systems. TEXT BOOKS : 1. Data Warehouse Architecture.VIII Mining Complex Types of Data : Multimensional Analysis and Descriptive Mining of Complex. Data Preprocessing : Needs Preprocessing the Data. 64 . Data Mining Introductory and advanced topics –MARGARET H DUNHAM. Mining the World Wide Web. 3. Multidimensional Data Model. Data Warehousing in the Real World – SAM ANAHORY & DENNIS MURRAY. Partitioning Methods. IT II-Sem T 4+1* DATA WAREHOUSING AND DATA MINING P 0 C 4 UNIT . Data Cleaning.Further Development of Data Cube Technology. Mining Descriptive Statistical Measures in Large Databases.IV Concepts Description : Characterization and Comparison : Data Generalization and SummarizationBased Characterization. Data Mining – Concepts and Techniques .V Mining Association Rules in Large Databases : Association Rule Mining. Outlier Analysis. Mining Spatial Databases. Data Integration and Transformation. Mining Multidimensional Association Rules from Relational Databases and Data Warehouses. Prediction. Bayesian Classification. Discretization and Concept Hierarchy Generation. Data Mining Techniques – ARUN K PUJARI.I Introduction : Fundamentals of data mining. Languages.III Data Mining Primitives. Classification by Backpropagation. A Categorization of Major Clustering Methods. Grid-Based Methods. Classification by Decision Tree Induction. UNIT . Pearson Edn Asia. UNIT . Other Classification Methods.Page 64 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. Constraint-Based Association Mining. Mining Multimedia Databases. Data Reduction. Analytical Characterization: Analysis of Attribute Relevance. Data Warehouse Implementation. Designing Graphical User Interfaces Based on a Data Mining Query Language Architectures of Data Mining Systems. and System Architectures : Data Mining Primitives. UNIT – II Data Warehouse and OLAP Technology for Data Mining Data Warehouse. 4 Data Warehousing Fundamentals – PAULRAJ PONNAIAH WILEY STUDENT EDITION. UNIT . Mining Class Comparisons: Discriminating between Different Classes. Mining Single-Dimensional Boolean Association Rules from Transactional Databases.VI Classification and Prediction : Issues Regarding Classification and Prediction. University Press. Mining Text Databases. From Data Warehousing to Data Mining. Mining Multilevel Association Rules from Transaction Databases. Data Objects. The Data Warehouse Life cycle Tool kit – RALPH KIMBALL WILEY STUDENT EDITION. Model-Based Clustering Methods. UNIT . Mining Time-Series and Sequence Data. From Association Mining to Correlation Analysis. 5.

Deployment. Types and Roles. UNIT . Grady Booch. 4. Pearson Education. Interfaces. The McGraw-Hill Companies. UNIT . IT II-Sem T P C 4+1* 0 4 OBJECT ORIENTED ANALYSIS AND DESIGN UNIT . time and space. Ltd. conceptual model of the UML. WILEY-Dreamtech India Pvt. REFERENCES: 1. Pearson Education. Hans-Erik Eriksson. state machines.IV Basic Behavioral Modeling-I: Interactions. UNIT . Atul Kahate: Object Oriented Analysis & Design. Pearson Education. UNIT . Magnus Penker. Craig Larman Appling UML and Patterns: An introduction to Object – Oriented Analysis and Design and Unified Process. Brian Lyons. Interaction diagrams. Software Development Life Cycle.II Basic Structural Modeling: Classes. 65 .III Class & Object Diagrams: Terms. Ivar Jacobson : The Unified Modeling Language User Guide. Mark Priestley: Practical Object-Oriented Design with UML. principles of modeling.VII Architectural Modeling: Component.Page 65 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. 2. Component diagrams and Deployment diagrams. Use case Diagrams.I Introduction to UML: Importance of modeling. state chart diagrams. processes and Threads. James Rumbaugh. modeling techniques for Class & Object Diagrams. 2. concepts. common Mechanisms. David Fado: UML 2 Toolkit.TATA McGrawHill 5. Architecture. Pascal Roques: Modeling Software Systems Using UML2. Activity Diagrams. UNIT-V Basic Behavioral Modeling-II: Use cases. advanced relationships. Ltd.Tech. Packages.VI Advanced Behavioral Modeling: Events and signals. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML.VIII Case Study: The Unified Library application TEXT BOOKS: 1. Advanced Structural Modeling: Advanced classes. UNIT . UNIT . and diagrams. 3. WILEY-Dreamtech India Pvt. Relationships. object oriented modeling.

character stuffing and bit stuffing.B 1. Note : The analysis. Some of the ideas regarding case studies are given in reference books which were mentioned in theory syllabus can be referred for some idea. documentation. The student should take up the case study of Unified Library application which is mentioned in the theory.Tech. 3.e Use case view. Database design. and Generation of documentation of the project. forward and Reverse Engineering. Using RSA algorithm Encrypt a text data and Decrypt the same . Obtain broadcast tree for it. CRC 16 and CRC CCIP . and Model it in different views i. Now obtain Routing table art each node using distance vector routing algorithm 5. 2. 7. Take a 64 bit playing text and encrypt the same using DES algorithm .A 1. 2. logical view. Part . 6. Deployment view. 4. otherwise the mini project will not be evaluated.Page 66 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. database design of mini project which will be carried out in 4th year should be done in object-oriented approach using UML and by using appropriate software which supports UML. IT II-Sem T P C 0 3 2 COMPUTER NETRWORKS AND CASE TOOLS LAB Objective: • To Understand the functionalities of various layers of OSI model • To inculcate object oriented software design System/ Software Requirement • Intel based desktop PCs LAN CONNECTED with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space • Tools Such as Rational Rose Part . design. Take an example subnet graph with weights indicating delay between nodes. Take an example subnet of hosts . coding. Student has to take up another case study of his/her own interest and do the same what ever mentioned in first problem. Implement on a data set of characters the three CRC polynomials – CRC 12. Implement the data link layer framing methods such as character. component view. Implement Dijkstra ‘s algorithm to compute the Shortest path thru a graph. 66 . Write a program to break the above DES coding 8.

g. 5. BDK(Bean development kit) must be also be installed Week-1: Design the following static web pages required for an online book store web site.1 2) LOGIN PAGE: This page looks like below: 67 . JVM(Java virtual machine) must be installed on your system 7.Altova. IT II-Sem T P C 0 3 2 WEB TECHNOLOGIES LAB Objective : To create a fully functional website with mvc architecture.: When you click the link “CSE” the catalogue for CSE Books should be displayed in the Right frame. etc. A database either Mysql or Oracle 6. A web browser either IE or firefox 3.com/XMLSpy – free ] . Stylusstudio . Web Site Name Logo Home CSE ECE EEE CIVIL Login Registration Catalogue Cart Description of the Web Site Fig 1. Left frame : At least four links for navigation.. A working computer system with either Windows or Linux 2. 1) HOME PAGE: The static home page must contain three frames. To Develop an online Book store using we can sell books (Ex amazon . XML editor like Altova Xml-spy [www. For e. which will display the catalogue of respective links. Hardware and Software required : 1. Registration page. Login page. Initially this page contains description of the web site. Catalogue page and Cart page (the description of these pages will be given below). Right frame: The pages to the links in the left frame must be loaded here.Page 67 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA III Year B. Tomcat web server and Apache web server 4. Top frame : Logo and the college name and links to Home page.Tech.com).

Russel Publication : Princeton hall Book : Java 2 Author : Watson Publication : BPB publications Book : HTML in 24 hours Author : Sam Peter Publication : Sam publication $ 63 Login Registration Book : XML Bible Author : Winston Publication : Wiely Catalogue Cart $ 40. Snap shot of Cover Page. The details should contain the following: 1. Price. Add to cart button. Publisher. 2. 4. Web Site Name Logo Home CSE ECE EEE CIVIL Book : AI Author : S. 5.Page 68 of 93 Web Site Name Logo Home CSE ECE EEE CIVIL Login Registration Catalogue Cart Login : Password: Submit Reset 3) CATOLOGUE PAGE: The catalogue page should contain the details of all the books available in the web site in a table.5 $ 35. Author Name.5 $ 50 68 . 3.

5 $40. For example: 69 .5 Cart 5) REGISTRATION PAGE: Create a “registration form “with the following fields 1) Name (Text field) 2) Password (password field) 3) E-mail id (text field) 4) Phone number (text field) 5) Sex (radio button) 6) Date of birth (3 select boxes) 7) Languages known (check boxes – English.5 $130. 3. Telugu. 2.). in the body of your pages.5 Quantity 2 1 Total amount Amount $70 $40. E-mail id (should not contain any invalid and must follow the standard pattern name@domain.com) 4. The cart page should look like this: Web Site Name Logo Home Login Registration Catalogue CSE ECE EEE CIVIL Book name Java 2 XML bible Price $35. Password (Password should not be less than 6 characters length). Note : You can also validate the login page with these parameters. 1. you refer to these selectors to activate the styles. Tamil) 8) Address (text area) WEEK 3: VALIDATION: Write JavaScript to validate the following fields of the above registration page. color etc. Name (Name should contains alphabets and the length should not be less than 6 characters).Page 69 of 93 Note: Week 2 contains the remaining pages and their description. Phone number (Phone number should contain 10 digits only). Week-4: Design a web page using CSS (Cascading Style Sheets) which includes the following: 1) Use different font. Hindi. styles: In the style definition you define how each selector should work (font. Week-2: 4) CART PAGE: The cart page contains the details about the books which are added to the cart. Then.

headline {color:red.htm" class="xlink">CROSS LINK</a> <br> <a href="mypage. You can define the background image for the page like this: BODY {background-image:url(myimage. color: red. text-decoration:underline} </style> </HEAD> <BODY> <b>This is normal bold</b><br> Selector {cursor:value} For example: <html> <head> <style type="text/css"> .gif).xlink {cursor:crosshair} . font-size:22px.htm" class="hlink">HELP LINK</a> </b> </body> </html> <b class="headline">This is headline style bold</b> </BODY> </HTML> 2) Set a background image for both the page and single elements on the page. font-family:arial. As background-repeat: repeat Tiles the image until the entire page is filled. just like an ordinary background image in plain HTML.Page 70 of 93 <HTML> <HEAD> <style type="text/css"> B.} </style> 70 . 4) Define styles for links as A:link A:visited A:active A:hover Example: <style type="text/css"> A:link {text-decoration: none} A:visited {text-decoration: none} A:active {text-decoration: none} A:hover {text-decoration: underline.hlink{cursor:help} </style> </head> <body> <b> <a href="mypage.} 3) Control the repetition of the image with the background-repeat property.

left:5. font-size:80px. 71 . font-size:50px.Page 71 of 93 5) Work with layers: For example: LAYER 1 ON TOP: <div style="position:relative. font-size:50px. Use your own colors for remaining columns. The shape of the area depends on the property shape. if it is false. z-index:2. If it is set to true then the shape of the area is Square and it is Circle.htm" class="xlink">CROSS LINK</a> <br> <a href="mypage. zindex:1">LAYER 2</div> LAYER 2 ON TOP: <div style="position:relative.hlink{cursor:help} </style> </head> <body> <b> <a href="mypage. top:-50. font-size:80px. It should be valid syntactically. Note: Give at least for 4 books.htm" class="hlink">HELP LINK</a> </b> </body> </html> Week-5: Write an XML file which will display the Book information which includes the following: 1) Title of the book 2) Author Name 3) ISBN number 4) Publisher name 5) Edition 6) Price Write a Document Type Definition (DTD) to validate the above XML file. color:red. z-index:3. top:-50.">LAYER 1</div> <div style="position:relative. color:red.">LAYER 1</div> <div style="position:relative. zindex:4">LAYER 2</div> 6) Add a customized cursor: Selector {cursor:value} For example: <html> <head> <style type="text/css"> . left:5. And the Author names column should be displayed in one color and should be capitalized and in bold. The contents should be displayed in a table. Hint: You can use some xml editors like XML-spy Week-6: VISUAL BEANS: Create a simple visual bean with a area filled with a color. Use XML schemas XSL and CSS for the above purpose. The color should also be changed if we change the color in the “property window “.xlink {cursor:crosshair} . The color of the area should be changed dynamically for every mouse click. The header of the table should be in color GREY. Display the XML file as follows.

He can check the cart page for the selected items.. Create a table which should contain at least the following fields: name. Price.invalidate() ). Read the user id and passwords entered in the Login form (week1) and authenticate with the values (user id and passwords ) available in the cookies. While installation assign port number 4040 to TOMCAT and 8080 to APACHE. Write a java program/servlet/JSP to connect to that database and extract data from the tables and display them. Week-12: HTTP is a stateless protocol. Week-11: Create tables in the database which contain the details of items (books in our case like Book name . no other process is using this port. phone number(these should hold the data from the registration form). Session is required to maintain the state.xml and access them in the servlet by using the getInitParameters() method.html (for Apache) Week-8: User Authentication : Assume four users user1. Insert the details of the users who register with the web site. When the user logs out his session should get invalidated (by using the method session. Use init-parameters to do this. Modify your catalogue and cart JSP pages to achieve the above mentioned functionality using sessions. Quantity. Access the pages by using the urls : http://localhost:4040/rama/books. user-name and password match) you should welcome him by name(user-name) else you should display “ You are not an authenticated user “. Store the user-names and passwords in the webinf.user2. 1. He may visit the catalogue again and select some more items.user3 and user4 having the passwords pwd1. Amount )) of each category. 2. from different systems in the LAN using the ip-address instead of localhost). email-id. Week-10: Write a JSP which does the following job: Insert the details of the 3 or 4 users who register with the web site (week9) by using registration form.. 2) Access the above developed static web pages for books web site.Page 72 of 93 Week-7: 1) Install TOMCAT web server and APACHE.html (for tomcat) http://localhost:8080/books. Here our interest is the selected items should be added to the old cart rather than a new cart. Multiple users can do the same thing at a time(i. Every user will have his own session which will be created after his successful login to the website. Modify your catalogue page (week 2)in such a way that you should connect to the database and extract data from the tables and display them in the catalogue page using JDBC. If he is a valid user(i.e. Create a Cookie and add these four user id’s and passwords to this Cookie. This can be achieved through the use of sessions.e. Practice 'JDBC' connectivity.e. Experiment with various SQL queries.. Write a servelet for doing the following. The user may add some items to cart from the catalog page. whenever a new user clicks the submit button in the registration page (week2). Make sure that these ports are available i.pwd2. 72 .pwd3 and pwd4 respectively. Authenticate the user when he submits the login form using the user name and password from the database ( similar to week8 instead of cookies). password. using these servers by putting the web pages developed in week-1 and week-2 in the document root. Week-9: Install a database(Mysql or Oracle).

MPEG. Classes. Springer. Pearson. Interfaces. UNIT VI Multimedia data compression: Lossless compression algorithm: Run-Length Coding. UNIT VII Basic Video Compression Techniques: Introduction to video compression. Transform Coding. color models in images. digital video. Authoring an ActionScript Class UNIT-IV Action Script II : Inheritance. 73 . Arithmetic Coding. UNIT-III Action Script I : ActionScript Features. David Hilman . P 0 C 4 web. Multimedia Basics by Weixel Thomson. Nahrstedt. Lossless Image Compression. Media-on-Demand(MOD). Transport of MPEG-4. Fudamentals of Multimedia by Ze-Nian Li and Mark S. 2. world wide multimedia software tools. 3.0.Tech. Steve Heath. REFERENCE BOOKS: 1. color models in video. Variable Length Coding. IT I-Sem T 4+1* MULTIMEDIA AND APPLICATION DEVELOPMENT UNIT-I Fundamental concepts in Text and Image: Multimedia and hypermedia. Graphics and image data representation graphics/image data Color in image and video: color science. Multimedia Technology and Applications. Basic Audio Compression Techniques. Multimedia over ATM Networks. Multimedia and communications Technology. Authoring an ActionScript 2. Datatypes and Type Checking. 6. Macromedia Flash MX Professional 2004 Unleashed. analog video. Galgotia. TEXT BOOKS: 1. search for motion vectors.0 Subclass. Elsevier(Focal Press). file formats. MIDI. Packages. Multimedia over IP. Embedded Zerotree of Wavelet Coefficients Set Partitioning in Hierarchical Trees (SPIHT). UNIT-II Fundamental concepts in video and digital audio: Types of video signals. Colin Moock.Page 73 of 93 JAWAHAR LAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B.REILLY. Drew PHI/Pearson Education. Digital Multimedia. Multimedia Applications. Exceptions. 5. Nigel chapman and jenny chapman. UNIT-VIII Multimedia Networks: Basics of Multimedia Networks. Wavelet-Based Coding. Object-Oriented ActionScript. UNIT-V Application Development : An OOP Application Frame work. Lossy compression algorithm: Quantization. Steinmetz. Using Components with ActionScript MovieClip Subclasses. Dictionary Based Coding. SPD O. Essentials ActionScript 2. Multimedia Network Communications and Applications : Quality of Multimedia Data Transmission. overview of types. Wiley-Dreamtech 2. video compression based on motion compensation. 4. digitization of sound. quantization and transmission of audio.

Unit . Ajay V Deshmukhi. Simon). HardReal-Time Scheduling Considerations. 74 . The Embedded System Design Process. Simon). Microcontrollers. TMH. Programming the 8051. Unit . Interrupts. Ayala). Embedded Systems.I Embedded Computing : Introduction. Timer Functions. Formalisms for System Design. Wolf). The 8051 Microcontroller. Simon.VIII Introduction to advanced architectures : ARM and SHARC. I2C bus and CAN bus. 3.Tech. An Example System. Design Example-Elevator Controller. Wayne Wolf. 4. (Chapter 8 from Text Book 1. Unit . (Chapter 3 from Text Book 2. Counter and Timers. TMH. Serial data Input/Output. via CMP publishers. Displays. (Chapter 8. Getting Embedded Software into the Target System. Message Queues. (Chapter I from Text Book 1.10 & 11 from Text Book 3. Serial Data Communication. Labrosse. Embedding system building blocks. Mailboxes and Pipes. David E. Thomson.II The 8051 Architecture : Introduction. Ayala). Raj kamal. Pearson Education. Raj Kamal. D/A and A/D Conversions. External Memory. Elseveir. IT I-Sem T P C 4+1* 0 4 EMBEDDED SYSTEMS Unit . John Wiley. Events. Ayala).IV Arithmetic Operations. Semaphores.Page 74 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. Kenneth J. Debugging Techniques: Testing on Host Machine. Input/Output Ports and Circuits.V Applications : Interfacing with Keyboards. Unit . Further Details on Interrupts.VII Basic Design Using a Real-Time Operating System : Principles. An example RTOS like uC-OS (Open Source). Processor and memory organization and Instruction level parallelism. Embedded System Design. Semaphores and Queues. Third Edition.VI Introduction to Real – Time Operating Systems : Tasks and Task States. and Shared Data. Computers and Components. Frank Vahid. Complex Systems and Microprocessor. Unit . 6. (Chapter 6 and 7 from Text Book 3. Embedded Software Development Tools: Host and Target machines. Tasks and Data. Using Laboratory Tools. Programming Tools and Techniques.9. Interrupt Routines in an RTOS Environment. TEXT BOOKS : 1. (Chapters 4.Ayala.5 and 6 from Text Book 2. REFERENCES : 1. Unit . Pearson Education. InternetEnabled Systems. 2. 8051 Micro controller Hardware. An Embedded Software Primer. Multiple Interrupts. 5. Networked embedded systems: Bus protocols. Micro Controllers. Saving Memory and Power. Wolf).III Basic Assembly Language Programming Concepts : The Assembly Language Programming Process. Memory Management. 2. (Chapter 7and 8 from Text Book 2. Decimal Arithmetic. Design Examples. Linker/Locators for Embedded Software. (Chapter 10 and 11 from Text Book 2. Ayala) Unit . Data Transfer and Logical Instructions. Tony Givargis. Jump and Call Instructions.

Function and IPV6 support. KING ABLES. UNIT-III TCP client server : Introduction. poll function. UNIT-IV I/O Multiplexing and socket options: I/O Models. select function. summary of UDP example. Text Book: 1. FIFOs streams and messages. terminate and signal handling server process termination. Byte ordering and manipulation function and related functions Elementary TCP sockets – Socket. UNIX for programmers and Users. Overview. gethost by Name function. UNIT-VI Elementary name and Address conversions: DNS.Richard Stevens. Pearson Edn. PHI. Asia. 2. 2. other networking information. determining outgoing interface with UDP. 1st Edition. Batch input. Message queues. REFERNCES: 1. 3. Pearson Education. standard internet services. UNIT-VIII Remote Login: Terminal line disciplines. rlogin 75 . RPC Transparency Issues. Generic socket option IPV6 socket option ICMPV6 socket option IPV6 socket option and TCP socket options. UNIT-V Elementary UDP sockets: Introduction UDP Echo server function. 3RD Edition. bind. connect. Pipes. UNIX Network Programming. concurrent servers. TCP Echo server. value – result arguments. Pseudo-Terminals. GRAHAM GLASS. uname function.Tech. Unix standards. shutdown function. Crashing and Rebooting of server host shutdown of server host. listen. Control Terminals. UNIX SYSTEMS PROGRAMMING USING C++ T CHAN. Advanced UNIX programming. I. UNIT-II Sockets : Address structures. Protocol usage by common internet application.W. IT I-Sem T 4+1* NETWORK PROGRAMMING P 0 C 4 UNIT-I Introduction to Network Programming: OSI model. . Close function and related function. system IPC. fork and exec function. Sockets API. Vol.W. TCP and UDP & TCP connection establishment and Format.Richard Stevens. Buffer sizes and limitation. PHI. . 2nd Edition.Page 75 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. getsockopt and setsockopt functions. lost datagram. Normal startup. accept. 2nd edition. UNIX Network Programming. File and record locking. Semaphores. M J Rochkind pearson education. Resolver option. Name spaces. Lack of flow control with UDP. Terminal modes. Socket states. TCP Echo server functions. UNIT-VII IPC : Introduction.

IV Mobile Transport Layer : Traditional TCP.I Introduction to Mobile Communications and Computing : Mobile Computing (MC) : Introduction to MC. Loren. routing and various routing algorithms. security.7. SDMA. UNIT . Wiley.second edition. hybrid mechanisms. October 2004. Localization and calling. UNIT . Martyn Mallick. Dynamic Host Configuration Protocol (DHCP). 2. Stojmenovic and Cacute. limitations. Selective retransmission. 2004. networking. ISBN 0471419028. registration. Adelstein. and treatment of protocols of all layers). Snooping TCP. 3. Merk.Page 76 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. Hansmann. FDMA. (Chapters 11. 2002. power-aware and context-aware computing. tunneling and encapsulation. Stober. protocol architecture. “Principles of Mobile Computing”. UNIT . transactional models. IP packet delivery. Frank. Handover. novel applications.Addison-Wesley. IT I-Sem T P C 4+1* 0 4 MOBILE COMPUTING UNIT .VI Data Dissemination: Communications asymmetry. Jochen Schiller. Transmission /time-out freezing. Security. assumptions.VII Mobile Ad hoc Networks (MANETs): Overview. Nicklous. UNIT . MAC layer. Radio interface. link management) and J2ME. 76 . pushbased mechanisms. “Mobile and Wireless Design Essentials”. Protocols.III Mobile Network Layer : Mobile IP (Goals. 26 and 27) REFERENCES : 1. 4. “Fundamentals of Mobile and Pervasive Computing”. ISBN: 0521817331. System architecture. “Handbook of Wireless Networks and Mobile Computing”. 15. spectrum of MANET applications. Reza Behravanfar. Properties of a MANET. 2005. 17. UNIT . caching invalidation mechanisms. classification of new data delivery mechanisms. Schwiebert.“Mobile Communications”. 2003. second edition. agent advertisement and discovery. selective tuning (indexing) techniques. Sandeep KS. and architecture. physical layer. client server computing with adaptation. Wiley DreamTech.V Database Issues : Hoarding techniques. UNIT .10. McGraw-Hill Professional.Tech. Bluetooth (User scenarios. Richard III. pull-based mechanisms. query processing. recovery. (Chapters 4. TEXT BOOKS : 1. Fast retransmit/ fast recovery. TDMA.VIII Protocols and Tools : Wireless Application Protocol-WAP. GSM : Mobile services. and New data services. 2. security in MANETs.11). Mobile TCP. Transaction oriented TCP.9. (Introduction. optimizations). Golden . Indirect TCP. ISBN: 0071412379. CDMA. Cambridge University Press.II (Wireless) Medium Access Control : Motivation for a specialized MAC (Hidden and exposed terminals. Near and far terminals). Springer. UNIT . Gupta. 2003. “Mobile Computing Principles: Designing and Developing Mobile Applications with UML and XML”. entities and terminology. and quality of service issues.

3. Digital libraries and Data Warehouses. Hypertext linkages UNIT-VI Document and Term Clustering: Introduction. Information Storage & Retieval By Robert Korfhage – John Wiley & Sons. Weighted searches of Boolean systems. Frakes.Tech. Miscellaneous UNIT-III Cataloging and Indexing: Objectives. UNIT-V Automatic Indexing: Classes of automatic indexing. Statistical indexing. UNIT-II Information Retrieval System Capabilities: Search. Mark T Maybury: Information Retrieval Systems: Theory and Implementation. REFERENCES : 1. Selective dissemination of information search.I) P 0 C 4 UNIT-I Introduction: Definition. Gerald. Hardware text search systems. Functional Overview. Information Visualization: Introduction. Browse. UNIT-IV Data Structures: Introduction. UNIT-VIII Text Search Algorithms: Introduction. IT I-Sem T 4+1* INFORMATION RETRIEVAL SYSTEMS (ELECTIVE . Automatic Indexing. N-gram data structure. Measurement example – TREC results. Prentice Hall.Page 77 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. Hierarchy of clusters. Stemming Algorithms. Indexing Process. Thesaurus generation. Concept indexing. 2. Ricardo Baeza-Yates: Information Retrieval Data Structures and Algorithms. Similarity measures and ranking. Information System Evaluation: Introduction. 1992. Inverted file structures. Cognition and perception. Relationship to DBMS. 1997.B. Kluwer Academic Press. Measures used in system evaluation. Modern Information Retrival By Yates Pearson Education. Signature file structure. Hypertext data structure. TEXTBOOK : 1. Objectives. PAT data structure. Software text search algorithms. UNIT-VII User Search Techniques: Search statements and binding. Natural language. 77 . Searching the Internet and hypertext. Relevance feedback. Item clustering. Information Extraction. Kowalski. Information visualization technologies. W..

Integrity. Authentication. 2. David Ahmad.V IP Security Overview. Security Services (Confidentiality. Mark Rhodes. digital signatures. Certificate Authority and key management Kerberos. Conventional encryption algorithms. Introduction to Cryptography. IP Security Architecture. Radia Perlman and Mike Speciner. A model for Internetwork security.Private Communication in a Public World by Charlie Kaufman.II Conventional Encryption Principles. route table modification. Encapsulating Security Payload. Steve W. Secure Electronic Transaction (SET). Secure Socket Layer (SSL) and Transport Layer Security (TLS). Authentication Header. and man-in-the-middle attacks.III Public key cryptography principles. Hal Flynn Ido Dubrawsky. 5. UNIT . Fundamentals of Network Security by Eric Maiwald (Dreamtech press) 2. Whitman.509 Directory Authentication Service. ARP attacks. UNIT . Secure Hash Functions and HMAC. 3. Trusted Systems. UNIT . Pearson/PHI. REFERENCES : 1. UDP hijacking. location of encryption devices. SNMPv1 Community facility and SNMPv3. Hack Proofing your network by Ryan Russell. Third edition. Interception. Network Security Essentials (Applications and Standards) by William Stallings Pearson Education. Principles of Information Security. TCP session hijacking. Buffer overflow & format string vulnerabilities.I Security Attacks (Interruption. Network Security . X. UNIT . Intrusion Detection Systems. Robert Bragg.VI Web Security Requirements. Joe Grand. cipher block modes of operation. Dan Kaminsky. digital Certificates. IT I-Sem T 4+1* INFORMATION SECURITY (ELECTIVE . Internet Standards and RFCs.Tech. 78 . Viruses and related threats. wiley Dreamtech. key distribution Approaches of Message Authentication. access Control and Availability) and Mechanisms. Buchmann. Network Security: The complete reference. TMH 6.I) P 0 C 4 UNIT . Rain Forest Puppy. Non-repudiation. PHI/Pearson 4.VII Basic concepts of SNMP. Thomson.Manzuik and Ryan Permeh. Springer.IV Email privacy: Pretty Good Privacy (PGP) and S/MIME. TEXT BOOKS : 1. Modification and Fabrication). Stallings.Page 78 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. Intruders. UNIT . Cryptography and network Security. UNIT . UNIT .VIII Firewall Design principles. public key cryptography algorithms. Combining Security Associations and Key Management.

7. Virtual Reality Technology. 8. and Gesture Interfaces): Three-dimensional position trackers.2 and 7. navigation and manipulation. Second Edition. (2.1. (7.Page 79 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. commercial VR technology and the five classic components of a VR system.. Alan Craig. 19 and 21 of Text Book (2)) TEXT BOOKS : 1. 1.3 of Text Book (1)) UNIT . Inc. 4. particle systems.3. (Chapters 18. John Wiley & Sons.Sherman. Application and Design. 5. 3D Modeling and surfacing.V Human Factors: Methodology and terminology. (1. Gregory C. 2005.VII VR Programming-I : Introducing Java 3D.2 and 2. interfaces and gesture interfaces. using a lathe to make shapes.3 and 1. Bill Fleming. 3. (3. Understanding Virtual Reality. Navigation. (5. 79 . VR health and safety issues. 2. Elsevier(Morgan Kauffman). Pearson Education.Tech.Eberly.2 of Text Book (1)).3 of Text Book (1)). Burdea & Philippe Coiffet.3. 2. military applications. Elsevier(Morgan Kaufmann). 16 and 17 of Text Book (2)) UNIT . 3D Game Engine Design. UNIT .3 and 9.1. UNIT .1.5 of Text Book (1)) UNIT .1.3 of Text Book (1)). animated 3D sprites. 2.1.I) P 0 C 4 UNIT-I Introduction : The three I’s of virtual reality. Oreilly-SPD. UNIT . IT I-Sem T 4+1* VIRTUAL REALITY (ELECTIVE .4 and 5. physical modeling. Killer Game Programming in Java. Elsevier.III Output Devices: Graphics displays. Andrew Davison.VI Applications: Medical applications. kinematics modeling. David H. UNIT . sound displays & haptic feedback.1.IV Modeling : Geometric modeling.II Input Devices : (Trackers. (Chapters 14. interface. (8.VIII VR Programming-II : 3D Sprites. REFERENCES : 1. robotics applications. 5. loading and manipulating external models. model management.5 of Text Book (1)). William R. user performance studies. behaviour modeling.2 and 5. John Vince. Virtual Reality Systems.2 & 3.

Tech. 80 . organizing screen elements. Soren Lauesen . ROGERS. Pearson Education Asia. ABOWD.V Windows – New and Navigation schemes selection of window. Benefits of good design. RUSSELL BEALG. Pearson Education. UNIT . UNIT . understanding business junctions.VI Components – text and messages. IT I-Sem T 4+1* HUMAN COMPUTER INTERACTION (ELECTIVE . TEXT BOOKS : 1. UNIT .IV Screen Designing : Design goals – Screen planning and purpose. GRE GORYD. Characteristics. User Interface Design. The essential guide to user interface design.I) P 0 C 4 UNIT . characteristics. UNIT . Designing the user interface. REFERENCES : 1. the concept of direct manipulation.Principles of user interface. SHARPS. graphical system. ordering of screen data and content – screen navigation and flow – Visually pleasing composition – amount of information – focus and emphasis – presentation information simply and meaningfully – information retrieval on web – statistical graphics – Technological consideration in interface design. UNIT . 2. Interaction Design PRECE. JANET FINCAY. interface – Building Tools. PEARSON. Human – Computer Interaction.II The graphical user interface – popularity of graphics. 3.III Design process – Human interaction with computers. uses problems. Wilbert O Galitz. 2. selection of devices based and screen based controls. Web user – Interface popularity.I Introduction : Importance of user Interface – definition.Page 80 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. UNIT . Icons and increases – Multimedia. 3rd Edition Ben Shneidermann . Wiley DreamaTech. UNIT . choosing colors. importance of good design. ALAN DIX.VII Software tools – Specification methods. Human interaction speeds.VIII Interaction Devices – Keyboard and function keys – pointing devices – speech recognition digitization and generation – image and video displays – drivers. Wiley Dreamtech. colors. importance of human characteristics human consideration. A brief history of Screen design.

Pankaj Jalote. Pearson Education. Iterative Process Planning : Work breakdown structures. pragmatic Software Metrics. life cycle expectations. Bob Hughes and Mike Cotterell: Tata McGrawHill Edition. Software Project Management. improving automation. Joel Henry. Achieving required quality. 3. UNIT . Management indicators. Iteration workflows. 2005.Tech. The old way and the new : The principles of conventional software Engineering. planning guidelines.V Checkpoints of the process : Major mile stones. Engineering artifacts. Software Project Management in practice. transition phases. Evolution of Software Economics : Software Economics. improving team effectiveness.III Life cycle phases : Engineering and production stages. UNIT . Software Project Management. UNIT . Tailoring the Process : Process discriminants. Work Flows of the process : Software process workflows.II Improving Software Economics : Reducing Software product size. Periodic status assessments. REFERENCES : 1. IT I-Sem T P C 4+1* 0 4 SOFTWARE PROJECT MANAGEMENT (ELECTIVE II) UNIT . quality indicators. evolution of Organizations. Project Organizations. pragmatic software cost estimation. construction. The Project Environment. modern process transitions.2005. Pearson Education. Iteration planning process.I Conventional Software Management : The waterfall model.VIII Future Software Project Management : Modern Project Profiles. Elaboration. Next generation Software economics. Metrics automation. cost and schedule estimating. UNIT . peer inspections. programmatic artifacts. UNIT .IV Model based software architectures : A Management perspective and technical perspective. Process Automation : Automation Building blocks. inception.Page 81 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. conventional software Management performance. Walker Royce: Pearson Education.Replacement (CCPDS-R) TEXT BOOK : 1. Management artifacts.VII Project Control and Process instrumentation : The seven core Metrics. Software Project Management. Case Study: The command Center Processing and Display system. UNIT . Artifacts of the process : The artifact sets.VI Project Organizations and Responsibilities : Line-of-Business Organizations. Pragmatic planning. transitioning to an iterative process. Minor Milestones. 2. principles of modern software management. improving software processes. UNIT . 81 .

VIII Classical Vs Quantum logic gates . TEXT BOOK : 1.Burkhardt et . parallel I/O . Human . REFERENCES : 1. IT I-Sem T 4+1* ADVANCED COMPUTING CONCEPTS (ELECTIVE . Performance Models & Simulations. J. Grid Architectures and its relations to various Distributed Technologies UNIT II Autonomic Computing. Cluster Operating systems: COMPaS and NanOS UNIT .One . Networking Protocols & I/O. Joseph & C.Beowlf. 2. Messaging systems. Pearson Education. Quantum algorithms. Java for Pervasive devices.VI Pervasive Computing concepts & Scenarios.V Example cluster System .two & three QUbit Quantum gates. Distributed shared memory. Minoli. Quantum circuits. Pearson Education. Application examples UNIT . UNIT IV Process scheduling. Neilsen & Chung L:’Quantum computing and Quantum Information’. Wiley. Raj Kumar Buyya:’High performance cluster computing’.Page 82 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B.II) P 0 C 4 UNIT I Grid Computing : Data & Computational Grids.al :’Pervasive computing’ Pearson Education 3. Fredkin & Toffoli gates . 82 . Pearson Education.machine interface. Hardware & Software.VII Device connectivity. 2. Cambridge University Press. A networking approach to Grid Computing . Examples of the Grid Computing Efforts (IBM).Tech. UNIT III Cluster setup & its Advantages. 3. UNIT . Load sharing and Balancing. Marivesar:’Approaching quantum computing ‘. Fellenstein:’ Grid Computing ‘. UNIT . J.

Jahne.Woods. smoothing and sharpening.nos 147-167. fundamental steps in digital image processing. open and closing. constrained least squares filtering. UNIT . B.Tech. image sampling and quantization. Alasdair McAndrew. Rafeal C.44. Wily Third Edition 7. Second Edition.nos. pseudo color image processing. noise models. 220-243. Richard E. geometric transforms. Vaclav Hlavac and Roger Boyle.VII Image Segmentation : Detection of discontinuous. Prat. string matching (p. Second Edition. UNIT . structural methods – matching shape numbers.Woods.components of image processing system. Pearson Education/PHI.nos: 693-735). restoration in the presence of noise–only spatial filtering. Digital Image Processing using Matlab. Steven L. D. B. IT I-Sem T P C 4+1* 0 4 IMAGE PROCESSING (ELECTIVE . Pearson Education. Milan Sonka.nos: 567-617). basic relationships between pixels (p. image compression models. Chanda. 2003. Thomson Learning. Adrian Low.II Image enhancement in the spatial domain : Basic gray-level transformation. Digital Image Processing.nos: 409-467. Image Processing. 83 . Digital Image Fundamentals: A simple image formation model.Page 83 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. matching. Digital Image Processing.nos:519-550).Gonzalez.nos: 282. UNIT . basic morphologic algorithms (p. and Machine Vision. William K.S. Springer. Introduction to the Fourier transform and the frequency domain. estimating the degradation function (p. 50-69). color segmentation (p. color transforms. UNIT . dilation. basics of full– color image processing. Datta Majumder.339).VIII Object Recognition : Patterns and patterns classes. Rafeal C.I Introduction : Examples of fields that use digital image processing. TEXT BOOK : 1. erosion. 2. Introduction to Digital Image Processing with Matlab.IV Color Image Processing : Color fundamentals. Computer Vision and Image Processing.nos 76-141). UNIT .III Image restoration : A model of the image degradation/restoration process.Publications 5. image compression standards (p. enhancement using arithmetic and logic operators. region– based segmentation (p. Weiner filtering. error-free compression. color models. UNIT . Digital Image Processing and Analysis.II) UNIT . basic spatial filtering. Eddins. 21. Analysis. hit or miss transformation. REFERENCES : 1. 4.492-510). Digital Image Processing. UNIT .Gonzalez. Richard E. combining the spatial enhancement methods ( p. 6. Second Edition. Thomson Course Technology 3. edge linking and boundary detection. optimum statistical classifiers. Prentice Hall of India. recognition based on decision–theoretic methods. 15-17.VI Morphological Image Processing : Preliminaries. 256-276).V Image Compression : Fundamentals. histogram processing. lossypredictive coding. neural networks. smoothing and sharpening spatial filters. thresholding.

Design TCP iterative Client and server application to reverse the given input sentence Week5. Advance Unix Programming.Page 84 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. Second Edition Pearson Education 2. Design TCP iterative Client and server application to reverse the given input sentence Week6. IT I-Sem T 0 NETWORK PROGRAMMING LAB Objectives: • To teach students various forms of IPC through Unix and socket Programming P 3 C 2 Recommended Systems/Software Requirements: • Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space LAN Connected • Any flavour of Unix / Linux Week1. Implement the following forms of IPC. N.Advance Unix Programming Richard Stevens.B. Design a TCP concurrent server to echo given set of sentences using poll functions Week9. BS Publication.Tech. Write a programme to create an integer variable using shared memory concept and increment the variable simultaneously by two processes. a)Pipes b)FIFO Week2. Use senphores to avoid race conditions Week4. Design a TCP concurrent server to convert a given text into upper case using multiplexing system call “select” Week8. Venkateswarlu. 84 . Design UDP Client and server application to reverse the given input sentence Week10 Design UDP Client server to transfer a file Week11 Design using poll client server application to multiplex TCP and UDP requests for converting a given text into upper case. Week12 Design a RPC application to add and subtract a given pair of integers Reference Book: 1. Implement file transfer using Message Queue form of IPC Week3. Design TCP client and server application to transfer file Week7.

Sorting or Reversing an Array 21. Determining Points Along a Circle 20. Creating a Text Field 23. Tinting a Movie Clip’s Color 10. IT I-Sem T 0 MULTIMEDIA AND APPLICATION DEVELOPMENT LAB 1. Action Script Cookbook. 3. Making a Password Inputfield All the above programs are to be done in Flash MX 2004. REFERENCES : 1. Calculating the Distance Between the Two Points 17. Creating Loops 3. Generation Random Numbers 4.Tech. Controlling a Movie Clip’s Color with Sliders 11. SPD-Oreilly.Page 85 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. P 3 C 2 85 . Flash MX Professional 2004 Unleashed. Drawing a Rectangle 13. Pearson Education. Dreamtech Wiley. Calling a Function 5. and a Button 2. Converting Angle Measurements 16. 2. Filling a Shape with a Gradient 14. Implementing a Custom Sort 22. Checking the System language 8. Assigning Actions to an Object. Converting Between Units of Measurement 19. Creating a Function. Detecting the Operating System 7. Scripting Masks 15. Flash MX Action Script for designers. David Vogeleer and Matthew Pizzi. Detecting the Player Version 6. Formatting Currency Amount 18. Detecting Display Settings 9. Doug Sahlin. Joey Lott. Drawing a Circle 12.

Freeman. Line and staff organization.nature. Performance Appraisal. c chart. Value Chain Analysis. p chart. Basic functions of HR Manager: Manpower planning. Elements of Corporate Planning Process. 6th Ed. functional organization. 86 .I Introduction to Management: Concepts of Management and organization. HRM vs. Enterprise Resource Planning (ERP). batch and Mass Production). Need for Inventory control. Programme Evaluation and Review Technique (PERT). Business Process Re-engineering and Bench Marking. Management. (simple problems) Unit . New Delhi. Training and Development.V Human Resources Management (HRM) : Concepts of HRM. Policy. SWOT Analysis. Balanced Score Card. matrix organization. Committee organization. Systems Approach to Management. Douglas McGregor’s Theory X and Theory Y. Placement. Mayo’s Hawthorne Experiments. boundaryless organization. importance and Functions of Management.Departmentation and Decentralisation. Aryasri : Management Science. 2004. Unit . Types of mechanistic and organic structures of organisation (Line organization. Environmental Scanning. TMH. Purchase Procedure. Total Quality Management (TQM). Critical Path Method (CPM). Materials Requirement Planning (MRP). EOQ. TEXT BOOKS : 1. Maslow’s Theory of Human Needs.VI Project Management (PERT/CPM) : Network Analysis.Tech. team structure. demerits and suitability. Promotion. Supply Chain Management.VIII Contemporary Management Practices : Basic concepts of MIS. Programmes. Herzberg’s Two-Factor Theory of Motivation. Separation. Project Crashing. R chart. 2004. Steps in Strategy Formulation and Implementation. Goals. ABC Analysis. Generic Strategy alternatives. Just-In-Time (JIT) System. Deming’s contribution to quality. Selection. Unit .Statistical Quality Control: chart.PMIR.Page 86 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. End User Computing. Unit -IV a) Materials Management: Objectives. Probability of Completing the project within given time. Project Cost Analysis. Unit . b) Marketing: Functions of Marketing. Six sigma and Capability Maturity Model (CMM) Levels. Stoner. Objectives. Channels of distribution Unit . IT II-Sem T 4+1* MANAGEMENT SCIENCE P 0 C 4 Unit . lean and flat organization structure) and their merits. Job Evaluation and Merit Rating. Marketing Strategies based on Product Life Cycle. Marketing Mix. Pearson Education. Business Process outsourcing (BPO). Recruitment. HRD and Personnel Management and Industrial Relations (PMIR). Grievance Handling and Welfare Administration. Performance Management.II Designing Organisational Structures : Basic concepts related to Organisation . Taylor’s Scientific Management Theory. inverted pyramid structure. Social responsibilities of Management. Strategy. Fayol’s Principles of Management. Unit . Acceptance Sampling. Cellular Organisation. Identifying critical path. Wage and Salary Administration. (simple Problems). Transfer. Leadership Styles.III Operations Management : Principles and Types of Plant Layout-Methods of production (Job.VII Strategic Management : Mission. Virtual Organisation. 2. Stores Management and Stores Records. Work Study -Basic procedure involved in Method Study and Work Measurement. Gilbert.

9. 10. Wiley.Srinath: PERT/CPM. 2005 3.Certo: Modern Management.Glueck:Business Policy and Strategic Management. 6/e. Kotler Philip & Keller Kevin Lane: Marketing Mangement 12/e. PHI. Parnell: Strategic Management.2005.2003. Personnel Management. Memoria & S. PHI. 2005 6. 5.V.Affiliated East-West Press.S. Poole & Wiesner: Management. 9/e.Duening & John M. Oxford University Press. 2002.2003. 2004. 2005 2.Ivancevich Management — Principles and Guidelines. Himalaya. L. Koontz & Weihrich: Essentials of Management. TMH. 4. Lawrence R Jauch. R. Biztantra. 2005. 8. 25/e. Kanishka Bedi. 2005 7. Samuel C.Gupta &William F. Frank Bros. Thomas N.Page 87 of 93 REFERENCES : 1. 87 .Gauker. Biztantra. Capling. Schermerhorn. Production and Operations Management.

Other Retrieval Techniques UNIT-IV Video Databases : Organizing Content of a Single Video. Multidimensional Data Structures: k-d Trees. REFERENCES : 1. Unit-VII Spatial Concepts and Data Models: Models of spatial information. Word Stems. Indexing Audio Data UNIT-V Multimedia Databases : Design and Architecture of a Multimedia Database. V. IT II-Sem T 4+1* MULTIMEDIA DATABASES (ELECTIVE . Object relational schema examples querries. and Frequency Tables. Stop Lists. Design extending the ER model with spatial concepts. Representing Image DBs with R-Trees.Tech.III) P 0 C 4 UNIT-I Introduction : An introduction to Object-oriented Databases. Compressed Image Representations. Retrieving Images By Spatial Layout. Object oriented data model with UML. R-Trees. Media Abstractions. Prabhakaram. Multimedia Database Systems. 88 . Latent Semantic Indexing. Implementations UNIT-III Text/Document Databases : Precision and Recall. Similarity-Based Retrieval. Image Processing: Segmentation.S. Unit-VIII Spatial Query Languages: Extending the SQL for spatial data. Querying Content of Video Libraries. Organizing Multimedia Data Based on The Principle of Uniformity. Sanjiv Chawla. Indexing SMDSs with Enhanced Inverted Indices. comparison of Different Data Structures UNIT-II Image Databases : Raw Images.Page 88 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. video Standards Audio Databases : A General Model of Audio Data. Alternative Image DB Paradigms. TV-Trees. Springer. TEXT BOOKS : 1. 2. Extending the ER model pictograms. 2. Lynne Dunckley. Point Quadtrees. Principles of Multimedia Database Systems. Representing Image DBs with Relations. Efficient Solution of Temporal Presentation Constraints. Spatial Databases. Multimedia Databases: An object relational approach. Query Languages for Retrieving Multimedia Data. Examples of queries that emphasis spatial data. The MX-Quadtree. Spatial Constraints. Shashi Shekhar. Pearson Education. Specifying Multimedia Documents with Temporal Constraints. Query Relaxation/Expansion Unit-VI Creating Distributed Multimedia Presentations : Objects in Multimedia Presentations. Subrahmanian. Capturing Audio Content through Discrete Transformation. Elseveir(Morgan Kauffman). Video Segmentation. Pearson Education.

Organization. TMN Architecture. Distributed Network Management. Implementation Issues.Tech. Mani Subrahmanian. The SNMPv2 Management Information Base. UNIT-III SNMPv1 Network Management : Communication and Functional Models. RMON2. Paul. ATM Remote Monitoring. RMON SMI and MIB. UNIT-VIII Web-Based Management : NMS with Web Interface and Web-Based Management.Page 89 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. Future Directions TEXT BOOK : 1. A Case Study of Internet Traffic Using RMON UNIT-VI Telecommunications Management Network : Why TMN?. SNMPv2 Protocol. System Management. Managed network: Case Histories and Examples. SNMPv2 Structure of Management Information. IT II-Sem T 4+1* NETWORK MANAGEMENT SYSTEMS (ELECTIVE . Operations Systems. Java management Extensions. The SNMP Model. Communications protocols and Standards. Challenges of Information Technology Managers. UNIT-II SNMPV1 Network Management : Organization and Information and Information Models. The History of SNMP Management. 89 . and Functions. Network management. History of Enterprise Management. John Wiley. RMON1.III) P 0 C 4 UNIT-I Data communications and Network Management Overview : Analogy of Telephone Network Management. Functional model UNIT-IV SNMP Management: SNMPv2 : Major Changes in SNMPv2. Commercial Network management Systems. Current Status and future of Network Management. Web-Based Enterprise Management. TMN Management Service Architecture. Desktop management Interface. Embedded Web-Based Management. TMN Standards. Principles of Network System Administration. Pearson Education. Network Management systems. Case Histories of Networking and Management. Network and System Management. WBEM: Windows Management Instrumentation. TMN Conceptual Model. The SNMP Communication Model. REFERENCES : 1. Mark Burges. SNMPv2 System Architecture. Network Management System Platform. An Integrated View of TMN. Network Statistics Measurement Systems. The Information Model. Web Interface to SNMP Management. Wiley Dreamtech. Morris. Compatibility With SNMPv1 UNIT-V SNMP Management: RMON : What is Remote Monitoring? . Network Management: Goals. System Overview. Network Management. 3. Pearson Education. 2. The Organization Model. UNIT-VII Network Management Tools and Systems : Network Management Tools. Management of a Storage Area Network: . Principles and Practice. Enterprise Management Solutions.

The Ultimate Reference. Types of algorithms used for interpretation.Page 90 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. 90 . UNIT III Facial Scan . TEXT BOOKS : 1.III) P 0 C 4 UNIT I Introduction – Benefits of biometric security – Verification and identification – Basic working of biometric matching – Accuracy – False match rate – False non-match rate – Failure to enroll rate – Derived metrics – Layered biometric solutions. UNIT V Voice Scan .Dream Tech 2. Michael Thieme.Paul Reid. Pearson Education. Woodward. Statistical measures of Biometrics. UNIT VII Biometrics Application – Biometric Solution Matrix – Bio privacy – Comparison of privacy factor in different biometrics technologies – Designing privacy sympathetic biometric systems.keystroke scan. Wiley Dreamtech. IT II-Sem T 4+1* BIOMETRICS (ELECTIVE . Biometrics for Network Security. Raj Nanavati. REFERENCE: 1. Biometrics. Biometric standards – (BioAPI . UNIT IV Iris Scan . Jr.Features – Components – Operation (Steps) – Competing voice Scan (facial) technologies – Strength and weakness. BAPI) – Biometric middleware UNIT VIII Biometrics for Network Security. Biometrics – Identity Verification in a Networked World – Samir Nanavati. UNIT II Finger scan – Features – Components – Operation (Steps) – Competing finger Scan technologies – Strength and weakness.Tech. UNIT VI Other physiological biometrics – Hand scan – Retina scan – AFIS (Automatic Finger Print Identification Systems) – Behavioral Biometrics – Signature scan. Biometric Transactions.Features – Components – Operation (Steps) – Competing iris Scan technologies – Strength and weakness.Features – Components – Operation (Steps) – Competing facial Scan technologies – Strength and weakness. WILEY.John D.

CSH Publications 3. UNIT-IV Sequencing Alignment and Dynamic Programming : Heuristic Alignment algorithms.TSAI WILEY Publications. Molecular Modeling Databases (MMDB).Tech. UNIT-V Primary Database and their Use : Introduction to Biological databases. KEGG. Elementary commands and protocols. DDBJ. Cynthia Gibbas & Per Jamberk 4. 91 . Organization and management of databases. PIR. Map alignment. Stephen A.Buehler CAC Press 2000. telnet. Algorithms on Strings Trees and Sequences Dan Gusfiled. REFERENCES : 1. http. WIT.F. 6. 2000.KEGG UNIT-VII Bio Chemical Data Bases : Introduction to BioChemical databases-organization and Management of databases. BLOSUM). Applications in Biological Science and Medicine by Hooman H. Global sequence alignments-Neddleman-Wunsch Algorithm Smith-Waterman Algorithm-Local sequence alignments (Amino acid substitution Matrices (PAM. UNIT-III Special Topics In Bioinformatics : DNA mapping and sequencing.Stan . Rashidi and Lukas K. UNIT-VIII Evolutionary Trees and Phylogeny : Multiple sequence alignment and phylogenetic analysis. FRANCIS OUELLETTE. ftp. MIT Press 1988. Editior-Sandor Suhai.BAXEVANIS. Computational Biochemistry – C. Springer Publications. 7. Genomics and Proteomics-Functional and Computational aspects. Primer on information theory.EMBL. Bioinformatics – Principles and Applications – Harshawardhan P.Bal TATA MEGRAW HILL. Cambridge University Press 1997.Page 91 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. David Mount. 8. Bioinformatics: A Machine Learning Approach P. Primary Databases NCBL.Methods and Protocols-Human Press. Brunak. IT II-Sem T 4+1* BIOINFORMATICS (ELECTIVE-IV) P 0 C 4 UNIT-I Introduction to Bioinformatics: Scope of Bioinformatics. Searching and retrieval of information from the World Wide Web. Bioinformatics. Baldi. UNIT-II Introduction to Homology : Introduction to Homology (with special mention to Charles Darwin. 5. Large scale sequencing methods Shotgun and Sanger method. 2. Bioinformatics Basics. S. B. Willie Henning. Developing Bioinformatics Skills. BRENDA. Bioinformatics. Krawetz. 2. Stephen Misener. Sir Richard Owen. Structure databases-PDB (Protein Data Bank). UNIT-VI Secondary Databases : Introduction to Secondary Databases Organization and management of databases Swissprot. EXGESCY. Bioinformatics – A Practical guide to the Analysis of Genes and Proteins – ANDREAS D. Alfred Russel Wallace). TEXT BOOKS : 1.

Design Patterns in Smalltalk MVC. Composite. Organizing the Catalog. 92 . UNIT-II A Case Study : Designing a Document Editor : Design Problems. State. Document Structure. TEXT BOOK : 1. Builder.Wiley DreamTech. UNIT-V Structural Pattern Part-II : Decorator. Design Patterns Explained By Alan Shalloway. 2. Pattern’s in JAVA Vol-II By Mark Grand . Pearson Education REFERENCES : 1.Wiley DreamTech. A Brief History. JAVA Enterprise Design Patterns Vol-III By Mark Grand . Summary . Describing Design Patterns. Supporting Multiple Window Systems. Design Patterns By Erich Gamma. Observer. Iterator. Singleton. açade. The Pattern Community An Invitation. Prototype. IT II-Sem T 4+1* DESIGN PATTERNS (ELECTIVE-IV) P 0 C 4 UNIT –I Introduction : What Is a Design Pattern?. Discussion of Creational Patterns. Factory Method. Memento. Interpreter. Strategy. A Parting Thought. 3. Discussion of Behavioral Patterns. Flyweight. How Design Patterns Solve Design Problems. Proxy. Template Method . User Operations Spelling Checking and Hyphenation. Pattern’s in JAVA Vol-I By Mark Grand . How to Use a Design Pattern. Supporting Multiple Look-and-Feel Standards. UNIT-VIII What to Expect from Design Patterns. Embellishing the User Interface. UNIT-IV Structural Pattern Part-I : Adapter. The Catalog of Design Patterns. Head First Design Patterns By Eric Freeman-Oreilly-spd 5. How to Select a Design Pattern. UNIT-III Creational Patterns : Abstract Factory.Tech.Page 92 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B.Wiley DreamTech. Bridge.Visitor. UNIT-VI Behavioral Patterns Part-I : Chain of Responsibility. UNIT-VII Behavioral Patterns Part-II : Mediator. 4. Command. Formatting.Pearson Education.

nos: 517 – 526. discriminant functions.IV) P 0 C 4 UNIT . maximum likelihood estimation. (Text book -2.580-581). Richard O. p.zero–one loss function. the design cycle.nos: 20-27. discriminant functions for the normal densitydifferent cases. p.Page 93 of 93 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA IV Year B. Second Edition. Lawerence Rabiner. Fundamentals of speech Recognition. continuous features – two categories classifications. 537 – 546). maximum likelihood estimates.nos: 1-17). David G. p.nos: 84-97).nos: 31-45. pattern recognition systems. p. compound Bayesian decision theory and context (Text book1. p. Bayesian estimation. Peter E. p. pattern recognition example. learning and adaptation (Text book-1. UNIT-VII Discrete Hidden Morkov Models : Introduction.51-54. (Text book-2. UNIT-IV Maximum likelihood and Bayesian parameter estimation : Introduction.62-63). training and testing with continuous HMMs. Steve Jost PHI 2004 93 . p. Hart.Tech.nos: 568-570. 2. Duda.573 – 576. minimum error-rate classification.nos: 321 – 344) UNIT-VIII Continuous hidden Markov models : Observation densities.nos: 348 – 352) TEXT BOOKS : 1. three basic problems for HMMs. UNIT-III Normal density : Univariate and multivariate density. Bayesian parameter estimation–Gaussian case (Text book-1. extensions to hidden Markov models. Low dimensional representations and multi dimensional scaling (Text book-1. Stroke. Richard John baugh. types of HMMs. p. UNIT-VI Component analyses : Principal component analysis. UNIT . Pattern classifications. K-means clustering. criteria function for clustering (Text book-1. application to normal mixtures.I Introduction : Machine perception. REFERENCE : 1. Wiley student edition. mixture densities and identifiability. Bayes decision theory – discrete features. classifiers.II Bayesian Decision Theory : Introduction. 29-31). and decision surfaces (Text book-1. Pattern Recognition and Image Analysis – Earl Gose. non-linear component analysis. IT II-Sem T 4+1* PATTERN RECOGNITION (ELECTIVE . Discrete–time markov process. Biing – Hwang Juang Pearson education. Date description and clustering – similarity measures. UNIT-V Un-supervised learning and clustering : Introduction.

Sign up to vote on this title
UsefulNot useful