Page 1 of 95

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD. B. TECH. COMPUTER SCIENCE AND ENGINEERING 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 Communications Skills Lab 3 4 IT Work-Shop 3 4 Total 25 15 56 _________________________________________________________________________________


Page 2 of 95

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD. B. TECH. COMPUTER SCIENCE AND ENGINEERING II Year COURSE STRUCTURE Code Subject T P C Probability and Statistics 4+1* 4 Mathematical Foundations of Computer Science 4+1* 4 Advanced Data Structures 4+1* 4 Digital Logic Design 4+1* 4 Managerial Economics and Financial Analysis 4+1* 4 UNIX and Shell Programming 4+1* 4 Advanced Data Structures Lab 3 2 UNIX and Shell Programming Lab 3 2 Total 30 6 28 __________________________________________________________________________________ II Year COURSE STRUCTURE Code Subject T P C __________________________________________________________________________________ Software Engineering 4+1* 4 Principles of Programming Languages 4+1* 4 Environmental Studies 4+1* 4 Computer Organization 4+1* 4 Data Base Management Systems 4+1 * 4 Object Oriented Programming 4+1 * 4 Object Oriented Programming Lab 3 2 Data Base Management Systems Lab 3 2 __________________________________________________________________________________ Total 30 6 28 __________________________________________________________________________________ II Semester I Semester


Page 3 of 95

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD. B. TECH. COMPUTER SCIENCE AND ENGINEERING III Year COURSE STRUCTURE Code Subject Formal Languages and Automata Theory Software Testing Methodologies Computer Graphics Microprocessors and Interfacing Data Communication Systems Design and Analysis of Algorithms Advanced English Communication Skills Lab Microprocessors and Interfacing Lab T P 4+1* 4+1* 4+1* 4+1* 4+1* 4+1* C 3 3 I Semester

4 4 4 4 4 4 2 2

Total 30 6 28 __________________________________________________________________________________ III Year COURSE STRUCTURE Code Subject T P C __________________________________________________________________________________ Operating Systems 4+1* 4 Compiler Design 4+1* 4 Computer Networks 4+1 * 4 Information Security 4+1 * 4 Artificial Intelligence and Neural Networks 4+1 * 4 Object Oriented Analysis and Design 4+1 * 4 Computer Networks and Case Tools Lab 3 2 Operating systems and Compiler Design Lab 3 2 Total 30 6 28 _________________________________________________________________________________ II Semester

B.2007-2008 Page 4 of 95 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD. TECH. COMPUTER SCIENCE AND ENGINEERING IV Year COURSE STRUCTURE Code Subject T P C __________________________________________________________________________________ Network Programming 4+1* 4 Web Technologies 4+1 * 4 Data Warehousing and Data Mining 4+1 * 4 Advanced Computer Architecture 4+1 * 4 ELECTIVE – I : Embedded Systems Mobile Computing Multimedia and Application Development 4+1 * 4 I Semester ELECTIVE – II : 4+1 * 4 Software Project Management Advanced Computing Concepts Network Management Systems Network Programming Lab 3 2 Web Technologies Lab 3 2 Total 30 6 28 __________________________________________________________________________________ .

2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD.Credits .Tutorial T . COMPUTER SCIENCE AND ENGINEERING IV Year COURSE STRUCTURE Page 5 of 95 II Semester Code Subject T P C __________________________________________________________________________________ Management Science 4+1* 4 ELECTIVE III : Image Processing E-Commerce Distributed Databases ELECTIVE – IV : Virtual Reality Human Computer Interaction Design Patterns Industry Oriented Mini Project Seminar Project Work Comprehensive Viva 4+1* 4 4+1 * - 4 - - 2 2 10 2 Total 15 28 __________________________________________________________________________________ Note : All End Examinations (Theory and Practical) are of three hours duration.Theory P . B.Practical C . TECH. * .

Tech CSE P 0 C 4 1. the syllabus has been designed to develop linguistic and communicative competence of Engineering students. OBJECTIVES: a. as also for supplementing the exercises with authentic materials of a similar kind for example. For example. The text for non-detailed study is for extensive reading/reading for pleasure by the students. Hence. b. it is suggested that they read it on their own with topics selected for discussion in the class. • 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. To develop the study skills and communication skills in formal and informal situations. 2. The prescribed books and the exercises are meant to serve broadly as students’ handbooks.) • Just A Minute(JAM) Sessions. To develop an awareness in the students about the significance of silent reading and comprehension. • Skimming the text • Understanding the gist of an argument • Identifying the topic sentence • Inferring lexical and contextual meaning . To equip the students to study academic subjects with greater facility through the theoretical and practical components of the English syllabus. from newspaper articles. advertisements. Reading Skills: Objectives 1. c. 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. To enable students to express themselves fluently and appropriately in social and professional contexts. to distinguish between them to mark stress and recognise and use the right intonation in sentences. SYLLABUS : Listening Skills: Objectives 1. the stress in this syllabus is on skill development and practice of language skills. writing. the focus should be on the skills of reading. However. 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.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD T 2+1* ENGLISH Page 6 of 95 I Year B. draw inferences etc. To make students aware of the role of speaking in English and its contribution to their success. the students should be encouraged to read the texts/selected paragraphs silently. The time should be utilized for working out the exercises given after each section . 2. To develop the ability of students to guess the meanings of words from context and grasp the overall message of the text. In the English classes. The teachers can ask comprehension questions to stimulate discussion and based on the discussions students can be made to write short paragraphs/essays etc.. To improve the language proficiency of the students in English with emphasis on LSRW skills. 3. 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. 2. promotional material etc. • Listening for general content • Listening to fill up information • Intensive listening • Listening for specific information Speaking Skills : Objectives 1. listening and speaking and for this the teachers should use the text prescribed for detailed study.

To develop an awareness in the students about writing as an exact and formal skill 2. are prescribed: For Detailed study 1. the following texts and course content. 2004. 2005. Inspiration from LEARNING ENGLISH: A Communicative Approach. 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.. Unit – VI 11..2004 Environment from LEARNING ENGLISH: A Communicative Approach. 2005.. Chapters 9-12 from Wings of Fire: An Autobiography – APJ Abdul Kalam. Ltd. Ltd. Abridged version with Exercises..2004. such as magazines/newspaper articles. Unit –II Chapters 1-4 from Wings of Fire: An Autobiography – APJ Abdul Kalam. Orient Longman. an abridged version with Exercises. Orient Longman. Orient Longman. Orient Longman. LEARNING ENGLISH: A Communicative Approach..2004 3.2004 Information Technology from LEARNING ENGLISH: A Communicative Approach. . Unit –IV 7. TEXTBOOKS PRESCRIBED: In order to improve the proficiency of the student in the acquisition of the four skills mentioned above. A. an abridged version with Exercises. an abridged version with Exercises. To equip them with the components of different forms of writing. Chapters 17-20 from Wings of Fire: An Autobiography – APJ Abdul Kalam. Hyderabad: Orient Longman.2004 Humour from LEARNING ENGLISH: A Communicative Approach. divided into Eight Units. Universities Press (India) Pvt. WINGS OF FIRE: An Autobiography – APJ Abdul Kalam. beginning with the lower order ones. 2006. 6. Universities Press (India) Pvt. Writing Skills : Objectives 1. 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.. Ltd. 10. 2005. Orient Longman.2007-2008 • Understanding discourse features • Recognizing coherence/sequencing of sentences Page 7 of 95 NOTE : The students will be trained in reading skills using the prescribed text for detailed study. an abridged version with Exercises. Chapters 13-16 from Wings of Fire: An Autobiography – APJ Abdul Kalam. from LEARNING ENGLISH: A Communicative Approach. 4. Orient Longman. Ltd. Ltd. 8. Universities Press (India) Pvt. 2005. STUDY MATERIAL: Unit –I 1. an abridged version with Exercises. Universities Press (India) Pvt. 2.. Chapters 5-8 from Wings of Fire: An Autobiography – APJ Abdul Kalam. Unit –V 9. Human Interest 2005. Universities Press (India) Pvt. (Six Selected Lessons) For Non-detailed study 2. Universities Press (India) Pvt. 2005. Astronomy from LEARNING ENGLISH: A Communicative Approach. Unit –III 5.

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

