This action might not be possible to undo. Are you sure you want to continue?

& SYLLABI

for

**Bachelor / Master of Technology (Dual Degree)
**

Computer Science & Engineering

Offered by

**University School of Information Technology
**

1ST SEMESTER TO 8TH SEMESTER

**Guru Gobind Singh Indraprastha University Kashmere Gate, Delhi – 110 403 [INDIA]
**

www.ipu.ac.in

1

Syllabus for B. Tech/M. Tech (dual degree) –CSE program approved in the BOS on 12th Jan, 09 and 26th AC Meeting on 19 th Jan, 09 w.e.f. for batch 2006-07

GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY KASHMERE GATE, DELHI

**Bachelor / Master of Technology (Dual Degree)
**

Computer Science & Engineering

First Semester

First Semester Code Paper ID Theory Papers HS101 98101 BA103 99103 IT 105 15105 IT 107 15107 BA109 99109 BA111 99111 HS119* 98119 Practical/Viva Voce BA151 99151 BA153 99153 IT155 15155 IT157 15157 IT159 15159

*NUES

Paper

L

T/P

Credits

Communication Skills-I Chemistry – I Introduction to Computers Electrical Science Mathematics – I Physics – I Impact of Science & Technology on Society – I Chemistry-I Lab Physics-I Lab Computer Lab Engineering Graphics-I Electrical Science Lab Total

2 2 3 3 3 2 1

1 1 1 1 1 -

3 3 3 4 4 3 1

16

2 2 2 2 2 15

1 1 1 1 1 26

2

Syllabus for B. Tech/M. Tech (dual degree) –CSE program approved in the BOS on 12th Jan, 09 and 26th AC Meeting on 19 th Jan, 09 w.e.f. for batch 2006-07

GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY KASHMERE GATE, DELHI

**Bachelor / Master of Technology (Dual Degree)
**

Computer Science & Engineering

Second Semester

Second Semester Code Paper ID Theory Papers HS102 98102 IT104 15104 BA108 99108 BA110 99110 BA114 99114 BA118 HS126* 99118 98126 Paper L T/P Credits

**IT128 15128 Practical/Viva Voce BA156 99156 BA162 99162 IT152 15152 IT154 15154
**

*NUES

Communication Skills – II Engineering Mechanics Mathematics – II Physics-II Statistics Theory of Probability and Linear Programming Chemistry-II Impact of Science & Technology on Society – II Data Structures Physics –II Lab Chemistry –II Lab Data Structure Lab Engineering Graphics-II lab Total

1 3 3 2 2 2 1 3 17

2 1 1 1 1 1 0 2 2 2 2 15

3 4 4 3 3 3 1 3 1 1 1 1 28

3

Syllabus for B. Tech/M. Tech (dual degree) –CSE program approved in the BOS on 12th Jan, 09 and 26th AC Meeting on 19 th Jan, 09 w.e.f. for batch 2006-07

for batch 2006-07 . Total L T/P C 3 3 3 3 3 3 18 1 1 1 1 1 1 2 2 2 2 2 16 4 4 4 4 4 4 1 1 1 1 1 29 4 Syllabus for B. IT253 15253 Computation Lab.GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY KASHMERE GATE. IT259 15259 DBMS Lab. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. DELHI Bachelor / Master of Technology (Dual Degree) Computer Science & Engineering Third Semester Third Semester Code Paper Paper ID Theory Papers IT201 15201 Computational Methods IT203 15203 Circuits and Systems IT205 15205 Electronic Devices and Circuits IT207 15207 Object Oriented Programming Using C++ IT209 15209 Computer Graphics IT211 15211 Database Management Systems Practical/Viva Voce IT251 15251 Electronic Devices and Circuits Lab. 09 w. 09 and 26th AC Meeting on 19 th Jan. IT257 15257 Computer Graphics Lab. IT255 15255 Object Oriented Programming Lab. Tech/M.f.e.

Switching Theory and Logic Design Lab.e. for batch 2006-07 . 09 w. Tech/M. Tech (dual degree) –CSE program approved in the BOS on 12th Jan.f.GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY KASHMERE GATE. Software Engineering Lab. Multimedia Lab. DELHI Bachelor / Master of Technology (Dual Degree) Computer Science & Engineering Fourth Semester Fourth Semester Code Paper ID Theory Papers IT202 15202 IT204 15204 IT206 15206 MS208 39208 IT210 15210 IT212 15212 Practicals IT252 15252 IT254 15254 IT256 15256 IT258 15258 Total Paper L T/P C Java Programming Multimedia Applications Switching Theory and Logic Design Organization Behaviour Foundations of Computer Science Software Engineering Java Programming Lab. 09 and 26th AC Meeting on 19 th Jan. 3 3 3 3 3 3 18 1 1 1 1 1 1 2 2 2 2 14 4 4 4 4 4 4 1 1 1 1 28 5 Syllabus for B.

09 and 26th AC Meeting on 19 th Jan.f. DELHI Bachelor / Master of Technology (Dual Degree) Computer Science & Engineering Fifth Semester Fifth Semester Code Paper ID IT301 15301 IT303 15303 IT305 15305 IT307 15307 IT309 15309 IT311 15311 Practicals IT351 15351 IT353 15353 IT355 15355 IT357* 15357 Total *NUES Paper Theory of Computation Analog and Digital Communication Computer Architecture Digital Signal Processing Object Oriented Software Engineering Digital Design Using VHDL Analog & Digital Communication Lab. for batch 2006-07 . Summer Training (Conducted at the end of the 4th Semester) Report. Digital Design Lab. 09 w.GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY KASHMERE GATE. Digital Signal Processing Lab. Seminar and Viva . Tech (dual degree) –CSE program approved in the BOS on 12th Jan.e. Tech/M.Voce L 3 3 3 3 3 3 18 T/P 1 1 1 1 1 1 2 2 2 2 14 C 4 4 4 4 4 4 1 1 1 1 28 6 Syllabus for B.

f. Tech/M. for batch 2006-07 . 09 and 26th AC Meeting on 19 th Jan. Compiler Design Lab. 09 w.e. DELHI Bachelor / Master of Technology (Dual Degree) Computer Science & Engineering Sixth Semester Sixth Semester Code Paper ID Theory Papers IT302 15302 IT304 15304 IT306 15306 IT308 15308 IT310 15310 Practicals IT352 15352 IT354 15354 IT356 15356 Total Paper L T/P C Microprocessors Computer Networks Algorithm Analysis and Design Compiler Design Operating Systems 3 3 3 3 3 1 1 1 1 1 4 4 4 4 4 Microprocessor Lab. 15 2 4 2 13 1 2 1 24 7 Syllabus for B.GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY KASHMERE GATE. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Algorithm Analysis & Design Lab.

Tech/M. Seminar and Viva . 09 and 26th AC Meeting on 19 th Jan.f. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. 09 w. DELHI Bachelor / Master of Technology (Dual Degree) Computer Science & Engineering Seventh Semester Seventh Semester Code Paper Paper ID Theory Papers IT401 15401 Advanced Computer Networks IT403 15403 Software Testing Electives (Choose any two) IT405 15405 Distributed Systems IT407 15407 Artificial Intelligence IT409 15409 Simulation and Modeling IT411 15411 Digital Image Processing IT413 15413 Front End Design Tools and Web Technologies IT415 15415 Advanced Java Programming Practicals IT451 15451 ACN Lab.GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY KASHMERE GATE. IT455 15455 Laboratory work for electives IT457 15457 Minor Project IT459* 15459 Summer Training (Conducted at the end of the 6th Semester) Report.e. IT461 15461 Software Testing Lab.Voce Total *NUES L T/P C 3 3 3 3 3 3 3 3 12 1 1 1 1 1 1 1 1 2 2 2 10 4 4 4 4 4 4 4 4 1 1 1 7 1 25 8 Syllabus for B. for batch 2006-07 .

e. L 2 3 3 3 3 3 3 T/P 1 1 1 1 1 1 2 4 C 2 4 4 4 4 4 4 8 2 1 1 22 8 ‘*’ Marked papers are NUES papers. Tech/M. Total number of credits in BTECH(CSE) = 210 The minimum number of credits to be earned for the award of the degree is = 200 9 Syllabus for B. 09 and 26th AC Meeting on 19 th Jan.f. DELHI Bachelor / Master of Technology (Dual Degree) Computer Science & Engineering Eighth Semester Eighth Semester Code Paper Paper ID HS402* 98402 Technical Writing Electives (Choose any two) IT404 15404 Advanced Computer Architecture IT406 15406 Control Systems IT408 15408 Advanced Database Management Systems IT410 15410 Soft Computing IT412 15412 Natural Language Processing IT414 15414 Windows . Tech (dual degree) –CSE program approved in the BOS on 12th Jan. 09 w. for batch 2006-07 . 3.GURU GOBIND SINGH INDRAPRASTHA UNIVERSITY KASHMERE GATE.Net Framework and C# Programming Practicals IT452 15452 Major Project (Report) IT454 15454 Viva – Voce (On major project) IT456* 15456 Seminar and progress report IT458 15458 Laboratory work for electives Total *NUES Note: 1. 2.

for batch 2006-07 . IV. II.Code: HS 101 Paper ID: 98101 I. III. Tech/M. V. appliances (b) Processes and operations (c) Scientific principles Composition: (a) Comprehension – Unseen passages (b) Dialogues – Creation of mock situations. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Prose Selected prose pieces from prescribed texts.f. tools. (c) Debates – Discussing the pros and cons of a given topic. 10 Syllabus for B. 09 w. (d) Thematic Appreciation Exercises / Development of situational outlines.e. Paper: Communication Skills – I L 2 T/P 1 C 1 Remedial Grammar (a) Simple sentences – their phrase structure (b) Parts of speech (c) Tense and concord (d) Gerunds. Participles & Infinitives (e) Complex and Compound sentences (Use of connectives) (f) Conditional clauses (g) Question tags & short responses (h) Common errors Vocabulary and Usage (a) Synonyms & Antonyms (b) One word substitutions (c) Words often confused (d) Idioms / Idiomatic expressions (e) Foreign Phrases (Greek and Latin) Presentation of Technical Information: Technical description of (a) Simple objects. 09 and 26th AC Meeting on 19 th Jan.

Addition. combustion and chemical principles involved in it.Paper Code: BA-103 Paper ID: 99103 Paper: Organic Chemistry L 2 T/P 1 C 3 1. producer gas. colloidal conditioning. Boiled-feed water. their causes and prevention. hardness and its determination (EDTA Method only). Branched. Proximate and ultimate analysis of coal and fuel gas analysis. Mw. Industrial applications of polymers. water-line. cross linked polymers etc. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. caustic embrittlement and corrosion. Different definitions of molecular weight's viz. & bad solvent. good solvents. fuel and fuel gases and their analysis by Orsat's apparatus. Numerical problems of Alkanity. Analysis of water-Alkanity. Numerical on calorific value.e. Cracking of heavy oil residues: thermal cracking and catalytic cracking. sludge priming and foaming. Nuclear reactions. for batch 2006-07 . Ionexchanger polished water. Thermosets. Nuclear Fuels: reactor. conditioning. Gaseous Fuels: Natural gas. solubility parameter. Mn. removal of dissolved gases. Thermoplastics. i) Solid fuels: Proximate and ultimate analysis of coal and their importance. pitting and soil corrosion. Linear. Carbonization: High and Low temperature carbonization. Mv and then determinations. Atmospheric corrosion. parabolic and logarithmic). Corrosion: Definition and types of corrosion. Polymers. 4. Knocking-chemical structure and knocking: Octane and Cetane number and their significance. Calgon treatment. Fuels: Definition and classification. nuclear fission and nuclear fusion. Tech/M. Stress corrosion. hardness Lime-Soda process and EDTA method. solutions viscosity and determination of intrinsic viscosity. coke. its manufacture by the Otto Hoffman Oven and uses. functionality. Nuclear 2. such as monomers. water gas. 09 and 26th AC Meeting on 19 th Jan. removal of silice. Water: Specifications for water. Water-softening-Lime-Soda process. water for domestic use. coal gas and oil gas.f. different theories of corrosion. Petroleum: its chemical composition and Fractional distillation. carburetted water gas. 09 w. Liquid fuels: Converison of coal into liquid fuels (Bogius process & Fischer Tropsch process and mechanism. Protective measures against corrosion: i) ii) iii) iv) v) Modification of environment Modification of the properties of the metal Use of protective coatings Cathodic Protection Material selection and design 11 Syllabus for B. combustion. carbonates phosphates conditioning. condensation and Ionic polymerization's solutions of polymers. ii) iii) iv) v) 3. boiler problems-scale. Power alcohol. Polymers: Basic concepts & Terminology. Calorific value: Gross and Net Calorific values and their determination by Boy's Gas Calorimeter and Bomb Calorimeter. Laws of oxide film 'growth (Linear.

example of loops in C using for. arithmetic operations. bytes. relationship between arrays and pointers. programming examples. world wide web. Paper: Introduction To Computers L 3 T/P 0 C 3 Introduction: Overview of computer organization and historical perspective computer applications in various fields of science and management. 09 and 26th AC Meeting on 19 th Jan. o One dimensional arrays and example of iterative programs using arrays. Tech/M. Binary arithmetic. C primitive input output using getchar and putchar. Concepts of Variables. Array of pointers. Introduction to the Editing tools such as vi or MS-VC editors. fscanf and fprintf routines II. while and do-while. Floating point arithmetic. hex. Argument passing using pointers. relational and logic operations. floppies etc. Concepts of the finite storage. ftp. exposure to the scanf and printf functions. Programming using C: The emphasis should be more on programming techniques rather that the language itself. mini and micro systems. 12 Syllabus for B. bits. o Concept of Sub-programming.f. Defining C structures. contemporary. extension of assignment to the operations. UNIX etc. Introduction to various computer devices such as keyboard. roots of a quadratic equation. Passing arrays as arguments. conditional executing using if. kilo. Dissection of the program line by line. Example of functions. Binary. Use in matrix computations. The C programming language is being chosen mainly because of the availability of the compilers. mega and gigabytes. III. Data representation: Number systems. o File I/O. Introduction to Programming: Concept of algorithms. Concept of sequentially following up the steps of a algorithm. passing strings as arguments. Concepts of character representation. Concept of computing. program statements and function calls from the library (printf for example) o C data types. 09 w. Optionally continue may be mentioned. Object codes. for batch 2006-07 . Flow charts.Notion of program. Introduction to E-mail. char. Data Storage: Primary and Secondary storage. programmability and programming languages. (only brief user level description). signed and unsigned numbers. mouse. o C statements. Introduction to organization and architecture of mainframe.Code : IT105 Paper ID:15105 I. character representation codes. functions. int. Optionally switch and break statements may be mentioned. books and other reference materials. octal codes and their inter conversions.e. o Strings and C string library Structures and Unions. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Use of fopen. login and other network services. MSOffice. Structure of programs. Argument passing mainly for the simple variables. disk files. Example of some simple C program. else. Example of Algorithms such as how to add ten numbers. Windows’95. o Concepts of loops. o C expressions. compilers. Operating Systems such as DOS. o Pointers. float etc. o C assignment statements. 2-d arrays. printers.

Average and RMS values for alternating currents Power and Power factor Resistance. voltage control Speed control of series motors A. VII.Code: IT107 Paper ID: 15107 I. Paper: Electrical Science L 3 T/P 1 C 4 Properties of Conductors and Insulators Basic laws of Electrical Engineering Temperature Resistance Coefficients D. Rheostatic control.C.C. 09 and 26th AC Meeting on 19 th Jan. Tech/M. Generators & Motors Principle of operation Removing Magnetic field Squirrel cage and phase wound rotor Starting of Induction motors Direct on line and Star Delta starters Synchronous machines Transformers Construction Regulation and efficiency calculations Open and short circuit tests II. IV. Generators & Motors Principle of operation of Generators & Motors Speed Control of shunt motors Flux control.C. Dynamometer type D. V. for batch 2006-07 . Circuits Network theorems and applications Division of Current Potentiometer Circuit Parameters Energy and Power Superposition Thevenin and Reciprocity theorems Star Delta Formations Alternating Currents Peak. VI.e. 13 Syllabus for B. III. 09 w.f. Inductance and Capacitance Resonance Q Factor Electromagnetism Magnetic Induction Permeability Hysteresis Measuring Instruments Moving Coil and Moving Iron Instruments Construction of Instruments Attraction and Repulsion type Permanent Magnet and Eletrodynamics. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. VIII.

