COURSE STRUCTURE AND DETAILED ... - Sreenidhi

B.Tech - CSE –2014 -15

COURSE STRUCTURE

AND DETAILED SYLLABUS

for

B.Tech Four Year Degree Course

in

COMPUTER SCIENCE AND ENGINEERING (CSE)

(Applicable for the batches admitted from 2014-2015)

SREENIDHI INSTITUTE OF SCIENCE & TECHNOLOGY (An Autonomous Institution approved by UGC and affiliated to JNTUH)

Yamnampet, Ghatkesar, R.R.District-501 301.

B.Tech - CSE –2014 -15

B.Tech CSE I YEAR I SEMESTER COURSE STRUCTURE

I YEAR II SEMESTER COURSE STRUCTURE

Sl. No.

Subject L T P/D C Max. Marks

New code Int. Ext.

1. 4H202 English-II 2 1 - 2 30 70 2. 4H213 Engineering Mathematics – II 4 1 - 4 30 70 3. 4H222 Engineering Physics – II 3 1 - 3 30 70 4. 4E201 Data Structures and C++ 4 1 - 4 30 70 5. 4B202 Engineering Drawing – II 2 - 3 3 30 70 6. 4H232 Engineering Chemistry -II 3 1 - 3 30 70 7. 4BC04 Basic Mechanical Engineering 3 2 - 3 30 70 8. 4H272 English Language Lab – II - - 2 1 25 50 9. 4E271 Data structure and C++Lab - - 3 2 25 50 10. 4H282 Engineering Physics Lab – II - - 3/2 1 25 50 11. 4F273 IT workshop -II - - 3/2 1 25 50

12. 4E291 Technical paper Writing & Seminar - II - - 2 1 25 -

Total : 21 7 13 28 335 690

sSl. No


New code Int. Ext.

1. 4H101 English – I 2 1 - 2 30 70 2. 4H111 Engineering Mathematics – I 3 2 - 3 30 70 3. 4H121 Engineering Physics – I 3 1 - 3 30 70 4. 4H131 Engineering Chemistry - I 3 1 - 3 30 70 5. 4F101 Computer Programming 4 1 - 4 30 70 6. 4B101 Engineering Drawing - I 2 - 4 4 30 70 7. 4H171 English Language Lab – I - - 2 1 25 50 8. 4H181 Engineering Physics Lab-I - - 3/2 1 25 50 9. 4H186 Engineering Chemistry Lab - - 4/2 2 25 50 10. 4F171 Computer Programming Lab - - 3 2 25 50

11. 4B171 Engineering workshop-I - - 3/2 1 25 50

12. 4F172 IT Workshop - I - - 3/2 1 25 50 13. 4E190 Technical paper Writing & Seminar – I - - 2 1 25 - Total : 17 6 17.5 28 355 720

B.Tech - CSE –2014 -15

II YEAR I SEMESTER COURSE STRUCTURE

Sl. No

New code Subject L T P/D C

Max. Marks

Int. Ext. 1. 4H315 Engineering Mathematics – III 3 2 - 3 30 70 2. 4CC01 Electronic Devices and Circuits 4 1 - 4 30 70 3. 4CC02 Switching Theory and Logic Design 4 1 - 4 30 70 4. 4AC41 Basic Electrical Engineering 3 1 - 3 30 70

5. 4EC03 Object Oriented Programming through Java 4 1 - 4 30 70

6. 4F302 Mathematical Foundations of Computer Science 3 1 - 3 30 70

7. 4HC73 Functional and Communicative Written English - - 3 2 25 50

8. 4AC91 Basic Electrical Engineering Lab - - 4/2 1 25 50 9. 4CC80 Basic Electronics Lab - - 4/2 1 25 50

10. 4EC74 Object Oriented Programming through Java Lab - - 4 2 25 50

11. 4E392 Technical paper Writing & Seminar - III - - 2 1 25 - Total : 21 7 13 28 305 620

II YEAR II SEMESTER COURSE STRUCTURE

Sl. No


New Code Int. Ext.

1. 4FC04 Design and Analysis of Algorithms 3 1 - 3 30 70 2. 4ZC01 Managerial Economics and Financial

Analysis 3 1 - 3 30 70

3. 4FC03 Data Base Management Systems 4 1 - 4 30 70 4. 4GC06 Environmental Studies 3 1 - 3 30 70 5. 4D408 Computer Organization &

Microprocessor and Interfacing 4 1 - 4 30 70

6. 4HC16 Probability and Statistics 3 1 - 3 30 70 7. 4HC74 Effective English Communication and

Soft Skills - - 3 2 25 50

8. 4E473 Comprehensive Viva Voce - I - - - 1 - 50 9. 4FC74 Data Base Management Systems Lab - - 4 2 25 50 10. 4DC74 Microprocessor and Interfacing Lab - - 4 2 25 50 11. 4E493 Technical paper Writing & Seminar - IV - - 2 1 25 -

Total : 20 6 13 28 280 620

B.Tech - CSE –2014 -15

III YEAR I SEMESTER COURSE STRUCTURE

Sl. No Subject L T P/D C Max. Marks New Code Int. Ext.

1. Open Elective - I 3 - - 3 30 70 2. 4EC07 Operating Systems 4 - - 4 30 70 3. 4FC17 Theory of Computation 3 1 - 3 30 70 4. 4E502 Data Communications And Networks 4 1 - 4 30 70 5. 4EC04 Software Engineering 3 1 - 3 30 70 6. 4FC09 Web Technologies 4 1 - 4 30 70 7. 4HC76 Quantitative Aptitude - - 3 2 25 50 8. 4E575 Group Project - - 3 1 25 50

9. 4EC87 Operating Systems and Computer Network Lab - - 4 2 25 50

10. 4FC82 Web Technologies Lab. - - 4 2 25 50 11. 4E594 Technical paper Writing And Seminar - V - - 2 1 25 -

Total : 21 4 16 29 305 620

OPEN ELECTIVE - I New Code Subject 4BC15 Product and Service Design

4HC51 Basic Spanish Language 4HC46 Basic German Language 4HC41 Basic French Language 4BC11 Operations Research for Allied Branches 4ZC04 Entrepreneurship 4EC26 SAP I

III YEAR II SEMESTER COURSE STRUCTURE

Sl. No


New Code Int. Ext. 1. Open Elective - II 3 - - 3 30 70

2. 4EC06 Object Oriented Analysis And Design 3 1 - 3 30 70

3. 4EC08 Compiler Design 3 1 - 3 30 70

4. 4FC11 Information Security 3 1 - 3 30 70

5. 4EC19 Linux Programming 3 1 - 3 30 70

6. Professional Elective – I 4 1 - 4 30 70

7. 4HC77 Logical Reasoning - - 3 2 25 50

8. 4E677 Comprehensive Viva II - - - 1 - 50

9. 4E688 Compiler Design And Object Oriented Analysis And Design Lab - - 4 2 25 50

10. 4E689 Linux Programming Lab - - 4 2 25 50

11. 4E695 Technical paper Writing And Seminar - VI - - 2 1 25 -

Total : 19 5 13 27 280 620

B.Tech - CSE –2014 -15

OPEN ELECTIVE - II PROFESSIONAL ELECTIVE - I New Code Subject New Code Subject

4ZC03 Banking Operations, Insurance and Risk management 4FC18 Computer Forensics 4ZC05 General Management and Entrepreneurship 4EC11 Artificial Intelligence 4GC35 Fundamentals of Bio Informatics 4EC12 Software Project Management 4BC25 Introduction to Nano Technology 4EC16 Mobile Computing 4DC52 Fundamentals of Embedded Systems 4ZC07 Fundamentals of Disaster Management 4EC27 SAP II

IV YEAR I SEMESTER COURSE STRUCTURE

Sl. No


New Code Int. Ext. 1. 4FC05 Data Warehousing and Data Mining 4 - - 4 30 70 2. Professional Elective - II 4 1 - 4 30 70 3. 4E709 Software Testing 4 - - 4 30 70 4. 4ZC02 Management Science 4 1 - 4 30 70 5. 4EC25 Scripting Languages 4 1 - 4 30 70 6. 4EC15 Cloud Computing 3 1 - 3 30 70

7. 4GC33 Culture, Values, Professional Ethics and IPR

2 1 - 2 30 70

8. 4E780 Project Phase - I - - 2 1 50 - 9. 4E781 Industry Oriented Mini Project - - - 2 25 50 10. 4E779 Software Testing And Data Mining Lab - - 4 2 25 50

11. 4E789 Scripting Languages Lab - - 4 2 25 50 12. 4E796 Technical paper Writing And Seminar - VII - - 2 1 25 -

Total : 25 5 12 33 360 640

PROFESSIONAL ELECTIVE - II

New Code Subject

4F713 Electronic Commerce 4DC55 Internet of Things

4EC14 Information Retrieval System

4EC13 Software Architecture and Design Pattern

4ZC19 Project Management and Structured Finance

B.Tech - CSE –2014 -15

IV YEAR II SEMESTER COURSE STRUCTURE

Sl. No

Subject L T P/D C Max. New Int. Ext.

1. Professional Elective - III 4 - - 4 30 70 2. 4FC23 Image Processing 4 - - 4 30 70 3. 4E884 Project Phase – II - - 15 12 50 150 4. 4E885 Comprehensive Viva III - - - 2 - 50

5. 4E897 Technical paper Writing And Seminar - VIII - - 2 1 25 -

Total : 8 - 17 23 135 340 Note: All End Examinations (Theory and Practical) are of Three hours duration. T – Tutorial L- Theory P/D – Practical/Drawing C- Credits Int. - Internal Exam Ext. - External Exam

PROFESSIONAL ELECTIVE - III New Code Subject

4EC17 Human Computer Interaction 4FC06 Computer Graphics 4EC18 Advanced Computer Architecture 4FC22 Big Data Analytics

B.Tech - CSE –2014 -15

a b c d e f g h i j k l m x x x x x

Syllabus for B. Tech I Year I semester

Computer Science and Engineering ENGLISH – 1

Code: 4H101 L T P/D C 2 1 - 2

The proposed syllabus is covered in 6 units: First unit is a refresher course to calibrate the students and test their previous knowledge in English. It is a bridge course to identify their ability in different areas of language learning. A diagnostic test is followed by this course. Exercises based on the test items are provided as a remedial course. UNIT 1 Refresher Course Exercises on English Vocabulary and Grammar are practiced and followed up by a Diagnostic Test Grammar - Parts of Speech Correction of Sentences Vocabulary One Word Substitutes

DIAGNOSTIC TEST 1 UNIT 2 ESSENTIALS OF ENGLISH – A LANGUAGE PERSPECTIVE. Exercises on different aspects to improve basic English language learning is provided WRITING: Guided paragraph UNIT 3 Short Story Short Story & Vocabulary (Devoted Son by Anita Desai) Vocabulary: Words from the text

a. Meanings of Words b. Usage of Words c. Synonyms of Words d. Antonyms of Words e. Usage of Sentences

Grammar: Types of Sentences – Simple / Compound / Complex Conversation of one type into the other / Rules of conversation Exercises based on simple to compound, simple to complex, compound to complex, complex to compound, complex to simple, etc. Writing: Paragraph Writing Speaking: Asking questions to gain information (working in pairs) “Wh” Questions; Tag Questions; Command and Requests; Greeting and Leave Taking; Asking for Permission

B.Tech - CSE –2014 -15

UNIT4 Public Address Evolution of Indomitable Spirit in Youth by APJ Abdul Kalam Vocabulary: Words from the text

a. Meanings of Words b. Usage of Words c. Homonyms, Homophones and Homographs d. Words often confused and sentences with such words

Grammar: Verbs, Types of Verbs, Finite / Infinite, Transitive and Intransitive, Auxiliary, Tenses (Regular and Irregular Verb Tenses) Exercises based on Verbs and their various usages Writing: Writing a paragraph on any famous / inspirational person Speaking: Greeting and Leave Taking, Apologizing and Inviting (working in pairs) DIAGNOSTIC TEST 2 Remedial Activity 2 UNIT 5 Creativity Lesson: A Tea Party by Ruth Prawar Jhabwala Vocabulary: Text based words, meanings and sentences / Affixation, Prefixes, Infixes and Suffixes Grammar: Sentences Using the Correct Form of given base word Writing: Informal / Formal Letter Writing (Salutation, Introduction, Body, Conclusion, Complimentary Close and Signature) Speaking: Situational Dialogues UNIT 6 Inspiring Speech Moon Shot Speech (1961) by John F. Kennedy Vocabulary: Text Based Words / Meanings Collocations: Words that go together Exercises based on Collocations Phrasal Verbs Exercises Grammar: Scrambled Words and Writing Sentences Writing: Note- making Speaking: Topic related short speeches / narrating an anecdote PRESCRIBED TEXT:

1. Compiled by Faculty - Department of English (SNIST) SUGGESTED READING:

1. Essential English Grammar by Raymond Murphy

B.Tech - CSE –2014 -15

2. Intermediate English Grammar by Raymond Murphy

a b c d e f g h i j k l m x

Syllabus for B. Tech I Year I semester Computer Science and Engineering

ENGINEERING MATHEMATICS –I (Common to all branches except Bio-Technology)

L T P/D C Code: 4H111 3 2 - 3

UNIT I Differential Calculus: Rolle’s Theorem, Lagrange’s and Cauchy mean value theorems (without proofs), Taylor’s series and Maclaurin’s series. Applications: Approximating definite integrals. Functions of several variables: Continuity of function of variables, Partial derivatives of higher order, Euler’s theorem, Total differentiation, Jacobians and its properties. Maxima and minima values of a function of several variables- Applications. UNIT II Ordinary Differential Equations Of First Order: Differential equations of first order and first degree – Exact, linear and Bernoulli equations. Applications: Law of Natural Growth and Decay, Newton’s Law of Cooling, Orthogonal Trajectories. UNIT III Ordinary Linear Differential Equations Of Higher Order: Linear differential equations of second and higher orders with constants coefficients – Method of Variation of Parameters – Systems of linear differential equations with constant coefficients. Application: Bending of beams, Simple harmonic motion and LCR circuit. UNIT IV Multiple integrals Double Integrals, Iterated Integrals-Integrals over Rectangular and General Regions, Change of Variables, Polar Coordinates, Triple integrals in Cartesian coordinates, Change of variables. Applications: Moment of Inertia, Calculation of volumes using triple integrals. UNIT V Vector Differential Calculus: Scalar and Vector Fields, Level surfaces, Curvature and Torsion of a curve in space, Directional Derivative: Gradient of a Scalar Field, Divergence and Curl of a vector field, Laplacian operator and related properties. Applications: Velocity and Acceleration of a particle. UNIT VI Vector Integral Calculus: Line Integral, Surface Integral, Volume Integral and Verification of problems on Green’s Theorem in Plane, Gauss-Divergence Theorem and Stoke’s Theorem. Applications: Finding potential function of Irrotational fields in fluid dynamics.

B.Tech - CSE –2014 -15

TEXT BOOKS: 1. Mathematical Methods of Science and Engineering, Kanti B.Datta, CENGAGE Learning. 2. Higher Engineering Mathematics, B.S. Grewal, Khanna Publications, New Delhi. 3. Engineering Mathematics, B. V. Ramana, Tata McGraw Hill Publishing Company Ltd. 4. Erwin Kreyszig: Advanced Engineering Mathematics, John Wiley and Sons, 8th Edition. REFERENCE BOOKS: 1. A Text Book of KREYSZIG’s Engineering Mathematics, Dr. A. Ramakrishna Prasad, Wiley Publications. 2. Advanced Engineering Mathematics, S. R. K. Iyengar and R.K. Jain, Narosa Publishing House, London, 2002.

B.Tech - CSE –2014 -15



Computer Science and Engineering Engineering Physics – 1 (Common to all branches)

Code: 4H121 L T P/D C 3 1 - 3

UNIT I Crystallography and Crystal Structures: Space Lattice, Unit Cell, Lattice Parameters, Crystal Systems, Bravais Lattices, Miller Indices, Crystal Planes and Directions, Inter Planar Spacing of Orthogonal Crystal Systems, Atomic Radius, Co-ordination Number and Packing Factor of SC, BCC, FCC, and hcp Structures. Atomic densities along various important directions and planes and comparison of deformability of BCC, FCC and hcp metals. UNIT II Defects in Crystals: Point Defects: Vacancies, Substitutional, Interstitial, Frenkel and Schottky Defects-Calculation of concentration, Qualitative treatment of line (Edge and Screw Dislocations) Defects, Burger’s Vector. X-ray Diffraction: Basic Principles, Bragg’s Law, Powder Method, Applications of X-ray Diffraction. UNIT III Elements of Statistical Mechanics: Phase space, Ensemble, Difference between micro, canonical & grand canonical ensemble, Qualitative explanation of Maxwell - Boltzman Statistics, Bose – Einstein Statistics, and Fermi – Dirac Statistics, Density of states quantitative treatment.

UNIT IV Principles of Quantum Mechanics: Waves and Particles, de Broglie Hypothesis , Matter Waves, Davisson and Germer’s Experiment, G. P. Thomson Experiment, Heisenberg’s Uncertainty Principle, Schrödinger’s Time Independent Wave Equation -Physical Significance of the Wave Function -Particle in One Dimensional Potential Box. UNIT V Free electron theory of Metals: Classical free electron theory (Drunde and Lorentz), Electrical conductivity of a metals, Relaxation time, Collision time and mean free path, Success of classical free electron theory, Breakdown of free electron theory, Fermi – Dirac distribution function- variation with temperature, The quantum free electron theory. UNIT VI Band Theory of Solids: Bloch Theorem, Kronig-Penny Model (Qualitative Treatment), E-K curve ,velocity of ,point of inflection, effective mass of an electron and its significance, Origin of Energy Band Formation in Solids, Classification of Materials into Conductors, Semi Conductors & Insulators.

e

B.Tech - CSE –2014 -15

TEXT BOOKS: 1. P K Palanisamy, Engineering Physics, Sitech Publications REFERENCE BOOKS: 1. Charles Kittel, Introduction to Solid State Physics, John Wiley Publisher 2. Neil W. Ashcroft, N. David Mermin,, Solid State Physics, Thomson Publisher, 3. Donald Allan McQuarrie, Statistical Mechanics, University Science Books Publisher, California 4. Sathya Prakash, Statistical Mechanics, Pragathi Prakashan Publisher 5. Quantum Mechanics by G. Aruldas 6. John L Powel, Quantum Mechanics, Narosa Publications 7. Ramamurti Shanker, Principles of quantum Mechanics, Springer Publication 8. M Chandrashekar and P Appla Naidu, Applied Physics, VGS Book Links 9. K. Vijaya Kumar, S Chandralingam, Modern Engineering Physics, S Chand Publisher

B.Tech - CSE –2014 -15



Computer Science and Engineering ENGINEERING CHEMISTRY-I

(Common to all) Code: 4H131 UNIT I WATER TECHNOLOGY (a) Water quality Parameters:-Hardness of water – types of hardness (temporary and permanent).

Estimation of hardness of water by EDTA Method. (b) Water for Industrial purpose: Water for steam making, Boiler troubles-Carry over (priming

&foaming).Boiler Corrosion, Scale and sludge, caustic embrittlement. (c) Treatment of Water: Internal Conditioning- Phosphate, Carbonate & Calgon conditioning. External

Treatment: Lime- Soda, Zeolite, Ion-exchange process, Desalination-Reverse osmosis and electro dialysis. Methods of Treatment of Water for Domestic purpose-Sedimentation, Coagulation, Filtration, Disinfection-Chlorination, Ozonization. (Numerical problems on calculation temporary and permanent hardness). Engineering applications: Methodology and working of mineral water plant (ISI) for drinking purpose.

UNIT II ELECTROCHEMISTRY Electro Ionics:- Conductance – conductors (metallic and electrolytic) – Types of conductance – specific, Equivalent, molar conductance – Effect of dilution on conductance – Kohlrausch’s law and its applications i) Determination of equivalent conductance for weak electrolytes ii) Degree of dissociation iii) Solubility of sparingly soluble salts – numerical problems on Kohlrausch’s law. Electrodics :- E M F of electrochemical cells – cell notation and cell reaction – electrode potential ( oxidation and reduction) Nernst Equation and its applications. Types of electrodes (a) Gas electrode (H2 electrode) (b) Metal ion electrode (Zn/Zn+2) (c) Redox electrode (Quinhydrode electrode) (d) Metal – Metal insoluble salt electrode(SCE) (e) Ion selective electrode. Engineering Applications – determination of PH. UNIT III ELECTROCHEMICAL ENERGY SOURCES – BATTERIES Cell and batteries – types of batteries (a) Primary batteries – Lechalanche cell (dry cell), Lithium cell (b) Secondary batteries(Accumulators) – Lead acid battery, Alkaline battery Ni-Cd battery, , Lithium-

ion battery (c) Fuel cells- H2 – O2 fuel cell & Methanol – Oxygen fuel cell (d) Photovoltaic Cell- Solar Cell

Engineering applications – future water powered car, solar cells in domestic and automobiles.

UNIT IV CORROSION AND ITS CONTROL

L T P/D C 3 1 - 3

B.Tech - CSE –2014 -15

Corrosion – Basic concepts – Mechanism of chemical, electrochemical Corrosion (absorption of O2 and evaluation of H2) – Pilling - Bed worth rule – Types of electrochemical Corrosion – Galvanic Corrosion – Pitting Corrosion – Concentration Cell Corrosion – Factors affecting the rate of Corrosion. Engineering Applications: a) Corrosion Control Methods- Cathodic protection – sacrificial anode and impressed current cathode

method. b) Protective Coatings -- Surface preparation for metallic coatings like hot dipping (tinning and

galvanizing) metal cladding (Al Cladding) electro plating (copper plating) and electroless plating (Nickel plating). Methodology and production of gold decorative articles.