A text Book of Engineering Mathematics. Newton’s Law of cooling. TEXT BOOKS: 1. Sin ax. Shahnaz Bathul. Raman. Wiley India Pvt. 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. A text Book of Engineering Mathematics.Maxima and Minima of functions of two variables with constraints and without constraints UNIT – IV Radius. A text Book of Engineering Mathematics. e ax V(x). G. Iyengar. Centre and Circle of Curvature – Evolutes and Envelopes Curve tracing – Cartesian .2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD T 3+1* MATHEMATICS – I Page 9 of 95 I Year B. B. Advanced Engineering Mathematics.Differentiation and integration of transforms-Application of Laplace transforms to ordinary differential equations Partial fractions-Heaviside’s Partial fraction expansion theorem. P. Deepthi Publications. volumes and surface areas in Cartesian and polar coordinates multiple integrals . Vol-1 T. Ltd.products. Thamson Book Collection. Sankaraiah. S. A text Book of Engineering Mathematics. orthogonal trajectories. polynomials in x.Line integral – work done – Potential function – areasurface and volume integrals Vector integral theorems: Green’s theorem-Stoke’s and Gauss’s Divergence Theorem (With out proof). 2. REFERENCES: 1. 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. Krishna Gandhi and Others. Irvin Kreyszig. cos ax. Transforms of derivatives and integrals – Unit step function – second shifting theorem – Dirac’s delta function – Convolution theorem – Periodic function . V. UNIT – VIII Laplace transform of standard functions – Inverse transform – first shifting Theorem. K.Laplacian and second order operators.Stoke’s and Gauss’s Theorems. 3. S. 3. Book Links. Chand & Company. Tata Mc Graw Hill. V. Law of natural growth and decay. Applications to UNIT – II Non-homogeneous linear differential equations of second and higher order with constant coefficients with RHS term of the type e ax . Vector Integration . C.Jacobian. . method of variation of parameters. linear and Bernoulli. 4. polar and Parametric curves. Tech CSE P 0 C 6 UNIT – I Differential equations of first order and first degree – exact. Narasimhulu & N. 2.Divergence.double and triple integrals – change of variables – change of order of integration. A text Book of Engineering Mathematics. UNIT – V Applications of integration to lengths. Y. Prabhakar Rao. V. xV(x). Verification of Green’s . A text Book of Engineering Mathematics. Nageshwara Rao.Curl and their related properties of sums. B. Right Publishers.

Tata Mc Graw Hill. Iyengar.symmetric. 2. B. S. Sankaraiah. orthogonal. A text Book of Engineering Mathematics. Aitkinson & Han. V. 3. Chand & Company. Skew-Hermitian and Unitary – Eigen values and eigen vectors of complex matrices and their properties. V. K. G.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY T 3+1* MATHEMATICAL METHODS Page 10 of 95 I Year B. Fourier integral theorem (only statement)– Fourier sine and cosine integrals. New Age International Publishers. Fourier transform – Fourier sine and cosine transforms – properties – inverse transforms – Finite Fourier transforms.LU Decomposition. Jain. Ravindranath.Moulton Method –Milne’s Method. Wiley India Pvt. Krishna Gandhi and Others. Shahnaz Bathul. Method of separation of variables. Himalaya Publishers. Book Links. Calculation of powers of matrix – Modal and spectral matrices.semi definite . eigen vectors – properties – Cayley-Hamilton Theorem . S. Raman.Sylvester law. C. Elementary Numerical Analysis.Reduction of quadratic form to canonical form – Rank .Positive. 4. Jain. Vijayalaxmi.properties – Damping rule – Shifting rule – Initial and final value theorems. Normal form – Solution of Linear Systems – Direct Methods.index . 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 MethodsAdams. T. 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. Irvin Kreyszig. UNIT – IV . 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. References: 1. Wiely India. Right Publisshers. 4. UNIT – V Curve fitting: Fitting a straight line –Second degree curve-exponentional curve-power curve by method of least squares. skew . A text book of Mathematical Methods. K. Numerical Differentiation and Integration– Trapezoidal rule – Simpson’s 1/3 Rule – Simpson’s 3/8 Rule. Mathematical Methods. Advanced Engineering Mathematics.LU Decomposition from Gauss Elimination –Solution of Tridiagonal Systems-Solution of Linear Systems UNIT – II Eigen values. Mathematical Methods. 2. Text Books: 1. 3. Ltd. Interpolation: Introduction. Solution of Algebraic and Transcendental Equations: Introduction – The Bisection Method – The Method of False Position – The Iteration Method – Newton-Raphson Method. K. Convolution theorem – Solution of difference equation by z-transforms. A text book of Mathematical Methods. S.Inverse and powers of a matrix by Cayley-Hamilton theorem – Diagonolization of matrix. Tech CSE P 0 C 6 UNIT – I Matrices and Linear systems of equations: Elementary row transformations-Rank-Echelon form. negative definite . UNIT – III Real matrices – Symmetric. Complex matrices: Hermitian. R.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. Numerical Methods for Scientific and Engineering Computation. Iyengar & R. B. Linear Transformation – Orthogonal Transformation. V.Errors in Polynomial Interpolation – Finite differences. K. A. 3rd Edition. 2006 . V. M. Quadratic forms. z-transform – inverse z-transform .signature .

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

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

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

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

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

2004.Rico. 2005.2007-2008 REFERENCES : Page 16 of 95 1.Ltd 2006 . Tata McGraw Hill..Burns and P. Electronic Devices and Circuits.. Pearson Education. Galgotia Publications. 2nd Edition.S. 2. J.R.Prof GS N Raju I K International Publishing House Pvt .G. 5. 1988.Beasley and G. Publications.Bond. 6th edition. 4. 2nd Edn. B. 1998.F. Bogart Jr.S. Electronic Devices and Circuits – Dr. 3. Electronic Devices and Circuits – T. Principles of Electronic Circuits – S. Lal Kishore. K.. Microelectronics – Millman and Grabel.

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

ii) To find the GCD (greatest common divisor) of two given integers. Week 8 a) Write a C program to generate Pascal’s triangle. 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. 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.-.*. performs the operation and then prints the result. Week 4 a) The total distance travelled by vehicle in ‘t’ seconds is given by distance = ut+1/2at 2 where ‘u’ and 2 ‘a’ are the initial velocity (m/sec. Write a C program to generate the first n terms of the sequence. ii) To delete n Characters from a given position in a given string.) and acceleration (m/sec ). which takes two integer operands and one operator form the user. /. 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. Write C program to find the distance travelled at regular intervals of time given the values of ‘u’ and ‘a’. c) Write a C program to generate all the prime numbers between 1 and n. or – 1 if S doesn’t contain T. Week 2. (Consider the operators +. • 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. Week 3 a) Write C programs that use both recursive and non-recursive functions i) To find the factorial of a given integer. iii) To solve Towers of Hanoi problem. trees and graphs. stacks. b) Write a C program to count the lines. b) Write a C program to construct a pyramid of numbers. Tech CSE JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD T 0 COMPUTER PROGRAMMING LAB P 3 C 4 Objectives: • To make the student learn a programming language. words and characters in a given text. queues. a) Write a C program to find the sum of individual digits of a positive integer. b) Write a C program. Subsequent terms are found by adding the preceding two terms in 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. where n is a value supplied by the user.2007-2008 Page 18 of 95 I Year B. 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’. 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.

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 . test for them too. then the program computes 1+5+25+125. b) Write a C program to convert a Roman numeral to its decimal equivalent. (Note: The file name and n are specified on the command line.: 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. Thus 2’s complement of 11100 is 00100.: 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. and then compute the sum of this geometric progression: 1+x+x2+x3+…………. 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. x and n.) Week 12 a) Write a C program which copies one file to another. Are any values of x also illegal ? If so. For example.+xn For example: if n is 3 and x is 5. 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. Print x.) Week 13 Write a C program that uses functions to perform the following operations on singly linked list. then go back and read in the next pair of numbers of without computing the sum.2007-2008 Page 19 of 95 Week 9 Write a C program to read in two numbers. the sum Perform error checking. the formula does not make sense for negative exponents – if n is less than 0. n. Have your program print an error message if n<0. inorder and postorder. b) Write a C program to reverse the first n characters in a file.