Tangent. 5. Simple applications to areas. Leibnitz's theorem (without proof). S. Green's theorem. Prentice Hall Publishers. 09 w. Taylor and Meclaurin series. Mc Graw Hill Ed.S. 12 hrs II Vector Calculus: Scalar and vector fields. E. "Calculus and Analytic Geometry". "Advanced Calculus". Grewal B. Mc Graw Hill Ed. Kreyszig. Differentiation under Integral sign. "Integral Calculus". Spiegel. 1985. Thomas and R. 14 hrs (ii) Infinite Series: Convergence. 5 hrs (iii) Integral Calculus: Reduction Formulae of trigonometric functions. 8. Directional Derivative. Method of Lagrange multipliers. Chand & Co. Murray R.e. Shanti Narayan. G. volume. Maxima. 9. 14 Syllabus for B. Cauchy Mean value theorems. Comparison test. normal. Ration Test. S. "Differential Calculus". Exact differentials. 5th Edition. divergence. Taylor's theorem (without proof). 2. Jacobians and transformations of coordinates. 12 hrs Suggested Text Books & References 1. Shanti Narayan. Differentiation of Implicit functions. 09 and 26th AC Meeting on 19 th Jan. "Theory and Problems of Vectors Analysis". Schaum's Outline Series. Beta-Gamma functions.Paper Code: BA-109 Paper ID: 99109 1(a) Paper : Mathematics – I L 3 T/P 2 C 4 Calculus of functions of One variable (i) Successive Differentiation. Asymptotes. Definition of improper integrals. Cauchy nth root test. divergence and curl of a vector field. Khanna Publ. Curves. Divergence theorem and Stoke's theorem (without proofs). Tech (dual degree) –CSE program approved in the BOS on 12th Jan. "Advanced Engineering Mathematics". Absolute and Conditional Convergence. Properties of definite Integral.. Gradient of scalar field. Line integral (independent of path). Radius of Convergence. surface of revolution. Chand & Co. "Advanced Calculus". Minima and saddle points.L. 1985. Tech/M. Wiley Eastern Ltd. Lagrange's Theorem. Volumes etc.C. S. Wiley Eastern. Applications to length. 2nd Edition. Schaum's Outline Series. 6. Arc length. Leibnitz's test (without proof). Surface Integrals. Curve Tracing. Chain rule. 6th edition. Double and Triple integrals. 7. "Higher Engineering Mathematics". 4. Widder. Finney.f. Curvature. "Mathematical Analysis".B. for batch 2006-07 . area. Remainder term. Malik. 3. Power Series. 8 hrs 1(b) Calculus of Functions of several variables: Partial derivatives. AddisonWesley/Narosa.

types of optical fibres and their characteristics. principle of fibre optic communication-total internal reflection. Beiser 2. Concepts of Modern Physics: A. Laurent half shade polarimeter. narrow slit. Recommended Books 1. semiconductor laser. Fibre Optics: Introduction to optical fibre. 5 hrs. diffraction grating wavelength determination. II LASER AND FIBRE OPTICS Lasers Introduction. double refraction. 5 hrs. quarter-wave and half-wave plates. Michelson's interferrometer. specific rotation. Tech/M. optical activity.e.Paper Code: BA-111 Paper ID: 99111 Paper: Physics – I L 2 T/P 1 C 3 I OPTICS Polarization Types of polarization. the postulates of the special theory of relativity. holography-theory and applications. Fabry Perot interferrometer) 7 hrs. Michelson-Morley experiment. coherence. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Fundaments of Optics: Jenkins and White 4. interference by division of amplitude (thin films. interference by division of wave front (young's double slit experiment. III Theory of relativity Absolute and Inertial frames of reference. elliptically and circularly polarized light Brewsters law. for batch 2006-07 . circular aperture and N-slit. Galenlian transformations. Fundamental of Physics by RESNICK & HALLIDAY 15 Syllabus for B.f. length contraction. 7 hrs. Einstein A and B coefficients. He-Ne laser. mass energy equivalence. basic principle and operation of a laser. 09 and 26th AC Meeting on 19 th Jan. Diffraction (Fresnel and Fraunhofer types of diffraction) Fraunhofer difraction: Single slit. circular aperture. Optics: Ghatak 5. opaque circular disc. 5 hrs. type of lasers. double slit. Lorentz transformations. numerical aperture. Ruby laser. fibre optical communication network (qualitative)-its advantages. Newton's rings. Interference Coherence and coherent sources. population inversion. velocity addition. Malu's law. 09 w. Fresnel's biprism). time dilation. 5 hrs. resolving power and dispersive power. Fresnel Diffraction: Zone plate. Nicol prism. Modern Physics: Kenneth Krane 3. (Attenuation and dispersion step index and graded index fibres.

Planes Other than the Reference Planes Introduction of other planes (perpendicular and oblique). Paper: Chemistry – I Lab. Lettering. 5.Practicals: Code: BA151 Paper ID:99151 Practicals based on BA103. Specifications. inclinations. Projection of Solids Simple cases when solid is placed in different positions. Dimensioning. Nomography Basic concepts and use. Projections of Points and Lines Introduction of planes of projection. 4.S. Significance and scope of engineering drawing. faces and lines lying in the faces of the solid making given angles. Scales. Sense of proportioning. 3. L 0 T/P 2 C 1 Paper: Computer Lab. projections of points and lines lying in the planes. 7. Axis. projections on auxiliary planes. Paper: Physics– I Lab. 09 and 26th AC Meeting on 19 th Jan. inclinations etc. Tech/M. L 0 T/P 2 C 1 L Paper: Engineering Graphics –I 0 T/P 2 C 1 General Importance. their traces. and true lengths of the lines. 2.. Reference and auxiliary planes. Development of Surface Development of simple objects with and without sectioning. Code: IT157 Paper ID:15157 1. 6. Projections of Plane Figures Different cases of plane figures (of different shapes) making different angles with one or both reference planes and lines lying in the plane figures making different given angles (with one or both reference planes).f.I. traces. Different types of projections.e. projections of points and lines in different quadrants. conversion of oblique plane into auxiliary plane and solution of related problems. for batch 2006-07 . L 0 T/P 2 C 1 Code: BA153 Paper ID:99153 Practicals based on BA109. 09 w. shortest distance intersecting and non-intersecting lines. Obtaining true shape of the plane figure by projection. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Orthographic projections. 16 Syllabus for B. B. Code: IT155 Paper ID:15155 Practicals based on IT105.

Paper: Electrical Science Lab. L 0 T/P 2 C 1 17 Syllabus for B.Code: IT159 Paper ID:15159 Practicals based on IT107. 09 and 26th AC Meeting on 19 th Jan. 09 w. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Tech/M.f.e. for batch 2006-07 .

brevity. barriers to communication. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. tone. punctuation and spelling. reading between the lines.e. and argumentative pieces. Listening Comprehension: Achieving ability to comprehend material delivered at relatively fast speed. 4.Code: HS102 Paper ID:98102 Paper: Communication Skills – II L 1 T/P 2 C 3 1. Some Key Concepts: Communication as sharing. Group Discussion: Use of persuasive strategies including some rhetorical devices for emphasizing (for instance. for relaxation. use of body language). being polite and firm. for batch 2006-07 .f. 18 Syllabus for B. variety in sentences and paragraphs. turn-taking strategies and effective intervention.. 5. use of charts. making a short classroom presentation. Tech/M. 09 and 26th AC Meeting on 19 th Jan. paragraph division. fast. formal report. 09 w. manipulating paralinguistic features of speaking (voice quality. 3. expressing ideas within a restricted word limit. the speaker/writer and the listener/reader. clarity and appropriateness in communication. context of communication. listing reference material. etc. 2. Reading Comprehension: Reading at various speeds (slow. reading different kinds of texts for different purposes (e. pausing for effectiveness while speaking. for information. introduction and the conclusion. graphs and tables. medium of communication. accuracy. etc. Speaking: Achieving desired clarity and fluency. 6. descriptive. summarizing and abstracting.g. comprehending spoken material in Standard Indian English. task-oriented. very fast). modifiers and modals. Writing: Selecting material for expository. interpersonal. intelligent listening in situations such as an interview in which one is a candidate. informal and semiformal speaking. business letters. pitch.). semantics of connectives. for discussion at a later stage. handling questions and taking in criticism of self.). British English and American English.

Friction: Static and Kinetic friction. Text/Reference: 1. radius of gyration. Kinematics of Rigid Bodies: Concept of rigid body. Vibrations: Classification. Equilibrium: Force body diagram. resolution of force into force and a couple. friction of flat pivot and collered thrust bearings. 2. derivation of equation. 5. Varigon’s theorem. couple. Pappus theorems. Tech/M. Jindal. co-efficient of friction. translatory motion and fixed axis rotation. angle of friction. Galgotia Publication. 8. plane curvilinear motion-rectangular coordinates. Paper: Engineering Mechanics L 3 T/P 1 C 4 Force System: Introduction. 7. Dynamics. 4. laws of dry friction. angle of repose. work energy equation.f. 3. cone of friction. 10. loss of energy during impact. 9. rectilinear motion and curvilinear motion. resultant of a force system. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. principle of transmissibility of force. properties of couple and their application to engineering problems. equations of equilibrium and their applications to engineering problems. 09 w. equilibrium of two force and three force member Structure: Plane truss. friction in screws. Kinematics of Particles: Rectilinear motion. impact of bodies. relative acceleration (Corioli’s component excluded) and instantaneous center of zero velocity.e. U.. Distributed Forces: Determination of center of gravity. Velocity and acceleration polygons for four bar mechanism and single slider mechanism. 19 Syllabus for B. impulse and momentum conservation of momentum. force. Spring mass system-its damped (linear dash pot) and undamped free vibrations.C. polar moment of inertial. frictional lock. Kinetics of Rigid Bodies: Equation of motion. center of mass and centroid by direct integration and by the method of composite bodies mass moment of inertia and area moment of inertia by direct integration and composite bodies method. “Engineering Mechanics”. normal and tangential coordinates Kinetics of Particles: Equation of motion. simple problems. analysis of perfect plane trusses by the method of joints. absolute motion. assumption in the truss analysis. types of rigid body motion.2000. torsional free vibrations-single rotor and two rotor system. conservation of energy. method of section and graphical method. spring in series and parallel.Code: IT104 Paper ID:15104 1. 09 and 26th AC Meeting on 19 th Jan. introduction to relative velocity. parallel axis theorem. moment of force about a line. for batch 2006-07 . co-efficient of restitution. 6. friction in journal-bearing. perfect and imperfect truss. resolution of a force. application of work energy principles to rigid bodies conservation of energy. T1 / T2 = λe A and its application.

Bilinear. Probability: Definition of Sample Space. Bessel’s equation. IV. 9. Schaum Outline Series “Differential Equations” Mc. Thomas and R. Cauchy’s Integral Formula. Ordinary Differential Equations: Formation of ODE’s. Chand & Co. M. Event Space. Chand & Co. Legendre’s Equation. 5. III. Suggested Text Books & References 1. rank of a matrix. 18 hrs. Power series method of solution of DE. G. Singhal & Asha Singhal “Algebra”. Residue Theorem. Limits. 09 and 26th AC Meeting on 19 th Jan. Schaum Outline Series “Complex Variables” Mc. method of undetermined coefficients and variation of parameters. Legendre’s Polynomials. Residues. Graw Hill. ODE’s of first order: Method of separation of variables. Analytic Function. for batch 2006-07 . linear equations and Bernouilli equations. Conformal Mapping.Mathematics . 2. operator method. Derivatives of Analytic Function. Complex Variables: Curves and Regions in the Complex Plane. Derivative. exactness and integrating factors. Linear Fractional Transformations. Graw Hill. Linear Algebra: Linear Independence and dependence of vectors. R. Baye’s Law theorem. definition of order. M. Taylor Series. 20 Syllabus for B. Bessel’s function. Quadratic. degree and solutions. Singularities. II. Shanti Narayan. 8. 3. 4. K. 09 w. Cauchy-Riemann Equations. operator method. E. Co. 1985. B. diagonalization of a matrix. Zeroes. Solutions of simple simultaneous ODE’s. “Matrices” S. 7. “Advanced Engineering Mathematics”. Application based on these results. Laplace’s Equation. L.e. Tech/M. Cayley – Hamilton Theorem (without proof). Analyticity at Infinity. Gauss elimination method. Graw Hill. Additive and Multiplicative law of Probability. Methods for obtaining Power Series. homogeneous and nonhomogeneous equations. Cauchy’s Integral Theorem. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Finney. “Calculus and Analytic Geometry” Addison Wesley / Narosa. N. Kapoor “Differential Equations” Pitamber Pub. method of undetermined coefficients and nonhomogenous. Kreyszig. Power Series.f. Wiley Eastern Ltd. 10 hrs. Evaluation of Real Integrals. 10 hrs. Eigenvalues and Eigenvectors of a matrix. 6. Complex Line Integral. Complex Functions. Skew – Hermitian Forms. 5 hrs.II Paper Code: BA – 108 L 3 T/P 1 Credits 4 I. Laurent Series. Conditional Probability. Graw Hill. 5th Edition. Schaum Outline Series “Probability” Mc. Systems of linear equations – consistency and inconsisitency. Schaum Outline Series “Linear Algebra” Mc. Event. Hermitian.

the unbiased diode. conditions at a Boundary Surface. Tech/M. Fermi energy and average energy – its significance. Quantum Statistics The statistical distributions: Maxwell Boltzmann. effective mass. The Schrodinger wave equation (1 – dimensional). 4 hrs. simple Eigen value problems – solutions of the Schrodinger’s equations for the free particle. photo diode its characteristics. Fermi-Dirac distribution. zero point energy. evidences for the wave nature of matter – the experiment of Davisson and Germer. 6 hrs. the finite well. deBroglie waves. Brillouin zones. physical interpretation of the wave function and its properties. free electron theory. III Band Theory of Solids Origin of energy bands in solids.e. Ferminos and Bosons Applications: Molecular speed and energies in an ideal gas. simple harmonic oscillator (qualitative). the infinite well. LED. Introduction to transistors. Bose-Einstein and FermiDirac statistics. motion of electrons in a periodic potential – the Kronig – Penny model. electron diffraction. Inconsistency in ampere’s law Maxwell’s Equations. electronic specific heats. II. 09 w.f. T/P 1 Credits 3 Quantum Mechanics Wave particle duality.II Paper Code: BA – 110 L 2 I. the failure of classical statistics to give the correct explanations – the applicatons of Bose-Einstein statistics to the Black body radiation spectrum. 10 hrs. their comparisons. IV Overview of Electro – Magnetism Maxwell’s Equations: The equation of continuity for Time – Varying fields. tunneling effect. Introduction to EM wave. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. the uncertainty principle 4 hrs. 10 hrs. metals. 09 and 26th AC Meeting on 19 th Jan. The Black body spectrum. the p-n junction (energy band diagrams with Fermi energy). doping – Fermi energy for doped and undoped semiconductors. semiconductors and insulators and their energy band structures. forward and reverse biased diodes – tunnel diodes. 21 Syllabus for B.PHYSICS . expectation values. the wave packet. Eigen values and Eigen functions. zener diode. Extrinsic and Intrinsic semiconductors. for batch 2006-07 .

2. 4. 5. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Concept of Modern Physics: A. Beiser Modern Physics: Kenneth Krane Solid State Physics by Kittle Electronic Principles: Malvino Statistical Mechanics by Garg Bansal and Ghosh (TMH) 22 Syllabus for B. Tech/M. for batch 2006-07 .Recommended Books 1. 3.f. 09 and 26th AC Meeting on 19 th Jan. 09 w.e.

Poisson and Normal distribution. Mc Graw Hill Hadley. Expectation. Method of least square for linear and parabolic curves. Linear regression. “Mathematical Programming Techniques”. Freund. Irwin Miller and John E. Gupta and V. Binomial. 09 and 26th AC Meeting on 19 th Jan. properties of regression coefficient. “Linear Programming” Narosa Publications. distribution and density functions. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. F-test. Correlation of a bivariate distribution. 2. “Probability and Statistics for Engineers” PHI Spiegel. Suggested Text Books & References 1. Sampling distribution of mean and variance. 09 w. Application to Transportation and Assignment Problems. 23 Syllabus for B. “Probability and Statistics”.f.STATISTICS. II. Schaum Series S C. THEORY OF PROBABILITY AND LINEAR PROGRAMMING Paper Code: BA – 114 L 2 I. Tech/M. Kurtosis. Dual problem formulation and Solution. K. Random Variables: discrete and continuous. Moment Generating function.e. Kapur “Fundamentals of Mathematical Statistics”. 5. Formulation of the Problem and Solution by Graphical method. Statistics T/P 1 Credits 3 Elementary Probability theory. 4. 17 hrs. 3. Moments. Probability. for batch 2006-07 . Testing of Statistical hypothesis. The simplex Method. Linear Programming Mathematical Preliminaries.. S. Sultan Chand & Sons. Kambo N. Skewness. 17 hrs. T-test and chi square test.

Long form of periodic table on the basis of Electronic configuration s. d. characteristics of covalent compound. Linear combination of atomic orbitals (LCAO) method. Phase rule: Derivation of phase rule. lattice energy Born Haber Cycle. effect of temperature on heat of reaction at constant pressure (Kirchoff’s Equation) heat to dilution. Atomic Structure: Introduction to wave mechanics. Potential energy curve for H2 molecule. f block elements periodic trends. 4. Equilibrium constant and reaction rates-Lindermann. A hybridization and resonance. Discussion of structures of H2O. Catalysis: Criteria for Catalysis-Homogeneous Catalysis. heat of hydration. Industrially important process. Interionic attraction theory. co-ordinate bond-Werner’s Theory. O2. reversible and parallel reactions-Steady state and non-steady state approach. collision and activated complex theories. Kohlrausch’s Law of in-dependent migration of ions. Structure of simple homo nuclear diatomic molecule like H2. 3. Physiosorption. 09 w. 6. energy changes. Catalysis by metal salts.f. effective atomic numbers. for batch 2006-07 . Flame temperature. F2. Reaction Kinetics: Significance of rate law and rate equations. 7.e. heat of neutralization and heat of combustion. order and molecularity. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Enzymatic catalysis. Electron Chemistry: Conductance of electrolytic solutions transference number and its determination. interpolations of two component system diagrams. 2. Chemisorption. Tech/M. complex reactions of 1 st order characteristics of consecutive. BrF3. Theories of catalysis. atomic and ionic radii electron affinity & electro-negativity. Chemical Bonding: Ionic bond. 5. Ionisation potential. Determinations of order of simple reactions-experimental method. the Schrodinger equation as applied to hydrogen atom. origin of quantum numbers. NH3. Thermochemistry: Hess’s Law. Valence Shell Electron Repulsion theory (VSEPR). Covalent bond-energy changes. inhibitors and poisoning. SiF4. 09 and 26th AC Meeting on 19 th Jan. acid-base. Significance of various terms involved in the definitions phase diagram of one competent system miscibility.CHEMISTRY – II Paper Code: BA – 118 L 2 T/P 1 Credits 3 1. heat of reaction. Molecular orbital theory. N2. Heterogeneous catalysis – concept of promoters. activity and activity coefficient of strong electrolytes. Suface area. p. 24 Syllabus for B.

