SCHEME OF EXAMINATION

&

DETAILED SYLLABUS

for

BACHELOR OF TECHNOLOGY (Information Technology)

GURU GOBIND SINGH
INDRAPRASTHA UNIVERSITY
KASHMERE GATE, DELHI

BACHELOR OF TECHNOLOGY
(B.TECH.) DEGREE COURSE (Common to all branches)
FIRST SEMESTER EXAMINATION

Code No. Paper THEORY PAPERS ETMA 101 Applied Mathematics – I ETPH 103 Applied Physics – I ETCH 105 Applied Chemistry – I ETME 107 Manufacturing Process ETCS 109 Introduction to Computers and Auto CAD ETEL 111 Communication Skills – I ETEL 113* Impact of Science & Technology on Society PRACTICAL/VIVA VOCE ETPH 151 Applied Physics Lab. – I ETCH 153 Applied Chemistry Lab. – I ETCS 155 Introduction to Auto CAD Office Automation and Web Design ETME 157 Workshop Practice ETME 159 Engineering Graphics Lab. TOTAL
ETEL-113* is NUES

L 3 2 2 2 2 2 1

T/P 1 1 1 0 1 1 0

Credits 4 3 3 2 3 3 1

-

2 2 3

1 1 2

14

3 2 17

2 1 26

BACHELOR OF TECHNOLOGY
(B.TECH.) DEGREE COURSE (Common to all branches)
SECOND SEMESTER EXAMINATION

Code No. Paper THEORY PAPERS ETMA 102 Applied Mathematics – II ETPH 104 Applied Physics – II ETCH 106 Applied Chemistry – II ETCS 108 Introduction to Programming ETME 110 Engineering Mechanics ETEC 112 Electrical Science ETEL 114 Communication Skills – II PRACTICAL/VIVA VOCE ETPH 152 Applied Physics Lab. – II ETCH 154 Applied Chemistry Lab. – II ETCS 156 C Programming Lab. ETME 158 Engineering Mechanics Lab. ETEC 160 Electrical Science Lab. TOTAL

L 3 2 2 2 2 2 2 15

T/P 1 1 1 1 1 1 1 2 2 2 3 2 18

Credits 4 3 3 3 3 3 3 1 1 1 2 1 28

PSPICE. ETEC 253 *Circuits & Systems Lab.BACHELOR OF TECHNOLOGY (Information Technology) THIRD SEMESTER EXAMINATION Code No. ETCS 257 Data Structure Lab. TOTAL • L 3 3 3 3 3 3 0 0 0 0 18 T/P 1 1 1 1 1 1 2 2 2 2 14 Credits 4 4 4 4 4 4 1 1 1 1 28 Some lab experiments must be performed using any circuit simulation software e. ETIT 255 Object Oriented Programming using C++ Lab. .g. Paper THEORY PAPERS ETMA 201 Applied Mathematics – III ETCS 203 Analog Electronics ETEC 205 Circuits and Systems ETCS 207 Foundations of Computer Systems ETIT 209 Object Oriented Programming using C++ ETCS 211 Data Structures PRACTICAL/VIVA VOCE ETCS 251 *Analog Electronics Lab.

However.BACHELOR OF TECHNOLOGY (Information Technology) FOURTH SEMESTER EXAMINATION Code No. . ETCS 258 Computer Graphics Lab. TOTAL L 3 3 3 3 3 3 0 0 0 0 18 T/P 1 1 1 1 1 1 2 2 2 2 14 Credits 4 4 4 4 4 4 1 1 1 1 28 * Some lab experiments must be performed using any circuit simulation software e. Viva-Voce will be conducted in the fifth semester. ETEC 256 *Digital Circuits & System – I Lab. PSPICE. NOTE: 4-6 weeks training will be held after fourth semester.g. Paper THEORY PAPERS ETCS 202 Software Engineering ETCS 204 Algorithm Analysis & Design ETEC 206 Digital Circuits & System – I ETIT 208 Communication Systems ETCS 210 Computer Graphics ETCS 212 Operating Systems PRACTICAL/VIVA VOCE ETCS 252 Software Engineering Lab. ETCS 254 Algorithm Analysis and Design Lab.

ETCS 357 Database Management Systems Lab. Viva-Voce for evaluation of Practical Training will be conducted in this semester. ETIT 359 #^Practical Training TOTAL L 3 3 3 3 3 3 0 0 0 0 0 18 T/P 1 1 1 1 1 1 2 2 2 2 0 14 Credits 4 4 4 4 4 4 1 1 1 1 1 29 #NUES ^Practical training was conducted after fourth semester. ETIT 353 Java Programming & Website Design Lab. ETIT 355 Digital Communication – I Lab. .BACHELOR OF TECHNOLOGY (Information Technology) FIFTH SEMESTER EXAMINATION Code No. However. Paper THEORY PAPERS ETEC 301 Digital Circuits & Systems – II ETIT 303 Java Programming and Website Design ETCS 305 Computer Architecture ETIT 307 Digital Communication – I ETCS 309 Database Management Systems ETMS 311 Organizational Behaviour PRACTICAL/VIVA VOCE ETEC 351 Digital Circuits & Systems – II Lab.

Paper THEORY PAPERS ETCS 302 Microprocessor Systems ETCS 304 Object Oriented Software Engineering ETIT 306 Computer Networks ETIT 308 Digital Signal Processing ETCS 310 Data Warehousing & Data Mining ETIT 312 Digital Communication . TOTAL L 3 3 3 3 3 3 0 0 0 0 0 18 T/P 1 1 1 1 1 1 2 2 2 2 2 16 Credits 4 4 4 4 4 4 1 1 1 1 1 29 ^Practical training was conducted after sixth semester.II Lab. ETIT 356 Digital Signal Processing Lab. However.II PRACTICAL/VIVA VOCE ETCS 352 Microprocessor Lab. Viva-Voce for evaluation of Practical Training will be conducted in this semester. ETIT 360 Digital Communication . ETIT 358 Data Warehousing & Data Mining Lab. . ETCS 354 Object Oriented Software Engineering Lab.BACHELOR OF TECHNOLOGY (Information Technology) SIXTH SEMESTER EXAMINATION Code No.

. ETIT 453 Multimedia Applications Lab.BACHELOR OF TECHNOLOGY (Information Technology) SEVENTH SEMESTER EXAMINATION Code No. Paper THEORY PAPERS ETIT 401 Advanced Computer Networks ETIT 403 Multimedia Applications ELECTIVE PAPERS (Choose any two) ETCS 405 Compiler Construction ETEC 407 Mobile Computing ETIT 409 VLSI Design ETEC 411 Digital Image Processing ETCS 413 Requirements & Estimation Techniques ETCS 415 Advanced Computer Architecture ETIT 417 Project PRACTICAL/VIVA VOCE ETIT 451 Advanced Computer Network Lab. Viva-Voce for evaluation of Practical Training will be conducted in this semester. The student will have to present the progress of the work through seminars and progress reports. However. ETIT 455 Practical Lab (based on Electives) ETIT 457 #Seminar ETIT 459 *Minor Project ETIT 461 #^Practical Training TOTAL # NON UNIVERSITY EXAMINATION SYSTEM L 3 3 3 3 3 3 3 3 0 0 0 0 0 0 12 T/P 1 1 1 1 1 1 1 1 2 2 2 2 8 0 20 Credits 4 4 4 4 4 4 4 4 4 1 1 1 1 4 1 25 *The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format. ^Practical training was conducted after sixth semester.

ETIT 454 Practicals (based on Electives) ETIT 456 *Major Project TOTAL L 3 3 3 3 3 3 3 0 0 0 09 T/P 1 1 1 1 1 1 1 2 2 14 21 Credits 4 4 4 4 4 4 4 1 1 7 21 *The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format. (IT) Programme = 214 Each student shall be required to appear for examinations in all courses. The student will have to present the progress of the work through seminars and progress reports. The total number of the credits of the B.BACHELOR OF TECHNOLOGY (Information Technology) EIGHTH SEMESTER EXAMINATION Code No. 2. Paper THEORY PAPERS ETIT 402 Mobile Communication ETEC 404 Embedded System ELECTIVE PAPERS (Choose any one) ETCS 406 Soft Computing ETCS 408 Artificial Intelligence ETIT 410 E-Commerce & ERP ETIT 412 Network Security ETIT 414 Software Testing PRACTICAL/VIVA VOCE ETEC 452 Embedded System Lab. for the award of the degree a student shall be required to earn the minimum of 200 credits. However. .Tech. NOTE: 1.

Jain. . Length of the curves. Kresyzig. [No. Leibnitz theorem (without proof) McLaurin’s and Taylor’s expansion of functions. S.. Variation of parameters. Narosa. 15] UNIT III LINEAR ALGEBRA – MATERICES: Rank of matrix. Hermitian and skeew – Hermitian forms.. Alternating series. Lebnitz test. 2. Circular. Reduction Formulae for evaluating Finding area under the curves. Caley – Hamilton theorem (without proof). Logarithmic Functions. Every unit should have two questions. Comparison test d’Alembert’s ratio test. 1 should be compulsory and cover the entire syllabus. Asymptotes of Cartesian curves. It should be of 25 marks. equiangular spiral). K. Eigen values and eigen vectors. R. 2003 (2nd Ed. However. parametric and polar coordinates. Apart from question no. “Advanced Engineering Mathematics”. Tracing of curves in Cartesian. Solution of homogeneous differential equations – Canchy and Legendre forms. [No. and Iyengar.Paper Code: ETMA-101 Paper: Applied Mathematics – I L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Circle. of Hrs. (Latest edition). Cauchy’s root test. astroid. E. Higher ratio test. rest of the paper shall consist of four units as per the syllabus.). student may be asked to attempt only 1 question from each unit. hypocycloid. Diagonalisation of a matrix. Absolute and conditioinal convergence. R. of Hrs. Consistency of linear simultaneous equations. Curveture of curves in Cartesian. 1. Inverse of matrix by elementary operations. of Hrs. 09] UNIT IV ORDINARY DIFFERENTIAL EQUATIONS: First order differential equations – exact and reducible to exact form. parametric and polar coordinates (like conics. Folium of Descartes. Solution of simultaneous differential equations. volume and surface of solids of revolution. [No. UNIT I COMPLEX NUMBERS AND INFINITE SERIES: De Moivre’s theorem and roots of complex numbers. Question No. Hyperbolic Functions and their Inverses. Linear transformations. K. of Hrs. Each question should be of 12. Cycloid. errors and approximation. 10] TEXT BOOKS: 1. “Advanced Engineering Mathematics”. Convergence and Divergence of Infinite series. 10] UNIT II CALCULUS OF ONE VARIABLE: Successive differentiation. Euler’s theorem. Linear differential equations of higher order with constant coefficients. (No. John Wiley and Sons. Cardiode. Lemniscate of Bernoulli. 2.5 marks. This question should have objective or short answer type questions.

M. 2001. A. Jaggi (Khanna publications) . V. P. P. V. “Modern Advanced Mathematics for Engineers”. 1995. Polis. John Wiley and Sons. A. R.. “Advanced Engineering Mathematics”. 2. D. B. Mitin. 3. “Advanced Engineering Mathematics”. V.. Mathur.REFERENCE BOOKS: 1. and Romanov.. McGraw-Hill. Wylie. Dr.

dispersive power of Grating. student may be asked to attempt only 1 question from each unit. Inverse square force. Each question should be of 12.. specific rotation. Interference. SHM.. Fraunhoffer diffraction due to N slits. Lorentz transformations (space – time coordinates & velocity only). UNIT . “Concepts of Modern Physics” . N. rest of the paper shall consist of four units as per the syllabus. absent spectra.II Polarization: Introduction. 8] TEXT BOOKS: 1. [No. Brewster and Malus Laws. Jenkins and White. Every unit should have two questions. Diffraction: Fresnel Diffraction. Optical Instruments : Ramdson & Huygen Eye pieces. Newton rings. production of plane polarized light by different methods. Electron microscope. Einstein’s Coefficients. Nicol prism. Theory of Biprism. temporal and spatial coherence. undamped and forced Oscillations. attenuation & dispersion mechanism in optical fibers (Qualitative only). Damped. He-Ne Laser. A. Laurent’s half shade polarimeter. 8] UNIT . Principle of Superposition.5 marks. application of optical fibres.I Interference of Light: Interference due to division of wavefront and division of amplitude. 8] UNIT . Ruby Laser. wedge shaped films. step index and graded index fibres. Interference from parallel thin films. Application of Lasers. 3. Ghatak. 1 should be compulsory and cover the entire syllabus. of Hrs. Diffraction grating. Fibre Optics: Introduction. of Hrs. “Optics” 2. numerical aperture. Diffraction at a straight edge. Special theory of Relativity: Frame of reference. resolving power of prism and grating. optical communication (block diagram only) [No. “Mechanics”.Paper Code: ETPH – 103 Paper: APPLIED PHYSICS – I L 2 T 1 C 3 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. stimulated and spontaneous emission.I. Vol. C. 8] UNIT . Question No. Michelson-Morley experiment. “Fundamentals of Optics” 2. [No. Double refraction. Quarter & half wave plate. This question should have objective or short answer type questions.III Laser: Introduction. A. “Optics” REFERENCE BOOKS: 1. basic postulates of special relativity. [No. It should be of 25 marks. However. principle of Laser. 2. mass energy relation.IV Mechanics: Central and non-central forces. Beiser. Apart from question no. Subrahmanyam and Brij Lal. Kittle. Young’s double slit expt. of Hrs. Berkeley Physics Course. Michelson interferometer. 1. of Hrs.

Numerical on calorific value. their sources. of Hrs: 08] UNIT . Apart from question no. proximate and ultimate analysis of coal. colloidal conditioning. of Hrs: 08] UNIT . combustion. HC. hardness. Solid Fuels: Proximate and ultimate analysis of coal and their importance.III Environmental Pollution and Control: Air Pollution: Types of pollutants. combustion and chemical principles involved in it. octane number and cetane number and their significance. Coke: Its manufacture by Otto Hoffman oven. UNIT ‐ I  Water: Specifications for water. This question should have objective or short answer type questions. Water Pollution: Classification of pollutants. Liquid Fuels: Conversion of coal into liquid fuels (Bergius process and Fisher-Tropsch Process) and mechanism. Soil Pollution: Composition of soil.5 marks. chemical and biological processes. their causes and prevention. calorific value: gross and net calorific values and their determination by bomb calorimeter and Boy’s gas calorimeter. Hazardous Wastes: Classification – radioactive. caustic embitterment and corrosion. Question No. boiler problems-scale. Henry’s Law. of Hrs: 08] UNIT . classification and effects of soil pollutants and their control. Analysis of flue gases by Orsat’s apparatus. thermal processes. Every unit should have two questions. Arrhenius theory and special behaviour of strong electrolytes. hardness and its determination (EDTA method only). EDTA method. source effects. High and low temperature carbonisation. sink and control of primary pollutants – CO. Numerical problems on alkalinity. [No. treatment and disposal – physical. [No.II Fuels: Classification. analysis of water – alkalinity. Raoult’s Law. Water softening processes – Lime – Soda process. removal of dissolved gases. waste water treatment – domestic and industrial. It should be of 25 marks.IV Solutions: Ideal and non-ideal solutions. [No. sludge. rest of the paper shall consist of four units as per the syllabus. cracking of heavy oil residues – thermal and catalytic cracking. Petroleum: its chemical composition and fractional distillation. boiler feed water. recycling and reuse). Nox. Solid Waste Pollution: Classification. student may be asked to attempt only 1 question from each unit. Water for domestic use. Sox and particulates. carbonate and phosphate conditioning. flue gas analysis. Distillation of binary solutions. power alcohol. priming and foaming. Nernst distribution law.Paper Code: ETCH – 105 Paper: Applied Chemistry – I L 2 T 1 C 3 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. sanitary landfilling. effects of pollutants on man and environment – photochemical smog and acid rain. waste treatment & Disposal methods (Composting. . Ion exchange method. However. knocking and chemical structure. removal of silica. calgon treatment. Each question should be of 12. 2. biomedical and chemical. 1 should be compulsory and cover the entire syllabus. 1. Lime-Soda process and Ion exchange method.

Dara 3. Chemistry in Engineering & Technology (Vol I & II) (Latest ed.). By H. wet. theories of corrosion.D. Environmental Chemistry & Pollution Control (Latest ed. Gesser . Rajaram 2. protective measures against corrosion. By J. Applied Chemistry (Latest ed. Kuriacose & J. of Hrs: 08] TEXT BOOKS: 1.).). atmospheric and soil corrosion).Corrosion: Types of corrosion (dry. By S. [No.S.C.

Paper Code: ETME 107 Paper: Manufacturing Processes

L 2

T 0

C 2

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 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 25 marks. 2. 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 of 12.5 marks.

UNIT - I Casting Processes: Principles of metal casting: Pattern materials, types and allowance; Study of moulding, sand moulding, tools, moulding materials, classification of moulds, core, elements of gating system, casting defects, description and operation of cupola: special casting processes e.g. die-casting, permanent mould casting, centrifugal casting, investment casting. [No. of Hrs. 6] UNIT - II Smithy and Forging: Basic operation e.g. upsetting, fullering, flattening, drawing, swaging: tools and appliances: drop forging, press forging. Bench Work and Fitting Fitting, sawing, chipping, thread cutting (die), tapping; Study of hand tools, Marking and marking tools. [No. of Hrs. 6] UNIT - III Metal joining: Welding principles, classification of welding techniques; Oxyacetylene Gas welding, equipment and field of application, Arc-welding, metal arc, Carbon arc, submerged arc and atomic hydrogen welding, Electric resistance welding: spot, seam, butt, and percussion welding; Flux: composition, properties and function; Electrodes, Types of joints and edge preparation, Brazing and soldering. [No. of Hrs. 6] UNIT – IV Sheet Metal Work: Common processes, tools and equipments; metals used for sheets, standard specification for sheets, spinning, bending, embossing and coining. [No. of Hrs. 5] TEXT BOOKS: 1. Manufacturing Process by Raghuvanshi. 1. Manufacturing Technology by P.N.Rao (TMH publications) REFERENCE BOOK: 1. Workshop Technology by Hazra-Chowdhary 2. Production Engineering by R.K.Jain 3. Workshop Technology by Chapman

Paper Code: ETCS 109 Paper: Introduction to Computer Systems

L 2

T 1

C 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 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 25 marks. 2. 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 of 12.5 marks.

UNIT ‐ I 

Introduction to Computer: Overview of Computer organization and historical perspective computer applications in various fields of science and management. Data representation: Number systems, character representation codes, Binary, hex, octal codes and their inter conversions. Binary arithmetic, Floating-point arithmetic, signed and unsigned numbers. [No. of Hrs. 8] UNIT - II Introduction to OS and Office Automation Concept of computing, Introduction to Operating Systems such as DOS, windows 2000/Xp, UNIX, Client Server Technology, etc. (only brief user level description). Introduction to World Processing, Spread Sheet & Presentation software e.g. MS-Word, MSExcel, MS-Power Point. [No. of Hrs. 8]
   UNIT ‐ III 

Introduction to Auto CAD Coordinate System, 2D drafting: lines, circles, arc, polygon, etc., Editing, 3D, Solid modeling, Rendering, Use of Auto CAD for engineering drawing practices. [No. of Hrs. 8]
   UNIT ‐ IV 

Web Technologies Introduction to World Wide Web, Search engines, e-mail, news, gopher, Audio & Video Conferencing, Internet Protocols: FTP, telnet, TCP/IP, SMTP, HTTP, Languages used for WEB Technology: HTML, practical examples using DHTML and Static HTML [No. of Hrs. 8] TEXT BOOKS: 1. Rajaraman, “Fundamentals of Computers”, Prentice Hall of India, 3rd Edition. 2. Mark Middlebrook, “Autocad 2004 for Dummies”, Pustak Mahel Prakashan, 2000. 3. Vikas Gupta, “Comdex Computer Course Kit”, Dreamtech Press, 2004. REFERENCE BOOKS: 1. Alexis Leon & Mathews Leon, “Fundamentals of Computer Science & Communication Engineering”, Leon Techworld, 1998. 2. Omura, “Mastering Autocad 2000 for Mechanical Eng ineers” BPB Publications, 2nd Edition, 1998.
3. A.S. Tanenbaum, “ Computer Networks”, Pearson Education India Ltd., 3rd Edition, 2002.

Paper Code: ETEL-111 Paper: Communication Skills – I

L 2

T 1

C 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 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 25 marks. 2. 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 of 12.5 marks.

UNIT - I Remedial Grammar: Errors of Accidence and syntax with reference to Parts of Speech; Agreement of Subject and Verb; Tense and Concord; Conditional Clauses; Use of connectives in Complex and Compound sentences; Question tags and short responses. [No. of Hrs: 06] UNIT - II Vocabulary and Usage: Word Formations (by adding suffixes and prefixes); Technical Word Formation; Synonyms, Antonyms, Homophones, and Homonyms; One Word Substitution; Misappropriations; Indianisms; Redundant Words; Phrasal Verb Idioms. [No. of Hrs: 06]
UNIT - III

Technical Writing: (A) Scientific Attitude and Impersonal Style; Plain Statements, Definitions; Description and Explanations (of objects, instruments, Processes, Scientific Principles, etc.) Summarizing and abstracting; Expressing ideas within a restricted word limit; Paragraph Writing (Paragraph division, introduction and the conclusion, Variety in sentences and paragraphs) Interpretation and use of charts, graphs and tables in technical writing. Punctuation (B) Reading at various speeds (slow, fast, very fast); reading different kinds of texts for different purpose (e.g. for relaxation, for information, for discussion at a later stage, etc.); reading between the lines. Comprehension of Unseen Passages [No. of Hrs: 10] UNIT - IV Text: The following prose pieces from Best Science Writing : Reading and Insights edited by Robert Gannon prescribed text (Hyderabad: University Press (India) Limited, 1991). 1. Chapter 2: “After 63 years, Why Are They Still Testing Einstein?” by C.P. Gilmore 2. Chapter 5: “Star Wars : The Leaky Shield” By Carl Sagan 3. Chapter 10: “Chaos : The Ultimate Asymmetry” by Arthur Fisher 4. Chapter 11: “Bill Moss, Tentmaker” by Robert Gannon 5. Chapter 12: “Totality - A Report” by Michael Rogers [No. of Hrs: 10] TEXT BOOKS: 1. Maison, Margaret M. Examine Your English, Hyderabad: Orient Longman, 1980 2. Sharma, R.S. Technical Writing. Delhi: Radha Publication, 1999 3. Sudarsanam, R. Understanding Technical English. Delhi: Sterling Publishers Pvt. Ltd., 1992

4. . Robert. Best Science Writing: Readings and Insights. Hyderabad: University Press (India) Limited. Gannon. 1991. Edt.

The performance of the candidates should continuously be evaluated by an internal committee. .Paper Code: ETEL-113 L T C Paper: Impact of Science & Technology on Society                                 1          0          1  *Non University Examination Scheme (NUES) There will not be any external examination of the university. The committee may conduct viva-voce at the end for the award of the marks.

Paper Code: ETPH-151 Paper: APPLIED PHYSICS LAB – I List of Experiments  L 0 P 2 C 1 (1) To plot a graph between the distance of the knife-edge from the center of the gravity and the time period of bar pendulum. Brownian motion. To determine the dispersive power of prism using spectrometer and mercury source. To determine the moment of inertia of a flywheel about its own axis of rotation. Proper error – analysis must be carried out with all the experiments. Note: Any 8-10 experiments out of the list may be chosen. To determine the wavelength of sodium light using diffraction grating. To determine the frequency of A.g. To determine the value of acceleration due to gravity using koter’s pendulum.C. To determine the specific rotation of cane sugar solution with the help of polarimeter. mains using sonometer and an electromagnet. To determine the refractive index of a prism using spectrometer. To determine the numeral aperture (NA) of a Optical Fibre. From the graph. To find the wavelength of He-Ne Laser using transmission diffraction grating. To determine the frequency of electrically maintained turning fork by Melde’s method. To determine the wavelength of sodium light by Newton’s Ring. Compute simulation (simple application of Monte Carlo) e. (13) charging & discharging of capacitor. . find (a) (b) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) (12) The acceleration due to gravity The radius of gyration and the moment of inertia of the bar about an axis.

of water molecules of crystallization in Mohr’s salt provided standard dichromate solution using internal indicator. 7. 10. Bicarbonate and Chloride contents in irrigation water. Detrmination of dissolved Oxygen in given sample if water.). To determine the no. To determine the amount of Sodium Carbonate in the given mixture of Sodium Carbonate and Sodium Bicarbonate. TEXT BOOKS: 1. Denney 2.C.Paper Code: ETCH – 153 Paper: Applied Chemistry Lab – I List of Experiments 1. 9. 2. Vermani & A. Applied Chemistry: Theory and Practice (Latest ed. Narula . Argentometric titration one each of Vohlard’s method and of Mohr’s method. Revised by G. Complexometric Titrations. Vogel’s Textbook of Quantitative Chemical Analysis (Latest ed. L 0 P 2 C 1 To determine the percentage composition of a mixture of Sodium hydroxide and Sodium Chloride.P. 4. By O. Determine the amount of Cu in the copper ore solution provided hypo solution. 6. 8. Iodometric Titration of K2Cr2O7 v/s Na2S2O3 to determine the percentage purity of K2Cr2O7 sample. Mendham & R. 5. J. To determine the Carbonate.). Determine the amount of Oxalic Acid and Sulphuric Acid/Hydrochloric Acid in one litre of solution given standard Sodium Hydroxide and Potassium Permanganate. Jeffery.H. Bassett. J.K. 3.

ungroup. Enter first quarter performance of five companies and create a pie chart showing c) there shareholders in the market. arc. drawing set-up. Use AutoCAD to do the following: Use of Drawing & Editing Properties: Modify Object Properties and a know how a) of layers. colors and prototype drawing. b) Create slideshow in operating sound. styles. grip c) editing objects snaps. Office Automation and Web Design 0 List of Experiments  P 3 C 2 1. Projection of points. lines and solids. textbox image insert etc. linear line). marquee check boxes etc. ellipse. Use HTML to design a Home page for IGIT using all the features of HTML like buttons. boundary. control scale factors. Dimensioning commands. circle.. regions. c) Create a Macro and use it in an application. utility commands. b) Draw line (Poly line.Paper Code: ETCS 155 L Paper: Introduction to AutoCAD. polygon. Use Microsoft Power-Point to perform the following a) Create a slide show on any subject of your choice using minimum five slides. donut. c) Create an animation using group. Use Microsoft-Word to perform the following: a) Send out invitation letter to several people using mail merge facility. frames. rectangle and use cross hatching. . multi line. Create a WEB page containing hyperlinks to the pages having information about Science and Technology. order. Use Microsoft-Excel to perform the following: a) Create a Macro and use it in an application b) Enter the name and marks of 10 students and perform various mathematical functions on it. 5. 4. d) e) Section of Solids f) Development and Intersection of Surface g) Isomeric Projections 2. 3. b) Create tabular data in word and insert graph to represent data. spline. fillet and extent commands.