Gregory forward interpolation. Third Edition. Forouzan 3. Week 24 Write C programs to implement Trapezoidal and Simpson methods.A. Gilberg and B. BS Publications 2. P.F. E Balaguruswamy.Press. P. Data Structures: A pseudo code approach with C. TMH publications. C and Data Structures. Text Books 1. Oxford Univ.Dey & M. C programming and Data Structures. Padmanabham. Ghosh. Week 23 Write C programs to implement the linear regression and polynomial regression algorithms. 4. Programming in C. .2007-2008 Page 20 of 95 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. second edition R.

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

report writing. and rhythm. To help the students cultivate the habit of reading passages from the computer monitor. a T. SYLLABUS : The following course content is prescribed for the English Language Laboratory sessions: 1. GMAT etc. intonation. 2. To enable them to learn better pronunciation through stress on word accent. Grammar. To train them to use language effectively to face interviews. 6. Diphthongs & Consonants. Minimum Requirement: The English Language Lab shall have two parts: i) The Computer aided Language Lab for 60 students with 60 systems. Composition • Dorling Kindersley series of Grammar. 10. 7th Edition • Learning to Speak English . format-making etc. Punctuation. System Requirement ( Hardware component): Computer network with Lan with minimum 60 multimedia systems with the following specifications: i) P – IV Processor a) Speed – 2. Information Transfer 8. public speaking. Telephoning Skills. Cambridge with CD English in Mind.study by learners. 4. Debate 9. Foundation Books Pvt Ltd with CD.A System.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. TOEFL. • The Rosetta Stone English Library • Clarity Pronunciation Power – Part I • Mastering English in Vocabulary. Spellings. Objectives: 1. To initiate them into greater use of the computer in resume preparation. Introduction to Stress and Intonation. Cambridge .Prepared and Extempore.4 CDs • Microsoft Encarta with CD • Murphy’s English Grammar. 3. Herbert Puchta and Jeff Stranks with Meredith Levy. group discussions. thus providing them with the required facility to face computer-based competitive exams such GRE. V. LAN facility and English language software for self. To expose the students to a variety of self-instructional.. 5. Giving Directions. 7. ‘Just A Minute’ Sessions (JAM). learner-friendly modes of language learning. Introduction to the Sounds of English.Vowels. Oral Presentations. Tech CSE 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. 5. 3. Describing Objects / Situations / People. 4.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD T 0 ENGLISH LANGUAGE COMMUNICATION SKILLS LAB Page 22 of 95 I Year B. one master console. Composition etc. Oxford Advanced Learner’s Compass. a digital stereo –audio & video system and camcorder etc. ii) The Communication Skills Lab with movable chairs and audio-visual aids with a P. • Language in Use. 2. Situational Dialogues / Role Play.

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

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

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


Page 26 of 95

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


Page 27 of 95

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


Page 28 of 95

P 0

C 4

UNIT-I Mathematical Logic : Statements and notations, Connectives, Well formed formulas, Truth Tables, tautology, equivalence implication, Normal forms. UNIT-II Predicates : Predicative logic, Free & Bound variables, Rules of inference, Consistency, proof of contradiction, Automatic Theorem Proving. UNIT-III Set Theory : Properties of binary Relations, equivalence, compatibility and partial ordering relations, Hasse diagram. Functions: Inverse Function Comports of functions, recursive Functions, Lattice and its Properties, Pigeon hole principles and its application. UNIT-IV Algebraic structures : Algebraic systems Examples and general properties, Semi groups and monads, groups sub groups’ homomorphism, Isomorphism. UNIT-V Elementary Combinatorics: Basis of counting, Combinations & Permutations, with repetitions, Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the principles of Inclusion – Exclusion. UNIT-VI Recurrence Relation : Generating Functions, Function of Sequences Calculating Coefficient of generating function, Recurrence relations, Solving recurrence relation by substitution and Generating funds. Characteristics roots solution of In homogeneous Recurrence Relation. UNIT-VII Graph Theory : Representation of Graph, DFS, BFS, Spanning Trees, planar Graphs UNIT-VIII Graph Theory and Applications, Basic Concepts Isomorphism and Sub graphs, Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers

TEXT BOOKS : 1. Discrete and Combinational Mathematics- An Applied Introduction-5th Edition – Ralph. P.Grimaldi.Pearson Education 2. Discrete Mathematical Structures with applications to computer science Trembly J.P. & Manohar .P, TMH 3.Discrete Mathematics and its Applications, Kenneth H. Rosen, Fifth Edition.TMH. REFERENCES : 1. Discrete Mathematics with Applications, Thomas Koshy, Elsevier 2. Discrete Mathematical Structures, Bernand Kolman, Roberty C. Busby, Sharn Cutter Ross, Pearson Education/PHI. 3. Discrete Mathematical structures Theory and application-Malik & Sen 4. Discrete Mathematics for Computer science, Garry Haggard and others, Thomson. 5. Discrete Mathematics for Computer Scientists & Mathematicians, J.L. Mott, A. Kandel, T.P. Baker Prentice Hall. 6. Logic and Discrete Mathematics, Grass Man & Trembley, Person Education.

insertion. Data structures using C and C++. Insertion and Deletion. Realizing a Priority Queue using Heaps. friend functions. base class access control.Savitch. Implementation. Data structures. quadratic probing. abstract classes. R. Michael T.The list ADT.time complexity and space complexity. hash table representation. John Wiley and Sons. B-Trees. Definition. Ltd. Augenstein and Tanenbaum. Langsam. base and derived classes. Thomson 3. TEXT BOOKS : 1. Stack ADT. open addressing-linear probing. Compressed Tries. Definition. W. 4.Goodrich. Constructors and destructors.Model for external sorting. parameter passing methods. Data structures and Algorithm Analysis in C++. REFERENCES : 1. B-Tree of order m. Data structures and Algorithms in C++. Queue ADT. Inheritance basics. Implementation using template classes in C++. PHI. Inline functions. Operations.Function and class templates. Algorithms and Applications in C++. linear list representation. The OOP. . 2.Ltd. Definition. ADT. Generic Programming. double hashing. the Boyer –Moore algorithm. height of a B-Tree. Multiway merge. Class Scope. Ltd. Wiley student edition. Class Members.Class Definition. hash functions. Pearson Education. 2. Operator Overloading. Height of an AVL Tree. exception handling. Fourth edition. Polyphase merge. Unit V : Priority Queues – Definition.2007-2008 Page 29 of 95 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B. streams I/O. Deletion and Searching Unit VII : Search trees (prt II) : Introduction to Red –Black and Splay Trees. this pointer. comparison of hashing and skip lists. performance analysis. Review of basic data structures. Access Control. the Knuth-Morris-Pratt algorithm. deletion and searching. Second Edition. static class members. Universities Press Orient Longman Pvt. Deletion. Problem solving with C++. dynamic memory allocation and deallocation (new and delete). inheritance types. Data structures and algorithms in C++. Unit IV : Dictionaries.. deletion and searching. collision resolution-separate chaining. Unit VI : Search Trees (Part1):Binary Search Trees. Comparison of Search Trees Unit VIII : Pattern matching and Tries : Pattern matching algorithms-Brute force. Objects. Unit II : Function Over Loading.Tamassia and . runtime polymorphism using virtual functions.Mount. insertion. Suffix tries. CSE . S.Tech. External Sorting. University Press (India) Pvt. Pearson education. Mark Allen Weiss. rehashing. 3rd Edition. operations insertion. Unit III : Algorithms. extendible hashing. 2nd edition. skip list representation.I Sem T 4+1* ADVANCED DATA STRUCTURES P 0 C 4 Unit I : C++ Class Overview. ADT. Adam Drozdek. Standard Tries.Sahni.Searching. Operations – Insertion. AVL Trees.

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

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

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

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