UNIT V PHASE EQUILIBRIA AND ALLOYS Phase rule: Introduction, definition of terms with examples, one components system – Water system, reduced phase rule – Two component systems, classification – lead – silver system. Alloys: Introduction – Definition – properties of alloys – significance of alloying, functions and effect of alloying elements. Engineering applications of ferrous alloys – Ni chrome and stainless steel, nonferrous alloys – brass and bronze. UNIT VI NANO CHEMISTRY Basics – distinction between molecules, nanoparticles and bulk materials, size – dependent properties. Nano Particles: Nano cluster, Nano rod, Nano tube (CNT) and Nano wire. Synthesis: Precipitation, thermolysis, hydrothermal, solvothermal, electrode position, laser ablation, wet chemical methods of preparation (micro emulsion – solvent extraction Reduction – chemical oxidation Reduction. Applications of Nano materials in Medicine and Energy systems - Carbon nanotubes in efficient solar cell and fuel cells. TEXT BOOKS:

1. Engineering Chemistry: P.K. Jain and M.K. Jain, Dhanpathrai Publications-14th Edition.

REFERENCE BOOKS:

1. Essentials of Physical Chemistry: Baul & Tuli, S. Chand Publications. 2. Text of Engineering Chemistry by S.S. Dara & Mukkanti, S. Chand & CO, New Delhi (2014). 3. Chemistry of Engineering Materials by C.V. Agarwal,C.P.Murthy,A.Naidu; BS publications. 4. Text Book of Nano Science and Nano Technology by B.S. Murthy and P.Shankar, University

press.

B.Tech - CSE –2014 -15

a b c d e f g h i j k l m x x x x x x


Computer Science and Engineering COMPUTER PROGRAMMING

(Common to all Branches) Code: 4F101 L T P C

4 1 - 4

UNIT I Computer fundamentals – Computer Systems, Computer Hardware, Computer Software, Computer Environments – Personal Computing Environment, Time-sharing Environment, Client/Server Environment, Distributed Computing, Computer Languages – Machine Languages, Symbolic Languages, High-Level Languages, Creating and running programs – Writing and Editing, compiling, linking, and executing programs, System Development – SDLC (Pages 1 – 28 of Text Book 1). Problem solving Techniques – Algorithms, pseudo code, flowcharts – Simple illustrations and domain problems like: Sum of digits of a number, Nature of quadratic equations, Income Tax Problem, Standard Deviation (Pages 1019 – 1032 of Text Book 1). UNIT II Introduction to the C language – Background, C Programs, Structure of a C Program, Comments, the greeting program, identifiers, constants, variables and keywords. Types – void, integral, and floating-point types. Variables – declarations and initialization. Input / Output – Steams, Formatting input and output (Pages 29 – 76 of Text Book 1). Expressions – Primary expressions, post-fix expressions, pre-fix expressions, unary expressions, binary expressions, Precedence and associativity, evaluating expressions, type conversions – implicit type conversion, explicit type conversion, statements – statement type, role of semicolon, statements and defined constants (Pages 94 – 134 of Text Book 1). Decision control structures – Logical data and operators, Two-way selection – if else, nested if, dangling else, conditional expressions, Multi-way selection – switch statement, else-if (231 – 263 of Text Book 1). UNIT III Repetitive control structures – Pre-test and post-test loops – initialization and updation, event and counter controlled loops, while, do while, for, break and continue statements, comma expression (Pages 303 – 348 of Text Book 1). Functions – User-defined functions - Function definition, arguments, return value, prototype, arguments and parameters, inner-function communication. Standard functions – Math functions, Random numbers. Scope – local global (Pages 149 – 199 of Text Book 1). Parameter passing – Call by value and call by reference. Recursive functions – Definition, examples, advantages and disadvantages (Pages 349 – 359 of Text Book 1). Macros – Definition, examples, comparison with functions. UNIT IV Arrays – Definition and declaration, initialization, accessing elements of in arrays, storing values in arrays, inter-function communication – passing individual elements, passing the whole array, array applications, bubble sort, sequential search. Two dimensional and multidimensional arrays (Pages 459 – 487 and 493, 501 of Text Book 1).

B.Tech - CSE –2014 -15

UNIT V Pointers – Introduction, pointer constants, pointer values, pointer variables, accessing variables through pointers, pointer declaration and definition, declaration versus redirection, initialization of pointer variables, pointer for inter function communication, pointer to pointers (Pages 557 – 577 of Text Book 1). Arrays and pointers – Pointer arithmetic and arrays, Memory allocation functions – static and dynamic memory allocation, array of pointers (Pages 612 – 633 of Text Book 1). Strings – Input output functions, string handling functions. UNIT VI Enumerated, Structure, and Union types – The type definition (typedef), enumerated types, Structure, Unions (Pages 745 – 786 of Text Book 1). Files – File name, file information table, streams, text and binary streams, stream file processing, system created steams, Standard library I/O functions, file open and close, formatting I/O functions, character I/O functions, Binary I/O, Standard library functions (Pages 393 – 441, 821 – 840 of Text Book 1). TEXT BOOKS: 1. Computer science, a structured programming approach using C, B.A. Forouzan and R.F. Gilberg,

Third edition, Thomson.

REFERENCES: 1. The C Programming Language, B.W. Kernighan, Dennis M.Ritchie, PHI/Pearson Education. 2. Let us C by Yashwanth P. Kanetkar 8th edition BPB publications. 3. Computer programming for teens by Mary Farrell.

B.Tech - CSE –2014 -15



Computer Science and Engineering ENGINEERING DRAWING – I

(Common to all branches) Code: 4B101 L T P/D C

2 - 4 4

UNIT I Introduction to Engineering Drawing: Drawing Instruments and their uses, types of lines, use of pencils, Lettering, Rules of dimensioning. Construction of polygons: Inscription and superscription of polygons given the diameter of circle. Introduction to Scales (Theory Only): Scales Used In Engineering Practice and Concept Of Representative Fraction Curves used in Engineering Practice and their Constructions: Conic Sections including Rectangular Hyperbola - General method only. UNIT II Drawing of Projections or Views (Orthographic Projection in First Angle Projection Only): Principles of Orthographic Projections – Conventions – First and Third Angle Projections, Projection of Points, Projection of Lines - inclined to both planes, True lengths, traces. UNIT III Projections of Planes: Projections of regular Planes, traces, Oblique planes, Introduction to Auxiliary planes UNIT IV Projections of Solids: Projections of Regular Solids – Regular Polyhedra, solids of revolution, Axis inclined to both planes. UNIT V Sections of Solids: Sections and Sectional views of Right Regular Solids – Prism, Cylinder, Pyramid, Cone – Auxiliary views UNIT VI Intersection of Similar and Dis-similar Solids: Line method, Cutting plane method, Intersection of Prism Vs Prism, Cylinders Vs Cylinder (Under Similar category) and Cylinder Vs Prism (Under Dis-similar category) TEXT BOOKS: 1. Engineering Drawing, N.D. Bhatt / Charotar publishers 2. Engineering Drawing 2nd Edition Basant Agrawal, C. M. Agrawal, Tata McGraw-Hill Education REFERENCES:

1. Engineering Drawing, K.Venugopal/G.Sreekanjana, New Age International Publishers.

B.Tech - CSE –2014 -15

a b c d e f g h i j k l m x x x x


Computer Science and Engineering ENGLISH LANGUAGE LAB – I

Code: 4H171 L T P/D C - - 2 1 Phonetics: Introduction to Phonetics

1. Vowels: Long Vowels

2. Vowels: Short Vowels

3. Vowels: Diphthongs

4. Consonants: Voiced Consonants

5. Consonants: Voiceless Consonants

6. Stress or Accent

7. Intonation Communication Skills

1. Situational Dialogues Speaking Activity – Introducing Oneself; Introducing Others; Meet and Greet

2. JAM Sessions

3. Describing an object/person/situation/place

4. Telephonic Conversations

5. Giving Directions

6. Review of a story/film/novel.

B.Tech - CSE –2014 -15

a b c d e f g h i j k l m x x x


Computer Science and Engineering ENGINEERING PHYSICS LAB – 1

Code: 4H181 L T P/D C - - 3/2 1

(Common to all branches) 1. Calculation of error – Error estimation

2. Determination of wavelength of a given laser Source of light by using diffraction grating

3. To find frequency of tunning fork – Melde’s experiment

4. To find the frequency of ac signal generator – A c Sonometer

5. R C Circuit

6. L C R series and parallel resonance

7. Determination of rigidity modulus of a given wire – Torsional pendulum

8. Determination of Planck’s constant

9. Determination of the acceleration to gravity and radius of gyration by compound pendulum.

Note: Any six of the above nine Experiments are to be conducted.

Prescribed Practical Book by Dr. Y. Aparna, Professor & HOD of Physics Department, JNTUH

B.Tech - CSE –2014 -15

a b c d e f g h i j k l m x x


Computer Science and Engineering ENGINEERING CHEMISTRY LAB

Code: 4H186

The objective of the Laboratory practicals is to make the student to acquire the basic Knowledge used for engineering applications.

1. Determination of Hardness of a ground water sample.

2. Preparation of Thiokol rubber.

3. Determination of Viscosity of a lubricant by Redwood Viscometer.

4. Estimation of Copper in Brass alloy (HYPO)

5. Estimation of Calcium in Portland cement.

6. Estimation of Iron content in Ore sample using Colorimeter (KSCN)

7. Estimation of rate of Corrosion of Aluminum in acidic and alkaline medium.

8. Determination of Mohr’s salt by Potentiometric method.

9. Determination of Calorific value of Solid fuel by using Bomb Calorimeter.

10. Experiment on Green chemistry; Aldol condensation(not by Classic route)

11. Determination of Flash point and fire point of a lubricant

12. Determination of strength of Strong Acid using Strong Base (HCl vs NaOH) by Conduct metric titrations.

L T P/D C - - 4/2 2

B.Tech - CSE –2014 -15



Computer Science and Engineering COMPUTER PROGRAMMING Lab

(Common to all Branches) Code: 4F171 L T P/D C

- - 3 2 1. Unit I (Cycle 1)

1. Write an algorithm for converting a given Celsius temperature to its equivalent Fahrenheit temperature and draw a flowchart.

2. Write an algorithm to find the largest of three given numbers and draw a flowchart. 3. Write an algorithm and draw a flowchart for finding the roots and nature of roots of a

quadratic equation, given its coefficients. 4. Write an algorithm and flowchart for finding the first n Fibonacci numbers, give n.

2. Unit II (Cycle 2)

1. Write an algorithm, flowchart, and C program for: 2. Finding the area and circumference of a circle of given radius. 3. Finding the volume of a sphere of given radius. 4. Finding the lateral surface area of a right circular cone of given base radius and height. 5. Finding selling price of an item, given its cost price and profit percent. 6. Finding the interest on a given principal for a given period of time at a given rate of per

year. 7. Write a C program to display all the sizes of data types in C. 8. Write a C program to display a given decimal integer into an equivalent octal number and

hexadecimal number using %o and %x in printf function. 3. Unit II (Cycle 3)

1. Write a C program to find the roots and nature of the roots of a quadratic equation, given its coefficients.

2. Write a C program for finding the largest of three given numbers. 3. A salesman gets a commission of 5% on the sales he makes if his sales is below

Rs.5000/- and a commission of 8% on the sales that exceeds Rs.5000/- together with Rs.250/-. Write an algorithm or a flowchart and develop C program for computing the commission of the salesman, given his sales.

4. Unit III (Cycle 4)

1. Write three C programs to print a multiplication table for a given number using while, do-while, and for loops.

2. Write a C program to compute the sum of: 3. 1+x+x2+x3+………….+xn, given x and n. 4. 1! + 2! + 3! + . . . + n!, given n.

B.Tech - CSE –2014 -15

5. 1 – x2/2! + x4/4! – x6/6! + x8/8! – x10/10! + … to n terms where the nth term becomes less than 0.0001.


1. Write a C program in the menu driven style to perform the operations +, -, *, /, % between two given integers.

2. Write a C program to find the largest and the least of some numbers given by the user. 3. Write a C program to find the sum of the digits of a positive integer.


1. Write C functions for the following: 1. A function that takes an integer n as argument and returns 1 if it is a prime number

and 0 otherwise. 2. A function that takes a real number x and a positive integer n as arguments and

returns xn. 3. A function that takes a positive integer n as an argument and returns the nth

Fibonacci number. 2. Using recursion write C functions for the following:

1. Factorial of a non-negative integer n. 2. Number of combinations of n things taken r at a time. 3. Greatest Common Divisor of two integers. 4. Least Common Multiple of two integers.

7. Unit III (Cycle 7) 1. Write a menu driven style program to compute the above functions (cycle 6) on the

choice of the function given by the user. 2. Define macros for the following and use them to find sum of the squares of the

minimum and maximum of two given numbers. 1. Larger of two numbers. 2. Smaller of two numbers. 3. Sum of the squares of two numbers.

3. Write a program to generate Pascal’s triangle. 4. Write a program to count the number of letters, words, and lines in a given text.

8. Unit IV (Cycle 8) 1. Write a program to store the numbers given by the user in an array, and then to find the

mean, deviations of the given values from the mean, and variance. 2. Write a C program to initially store user given numbers in an array, display them and

then to insert a given number at a given location and to delete a number at a given location.

3. Write a program to store user given numbers in an array and find the locations of minimum and maximum values in the array and swap them and display the resulting array.

B.Tech - CSE –2014 -15

9. Unit IV (Cycle 9) 1. Write a C program to implement the operations of matrices – addition, subtraction,

multiplication. 2. Write a program to find whether a given matrix is symmetric, lower triangular, upper

triangular, diagonal, scalar, or unit matrix.

10. Unit V (Cycle 10) 1. Write a function to swap two numbers. 2. Write a function to compute area and circumference of a circle, having area and

circumference as pointer arguments and radius as an ordinary argument. 11. Unit VI (Cycle 11)

1. Define a structure for complex number. Write functions on complex numbers (addition, subtraction, absolute value, multiplication, division, complex conjugate) and implement them in a menu driven style.

2. Define a structure point. Write a program to find the distance between two points. 3. Define a structure student having members roll no., name, class, section, marks.

Create an array of 10 students give the data and find the average marks, section-wise.

12. Unit VI (Cycle 12) 1. Write a program to:

1. Create a file by the name given by the user or by command line argument and add the text given by the user to that file.

2. Open the file created above and display the contents of the file. 3. Copy a file into some other file, file names given by the user or by command line

arguments. 4. Append a user mentioned file to another file. 5. Reverse the first n characters of a file.

B.Tech - CSE –2014 -15



Computer Science and Engineering ENGINEERING WORKSHOP – I

(Common to all branches) Code: 4B171 L T P/D C - - 3/2 1

1. House Wiring

To connect the Tube Light as per circuit diagram To connect the Calling Bell as per circuit diagram

2. Home Appliances Practice of disassembly and assembly of various home appliances such as Fans, Mixers and Washing machines etc. 3. Welding

Preparation and welding of Lap Joint Preparation and welding of Butt Joint

B.Tech - CSE –2014 -15



Computer Science and Engineering IT WORKSHOP-I Code: 4F172 L T P/D C - - 3/2 1 Week1: Introduction to Computer: Identify the peripherals of a computer, components/peripherals in a CPU & its functions. Introduction to the types of Operating System, Install computer with dual boot operating system (Windows, Linux with PowerPoint presentation). Comparison of types of OS in different platform. Week 2: Assembling and Disassembling Practicals Week 3: Introduction to Microsoft Windows 7: Software and data, Components of Desktop, Working with windows

Week 4: Getting Started with Microsoft Windows 7: Using the Start Menu, Obtaining Help on Windows, Changing Setting, Using Applications in Windows, Shutting Down Windows Week 5: Introduction to Linux Operating system, Linux Commands, DOS commands Week 6: Install computer applications in Linux and windows. Software and hardware trouble shoot, personal computer security settings and application software of the system. Cyber Ethics: Access websites and email, effectively and securely browse (bank sites, https WebPages) and share the data, categories of websites (.com, .in, .edu, .org).

TEXT BOOK: 1. “Comdex Information Technology Course Kit” by Vikas Gupta, Dreamtech Press

B.Tech - CSE –2014 -15



Computer Science and Engineering TECHNICAL PAPER WRITING AND SEMINAR- I

Code: 4E190 L T P/D C - - 2 1 Pre-Requisites: All Courses till this semester Course Outcomes:

o Students identify a topic from the current technical topics of their choice in the computer science domain and the allied fields, after surveying in the internet resources, journals and technical magazines in the library.

o Student learnt to arrange the contents of the presentation and scope of the topic, in an effective manner.

o Each student then presents the technical topic they chose in front of the panel and the fellow students, using the oratory skills.

o Students also face the questions posed by the panel and the students and answer them. There shall be a Technical Paper writing and seminar evaluated for 25 marks in First Year First Semester. The evaluation is purely internal and will be conducted as follows:

Paper writing : 05 marks Final report : 05 marks Presentation before a departmental committee

consisting of Head, a Senior Faculty and Supervisor : 15 marks

B.Tech - CSE –2014 -15


Syllabus for B. Tech I Year II semester

Computer Science and Engineering ENGLISH – II

Code: 4H202 L T P/D C 2 1 - 2

UNIT 1 Short Story Lesson: A Short Story of an Indian Engineer / A Talent, Undone by Bhargav Prasanna Grammar: Active and Passive Voice Vocabulary: Words and Phrases from the text Writing: Paragraph Writing (Guided and Free) Speaking: Narration of Places of Interest (India and Overseas) UNIT 2 Speech Lesson: The Convocation Speech by Narayana Murthy Vocabulary: Phrasal Verbs from the text Grammar: Direct and Indirect Speech Exercises related to speech Writing: Précis Writing Speaking: Speaking on Current Affairs / Latest Technology UNIT 3 Analysis of an Essay Lesson: The Secret of Work by Swami Vivekananda Vocabulary: One Word Substitutes Writing: Essay Writing Speaking: Giving Instructions and Directions UNIT 4 Life History Lesson: Three Days to See by Hellen Keller Concept and Elements of a Biography; Fiction and Non-Fiction; Ideas; Reminiscing Writing: Critical Appreciation Speaking: Speaking on past experiences and life’s events UNIT 5 Advancement of Technology Lesson: The Cyber Age (Polymer Bank Notes) Question and Answers regarding a report / Testing on Mood, Tense and Voice Vocabulary: Text Based Words / Meanings

B.Tech - CSE –2014 -15

Writing: Report on the economic status due to Credit/Debit Card Speaking: Debate on conventional Currency and “plastic money” UNIT 6 Thoughts to ponder… Lesson: On Forgetting by Robert Lynd Vocabulary: Text Based Words / Meanings Writing: Summarizing PRESCRIBED TEXT:

1. Compiled by Faculty - Department of English (SNIST) SUGGESTED READING:

1. Essential English Grammar by Raymond Murphy 2. Intermediate English Grammar by Raymond Murphy

B.Tech - CSE –2014 -15


Syllabus for B. Tech I Year II semester Computer Science and Engineering

ENGINEERING MATHEMATICS – II (Common to all branches except Bio-Technology)

L T P/D C Code: 4H213 4 1 - 4 UNIT I Matrices and Linear Systems: Rank of a Matrix, Echelon Form, Normal Form, Inverse of a Matrix by Gauss-Jordan method, Linear Dependence and Independence of Vectors, Solution of Linear Systems –Gauss Elimination Method, Rank method. Iterative methods-Gauss Jordon and Gauss Seidal Methods. Applications: Finding the current in electrical circuit. UNIT II Eigen values and Eigenvectors: Eigen values and Eigenvectors- properties, Cayley-Hamilton Theorem (without proof) and its Applications to find higher power and inverse of a matrix, Diagonalization of a Matrix. UNIT III Partial Differential Equations: Formation of partial differential equations by Elimination of Arbitrary Constants and Arbitrary Functions, Solutions of first order linear equation, Non-linear (Standard type) equations, Method of Separation of Variables. Classification of partial differential equations. Applications: One dimensional Wave, Heat equations.

UNIT IV Laplace Transformations: Laplace transform of standard functions, shifting theorems, change of scale property, Multiplication by powers of t, Divison by t, Laplace transform of unit step function, Impulse function and periodic functions. Inverse Laplace transforms: properties, partial fraction method and convolution theorem (without proof). Applications: Laplace transforms to solve ordinary differential equations with constant coefficients.

UNIT V Z- transforms: Z- Transforms and Inverse Z-transforms, properties, damping rule, Shifting properties, Initial and final value theorems, Convolution theorem. Applications-Solution of difference equation by Z- transforms

UNIT VI Fourier series: Fourier coefficients, Fourier series to the functions of any period p=2L, Fourier series of even and odd functions, Half-range Expansions. Applications: Fourier series to ordinary differential equations with boundary conditions. TEXT BOOKS: 1. Mathematical Methods of Science and Engineering, Kanti B.Datta, CENGAGE Learning. 2. Higher Engineering Mathematics, B.S. Grewal, Khanna Publications, New Delhi. 3. Engineering Mathematics, B. V. Ramana, Tata McGraw Hill Publishing Company Ltd. 4. Erwin Kreyszig: Advanced Engineering Mathematics, John Wiley and Sons, 8th Edition. REFERENCE BOOKS: 1. A Text Book of KREYSZIG’s Engineering Mathematics, Dr. A. Ramakrishna Prasad, Wiley Publications. 2. Advanced Engineering Mathematics, S. R. K. Iyengar and R.K. Jain, Narosa Publishing House, London, 2002.

B.Tech - CSE –2014 -15



Computer Science and Engineering Engineering Physics – II

(EEE, ECE, ECM, CSE, IT) Code: 4H222 L T P/D C

3 1 - 3 UNIT I Semiconductor Physics: Fermi Level in Intrinsic and Extrinsic Semiconductors, calculation of carrier concentration of Intrinsic and Extrinsic Semiconductors, Direct & Indirect Band Gap Semiconductors, Thermistor, Hall Effect in semiconductors and applications. UNIT II Physics of Semiconductor Devices: Formation of PN Junction and working of PN junction. Energy Diagram of PN Diode, I-V Characteristics of PN Junction, LED, Solar cell, applications. UNIT III Dielectric Properties: Electric Dipole, Dipole Moment, Dielectric Constant, Electric Susceptibility, Electronic and Ionic polarizabilities; Orientation Polarization(qualitative), Internal fields in Solids, Clausius-Mossotti equation,Frequency and temperature effect on Dielectrics(qualitative),Piezo-electricity, Pyro-electricity and Ferro- electricity, Applications. UNIT IV Magnetic Properties Permeability, Field intensity, Magnetic Induction, Magnetization, Magnetic Susceptibility, Origin of Magnetic Moment, Bohr Magneton, Classification of Dia, Para and Ferro Magnetic Materials on the basis of Magnetic Moment, Domain Theory of Ferro Magnetism on the basis of Hysteresis Curve, Soft and Hard Magnetic Materials, Properties of Anti-Ferro and Ferri Magnetic Materials and their applications, Super conductivity, effect of Magnetic Field, Critical current density, Meissner’s effect, Type-I & Type-II superconductors, Introduction to BCS theory of Superconductivity, applications of super conductors. UNIT V Lasers: Characteristics of Lasers, Spontaneous and Stimulated Emission of Radiation, Meta-stable State, Population Inversion, Lasing Action, Einstein’s Coefficients and Relation between them and significance, Ruby Laser, Helium-Neon Laser, Semiconductor Diode Laser, Applications of Lasers. Basics of Fibre Optics: Introduction, Principle of Optical Fibre, Acceptance Angle and Acceptance Cone, Numerical Aperture, Types of Optical fibres. Attenuation in Optical Fibres, Optical Fibre in communication system. UNIT VI Nanotechnology: Origin of Nanotechnology, Nano Scale, Surface to Volume Ratio, Quantum Confinement, Bottom-up Fabrication: Sol-gel, Precipitation, Chemical Vapour Deposition; Top-down Fabrication: Thermal evaporation, Ball Milling, Characterization of Nano materials(XRD&TEM), carbon nanotubes, Applications of Nano Materials.

TEXT BOOKS:

B.Tech - CSE –2014 -15

1. P K Palanisamy, Engineering Physics, Sitech Publications REFERENCE BOOKS: 1. Introduction to Solid Physics, by Charles Kittel 2. Solid State Physics Neil by W. Ashcroft, N. David Mermin 3. Solid State Physics by S L Singal 4. Physics for semiconductor devices by Michael Shur 5. Engineering Phisics P K Palanisamy 6. Nanotechnology: A Gentle Introduction To The Next Big Idea by M Ratner, D Ratner 7. Nano Materials by A K Bandyopadhyay 8. Applied Physics by P.K. Mittal 9. Modern Engineering Physics by S.Chandralingam, K.Vijay Kumar 10. Heat and Thermodynamics by Zemansky

B.Tech - CSE –2014 -15



Computer Science and Engineering DATA STRUCTURES AND C++

(Common to all Branches) Code: 4E201 L T P/D C 4 1 - 4 UNIT I Introduction to data structures: Abstract data type (ADT), Stacks and Queues circular queues and their implementation with arrays. Applications of Stack: infix to post fix conversion, postfix expression evaluation. Applications of Queues Objective: On completion of the unit/chapter, a student should be able to: (i) Define what is an abstract data type (ii) Differentiate linear and non-linear data structures (iii) Representation and implementation of stack and queue using arrays. (iv) Convert the given infix expression to post fix notation and evaluate the postfix expression using stack. (v) Understand the applications of stack and queue.

UNIT II Singly linked lists, Advantages of Linked lists over Arrays, Doubly linked lists, Circular list and their operations, representing stacks and queues with Linked lists. Objective: On completion of the unit/chapter a student should be able to:(i) Understand what is a linked list (ii) know how structurally the distinct categories of lists differ from each other (iii) implement various categories of lists such as singly linked lists, doubly linked lists and circular lists (iv) understand how to represent and implement stack and queue using linked list

UNIT III Trees- Binary trees, terminology, representation, traversals. AVL trees, AVL tree operations: Insertion, deletion and searching. Graphs- terminology, representation, graph traversals (DFS & BFS). Objective: On completion of the unit/chapter a student should be able to:(i)understand the terminology and uses of trees and graphs(ii)explain distinct representations of trees as well the graphs(iii)analyze binary search tree(iv)construct binary search tree, given the elements and traverse the tree in pre-order, in-order and post-order(v)differentiate Depth First Search(DFS) and Breadth First Search (BFS) techniques and could traverse through the graph using DFS and/or BFS UNIT IV Searching - Linear and binary search methods. Hash table representation, hash functions, double hashing. Sorting - Bubble sort, Selection sort, Insertion sort, Quick sort, Merge sort.

B.Tech - CSE –2014 -15

Objective: On completion of the unit/chapter a student should be able to:(i)understand what is meant by searching and could differentiate linear search operation performed on an ordered set of elements and an unordered set of elements(ii)differentiate the linear search and binary search techniques (iii)explain the procedure involved in binary search method(iv)understand the necessity of sorting techniques(v)list and implement different types of sorting techniques(vi)know and compare the time complexity of each sorting technique UNIT V Introduction to C++ programming-object oriented programming concepts, Structured Vs OOP. Classes and objects-class definition, Objects, class scope and accessing members, Constructors-default constructor, parameterized constructor, constructor initialization list, copy constructor. Destructors. Objective: On completion of the unit/chapter a student should be able to:(i)differentiate structured programming approach and the object oriented programming approach(ii)understand the terms class, object and could write simple programs in C++ (iii)understand how to use access specifiers (iv)explain the differences between constructor and normal function UNIT VI Static class members, this pointer, friend functions, Dynamic memory management with operators new and delete. Overloading-function overloading, Operator overloading, restrictions on operator overloading, overloading unary and binary operators, templates, inheritance: single, multiple and multi level inheritance. Objective: On completion of the unit/chapter a student should be able to:(i)describe static class members(ii)make use of this pointer, friend function(iii)demonstrate the dynamic memory allocation and deallocation (iv)understand what is overloading and write programs on function overloading, operator overloading(v)understand and differentiate types of templates (vi)learn inheritance and its usage. TEXT BOOKS: 1. Data Structure through C by Yashavant Kanetkar. 2. The complete reference C++ By Herb Schildt. 3. Data Structures, A pseudocode Approach with C by Richard F. Gilberg & Behrouz A. Forouzan.

REFERENCES: 1. Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft. Data Structures and Algorithms. Addison Wesley, 1983. 2. Data Structures using c Aaron M.Tenenbaum , Yedidyah Langsam,Moshe J Augenstein. 3. Introduction to Data Structures In C By Kamtane

B.Tech - CSE –2014 -15



Computer Science and Engineering ENGINEERING DRAWING – II

(Common to all branches) Code: 4B202 L T P/D C 2 - 3 3 UNIT – I Scales: Construction of Plain, Diagonal, Comparitive, Vernier Scales and Scale of chords. UNIT – II Development of Surfaces: Development of Surfaces of Right Regular Solids – Prisms, Cylinders, Pyramids, Cones and their parts. UNIT – III Isometric Projections/views: Principles of Isometric Projection – Isometric Scale – Isometric Views – Conventions – Isometric Views of Lines, Plane Figures, Simple and Compound Solids – Isometric Projection of objects having non- isometric lines. Conversion of Orthographic Views to Isometric Views of simple objects. UNIT –IV Transformation of Projections: Conversion of isometric views to orthographic views of simple objects. UNIT –V Perspective Projections: Principle, Perspective elements, Perspective View of Points, Lines, Plane Figures and Simple Solids - Vanishing Point Method, Visual ray method. UNIT –VI Introduction to Computer Aided Drafting: Generation of points, lines, curves, polygons, simple solids, dimensioning. TEXT BOOKS: 1. Engineering Drawing, N.D. Bhatt / Charotar publishers 2. Engineering Drawing 2nd Edition Basant Agrawal, C. M. Agrawal, Tata McGraw-Hill Education REFERENCES:

1. Engineering Drawing, K.Venugopal/G.Sreekanjana, New Age International Publishers.

B.Tech - CSE –2014 -15



Computer Science and Engineering ENGINEERING CHEMISTRY-II

(Common to EEE, ME, ECE, CSE, IT and ECM) Code: 4H232 UNIT I POLYMER TECHNOLOGY Polymer, polymerization - Types of Polymerization. Plastics – thermosetting and thermoplastics, preparation, properties and Engineering applications of the following: PVC, Teflon, Bakelite, Nylon 6,6 and epoxy resins. Rubber – natural and artificial rubber, vulcanization of natural rubber, Buna-S, Buna-N and their Engineering applications. Conducting polymers- classification, preparation of polyacetylene, polyaniline and their Engineering applications.

UNIT II SURFACE CHEMISTRY AND COLLOIDS Surface Chemistry: Adsorption – Types of Adsorption, Isotherms Langmuir adsorption isotherm. Engineering applications of adsorption. Colloids: Classification of colloids, Electrical and optical properties, micelles, gold number, Types of emulsions, preparation, Emulsifier, liquid in solids(gel), classification, preparation and properties Engineering applications of colloids in industry. UNIT III FUEL TECHNOLOGY Classification of Fuels- Solid, Liquid & gaseous fuels. Characteristics of good fuel, calorific value (HCV&LCV). Determination of calorific value by Bomb & Junkers gas calorimeter. Solid Fuels:- Coal and its chemical composition, Analysis of Coal and their importance. Liquid fuels:-Source –Petroleum-refining of petroleum- Production of petrol by Bergius and Fischer tropsch’s process.- (the production of synthetic petrol). Gaseous Fuels:- Natural gas –Analysis of flue gas by Orsat’s apparatus. Engineering applications of fuels. UNIT IV EXPLOSIVES, PROPELLANTS AND LUBRICANTS Explosives: Classification, Precautions during Storage, blasting fuses, important explosives and their Engineering applications. Propellants: Classification of Propellants, Solid Rocket propellants and their engineering applications Lubricants: Classification- Solid , Semi Solid, Liquid, emulsion- Properties- Selection of lubricants for different purposes. Lubrication: Mechanism of lubrication (fluid film, boundary and extreme pressure lubrication). Characteristics of Lubricants, Viscosity, viscosity index, Cloud and pour point, flash and fire point, mechanical strength.Engineering applications of lubricants. UNIT V

L T P/D C 3 1 - 3

B.Tech - CSE –2014 -15

CHEMISTRY OF ENGINEERING MATERIALS Refractories : Definition, Classification with examples, criteria of a good refractory material, Causes for the failure of a Refractory material. Engineering applications of refractories.

Insulators: Definition & Classification with examples, Characteristics of Insulating materials-Thermal insulators, Electrical insulators- Their Characteristics and Engineering applications of electrical insulators.

Glass:- Manufacture of glass –types of glasses-Soft glass- hard glass , Applications of glass as an Engineering and Architectural material.

Ceramics : Structural clay products, white wares and chemical stone wares. Engineering applications of ceramics.

UNIT VI

GREEN CHEMISTRY Introduction, Concepts, Principles of green chemistry, development of green chemistry, importance of measurement in green chemistry, Principles of green engineering. Engineering Applications of green chemistry: Manufacutre of polylactic acid for plastic production, Production of biodegradable polymer (poly hydroxyl alkanoates (PHA).

TEXT BOOKS:

1. Engineering Chemistry: P.K. Jain and M.K. Jain, Dhanpathrai Publications-14th Edition.

REFERENCE BOOKS:

1. Essentials of Physical Chemistry: Baul & Tuli, S. Chand Publications. 2. Text of Engineering Chemistry by S.S. Dara & Mukkanti, S. Chand & CO, New Delhi (2014). 3. Chemistry of Engineering Materials by C.V. Agarwal,C.P.Murthy,A.Naidu; BS publications. 4. Sharma, R.K.; Sidhwani,I.T. & Chaudhari, M.K. Green Chemistry Experiments: A Monograph,

I.K. International Publishing Hopuse pvt Ltd. New Delhi, Bangalore(2013). 5. Text Book of Nano Science and Nano Technology by B.S. Murthy and P.Shankar, University

press.

B.Tech - CSE –2014 -15



Computer Science and Engineering BASIC MECHANICAL ENGINEERING

(Common to All Branches except Mechanical Engineering) Code: 4BC04 L T P/D C

3 2 - 3 UNIT I Thermodynamics: Basic concepts of Thermodynamics, Property of gases, Zeroth Law. First Law of Thermodynamics and its applications, Second Law of Thermodynamics, Carnot cycle, Air standard cycles – Otto, Diesel Cycles. Internal combustion engines: Internal combustion engines, definition, classification, components, working of two-stroke, four stroke cycle engines, SI and CI Engines, Performance parameters, Need for cooling, and lubrication of IC engines. UNIT II Steam Power plant, Boiler, Steam Turbines: Layout of steam power plant, Water tube and Fire tube Boilers: “Cochron”, Babcock and Wilcox Boiler and High Pressure Boilers (Benson & La-mount only). Steam turbines: Impulse & Reaction Turbines Gas turbine-power plants: Closed & Open cycle types UNIT III Hydraulic pumps & turbines: Centrifugal Pumps, Pelton wheel, Francis turbine and Kaplan Turbine - Layout of Hydro electric power plant Refrigeration & Air conditioning systems: Description of Vapour Compression and Vapour Absorption systems UNIT IV Manufacturing Processes Foundry Practice: Patterns, Molding and Molding materials, casting methods-Sand Casting, Shell mould Casting, Investment Casting, Die Casting, Centrifugal casting – Principle and Application of these processes Welding: Types of Welding- Electric Arc welding - Coated electrode, TIG welding & MIG welding, Gas welding and cutting, Resistance welding- Spot welding, Soldering and Brazing . UNIT V Mechanical working :- Hot and Cold working, Rolling- Rolling products, Types of Rolling mills, Forging-operations, forging methods, Extrusion-methods, Metal Spinning and Wire Drawing Press working operations:-Cutting, Bending, Drawing and Squeezing

B.Tech - CSE –2014 -15

UNIT VI Machine tools: Construction of lathe, shaper, drilling, milling, grinding and CNC machine tools-Advantages, Machine controls, vertical & horizontal spindles. TEXT BOOKS:

1. Mathur, M.L., Mehta, F.S. and Tiwari, R.P., Elements of Mechanical Engineering, Jain Brothers, New Delhi, 2005.

2. R.K. Rajput, “Elements of Mechanical Engineering”, Laxmi Publications, 1994. REFERENCES:

1. P.N.Gupta, M.P. Poonia, “Elements of Mechanical Engineering”, Standard Publishers Distributors Nai Sarak, Delhi.

2. R.C.Gupta, “Mechanical Engineering”, Khanna Publishers, Delhi.

B.Tech - CSE –2014 -15



Computer Science and Engineering ENGLISH LANGUAGE LAB – II

Code: 4H272 L T P/D C

- - 2 1 Lab Activities:

1. Reading Comprehension / Vocabulary Activities




5. Reading Comprehension / Grammar



8. Reading Comprehension / Grammar Communication Skills:

1. Speaking Activity: Agreement and Disagreement

2. Speaking Activity: Hobbies / Books

3. Speaking Activity: Hobbies / Movies / Travel

4. Speaking Activity: Picture Perception

5. Speaking Activity: Picture Perception

6. Speaking Activity: Extemporaneous

7. Speaking Activity: Debate

B.Tech - CSE –2014 -15



Computer Science and Engineering DATASTRUCTURES AND C++ LAB

(Common to all Branches) Code: 4E271 L T P/D C

- - 3 2 Lab Objective: On completion of all the exercises, a student should be able to:

Represent and Implement the operations on basic linear and non-linear data structures Implement basic C++ programs using object oriented programming concepts

1. Write a C program that implement stack and its operations using arrays 2. Write a C program that implement Queue and its operations using arrays. 3. Write a C program that uses Stack operations to perform the following i) Converting infix expression into postfix expression ii) Evaluating the postfix expression 4. Write a C program that uses functions to perform the following operations on singly linked list: i) Creation ii) Insertion iii) Deletion iv) Traversal 5. Write a C program that uses functions to perform the following operations on doubly linked list: i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways 6 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, inorder and postorder. 7. 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 8. 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 9. 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 iii) Selection Sort 10. Write a C++ program that prints all real solutions to the quadratic equation ax2+bx+c=0. Read in a,b,c and use the quadratic formula. If the descremainant b2-4ac is negative, display a message stating that there are no real solutions. 11. A Fibonacci Sequence is defined as follows: the first and second terms in the sequence are 0 and

Subsequent terms are found by adding the preceding two terms in the sequence. Write a C++ program to generate the first n terms of the sequence.

12. Write a C++ program that checks whether a given string is palindrome or not. TEXT BOOKS: 1. Data Structure through C by Yashavant Kanetkar. 2. The complete reference C++ by Herb Schildt. 3. Data Structures, A pseudocode Approach with C by Richard F. Gilberg & Behrouz A. Forouzan.

B.Tech - CSE –2014 -15



Computer Science and Engineering ENGINEERING PHYSICS LAB – II

(Common to all branches) Code: 4H282 L T P/D C

- - 3/2 1

1. Energy gap of a semiconductor

2. To study the characteristics of a thermistor

3. Characteristics of laser Diode

4. Numerical aperture of optical fiber and Bending losses of an optical fiber

5. Diffraction Grating.

6. Stewart & Gee’s Experiment (Determination of magnetic induction flux density along the axis of

a circular coil).

7. Newton’s Rings

8. Hall effect

9. Dielectric constant of a given material

10. Dispersive power of Prism

Note: Any six of the above nine Experiments are to be conducted

Prescribed Practical Book by Dr. Y. Aparna, Professor & HOD of Physics Department, JNTUH

B.Tech - CSE –2014 -15



Computer Science and Engineering IT WORKSHOP-II Code: 4F273 L T P/D C

- - 3/2 1 Week 1: Introduction to S/W's difference b/w hardware and software. Introduction to MS-Office and its importance. Using word – Accessing, Overview of toolbars saving files, rulers, format painter. Features: Formatting fonts, Drop cap, Applying text effects, character spacing, Boarders, colors, insert Header & Footer, Date & Time options. Week 2: Creating Project Formatting styles, Inserting Table, Bullets & Numbering, Changing Text Direction, Cell Alignment, Footnote, Hyperlink, Symbols, Spell check, Track changes. Week 3: Creating News letters Table of content, Newspaper columns, Images from files & Clip Art, Drawing toolbar & Word Art, Formatting Images, Textboxes, Paragraphs & Mail merge. Week 4: Basics of Power Point Presentation Features : PPT Orientation, Slide layouts, Inserting Text, Word Art, Formatting Text, Bullets & Numbering, Auto shapes, Lines & Arrows, Hyperlinks, Inserting Images, ClipArt, Audio, Video, Objects, Tables & Charts, Master layouts (Slide template & Notes), types of views (basic, Presentation, slide slotter, notes), Inserting – Background, text , Design Templates, Hidden slides. Week5: Introduction to Excel Features: Accessing, Overview at toolbars, saving excel files, Gridlines, Format cells, Summation, Auto fill, formatting text. Week 6: Formula in excel – Average, Standard Deviation, Charts, Roaming & Inserting worksheets, Hyper linking, count function, lookup / Vlookup, sorting, Conditional formatting. Week 7: Introduction to HTML, Features: Formatting Tags, Linking of pages using Anchor Tags, Table tags Websites and Textbooks:

1. Complete Reference Microsoft Office 2007 2. https://office.microsoft.com/en-us/support/ (office help and how-to) 3. W3schools.com

B.Tech - CSE –2014 -15



Computer Science and Engineering TECHNICAL PAPER WRITING AND SEMINAR- II





o Students also face the questions posed by the panel and the students and answer them. There shall be a Technical Paper writing and seminar evaluated for 25 marks in First Year Second Semester. The evaluation is purely internal and will be conducted as follows:



B.Tech - CSE –2014 -15


Syllabus for B. Tech. II Year I semester

Computer Science and Engineering ENGINEERING MATHEMATICS – III

(Common to all branches except Bio-Tech) L T P/D C Code: 4H315 3 2 - 3 UNIT I Special Functions: Beta, Gamma Functions –Properties, Relation between Beta and Gamma functions. Applications: Evaluation of improper integrals. UNIT II Complex Analysis: Limits, continuity and differentiation, Analytic functions, Cauchy-Riemann equations, Complex integration, Cauchy’s integral theorem (without proof), Cauchy’s integral formula. Taylor’s and Laurent’s series, Singularities and zeros, Cauchy’s Residue Theorem (without proof). Applications: Evaluation of real integrals using Cauchy residue theorem. UNIT III Fourier Transform: Fourier transform of a function, Sine and Cosine transformations, Finite fourier transform, Parseval’s identity. Application : Solution of differential equations using Fourier transform. UNIT IV Solution of algebraic and transcendental equations and Numerical integration: Introduction – The Bisection Method – The Method of False Position – The Iteration Method – Newton-Raphson Method, Trapezoidal rule – Simpson’s 1/3 rule , Simpson’s 3/8 rule. UNIT V Interpolation: Introduction-– Finite differences- Forward Differences, Backward differences, Central differences. Newton’s formulae for interpolation – Gauss Central Difference Formulae (without proofs), Lagrange’s Interpolation formula for unevenly spaced points. UNIT VI Numerical solution of Ordinary Differential equations: Solution by Taylor’s series –Picard’s Method of Successive Approximations –Euler’s Method, Runge-Kutta Methods, Predictor-Corrector Methods- Milne’s method, Adams-Bashforth method. TEXT BOOKS: 1. Mathematical Methods of Science and Engineering, Kanti B.Datta, CENGAGE Learning. 2. Higher Engineering Mathematics, B.S. Grewal, Khanna Publications, New Delhi. 3. Engineering Mathematics, B. V. Ramana, Tata McGraw Hill Publishing Company Ltd. 4. Erwyn Kreyszig: Advanced Engineering Mathematics, John Wiley and Sons, 8th Edition. REFERENCE BOOKS: 1. A Text Book of KREYSZIG’s Engineering Mathematics, Dr. A. Ramakrishna Prasad, Wiley Publications. 2. Advanced Engineering Mathematics, S. R. K. Iyengar and R.K. Jain, Narosa Publishing House, London, 2002.

B.Tech - CSE –2014 -15



Computer Science and Engineering ELECTRONIC DEVICES AND CIRCUITS

(Common to CSE, ECE, ECM & EEE) Code: 4CC01 L T P/D C 4 1 - 4 After studying this course, the students will be able to

1. Understand the Principle of operation and applications of CRO. 2. Understand the operation of diode and its application as rectifier. 3. Understand the Fundamentals of BJT operation, Characteristics and different biasing circuits. 4. Understand the Fundamentals of JFET operation, Characteristics and importance of MOSFETs. 5. Understand the Small signal Model of BJT and Amplifier Analysis under CB, CE and CC configurations. 6. Understand the Basic regulator circuits and voltage multipliers.

UNIT I ELECTRON DYNAMICS AND CRO: Motion of charged particles in electric and magnetic fields. Simple problems based on electric and magnetic fields. Electrostatic and magnetic focusing. Principle of CRT. Deflection Sensitivity (Electrostatic and Magnetic deflection). Parallel Electric and Magnetic fields. UNIT II PN JUNCTION DIODE: P-N junction diode under forward & reverse bias. Transition capacitance and Diffusion capacitance. Break down of junctions (Avalanche and Zener Break down).Zener Diode Characteristics. Applications: Half wave Rectifier, Full wave Rectifier, Bridge Rectifier: Analysis. UNIT III BIPOLAR JUNCTION TRANSISTOR: Fundamentals of BJT& Operation, Minority carrier profiles. I/P and O/P Characteristics CB, CE and CC configurations. Switching characteristics (Rise time, Fall time, Delay Time and Storage time) .Biasing Methods & Stabilization Fixed Bias, Collector to Base Bias, Voltage Divider Bias and Problems, Thermal runway in BJTs. UNIT IV FIELD EFFECT TRANSISTOR: Working of JFET, JFET characteristics, Drain current equation, FET Parameters, Small signal model of JFET. Construction and characteristics of MOSFET (Enhancement and depletion mode); Comparison of JFET & MOSFET .SCR: Two transistor Analogy and Characteristics, UJT: Operation and Characteristics. UNIT V TRANSISTOR AMPLIFIERS: Small signal Model of BJT, h-parameter representation-Determination of voltage gain, current gain, input impedance, output impedance .CE Amplifier-its Analysis,Frequency Response. Problems. RC coupled amplifier: Analysis. Approximate analysis of CB and CC Amplifiers. UNIT VI VOLTAGE REGULATORS: Terminology, Basic regulator circuit: Zener, Transistor Based: Shunt and Series Voltage regulators. Protection Circuits: Current limiting, Short circuit protection. Specifications of Voltage regulator, Voltage multipliers.

B.Tech - CSE –2014 -15

TEXT BOOKS: 1. Electronic Devices and Crcuits-J.Millman, C.C.Halkias and satyabratha jit Tata Mc Graw Hill, 2 Ed. 2007 2. Electronic Devices AND Circuits-R.L.Boylestad &Louis Nashelsky, Pearson/Prentice Hall, 9th edition, 2006. REFERENCES: 1. Integrated Electronics- J.Millman, C.C.Halkias, 1991 ed., 2008, TMH. 2. Electronic Devices and Circuits – K.LalKishore, 2 ed., 2005, BSP 3. Electronic Devices and Crcuits by Sanjeev Guptha,Dhapat Rai Publications.

4. Electronic Devices and Circuits by S.Salivahanan and N.Suresh Kumar, Tata Mc Graw Hill Publications

B.Tech - CSE –2014 -15



Computer Science and Engineering SWITCHING THEORY AND LOGIC DESIGN

Code: 4CC02 L T P/D C 4 1 - 4 After studying this course, the students will be able to

1. Understand the rules of Boolean algebra and use it to simplify Boolean expressions. 2. Understand simplification of Boolean expressions using K-map. 3. Understand operations of combinational circuits such as fullaadders, multiplexers, decoders, encoders.

codeconverters. 4. Understand the operation of sequential circuits such as flip-flops 5. Understand the operation of counters and registers. Able to design them. 6. Understand the structure of PLD’s such as ROM’s, PLA’s, PAL s. Understand the basic concepts of State

Machine Charts and models.

UNIT I Number System: binary, decimal, octal, hexa decimal, weighted and un-weighted codes. Boolean Algebra: Axiomatic definition of Boolean algebra, Binary operators, postulates of and theorems. Boolean addition, subtraction, 1’s complement, 2’s complement. Switching functions, Canonical forms and Standard forms, Simplification of switching functions using theorems. UNIT II Logic gates: Basic gates and universal gates. Minimization of Switching Functions: Karnaugh map method, Prime implicants, don’t care combinations, Minimal SOP and POS forms, Quine-McCluskey Tabular Method, Prime Implicant chart, simplification rules. UNIT III Combinational Logic Design: Single output and multiple output combinational logic circuit design, AND-OR, OR-AND, and NAND/NOR realizations, Exclusive-OR and Equivalence functions, Binary adders/subtractors, Encoder, Decoder, Multiplexer, Demultiplexer, MUX realization of switching functions, Parity bit generator, Code-converters, Contact Networks, Hazards and hazard free realizations. UNIT IV Sequential Circuits 1: Classification of sequential circuits (Synchronous, Asynchronous Pulse mode, and Level mode with examples). Basic flip-flops-Triggering and excitation tables. Conversions of flip flops.

B.Tech - CSE –2014 -15

UNIT V Sequential Circuits 2: The sequential circuit model. Asynchronous counters, Design of simple synchronous sequential circuits such as counters. Design of modulo-N counter, Ring counter, twisted ring counter. Shift registers UNIT VI Programmable Logic Devices: Basic PLD’s-ROM, PROM, PLA, and PLD Realization of Switching functions using PLDs. Algorithmic State Machines: State machines and state diagrams. Examples of weighing machine and Binary multiplier. . TEXT BOOKS:

1. Morris Mano-,Digital design –PHI, 2nd Edition. 2. Zvi Kohavi -Switching & Finite Automata theory – TMH, 2nd Edition.

REFERENCES:

1. Fletcher -An Engineering Approach to Digital Design – PHI. 2. Charles H. Roth,-Fundamentals of Logic Design –Thomson Publications, 5th Edition, 2004. 3. R.P.Jain-Switching Theory and Logic Design- TMH Edition, 2003. 4. John M. Yarbrough -Digital Logic Applications and Design – Thomson Publications, 2006 5. CVS Rao -Switching Theory and Logic Design –Pearson Education, 2005

B.Tech - CSE –2014 -15



Computer Science and Engineering BASIC ELECTRICAL ENGINEERING

(Common to MECH, CSE, IT & BT) Code: 4AC41 L T P/D C 3 1 - 3 UNIT I Introduction to Electrical Engineering: Ohm’s Law, Basic circuit components, Kirchhoff’s Laws. Types of sources, Source transformation, V- I relationship for passive elements. Series parallel circuits, Star - delta and delta - star transformations, mesh and nodal analysis. Networm theorems – superposition, thevenin’s theorem & maximum power transfer theorem, simple problems. UNIT II Fundamentals of Single phase and three phase AC circuits: Principle of AC voltage, wave forms & basic definitions. R.M.S. and Average values of alternating currents and voltage, Form factor and Peak factor, Phasor representation of alternating quantities, the ’j’ operator and phasor algebra, Analysis of ac circuits with single basic network elements, Single phase series circuits. Faraday’s laws of electro-magnetic induction, concept of self and mutual inductances. UNIT III D.C Machines: Principle of operation of D.C generators, Types of D.C generators, E.M.F equation, Principle of operation of D.C motors, Types of D.C motors, Torque equation, Losses and efficiency calculation in D.C Generators and D.C motors. UNIT IV Single Phase Transformers: Principle of operation, Constructional Details, Ideal Transformer and Practical Transformer, equivalent circuit, Losses, OC and SC Test, Efficiency and Regulation Calculations, Elementary treatment & Simple problems. Unit V Three phase circuits and induction motors: Three phase circuits – phase sequence, Star and delta connection, Relation between line and phase voltages and currents in a balanced system. Three phase induction motor: Principle of operation, Construction, Types, Problems on slip, rotor frequency, rotor emf and torque. UNIT VI Basic Instruments: Introduction, classification of instruments, operating principles, essential features of measuring instruments, permanent magnet moving coil (PMMC) instruments, moving iron (MI) instruments, extension of ammeter and voltmeter ranges.

B.Tech - CSE –2014 -15

TEXT BOOKS: 1. Basic electrical Engineering – M.S.Naidu and S.Kamakshiah – TataMcGraw-Hill, 2005 edition 2. Basic Electrical Engineering –T.K.Nagesarkar and M.S.Sukhja Oxford University Press.2nd edition REFERENCES: 1. Theory and problems of Basic electrical Engineering - D. P. Kotahari & I. J. Nagrath PHI. 2. Principles of Electrical Engineering - V. K. Mehta, S. Chand Publications. 2nd edition.

B.Tech - CSE –2014 -15



Computer Science and Engineering OBJECT ORIENTED PROGRAMMING THROUGH JAVA

(COMMON TO CSE, IT & ECM) Code: 4EC03 L T P/D C 4 1 - 4 UNIT I History of Java, Java buzzwords, datatypes, variables, simple java program, scope and life time of variables, operators, expressions, control statements, type conversion and costing, arrays,, classes and objects – concepts of classes, objects, constructors, methods, access control, this keyword, garbage collection, overloading methods and constructors, recursion, string handling, StringTokenizer. Objective: On the completion of the unit, a student should be able to: i) Write ,compile and execute simple java programs ii) Understand the syntax of classes and objects creation in java iii) Explain the differences between classes and objects iv) differentiate methods and constructors v) Understand constructor and method overloading vi) Understand how to handle strings in java

UNIT II Inheritance –Definition, single inheritance, benefits of inheritance, Member access rules, super class, polymorphism- method overriding, Dynamic method dispatch, using final with inheritance, abstract classes, Base class object. Interfaces: definition, variables and methods in interfaces, differences between classes and interfaces, usage of implements and extends keyword, an application using interfaces, uses of interfaces. Applications using interface Applications using packages Objective: On the completion of the unit, a student should be able to: i) Explain the benefits of inheritance ii) Understand how to access members of super class from subclass iii) Differentiate static and dynamic polymorphism iv) Understand the usage of final keyword in inheritance v) Understand the use of abstract class vi) Understand how to implement multiple inheritance in java vii) Explain the difference between classes and interfaces viii) Create and import packages ix) Understand different streams

UNIT III Packages: Definition, types of packages, Creating and importing a user defined package. Introduction to I/O programming: DataInputStream, DataOutputStream, FileInputStream, FileOutputStream, BufferedReader. Collections: interfaces, Implementation classes, and Algorithms (such as sorting and searching).

B.Tech - CSE –2014 -15

Objective: On the completion of the unit, a student should be able to: i) Understand uses of packages and Collections ii) To study and implement various classes and interfaces of Java Collections Framework.

UNIT IV Exception handling -exception definition, benefits of exception handling, exception hierarchy, usage of try, catch, throw, throws and finally, built in exceptions, creating own exception sub classes. Multi-Threading:-Thread definition, types of multitasking, uses of multitasking, thread life cycle, creating threads using Thread class and Runnable interface, synchronizing threads, daemon thread. Applications of multithreading. Objective: On the completion of the unit, a student should be able to: i) Understand benefits of exception handling ii) Handle built-in and user defined exceptions iii) Understand the uses of multi-threading iv) Create multi-threaded programs using either Thread class or Runnable interface v) Know how to synchronize threads