Soldering: Dip soldering. Project Shop: Extrusion of soft metals. triangle in square. Machine moulding – Making of mould using Match-plate pattern. marking gauge. Exercises: Making jobs out of GI sheet metal. circular cut. Fitting Shop: Learning use of fitting hand tools. UNIT ‐ IV  Sheet Metal Shop: Learning use of sheet-metal tools. Bead formation in horizontal. . Plastic moulding. Pattern making. UNIT ‐ III  Welding Shop: Electric arc welding. Brazing: With Oxy-Acetylene gas. Cylindrical. Exercises: Jobs made out of MS Flats. Exercises making of various joints. making saw – cut filling V-cut taper at the corners.Paper Code: ETME-157 Paper: Workshop Practice UNIT ‐ I  L 0 P 3 C 2 Materials: Spectrography method for finding composition of materials. Plastic coating of copper wires. Wood Working Shop: Making of various joints. Gas Welding: Oxy-Acetylene welding and cutting of ferrous metals. Conical and Prismatic shapes. Floor moulding – Making of bend pipe mould etc. vertical and hanging positions in the mould cavity. UNIT ‐ II  Foundary Shop: Bench moulding with single piece pattern and two piece pattern. marking tools. Core making.Making and baking of dry sand cores for placing in horizontal. Edge preparations. fitting square in square. vertical and overhead positions.

Engineering Drawing by Venugopalan. and true lengths of the lines. TEXT BOOKS: 1. Engineering Drawing by S. Projections of points and lines lying in the planes. Projections of Point and Lines: Introduction of planes of projection. inclinations. REFERENCE BOOKS: 1.S. Significance and scope of engineering drawing. Orthographic Projection.D. Specifications.Sharma & Navin Kumar (Galgotia Publications) 2. projections of points and Lines in different quadrants. their traces. B. Sense of proportioning. Engineering Drawing by P. Different types of projections. Dimensioning. 3. intersecting and nonintersecting lines.. inclinations etc. Obtaining true shape of the plane figure by projection.I General: Importance.C. projections on Auxiliary planes. Lettering. Scales.Gill . Reference and auxiliary planes.I. Engineering drawing by N.II Planes other than the Reference Planes: Introduction of other planes (perpendicular and oblique).Bhatt (Charotar Publications). UNIT ‐ III  Projection of Solids: Simple cases when solid is placed in different positions. Axis faces and lines lying in the faces of the solid making given angles. 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 of both reference planes). UNIT . traces.S.Paper Code: ETME-159 Paper: Engineering Graphics Lab L 0 P 2 C 1 UNIT . CADD UNIT ‐ IV  Isometric Projection Nomography : Basic Concepts and use. conversion of oblique plane into auxiliary Plane and solution of related problems. shortest distance.