2. The Complete Reference Unix. PHI. Farber. Graham Glass. . Unix programming environment. Unix for programmers and users. Host. Klee. / Pearson Education 3.2007-2008 Page 34 of 95 REFERENCES : 1. Kernighan and Pike. Pearson Education. King Ables. 3rd edition. Rosen. Rosinski. TMH. Second Edition.

. b) Delete an element from a binary search tree. a) Stack ADT b) Queue ADT Week2 : Write C++ programs to implement the following using a singly linked list. Adam Drozdek.Tech. Page 35 of 95 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 • C++ compiler and STL Recommended Week1 : C++ programs to implement the following using an array.I Sem T 0 ADVANCED DATA STRUCTURES LAB Objectives: • To make the student learn a object oriented way of solving problems. Week7 : Write C++ programs for implementing the following sorting methods: a) Merge sort b) Heap sort Week8 : Write a C++ program to perform the following operations a) Insertion into a B-tree b) Deletion from a B-tree Week9 : . CSE . Week5 : .Pratt pattern matching algorithm. Data Structures and Algorithms in C++. Week 4 : Write a C++ program to perform the following operations: a) Insert an element into a binary search tree. c) Search for a key element in a binary search tree. a) Stack ADT b) Queue ADT Week3 : Write C++ programs to implement the deque (double ended queue) ADT using a doubly linked list and an array. Week12 : Write a C++ program for implementing Boyer – Moore Patten matching algorithm (Note: Use Class Templates in the above Programs) TEXT BOOKS : 1.Write C++ programs that use non-recursive functions to traverse the given binary tree in a) Preorder b) inorder and c) postorder.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B. Thomson. • To make the student write ADTS for all data structures. Week11 : Write a C++ program for implementing Knuth-Morris. Third Edition.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 all the functions of a dictionary (ADT) using hashing. Week6 : Write C++ programs for the implementation of bfs and dfs for a given graph.

Data Structures using C++. D.S. Thomson Page 36 of 95 .2007-2008 2. Malik.

Tech. d)Use the vi command to correct any errors in the file.27 6830 Sita 36.86 c)Use the cat command to display the file.15 1450 Raju 21. Use the more command to see the contents of myfile1. d)Use the who command and redirect the result to a file called myfile1. mytable i)Logout of the system.I Sem T 0 UNIX AND SHELL PROGRAMMING LAB Objectives: • To teach students various unix utilities and shell scripting Page 37 of 95 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 Session-1 a)Log into the system b)Use vi editor to create a file called myfile. mytable.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B. 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. 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. Use the more command to check the contents of myfile2. .txt which contains some text. 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.65 4320 Ramu 26. e)Use the sort command to sort the file mytable according to the first field. c)Write a sed command that swaps the first and second words in each line in a file. 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. c)correct typing errors during creation. b)Write a sed command that deletes the character before the last character in each line in a file. Call it mytable use tabs to separate the fields. CSE . mytable. 2) a)Write a sed command that deletes the first character in each line in a file. Call it my table (same name) h)Print the new file. 1425 Ravi 15.

Week8 a)Write an interactive file-handling shell program. 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. new name and so on. provided they exist in the current directory. such as the file name. have the program ask the user for the necessary information. b)Write a shell script that deletes all lines containing a specified word in one or more files supplied as arguments to it. c)Write a shell script to perform the following string operations: i)To extract a sub-string from a given string. 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. write and execute permissions. write and execute permissions iv)Time of last access (Note : Use stat/fstat system calls) Week11 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) . removing.2007-2008 Page 38 of 95 Week4 a)Pipe your /etc/passwd file to awk. Once the user has made a choice. Week9 a)Write a shell script that displays a list of all the files in the current directory to which the user has read. c)Write a shell script that determines the period for which a specified user is working on the system. 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. a file. 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. b)Develop an interactive grep script that asks for a word and a file name and then tells how many lines contain that word. 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. 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. 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. renaming. and print out the home directory of each user. or something else. ii)To find the length of a given string. If they are same then second file should be deleted. It should check whether the two file contents are same or not. or linking files. b)Write a shell script that accepts one or more file name as arguments and converts all of them to uppercase. 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. Let it offer the user the choice of copying.

Sumitabha Das. . Gaham Glass & K. Forouzan & R. Venkatesh Murthy. 5)Beginning shell scripting. 4)Unix and shell Programming –A text book. 3rd edition.G. E. Foster – Johnson & other. Pearson Education. 2)Unix concepts and applications. Wile Y. TMH.India. pearson education.2007-2008 TEXT BOOKS Page 39 of 95 1)Introduction to UNIX & SHELL programming. B. Thomson.A. Ables. M.F. Fourth Edition. 3)Unix for programmers and users. Giberg.

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

functional Programming . Programming Languages Design and Implementation – Pratt and Zelkowitz. exception Propagation. semaphores. UNIT IV : Expressions and Statements: Arithmetic relational and Boolean expressions. monitors. Design issues of subprograms and operations. UNIT III : Data types: Introduction. language examples.. Wiley Dreamtech 4. Programming in PROLOG Clocksin. C++. Exception handler in Ada. array. overloaded sub-programs. basic elements of prolog. design and implementation uses related to these types. union. Unconditional Statements. Selection. Concepts of Programming Languages Robert . Language categories. Variable. Second Edition. influences on Language design. Haskell. UNIT VII : Exception handling : Exceptions. Springer . application of Functional Programming Languages and comparison of functional and imperative Languages. user defined. EBNF for common programming languages features. 5. attribute grammars. parse trees. parameter passing methods. fundamentals of FPL. Logic Programming. character. Object Oriented. generic sub-programs. Short circuit evaluation mixed mode assignment.W. Java threads. type compatibility. UNIT VI : Abstract Data types: Abstractions and encapsulation. LISP. application of logic programming. Compound Statements. Iteration. Programming Paradigms – Imperative. 2. concept of binding. TEXT BOOKS : 1. Control Structures – Statement Level. introductions to data abstraction. object oriented programming in small talk. denotational semantics and axiomatic semantics for common programming language features. Assignment Statements. Logic Programming Language : Introduction and overview of logic programming. Thomson. UNIT VIII : Functional Programming Languages: Introduction. guarded commands. Programming languages –Ghezzi. Programming Languages –Louden. Ada 95 Concurrency: Subprogram level concurrency. type checking. local referencing environments. CSE -II Sem T 4+1* PRINCIPLES OF PROGRAMMING LANGUAGES P 0 C 4 UNIT I : Preliminary Concepts: Reasons for studying. primitive. UNIT II : Syntax and Semantics: general Problem of describing Syntax and Semantics.2007-2008 Page 41 of 95 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B. massage passing. Programming Language Implementation – Compilation and Virtual Machines. pointer and reference types. formal methods of describing syntax . strong typing. associative. Sebesta 6/e. Java. Pearson Education. REFERENCES : 1. John Wiley 2. Programming domains. 3/e. C++ parameterized ADT. LISP Patric Henry Winston and Paul Horn Pearson Education. Scope and lifetime of variable. ML. UNIT-V: Subprograms and Blocks: Fundamentals of sub-programs. Names. Language Evaluation Criteria. concepts of programming languages. record. C++ and Java. C# threads.BNF. C#. static and dynamic scope. design issues. design issues for functions user defined overloaded operators.Tech. Programming languages –Watt. variable initialization. co routines. Fourth Edition PHI/Pearson Education 3. programming environments. ambiguous grammars. parameters that are sub-program names. named constants.

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

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

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


Page 45 of 95

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B.Tech. CSE -II Sem T P C 4+1* 0 4 DATA BASE MANAGEMENT SYSTEMS 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 serializabilityLock –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


Page 46 of 95

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


Java; the complete reference, 7th editon, Herbert schildt, TMH. Understanding OOP with Java, updated edition, T. Budd, pearson eduction.


Page 47 of 95

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