UNIT V Advantages of GUI over CUI ,The AWT class hierarchy, Introduction to Swings, Swings Elements:- JComponent, JFrame, user interface components- JLabels, JButton, JScrollbars, text components, check box, check box groups, choices, lists panels – scrollpane, menubar, graphics, layout, managers –boarder, grid, flow, card and grid bag. Event handling: Delegation event model, closing a Frame, mouse and keyboard events, Adapter classes. Applications: developing calculator, developing feedback form, developing bio data. Objective: On the completion of the unit, a student should be able to: i) Understand the advantages of GUI over CUI ii) Write GUI programs iii) Able to handle events using delegation event model iv) Use Swings elements in programs UNIT VI Applets – Concepts of Applets, differences between applets and applications, life cycle of an applet, types of applets, creating applets, passing parameters to applets. Applications: Developing of simple advertisements. Networking – Basics of network programming, addresses, ports, sockets, simple client server program, multiple clients, sending file from server to client. Applications: One to one Chat application Objective:

B.Tech - CSE –2014 -15

On the completion of the unit, a student should be able to: i) Write applet programs ii) Understand the concepts of networking iii) Understand socket programming iv) Write client-server applications TEXT BOOKS: 1. Java; the complete reference, 6th edition, Herbert Schildt, TMH. 2. Introduction to Java programming 6th edition, Y. Daniel Liang, Pearson education. REFERENCES: 1. Core Java 2, Vol 1, Fundamentals, Cay. S. Horstmann and Gary Cornell, seventh Edition, Pearson Education. 2. Core Java 2, Vol 2, Advanced Features, Cay. S. Horstmann and Gary Cornell, Seventh Edition, Pearson Education

B.Tech - CSE –2014 -15



Computer Science and Engineering MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE

Code: 4F302 L T P/D C 3 1 - 3 Unit I Statements and Notations Connectives – Negation, Conjunction, Disjunction – Statement Formulas and Truth Tables – Well-formed Formulas – Tautologies – Equivalence of Formulas – Duality – Tautological Implications. Normal Forms – Disjunctive Normal Forms, Conjunctive Normal Forms, Principal Disjunctive Normal Forms, Principal Conjunctive Normal Forms. Theory of Inference – Validity using truth tables, Rules of inference, Consistency of premises and indirect method of proof, Automatic theorem proving. (Pages 1 – 33, 50 – 60, 65 – 78 of Textbook 1) Engineering Applications:

1. It is used to design digital circuits. For example, used in aircrafts by pilots Unit II Predicate Calculus – Predicates, Statement function, Variables, Quantifiers, Predicate formulas, Free and Bound Variables, Universe of Discourse. Inference theory of predicate calculus – Valid formulas and equivalences, Valid formulas over Finite Universes, Special valid formulas involving quantifiers, Theory of involving predicate calculus, Formulas involving more than one quantifier. Recurrence relations – Definition, Homogeneous solution, Particular solution, Total solution. (Pages 79 – 101 of Textbook 1 and pages of Textbook 2) Engineering Applications:

1. Used for Systematic Inferencing (finding the correctness of result) and Knowledge Representation ( in the area of Artificial Intelligence systems )

2. In digital signal processing, recurrence relations can model feedback in a system, where outputs at one time become inputs for future time. They thus arise in infinite impulse response (IIR) digital filters.

Unit III Relations and Ordering – Relations, Properties of binary relations in a set, Relation matrix, Graph of a relation, Partition, Covering, Equivalence relations, Compatibility relations, Composition of binary relations, Partial Ordering, POSets. Lattices – Properties of lattices, Lattices as algebraic systems, Sublattices, Direct product, homomorphism.

B.Tech - CSE –2014 -15

Boolean algebra – Definition and examples, Subalgebra, Direct product, Homomorphism, Boolean functions, Free Boolean algebras, Boolean expressions and functions. (Pages 148 – 190, 378 – 416 of Textbook 1) Engineering Applications:

1. Lattices have been used to design a wide range of cryptographic primitives, including public key encryption, digital signatures, encryption resistant to key leakage attacks, identity based encryption

2. Designing circuits such as Two-Floor Elevator, Coffee, Tea, or Milk machine. Unit IV Algebraic Systems – Definition and examples. Semigroups and Monoids – Definition and examples, homomorphism of semigroups and monoids, subsemigroups and submonoids. Groups – Definition and examples, Subgroups and homomorphisms, Cosets and Lagrange’s theorem, Normal subgroups. (Pages 270 – 273, 282 – 294, 319 – 340 of Textbook 1) Engineering Applications:

1. Used in the theory of sequential machines, formal languages, and in certain applications relating to computer arithmetic such as multiplication(sequential logic-state machines)-semigroup

2. Most particularly used in the area of syntactic analysis and formal languages(monoid) 3. The application of group theory is important in the design of fast adders and error-

correcting codes(Groups) Unit V Graphs – Basic concepts, Isomorphisms and subgraphs, Trees and their properties, Spanning trees, Directed trees, Binary trees. (Pages 437 – 522 of Textbook 2) Engineering Applications:

1. Used for finding communities in networks, where we want to detect hierarchies of substructures, for ranking (ordering) hyperlinks and used by our GPS to find the shortest path home.

Unit VI Planar graphs, Euler’s Formula, Multigraphs and Euler’s Circuits, Hamiltonian graphs, Chromatic Numbers (Pages 523 – 570 of Textbook 2) Combinatorics – Permutations, Combinations, Principle of inclusion and exclusion. Engineering Applications: 1. Used in VLSI design, circuit needs to be on surface: lesser the crossings, better is the design. 2. Used for Highspeed Highways/Railroads design since crossings are always Problematic. 3. Used for map coloring and exam scheduling.

B.Tech - CSE –2014 -15

TEXT BOOKS: 1. Joe L. Mott, Abraham Kandel, Theodore P. Baker, Discrete Mathematics for Computer

Scientists & Mathematicians, Second Edition, PHI, 2005. 2. Bernard Kolman, Robert C. Busby, Sharon Cutler Ross, Discrete Mathematical Structures,

Fourth Edition, PHI, 2002. REFERENCES: I. Tremblay J. P. & Manohar R., Discrete Mathematical Structures with applications to

Computer Science, TMH, 2006. II. Dr. D. S. Chandrasekharaiah, Mathematical Foundations of Computer Science (Discrete

Structures), Prism, 2006. III. Ralph P. Grimaldi and B. V. Ramana, Discrete and Combinatorial Mathematics – An

Applied Introduction, Fifth Edition, Pearson, 2006.

B.Tech - CSE –2014 -15

a b c d e f g h i j k l m x x x i


Computer Science and Engineering FUNCTIONAL COMMUNICATIVE WRITTEN ENGLISH

Code: 4HC73 L T P/D C - - 3 2

UNIT 1 Speed Reading Strategies

a. Vocabulary skills: Word recognition, guessing the meaning from the context, analysis of word structure (prefix – suffix)

b. Prediction Techniques: Index, headings, sub-headings, nonverbal context and linguistic clues c. Scanning skills: Speed Reading, Regional practice d. Skimming Skills for identifying the central idea and recognizing the main ideas e. Identifying the writing pattern of the passage/text f. Intensive reading: Identifying difference between facts/opinions and drawing inferences and

conclusions UNIT 2 Group Discussions

a. Definitions: Difference between a Group Discussion and Debate b. Purpose of Group Discussion: Problem Solving, Decision Making and Personality Assessment c. Features / Characteristics of successful Group Discussion: Agreement on Group Goals, Goal

Oriented, Interactive Agreement for procedures, cooperative and friendly atmosphere d. Evaluation method in Group Discussion for selection: Subject knowledge, oral communication

skills, leadership skills and team management e. Group Discussion strategies: Appropriate strategy for effective participation in Group

Discussion, contributing systematically, creating a friendly and cooperative atmosphere, moving the discussion along, promoting optimal participation, handling conflict and effective closure

f. Techniques for Individual contribution: Topic analysis, Discussing opinions, problems, case studies

UNIT 3 Nature of Technical Communication

a. Definition of Communication b. Stages of Communication; Channels of Communication; Nature of Technical Communication c. Aspects of Technical Competence – Subject, Linguistic, Organizational Competence d. Features of Technical Competence – Audience, Objective Language, Format Style and Visual

Aids e. Difference between General Communication and Technical Communication f. Need and Importance of Technical Communication; Types of Technical Communications g. Technical Communication Skills:

i. Listening - General, Academic and Professional ii. Speaking - Asking and Answering Questions, Experiencing Opinion and Comments,

Academic and Professional oral Interaction, Academic and Professional Discussions iii. Reading – General, Academic, Professional iv. Writing - General, Academic, Professional

B.Tech - CSE –2014 -15

h. Barriers to Effective Communication: Improper encoding, Bypassing, Frame of Reference, Physical Distractions, Psychological and Emotional Interference and Intercultural differences

UNIT 4 Presentation Skills

a. Nature and importance of Oral Presentation b. Planning the presentation c. Define the purpose d. Analysis the Audience and Occasion e. Choose a suitable Title/Topic. f. Preparing the Presentation: Develop the central idea, main ideas, supporting material, plan and

prepare visual aids g. Presentation: Introduction, Body and Conclusion h. Rehearsing and Presentation: Vocal aspects, body language, Time management, Handling

questions, meeting unexpected situations i. Handling Stage Fright j. DOs and DON’Ts of Presentations

UNIT 5 Writing Strategies

a. Pre-writing; Writing; Re-writing b. Letter Writing - Formal and Informal Letter Writing; Inquiry Letters, Replies to Letters of urging

action, Complaint, Bank and Insurance, Business and Industrial Sales, Correspondence, Social Correspondence

c. E – Correspondence: Purpose, Structure, Layout and Form, Tone, Types, d. E-mails: Principles and Fundamentals e. E-mail Messages: Advantages of E-mail f. Characteristics of successful E-messages g. Formatting E-mail messages h. Standard E-mail practices i. E-mail writing strategies j. DOs and DON’Ts in E-Correspondence k. Nature and Significance of Report Writing l. Types of Reports: Informational and Analytical Reports, Routine and Special Reports, Oral and

Written Reports, Formal and Informal Reports m. Formats of Reports: Printed, Letter, Memo, Manuscript n. Structure of Formal Reports o. Writing Strategies: Preparation steps to write a Report

SUGGESTED BOOKS:

1. Technical communication- Meenakshi Raman and Sangeetha Sharma (Oxford Publications) 2. Effective Technical Communication – Ashraf Rizwi 3. Developing Communication Skills – Krishna Mohan and Meera Benarjee 4. SOFT SKILLS – Dr. K. Alex, S.Chand publications 5. Advanced Technical communication - Kavita Tyagi and Padma Mistri

B.Tech - CSE –2014 -15



Computer Science and Engineering BASIC ELECTRICAL ENGINEERING LAB

(Common to MECH, CSE, IT & BT) Code: 4AC91 L T P/D C

- - 4/2 1

1. OC & SC tests on Single – Phase transformer (Predetermination of efficiency and

regulation at given power factors).

2. Brake test on 3-phase induction motor (performance characteristics).

3. Speed control of DC shunt motor by

a) Armature Voltage Control .

b) Field flux control method.

4. Brake test on DC shunt motor.

5. Swinburn’s test on DC shunt machine.

6. Load test on 1- phase transformer.

B.Tech - CSE –2014 -15



Computer Science and Engineering BASIC ELECTRONICS LAB

(COMMON TO CSE/IT) Code: 4CC80 L T P/D C

- - 4/2 2

1. Transistor CE Characteristics (Input and Output)

2. Full wave Rectifier with and without filters.

3. CE Amplifiers.

4. RC Phase Shift Oscillator

5. Class A Power Amplifier

6. Micro Processor

B.Tech - CSE –2014 -15

Syllabus for B. Tech. II Year I semester Computer Science and Engineering

OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB (Common to CSE, IT, ECM, MECH)

Code: 4EC74 L T P/D C - - 4 2

a b c d e f g h i j k l m x x x x x x x

Lab Objective:

To make the student to learn an object oriented way of solving problems To teach the student to write programs in Java to solve the problems To introduce the student to GUI programming (AWT), Applets and Network Programming

1. A) Write a program to print prime numbers up to a given number.

B) Write a program to print roots of a quadratic equation ax2+bx+c=0. C) Write a program to print Fibonacci sequence up to a given number.

2.A) Define a class to represent a bank account and include the following members Instance variables: (i)Name of depositor (ii)Account No (iii)Type of account (iv)Balance amount in the account

Instance Methods: To assign instance variables (Constructors-Zero argument and parameterized)

1. To deposit an amount 2. To withdraw amount after checking the balance

(iv) To display name and address Define ExecuteAccount class in which define main method to test above class. B) In the above account class, maintain the total no. of account holders present in the bank and also define

a method to display it. Change the main method appropriately. C) In main method of ExecuteAccount class, define an array to handle five accounts. D) In Account class constructor, demonstrate the use of “this” keyword. E) Modify the constructor to read data from keyboard. F) Overload the method deposit() method (one with argument and another without argument) G) In Account class, define set and get methods for each instance variable. Example: For account no variable, define the methods getAccountNo() and setAccountNo(int accno) In each and every method of Account class, reading data from and writing data to instance variables should be done through these variables.

3.A) Define Resister class in which we define the following members:

Instance variables: resistance Instance Methods: giveData():To assign data to the resistance variable displayData(): To display data in the resistance variable constructors

Define subclasses for the Resistor class called SeriesCircuit and ParallelCircuit in which define methods : calculateSeriesResistance( ) and calculateParallelResistance() respectively.Both the methods should take two Resistor objects as arguments and return Resistor object as result.In main method , define another class called ResistorExecute to test the above class.

B.Tech - CSE –2014 -15

B) Modify the above two methods which should accept array of Resistor objects as argument and return Resistor object as result.

4. A) Write a program to demonstrate method overriding. B) Write a program to demonstrate the uses of “super” keyword (three uses) C) Write a program to demonstrate dynamic method dispatch (i.e .Dynamic polymorphism).

5) A) Write a program to check whether the given string is palindrome or not. B) Write a program for sorting a given list of names in ascending order. C) Write a program to count the no. of words in a given text.

6) A) Define an interface “GeomtricShape” with methods area( ) and perimeter( ) (Both method’s return type and

parameter list should be void and empty respectively. Define classes like Triangle, Rectangle and Circle implementing the “GeometricShape” interface and also define “ExecuteMain” class in which include main method to test the above class

B) Define a package with name “sortapp” in which declare an interface “SortInterface” with method sort( ) whose return type and parameter list should be void and empty.Define “subsortapp” as subpackage of “sortapp” package in which define class “SortImpl” implementing “SortInterface” in which sort() method should print a message linear sort is used. Define a package “searchingapp” in which declare an interface “SearchInterface” with search( ) method whose return type and parameter list should be void and empty respectively. Define “searchingimpl” package in which define a “SearchImpl” class implementing “SearchInterface” defined in “searchingapp” package in which define a search( ) method which should print a message linear search is used. Define a class ExecutePackage with main method using the above packages(classes and its methods). Use ArrayList class of Collections Framework to and use algorithms to search and sort the elemnt of an array.

7) Modify the withdraw() method of Account class such that this method should throw

“InsufficientFundException” if the account holder tries to withdraw an amount that leads to condition where current balance becomes less than minimum balance otherwise allow the account holder to withdraw and update the balance accordingly.

8) A) Define two threads such that one thread should print even numbers and another thread should print odd

numbers. B) Modify the Account class to implement thread synchronization concept. C) Define two threads such that one thread should read a line of text from text file and another thread should

write that line of text to another file. (Thread communication example). D) Write a program to implement thread priority.

9) Design the user screen as follows and handle the events appropriately. Add Window First Number Second Number Result

10) Write a program to simulate a calculator 11) Write a Java program for handling mouse events and key events. 12) a) Write a program for handling window events. b) Develop an applet that displays a simple message.. 13) Develop a client that sends data to the server and also develop a server that sends data to the client (two way

communication) 14) Develop a client/server application in which client read a file name from keyboard and send the file name to the server, and server will read the file name from client and send the file contents to the client.

ADD SUBTRACT

B.Tech - CSE –2014 -15



Computer Science and Engineering TECHNICAL PAPER WRITING AND SEMINAR- III





o Students also face the questions posed by the panel and the students and answer them. There shall be a Technical Paper writing and seminar evaluated for 25 marks in Second Year First Semester. The evaluation is purely internal and will be conducted as follows:



B.Tech - CSE –2014 -15


Syllabus for B. Tech. II Year II semester

Computer Science and Engineering DESIGN AND ANALYSIS OF ALGORITHMS Code: 4FC04 L T P/D C

3 1 - 3 UNIT I Introduction: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation, Probabilistic analysis, Amortized analysis. Objectives: At the end of this unit the student understands the importance of an algorithm, its complexity, and different measures to judge the efficiency of such algorithms. UNIT II Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort, Strassen’s matrix multiplication. Objectives: At the end of this unit the student will understand the divide and conquer technique and will be able apply that technique to various problems in the real life applications. UNIT III Greedy method: General method, applications-Job sequencing with dead lines, 0/1 knapsack problem, Minimum cost spanning trees, Single source shortest path problem. Objectives: At the end of this unit the student will understand the greedy method and will be able apply that technique to various problems in the real life applications. UNIT IV Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales person problem, Reliability design. Objectives: At the end of this unit the student will understand the dynamic programming technique and will be able apply that technique to various problems in the real life applications. UNIT V Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles. Branch and Bound: General method, applications - Travelling sales person problem,0/1 knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

B.Tech - CSE –2014 -15

Objectives: At the end of this unit the student will understand the backtracking, branch and bound techniques and will be able apply that technique to various problems in the real life applications. UNIT VI NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP-Hard and NP-Complete classes, Cook’s theorem. Objectives: At the end of this unit the student will understand the classification of problems in view of polynomial time complexity in an abstract way. TEXT BOOKS: 1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharam,Galgotia

publications pvt. Ltd.

2. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia,John wiley and sons.

B.Tech - CSE –2014 -15



Computer Science and Engineering MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS

Code: 4ZC01 L T P/D C 3 1 - 3

Course Objective: To make the students understand the concepts and principles of Business Economics at micro level and basic principles of Financial Accounting and Analysis, which facilitate them in making better planning and decisions UNIT I INTRODUCTION TO MANAGERIAL ECONOMICS: Definition, Nature and Scope of Business Economics–Demand Analysis: Demand Determinants, Law of Demand and its exceptions, Elasticity of Demand and Demand Forecasting. UNIT II THEORY OF PRODUCTION AND COST ANALYSIS: Production Function – Isoquants and Isocosts, Internal and External Economies of Scale, Laws of Returns. Cost Analysis: Cost concepts, different types of costs, cost control and cost efficiency, Break-even Analysis (BEA)-Determination of Break-Even Point (simple problems). UNIT III INTRODUCTION TO MARKETS: Market structures: Types of competition, Features of Perfect competition, Monopoly and Monopolistic Competition. Pricing strategies, transfer pricing and performance measurement, Price-Output Determination in case of Perfect Competition and Monopoly UNIT IV FUNDAMENTALS OF FINANCIAL ACCOUNTING: Concepts and conventions, principles of Double-Entry, Book Keeping, Journal, Ledger, Trial Balance, Final Accounts - Trading Account, Profit and Loss Account and Balance Sheet with simple adjustments. UNIT V CAPITAL BUDGETING TECHNIQUES: Nature and scope of Capital Budgeting, Methods of Capital Budgeting: Traditional methods and Discounting Cash Flow methods. UNIT VI RATIO ANALYSIS: Introduction to Ratio analysis – Leverage ratios – Liquidity ratios – Turnover ratios – Profitability ratios, Du-pont chart. (Simple problems) BOOKS RECOMMENDED:

Aryasri: Managerial Economics and Financial Analysis, 2/e, TMH, 2005.

B.Tech - CSE –2014 -15

REFERENCES:

Ambrish Gupta, Financial Accounting for Management, Pearson Education, New Delhi. H. Craig Peterson & W. Cris Lewis, Managerial Economics, PHI, 4th Ed. Suma Damodaran, Managerial Economics, Oxford University Press. Lipsey & Chrystel, Economics, Oxford University Press.

B.Tech - CSE –2014 -15



Computer Science and Engineering DATA BASE MANAGEMENT SYSTEMS

Code: 4FC03 L T P/D C 4 1 - 4 UNIT I Data Base Systems: Data Vs Information, 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, History of Data base Systems. Data base design and ER diagrams – Design Entities, Attributes and Entity sets – Relationships and Relationship sets – Additional features of ER Model – Concept Design with the ER Model –Data Modeling checklist. Application- ER diagram for a tiny college UNIT II 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. Application - Student database design. UNIT III 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, Embedded SQL. Application - working with Aviation company database. UNIT IV 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. Application - Faculty Evaluation Report. UNIT V Transaction Concept- Transaction State- Implementation of Atomicity and Durability – Concurrent – Executions – Serializability- Recoverability – Implementation of Isolation – Testing for serializability- Lock –Based Protocols – Timestamp Based Protocols- Validation- Based Protocols – Multiple Granularity, Recovery and Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions

B.Tech - CSE –2014 -15

– Buffer Management – Failure with loss of nonvolatile storage-Advance Recovery systems- Remote Backup systems, Application - Production Management System. UNIT VI 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, Query Optimization techniques. Application – Creating B+ tree on Instructor File. TEXT BOOKS: 1. Data base System Concepts, Silberschatz, Korth, McGraw hill, V edition. 2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill 3rd Edition 3. Database Management Systems, Peter Rob, A.Ananda Rao,Carlos Coronel ,CENGAGE Learning 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

B.Tech - CSE –2014 -15



Computer Science and Engineering ENVIRONMENTAL STUDIES

(Common to all branches) Code: 4GC06 L T P/D C 3 1 - 3 UNIT I ECOSYSTEMS Ecosystem definition, concept, Structure and Function, food chain and food web, Ecological pyramids, Biogeochemical cycles, Ecological niche and succession, Classification (Forest, Grassland, Desert, Pond, River, Marine, Estuarine, Wetlands) UNIT II NATURAL RESOURCES Definition, classification, Forest resources-use and over-exploitation, deforestation, Forest Conservation Act, Energy resources-energy demand, renewable and non-renewable energy resources, alternate energy resources, Case studies. Food Resources-World Food problems, effects of modern agriculture, fertilizer-pesticide problems, Mineral resources: Use and exploitation environmental effects of extracting and using mineral resources UNIT III ENVIRONMENTAL COMPONENTS Atmosphere- Definition, layers, state (weather and climate) acid rain, green house effect, ozone layer depletion, Seasons in India, Global warming, Kyoto protocol, Montreal protocol, Carbon trading, Hydrosphere-Definition, Types (surface and groundwater), distribution, Water conservation, use and over-exploitation, floods, drought, dams-benefits and problems, Lithosphere- Chemical composition of the earth (core, mantle, crust) UNIT IV BIO DIVERSITY AND ITS CONSERVATION Introduction, Definition, Genetic species and Eco system diversity, Value of bio diversity, Hot spots, Threats to bio diversity, Conservation strategies: Insitu and Exsitu conservation UNIT V ENVIRONMENTAL POLLUTION AND CONTROL Air pollution: Definition, causes, effects and Control measures, Case study: Bhopal Gas Tragedy, London smog, Chernobyl disaster, Water Pollution- Definition, types, Water quality parameters, Drinking water treatment and standard, Definition, causes, effects and Control measures: Soil Pollution, Noise Pollution and Marine Pollution, Waste Management- Solid Waste, Hazardous waste and E-waste management. UNIT VI SUSTAINABLE DEVELOPMENT Concept of Sustainable development, Threats to sustainability-population explosion, urbanization, over-exploitation of resources, Strategies for Sustainable development- Wasteland reclamation, Environmental Laws- Environment Protection Act, Air (Prevention and Control of Pollution) Act, 1981

B.Tech - CSE –2014 -15

TEXT BOOKS:

1. INTRODUCTION TO ENVIRONMENTAL SCIENCE –by Dr.Y.Anjaneyulu, B.S.Publications 2004.

2. ENVIONMENTAL STUDIES by Erach bharucha 2013, University grants commission, University press.

3. ENVIRONMENTAL SCIENCES-A NEW APPROACH by Purohit, shammi and Agarwal, Agrobios (India) 2004.

4. ENVIRONMENTAL SCIENCES-A Text book for Undergraduate by Dr. K.Mukkanti, S. Chand & Company Ltd., 2010.

B.Tech - CSE –2014 -15



Computer Science and Engineering COMPUTER ORGANIZATION & MICROPROCESSOR AND INTERFACING

(Only for CSE) Code: 4D408 L T P/D C 4 1 - 4 UNIT I BASIC STRUCTURE OF COMPUTERS: Computer Types, Functional units, Basic operational concepts, Bus structures, Software, Performance, multiprocessors and multi computers. Data Representation. Fixed Point Representation. Floating – Point Representation. Error Detection codes. UNIT II Register Transfer language, Register Transfer Bus and memory transfers, Arithmetic Micro-operations, logic micro operations, shift micro operations, Arithmetic logic shift unit. Instruction codes. Computer Registers – Instruction cycle, memory – Reference Instructions. Input – Output and Interrupt. STACK organization. Instruction formats, Addressing modes. DATA Transfer and manipulation. Program control. Reduced Instruction set computer. UNIT III CONTROL UNIT DESION & ARITHMETIC & LOGIC OPERATIONS: Control memory, Address sequencing, micro-program example, design of control unit Hardwired control, Micro-programmed control. Addition and subtraction, multiplication Algorithms, Division Algorithms, Fixed point & Floating – point Arithmetic operations. UNIT IV Architecture of 8086 Microprocessor. Special functions of General prupose registers. 8086 flag register and function of 8086 Flags. Addressing modes of 8086. Instruction set of 8086. Assembler directives, simple programs, procedures, and macros. UNIT V Assembly language programs involving logical, Branch & Call instructions, sorting, evaluation of arithmetic expressions, string manipulation. Pin diagram of 8086-Minimum mode and maximum mode of operation. Timing diagram. Memory interfacing to 8086 (Static RAM & EPROM). UNIT VI 8255 PPI – various modes of operation and interfacing to 8086. Interfacing Keyboard, Displays, Stepper Motor and actuators. D/A and A/D converter interfacing. Interrupt structure of 8086. Vector interrupt table. Interrupt service routines. Introduction to DOS and BIOS interrupts. TEXT BOOKS: 1. Computer Systems Architecture – M.Moris Mano, IlIrd Edition, Pearson/PHI. 2. Microprocessors and interfacing – Douglas V. Hall, TMH, 2nd Edition, 1999. REFERENCES: I. Computer Organization and Architecture -- William Stallings Sixth Edition, Pearson/PHI. 2. Micro computer systems, The 8086/8088 Family Architecture, Programming and Design — Y.Liu and G.A. Gibson, PHI, 2nd Edition.

B.Tech - CSE –2014 -15



Computer Science and Engineering PROBABILITY AND STATISTICS

(Common to All Branches) Code: 4HC16 L T P/D C 3 1 - 3 UNIT I Probability: Introduction, Sample Space and Events – Counting, Probability, The Axioms of probability, Addition theorem, Conditional, Multiplication theorem, Theorem of Total Probability, Baye’s Theorem. UNIT II Probability Distributions: Random variable – Discrete and Continuous, Distribution functions of probability- mass and density, Expectation, Probability distributions - Binomial, Poisson and Gaussian (Normal) distribution–Related properties.

UNIT III Sampling Distributions: Populations and samples, Sampling distribution of the Mean (known ) and The sampling distribution of the mean (unknown), proportions, sums and differences. Central limit theorem and its applications. Estimation-Point Estimation, Interval Estimation, Bayesian Estimation.

UNIT IV

Inferences Concerning Means and Proportions: Tests of Hypothesis, Type–I and Type-II Errors, Hypothesis testing concerning to One mean and two means of large and small size samples. Test of Hypothesis Concerning to Proportions.

UNIT V Test of significance: Student t-test, F-test, 2 test- Goodness of fit, Independence of Attributes.

UNIT VI Quality Control: Control Charts for Measurements, Control Charts for Attributes, Tolerance Limits, Acceptance Sampling. TEXT BOOKS: 1. Probability and Statistics for Engineers: Miller and John E. Freund, PHI Publishers, 9th Edition. 2. Probability and Statistics, V.Srinivas and R.Umamaheshwar Rao, Paramount Publishing House. REFERENCE BOOKS: 1. Fundamentals of Mathematical Statistics: Gupta and Kapoor – S. Chand and Co. 2. Engineering Mathematics, B. V. Ramana, Tata McGraw Hill Publishing Company Ltd.

B.Tech - CSE –2014 -15



Computer Science and Engineering EFFECTIVE ENGLISH COMMUNICATION AND SOFT SKILLS (EECSS)

Code: 4HC74 L T P/D C

- - 3 2 UNIT 1 The Art Of Communication Introduction: Analytical Communication for leaders

1. Non-verbal Communication a. Body Language b. Listening c. Writing

2. Oral Communication (Speaking) 8 detrimental facts to Communication:

1. At peace with self 2. Awareness 3. Transparency (Being yourself) 4. Helping Hand 5. Realistic Response (Unemotional) 6. Resolving Misunderstandings 7. Overcoming Fear 8. Blamelessness

UNIT 2 Soft Skills

1. What are Soft Skills? 2. Importance of Soft Skills 3. Attributes regarded as Soft Skills 4. Social Skills 5. Exhibiting; Identifying and Improving your Soft Skills 6. Top 60 soft skills 7. Practicing soft skills

Attitude: “ATTITUDE IS EVERYTHING!”

1. Meaning; Features of attitudes 2. Attitude and Behavior 3. Formation of attitudes 4. Change of Attitudes: How to change Attitude for the betterment? 5. Attitude in a workplace 6. The power of positive attitude - Developing positive attitude 7. Positive attitude and its benefits; Negative attitude and its results 8. Examples of negative attitudes 9. Overcoming negative attitude

Exercise 1: Measure your soft skills Exercise 2: Measure your attitude

B.Tech - CSE –2014 -15

UNIT 3 Time Management; Goal Setting; Team Dynamics Time management Introduction:

1. The 80:20 rule 2. Take a good look at the people around you 3. Examine your work 4. Sense of time management 5. Features of time; Three secrets of time management 6. Time management matrix: Analysis of time matrix; Effective scheduling; Grouping of activities 7. Five steps to successful time management 8. Difficulties in time management: Evils of not planning; Overcoming procrastination 9. Time management tips for students 10. Interesting facts about time 11. Ideal way of spending a day 12. Time wasters – Time savers

Goal Setting Introduction:

1. The purpose of goal setting 2. Types of Goals 3. How to set goals 4. Qualities of effective goals: Steps toward setting effective goals 5. How to achieve goals-Reasons for not meeting the goals.

Team Dynamics Introduction:

1. Meaning 2. Aspects of team building: Skills needed for teamwork 3. A model of team building: Team Vs Group 4. Characteristics of an effective team: Role of a team leader and team members 5. Inter–Group collaboration: Advantages of inter-group collaboration; Difficulties faced in inter-

group collaboration; Factors shaping inter-group collaboration. Exercise 1: Test your time management skills Exercise 2: Test your goal setting Exercise 3: Test your teamwork skills UNIT 4 Etiquettes and Manners Etiquette: Introduction:

1. Modern etiquette 2. Benefits of etiquette 3. Classification of etiquette 4. Accompanying women 5. Taboo topics 6. Proposing the toast.

Manners: Introduction:

1. Why should you practice good manners? 2. Poor manners noticed in youth

B.Tech - CSE –2014 -15

3. Practicing good manners 4. Manners at the wheel : Driving and Manners in the flight 5. Respecting the sacred : Visiting holy places, Dealing with the challenged, Attending funeral 6. Professional manners: Social skills (manners), Getting along with people, Manners to get respect

from others 7. Annoying office habits.

Exercise 1: Test your etiquette Exercise 2: Test your manners UNIT 5 Résumé writing and Interview skills Résumé: Introduction:

1. Types of Résumé 2. Difference among Bio-data, Curriculum Vitaé and Résumé 3. The terms: The purpose of Curriculum Vitaé writing 4. Types of Résumés 5. Tips to write Résumé: Curriculum Vitaé / Résumé preparation 6. The DOs and the DON’Ts of Résumé preparation 7. Resume check up 8. Design of a Curriculum Vitaé: Entry level Résumé, Content of the Résumé 9. References, Power words 10. Key skills that can be mentioned in the Résumé 11. Cover letter: Cover letter tips

Interview skills: Introduction:

1. Why an Interview? 2. Types of interviews (Face to Face / Panel Interviews, etc.) 3. Types of questions asked 4. Reasons for selecting a candidate / Reasons for rejecting a candidate 5. On the day of interview 6. Attending job fair 7. Common mistakes 8. What not to ask during an Interview 9. Dress code at an interview 10. FAQs 11. Quick / Basic Interview and job search related tips

Exercise 1: Write a resume Exercise 2: Conduct Mock Interviews BOOKS RECOMMENDED:

1. Soft Skills - Dr.K.Alex, published by S.Chand 2. Technical communication- Meenakshi Raman and Sangeetha Sharma (Oxford Publications) 3. Effective Technical Communication – Ashraf Rizwi

B.Tech - CSE –2014 -15

a b c d e f g h i j k l m x x x x x x


Computer Science and Engineering COMPREHENSIVE VIVA VOCE - I

Code: 4E473 L T P/D C - - - 1

Pre-Requisites: All Courses till this semester Course Outcomes:

Students are assessed in the courses they have undergone till the completion of that academic year.

They are asked to comprehend the concepts in the core subjects and the elective subjects, to make them ready to face technical interviews which improve their employability skills.

There shall be a Comprehensive Viva-Voce in II year II Semester. The Comprehensive Viva-Voce will be conducted by a Committee consisting of an external examiner, Head of the Department and two Senior Faculty members of the Department. The Comprehensive Viva-Voce is aimed to assess the students’ understanding in various subjects he/she studied during the B.Tech course of study up to II Year. The Comprehensive Viva-Voce is valued for 50 marks by the Committee. There are no internal marks for the Comprehensive Viva-Voce.

B.Tech - CSE –2014 -15



Computer Science and Engineering DATABASE MANAGEMENT SYSTEMS LAB Code: 4FC74 L T P/D C

- - 4 2 1. Creation, altering and droping of tables and inserting rows into a table (use constraints while

creating tables) examples using SELECT command. 2. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION,

INTERSET, Constraints. Example: - Select the roll number and name of the student who secured fourth rank in the class.

3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING and Creation and dropping of Views.

4. Queries using Conversion functions (to_char, to_number and to_date), string functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr), date functions (Sysdate, next_day, add_months, last_day, months_between, least, greatest, trunc,

round, to_char, to_date) 5. i)Creation of simple PL/SQL program which includes declaration section, executable section and

exception –Handling section (Ex. 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, ROLLBACK and SAVEPOINT in PL/SQL block. 6. Develop a program that includes the features NESTED IF, CASE and CASE expression. The

program can be extended using the NULLIF and COALESCE functions. 7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops using ERROR

Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE- APPLICATION ERROR. 8. Programs development using creation of procedures, passing parameters IN and OUT of

PROCEDURES. 9. Program development using creation of stored functions, invoke functions in SQL Statement

and write complex functions. 10. Program development using creation of package specification, package bodies, private objects, package variables and cursors and calling stored packages. 11. Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR, WHERE CURRENT of clause and CURSOR variables. 12. Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers and

INSTEAD OF Triggers TEXT BOOKS: 1) ORACLE PL/SQL by example. Benjamin Rosenzweig, Elena Silvestrova, Pearson Education 3 Edition 2) ORACLE DATA BASE LOG PL/SQL Programming SCOTT URMAN, Tata Mc- Graw Hill. 3) SQL & PL/SQL for Oracle 10g, Black Book, Dr. P. S. Deshpande.

B.Tech - CSE –2014 -15



Computer Science and Engineering MICRO PROCESSORS AND INTERFACING LAB

Code: 4DC74 L T P/D C - - 4 2

LIST OF PROGRAMS Introduction to MASM/TASM Assembler Familiarization with 8086 Kit Experiment I, II Write ALP and execute the program to

1. Add two 8-bit numbers 2. Add two 16-bit numbers 3. Add two 32-bit numbers 4. Subtract two 8-bit numbers 5. Subtract two 16-bit numbers 6. Subtract two 32-bit numbers 7. Multiply two 8-bit numbers 8. Multiply two 16-bit numbers 9. Perform 8-bit division 10. Perform 16-bit division 11. Find square of a number 12. Find cube of a number 13. Exchange two numbers

Experiment III Write ALP and execute the program to

14. Add a given series of numbers 15. Find average of a given series of numbers 16. Add a constant to a series of values in memory & store the result back in memory 17. Find sum of squares of a given series of numbers 18. Find sum of cubes of a given series of numbers 19. Display squares of a given series of numbers in memory

Experiment IV Write ALP and execute the program to

20. Display cubes of a given series of numbers in memory 21. Find factorial of a given number 22. Find largest number from a given series of numbers 23. Find smallest number from a given series of numbers

Experiment V Write ALP and execute the program to

24. Sort a series of given numbers in ascending order 25. Sort a series of given numbers in descending order 26. Find whether the given number is even or odd number 27. Find the no. of odd & even numbers from a given series of numbers

B.Tech - CSE –2014 -15

Experiment VI Write ALP and execute the program to

28. Find sum of all even no.s from a given series of even and odd numbers 29. Find sum of all odd no.s from a given series of even and odd numbers 30. Find GCD of two given numbers 31. Find LCM of two given numbers 32. Perform one byte BCD addition 33. Perform one byte BCD subtraction

Experiment VII Write ALP and execute the program to

34. Produce packed BCD from two ASCII characters 35. Convert decimal number to binary 36. Convert a binary number to a decimal number 37. Add two 3 x 3 matrices

Experiment VIII Write ALP and execute the program to

38. Display Fibonacci series 39. Move a string of data bytes from one location to another 40. Concatenate two strings 41. Reverse a given string

Experiment IX Write ALP and execute the program to

42. Compare two strings 43. Find length of a given string 44. Find whether the given byte is in the string or not 45. Insert an element in a given string

Experiment X Write ALP and execute the program to

46. Display a message on the screen of a microcomputer 47. Fill the screen with any character pressed from the keyboard

Experiment XI Write ALP and execute the program to

48. Interface a stepper motor 49. Generate a triangular wave

Experiment XII Write ALP and execute the program to

50. Generate a square wave 51. Generate a saw tooth waveform

Experiment XIII Write ALP and execute the program to

52. Interface a keyboard 53. Interface seven segment display

B.Tech - CSE –2014 -15



Computer Science and Engineering TECHNICAL PAPER WRITING AND SEMINAR- IV