Divergence. Complex line integral. of Hrs. Euler’s theorem on homogeneous functions. Each question should be of 12. Taylor’s theorem of two variables and its application to approximate errors. Surface integrals and Volume integrals. Jain and S. Standard mappings – linear. “Advanced Engineering Mathematics”. [No. Stoke’s theorem and Gauss divergence theorem (both without proof). R. Mathur. [No. Properties. Maxima and Minima of two variables. Impulse function and Periodic function and their transforms. It should be of 25 marks. Green’s Lemma. [No.IV LAPLACE TRANSFORMATION: Existence condition. R. (Latest edition). Convolution and coinvolution theorem.II FUNCTIONS OF COMPLEX VARIABLES: Derivatives of complex functions. of Hrs.I CALCULUS OF SEVERAL VARIABLES: Partial differentiation. “Advanced Engineering Mathematics”. Cauchy’s integral theorem. Laurents series.II L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 1. Laplace transform of standard functions. 12] Unit . Every unit should have two questions. 3. rest of the paper shall consist of four units as per the syllabus. Dr. Evaluation and real integrals. Apart from question no. Question No. Zeros and Singularities / Taylor series. Properties. 2. Inverse Laplace transform of functions using partial fractions.). John Wiley and Sons.Paper Code: ETMA-102 Paper: Applied Mathematics . 2. Curl with geometrical physical interpretations. E. Langranges method of undermined multipliers and Jacobians. Cauchy-Riemann equations. P. Gradient. 1 should be compulsory and cover the entire syllabus. B. Calculation of residues. K. Kresyzig. K. However. Line integrals and application to work done. of Hrs. 10] TEXT BOOKS: 1. Khanna Publishers. A. 10] UNIT . V. of Hrs. Iyengar. square. Unit step function. change of variables. [No. ordinary derivatives of first and second order in terms of partial derivaties. Narosa. . Directional: derivatives. 12] UNIT .III VECTOR CALCULUS: Scalar and Vector point functions. Harmonic Conjugates. UNIT . 2003 (2nd Ed. inverse and bilinear. Solving linear differential equations using Laplace transform. Jaggi. Residue theorem. “Advanced Engineering Mathematics”. Analytic functions. This question should have objective or short answer type questions. Conformal mapping. student may be asked to attempt only 1 question from each unit. Cauchy’s integral formula.5 marks.

“Advanced Engineering Mathematics”. “Modern Advanced Mathematics for Engineers”. A. John Wiley and Sons. McGraw-Hill. 2001. Romanov. P. 1995. . V. R. M. V.REFERENCE BOOKS: 1. 2. Wylie. Mitin. Polis and D.

Zener diode.IV X-Rays: production and properties. student may be asked to attempt only 1 question from each unit. BCS theory (Qualitative only). Time Dependent Schrodinger Equation. [No. UNIT . Particle in a box (1-D). of Hrs. inconsistency in Ampere’s Law. 1. “Quantum Physics” 4. Type I and Type II Superconductors. Poynting Theorem (Statement only). undoped semiconductors and pn junction. semiconductors and insulators. Tunnel diode. Jordan & Balmain. “Atomic Physics” 3. functions & their comparison (no derivation) [No. continuity equation.III Solid State Physics Formation of energy bands in metals. Greiner. Fermi energy levels for doped. It should be of 25 marks. “Concept of Modern Physics” 2. of Hrs. Wave Packet. expectation value. Qualitative Features of Maxwell Bollzman. of Hrs. Superconductivity: Meissner Effect. A. propagation of plane electromagnetic waves in conducting and non-conducting medium. wave function and its properties. 8] TEXT BOOKS: 1.I Electromagnetic Theory (EMT) Motion of Charged Particles in crossed electric & magnetic fields. 1 should be compulsory and cover the entire syllabus. Velocity Selector & Magnetic focussing. 8] UNIT .5 marks. Bose-Einstein and Fermi-Dirac statistics distribution. Rajam. Gauss law. intrinsic and extrinsic semiconductors. [ No. However. Single step Barrier. properties of superconductors & applications. Crystalline and Anorphous solids (Brief) Bragg’s Law. Schrodinger Equation for free Particle.II Quantum Mechanics & Statistical Physics: De-Broglie Hypothesis. [No. Maxwell’s equations (differential and integral forms). poynting vector. This question should have objective or short answer type questions. Davisson Germer experiment. Griffth. Question No. 8] UNIT .Paper Code: ETPH-104 Paper: APPLIED PHYSICS – II L 2 T 1 C 3 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 2. 8] UNIT . Uncertainity principle. engineering applications. “Electromagnetic waves and Radiating Systems” . Production of Ultrasonics (Magentostriction and piezoelectric methods). rest of the paper shall consist of four units as per the syllabus. BEISER. Every unit should have two questions. Apart from question no. Each question should be of 12. Applications. London’s equation. of Hrs. “Introduction to Electrodynamics” REFERENCE BOOKS:  1. Tunneling effect. Ultrasonics: Introduction.

4. Singhal. “Solid State Physics” R. “Solid State Physics” Schiff.2. “Quantum Mechanics” . 3. Kittel.L.

Catalysis by metal salts.I Chemical Bonding: Potential Energy curve for H2 molecule. UNIT . rest of the paper shall consist of four units as per the syllabus. 1 should be compulsory and cover the entire syllabus. [No.). CO32-. Elastomers. Discussion of structures of IF3. 3. thermosetting polymers. Effect of temperature on heat of reaction at constant pressure (Kirchoff’s eq. Gibb’s Phase rule.D. Enzymatic catalysis. Natural Polymers. Every unit should have two questions. Homo and Copolymers (Classification based on repeat unit). Structure – property relationship of polymers. Numericals based on above topics. Conducting Polymers : Properties and applications. Tacticity of polymers. causes of deviation from ideal behaviour. heat of dilution. Latest ed. However. “Chemistry in Engineering & Technology. 2. of Hrs: 08] UNIT . of Hrs: 08] UNIT . Question No. NO. branched and cross-linked polymers. Valence shell Electron Repulsion Theory (VSEPR). J. Vander Waal’s forces. student may be asked to attempt only 1 question from each unit. Apart from question no. Liquefaction of gases. heat of neutralization and heat of combustion. Heterogeneous catalysis. Structures of simple heteronuclear diatomic molecules such as CO. Vol I & II. Vander Waal’s equation. physiosorption.IV Polymers and Composites: Functionality. Two component system : Lead – Silver. 1. heat of hydration. concepts of promoters.5 marks. Kuriacose & J.III Catalysis: Criteria for catalysis : Homogeneous catalysis – acid-base. surface area. FeCl3 – water. effective atomic numbers. [No. of Hrs: 08] TEXT BOOKS: 1. HF. Rajaram. Composites : Classification. Lee. concept of molecular weight (number average. Application of phase rule to one component system – the water system and Sulphur system. Thermochemistry: Hess’s Law. “Principles of Physical Chemistry”. Latest ed. Hydrogen bonding. Each question should be of 12. Sharma & Pathania. Heat of a reaction. “Inorganic Chemistry”. co-ordinate bond. Degree of polymerization. Puri. Werner’s theory. of Hrs: 08] UNIT . isomerism in co-ordinate compounds. Linear. Flame temperature. Real gases – non ideal behaviour.II Gaseous State: Gas laws and Kinetic theory of gases. J. Fibre and particle reinforced composites. inhibitors and poisoning. This question should have objective or short answer type questions. Mean free path. hybridization including d-orbitals. weight average & numerical based on them). The Phase Rule: Definitions of various terms. chemisorption. Na2SO4 – water. . HCl. Molecular Orbital theory. [No. Linear combination of atomic orbitals (LCAO) method. [No. Latest ed. Distribution of molecular velocities. It should be of 25 marks. 2.C. Industrial applications of important thermoplastic.Paper Code: ETCH – 106 Paper: Applied Chemistry – II L 2 T 1 C 3 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. SnCl2.

. Gowarikar.V.4. Viswanathan & Jayadev Sreedha. Latest ed.R. N. “Polymer Science”. V.

1995. “Computer Programming in C”. PHI. The C Programming language is being chosen mainly because of the availability of the compilers. 8] TEXT BOOKS: 1. exposure to the scanf and printf functions. C expressions. “C:The complete reference”. of Hrs. Introduction to the Editing tools such as vi or MS-VC editors. C Statements. 2. Every unit should have two questions. This question should have objective or short answer type questions. 2. Osbourne Mcgraw Hill. Argument passing mainly for the simple variables. UNIT ‐ I  Introduction to Programming: Concept of algorithms. 4th Edition. [No. mega and gigabytes. 1 should be compulsory and cover the entire syllabus. relational and logic operations. program statements and function calls from the library (Printf for example) C data types. books and other reference materials. Herbert Schildt.II Programming using C: The emphasis should be more on programming techniques rather than the language itself. “C Programming Language”. Kernighan & Ritchie. 2. 2-d arrays Use in matrix computations. C assignment statements. rest of the paper shall consist of four units as per the syllabus. 2001. Concepts of the finite storage. REFERENCE BOOKS: 1. Data Flow diagrams etc. Optionally switch and break statements may be mentioned. char. 8] UNIT ‐ IV  Pointers and Strings: Pointers. One dimensional arrays and example of iterative programs using arrays. Strings and C string library. Defining C structures..5 marks. Example of some simple C program. bits bytes. “Let us C”. [No. 8]    UNIT ‐ III  Iterations and Subprograms: Concept of loops. 8] UNIT . of Hrs. int. [No. [No. Number Systems & Binary Arithmetic. Structure and Unions. Concept of variables. 2nd Edition. It should be of 25 marks. functions Example of functions. BPB Publications. example of loops in C using for. Passing arrays as arguments. Apart from question no. else. while and dowhile. float etc. .. Question No. student may be asked to attempt only 1 question from each unit.Paper Code: ETCS 108 Paper: Introduction to Programming L 2 T 1 C 3 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 1. Concept of Sub-programming. Yashwant Kanetkar. kilo. of Hrs. 2nd Edition. 2002. of Hrs. The (Ansi C Version). Raja Raman. relationship between arrays and pointers Argument passing using pointers Array of pointers. However. Concepts of character representation. Optionally continue may be mentioned. Prentice Hall of India. arithmetic operation. C primitive input output using getchar and putchar. conditional executing using if. passing strings as arguments Programming examples. Each question should be of 12. extension of assignment of the operations. Flow Charts.

III Kinematics of Particles: Rectilinear motion. Apart from question no. Khanna Publishers REFERENCE BOOKS: 1. impulse and momentum conservation of momentum. impact of bodies. However. student may be asked to attempt only 1 question from each unit. Umesh Publications 2. assumption in the truss analysis. . “Engg Mechanics”. Friction: Static and Kinetic friction. PHI publications [No. of Hrs. Pappus theorems. center of mass and centroid by direct integration and by the method of composite bodies. Shear force and bending Moment Diagram. Question No. of Hrs. “Engg Mechanics”. type of rigid body motion. rest of the paper shall consist of four units as per the syllabus. 1. Each question should be of 12. parallel axis theorem. [No. perfect and imperfect truss. friction of flat pivot and collared thrust bearings.IV Kinematics of Rigid Bodies: Concept of rigid body.Tayal. Distributed Force: Determination of center of gravity. Every unit should have two questions. 8] UNIT . friction lock. co-efficient of friction. polar moment of inertia. Velocity and acceleration polygons for four bar mechanism and single slider mechanism. angle of friction. Kinetics of Rigid Bodies: Equation of motion. [No. A. of Hrs.Paper Code: ETME 110 Paper: Engineering Mechanics L 2 T 1 C 3 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1.I Force system: Free body diagram. work energy equation. “Engg Mechanics”. absolute motion. Sadhu Singh. translatory motion and fixed axis application of work energy principles to rigid bodies conservation of energy. T1/T2 =eμθ and its application [No. Kinetics of Particles: Equation of motion. conservation of energy. analysis of perfect plane trusses by the method of joints. plane curvilinear motion-rectangular coordinates. relative acceleration (Corioli’s component excluded) and instantaneous center of velocity. introduction to relative velocity. 8] rotation. 2. laws of dry friction. Belt drivederivation of equation. Irving H.5 marks. UNIT . Eqilibrium equations and applications. cone of friction. 1 should be compulsory and cover the entire syllabus. 8] UNIT . angle of repose. rectilinear motion and curvilinear motion.K. method of section. mass moment of inertia and area moment of inertia by direct integration and composite bodies method. 8] UNIT . This question should have objective or short answer type questions. normal and tangential component. radius of gyration. of Hrs. Shames. It should be of 25 marks.II Structure: Plane truss. co-efficient of restitution. TEXT BOOKS: 1. loss of energy during impact.

Jindal. “Engg Mechanics” .2.C. 4. 3. “Engg Mechanics”. TMH Subramanyam. U. “Engg Mechanics”. Galgotia Publications Beer & Johnston.

of Hrs. KVL Mesh and Nodal Analysis. 7] UNIT . Norton’s. Bandwidth. Two-wattmeter method. 2. and Auto transformer. voltmeter (shunt and multiplier). Rotating Machines Construction and working principles of dc motor and generator and its characteristics Applications of DC machines Construction and working principles of 3-ϕ-Induction motor. Construction and application of moving coil. 8] UNIT . Reciprocity. Apart from question no. Every unit should have two questions. Cathol-ray Oscilloscope and Applications. moving iron. Sen “Principles of Electric Machines and Power Electronics”. extension of range of ammeter. Star-Delta Transformation. dynamometer type. Ed 2002. rest of the paper shall consist of four units as per the syllabus. [No. R-L-C circuits (series and parallel). Regulation and efficiency.II A.IV Transformers  Construction and Working principles and phaser diagrams of Single-phase Transformer. [No. Time Constant.Circuits  R-L. 1. 10] TEXT BOOKS: 1. .Paper Code: ETEC-112 Paper: ELECTRICAL SCIENCE L 2 T 1 C 3 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. and Industrial applications. Maximum Power Transfer Theorem. Phasor representation.5 marks. This question should have objective or short answer type questions.III Measuring Instruments Principles. Q-factor. Application of theorem to the Analysis of dc circuits. for the measurement of power. Torque-speed characteristics.I Circuit Analysis Ohm’s Law. Emf equation. student may be asked to attempt only 1 question from each unit. Each question should be of 12. UNIT . Thevenin’s. Response of R-L. [No. 2.C. 1 should be compulsory and cover the entire syllabus. energy storage aspects. P. Question No. Wiley Eastern 2003. Equivalent circuit. of Hrs. However. of Hrs. R-C. [No. Circuit parameters. KCL. 7] UNIT . Superposition. It should be of 25 marks.C. of Hrs. Vincent DEL TORO “Electrical Engineering Fundamental’s Prentice Hall India”. R-C and R-L-C circuit to soinusoidal input Resonance-series and parallel R-L-C Circuits. induction type instruments. Millman’s Theorem.

Narrative etc) and their main features. context of communication. brevity. However. Apart from question no. 2000 3. and Classroom Presentations. [No. Non-Verbal and Listening Skills: Elementary Phonetics (Speech Mechanism. and J. “Practical Composition”. Descriptive. H. [No. B. Memos and Notices. 1983. clarity and appropriateness in communication. [No. Paralanguage and Body language. Word Accent. Resumes and CV’s and Cover letters. turn-taking strategies and effective intervention. Cambridge: CUP. Sandy & Lesley Hutchison. of Hrs: 08] UNIT . being polite and firm. 1981 . Hyderabad: Orient Longman. Question No. Essentials of Good Listening: Achieving ability to comprehend material delivered at relatively fast speed. of Hrs: 08] UNIT . Charles. student may be asked to attempt only 1 question from each unit. use of body language). Every unit should have two questions.III Verbal. handling questions and taking in criticism of self. 1. Prosodic Features. Sides. R. rest of the paper shall consist of four units as per the syllabus. K. 2. Hedwig. Harrison. the syllable. The Description of Speech Sounds. Hearing and Listening. the speaker/writer and the listener/reader.Paper Code: ETEL-114 Paper: Communication Skills – II 2 L 1 T 3 C INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. It should be of 25 marks. 4. of Hrs: 05] UNIT . The Phoneme. accuracy. Forsyth. Each question should be of 12.II Writing Skills: Types of writings (Expository. This question should have objective or short answer type questions.IV Group Discussion: Use of persuasive strategies including some rhetorical devices for emphasizing (for instance. 2. barriers to communication. Lewis. “Spoken English For India: A Manual of Speech and Phonetics”. medium of communication. “Body Language: A Guide For Professionals. UNIT – I Basic Concepts in Communication: Communication as sharing. [No. 1 should be compulsory and cover the entire syllabus.5 marks. of Hrs: 09] TEXT BOOKS: 1. Basics of Formal Reports. Features of Connected Speech). Bansal. Analytic. Argumentative. New Delhi: Response Books”. Edinburgh Oliver & Boyd. 1999. A division of Sage Publication. “How to Write & Present Technical Information”.

5. 3. To determine plank’s constant. coefficient of resistance of platinum by Callender & Griffith’s Bridge. 9. 4. Thomson method. To study Hall effect. To determine the internal resistance of Leclanche cell using potentiometer. To find the thermal conductivity of a poor conductor by Lee’s disk method. . 6. To determine the velocity of ultrasound waves using an ultrasonic spectrometer in a given liquid (Kerosene Oil) To measure the frequency of a sine-wave voltage obtain from signal generator and to obtain lissajous pattern on the CRO screen by feeding two sine wave voltage from two signal generator.Paper Code: ETPH-152 Paper: Applied Physics Lab – II L 0 P 2 C 1 List of Experiments  1. To determine the value of e/m of electron by J. 7. Resistance thermometer. 11. 10. Proper error – analysis must be carried out with all the experiments. To determine the temp.J. To determine unknown resistance of a wire by Carey Foster’s Bridge. To study the thermo emf using thermocouple and resistance using Pt. To study the charging and discharging of a capacitor and to find out the time constant. 8. Note: Atleast 8 experiments must be carried out. 2.

A.D. 10.C. Titration of strong acid/strong base conduct metrically. 5. Determine the molecular weight of a substance by Rast Method. 2.5H2O/FeSO4. “Laboratory Manual on Engineering Chemistry”.K. 3. Determine the reaction rate constant for 1st order reaction. Determine the heat of hydration of CuSO4.7H2O. . To determine the cell constant of a conductivity cell. B. Latest ed S. 4. 8. Preparation of a Polymer. 6. Khosla. Latest ed. 7. 9. 0 L 2 P 1 C 2. Bhasin and Sudha Rani. Gulati & V.Paper Code: ETCH – 154 Paper: Applied Chemistry Lab – II List of Experiments 1. Garg. Determine the heat of neutralization of strong Acid (say H2SO4/HCl) with strong base (NaOH). To determine the viscosity of the given liquid (density to be determined). Determine the surface tension of a liquid using drop weight method. “Practical Physical Chemistry”. Determine the heat of neutralization of Weak Acid with strong base. TEXT BOOKS: 1.

Write a recursive program for tower of Hanoi problem The fibonacci sequence of numbers is 1. 17. multiply and divide two complex numbers (x+iy) and (a+ib) Also write the main program. 13. 12. use command line arguments. 5. Write a menu driven program for searching an sorting with following options:Binary searching a) Searching (1) Linear searching (2) b) Sorting (1) Insersection sort (2) Selection sorting Write a program to copy one file to other. 11. 8. Write a program that takes two operands and one operator from the user perform the operation and then print the answer Write a program to print the following outputs: 1 1 2 2 2 2 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 Write functions to add. Write a program to mask some bit of a number (using bit operations) . 4.1. 9.3.8……. 6. Write a program to evaluate the following algebraic expressions after reading necessary values from the user (ax+b)/(ax-b) 2.2. 10. List of Experiments  0 L 2 P 1 C 1.5 log x-cos 30+|x^2-y^2|+sqrt (2xy) (x^5+10x^4+8x^3+4x+2 Write a program to find sum of a geometric series Write a program to cipher a string Write a program to check whether a given string follows English capitalization rules Write a program to find sum of the following series 1+ ½ + 1/3 +________+1/20 Write a program to search whether a given substring exist in an input string or not and then delete this string from input string. 2.Paper Code: ETCS 156 Paper: C Programming Lab. 14. 16. 7. subtract. Write a program to produce ASCII equivalent of given number Write a program to find divisor or factorial of a given number. 15. 3.5. Based on the recurrence relation F(n)=F(n-1)+F(n-2)for n>2 Write a recursive program to print the first m Fibonacci number Write a menu driven program for matrices to do the following operation depending on whether the operation requires one or two matrices a) Addition of two matrices b) Subtraction of two matrices c) Finding upper and lower triangular matrices d) Trace of a matrix e) Transpose of a matrix f) Check of matrix symmetry g) Product of two matrices.

.18. An array of record contains information of managers and workers of a company. Print all the data of managers and workers in separate files.