Week 8 : a) Write a Java program for handling mouse events.util) Week 3 : a) Write a Java program that checks whether a given string is a palindrome or not. If the discriminant b2 -4ac is negative. Week 7 : Write a Java program that works as a simple calculator. • To teach the student to write programs in Java to solve the problems Recommended Systems/Software Requirements: • • Page 48 of 95 P 3 C 2 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. Ex: MADAM is a palindrome.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B. c) Write a Java program to make frequency count of words in a given text. then displays information about whether the file exists. First thread displays “Good Morning” every one second. Week 5 : a) Write a Java program that: i) Implements stack ADT. Week 4 : a) Write a Java program that reads a file name from the user. with a line number before each line. c) Write a Java Program that reads a line of integers. c) Write a Java program that displays the number of characters. b) Develop an applet that receives an integer in one text field. 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. c and use the quadratic formula. % operations. Use a grid layout to arrange buttons for the digits and for the +. display a message stating that there are no real solutions.Tech. Read in a. the second thread displays “Hello” every two seconds and the third thread displays “Welcome” every three seconds. 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 that reads a file and displays the file on the screen. b) Write a Java program to multiply two given matrices. and computes its factorial Value and returns it in another text field. -. and then displays each integer. whether the file is writable. b. Every subsequent value is the sum of the two values preceding it. whether the file is readable. . Add a text field to display the result. CSE -II Sem T 0 OBJECT ORIENTED PROGRAMMING LAB Objectives: • To make the student learn a object oriented way of solving problems. b) Write a Java program for sorting a given list of names in ascending order. b) The Fibonacci sequence is defined by the following rule: The fist two values in the sequence are 1 and 1. Week 9 : a) Write a Java program that creates three threads. Recommended Week1 : a) Write a Java program that prints all real solutions to the quadratic equation ax2 + bx + c = 0. when the button named “Compute” is clicked. Write a Java program that uses both recursive and non recursive functions to print the nth value in the Fibonacci sequence. and the sum of all the integers (Use StringTokenizer class of java. the type of file and the length of the file in bytes. lines and words in a text file.

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

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

2. derivation trees. UNIT VIII Computability Theory : Chomsky hierarchy of languages. Conversions and Equivalence : Equivalence between NFA with and without Î transitions. Equivalence of CFL and PDA. Cohen. regular expressions. Daniel I. Definition of P and NP problems. & Papadimition C. Alphabet. Constructing finite Automata for a given regular expressions. Language. Chomsky normal form. acceptance of CFL. UNIT VI : Push Down Automata : Push down automata. recursively enumerable languages. 4 Theory of Computer Science – Automata languages and computation -Mishra and Chandrashekaran. Pumping Lemma for Context Free Languages. model. decidability of. Introduction to Computer Theory. UNIT VII : Turing Machine : Turing Machine. • Comprehend the hierarchy of problems arising in the computer sciences.P. PHI . acceptance of strings.John C Martin.E. LR(0) grammar. interconversion. Pumping lemma of regular sets. deterministic finite automaton and non deterministic finite automaton. definition. model. Universal Turing Machine. Pearson Education 2. • Classify machines by their power to recognize languages. types of Turing machines (proofs not required). undecidability of posts. Turing reducibility. definition. minimisation of FSM. Computable functions. Finite state machine. Enumeration of properties of CFL (proofs omitted).A. Introduction to Theory of Computation –Sipser 2nd edition Thomson REFERENCES : 1.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III Year B. and Ullman J. 2nd edition. Context free grammar. Correspondence problem. • Employ finite state machines to solve problems in computing. “Introduction to Automata Theory Languages and Computation”. Pearson /PHI. “Elements of Theory of Computation”. NFA to DFA conversion. UNIT II : Finite Automata : NFA with Î transitions .Moore and Melay machines. definitions. UNIT IV : Grammar Formalism : Regular grammars-right linear and left linear grammars. UNIT I : Fundamentals : Strings. Minimisation of Context Free Grammars. UNIT V : Context Free Grammars : Ambiguity in context free grammars. D. Introduction to languages and the Theory of Computation . Church’s hypothesis. problems. transition diagrams and Language recognizers. and languages. closure properties of regular sets (proofs not required). sentential forms. UNIT III : Regular Languages : Regular sets. linear bounded automata and context sensitive language.H. John Wiley. finite automaton model. counter machine. design of TM. NP complete and NP hard problems.Significance. identity rules. Introduction to DCFL and DPDA. Operations. inter conversion. Acceptance by final state and acceptance by empty state and its equivalence. Lewis H. Right most and leftmost derivation of strings. Finite Automata with output. Greiback normal form. • Explain deterministic and non-deterministic machines. equivalence between regular linear grammar and FA. equivalence between two FSM’s. acceptance of languages. TMH 3. Hopcroft H. (Proofs not required). TEXT BOOKS : 1. CSE -I Sem T 4+1* FORMAL LANGUAGES AND AUTOMATA THEORY Page 51 of 95 P 0 C 4 The purpose of this course is to acquaint the student with an overview of the theoretical foundations of computer science from the perspective of formal languages.Tech. Conversion of Finite Automata to Regular expressions.

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

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

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

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

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

5.disjoint set operations. Introduction to Algorithms.S. UNIT V : Dynamic Programming: General method. Cook’s theorem. secondedition. applications-Job sequencing with dead lines. Algorithm Design: Foundations. Merge sort. union and find algorithms.Rivest.John wiley and sons.Satraj Sahni and Rajasekharam. Time complexity. UNIT VIII : NP-Hard and NP-Complete problems: Basic concepts.Travelling sales person problem. 4.Stein.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III Year B. Quick sort. Allen Weiss. 3.Galgotia publications pvt.Goodrich and R.0/1 knapsack problem. Amortized analysis.Tseng. Mc Graw Hill.Chang and T. All pairs shortest path problem. Omega notation.T. Algorithms – Richard Johnson baugh and Marcus Schaefer. connected components and biconnected components.Tech. non deterministic algorithms. sum of subsets problem. 2. Hamiltonian cycles.E. graph coloring. Optimal binary search trees. M.Cormen. UNIT VII : Branch and Bound: General method.L. CSE -I Sem T 4+1* DESIGN AND ANALYSIS OF ALGORITHMS Page 57 of 95 P 0 C 4 UNIT I : Introduction: Algorithm. Introduction to Design and Analysis of Algorithms A strategic approach.C.Pearson education.Hard and NPComplete classes. UNIT VI : Backtracking: General method.C. 0/1 knapsack problem.Psuedo code for expressing algorithms.Performance Analysis-Space complexity.Tomassia.Probabilistic analysis. FIFO Branch and Bound solution./ Pearson Education 2. Second edition. R. Fundamentals of Computer Algorithms. TEXT BOOKS : 1. Data structures and Algorithm Analysis in C++. Aho. spanning trees. Pearson education. applications-Matrix chain multiplication. Ltd. Ellis Horowitz. Strassen’s matrix multiplication. NP . Pearson Education .Big oh notation. UNIT II : Disjoint Sets. UNIT IV : Greedy method: General method.T. S. 0/1 knapsack problem.and C. applications-Binary search. Asymptotic Notation.C. R. REFERENCES : 1.T.Lee.Travelling sales person problem. UNIT III : Divide and conquer: General method . Single source shortest path problem. Ullman and Hopcroft. Ltd.Tsai. R. Theta notation and Little oh notation. Reliability design. applications-n-queen problem. applications .LC Branch and Bound solution. Analysis and Internet examples. Design and Analysis of algorithms.H.Leiserson. Minimum cost spanning trees.PHI Pvt.

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

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

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

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

Modern Compiler Implementation in C. Preprocessing steps required for predictive parsing. LR and LALR parsing.2007-2008 Page 62 of 95 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III Year B.Ullman. Scope of Optimization. organization for block structures languages.V. UNIT – VII Data flow analysis : Flow graph.Dick Grune. Levine. UNIT – III Bottom up parsing : Shift Reduce parsing. Conversion of popular Programming languages language Constructs into Intermediate code forms. Pearson Education. pass and Phases of translation. J. 3. data flow equation. Modern Compiler Design. interpretation. YACC – automatic parser generator. Top down parsing – Backtracking. bootstrapping.D. lex &yacc – John R. H. TEXT BOOKS : 1. tree structures representation of scope information. folding. Jacobs. data structures in compilation – LEX lexical analyzer generator. frequency reduction. UNIT – V Symbol Tables : Symbol table format. UNIT – II Top down Parsing : Context free grammars. REFERENCES : 1. register allocation and assignment generic code generation algorithms. LL (1). Error recovery in parsing .Andrew N. Compiler Construction. Principles of compiler design -A. UNIT – IV Semantic analysis : Intermediate forms of source Programs – abstract syntax tree. Regular Grammar and regular expression for common programming language features. DAG for register allocation. Aho . Elsevier. Bal. Tony Mason. loop optimization. machine dependent code optimization. Predictive parsing. Attributed grammars. Block structures and non block structure storage allocation: static. O’reilly 2. Cariel T. Wiley dreamtech. Cambridge University Press. polish notation and three address codes. handling ambiguous grammar. Doug Brown. Henry E. local optimization. Copy propagation. CSE -II Sem T P C 4+1* 0 4 COMPILER DESIGN UNIT – I Overview of Compilation: Phases of Compilation – Lexical Analysis. Induction variable elements. . Live variable analysis. strings and records.Tech. DAG representation. Runtime stack and heap storage allocation. UNIT – VIII Object code generation : Object code forms. Engineering a Compiler-Cooper & Linda. global optimization. 2. Appel. 4. UNIT – VI Code optimization : Consideration for Optimization. redundant sub expression elimination. recursive descent parsing. hashing. Syntax directed translation. Thomson. Louden. storage allocation for arrays. Type checker.

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

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

V Characteristics of Neural Networks.IV First order logic. Associative Memory. uniformed search strategies – Breadth first search. 3rd Edition. TEXT BOOKS : 1. PHI REFERENCES : 1. Artificial Intelligence . Peter Norvig.III Knowledge Representation & Reasons logical Agents.Knight (TMH). Resolution. UNIT . Artificial Neural Networks: Terminology. A* search Game Playing: Adversial search. Basic Learning Laws. Models of Neuron.II Searching : Searching for solutions. foundation of AI and history of AI intelligent agents: Agents and Environments. the Wumpus world. 2nd Edition. depth first Search. PHI/ Pearson Education. Chaining. Ivan Bratka. Resolution patterns in propos ional logic. . Resolution.Third Edition – Pearson Education.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III Year B. first order inference. Analysis of pattern Association Networks. minimax. Analysis of Feature Mapping Networks. 2. Patrick Henry Winston. Analysis of Pattern Clustering Networks. Inference in first order logic. cutting of search. logic.VII Feedback Neural Networks Introduction. UNIT . Artificial Neural Networks B. Forward & Backward. Analysis of Pattern Storage Networks.the concept of rationality. Pearson Edition. Backward chaining. Search with partial information (Heuristic search) Greedy best first search. UNIT . propositional Vs. Giarrantana/ Riley. Artificial Intelligence.VI Feedforward Neural Networks: Introduction. problem solving agents.VIII Competitive Learning Neural Networks & Complex pattern Recognition Introduction. problemformulation. algorithm. Analysis of Pattern Mapping Networks. PROLOG Programming for Artificial Intelligence. Analysis of Linear Autoassociative FF Networks.Tech. Thomson. Artificial Intelligence – A Modern Approach. the nature of environments. UNIT . Yagna Narayana. Evaluation functions. 3.Fourth Edn. Expert Systems: Principles and Programming. UNIT . unification & lifts forward chaining. Stuart Russel. UNIT . 5. Topology.Rich and K. CSE -II Sem T 4+1* ARTIFICIAL INTELLIGENCE AND NEURAL NETWORKS Page 65 of 95 P 0 C 4 UNIT . Pattern Recognition Problem. 2. Games. Knowledge – Based Agents.Neural Networks Simon Haykin PHI 6. Basic Functional Units.I Introduction : AI problems. Pattern Recognition Tasks by the Functional Units. Historical Development of Neural Networks Principles. AlphaBeta pruning. propositional logic. 4. structure of agents. E. UNIT .. Analysis of Pattern Classification Networks. optimal decisions in multiplayer games. Artificial Intelligence and Expert Systems – Patterson PHI. Second Edition. Analysis of pattern storage Networks.

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

design. 6. logical view.A 1. Now obtain Routing table art each node using distance vector routing algorithm 5. Write a program to break the above DES coding 8. Implement on a data set of characters the three CRC polynomials – CRC 12. otherwise the mini project will not be evaluated. 4. Deployment view. Take an example subnet of hosts .B 1. 2. 2.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III Year B. Part . Take an example subnet graph with weights indicating delay between nodes. Implement the data link layer framing methods such as character. component view. documentation. coding.Tech. Some of the ideas regarding case studies are given in reference books which were mentioned in theory syllabus can be referred for some idea. The student should take up the case study of Unified Library application which is mentioned in the theory. forward and Reverse Engineering. Database design. Take a 64 bit playing text and encrypt the same using DES algorithm .e Use case view. Obtain broadcast tree for it. 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. • . Implement Dijkstra ‘s algorithm to compute the Shortest path thru a graph. CSE -II Sem T 0 COMPUTER NETRWORKS AND CASE TOOLS LAB Objective: Page 67 of 95 P 3 C 2 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 . character stuffing and bit stuffing. and Generation of documentation of the project. CRC 16 and CRC CCIP . 3. Student has to take up another case study of his/her own interest and do the same what ever mentioned in first problem. 7. and Model it in different views i. Note : The analysis. Using RSA algorithm Encrypt a text data and Decrypt the same .

with a syntax looking vaguely like a simple C crossed with Pascal. The language has rudimentary support for 1-dimensional arrays. referenced as a[0]. Simulate all File Organization Techniques a) Single level directory b) Two level c) Hierarchical d) DAG 5.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III Year B. CSE -II Sem T 0 OPERATING SYSTEMS AND COMPILER DESIGN LAB Page 68 of 95 P 3 C 2 Objective : • To provide an understanding of the language translation peculiarities by designing a complete translator for a mini language. only operating on integer data.Tech. • To provide an understanding of the design aspects of operating system 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++ complier and JDK kit Part . Simulate all file allocation strategies a) Sequentialb) Indexed c) Linked 3. Simulate Bankers Algorithm for Dead Lock Prevention 7. Simulate the following CPU scheduling algorithms a) Round Robin b) SJF c) FCFS d) Priority 2.*/) can be inserted. Simulate all page replacement algorithms a) FIFO b) LRU c) LFU Etc. a simple procedural high-level language. Simulate Paging Technique of memory management.. Simulate Bankers Algorithm for Dead Lock Avoidance 6. Simulate MVT and MFT 4. <slist> <statement> ::= <assignment> | <ifstatement> | <whilestatement> | <block> | <printstatement> | <empty> <assignment> ::= <identifier> = <expression> | <identifier> [ <expression> ] = <expression> <ifstatement> ::= if <bexpression> then <slist> else <slist> endif | if <bexpression> then <slist> endif <whilestatement> ::= while <bexpression> do <slist> enddo <printstatement> ::= print ( <expression> ) <expression> ::= <expression> <addingop> <term> | <term> | <addingop> <term> <bexpression> ::= <expression> <relop> <expression> <relop> ::= < | <= | == | >= | > | != <addingop> ::= + | <term> ::= <term> <multop> <factor> | <factor> <multop> ::= * | / <factor> ::= <constant> | <identifier> | <identifier> [ <expression>] | ( <expression> ) <constant> ::= <digit> | <digit> <constant> <identifier> ::= <identifier> <letterordigit> | <letter> <letterordigit> ::= <letter> | <digit> <letter> ::= a|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z <digit> ::= 0|1|2|3|4|5|6|7|8|9 <empty> has the obvious meaning Comments (zero or more characters enclosed between the standard C/Java-style comment brackets / *. Note also that you should . … 8.. <vardeflist> <vardec> ::= <identifier> | <identifier> [ <constant> ] <slist> ::= <statement> | <statement> .A 1. The declaration int a[3] declares an array of three elements. PART .B Consider the following mini Language. a[1] and a[2]. The syntax of the language is defined by the following BNF grammar: <program> ::= <block> <block> ::= { <variabledefinition> <slist> } | { <slist> } <variabledefinition> ::= int <vardeflist> . <vardeflist> ::= <vardec> | <vardec> .

The following instruction set may be considered as target code. It should also ignore comments. V specifies a “variable location” (a variable number. It has three distinct internal storage areas. A simple program written in this language is: { int a[3]. if t2>5 then print(t2). t3=99. Although the syntax specification states that identifiers can be arbitrarily long. The following is a simple register-based machine. as detailed below. preceded by a # symbol. The instruction set is defined as follows: LOAD A.2007-2008 worry about the scoping of names. L specifies a numerical label (in the range 1 to 9999).R adds the value specified by A to register R.R multiplies the value specified by A by register R.V stores the value in register R to variable V. 5. Constant values are specified as an integer value. tabs and newlines. leaving the result in register R. R3. Design Predictive parser for the given language 4. leaving the result in register R. 3. /* this is a comment on 2 lines */ } endif } Page 69 of 95 1. print(-t1+t2*t3). R4. In the description of the individual instructions below. for example. The instructions can be preceded by a label.L . you may restrict the length to some reasonable value. else { int t3. flex or lex or other lexical analyzer generating tools. MUL A. Implement the lexical analyzer using JLex. JEQ R.t1. OUT R outputs the value in register R. an A-type argument could have the form 4 (variable number 4). r4 (register 4) or @r4 (the contents of register 4 identifies the variable location to be accessed). leaving the result in register R. The numerical label can be used as the argument to a jump instruction. supporting a total of 17 instructions. t2=-25. leaving the result in register R. Design a Lexical analyzer for the above language. DIV A. a variable location. used by the individual instructions as detailed below. the second is an area used for the storage of variables and the third is an area used for the storage of program. t1=2. or a variable location pointed to by a register .R subtracts the value specified by A from register R. This consists of an integer in the range 1 to 9999 and the label is followed by a colon to separate it from the rest of the instruction.). t2=-(a[2]+t1*6)/(a[2]-t1). r1. So. R5. 6. ADD A. a[t1]=3. a register or a variable location pointed to by a register (an indirect address). An indirect address is specified by an @ followed by a register.t2. NEG R negates the value in register R. instruction argument types are specified as follows : R specifies a register in the form R0. Write program to generate machine code from the abstract syntax tree generated by the parser. R6 or R7 (or r0.see below). 2.R divides register R by the value specified by A. Convert the BNF rules into Yacc form and write code to generate abstract syntax tree. SUB A. R1. The first is the set of 8 registers. R2. etc.R loads the integer value specified by A into register R. a[0]=1. #4 (the constant value 4). optionally preceded by a minus sign. STORE R. a[1]=2. The lexical analyzer should ignore redundant spaces. Design LALR bottom up parser for the above language. JMP L causes an unconditional jump to the instruction with the label L. A specifies a constant value.

.L jumps to the instruction with the label L if the value in register R is less than zero. JGT R. All programs should terminate by executing a STOP instruction. JLE R. JLT R. JNE R.2007-2008 Page 70 of 95 jumps to the instruction with the label L if the value in register R is zero. NOP is an instruction with no effect.L jumps to the instruction with the label L if the value in register R is less than or equal to zero. It can be tagged by a label.L jumps to the instruction with the label L if the value in register R is not zero. JGE R.L jumps to the instruction with the label L if the value in register R is greater than or equal to zero. STOP stops execution of the machine.L jumps to the instruction with the label L if the value in register R is greater than zero.

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

2 . Core SERVLETS ANDJAVASERVER PAGES VOLUME 1: CORE TECHNOLOGIES By Marty Hall and Larry Brown Pearson 3. JSPs. Advantages of Java Beans. Reading Servelet parameters. forms. Beginning Web Programming-Jon Duckett WROX. Introduction to EJB’s UNIT-V: Web Servers and Servlets: Tomcat web server. Presenting XML. Bean Info Interface. Customizes. Using XML Processors: DOM and SAX UNIT-IV: Java Beans: Introduction to Java Beans. XML Schemas. 5. WILEY Dreamtech (UNIT s 1. And also XML and web servers and database interfacing.John Wiley 8. Conditional Processing – Displaying Values Using an Expression to Set an Attribute. Internet and World Wide Web – How to program by Dietel and Nieto PHI/Pearson Education Asia.Deploying JAVA Beans in a JSP Page. Application – Specific Database Actions. BDK Introspection. Tomcat Server & Testing Tomcat UNIT-VII: JSP Application Development: Generating Dynamic Content.servelet Package. The complete Reference Java 2 Fifth Edition by Patrick Naughton and Herbert Schildt.6. Frames. Murach.List. Dynamic HTML with Java Script UNIT-III: XML: Document type definition. TEXT BOOKS: 1. Using Cookies-Session Tracking. An Introduction to web Design and Programming –Wang-Thomson 7. TMH (Chapters: 25) (UNIT 4) 3. Programming world wide web-Sebesta. Java Server Pages.sql. The Servelet API. S P D O’Reilly for chap 8. Reading Initialization parameters. Handling Http Request & Responses. Java Server Pages –Hans Bergsten.. CSE -I Sem T P C 4+1* 0 4 WEB TECHNOLOGIES Objectives: This course demonstrate an in-depth understanding of the tools and Web technologies necessary for business application design and development.2007-2008 Page 72 of 95 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD IV Year B. Using Scripting Elements Implicit JSP Objects. UNIT-II: Introduction to Java Scripts. Introduction to struts framework. Web Warrior Guide to Web Programmming-Bai/Ekedaw-Thomas 10. 4. Bill Siggelkow.Accessing a Database from a JSP Page. Objects in Java Script. Requests. Constrained properties Persistence. JSP Application Design with MVC Setting Up and JSP Environment: Installing the Java Software Development Kit.Pearson 9. The javax. The javax. Pekowsky. Pearson. JSDK. Chris Bates 2nd edition. JavaScript and server side scripting like servlets. Jakarta Struts Cookbook . JSP Processing. 11. Web Applications Technologies Concepts-Knuckles. images. Web Programming. The course covers client side scripting like HTML. Java Beans API. Document Object model. Introduction to Servelets: Lifecycle of a Serverlet. . Studying Javax.* package.servelet HTTP package. Using Bound properties. Murach’s beginning JAVA JDK 5.8) REFERENCE BOOKS: 1. Programming world wide web-Sebesta. Security Issues.7. and Users Passing Control and Date between Pages – Sharing Session and Application Data – Memory Usage Considerations UNIT VIII: Database Access : Database Programming using JDBC.Tech. building internet applications. The Anatomy of a JSP Page. Tables. UNIT-I: HTML Common tags.3) 2.Pearson 2. Declaring Variables and Methods Error Handling and Debugging Sharing Data Between JSP pages. UNIT-VI: Introduction to JSP: The Problem with Servelet. SPD 6. Cascading Style sheets. SPD O’Reilly (UNITs 5.

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

W Solutions Unit .memory addressing.cache performance. Elsevier . Pearson.reducing cache misses penalty and miss rate – virtual memory.H. Hennessy & David A.measuring and reporting performance quantitative principles of computer design. Advanced Computer Architectures. David E.multi threading.Types – Buses . 2.Technology trends.static branch protection .over coming data hazards. A Hardware / Software Approach.II Instruction set principles and examples.IV ILP software approach.examples – clusters.2007-2008 Page 74 of 95 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD IV Year B.Tech. TEXT BOOK : 1.VIII Inter connection networks and clusters. Unit .bench marking a storage devicedesigning a I/O system. Culler. Unit .W support for more ILP at compile time. Jaswinder Pal singh with Anoop Gupta.addressing modes for signal processing-operations in the instruction set.VLIW approach .III Instruction level parallelism (ILP).errors and failures.Synchronization.VII Storage systems.V Memory hierarchy design. Peter Kacsuk.interconnection network media – practical issues in interconnecting networks.H.limitation of ILP Unit . 3.VI Multiprocessors and thread level parallelism.reducing branch costs –high performance instruction delivery.compiler techniques.designing a cluster. Dezso Sima. CSE -I Sem T P C 4+1* 0 4 ADVANCED COMPUTER ARCHITECTURE Unit . Patterson Morgan Kufmann (An Imprint of Elsevier) REFERENCES : 1. Unit .I Fundamentals of Computer design.hardware based speculation.encoding an instruction set.protection and examples of VM.distributed shared memory.Briggs International Edition McGraw-Hill. Parallel Computer Architecture. Unit .RAID. “Computer Architecture and parallel Processing” Kai Hwang and A.instructions for control flow.classifying instruction set.-the role of compiler Unit .type and size of operands.symmetric shared memory architectures. Computer Architecture A quantitative approach 3rd edition John L.cost.W verses S. Terence Fountain.

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

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

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

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

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

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

B. BS Publication. Venkateswarlu. Implement the following forms of IPC. Design TCP iterative Client and server application to reverse the given input sentence Week6. Design TCP iterative Client and server application to reverse the given input sentence Week5. a)Pipes b)FIFO Week2. Implement file transfer using Message Queue form of IPC Week3.Tech. Use senphores to avoid race conditions Week4. Write a programme to create an integer variable using shared memory concept and increment the variable simultaneously by two processes.2007-2008 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD IV Year B. Design a TCP concurrent server to echo given set of sentences using poll functions Week9. Design a TCP concurrent server to convert a given text into upper case using multiplexing system call “select” Week8. Design TCP client and server application to transfer file Week7. Advance Unix Programming. N. 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. Second Edition Pearson Education 2. Week12 Design a RPC application to add and subtract a given pair of integers Reference Book: 1.Advance Unix Programming Richard Stevens. CSE -I Sem T 0 NETWORK PROGRAMMING LAB Objectives: • To teach students various forms of IPC through Unix and socket Programming Recommended Systems/Software Requirements: Page 81 of 95 P 3 C 2 • • 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. .

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

3. Week-2: 4) CART PAGE: . Publisher. Snap shot of Cover Page.5 $ 50 Note: Week 2 contains the remaining pages and their description. 2. Author Name. Price.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.2007-2008 Web Site Name Logo Home CSE ECE EEE CIVIL Login Registration Catalogue Page 83 of 95 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. Web Site Name Logo Home CSE ECE EEE CIVIL Book : AI Author : S. Add to cart button. 5. 4. The details should contain the following: 1.5 $ 35.

com) 4. 1. Password (Password should not be less than 6 characters length). Tamil) 8) Address (text area) WEEK 3: VALIDATION: Write JavaScript to validate the following fields of the above registration page.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. you refer to these selectors to activate the styles. Week-4: Design a web page using CSS (Cascading Style Sheets) which includes the following: 1) Use different font. 3. in the body of your pages.5 $130. color etc. Telugu. 2.headline {color:red. The cart page should look like this: Web Site Name Logo Home CSE ECE EEE CIVIL Login Book name Java 2 XML bible Registration Price $35. For example: <HTML> <HEAD> <style type="text/css"> B.5 Quantity 2 1 Total amount Catalogue Amount $70 $40. font-size:22px.5 $40.2007-2008 Page 84 of 95 The cart page contains the details about the books which are added to the cart.). Note : You can also validate the login page with these parameters. E-mail id (should not contain any invalid and must follow the standard pattern name@domain. font-family:arial. Hindi. Then. styles: In the style definition you define how each selector should work (font. Name (Name should contains alphabets and the length should not be less than 6 characters). text-decoration:underline} </style> </HEAD> . Phone number (Phone number should contain 10 digits only).

xlink {cursor:crosshair} . color:red. You can define the background image for the page like this: BODY {background-image:url(myimage. z-index:3. just like an ordinary background image plain HTML.htm" class="xlink">CROSS LINK</a> <br> <a href="mypage.} in 3) Control the repetition of the image with the background-repeat property.hlink{cursor:help} </style> </head> <body> <b> <a href="mypage. z-index:2. zindex:1">LAYER 2</div> LAYER 2 ON TOP: <div style="position:relative.">LAYER 1</div> <div style="position:relative. As background-repeat: repeat Tiles the image until the entire page is filled. left:5. color:red.2007-2008 Page 85 of 95 <BODY> <b>This is normal bold</b><br> Selector {cursor:value} For example: <html> <head> <style type="text/css"> .">LAYER 1</div> <div style="position:relative. left:5. zindex:4">LAYER 2</div> . font-size:50px.gif). font-size:80px. font-size:80px. color: red.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.} </style> 5) Work with layers: For example: LAYER 1 ON TOP: <div style="position:relative. top:-50. top:-50. 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. font-size:50px.