o Students also face the questions posed by the panel and the students and answer them. There shall be a Technical Paper writing and seminar evaluated for 25 marks in Second Year Second Semester. The evaluation is purely internal and will be conducted as follows:



B.Tech CSE - 2014-15


Syllabus for B. Tech. III Year I semester

Computer Science and Engineering PRODUCT and SERVICE DESIGN

(Open Elective – I) Code: 4BC15 L T P/D C

3 - - 3 Course Objective :

1. The students will understand Importance of Design and Entrepreneurship as a career. 2. Learn elements of product design , models with experimentation its manufacturing and use

modern tools. Course Outcomes: At the end of the course the student will be able to: 1. Describe design primitives, role and significance of Design and Technology

Entrepreneurship, and IPR issues in Industrial Designs. 2. Explain Service Design needs , Process and Tools for Service Design, Innovation and

Attributes of a Good Design in terms of Usability, Aesthetics, Functionality. 3. Discuss Product Design modalities including Product Suites, Product Development,

Value Engineering and Product Design Specifications. 4. Design products for Environment suitability keeping in view Reliability Robustness,

Safety, Quality Aspects and Serviceability. 5. Design physical Models and Prototypes and to discuss Interface of Materials and Codes

& Standards. 6. Design Structure, Matrix Modeling, Product Metrics, Concurrent Engineering,

CAD/CAM and Design Review. Unit I : Introduction to Design Thinking:: Product Research, Art, Design and Society - Creativity and Brain-storming for Design – Nature of Technology Entrepreneurship, Characteristics/Qualities, Skills of Technology Entrepreneur, IPR relating to Designs and Registration of Industrial Designs Unit II : Introduction to Service Design: Challenges & Critical Success Factors, Requirements Engineering, Service Design Process, Tools for Service Design, Mapping the Customer Journey; Tools for Innovation, Conjoint Analysis, Voice of Customer Methods. Product Features, Attributes of a Good Design, Design Elements : Usability, Aesthetics, Functionality


Unit III : Introduction to Product Design: Product Architecture and Modularity, Product Innovation, Products and Product Suites, Product Development, Process Development, Value Engineering, Product Design Specifications, Principles of Ergonomics. Unit IV : Design for Manufacturing Re-manufacturing, Sustainability, Design for Environment, Reliability and Robustness, Safety Considerations, Quality Aspects, Design for Serviceability. Unit V : System & Engg Design: Physical Models and Experimentation, Prototype development, Bill of Materials, Interface of Materials, Processes and Designs, Codes & Standards Unit VI : Design Methodology Live Design & Design Tools – Design Structure, Matrix Modeling, Product Metrics, Concurrent Engineering, CAD/CAM, Design Review Recommended Text Books: 1) Kevin Otto & Kristie Wood, “Product Design”, Peason Education, 2011 2) Prashant Kumar, “Creativity, Concepts and Usability”, PHI, 2012

Additional References: 1) Yousef Haik,“Engg Design Process” Thomson Brodes / Codel. 2) N F M Roozenburg I.Eekels, “Product Design Fundamentals and Methods” Wiley Publications. 3) Nigel Cross, “Engineering Design Methods: Strategies for Product Design”, Wiley, 2008.


Syllabus for B. Tech. III Year I semester Computer Science and Engineering

BASIC SPANISH LANGUAGE (Open Elective – I)

(Common to all branches) Code: 4HC51 L T P/D C

3 - - 3

Objectives: The objectives of this course almost correspond to the A1 level of the Common European Framework of Reference for languages. Introduce the learners to basic Spanish and to acquaint them with Spanish culture. The learners should be able to express themselves in simple sentences on a few day-to-day situations. Course outcomes: CO1:Comprehend elementary structures of the spoken language in Spanish CO2: Converse in simple conversations in different situations of everyday life .

CO3:Use simple texts write sentences and short paragraphs on general topics and situations CO4: Work out on different patterns and combinations with the help of basic grammatical structures and lexical items. CO5: Discuss aspects of life and culture of Spanish and Latin American people. CO6: Converse with fluency and dsigning the brochers, plans of the hotels and vacation Unit-I Functional Aspects Greetings, introductions, identifying others; tools to ask meaning, pronunciation and spellings; different nationalities and their languages; Hispanic names, family relations and professions; days of the week, Months. Grammatical Aspects Basic structure of spelling and pronunciation; present indicative of the regular verbs (‘ar/er/ir) and ‘querer’; subject pronouns; interrogative sentences with ‘Por que’, and ‘quien’; causal phrase with ‘porque’; ‘ser’ and ‘estar’; negative sentences; adjectives of nationality. Unit-II Functional Aspects Ordinal and cardinal numbers: quantities; to go shopping, identifying Material, color, size etc; to go to a restaurant, food habits of Spanish and Latin American people. Grammatical Aspects Gender and number of nouns and adjectives; the verb ‘tener’; interrogative Sentences; demonstrative and qualitative adjectives. Unit-III Functional Aspects To express opinions on something contradict someone in modest ways; Suggest something, to value things aesthetically and intellectually; Expression of likes and dislikes; expression and reaction to certain things, (agreement or disagreement)



Grammatical Aspects Qualitative adjectives, forms and usage, gradations, superlative adjectives, Exclamatory sentences; thew verb’gustar’, forms and syntax; personal Pronouns; definite and indefinite pronouns, direct object pronouns Prepositions; verbs like ‘parecer’ and ‘encontrar and preferir, their form And syntax, interrogative pronouns. Unit-IV Functional Aspects Invitations; accepting and rejecting invitations; how to fix an appointment; Inviting through e-mail or telephone Grammatical Aspects Present indicative of irregular verbes, expressions with ‘tener’ and estar Prepositional pronouns; interrogative sentences Unit-V Functional Aspects Expression of time; Spanish and Latin American time tables and Comparison with Indian time tables, festivals Indian and Hispanic Grammatical Aspects Time with ‘ser’, expression s relating to festivals. Unit-VI Functional Aspects Expressions relating to climate, weather of the day seasons, vacations, planning of holiday and brochures, hotel reservations, offers Grammatical Aspects Expressions with verbs, ‘ser’ and ‘hacer’ and other verbs. Text Book: 1. NOUVEAU ELE INICIAL 1 Reference Books: 1. Espanol sin Fronteras, A. Sanchez, M. Rios, J.A. Metella, SGEL. Madrid, 1997 2.Entre Nosotros A. Sanchez, M. Rios, J.A. Metella, SGEL. Madrid, 1997


Syllabus for B. Tech. III Year I semester Computer Science and Engineering BASIC GERMAN LANGUAGE

(Open Elective – I) (Common to all branches)

Code: 4HC46 L T P/D C 3 - - 3

DEUTSCH FUR ANFANGER (German for beginners) Course Objective: To introduce the learners to basic German and to acquaint them with German culture. The learners should be able to express themselves in simple sentences on a few day-to-day situations. Course outcomes : CO1: Use definite, indefinite articles, Nouns nd cases. CO2: Use Verbs with prefixes, subordinate clauses. Use reflexive verbs in accusative. Dative cases and imperative constructions. CO3: Use Pronouns and Prepositions. CO4:Use Adjective with articles and Conjunctions in coordination with respect to the position of the verb CO5:Use of Perfect tense CO6:Use general structure and principles observed in German language

Syllabus Unit 1 Definite and indefinite articles (including negation) Noun: Gender and plural forms, cases (nominative, accusative, dative and genitive)

Unit 2 Verb: strong & weak verbs, verbs with separable and inseparable prefixes,

modal verbs, position of verb in the main and subordinate clauses, auxiliary verbs, reflexive verbs in accusative and dative cases, imperative constructions.

Unit 3 Pronouns: personal, possessive, reflexive, interrogative and demonstrative Prepositions: with the accusative, dative and with both these cases

Unit 4 Adjective: declension with the

Indefinite article Definite article Without article With the indefinite pronoun Degrees of comparison (also adverbs), ordinal numbers, adjectives as nouns

Conjunctions: subordinating and coordinating with respect to the position of the verb



Unit 5 Pretaritum of sein and haben Perfect tense

Unit 6 Negatin: of a sentence and of words therein. Sentence structure: general principles observed in German language.

READING LIST: One of the following books shall be used (depending upon the availability

of the book) Text book to be recommended out of the following. a) Braun, K., Nieder, L., Schmoe, F.1977. Deutsch als Fremdsprache I. A. Ernst Klett

Verlag, Stuttgart. b) Schulz, D., Griesbach, H., 1968. Deutsche Sprachlehre fur Auslander. Max Hueber

Verlag. Munchen. c) Hieber, W. 1987. Lemziel Deutsch (Special Indian Edition).Max Hueber Verlag.

Munchen d) Neuneer, G., et al. 1979. Deutsch Aktiv. Langenscheidt. Berlin e) Schapers, R., et al. 1980. Grundkkurs Deutsch. I. Verlag fur Deutsch. Munchen f) Schapers, R., et al. 1981 Deutsch 2000 I. Max Hueber Verlag. Munchen g) Haussermann, U. et al. 1995 Sprachkurs Deutsch. Verlag Moritz Diesterweg.

Frankfurt/Main. h) Muller, M., et al. 2001 Moment mal ! Langenscheidt. Berlin. i) Jutta Muller, Thomas Storz, 2006. Laguna. Heuber Veerlag, Ismaning.

Deutschland. j) Hermann Funk, Christina Kuhn, Oliver Bayerlein., Studio d A 1. 2005

Comelsen Verlag, Berlin. k) Rosa-Marie Dallapiazza, Eduard von Jan, Till Schonherr, unter Mitarbeit von

Jutta Orth-Chambah. Tangram aktuell 1 – Lektion 1 – 4, Lektion 5 – 8 2009. Max Hueber Verlag. Munchen.

9. SCHEME OF THE EXAMINATION: Duration of written papers: 3 hours each Paper 1 :Grammar and Translation (German > English and vice versa) 100 marks Paper II: Reading comprehension, letter writing / short easay. 100 marks Paper III: Viva voce 100 marks The minimum marks required for passing in EACH paper: 40 / 100



BASIC FRENCH LANGUAGE (Open Elective – I)

(Common to all branches) Code: 4HC41 L T P/D C

3 - - 3 Course Objective: To introduce the learners to basic French and to acquaint them with French culture. The learners should be able to express themselves in simple sentences on a few day-to-day situations. Course Outcomes: At the end of this course, the student will be able to: CO1:Comprehend elementary structures of the spoken language in French CO2: Converse in simple conversations in different situations of everyday life . CO3:Use simple texts write sentences and short paragraphs on general topics and situations CO4: Work out on different patterns and combinations with the help of basic grammatical structures and lexical items. CO5: Discuss aspects of life and culture of French country. CO6: Use general structure and principles observed in German language

UNITE – 1 UN PRINTEMPS A PARIS VOCABULAIRE : Professions et nationalités, vie quotidienne et loisirs, Descriptions physiques et psychologiques, nombres cardinaux. UNITE – 2 GRAMMAIRE : Articles définis et indéfinis, genre et nombre des noms et des Adjectifs, interrogation et négation, conjugaison du présent. PHONETIQUE : Intonation, liaison, voyelles orales et nasales. UNITE – 3 COMMUNICATION : Faire connaissance, inviter et répondre à une invitation, décrire les personnes. CIVILISATION : Paris, monuments et lieux pubics. La vie de quatre parisiens De professions différentes. UNITE- 4 AVENTURE EN BOURGOGNE VOCABULAIRE : Logement et nourriture, vêtements et couleurs, fêtes et Faits divers, nombres ordinaux. GRAMMAIRE : Articles partitifs, adjectifs démonstratifs et possessifs, Prépositions et adverbes de quantité et de lieu, pronoms Toniques, l’impératif, verbes pronominaux



UNITE – 5 PHONETIQUE : Intonation, semi-voyelles,liaison, consonnes sonores et sourdes COMMUNICATION : Exprimer I’ordre et t’obligation, demander et commander, évaluer et apprécier, féliciter et remercier. UNITE – 6 CIVILISATION : Une région de France : Ia Bourgogne, vie quotidienne à la campagne. In addition Passé Composé will be introduced in the Unite 2 Text Book : LE NOUVEAU SANS FRONTIERES – 1 (Text Book and (Unit 1 & Unit 2) Exercise Book published by CLE INTERNATINAL – Phillippe Dominique et al. SCHEME OF EXAMINATION: Internal Assessment 30 marks Written Examination - 20 marks Viva Voce - 10 marks Final Written Examination: Grammar, Communication & Translation 70marks Written Examination - 50 marks Viva voce -20 marks




OPERATIONS RESEARCH FOR ALLIED BRANCHES (OPEN ELECTIVE - I)

Code: 4BC11 L T P/D C 3 - - 3

Course Objective : 1. understand techniques of OR & Formulate & Obtain optimal solution for problems

using linear programming (LP) by different methods 2. Learn transportation problem their formulation and solution, understand the job

sequencing under different condition 3. understand the significance of replacement and the techniques of replacement of

various types of items 4. understand the concepts of Game theory concept & queuing systems

Course Outcomes: After completing the subject, students will be able to 1. Formulate & Obtain solution of problems using linear programming (LP) by different

methods 2. Solve the transportation problem, their formulation and solution, solve the job

sequencing under different conditions. 3. Describe the significance of replacement and the techniques of replacement of various

types of items 4. Elaborate the Game theory concept & solutions and its industrial significance 5. Describe the importance of queue system and various possible configuration of queues,

concept of inventory system, various inventory models 6. Demonstrate stage wise optimization and its implications, concept of simulation and its

uses UNIT – I INTRODUCTION: Development – Definition– Characteristics and Phases – Types of models – operation Research models – applications. LINEAR PROGRAMMING PROBLEM- Formulation – Graphical solutions, Simplex method, Artificial variables techniques -Two–phase method, Big-M method -Degeneracy, Duality Principle. UNIT – II TRANSPORTATION PROBLEM – Formulation – Optimal solution, unbalanced transportation problem – Degeneracy. ASSIGNMENT PROBLEM – Formulation – Optimal solution - Variants of Assignment Problem-Unbalanced, Traveling Salesman problem.


UNIT – III SEQUENCING – Introduction – Flow Shop sequencing – n jobs through two machines – n jobs through three machines – Job shop sequencing – two jobs through ‘m’ machines. REPLACEMENT: Introduction – Replacement of items that deteriorate with time – when money value is not counted and counted – Replacement of items that fail completely, Group replacement. UNIT – IV THEORY OF GAMES: Introduction – Pure strategies-Minimax (maximin) – Criterion and optimal strategy – Solution of games with saddle points – Mixed Strategies-Rectangular games without saddle points- Dominance principle – 2 X 2 games , m X 2 & 2 X n games -Graphical method. UNIT – V WAITING LINES: Introduction – Single Channel – Poisson arrivals – exponential service times – with infinite population and finite population models– Multichannel – Poisson arrivals – exponential service times with infinite population single channel Poisson arrivals. INVENTORY : Introduction – Single item Deterministic models without shortages– Single item inventory models with one price break and multiple price breaks – Stochastic models – demand may be discrete variable or continuous variable – Instantaneous production. Instantaneous demand and continuous demand and no set up cost. UNIT – VI SIMULATION: Definition – Types of simulation – phases of simulation– applications of simulation – Inventory and Queuing problems – Advantages and Disadvantages – Computers in Simulation. DYNAMIC PROGRAMMING: Introduction – Bellman’s Principle of optimality – Applications of dynamic programming- shortest path problem -capital budgeting problem –– linear programming problem. TEXT BOOKS: 1. Operations research / Hira & Gupta 2. Operation Research /J.K.Sharma/MacMilan publishers. REFERENCES:

1. Operations Research / S.D.Sharma/Kedarnath publishers 2. Operations research/V.K.Kapoor




Computer Science and Engineering ENTREPRENEURSHIP (OPEN ELECTIVE – I)

Code: 4ZC04 L T P/D C 3 - - 3

Course Objective : The objective of the course is to make students understand the nature of Entrepreneurship, and its importance to business to the engineering students, which will allow them to get the required intuition and interest in starting their own start-up’s Course Outcomes: After completing the subject, students will be able to: 1. Explain the need for Entrepreneurship Management, its benefits, process, problems and

opportunities, describe roles and behavioral aspects of aspiring entrepreneur with case studies

2. Describe how to start small businesses, its economy, ownership, stocks, trading and role of government to innovate new products.

3. Explain and practice Opportunity and SWOT Analysis, Risk Reduction strategies, apply Marketing strategies for start-ups. Describe problems in start-up and tax analysis for start-up subsidiary firms.

4. Plan Effective Business, Contents of Plan, Design Model Business keeping in view Feasibility, Environment, Economic Analysis, Industry Analysis, and Competitive Analysis.

5. Discuss and explain ideas of Innovation and New product ideas. Describe Intellectual Property rights, Patents, Copyrights, Trademarks, Geographical Indicators with knowledge of WIPO.

6. Describe Sources of Capital, Debt and Equity, Commercial Banks, Angel Investors. Explain role of financial institutions such as banks and Government Grants with Subsidies. Describe Registration and documentation process to approach financial institutions for grants.

UNIT I INTRODUCTION TO ENTREPRENEURSHIP: Definition of entrepreneurship, Evolution of entrepreneurship, Classification of Entrepreneurs, Entrepreneurship as a Process, Entrepreneurial Propensity, Benefits and Drawbacks of Entrepreneurship. Characteristics of entrepreneur, Qualities and skills, functions of entrepreneur. Women Entrepreneurs, Problems and opportunities. UNIT II FORMS OF ENTREPRENEURSHIP: Small Business, Importance in Indian Economy, Types of ownership, sole trading, partnership, Joint Stock Company, Important features of various types of businesses, corporate entrepreneurship, entrepreneurship, Role of Government in the promotion of Entrepreneur, State Enterprises in India.


UNIT III EXPLORING OPPORTUNITIES AND STRATEGIES: Opportunity Analysis, SWOT Analysis, Internal and External Environment. First-Mover disadvantages, Risk Reduction strategies, Market scope strategy, Imitation strategies and Managing Newness, Marketing strategies for start-ups, Pitfalls in start-up analysis. Taxes as bottlenecks for the growth of new start-up’s, subsidies and incentives given to save taxes. UNIT IV BUSINESS PLAN AND FEASIBILITY STUDIES: Preparation of an Effective Business Plan, Contents of a Business Plan, Detailed discussion of the business plan. Model Business, Feasibility study, Environmental scanning, Economic Analysis, Industry Analysis, and Competitive Analysis. Write Up for an effective feasible and bankable report. UNIT V INNOVATIONS AND PROTECTION OF IDEAS: Creativity process in developing Innovation, breakthrough innovations and its consequences on the society. Inspiring innovations. New product ideas, Idea generation methods, quality gates, prototype building, Test marketing. Protecting the ideas, Applying for Intellectual Property rights, Patents, Copyrights, Trademarks, Geographical Indicators. Introduction to World Intellectual Property Organization (WIPO). UNIT VI FINANCIAL ASPECTS OF THE ENTREPRENEURSHIP: Sources of Capital, Debt and Equity, Commercial Banks, Angel Investors, Venture capitalist, IDBI,ICICI,IFCI,SFC’c. Government Grants and Subsidies. Registration Process and the documentation required. Government Agencies helping in Registration Process. DIC, NSIC and other Central and State Institutions. REFERENCES: 1. H. Nandan, Fundamentals of Entrepreneurship, Prentice Hall of India, First Edition, New

Delhi, 2007. 2. Robert D Hisrich, Michael P Peters, Dean A Shepherd, Entrepreneurship, Sixth Edition,

New Delhi, 2006. 3. Alfred E. Osborne, Entrepreneur’s Toolkit, Harvard Business Essentials, HBS Press,

USA, 2005. 4. Madhurima Lall, Shikha Sahai, Entrepreneurship, Excel Books, First Edition, New Delhi,

2006. 5. S.S. Khanka, Entrepreneurial Development, S. Chand and Company Limited, New Delhi,

2007. 6. Thomas W. Zimmerer, Norman M. Scarborough, Essentials of Entrepreneurship And

Small Business Management, Fourth Edition, Pearson, New Delhi, 2006 7. S.R. Bhowmik, M. Bhowmik, Entrepreneurship-A tool for Economic Growth And A

key to Business Success, New Age International Publishers, First Edition, (formerly Wiley Eastern Limited), New Delhi, 2007



Syllabus for III year 1st semester Computer Science & Engineering

SAP – I: SAP ABAP Workbench Fundamentals (OPEN ELECTIVE - I)

Code:4EC26 L T P/D C

3 - - 3 Teaching Scheme Examination Scheme Lecture – 4 Hours / Week In seminar Assessment: 30 Marks Practical – 2 Hours / Week End Semester Assessment: 70 Marks Course Objective

1. Understand the SAP NetWeaver AS fundamentals 2. Work with the ABAP Workbench tools 3. Write simple ABAP programs 4. Understand the ABAP Dictionary

Course Outcomes

1. To acquire through knowledge of SAP Net weaver architecture, ABAP fundamentals (like language elements, modularization, ABAP dictionary)

2. To write simple ABAP programs and reports 3. To be able to debug and analyze errors and performance of programs

Unit

Content

1

Introduction to enterprise resource planning(ERP)

1. ERP explained 2. System wide concepts 3. SAP applications and components 4. Sample end to end business process

2

SAP Netweaver application server fundamentals

1. SAP systems and SAP applications portfolio 2. SAP Graphical User Interface and Navigation in AS ABAP systems 3. System core 4. Communication and integration technologies

3

ABAP Work bench foundations - Part 1

1. ABAP Program processing 2. ABAP Work bench tools 3. ABAP Language basics, open SQL


4. Modularization techniques 4

ABAP Work bench foundations - Part 2

10

1. Complex data objects, structures and internal tables 2. Data modeling and Data retrieval 3. Classic ABAP reports 4. Program analysis tools 5. Program calls and memory management

5

ABAP Dictionary 10 1. Domains, Data elements and structures 2. Transparent tables, Pool tables and cluster tables 3. Input Checks 4. Dictionary object dependencies 5. Changes in table structure 6. Views 7. Search Helps

6 Classical UI Programming 10 1. Selection Screens 2. Screens ( Dynpros)

Textbooks:

1. SAP ABAP Workbench Fundamentals, Part 1, SAP India 2. SAP ABAP Workbench Fundamentals, Part 2, SAP India

References:

1. www.training.sap.com/in/en



Syllabus for B.Tech III year I semester Computer Science and Engineering

OPERATING SYSTEMS

Code: 4EC07 L T P/D C 4 - - 4

Course Objective : 1. Learn basics of operating Systems 2. Understand process management and synchronisation. 3. Learn principles of memory, I/O and file management in a secured environment. COURSE OUTCOMES: After completing the subject, students will be able to: 1. Describe the basic functionalities and structure of the Operating System 2. Explain the concepts and implementations of: Processes, Process Scheduling. Describe, contrast and

compare various types of Operating systems like Windows and Linux. 3. Comprehend the concepts of Synchronization and Deadlocks in the Operating System 4. Discuss the concepts of Memory Management(Physical and Virtual memory) 5. Explain the concepts of File System with regard to directory and disk management algorithms. 6. Students understand the concepts of I/O systems, protection and security in a case study given UNIT I Introduction to Operating System, Computer System Architecture: Single Processor System, Multiprocessor System, Clustered System, Multiprogramming System, Multitasking (Time sharing) system, Operating System Services, System Calls, Types of System Calls, System Programs, Operating System Structure: single structure, layered approach, micro kernels, modules. UNIT II Process Management: Process concept, process scheduling, operation on processes; CPU scheduling, scheduling criteria, scheduling algorithms -First Come First Serve (FCFS), Shortest-Job-First (SJF), Priority Scheduling, Round Robin(RR), Multilevel Queue Scheduling. Engg. Applications – Process scheduling in Windows, Linux. UNIT III Process-Synchronization & Deadlocks: Critical Section Problems, semaphores; Monitors; Deadlock Characterization, methods for handling deadlocks-deadlock prevention, Avoidance & Detection; Deadlock recovery.


UNIT IV Memory Management: Logical & Physical Address Space, swapping, Contiguous memory allocation, Paging and Segmentation techniques, Segmentation with paging; Virtual memory: Demand Paging, Page-Replacement Algorithms, Thrashing. Engg. Applications – Memory management in Windows, Linux. UNIT V File System: Different types of files and their access methods, directory structures, various allocation methods, disk scheduling and management and its associated algorithms. UNIT VI I/O Systems: I/O Hardware, Application I/O Interface, Kernel, Transforming I/O requests, Performance Issues. Protection and Security: Goals of protection, Principles of protection, Access matrix, Access control list, Capability List. Security Attacks, Program threats. TEXT BOOKS: 1. Operating System Concepts by Silberchatz Galvin, 8th edition. 2. Modern Operating Systems by A. Tanenbaum, 1992, Prentice-Hall. 3. Operating Systems Internals and Design Principles by William Stallings,4th edition, 2001, Prentice-Hall REFERENCES: 1. Operating System By Peterson , 1985, AW. 2. Operating System By Milankovic, 1990, TMH. 3. Operating System Incorporating With Unix & Windows By Colin Ritche, 1974, TMH. 4. Operating Systems by Mandrik & Donovan, TMH 5. Operating Systems By Deitel, 1990, AWL. 6. Operating Systems – Advanced Concepts By Mukesh Singhal , N.G. Shivaratri, 2003, T.M.H




THEORY OF COMPUTATION Code: 4FC17 L T P/D C

3 1 - 3 Course Objective :

1. Learn principles of Finite state machine, finite automation models, and transition diagrams. 2. Understand regular languages and expressions for writing grammars. 3. Understand context free grammars useful in designing compilers. 4. learn computational functions and theory.

Course Outcomes After completing the subject, students will be able to:

1. Discuss principles of Finite state machine , finite automation models, and transition diagrams.

2. Design NFA , DFA and FSM transition with suitable examples expressions which are useful in text editors.

3. Describe regular languages, regular expressions , grammars and derivations of strings with suitable examples.

4. Describe context free grammars, syntax analysis useful in designing compilers. 5. Discuss computational functions and type of Turing machine. 6. Describe computational theory , Chomsky hierarchy, LR(0), Correspondence, reducibility and

solve problems on NP problems. UNIT - I Fundamentals : Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model, acceptance of strings, and languages, deterministic finite automaton and non deterministic finite automaton, transition diagrams and Language recognizers. UNIT - II Finite Automata : NFA with ϵtransitions - Significance, acceptance of languages. Conversions and Equivalence : Equivalence between NFA with and without ϵ transitions, NFA to DFA conversion, minimisation of FSM, equivalence between two FSMs, Finite Automata with output- Moore and Melay machines. UNIT - III Regular Languages : Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regular expressions, Conversion of Finite Automata to Regular expressions. Pumping lemma of regular sets, closure properties of regular sets (proofs not required). Regular grammars-right linear and left linear grammars, equivalence between regular linear grammar and FA, inter conversion, Context free grammar, derivation trees, sentential form.Right most and leftmost derivation of strings.


UNIT - IV Context Free Grammars : Ambiguity in context free grammars. Minimisation of Context Free Grammars. Chomsky normal form, Greiback normal form, Pumping Lemma for Context Free Languages. Enumeration of properties of CFL (proofs omitted). Push down automata, definition, model, acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence. Equivalence of CFL and PDA, interconversion. (Proofs not required). Introduction to DCFL and DPDA. UNIT - V Turing Machine : Turing Machine, definition, model, design of TM, Computable functions, recursively enumerable languages. Church?s hypothesis, counter machine, types of Turing machines (proofs not required). UNIT - VI Computability Theory : Chomsky hierarchy of languages, linear bounded automata and context sensitive language, LR(0) grammar, decidability of, problems, Universal Turing Machine, undecidability of posts. Correspondence problem, Turing reducibility, Definition of P and NP problems, NP complete and NP hard problems. Text Books : 1. Introduction to Automata Theory Languages and Computation?. Hopcroft H.E. and Ullman J. D. Pearson Education 2. Introduction to Theory of Computation? Sipser 2nd edition Thomson References : 1. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley. 2. Introduction to languages and the Theory of Computation ,John C Martin, TMH 3. Elements of Theory of Computation?, Lewis H.P. & Papadimition C.H. Pearson /PHI. 4. Theory of Computer Science Automata languages and computation -Mishra and Chandrashekaran, 2nd edition, PHI




Data Communications and Networks

Code: 4E502 L T P/D C 4 1 - 4

Course Objective : 1. Understand primitives of networks and bandwidth utilization. 2. Learn switching mechanism and various addressing schemes. 3. Learn routing and congestion control algorithms 4. Understand Transport layer entities such as DNS and HTTP.

Course Outcomes: After completing the subject, students will be able to:

1. Describe and analyze network topologies, models and physical transmission media. 2. Describe Conversion Techniques and apply Multiplexing & Demultiplexing for

Bandwidth Utilization. 3. Describe Switching mechanisms & methods involved in Error Control. 4. Describe MAC sub layer primitives, various connecting devices, logical addressing. 5. Describe network layer routing techniques and Internet Control Protocols, Congestion

control mechanisms. 6. Describe Transport layer entities and differentiate among DNS, Email, FTP, HTTP, SNMP and

understand Security attacks & services. UNIT I Introduction: Data Communications, Networks: Topologies ,PAN,LAN,MAN,WAN. The Internet, Protocols and Standards. Network Models: The OSI Model, Layers in the OSI Model, TCP/IP Protocol Suite. Physical layer & Media: Guided Media, Unguided Media. UNIT II Data and Signals: Analog and Digital, Digital Transmission: Digital-to-Digital Conversion, Analog-to-Digital Conversion, Analog Transmission, Digital-to-analog Conversion, Analog-to-analog Conversion. Bandwidth utilization: Multiplexing and Demultiplexing. UNIT III Switching: Circuit-Switched Networks, Packet Switching, Message Switching. Data Link Layer: Services, Data Link Control, Framing, Flow and Error Control, Error Detection and Correction, CRC, Checksum, Hamming code , Sliding Window Protocols, HDLC, Point-to-Point Protocol. UNIT-IV MAC sub layer: MAC Address, Multiple Access Protocol, Aloha, CSMA Protocols, IEEE Standards, Standard Ethernet, Fast Ethernet, Gigabit Ethernet, IEEE 802.11. Connecting Devices: Repeaters, Hubs, Bridges, Switches, Routers, Gateways.


Network Layer: Logical Addressing, IPv4, IPv6 , Subnetting and Supernetting, Internetworking. UNIT V Network Layer: Datagram and Virtual-Circuit Networks, Forwarding and Routing, Routing Protocols: Flooding, Shortest path routing technique, Distance Vector routing, Count to Infinity problem, Link State routing, Hierarchical routing technique, Multicasting, Broadcasting. Internet control protocols: ICMP, ARP, RARP, DHCP Congestion Control: Congestion Control in virtual –circuits and Datagram Subnets, Traffic Shaping: Leakey-Bucket and Token-Bucket Algorithms. UNIT VI Transport Layer: Transport Services, Connection establishment, Connection release and TCP and UDP protocols. Application Layer: Domain Name System, Electronic Mail and File Transfer Protocol, WWW and HTTP, Simple Network Management Protocol (SNMP) Security: Security attacks and services. Text Books 1.Data Communication and Networking, 4th Edition, Behrouz A Forouzan, McGrawHill. 2.Computer Networks, Andrew S. Tanenbaum, 4th Edition ,Pearson Education. References 1. An Engineering Approach to Computer Networks-S.Keshav, 2nd Edition, Pearson Education 2. Understanding communications and Networks, 3rd Edition, W.A. Shay, Thomson




SOFTWARE ENGINEERING Code: 4EC04 L T P/D C

3 1 - 3 Course Objective:

1. Understand role, types and models of software engineering 2. Learn systems models, testing stratégies and quality concerns of software.

Course Outcomes After completing the course, students will be able to 1. Describe role, nature, myths view of process, CMMI and patterns and models of software. 2. Discuss software requirements and requirement engineering process. 3. Describe system models, context and behavioral models. 4. Discuss object oriented design process and testing strategies. 5. Define software metrics to estimate the quality. 6. Discuss quality management methods. UNIT I Introduction to Software Engineering: The evolving role of software, Changing Nature of Software, Software myths. A Generic view of process: Software engineering- A layered technology, a process framework, The Capability Maturity Model Integration (CMMI), Process patterns, process assessment, personal , and team process models. Process models: The waterfall model, Incremental process models, Evolutionary process models, The Unified process, Malcom Balridge. UNIT II Software Requirements: Functional and non-functional requirements, User requirements, System requirements, Interface specification, the software requirements document. Requirements engineering process: Feasibility studies, Requirements elicitation and analysis, Requirements validation, Requirements management. UNIT III System models: Context Models, Behavioral models, Data models, Object models, structured methods. Design Engineering: Design process and Design quality, Design concepts, the design model. Creating an architectural design: Software architecture, Data design, Architectural styles and patterns, Architectural Design. UNIT IV Object-Oriented Design: Objects and object classes, An Object-Oriented design process, Design evolution. Performing User interface design: Golden rules, User interface analysis and design, interface analysis, interface design steps, Design evaluation. Testing Strategies: A strategic approach to software testing, test strategies for conventional software, Black-Box and White-Box testing, Validation testing, System testing, the art of Debugging.


UNIT V Product metrics: Software Quality, Metrics for Analysis Model, Metrics for Design Model, Metrics for source code, Metrics for testing, Metrics for maintenance. Metrics for Process and Products: Software Measurement, Metrics for software quality. Risk management: Reactive vs. Proactive Risk strategies, software risks, Risk identification, Risk projection, Risk refinement, RMMM, RMMM Plan. UNIT VI Quality Management: Quality concepts, Software quality assurance, Software Reviews, Formal technical reviews, Statistical Software quality Assurance, Software reliability, The ISO 9000 quality standards. TEXT BOOKS 1. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition.McGrawHill International Edition. 2. Software Engineering- Sommerville, 7th edition, Pearson education. REFERENCES 1. Software Engineering- K.K. Agarwal & Yogesh Singh, New Age International Publishers 2. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz, John Wiely. 3. Systems Analysis and Design- Shely Cashman Rosenblatt,Thomson Publications. 4. Software Engineering principles and practice- Waman S Jawadekar, The McGraw-Hill Companies.



Computer Science and Engineering WEB TECHNOLOGIES

Code: 4FC09 L T P/D C

4 1 - 4 Course Objective :

1. Learn importance of WWW and learn programming to handle web enabled environment. 2. Learn primitives of server management , database connectivity with the servers along with

the security issues. Course Outcomes: After completing the subject, students will be able to

1. Describe WWW features and Demonstrate/ use of HTML tags 2. Develop dynamic programs involving Java scripts, popup windows in JavaScript along with Event

Handling. 3. Develop scripts using XML and XSLT and to read XML document using parsers, DOM parser and

SAX parser. 4. Use Web Servers and servers in a JAVA along with the Installation and testing of Software

Development Kit, Tomcat Server and Tomcat. Develop servlets programs and describe security issues while using web applications

5. Develop programs with JSP and MVC . Develop JSP Application . 6. Write programs on JDBC , using JDBC API and Struts framework, Explain role of from bean,

action and struts-config.xml in a struts application. UNIT-I: The World Wide Web (WWW), Importance of Hypertext and Hypertext Markup Language, HTML4.1 Common tags- List, Tables, images, forms, frames, Cascading Style Sheets Application: UI of web sites: Creation of forms , frames, and a good user interface , online applications front end UNIT-II: Introduction to Java Scripts, Dynamic HTML with Java Script, Objects in Java Script, popup windows in JavaScript(alert, prompt, confirm),function declaration usage in JavaScript, Event Handling. Application: Dynamic behavior to html, interactive web site preparation. In project: used for validation of username, password, popping of fields dynamically, java script is used for the validation of fields like when username is left blank it should give an error message UNIT-III: XML: Document type definition, XML Schemas, presenting XML using XSLT, Document Object model, reading the XML document using parsers, DOM parser and SAX parser. Application: Used for storing configuration details, no predefined tags, used in configuring class details for mapping and database details in hibernate. It focuses on structure of data . In project we have used the xml language in the hibernate configuration file .



UNIT-IV: Importance Web Servers and Application servers in a JAVA based enterprise application development. Installing the Java Software Development Kit, Tomcat Server & Testing Tomcat. Introduction to Servelets: Lifecycle of a Serverlet, The Servelet API, The javax.servelet package, Reading request parameters, Reading Initialization parameters, reading the context parameters, The javax.servelet.http package, Handling Http Request & Responses, Session Tracking using URL rewriting, Hidden form fields, Cookies, HttpSession, Security Issues in web Application. Application: The term web server, also written as Web server, can refer to either the hardware (the computer) or the software (the computer application) that helps to deliver web content that can be accessed through the Internet. The most common use of web servers is to host websites, but there are other uses such as gaming, data storage, running enterprise applications, handling email, FTP, or other web uses. UNIT-V: Introduction to JSP: The Problem with Servelet. The Anatomy of a JSP Page, JSP Processing: JSP Application Design with MVC. JSP Application Development: Generating Dynamic Content, Using Scripting Elements Implicit JSP Objects. Application: JSP is used for processing the requests from server,dynamic views UNIT-VI: Database Access: Database Programming using JDBC, Metadata manipulations through JDBC, Importance of PreparedStatement and CallableStatement, Studying javax.sql. package, Accessing a Database from a JSP Page, performing the CRUD operations using JDBC API Application: To access database from application. TEXT BOOKS:

1. Web Programming building internet applications by Chris Bates 2nd edition 2. Head First Servlets & JSP by Bryan Basham, Kathy Sierra, Bert Bates, Publisher:

O’Reilly Media REFERENCE BOOKS:

1. Programming World Wide Web by Sebesta. 2. Thinking In Java 4th Edition by Bruce Eckel 3. Learning XML by Erik T. Ray 4. Core SERVLETS ANDJAVASERVER PAGES VOLUME 1: CORE

TECHNOLOGIES By Marty Hall and Larry Brown 5. Internet and World Wide Web – How to program by Dietel and Nieto 6. Database Programming with JDBC & Java by George Reese 7. Jakarta Struts Cookbook by Bill Siggelkow




QUANTITATIVE APTITUDE (Common to All Branches)

Code: 4HC76 L T P/D C - - 3 2

Course Objective : Learn and practice problems on numbers systems , ratios, mensuration and relations to excel in and competitive examinations. Course Outcomes: After completing the subject, students will be able to

1. Solve problems related to number systems 2. Find averages of numbers and groups 3. Solve problems related to ratio and proportion 4. Find simple interest, solve time work and distance problems 5. Solve mensuration problems 6. Interpret the various kinds of data and find the relation between them. Unit I Number System: Test for Divisibility, Test of prime number, Division and Remainder – HCF and LCM of Numbers - Fractions. Unit II Average: Average of different groups, Replacement of some of the items - Percentage - Profit and Loss. Unit III Ratio and Proportion: Properties of Ratio, Comparison of Ratios, Useful Simple Results on Proportion – Partnership and Share. Unit IV Simple Interest: Effect of change of P, R and T on Simple Interest - Compound Interest: Conversion Period, Difference between Compound Interest and Simple Interest. Unit V Time and Work- Pipes and Cisterns, Time and Distance- Problems on Trains- Boats and Streams, Allegation or Mixtures. Unit VI Mensuration: Area of Plane Figures, Volume and Surface Area of Solid Figures. Data Interpretation: Tabulation, Bar Graphs, Pie Charts, Line Graphs. Text Books: 1. Quantitative Aptitude by R.S.Agarwal 2. Quantitative Aptitude by Abhijit Guha


a b c d e f g h i j k l m x x x x x x x x x x


GROUP PROJECT Code: 4E575 L T P/D C

- - 3 1 Course Objective : To acquaire basic knowledge on selecting a projcet , learn related tools and enhance programming and communication skills for employabilty. Pre-Requisites: All Courses till this semester Course Outcomes: After completing the subject, students will be able to 1. Apply knowledge, analyze a problem and review literature for professional project design

to solve a technical problem. 2. Design or develop a system, component or process and recognize opportunities for

improvements in a design. 3. Utilize appropriate computer software tools to accomplish the objectives of a project. 4. Communicate effectively the results of a project in oral presentations and written reports. 5. Design and plan a project and manage the time involved to complete all tasks to the

respective deadlines. 6. Work and communicate effectively independently and as a member of a project team.

A group project shall be carried out by a group of students consisting of 2 to 3 in number in third year first semester. This work shall be carried out under the guidance of the teacher and shall involve design, fabrication, software development or any other significant activity. This can be of interdisciplinary nature also. There will be 75 marks in total with 25 marks of internal evaluation. The internal evaluation shall consist of:

Day to day work : 10 marks Report : 05 marks

Demonstration / presentation : 10 marks End examination : 50 Marks.

The end examination will be carried out by a committee consisting of an external examiner, head of the department, a senior faculty member and the supervisor.




OPERATING SYSTEMS and COMPUTER NETWORK LAB Code: 4EC87 L T P/D C

- - 4 2 Course Objective :

To understand design concepts of framing and routing concepts To learn the design aspects of operating system.

Course Outcomes: After completing the subject, students will be able to

1. Implement CPU Scheduling algorithms. 2. Implement deadlock detection and avoidance algorithms. 3. Implement page replacement algorithms. 4. Implement and analyze framing methods of data link layer. 5. Analyze error detection techniques.

6. Implement and analyze routing issues in network design. Objective:

To provide an understanding of the design concepts of framing and routing concepts To provide an understanding of the design aspects of operating system.

Recommended Systems/Software Requirements:

a. Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB RAM and 100 MB free disk space

b. C++ compiler and JDK kit PART - A 1. Simulate the following CPU scheduling algorithms a) Round Robin b) SJF c) FCFS d) Priority 2. Simulate all file allocation strategies a) Sequential b) Indexed c) Linked 3. Simulate MVT and MFT 4. Simulate Bankers Algorithm for Dead Lock Avoidance 5. Simulate Bankers Algorithm for Dead Lock Prevention 6. Simulate all page replacement algorithms a) FIFO b) LRU c) LFU 7. Simulate Paging Technique of memory management. Part B 1. Implement the data link layer framing methods such as a) Character Count b) character / byte stuffing c) bit stuffing. 2. Implement on a data set of characters the CRC Detection Technique. 3.Implement Dijkstra's algorithm to compute the shortest path through a graph. 4.Take an example subnet graph with weights indicating delay between nodes. Now obtain Routing table for each node using distance vector routing algorithm.




WEB TECHNOLOGIES LAB

Code: 4FC82 L T P/D C - - 4 2

Course Objective : 1. Implement programs using HTML tags , Java scripts along with along with Event Handling. 2. Implement scripts using XML, DOM parser and SAX for project development. Course Outcomes After completing the subject, students will be able to

1. Describe WWW features and Demonstrate/ use of HTML tags

2. Develop dynamic programs involving Java scripts, popup windows in JavaScript along with Event Handling.

3. Develop scripts using XML and XSLT and to read XML document using parsers, DOM parser and SAX parser.

4. Develop Java servlets using Apache Tomcat Server for user authentications 5. Develop JDBC Application using JSP and ODBC Connectivity.

To create a fully functional website with mvc architecture. To develop an online Book store using we can sell books (Ex amazon .com). Hardware and Software required :

1. A working computer system with either Windows or Linux 2. A web browser either IE or firebox 3. Tomcat web server and Apache web server 4. XML editor like Altova Xml-spy [www.Altova.com/XMLSpy – free ] , Stylusstudio ,

etc., 5. A database either Mysql or Oracle 6. JVM(Java virtual machine) must be installed on your system

Week-1: Design the following static web pages required for an online book store web site. 1) HOME PAGE: The static home page must contain three frames. Top frame: Logo and the college name and links to Home page, Login page, Registration page, Catalogue page and Cart page (the description of these pages will be given below). Left frame : At least four links for navigation, which will display the catalogue of respective links. For e.g.: When you click the link “CSE” the catalogue for CSE Books should be displayed in the Right frame. Right frame: The pages to the links in the left frame must be loaded here. Initially this page contains description of the web site.


2) LOGIN PAGE:

3) CATOLOGUE PAGE: The catalogue page should contain the details of all the books available in the web site in a table. The details should contain the following:

1. Snap shot of Cover Page. 2. Author Name. 3. Publisher. 4. Price. 5. Add to cart button.


Note: Week 2 contains the remaining pages and their description. Week-2: 4) CART PAGE: The cart page should look like this:

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, Telugu, Hindi, Tamil) 8) Address (text area)


WEEK 3: VALIDATION: Write JavaScript to validate the following fields of the above registration page.

3. Name (Name should contains alphabets and the length should not be less than 6 characters).

4. Password (Password should not be less than 6 characters length). 5. E-mail id (should not contain any invalid and must follow the standard pattern

[email protected] ) 4. Phone number (Phone number should contain 10 digits only). Note : You can also validate the login page with these parameters.

Week-4: Design a web page using CSS (Cascading Style Sheets) which includes the following:

1) Use different font, styles: In the style definition you define how each selector should work (font, color etc.). Then, in the body of your pages, you refer to these selectors to activate the styles.

For example <HTML> <HEAD> <style type = “text/css”> B.headline {color:red; font-size:22px;font-family:arial;text-decoration:underline} </style> <HEAD> <BODY> <b>This is normal boild</b><br>

Selector{cursor:value}


2) Set a background image for both the page and single elements on the page. You can define the background image for the page like this:


3) Control the repetition of the image with the background-repeat property. As background-repeat: repeat Tiles the image until the entire page is filled, just like an ordinary background image in plain HTML. 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; color: red;} </style> 5) Work with layers: For example: LAYER 1 ON TOP: <div style="position:relative; font-size:50px; z-index:2;">LAYER 1</div> <div style="position:relative; top:-50; left:5; color:red; font-size:80px; z- index:1">LAYER 2</div> LAYER 2 ON TOP: <div style="position:relative; font-size:50px; z-index:3;">LAYER 1</div> <div style="position:relative; top:-50; left:5; color:red; font-size:80px; z- index:4">LAYER 2</div> 6) Add a customized cursor: Selector {cursor:value} For example:


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. Display the XML file as follows. The contents should be displayed in a table. The header of the table should be in color GREY. And the Author names column should be displayed in one color and should be capitalized and in bold. Use your own colors for remaining columns. Use XML schemas XSL and CSS for the above purpose. Note: Give at least for 4 books. It should be valid syntactically. Hint: You can use some xml editors like XML-spy

B.Tech CSE - III and IV year 2014-15

35

Week-6: 1) Install TOMCAT web server and APACHE.

While installation assign port number 4040 to TOMCAT and 8080 to APACHE. Make sure that these ports are available i.e., no other process is using this port.

2) Access the above developed static web pages for books web site, using these servers by putting the web pages developed in week-1 and week-2 in the document root.

Access the pages by using the urls : http://localhost:4040/rama/books.html (for tomcat) http://localhost:8080/books.html (for Apache)

Week-7:

User Authentication : Assume four users user1,user2,user3 and user4 having the passwords pwd1,pwd2,pwd3 and pwd4 respectively. Write a servelet for doing the following. 1. Create a Cookie and add these four user id’s and passwords to this Cookie. 2. Read the user id and passwords entered in the Login form (week1) and authenticate with the values (user id and passwords ) available in the cookies. If he is a valid user(i.e., user-name and password match) you should welcome him by name(user-name) else you should display “ You are not an authenticated user “. Use init-parameters to do this. Store the user-names and passwords in the webinf.xml and access them in the servlet by using the getInitParameters() method.

Week-8: Install a database(Mysql or Oracle).

Create a table which should contain at least the following fields: name, password, email-id, phone number(these should hold the data from the registration form).

Practice 'JDBC' connectivity. Write a java program/servlet/JSP to connect to that database and extract data from the tables and display them. Experiment with various SQL queries. Insert the details of the users who register with the web site, whenever a new user clicks the submit button in the registration page (week2).

Week-9: 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. Authenticate the user when he submits the login form using the user name and password from the database ( similar to week8 instead of cookies). Week-10:

Create tables in the database which contain the details of items (books in our case like Book name , Price, Quantity, Amount )) of each category. 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.

Week-11: HTTP is a stateless protocol. Session is required to maintain the state. The user may add some items to cart from the catalog page. He can check the cart page for the


36

selected items. He may visit the catalogue again and select some more items. Here our interest is the selected items should be added to the old cart rather than a new cart. Multiple users can do the same thing at a time(i.e., from different systems in the LAN using the ip-address instead of local host). This can be achieved through the use of sessions. Every user will have his own session which will be created after his successful login to the website. When the user logs out his session should get invalidated (by using the method session. invalidate () ). Modify your catalogue and cart JSP pages to achieve the above mentioned functionality using sessions.

Week-12: Write a web application which includes Servlets, JSP, Java Beans and JDBC, using different types of drivers.


37


TECHNICAL PAPER WRITING AND SEMINAR- V

Code: 4E594 L T P/D C - - 2 1

Course Objectives :

Learn to identify, arrange, and present a technical topic to improve communication and soft skills to enhance global employability.

Pre-Requisites: All Courses till this semester Course Outcomes: After completing the subject, students will be able to

1. Identify a topic from the current technical topics of their choice in the computer science domain and the allied fields, after surveying in the internet resources, journals and technical magazines in the library.

2. Learn to arrange the contents of the presentation and scope of the topic, in an effective manner.

3. Present the technical topic they chose in front of the panel and the fellow students, using the oratory skills.

4. Face the questions posed by the panel and the students and answer them. There shall be a Technical Paper writing and seminar evaluated for 25 marks in Third Year Second Semester. The evaluation is purely internal and will be conducted as follows:


Consisting of Head, a Senior Faculty and Supervisor : 15 marks



38


Syllabus for B. Tech. III Year II semester Computer Science and Engineering

BANKING OPERATIONS, INSURANCE AND RISK MANAGEMENT (OPEN ELECTIVE - II)

Code: 4ZC03 L T P C 3 - - 3

Course Objective: The objective of the course is to provide to students an understanding of Banking Operations, Insurance Market, and Risk Management Principles and techniques to control the risk, & the major Institutions involved and the Services offered within this framework. Course Outcomes:

1. Explain global, environmental, political, economic, legal and regulatory context of banking industry including New Dimensions and products.

2. Explain Banking regulation Act-1949, Reserve Bank of India Act-1934, Establishment of RBI and its Functions and Role of commercial banks and its functions along with reforms .

3. Describe Need , principles and importance of Insurance along with its products and explain Role of Agents and brokers.

4. Describe Regulatory and legal frame work governing the insurance sector, history of IRDA and its functions: Business and economics of insurance.

5. Analyze derivatives & risk , investment decisions and comprehend scope of Insurance business environment.

6. Explain Financial markets , risk , Derivatives and describe Hedging and Portfolio management techniques.

UNIT I INTRODUCTION TO BANKING BUSINESS: Introduction to Banking sectors-History of banking business in India, Structure of Indian banking system: Types of accounts, advances and deposits in a bank New Dimensions and products- E-Banking, Mobile-Banking, Net Banking, CRM, cheque system and KYC system. UNIT II BANKING REFORMS AND REGULATIONS: Banking regulation Act-1949, Reserve Bank of India Act-1934, Establishment of RBI, Functions and credit control system; Role of commercial banks and its functions. Banking sector reforms in India and deficiencies in Indian banking including problems accounts and Non-Performing Assets. UNIT III INTRODUCTION TO INSURANCE: Introduction to insurance, Need and importance of Insurance, principles of Insurance, characteristics of insurance contract, branches of insurance and types of insurance; life insurance and its products: Role of Agents and brokers.


39

UNIT IV INSURANCE BUSINESS ENVIRONMENT: Regulatory and legal frame work governing the insurance sector, history of IRDA and its functions: Business and economics of insurance, need for changing mindset and latest trends. UNIT V INTRODUCTION TO RISK MANAGEMENT: Introduction to Risk, meaning and types of risk in business and individual, Risk management process, methods: Risk identification and measurement, Risk management techniques; Non insurance methods. UNIT VI FINANCIAL RISK MANAGEMENT: Introduction to Financial markets. Financial risk management techniques –Derivatives, Hedging and Portfolio management techniques: Derivatives and types of Derivatives-Futures, options and swaps: Shares, Commodity and Currency trading in India. BOOKS RECOMMENDED:

Varshney, P.N., Banking Law and Practice, Sultan Chand & Sons, New Delhi. General Principles of Insurance Harding and Evantly Mark S. Dorfman: Risk Management and Insurance, Pearson, 2009.

REFERENCES: Scott E. Harringam Gregory R. Nichanus: Risk Management & Insurance, TMH, 2009. Geroge E. Rejda: Principles of risk Management & Insurance, 9/e, pearson Education. 2009. G. Koteshwar: Risk Management Insurance and Derivatives, Himalaya, 2008. Gulati: Principles of Insurance Management, Excel, 2009. James S Trieschmann, Robert E. Hoyt & David N. Sommer: Risk Mgt. & Insurance, Cengage,

2009. Dorfman: Introduction to Risk Management and Insurance, 8/e, Pearson, 2009. P.K. Gupta: Insurance and Risk Management, Himalaya, 2009. Vivek & P.N. Asthana: Financial Risk Management, Himalaya, 2009. Jyotsna Sethi & Nishwan Bhatia: Elements of Banking and Insurance, 2/e,PHI, 2012.


40



GENERAL MANAGEMENT & ENTREPRENEURSHIP (OPEN ELECTIVE - II)

Code: 4ZC05 L T P/D C 3 - - 3

Pre-requisites: This course shall require a student to have knowledge in Managerial Economics and Financial analysis, Management Science, Operations management. Course Objectives: 1. Study Entrepreneurship Management as a aspiring entrepreneur. 2. Know process models and new products. 3. Understand project management and leadership. 4. Learn Intellectual property rights and business practices. 5. Study concepts of patent, copy rights and infringement 6. Study venture capital financing and pricing and plant layout design . Course Outcomes: 1. Explain the need for Entrepreneurship Management, its benefits, process and describe roles and

behavioral aspects of aspiring entrepreneur with case studies. . 2. Develop process model and innovate new products to start an industry by identifying

appropriate team. 3. Demonstrate knowledge of project management and leadership and apply tools/techniques to

study/analyze a product feasibility and document the report. 4. Describe need and relevance of Intellectual property rights to protect confidentiality of ideas

and business practices. Explain the concept of patent, copy rights and infringement etc. along with legal framework to deal IPR.

5. Describe venture capital financing and pricing issues relating to funding, cost analysis, market structures useful for a budding entrepreneur.

6. Explain design of plant layout, product / service factory issues and practice quality and Certification.

UNIT I INTRODUCTION TO MANAGEMENT AND ENTREPRENEURSHIP: Changing Face of Management-Entrepreneurship, Modern Management with Entrepreneurial Orientation.. Meaning of Entrepreneurship. Benefits and Drawbacks of Entrepreneurship Reasons feeding the Entrepreneurial fire. Understanding Entrepreneurship as a Process. Multiple roles of Entrepreneur: Intrapreneur, Inventor, Coordinator, Manager and Controller. Psychological and behavioral aspects of First-Generation Entrepreneur. Case Studies UNIT II PROCESS DEVELOPMENT AND INNOVATION PROJECT MANAGEMENT: Business Process Model, Value chain for Manufacturing industries and Service Industries. Frugal Innovation. Creativity process in developing Innovation.. Types of New Products, Forecasting of New Products, Stages in the New Product Development, Prototype building and pitching Going ahead with ideas, killing the ideas through Stage Gate Models, pitching of full fledged idea. Choosing the Start-Up Team.


41

UNIT III PROJECT MANAGEMENT & FEASIBILITY REPORT: Project Inception, Project Implementation, and Project control. Analyzing the project by employing capital budgeting techniques, Risk Management, tools and techniques. Methods of Appraising the Project. Industry Analysis pertaining to the Product, Competitive Analysis and Market analysis. Preparation of feasibility report, Contents of Feasibility Report. Exercise to write an effective Feasibility report. Case Studies. UNIT IV PROTECTION OF IDEAS AND MECHANISM: Exposure to intellectual property rights to the entrepreneur in the Indian and the World context. Registration process for Patents, Copyrights, Trademarks, Geographical indicators. Legal Framework in administration of Intellectual property rights. Meaning of Infringement, consequences of Infringement. Cases on Infringement. Case Studies. UNIT V VENTURE FINANCING AND ISSUES RELATED TO PRICING: Meaning of Venture Capitalist, Process of Venture Capital, Seed Funding, First Phase Funding, Second Phase Funding and Final Phase funding. Cost analysis, Preparation of standard costing, Finalizing the output, fixing the pricing based on market structure, Monopoly, oligopoly market structures and marketing pricing practices for attracting customers. Case Studies UNIT VI MANUFACTURING AND QUALITY MANAGEMENT: Plant Layout, Process and Product Layout, Service Factory. Introduction to Quality Circles, Quality inspection, ISO Certification, process of certification and exposure to the entrepreneurs of the need for certification. Quality certification for Manufacturing industrial. Case Studies

BOOKS RECOMMENDED:

"Projects: Planning, Analysis, Selection, Financing, Implementation, and Review", Prasanna Chandra, TMH, New Delhi, 2012

"Project Management", Jeffrey K. Pinto, Pearson, 2011 Small Scale industries and Entrepreneurship Vasanth Desai “Himalya publishing

2012 REFERENCES:

Innovation by Design", Gerald H. (Gus) Gaynor, AMACOM {American Management Association), NYC, 2002

Entrepreneurship Rajeev Roy “” oxford ,2012 Fundamentals of Entrepreneurship Nandan H, PHI, 2013 Entrepreneurship Development Khanka, ,S.Chand 2012 Robert Hisrich et al “enterpreneruship TMH 2012 Entrepreneurship Development B.Janikairam and M Rizwana


42



FUNDAMENTALS OF BIOINFORMATICS (OPEN ELECTIVE-II)

Code:4GC35 L T P/D C 3 - - 3 Course Objectives : Learn concepts of bioinformatics, biological databases , sequence-based databases its searches , phylogenetic analysis , gene and protein structure prediction COURSE OUTCOMES (CO) CO:1 Demonstrate knowledge and understanding of the biological, computational, Engineering and mathematical sciences relevant to biotechnology CO:2 Analyze and interpret homology by using basic bioinformatics problems and their solutions CO:3 Demonstrate the ability to solve biological problems using basic computer science Programming tools and software CO:4 Develop the ability to identify the computational problems within the living Systems at molecular level CO :5 Develop the ability to evaluate the evolutionary relationships among various Organisms using computational methods. CO:6 Gain an understanding of working in interdisciplinary teams of biologists, Biochemists, medical researchers, geneticists, and allied engineering branches. UNIT I : SCOPE OF BIOINFORMATICS and BIOLOGICAL DATABASES History, definition, importance and applications of bioinformatics in information technology, Introduction to biological data, Organization and management of databases, Nucleotide databases (Genbank), Protein Databases(UNI PROT) UNIT II: SEQUENCE ALIGNMENT Database searching, Basic concepts of sequence homology Dynamic Programming, Dot Matrix analysis, Smith-Waterman Algorithm, Neddleman-Wunsch Algorithm, Scoring matrices: PAM and BLOSUM matrices UNIT III: SEQUENCE-BASED DATABASE SEARCHES BLAST and FASTA algorithms, various versions of basic BLAST and FASTA, Use of these methods for sequence analysis including the on-line use of the tools and interpretation of results. UNIT IV: MULTIPLE SEQUENCE ALIGNMENT Basic concepts of various approaches for MSA algorithms (e,g. progressive, hierarchical etc.). Algorithm of CLUSTALW and its application UNIT V: PHYLOGENETIC ANALYSIS Definition and description of phylogenetic trees. Distance based and character based algorithms of phylogenetic analysis


43

UNIT VI: GENE AND PROTEIN STRUCTURE PREDICTION Biological sequence/structure, Human Genome Project, Gene structure and DNA sequences, Pattern recognition and prediction, Protein Secondary structure prediction methods, Algorithms of Chou Fasman, GOR methods. Protein homology modeling. TEXT BOOKS: 1. Bioinformatics. David Mount, 2000. CSH Publications REFERENCES: 1. Bioinformatics: A Machine Learning Approach P. Baldi. S. Brunak, MIT Press 1988. 2. Genomics and Proteomics-Functional and Computational aspects. Springer

Publications. Editior-Sandor Suhai. 3. Bioinformatics- Methods and Protocols-Human Press. Stephen Misener, Stephen A.

Krawetz. 4. Bioinformatics – A Practical guide to the Analysis of Genes and Proteins – Andreas

D.Baxevanis, B.F. Francis Ouellette. COURSE SYNOPSIS Bioinformatics is the field of science in which biology, computer science, and information technology merge into a single discipline. Bioinformatics is the application of information sciences to biology. This specialized stream of science deals with the creation and maintenance of databases of biological information, which includes nucleic acid sequences, and protein sequences. It also includes the software’s that are required for the detailed analysis of the genes and proteins. The field of bioinformatics emerged, primarily because of the significant advances made by the Human Genome Project and other systematic sequencing projects, and the necessity for all biologists to be able to apply—at some level—these techniques to their own research. Bioinformatics occupies a unique niche amongst the sciences, lying at the intersection of biology, genetics, biochemistry, computer science, mathematics, statistics, and numerous other allied fields. The inherent strength of the field of bioinformatics comes from the relationships between investigators in these allied fields; collaborations between these individuals have led to the development of novel methods and approaches, furthering advances in each of these areas. Bioinformatics was applied in the creation and maintenance of a database to store biological information at the beginning of the "genomic revolution", such as nucleotide and amino acid sequences. In order to study how normal cellular activities are altered in different disease states, the biological data must be combined to form a comprehensive picture of these activities. Therefore, the field of bioinformatics has evolved such that the most pressing task now involves the analysis and interpretation of various types of data, including nucleotide and amino acid sequences, protein domains, and protein structures. The actual process of analyzing and interpreting data is referred to as computational biology. Important sub-disciplines within bioinformatics and computational biology include: Genomics – Genome annotation, Gene finding, Genome assembly, Prediction of gene expression- Micro arrays , Genome-wide association studies;Proteomics - Protein structure prediction, Protein-protein interactions, drug design, drug discovery Phylogenetic analysis –


44

Sequence alignment, Sequence database search, protein structure alignment , Computational evolutionary biology, Modeling of evolution. The key challenge for the next few years will be to quickly and efficiently identify the most promising drug candidates from the constantly increasing plethora of possibilities with cost-effectiveness. Current research activities aim at going beyond the realm of human genome sequencing to expand the list of identified proteins and genes. The subject containing SIX units covers from the basic database search protocols to most important concepts of Bioinformatics.


45


Syllabus for B. Tech. III Year II semester

Computer Science and Engineering INTRODUCTION TO NANOTECHNOLOGY

(OPEN ELECTIVE-II) L T P/D C

Code 4BC25 3 - - 3

OBJECTIVE: The course aims at providing an overview of basic physics of solids and advanced topics in solid state materials of technological value, a working knowledge of the foundations, techniques, and key results of quantum mechanics and the basic principles of thermodynamics and to lay emphasis on the fundamentals. COURSE OUTCOMES CO1: Describe basics of Nanotechnology , Crystal Structure with respect to arrangement of

atoms and two dimensional crystal structures. CO2: Discuss 3D crystal structures with suitable examples depicting planes in crystals and

crystallographic directions. CO3 : Apply Reciprocal lattice Bragg’s law, reciprocal lattice vectors, diffraction

conditions, Laue and Powder methods with bonds. CO 4. Describe quantum mechanics principles, De-Broglie hypothesis, Wave particle duality,

Heisenberg’s uncertainty principle and Schrodinger wave equation. CO 5. Describe Finite Potential Wells and barriers , Energy gaps, conduction in Solids,

Particle in 2-D box, Quantum Fluctuation and Discrete Quantum states with Quantum Confinement.

CO 6. Describe thermodynamics, phase diagrams and phase transformations.

Unit-I: Introduction to Nanotechnology, Crystal Structure: Introduction, arrangement of atoms, two dimensional crystal structures

Unit-II: Three dimensional crystal structures, some examples of three dimensional crystals, planes in crystals and crystallographic directions,

Unit-III: Reciprocal lattice Bragg’s law, reciprocal lattice vectors, diffraction conditions, Laue and Powder methods; Quasicrystals, Type of bonds – ionic, covalent and metallic bonds

Unit-IV: Why quantum mechanics? Matter waves, Length scales, De-Broglie hypothesis,Wave particle duality, Heisenberg’s uncertainty principle, Schrodinger wave equation, Particle in one dimensional box

Unit-V: Finite Potential Wells and barriers: Periodic lattice, Energy gaps, Qualitative Description of the theory of conduction in Solids, Particle in 2-D box, Quantum Fluctuation and Discrete Quantum states, Concepts of Quantum Confinement

Unit-VI: Thermodynamics, phase diagrams and phase transformations


46

Textbooks: 1. Introduction to Nanotechnology by Charles P.Poole Jr and Frank J. Owens, Wiley

India Pvt. Ltd. 2. Nano pahysics and nanotechnology by E.L.Wolf willely VCH 3. A Textbook of Quantum Mechanics by P.M. Mathews and K. Venkatesan, Tata

McGraw Hill Publishing Company Ltd. 4. Modern Quantum Mechanics by J.J. Sakurari, Addison Wesley Longman Inc. 5. Solid state Physics by Kittel 6. Nanotechnology:Principles and Practices by S.K. Kulkarni, Capital Publishing

Company 7. Quantum mechanics by Pawling and Wilson 8. The Feynman lectures on Physics; Vol I to III 9. “Nanoscience and Nanotechnology: Fundamentals to Frontiers” by M.S.

Ramachandra Rao and Shubra Singh, Wiley Publishers, 2013. Reference Books:

1. Nanotechnology and Nano Electronics – Materials, devices and measurement techniques by WR Fahrner, Springer

2. Nanotechnology – science, innovation and opportunity by Lynn E Foster, Prentice Hall - Pearson education.

3. Encyclopedia of Nanotechnology by H.S. Nalwa


47



Computer Science and Engineering FUNDAMENTALS OF EMBEDDED SYSTEMS

(OPEN ELECTIVE-II) L T P/D C

Code:4DC52 3 - - 3 Course Objectives:

Know about 8051 Architecture, Features and Programming Know about interfacing of I/O devices to 8051. Know Interfacing of different devices and Networked Embedded Systems. Know about case studies in Embedded Systems Industry.

Finally Student should able to understand the basic concepts and design of the systems like An ability to design, implement and evaluate a software and hardware system to meet

the desired needs within realistic constraints such as cost and time An ability to use the techniques, skills, and modern engineering tools for designing

and testing necessary for practice as an Electronics & Computer professional COURSE OUTCOMES CO1: Describe fundamentals of Embedded Systems , Complex System Design and

Processors, Classification , Design Process, SOC and VLSI Circuit Technology with examples.

CO2: Describe and use 8051 Architecture, its primitives in programming Assembly Language for a Process, Program 8051 with Data Transfer, Logical Instructions, Arithmetic Operations.

CO3. Perform Interfacing for real time product development and apply IO subsystem using sensors and actuators for LED and LCD Interfacing and stepper Motor.

CO 4. Apply Serial and Parallel Communication in a project and describe SPI protocol, ISA , PCI, Internet Enabled Systems and Wireless and Mobile Systems Protocols.

CO 5. Apply concepts of Embedded Programming and Interrupts to develop real time product.

CO 6. Explain Case Studies pertaining to Industry Trends, Digital Clock, Battery operated Smart Card Reader and Digital Cameras.

UNIT – I: Introduction to Embedded Systems Embedded Systems, Comparing Embedded and General Computing, Complex System Design and Processors, Classification of Embedded Systems, Embedded System Design Process, Formalization of System Design, Embedded SOC and VLSI Circuit Technology, Application examples of Embedded Systems. UNIT – II: 8051 Architecture, Memory Organization and Programming 8051 Architecture, features, Addressing modes, Instruction set, Input/Output Ports and Circuits, External Memory, Counter and Timers, Serial data, Input/Output, Interrupts; The Assembly Language programming Process, Programming the 8051, Data Transfer and


48

Logical Instructions. Arithmetic Operations, Decimal Arithmetic. Jump and Call Instructions, use of C programming for 8051. UNIT – III: 8051 Real World Interfacing Part A - Real World Interfacing, Performance metrics, Memory map, Processor and Memory selection, Part B - IO Subsystem, Sensors and Actuators, LED and LCD Interfacing, Keyboard Interfacing, Stepper Motor Interfacing, DC motor Interfacing Using PWM UNIT – IV: Embedded Communication Interface Serial and Parallel Communication, Timer and Counting Devices, Watchdog Timer, Real Time Clock, I2C, SPI protocol, ISA , PCI, Internet Enabled Systems, Wireless and Mobile Systems Protocols UNIT – V: Interrupts Service Mechanism and Embedded Programming ISR Concepts, Context switching, interrupt Latency, Deadline, Embedded Firmware Design Approaches, Programming Concepts, Programming in Embedded C and Program Modeling Concepts Objective: At the end of this unit the student should be able to know the concepts of Embedded Programming and Interrupts UNIT – VI: Embedded System Case Studies – Embedded Industry Trends, Digital Clock, Battery operated Smart Card Reader, Automated Meter Reading System (AMR), Digital Camera TEXT BOOKS:

1. Embedded Systems- Architectuer, Programming and Design 2E, Raj Kamal, TMH 2. Introduction to Embedded Systems, K.Shibu, Tata McGraw-Hill 3. The 8051 Microcontroller And Embedded Systems Using Assembly And C – Mazidi,

Pearson Education India, 2nd edition, 2008. REFERENCES:

1. An Embedded Software Primer, David E. Simon, Pearson Education. 2. Computers and Components: principles of embedded computing system design,

Wayne Wolf, Elseveir. 3. 8051 Application Notes by Atmel.


49



FUNDAMENTALS OF DISASTER MANAGEMENT

(OPEN ELECTIVE - II) Code: 4ZC07 L T P C

3 - - 3 Course Objectives :

Study factors for disasters , crises , methods to reduce impact of any disasters and Vulnerabilities.

Learn Components of Disaster Relief and how to use IT for combating disasters.

Course Outcomes:

1. Identify and describe disasters , causes , Impacts on including social, economic, political, environmental, health, psychosocial and Differential impacts .

2. Explain global trends in disasters in Urban disasters, pandemics, complex emergencies, Climate change.

3. Explain and use methods to reduce disasters with Structural and nonstructural measures, roles and responsibilities of community, describe role of Urban Local Bodies (PRIs / ULBs), district administration, states, centre, and other stakeholders.

4. Distinguish between disasters and development and Factors affecting Vulnerabilities, differential impacts; Impact of Development projects such as dams, embankments, Climate change adaptation, Relevance of indigenous knowledge.

5. Describe disaster management in india and Components of Disaster Relief: Water, Food, Sanitation, Shelter, Health, Waste Management; Institutional arrangements , DM Act , process and Policy

6. Apply IT to deal Disaster Management , using Databases, Decision support systems, GIS , Video Teleconferencing and Remote Sensing .

UNIT I

INTRODUCTION TO DISASTERS: Concepts and definitions (Disaster, Hazard, Vulnerability, Resilience, Risks) Disasters – Classification, Causes, Impacts (including social, economic, political, environmental, health, psychosocial, etc.). Differential impacts – in terms of caste, class, gender, age, location, disability.

UNIT II

GLOBAL TRENDS IN DISASTERS:

Urban disasters, pandemics, complex emergencies, Climate change Case Study on Climate Change.


50

UNIT III

APPROACHES TO DISASTER RISK REDUCTION: Disaster cycle – its Analysis, Phases. Culture of safety, prevention, mitigation and preparedness; Community-based DRR: Structural and nonstructural measures, roles and responsibilities of community, Panchayati Raj Institutions / Urban Local Bodies (PRIs / ULBs), district administration, states, centre, and other stakeholders; Case studies.

UNIT IV

INTER-RELATIONSHIP BETWEEN DISASTERS AND DEVELOPMENT: Factors affecting Vulnerabilities, differential impacts; Impact of Development projects such as dams, embankments, changes in land-use etc; Climate change adaptation; Relevance of indigenous knowledge, appropriate technology and local resources; Case studies.

UNIT V

DISASTER MANAGEMENT IN INDIA: Hazard and vulnerability profile of India. Components of Disaster Relief: Water, Food, Sanitation, Shelter, Health, Waste Management; Institutional arrangements (Mitigation, Response and Preparedness, DM Act and Policy, Other related policies, plans, programs and legislation); Case studies.

UNIT VI

APPLICATION OF TECHNOLOGY IN DISASTER MANAGEMENT: IT in Disaster Management – Databases – RDBMS – Management information systems – Decision support systems – GIS – Intranets and Extranets – Video Teleconferencing, Trigger Mechanism – Remote Sensing – Contribution of remote sensing and GIS. Case Studies and Global Initiatives.

BOOKS RECOMMENDED:

1. B. K. Khanna: “Disasters: All you wanted to know about”, New India Publishing Agency, New Delhi

2. Pradeep sanhi,Madhavi malalgoda and arya bandhu,”Diasaster risk reduction in south asia “PHI

3. Amita sinvhal ,”Understanding earthquake disasters”TMH,2010

REFERENCES:

1. Natural Hazards and Disaster Management: R.B. Singh, Rawat Publications 2. Remote Sensing and GIS by A.M. Chandra and S.K. Ghosh, Narosa Publishing house 3. GIS – Fundamentals, Applications and Implementations: Dr. K. Elangovan, New

India publishing agency

SUGGESTED READING LIST:

Alexander David, Introduction in ‘Confronting Catastrophe’, Oxford University Press Andharia J., Vulnerability in Disaster Discourse, JTCDM, Tata Institute of Social

Sciences Working Paper no. 8, 2008


51

Blaikie, P, Cannon T, Davis I, Wisner B 1997. At Risk Natural Hazards, Peoples’ Vulnerability and Disasters, Routledge.

Coppola P Damon, 2007. Introduction to International Disaster Management Carter, Nick 1991. Disaster Management: A Disaster Manager’s Handbook. Asian

Development Bank, Manila Philippines. Cuny, F. 1983. Development and Disasters, Oxford University Press. Document on

World Summit on Sustainable Development 2002. Govt. of India: Disaster Management Act 2005, Government of India, New Delhi. Government of India, 2009. National Disaster Management Policy Gupta Anil K, Sreeja S. Nair. 2011 Environmental Knowledge for Disaster Risk

Management, N 1DM, New Delhi Indian Journal of Social Work 2002. Special Issue on Psychosocial Aspects of

Disasters, Volume 63, Issue 2, April. Kapur, Mu & others, 2005: Disasters in India Studies of grim reality, Rawat

Publishers Kapur Anu 2010: Vulnerable India: A Geographical Study of Disasters, IIAS and

Sage Publishers, New Delhi. Pelling Mark, 2003 The Vulnerability of Cities: Natural Disaster and Social

Resilience Earthsean publishers, London Reducing risk of disasters in our communities, Disaster theory, Tearfund, 2006. UNISDR, Natural Disasters and Sustainable Development: Understanding the links

between Development, Environment and Natural Disasters, Background Paper No. 5. 2002.

IFRC. 2005. World Disaster Report: Focus on Information in Disaster, pp. 182-225.


52



SAP – II: SAP ABAP Workbench Concepts (OPEN ELECTIVE - II)

Code: 4EC27 L T P/D C 3 - - 3 Teaching Scheme Examination Scheme Lecture-4 Hours/Week in Semester Assessment: 30Marks Practical-2 Hours/Week End Semester Assessment: 70Marks Course Objectives 1. Write object oriented programs with ABAP 2. Understannd the techniques in enhancements and modifications 3. Create simple Web Dynpro for ABAP applications Course Outcomes 1. To carry out enhancements and modifications to SAP standard, in future proof manner 2. To develop simple Web Dynpro for ABAP applications 3. To be able to understand Functional Specifications and write Technical Specifications Unit Content

1 ABAP Objects-Part 1 1. Object-Oriented Programming (OOPS Programming)

2. Fundamentals Object-Oriented syntax 3. Inheritance and casting

4. Interfaces and casting 5. Events

2 ABAP Objects-Part2 1. Global Classes and Interfaces 2. Exception handling 3. ABAP Object-Oriented examples-ALV and BAdls 4. Abstract classes, factory methods, singletons 3 Shared Objects and shared Memory Areas 1. Shared Objects 2. Shared Memory Access 4 Dynamic Programming 1. Generic data types 2. Field symbols and data references 3. Runtime Type Identifications (RTTI) 4. Runtime Type Creation (RTTC)


53

5 Enhancements and Modifications 1. Adjustment of SAP Standard Software 2. Enhancing Dictionary elements 3. Customers Exits 4. Business Add Ins (BAdls) 5. Modifications of the SAP standard applications 6. Implicit and Explicit Enhancements 6 Fundamentals of Webdynpro for ABAP 1. Web Dynpro Components, Windows and Views 2. Web Dynpro Controllers 3. Web Dynpro Context 4. Web Dynpro User Interface 5. Controller and Context programming Textbooks:

1. SAP ABAP Workbench Concepts, Part 1, SAP India 2. SAP ABAP Workbench Concepts, Part 2, SAP India

References: www. Training.sap.com/in/en


54


OBJECT ORIENTED ANALYSIS AND DESIGN

Code: 4EC06 L T P/D C 3 1 - 3

Course Objectives: Introduce UML principles and software life cycle. Learn Structural , Class, behavioral and object diagrams. Learn architectural modeling for application development.

Course Outcomes: 1 Describe elements of Unified Modeling Language paradigm for problem solving.

2 Demonstrate basic structural and advanced structural modeling through examples.

3 Design Unified Modeling Language (UML) diagrams that represent number of modeling views.

4 Devise various UML models.

5 Describe and apply advanced behavioral modeling techniques

6 Apply architectural and develop applications.

UNIT I Introduction to UML: Importance of modelling, principles of modelling, object oriented modelling, conceptual model of the UML, Architecture, Software Development Life Cycle, Modelling Tools. UNIT II Basic Structural Modelling: Classes, Relationships, common Mechanisms, and diagrams. Advanced Structural Modelling: Advanced classes, advanced relationships, Interfaces, Types and Roles, Packages. UNIT III Class Diagrams: Terms, concepts, modelling techniques for Class Diagrams. Object Diagrams: Terms, concepts, modelling techniques for Object Diagrams. Applications: Drawing class and object diagrams for ATM system. UNIT IV Basic Behavioural Modelling-I: Interactions, Interaction diagrams, Use cases, Use case Diagrams, Activity Diagrams. Applications: Drawing interaction, use case and activity diagrams for ATM system. UNIT V Advanced Behavioural Modelling: Events and signals, state machines, processes and Threads, time and space, state chart diagrams. Applications: Drawing state chart diagram for ATM system.

a b c d e f g h i j k l m

x x x x


55

UNIT VI Architectural Modelling: Component, Deployment, Component diagrams and Deployment diagrams. Application: Drawing design diagrams on Unified Library Management system. TEXT BOOKS 1. The Unified Modelling Language User Guide by Grady Booch, James Rumbaugh, Ivar Jacobson, Pearson Education. 2. UML 2 Toolkit by Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado, WILEY- Dreamtech India Pvt. Ltd. REFERENCES 1. Fundamentals of Object Oriented Design in UML by Meilir Page-Jones, Pearson Education. 2. Modeling Software Systems Using UML2 by Pascal Roques, WILEY-Dreamtech India Pvt. Ltd. 3. Object Oriented Analysis & Design by Atul Kahate, The McGraw-Hill Companies. 4. Practical Object-Oriented Design with UML by Mark Priestley,TATA McGrawHill 5. Appling UML and Patterns: An introduction to Object – Oriented Analysis and Design and Unified Process by Craig Larman, Pearson Education.


56


COMPILER DESIGN Code: 4EC08 L T P/D C

3 1 - 3 Course Objectives:

Study the design and working of a complier . Study the role of grammars in compiler design. Learn a various parsing techniques for design of compilers.

Course Outcomes:

1. Explain Overview of compiler its Environment phases and features of Lexical Analyzer, LEX tool

2. Describe and apply Context free grammar, Top down parsing technique, LMD, RMD, Recursive decent parsing with back tracking, Ambiguous grammar, Elimination of left recursion, Left factoring, unambiguous grammar, Predictive parsing, LL(1).

3. Demonstrate and solve problems on SLR, CLR, LALR, operator precedence parser, LR (O), LR(1), LR(K) grammar and use YACC tool.

4. Describe and use Semantic Analysis concepts to design compiler : and describe Intermediate code generation such as 3-address code form, DAG , polish notation.

5. Explain Symbol tables , structure languages, hashing, tree structures representation, static, runtime stack and heap allocations, storage allocation for arrays and in strings and records.

6. Explain data flow analysis , Code generation and apply generic code generation algorithm. UNIT I Overview of compiler – Environment, pass, phase, phases of compiler, regular expression, Lexical Analyzer, LEX tool, Bootstrapping. UNIT II Top Down Parsing: Context free grammar, Top down parsing technique, LMD, RMD, Recursive decent parsing with back tracking, Ambiguous grammar, Elimination of left recursion, Left factoring, unambiguous grammar, Predictive parsing, LL(1). UNIT III Bottom up parsing: shift reduce parser SLR, CLR, LALR, operator precedence parser, LR (O), LR(1), LR(K) grammar, YACC tool. UNIT IV Semantic Analysis: Syntax directed translation, S- Attributed, L Attributed definition, Type checker, equivalence of type expressions, type conversions, overloading of functions & operators. Intermediate code generation: 3-address code form, DAG , polish notation.


x x x x


57

UNIT V Runtime environment: Symbol table format, organization of block structure languages, hashing, tree structures representation of scope information Block structures and non-block structures storage allocation, static, runtime stack and heap storage allocations, storage allocation for arrays, strings and records. Code optimization: Optimization, scope of optimization, common sub expression elimination, frequency reduction, strength reduction, loop optimization, peep-hole optimization, copy propagation. UNIT VI Data flow Analysis: Data flow graphs, data flow graph Analysis, live variable analysis. Code generation: Machine dependent code generation, object code forms, register allocation, generic code generation algorithm, DAG for register allocation. Case studies: JIT compiler. Text Book: 1. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethi, Pearson Education. Reference Books: 1. Modern Compiler Construction in C , Andrew W.Appel Cambridge University Press. 2. Compiler Construction, LOUDEN, Thomson.


58



Computer Science and Engineering INFORMATION SECURITY

Code: 4FC11 L T P/D C 3 1 - 3

Course Objectives : Understand information Security and encryption and cryptograghic principles. Learn digital signatures and IP security issues. Understand web security and E-mail security aspects. Understand firewalls and intrusion detection systems. Course Outcomes:

1. Describe Security Attacks , Security Services , model for Internetwork security and Internet Standards and RFCs.

2. Explain Conventional Encryption Principles and algorithms and describe approaches of Message Authentication methods such as SHA1 and HMAC

3. Describe Public key cryptography principles and algorithms and signatures, digital Certificates, Certificate Authority and key management such as Kerberos, X.509 along with Email privacy methods like Pretty Good Privacy (PGP) and S/MIME.

4. Describe IP Security and IP Security Architecture with Key Management.

5. Describe Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure Electronic Transaction (SET). Explain Viruses and related threats to the systems.

6. Describe firewall types and configurations, Intrusion detection methods in the security projects. UNIT I Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services (Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability) and Mechanisms, A model for Internetwork security, Internet Standards and RFCs. UNIT II Conventional Encryption Principles, Conventional encryption algorithms: DES, TDES, AES, cipher block modes of operation, location of encryption devices, key distribution, Approaches of Message Authentication, Secure Hash Functions: SHA1 and HMAC. UNIT III Public key cryptography principles, public key cryptography algorithms: RSA, DIFFIE HELL MAN, digital signatures, digital Certificates, Certificate Authority and key management Kerberos, X.509 Directory Authentication Service. Email privacy: Pretty Good Privacy (PGP) and S/MIME. UNIT IV IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security Payload, Combining Security Associations and Key Management.


59

UNIT V Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure Electronic Transaction (SET). Intruders, Viruses and related threats UNIT VI Firewall Design principles, Trusted Systems, Intrusion Detection Systems. TEXT BOOKS: 1. Network Security Essentials (Applications and Standards) by William Stallings Pearson Education. 2. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain Forest Puppy, Joe Grand, David Ahmad, Hal Flynn Ido Dubrawsky, Steve W. Manzuik and Ryan Permeh, wiley Dreamtech REFERENCES: 1. Fundamentals of Network Security by Eric Maiwald (Dreamtech press) 2. Network Security - Private Communication in a Public World by Charlie Kaufman, Radia Perlman and Mike Speciner, Pearson/PHI. 3. Cryptography and network Security, Third edition, Stallings, PHI/Pearson 4. Principles of Information Security, Whitman, Thomson. 5. Network Security: The complete reference, Robert Bragg, Mark Rhodes, TMH 6. Introduction to Cryptography, Buchmann, Springer.


60


Syllabus for B.Tech. 3rd year II semester

Computer Science & Engineering LINUX PROGRAMMING

Code:4EC19 L T P/D C

3 1 - 3 Course Objectives:

Learn linux commands. Understand file structure and file locking / unlocking primitives. Understand concepts of process management and client server communication. Learn IPC concepts

Course Outcomes At the end of this course, the student will be able to 1. Know the fundamentals of scripting and command on linux commands. 2. Describe File structure of Unix and related system calls to interact with files and directories. 3. Demonstrate operating system fundamentals of sharing, locking and deadlock. 4. Handle the process and signals related to operating system. 5. Interact, communicate with multiple processes. They will be in position to write client server programs for communication. 6.Describe the core concepts of operating system semaphore mutexes and shared memory.

Unit 1: (Chapter 1 and 2)

An Introduction to UNIX, Linux, and GNU, What Is UNIX?, What Is Linux?, The GNU Project and the Free Software Foundation, Linux Distributions, Programming Linux, Linux Programs, Text Editors, The C Compiler

Shell Programming: Why Program with a Shell?, A Bit of Philosophy, What Is a Shell? Pipes and Redirection: Redirecting Output, Redirecting Input, Pipes.

The Shell as a Programming Language: Interactive Programs, Creating a Script, Making a Script Executable, Shell Syntax: Variables, Conditions, Control Structures, Functions, Commands, Command Execution, Here Documents, Debugging Scripts

Unit 2: (Chapter 3)

Working with Files: Linux File Structure, Directories, Files and Devices, System Calls and Device Drivers, Library Functions


61

Low-Level File Access: write, read, open, Initial Permissions, Other System Calls for Managing Files, The Standard I/O Library: fopen, fread, fwrite, fclose, fflush, fseek, fgetc, getc, and getchar, fputc, putc, and putchar, fgets and gets,

Formatted Input and Output: printf, fprintf, and sprintf, scanf, fscanf, and sscanf, Other Stream Functions, Stream Errors, Streams and File Descriptors, File and Directory Maintenance, chmod, chown, unlink, link, and symlink, mkdir and rmdir, chdir and getcwd.

Scanning Directories: opendir, readdir, telldir, seekdir, closedir, Errors, strerror, perror

The /proc File System, fcntl.

Unit 3:

Environment Variables (Chapter 4 given topics only): getenv and putenv, The environ Variable, Data Management (Chapter 7): Managing Memory, Simple Memory Allocation, Allocating Lots of Memory, Abusing Memory, The Null Pointer, Freeing Memory, Other Memory Allocation Functions, File Locking, Creating Lock Files, Locking Regions, Use of read and write with Locking, Competing Locks, Other Lock Commands, Deadlocks, Databases, The dbm Database, The dbm Routines, dbm Access Functions, Additional dbm Functions

Development Tools (Chapter 9 given topics only): The make Command and Makefiles

Unit 4:

Processes and Signals( Chapter 11):

What Is a Process?, Process Structure, The Process Table, Viewing Processes, System Processes, Process Scheduling, Starting New Processes, Waiting for a Process, Zombie Processes, Input and Output Redirection, Threads

Signals: Sending Signals, Signal Sets,

POSIX Threads (Chapter 12): What Is a Thread?, Advantages and Drawbacks of Threads, A First Threads Program, Simultaneous Execution, Synchronization, Synchronization with Semaphores, Synchronization with Mutexes, Thread Attributes, Canceling a Thread, Threads in Abundance.

Unit 5:

Inter-Process Communication (Chapter 13): Pipes: What Is a Pipe?, Process Pipes, Sending Output to popen, Passing More Data, How popen Is Implemented, The Pipe Call, Parent and Child, Processes, Reading Closed Pipes, Pipes Used as Standard Input and Output. Named Pipes: FIFOs, Accessing a FIFO, Advanced Topic: Client/Server Using FIFOs

Case Study: Client Interface Functions, The Server Interface, server.c, The Pipe


62

Unit 6:

Semaphores, Shared Memory, and Message Queues (Chapter 14): Semaphores: Semaphore Definition, A Theoretical Example, Linux Semaphore Facilities, Using Semaphores, Shared Memory: shmget, shmat, shmdt, shmctl

Message Queues: msgget, msgsnd, msgrcv, msgctl

IPC Status Commands: Displaying Semaphore Status, Displaying Shared Memory Status, Displaying Message Queue Status

TEXT BOOK:

1. Beginning Linux Programming, 4th Edition, N.Matthew, R.Stones,Wrox, Wiley India Edition.


63

Syllabus for B. Tech. III Year II semester COMPUTER FORENSICS

(Professional Elective- I) Code: 4FC18 L T P/D C 4 1 - 4

Course Objectives:

Understand concepts of computer fundamentals along with the evidences recovery. Understand preservation of evidences and usage of forensic tools. Understand methods to protect E-mails.

Course Outcomes CO1: Describe computer Forensics Fundamentals, Law Enforcement, Services and issues taken up by Computer forensics specialists. CO2: Describe methods to capture evidences, data recovery , Back-up and Data Seizure. CO3. Describe duplication and preservation of Digital Evidence and Image Verification and authentication. CO 4 Apply Forensic analysis and validation on collected data and apply Network Forensic using network tools. CO 5. Process Crime and Incident Scenes with latest computer Forensic and hardware tools. CO 6. Perform E-Mail Investigations , cell phone investigation in case of suspicion and explain working with Windows and DOS Systems.

UNIT – I: Computer Forensics Fundamentals: what is Computer Forensics? ,use of Computer Forensics in Law Enforcement, Computer Forensics Assistance to human resource/Employment Proceedings, Computer Forensics Services, Benefits of Professional Forensics Methodology, Steps taken by Computer forensics specialists. Types of Computer Forensics Technology: Types of Military Computer Forensic Technology, Types of Law enforcement – Computer Forensic Technology-Types of Business Computer Forensic Technology. UNIT – II: Computer Forensics Evidence and Capture: Data Recovery Defined-Data Back-up and Recovery – The Role of Back-up in Data Recovery-The Data Recovery Solution. Evidence Collection and Data Seizure: Why Collect Evidence? Collection options- Obstacles- Types of Evidence- the Rules of Evidence-Volatile Evidence-General Procedure- Collection and Archiving- Methods of Collection-Artifacts-Collection Steps- Controlling Contamination: The Chain of Custody.



64

UNIT - III: Duplication and preservation of Digital Evidence: Preserving the digital Crime Scene – Computer Evidence Processing Steps – Legal Aspects of Collecting and Preserving Computer Forensic Evidence Computer Image Verification and authentication: Special Need of Evidential Authentication – Practical Consideration - Practical Implementation. UNIT – IV: Computer Forensic analysis and validation: Determining what data to collect and analyze, validating forensic data. Addressing data –hiding techniques, performing remote acquisitions Network Forensic : Network forensics overview, performing live acquisitions, developing standard procedures for network forensics, un sing network tools, examining the honeynet project. UNIT – V: Processing Crime and Incident Scenes: Identifying digital evidence, collecting evidence in private-sector incident scenes, processing law enforcement crime scene, preparing for a search, securing a computer incident or crime scene, seizing digital evidence, storing at the scene, storing digital evidence, obtain a digital hash, reviewing a case Current Computer Forensic tools: evaluating computer forensic tool needs, computer forensics software tools, computer forensics hardware tools, validating and testing forensic software. UNIT – VI: E-Mail Investigations: Exploring the role of E-mail in investigation, exploring the role of the client and server in e-mail, investigating e-mail crimes and violations, understanding e-mail server, using specialized e-mail forensic tools Cell phone and mobile device forensics: understanding mobile device forensics, understanding acquisition procedures for cell phone and mobile devices Working with Windows and DOS Systems: understanding file systems, exploring Microsoft File Structures, Examining NTFS disks, understating whole disk encryption, windows registry, Microsoft startup tasks, MS-DOS startup tasks, virtual machines. TEXT BOOKS: 1. Computer Forensics and Investigations by Phillips, Nelson, Steuart, CENGAGE Learning. 2. Computer Forensics ,computer crime Investigations by John –R Vacca Fire wall Media , New Delhi


65

Reference books: 1. Real Digital Forensics by keith j.jones,Richard bejtlich, Curtis W. Rose, Addison –

Wesley Pearson Education. 2. Forensic Compiling , A Tractitioneris Guide by tony sammes and brian

jenkinson,springer international edition. 3. Computer Evidence Collection & Presentation by Christopher L .T.Brown ,Firewall

Media. 4. Homeland Security, Techniques & Technologies by Jesus Mena, Firewall Media. 5. Software Forensics Collecting Evidence from the scene of a Digital Crime by Robert

M. Slade, TMH2005. 6. Windows Forensics by Chad Steel, Wiley India Edition.


66



Computer Science and Engineering ARTIFICIAL INTELLIGENCE

(PROFESSIONAL ELECTIVE – I) Code: 4EC11 L T P/D C

4 1 - 4 Course Objectives : Understand AI problems and pattern recognition patterns. Learn issues of linear discriminant functions to resolve Linear Separable cases and neural learning concepts tools to solve real time AI problems Course Outcomes 1. Apply searching strategies to solve well posed AI problems. 2. Solve problems on First order logic, Inference in first order logic and unification with forward

/backward chaining. 3. Describe pattern recognition concepts for solving modern day Artificial Intelligence problems. 4. Apply probability to solve classification problems. 5. Apply linear discriminant functions to resolve Linear Separable cases. 6. Apply neural learning concepts tools to solve real time AI problems .

UNIT I Introduction: AI problems, foundation of AI and history of AI intelligent agents: Agents and Environments. Searching: Searching for solutions, uniformed search strategies – Breadth first search, depth first Search. Search with partial information (Heuristic search) Greedy best first search. UNIT II Knowledge Representation & Reasons logical Agents, Knowledge – Based Agents, the Wumpus world, logic, propositional logic, Resolution patterns in propositional logic, Resolution, Forward & Backward, Chaining. First order logic. Inference in first order logic, propositional Vs. first order inference, unification & lifts forward chaining, Backward chaining, Resolution. UNIT III Pattern recognition in AI introductory concepts of Machine Perception involving pre-processing, feature extraction and classification, using linear separability, and generalization. Example in sorting of fish (see chapter 1 of text book, Duda,Hart and Stork). Connection of pattern recognition with related fields- image processing and associative memory. Sub-problems in Classification noise, overfitting, segmentation and complexity. UNIT IV Bayesian decision theory:Introduction, Bayesian Decision Theory- Continuous features. Two Category classification. Minimax Criteria. Classifiers, Discriminants and Decision surfaces – Two layer and Multilayer. Normal Density and discriminant functions for two layer. Bayes Decision theory applied to Discrete features.


67

UNIT V Linear Discriminant Functions: Two category and multi-category cases.Concept of Linearly Separable Cases. Generalized linear Discriminant functions. Two category Linear Separable case. Gradient descent simple concept. UNIT VI Multilayer Neural networks: Introduction. Concept of a simple processing element. A single layer Neural Network. A multi-layer neural network. And classifications performable by such networks. The Backpropagation Learning Algorithm. TEXT BOOKS 1. Artificial Intelligence – A Modern Approach. Second Edition, Stuart Russel, Peter Norvig, PHI/

Pearson Education. 2. Pattern Classification by Richard Duda, Peter Hart and David Stork, 2nd Edition.

REFERENCES 1. Artificial Intelligence , 2nd Edition, E.Rich and K.Knight (TMH). 2. Information Theory, Inference and Learning Algorithms, David J. Mackay Cambridge

Univ. Press, 2003. 3. Elements of Statistical Learning by Trevor Hastie, Robert Tibsirani and Jerome

Friedman, Springer 2nd ed. 2008. 4. PROLOG Programming for Artificial Intelligence. Ivan Bratka- Third Edition –

Pearson Education.


68


Syllabus for B.Tech III Year II semester Computer Science and Engineering

SOFTWARE PROJECT MANAGEMENT (PROFESSIONAL ELECTIVE – I)

Code: 4EC12 L T P/D C 4 1 - 4 Course Objectives :

Understand project planning and economics. Learn software archtecutes and and workflows. Understand project organization, Automation and Project Control

Course Outcomes:

1. Explain primitives of Project Planning and evolution of software economics.

2. Describe software economics; reduce Software product size, improvement in software processes, improving team effectiveness, improving automation, Achieving quality.

3. Explain Life cycle phases and Artifacts of the process.

4. Describe Model based software architectures and Work Flows. 5. Apply Checkpoints for a process such as Major mile stones, Minor Milestones and apply Work

breakdown structures for a iterative process within cost and schedule. Describe Project Organizations and Responsibilities.

6. Describe Automation and Project Control and Process instrumentation and explain Future Software Project Management such as Modern Project Profiles and Next generation project management.

UNIT I Conventional Software Management: The waterfall model, conventional software Management performance. Evolution of Software Economics: Software Economics, pragmatic software cost estimation. UNIT II Improving Software Economics: Reducing Software product size, improving software processes, improving team effectiveness, improving automation, Achieving required quality, peer inspections. The old way and the new: The principles of conventional software Engineering, principles of modern software management, transitioning to an iterative process. UNIT III Life cycle phases: Engineering and production stages, inception, Elaboration, construction, transition phases. Artifacts of the process: The artifact sets, Management artifacts, Engineering artifacts, programmatic artifacts.


69

UNIT IV Model based software architectures: A Management perspective and technical perspective. Work Flows of the process: Software process workflows, Iteration workflows. Agile development process: Agile Development – Agile manifesto, agility and cost of change, agility principles, myth of planned development, toolset for the agile process . Extreme Programming – XP values, process, industrial XP SCRUM – process flow, scrum roles, scrum cycle description, product backlog, sprint planning meeting, sprint backlog, sprint execution, daily scrum meeting, maintaining sprint backlog and burn-down chart, sprint review and retrospective . UNIT V Checkpoints of the process: Major mile stones, Minor Milestones, Periodic status assessments. Iterative Process Planning: Work breakdown structures, planning guidelines, cost and schedule estimating, Iteration planning process, Pragmatic planning. Project Organizations and Responsibilities: Line-of-Business Organizations, Project Organizations, evolution of Organizations. UNIT VI Process Automation: Automation Building blocks, The Project Environment. Project Control and Process instrumentation: The seven core Metrics, Management indicators, quality indicators, life cycle expectations, Future Software Project Management: Modern Project Profiles, Next generation Software economics, modern process transitions. TEXT BOOKS a) Software Project Management, Walker Royce: Pearson Education, 2005. REFERENCES 1. Software Project Management, Bob Hughes and Mike Cotterell: Tata McGraw-Hill

Edition. 2. Software Project Management, Joel Henry, Pearson Education. 3. Software Project Management in practice, Pankaj Jalote, Pearson Education.2005. 4. Schwaber, K. and Beedle, M. (2001). Agile Software Development with SCRUM, 1st

Ed. New Jersey : Pearson. [ ISBN - 9780130676344] 5. Cohn, M. (2010). Succeeding with Agile: Software Development Using Scrum. Pearson

Education, ISBN – 9788131


70



Computer Science and Engineering MOBILE COMPUTING (Professional Elective I)

Code: 4EC16 L T P/D C

4 1 - 4 Course Objectives

Learn concepts of mobile communication and various media access control methods. Understand IP mobile primitives and concepts of network and transport layer with regard to

mobile communication. Learn WAP protocols.

Course Outcomes: 1. Identify vast application areas for mobile / wireless communication / computing. They

also understand the working principle of GSM technology. 2. Discuss various media access control methods that are meant for wireless communication

along with SDMA, FDMA, TDMA and CDMA. 3. Identify IP mobile primitives in Network layer in the wireless communication and

recognize suitable solutions for the same. 4. Explain the issues in the Transport layer in wireless communication and identifying

suitable solutions for the same 5. Discuss MANETs with examples and explain hoarding, client sever computing along

with the data delivery mechanisms. 6. Apply protocols and tools such as WAP, Blue Tooth and explain emerging mobile

operating systems. UNIT - I Introduction to Mobile Communications and Computing: Mobile Computing (MC): Introduction to MC, novel applications, limitations, introduction to mobile architecture - UMTS, GSM. Architecture GSM: Mobile services, System architecture, Radio interface, Protocols, Localization and calling, Handover, Security, and New data services. UNIT - II (Wireless) Medium Access Control: Motivation for a specialized MAC (Hidden and exposed terminals, Near and far terminals), SDMA, FDMA, TDMA, CDMA. UNIT - III Mobile Network Layer: Mobile IP (Goals, assumptions, entities and terminology, IP packet delivery, agent advertisement and discovery, registration, tunneling and encapsulation, optimizations), Dynamic Host Configuration Protocol (DHCP).


71

UNIT - IV Mobile Transport Layer: Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery, Transmission /time-out freezing, Selective retransmission, Transaction oriented TCP. UNIT - V Mobile Ad hoc Networks (MANETs): Overview, Properties of a MANET, spectrum of MANET applications, routing algorithms. Database: Hoarding techniques, caching invalidation mechanisms, client server computing with adaptation, data delivery mechanisms UNIT - VI Protocols and Tools: Wireless Application Protocol-WAP. (Introduction, protocol architecture, and treatment of protocols of all layers), Bluetooth (User scenarios, physical layer, MAC layer, networking, security, link management), introduction to mobile operating systems- Android, Java OS (J2ME). TEXT BOOKS 1. Jochen Schiller, “Mobile Communications”, Addison-Wesley. (Chapters 1, 2, 3, 4, 7, 8

and 9). Second edition, 2004. 2. Stojmenovic and Cacute, “Handbook of Wireless Networks and Mobile Computing”,

Wiley, 2002, ISBN 0471419028. (Chapters 6, 11, 15, 17, 18, 19, 26 and 27) REFERENCES 1. Reza Behravanfar, “Mobile Computing Principles: Designing and Developing Mobile

Applications with UML and XML”, ISBN: 0521817331, Cambridge University Press, October 2004,

2. Adelstein, Frank, Gupta, Sandeep KS, Richard III, Golden , Schwiebert, Loren, “Fundamentals of Mobile and Pervasive Computing”, ISBN: 0071412379, McGraw-Hill Professional, 2005.

3. Hansmann, Merk, Nicklous, Stober, “Principles of Mobile Computing”, Springer, second edition, 2003.

4. Martyn Mallick, “Mobile and Wireless Design Essentials”, Wiley DreamTech, 2003 5. A. Tanenbaum “Computer Networks”, 4th edition.


72



LOGICAL REASONING (Common to All Branches)

L T P/D C Code: 4HC77 - - 3 2 Course Objectives Understand and solve arithmetic , analogy , coding , puzzles and ranking related problems for enhancing employability. Course Outcomes: CO1. Generate number and alphabet series CO2. Apply concept of analogy and solve related problems CO3. Classify and figure out odd one CO4. Realize the various techniques for coding and decoding CO5. Solve the relations puzzles. CO6. Solve the problem related to number, ranking and arithmetic reasoning Unit – I: Series Completion: Number Series, Alphabet Series, Alpha – Numeric Series. Analogy: Completing the Analogous Pair, Simple Analogy, Choosing the Analogous pair, Double Analogy, Word Analogy, and Number Analogy. Unit – II Classification / Odd One Out: Word Classification, Number Classification, Letter Classification. Coding – Decoding: Letter Coding, Number Coding, Matrix Coding, Substitution, Deciphering Message Word Codes, Jumbled Coding. Unit – III Blood Relations, Deciphering Jumbled up Descriptions, Relation Puzzle – Direction sense test. Number, Ranking & Time Sequence Test – Arithmetical Reasoning – Mathematical Operations. Unit – IV: Directions, Arithmetical Reasoning. Puzzle Test: Classification Type Questions, Seating Arrangements Comparison Type Questions, Sequential Order of Things, Selection Based on given conditions, Family – Based Puzzles, Jumbled Problems. Unit – V: Assertions and Reason– Logical Venn Diagrams – Alpha Numeric Sequence Puzzle. Cubes and Dice – Analytical Reasoning .Logical Deduction: Logic, Statement – Arguments Unit – VI: Clocks & Calendar .Data Sufficiency and Syllogism. Text Book: Verbal and Non Verbal Reasoning by R. S. Agarwal.


73



COMPREHENSIVE VIVA II Code: 4E677 L T P/D C

- - - 1 Pre-Requisites: None Course Objectives : Prepare students in basics of core courses to revise and face technical interviews for enhancing employability. Course Outcomes:

1. Assessment is done in the courses they have undergone till the completion of that academic year.

2. They are asked to comprehend the concepts in the core subjects and the elective subjects, to make them ready to face technical interviews which improve their employability skills.

There shall be a Comprehensive Viva-Voce in III year II Semester. The Comprehensive

Viva-Voce will be conducted by a Committee consisting of an external examiner, Head of the

Department and two Senior Faculty members of the Department.

The Comprehensive Viva-Voce is aimed to assess the students’ understanding in various

subjects he/she studied during the B.Tech course of study up to III Year. The Comprehensive

Viva-Voce is valued for 50 marks by the Committee.

There are no internal marks for the Comprehensive Viva-Voce.


74



Compiler Design & Object Oriented Analysis and Design Lab Code: 4E688 L T P/D C

- - 4 2

Course Objectives : The student to understand a case study and model it in different views i.e. Use case view, logical view, component view, Deployment and generate the documentation.

Course Outcomes:

1. Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools.

2. Design top down parser for the given language

3. Design bottom up parser for the above language.

4. To relate Unified Modeling Language paradigm for problem solving.

5. Design Unified Modeling Language (UML) diagrams that represent number of modeling views.

6. Devise various UML models (including use case diagrams, class diagrams, interaction

Compiler Design Lab Consider the following mini Language, a simple procedural high-level language, only operating on integer data, with a syntax looking vaguely like a simple C crossed with Pascal. The syntax of the language is defined by the following BNF grammar: <program> ::= <block> <block> ::= { <variabledefinition><slist> } | { <slist> } <variabledefinition> ::= int <vardeflist> ; <vardeflist> ::= <vardec> | <vardec> , <vardeflist> <vardec> ::= <identifier> | <identifier> [ <constant> ] <slist> ::= <statement> | <statement> ; <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>


75

<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 / *...*/) can be inserted. The language has rudimentary support for 1-dimensional arrays. The declaration int a[3] declares an array of three elements, referenced as a[0], a[1] and a[2]. Note also that you should worry about the scoping of names. A simple program written in this language is: { int a[3],t1,t2; t1=2; a[0]=1; a[1]=2; a[t1]=3; t2=-(a[2]+t1*6)/(a[2]-t1); if t2>5 then print(t2); else { int t3; t3=99; t2=-25; print(-t1+t2*t3); /* this is a comment on 2 lines */ } endif } 1. Design a Lexical analyzer for the above language. The lexical analyzer should ignore redundant spaces, tabs and newlines. It should also ignore comments. Although the syntax specification states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value. 2. Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools. 3. Design Recursive Descent Parser parser for the given language 4. Design Shift Reduce parser bottom up parser for the above language. 5. Write program to generate machine code from the abstract syntax tree generated by the parser. The following instruction set may be considered as target code. The following is a simple register-based machine, supporting a total of 17 instructions. It has three distinct internal storage areas. The first is the set of 8 registers, used by the individual 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. The instructions can be preceded by a label. This consists of an


76

integer in the range 1 to 9999 and the label is followed by a colon to separate it from the rest of the instruction. The numerical label can be used as the argument to a jump instruction, as detailed below. In the description of the individual instructions below, instruction argument types are specified as follows : R specifies a register in the form R0, R1, R2, R3, R4, R5, R6 or R7 (or r0, r1, etc.). L specifies a numerical label (in the range 1 to 9999). V specifies a “variable location” (a variable number, or a variable location pointed to by a register - see below). A specifies a constant value, a variable location, a register or a variable location pointed to by a register (an indirect address). Constant values are specified as an integer value, optionally preceded by a minus sign, preceded by a # symbol. An indirect address is specified by an @ followed by a register. So, for example, an A-type argument could have the form 4 (variable number 4), #4 (the constant value 4), r4 (register 4) or @r4 (the contents of register 4 identifies the variable location to be accessed). The instruction set is defined as follows: LOAD A,R loads the integer value specified by A into register R. STORE R,V stores the value in register R to variable V. OUT R outputs the value in register R. NEG R negates the value in register R. ADD A,R adds the value specified by A to register R, leaving the result in register R. SUB A,R subtracts the value specified by A from register R, leaving the result in register R. MUL A,R multiplies the value specified by A by register R, leaving the result in register R. DIV A,R divides register R by the value specified by A, leaving the result in register R. JMP L causes an unconditional jump to the instruction with the label L. JEQ R,L jumps to the instruction with the label L if the value in register R is zero. JNE R,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. JGT R,L jumps to the instruction with the label L if the value in register R is greater than zero. JLE R,L


77

jumps to the instruction with the label L if the value in register R is less than or equal to zero. JLT R,L jumps to the instruction with the label L if the value in register R is less than zero. NOP is an instruction with no effect. It can be tagged by a label. STOP stops execution of the machine. All programs should terminate by executing a STOP instruction. Object Oriented Analysis & Design Lab

a. The student should take up the case study of Unified Library application which is mentioned

in the theory, and Model it in different views i.e. Use case view, logical view, component view, Deployment view, Database design, forward and Reverse Engineering, and Generation of documentation of the project.

b. Student has to take up another case study of his/her own interest and do the same whatever mentioned in first problem. Some of the ideas regarding case studies are given in reference books which were mentioned in theory syllabus can be referred for some idea.

Case studies:

1. ATM System 2. Online Ticket Reservation 3. E- Book Shop


78



Linux Programming Lab Code: 4E689 L T P/D C

- - 4 2

Course objectives : Undersand and write programs using librarries, files, process , IPC and implement client server scenario. Course outcomes At the end of this course, the student will be able to 1. Create their own static libraries. 2 Write their own scripts for searching the contents in files and directories. 3. Write a program to copy contents from one file to another. 4. Demonstrate how to lock files so that deadlock don’t occur. 5. Solve operating system problems like semaphores, mutex, shared memory etc. 6. Describe the core of operating system, how a process communicates with another process. 7. Describe synchronization between processes and threads which form the core of operating system.

Week -1

1. Write a script to show the effect of quotes on the output of a variable

2. Create your own small static library containing two functions and then use one of them in an example program.

3. Write a script to search for a word posix in current directory 4. Write a script to check if file exists or not, and print whether the file is a directory or not. Week -2 5. Write a input-testing script and, using the case construct, make it a little more selective for forgiving of unexpected input. 6. Write a program that shows how parameters to a function are passed and how functions can return a true or false result. 7. Write a script to ask some questions using dialog command. 8. Commands on grep and find

8.1 Write a command to Search in the current directory for files modified more recently than the file while2 and print only regular files

8.2 Start by looking for lines that end with the letter e.


79

8.3 find words that end with the letter a 8.4 look for three-letter words that start with Th. 8.5 search for lowercase words that are exactly 10 characters long.

8.6 Use dialog command and print Hello world Week -3&4 9. Write a program to copy contents from one file to another 10. Write a program to copy contents from one file to another using system calls. 11. Write a program to print files and directories of a current dierctory and sub-directory. 12. Write a program to display the environment variables 13. Write a program to lock a file using system call. 14. Write a program for co-operative file locking . Week – 5&6 15. Write a program using system call to print all system processes. 16. Write a simple program to create a child process from parent process 17. Write a program to check when zombie process gets created. Week -7&8 18. Write a simple program for simulation of threads 19. Write a program for thread sysnchronization using semaphores Week -9&10 20. Write a simple program to read and write the contents using popen and pclose. 21. write a simple program to read and write nbytes from a pipe using pipe system call. 22. Write a simple program for reader writer problem using pipes. Week -11 23. Write a simple program to create FIFO. 24. Write a producer consumer problem program using Named pipes Week -12&13 25. Write a program for sender and reciever problem using message queues. 26. Write a program for producer and consumer problem using shared memory . Week -14 27. Write a program to demonstrate synchronization using semaphores.


80



Computer Science and Engineering TECHNICAL PAPER WRITING AND SEMINAR- VI

Code: 4E695 L T P/D C - - 2 1 Pre-Requisites: All Courses till this semester

Course Obejectives : Learn to identify, arrange, and present a technical topic to improve communication and soft skills to enhance global employability.

Course Outcomes: 1. Students identify a topic from the current technical topics of their choice in the computer

science domain and the allied fields, after surveying in the internet resources, journals and technical magazines in the library.

2. Student learnt to arrange the contents of the presentation and scope of the topic, in an effective manner.

3. Each student then presents the technical topic they chose in front of the panel and the fellow students, using the oratory skills.

4. Students also face the questions posed by the panel and the students and answer them. There shall be a Technical Paper writing and seminar evaluated for 25 marks in Fourth Year First Semester. The evaluation is purely internal and will be conducted as follows:

Paper writing : 05 marks

Final report : 05 marks Presentation before a departmental committee



81


Syllabus for B.Tech IV year I Semester Computer Science and Engineering

DATAWAREHOUSING AND DATA MINING

Code: 4FC05 L T P/D C 4 - - 4

Course Objective: Understand data mining principles and techniques, building basic terminology, learn how to gather and analyze large sets of data to gain useful business understanding, understand quantitative analysis report/memo with the necessary information to make decisions, basic data mining algorithms, methods, and tools. Understand the architecture and basic concepts involved in building a Data Warehouse. Course Outcomes:

1. Explain concepts of data mining its features and Functionalities Explain Data Preprocessing involving Data Cleaning, Data Integration and Transformation ,Concept Hierarchy Generation. Data Mining Primitives, Data Mining Query Languages and Architectures

2. Explain the fundamentals of Data Warehousing and issues of Mining with respect to architectures, technologies such as OLAP , Data Cube computation .

3. DiscussData Generalization and Summarization, Analysis of Attribute Relevance and Mining Class Comparisons.

4. Apply the algorithms for mining Association rules in large databases. 5. Discuss and apply the models of classification and use those models for prediction of

the new samples. 6. Apply various clustering techniques available for numerous applications. identify the

optimal clustering technique for a particular application UNIT I Introduction: Fundamentals of data mining, Data Mining Functionalities, Classification of Data Mining systems, Major issues in Data Mining Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and Concept Hierarchy Generation. Data Mining Primitives, Data Mining Query Languages, Architectures of Data Mining Systems. Applications: Medical / Pharmacy, Insurance and Health Care. UNIT II Data Warehouse and OLAP Technology for Data Mining Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse Implementation UNIT III Concepts Description: Characterization and Comparison: Data Generalization and Summarization-Based Characterization, Analytical Characterization: Analysis of Attribute Relevance, Mining Class Comparisons: Discriminating between Different Classes, Mining Descriptive Statistical Measures in Large Databases.


82

Applications: Telecommunication Industry, Social Network Analysis, Intrusion Detection UNIT IV Mining Association Rules in Large Databases : Association Rule Mining, Mining Single-Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel Association Rules from Transaction Databases, Mining Multidimensional Association Rules from Relational Databases and Data Warehouses, From Association Mining to Correlation Analysis, Constraint-Based Association Mining. Applications: Financial/banking Data Analysis. Retail Marketing Industry UNIT V Classification and Prediction: Issues Regarding Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification, Classification by Back propagation, Classification Based on Concepts from Association Rule Mining, Other Classification Methods, Prediction, Classifier Accuracy. Applications: DNA Data Analysis, Biomedical Data Analysis UNIT VI Cluster Analysis Introduction: Introduction to machine learning, Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods, Partitioning Methods, Density-Based Methods, Grid-Based Methods, Model-Based Clustering Methods, Outlier Analysis. Applications: Climate and Ecosystem Data (Spatial and temporal), Graph based mining (graphs for chemical model structures). TEXT BOOK: 1. Data Mining – Concepts and Techniques - JIAWEI HAN & MICHELINE KAMBER

Harcourt India. 2. Introduction to Data Mining - First Edition, by Pang-Ning Tan, Michael Steinbach

and Vipin Kumar, ISBN-13: 978-0321321367 REFERENCES: 1. Data Mining Introductory and advanced topics –MARGARET H DUNHAM,

PEARSON EDUCATION 2. Data Mining Techniques – ARUN K PUJARI, University Press. 3. Data Warehousing in the Real World – SAM ANAHORY & DENNIS MURRAY.

Pearson Edn Asia. 4. Data Warehousing Fundamentals – PAULRAJ PONNAIAH WILEY STUDENT

EDITION. 5. The Data Warehouse Life cycle Tool kit – RALPH KIMBALL WILEY STUDENT

EDITION


83


Syllabus for B.Tech IV Year I Semister

Computer Science and Engineering E – COMMERCE

(PROFESSIONAL ELECTIVE – II)

Code:4F713 L T P/D C 4 1 - 4 Course Objective :

The objective of the course is to know the concept of electronic commerce, and to understand how electronic commerce is affecting business enterprises, governments, consumers and people in general. In addition to this, understand and study the development of websites using relevant software models.

Course Outcomes:

1. Explain ELECTRONIC commerce, application and commerce on WWW. 2. Discuss infrastructure and web based tools for e- commerce using Client-side

programming , Server-side programming and relational Database connectivity. 3. Use and describe Internet payment systems along with Micropayment system - E-

check, E-retailing ,PASS model and Internet security protocols. 4. Distinguish between organizational commerce data interchange models such as Inter

and Intra Organizational Commerce. 5. Apply and use Web advertising and web publishing along with business models and

pricing methods. Develop a website. 6. Describe Corporate Digital Library, Consumer Search, Resource Discovery and use

of Multimedia in electronic Commerce. UNIT I: INTRODUCTION: ELECTRONIC commerce and physical commerce – Internet and WWW- Electronic Commerce-Frame work, deferent types of E-Commerce applications, E-Commerce Consumer scenarios, Advantages of Electronic Commerce and myths about electronic commerce. UNIT II: INFRASTRUCTURE AND WEB BASED TOOLS FOR E COMMERCE: Client-side programming– important factors -web page design and production-overview of HTML-structure of HTML document -CSS- JavaScript. Server-side programming – three-tier model- common gateway interface (CGI), overview of Java servlet -architecture-overview of the servlet API. Database connectivity- relational database -basic SQL statements- JDBC-drivers-API.


84

UNIT III: SECURITY Internet payment systems – 4C payment methods -SET protocol for credit payments-Digital Token-Based, Smart Cards, Credit Cards, Risks in Electronic Payment systems. Micropayment system - E-check - E- retailing – PASS model. Internet security – IPSec protocol- AH services- ESP-firewalls types- SSL. 1. 2. UNIT IV: ORGANIZATIONAL COMMERCE DATA INTERCHANGE

MODELS: Inter Organizational Commerce - EDI, EDI Implementation, Value added networks. Intra Organizational Commerce - work Flow, Automation Customization and internal Commerce, Supply chain Management UNIT V : Web advertising and web publishing – traditional vs Internet advertising- Internet advertising techniques and strategies-business models, pricing models and measurement for advertising – web site development methodologies UNIT VI: INTELLIGENT AGENTS: Corporate Digital Library - Document Library, digital Document types, corporate Data Warehouses. Advertising and Marketing - Information based marketing, on-line marketing process, market research. Consumer Search and Resource Discovery - Information search and Retrieval, Commerce Catalogs, Information Filtering. Multimedia - key multimedia concepts, Digital Video and electronic Commerce, Desktop video processing, Desktop video conferencing. TEXT BOOK:

(a) E-Commerce fundamentals and applications Hendry Chan, Raymond Lee, Tharam Dillon, Ellizabeth Chang, John Wiley.

(b) Frontiers of electronic commerce – Kalakata, Whinston, Pearson.

REFERENCES: 1. Web Commerce Technology Handbook – Daniel Minoli, Emma Minoli, McGraw-

Hill 2. E-Commerce, S.Jaiswal – Galgotia. 3. E-Commerce, Efrain Turbon, Jae Lee, David King, H.Michael Chang.


85


Syllabus for B.Tech IV Year I Semister

Computer Science and Engineering INTERNET OF THINGS

(PROFESSIONAL ELECTIVE – II) Code: 4DC55 L T P/D C 4 1 - 4 Course Objectives: The student will learn about

1. Terminology, technology and applications of IoT 2. IoT system management using M2M (machine to machine) with necessary protocols 3. Python Scripting Language preferred for many IoT applications 4. Raspberry PI as a hardware platform for IoT sensor interfacing 5. Implementation of web based services for IoT with case studies

Course Outcomes: After completing this course, student shall be able to

1. Identify the implementation layers of an IoT application system 2. Describe the management of an IoT system using necessary protocols 3. Design, Develop and Illustrate IoT applications using Raspberry PI platform and

Python Scripting 4. Implement web based services on IoT devices 5. Describe and differentiate types of servers. 6. Illustrate an IoT design.

Unit I: Introduction to Internet of Things Definition and Characteristics of IoT, Physical Design of IoT – IoT Protocols, IoT communication models, Iot Communication APIs IoT enabaled Technologies – Wireless Sensor Networks, Cloud Computing, Big data analytics, Communication protocols, Embedded Systems, IoT Levels and Templates Domain Specific IoTs – Home, City, Environment, Energy, Retail, Logistics, Agriculture, Industry, health and Lifestyle Unit II: IoT and M2M Software defined networks, network function virtualization, difference between SDN and NFV for IoT Basics; IoT System Management with NETCOZF, YANG- NETCONF, YANG, SNMP NETOPEER Unit III: Developing IoT IoT Design Methodology - Introduction to Python - Language features of Python, Data types, data structures, Control of flow, functions, modules, packaging, file handling, data/time operations, classes, Exception handling Python packages - JSON, XML, HTTPLib, URLLib, SMTPLib


86

Unit IV: IoT Physical Devices and Endpoints Introduction to Raspberry PI-Interfaces (serial, SPI, I2C) Programming – Python program with Raspberry PI with focus of interfacing external gadgets, controlling output, reading input from pins. Unit V: IoT Physical Servers and Cloud Offerings Introduction to Cloud Storage models and communication APIs Webserver – Web server for IoT, Cloud for IoT, Python web application framework Designing a RESTful web API Unit VI: Case Studies Illustrating IoT Design Home Automation – Smart Lighting, Home intrusion detection, Cities – Smart parking, Environment – Weather monitoring system, Weather reporting bot, Air pollution monitoring, Forest fire detection, Agriculture – Smart irrigation, Productivity applications – IoT printer TEXT BOOKS:

1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti, Universities Press, 2015, ISBN: 9788173719547

2. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O'Reilly (SPD), 2014, ISBN: 9789350239759


87


Syllabus for B.Tech IV Year I semester

Computer Science and Engineering INFORMATION RETRIEVAL SYSTEM

(PROFESSIONAL ELECTIVE – II)

Code: 4E714 L T P/D C 4 1 - 4 Course Objectives: To learn the basics of information retrieval systems, data structures and file structures, algorithms, storage of different data and efficient retrieval which is distributed in different systems. Course Outcomes:

1. Discuss Objectives and Overview of IRS. Explain need and capabilities of Information Retrieval System Capabilities.

2. Describe and apply Indexing. Apply IRS algorithms such as Stemming Algorithms, Inverted file structures by using data structures : N-gram data structure, PAT data structure, Signature file structure and Hypertext data structure.

3. Describe Automatic Indexing and apply Document and Term Clustering using Thesaurus generation and Item clustering.

4. Describe and apply user Search Techniques for Similarity measures ranking, Relevance feedback and Selective dissemination of information search. Explain Information Visualization technologies.

5. Apply Text Search Algorithms and describe Information System Evaluation. 6. Describe Multimedia Information Retrieval – Models and Languages and explain role

and significance of Libraries and Bibliographical Systems – Online IR Systems, OPACs, Digital Libraries.

UNIT I Introduction: Definition, Objectives, Functional Overview, Relationship to DBMS, Digital libraries and Data Warehouses, Information Retrieval System Capabilities - Search, Browse, Miscellaneous. UNIT II Cataloguing and Indexing: Objectives, Indexing Process, Automatic Indexing, Information Extraction, Data Structures: Introduction, Stemming Algorithms, Inverted file structures, N-gram data structure, PAT data structure, Signature file structure, Hypertext data structure. UNIT III Automatic Indexing: Classes of automatic indexing, Statistical indexing, Natural language, Concept indexing, Hypertext linkages Document and Term Clustering: Introduction, Thesaurus generation, Item clustering, Hierarchy of clusters.


88

UNIT IV User Search Techniques: Search statements and binding, Similarity measures and ranking, Relevance feedback, Selective dissemination of information search, Weighted searches of Boolean systems, Searching the Internet and hypertext - Information Visualization: Introduction, Cognition and perception, Information visualization technologies. UNIT V Text Search Algorithms: Introduction, Software text search algorithms, Hardware text search systems. Information System Evaluation: Introduction, Measures used in system evaluation, Measurement example – TREC results. UNIT VI Multimedia Information Retrieval – Models and Languages – Data Modeling, Query Languages, Indexing and Searching - Libraries and Bibliographical Systems – Online IR Systems, OPACs, Digital Libraries. TEXT BOOKS

1. Information Storage and Retrieval Systems: Theory and Implementation By Kowalski, Gerald, Mark T Maybury Kluwer Academic Press, 2000.

2. Modern Information Retrival By Ricardo Baeza-Yates, Pearson Education, 2007. 3. Information Retrieval: Algorithms and Heuristics By David A Grossman and Ophir

Frieder, 2nd Edition, Springer International Edition, 2004. REFERENCES 1. Information Retrieval Data Structures and Algorithms by William B Frakes, Ricardo

Baeza-Yates, Pearson Education, 1992. 2. Information Storage & Retieval by Robert Korfhage – John Wiley & Sons. 1. Introduction to Information Retrieval By Christopher D. Manning and Prabhakar

Raghavan, Cambridge University Press, 2008.


89


Syllabus for B. Tech. IV Year I semester

Computer Science and Engineering SOFTWARE ARCHITECTURE AND DESIGN PATTERN

(PROFESSIONAL ELECTIVE – II) Code: 4EC13

L T P/D C 4 1 - 4

Course Objectives:

The main objective is to introduce the student to architecture of software and design Patterns.

Upon completion of this course the student will Get an idea on envisioning architecture,

creating an architecture, analyzing architecture.

1. Understand the creational and structural patterns.

2. Be capable of applying his knowledge to create an architecture for given application.

3. Be able to explain the role of analyzing architectures.

4. Be able to identify different structural patterns.

Course Outcomes: 1. Explain Architecture Business Cycle, Architectural patterns, reference models,

reference architectures, and architecture structures. 2. Describe architecture, Quality Attributes, styles, patterns and design of Architecture

along with the Documentation of architecture. 3. Discuss Software Architecture evaluation, Architecture design decision making,

SAAM, ATAM and CBAM. And plan software architecture in future. 4. Plan and use Creational patterns and Structural patterns application development. 5. Solving problems using Induction learning, Decision Tree, Statistical learning

methods, learning with hidden variables, EM algorithm, Instance based learning and Neural Networks.

6. Explain Behavioral patterns using Command, Interpreter, Iterator, Mediator, Memento, Observer, State, Strategy, Template method and Visitor.

UNIT I Envisioning Architecture The Architecture Business Cycle, What is Software Architecture? , Architectural patterns, reference models, reference architectures, architecture structures and views. UNIT II Creating an Architecture Quality Attributes, Architectural styles and patterns, designing the Architecture, Documenting the architecture, Reconstructing Software Architecture.


90

UNIT III Analyzing Software Architecture Architecture evaluation, SAAM, ATAM, CBAM. Moving from Architecture to Systems Software Product Lines, Building systems from off the shelf components, Software architecture in future. UNIT IV Design Patterns What is pattern? Pattern Description, Organizing catalogs, Role in solving problems, Selection, usage. UNIT V Creational patterns: Abstract factory, Builder, Factory method, prototype, singleton. Structural patterns: Adapter, Bridge, Composite, Decorator, Façade, Flyweight, Proxy. UNIT VI Behavioural patterns: Chain of responsibility, Command, Interpreter, Iterator, Mediator, Memento, Observer, State, Strategy, Template method, Visitor. Case Studies The World Wide Web - a case study in interoperability, Flight Simulation- A Case Study in an Architecture for Integrability. TEXT BOOKS: 1 Software Architecture in Practice, 2nd Edition by Len Bass, Paul Clements, Rick

Kazman, published by Pearson Edition 2. Design Patterns, by Erich Gamma, Pearson Education REFERENCES: 1. Beyond Software Architecture, Luke Hohmann, Addison Wesley, 2003. 2. Software Architecture, David M Dikel, David kane and James R Wilson, Prentice

Hall PTR, 2001. 3. Pattern Oriented Software Architecture, F Buschmann&others, John Wiley&Sons. 4. Head First Design patterns, Erec Freeman & Elisabeth Freeman, O’REILLY, 2007. 5. Design pattern in java, Steven John Metsker&William C. Wake, Pearson Education,

2006. 6. Design patterns in C#, Steven John Metsker, Pearson Education, 2004. 7. J2EE Pattens, Deepak Alur, John Crupi&Dan Malks, Pearson Education, 2003. 8. Software Design, David Budgen, Second edition, Pearson Education, 2003.


91

a b c d e f g h i j k l x x x x

Syllabus for B.Tech IV year I Semester

Computer Science and Engineering PROJECT MANAGEMENT & STRUCTURED FINANCE

(PROFESSIONAL ELECTIVE –II)

Code: 4ZC19 L T P/D C 4 1 - 4

Course Objective: The course has been designed to create an awareness of the need for systematic management of projects; highlight the components of CMBS issuance and establish a framework for understanding the fundamentals of CMBS. Course Outcomes: At the end of this course, the student will be able

1. Characterize the various aspects of Project Management.

2. Describe idea generation and project formulation techniques.

3. Elaborate the pre-requisites and control of in-progress projects for successful

implementation.

4. Comprehend the concepts of Structured Finance and CMBS.

5. Describe about financing services and securitization process.

6. Analyze various Servicing Agreements and Loan documents.

UNIT I INTRODUCTION TO PROJECT MANAGEMENT: Concept and characteristics of a project - types of projects - Objectives of project management - Project Organizational structure - Project life cycle - Challenges and problems of project management - Qualities & functions of a project manager. UNIT II PROJECT FORMULATION: Generation of Project Ideas; Monitoring the environment; Tools for identification of Investment Opportunities; Preliminary Screening of Projects; Detailed Project Report: Market, Technical, Financial, Economic and Ecological feasibility report; Project Estimates; Project Selection. UNIT III PROJECT IMPLEMENTATION AND CONTROL: Pre-requisites for Successful Project Implementation; Forms of Project Organizations; Project Planning; Human Aspects of Project Management; Control of in-progress Projects; Post-audit; Abandonment Analysis. UNIT IV INTRODUCTION TO STRUCTURED FINANCE AND CMBS: Nature and Scope of Structured finance - Definition and characteristics of Commercial Mortgage Backed Securities (CMBS) – CMBS Vs other mortgage backed securities – Phases in development of CMBS market: Design, Engineering, Manufacturing and Recycle phases, CMBS securitization market: Property level - Loan level - Bond level - Subordination level.


92

UNIT V CMBS – SERVICING BUSINESS OVERVIEW: Servicing overview - History of Servicing – The securitization process – Originations and Refinancing overview, CMBS – Multifamily servicing – Role of servicer – Servicing approaches –– Ethics in commercial servicing – Servicer Specialization – Servicer Compensation. UNIT VI LIFE CYCLE OF COMMERCIAL REAL ESTATE (CRE) AND MULTIFAMILY LOAN: History of Commercial Real Estate - The loan cycle – Key Players in loan cycle – Property types & Characteristics – Property Performance - CMBS – Servicing Agreements and loan documents pooling – Servicing aspects – Sub Servicing Agreement - Borrower Lender loan documents – Property Related Documents. Books Recommended:

Projects by Prasanna Chandra, McGraw-Hill Publishing Co. Ltd Mortgage Valuation Models - Embedded options, Risk and Uncertainty - 1 Edition by

Andrew Davidson – Alexander Levin (Author) Mortgage – Based Securities: Products, Structuring & Analytical Technique - Frank J

Fabozzi (Author) Commercial Real Estate for Beginners : The Basics of Commercial Real Estate

Inventory - By Peter Harris (Author) An Introduction to Real Estate Investment Deal Analysis - By J. Scott (Author) Mortgage Loan Servicing - By Lawrence V. Conway (Author) Foundation of Real Estate Financial Modeling By Roger STAIGER The State Mortgage Loan Originator National Exam Study Guide - Second Edition

by PATRICIA O CONNOR

References: Jack Meredith, Samuel J. Mantel Jr, “Project Management-A Managerial Approach”, John

Wiley Sons John M Nicholas “Project Management for Business and Technology” Prentice Hall of India

Pvt. Ltd. James P Lewis “Project Planning, Scheduling and Control Tata McGraw-Hill Publishing Co. Ltd Financial Management: M Y Khan & P K Jain, Text, Problem and Cases 6/e Tata McGraw-Hill

Publishing Co. Ltd Project Management: Engineering, Technology and Implementation, Shtub, Bard and

Globerson, PH Inc. Project Management Handbook, Lock, Gower. Project Management: Systems approach to Planning Scheduling and Controlling, H. Kerzner. Project Scheduling and Monitoring in Practice, S. Choudhury, SAP. Total Project Management: The Indian Context, P. K. Joy, Macmillan India Ltd. The Management of Construction - A Project Life Cycle Approach by F. Lawrence

Bennett The Complete Real Estate Documents by Mazyar M. Hedayat, John J. Oleary The Fundamentals of Listing and Selling Commercial Real Estate - By Keim K.

Loren (Author) Structural Finance & Collateralised Debt Obligation - By Janet M. Tavakoli (Author)



93

Syllabus for B.Tech IV Year I semester Computer Science and Engineering

SOFTWARE TESTING

Code: 4E709 L T P/D C 4 - - 4 Course Objective: 1 To Understand the Basic concepts in Software testing, concepts of Flow graphs, Path

testing and Data Flow Testing, understand the concept of metrics and their types 3 To clearly 4 5

To understand and implement various testing techniques and to make a thorough study on various testing tools. To set a strategy for testing environment and to learn the testing methodologies in detail

Course Outcomes: CO1 Describe concepts of Software testing CO2 Describe and apply the concepts Flow graphs, Path testing and Data Flow

Testing. CO3 Practice Software testing strategy and Environment with economics and apply

Software Metrics useful in software development and maintenance. CO4 Software Testing Methodology, finding defects hard to find, Verification and

validation, Functional and structural, Workbench concept, Eight Consideration of software testing methodology, checklist. Describe Agile computing with agile testing

CO5 Demonstrate Software Testing Techniques such as JADs, Pareto Analysis , Regression Tasting, Structured walkthroughs, Thread testing , Performance testing and White box testing.

CO6 Describe Graph matrices and applications, and practice and apply automated testing tools such load Runner, UFT and QTP.

UNIT I What is Testing, Characteristics of Test Engineers, Software Testing Life Cycle, Levels of Testing, Testing Approaches, Test Cases: Format for Writing Test Case, Test plan: Format to prepare Test plan Purpose of testing, Dichotomies, Consequences of bugs UNIT II Flow graphs and Path testing: Basics concepts of path testing, predicates, path predicates and achievable paths, application of path testing. Data Flow Testing: Basics of Data flow Testing Logic Based Testing : Decision Tables

x x


94

UNIT III Software testing strategy and Environment, Establishing testing policy, structured approach to testing, Test factors, Economics of SDLC testing. Software Metrics: Software Quality, Metrics for Analysis Model, Metrics for Design Model, Metrics for source code, Metrics for testing, Metrics for maintenance.

UNIT IV Software Testing Methodology, Defects hard to find, Verification and validation, Functional and structural, Defects and Failures, Testing that parallels the software Development process, Workbench concept, Eight Consideration of software testing methodology, testing tactics checklist. Importance of Agility, Building an Agile Testing Process UNIT V Software Testing Techniques, Black-box, Boundary value, Branch coverage, Cause Effect graphing, CRUD, Database, Histogram, Gray box, Inspections, JADs, Pareto Analysis , Prototyping , Random Testing, Risk based testing , Regression Testing, Structured walkthroughs, Thread testing , Performance testing, Stress Testing, Accepting Testing, White box testing, Alpha and Beta Testing. UNIT VI Graph matrices and application: Motivational overview, matrix of graph, relations, power of a matrix, node reduction algorithm. Need for Automated testing tools, Taxonomy of Testing Tools, Exposure to Software Testing Tools: Load Runner, UFT and QTP. TEXT BOOKS 1. Software testing techniques – Boris Beizer, Dreamtech, second edition.(Unit 1,2,6) 2. Software testing tools – by Dr. K.V.K.K Prasad Dreamtech (Unit 1,6) 3. Effective Methods for Software Testing, 2nd Edition by William E.Perry, Wiley publications.(Unit 3,4) 4. Software Testing and continuous Quality Improvement, by William E.Lewis,Gunasekaran,2nd Edition Auerbach publications (Unit 5,Refer Internet) 5. Software Engineering A practitioner’s Approach, Roger S Pressman, 6th edition. McGrawHill International Edition (Unit 3)

REFERENCES

1. Software Testing Techniques ,by Bories Beizer, Second Edition,Dreamtech Press 2. Testing and Quality Assurance for Component based software ,by Gao,Tsao and

Wu,Artech House Publishers 3. Managing the Testing Process,by Rex Black,Wiley. 4. Handbook of Software Quality Assurance, by G.Gordon Schulmeyer,James

I.McManus,2nd Edition,International Thomson Computer Press


95



Computer Science and Engineering

MANAGEMENT SCIENCE

Code: 4ZC02 L T P C 4 1 - 4

Course Objective: The course is aimed at giving the basics of management, its principles, practices and latest concepts for increasing the performance of engineering graduates in their respective fields.

Course Outcomes:

1. Identify principals, functions, levels, planning , staffing , directing controlling and organization structure of a corporate .

2. Identify and discuss operations management of an organization with respect to its plant layout, work, project management, review techniques .

3. Describe material management, Explain need for different Production Functions, Inventory Control System and Quality control features.

4. Describe features of human resource management and marketing management. 5. Develop personality, and to practice traits of leadership for interactive communication

, positive attitude and explain -, Perceptual Distortions Attribution analysis Attribution theories, Johari Window and Transactional Analysis In an organization.

6. Discuss concepts of strategic management and apply tools for competitive advantage and also apply target setting, strategy formulation with competitive advantage.

UNIT I

INTRODUCTION TO MANAGEMENT: Management- Definitions, Fayol’s principles of Management, Levels of Management, functions of management. Planning: types of planning, planning process; Organizing: Organizational Design and structure, staffing; Directing; Maslow’s Motivational theory, Leadership styles, Controlling: Basic control process.

UNIT II

INTRODUCTION TO OPERATIONS MANAGEMENT: Plant Location, plant layout, types of production, Work Study, Method study and Work Measurement, Basic Procedures Project Management: Network Analysis - Programme Evaluation and Review Techniques, Critical Path Method, Crashing of Simple Networks.


96

UNIT III

MATERIALS MANAGEMENT: Objectives of Materials, Need for Inventory Control, Economic Order Quantity, ABC Analysis, Inventory Control Systems, Just In Time, Introduction to LSCM, Quality Control Techniques– Inspection, ISO standards, Six Sigma.

UNIT IV

(i) Human Resources Management: Objectives of HRM, Challenges of HRM, HR Planning process HR functions and policies – Recruitment, Selection, Training and Development, Performance Appraisal, Balanced Score Card.

(ii) Marketing Management: Concept of Marketing, Functions, Marketing Mix, Product Life Cycle, Marketing Strategies, Channels of Distribution, Differences between products and services.

UNIT V

INTRODUCTION TO ORGANIZATIONAL BEHAVIOR: Definition, Nature and Scope, Perception – Perceptual selectivity and organization, Personality and Attitudes, Determinants of personality Formation of Attitudes-, Perceptual Distortions Attribution analysis Attribution theories, Johari Window and Transactional Analysis.

UNIT VI

STRATEGIC MANAGEMENT: Concepts in Strategic Management, Vision, Mission, Objectives, SWOT Analysis, Concept of Strategic Planning, Competitive Advantage, Concept of Core Competence; An overview, Process and its Implementation, Target Setting, Types of strategies, strategy formulation; Implementation.

ESSENTIAL READING:

1. A R Aryasri: Management Science, Tata Mc Graw Hill

SUGGESTED READINGS:

Dr. Y. Satyanarayana: Management control systems in competitive environment, Koontz & Weihrich: Essentials of Management, 6/e, TMH, 2005 Kotler Philip & Keller Kevin Lane: Market Management 12/e, PHI, 2005 5 Strategic Management, Text and Cases, VSP Rao, V Hari Krishna Thomas N Duening & John M. Ivancevich Management – Principles and Guidelines


97



Computer Science and Engineering SCRIPTING LANGUAGES


4 - - 4 Course Objective:

The primary goal of SCRIPTING LANGUAGES is to give students

a) a basic introduction to procedural programming, using Python.

b) a basic introduction to Object Oriented programming,using PHP.

Course Outcomes: 1.Explore Python's major built-in object types such as numbers, lists and dictionaries.

2.Create and process objects with Python statements and learn Python's general syntax model.

3.Use functions to avoid code redundancy and package code for reuse.

4.Organize statements, functions and other tools into larger components with modules.

5.Explore PHP basics, functions, arrays and object-oriented PHP

6.Create the applications using advanced OO-PHP, string functions and regular expression for PHP scripting. Using the funtions to work with the file and operating system based applications along with exception handling.

UNIT 1: (Text book 1: Chapters 1 to 6) Getting Started : A Python , How Python Runs Programs, How You Run Programs, Types and Operations: Introducing Python Object Types, Numeric Types, The Dynamic Typing Interlude. UNIT 2: (Text book 1: Chapter 7 to 11) String Fundamentals, Lists and Dictionaries, Tuples, Files, and Everything Else, Statements and Syntax: Introducing Python Statements ,Assignments, Expressions, and Prints. UNIT 3: (Text book 1: Chapters 12 to 18) if Tests and Syntax Rules, while and for Loops , Iterations and Comprehensions, The Documentation Interlude. Functions and Generators: Function Basics, Scopes, Arguments UNIT 4: (Text book 1: Chapters 19 to 25) Advanced Function Topics, Comprehensions and Generations , The Benchmarking Interlude, Modules and Packages: Modules: The Big Picture, Module Coding Basics, Module Packages, Advanced Module Topics.


98

UNIT 5: (Text book 2: Chapters 1,3 to 6) Introducing PHP, PHP Basics, Functions, Arrays, Object-Oriented PHP. UNIT 6: (Text book 2: Chapters 7 to 10) Advanced OOP Features , Error and Exception Handling, Strings and Regular Expressions, Working with the File and Operating System. TEXT BOOK 1. Learning Python 5th Edition by Mark Lutz, Published by SPD O’Reilly Media. 2. Beginning PHP and MySQL From Novice to Professional Fourth Edition by W. Jason Gilmore, Apress. REFERENCES 1. Programming Python, 4th Edition by Mark Lutz, Published by SPD O’Reilly Media. 2. Beginning Python, Peter, Alex , David et. al. Published by Wiley Publishing, Inc. 3. PHP: The Complete Reference by Steven Holzner, Mc Graw Hill.


99



Computer Science and Engineering CLOUD COMPUTING

Code: 4EC15 L T P/D C 3 1 - 3

Prerequisite: Basic Programming ,Computer Networks and Operating Systems. Course objectives It attempts to present cloud computing in a way that anyone can understand. We do

include technical material, but we do so in a way that allows managers and technical people alike to understand what exactly cloud computing is and what it is not.

We try to clear up the confusion about current buzzwords such as PaaS, SaaS, etc., and let you all see how and why the technology has evolved to become “the cloud” as we know and use it today.

The beauty and advantage of this course is that at the end in the last units students are practically involved in preparing various case studies.

Course Outcomes: 1. Describe the characteristics of cloud 2. Describe the cloud services. 3.Practice hadoop installation, job execution and describe different architectures for cloud applications 4. Creation and running of python programs, running amazon ec2 instance. 5. Discuss mapreduce and image processing app on cloud. 6. Discuss cloud security architecture. UNIT-1 Introduction to Cloud Computing : Introduction ,characteristics ,Cloud Models and examples, Applications of Cloud Services .Cloud Concepts and Technologies . UNIT-2 Cloud Services and Platforms : Compute Services,Storage Services,Database Services,Application Services,Content Delivery Services,Analytics Services,Deployment and Management Services,Identity and Access Management Services,Open Source Private cloud Software. UNIT-3 Introduction to Hadoop and MapReduce: Introduction to Hadoop ,Installing Hadoop, Commands ,HDFS Operations MapReduce Job Execution, Hadoop Schedulers . Cloud Application Design: Design Considerations for Cloud Application,Reference Architectures for Cloud Applications .Cloud Application Design Methodologies , Data Storage Approaches .


100

UNIT – 4 Python Basics : Introduction, Installing Python ,Data Types ,Data Structures ,Control Flow, Function , Modules, Packages, File Handling, Data and Time Operations, Classes . Python For Cloud : Python for Amazon Web Services ,Google ,Windows Azure ,MapReduce . UNIT-5 Cloud Application Development in Python: Desing Approaches, Image Processing App, Document Storage App, MapReduce App, Social Media Analytics App. UNIT-6 CloudSecurity : Introduction ,Cloud Security Architecture (CSA), Authentication, Authorization, Identity Access Management(IAM), Data Security, Key Management, Auditing .Cloud For Industry , Healthcare and Education . Text Books: 1.Cloud Computing –A Hands on Approach , Arshdeep,Vijay Medisetti,University Press. 2. Cloud Computing: Raj Kumar Buyya,James Broberg,Andrzej GOscinski,Wiley. References : 1. Cloud Computing : Dr.Kumar Saurab Wiley India 2011 . 2. Code in the cloud computing: K Chandrasekharan CRC Press. 3.Cloud Compuitng: John W. Rittinghouse ,James Ransome,CRC press. 4.Virtualization Security : Dave Shackleford2013,SYBEX a Willy Brand. 5.Cloud Computing and Software Service :Ahson,iiyas.2011. 6.Cloud Computing Bible: Sosinsky 2012 Wiley India.


101


x x x x


CULTURE, VALUES, PROFESSIONAL ETHICS AND IPR

(Common to all branches)

Code: 4GC33 L T P/D C

2 1 - 2

Objectives of the Course:

By studying this subject student will be able to know the importance of value education, values, morals, ethics, Indian culture and IPR and how valuable they are for each every individual in their day to day life and to mould themselves as real human being.

Course outcomes By the end of the unit the student will able to: 1. Know the importance of Indian culture, status of woman in India Society. Present its

relevance in present age. And analyze the ancient wisdom. Apply core wisdom for professionals in modern age.

2. Know the importance of value system. And itsimportance in present life.. 3. Identify the core areas of ethics. Apply ethics in their professional and student life. 4. Differentiate between organization and profession. List out professional ethics. Work towards techniques of implementing professional ethics in future. 5. Distinguish types of properties and describe relevant IPRs. 6. Elaborate WIPO Mission and Activities, WTO-Patent Ordinance and the Bill, UNIT-1 INDIAN CULTURE: A Introduction to Culture Values and Ethics, Bharata, The Indian Concept of Human Life, Indian Civilization, Sanskrit and Indian Languages, Festivals, Sculpture, Music, Dance, Drama, Ayurveda, Family and its Importance, Indian Marriage System, Status of Women in Indian Society, Education, Purpose, Ancient System, Value Education, Interfaith Understanding, Happiness, Modernism and its Effect on Lifestyle, Mind and its Operation, Control of Mind, Yoga, Exemplary Life Sketches-Albert Einstein, Abraham Lincoln UNIT-II VALUE SYSTEM:Human Value System, Truthfulness, Righteousness, Peace, Non-Violence, Love, Kindness and Compassion, Humility, Faith, Courage, Optimism, Forgiveness, Ceiling on Desires (Control of Sense organs), Exemplary Life Sketches-M K Gandhi, Abdul Kalam UNIT-III ETHICS:Ethics in Ancient India, Ethics, Morals, Ethics and Human Life, Core Areas for Ethics, Values, Morality, Integrity, Honesty, Character, Loyalty, Trustworthiness,


102

Courage and Confidence, Confidentiality, Secrecy and Transparence, Justification, Contracts and Spirit Promises and Schedules, Quarrels, Selfishness, Obstacles, Supporting Measures, Reputation and its sale, Decision Making in Ethics, Exemplary Life Sketches-Vishveshwaraiah, , Jagadeesh Chandra Bose, Meghanad Saha UNIT- IV PROFESSIONAL ETHICS: Occupation, Profession, Professional, Professional Organization, Obligations Of a Professional, Temptations, Aptitude, Importance of Professional Ethics for Engineers, Code of Ethics, Need for a Code, Impact of Ethical Behaviour, The Code of Ethics for Engineers, Fundamental Principles and Cannons, Commerce and Ethics, Marketing Ethics, Finance and Ethics, Science, Religion and Ethics, Medical Ethics, Genetics and Ethics, Politics and Ethics, Genders and Ethics, Media and Ethics, Computer Ethics, Exemplary Life Sketches- Narayan Murthy, Homi Jahangir Bhabha UNIT –V INTELLECTUAL PROPERTY RIGHTS (IPR):Invention and Creativity, Basic Types of Property, Need for Protection of IPR, IP Types Industrial Property (Patents, Trade Marks, Trade Secrets, Industrial Designs and Integrated Circuits), Copyrights and Related Rights, Geographical Indications. UNIT-VI WIPO Mission and Activities, GATT & Trips, Indian Position on WTO and strategies, Indian IPR legislations-commitments to WTO-Patent Ordinance and the Bill, Draft of a National Intellectual Property Policy, Case Studies on IP REFERENCES: 1. The ABCs of Ethics by Michael. L. Buckner, Universe. Inc, New York Lincoln, Shangahai 2. Science, Faith and Ethics by Denis Alexander and Robert.S.White, Hendrickson Publishers,

Massachusetts, USA, March 2006 3. Vedic Science Primer by PSR Murthy, BS Publications, Hyderabad 4. Medical Ethics-Global View Points, Edited by Diane Andrews, Hennig Feld, Green

Haven Press 5. Divine Stories, Human Value Stories, Volume I and II, Sri Satya Sai Books and Publications 6. IPR, Nalsar Law University Course modules


103

a b c d e f g h i j k l m x x x x x x x


Computer Science and Engineering PROJECT PHASE – I

Code: 4E780 L T P/D C - - 2 1 Pre-Requisites: All Courses till this semester Course Objective: The students is required to identify the problem, relevant to the computer science & engineering, allied courses and well as to the society, directly or indirectly, study the scope and propose a solution in the form of its architecture and design. Course Outcomes: At the end of this course, the student is able to

1. Identify a topic from the current technical topics of their choice in the computer science domain and the allied fields, after surveying in the internet resources, journals and technical magazines in the library.

2. Arrange the contents of the presentation and scope of the topic, in an effective manner.

3. Present the technical topic they chose in front of the panel and the fellow students, using the oratory skills.

4. Design the accepted project using the design tools and face the questions posed by the panel and the students and answer them.

A pre-project seminar in fourth year first semester will be evaluated for 50 marks as follows. This is aimed at the students to identify a project on which they are likely to continue for their project in final year second semester.

Preliminary Report on progress of the work : 10 marks Mid Semester presentation : 10 marks

Final report : 10 marks Final Presentation and Defense before a departmental

Committee consisting of head, a senior faculty and supervisor : 20 marks There shall be no external evaluation in pre-project seminar.


104

a b c d e f g h i j k l m x x x x x x x x x x x


Computer Science and Engineering INDUSTRY ORIENTED MINI PROJECT

Code: 4E781 L T P/D C - - - 2

Pre-Requisites: All Courses till this semester Course Objective: This course is designed to help students develop practical ability and knowledge about practical tools / techniques in order to solve real life problems related to the industry, academic institutions and computer science research. It involves practical work for understanding and solving problems in the field of computing. Course Outcomes: After undergoing this course, the student will be able to 1. Apply knowledge, analyze a problem and review literature for professional

project design to solve a technical problem. 2. Design or develop a system, component or process and recognize opportunities for

improvements in a design. 3. Utilize appropriate computer software tools to accomplish the objectives of a project. 4. Communicate effectively the results of a project in oral presentations and written reports. 5. Design and plan a project and manage the time involved to complete all tasks to the

respective deadlines. 6. Work and communicate effectively independently and as a member of a project team. There shall be an industry-oriented mini-Project in their specialization that may be carried out in collaboration with an industry / R & B organization / Academic Institution, to be taken up during the vacation after III year II Semester examination. Every group of students will select individually Commercial or Technical Project based on Application Development Technologies learnt in previous semesters. Each student’s group will have to prepare proper documentation consisting of Software Requirements Specification (SRS), Modeling Techniques, Development Strategies, Implementation and Testing Strategies. Student may use any Design Methodologies such as OOAD and UML, etc. The project work will be presented by students using Power Point Presentation Tool to the panel of Examiners. However, the mini project and its report shall be evaluated during IV year I Semester. The industry oriented mini project shall be evaluated for a total of 150 marks with 50 marks for internal assessment and 100 marks for end examination. The mini project must be submitted in report form and should be presented before a committee, consisting of an external examiner, head of the department, a senior faculty member of the department and supervisor of the mini project.


105

The pattern of internal evaluation is as follows:

Work in progress as evaluated by internal guide : 10 marks Work in progress as evaluated by External guide : 20 marks Report : 10 marks Seminar presentation and defense of project : 10 marks

If the mini project is conducted within the college, the work in progress is evaluated by the supervisor for 30 marks.


106


Computer Science and Engineering Software Testing and Data Mining Lab

Code: 4E779 L T P/D C - - 4 2 Pre-Requisites: Software Engineering Course Objective: Data Mining LAB: 1. Build Data warehouse using Informatica tool with basic transformations across

various datasets/ databases. 2. Extract Knowledge from datasets using preprocessing techniques and data mining

functions using Clementine Tool. Software Testing: 1. In software testing lab the various manual and automation testing processes are

carried out to efficiently learn the testing activities. 2. Both commercial and open source testing tools are being taught to better the software

testing in detail. 3. According the software industry requirements the testing tools are taught so that the

students can directly make use of testing tools in industry. 4. Implement various testing techniques and to make a thorough study on various testing

tools. Course Outcomes: 1. Understand the workflow of Informatica (ETL: Extract, Transform and Load) tool, 2. Perform the record transformations like Expression, Filter, etc and attribute

transformations like Aggregator, Joiner, etc. 3. Using data mining tool: Clementine, perform functions- GRI, Apriori, C 5.0,

NeuralNet etc. for analyzing the data and analyze and compare the patterns obtained by changing the thresholds and parametric values.

4. Students prepare Test Plan document and write Test Cases for Small scale Project (Like for their B.Tech IV Year Project or Post-Graduate Projects), they are learn how to Analyze SRS document in order to prepare Test Plan Document.

5. Students demonstrate skills to use modern software testing tools (EX: QTP, Bugzilla, Selenium, Test Director and Quality Center) and test application (web, Window application) by using the tools.

6. Students demonstrate the ability to differentiate between different Testing tools present in the market (like functional testing tools, Test Management Tools, Bug Tracking Tools and Performance Testing Tools) and prepare Test Plan document and write Test Cases for Small scale Project (Like for their B.Tech IV Year Project or Post-Graduate Projects).



107

Exercises/ Case Studies: WEEK 1 : Exploring and understanding Informatica tool WEEK 2 :

1 Build a Data Warehouse to perform filter transformation for the employee database. 2 Add the commission of 1000 Rs in the Salary field of Employee table using Expression

Transformation. WEEK 3: 3 Using Aggregator transformation display the average salary of employees in each departments. 4 Using Joiner transformation display the Sailor_Name form Sailors table and Boat_Name from

Boats table in a new table. WEEK 4: Exploring understanding Clementine Tool WEEK 5: 5 Compare the GRI and Apriori usage (Prepare a sample data set in Spread Sheet) 6 Determine the Drugs importance w.r.t. Age, Cholestrol and BP using C 5.0 7 Predict the accuracy of the test data set using Neural Net model using a Case Study of Botanical

data set. WEEK 6: 8 Using Kohonen model of classification determine the Classifier and the Test data and predict

the test data set using classified data set. 9 Compare the C 5.0 and Neural Net using the sample data. WEEK 7: Revising all the above exercises Software Testing lab Exercises Week 1

1. Write programs in ‘C’ Language to demonstrate the working of the following constructs: i) do…while ii) while…do iii) if …else iv) switch v) for

2. A program written in ‘C’ language for matrix multiplication fails” Introspect the causes for its failure and write down the possible reasons for its failure.

Week 2 3. Take any system (e.g. ATM system) and study its system specifications and report the

various bugs. 4. write the test cases for any known application (e.g. Banking application)

Week 3 5. Create a test plan document for any application (e.g. Library management system) 6. Overview of any Test Management Tools (e.g. Test Director)

Week 4 & 5 7. Study of any Functional Testing Tools (UFT,QTP)

Week 6 8. Study of any bug tracking tool (e. g. Bugzilla, Bug bit) 9. Overview of Performance Testing Tools (Ex: Load runner) 10. Study of Selenium IDE (open source testing tool)


108

Syllabus for B. Tech. IV Year I semester Computer Science and Engineering SCRIPTING LANGUAGES LAB

Python Exercises

Code: 4E789 L T P/D C - - 4 2

Course Objective:

The primary goal of SCRIPTING LANGUAGES LAB is to give students

a) a basic introduction to procedural programming, using Python.

b) a basic introduction of PHP programming.

with applications as case studies.

Course Outcome:

1. Be fluent in the use of procedural statements — assignments, conditional statements,

loops, function calls — and sequences. Be able to design, code, and test small Python

programs that meet requirements expressed in English. This includes a basic understanding of

top-down design.

2. Have knowledge of basic PHP programming, w.r.t. applications

WEEK 1

1. Create a program that asks the user to enter their name and their age. Print out a message

addressed to them that tells them the year that they will turn 100 years old.

2. Ask the user for a number. Depending on whether the number is even or odd, print out an

appropriate message to the user.

Hint: how does an even / odd number react differently when divided by 2?

Extras:

1.If the number is a multiple of 4, print out a different message.

2.Ask the user for two numbers: one number to check (call it num) and one number to

divide by (check). If check divides evenly into num, tell that to the user. If not, print a

different appropriate message.

3. Take a list, say for example this one:

a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]

and write a program that prints out all the elements of the list that are less than 5.

Extras:

1.Instead of printing the elements one by one, make a new list that has all the elements

less than 5 from this list in it and print out this new list.



109

2.Write this in one line of Python.

3.Ask the user for a number and return a list that contains only elements from the original

list a that are smaller than that number given by the user.

WEEK 2

4. Create a program that asks the user for a number and then prints out a list of all the divisors

of that number. (If you don’t know what a divisor is, it is a number that divides evenly into

another number. For example, 13 is a divisor of 26 because 26 / 13 has no remainder.)

5. Take two lists, say for example these two:

a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]

b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]

and write a program that returns a list that contains only the elements that are common

between the lists (without duplicates). Make sure your program works on two lists of

different sizes.

6. Ask the user for a string and print out whether this string is a palindrome or not.

(A palindrome is a string that reads the same forwards and backwards.)

WEEK 3

7.Let’s say I give you a list saved in a variable: a = [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]. Write

one line of Python that takes this list a and makes a new list that has only the even elements

of this list in it.

8.Make a two-player Rock-Paper-Scissors game. (Hint: Ask for player plays (using input),

compare them, print out a message of congratulations to the winner, and ask if the

players want to start a new game)

Remember the rules:

Rock beats scissors

Scissors beats paper

Paper beats rock

9.Generate a random number between 1 and 9 (including 1 and 9). Ask the user to guess the

number, then tell them whether they guessed too low, too high, or exactly right. (_Hint:

remember to use the user input lessons from the very first exercise

Extras:

Keep the game going until the user types “exit”

Keep track of how many guesses the user has taken, and when the game ends, print this out.


110

WEEK 4

10. Take two lists, say for example these two:

a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]

b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]

and write a program that returns a list that contains only the elements that are common

between the lists (without duplicates). Make sure your program works on two lists of

different sizes. Write this using at least one list comprehension. (Hint: Remember list

comprehensions from Exercise 7).

Extra:

Randomly generate two lists to test this

11. Ask the user for a number and determine whether the number is prime or not. (For those

who have forgotten, a prime number is a number that has no divisors.). You can (and should!)

use your answer to Exercise 4to help you.

12. Write a program that takes a list of numbers (for example, a = [5, 10, 15, 20, 25]) and

makes a new list of only the first and last elements of the given list. For practice, write this

code inside a function.

WEEK 5

13. Write a program that asks the user how many Fibonacci numbers to generate and then

generates them. Take this opportunity to think about how you can use functions. Make sure to

ask the user to enter the number of numbers in the sequence to generate.(Hint: The

Fibonacci seqence is a sequence of numbers where the next number in the sequence is

the sum of the previous two numbers in the sequence. The sequence looks like this: 1, 1,

2, 3, 5, 8, 13, …)

14. Write a program (function!) that takes a list and returns a new list that contains all the

elements of the first list minus all the duplicates.

Extras:

Write two different functions to do this - one using a loop and constructing a list, and

another using sets.

Go back and do Exercise 5 using sets, and write the solution for that in a different function.

15. Write a program (using functions!) that asks the user for a long string containing multiple

words. Print back to the user the same string, except with the words in backwards order. For

example, say I type the string:


111

My name is Michele

Then I would see the string:

Michele is name My

shown back to me.

WEEK 6

16. Write a password generator in Python. Be creative with how you generate passwords -

strong passwords have a mix of lowercase letters, uppercase letters, numbers, and symbols.

The passwords should be random, generating a new password every time the user asks for a

new password. Include your code in a main method.

Extra:

Ask the user how strong they want their password to be. For weak passwords, pick a word

or two from a list.

17. Create a program that will play the “cows and bulls” game with the user. The game works

like this:

Randomly generate a 4-digit number. Ask the user to guess a 4-digit number. For every digit

that the user guessed correctly in the correct place, they have a “cow”. For every digit the

user guessed correctly in the wrong place is a “bull.” Every time the user makes a guess, tell

them how many “cows” and “bulls” they have. Once the user guesses the correct number, the

game is over. Keep track of the number of guesses the user makes throughout teh game and

tell the user at the end.

Say the number generated by the computer is 1038. An example interaction could look like

this:

Welcome to the Cows and Bulls Game!

Enter a number:

>>> 1234

2 cows, 0 bulls

>>> 1256

1 cow, 1 bull

...

Until the user guesses the number.


112

WEEK 7

18. Write a function that takes an ordered list of numbers (a list where the elements are in

order from smallest to largest) and another number. The function decides whether or not the

given number is inside the list and returns (then prints) an appropriate boolean.

Extras:

Use binary search.

WEEK 8,9,10

Python Projects :

a) Guessing Game Two Solution

user will have in a number between 0 and 100 in head. The program will guess a number, and

you, the user, will say whether it is too high, too low, or your number.

At the end of this exchange, your program should print out how many guesses it took to get

your number.

As the writer of this program, you will have to choose how your program will strategically

guess. A naive strategy can be to simply start the guessing at 1, and keep going (2, 3, 4, etc.)

until you hit the number. But that’s not an optimal guessing strategy. An alternate strategy

might be to guess 50 (right in the middle of the range), and then increase / decrease by 1 as

needed. After you’ve written the program, try to find the optimal strategy!

b) Draw A Game Board Solutions

we want to draw game boards that look like this:

---------

||||

---------

||||

---------

||||

---------

This one is 3x3 (like in tic tac toe). Obviously, they come in many other sizes (8x8 for chess,

19x19 for Go, and many more).

Ask the user what size game board they want to draw, and draw it for them to the screen

using Python’s print statement.


113

c) Check Tic Tac Toe Solutions

If a game of Tic Tac Toe is represented as a list of lists, like so:

game = [[1, 2, 0],

[2, 1, 0],

[2, 1, 1]]

where a 0 means an empty square, a 1 means that player 1 put their token in that space, and

a 2 means that player 2 put their token in that space.

Your task this week: given a 3 by 3 list of lists that represents a Tic Tac Toe game board, tell

me whether anyone has won, and tell me which player won, if any. A Tic Tac Toe win is 3 in

a row - either in a row, a column, or a diagonal. Don’t worry about the case where TWO

people have won - assume that in every board there will only be one winner.

Here are some more examples to work with:

winner_is_2 = [[2, 2, 0],

[2, 1, 0],

[2, 1, 1]]

winner_is_1 = [[1, 2, 0],

[2, 1, 0],

[2, 1, 1]]

winner_is_also_1 = [[0, 1, 0],

[2, 1, 0],

[2, 1, 1]]

no_winner = [[1, 2, 0],

[2, 1, 0],

[2, 1, 2]]

also_no_winner = [[1, 2, 0],

[2, 1, 0],

[2, 1, 0]]

d) Tic Tac Toe Draw Solutions

In a tic tac toe game, the “game server” needs to know where the Xs and Os are in the board,

to know whether player 1 or player 2 (or whoever is X and O won).

There has also been an exercise about drawing the actual tic tac toe gameboard using text

characters.

The next logical step is to deal with handling user input. When a player (say player 1, who

is X) wants to place an X on the screen, they can’t just click on a terminal. So we are going to


114

approximate this clicking simply by asking the user for a coordinate of where they want to

place their piece.

As a reminder, our tic tac toe game is really a list of lists. The game starts out with an empty

game board like this:

game = [[0, 0, 0],

[0, 0, 0],

[0, 0, 0]]

The computer asks Player 1 (X) what their move is (in the format row,col), and say they

type 1,3. Then the game would print out

game = [[0, 0, X],

[0, 0, 0],

[0, 0, 0]]

And ask Player 2 for their move, printing an O in that place.

Things to note:

For this exercise, assume that player 1 (the first player to move) will always be X and player

2 (the second player) will always be O.

Notice how in the example I gave coordinates for where I want to move starting from (1, 1)

instead of (0, 0). To people who don’t program, starting to count at 0 is a strange concept, so

it is better for the user experience if the row counts and column counts start at 1. This is not

required, but whichever way you choose to implement this, it should be explained to the

player.

Ask the user to enter coordinates in the form “row,col” - a number, then a comma, then a

number. Then you can use your Python skills to figure out which row and column they want

their piece to be in.

Don’t worry about checking whether someone won the game, but if a player tries to put a

piece in a game position where there already is another piece, do not allow the piece to go

there.

PHP Excercises

WEEK 11 1. Write a PHP script to display the following strings.

Sample String :

'Tomorrow I \'ll learn PHP global variables.'

'This is a bad command : del c:\\*.*'


115

Expected Output :

Tomorrow I 'll learn PHP global variables.

This is a bad command : del c:\*.*

2. $var = 'PHP Tutorial'. Put this variable into the title section, h3 tag and as an anchor text

within a HTML document.

Sample Output :

PHP Tutorial PHP, an acronym for Hypertext Preprocessor, is a widely-used open source general-purpose

scripting language. It is a cross-platform, HTML embedded server-side scripting language

and is especially suited for web development.

3. Create a simple HTML form and accept the user name and display the name through PHP

echo statement.

Sample output of the HTML form :

4. Write a PHP script to get the client IP address.

5. Write a PHP script to get the current file name.

6. Write a PHP script, which change the color of first character of a word.

Sample string : PHP Tutorial

Expected Output : PHP Tutorial

7. Write a PHP script, to check whether the page is called from 'https' or 'http'.

8. Write a PHP script to redirect a user to a different page .

Expected output : Redirect the user to http://sreenidhi.edu.in/

9. Write a e PHP script to display string, values within a table.

Note : Use HTML table elements into echo.

Expected Output :


116

10. Arithmetic operations on character variables : $d = 'A00'. Using this variable print the

following numbers.

Sample Output :

A01

A02

A03

A04

A05

WEEK 12

11. Write a PHP script to get the information about the operating system PHP is running on.

12.Write a PHP script to get the directory path used for temporary files.

13. Write a PHP script to get the time of the last modification of the current page

14. $ceu = array( "Italy"=>"Rome", "Luxembourg"=>"Luxembourg",

"Belgium"=>"Brussels", "Denmark"=>"Copenhagen", "Finland"=>"Helsinki", "France"

=>"Paris", "Slovakia"=>"Bratislava", "Slovenia"=>"Ljubljana", "Germany" =>"Berlin",

"Greece" =>"Athens", "Ireland"=>"Dublin", "Netherlands"=>"Amsterdam",

"Portugal"=>"Lisbon", "Spain"=>"Madrid", "Sweden"=>"Stockholm", "United

Kingdom"=>"London", "Cyprus"=>"Nicosia", "Lithuania"=>"Vilnius", "Czech

Republic"=>"Prague", "Estonia"=>"Tallin", "Hungary"=>"Budapest", "Latvia"=>"Riga",

"Malta"=>"Valetta", "Austria" =>"Vienna", "Poland"=>"Warsaw") ;

Create a PHP script which display the capital and country name from the above array $ceu.

Sort the list by the name of the country.

Sample Output :

The capital of Netherlands is Amsterdam

The capital of Greece is Athens

The capital of Germany is Berlin

- - - - - - - - - - - - - - - - - - - - - - - - -

- - - - - - - - - - - - - - - - - - - - - - - - -

15. Write a PHP script that insert a new item in an array on any position.

Expected Output :

Original array :

1 2 3 4 5


117

After inserting '$' the array is :

1 2 3 $ 4 5

16. Write a PHP script to calculate and display average temperature, five lowest and highest

temperatures.

Recorded temperatures : 78, 60, 62, 68, 71, 68, 73, 85, 66, 64, 76, 63, 75, 76, 73, 68, 62, 73,

72, 65, 74, 62, 62, 65, 64, 68, 73, 75, 79, 73

Expected Output :

Average Temperature is : 70.6

List of seven lowest temperatures : 60, 62, 63, 63, 64,

List of seven highest temperatures : 76, 78, 79, 81, 85,

17. Write a PHP program to merge (by index) the following two arrays.

Sample arrays :

$array1 = array(array(77, 87), array(23, 45));

$array2 = array("w3resource", "com");

18. Write a PHP script which display all the numbers between 200 and 250 that are divisible

by 4.

19. Write a PHP script to generate unique random numbers within a range.

20. Write a PHP function to floor decimal numbers with precision.

Note: Accept three parameters number, precision and $separator

Sample Data :

1.155, 2, "."

100.25781, 4, "."

-2.9636, 3, "."

Expected Output :

1.15

100.2578

-2.964

WEEK 13

21. Write a PHP script to sort an array using case-insensitive natural ordering.

22. Write a PHP program to get the extension of a file.

23. Write a PHP script to lower-case and upper-case, all elements in an array.

24. Write a PHP function to create a multidimensional unique array for any single key index.

25. Write a PHP program to remove duplicate values from an array which contains only

strings or only integers.


118

26. Write a PHP function to compares two multidimensional arrays and returns the

difference.

WEEK 14

27. Write a function to sort an array.

28. Write a PHP function that checks whether a passed string is palindrome or not?

29. Write a PHP script that removes the last word from a string.

Sample string : 'The quick brown fox'

Expected Output : The quick brown

30. Write a PHP script to remove all characters from a string except a-z A-Z 0-9 or "".

Sample string : abcde$ddfd @abcd )der]

Expected Result : abcdeddfd abcd der

WEEK 15

31. Write a PHP script to extract the file name from the following string.

Sample String : 'www.example.com/public_html/index.php'

Expected Output : 'index.php'

32. Write a PHP script to format values in currency style.

Sample values : value1 = 65.45, value2 = 104.35

Expected Result : 169.80

33. Write a PHP script to find first character that is different between two strings.

String1 : 'football'

String2 : 'footboll'

Expected Result : First difference between two strings at position 5: "a" vs "o"

34. Write a PHP script to remove all leading zeroes from a string.

Original String : '000547023.24'

Expected Output : '547023.24'

35. Write a PHP script to remove comma(s) from the following numeric string.

Sample String : '2,543.12'

Expected Output : 2543.12

36. Uploading files using PHP, we need to performs following tasks -

1. Set up an html page with a form using which we will upload file.

2. Setup a PHP script to upload the file to the server as well as move the file to it's

destination.

3. Inform the user whether the upload was successful or not.


119


Computer Science and Engineering TECHNICAL PAPER WRITING AND SEMINAR- VII

Code: 4E796 L T P/D C - - 2 1 Pre-Requisites: All Courses till this semester Course Obejectives : Learn to identify, arrange, and present a technical topic to improve communication and soft skills to enhance global employability.

Course Outcomes: 5. Students identify a topic from the current technical topics of their choice in the computer

science domain and the allied fields, after surveying in the internet resources, journals and technical magazines in the library.

6. Student learnt to arrange the contents of the presentation and scope of the topic, in an effective manner.

7. Each student then presents the technical topic they chose in front of the panel and the fellow students, using the oratory skills.

8. Students also face the questions posed by the panel and the students and answer them. There shall be a Technical Paper writing and seminar evaluated for 25 marks in Fourth Year First Semester. The evaluation is purely internal and will be conducted as follows:





120


Syllabus for B.Tech IV year II Semester Computer Science and Engineering

HUMAN COMPUTER INTERACTION (PRFESSIONAL ELECTIVE –III)


4 - - 4 1 To expose the students to understand the importance of the design for any software that

acts as an interface between Man and Machine 2 To make the students should also consider the characteristics of the humans while

designing the Software /Hardware. 3 To teach the students to understand the characteristics required to build an effective GUI 4 To explain the students understand the significance of the software tools and learn about

different interaction devices. Course Outcomes:

1. Explain role of user Interface, its importance and Benefits of good design . 2. Describe the concept of direct manipulation, graphical system, Web user role and Principles of user interface. 3. Describe Human interaction with computers, importance of human characteristics human consideration in Design and relate business functions. 4. Apply and explain Screen Designing formalities such as Screen planning, purpose, organizing screen elements, ordering of screen content, screen navigation, focus and emphasis and Technological considerations in interface design. 5. Explain Windows–Navigation schemes and screen based controls. Apply Components – text and messages, Icons and increases – Multimedia, colors, uses problems and choosing colors in real time application. 6. Develop applications with the aide of Software tools, interface Building Tools and use Interaction Devices.

UNIT I Introduction: Importance of user Interface – definition, importance of good design. Benefits of good design - A brief history of Screen design. UNIT II The graphical user interface – popularity of graphics, the concept of direct manipulation, graphical system, Characteristics, Web user – Interface popularity, characteristics- Principles of user interface. UNIT III Design process – Human interaction with computers, importance of human characteristics human consideration in Design, Human interaction speeds, understanding business functions.


121

UNIT IV Screen Designing: Design goals – Screen planning and purpose, organizing screen elements, ordering of screen data and content – screen navigation and flow – Visually pleasing composition – amount of information – focus and emphasis – presentation information simply and meaningfully – information retrieval on web – statistical graphics – Technological consideration in interface design. UNIT V Windows – New and Navigation schemes selection of window, selection of devices based and screen based controls. Components – text and messages, Icons and increases – Multimedia, colours, uses problems, choosing colors. Case studies: windows GUI. UNIT VI Software tools – Specification methods, interface – Building Tools. Interaction Devices – Keyboard and function keys – pointing devices - speech recognition digitization and generation – image and video displays – Printers. TEXT BOOKS: 1. The essential guide to user interface design, Wilbert O Galitz, Wiley DreamaTech. 2. Designing the user interface. 3rd Edition Ben Shneidermann , Pearson Education Asia. REFERENCES: 1. Human – Computer Interaction. ALAN DIX, JANET FINCAY, GRE GORYD, ABOWD, RUSSELL BEALG, PEARSON. 2. Interaction Design PRECE, ROGERS, SHARPS. Wiley Dreamtech, 3. User Interface Design, Soren Lauesen , Pearson Education


122

Syllabus for B. Tech. IV Year II semester

Information Technology Professional Elective -III

COMPUTER GRAPHICS Code: 4FC06 L T P/D C 4 - - 4 Course Objective:

To understand basic algorithms for computer graphics and image processing To understand different applications of graphics.

Course Outcomes: UNIT I: Introduction, Application areas of Computer Graphics, overview of graphics systems, video-display devices, raster-scan systems, random scan systems, graphics monitors and work

stations and input devices. Output primitives : Points and lines, line drawing algorithms, mid-point circle and ellipse algorithms. UNIT II: Filled area primitives: Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms 2-D geometrical transforms : Translation, scaling, rotation, reflection and shear transformations, matrix representations and homogeneous coordinates, composite transforms, transformations between coordinate systems. UNIT III : 2-D viewing : The viewing pipeline, viewing coordinate reference frame, window to view-port coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line clipping algorithms, Sutherland – Hodgeman polygon clipping algorithm UNIT IV : 3-D object representation : Polygon surfaces, quadric surfaces, spline representation, Bezier curve and B-Spline curves, polygon rendering methods. 3-D Geometric transformations : Translation, rotation, scaling, reflection and shear transformations, composite transformations. UNIT V : 3-D viewing : Viewing pipeline, viewing coordinates, view volume and general projection transforms and clipping Visible surface detection methods : Classification, back-face


CO1. Explain fundamental terms within computer graphics CO2. Implement 2D graphics and algorithms including: line drawing, polygon filling, clipping, and transformations. CO3. Implement functions 2D viewing and apply clipping algorithms. CO4. Explain the concepts of and techniques used in 3D computer graphics, including viewing transformations, hierarchical modeling, color, lighting and texture mapping. CO5. Apply single and multiple transformations to 3D points &Describe various visible surface determination algorithms. CO6. Describe the animation production pipeline and Produce a short animation


123

detection, depth-buffer, scan-line, depth sorting, BSP-tree methods, area sub-division and octree methods UNIT VI : Computer animation : Design of animation sequence, general computer animation functions, raster animation, computer animation languages, key frame systems, motion specifications. ( p.nos 604- 16 of text book -1, chapter 21 of text book-2). TEXT BOOKS : 1. “Computer Graphics C version”, Donald Hearn and M.Pauline Baker, Pearson Education. 2. “Computer Graphics Principles & practice”, second edition in C, Foley, VanDam, Feiner and Hughes, Pearson Education. REFERENCES : 1. “Computer Graphics”, second Edition, Donald Hearn and M.Pauline Baker, PHI/Pearson Education. 2. “Computer Graphics Second edition”, Zhigand xiang, Roy Plastock, Schaum’s outlines, Tata Mc- Graw hill edition. 3. Procedural elements for Computer Graphics, David F Rogers, Tata Mc Graw hill, 2nd edition. 4. “Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH. 5. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer. 6. Computer Graphics, Steven Harrington, TMH


124

Syllabus for B. Tech IV Year II Semester Computer Science and Engineering

ADVANCED COMPUTER ARCHITECTURE (PRFESSIONAL ELECTIVE –III)

Code: 4EC18 L T P C 4 - - 4 COURSE OBJECTIVES

1. The objective of this course is to learn the fundamental aspects of computer architecture design and analysis

2. The course focuses on processor design, pipelining, superscalar, out-of-order execution, caches (memory hierarchies), virtual memory, storage systems, and simulation techniques. Advanced topics include a survey of parallel architectures and future directions in computer architecture.

Course Outcomes : 1. Explain Computer design principles, classifying of instruction set- memory addressing, type and size of operands, addressing modes, and instructions for control flow and encoding an instruction set. 2. Explain Instruction level parallelism (ILP) and high performance instruction delivery.

3. Describe ILP software approach, compiler techniques, VLIW approach and hardware support with comparative study for H.W verses S.W Solutions. 4. Describe Memory hierarchy design including cache performance- reducing cache misses penalty, and virtual memory protection. 5. Discuss Multiprocessors and thread level parallelism. 6. Describe Storage systems such as Buses and design I/O system. Explain issues in interconnecting networks. UNIT - I Fundamentals of Computer design- Technology trends- cost- Instruction set principles and examples- classifying instruction set- memory addressing- type and size of operands- addressing modes -operations in the instruction set- instructions for control flow- encoding an instruction set.-the role of compiler. UNIT - II Instruction level parallelism (ILP)- over coming data hazards- reducing branch costs –high performance instruction delivery- hardware based speculation- limitation of ILP. UNIT - III ILP software approach- compiler techniques- static branch protection - VLIW approach - H.W support for more ILP at compile time- H.W verses S.W Solutions. UNIT - IV Memory hierarchy design- cache performance- reducing cache misses penalty and miss rate – virtual memory- protection and examples of VM.



125

UNIT - V Multiprocessors and thread level parallelism- symmetric shared memory architectures- distributed shared memory- Synchronization- multi threading. UNIT - VI Storage systems- Types – Buses - RAID- errors and failures- bench marking a storage device- designing a I/O system. interconnection network media – practical issues in interconnecting networks. TEXT BOOKS 1. Computer Architecture A quantitative approach 3rd edition John L. Hennessy &

David A. Patterson Morgan Kufmann (An Imprint of Elsevier) REFERENCES 1. “Computer Architecture and parallel Processing” Kai Hwang and A.Briggs

International Edition McGraw-Hill. 2. Advanced Computer Architectures, Dezso Sima, Terence Fountain, Peter Kacsuk,

Pearson. 3. Parallel Computer Architecture, A Hardware / Software Approach, David E.

Culler, Jaswinder Pal singh with Anoop Gupta, Elsevier.


126

Syllabus for B. Tech IV Year II Semester Computer Science and Engineering PROFESSIONAL ELECTIVE – III

BIG DATA ANALYTICS Code: 4FC22 L T P C 4 - - 4 Course Objective:

More and more organizations these days use their data a decision supporting tool and to build data-intensive products and services. This course will cover the basic concepts of big data, methodologies for analyzing structured and unstructured data with emphasis on the relationship between the Data Scientist and the business needs. Course Outcomes:

At the end of the course the student will be able to: CO1: Understand big data challenges in different domains including social media, transportation, finance, web and medicine CO2: Analyze scalability and performance of regression model, SVM’s, Time series, PCA and Fuzzy Decision Trees. CO3: Comprehend stream concepts, Architecture, RTAP and Stock Market Predictions. CO4: Understand the Machine learning concepts, Association techniques like Apriori algorithm, k-means Clustering also Clustering Non-Euclidian Space. CO5: Understand Map Reduce, HADOOP, capability of No-SQL systems and Visualization Techniques. CO6: Build Analytics modeling and applications also to understand Industry challenges.

UNIT I

INTRODUCTION TO BIG DATA: Introduction to BigData Platform – Traits of Big data -

Challenges of Conventional Systems - Web Data – Evolution Of Analytic Scalability -

Analytic Processes and Tools - Analysis vs Reporting - Modern Data Analytic Tools -

Statistical Concepts: Sampling Distributions - ReSampling - Statistical Inference - Prediction

Error.

UNIT II

DATA ANALYSIS : Regression Modeling - Multivariate Analysis - Bayesian Modeling -

Inference and Bayesian Networks - Support Vector and Kernel Methods - Analysis of Time

Series: Linear Systems Analysis - Nonlinear Dynamics - Rule Induction - Neural Networks:

Learning And Generalization - Competitive Learning - Principal Component Analysis and

Neural Networks - Fuzzy Logic: Extracting Fuzzy Models from Data - Fuzzy Decision Trees

- Stochastic Search Methods.



127

UNIT III

MINING DATA STREAMS : Introduction To Streams Concepts – Stream Data Model and

Architecture - Stream Computing - Sampling Data in a Stream – Filtering Streams –

Counting Distinct Elements in a Stream – Estimating Moments – Counting Oneness in a

Window – Decaying Window - Real time Analytics Platform(RTAP) Applications - Case

Studies - Real Time Sentiment Analysis, Stock Market Predictions.

UNIT IV

FREQUENT ITEMSETS AND CLUSTERING : Mining Frequent Itemsets - Market

Based Model – Apriori Algorithm – Handling Large Data Sets in Main Memory – Limited

Pass Algorithm – Counting Frequent Itemsets in a Stream – Clustering Techniques –

Hierarchical – K-Means – Clustering High Dimensional Data – CLIQUE And PROCLUS –

Frequent Pattern based Clustering Methods – Clustering in NonEuclidean Space – Clustering

for Streams and Parallelism.

UNIT V

FRAMEWORKS AND VISUALIZATION : MapReduce – Hadoop, Hive, MapR –

Sharding – NoSQL Databases - S3 - Hadoop Distributed File Systems – Visualizations -

Visual Data Analysis Techniques - Interaction Techniques;

UNIT VI:

Systems and Analytics Applications - Analytics using Statistical packages-Approaches to

modeling in Analytics – correlation, regression, decision trees, classification, association

Intelligence from unstructured information-Text analytics-Understanding of emerging trends

and technologies-Industry challenges and application of Analytics

TEXT BOOKS:

1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.

2. AnandRajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge

University Press, 2012.

3. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data

Streams with Advanced Analytics”, John Wiley & sons, 2012.

4. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007

5. Pete Warden, “Big Data Glossary”, O’Reilly, 2011.

6. Jiawei Han, MichelineKamber “Data Mining Concepts and Techniques”, Second Edition,

Elsevier, Reprinted 2008.


128

Syllabus for B. Tech IV Year II Semester

Computer Science and Engineering IMAGE PROCESSING

Code: 4FC23 L T P C 4 - - 4 Course objective: Describe and explain basic principles of digital image processing; design and implement algorithms that perform basic image processing (e.g., noise removal and image enhancement); design and implement algorithms for advanced image analysis (e.g., image compression, image segmentation); assess the performance of image processing algorithms and systems. Course outcomes Students who complete this course will be able to:

1. Analyze general terminology of image processing. 2. Examine various types of images, intensity transformations and spatial filtering. 3. Develop Fourier transform for image processing in frequency domain. 4. Evaluate the methodologies for image segmentation, restoration etc. 5. Implement image process and analysis algorithms. 6. Apply image processing algorithms in practical applications.

UNIT – I Introduction: Examples of fields that use digital image processing, fundamental steps in digital image processing, components of image processing system.. Digital Image Fundamentals: A simple image formation model, image sampling and quantization, basic relationships between pixels UNIT – II Image enhancement in the spatial domain : Basic gray-level transformation, histogram processing, enhancement using arithmetic and logic operators, basic spatial filtering, smoothing and sharpening spatial filters, combining the spatial enhancement methods UNIT – III Image restoration : A model of the image degradation/restoration process, noise models, restoration in the presence of noise–only spatial filtering, Weiner filtering, constrained least squares filtering, geometric transforms; Introduction to the Fourier transform and the frequency domain, estimating the degradation function UNIT– IV Color Image Processing : Color fundamentals, color models, pseudo color image processing, basics of full–color image processing, color transforms, smoothing and sharpening, color segmentation. UNIT – V Image Compression and Morphology : Fundamentals, image compression models, error-free compression, lossypredictive coding, image compression standards, Morphological Image Processing : Preliminaries, dilation, erosion, open and closing, hit or miss transformation



129

UNIT – VI Image Segmentation and Recognition : Detection of discontinuous, edge linking and boundary detection, thresholding, region–based segmentation, Patterns and patterns classes, recognition based on decision–theoretic methods, matching, optimum statistical classifiers TEXT BOOK : 1. Digital Image Processing, Rafeal C.Gonzalez, Richard E.Woods, Third Edition, Pearson Education/PHI. REFERENCE BOOKS :

1. Image Processing, Analysis, and Machine Vision, Milan Sonka, Vaclav Hlavac and

Roger Boyle, Second Edition, Thomson Learning. 2. Introduction to Digital Image Processing with Matlab, Alasdair McAndrew, Thomson

Course Technology 3. Computer Vision and Image Processing, Adrian Low, Second Edition,

B.S.Publications 4. Digital Image Processing, William K. Prat, Wily Third Edition 5. Digital Image Processing and Analysis, B. Chanda, D. Datta Majumder, Prentice Hall

of India, 2003


130

a b c d e f g h i j k l m x x x x x x x x x x


Computer Science and Engineering PROJECT PHASE - II

Code: 4E884 L T P/D C - - 15 12 Pre-Requisites: All Courses till this semester Course Objective:

The project provides an important opportunity for students to plan and carry out a detailed and preferably novel and latest problem and communicate the results It is particularly important that to not just apply what you know, but to apply it with judgment, with the ability to assess what you are doing and to be critical of it. Gain the technical expertise in implementation, interpret and present the results in the form of a dissertation. Course Outcomes: At the end of this project phase II, the student will be able to 1. Identify a topic from the current technical topics of their choice in the computer science

domain and the allied fields, after surveying in the internet resources, journals and technical magazines in the library.

2. Carries out the project work and correspondingly progress of the work is being shown to the internal guides.

3. Arrange the contents of the presentation and scope of the topic, in an effective manner.

4. Present the technical topic he/she chose in front of the panel and the fellow students, using the oratory skills.

5. Answer and justify the questions posed by the panel and the students and answer them.

Out of total 200 marks for project work (in the final year second semester), 50 marks shall be for Internal Evaluation and 150 marks for the External Evaluation at the end of the Semester. External Evaluation of the project (viva-voce) shall be conducted by a committee appointed by the Chief Superintendent. The committee consists of an external examiner, HOD, a Senior Faculty Member and Internal Guide.


131

The pattern of Internal Evaluation is as follows: Division of marks for internal assessment – 50 marks Progress of Project work and the corresponding interim report

as evaluated by internal guides at the end of 5 weeks : 05 Marks Seminar at the end of 5 weeks : 05 Marks Progress of Project work as evaluated by guides

at the end of 10 weeks : 05 Marks Seminar at the end of 10 weeks : 05 Marks Evaluation by the Guides ( at the end of 15 weeks) : 10 Marks Project Report : 05 Marks Final presentation and defense of the project : 15 Marks If the project is conducted internally the marks will be given by Internal Guide himself. Division of Marks for External Evaluation – 150 Marks Pattern of External Evaluation for Project 1. Final Project Report : 30 Marks 2. Presentation : 20 Marks 3. Demonstration / Defense of Project : 100 Marks


132



Computer Science and Engineering COMPREHENSIVE VIVA - III

Code: 4E885 L T P/D C - - - 2 Pre-Requisites: All Courses till this semester Course Objectives : Prepare students in basics of core courses to revise and face technical interviews for enhancing employability. Course Outcomes: 1. Students are assessed in the courses they have undergone till the completion of that

academic year. 2. They are asked to comprehend the concepts in the core subjects and the elective subjects,

to make them ready to face technical interviews which improve their employability skills. There shall be a Comprehensive Viva-Voce in IV year II Semester. The Comprehensive

Viva-Voce will be conducted by a Committee consisting of an External Examiner, Head of

the Department and two Senior Faculty members of the Department.

The Comprehensive Viva-Voce is aimed to assess the students’ understanding in various

subjects he/she studied during the B.Tech course of study till IV Year. The Comprehensive

Viva-Voce is valued for 50 marks by the Committee.

There are no internal marks for the Comprehensive Viva-Voce.


133



Computer Science and Engineering

TECHNICAL PAPER WRITING AND SEMINAR- VIII Code: 4E897 L T P/D C - - 2 1 Pre-Requisites: All Courses till this semester Course Obejectives : Learn to identify, arrange, and present a technical topic to improve communication and soft skills to enhance global employability.

Course Outcomes: At the end of this course, the student will be able to 1. Identify a topic from the current technical topics of their choice in the computer science

domain and the allied fields, after surveying in the internet resources, journals and technical magazines in the library.

2. Arrange the contents of the presentation and scope of the topic, in an effective manner. 3. Present the technical topic they chose in front of the panel and the fellow students, using

the oratory skills. 4. Answer and justify the questions posed by the panel and the students and answer them. There shall be a Technical Paper writing and seminar evaluated for 25 marks in Fourth Year Second Semester. The evaluation is purely internal and will be conducted as follows:



COURSE STRUCTURE AND DETAILED ... - Sreenidhi

Documents

Transcript of COURSE STRUCTURE AND DETAILED ... - Sreenidhi