Velocity ratio and efficiency of a screw jack. To determine the mechanical advantage. 2. To verify the law of moments using Bell crank lever To find CG and moment of Inertia of an irregular body using Computation method. To find the forces in the members of Jib Crane. 9. η of Worm Wheel ( 2-start) Verification of force transmitted by members of given truss. . To verify the law of Force Polygon 0 L 3 P 2 C To verify the law of Moments using Parallel Force apparatus. VR. 4. Aluminum) on an inclined plane. Wood. 8. 7. 5. To determine the mechanical advantage. Velocity ratio and Mechanical efficiency of the Wheel and Axle To determine the MA. 6.Paper Code: ETME 158 Paper: Engineering Mechanics Lab List of Experiments 1. (simply supported type) To determine the co-efficient of friction between wood and various surface (like Leather. 10. 3.

L 0 P 2 C 1 Measurement of Power and Power factor in single phase Load using three ammeters/voltmeters. 12. 4. 7. 3. Machine Connection and starting of a Three Phase Induction Motor using direct on line or Star Delta Starter.Paper Code: ETEC 160 Paper: Electrical Science Lab List of Experiments 1. 2. Starting and Speed Control of a D. shunt motor Resonance 5. 8.C. 9. . Regulation and Efficiency of Transformer Short Circuit/Open Circuit tests on Single Phase transformer Measure the armature and field resistance of a D. 6. 11. Verification of Thevenin’s theorem Verification of Superposition theorem Phasor Diagram and Power factor of LCR circuit. Calibration of Energy Meter/Wattmeter/Voltmeter/Ammeter Two wattmeter method of measuring power in three phase circuit (resistive load only) Load test on Single Phase Transformer.C. 10.

Fourier Transforms: Fourier transform. 2. 5th Edition. REFERENCE BOOKS: 1. Every unit should have two questions. Wave and heat conduction equation. [No. student may be asked to attempt only 1 question from each unit. H. 2. 1998. [No. Dass.Code No. 1. having arbitrary periods. 2001. of Hrs. “Advanced Engineering Mathematics”. Grewal..K. Harmonic Analysis. impulse functions / periodic functions.: 11] UNIT – III Special Functions: Beta and Gamma functions. 9th Revised Edition.5 marks. Bessels functions of first kind. Shanti Narayan. Laplace. Rodrigue’s formula. application to linear differential equations with constant coefficients. Question No. John Wiley & Sons. 1998 . “Elementary Engineering Mathematics”. “Integral Calculus”. Legendre Polynomial. Unit step function. of Hrs.Chand & Company. Application to differential equations. Euler’s formulae. S. even and odd functions. S. orthogonal expansion of function. S.: 11] UNIT – IV Partial Differential Equation: Formation of first and second order linear equations. Ber and Be functions. Chand & Company. 34th Ed. 3. This question should have objective or short answer type questions. half range expansion. However. [No. Inverse Laplace transformation Convolution Theorem. of Hrs. Sine and Cosine transforms. UNIT – I Laplace Transformation: Laplace Transformation. Each question should be of 12. rest of the paper shall consist of four units as per the syllabus. of Hrs. “Advanced Engineering Mathematics”. modified Bessel functions of first kind. Kresyig. Chand & Company. It should be of 25 marks. Recurrence relations. initial and boundary value problems.: ETMA 201 Paper: Applied Mathematics – III L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. E. 1999. “Differential Caluculs”. B.: 11] TEXT BOOKS: 1. 1 should be compulsory and cover the entire syllabus. 1999 4.: 11] UNIT – II Fourier Series: Fourier Series. Shanti Narayan.S. [No. Apart from question no.

OPAMP stages. biasing. This question should have objective or short answer type questions. integrator. [No. Construction. 1 should be compulsory and cover the entire syllabus.: 11] TEXT BOOKS: 1. UNIT – I Semiconductors Diodes and Rectifiers: Introduction. fixed Bias. transistor operations. Bond. A. [No.R. Salivahanam. Carpenter & W.: ETCS 203 Paper: Analog Electronics L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. closed loop OPAMP configuration. M. antilog amplifier. It should be of 25 marks. 2003 . equivalent circuit. operating point. Apart from question no. differentiators. stabilization factors. temperature effects. Every unit should have two questions. operation point. However. of Hrs. Galgotia. general characteristics. Vbe & β.: 11] UNIT – II Bipolar junction transistor: Introduction. rest of the paper shall consist of four units as per the syllabus. Suresh Kumar. Transistor. summer.Code No. open loop OPAMP configuration. [No. power tunnel. TMH. saturation and cut off mode of operations Eber-mall’s model. load line.L. P. Each question should be of 12. Shroff Publisher & Distributors. self bias. BJT characteristics. instrumentation amplifier. “Electronic Design”.G. clamper. enhancement & depletion type MOSFETS. current sources. S. of Hrs. “Principles of Electronic Circuits. Question No. OPAMP applications: comparator. CC configurations. reverse recovery times. bias stability with resfpect of variations in Ico. G. 2001. diode specifications. 1.5 marks. thermal stability. Burns. DC & AC resistance. drift & diffusion currents. hybrid model for transistor at low frequencies. student may be asked to attempt only 1 question from each unit. Clipper. OPAMP Parameters.. 2.: 11] UNIT – IV Operational Amplifier: Ideal OPAMP. emitter bias. waveform generators. Wallavaraj. varator. Field Effect Transistors: Classification & characteristics. first and second order filters. different types of diodes (zener. 2nd Ed. equivalent circuits. energy levels.R. Roden. REFERENCE BOOKS: 1. of Hrs. basic construction and characteristics. S. leakage currents. transition & diffusion capacitance. Ideal voltage transfer curve. photodiode & LED). CE.Wieseraman. of Hrs.S. log. N. “Electronic Devices and Circuits”. 1999. rectifiers. RC coupled amplifiers. 2. ideal diode. Half wave & full wave rectifiers [No. schottky. Bias stabilization: Need for stabilization.: 11] UNIT – III Small Signal Amplifiers: CB. extrinsic materials n & p type.

TMH(ISE). 1998. 1998.3. S. 6. 1998. TMH.. Malvino. 4. Micro Electronics. Electronic Principles. Salivahanan & other. Millman & Halkias Electronic Devices & Circuits . 5. Electronic Devices & Circuits. TMH. Jacob Millman. . 1999. TMH.

g. Synthesis of LC. C series. of Hours: 11 Unit-II Laplace Transform: Review of properties and applications of Laplace transform of complex waveform and transient response of R. No. y. C circuits for impulse. 2000. Millman. 2. . Norton. system modeling in terms of differential equations and transient response of R. inverse ABCD parameters their interconversion. L. ABCD. parallel. 1. their classification and types. 1 should be compulsory and cover the entire syllabus. D. Kuo. rest of the paper shall consist of four units as per the syllabus. RL Networks No. Maximum Power Transfer and Tellegan No. Bhise. R. Cauer’s I& II forms. “Network analysis and synthesis” John Weily and Sons. interconnection of two 2-port networks. 2. 2nd Edition. of Hours: 11 Unit-III Graph theory and its applications.Code No. concept of transform impedance. Choudhary. Each question should be of 12. LTI systems and their properties. Thevenin. Question No. step. Superposition. “ Engineering network analysis and filter design” Umesh publication. Kulshreshtha.: ETEC 205 Paper: Circuits and Systems 3 L 1 T 4 C INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. sinusoidal and exponential signals. 1999. student may be asked to attempt only 1 question from each unit. 2000. [No. of Hours: 11 Text Books: 1. h. two port networks – z. Every unit should have two questions. “Networks and Systems” New Age International. However. Network theorems: Reciprocity. Valkenburg. series-parallel circuits for all kinds of excitations. “ Network analysis” PHI. RC. of Hours: 11 Unit IV Elements of Network Synthesis: Foster’s I and II. Unit-I Introduction to continuous and discrete signals. L.5 marks. This question should have objective or short answer type questions. ramp. 2. Reference Books 1. Apart from question no. Chadda. periodic waveforms and signal synthesis. It should be of 25 marks.

properties of binary rotation. Euler’s formula (proof) four color problem (without proof) and the chromatic number of a graph. Shortest path & minimal spanning trees. binary and unary operations on a set. Trees terminology. Logic Programming and Proof of correctness. Subtracts.: 11] UNIT – IV Graph Theory: Terminology.5 marks. five color theorem. directed graphs. trees associated with DFS & BFS). binary and n-ary operations. properties. UNIT – I Formal Logic: Statement. quick sort. [ No. 2.: 11] TEXT BOOKS: 1. [No. 2. of Hrs. Each question should be of 12. inverse. Liu. PHI. Depth-first and breadth first searchs.: ETCS 207 Paper: Foundations of Computer Systems L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Analysis of Algorithms involving recurrence relationsrecursive binary search. 2004. set operations/set identities. in order. direct product.Code No. Relation/function and matrices: Rotation. Permutation function. Connected components. rest of the paper shall consist of four units as per the syllabus. “Discrete Mathematical Structures”. sublattices. “Discrete Mathematics and Its Applications”. Warshall’s. TMH. Question No. of Hrs. Proof by Contra position. C. Boolean expression. operation on binary rotation. principle of inclusion. student may be asked to attempt only 1 question from each unit. composition of function. of Hrs. Symbolic Representation and Tautologies. However. [No. permutation and combination. Predicator and validity.: 11] UNIT – III Lattices & Boolean Algebra: Lattices: definition. of Hrs. Boolean matrices. structures with binary operations) subalgebra. Propositional Logic. homomorphism Boolean algebra: definition. direct product and homo-morphism. [No. Predicate Logic. fundamental country principles. Rosen. 1996. representation & minimization of Boolean function. REFERENCES BOOKS: . characteristics for.L. Keneth H. Boolean function. representation of discrete structures. Proof. Boolean matrices multiplication. pascal’s triangles. Recursive definitions.: 11] UNIT – II Sets and Combinations: Sets. exclusion and pigeonhole principle. 1999. Busby & Ross. TMH. 1 should be compulsory and cover the entire syllabus. Kolman. composition of cycles. algorithms. partial ordering. equivalence relation. powersets. 2. first-order recurrence relations with constant coefficients. isomorphic graphs. Euler path & hamiltonian circuits. Function properties of function. 2000. “Elements of Discrete Mathematics”. solution method for a divide-and-conquer recurrence relation. Narsingh Deo. 1. 1. binominal theorem. principle of mathematical induction. This question should have objective or short answer type questions. PHI. Relation and Analysis of Algorithm: Techniques for theorem proving: Direct Proof. Apart from question no. Proof by exhausting cares and proof by contradiction. isomorphic structures (in particulars. closures. Normal form. principle of complete induction. solution methods for linear. Decision Trees. “Graph Theory With Application to Engineering and Computer Science”. Every unit should have two questions. It should be of 25 marks. Quantifiers. preorder & post order trees traversal algorithms. Computer representation of graphs.

2. Inheritance. C++ garbage collection. Basic terms and ideas: Abstraction. “Discrete Mathematical Structures with Applications to Computer Science”. A. Streams and files. Method polymorphism. data decomposition). Algorithms. D . Each question should be of 12. [No. 1997. . delete operators. new. Trembly & P. dynamic memory allocation. BPB Publications. 1998. State identity and behavior of an object. student may be asked to attempt only 1 question from each unit. 4. Default parameter value. Copy Constructor. 2005. Vinay Kumar. Parametric polymorphism. 11] UNIT – III  Inheritance and Polymorphism: Inheritance. of Hrs: 11] UNIT – IV  Files and Exception Handling: Persistant objects. 1. Overriding inheritance methods [No. Generic Classes Standard Template Library: Standard Template Library. 3. composition vs classification hierarchies. Code No. [No. [No. 1999. “Discrete Mathematics”. Encapsulation. rest of the paper shall consist of four units as per the syllabus. methods. cout. Ravishanker “Mastering C++”. attributes. Exception handling.Venugopal. Object & classes. Constructors and destructors. McGraw Hill. Type of Polymorphism – Compile time and runtime. T.R.5 marks. Apart from question no. Information hiding. Parasons. UNIT – I  Introduction: Introducing Object-Oriented Approach related to other paradigms (functional. Other STL Elements. of Hrs. Containers. Manohar. REFERENCE BOOKS: 1. private & protected. 1997. of Hrs: 11] TEXT BOOKS: 1. “Object Oriented Programming using C++”. Wiley DreamTech. 2004. TMH. Characteristics of Object-Oriented Languages.3. General Theory of Operation. 2. Difference between C and C++. “C++: The Complete Reference”. However. Constant and Classes. P. function name overloading. 1 should be compulsory and cover the entire syllabus. Schildt Herbert. R. Lafore. “Object Oriented Programming with C++”. Static Class Data. Polymorphism by parameter. instantiation of objects. Every unit should have two questions. Operator overloading. Review of C. The Container Classes. It should be of 25 marks. Polymorphism. Question No. cin. of Hrs: 11] UNIT – II  Classes and Objects: Abstract data types. Class hierarchy. BPB Publication. derivation – public. Vectors. Generic function – template function. Iterators. Types of Inheritance. Rajkumar. Aggregation. J. BPB Publications. Polymorphism. Namespaces. Overview of Standard Template Library.: ETIT 209 Paper: Object Oriented Programming using C++ L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. C++ class declaration. This question should have objective or short answer type questions.

3. Yashwant Kanethkar. 2002. Steven C. “The Art of Programming Computer Science with C++”. .2. Lawlor. “Object Oriented Programming using C++”. Vikas Publication. BPB. 2004.

Leung. topological sort. traversal. Hashed Indexed. AVL Trees.. queues. R. multiples stacks and queues. student may be asked to attempt only 1 question from each unit. However. Tree Indexing. Hashed file organization. “Data Structure”. “Fundamentals of Data Structures”. Shellsort. 1999. This question should have objective or short answer type questions. Dijkstra’s Algorithm. balanced mergesort. External sort: K-way mergesort. Hash function. Trie Indexing. postfix and prefix arithmetic expression conversion and evaluations. Apart from question no. Mergesort. 2002 . sparse matrices. REFERENCES BOOKS: 1. Sequential file organizational. of Hrs: 11] UNIT – III Searching & Sorting: Binary Search Tree. Graphs: Representation. Selection sort. Quicksort. Minimum Spanning Tree Definitions. Hash table. [No. linked lists: singly and doubly linked lists. It should be of 25 marks. Exchange sort. rest of the paper shall consist of four units as per the syllabus. Applications: polynomial arithmetic. PHI. “Data Structures and program design in C”. Queries and sequential organization. activity network. of Hrs: 12] UNIT – II Trees: Binary trees: Definition. TMH. P. 2000. Ltd. E. Each question should be of 12. cellular partitions. 2.Code No. threaded binary tree. path enumeration. Kruse. connected components. stacks. Heaport. Schaum’s outline series. [No. random file organization. 2. of Hrs: [No. Floyd Warshall’s Algorithm. B. Every unit should have two questions.: ETCS 211 Paper: Data Structures L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Time and space complexity of algorithms. infix. Horowitz and S. Elementary data structures and their applications Arrays: ordered lists. L. representation of arrays. L. Question No. Insertion & Deletion. UNIT – I Fundamentals of algorithm analysis: Big ‘O’ notations.5 marks. shortest path and transitive closure. Counting Binary Tree. C. 1 should be compulsory and cover the entire syllabus. Internal sort: Radixsort. Sahani. Cylinder surface indexing. of Hrs: 11] TEXT BOOKS: 1. Insertion sort. Galgotia Booksource Pvt. polyphase mergesort UNIT – IV Files: Files. traversal. critical path. Inverted files. 10] [No. Tondo. 1. B-Trees.

BPB. PHI. Langsam et. al. Y. “Data Structures using C and C++”.2. 1999. Yashwant Kanetkar. .. 2005. “Data Structure through C”. 3.

Practical will be based on Data Structure. L 0 P 2 C 1 Practical will be based on Object Oriented Programming using C++. Code No. PSPICE. : ETCS 251 Paper: Analog Electronics Lab. L 0 P 2 C 1 Practical will be based on Circuits & Systems. L 0 P 2 C 1 Practical will be based on Analog Electronics. : ETIT 255 Paper: Object Oriented Programming using C++ Lab. L 0 P 2 C 1 . : ETCS 257 Paper: Data Structure Lab.Code No. Code No. Code No. : ETEC 253 Paper: Circuits & Systems Lab. PSPICE.g.g. Some lab experiments must be performed using any circuit simulation software e. Some lab experiments must be performed using any circuit simulation software e.

CMM & ISO 9001. Each question should be of 12. Requirements documentation.: 11] TEXT BOOKS: 1. W. Integration and System Testing. Evolutionary and Spiral Models Software Requirements analysis & specifications: Requirement engineering. Design of test cases. Reliability Models. 2004. 2. [No. Software Quality Models. student may be asked to attempt only 1 question from each unit. “Software Engineering”. R.: 11] UNIT . “Classical & Object Oriented Software Engineering”. Configuration Management. Data dictionaries & ER Diagrams. TMH. Prototype. Decision table testing. Apart from question no. Software life cycle models. Testing Tools & Standards.: 11] UNIT – II Software Project Planning: Size Estimation like lines of Code & Function Count. John Wiley & Sons. UNIT – I Introduction: Software Crisis. [No. QFD & Use case approach. Software Maintenance: Management of Maintenance. functional testing: Boundary value analysis. Every unit should have two questions. [No. Maintenance Process. James Peter.Code No. Path Testing. Aggarwal & Yogesh Singh. Alpha & Beta Testing. 1996. rest of the paper shall consist of four units as per the syllabus. Design Metrics. . Token Count. 2. Waterfall. Maintenance Models. Equivalence class testing. Software Design: Cohesion & Coupling. COCOMO-II. of Hrs. requirement elicitation techniques like FAST. Software Processes & Characteristics. Pressman. Data Structure Metrics. However. Cost Estimation Models. It should be of 25 marks. Schach. “Software Engineering – A practitioner’s approach”. Basic Model. Function Oriented Design. Information Flow Metrics Software Reliability: Importance. Reverse Engineering. 5th Ed. Risk Management. Putnam resource allocation model. Classification of Cohesiveness & Coupling.IV Software Testing: Testing process. Nature of SRS. Documentation. Object Oriented Design [No. of Hrs.. Structural testing. of Hrs. Data flow and mutation testing. K.. Cause effect graphing. COCOMO. of Hrs.: 11] UNIT .III Software Metrics: Software measurements: What & Why. 1. 2. 1 should be compulsory and cover the entire syllabus. Regression Testing. New Age International. McGraw Hill Int. Stephen R. Logarithmic Poisson Model. 2005. This question should have objective or short answer type questions. REFERENCE BOOKS: 1. requirements analysis using DFD. Halstead Software Science Measures. Characteristics & organization of SRS. Software Re-engineering. Pedrycz.5 marks. 2nd Ed. IRWIN. Question No.. K. Failure and Faults. Debugging. Hardware Reliability & Software Reliability. “Software Engineering: An Engineering Approach”. S.: ETCS 202 Paper: Software Engineering L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Ed. Unit Testing. 2001.

“Software Engineering & Quality Assurance”. BPB. . “Software Engineering”. Chandrasehakhar. 2004 K.3. 2005. I. Addison Wesley. Sommerville. 4.

REFERENCES BOOKS: 1. Medians and Order statistics. Depth First Search. [No. Strassen’s algorithm for Matrix Multiplications. 1999. Topological Sort. 1. Recurrences: The substitution method. D. H. All pair shortest paths and matrix multiplication. Cormen. Galgotia Publications. NP-Completeness and Reducibility. 2004. An activity selection problem. Longest common subsequence and optimal binary search trees problems. Strongly Connected Components.: ETCS 204 Paper: Algorithm Analysis & Design L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Ellis Horowitz and Sartaz Sahani. Rivest. 2. student may be asked to attempt only 1 question from each unit. of Hrs. rest of the paper shall consist of four units as per the syllabus. 2. L. 2nd Ed. Ullman. Question No. [No. “The Design and Analysis of Computer Algorithms”. “Introduction to Algorithms”. 2nd Ed. Data Structures for Disjoint Sets. E. J. “The Art of Computer Programming”. Addison Wesley. NP-Complete Problem: Polynomial-time verification. The iteration method. E.Code No.: 11] UNIT – III Graph Algorithms: Representation of Graphs. Breadth First Search. A. of Hrs. Aho.: 11] TEXT BOOKS: 1. A task scheduling problem. of Hrs.. Apart from question no. Greedy Algorithms: Elements of Greedy strategy. The Knuth-Morris Pratt algorithm. Leiserson. of Hrs. Quick sort. Algorithm for Kruskal’s and Prim’s for finding Minimum cost Spanning Trees. Huffman Codes.: 11] UNIT – IV String matching: The naïve String Matching algorithm. Each question should be of 12. NPCompleteness Proof. Hopcroft. NP-Complete problems. Dijkstra’s and Bellman Fort Algorithm for finding Single source shortest paths. 1998. Divide and Conquer Approach: Merge Sort. Matrix Chain Multiplication. C. This question should have objective or short answer type questions. 1998 . Clifford Stein. V. 1 should be compulsory and cover the entire syllabus. [No. The Rabin-Karp Algorithm. PHI. 3. It should be of 25 marks. T. However. UNIT – I Preliminaries: Review of growth of functions. Every unit should have two questions.. Addition Wesley. E. D. Knuth. Floyd – Warshall algorithm for all pair shortest paths. String Matching with finite automata. R.5 marks. “Computer Algorithms”. J. The master method.: 11] UNIT – II Dynamic Programming: Elements of Dynamic Programming. [No.

X-OR & X-NOR simplification of K-maps. TMH. Adders & Subtractor. NOT. UNIT – I Analog & Digital signals. race around condition.P. TTL. “Digital Logic Design Principles”. Morris Mano. REFERENCE BOOKS: 1. Tocci. 5. classification and characteristics of memories. “Digital principles and applications”. Wiley Pub. 555 Timer and its application as mono-stable and astable multi-vibrator.: ETEC 206 Paper: Digital Circuits & System – I L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Sequential circuits: Shift registers. Ripple counter.Code No. Apart from question no. J-K. excitation table of a flip-flop. M.: 11] UNIT . Nyquist Sampling Theorem [No. It should be of 25 marks.: 11] UNIT .. “Digital Logic-Application and Design”. 3rd Ed. K-map representation and simplification of logical functions. “Modern Digital Electronics”. J.. Analog & Digital”. Each question should be of 12. 1999.: 11] TEXT BOOKS: 1. AND. Combinational circuits: Multiplexers. “ Digital Electronics and Logic Design”.IV Logic Implementations using ROM. Balabanian and Carlson. Semiconductor Memories: Memory organization & operation. OR. PHI. decoder/drivers for display devices [No. student may be asked to attempt only 1 question from each unit. This question should have objective or short answer type questions. 2000. 2004. 2000. 1 should be compulsory and cover the entire syllabus. However. J. Jain. RTL and DTL circuits. ECL and CMOS Logic families. [No. PAL & PLA. Malvino and Leach. D & T Flip-flops. Standard representation of Logical functions.III A/D and D/A converters: Binary-weighted DAC. of Hrs. of Hrs. Nai. Question No. of Hrs. PWS Publishing. 2000. Yarbrough. Don’t care conditions. 3. Linear-ramp ADC.5 marks. Nagrath. Decoders & Encoders. 2nd Ed. Dual-slope ADC Bipolar-Transistor Characteristics. Design of Synchronous counters and sequence detectors. TMH. 2. PHI. Successiveapproximation ADC. 2. [No. I. rest of the paper shall consist of four units as per the syllabus. NOR & XOR gates. ROM and content addressable memory. 4. R-2R Ladder type networks. PHI. RAM. 2002. Code Converters. “Digital Design”. B. “Electronics. S. of Hrs.: 11] UNIT – II Flip Flops: S-R. demultiplexers. Every unit should have two questions. PHI. 6. . 1. Boolean algebra. R. J. R. NAND. comparators. “Digital Systems”. 2000 2. 1999.

Digital transmission through career modulation Amplitude. Question No. DM and ADM modulators and demodulators. power spectral density. [No.5 marks. TMH. transformation of random variables. S/N ratio.: 09] TEXT BOOKS: 1. PWM and PPM generation and modulation. UNIT . TDM. Every unit should have two questions. 1998. Random Process: Probability Random variable. Sampling of Low Pass and band pass signals. Spectral analysis of PAM. Cross talk. central limit theorem. Lempel – ziv code. However. [No. channel coding and channel capacity theorem. S/N ratio for different pulse modulation. Companding. Stationary Process. ergodicity. Generation & Demodulation of AM DSBSC waves.I Analog Modulation: Amplitude Modulation. [No. Huffman code. moments. of Hrs. Demodulation of SSB waves. PWM and PPM Waves. mean. Generation & demodulation of FM waves. Probability of error for PCM in AWGN Channel. PAM. This question should have objective or short answer type questions.Code No. Comparison of AM.IV Introduction to Information Theory: Measurement of Information. 1. Generation of SSB waves. DPCM. rest of the paper shall consist of four units as per the syllabus. Differential phase shift keying. Matched Filter. Aperture effect. Apart from question no. MSK OPSK and QAM modulation & detection. mutual information Shannon’s Theorem Sowzce coding. Aliasing. Probability density.: ETIT 208 Paper: Communication Systems L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. autocorrelation and covariance functions. narrow & wide-band. REFERENCE BOOKS: . Inter symbol Interference. Gaussian distribution. Quardrature-Carrier Multiplexing. [No. BW of FM waves.: 12] UNIT – III Pulse Digital Modulation: Pulse Code Modulation signal to quantization noise ratio. Prediction Filter.: 11] UNIT . probability of error calculation. FM. of Hrs. CPFSK. FM & PM. Each question should be of 12. response of linear systems to random signals. 1 should be compulsory and cover the entire syllabus. 2. Pulse Analog Modulation: Sampling theorem. student may be asked to attempt only 1 question from each unit.: 12] UNIT – II Angle Modulation: Frequency & phase Modulation. of Hrs. mean. line coding. Taub & Schilling. Coherent Detection of DSBSC Signal. It should be of 25 marks. of Hrs. “Principles of Communication Systems”. Frequency and phase shift keying.

Back Face Detection. [No.P. Projection. Curved Surfaces. Effect of ambient lighting. Phong Model. distances. A-Buffer) Method.“An Introduction to the Principles of Communication Theory”. Depth Sorting Method. Isometric Projection. C. Addison Wesley. However. SutherlandCohen Clipping Algorithm.P. 1985. Simon Haykins. Rotation about an arbitrary axis (3D). Computing location of V. Every unit should have two questions. Scaling. 1999.: ETCS 210 Paper: Computer Graphics L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. of Hrs: 11] TEXT BOOKS: 1. Foley et. Perspective. One Vanishing Point (V. “Communication Systems”. TMH. Rotation about an arbitrary point (2D). and Clipping Algorithms: Bresenham’s Line Drawing Algorithm. student may be asked to attempt only 1 question from each unit. [No. Generation of 2 VP Projector & Projections. J. Each question should be of 12. Depth Buffer (Z-Buffer. 1 should be compulsory and cover the entire syllabus.) projection from a point on z axis. 2. Adams. UNIT – I  Transformation. Hancock. Solid Modelling. Rogers and J. : 11] UNIT – II  Curves and Surfaces: Bresenham’s Circle Drawing Algorithm. Rotation. 1998. 2. . Scan Line Method. rest of the paper shall consist of four units as per the syllabus. al. Rogers. Bezier Curves. Cubic B-Spline curves using uniform knot vectors. “Computer Graphics Principles & practice”. Question No. of Hrs.5 marks. D. Homogeneous Coordinate System for 2D and 3D. [No.P. Hidden Surface Removal. David F. Isometric Projection. Area Subdivision Method. Shear). 1. 4 point and 5 point Bezier curves using Bernstein Polynomials. Apart from question no. Gourard Shading.. Various 2D. This question should have objective or short answer type questions. 2. “Mathematical Elements for Computer Graphics”. 3D Transformation matrices (Translation. REFERENCES BOOKS: 1. Illumination Model for diffused Reflection. Specular Reflection Model. 1989. Polygonal Approximations. of Hrs: 11] UNIT – III  Projection and Solid Modelling: Parallel Projection. B-Spline Curves. one vanishing Pint (VP). Projections. Code No. It should be of 25 marks. MacGrawHill International Edition. projection from 0 point on z axis. Bezier bi-cubic surface patch. “Procedural Elements for Computer Graphics”.1. McGraw Hill Book Company. Testing for first and second order continuities [No. Clipping Algorithms. Perspective Projection. 1998. Computing Reflection Vector. Conditions for smoothly joining curve segments. of Hrs: 11]    UNIT – IV  Shading and Hidden Surface Removal: Shading. Projection. Generation of 2 V. Oblique Projection on xy plane. John Wiley.

3. R. Plastock and G. “Theory and Problems of Computer Graphics”. McGraw Hill. 1986. “Computer Graphics”. Baker. Kalley. . Schaum’s Series.2. 1986. Hearn and P. Prentice Hall. D.

5th Ed. 2. Recovery from Deadlock. Input or Output Devices. Operation on Processes. Monitors. Storage Devices. rest of the paper shall consist of four units as per the syllabus. Process Synchronization: Background. Block Multiplexing. Device CharacteristicsHardware Consideration. Question No. Process Scheduling. Every unit should have two questions. Independent Device Operation. MultipleProcessor Scheduling.: 11] UNIT – III Deadlocks: System Model. Parallel systems. Efficiency and Performance. student may be asked to attempt only 1 question from each unit. “Operating System Concepts”. Tannenbaum. Virtual Memory: Demand Paging. of Hrs. Basic File System. Logical versus Physical Address space. Stable-Storage Implementation [No. of Hrs.: 12] UNIT – II Processes: Process Concept. Deadlock Avoidance. Apart from question no. Contiguous allocation. It should be of 25 marks. Deadlock Detection. Disk Scheduling. Time-Sharing Systems.: 11] UNIT – IV Information Management: Introduction. Physical File System File-System Interface: File Concept. Each question should be of 12. Directory Structure. Access Control Verification. “Operating Systems”. Shared Devices. The Critical-Section Problem. Page-replacement Algorithms. Free-Space Management. This question should have objective or short answer type questions. [No. Paging.Code No. of Hrs. Multiple Paths. Thrashing. However. Segmentation. Symbolic File System. Device Management: Techniques for Device Management. 4th Edition. Simple Batch Systems. UNIT – I Introduction. Wiley Dreamtech. Pearson. swapping. Secondary-Storage Structure: Disk Structure. Personal-computer systems.. General Model of a File System. Recovery. Disk Reliability. Scheduling Criteria. Methods for Handling Deadlocks. Access Methods. Disk Management. Protection. R. of Hrs. Combined Approach to Deadlock Handling. Synchronization Hardware. Device Allocation Consideration. What is an Operating System. Multiprogrammed Batches systems. 1 should be compulsory and cover the entire syllabus. Scheduling Algorithms. Allocation Methods. Interprocess Communication CPU Scheduling: Basic Concepts. 2. Real-Time Scheduling.5 marks. A Simple File System. Other Considerations. 2000 REFERENCES BOOKS: . Virtual Devices. Segmentation with Paging. Cooperating Processes. 2001 Dr. Consistency Semantics File-System Implementation: File-System Structure. Deadlock Prevention. 2005. 1.: ETCS 212 Paper: Operating Systems L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Performance of Demand Paging. Atomic Transactions [No. Dedicated Devices. Page Replacement. Joshi. PHI. Memory Management: Background. C. Semaphores. Algorithm Evaluation. Buffering. Allocation of Frames. Distributed Systems. Deadlock Characterization.: 10] TEXT BOOKS: 1. Directory Implementation. 1. Channels and Control Units. Critical Regions. “Operating Systems”. Synchronization in Solaris 2. Classical Problems of Synchronization. Real-Time Systems. Silbersachatz and Galvin. Demand Segmentation [No. Swap-Space Management. Logical File System.

“Operating Systems”.2. Donovan. Madnick. 2001 . Tata McGraw Hill. J. E.

Code No. Practical will be based on Software Engineering. Practical will be based on Computer Graphics.I Lab. : ETCS 258 Paper: Computer Graphics Lab. : ETEC 256 Paper: Digital Circuits & Systems . : ETCS 254 Paper: Algorithm Analysis & Design Lab. Practical will be based on Algorithm Analysis & Design. Code No. 0 L 2 P 1 C Code No. L 0 P 2 C 1 Practical will be based on Digital Circuits & Systems – I. L 0 P 2 C 1 . : ETCS 252 Paper: Software Engineering Lab. PSPICE.g. L 0 P 2 C 1 Code No. Some lab experiments must be performed using any circuit simulation software e.

Moreno. Addison Wesley. Every unit should have two questions. Operator Overloading. Generics and Configuration. Introduction to VHDL. Flip-flop. 5. Bhaskar. state machine modeling [No. Ercegovac. Question No. Signatures. Generate Statement [No. 2000. 2. Wiley. Design of a Serial Adder with Accumulator. Component Declaration. 4.: 12] UNIT – IV Overview of FPGA and CPLD. Dumping results into a text file. of Hrs. “Digital System Design using VHDL”. Apart from question no. Register and Counter. AddisonWesley.: ETEC 301 Paper: Digital Circuits & Systems – II L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 3.Code No. T. [No. This question should have objective or short answer type questions. Writing a test bench. 2000. “Digital Design-Principles and Practices”. MGH. PWS Publishing. 1999. ”Introduction to Digital Systems”. package declaration. Design of standard combinational modules. Signal Assignment Statement. 2003. However. component instantiation. Basic Language element of VHDL. of Hrs. rest of the paper shall consist of four units as per the syllabus. Wakerly.J. 2000.2000 2.: 09] TEXT BOOKS: 1. 2. 1 should be compulsory and cover the entire syllabus. . REFERENCES BOOKS: 1. student may be asked to attempt only 1 question from each unit. Study of internal architecture of xilinx’s vertex series of devices and altera’s cyclone processor. UNIT – I Specification of combinational systems using VHDL. Michae John Sebastian Smith. C. J. Functions and Procedure. Douglas Perry. Lang and L. “ A VHDL Primer”. 2000. Multiplication of a Signed Binary Number [No. PHL. Z. It should be of 25 marks. design of a Binary Multiplier. “Application-Specific Integrated Circuits”.5 marks.F. 1. reading vectors from a text file. of Hrs. M. J. State Graph for Control Network. of Hrs. Structural modeling.: 11] UNIT – II Description and design of sequential circuits using VHDL. Navabi.: 12] UNIT – III Subprogram Overloading. “ VHDL-Analysis and Modeling of Digital Systems”. Behavioral Modeling. Roth. package body. MGH. H. Each question should be of 12. “VHDL”. Model simulation.

Check Boxes. one and two dimensional arrays. 2nd Ed. Working with windows. adding variables and methods. Packages and interfaces. Beans: Introduction to Java Beans and Swings. Access protection. throw... constants. 1. variables and Data Types. “Programming Java: A introduction to programming using JAVA”. Layout managers and menus. Byte and Character Stream. UNIT – I Introduction to Java: Importance and features of Java. Horstmann. Techmedia Publication. 2.5 marks. Reading and writing from console and files. 1 should be compulsory and cover the entire syllabus. student may be asked to attempt only 1 question from each unit. animation. Decker & Hirshfield. of Hrs. uncaught exceptions. 2004. handling Image. Object class. class inheritance. creating objects. cotnue return. networking classes and interfaces. packages. Javascript [No. Each question should be of 12. [No. final. Classes: String and String Buffer classes. Every unit should have two questions. Vikas Publication. Sending and Receiving Mails. Keywords. TMH. Shelley Powers. switch. Event Listener Interfaces. rest of the paper shall consist of four units as per the syllabus. “Java-2 The Complete Reference”. Question No. Decision Making. “HTML 4 unleashed”. of Hrs. Adapter and Inner Classes. for statements. DHTML. Creating Tables. Wrapper classes: Basics types. Using Standard Java Packages (lang.?: operator.Code No. Balaguruswamy. of Hrs. Graphical and animation techniques. labeled loops. constructors. E. REFERENCES BOOKS: . io. TMH Rick Dranell. Graphics and Text. predefined streams. using AWT controls. 3. Multithreaded Programming: Fundamentals. Apart from question no. ASP. This question should have objective or short answer type questions. 1999. Multilevel hierarchy abstract and final classes. 1.else. Operators and Expressions. util. Java Applet. synchronization. Text Books. doing TCP/IP and Data-gram Programming [No. string array and methods. jump statements: break. net). Techmedia.: 12] UNIT – III Event Handling: Different Mechanism. Guidelines for a good website design. Branching and Looping: if. It should be of 25 marks. using java. “Programming with Java: A Primer”. However. 1998. messaging. 2000. Extending Interfaces. inter thread Communication. John Wiley. using super. throw. Java thread model: priorities. “Computing Concepts with Java 2 Essentials”. 2. 2004. thread classes. while. Event Classes. Servlets[No.net package.: 12] UNIT – II Exception Handling: Fundamentals exception types.: ETIT 303 Paper: Java Programming and Website Design L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Static & Dynamic Web Pages. Arrays and String: Creating an array. resuming and stopping threads. “Dynamic Web Publishing”.: 10] UNIT – IV Website Designing: Overview of Internet and Intranet Services. Introducing classes. of Hrs. suspending. Run able interface.: 10] TEXT BOOKS: 1. sound and video. Patrick Naughton and Herbertz Schildt. Networking: Basics. Frames. built in exception. objects and methods: defining a class. do. 2. 3. 1998. creating your own exceptions. the Delegation Event Model. HTML Tags. Input/Output Programming: Basics. Streams.

. Wiley Dreamtech. “Starting out with Java”. 5. Holzner. “HTML Blackbook”. 2005. 2005.4. Tmy Gaddies. Wiley Dreamtech.

However. of Hrs: 11] TEXT BOOKS: 1. RISC Pipeline. addition and subtraction. computer registers. division algorithms. asynchronous data transfer. memory management hardware. Input-Output Organization: Peripheral devices. virtual memory. modes of data transfer. addressing modes. memory reference instructions. rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. “Fundamental of Computer Organization & Design”. 1993. P. “Computer Architecture and Organization”. M Mano.Code No. Wiley Dreamtech. pipelining. decimal arithmetic operations. REFERENCES BOOKS: 1. It should be of 25 marks. 1. [No. McGraw Hill. design of accumulator logic. student may be asked to attempt only 1 question from each unit. Apart from question no. main memory. direct memory access. PHI. input-output processor. multiplication algorithms.5 marks. of Hrs: 11] UNIT – IV Memory organization: Memory hierarchy. stack organization. Each question should be of 12. “Computer Organization & Architecture”. This question should have objective or short answer type questions. instruction formats. register transfer. 3. Pipeline and vector processing Parallel Processing. arithmetic pipeline. auxiliary memory. shift microoperations. 1993. [No. general register organization. J. bus and memory transfer. PHI. 4. Central Processing Unit: Introduction. Interconnection Structure. of Hrs: 11] UNIT – II  Microprogrammed Control Unit: Control memory. 1 should be compulsory and cover the entire syllabus. decimal arithmetic unit. Hayes. Malvino. priority interrupt. 2. Vector Processing. 1998. 2005. floating point arithmetic operation. Question No. [No. cache memory. UNIT – I Introduction and overview: Review of digital components. “Computer System and Architecture”.: ETCS 305 Paper: Computer Architecture L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. “Digital Computer Electronics: An Introduction to Microcomputers”. Multiprocessors: Characteristics of multiprocessor. W. 2001. Interprocessor Communication & Synchronization [No. arithmetic microoperations. timing & control. design of basic computer. instruction cycle. Basic Computer Organization and Design: Instruction codes. associative memory. . Dandamudi. input-output interface. Register Transfer and Microoperation: Register transfer language. input-output and interrupts. logic microoperations. 2. computer instructions. Stallings. address sequencing. McGraw Hill. Array Processors. Evolution of computers. of Hrs: 11] UNIT – III Computer Arithmetic: Introduction.

Flat top sampling. 2. Quantization error [No.: 13] TEXT BOOKS: 1. 2. Matched Filter. Mc Graw Hill. 2.: 09] UNIT – II Pulse-code modulation (PCM). 2000. It should be of 25 marks. IInd Edition. of Hrs. . Every unit should have two questions. Differentially-Encoded PSK (DEPSK). Non-Coherent reception of FSK. Relationship between Bit error rate and Symbol Error rate and comparison of modulation systems. Companding. 1. Adaptive delta modulation. Haykin. student may be asked to attempt only 1 question from each unit. [No. Binary Frequency-Shift Keying (BFSK). 1 should be compulsory and cover the entire syllabus. rest of the paper shall consist of four units as per the syllabus. 1999. Minimum Shift Keying (MSK). Differential Phase-Shift Keying. REFERENCE BOOKS: 1. Linear Predictive coder. Probability of error. J G Proakis. Electrical representation of binary digits. S. [No. Channel Vocoder. UNIT – I Analog-to-Digital Conversion: Sampling theorem.[No. Quadrature Amplitude Shift Keying (QASK). 1999. Multiplexing PCM signals. Delta modulation. “Analog and Digital Communication”. Wiley. “Digital Communication”. 1998. Probability of error in Matched filter. Quadrature Phase-Shift Keying (QPSK). The Optimum Filter. “Elements of Information Theory”. Natural sampling. Question No. Coherent reception of PSK and FSK. Quantization of signals. Taub and Schiling. S. Similarity of BPSK and BFSK. Apart from question no. Channel bandwidth for PAM signal. 3. Wiley. Vocoders. Wiley.5 marks.Code No.: 10] UNIT – III Digital Modulation Techniques: Binary Phase-Shift Keying (BPSK). of Hrs. 2001. Calculation of error probability of BPSK and BFSK. Each question should be of 12. However.: 12] UNIT – IV Data Transmission: A base band signal receiver. of Hrs. TMH. “Principles of Communication Systems”. J M Thomos.: ETIT 307 Paper: Digital Communication – I L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. “ Digital Communications”. The PCM system. Error probability for QPSK] Bit-by-bit encoding versus Symbol-by-Symbol encoding. This question should have objective or short answer type questions. Differential PCM. Coherent reception. M-ary FSK. of Hrs. Haykin. T M Gover. Pulse-Amplitude Modulation. PSK and QPSK.

Lossless Join and Dependency Preserving Decomposition. Buffer Management. [No. Attributes and Relationships. “Oracle 8 Architecture”. Oracle 8 Architecture. Normal Forms Based on Primary Keys. 1 should be compulsory and cover the entire syllabus.5 marks. 2003. Relational Algebra. Shadow Paging. It should be of 25 marks. Timestamp-based Protocols. Specialization. Date. Recovery System. “Fundamentals of Database Systmes”. 4th Ed. and Aggregation. C. Log-based Recovery. UNIT – I Basic Concepts and Conceptual Database Design: Database administrator & Database Users. Indexing. Translating your ER Model into Relational Model [No. Join Operation. Network & Relational Data Base Management Systems. rest of the paper shall consist of four units as per the syllabus. Schemes & Instances. 2004 3. [No. Galgotia Publications. 3NF & BCNF). of Hrs. J. Concepts and Architecture. Ullman. Shared Database Access Mechanism. Elmsari and Navathe. Data Definition in SQL. Oracle Software Structures. DBMS Architecture & Data Independence.Code No. Other Operations. Overview.. Overview of Hierarchical. 2. Korth. Narosa Publishing. Functional Dependencies. (1NF. Question No. Concepts of Object Oriented Database Management Systems. Every unit should have two questions.: 11] TEXT BOOKS: 1. Evaluation of Expressions. Database Storage. 4th Ed. 1999. Data Models.: 11] UNIT – III Relational Data Base Design and Oracle Architecture: Functional Dependencies & Normalization for Relational Databases. This question should have objective or short answer type questions. J. “An Introduction to Database Systems”. of Hrs. 2nd Ed. Serializability. Lock-Based Protocols. Recovery and Atomicity. Specifying Constraints and Indexes in SQL. Concurrency Control Techniques.. Failure Classification. Strong and Weak Entity Sets. Relational Model Concepts. Database Languages & Interfaces. Distributed Data Base Management Systems. D. Concurrent Executions. Languages & Systems: Relational Data Model & Relational Algebra. Storage Structure. However.: 11] UNIT – IV Transaction Management: Transaction Concept and State. TMH. Measures of Query Cost. Sorting. “Database System Concepts”. Cardinality of Relationships. . TMH. 2. SQL – A Relational Database Language. [No. Generalization. Implementation of Atomicity and Durability. Relational Model Constraints. Database Systems. Steve Bobrowski. Data Modelling Using The Entity-Relationship Model – Entities. 7th Ed. 1. Wesley. student may be asked to attempt only 1 question from each unit. of Hrs. A. Each question should be of 12. Characteristics of the Database. 2004 2. Deadlock Handling.: 11] UNIT – II Relational Model.. Selection Operation. View and Queries in SQL. 2NF. Apart from question no. Silberschatz.. Database Protection. “Principles of Database Systems”. Practicing SQL commands using ORACLE. Recoverability. Recovery with Concurrent Transactions. 2000 REFERENCES BOOKS: 1. of Hrs. Hashing and Query Processing: Query Processing. Implementation of Isolation.: ETCS 309 Paper: Database Management Systems L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1.

PHI. Management of Change. al. 2002.Code No. “Fundamentals of Management”.. Management Systems and Processes. Job Anxiety & Stress. This question should have objective or short answer type questions. 2002. 2004. S. Personality. et.5 marks. Organisational structure & Design. 2002.: 11] UNIT – III Organizational Climate. Oxford University Press. 3rd Edition. 2. Stephen P. “Introduction to Management”. 4. Controlling: Process and Techniques [No. Chandan. McGraw Hill International Edition. of Hrs. Joseph W. 6th Edition. [No. Behaviours: Perceptions. 2004. of Hrs. Organizational context of decisions.” 9th Edition. “Management”. Management of Organizational Conflicts. J. “Organisational Behaviour & Change. 3rd Edition. [No. Learning. Culture and Managerial ethos. Fred Luthans. of Hrs. Interpersonal relations. Managerial Skills. “Organisational Behaviour. Each question should be of 12.: 11] UNIT – IV Individual Determinants of organizational. 2nd Edition. Leadership Styles & Influence. Tasks & Responsibilities of a Professional Manager. 2004. 3. Udai Pareek. REFERENCES BOOKS: 1. It should be of 25 marks. Question No. Motivation. 1 should be compulsory and cover the entire syllabus. Apart from question no. Group Dynamics. Decision-Making Models. Managerial Communication. Robbins. “Understanding Organisational Behaviour”. Stoner. However. Palgrave McMillan. CrossCultural Dynamics & Ethics”. rest of the paper shall consist of four units as per the syllabus. Managing Diversrity. 2003 2. of Hrs. Weiss. 1st Edition.: ETMS 311 Paper: Organizational Behaviour L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. David & Decenzo. Pearson Education. 3. .: 11] UNIT – II Planning Types and Process. Attitudes & Values.: 11] TEXT BOOKS: 1. Analysing. UNIT – I Meaning & Nature of Management. 2. student may be asked to attempt only 1 question from each unit. “Organisational Behaviour”. Every unit should have two questions. Richard Pettinger. [No. 1. Vikas Publishing House. Management by Objectives. Problem solving techniques and processes. Vikas Publishing House.

I. Practical will be based on Digital Communication . : ETEC 351 Paper: Digital Circuits & Systems – II Lab. : ETIT 355 Paper: Digital Communication – I Lab. L 0 P 2 C 1 Code No. Practical will be based on Digital Circuits & Systems – II. L 0 P 2 C 1 Code No. L 0 P 2 C 1 Code No. Practical will be based on Database Management System. L 0 P 2 C 1 Code No. . : ETIT 353 Paper: Java Programming & Website Design Lab. : ETIT 359 Paper: *Practical Training L 0 P 0 C 1 *NUES Practical training conducted after fourth semester will be evaluated in the fifth Semester based on Viva-Voce. Practical will be based on Java Programming & Website Design.Code No. : ETCS 357 Paper: Database Management Systems Lab.

and multiple if-then-else programs. Programming & Design”. 2nd Edition. It should be of 25 marks. Timing. Constructing the machine codes for 8086 instructions. 8253. 1999 REFERENCES BOOKS: 1. “IBM PC Assembly language programming”. while-do programs. 1. and Troubleshooting: A abasic 8086 microcomputer System. 2. Addison Wesley.: 11] TEXT BOOKS: 1. if-then-else. Hall.: 11] UNIT – II Implementing Standard Program Structures in 8086 Assembly Language: Simple Sequence Programs. Procedures. 80486. Codes. Timing Diagrams 8086 Interrupts and Interrupt Applications: 8086 interrupts and Interrupt Responses. Antonaks. 8087 and Pentium architecture. Jumps. 80386. writing programs for use with an assembler. Brief Introduction to Architecture of 80186. Each question should be of 12. assembly language program development tools [No. writing and using assembler macros 8086 Instruction Descriptions and Assembler Directives [No. 8086 internal architecture. . 2. instruction timing and delay loops Strings. rest of the paper shall consist of four units as per the syllabus.Code No. “An Introduction to the Intel Family of Microprocessors”. 8259. This question should have objective or short answer type questions. while-do programs.: ETCS 302 Paper: Microprocessor Systems L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. However. An example Minimum-mode System. Apart from question no. 1999. [No. 8251. 1 should be compulsory and cover the entire syllabus. and Digital Devices: Computer Number Systems and Codes. James. the 8086 microprocessor family-overview. of Hrs. TMH. L.: 11] UNIT – IV Interfacing 8086 with 8255. repeat-until programs. PHI. Every unit should have two questions.5 marks. PHI. of Hrs. 80286. Troubleshooting a simple 8086-based microcomputer. Hardware Interrupt Applications [No. 1999. student may be asked to attempt only 1 question from each unit. Question No. V. introduction to programming the 8086. UNIT – I Computer Number Systems. Peter Able. D. the SDK-86. and Conditional Jumps. 8086 Family Assembly Language Programming: Program Development Steps. 1994. writing and using procedures. Liu Gibson. Microprocessor Evolution and Types. 8259. “Microprocessor Systems: The 8086/8088 family Architecture. 3. 8254. 8279. addressing modes of 8086. of Hrs. Flags. If-Then. of Hrs. and macros: the 8086 string instructions.: 11] UNIT – III 8086 System Connections. “Microprocessors and Interfacing”.

Case Studies [No. However. Requirements Model-Action & Use cases. Ivar Jacobson. “Classical & Object Oriented Software Engineering with UML and Java: McGraw Hill. the testing process [No. test model Analysis: Introduction. Pearson Education. William M. the design model. Richard C. REFERENCES BOOKS: 1. 1 should be compulsory and cover the entire syllabus. A Practical guide to objectoriented Development”. Each question should be of 12. “UML and C++.: 11] UNIT – IV Modelling with UML: Basic Building Blocks of UML. 3. Pearson. analysis model. Lee.Michael Boggs “Mastering UML with Rational Rose”. on testing. [No. Every unit should have two questions. UML Diagrams. 2. the design model.: 11] UNIT – III Construction: Introduction. James Runbaugh. integration testing. Tepfenhard. Software Life Cycle Models. BPB Publication. unit testing. student may be asked to attempt only 1 question from each unit. Question No.Boggs. Scach. 2002.: ETCS 304 Paper: Object Oriented Software Engineering L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. of Hrs. requirements model. block design. Managing Requirements Elicitation. of Hrs. rest of the paper shall consist of four units as per the syllabus. working with construction Testing: introduction. model architecture. 2003. Wendy Boggs. “The UML User Guide”.: 11] TEXT BOOKS: 1. . of Hrs. UNIT – I Introduction to Software Engineering: Software Engineering Development. 2004.5 marks. Overview of Requirements Elicitation. 2004. the requirements model. Apart from question no. “Object Oriented Software Engineering”. Basic Structural Modeling.Code No. 1999. Ivar Jacobson. the implementation model. 1. the analysis model [No. This question should have objective or short answer type questions. Pearson. 2. Comparison of various models Requirement Elicitation: Introduction to Object Oriented Methodology. 2. System development is model building. system testing. of Hrs. Requirements Elicitation Activities. A Conceptual Model of UML.: 11] UNIT – II Architecture: Introduction. Grady Booch. It should be of 25 marks. Stephen R.

hubs. PHI. Question No. Michael A. A. [No. TCP/IPOverview. This question should have objective or short answer type questions. 1996. narrowband ISDN. of Hrs. It should be of 25 marks. Each question should be of 12. PHI. Tananbaum. UNIT – I Uses of Computer Networks. Vikas Publication. satellite networks. U.: ETIT 306 Paper: Computer Networks L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 1999.: 11] TEXT BOOKS: 1. REFERENCE BOOKS: 1. “Computer Networks-Protocols. . congestion control algorithm. S. [No. 1999. 2. sliding window protocols. “Computer Communication Networks”.Code No. PHI. of Hrs. However. high-speed LANs. switches and bridges. Examples of Data Link Protocols. 3rd Ed. W. Wireless transmission. Twisted Pair. [No.: 11] UNIT – IV The Network Layer: Network layer design issues. Cable Mounting. 1. of Hrs. the telephone system. student may be asked to attempt only 1 question from each unit. of Hrs. William A. Vikas Publication. routing algorithms. Structured Cabling. Broadband Coaxial Cable. 3. Stallings. 4. Black. Miller. Standards and Interfaces”. Subneting). IP Address Classes. [No. transmission media-Magnetic Media. 1999. broadband ISDN and ATM.5 marks. 1 should be compulsory and cover the entire syllabus. Fibre Cable. “Understanding Data Communications & Networks”. Every unit should have two questions. data link protocols. IEEE standard 802 for LANS and MANS. “Computer Networks”.III The Medium Access Sublayer: The channel allocation problem. the network layer in ATM networks. Cable Testing. 2. error detection and correction. multiple access protocols. Baseband Coaxial Cable. internetworking. Reference Model (ISO-OSI. Network devicesrepeaters. 5. “Data & Network Communications”. “Introduction to Cisco Router Configuration”. rest of the paper shall consist of four units as per the syllabus. Techmedia. Laura Chappell (ed). 1999. the network layer in the internet. Network Architecture. Shay. 1998. Apart from question no.: 11] UNIT – II The Data Link Layer: Data link layer design issues. Domain Name Registration & Registrars The Physical Layer: Theoretical basis for data communication.: 11] UNIT .

: 11] UNIT – II Transform-Domain Representation of Signals: the Discrete-Time Fourier Transform. Schater . FIR filter Design based on truncated fonner sens. Sample-and-hold circuits. FIR Digital Filter Structures. "Digital Signal Processing”. Each question should be of 12. Discrete-Time processing of random signals. Sanjit K. Design of Digital IIR notch filters. rest of the paper shall consist of four units as per the syllabus. Signals and signal Processing: characterization & classification of signals. J. Discrete-Time systems.5 marks. 1 should be compulsory and cover the entire syllabus. 1. Question No. computation of the DFT of real sequences. 2. PHI. Methods for computing FFT. Allan Y. Reconstruction Filter Design. PHI. power spectrum estimation. [No. structures for digital filters. 2000. Jhohnson. This question should have objective or short answer type questions. Applications of DSP. 2nd Ed. FIR filter design based on Frequency Sampling approach. UNIT – I Discrete time signals and systems. [No. random signals. of Hrs.: ETIT 308 Paper: Digital Signal Processing L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. of Hrs. minimum-phase and maximum-Phase transfer functions. the sampling process. example of typical Signals. complementary transfer functions.Code No. Frequency transformations: linear phase design. Z-transforms. REFERENCE BOOKS: 1. 2001. Analog Filter Design. state-space representation of LTI Discrete-Time systems. Signal Flow Graph Representation. Digital Filter Design: Impulse invariance method of IIR filter design. Bilinear Transform method of IIR Filter Design. Anti-aliasing Filter Design. Z-transforms. . student may be asked to attempt only 1 question from each unit. Time-Domain characterization of LTI Discrete-Time systems. “DSP a Computer based approach” . It should be of 25 marks. 2. Noise analysis of digital filters. Oppenhein & Ronald W. A/D & D/A converter. 2004. IIR Filter Structures. Linear Convolution using the DFT. design procedures for FIR and IIR filters. Inverse z-transform. “Intorduction to Digital Signal Processing”. Equivalent Structures. transform domain representations of random signals. R. Digital Sine-Cosine generator. Mitra. Parallel all pass realization of IIR transfer function. properties of z-transform. typical Signal Processing operations. However. DFT.: 11] UNIT – IV Digital Filter Structure: Block Diagram representation. FFT Algorithms. Apart from question no.: 11] TEXT BOOKS: 1. typical Signals Processing applications. Time Domain Representation of Signals & Systems: Discrete Time Signals. DFT properties. [No.. of Hrs. Digital Processing of Continuous-Time Signals : sampling of Continuous Signals. [No. Every unit should have two questions. the transfer function. Discrete Fourier Transform. TMH. Operations on Sequences. of Hrs. types of transfer function.: 11] UNIT – III Transform-Domain Representation of LTI Systems: the frequency response.

“Digital Signal Processing: Theory.2. 2004. PHI. Somanthan Nair. B. Analysis & Digital Filter Design”. .

the MOLAP model. OLAP definitions and rules. of Hrs. Advantages of the STAR Schema Dimensional Modeling: Updates to the Dimension tables. student may be asked to attempt only 1 question from each unit. From Requirements to data design. data warehouse defined Data warehouse – The building Blocks: Defining Features. requirements definition: scope and content [No. Paul Raj Poonia. “Data Warehousing in the real world: A practical guide for building decision support systems”. requirements gathering methods. [No. “Building the operational data store”. applications in telecommunications industry. fast access and powerful calculations. OLAP implementation considerations [No. REFERENCES BOOKS: 1.. failures of Past decision-support systems. moving into data mining.: ETCS 310 Paper: Data Warehousing and Data Mining L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. the STAR schema. “Fundamentals of Data Warehousing”. of Hrs. 1 should be compulsory and cover the entire syllabus. the ROLAP model. OLAP characteristics. The knowledge discovery process. OLAP versus data mining. Major Data Mining Techniques. John Wiley. rest of the paper shall consist of four units as per the syllabus. Data Mining Defined. Inmon. general features.: 11] UNIT – IV Data Mining Basics: What is Data Mining. operational versus decision-support systems. Every unit should have two questions. 2. Benefits of data mining. of Hrs. need for multidimensional analysis. 2004. STAR Schema Keys. applications in retail industry. Sam Anahony. overview of the components. data warehouses and data marts.: 11] TEXT BOOKS: 1. ROLAP versus MOLAP. OLAP is the answer. families of STARS [No. applications in banking and finance. limitations of other analysis methods. neural networks. memory-based reasoning. data mining and the data warehouse. OLAP models. metadata in the data warehouse Defining the business requirements: Dimensional analysis. overview of variations. link analysis. Data Mining Applications. dimensional analysis. data warehousing – the only viable solution. 1.: 11] UNIT – II Principles of dimensional modeling: Objectives. miscellaneous dimensions. slice-and-dice or rotation. John Wiley & Sons. information packages – a new concept. of Hrs. John Wiley. However. decision trees. This question should have objective or short answer type questions. Each question should be of 12.Code No. 2. 1999. UNIT – I The Compelling Need for data warehousing: Escalating Need for strategic information. the snowflake schema. major features and functions. 2nd Ed. It should be of 25 marks. genetic algorithms. what are hypercubes? Drill-down and rollup.5 marks. Cluster detection.: 11] UNIT – III OLAP in the Data Warehouse: Demand for Online analytical processing. 2004 W. Question No. H. . aggregate fact tables. Apart from question no.

2004.2.. Kamber and Han. 2001 “Data Warehousing”. 3. Hartcourt India P. “Data Mining Concepts and Techniques”. . BPB Publications. Ltd.

1 should be compulsory and cover the entire syllabus. rest of the paper shall consist of four units as per the syllabus. entropy. [No. Information rate. of Hrs. Trellis diagram. Sources with finite memory. BCH codes. Network information theory. Hamming distance.IV Convolution Coding: Code tree. 2001. Wiley. Error correcting codes.Code No. 1999. Apart from question no. UNIT – I Information.5 marks. Reed-Soleman codes. channel capacity. T M Gover.: 13] UNIT . Golay codes. Shannon-Fano algorithm. binary cyclic codes. of Hrs. Discrete memory less channel. of Hrs. Markov sources. 2. introduction to Cryptography TEXT BOOKS: 1. Every unit should have two questions. state diagram. [No. “Elements of Information Theory”.: 11] UNIT . Linear block codes. Huffman coding. However. “Digital Communications”. This question should have objective or short answer type questions. J M Thomos. 2000.: ETIT 312 Paper: Digital Communication – II 3 L 1 T 4 C INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Question No. Mc Graw Hill. Mutual information. [No. “ Digital Communications”. Repetition codes.: 09] UNIT – II Source coding: Noise less coding. S. 1. Shannon’s second fundamental theorem on coding. J G Proakis. Each question should be of 12. sequential decoding. Lempel – Ziv algorithm. Wiley. REFERENCE BOOKS: 1.: 11] . student may be asked to attempt only 1 question from each unit. Conditional and joint entropies. [No. Shannon’s first fundamental theorem. Maximum-Likelihood decoding – Viterbi’s algorithm. The concept of amount of information. Haykins. 2. of Hrs.III Channel coding : Error detecting codes. It should be of 25 marks.

II. L 0 P 2 C 1 . L 0 P 2 C 1 Code No. L 0 P 2 C 1 Code No.II Lab. 0 L 2 P 1 C Practical will be based on Data Warehousing and Data Mining. : ETCS 352 Paper: Microprocessor Lab. Practical will be based on Digital Signal Processing.Code No. : ETIT 356 Paper: Digital Signal Processing Lab. Practical will be based on Microprocessor Systems L 0 P 2 C 1 Code No. Practical will be based on Object Oriented Software Engineering. : ETCS 354 Paper: Object Oriented Software Engineering Lab. : ETIT 358 Paper: Data Warehousing and Data Mining Lab. Practical will be based on Digital Communication . Code No. : ETIT 360 Paper: Digital Communication .

A. RMON 1&2”. “Introduction to Cisco Router Configuration”. SNMPv3. “TCP/IP Protocol Suite”. W. “Data & Network Communications”. However. IP Protocol. Connection Establishment) [No. William A. It should be of 25 marks. U. A. Apart from question no. Michael A. 1996. Techmedia. ATM [No. 2nd Ed. REFERENCE BOOKS: 1. PHI. Stallings. Standards and Interfaces”. PHI. of Hrs. 1999.: 11] UNIT – IV Application layer: DNS. Forouzan. Internetworking. Frame Relay. 2. WWW.: ETIT 401 Paper: Advanced Computer Networks L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. ISDN.5 marks. IPv6 (an overview). Routing algorithms and protocols. Vikas Publication. SNMPv2. 1996. student may be asked to attempt only 1 question from each unit. 1999.: 11] TEXT BOOKS: 1. 2004. 1999. Cryptography. of Hrs. 1999. PHI. [No.Code No. RMON. Network Security: Firewalls (Application and packet filtering). Every unit should have two questions. of Hrs. Each question should be of 12. 3rd Ed. Vikas Publication. Miller. Shay. Router configuration. Congestion control algorithm. Virtual Print. B. Black.. S. Question No. SNMP. 5. Electronic Mail. TMH. “Understanding Data Communications & Networks”. 1999. of Hrs. rest of the paper shall consist of four units as per the syllabus. 1 should be compulsory and cover the entire syllabus. 6. . TCP (Flow Control. This question should have objective or short answer type questions. 1. Router Operation. [No. Error Control. “Computer Communication Networks”. 3rd Ed. “SNMP.: 11] UNIT – III Transport Layer: UDP.: 11] UNIT – II Network Layer: ARP and RARP. Laura Chappell (ed). Tananbaum. “Computer Networks”. Addison Wesley.. 3 W. 7. “Computer Networks-Protocols. 4. Stallings. UNIT – I Review of Physical & Data link layer. 2.

Motivation for multimedia usage. CD-ROM and the Multimedia Highway. audio. rest of the paper shall consist of four units as per the syllabus. Introduction to making multimedia – The Stages of project. Flash Etc. of Hrs. 2000. 1999. Uses of Multimedia. Mental ray. “Multimedia: Computing. Keyes.: 11] UNIT – IV Dynamics: Active and Passive bodies. Multimedia software and Authoring tools.. making instant multimedia. UK. “Multimedia & Communication Systems”. [No. Modelling: NURBS. Multimedia-Hardware and Software: Multimedia Hardware – Macintosh and Windows production Platforms. hardware etc. skeleton animation. 2. software.. Apart from question no. 2D and 3D Animation. “Multimedia System Design”. Pearson. Focal Press. . PTR. Path animation. TMH. 2000. expressions. Data Compression: Different Compression algorithms concern to text. Animation: Keyframe. PHI. 3. It should be of 25 marks. of Hrs. However. Rendering: Different rendering techniques like IPR. 2001. the requirements to make good multimedia. Production Standards. Ralf Steinmetz and Klara Naharstedt. Andleigh and K. TMH. REFERENCES BOOKS: 1. Frequency domain analysis. K. light and special effects. Images. 1999. 3D Effects. “Multimedia: Making it work”. “Multimedia Handbook”. Media software – Basic tools. video and images etc. Digitization of Audio and Video objects. Organic modeling. “Advanced Multimedia Programming”. working on 3D animation tools. Multimedia skills and training. etc. 1. etc. Working Exposure on Tools like Dream Weaver. Polygon. constrains. 2.Code No. MHI. materials. This question should have objective or short answer type questions. [No.: ETIT 403 Paper: Multimedia Applications L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Sound. fields. student may be asked to attempt only 1 question from each unit.. [No. Hardware peripherals – Connections. Tay Vaughan.5 marks. Steve Rimmer. Memory and storage devices. 2000. of Hrs. Shadows. Communications & Applications”. Every unit should have two questions. Animation and Video. UNIT – I Introductory Concepts: Multimedia – Definitions. Question No. Steve Heath. Training opportunities in Multimedia. 3. 1 should be compulsory and cover the entire syllabus. Application Domain & ODA etc.: 11] UNIT – III Animation: Different techniques. [No.: 11] TEXT BOOKS: 1. Each question should be of 12. 2. Thakkar. of Hrs.: 11] UNIT – II Multimedia – making it work – multimedia building blocks – Text.

Classification of grammars. Dick Grune et. rest of the paper shall consist of four units as per the syllabus.IV Code optimization. 2. A. “Modern Compiler Implementation in C”. IR grammars. Folding.5 marks. of Hrs. 2000. Appel. Comparison of parsing methods.: 12] UNIT . compiler generation tools and system softwares. 1985. LL grammars.: 12] UNIT . Top down parsing. McGraw Hill. Al. Polish N-tuple and syntax trees. Holub. 2000. “Modern Compiler Design”. student may be asked to attempt only 1 question from each unit. Context free grammars. Intermediate forms of source program. Andrew L. Foundation Books.: 10] TEXT BOOKS: 1. “Compiler Design in C”. 2002 REFERENCES BOOKS: 1. Organization for non-block and block structured languages [No. . Apart from question no. 2. 2004 3. [No. of Hrs. Tremblay. Every unit should have two questions. Pearson Education. New York. Static and dynamic allocation. et. Optimizatiion within iterative loops. Polish expression Operator Precedence grammar.: ETCS 405 Paper: Compiler Construction L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. This question should have objective or short answer type questions. “Principles of Compiler Design”. of Hrs.III Run time storage administration. Aho. 1. Delhi. Deterministic finite state automata (DFA) Non-DFA. Symbol table handling techniques. [No.I Introduction to compilation process. of Hrs. UNIT .II Scanners. Error handling..Code No. Each question should be of 12. Semantic analysis and code generation. redundant sub-expression evaluation. Ullman & Ravi Sethi. Wiley Dreamtech. It should be of 25 marks. However. Question No. 1 should be compulsory and cover the entire syllabus.: 10] UNIT . PHI. al. 2. “The Theory and Practice of Compiler Writing”. Bottom up parsing. [No..

2000. “Wireless Web Development”. Hansmann. Mobility management. Raj Pandya. Mark Ciampa. and CDMA 2000. 1 should be compulsory and cover the entire syllabus. . of Hrs. Wiley Dreamtech. 2001. Mobility management. of Hrs. 2001. of Hrs. 3.Stavronlakis. Blue tooth Protocols. This question should have objective or short answer type questions. GPRS Network Nodes. Wireless Enterprise Networks: Introduction to Virtual Networks. Network signalling. 2. 2004. Blue tooth technology. case studies of the IRIDIUM and GLOBALSTAR systems. 2. Sandeep Singhal. [No.: 11] UNIT – III Third Generation (3G) Mobile Services: Introduction to International Mobile Telecommunications 2000 (IMT 2000) vision.: 11] UNIT – IV Global Mobile Satellite Systems. [No. Global System for Mobile Communication (GSM) system overview: GSM Architecture. Prentice Hall of India. rest of the paper shall consist of four units as per the syllabus.Code No. “Mobile and Personal Communication systems and services”. Quality of services in 3G. “Principles of Mobile Computing”. “Wireless and Mobile Networks Architectures”. student may be asked to attempt only 1 question from each unit. “Third Generation Mobile Telecommunication systems”. Vikas Publishing House. “The Wireless Application Protocol”. Springer Publishers. wireless mark up Languages (WML).5 marks. Yi-Bing Lin & Imrich Chlamtac. 2000. P.: 11] TEXT BOOKS: 1. Wideband Code Division Multiple Access (WCDMA). However. 2.: ETEC 407 Paper: Mobile Computing L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Wireless Application Protocol (WAP): The Mobile Internet standard. UNIT – I Introduction to Personal Communications Services (PCS): PCS Architecture. Apart from question no. Ray Rischpater. It should be of 25 marks. [No. [No. WAP Gateway and Protocols. 3. 2001. Networks signalling. wireless Local Loop Technologies.11 standard. Thomson learning. 2001. Question No.: 11] UNIT – II Mobile Data Communication: WLANs (Wireless LANs) IEEE 802. “Guide to Designing and Implementing wireless LANs”. Wireless Local Loop(WLL): Introduction to WLL Architecture. Pearson Education Asia. 1. Mobile IP. of Hrs. General Packet Radio Services (GPRS): GPRS Architecture. Every unit should have two questions. John Wiley & Sons. REFERENCE BOOKS: 1. Each question should be of 12. 4. Springer Publishing.

CMOS Technology. 2004. NOR Gate. Tristate Inverter. M. Each question should be of 12. twin tub process CMOS process enhancement: metal interconnect. 2nd Edition. This question should have objective or short answer type questions. The Inverter. Wiley Publications. of Hrs. Transmission gate. The silicon gate Process. Demassa & Ciccone. Combinational MOS Logic Circuits: MUX. basic n-well cmos process.: ETIT 409 Paper: VLSI Design L 3 T 1 4 C INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 3rd Edition. Ion-implanation and diffusion. of Hrs. 3. 4. [No. [No. Question No. 1 should be compulsory and cover the entire syllabus. Design and analysis of nMOS. of Hrs. Apart from question no. Sze. 2003. UNIT – I MOS Transistor Theory: nMOS Enhancement Transistor. Differential Inverter. 2004. REFERENCE BOOKS: 1. Fabrication of MOSFET: Silicon Semiconductor technology. Polysilicon / Refractory metal interconnect. 2003. Threshold voltage. TMH. Neil H. Dynamic Logic Circuits. 2004. Deposition.: 11] UNIT – IV Sequential MOS Logic Circuits. “Basic VLSI Design. pMOS and CMOS circuits.: 11] UNIT – III Modeling of MOS transistors using SPICE. Wiley. “Microelectronics”. S. Compound Gate. Pucknell. [No. Jacob Millman and Arvin Grabel. 1.: 11] UNIT – II Operation of MOS transistor as a switch. NAND gate.Code No. TMH. Epitaxy. Eshranghian. E. . Every unit should have two questions. Weste & K. Capacitor. 2000. Semiconductor Memories. “Principles of CMOS VLSI design”.: 11] TEXT BOOK: 1. Sung-Mo Kang and Yusuf Leblebici. Circuit element: Resistor. CMOS Logic. Oxidation. However. “Digital Integrated Circuits”. Addison Wesley. p-well process. MOS Inverters: Static Characteristics. Douglas A. 5.5 marks. pMOS Enhancement transistor. student may be asked to attempt only 1 question from each unit. It should be of 25 marks. 2. MOS Inverters: Switching Characteristics and Interconnect Effects. 2. “CMOS – Digital Integrated Circuits Analysis and Design”. [No. DMUX. Wafter processing. “VLSI Technology. rest of the paper shall consist of four units as per the syllabus. of Hrs.

Rafael C. Pearson Education. Introduction to Morphology. “Digital Image 2nd edition. rest of the paper shall consist of four units as per the syllabus. Distance Measures between pixels. Histogram Processing. Error free comparison. Interpixel and Psychovisual Redundancy. Linear and Non Linear Operations. of Hrs. Smoothening and Sharpening Spatial Filters. Jain. PHI. Connectivity. Combining Spatial Enhancement Methods. Apart from question no. [No. Basics of Spatial Filters. [No. Object Recoginition: Patterns and Pattern Classes. Wiener filtering.II Image Enhancement in the Frequency Domain: Introduction to Fourier Transform and the frequency Domain.: 12] UNIT . Elements of Information Theory. Each question should be of 12.III Image Compression: Coding. Image Enhancement in the Spatial Domain: Some basic Gray Level Transformations. 1. Some basic Morphological Algorithms. Boundary Descriptors.: 12] UNIT . REFERENCES: Processing”. of Hrs. Use of Principal Components for Description. Elements of Digital Image Processing Systems. Noise Models. Some basic relationships like Neighbours. Estimation of Degradation Function. Woods. Linear Position-Invarient Dedradations. Image Sampling and Quantization.K. Question No. Inverse filtering. student may be asked to attempt only 1 question from each unit. Examples of Fields that Use Digital Image Processing.Code No. Motion based segmentation. Image Compression models. Homomorphic Filtering. Every unit should have two questions. 1989. Regional Descriptors. Constrained Least Square Filtering. of Hrs. Thresholding. Conzalez & Richard E. 1 should be compulsory and cover the entire syllabus. 2. Lossy compression. .: ETEC 411 Paper: Digital Image Processing L 3 T 1 4 C INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Geometric Mean Filter. UNIT -I Introduction And Digital Image Fundamentals: The origins of Digital Image Processing.: 10] UNIT . Image Segmentation: Detection of Discontinuities. Image Restoration: A model of The Image Degradation / Restoration Process.5 marks. of Hrs. Geometric Transformations.[No. Edge linking and boundary detection. This question should have objective or short answer type questions. Decision-Theoretic Methods.IV Representation and Description: Representation. Pereodic Noise Reduction by Frequency Domain Filtering. Image compression standards. Restoration in the presence of Noise Only Spatial Filtering. Region Oriented Segmentation. [No. “Fundamental of Digital Image Processing”. Structural Methods. 2002.: 10] TEXT BOOKS: 1. However. Fundamentals Steps in Image Processing. Smoothing and Sharpening Frequency Domain Filters. Enhancement Using Arithmetic and Logic operations. It should be of 25 marks. 2. A.

1. 2.

Bernd Jahne, “Digital Image Processing”, 5th Ed., Springer, 2002. William K Pratt, “Digital Image Processing: Piks Inside”, John Wiley & Sons, 2001.

Code No.: ETCS 413 Paper: Requirements & Estimation Techniques

L 3

T 1

C 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 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 25 marks. 2. 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 of 12.5 marks.

UNIT – I Requirements engineering: Requirements Elicitation, Requirement Elicitation techniques, Requirement Analysis, Requirement Analysis Models, Requirement Documentation, Requirement Management, IEEE Std. For SRS [No. of Hrs.: 10] UNIT - II Size Estimation: Function Point Analysis, Mask II FPA, LOC estimation, Conversion between size measures [No. of Hrs.: 12] UNIT - III Effort, schedule & cost estimation: Estimation factors, COCOMO-II, Putnam Estimation Model, Estimation by Analogy, Validating Software Estimates [No. of Hrs.: 12] UNIT - IV Introduction to software life cycle, management activities in software project Tools: Software Estimation Tools Industry Resources; IFPUG, UQAM-SEMRL, COSMIC, IEEE, COCOMO[No. of Hrs.: 10]

TEXT BOOKS: 1. Swapna Kishore, Rajesh Naik, “Software Requirements and Estimation”, TMH, 1992. REFERENCE BOOKS: 1. K.K. Aggarwal & Yogesh Singh, "Software Engineering", 2nd Ed., New Age International Publishers, New Delhi, 2005. 2. Roger Pressman, “Software Engineering: A Practitioiner’s Approach”, 3rd Edition, McGraw Hill, 1992.

Code No.: ETCS 415 Paper: Advanced Computer Architecture

L 3

T 1

C 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 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 25 marks. 2. 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 of 12.5 marks.

UNIT – I Parallel computer models: The state of computing , Multiprocessors and multicomputers, Multivector and SIMD computers, Architectural development tracks Program and network properties :Conditions of parallelism, Data and resource dependences,Hardware and software parallelism,Program partitioning and scheduling, Grain size and latency, Program flow mechanisms,Control flow versus data flow,Data flow architecture,Demand driven mechanisms,Comparisons of flow mechanisms[No. of Hrs.: 11] UNIT - II System Interconnect Architectures : Network properties and routing, Static interconnection networks, Dynamic interconnection Networks, Multiprocessor system interconnects, Hierarchical bus systems, Crossbar switch and multiport memory,Multistage and combining network. Processors and Memory Hierarchy : Advanced processor technology, Instruction-set Architectures,CISC Scalar Processors, RISC Scalar Processors, Superscalar Processors,VLIW Architectures, Vector and Symbolic processors Memory Technology :Hierarchical memory technology, Inclusion, Coherence and Locality, Memory capacity planning, Virtual Memory Technology [No. of Hrs.: 11]
UNIT - III Backplane Bus System: Backplane bus specification, Addressing and timing protocols, Arbitration transaction and interrupt, Cache addressing models, Direct mapping and associative caches.

Pipelining :Linear pipeline processor, Nonlinear pipeline processor, Instruction pipeline design, Mechanisms for instruction pipelining, Dynamic instruction scheduling, Branch handling techniques, Arithmetic Pipeline Design, Computer arithmetic principles, Static arithmetic pipeline, Multifunctional arithmetic pipelines [No. of Hrs. 11] UNIT - IV Vector Processing Principles : Vector instruction types, Vector-access memory schemes. Synchronous Parallel Processing : SIMD Architecture and Programming Principles, SIMD [No. of Hrs.: 11] Parallel Algorithms, SIMD Computers and Performance Enhancement TEXT BOOKS: 1. Kai Hwang, “Advanced computer architecture”; TMH, 2000. REFERENCES BOOKS: 1. J.P.Hayes, “computer Architecture and organization”, MGH, 1998. 2. M.J Flynn, “Computer Architecture, Pipelined and Parallel Processor Design”, Narosa Publishing, 1998. 3. D.A.Patterson, J.L.Hennessy, “Computer Architecture :A quantitative approach”, Morgan Kauffmann, 2002.

2000. MGH.4. Hwang and Briggs. . “ Computer Architecture and Parallel Processing”.

Code No. .: ETIT 417 L - P 4 C 4 Paper: Project Students may select a project related to any of the subjects of the current semester.

: ETIT 451 Paper: Advanced Computer Network Lab. Code No. : ETIT 461 Paper: *Practical Training L 0 P 0 C 1 *NUES Practical training conducted after sixth semester will be evaluated in the Seventh Semester based on Viva-Voce. The student will have to present the progress of the work through seminars and progress reports. Code No. : ETIT 453 Paper: Multimedia Applications Lab. Practical will be based on Advanced Computer Network. Practical will be based on Multimedia Applications. : ETIT 459 Paper: Minor Project L 0 P 8 C 4 Students may choose a project based on any subject of Computer Science.Code No. L 0 P 2 C 1 Code No. Practical will be based on Electives L 0 P 2 C 1 Code No. : ETIT 455 Paper: Practical Lab. 0 L 2 P 1 C Code No. . : ETIT 457 Paper: *Seminar L 0 P 2 C 1 *NUES A college committee will evaluate the performance of the students & marks will be awarded accordingly. The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format.

Cambridge University Press. dropped call rates & their evaluation. 2. Each question should be of 12. wireless systems: GSM. [No.5 marks. CDMA compared with TDMA. Block Coding.: 11] UNIT – IV Second generation. Lawrence Harte. 2. OFDM. consideration of the components of cellular systems. 1990. “Mobile Wireless Communications”. antenna at cell site. [No. co-channel interference reduction factor. of Hrs. “3G Wireless Demystified”. traffic & channel assignment. desired C/I from a normal case in an omni directional antenna system. 2005. 1. 3. mobile to mobile propagation. propagation over water or flat open area. This question should have objective or short answer type questions. 2nd Edition. “Wireless Communication Principles and Practice”. of Hrs. planning a cellular system. performance criteria. [No. Every unit should have two questions. Principles of Wireless Networks”. 2. Pearson Education. 2002. code division multiple access (CDMA). McGraw Hill. co-channel measurement design of antenna system. 2001. “Mobile Communication Hand Books”. Kaveh Pahlavan and Prashant Krishnamurthy”. antenna heights and signal coverage cells. Elements of Cellular Radio Systems Design and Interference: General description of the problem. UK. operation of cellular systems. Mischa Schwartz. Apart from question no. types of handoff and their characteristics. However. antenna parameter and their effects. cell splitting. Y. uniqueness of mobile radio environment. obtaining the mobile point to point mode. modulation methods in cellular wireless systems. digital. C. voice signal processing and coding. of Hrs. point to point prediction model – characteristics. PHI. cell site. TDMA. propagation near in distance. “Mobile Cellular Telecommunications”. non-fixed channel assignment. McGraw Hill Publications. Theodore S Rappaport. foliage loss. IS-95. 4. of Hrs.: 11] UNIT – II Cell Coverage for Signal & Antenna Structures: General introduction. IS_136 (D-AMPS). probability of bit error considerations. Multiple access techniques: FDMA. 2001. Characteristics of basic antenna structures. concept of frequency reuse channels. mobile antennas. CDMA capacity. 2nd Edition.: 11] TEXT BOOKS: 1. 2nd Edition. . UNIT – I Introduction to Cellular Mobile Systems: A basic cellular system. 1 should be compulsory and cover the entire syllabus.: 11] UNIT – III Modulation methods and coding for error detection and correction: Introduction to Digital modulation techniques. Frequency Management & Channel Assignment. overview of generations of cellular systems. [No. convolution coding and Turbo coding. Introduction to co-channel interference.Code No. Hand Off & Dropped Calls: Frequency Management. Why hand off. long distance propagation. mobile management. CDMA: Time-division multiple access (TDMA). fixed channel assignment. student may be asked to attempt only 1 question from each unit.: ETIT 402 Paper: Mobile Communication L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Lee. IEEE Press. rest of the paper shall consist of four units as per the syllabus. It should be of 25 marks. William. REFERENCE BOOKS: 1. Question No.

M. This question should have objective or short answer type questions. I2C Bus. Logical instructions.J. 1991. Every unit should have two questions. RTOS Task Scheduling model. Overview of 8051 Microcontroller family: Architecture. 8051 interfacing to the keyboard. Sensors. Interrupt priority in the 8051 [No.: 11] TEXT BOOKS: 1. USB.Code No. Programming of 8051 Timers. 8051 serial communication programming. Reading input pins vs. student may be asked to attempt only 1 question from each unit. TMH. 8051 connections to RS-232. Microcontroller. 8255 Interfacing with 8031/51. BCD and ASCII application programs. “Embedded Real Time System”. Prasad. PHI. Each question should be of 12. Programming of External hardware interrupts. 8051 Register Banks and Stack Instruction set. Time delay generations and calculations. 2. Real Time Operating Systems: OS Services. Interrupt Latency and Response times of the tasks. 8051 interrupts. Single-bit instruction programming. Arithmetic instructions and programs. 2004. “The 8051 Microcontroller and Embedded Systems”. basic assembly language programming concepts.: ETEC 404 Paper: Embedded System L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1.IV Interfacing with 8051: Interfacing an LCD to the 8051. 1 should be compulsory and cover the entire syllabus. Interfacing a DAC to the 8051. Dr. Programming of timer interrupts. 2004. However. 8051 Flag Bits ad PSW Register. Penram International. Use of software tools for development of an ES. ESD and Co-design issues in System development Process. 2. David E. . Mazidi. Tasks and Threads. Loop and Jump Instructions. Data types. The program Counter and ROM Spaces in the 8051. Use of target system or its emulator and In-circuit emulator. Question No. Raj Kamal. Jaico Press 4. Problem of Sharing Data by Multiple Tasks. 3. Rajiv Kapadia. rest of the paper shall consist of four units as per the syllabus. Programming of the serial communication interrupts.: 11] UNIT – III Communication with 8051: Basics of Communication. I/O port programming Addressing Modes.5 marks. Processor in the System. G.A. 1. port Latch.: 11] UNIT . “An Embedded Software Primer”. Counter Programming [No. 2. Interfacing a Stepper Motor. Call Instructions. Wiley Dreamtech. I/O Subsystems. of Hrs. Overview of RS-232. Dr. of Hrs. Inter-process Communication and Synchronization of Processes. It should be of 25 marks. “The 8051 Microcontroller”. Mazidi and J. UART. Design cycle in the development phase for an embedded system. 8051 interfacing to ADC. 8051/31 interfacing to external memory [No. Simon. of Hrs. of Hrs. REFERENCES BOOKS: 1. Embedded System Project Management. Memory Devices. UNIT – I Introduction to an embedded systems design & RTOS: Introduction to Embedded system. “8051 Microcontroller & Embedded Systems”. [No. accessing memory using various addressing modes. 2004. Pearson Education. “Embedded Systems”. Ayala. Apart from question no. Interrupt Routines in RTOS Environment. K.: 11] UNIT – II Overview of Microcontroller: Microcontroller and Embedded Processors. 1999.

Every unit should have two questions. UNIT – I Neural Networks: History. 1 should be compulsory and cover the entire syllabus. 1999. Nonspecificity of Fuzzy & Crisp Sets. Linguistic Hedges. Combinations of Operations. Classical and Fuzzy Sets: Overview of Classical Sets. Hertz J. [No. “Introduction to the Theory of Neural Computation”. 3. Multilayer Perceptron Model. J. Delta. 1999. Training rules. Aggregation Operations. It should be of 25 marks. 1. ANN architecture. Operations on Fuzzy Sets: Compliment. GA in problem solving. This question should have objective or short answer type questions. Unsupervised and reinforcement Learning. of Hrs. A. Genetic Algorithm: An Overview. of Hrs. California. G. Learning rules. Back Propagation Algorithm.: 11] TEXT BOOKS: 1. PHI. Fuzziness of Fuzzy Sets.J. Hopfield Networks. Fuzzy Propositions. [No. 1991. rest of the paper shall consist of four units as per the syllabus. Lattice of Fuzzy Numbers.G. ANN training Algorithms-perceptions. “An Introduction to Neural Networks”.5 marks. Intersections. 1995.: 11] UNIT – II Fuzzy Logic: Introduction to Fuzzy Logic. Krogh. Arithmetic Operations on Intervals & Numbers. Mathematical Models of Neurons. However.: 11] Uncertainty based Information: Information & Uncertainty. Learning Paradigms-Supervised. 2. Each question should be of 12. R. Architecture of Neuro Fuzzy Networks. Implementation of GA [No. UNIT – III Fuzzy Logic: Classical Logic. Addison-Wesley. Applications of Artificial Neural Networks. student may be asked to attempt only 1 question from each unit. . Fuzzy Equations. Prentice-Hall International.: 11] Fuzzy Arithmetic: Fuzzy Numbers. Associative Memories. “Neural Networks-A Comprehensive Foundations”. UNIT – IV Introduction of Neuro-Fuzzy Systems. Palmer. Multivalued Logics. [No. Economics etc. Apart from question no. Unions. Linguistic Variables.Code No. of Hrs. New Jersey. Membership Function. Anderson. “Fuzzy Sets & Fuzzy Logic”. Klir & B. of Hrs. PHI. 2.: ETCS 406 Paper: Soft Computing L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Fuzzy Qualifiers. Fuzzy rule generation. Yuan. Question No. overview of biological Neuro-system. REFERENCE BOOKS: 1. Application of Fuzzy Logic: Medicine.

J. Mass. Addison Wesley. (1992). A. D.2. Melanie Mitchell. “An Introduction to Genetic Algorithm”.M. Skapura. Reading. Applications and Programming Techniques”. 3. . Freeman. 1998. “Neural Networks: Algorithms. PHI.

Tim Johns. Nilsson. N. branch and bound. REFERENCES BOOKS: 1. “Artificial Intelligence – An Engineering Approach”. [No. search space control. “Rule Based Expert Systems”. Horizon Effect. Sasikumar. D. expert systems. 1994. UNIT – I Scope of AI: Games. Alpha Beta Cutoff. Apart from question no. Schalkoff. House. production systems. Each question should be of 12. Probabilistic reasoning. Problem Solving (Blind): State space search. 2002. Structured Knowledge Representation: Semantic Nets: Slots. rest of the paper shall consist of four units as per the syllabus. Wiley Dreamtech.. Application Programming”. 2. Backward Chaining. “Introduction to AI and Expert Systems”. 1992. Rule based Systems. 2. vision and speech processing. learning by inductions. 2. [No. Constraint Satisfaction End. However. E. Pearson Education. 1.: 12] UNIT – II Game Playing: Game Tree. Resolution in Predicate Logic. Problem Reduction. P. "Artificial Intelligence".: 12] UNIT – III Handling Uncertainty: Non-Monotonic Reasoning. Every unit should have two questions. Declarative and Procedural Representation. 1 should be compulsory and cover the entire syllabus. Expert Systems: Need and justification for expert systems. 1992. Heuristic Based Search: Heuristic search.. Ramani. J. [No. robotics. [No. breadth-first search. Natural Language Processing: Introduction. S. This question should have objective or short answer type questions. 1990. Conflict Resolution Forward Chaining. 2nd Ed. Syntactic Processing. RI. Modus Tolens. Minimax Algorithm. 3. 2005. 5. AI techniques-search knowledge. Ed. Vikas Pub.Code No. Singapore. natural language processing. “Principles of AI”. theorem proving. H. Narosa Publishing House. use of certainty factors. Pragmatic Processing.5 marks. It should be of 25 marks.: ETCS 408 Paper: Artificial Intelligence L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. conceptual dependency. R.: 10] TEXT BOOKS: 1. PHI. Patterson. of Hrs. Question No. Hill climbing. Case Studies: MYCIN. scripts. M. W. knowledge acquisition. . Narosa Publ. 4. “Foundation Course in Artificial Intelligence”. of Hrs. McGraw Hill Int. fuzzy logic. Modified Minimax Algorithm. best-first search. 2004. Hoda. Futility Cut-off. N. 1992. Knowledge Representation: Predicate Logic: Unificatioin. 3. abstraction. Modus Ponens. depthfirst. learning automation.: 10] UNIT – IV Learning: Concept of learning. J. genetic algorithm. of Hrs. Semantic Processing. Winston. TMH. student may be asked to attempt only 1 question from each unit. of Hrs. Knight. “Artificial Intelligence. 3rd Edition. Rich and K. exceptions and default frames. M. “Artificial Intelligence”. Means-End Analysis. neural nets.

Functional and Process of Resource. Online commercial environments. prominent cryptographic applications. Each question should be of 12. Production Control. Production Finance. Internet environment – internet advantage. Secure sockets layers. Basic Modules of ERP System-HRD. A brief introduction to Cryptography. Security Technologies: Insecurity Internet. [No. Offline secure processing. secure onine transaction models. It should be of 25 marks. 1 should be compulsory and cover the entire syllabus. of Hrs. 1. of Hrs. rest of the paper shall consist of four units as per the syllabus. Sales and Distribution. MIS Integration for disciplines. private data networks. Training and Development. 2. EDI versus Internet and EDI over Internet. Forecasting. EDP. UNIT – I Introduction and Concepts: Networks and commercial transactions – Internet and other novelties. Every unit should have two questions. Shopping techniques and online selling techniques. Network Structure. KBS. Electronic Data Interchange. However. Finance.Code No. Information / Workflow. Electronic Payment Methods: Updating traditional transactions. Secure hypertext transfer protocols. digital currencies and payment systems. cyber cash model. TP.5 marks. This question should have objective or short answer type questions.: 11] UNIT – II Protocols for Public Transport of Private Information: Security protocols. Production Planning. Material Planning and Control. On-line Commerce Environments: Servers and commercial environments. Online commerce solutions. Techniques and Tools: Internet Strategies: Internet Techniques. secure protocols. Client Server Integrator System. Production Scheduling. worlds wide web and other internet sales venues. student may be asked to attempt only 1 question from each unit. Model for commercial transactions. DSS OLAP (Online Analysis and Processing). open market. Its basics. Netscape product line. Personnel Management. Apart from question no. Ecash Trail. Internet tools. Virtual Enterprise. Skill Inventory. DBMS.: 11] UNIT – III ERP – An Enterprise Perspective. First virtual internet payment system. Non technical provide. Public key solution. Resource Management in global scenario. Management. Electronic Commerce Providers: On-line Commerce options: Company profiles. Integrating security protocols into the web. Electronic Commerce Online Resources and Guide to the CD-ROM [No. Digital Currencies: Optional process of Digicash. dynamic data management in complex global scenario. Using Ecash. Question No. Netscape commerce server. . Case Study. [No.: ETIT 410 Paper: E-Commerce & ERP L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Electronic Payment Systems: Digital payment systems. MIS. Manufacturing. Personnel disciplines and their relationship. Transiting environment. OAS. Smart cards. Microsoft internet explorer and servers. ERP – Resource Management Perspective. Strategies. Key distribution and certification. of Hrs.: 11] UNIT – IV ERP – Information System Perspective: Evolution of Application Software Technology Management. Inventory. networks and electronic transactions today.

Alexis Leon. EDI ERP-Key Managerial Issues: Concept Selling. “Frontiers of E-Commerce ” Addition Wesley long man Publishers. 2000. 2. SCM. Prentice Hall of India. Tata McGraw Hill. CRM. 4. ECommerce. Implication. [No. Tata McGraw Hill. Kamlesh Bajaj & Debjani Nag. of ERP Systems on Business Organization. BPR. REP. E-Business. “E-Commerce: The cutting edge of Business” Tata Mcgraw Hill.A. Critical success factors in ERP System. Perry. 1999. IT Infrastructure. 1999. Information Communication Technology. “E-Commerce strategies”. 2001. Kalakota. Return on Investment. ERP Selection issues. Pre and Post Implementation Issues. 3. “Enterprise Resource Planning”. Gary Schneider and James T. 3. “Enterprise Resource Planning”.MRP. Trepper. Public Service and Organizations (PSO) Project. “ Electronic Commerce ” Jaico Publishing House. Pete Loshin and P. of Hrs. 1999. S. Sadagopan. Resistance to change. REFERENCE BOOKS: 1. 2001. 2. ERP Culture Implementation Issues. . “Electronic Commerce” by Thomson learning.Murphy. 2000.: 11] TEXT BOOKS: 1.

IP Security: Architecture. Management information Model. System Identification and clustering Cryptology of speech signals – narrow band and wide band systems – analogue & digital systems of speech encryption. of Hrs. [No. 1999. However. 2nd Edition. of Hrs. rest of the paper shall consist of four units as per the syllabus. Structure of management information and TMN information model. 3rd Edition. of Hrs. Web Security: Secure Socket Layer & Transport Layer security. established systems.: ETIT 412 Paper: Network Security L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. 2. Apart from question no. This question should have objective or short answer type questions. Encapsulating security Payload – Key management.5 marks. [No.: 10] TEXT BOOKS: 1. student may be asked to attempt only 1 question from each unit. Authentication Leader. . Management servicing and functions. Question No. 2002. William Stallings. TMN management layers. Secure electronic transactions. modes of use of DES.: 11] UNIT – III Network Security: Hash function – Authentication: Protocols – Digital Signature standards. Electronics Mail Security – PGP (Pretty Good Privacy) MIME. “Cryptography & Network Security”. Data Compression technique.Code No. 1. Firewalls Design principle. of Hrs. It should be of 25 marks. [No. 2.: 11] UNIT – II Public Key systems – Knacksack systems – RSK – Diffle Hellman Exchange 0 Authentication and Digital signatures. William Stallings. Elliptic curve based systems. “Network Security Essentials. Every unit should have two questions. Each question should be of 12. Block ciphers. 1 should be compulsory and cover the entire syllabus. [No. Block Ciphers – DES and variant.: 12] UNIT – IV Telecommunication Network architecture. UNIT – I Introduction: Codes and Ciphers – Some Classifical systems – Statistical theory of cipher systems – Complexity theory of Crypto systems – Stream ciphers. Stream Ciphers: Rotor based system – shift register based systems – Design considerations for stream ciphers – Cryptanalysis of stream ciphers – Combined eneryption and encoding.

2nd Ed. “Software Testing Techniques”. New Age International Publishers. This question should have objective or short answer type questions. Class Testing. Debugging. rest of the paper shall consist of four units as per the syllabus. Dynamic Testing Tools. Aggarwal & Yogesh Singh. Failure. Pearson Education Asia. Data Flow [No. Question No. [No. Error. Cem Kaner. student may be asked to attempt only 1 question from each unit. 1990. Testing Process. Nguyen Quoc. GUI Testing. New York. 1. 1993. Test Cases. UNIT – I Introduction: What is software testing and why it is so hard?.   UNIT ‐ II Functional Testing: Boundary Value Analysis.Code No. Second Edition. DD-Paths. William Perry.  Scheme.:  11]    UNIT ‐ IV  Object Oriented Testing: Issues in Object Oriented Testing.  Risk  Analysis. Fault. 2. Every unit should have two questions. [No. 2. It should be of 25 marks. Incident. Van Nostrand Reinhold. Second Edition. System Testing. of Hrs. Each question should be of 12. Overview [No.  Regression  Testing. 2005 3.K. K. New York. Equivalence Class Testing. “Effective Methods for Software Testing”. 1 should be compulsory and cover the entire syllabus. However. 1995. Patterns and Tools”. “Software Engineering”. Levels of Testing. Addison Wesley. Cyclomatic Complexity. of Hrs. John Wiley & Sons. Robert V. Cause Effect Graphing Technique. Van Nostrand Reinhold. No absolute proof of correctness. Structural Testing: Path testing.5 marks. Apart from question no. “Testing Object-Oriented Systems-Models. Characteristics of Modern Tools. Domain Testing.  Slice  based testing Testing Activities: Unit Testing. Mutation testing. 1999. “Testing Computer Software”. “Software Testing”.  Priority  category. 2..:  11] of Graph Theory. Second Volume. of Hrs. Decision Table Based Testing. .:  11] Testing. New Delhi. Boris Beizer. Object Oriented Integration and System Testing. of Hrs. Louise Tamres. Jack Falk.: 11]     TEXT BOOKS: 1. New York. REFERENCE BOOKS: 1. 2002 3. Binder. Limitations of Testing. Integration Testing. Graph Metrics.: ETIT 414 Paper: Software Testing L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Testing Tools: Static Testing Tools.    UNIT ‐ III  Reducing the number of test cases: Prioritization  guidelines.

. Boris Beizer. “Black-Box Testing – Techniques for Functional Testing of Software and Systems”.. 1995. John Wiley & Sons Inc. New York.4.

The student will have to present the progress of the work through seminars and progress reports. Practical will be based on Embedded System. : ETEC 452 Paper: Embedded System Lab. L 0 P 2 C 1 Code No.   . : ETIT 456 Paper: Major Project L 0 P 14 C 7 The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format.Code No. : ETIT 454 Paper: Electives Practical will be based on ELECTIVES L 0 P 2 1 C Code No.

Sign up to vote on this title
UsefulNot useful