Use XML schemas XSL and CSS for the above purpose. Access the pages by using the urls : http://localhost:4040/rama/books. if it is false. If it is set to true then the shape of the area is Square and it is Circle.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. And the Author names column should be displayed in one color and should be capitalized and in bold.html (for tomcat) http://localhost:8080/books. 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. Note: Give at least for 4 books. It should be valid syntactically.hlink{cursor:help} </style> </head> <body> <b> <a href="mypage. Week-7: 1) Install TOMCAT web server and APACHE. no other process is using this port.user2. The contents should be displayed in a table. 1.user3 and user4 having the passwords pwd1.xlink {cursor:crosshair} . The color of the area should be changed dynamically for every mouse click. While installation assign port number 4040 to TOMCAT and 8080 to APACHE. Make sure that these ports are available i.e. Use your own colors for remaining columns.. The shape of the area depends on the property shape.html (for Apache) Week-8: User Authentication : Assume four users user1. . The color should also be changed if we change the color in the “property window “. Display the XML file as follows. 2) Access the above developed static web pages for books web site.htm" class="xlink">CROSS LINK</a> <br> <a href="mypage. Write a servelet for doing the following. The header of the table should be in color GREY.pwd2. using these servers by putting the web pages developed in week-1 and week-2 in the document root. 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. Create a Cookie and add these four user id’s and passwords to this Cookie. 2.2007-2008 Page 86 of 95 6) Add a customized cursor: Selector {cursor:value} For example: <html> <head> <style type="text/css"> .pwd3 and pwd4 respectively.

invalidate() ). phone number(these should hold the data from the registration form).. password. Store the user-names and passwords in the webinf. Authenticate the user when he submits the login form using the user name and password from the database ( similar to week8 instead of cookies). Amount )) of each category.e. The user may add some items to cart from the catalog page. Week-11: Create tables in the database which contain the details of items (books in our case like Book name . This can be achieved through the use of sessions. Multiple users can do the same thing at a time(i. Week-9: Install a database(Mysql or Oracle). whenever a new user clicks the submit button in the registration page (week2). He may visit the catalogue again and select some more items. Quantity. email-id. Price. Session is required to maintain the state.e. Every user will have his own session which will be created after his successful login to the website. Practice 'JDBC' connectivity. Here our interest is the selected items should be added to the old cart rather than a new cart. Use init-parameters to do this. Modify your catalogue and cart JSP pages to achieve the above mentioned functionality using sessions. . 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. Experiment with various SQL queries.xml and access them in the servlet by using the getInitParameters() method. user-name and password match) you should welcome him by name(user-name) else you should display “ You are not an authenticated user “. Week-12: HTTP is a stateless protocol. Insert the details of the users who register with the web site. He can check the cart page for the selected items. from different systems in the LAN using the ipaddress instead of localhost). Create a table which should contain at least the following fields: name.2007-2008 Page 87 of 95 If he is a valid user(i. Write a java program/servlet/JSP to connect to that database and extract data from the tables and display them.. 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. When the user logs out his session should get invalidated (by using the method session.

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.