Unit – 2: Trees. F. E .: IT 128 PaperID: 15128 Paper: Data Structures L 3 T/P 0 C 3 Unit – 1: Introduction to programming methodologies and design of algorithms. Unit – 3: Multiway trees. array. linked list collision resolution).H . array organization. Leiserson. Unit – 4: Sorting concept. Binary trees.f. Binary Tree traversal.V. Hopcroft. PHI/Pearson. Graph Traversal. D . Tree manipulation algorithms.e. B* and B+ Trees. Properties of Trees. Selection sorts (straight. Reference [2] S. hashing concepts. J . A. collision resolution (by open addressing: linear probe. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. J . 25 Syllabus for B. insertion sort (Straight Insertion. quadratic probe. Prefix. binary search trees. Gilberg. R . hashing methods (Direct. [4] T . Forouzan. [5] V . double and circular lists. [6] Ellis Horowitz and Sartaz Sahani “Fundamentals of Computer Algorithms”. Stack Manipulation. Heaps and their implementation. modulodivision. pseudorandom hashing). Bucket hashing. Rivest “Introduction to Algorithms”. Thomson Learning. Pearson Education. C . Text: [1] [2] R. Shell sort). 2-3 trees. Galgotia Publications. Exchange Sort (Bubble. quicksort). Graph representation. midsquare. A . Cormen. General Lists and List ADT. B-Trees. [3] Tanenbaum: “Data Structures using C”. folding. Sahni and E. Pearson/PHI. “Data structures: A Pseudocode approach with C”. binary search. Horowitz. order. stability. Stacks and Stack ADT. “Data Structures”. E . AVL Trees. their interconversion and expression evaluation. Computer Science Press. heap). Tech/M. Manber “Introduction to Algorithms – A Creative Approach”. Queue manipulation. Queues and Queue ADT. List manipulations. sequential search. sparse array. infix and postfix expressions.Code No. 09 w. Searching – List search. Pearson Education. Aho. Abstract Data Type. Expreession trees and their usage. 09 and 26th AC Meeting on 19 th Jan. Ulman “Data Structures and Algorithm”. Single. subtraction. Graphs. 2-3-4 trees. pseudorandom collision resolution. for batch 2006-07 . and B.L . Merge sort (only 2-way merge sort).

Tech/M. Dimensioning exercises. glass-box concept. isometric drawing. isometric and oblique projections. Code: IT152 Paper ID:15152 Practicals based on IT128. 09 and 26th AC Meeting on 19 th Jan. principles of sectioning. L 0 T/P 2 C 1 Paper: Data Structure Lab. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. 3. 4. orthographic. Shape Description (External) Multiplanar representation in first. Size and location dimensions. 2.0 T/P 2 C 1 Basic Concepts I. L 0 T/P 2 C 1 Code: BA162 Paper ID:99162 Practicals based on BA118.e. rules of printing. isometric scale. precedence of lines. sketching of orthographic views from pictorial views. drawing sheet lay-out. conventional practices. kinds of line. Shape Description (Internal) Importance of sectioning. Code: IT154 Paper ID:15154 Paper: Chemistry– II Lab. line symbols.Practicals: Code: BA156 Paper ID:99156 Practicals based on BA110.and third angle systems of projections. Missing line and missing view exercises. Technical sketching. cutting plane representation. Paper: Physics– II Lab. 26 Syllabus for B. 09 w. 5.f. L 0 T/P 2 C 1 L:0 Paper: Engineering Graphics Lab. section lines. tools of dimensioning. drawing conventions. types of sections. Sketching of pictorial (isometric and oblique) views from Multiplanar orthographic views. Principles of conventions of dimensioning. preferred scales. 6. Size Description Dimensioning. Reading exercises. Projections Perspective. Computer Aided Drafting Basic concepts and use. S. for batch 2006-07 .

[8] J. Iterative Methods. Runge – Kutta – Fehlberg method. [7] J. [10] W. T. It should be of 20 marks. Text: [1] D. Yang. Thomson/Brooks-Cole. Stoer and R. 1999. F. Riemann – Integrable Functions. 2. Hoffman. Kincaid and W. “Numerical Recipes in C”. Tech/M. Springer – Verlag. Lagrange Form. Antia. Cao. Prautzch. Mathews and K. Unit – 3: Linear System of Equations: Conditioning. 1. T. “Numerical Analysis”. Chung and J. Every unit should have two questions. [5] J. [6] S. Paper: Computational Methods L 3 T 1 C 4 Maximum Marks : 60 Question No. Cholesky Factorization. Cheney. 1994 [12] H. Hyperbolic and Elliptic PDEs. 2001. Bulirsch. Review of Taylor Series. Press. Interpolation and Approximation. Morris. However. Flannery. D. Apart from Question No. “Numerical Methods for Engineers and Scientists”. Each question should be 10 marks Unit – 1: Errors in computation. This question should have objective or short answer type questions. Power Method Approximation by Spline Function: 1st and 2nd Degree Splines. [4] W. Pivoting. rest of the paper shall consist of four units as per the syllabus. Nested Form. Taylor series method of higher orders. Adas – Bashforth – Moulton Formula. “Applied Numerical Analysis”. Loss of Significance in Computation. and B. H. Vetterling. and P. S. Unit – 2: Interpolation and Numerical Differentiation: Interpolating Polynomial. A. “Numerical Analysis: Mathematics of Scientific Computing”. Wheatly. Romberg Algorithm. student may be asked to attempt only 1 question from each unit. 2002. 2005. L. Y. [3] R. Printice Hall. Golden Section Search and Newton’s method. “Numerical Methods for Scientists & Engineers”. Traezoid Rule. “Elementary Numerical Analysis: An Algorithmic Approach”. 1980. de Boor. Gerald. Natural Cubic Splines.Mead Algorithm. 2002.. “Numerical Methods”.. P. Gauss Elimination. Inverse Interpolation. 09 w. Thomson/Brooks-Cole. Hindustan Book Agency. Gaussian Quadrature Rule. 2001. “Numerical Methods Using Matlab”. Marcel Dekker Inc. W. CUP.-S. Implementation to be done in C/C++. “Applied Numerical Methods Using Matlab”. Neville’s Algorithm. McGraw Hill. Representation of numbers (integers and Floating Point). Estimating Derivatives and Richardson Extrapolation. Kincaid and W. 2002. M. 1993.Paper ID: 15201 Paper Code: IT201 INSTRUCTIONS TO PAPER SETTERS: 1. Universities Press. Cheney. [11] C. 1991. Reference: [2] D. Pearson. Teukolsky. Boehm and H. B Splines. Solution of Parabolic. Conte and C. Newton Form. Simpson’s Scheme. for batch 2006-07 . 09 and 26th AC Meeting on 19 th Jan.e. “Numerical Analysis”. Nelder. 2005. H. Mean Value Theorem. “Introduction to Numerical Analysis”.f. 1 should be compulsory and cover the entire syllabus. Thomson/Brooks-Cole. Unconstrained one variable function minimization by Fibonnaci search. W. Location of Roots of functions and their minimization: Bisection method (convergence analysis and implementation). 27 Syllabus for B. D. [9] W. Rubge – Kutta method of order 2 and 4. Numerical Integration: Definite Integral. Errors in interpolation. D. O. Wiley. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Fink. Unit – 4: Differential Equations: Euler method. Secant Method (convergence analysis and implementation).. Faires. Newton Method (convergence analysis and implementation). D. Burden and J. Multivariate function minimization by the method of steepest descent.

“Linear Circuit Analysis”. [5] H. Cauchy Theorem. Bridge Circuits. Taylor and Laurant Series. Transient Response. Unit – 2: Signals. Residue Theorem. A. Y . Current Ideal Current Sources. Unit – 3: Circuits: Voltage.e. [7] S. Systems. Classification of Systems. “Signal and Systems”. Mesh Analysis. P. Lathi. Classification of Circuits. 1998. However. Y . Nodal Analysis. Maximum Power Transfer Theorem. “Signal Processing and Linear System”. Algebra of Complex Numbers. “Circuits”. Passive Filters. Kirchhoff’s Voltage and Current Law.Y Transformation. 1995. Ghosh. It should be of 20 marks. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Thevenin’s and Norton’s Theorem.Y Transformation. Laplace Transform and Continuous Time LTI systems. Fourier Series and Transform (Continuous and Discrete) and their properties. “Signals and Systems”. Colour Codes. McGraw-Hill. Internal Resistance. McGraw-Hill. student may be asked to attempt only 1 question from each unit. Haykin and B. 2007. “Circuit Analysis: Theory and Practice”. for batch 2006-07 . Phasors. Two port Networks. Every unit should have two questions. 1988. V. 1. 09 and 26th AC Meeting on 19 th Jan. Unit – 4: AC Circuits: Circuits containing Capacitors and Inductors. Veen. 2003. State Space Analysis. Thevenin’s and Norton’s Theorem. Poornachandra. Bridge Circuits. A. “Schaum’s Outlines of The Theory and Problems of Signals and Systems”. Millman’s Theorem. Functions of Complex Variable. Reference: [4] S. 09 w. Impedences and Admittance. Linear Time Invariant (LTI) Systems. This question should have objective or short answer type questions. [9] M. Resonant Circuits. Thomson Learning/Delmar Pub. B. Berkeley Cambridge Press. Robbins and W. Resistor Power Absorption.∆ and ∆. Differentiation. 2000. Ideal Voltage Source. Edminister. John Wiley and Sons. Laplace Transform. Thomson Learning. Superposition Theorem. Thomson/Brooks-Cole. Fourier analysis of signals and systems. Nodal Analysis. Integration. A. Apart from Question No. Mesh Analysis. Prentice Hall. Ohm’s Law. Text: [1] [2] [3] B. 28 Syllabus for B. Nahvi and J. Alternating Current and Voltages. Nominal Values and Tolerances. rest of the paper shall consist of four units as per the syllabus. Resistively.f. Paper: Circuits and Systems L 3 T 1 C 4 Maximum Marks : 60 Question No. 1999. 2004. [6] S. Loop Analysis. “Signal and Systems”. “Schaum’s Outline of Theory and Problems of Electric Circuits”.∆ and ∆. DC Circuits: Series and Parallel Circuits. Hsu. Complex Frequency and Network Function. Pearson Education. Open and Short Circuits. 1 should be compulsory and cover the entire syllabus. z-Transform and Discrete Time LTI systems. Classification of Signals. P. Resistors. Temperature Effect.Paper ID: 15203 Paper Code: IT203 INSTRUCTIONS TO PAPER SETTERS: 1. Each question should be 10 marks Unit – 1: Review of complex variables: Complex Numbers. Tech/M. Miller. Madhu. 2. Loop Analysis. H. 2006. z-Transform. C. [8] S. Carlson..

However. 4. varactor diode. Bond. 7. B. UNIT – 2: Transistors and Biasing Construction.L. Roden. Text/References: 1.f.Paper ID: 15205 Code No: IT205 INSTRUCTIONS TO PAPER SETTERS: 1. barkhausen criteria for sinusoidal oscillators.R. Malvino. 6. TMH. operational amplifiers and its applications. characteristics and working principles of semi conductor diodes: PN junction diode. Laser diode. Theory & Technology & Semiconductor Devices. TMH. operation of NPN & PNP transistor. student may be asked to attempt only 1 question from each unit. photo diodes. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. schottky diode. Apart from Question No. zener diode. P. TMH(ISE) 8. 09 and 26th AC Meeting on 19 th Jan. 2007. UNIT – 3: Field Effect Transistor Classification of FET’s. Boylestad. B. construction & working principles of JFET. methods of transistor biasing and stabilization. Electronic Devices & Integrated Circuits. for batch 2006-07 . Shroff Publisher & Distributors. Types of configurations. MOSFET. Singh and R. Salivahanan & other. “Electronic Design”. characteristics. “Prntice Hall of India. Jacob Millman. Electronic Devices and Circuits. Streetman. 1 should be compulsory and cover the entire syllabus.e. 2. Every unit should have two questions. Oscillators Concept of Feedback. B. This question should have objective or short answer type questions. small signal model parameters. G. “Principles of Electronic Circuits. Electronic Principles. 2. phase shift oscillators. 09 w.S. “Electronic Devices and Circuit Theory”. It should be of 20 marks. 3. Paper : Electronic Devices & Circuits L 3 T 1 C 4 Maximum Marks : 60 Question No. Carpenter & W. biasing methods. 1. J. TMH.G.Wieseraman. Burns. 10.. 2006. Jain. Electronic Devices & Circuits. Singh. M. 9th Ed. G. Light emitting diode. 9. rest of the paper shall consist of four units as per the syllabus. Galgotia 5. Micro Electronics. 29 Syllabus for B. Tech/M. Each question should be 10 marks UNIT – 1: Semiconductor diodes and their applications Construction. S. 2nd Ed. P. Pearson. Kumar and S.R. wein bridge & crystal oscillator. S. UNIT – 4: Linear Integrated Circuits Differential amplifier circuits. Millman & Halkias Electronic Devices & Circuits.

relating to other paradigms (functional. exception handling. Apart from Question No. 30 Syllabus for B. default parameter value. Unit – 2: Encapsulation. “Objected Oriented Programming with C++”.Cummings.PaperID:15207 Code: IT207 1. Paper : Object Oriented Programming using C++ L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 Question No. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. streams. Text: 1. 3. Class hierarchy. A. al. TMH 4. run time polymorphism. E. “C++ Primer”. “ Object Oriented Modelling & Design”. overriding inheritance methods. object types. state identity and behavior of an object.BPB Publication. operator overloading. Prentice Hall 2. manipulators. namespaces. delete operators. strings. B. This question should have objective or short answer type questions. Rumbaugh et. 09 w. Steven C. new. 2. 1 should be compulsory and cover the entire syllabus. 3rd Edition. “Object Oriented Programming with C++”. aggregation. constructors and destructors. iterators and allocators. Lajoie. generic classes. polymorphism. R. Galgotia. Review of C. Unit – 4: Standard C++ classes. generic function – template function. 5. standard containers. methods. information hiding. data decomposition). derivation – public. parametric polymorphism. Benjamin. function name overloading. 2000. rest of the paper shall consist of four units as per the syllabus. G . basic terms and ideas (abstraction. using multiple inheritance. However. student may be asked to attempt only 1 question from each unit. “Object Oriented Programming using C++”. method polymorphism.f. abstract data types.e.Venugopal. Vikas Publication. S. polymorphism). persistant objects. generalized numeric algorithm. vectors. polymorphism by parameter. private & protected. Every unit should have two questions. streams and files. It should be of 20 marks. metaclass/abstract classes. standard template library: Library organization and containers. Each question should be 10 marks Unit – 1: Objects. Ravishanker “Mastering C++”.R. inheritance. cout. T. encapsulation. C++ garbage collection. 2. cin. Lawlor. D . 6. Tech/M. Booch “Object Oriented Design & Applications”. Rajkumar. valarray. C++ class declaration. dynamic memory allocation. attributes.Balaguruswamy. Lafore. Parasons. slice. algorithm and Function objects. for batch 2006-07 . categorization of polymorphic techniques. user defined manipulators. composition vs classification hierarchies. TMH References: 1. instantiation of objects. difference between C and C++. “The Art of Programming Computer Science with C++”. object & classes. 1. Lippman & J. Addison Wesley. 09 and 26th AC Meeting on 19 th Jan. Unit – 3: Inheritance.

Shamos. Graphics Hardware: Hardcopy & display techniques. ellipses. algorithm for curve surfaces. However. “Advanced Animation and Rendering Techniques”. 09 w. McGraw Hill Book Company. student may be asked to attempt only 1 question from each unit. Beatty and B. Bartels. Gouraud & Phong shading techniques. It should be of 20 marks. 1985. Apart from Question No. SpringerVerlag New York Inc. David F. Each question should be 10 marks Unit – 1: Basic raster graphics algorithms for drawing 2 D Primitives liner. Prentice Hall.Geometric Transformation: 2D. Hearn and P. Geometric & multi-pass transformation mechanisms for image storage & retrieval. Adams. Visible surface determination techniques for visible line determination. R. Solid modeling. References: 1. volume rendering.H. AWL. W. acromatic and color models. visible surfaces ray-tracing. Tech/M. rest of the paper shall consist of four units as per the syllabus. “Principles of Interactive Computer Graphics. Morgan Kaufmann Publishers Inc. algorithm for oct-tres. McGraw-Hill. radio-city methods. Unit – 4: Elementary filtering tech. 3D transformations. fractals. image scanners Unit – 3: Shading Tech: Transparency.C. Every unit should have two questions. “Procedural Elements for Computer Graphics”. 2. D. 3. Barsky. 1989.P. “Computer Graphics”. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. “Theory and Problems of Computer Graphics”. Baker.I. Shadows. 7. 31 Syllabus for B. This question should have objective or short answer type questions. clipping circles. cubic & surfaces. recursive ray tracing.. Schaum’s Series. Object reflection. McGraw Hill.. 4. window to viewport transformations. Unit – 2: Polygon Meshes in 3D. Plastock and G. F. 6. 1986. for batch 2006-07 . “Mathematical Elements for Computer Graphics”. “Computer Graphics Principles & practice”. scanline algorithm. “Computational Geometry: An Introduction”.A. curves. arcs. 1 should be compulsory and cover the entire syllabus. 8. ellipses & polygon. Foley et. 5. Rogers. Text: 1. “An Introduction to Splines for use in Computer Graphics and Geometric Modeling”. Input devices. D. Rogers and J. J. Preparata and M. Z-buffer algorithm. 1985. multi-particle system. 1987. 2. clipping. elementary Image Processing techniques. R. grammar-based models. Sproul. 09 and 26th AC Meeting on 19 th Jan. Kalley.e. al. 1.PaperID: 15209 Code: IT209 1. AddisonWesley. 1992. 1986. 1973.f. MacGraw-Hill International Edition. Newman and R. Alan Watt and Mark Watt. Paper : Computer Graphics L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 Question No. circles. Procedural models..

Unit – 2: Oracle Architecture. Galgotia publications. Every unit should have two questions. SQL. Instances. specifying constraints and indexes in sql. Cursors. Unit – 4: Concurrency control & recovery techniques: concurrency control techniques. 2004 4. concepts and architecture. Silberschatz. McGraw Hill. Pearson Education References: 2. student may be asked to attempt only 1 question from each unit. “Database Systems: Design Implementation & Management”. relational model constraints. 2NF. Text: 1.. Narosa publishing house. 7. domain key normal form. J. Sudershan.Paper ID: 15211 Code: IT211 1. database languages & interfaces. Tech/M. lossless join and dependency preserving decomposition (4NF. A. Triggers. Network & Relational Data Base Management Systems. J. database backup and recovery from catastrophic failures. 2. V. Internal Memory Structure. J. Distributed Data Base Management Systems. Concepts of object oriented database management systems. Table Spaces. 1. “Fundamentals of database systems”. 3rd Edition. “Database System Concept”. Date. “An introduction to database systems”.a relational database language: date definition in SQL. Relational model. Types of Tablespaces. 09 w. User Defined Functions. Data Types. data modelling using the entity-relationship approach. view and queries in SQL. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Ullman. rest of the paper shall consist of four units as per the syllabus. Elmsari and Navathe. 32 Syllabus for B. Galgotia publications. date models. H. DBMS architecture & data independence. database systems. “An introduction to database concepts”. C.. granularity of data items. Desai. 5. 1 should be compulsory and cover the entire syllabus. schemas & instances. Rob & C. normal forms based on primary keys. Roles & Privileges. time stamp ordering. It should be of 20 marks. relational algebra. 8th Edition. languages & systems: relational data model & relational algebra: relational model concepts. Date. “Principals of database systems”. (1NF. 09 and 26th AC Meeting on 19 th Jan. 3NF & BCNF). Background Processes. Error Handling. F. 5NF). Coronel. P. 2005. Stored Procedures. recovery techniques: recovery concepts. However. B. Unit – 3: Relational data base design: function dependencies & normalization for relational dataases: functional dependencies. Thomson Learning. 3. D. 6.e. Overview of hierarchical. for batch 2006-07 . Korth and S... Each question should be 10 marks Unit – 1: Basic concepts: database & database users. Paper : Data Base Management Systems L 3 T 1 P 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 Question No.f. locking techniques. characteristics of the database. Logical Data Structures Physical Data Structure. C. Apart from Question No. “An introduction to database systems”. Pearson Education. This question should have objective or short answer type questions.

Tech (dual degree) –CSE program approved in the BOS on 12th Jan. L 0 T/P 2 C 1 33 Syllabus for B. 09 and 26th AC Meeting on 19 th Jan. Tech/M. L 0 T/P 2 C 1 Paper: DBMS Lab. Paper: Computation Lab. L 0 T/P 2 C 1 Code: IT253 Paper ID:15253 Practicals based on IT201. Paper: Electronic Devices and Circuits Lab. L 0 T/P 2 C 1 Paper: Object Oriented Programming Lab.Practicals: Code: IT251 Paper ID:15251 Practicals based on IT205. for batch 2006-07 . Code: IT259 Paper ID:15259 Practicals based on IT211.e. 09 w.f. Code: IT255 Paper ID:15255 Practicals based on IT207. Code: IT257 Paper ID:15257 Practicals based on IT207. L 0 T/P 2 C 1 Paper: Computer Graphics Lab.

John Wiley. JVM as an interpreter and emulator. Listeners. Head first Java. “Computing Concepts with Java 2 Essentials”.f. Class Member Modifiers Anonymous Inner Class Interfaces and Abstract Classes. ActionEvent Methods FocusEvent KeyEvent. Hashtable classes.applets. 1 should be compulsory and cover the entire syllabus. for batch 2006-07 . set. Sockets. BorderLayout. 09 w. Vikas Publication. Class Area. 4. sandbox model Unit 2: Java Fundamentals. Starting Threads. 34 Syllabus for B. Verification. However. Synchronize Threads.Mouse Events. Class loaders and security aspects. Life cycle of applet and Security concerns Unit 3: Threads: Creating Threads. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. FlowLayout. Component Class. Java program Compilation and Execution Process Organization of the Java Virtual Machine. Java Native interfaces.Blocked States.Class Listener. Text/References 1. Collection API Interfaces. Map. Wrapper Classes. class File Format. notify and notify all.WindowEvent Unit 4: Input/OutputStream. development of client Server applications.Java”. List. Container Class. Oracle.e. inheritance. Extending Thread Class. Vector. Sync Code Block. It should be of 20 marks. Paper : Java Programming L 3 T 1 C 4 Maximum Marks : 60 Question No. rest of the paper shall consist of four units as per the syllabus. CardLayout GridBagLayout AWT Events. LayoutManager Interface Default Layouts. user defined Exceptions . throw and throws clauses. “Programming. Garbage Collection. AWT Components. student may be asked to attempt only 1 question from each unit. Overriding Synced Methods. Runnable Interface. GridLayout.Arithmetic Operators. Control of Flow. Decker & Hirshfield. wait.Thread Synchronization. Instruction Set. Iterators . “Java-2 the complete Reference” by Patrick Naughton and Herbertz Schidt. Horstmann.Adapters. Security Architecture and Security Policy.Buffered Streams. O’reilly 3. 2. Classes and Instances. Arrays. Stream Filters. Tech/M.Data input and OutputStream. 1. PrintStream RandomAccessFile. 2. Remote Method invocation. Every unit should have two questions.Paper ID: 15202 Code: IT202 INSTRUCTIONS TO PAPER SETTERS: 1. Thread Priority. “Programming with Java” by E Balaguruswamy.Sierra & bates . design of multithreaded server. Object serialization. 5. Insets and Dimensions. The StringBuffer Class . Security Promises of the JVM. Development of a JNI based application. This question should have objective or short answer type questions. Apart from Question No. Logical Operators. Heap. stack. Each question should be 10 marks Unit 1: Overview and characteristics of Java. enumerations. Data Types & Literals Variables. MS-SQL Server). Java Stack. JDBC (Database connectivity with MS-Access. 09 and 26th AC Meeting on 19 th Jan.tokenizer. Thread Communication. Event Models.

3 Lossless and Lossy compression. Steinmetz “Multimedia Computing Communication and Application” Pearson Edn. Rendering: soft.Basic concepts of Video & animation. Andleigh and Thakarar “Multimedia System Design” PHI Reference 1. Transform Coding. However. 3. Unit . Paper: Multimedia Applications L 3 T/P 1 C 4 Maximum Marks : 60 Question No. 09 and 26th AC Meeting on 19 th Jan. 1. Data stream characteristics &for continuous media Multimedia Applications. Dynamics: soft bodies. Unit . Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Basic sound concepts .. Basic Terminology techniques. “Fundamentals of Computer Graphics and Multimedia”. Modeling: NURBS. Special effects.Computer based animation.P. rest of the paper shall consist of four units as per the syllabus.Hard renering.Media & data stream. main properties of multimedia system . 3.. Optical Media. Rigid bodies and its usages in the scene etc. Storage Technologies: RAID. “Digital Multimedia”. MPEG. MIDI .f. Every unit should have two questions. Polygon. Conventional system. “Multimedia Technology & Applications”. D. Unit . student may be asked to attempt only 1 question from each unit. Organic. Statistical Coding. Motion Graphics 2D & 3D animation. Categories of Authoring Tools. JPEG. This question should have objective or short answer type questions. Maya manuals. Special Effects: Shading & Texturing Surfaces.Basic concept of Images. Tech/M.. for batch 2006-07 . Line and box rendering etc.Skelton animationetc.2 Text. 09 w. David Hillman. Lighting. Speech .4 Introduction to MAYA(Animating Tool): Fundamentals. 2.path animation. Introduction. deformers. Wiley Publications. Apart from Question No. Animation:Key frame animation. Galgotia Publications. Graphics format . Text compression using static Huffmann technique. Nigel Chapman & Jenny Chapman. Each question should be 10 marks Unit .reactive animation.1 Concept of Multimedia .. 2. Authoring Tools. PHI. Working with MEL: Basics & Programming Text Books: 1. Run length coding. It should be of 20 marks. Arithmetic Technique. Mukherjee.Paper ID: 15204 Code: IT204 INSTRUCTIONS TO PAPER SETTERS: 1.e. 35 Syllabus for B. tweaning & morphing. 2. Dynamic Huffmann Technique. 1 should be compulsory and cover the entire syllabus. Hardware Software requirements. IPR rendering.

classification and characteristics of memories. Yarbrough. TTL. Nagrath. Unit – 2: Combinational circuits: Multiplexers. Nyquist Sampling Theorem. Tocci. J-K. 2000 I. Quinn-McClusky’s Algorithm. 1. Jain. Design of Synchronous counters and sequence detectors. 2nd Ed. 2. Apart from Question No. TMH. PWS Publishing. PAL & PLA. S. J. excitation table of a flip-flop. 09 and 26th AC Meeting on 19 th Jan. Paper: Switching Theory and Logic Design L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 Question No. Dual-slope ADC Unit – 4: Bipolar-Transistor Characeristics. “Electronics. Don’t care conditions. Wiley Pub. Adders & Subtractors. This question should have objective or short answer type questions. R. Every unit should have two questions. for batch 2006-07 . K-map representation and simplification of logical functions. PHI. Nai. B. It should be of 20 marks. RTL and DTL circuits. “ Digital Electronics and Logic Design”. 09 w. 1 should be compulsory and cover the entire syllabus. 36 Syllabus for B. Standard representation of Logical functions. NOT. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. J. “Digital principles and applications”. Code Converters. ROM and content addressable memory. Linear-ramp ADC. D & T Flip-flops. 4. ECL and C MOS Logic families. Malvino and Leach. Tech/M. 555 Timer and its application as mono-stable and astable multi-vibrator. PHI. Unit – 3: Sequential circuits: Shift registers. Each question should be 10 marks Unit – 1: Analog & Digital signals. Text/References: 1.f.e. However. PHI Balabanian and Carlson. rest of the paper shall consist of four units as per the syllabus. RAM. M. NAND. 8. “Digital Logic Design Principles”. 5.P. Semiconductor Memories: Memory organization & operation. Logic Implementations using ROM. OR. “Digital Logic-Application and Design”. “Digital Design”. A/D and D/A converters : Binary-weighted DAC. R-2R Ladder type networks. 1999. 7. 6. Boolean algebra. Analog & Digital”. race around condition. Ripple counter. 2. “Digital Systems”. demultiplexers. 2nd Ed. X-OR & X-NOR simplification of Kmaps.. “Modern Digital Electronics”. student may be asked to attempt only 1 question from each unit.Paper ID: 15206 Code: IT206 1. J. NOR & XOR gates. Decoders & Encoders. 3. decoder/drivers for display devices Flip Flops: S-R. comparators. Successiveapproximation ADC. AND. PHI. TMH Morris Mano. R.

1996. Ltd. “Organizational Behaviour”. Prentice Hall of India Pvt. Hersey and Blanchard (6th ed. New Delhi. 1998. 3. Group Dynamics. management systems and processes. Stress and its management..). Attitudes and Values. Dwivedi.e. student may be asked to attempt only 1 question from each unit. Managerial skills. R. Macmillan India Ltd. This question should have objective or short answer type questions. It should be of 20 marks. 37 Syllabus for B. 1996. 09 w. 4.). 5. 2. Organizational Structure and Design: Managerial Communication. Luthans Fred. Robbins (4th ed. Problem Solving and Decision Making. 2. Each question should be 10 marks Introduction: Meaning and nature of management. rest of the paper shall consist of four units as per the syllabus. Prentice Hall of India Pvt. However. Analysing inter-personal relations. Delhi. Learning.f.. McGraw Hill. l. Interactive Aspects of Organizational Behaviour. Management ethos. New Delhi. 1 should be compulsory and cover the entire syllabus. Delhi. 1995. Cary. “Essentials of organizational behaviour”..Paper ID: 15208 Code: MS208 INSTRUCTIONS TO PAPER SETTERS: 1. Tasks and responsibilities of a professional manager. Arnold. Robertson.. Ltd. References: 1. Behavioural Dynamics: Individual detgerminants of Organization Behaviour. “Management of organizational behaviour: utilising human resources”. Perceptions. S. Personality. 09 and 26th AC Meeting on 19 th Jan.. Controlling. Leadership Styles. Tech/M. Management of Organizational Conflicts. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. for batch 2006-07 . and Cooper. Paper : Organization Behaviour L 3 T/P 1 C 4 Maximum Marks : 60 Question No. Organization Structure and Process: Organizational climate and culture. 1. Macmillan India Ltd. Ivan t.. “Human relations and organizational behaviour: a global perspective”.. Decision Making: Organizational Context of Decisions. Apart from Question No. Planning process. John. “Work psychology: understanding human behaviour in the workplace”. 1995. Decision Making Models. Motivation. Every unit should have two questions.

R . Apart from Question No. fundamental counting principles. representation & minimization of Boolean function. Isomorphism. primitive roots. student may be asked to attempt only 1 question from each unit. definition of Boolean algebra. Thomson Learning.J. E . Masters theorem. Connected components. J . This question should have objective or short answer type questions. Logic and Computability”. However. Manber “Introduction to Algorithms – A Creative Approach”. Simple Cryptosystems. Principle of Well Ordering. [13] V . G. Computer Science Press. K.L . It should be of 20 marks. Menger’s Theorem. Chandrasekaran and Venkatesh. A . powersets. primes. McGraw Hill Book Company. Symbolic Representation and Tautologies.P. Propositional Logic. [12] T .Liu. 2005. Euler graphs. “Discrete Mathematical Structure with Application to Computer Science. “Discrete Mathematical Structures”. Boolean function. Computer representation of graphs. 2. sublattices. Pearson Education. Every unit should have two questions. preorder & post order trees traversal algorithms. Permutation function. Unit – 4: Graph Terminology. Quadratic congruences and quadratic reciprocity law. G. solution methods for linear. Whitesides. Hopcroft. “Discrete Mathematics for Computer Science”. composition of cycles. rest of the paper shall consist of four units as per the syllabus. Humphreys. “A Course in Group Theory”. 2006. permutation and combination. “A course in number theory and cryptography”. Sen.e.H . Predicate Logic. Kolman. 09 and 26th AC Meeting on 19 th Jan. D .” TMH. binary and unary operations on a set. New Delhi (2000). The functions τ and σ. C . set operations/set identities. Thomson Learning. Fundamental Theorem of Arithmetic.S. Boolean expression. PHI/Pearson. Error Correcting codes and groups.Paper ID: 15210 Code: IT210 1. Congruences. Vertex Coloring. Unit – 2: Lattices: definition. Proof by exhausting cases and proof by contradiction. direct product and homo-morphism. “Discrete Structures. Each question should be 10 marks Unit – 1: Formal Logic: Statement. 2001. LCM. Proof by Contraposition. inverse.L. Hamiltonian graphs. “Elements of Discrete Mathematics”. Recursive definitions. C. Growth of Functions. five color theorem. 09 w. inverse and its uniqueness. properties of binary relation. 1. “Introduction to graph theory”. partial ordering. Aho. direct product.V. Malik and M. first-order recurrence relations with constant coefficients. principle of mathematical induction. Rivest “Introduction to Algorithms”. J. Mamohan. Schlipf and S. Normal forms. P. J. Chartrand. Analysis of Algorithms involving recurrence relations – comparison based sorting and searching algorithms. equivalence relation. Vikas Publication. RSA Cryptosystem. Primality and Factoring. Springer – Verlag. Permutation group and Cayley’s theorem (without proof). Cormen. Relation. Ulman “The Design & Analysis of Computer Algorithms”. Euler φ function. Planar graphs. Narosa. composition of function. Text/Reference: [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] Education. Arithmetic Functions. pascal’s triangles. solution method for a divide-and-conquer recurrence relation. Pearson 38 Syllabus for B. Groups. in order. Wilson’s Theorem.f. isomorphism and homomorphism. pigeonhole principle. [14] Ellis Horowitz and Sartaz Sahani “Fundamentals of Computer Algorithms”. Normal subgroup and quotient groups. Tremblay & R. Quantifiers. John F. Sets. structures with binary operations) subalgebra. Isomorphism as relations. subgroups. Fermat’s Little Theorem. E . homomorphism. Busby & Ross “Discrete Mathematical Structures”. [15] Iyengar. Zhang. PHI/Pearson. Direct Proof. Cut-Vertices. 2005. Neal Koblitz. Mobius µ function. binominal theorem. directed graphs. 2002. “A Computational Introduction to Number Theory and Algebra”. properties of function. 1994. OUP. Shortest path and minimal spanning trees and algorithms. CUP. Haggard. Leiserson. Depth-first and breadth first searchs. Edge Colouring. Euler’s Generalization of FLT. Subsets. Shoup. closures. Hein. Paper : Foundations of Computer Science L 3 T/P 1 C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 Question No. Predicates and validity. Cosets and Lagrange’s theorem. isomorphic structures (in particulars. Discrete Function Counting Theorem. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. “Discrete Mathematics”. L. Unit – 3: GCD. Complexity Analysis and proof of correctness of the graph MST. principle of inclusion and exclusion. Tech/M. properties. principle of complete induction. J . four color problem (without proof) and the chromatic number of a graph. traversal and Shortest path algorithms. D. 1 should be compulsory and cover the entire syllabus. Trees terminology. V. Group identity and uniqueness. trees associated with DFS & BFS. for batch 2006-07 . TMH. 2006. Euler’s formula (proof).

User Interface Design. Configuration Management. Stephen R. Sommerville. It should be of 20 marks. Debugging. Data Flow Diagrams. 3. Text: 1. S. IRWIN. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Apart from Question No. Tata McGraw Hill. Equivalence class testing. 4. However. Software Reliability: Failure and Faults. Functional testing: Boundary value analysis. integration and system testing. Token Count..K. 2. Software Requirement Analysis and Specifications: Problem Analysis. “An Integrated approach to Software Engineering”. 1. Each question should be 10 marks UNIT – 1: Introduction: Software Crisis. Function Count. “Classical & Object Oriented Software Engineering”. R. James Peter.Paper ID: 15212 Code: IT212 INSTRUCTIONS TO PAPER SETTERS: 1. Decision table testing. Reverse Engineering. Ed. Narosa.. 09 w. 09 and 26th AC Meeting on 19 th Jan. W Pedrycz. Addison Wesley. Every unit should have two questions. UNIT – 4: Software Testing: Software process. P. Design Metrics. Schach. Evolutionary and Spiral models. R. UNIT – 2: Software Project Planning: Cost estimation. Information Flow Metrics. 2. Documentation. unit testing. Prototype. “Software Engineering”. Putnam Resource Allocation Model. “Software Engineering ”. Classification of Cohesiveness & Coupling. Pressman. Data Dictionaries. 2. Fairley.e. 39 Syllabus for B. Object Oriented Design. Paper : Software Engineering L 3 T/P 1 C 4 Maximum Marks : 60 Question No. Reliability Allocation. Logarithmic Poisson Model. Software Re-engineering. “Software Engineering Concepts”. rest of the paper shall consist of four units as per the syllabus. Software Prototyping. Software Requirement and Specifications. 1996. McGraw Hill Int. student may be asked to attempt only 1 question from each unit. New Age International. “Software Engineering”. Data Structure Metrics. 3rd ed. John Wiley & Sons 5.f. static. K. Reliability Models: Basic Model. Function Oriented Design. UNIT – 3: Software Design: Cohesion & Coupling. Software Maintenance: Management of Maintenance. COCOMO model. SEI-CMM. Data flow and mutation testing. Software Metrics: Size Metrics like LOC. 1999. Single and multivariate models. Overview of Quality Standards like ISO 9001. Tech/M. 1991. Risk management. 1992. I. Maintenance Models. This question should have objective or short answer type questions. Entity-Relationship diagrams. 1 should be compulsory and cover the entire syllabus. 1997. Aggarwal & Yogesh Singh. Software Processes. Testing Tools & Standards. “Software Engineering – A practitioner’s approach”. Calender time Component. Jalote. Structural testing: Path testing. for batch 2006-07 . Maintenance Process. 2001 Reference: 1. Software life cycle models: Waterfall. Behavioural and non-behavioural requirements. Cause effect graphing.

L 0 T/P 2 C 1 Code: IT254 Paper ID:15254 Practicals based on IT204. Code: IT256 Paper ID:15256 Practicals based on IT206. 09 and 26th AC Meeting on 19 th Jan. Tech/M. Paper: Java ProgrammingLab.Practicals: Code: IT252 Paper ID:15252 Practicals based on IT202. 09 w. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. L 0 T/P 2 C 1 Paper: Switching Theory and Logic Design Lab. Paper: Multimedia Lab. L 0 T/P 2 C 1 Paper: Software Engineering Lab.f. Code: IT258 Paper ID:15258 Practicals based on IT212.e. for batch 2006-07 . L 0 T/P 2 C 1 40 Syllabus for B.

Apart from Question No. 1997. 2nd Ed. Parsing. Question No. 2 nd Ed. Martin. probabilistic computation. 09 and 26th AC Meeting on 19 th Jan. “Introduction to Automata Theory. Pumping Lemma. R. Cohen. 2 nd Ed. Complexity classes P. “Introduction to the Theory of Computation”. 09 w. PHI. quantiers and games. TMH. 1.Code: IT 301 Paper ID: 15301 Paper: Theory of Computation INSTRUCTIONS TO PAPER SETTERS: L:3 T/P:1 C: 4 Maximum Marks : 60 1. NFAs and Regular Expressions. Unit II Context Free Languages: Context Free Grammar (CFG).e. Non-Regular Languages. 2. 2. L. Every unit should have two questions. Pearson. References: 1. Motwani. However. Language and Computation”. Mishra and N. Pearson. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Unit III Turing Machines and Computability Theory: Definition of Turing Machine. Thompson Press. L. N. Extensions of Turing machines. rest of the paper shall consist of four units as per the syllabus. Unit IV Complexity Theory: Time and Space measures. Equivalence of various Turing Machine Formalisms. NL. This question should have objective or short answer type questions. interactive proof systems. Closure properties of Regular grammar. Hopcroft. BPP and IP. and J. LL(K) grammar. “Elements of the Theory of Computation”. Church – Turing Thesis. Pumping Lemma. Reducibility. Ullman. P versus NP conjecture. 2006. Tech/M. Papadimitriou. Decidability. Wiley. Finite Automata. 1996. H. 2003. Closure properties of CFLs. relativized computation and oracles. York. “Introduction to Languages and the Theory of Computation”. NP. Equivalence of CFGs and PDAs. Chandrasekharan. D. 41 Syllabus for B. provably hard problems. student may be asked to attempt only 1 question from each unit. J. 3. H. Each question should be 10 marks Unit I Automata and Language Theory: Chomsky Classification. 2. Text: 1. It should be of 20 marks. 2006. Parse Trees. 1996. Regular Expressions. PSPACE. Equivalence of DFAs. Non-Deterministic Finite Automata (NFA). complete problems. 1 should be compulsory and cover the entire syllabus. Push Down Automata (deterministic and non-deterministic) (PDA). Sipser. Hierachy theorems. Lewis and C. C. Deterministic Finite Automata (DFA). R. 4. Recursion Theorem. “Theory of Computer Science”.f. K. Non – deterministic Turing machines. Halting Problem. “Introduction to Computer Theory. for batch 2006-07 . J. 2 nd Ed. M.

Asynchronous Multiplexing. comparison of FM&PM Pulse Modulations: Sampling. Digital modulation: ASK. for batch 2006-07 . 2. Wiley. M.ADPCM and comparison. SSBSC).f. Apart from Question No. “Communication Systems”. Reference: 1. Effect of Quantization. Each question should be 10 marks Unit I Introduction: Block diagram of Electrical communication system. 2004. Wiley. 1. S. 2 nd ed.PSK. Hancock. 1961. L. G. PHI. “Communications Systems Engineering”. Rate of information and entropy. S. Nyquist rate of sampling. “Principles of Communication Systems”. regeneration of baseband signal. Bandwidth consideration. 2002. Block diagram of PCM. Types of signals. Time division Multiplexing. coherent and incoherent reception. types of AM Methods (AM. samping theorem for band limited signals. 4. Schilling.FSK. Auto correlation.DPSK. Tomasi. Modems. Narrow band and Wide band FM. C. Amplitude Modulation : Need for modulation. Radio communication: Types of communications. FDM. Error detection and correction codes. DM. 1986. Quantization error. Every unit should have two questions. student may be asked to attempt only 1 question from each unit. G. product detector. noise temperature. Power spectral density. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. 1 should be compulsory and cover the entire syllabus. PHI. “Electronic communication systems”. Analog. 5. This question should have objective or short answer type questions. 3. PWM&PPM. product demodulation for DSBSC&SSBSC. 1995. Error control coding: Introduction. 1993. H. Coding efficiency. Proakis. Unit III Digital communication: Advantages. 6. Taub and D. 09 and 26th AC Meeting on 19 th Jan. Tech/M. However. Kennedy and B. D. convolution. Text: 1. Roddy and J. pulse and digital. 2001. generation and demodulation of AM: Diode detector. It should be of 20 marks. Coolen. Fourier spectrum. rest of the paper shall consist of four units as per the syllabus. 2th ed. TMH. 2003. Haykins. power and bandwidth requirements.ADM. “Introduction to Analog and Digital Communication”. Base band digital signal. J. Source coding for optimum rate of information.DSBSC. “Electronic communications systems(baics through advanced)”. Davis.Code: IT 303 L:3 T/P:1 C: 4 Paper ID: 15303 Paper: Analog & Digital Communications INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 1. Unit II Angle modulation: Frequency and phase modulations. Fourier transform for various signals. 2. Unit IV Information theory : Concept of Information. “Electronic Communications”. 42 Syllabus for B. 2. advantages of FM over AM. 09 w. S/N ratio & Noise figure.QPSK and QAM demodulation. Haykins. Pearson Education. block codes and convolution codes.e. W. S. McGraw Hill. J. noise. TMH.alehi. PAM. Quantization. “An Introduction to the Principles of Communication Theory”.S/N trade off. Question No. Shannon_Fano and Huffman coding.

binary coded decimal. Oxford University press. Parhami. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Patterson. “Computer Architecture: From Microprocessors to Supercomputers”. Carpinelli. 1. interrupts. assembly language instructions. rest of the paper shall consist of four units as per the syllabus. Computer Registers. student may be asked to attempt only 1 question from each unit. 2006. signed notation. Morgon Kauffman. 09 and 26th AC Meeting on 19 th Jan. J. Shift Micro operation. Stack Organization. Design & implementation of simple CPU. 8085 instruction set architecture. Hayes. Virtual memory. Instruction Cycle. Pearson Education. RS-232-C & RS-422 standard Text: 1. Bus Arbitration. Direct memory Access. 1 should be compulsory and cover the entire syllabus. Unit II Instruction set architecture & computer organization Levels of programming languages. Micro-operation. Micro coded CPU: Pentium processor CPU Design Specifying a CPU. 2. Micrprogrammed computers. 7 th ed. UARTs. Question No. Hardwired & Micro Programmed (Control Unit). floating point numbers. 1988. Main Memory (RAM and ROM Chips). 2005. “Computer organization and Architecture”. 09 w. W. Arithmetic Logic. Bus and Memory Transfers. Tech/M. L Hennessy and D. 2006. Addressing Modes. 2. B. A. Internal architecture of 8085 microprocessor. J. Instruction Codes. “Computer Systems Organization and Architecture”. Highspeed memories Input/Output organization Asynchronous Data Transfers. McGraw Hill. Each question should be 10 marks Unit I Computer Arithmetic and Register transfer language: Unsigned notation. General Register Organization. 43 Syllabus for B. Every unit should have two questions. Memory Reference Instructions. This question should have objective or short answer type questions. Computer Instructions. IEEE 754 floating point standard. Serial communication. D. Instruction Formats. for batch 2006-07 .Code: IT 305 C: 4 Paper ID: 15305 Paper: Computer Architecture INSTRUCTIONS TO PAPER SETTERS: L:3 T/P:1 Maximum Marks : 60 1. Apart from Question No. Programmed I/O. P. Timing & Control. However. Bus Architecture. 2. “Computer Architecture and Organization”.e. “Computer Architecture: A quantitative approach”.f. 1992. Reference: 1. It should be of 20 marks. PHI. Input-Output and Interrupts Unit III Control Design: Instruction sequencing & interpretation. J. Arithmetic Logic Shift Unit. Unit IV Memory organization Memory Technology. Stallings. 3.

example of typical signals. Principals. Discrete-Time systems. Oppenhein and R. 09 and 26th AC Meeting on 19 th Jan. Inverse z-transform. Every unit should have two questions. TimeDomain characterization of LTI Discrete-Time systems. A. Oppenhein. Algorithms. G. 4. Z-transforms. R.Code: IT 307 PaperID: 15307 INSTRUCTIONS TO PAPER SETTERS: L:3 T/P:1 C: 4 Paper : Digital Signal Processing Maximum Marks : 60 1. Buck. Question No. Time Domain Representation of Signals & Systems: Discrete Time Signals. It should be of 20 marks. W. Proakis and D. Schater and J. different approaches for reducing the computations. Decimation-in-Time FFT algorithms. Tech/M. Manolakis. for batch 2006-07 . the sampling process. typical Signals Processing applications. “Discrete Time Signal Processing”. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. typical Signal Processing operations.. Unit II Transform-Domain Representation of Signals: Discrete Fourier Transform (DFT). However. 4th ed. 2. Y. 2. Text / Reference: 1. FIR Digital Filter Structure. Pearson Education. 09 w. 2005. 44 Syllabus for B.e. IIR Filter Structures. 1. PHI 1975. Unit IV Digital Filter Structure: Block Diagram representation. 2007. Each question should be 10 marks Unit I Signals and signal Processing: Characterization & classification of signals. Y. and Applications”. This question should have objective or short answer type questions. PHI 1999.f. A. “Digital Signal Processing: A Computer based approach”. rest of the paper shall consist of four units as per the syllabus. properties of z-transform. R. Apart from Question No.G. Signal Flow Graph Representation. student may be asked to attempt only 1 question from each unit. J. W. Sanjit K. Linear Convolution using the DFT. Operations on Sequences. DFT properties. 3. Schater. Unit III Computation of the Discrete Fourier Transform: Computational complexity of the direct computation of the DFT. “Digital Signal Processing. 1 should be compulsory and cover the entire syllabus. Decimation-in-frequency FFT algorithms. computation of the DFT of real sequences. Signal Flow Graph Representation. Mitra. Parallel all pass realization of IIR Filter design based on Frequency Sampling approach. “Digital Signal Processing”. TMH.

Pearson. Jacobson. 45 Syllabus for B. Breugge and A. “Object-Oriented Software Engineering: A Use Case Driven Approach”. Requirements Elicitation Activities. 2. Analysis Model. Managing Requirements Elicitation. Software Life Cycle Models. J. However. Testing Unit IV Testing Object Oriented Systems: Introduction. Each question should be 10 marks Unit I Introduction to Software Engineering: Software Engineering Development. Design Models. Dutoit. Booch. and Java”. 1 should be compulsory and cover the entire syllabus. 2.Code No. 2005. Implementation Model. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. 2004. Requirements Model-Action & Use cases. I. Every unit should have two questions. Unit II Architecture: Model Architecture. Managing Testing Case Studies Text Books: 1.: IT 309 PaperID: 15309 L:3 T/P:1 C: 4 Paper: Object Oriented Software Engineering Maximum Marks : 60 INSTRUCTIONS TO PAPER SETTERS: 1. Prentice Hall. Requirements Model. 1992 B. student may be asked to attempt only 1 question from each unit. “The Unified Modeling Language User Guide” Addison-Wesley.e. G. Block design. Tech/M.f. Overview of Requirements Elicitation. Basic Structural Modeling . Design Model. Patterns. A conceptual Model of UML. “Object Oriented Software Engineering: Using UML. Test Model Unit III Modeling with UMLZ: Basic Building Blocks of UML. Question No. Apart from Question No. Standards for developing life cycle models. H. 3. It should be of 20 marks. 09 and 26th AC Meeting on 19 th Jan. for batch 2006-07 . 1. UML Diagram System Design: Design concepts & activities. rest of the paper shall consist of four units as per the syllabus. Jacboson. Testing Activities & Techniques. Rumbaugh and I. This question should have objective or short answer type questions. 09 w. The Testing Process. Object Methodology & Requirement Elicitation: Introduction to object Oriented Methodology.

Subtractor. Question No. Multiplexer. concurrent coding. Pearson Education. Counters. Bhaskar . H. Design of Serial adder using FSM. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. State Machines. 2005 J. Inertial/Transport Delay Text: 1. 2005 C. 6. Control Structure. PHI 2005 P. 10. Specify the state assignment in VHDL code. “Digital System Design using VHDL”. Morgan Kaufmann. Implementation of Bus Structure using Multiplexer. rest of the paper shall consist of four units as per the syllabus. Bus Structure. Tech/M.: IT 311 L:3 T/P:1 C: 4 PaperID: 15311 Paper: Digital Design using VHDL INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 1.f. Specificatin of Mealy FSM using VHDL. “Circuit Design with VHDL”. PHI. “VHDL coding Styles and Methodologies”.Code No. Lee. TMH. 2. Design of Adder. Chang and M Loeb. State diagram. J. 2005 References: 1. 2005 S. V. 2007. BSP. Pearson Education Press 2007 S. However. “VHDL programming”. Vransesic. Every unit should have two questions. Bhaskar. 2006. “The Designer Guide to VHDL”. VHDL for Combinational Circuits Blocks Unit II Sequential Code. Ashendern. 4. Apart from Question No. 8. Structural and Behavioral Modeling. Opertors. Registers. 11. Encoder. student may be asked to attempt only 1 question from each unit. Cohen. “A VHDL Primer”. state assignment. 1. for batch 2006-07 . 2. “Advanced Digital Logic Design Using VHDL. VHDL for SRAM.e. Data types. Springer. 9. Morgan Kaufmann. “A VHDL Synthesis Primer”. “Digital Systems Design with VHDL and Synthesis”. 2. 09 w. Unit IV Design and Implementation of Arbiter Circuit. Attributes. VHDL for Moore type FSM. 5. “Fundamental of Digital Logic Design with VHDL”. It should be of 20 marks. B. 09 and 26th AC Meeting on 19 th Jan. Ghose. 3. VHDL Design for Shift-and –add Multiplier. 2005 K. Decoder. VHDL Design of Floating point Adder circuit. Synthesis. 7. Design Flow. TMH. Signals and Variable. 2005 D. Implementation of simple processor Unit III State Machine. Don Publisher. and Synthesis for FPGA’s”. Pedroni. Perry.C. B.J. modeling medeling with Delta time Delays. “Hardware Description Languages”. 2007 46 Syllabus for B. 2005 D J Smith . Each question should be 10 marks Unit I Introduction to HDLs. Wiley. VHDL Basics. A. VHDL timing. state table. 1 should be compulsory and cover the entire syllabus. L. VHDL for Flip – Flops. Code converter. This question should have objective or short answer type questions. “HDL Chip Design”. Roth. “Digital Design Principles and Practice” . Mealy State Model. Thomson Learning 2005 J F Wakerly. Algorithm State Machine Charts. RTL for state Machine Design Styles.

-C. emulator and Debugger). 2. Apart from Question No. Procedures and Macros. “The 8086 microprocessor”. linker. for batch 2006-07 . K. Ayala. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Addressing modes. “Advanced Microprocessors and Peripherals”. 80386. rest of the paper shall consist of four units as per the syllabus. TMH. Physical Memory Organization. Numeric processor 8087. PHI. 8251. J. L. Question No. Peter Able. General Bus Operation. 1. Pentium processors and Micontrollers. D. (Writing programs for use with an assembler MASM) Unit IV 8086 Interfacing – Interfacing 8086 with semiconductor memory. Gibson. Tech/M. student may be asked to attempt only 1 question from each unit. 8255. I/O processor 8089 tightly coupled and loosely coupled systems.e. loader. Programming & Design”. A/D and D/A converters. Instruction set descriptions. Every unit should have two questions. Assembler directives and operators. “IBM PC assembly language programming”.: IT 302 Paper ID: 15302 Paper: Microprocessors INSTRUCTIONS TO PAPER SETTERS: L:3 T/P:1 C: 4 Maximum Marks : 60 1. K. Each question should be 10 marks Unit I Introduction – Microprocessors Evolution and types (Intel 4004 – Pentium IV and road maps). Unit II Architecture of 8086 – Register Organization. J. A. 8086. Thomson. I/O addressing capabilities.f. This question should have objective or short answer type questions. 2.V.Code No. Comparison with 8088 Unit III 8086 programming – Assembly language program development tools (editor. 1995 3. Antonakes. 09 and 26th AC Meeting on 19 th Jan. “Microprocessor Systems: The 8086/8088 family Architecture. 4. 8254/ 8243. It should be of 20 marks. 2 nd Ed. 47 Syllabus for B. PHI. Y. Minimum mode and maximum mode timing diagrams. locator. 2000. 8279. A. Execution unit. 1996. TMH. 2. 09 w. Bus Interface Unit. 80486. Hall. 2000. 80286. Signal Description. Thomson. Ray and K M Bhurchandi. Assembler. References: 1. Text: 1. “An Introduction to the Intel Family of Microprocessors”. Overview of 8085. Liu and G. 2000. 1 should be compulsory and cover the entire syllabus. 1991. “Microprocessors and Interfacing”. However.

multiple access protocols.”Data Communications & Networking”. Olifer and V. Internetwork protocols. 2007. Comer. Pearson Education. Telephone system (Structure. L. References: 1. Stallings. India 1st Ed. 2007. 1 should be compulsory and cover the entire syllabus. W. “Computer networks”. Transmission impairments. Apart from Question No.11 for LANS and WLAN. It should be of 20 marks. 09 and 26th AC Meeting on 19 th Jan. 2006 4. 09 w. 4th ed . Reference Model (ISO-OSI. performance factors. 1. 2007. hubs. Pearson Education. Internetwork operation Text : 1. 2007. Network and Protocol Architecture. 8th Ed. “Computer Networks & Internets”. 2007 3.e. Cengage Learning.f. trunks. switches bridges. Tanenbaum. HDLC. L. Olifer. “Computer Networks”. 2. Gallo.. TCP/IP-Overview Physical Layer: Data and signals. However.. rest of the paper shall consist of four units as per the syllabus. Each question should be 10 marks Unit I Introduction: Uses of Computer Networks. 2. A Forouzan. 4th Ed. A. This question should have objective or short answer type questions. “Computer Networks”.Paper Code: IT 304 L:3 T/P:1 C: 4 PaperID:15304 Paper: Computer Networks INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 1.4th Ed. Question No. E. high-speed LANs. IEEE standard 802. sliding window protocols. Network Devices-repeaters. B.WAN Protocols. Tata McGraw Hill. 2006. “Data and Computer Communications”. A. Data Link Protocols. Every unit should have two questions. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. for batch 2006-07 . Unit IV Network Layer: Design issues. Unit III Medium Access Sub layer: Channel allocation problem. student may be asked to attempt only 1 question from each unit. S. Peterson and B. S. Wiley. 2. Transmission media.3 & 802. N. Tech/M.Elsevier. congestion control algorithms. “Computer Communications & networking technologies”. multiplexing & Switching) Unit II Data Link Layer: Design issues.4th Ed. Error detection & correction. Data rate limits. Wireless transmission. 5. Pearson Education. D. Routing algorithms. 48 Syllabus for B. L. Davie.

E. Galgotia. Linz.f.Ullman. Algorithms of Kruskal’s and Prim’s. 09 and 26th AC Meeting on 19 th Jan. PHI. J . It should be of 20 marks. 6. Hopcroft. 4. 2.1996. This question should have objective or short answer type questions. 09 w. Languages and Computation”. Medians and Order Statistics. NP-Complete Problems. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Tech/M. Horwitz and S. Huffman Coding Problem. 49 Syllabus for B.D. 1 should be compulsory and cover the entire syllabus. P. 5. Apart from Question No.V. 2001. Radix Sort. for batch 2006-07 . Strassen’s algorthim for matrix multiplication. Sorting in Linear Time: Counting sort. 1998. K. 2000. 7. Every unit should have two questions. Addison Wesley. 1998. References: 1. Text: 1. NP Completeness proof. E. C . String Matching with Finite Automata. Narosa Publishing House. “Introduction to Algorithms”. General Greedy approach Vs Dynamic Programming approachm Case studies: Knapsack problem. However. Optimal Binary Search Tree. Flyod Warshall Algorithm Unit IV String Matching: The Naïve String Matching Algorithm.Martin. Strongly Connected Components.L . Rivest. Bucket Sort. Sahani “Fundamentals of Computer Algorithms”. All pair shortest path. 1. “An Introduction to Formal Languages and Automata”. Aho. Breadth First Search. Addison Wesley. disjoint set forests. Unit II Matrix Chain Multiplication. 2001. John C. Dijkstra’s and Bellman ford algorithm. 2. TMH. The Rabin Karp Algorithm. LCS. Each question should be 10 marks Unit I Growth of Functions. Algorithm Design Paradigms. 3.Code: IT 306 L:3 T/P:1 C: 4 Paper ID: 15306 Paper: Algorithm Analysis and Design INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 1. 1998. Manber “Introduction to Algorithms – A Creative Approach”. PHI. T .Chandrasekaran. Question No. Ulman “The Design & Analysis of Computer Algorithms”. D . Addison Wesley. Matroids Unit III Representation of Graphs.e. “Introduction to Languages and Theory of Computation”. Depth First Search. E . Linked List representation of disjoint sets. The Knuth Morris Pratt Algorithm. R .H . Leiserson.Mishra & N. NP-Complete Problems: Polynomial Time Verification.Hopcroft and J. Topological Sort. E .L. J . rest of the paper shall consist of four units as per the syllabus. Disjoint Set operations. 1998. A . student may be asked to attempt only 1 question from each unit. Summations. J. “Introduction to Automata Theory. “Theory of Computer Science”. Cormen. NP-Completeness and Reducibility. U .

Tech (dual degree) –CSE program approved in the BOS on 12th Jan. 2004. Nor LL(1) grammar. Muchnick Harcourt Asra. student may be asked to attempt only 1 question from each unit. error reporting and implementation. DAG representation of programs. 1 should be compulsory and cover the entire syllabus. peep hole optimisation. loops. global dataflow analysis. ambiguity. Type checking: type: type system. Aho. difficulties in lexical analysis.and S-attributed definitions. 09 and 26th AC Meeting on 19 th Jan. associability. O’ Reilly. for batch 2006-07 . evaluation order. 3. operator precedence grammars. Tech/M. Text Book: 1. 1998. basic blocks and flow graphs. assignments. However. overloaded function and operators. lexeme and patterns. 09 w. specification of machine. structural and name equivalence of types. 1. “Compiler Construction. Apart from Question No. Allen.f. Levine. “Compiler Design using FLEX and YACC” PHI. top down parsing. data flow analysis of structured flow graphs. recursive descent parsing. register allocation. Each question should be 10 marks Unit I Compiler Structure: Analysis-synthesis model of compilation. Intermediate Code generation for control flow. predictive parsing LL(1) grammar. translation of declarations. and Brown. token. Ullman. L. 50 Vinu V. Unit II Syntax Analysis: Context free grammars. Design of a typical parser using YACC or Bison. Cambridge Uty. Press 1997 Alan Holub. various phases of a compiler. Techniques & Tools”. Ravi Sethi & Jeffrey D. Question No. “Modern Compiler Implementation in C”. bottom up and top down evaluation of attributes. type conversion. code generation from DAGS. 2. tool based approach to compiler construction. LR). 2. “Compilers Priciples. polymorphic function. PHI. 1. S. Principle and Practice” Thomson Books. 3. Mason. This question should have objective or short answer type questions. code improving transformations. rest of the paper shall consist of four units as per the syllabus. implementation issues. solution to iterative dataflow equations. code generation. activation record. Unit III Syntax directed definitions: Inherited and synthesized attributes. 2006. Morgan Kaufman. 2. “Advanced Compiler Design implementation”. LALR. Code optimisation: source of optimisations.e. Run time system: storage organization. activation tree. parameter passing symbol table. LR parsers (SLR. “Compiler Design in C”. K. Every unit should have two questions. Das. design of a typical scanner using LEX of Flex. 2005 Syllabus for B. Transition diagrams. dealing with aliases. Unit IV Code generation and instruction selection: Issues.Code: IT 308 PaperID: 15308 L:3 T/P:1 C: 4 Paper: Compiler Design Maximum Marks : 60 INSTRUCTIONS TO PAPER SETTERS: 1. dynamic storage allocation. Lexical analysis: Interface with input parser and symbol table. C. optimisation of basic blocks. Louden. “Lex & Yacc”. 1998. code generator generators. dependency graph. Boolean expressions and procedure calls. type expressions. 2006 Alfred V. top down parsing. Pearson. Bottom up parsing. transformation on the grammars. References: 4. Regular grammar & language definition. precedence. Intermediate code generation: intermediate representation. S. It should be of 20 marks.

rest of the paper shall consist of four units as per the syllabus. Process Management: Process Concept. Unit II Kernel Design Concepts. Time Sharing System. Silbershatz and Galvin. Scheduling Algorithms. 09 and 26th AC Meeting on 19 th Jan. PHI. This question should have objective or short answer type questions. Tata Mcgraw-Hill. 1. Mchoes. Threads. Function of Operating System: Process Management. “Operating Systems”. 2. Unit IV Case study on DOS. Each question should be 10 marks Unit I Introduction to the Operating System:Type of OS: Batch System. Working set Model. Godbole Ahyut “Operating System”. Race Condition. Thread Structure. Question No. Process Control Block. Scheduling Criteria. CPU Scheduling. However. Tech/M. Recovery and Detection. Indexed Allocation Free Space Management. Device Management: Disk Structure. Windows 2000. Thrashing. Process Scheduling. Page Replacement.Code: IT 310 L:3 T/P:1 C: 4 PaperID:15310 Paper: Operating Systems Design Concept INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 60 1. Every unit should have two questions. References: 1. Real Time System. Context Switch. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. 2000 “Operating System “ Concepts & Design”. Multiuser/Single User System. Allocation of Frames. Addition Weseley. File Management. 2003 51 Syllabus for B. Disk Management.f. 2. System Call Interface. Disk Scheduling Algorithms. Unit III Design of Mini OS: MINIX Memory Management: contiguous Allocation. “Operating System Concept”. Directory Structure. Thomson Press. “Understanding Operating System”. Information Management. Windows XP. student may be asked to attempt only 1 question from each unit. 2003 Charles Crowley. I/O Devices Management. Process State. 3. Semaphores. 09 w. Third Edition. External Internal Fragmentation. Tannenbaum. Classical Problems of Synchronisation. for batch 2006-07 . Methods for Handling Deadlocks Avoidance. Linux Information Management: File Concepts. Synchronisation hardware. Milan Milenkovic. Deadlocks: Characterisation. Paging Segmentation. System Calls. It should be of 20 marks. Pre Emptive/ Non Preemptive Scheduling.e. Text: 1. 2002 Flynn. Tata Mcgraw-Hill Edition A. Memory Management. Linked Allocation. 2. Segmentation with Paging. Process Synchronisation: Critical Section Problem. Addition Weseley. PR Algorithms. “Operating System Concept”. Allocation Methods: Contiguous Allocation. 3. S. Access Methods. 2002. 1 should be compulsory and cover the entire syllabus. Apart from Question No. Virtual Memory: Virtual Memory Concept. Vista. Demand Paging.

2. 2. Stallings W. Michael A. Miller. Addison Wesley. ARP and RARP. 5. Text: 1.. Apart from Question No. “Understanding Data Communications & Networks”. “SNMP. However. 1999. Unit-II Network Layer: Routing algorithms and protocols. rest of the paper shall consist of four units as per the syllabus.Paper Code: IT-401 Paper ID: 15401 INSTRUCTIONS TO PAPER SETTERS: 1. Network layer in ATM Network. Vikas Publication. 3 rd Ed. “Introduction to Cisco Router Configuration”. 1996. 1999. RMON. for batch 2006-07 . Tech/M. UDP. WWW. William A. PHI.. Each question should be 10 marks Unit -I Review of Physical. 09 and 26th AC Meeting on 19 th Jan. Router Operation. IPv6 (an overview). “Computer Networks”. Congestion control algorithm. Every unit should have two questions. Standards and Interfaces”. Shay. “Data & Network Communications”. IP Protocol. PHI. Data link layer. 3 Stallings W. 2. Internetworking. 52 Syllabus for B. DNS. Unit-III Transport Layer: Transport Service. “Computer Networks-Protocols.e. Vikas Publication.. Laura Chappell (ed).S.f. SNMPv3. student may be asked to attempt only 1 question from each unit. SNMP. 1999. 09 w.. Tananbaum A. Router configuration.. Techmedia. PHI. SNMPv2. Virtual Public Network. L:3 T/P:1 C:4 Paper: Advanced Computer Networks Maximum Marks : 60 Question No. 1. This question should have objective or short answer type questions. 4. 1 should be compulsory and cover the entire syllabus. Black U. Application layer: Security. References: 1. RMON 1&2”. Unit -IV Network Security: Firewalls (Application and packet filtering). “Computer Communication Networks”. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. TCP/IP: Datalink Protocols. Electronic Mail. Transport Protocol (TCP. It should be of 20 marks. ATM AAL layer protocol). 3 rd Ed.

2.Paper Code: IT-403 Paper ID: 15403 INSTRUCTIONS TO PAPER SETTERS: 1. 1995. 2001. “Testing Computer Software”.e. Error. New York. 5. This question should have objective or short answer type questions. “Software Testing”. McGraw-Hill. 1990. “Software Engineering”. Testing Activities: Unit Testing. Fault. 1989. McGraw-Hill International Edition. student may be asked to attempt only 1 question from each unit. DD-Paths. Mutation testing.. rest of the paper shall consist of four units as per the syllabus. New Delhi. New York. 2003. Debugging. Slice based testing Risk Analysis. Nguyen Quoc. “Software System Testing and Quality Assurance”. Data Flow Testing. “The Art of Software Testing”. Limitations of Testing. John Wiley & Sons Inc. Massachusetts. Tech/M. Each question should be 10 marks Unit -I Introduction: What is software testing and why it is so hard?. 4. 4. L:3 T/P:1 C:4 Paper: Software Testing Maximum Marks : 60 Question No. 1979. “Software Testing”. 1993. Integration Testing. Jack Falk. No absolute proof of correctness. Text: 1. London. Van Nostrand Reinhold. Scheme. Decision Table Based Testing. Roger S. William Perry. Tech (dual degree) –CSE program approved in the BOS on 12th Jan.. New Age International Publishers. New York. Addison Wesley Pub.K. 2. 1995. New York. Every unit should have two questions. 09 w. 1984. New York. Apart from Question No. New York. Test Cases. It should be of 20 marks. Inc. Domain Testing. “Effective Methods for Software Testing”. 7. Van Nostrand Reinhold. Aggarwal & Yogesh Singh. 1. Structural Testing: Path testing. Class Testing. Priority category. John Wiley & Sons Inc. 1990. GUI Testing. Cause Effect Graphing Technique. Object Oriented Integration and System Testing. Boris Beizer. Louise Tamres.. Gordon Schulmeyer. New Delhi. K. Boris Beizer. “Managing the Software Process”. Testing Tools: Static Testing Tools. Unit-IV Object Oriented Testing: Issues in Object Oriented Testing. Boris Beizer. Dynamic Testing Tools. Watts Humphrey. Glenford Myers. Second Edition. 2002 Reference: 1. Marc Roper. Levels of Testing. Second Volume. Pressman. 09 and 26th AC Meeting on 19 th Jan. 1994. Regression Testing. Equivalence Class Testing. Pearson Education Asia. Graph Metrics. Incident. 6. 53 Syllabus for B. New York. 3. Failure. Van Nostrand Reinhold. Co. Unit-III Reducing the number of test cases: Prioritization guidelines. “Software Engineering – A Practitioner’s Approach”. Fifth Edition. Second Edition. Unit-II Functional Testing: Boundary Value Analysis. John Wiley & Sons. System Testing.. “Zero Defect Software”. Overview of Graph Theory. Cem Kaner.f. Cyclomatic Complexity. “Software Testing Techniques”. Testing Process. “Black-Box Testing – Techniques for Functional Testing of Software and Systems”. However. Characteristics of Modern Tools. 8. 1 should be compulsory and cover the entire syllabus. 2. McGraw-Hill Book Co. for batch 2006-07 . 3.

**Paper Code: IT-405 Paper ID: 15405
**

INSTRUCTIONS TO PAPER SETTERS:

1. 2.

**L:3 T/P:1 C:4 Paper: Distributed Systems
**

Maximum Marks : 60

Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 20 marks. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks

Unit-I Fundamentals of Distributed Computing: Architectural models for distributed and mobile computing systems, Basic concepts in distributed computing. Distributed Operating Systems: Overview, network operating systems, Distributed file systems, Middleware, client/server model for computing. Unit-II Communication: Layered protocols, RPC, RMI, Remote objects. Basic Algorithms in Message Passing Systems, Leader Election in Rings, and Mutual Exclusion in Shared Memory, Message Passing, PVM and MPI. Process Concepts: Threads, Clients and Servers, Code migration, Agent based systems, Distributed objects, CORBA, Distributed COM. Unit-III Synchronization: Clock synchronization, Logical clocks, Election algorithms, Mutual exclusion, Distributed transactions, Naming concepts, Security in distributed systems Distributed Databases: Distributed Data Storage, Fragmentation & Replication, Transparency, Distributed Query Processing and Optimization, Distributed Transaction Modeling and concurrency Control, Distributed Deadlock, Commit Protocols. Unit-IV Parallel Processing: Basic Concepts: Introduction to parallel processing, Parallel processing terminology, Design of parallel algorithms, Design of Parallel Databases, Parallel Query Evaluation. Text Books: 1. Tannenbaum, A, Maarten Van Steen. Distributed Systems, Principles and Paradigm, Prentice Hall India, 2002 2. Elmarsi, Navathe, Somayajulu, Gupta, “Fundamentals of Database Systems”, 4th Edition, Pearson Education, 2007 Reference Books: 1. Tanenbaum, A, “Modern Operating Systems”, 2nd Edition, Prentice Hall India, 2001. 2. Singhal and Shivaratri, “Advanced Concepts in Operating Systems”, McGraw Hill, 1994 3. Attiya, Welch, “Distributed Computing”, Wiley India, 2006 4. Coulouris, Dollimore and Kindberg, “Distributed Systems”, Pearson, 2009.

54

**Paper Code: IT-407 Paper ID: 15407
**

INSTRUCTIONS TO PAPER SETTERS:

1. 2.

**L:3 T/P:1 C:4 Paper: Artificial Intelligence
**

Maximum Marks : 60

Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 20 marks. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks

Unit-I Introduction: Introduction to intelligent agents Problem solving: Solving problems by searching : state space formulation, depth first and breadth first search, iterative deepening Unit-II Intelligent search methods: A* and its memory restricted variants Production systems: Design implementation and limitations, case studies Unit-III Game Playing: Minimax, alpha-beta pruning Knowledge and reasoning: Propositional and first order logic, semantic networks, building a knowledge base, inference in first order logic, logical reasoning systems Planning: STRIPS partial order planning, uncertain knowledge and reasoning, probabilistic reasoning systems, Baysian networks Unit-IV Learning from observations: Inductive learning, learning decision trees, computational learning theory, Explanation based learning Applications: Environmental Science, Robotics, Aerospace, Medical Scioence etc. Text Book: 1. "AI" by Rich and Knight, Tata McGraw Hill, 1992 Reference Books: 1. "Neural Networks in Computer Intelligence" by KM Fu, McGraw Hill 2. "AI: A modern approach" by Russel and Norvig, Pearson Education

55

**Paper Code: IT-409 Paper ID: 15409
**

INSTRUCTIONS TO PAPER SETTERS:

1. 2.

**L:3 T/P:1 C:4 Paper: Simulation & Modeling
**

Maximum Marks : 60

Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 20 marks. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks

Unit-I

Introduction to Simulation Definitions of modeling & simulation, Concept of systems & system environment, components of a system, discrete & continuous systems, model of a system, types of models & simulation, Advantages, disadvantages, & pitfalls of simulation General principles Concepts in discrete-event simulation, event-driven simulation, world views, list processing Unit-II Simulation software History, Selection process, simulation in high level language(c,c++),desirable software features, general purpose simulation packages Basic Probability & statistics Terminology & concepts, Statistical modeling & probability distributions. Random-Number generation Properties of random numbers, generation of pseudo-random numbers, techniques for generating random numbers, test for randomness Unit-III Random-variate generation Inverse transform, Direct transform, convlution, Accept-Reject Queuing models Characteristics, performance measures, steady-state behaviour, Networks of queues Input Modeling Data collection, Identifying distribution, parameter estimation, goodness-of-fit, multivariate & time series input models Unit-IV Verification & Validation of simulation models Model building, verifaction & validation, verifcation of simulation models, calibration & validation of models Techniques for increasing model validity & credibility Output analysis Types of simulations with respect to output analysis, stochastic nature of output data, measures of performance & their estimation, output analysis for termination simulations & steady state simulations Brief overview of discrete & continuous simulation languages and applications of simulation. Text: 1. Banks J., Carson S., Nelson B.L.,”Discrete-Event Syatem simulation”,4th ed ,Pearson Education,New Delhi,2007 2. Law A.M., Kelton W.D., “Simulation Modeling and analysis”,3rd ed,McGraw Hill education,Delhi. Reference: 1. W. feller, “An introduction to probability theory and its applications,” vol 183,wiley eastern Ltd. ND. 2. Gordon. G. System Simulation,PHI ,delhi.

56

e. Error free comparison. student may be asked to attempt only 1 question from each unit. TEXT BOOKS: 1. Histogram Processing. Each question should be 10 marks UNIT – I Introduction And Digital Image Fundamentals The origins of Digital Image Processing. It should be of 20 marks. 1 should be compulsory and cover the entire syllabus. Interpixel and Psychovisual Redundancy. UNIT – II Image Enhancement in the Frequency Domain Introduction to Fourier Transform and the frequency Domain. Distance Measures between pixels. Noise Models. Inverse filtering. Basics of Spatial Filters. Linear Position-Invarient Dedradations. This question should have objective or short answer type questions. Edge linking and boundary detection. Every unit should have two questions. Tech/M. Geometric Mean Filter. UNIT – IV Representation and Description Representation. Introduction to Morphology. Constrained Least Square Filtering. for batch 2006-07 . Use of Principal Components for Description. Smoothing and Sharpening Frequency Domain Filters. 2000 57 Syllabus for B. However. L:3 T/P:1 C:4 Paper: Digital Image Processing Maximum Marks : 60 Question No. Image Enhancement in the Spatial Domain Some basic Gray Level Transformations. Structural Methods. Woods. “Digital Image Processing”. 09 and 26th AC Meeting on 19 th Jan. Linear and Non Linear Operations. 2nd Ed. Pereodic Noise Reduction by Frequency Domain Filtering. “Fundamental of Digital Image Processing”.K. Restoration in the presence of Noise Only Spatial Filtering. Enhancement Using Arithmetic and Logic operations. Pearson Edu. Elements of Digital Image Processing Systems. Image Segmentation: Detection of Discontinuities. Image Restoration: A model of The Image Degradation / Restoration Process. 1999 2. Geometric Transformations. Connectivity. Motion based segmentation. Thresholding. Examples of Fields that Use Digital Image Processing. “Digital Picture Processing”. Estimation of Degradation Function. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Image Sampling and Quantization. Decision-Theoretic Methods. Boundary Descriptors. 1. rest of the paper shall consist of four units as per the syllabus. Region Oriented Segmentation. Wiener filtering. Homomorphic Filtering. PHI. Lossy compression.K.A. UNIT – III Image Compression Coding. Jain. Gonzalez & Richard E. Some basic relationships like Neighbours. 09 w. Elements of Information Theory.Paper Code: IT-411 Paper ID: 15411 INSTRUCTIONS TO PAPER SETTERS: 1. Apart from Question No. 2004 2. “Digital Image Processing”.Rafael C. Combining Spatial Enhancement Methods. Regional Descriptors. Some basic Morphological Algorithms. 2003 REFERENCES: 1. Image compression standards. Pratt. Fundamentals Steps in Image Processing. Smoothening and Sharpening Spatial Filters. 2. Object Recoginition: Patterns and Pattern Classes. Image Compression models. W.f. Rosefield Kak.

Apart from Question No. Reading Initialization parameters. 1 should be compulsory and cover the entire syllabus. Goldberg. Reading Servelet parameters. 2001. Application – Specific Database Actions. “Using HTML 4. Introduction to struts framework. Every unit should have two questions.Accessing a Database from a JSP Page. Using Bound properties. POP3. Conditional Processing Sharing Session and Application Data Memory Usage Considerations UNIT IV: Database Access : Database Programming using JDBC. The javax. KS: 2. Customizes. Bean Info Interface. for batch 2006-07 . Frames. Persistence. Introduction to JSP: The Anatomy of a JSP Page. S P D O’Reilly 58 Syllabus for B. Pearson Education 2. Using XML Processors: DOM and SAX . Constrained properties . Document Object model. XML Schemas. Java Beans: Introduction to Java Beans. The Servelet API. Introduction to Servelets: Lifecycle of a Serverlet. Introspection..Deploying JAVA Beans in a JSP Page. MIME. This question should have objective or short answer type questions. The javax. Bill Siggelkow. 09 w. “Java Server Pages “. Rajkamal. JSP Application Design with MVC . Jim O’ Donnel.e. TEXT BOOK 1.f. SPD O’Reilly REFERENCES 1 “Web Technology”. Tech/M. Deitel & Deitel. It should be of 20 marks. Each question should be 10 marks UNIT-I: History of the Internet and World Wide Web – HTML 4 protocols – HTTP. BDK . Tables. JSP Application Development: Generating Dynamic Content. Introduction to EJB’s UNIT-III Web Servers and Servlets: Tomcat web server. Studying Javax. Introduction to Java Scripts. Java Beans API. Web Programming. building internet applications. 2. forms. Security Issues. Tata McGraw-Hill. The complete Reference Java 2 Fifth Edition by Patrick Naughton and Herbert Schildt. Objects in Java Script. Using Scripting Elements Implicit JSP Objects. Chris Bates 2nd edition. JSDK.Paper Code: IT-413 Paper ID: 15413 INSTRUCTIONS TO PAPER SETTERS: 1.Hans Bergsten. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. rest of the paper shall consist of four units as per the syllabus. 1. L:3 T/P:1 C:4 Paper: Front End Design Tools & Web Technologies Maximum Marks : 60 Question No. XML and JAVA”.. WILEY Dreamtech 3. Jakarta Struts Cookbook . 09 and 26th AC Meeting on 19 th Jan. Eric Ladd. Programming world wide web-Sebesta. Handling Http Request & Responses.* package. However. “Internet and world wide web – How to Program”. Advantages of Java Beans.List. images. student may be asked to attempt only 1 question from each unit. Prentice Hall of India 3.servelet HTTP package. Presenting XML. Dynamic HTML with Java Script UNIT-II XML: Document type definition. TMH 4. HTML Common tags.sql. SMTP. IMAP. Using Cookies-Session Tracking.servelet Package. Cascading Style sheets. Pearson 5.

Apart from Question No. Writing a Custom Tag Library Unit 3 Struts. Each question should be 10 marks Unit 1 : Distributed Systems for Enterprise and Web-Based Applications . 1 should be compulsory and cover the entire syllabus. ActionServlet. & Failure .e. Multi-Tiered Architectures . Heterogeneity. sharanam shah Java Server Programming . Struts classes . Page directive attributes. RMI: Remote Method Invocation Unit 2: MVC Architecture. 09 w. However. J2EE: JNDI. Struts architecture. rest of the paper shall consist of four units as per the syllabus. Web Services . Messaging & Interfaces . It should be of 20 marks. Creating a small application using Tiles Unit 4 : Distributed System Models . 09 and 26th AC Meeting on 19 th Jan. Combining Struts and Tiles. student may be asked to attempt only 1 question from each unit. Thomson 59 Syllabus for B.. Joe wigglesworth . TMH References : 1. ActionForm. JSP Tag libraries . Creating a Definition in XML file and deploying . Localization Text Books : 1. Ivan Bayross . Understanding struts-config. web application structure. The Challenges of Scalability. 2. Interfaces .ActionForward. G. Replication. Holzner . Tech/M. Tiles file structure . Pearson Education 2. for batch 2006-07 .xml . Security.f. Transactions . JSTL Expression Language (EL) . JSP pages and its elements JSP Architecture. Java Programming : advanced topic . JSP Page life cycle. Coulouris. Struts Tiles . Structs : Essential skills . request response model.. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Understanding Tiles Definitions and Attributes . Concepts and Design . shroff Publishers 2. 1. McMilan Paula . Messaging. J2EE: EJB Session Beans . Servlet. Servlet life cycle. Every unit should have two questions. This question should have objective or short answer type questions. JDBC: Java Database Connectivity . Action classes . L:3 T/P:1 C:4 Paper: Advanced Java Programming Maximum Marks : 60 Question No. & Kindberg. EJB Entity Beans & Deployment Descriptors .Paper Code: IT-415 Paper ID: 15415 INSTRUCTIONS TO PAPER SETTERS: 1. Distributed Systems. Dollimore. J.

09 and 26th AC Meeting on 19 th Jan.f. Report of the same is required to be submitted to the school.Paper Code: IT-451 Paper ID: 15451 L:0 T/P:2 C:1 Paper: Advanced Computer Network Lab Paper Code: IT-461 Paper ID: 15461 L:0 T/P:2 C:1 Paper: Software Testing Lab Paper Code: IT-455 Paper ID: 15455 L:0 T/P:2 C:1 Paper: Lab assignments This lab will be based on elective paper(s).e. for batch 2006-07 . USIT. 09 w. Paper Code: IT-457 Paper ID: 15457 L:0 T/P:0 C:5 Paper: Minor Project Paper Code: IT-459 Paper ID: 15459 L:0 T/P:0 C:1 Paper: Summer Training Report Students will undergo summer training/industry visit/In-house training/In-house project during the summer break after the completion of sixth semester. 60 Syllabus for B. Tech/M. A panel of examiner will be appointed by the Dean. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Viva-voce examination will be conducted based on the report submitted by the student.

1981. Forsyth. 1. This question should have objective or short answer type questions. Unit-II The Technical Writing Process: Prewriting Stage. Pagination.Paper Code: HS-402 Paper ID: 15402 INSTRUCTIONS TO PAPER SETTERS: 1. Charles H.e. Recommendations and Feasibility Reports. Analysis Reports Professional Communication. Reflective and Literary-Evaluative Writing. Technical Writing: Definition. Sides. The Writing Stage and the Postwriting stage.. L:2 T/P:0 C:2 Paper: Technical Writing Maximum Marks : 60 Question No. Narrative. Format Devices in the Body of Formal Report-Heading. References and Bibliography. for batch 2006-07 . Cambridge. Front Material. Presentation and Meetings. Description. Cambridge University Press. 61 Syllabus for B. Each question should be 10 marks Unit-I Writing Skills: Descriptive. End Material—Citations. Visual Aids. However.f. Progress Reports. It should be of 20 marks. Every unit should have two questions. 3. rest of the paper shall consist of four units as per the syllabus. Sandy and Lesley Hutchison. Appendix. 09 w. 1999. Unit-IV Technical Writing Applications: Memorandums and Informal Format. “How to Write and Present Technical Information”. 2. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Technical Writing Skills: Researching. Formal Format. Summarizing and Outlining. “Business Communication. 2. Definition. “Practical Composition”. Argumentive and Discursive. South-Western College Publishing. Edinburgh Oliver and Boyd. Set of Instructions. student may be asked to attempt only 1 question from each unit. Letters and Job Applications. 1 should be compulsory and cover the entire syllabus. Proposals. Cincinnati”. Unit-III Formal Formatting: Arrangement of Formal Elements. Tech/M. Text/References: 1. 09 and 26th AC Meeting on 19 th Jan. Apart from Question No. Mary Ellen. Guffey. 2000. Purpose and Characteristics of Technical Writing.

“computer Architecture and organization”. Every unit should have two questions.Ghose.Fountain. Arithmetic Pipeline Design. “Advanced Computer Architecture-A Design space Approach. Comparisons of flow mechanisms Unit-II Pipelining: Linear pipeline processor. PHI. “Computer Organisation & Architecture”. 2003 Kai Hwang and Zu. Division. Grain Size and latency. Multifunctional arithmetic pipelines Unit-III Arithmetic for computers Signed and unsigned Numbers. Hwan and Briggs. 1998 Harvey G. Pipelined and Parallel Processor Design”. 4. 09 w. L:3 T/P:1 C:4 Paper: Advanced Computer Architecture Maximum Marks : 60 Question No. 1.Murthy. Each question should be 10 marks Unit-I Parallel computer models: The state of computing. M. 2. 2000 D. branch prediction. A. Program partitioning and scheduling. Tech/M. MGH. 7. for batch 2006-07 . Kai Hwang.Kasuk. P.e. It should be of 20 marks. 2nd Ed. MGH. “Parallel computer”. Hardware and software parallelism. rest of the paper shall consist of four units as per the syllabus. L.Hennessy. 8. 1998 D. Multivector and SIMD computers. Instruction pipeline Design. Hennessey. 1999 62 Syllabus for B. The basics of Cache. TMH. Narosa Publication.R. “Foundation of Parallel Processing”. J.J Flynn. Data and resource Dependences. “Computer organization and design”.”Addison Wesley. Rajan Moona & Phalguni Gupta.L. 1 should be compulsory and cover the entire syllabus.Cragon. 3.Rajaranam & C. 09 and 26th AC Meeting on 19 th Jan. “Advanced computer architecture”. D.f. Static Arithmetic pipeline. Evaluating performance of CPU. 10. J. This question should have objective or short answer type questions.2002.Hayes.P. Program flow mechanisms.Patterson.A. 6. Virtual Memory. Data flow Architecture. Dynamic instruction scheduling. 5. Narosa Publications.1997. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. “Scalable Parallel Computers Architecture”. Multiprocessors and multicomputers. Apart from Question No. Narosa Publishing. Morgan Kauffmann feb. Program and network properties: Conditions of parallelism.Sima. MGH. 2002 Reference Books: 1. 2. 1998 V. “ Computer Architecture and Parallel Processing”. 2000 2. 9. Floating Point. Addition and Subtraction. Mechanisms for instruction pipelining. student may be asked to attempt only 1 question from each unit.”Memory System and Pipelined processors”. Common framework for memory hierarchies Case study of PIV and AMD opteron memory hierarchies Text Books: 1. Unit – IV Memory Hierarchy Introduction. Demand driven mechanisms. CPU Performance and Its factors. nonlinear pipeline processor. “Computer Architecture. T. Morgan Kaufmann.S.Paper Code: IT-404 Paper ID: 15404 INSTRUCTIONS TO PAPER SETTERS: 1. However. Patterson and J.K. Multiplication. PHI. 2001 Stalling W. 2002 R. Control flow versus data flow. Branch Handling techniques. Computer arithmetic principles. Measuring and Improving of Cache Performance. Classification of parallel computers. “Computer Architecture :A quantitative approach”.

Transducers. “Automatic Control Systems” PHI – 7th Edition. Basic Control Actions: Proportional. state transition matrix and its properties. “Control Systems”. 4th Edition. Apart from Question No. 2nd Edition. Jain. Text Books: 1. Stability Analysis using. Minimum and Non-Minimum phase systems. It should be of 20 marks. However. Nagrath. “Automatic Control System Engineering” Dhanpat Rai. 2000.Paper Code: IT-406 Paper ID: 15406 INSTRUCTIONS TO PAPER SETTERS: 1. Examples of Control Systems. Each question should be 10 marks Unit I Definitions of Control Systems. Tech/M. Cenage Learning. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Polar Plots. References: 1. 2005.f. state space. J. integral and Derivative controllers. I. 1 should be compulsory and cover the entire syllabus.e. 09 w. state variables. Rotating Amplifiers and Magnetic Amplifiers. 1. for batch 2006-07 . This question should have objective or short answer type questions. K. 2. Solution of time invariant. position. 2. Tachogenerators. Unit IV Introduction to Compensators. transient. student may be asked to attempt only 1 question from each unit. Block Diagram representation and Simplification. Gopal. 3. M. Closed Loop and Open Loop Control. homogeneous state equation. velocity and acceleration error co-efficients. 09 and 26th AC Meeting on 19 th Jan. “ Modern Control Engineering”. Kuo. 4. Determination of Transfer from Bode Diagram. Unit III Root Locus Tecniques Bode Diagram. Nyquist Plot. Transient and steady state response of first order system. Unit II Signal Flow graph. Deriving transfer function of physical systems (Mechanical Translational Systems). C. Definitions of state. Every unit should have two questions. Constant M & N Ioci. Laplace Transformation and Solution of Differential Equations. 2008 63 Syllabus for B. Second order system. relative stability analysis. Linear and Non-Linear Systems. effect of feedback on control system. Less Fenical. “Control System Engineering” New Age International. Routh’s Stability criterion. representation of systems. Concept of Mathematical model. AC servomotors and deriving their transfer functions. L:3 T/P:1 C:4 Paper: Control Systems Maximum Marks : 60 Question No. D. Z transform and solution of different equation. N. Mason gain formula. PHI. Choudhary. rest of the paper shall consist of four units as per the syllabus. Ogata. Transfer Function with Simple Examples. Armature controlled and field controlled DC servomotors. B. 2. Static error co-efficients. “Modern Control Engineering” EEE. R. Stepper Motor. synchro-transmitter.

Somayajulu.. “Database System Concepts”. Rules about functional dependencies. Long Duration Transactions. 1 should be compulsory and cover the entire syllabus. L:3 T/P:1 C:4 Paper: Advanced Database Management Systems Maximum Marks : 60 Question No. Generalization. Aggregation and Association. Singh S. Weak Levels of Consistency. 09 and 26th AC Meeting on 19 th Jan. Functional. Oracle Xi Reference Manual 8. Algorithms for Rule Discovery Data Warehousing Data Warehousing Architecture. “Database System Concepts. Transaction Work Flows. “An Advanced Course in Database Systems”. Garcia. Parallel Query Evaluation. Navathe. rest of the paper shall consist of four units as per the syllabus. Transformation of Relational Expressions. 2007 3. 1999 7. Swaminathan. “The Theory of Relational Databases”. 1993. Normal Forms. Kannan. Multidimensional Data Model. It should be of 20 marks. for batch 2006-07 . Distributed Transaction Modeling and concurrency Control. W. Korth. 3. Date. “An Introduction to Database Systems”. Each question should be 10 marks Unit-I Relational Databases Integrity Constraints revisited. Muiltivalued and Join Dependency. Dietrich. Rokville. Objects.. D. Mcgraw Hill. Every unit should have two questions. R. 2. Extended ER diagram. Pearson. 1. Maier. Galgotia publications. Objected Oriented and Object Relational Databases Modeling Complex Data Semantics. Unit-II Query Processing and Optimization Valuation of Relational Operations. Tech/M. Apart from Question No. Gupta. Architecture of Object Oriented and Object Relational Databases Unit-III Parallel and Distributed Databases Distributed Data Storage – Fragmentation & Replication. Sequential Patterns. “Modern Database Systems”. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Relational Algebra & Calculus. Pearson Education. Computer Science Press. Kim. “Database Systems. Compensating Transactions and Saga. ACM Press. and Urban. “Principals of database systems”. Pearson Education.e. Commit Protocols. 5. 2007 2. “Fundamentals of Database Systems”. 1998 References: 1. Specialization. Ullman. 2006 4. Ramakrishnan. Pearson Education. Association and Classification Rules. However. Update Propagation Case Study: Oracle Xi Text Books: 1. Transaction Processing Monitors. 2008. 2006. J. McGraw Hill International Editions. Maryland 6. 6th Edition. “Database Management Systems”. 8th Edition Pearson Education. Unit -IV Data Mining Knowledge Representation Using Rules.Paper Code: IT-408 Paper ID: 15408 INSTRUCTIONS TO PAPER SETTERS: 1. 64 Syllabus for B. student may be asked to attempt only 1 question from each unit. Sudarshan. The complete book”. Silberscatz. Limitations of Relational Data Model. Distributed Deadlock. Indexing and Query Optimization. 09 w. Equality and Object Reference. 4th Edition. 2007 2. Addision – Wesley. Widom. This question should have objective or short answer type questions. Object Identity.f. Location and Fragment Transparency Distributed Query Processing and Optimization. 1995. Elmarsi. Null Values and Partial Information. Advanced Transaction Processing Nested and Multilevel Transactions. D. Ullman.K. Design of Parallel Databases. design and application”.

Fuzzy Logic: Classical Logic. California. 1999. It should be of 20 marks. Applications and Programming Techniques”. Learning rules. PHI.f.A. Each question should be 10 marks Unit-I Neural Networks: History. Krogh. Unit-IV Introduction of Neuro-Fuzzy Systems: Architecture of Neuro Fuzzy Networks. Freeman J. Lattice of Fuzzy Numbers. However. 2. de Silva. & D. (1992). Unit-III Fuzzy Arithmetic: Fuzzy Numbers. 2. Associative Memories. rest of the paper shall consist of four units as per the syllabus. Hertz J.M. Fuzziness of Fuzzy Sets. Applications of Artificial Neural Networks. Apart from Question No. Intersections. Fuzzy Equations. “Soft computing and Intelligent System Design”. Skapura. Operations on Fuzzy Sets: Compliment. 1 should be compulsory and cover the entire syllabus. 09 and 26th AC Meeting on 19 th Jan. 2. Prentice-Hall International. Back Propagation Algorithm.G. Membership Function. Reading. ANN training Algorithms-perceptions. Uncertainty based Information: Information & Uncertainty. Hopfield Networks. 1995. Aggregation Operations. Learning Paradigms-Supervised. for batch 2006-07 . “Fuzzy Sets & Fuzzy Logic”. Every unit should have two questions. “Neural Networks-A Comprehensive Foundations”. ANN architecture. Genetic Algorithm: An Overview. G. Application of Fuzzy Logic: Medicine. Linguistic Variables. Economics etc.e. Karray and C. Delta. This question should have objective or short answer type questions. unsupervised and reinforcement Learning. Unit-II Fuzzy Logic: Introduction to Fuzzy Logic. Multilayer Perceptron Model. Reference: 1. Classical and Fuzzy Sets: Overview of Classical Sets. 1. 1991. Fuzzy rule generation.Paper Code: IT-410 Paper ID: 15410 INSTRUCTIONS TO PAPER SETTERS: 1. Mathematical Models of Neurons. 2009. Addison-Wesley. Implementation of GA Text Books: 1. Mass. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. R. New Jersey. Yuan. 3. Unions. PHI. Tech/M. Palmer. “An Introduction to Genetic Algorithm”. Arithmetic Operations on Intervals & Numbers. GA in problem solving. Nonspecificity of Fuzzy & Crisp Sets. “Introduction to the Theory of Neural Computation”. Combinations of Operations. overview of biological Neuro-system. Training rules. Melanie Mitchell. Addison Wesley.J. L:3 T/P:1 C:4 Paper: Soft Computing Maximum Marks : 60 Question No. 65 Syllabus for B. Multivalued Logics. student may be asked to attempt only 1 question from each unit. “Neural Networks: Algorithms. 4. Fuzzy Propositions. 09 w. Klir & B. 1998. O. Fuzzy Qualifiers. F. Pearson.

1 should be compulsory and cover the entire syllabus. language rammer and sematics by P. functional specification.Paper Code: IT-412 Paper ID: 15412 INSTRUCTIONS TO PAPER SETTERS: 1. L:3 T/P:1 C:4 Paper: Natural Language Processing Maximum Marks : 60 Question No. characterstic of Language. An introduction to Linguistics.f. 09 and 26th AC Meeting on 19 th Jan. major goal. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Language structure. This question should have objective or short answer type questions. for batch 2006-07 . rest of the paper shall consist of four units as per the syllabus. 09 w.V. Apart from Question No. well formedness conditions.e. It should be of 20 marks. Natural language processing by akshar Bhartati. Tech/M. However. Language analyzer UNIT 2 Study of grammer and semantics Morphology. Each question should be 10 marks UNIT-1 Introduction to NLP Achievement and brief history. open problems. Eastern Economy Edition 66 Syllabus for B. Eastern Economy Edition 2. student may be asked to attempt only 1 question from each unit.. word formation.Jindal. CFG and Indian languages. language Accesor. functional grammer (LFG ) and Indian languages Overview of LGF. theory of semeatics. Approaches. computational aspects. UNIT 4 Lexical. truth conditional theory of meaning. componential theory of meaning. Every unit should have two questions. Sangal and Chaitanya. 1. Structure of Anusaraka system. BOOKS1. 2. problems of machine translation.Syal and D. LFG formalism. pragmatics and discourse UNIT 3 Machine translation Introduction. tree adjoining grammer.

Understanding the Web. familiarization with visual studio . Features of VS. Chappell. XML Editor. Understanding DataReaders.NET Architecture.NET Framework Class Library . delegates. Docking Windows.NET Framework . Addison Wesley.NET Server Controls. Explorer. It should be of 20 marks. Anchoring Controls. Each question should be 10 marks Unit -1 : Introduction to Three-Tier Architecture. Properties Explorer. “Understanding . Differences between DataReader Model and DataSet Model. Adding Controls. Using the Global. Connecting the dialog. Creating a User Control.NET. exceptions. DataColumn. Using details inside the ListView. O’really 2. 2. Controls. Add Reference. 09 and 26th AC Meeting on 19 th Jan. Changing the Startup Form. Adding a Tab-Control. 1. Unit IV: ADO. Using DSN Connection . Creating a Multiple Document Interface. Working with System.NET IDE . Toolbox. Working with Odbc. Tech/M. Debugging a Project Unit II : Introducing C# Programming . Implementing Drag and Drop. Understanding the ConnectionObject.Net Framework & C# programming INSTRUCTIONS TO PAPER SETTERS: 1. Attaching a Context Menu.e. “Programming C#. relations between types) . Testing the Control. Dynamic Help. Every unit should have two questions.Data.NET Architecture. Building an ImageList and add them to the ListView. introduction. Server . However. Maximum Marks : 60 Question No. 09 w. Apart from Question No. Common Language Runtime (CLR) . Writing a Custom Control. Adding a TreeView. . Adding an Event Handler. Using ListView and TreeView controls. Solution Explorer. Design Window. Understanding the DataViewObject. Tech (dual degree) –CSE program approved in the BOS on 12th Jan. Creating a Project. Code Window.Understanding DataSets and DataAdapters.Paper Code: IT-414 L:3 T/P:1 C:4 Paper ID: 1514 Paper: Windows . basic language constructs. Creating Controls at run time. Build the Project.OleDb.asax Page Text book and References : 1. Using DataReaders. Building the Connection String.config File. DataTable. Networking Unit III : Windows Forms. 3rd Edition “ Jesse Liberty . Using Stored Procedures. Using DataSets. collections. Understanding the CommandObject. This question should have objective or short answer type questions. DataRow. generics.NET”. 1 should be compulsory and cover the entire syllabus.NET. Custom Controls. Working with User. threads . The . Creating a Dialog Form Using Form Inheritance. Working with SQL.NET. Adding Functionality. Adding Controls at Runtime Attaching an Event Handler at Runtime. Creating a Menu Adding a New Form. strings . David. C# for Programmers. Pearson 3 . Adding a Property. overview of . Task List Explorer. rest of the paper shall consist of four units as per the syllabus.f. ASP. Deitel and Deitel. Object Browser. for batch 2006-07 . 2006 67 Syllabus for B. student may be asked to attempt only 1 question from each unit. Writing a Simple Text Editor. Introducing the ASP. types (reference and value.

Paper Code: IT-452 Paper ID: 15452 L:0 T/P:0 C:8 Paper: Major Project (Report) Paper Code: IT-454 Paper ID: 15454 L:0 T/P:0 C:2 Paper: Viva-voce (on Major Project) Paper Code: IT-456 Paper ID: 15456 L:0 T/P:0 C:1 Paper: Seminar and Progress report This paper will be based on project work (IT-452). 09 w. 09 and 26th AC Meeting on 19 th Jan.f. Tech/M. Paper Code: IT-458 Paper ID: 15458 L:0 T/P:0 C:1 Paper: Lab assignment Lab will be based on elective paper(s). Tech (dual degree) –CSE program approved in the BOS on 12th Jan. for batch 2006-07 . Seminar will be held in the school for the purpose of evaluation of the progress of the project work.e. 68 Syllabus for B.

- Syllabus CSE I-V
- Journal of Computer Science and Information Security IJCSIS May 2013
- Dijkstra Interview
- Pilot Programs for Coding in KCKPS
- Network 2
- Vita
- 2012 Computer Science and Engineering Undergraduate Teaching Award
- CS Major Columbia
- Copy of Chap 03 1
- Req Interactin Matrix
- Time Table Ch Slides
- Resume mine
- SOP 2 Testing (1)
- Proposal v5
- Functional English for Entrepreneurs
- 2015 Lyp Class 12 Computer Science Delhi Ans
- Travelling Salesman Problem
- New Comp
- Vishnu Resume
- QualisPeriodicoCienciaDaComputacao
- m Tech Papers
- Grad Student Handbook 2013
- Hitendra CV 2013
- Informatica Interview
- 10.1.1.18.4933
- 1st Semester Repeater Exam August 2012
- Reasoning and Mental Aptitude for Entrance Test
- Ecolier
- 485syllabus
- Time Independent Perturb
- Syllabus

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd