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

Welcome to Scribd! Start your free trial and access books, documents and more.Find out more

Sessional 15 Theory 35 Pass Marks 20

EHU 101

Vedic Engineering

Objective:

To acquaint students with reservoir of knowledge available in Vedas and their utilities in all round of human life. It also aims to show some of the concepts of engineering available in Vedas. Ten questions are to be set taking two questions from each unit. The student has to attempt FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper.

NOTE :

Unit I

Definition of Vedic literature, Importance of Vedic Literature, Brief overview of the subject matter of four Vedas. Spiritual education in Vedic literature ( 40th chapter of Yajurveda) Unit II Geometry according to Sulba Sutra, Geometry before Sulba Sutra, Vedic Mathematics ( Ekadhiken Pooren, Nikhil Navtascharaman Dashatah, Oordhavatriyagyabhyam) Unit III Concepts of Agricultural, Textile, Mechanical and Aeronautical Engg. in Vedic literature Unit IV Concepts of Chemical, Civil, Architectural and Earth Science Engg. In Vedic Literature Unit V Concepts of Electrical, Electronics and Computer Engg. In Vedic literature Prerequisite: Nil References: 1 Mehta D.D., Positive Sciences in the Vedas, Arnold Heinemann Publishers, Delhi 1994 2 Acarya Vaidyanath Sshastri, Sciences in the Vedas, Sarvdeshik Arya Pratinidhi Sabha, Ramlila Ground, Ansari road, Delhi 3 Hansaraj, Sciences in the Vedas, Shakti Publications, Ludhiana 4 Geal,B.N., The positive Science of the ancient Hindus, Motilal Banarasi Das, New Delhi 5 Kulkarni R.P.,Geometry according to Sulba Sutra, Sansodhan Mandal Pune 1989 6 Swamisri BharatiKrishna Teeratha ji, Vedic Mathematics, Motilal Banarasidas,Delhi 7 Dr. Roop Kishore Shastri, Dharm Darshan Sanskrity 8 Kshemkaran Vedalankar ,Vedic Bhasya

Faculty of Engineering & Technology, GKV, Haridwar 1

Computer Science & Engineering

MM 50 Time 2 Hrs L T P 2 0 0

Sessional 15 Theory 35 Pass Marks 20

**ECS102 Introduction to Computers
**

Objective: To provide a base for computer literacy. Note: Ten questions are to be set taking two questions from each unit. The student has to attempt FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Unit I Unit II Unit III Unit IV Computer Basics: A simple model of a computer, Characteristics of a computer, Input and output units of a Computer. Computer Memory: Primary Memory, Secondary Memory: Magnetic Hard Disk, Floppy Disk, CDROM and Magnetic tape. Number System: Decimal, Binary, Octal, and Hexadecimal numbers and their arithmetic (addition, subtraction, multiplication, and division): 1’s and 2’s complements. Concept of Computing, contempory OSs such as DOS, Window, MAC-OS , UNIX (only brief user level description); Files & Directories and their use in different operating system environments Introduction to the typesetting softwares such as Microsoft office. Introduction to Internet: Getting familiar with Browser programme netscape & explorer, Sending and receiving mail over Internet, Introduction to PINE and/ or ELM

Unit V

References: 1 Rajaraman V.(3/e), Fundamental of Computers, PHI, New Delhi, 1999 2 Sanders,D.H., Computers Today, Mcgraw Hill, 1998 3 Kris Jamsa, DOS the complete reference, Tata McGraw Hill 4 J.Peek Tim O’reilly & M.Locekides, UNIX POWER TOOLS, BPB Publication

Faculty of Engineering & Technology, GKV, Haridwar 2

Computer Science & Engineering

MM 50 Time 2 Hrs L T P 2 0 0

Sessional 15 Theory 35 Pass Marks 20

**EME 102/ EME 202 Basic Manufacturing Process
**

Objective: To acquaint students with fundamental manufacturing concepts and to make them understand the utility of this subject as a core course for Engineering graduates. Ten questions are to be set taking two questions from each unit. The student has to attempt FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Classification of Manufacturing Process, Composition , Properties and uses of wrought iron , cast iron, Malleable iron ,Carbon and alloy steels, Copper, Aluminum, lead, brass, bronze, duralumin, bearing metals, high temperature metals , Properties of metals: Strength , Elasticity , Stiffness , Plasticity, Malleability , Ductility, Brittleness, Toughness, Hardness, Impact Strength, Fatigue. Metal Casting : Scope of moulding, moulding sands, Principles of metal casting, pattern materials, types and allowances: classification of moulds, roles of gate, runner and riser, core, core box, and core print. Introduction of dicasting, permanent mould casting, investment casting, casting defects. Metal Joining: Welding Principles, Classification of welding techniques, oxyacetylene gas welding, Arc welding, submerged and atomic hydrogen arc welding, Electric resistance welding, Spot, Seam, Butt welding, Flux: composition, properties and function, Brazing and soldering, types of joints Machine Shop and Metal Cutting: Brief description of Lathe, drilling, shaping, planning, milling machines, Cutting tools used and their materials and geometry. Introduction to CNC machines. Metal forming: Hot and Cold working principles, forging operations, Press forging

NOTE :

Unit I

Unit II

Unit III

Unit IV Unit V

Prerequisite: None Reference: 1 Hazra and Chowdhary (11/e), Workshop Technology (Vol 1 and 2), Media, Mumbai, 2000 2 B.S.Raghuvanshi (9/e),Workshop Technology (Vol 1 and 2), Dhanapat Rai, Delhi, 2001 3 Lindeberg Ray A, (4/e), Process & Materials of Manufacturing, PHI, New Delhi, 1995 4 Degarmo, Materials and Processes in Manufacturing, PHI, New Delhi, 2000 5 Begmen , Manufacturing Processes

Faculty of Engineering & Technology, GKV, Haridwar 3

Computer Science & Engineering

MM 100 Time 3 Hrs L T P 3 1 0

Sessional 30 Theory 70 Pass Marks 40

**EME 101/ EME 201 Fundamentals of Mechanical Engineering
**

Objective: To acquaint students with fundamental concepts in Mechanical Engineering as fundamental course. This includes knowledge about thermal Science and Engineering Mechanics. Ten questions are to be set taking two questions from each unit. The student has to attempt FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Thermodynamics: Introduction to SI units, Definition of thermodynamic system, Surrounding and Universe, Quasi static process, Energy interaction Zeroth law, Concept of temperature First law of thermodynamics, Application to closed and open system, Concept of Enthalpy, steady flow energy equation, Throttling process. Thermodynamics: Second law, reversible and irreversible process, Thermal reservoir, heat engines and thermal efficiency, COP of heat pump and refrigerator, Carnot cycle, Clausius inequality, Concept of entropy, Entropy change for ideal gases. Thermodynamics: Generation of steam at constant pressure, Properties of steam, Use of property diagram, Process of vapor in closed and open system, Rankine cycle. Stroke clearance ratio, Compression ratio, Definition and calculation of mean effective pressure (no proof) for air standard cycles (Otto and diesel cycles) Mechanics: Trusses: Plane structure, (Method of Joints and Sections only) Beams: Bending moment and shear force diagram for statically determinate beams. Strength of Materials: Simple stresses and strain, strain energy, stress- strain diagram, elastic constants. Compound stress and strain: state of stress at a point, Simple tension, pure shear, general two dimensional stress system, principal planes, principal stresses and strains, Mohr’s stress circle, Poisson’s ratio, maximum shear stress

NOTE :

Unit I

Unit II

Unit III

Unit IV

Unit V

Prerequisite: Fundamental Knowledge of physics up to 10+2 level Reference: 1 Kumar DS (2/e), Thermal Science and Engineering, S.K.Kataria, New Delhi,2001 2 P.K.Nag (2/e), Engineering Thermodynamics, TMH, New Delhi,2001 3 R.Yadav(7/e), Thermal Engineering, Central Publishing House, Allahabad, 2000 4 Shames Irving H.(4/e), Engineering Mechanics, PHI, New Delhi, 1994 5 Hibler (1/e), Statics and Dynamics, Pearson Education, Singapore, 2000 6 Pytel & Singer (1/e), Strength of Materials, Addison Wesley, 1999

Faculty of Engineering & Technology, GKV, Haridwar 4 Computer Science & Engineering

Maxwell’s equations. Reversible and irreversible processes. New Delhi. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Text Books of optics SChand. second law of thermodynamics. Text Book of Optics. Unit I Thermodynamics: First law of thermodynamics and its consequences. & ferromagnetic materials (Qualitative idea only) Langevins’ theory of dia & paramagnetism. 1999 4 Brijlal & Subramanayam. 5 Subramanyam N and Brij Lal(20/e). Conduction of heat. Conductivity of bad conductors. 1998. production and analysis of polarized light. 2 Ghatak Ajoy. GKV. Hysteresis Unit V Motion of charged particles: Field due to moving charge. Lorantz Half Shade Polarimeter. Para. Optical activity. New Delhi. Magnetic and electrostatic focusing.Heat and Thermodynamics. Optics. Bose-Einstein and Fermi-Dirac statistics (elementary idea only. NOTE : Ten questions are to be set taking two questions from each unit. New Delhi. Specific rotation. Entropy. Nicol Prism. 2001 6 Brij Lal and Subramanyam N. Maxwell-boltzmann statistics and its application.2001 MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EPH 101 Engineering Physics I Objective: To acquaint students with fundamental concepts of Physics useful for engineering students. Unit II Optics I: Interference: Interference of light. Pearson Education. Malus law.Modern Engineering Physics SChand. Prerequisite: None References: 1 Vasudeva AS . Einstein’s A and B coefficients. 2001.(20/e) . Optics. Faculty of Engineering & Technology. Resolving power of Telescope Unit III Optics-II Polarization: Brewester’s Law. Interference in thin films & wedge shaped film. Double refraction. Magnetic force due to current carrying conductor. New Delhi:. New Delhi. Strength of Material. population inversion. Function and block diagram of CRO. pointing theorem. Ampere’s law. The student has to attempt FIVE questions selecting one question from each unit. Magnetic permeability and susceptibility. Newton’s ring. Magnetic field intensity. He-Ne laser. Plane diffraction grating. Dia. Magnetic induction. Popov(2/e). New Delhi. Diffraction: Diffraction at single slit & Double slits.7 Egor P. Haridwar 5 Computer Science & Engineering . TMH. Mass spectrometer. Unit IV Electromagnetics: Gauss’ law and its applications. Cyclotron. Ratan. Carnot’s theorem. 1999. (elementary idea only. Motion of charged particle in electric and Magnetic field. Coherence. electromagnetic wave equation. Laser: Spontaneous and stimulated emission of radiation.2000. Singapore. 3 Satya Prakash. Fresnel’s Biprism. no derivation). Michelson interferometer. SChand. no derivation). SChand.

Text book of Electricity and Magnetism. Fourier series. circuits.Chand. superposition. PHI. Norton. Unit II Unit III Unit IV Unit V Prerequisite: Fundamental Knowledge of Physics up to +2 level. principles and applications. magnetomotive force. S. Single phase transformers-principle of working. NOTE : Ten questions are to be set taking two questions from each unit. New Delhi. GKV. electrodynamic wattmeter. Engineering Circuit Analysis. production of voltage and torque. and A. concept of impedance . comparison between magnetic and electric circuits. Text book of Electricity & Magnetism Arthur Kip. application of dc generators and motors. 2001 MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EEE101 Fundamentals of Electrical Engineering Objective: To acquaint students with fundamental concepts in Electrical Engineering and make them able to use these in later courses of Electronics engineering. constructional details. series and parallel resonance. Electricity & Magnetism K. introduction to balanced three phase circuits.K. Basic Electrical Engineering. equivalent circuit.7 8 9 O. stepper motors. characteristics of dc generators and motors. losses regulation and efficiency. 2001 2 W.Hayt. maximum power transfer). speed control of dc shunt motors. New Delhi. composite magnetic circuits. form and peak factor. analysis of simple circuits with non-sinusoidal excitation. introduction to single phase induction motors.Sinha. permeability reluctance. starting. open circuit and closed circuit tests.H. References: 1 Deltro(2/e). New Delhi. mesh and nodal analysis of D.P. Induction motors: Principle of working. Network Theorems (Thevenen. induction type single phase energy meter. Sinusoidal voltage and currents average and rms value. DC Machines: Generators and motors. Magnetic circuits: Ampere turns.C.Tiwari. Electrical Instruments: Principle of working and constructional features of permanent magnet moving coil and moving iron ammeters and voltmeters.C. The student has to attempt FIVE questions selecting one question from each unit. Phase or representation in different forms. Unit I Electrical Circuits: Kirchoff’s Laws. 2001 Faculty of Engineering & Technology. Haridwar 6 Computer Science & Engineering . TMH. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. torque-slip curve and applications of three phase induction motors.

1997 6 Piaggio H. Integral calculus. New York. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Elements of Electrical science MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EMA 101 Engineering Mathematics I Objective: To provide essential Mathematical tools of Calculus to Engineering Students. New Delhi. Differential Calculus. Method of Lagrange’s multipliers.. Integral Calculus: Fundamental Theorem of integral calculus. Prasad Mudranalaya 2 Kreyszig E. centroid and moment of inertia. Indeterminate forms.. taylor’s & Maclaurin’s Expansion. Tracing of curves.L. Differential Equations. volume.Chitore. Partial Differentiation: Normal to surfaces and tangent plane. Application to arc length.Pant D..H..Huges.S. Engineering Mathematics Vol. New Delhi.K. Differential Calculus: Successive differentiation. Pothishala. Advanced Engineering Mathematics. Equations of the form y’’= f(y).S. John Wiley. Double points and their classification. Change of variables.T. NOTE : Ten questions are to be set taking two questions from each unit. Pothishala.3 Nagrath I. Chain rule. Unit I Unit II Unit III Unit IV Unit V Prerequisite: Adequate knowledge of Mathematics of 10+2 level References: 1 Prasad C.. and Vinod kumar. Shyamlal. Leibnitz theorem. Differential Calculus. 1997 5 Gorakh Prasad . Allahabad. Dirichlet’s integral Differential Equation I: Review of solution of First order differential equations. A first course in mathematics for Engineers.I Faculty of Engineering & Technology. Khanna. TMH.Mukhopadhyay.Cauchy equations. 2000 4 Gorakh Prasad. GKV. Extrema of function of two and more variables. 20001 4 E.. Jacobian .S. 2000 7 Shanti Narayan. Euler. New Delhi. Electrical Technology 5 Cotton. 1999 3 Grewal B. Differential Equation II: Solution of second order differential equations by change of dependent and independent variables. Partial Differentiation of functions. orthogonal trajectories. Simple applications. New Delhi. Basic Electrical Engineering . Radius of curvature. Asymptotes. Double and triple integrals. Gamma and Beta functions. CBS. Electrical Technology 6 P. A. The student has to attempt FIVE questions selecting one question from each unit. Truncation errors.J. Haridwar 7 Computer Science & Engineering . area . Change of order of integration. Allahabad. Higher Engineering Mathematics. change of variables. Differentiation under the integral sign. Method of variation of parameters for second order differential equations.1999 8 Srivastava R. linear differential equations with constant coefficients.

First and Third angle projections. Engineering Drawing. Orthographic Projection: Principles of Orthographic projections. true length and traces of a line. 2000 2 P. 1999 Faculty of Engineering & Technology. parallel to one and inclined to other. Charotar.D. Projection of lines parallel to both the planes. parallel planes. Isometric Projection: Principle of isometric projection. development of lateral surfaces. Graphics as a tool to communicate ideas. Construction of geometrical figures. Pictorial view.Gill(1/e).S. Projections of points. S.K. traces of planes. Anand. New Delhi .M. Also aimed to demonstrate use of Computers in the field of Graphics. Isometric projection using box and offset methods. Section of solids lying in various positions. solids lying on a face. Narosa. angles of inclinations of planes. Principle and auxiliary planes. Projection of solid in simple position.MM 50 Time 3 Hrs L T P 0 0 3 Sessional 15 Viva Voce 35 Pass Marks 25 EME 151 Engineering Graphics I Objective: To acquaint students with fundamental concepts in Engineering Graphics to develop the power of imagination leading to understanding of Detailed machine drawings. New Delhi. Lettering and dimensioning. Haridwar 8 Computer Science & Engineering . Computer aided drawing: Basic Concepts and application Prerequisites: None References: 1 N. Projection of planes. Engineering Graphics and Drafting. axis or slant edge inclined to one and parallel to other plane. GKV. Kataria . inclined to both the planes. 2001 3 Chandra & Chandra. true shape of the section.Bhatt & V. Panchal (42/e). Engineering Graphics.

3 To study a half wave and full wave rectifier circuit with and without capacitor and filter and determine the ripple factor. 11 To study the various logic gates. Faculty of Engineering & Technology.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 EEE151 Basic Electrical Lab List of Practical 1 Verification of network theorems. 4 Measurement of power in three-phase circuit by two-wattmeter method. Maximum power transfer theorem. 7 DC generators characteristics. 9 Study running and reversing of a three-phase induction motor. 5 Determination of efficiency of a single phase Xmer by load test. Kirchoff’s laws. GKV. Superposition theorem. 6 Determination of parameters and losses in a single phase Xmer by OC and SC test. 2 Study of Diode and transistor characteristics. (a) Shunt Generator (b) Series Generator (c) Compound Generator 8 Speed control of DC shunt motor. 10 Study of a single-phase energy meter. Haridwar 9 Computer Science & Engineering .

To determine the specific rotation of cane sugar solution by Polarimeter. 7. 13.To determine the wavelength of monochromatic light with the help of Newton’s ring method. 12. 5. To determine the value of Stefan’s constant. 11. principal points. 17.To determine the wavelength of monochromatic light with the help of Fresnel’s Biprism. (ii) To prepare one ohm coil. To determine the value of mechanical equivalent of heat by Callendar and Barne’s method. To determine the dispersive power of the material of the given prism. bridge wire and (i) To determine the specific resistance of the material of the given wire using C. To determine the focal points. 15. Haridwar 10 . 14. Note: (i) Addition or deletion in the above list may be made by laboratory in-charge with Computer Science & Engineering Faculty of Engineering & Technology. Calibration of Ammeter and Voltmeter by Potentiometer. To determine the coefficient of viscosity of liquid by Poiseuille’s method. To determine the resolving power of a telescope. 4. 6. To determine the surface tension of liquids by Jaeger’s method.F. To study the Hysteresis curve.bridge. To determine the focal length of a combination of lenses by Nodal method and to locate the position of cardinal points.F. 9. To study the variation of magnetic field along the axis of the current carrying coil and then to estimate the radius of the coil. and focal length of a combination of lenses by Newton’s method and its verification. GKV. To determine the wavelength of spectral lines by plane transmission grating. 10. 8. 16.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 EPH151 Engineering Physics Lab I List of Practical 1. To determine resistance per unit length of a C. 2. To determine the thermal conductivity of a bad conductor by Lee’s method. 3.

Faculty of Engineering & Technology.the approval of the Head of the Department / Principal in accordance with the facility available. GKV. Haridwar 11 Computer Science & Engineering . (ii) In practical examination the students shall be required to perform two experiments.

GKV. 9 To prepare a job on Shaper machine of given shape and size. 2 To prepare a square pulley of given dimensions. 11 To prepare a job on CNC train master of given shape and size. Machine Shop 8 To prepare a job on Lathe machine of given shape and size. Haridwar 12 Computer Science & Engineering . 5 To prepare a butt joint of MS strips using Arc welding. Metal Joining. Moulding Shop 3 To prepare a mould of half bearing. Faculty of Engineering & Technology. 6 To prepare a T joint of MS strips using Oxy Acetylene gas welding. 4 To prepare a mould using core.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 EME 152/ EME 252 Mechanical Workshop List of Practical Carpentry Shop 1 To prepare a half T joint of given dimensions. Fitting Shop 7 To prepare a rectangular piece with slant edge of given size from MS flat. 10 To prepare a job on Milling machine of given shape and size.

Nature.V. References: 1 An Anthology of English Essays R.M. half a mark for each word) Unit III Prerequisite of Scientific and Technical Communication. Haridwar 13 Computer Science & Engineering . origin and development of technical written communication. methodology. Parallel construction. table of contents).B. interrupted method.B.Singh (Oxford University Press) 2 Modern Technical Writing Sherman.Raman Making Writing Simple J. The student has to attempt FIVE questions selecting one question from each unit. advantages and disadvantages. Joad Water C. The students shall attempt all the ten with minimum changes. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. background. Fragmented sentences. complaints and adjustments.E.P. Salient features. summary/ abstract. Coherence. Linear method.S. gerunds and infinitives. Unit II Common Errors: (I) Articles (II) Prepositions (III) Tenses (IV) Word order (V) Adjectival degrees (VI) Conjunction (VII) Subject Verb agreement (Note: The question shall have ten sentences. deductive method. NOTE : Ten questions are to be set taking two questions from each unit. Writing of Scientific and Semi technical articles. inductive method. Priestley Process of communication. Letters giving instructions. body statement of problem. Unity. Difference between technical writing and general writing. employment letters. Dangling participles.MM 50 Time 2 Hrs L T P 2 0 0 Sessional 15 Theory 35 Pass Marks 20 EHU 103/ EHU 203 Technical Communication & English Objective: To provide a base for technical communication. Theodore A.Basham The civilization of today C. scope. spatial method. Unit I Study of Selected literacy texts: Group A Group B Science & Human Life J. inquiries and answers to enquiry’s. Modifiers. Statement of request. One sentence will have only one error. antecedents and clause subordination. applications and resume Unit V Proposal Writing: Proposal: Definition and kinds. Unit IV Business Correspondence: General principles of business correspondence. Glenn (Macmillan) 4 The elements of Style Strunk Jr. connectives. Haldane Of Studies Bacon The Heritage of India A.L. (Macmillan) Faculty of Engineering & Technology. GKV. No choice. title page.) Spoken English: (1) Phonetic transcription of common English words (Five words to be attempted out of eight) (2) Primary stress placement on words (10 words to be given. Division of formal proposals (front matter. Ellipsis. letters urging action. chronological method. element of a series. Technical Written communication. Ramification of business letters.(New Jersy) 3 Essentials of Grammar and Composition Legget. squinting construction and split infinitive.

D. GKV. Krishna Mohan Faculty of Engineering & Technology.(Vikas) 6 English Pronouncing Dictionary Daniel Jones 7 Technical Writing Process and Product Sharon J. Steven M.C.Gerson 8 Business Correspondence and Report writing R.Sharma.5 A Text book of Scientific and Technical writing Sharma S.Gerson. Haridwar 14 Computer Science & Engineering .

nature of nuclear radiations. Quantam Theory : Quantam theory of radiations. Atomic Models. de-Broglie concept of matter waves. binary to decimal conversion and vice versa. Hall effect. Heisenberg uncertainty principle and its applications. general properties of nucleus. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Nuclear Physics Radioactivity. Diode as rectifier. Mass energy equivalence. The student has to attempt FIVE questions selecting one question from each unit. miller indices. Inertial & non-inertial frames of reference. current and voltage gain. Photoelectric effect. Lorentz tranformation equation of space and time. Quantum numbers. length contraction. diffraction of X-rays. Electronics Intrinsic and extrinsic semiconductors. Black body spectrum. Boolean algebra. Schroedinger wave equation and its solution for a particle in box. De-morgan’s theorem. time dilation. Davisson and Germer experiment. Addition of velocity. Bragg’s law & Study of crystal structure by Bragg’s spectrometer. Derivation of Wien’s law and Rayliegh Jean’s law from Planck’s law. separation between lattice planes. NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisite: EPH101 Faculty of Engineering & Technology. Haridwar 15 Computer Science & Engineering . Planck’s law of radiation. number systems and logic gates. Bohr’s atomic model and energy level diagram. structure of nucleus.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EPH-201 ENGINEERING PHYSICS – II Objective: To familiarize students with the basic principles of Quantum Mechanics and then apply them to areas such as atomic spectra. half life period and mean life time. semi-empirical mass formula. Special theory of Relativity Michelson-Morlay experiment. law of radioactive disintegration.Postulates of special theory of relativity. GKV. Franck-Hertz experiment. Moseley law. Solid State Physics Crystal structure. Solid state Physics. fermi energy and origin of band gap (no derivation). formation of energy bands in solids (energy level approach). mass defect and packing fraction. characteristics of p-n junction and Zener diode. classification of solids. nuclear binding energy. X-rays Rutherford atomic model. different kind of crystal bonding. Laser. basic idea of conduction mechanism in semiconducters. Vector atom model. transistor (NPN and PNP) characteristics. transistor amplifier. characteristics of X-ray spectra. Ten questions are to be set taking two questions from each unit. Galilean transformation. Production and properties of X-ray absorption.

1998 8 Schiff(3/e). 1999 5 Kittel Charles (7/e) Introduction to Solid State Physics. McGraw.W. Concepts of Modern Physics. Auckland 9 P. New Delhi:. New Delhi. Narosa. 2001 7 Kalpan Irving . John Wiley. Modern Physics SChand. Singapore. New Delhi. 2 Theraja BL ..Anderson. 2000. Modern Physics. 1996 6 Murugeshan R(8/e). Quantum Mechanics. Nuclear Physics. TMH New Delhi:. GKV. New Delhi.Basic Electronics Solid State. Haridwar 16 Computer Science & Engineering . SChand. Elements of Quantum Mechanics Faculty of Engineering & Technology.References: 1 Rajam JB. New Delhi:. Atomic Physics. SChand.1999 4 Mani HS.2000 3 Beiser Arthur.

diode equation and its resistance and capacitance.O. and band width of an amplifier. Zener diode Unit II Transistor Characteristics: the junction transistor. The student has to attempt FIVE questions selecting one question from each unit. Electronic Devices and Circuits Theory. Unit V Rectifiers and power supplies. Semiconductor diode characteristics. Oscillators. Unit I Conduction in semiconductors. PHI.L. NOTE : Ten questions are to be set taking two questions from each unit. GKV. Conductivity of a semiconductor. Prerequisite: Basic Knowledge of Physics up to +2 level. C. McGraw Hill. Electronic Devices and Circuits. ripple factor. p-n junction as a diode.. and Halkins C. Various measuring equipments. Fermi level in semiconductor having impurities. impurities. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. 2000 3 Schilling D. bias stability. bridge rectifier. donor and acceptor. and Multimeters. The continuity equation. conditions of oscillations and various oscillator circuits Unit IV Large signal amplifiers: Class A. Haridwar 17 Computer Science & Engineering . Class B. Diffusion. two port devices and hybrid models of transistor analysis of transistor ampilifier circuits. compensation techniques Unit III Small signal low frequency transistor models. Common base. using h. transformer coupled power amplified and push pull amplified class B type. Class C types. New Delhi.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EEC 201 Basic Electronics Objective: To acquaint students with fundamental concepts in Electronics prepare them for their effective uses in advanced courses. various bias circuits to fix the operating point. Feedback amplifiers and oscillators. McGraw Hill Faculty of Engineering & Technology.C. effect of negative feedback on output. Feedback concept in amplifiers..parameters. common emitter and common collector configurations and their various properties. Transistor Biasing and thermal stabilities. input resistance. Barkhausen criteria.R. (6/e). operating point. Electronic Circuits.1976 2 Boylstad and Neshalky.and Belove C. References: 1 Millman J. Half wave and full wave rectifiers. charge densities in a semiconductor.

Return value and its type. Prerequisites: ECS102 References: 1 Byron S. NOTE : Ten questions are to be set taking two questions from each unit. Two-dimensional array: declaration. Arithmetic operation on strings. structure initialization. data types variables its declaration and assignment. Unit I Programming Language: Classification machine code. giving value to members. Multidimensional arrays. Conditional. argument and return value functions. No argument and No return values function. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Type Conversion. PHI. initialization and application. SWITCH Statement. assignment. Operator precedence. function calls.The C Programming language. Declaring and initializing pointers. 1997 2 Kerighan and Ritchie (2/e). pointer increment and scale factor. fourth generation languages. The student has to attempt FIVE questions selecting one question from each unit. structures within structures. pointers and character strings. Haridwar 18 Computer Science & Engineering . Keyword and identifiers. initialization and application. Nesting of IF ELSE. error handling during I/O Operation. constants. Size of operators. TMH. Logical. Basic structure of C programs Constants. higher level language. comparison of two strings and string handling functions. defining symbolic constants. GKV. Increment and Decrement. Unit V Pointers: Accessing the address of the variable. File inclusion. Arrays: One-dimensional arrays: declaration. Importance of C. Writing strings. Arithmetic Expression and evaluation. WHILE Statement. Unit IV Handling of Character Strings: Declaring and initializing string variables. Relation. New Delhi. Input/ operation on files. accessing a variable through its pointer expression. 2000 Faculty of Engineering & Technology. User Defined Functions: Need for user defined function. formatted output Unit III Decision Making and Branching and Looping: IF Statement. Closing a file. array of structures. Writing a character. Comma. array within structures. DO Statement. Variables and Data Types: Character set. Macro Substitution. Structures: Structures definition. Reading strings. FOR Statement. structures and functions. pointers and array. assembly language. Programming with “C”. Scope and life time of variable in functions. Handling of non integer function. Argument and No return values functions. File Management in C: Defining and opening a file.Gottfried . Preprocessor: Introduction. Recursive. formatted input. GOTO Statement. New Delhi. IF ELSE Statement. Input and Output operation: Reading a character.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS 202 Programming in C Objective: To introduce the students to the basics of programming with the help of C language. Unit II Operators and Expressions: Arithmetic.

Haridwar 19 . saponification value. Determination of order. de-waxing of oil fraction. p & d orbitals. GKV. Computer Science & Engineering Faculty of Engineering & Technology. Fraction of crude oil. viscosity index. Programming in ANSI C. electronaffinity & their Periodicity. different theory of corrosion. rate constant and order. Analysis of water alkalinity.TMH MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECH101/ ECH 201 Engineering Chemistry Objective: To acquaint students with fundamental concepts of Chemistry and to provide information about various application of it in human life in the form of Fuels. ionic and metallic). Types. acid value. The student has to attempt FIVE questions selecting one question from each unit. specific rate. effect of temperature. Quantum yield. H-bond and Vander Waals forces. Solid State and Phase rule: Elements of Symmetry. Zero and first order reaction. adsorption of gases on solids. Lubricanting oil. Types of crystals (Covalent molecular. slide oxidization number. Atmospheric corrosion. Pseudo order reactions. Unit III Lubricants: Principle of lubricants. factors influencing rate. growth. component and degree of freedom. Freundlich adsorption isotherm. Atomic radii. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. solid lubricants Corrosion: Definition and type of corrosion. Properties of refined oils (Viscosity. electropositive. lattice energy and born atomic molecules of 1 haber cycle. molecularity and order of reactions. soil corrosion Unit IV Water and Water analysis: Specification of water.O Theory & its application to di st & 2nd period elements. Applications of phase rule to one component systems (H2O and S) and two component systems (KI-H2O system). law of oxide film. Lubricating greases (semi solids) and their penetration and drop point tests. iodine value. refining of lubricating oils.3 E. partial ionic character dipole moment and its application. Ten questions are to be set taking two questions from each unit.Balagurusamy . stress corrosion. specific gravity) and their determination. Laws of Photochemistry. ionization potential. acid and solvent. Surface Chemistry: Homo and Heterogeneous catalysis and its industrial applications. and cloud point. M. fire point. space lattice and unit cells (for cubic systems only).Phase. Phosphorescence Chemiluminescence. electro negativity. Fluorescence. Unit II Chemical Kinetics & Photochemistry : Rate. Arrhenius equation. flash point. pour point. NOTE : Unit I Chemical Bonding & Periodic properties: Hybridization & shape of molecules involving s. Lubricants and water treatment etc.

S. thermoplastic.O. Shobhan Lal Nagin Chand & Co. branched cross linked polymers etc. Gaseous Fuels: Natural gas. Pollution Control & Environmental Science. addition. Solid Fuels: Coke-it’s production by Otto Holfmann oven and uses. Engineering Chemistry. Turbidity. Dhanpat Rai. industrial application of polymers. Engineering Chemistry. Calorific value. Nuclear Fuels: Nuclear reactions. SChand.O. Different definition of molecular weights. water gas. New Delhi. SChand. Octane and cetane number. Coal gas.Dara(9/e). Carburetted water gas. Cracking (Thermal and catalytic) . 2000 Faculty of Engineering & Technology. Nuclear reactor Polymers. Bahal & Tuli(24/e). D.K.hardness (ETDA method only) of water for domestic use. fixed and volatile) pH. Environmental Chemistry: Water pollution. polymers.O. Conductance. Petroleum –it’s chemical composition and fractional distillation. nonfilterable. and oil gas. New Delhi.D.. Unit V Fuels: Definition and classification. Jalandhar. linear.D. Combustion and chemical principles involved in it. radiation. Samuel Glastone. Principles of Physical Chemistry. Water softening-SodaLime Process. sources. 1999 6. functionality. 2001 2. Principles of Physical Chemistry 4..Jain(13/e). thermal and agricultural pollution. S. important air pollutants and their effects. GKV. air pollution. S. Knocking and antiknocking agent. Puri & Sharma(38/e). New Delhi. Nuclear fission and fusion. Ion exchanger (Cation and Anion Exchanger).Dara(3/e). Haridwar 20 Computer Science & Engineering . C. hardness. Plastics and Rubbers: Basic concept and terminology such as monomerse. Solids (filterable. Pollution sources of water. thermosetting plastic. noise. Numerical problems on Alkalinity . Principles of Physical Chemistry. Industrial pollution: Pollutant and their effect. Prerequisite: None References: 1. Producer gas. Liquid Fuels: Conversion of coal into liquid fuels. effect of water pollution. gross and net calorific value and their determination by Bomb calorimeter. . SChand. condensation and ionic polymerizations.2001 5.S. B.S. 2000 3.

Calculus & Analytical Geometry. Abel and Dirichlet.Abel test). cylinder. Unit III Vector Spaces and Matrices II: Eigen-values and Eign vectors. Vector Spaces and Infinite series to Engineering Students. Haridwar 21 Computer Science & Engineering . Properties of Bessel function and Legendre’s polynomials. and central conicoids and their simple properties (as far as possible vectors may be used).. elementary row/ column operations. Integral. comparison.. Vector Analysis Faculty of Engineering & Technology. Advanced Engineering Mathematics.. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper.Advanced Mathematics for Engineers 5 Shanti Narayan . Orthogonal. Rank of a matrix and its applications. Hermitian. Continuity. Root. Recurrence relations. Khanna. Reduction of quadratic form to canonical form. Bertrand and Leibnitz’s tests. 2000 2 Kreyszig E. Unit V Convergence of Series: Ratio. Skew-Hermitian. The student has to attempt FIVE questions selecting one question from each unit. Linear dependence and linear independence. References: 1 Grewal B. Straight line. Bessel’s and Legendre’s equations and their solutions. subspaces. Unit I Three Dimensional Gemetry: Equation of plane. Reduction to diagonal form. Mathematics for Engineers 4 Prasad C. Addison Wesley. Demorgan. Raabe’s. Equation of sphere. New York 1998 7 Ayres F. New York. John Wiley. Unit II Vector Spaces and Matrices I: Definition and elementary properties of vector spaces. NOTE : Ten questions are to be set taking two questions from each unit. bases. Diagonalisation of Matrices..S. cone. Generating functions. Unit IV Solution in Series: solution in series of second order linear differential equations with polynomial coefficients. Integral representation of Bessel’s functions. GKV. New Delhi. 1999 3 Prasad C. Cayley-Hamilton theorem. Absolute and uniform convergence (Weirstrass’. Differentiation and Integration of infinite series. Prerequisite: Adequate knowledge of Mathematics of 10+2 level. Jacobi series. Logarithmic. Text Book of Matrices 6 Thomas and Finney. and Normal matrices. Higher Engineering Mathematics. Intersection of planes( two and three palnes).MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EMA 201 Engineering Mathematics II Objective: To provide essential Mathematical tools of three Dimensional Geometry.

Shastry. New Age.Venkat Reddy.MM 50 Time 3 Hrs L T P 0 0 3 Sessional 15 Viva Voce35 Pass Marks 25 EME 251 Engineering Graphics II Objective: To apply the concepts of graphics for understanding of machine parts. 1999 Faculty of Engineering & Technology. classification of drawings. Rivet heads. K. Machine Drawing.V. P. TMH. classification of riveted joints 7 Conventional Representation: Representation and identification of common machine elements and features.Kannaiah. Forms of threads. 2001 2 K. Locking arrangements for nuts. Spacing of views 3 Screwed fastners: Introduction. GKV. New Delhi.L.Kannaiah. Bolted joints. Machine Drawing. 2 examples 10 Computer aided drawing: Drawing of various views and Isometric views Prerequisites: EME151 References: 1 N. Haridwar 22 Computer Science & Engineering .S. Representation of threads. 1 Introduction: Graphic language. 4 Keys and cotters: Keys. 6 Riveted Joints: Rivets and riveting. New Delhi.Siddeshwar.Narayana. V. Materials specification 8 Blue print reading 9 Assembly Drawing: Simple machine assembly. Principles of Drawing: IS codes for machine drawing 2 Orthogonal Projections: Drawing and sketching of machine element in orthographic projections. cotter joints 5 Shaft Coupling: Rigid and flexible coupling. P. Foundation bolts. screw thread nomenclature.

9. To study the Transistor (PNP and NPN) characteristics. To study the characteristics of a photocell. To study the series and parallel LCR resonant circuits. 12. To determine the Ultrasonic velocity in liquid. To study the Hall effect. To study the Energy band gap. To study the characteristics of PN junction and Zener diode. To study the single stage RC coupled amplifier (with and without feedback). Haridwar 23 Computer Science & Engineering . 7. To study the regulated power supply. 13. 8. 2. 5. 17. To study the nature of polarization of laser light and to verify Malus law. 11.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 EPH 251 Engineering Physics lab II List of Practical 1. 10. To determine the value of Planck’s constant by photoelectric effect. To determine the Susceptibility measurement by Quink’s method. Note: (i) Addition or deletion in the above list may be made by laboratory in-charge with the approval of the Head of the Department / Principal in accordance with the facility available. To determine the e/m by magnetron method. GKV. 3. To study the half wave and fullwave rectifier. Faculty of Engineering & Technology. (ii) In practical examination the students shall be required to perform two experiments. To determine the wavelength of laser light. To determine the mechanical equivalent of heat by Joule’s calorimeter. 14. 16. 4. To determine ECE of Cu using Tangent / Helmholtz galvanometer and reduction factor of the Tangent / Helmholtz galvanometer. 15. 6.

File and program management in windows. Haridwar 24 Computer Science & Engineering . Practice of all UNIX commands. Summation of N natural numbers c. GKV.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS252 Basic Computer Lab List of Practicals 1 2 3 4 5 6 7 8 9 Practice of all internal and external DOS commands. Note: List may be modified according to new software available. Giving exposure to Windows environment. Arranging numbers in ascending and descending orders d. Write small program using C language like a. Faculty of Engineering & Technology. Write simple batch programme. Exposure to advance features supported by some editors. Separation of odd and even numbers etc. Roots of quadratic and cubic equations b. Write simple shell script Introduction to text editing and word processing.

GKV. Determination strength of Oxalic acid/ Mohr salt by KMnO 4/ K2Cr2O7. Faculty of Engineering & Technology. Determine the refractive index of given liquid by using Abbe’s refractrometer. Haridwar 25 Computer Science & Engineering . Find out cell constant / normality of given acid/ base solution by conductivity meter.O. Find out percentage composition of Ethanol water mixture by Stalagmometer/ viscometer. Determine the Na+ and K+ concentration using flame photometer.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECH151/ ECH251 Engineering Chemistry Lab List of Practical 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Find out surface tension/ viscosity of given liquid by Stalagmometer/ viscometer. Find out pH value / normality of given acid by pH meter. Separate components of ink by column/T. Determination of total. iodine value. Determination of D./Paper chromatography. saponoication value and specific gravity of oil. Determine the turbidity of given solution / water sample by turbidity meter.C. temporary and permenant hardness of water by EDTA. Determine the angle of rotation by polarimeter. Determination of acid value.L. Find out critical solution temperature of water phenol system. Determination of the available chlorine in bleaching powder and to find out the chlorine demand in the given water sample. by Wrinkler’s Method.

Vector Analysis 8 Kapur & Saxena . Laplace Transform: Laplace transform of elementary functions. Khanna. 1999 7 Ayres F. Solution of difference equations by Z transforms. Integral Transforms.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EMA301 Engineering Mathematics III Objective: To provide essential Mathematical tools of Fourier Series.. John Wiley. Line. Electric circuits and Bending of beams. McGraw 6 Kreyszig E.. Fourier Series: Fourier series. Shifting theorems. Shifting theorems. Higher Engineering Mathematics. Gauss and Stokes theorems. Gradient. Ten questions are to be set taking two questions from each unit. Surface and Volume integral.S. Initial and final value theorem. Curl and their physical meanings. Fourier sine and cosine transforms. Fourier Transforms: Definition of Fourier transform. GKV. Mathematical expectation. Divergence. A first course in Mathematics for Engineers. Correlation and Regression. Z-transform of elementary functions. Poisson and Normal distributions. Transform of derivatives.TMH 4 Grewal B. Vector Calculus and Statistics to Engineering students. Fourier Transforms and their applications. Scalar and vector fields. Z.. Dirichlet’s condition and convergence.transform: Definition. Faculty of Engineering & Technology. Half range series. Mathematical Statistics . New York. Differentiation and Integration of transforms. Statistics: Axiomatic definition. Advanced mathematics for Engineers 3 Schaum outline Series. Heavisides’ unit step and Dirac Delta functions. Binomial. Advanced Engineering Mathematics. Convolution theorem. Harmonic analysis. Convolution theorem. Linearity property. Differential operator and identities. Solution of ordinary linear differential equations used in Mechanics.. Green’s theorem in plane. Haridwar 26 Computer Science & Engineering . Fourier integral formula. Moment generating functions. Simple applications. 2 Prasad C. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. New Delhi. The student has to attempt FIVE questions selecting one question from each unit. Vector Calculus: Differentiation of a vector.. 2000 5 Brancewel. NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisite: None References: 1 Prasad C. Inversion of Z-transforms. Applications to solutions of boundry value problems. Discrete Transforms. Integral Transform.

Finite and Infinite sets. 2001 MM 100 Time 3 Hrs Faculty of Engineering & Technology. New Delhi. Elements of Discrete Mathematics. Rooted trees. Path lengths in rooted trees. Shortest paths in weighted graphs.. GKV. McGraw. 1988 3 Kolman & Busby(3/e).L(2/e).Tremblay and R.C. Discrete Mathematical structures with application to Computer Science. PHI. Properties of primary relations. Sets and propositions: Introduction. Planer Graphs. Functions and the Pigeonhole principle. Generating Functions and Recurrence Relations: Introduction. Graphs and Planer Graphs: Basic terminology. Mathematical Induction. Principle of Inclusion and Exclusion. Recurrence relations. Paths and circuits. NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisite: None References: 1 Liu. Linear Recurrence relations with constant coefficients. Total solutions. Haridwar 27 Sessional 30 Theory 70 Computer Science & Engineering .MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EMA302 Discrete Mathematical Structure Objective: To introduce the students to the basic concepts of Discrete Mathematics. Propositions. Relation. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Manipulation of numeric Functions. New Delhi. Hamiltonian paths and circuits. Homogeneous solutions. Relations and Functions: Introduction. Prefix codes. Discrete Mathematical structures for Computer Science. Multigraphs and weighted graphs. Ten questions are to be set taking two questions from each unit. Uncountably Infinite sets. TMH. Eulerian Paths and circuits. 2000 2 J. Partial ordering relations and lattices.P. Combination of sets.Manohar . Generating functions. Spanning trees and cut sets. Solution by the method of generating functions. Singapore. The student has to attempt FIVE questions selecting one question from each unit. Equivalence relations and partitions. Trees and Cut sets: Trees. Particular solutions. Minimum spanning trees.

c. UNIT. and Halkies. J. J.c. Carrier concentration and carrier mobility. New Delhi. Power amplifier. Wide band amplifiers. Carrier drift.2001 Faculty of Engineering & Technology. UNIT-II Quantitative analysis of p-n diode characteristics and equivalent circuit. low and high frequency models of JFET. UNIT-III Transients in diodes and transistors. Ryder. Digital and Switching Waveforms-McGraw Hill. Ebers-Mill model. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Millman. coupling schemes for multistage amplifiers.Ten questions are to be set taking two questions from each unit.---Integrated Electronics-McGraw Hill.D. 3.---Pulse. PMOS and CMOS. 1. and Taub H. Ohmic contact. Diffusion and continuity equation.. BJT moderls-low-frequency and high frequency hybrid models. Schottky barrier diode. Prentince Hall of India. UNIT-I Basic material properties of semi-conductors. Analysis of various oscillators. Governing factors for Fermi-Level.V Feedback concepts. Millman J. 4. Haridwar 28 Computer Science & Engineering . Recombination and carrier life time.L T P 3 1 0 Pass Marks 40 EEC-303 ELECTRONIC DEVICES AND CIRCUITS Objective: The objective of this course is to expose the students to the working principles of various semiconductor devices and their circuit application.---Electronic Fundamentals & Applications-Prentice Hall. Electronic Devices and Circuit Theory. MOS devices NMOS.IV Transistor biasing schemes and operating point stabilization. 2. GKV. The student has to attempt FIVE questions selecting one question from each unit. Robert Boylestad & Louis Nashelsky (6/e). Analysis of negative feedback amplifiers. BOOKS RECOMMENDED : Condition for oscillation. NOTE. UNIT.

UNIT-I Introduction to Boolean Algebra. Realization of Switching functions with gates. Haridwar 29 Sessional 30 Theory 70 Computer Science & Engineering . demultiplexers Encoders.IV Flip Flops and Timing Circuits. Mc Graw.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EEC-304 DIGITAL ELECTRONICS OJECTIVE : To course is intended to acquaint the student with the fundamental principles of two-valued logic and various devices that are used to electronically implement operations on variables adhering to the laws of this two-valued logic.Khoavr. Truth table verification of various gates.Ten questions are to be set taking two questions from each unit.Anand Kumar. UNIT. NOTE. At the end of the course.Morris Mano. Decoder. Master-slave Flip flops. (2/e).. & Schilling B. shift registers. the students should be able to comprehend the various building blocks in the design of a microprocessor/ digital computer. UNIT-V Counters: Asynchronous and Synchronous Counters. Switching and finite Automata Theory MM 100 Time 3 Hrs Faculty of Engineering & Technology. 2001 4 Greenfield J. Design of asynchrony counters. Digital Integrated Electronics. 1998 2 A. S-R latch gated latches.D. Identities logic functions. New Delhi. JohnWiley 5 Z. Edge triggered Flip flops. Conversion of flip flops. UNIT-III Combinational logic with MSI and LSI: Magnitude Comparator. Map representation upto 4 variables simplification and realization of various functions using various gates. The student has to attempt FIVE questions selecting one question from each unit. Multiplexer’s. Two bits and four bits up and down counters and their design. Singapore.. Prentice Hall. Practical Digital Design using ICs. References: 1 M. UNIT-II K. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Combinational logic and design procedure. Fundamentals of Digital Circuits 3 Taub H. Digital Design. GKV.

Test signals. Historical Development. Types of feedback and their properties. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Concept of controllability and Observability state variables and linear discrete time system. Haridwar 30 Computer Science & Engineering . Properties of transfer function. NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisite: None References: 1 Nagrath and Gopal.L T P 3 1 0 Pass Marks 40 EEE 301/ECS301 Control System Engineering Objective: This course is designed to introduce the concepts of modeling. Solution of State equations. 2001 2 Ogata. Basic concepts of open and closed loop control system and their properties. Ten questions are to be set taking two questions from each unit. Nyquist stability criterion controller. The student has to attempt FIVE questions selecting one question from each unit. root locus technique. Introduction to linear and non-linear mathematical modeling of physical system. Time response of first and second order system. Steady state error analysis. Time response analysis. bode plot. New Delhi. Diagonalization.(3/e). analysis and design of simple linear and nonlinear systems. Design specification of second and third order system. New Delhi. PHI. Control System Engineering. Introduction to system concepts. relation between characteristics equation and transient response. Routh and Hurwitz stability criterion. Time response analysis of discrete data system. New Age. Modern Control Engineering. Introduction to stability of continuous and discrete data system. relation between time response and frequency response. compensator and design of control system. Introduction to search techniques linear Programming. 2001 Faculty of Engineering & Technology. Model classification. Introduction to nonlinear and optimal control systems. Optimization Concept. Transfer function and block diagram algebra. Signal flow graph and mason’s gain formula State space representation of physical systems and their properties. GKV. Steady State Error.

selection. Prerequisite: Knowledge of Programming in C References: 1 Kruse. Recursive and non. Applications : Reading and Writing polynomials. Circular Queues. Merge and Heap sorts). Circular Linked list and doubly linked list. Unit II Linked List : Singly linked list (operations on list). NOTE : Unit I Introduction to Algorithm Design and Data Structure: Design & analysis of algorithm.tree (Insertion and Deletion algorithms). Leung and Tondo. Various approaches of File Organization : Sequential file. Postorder and Inorder). New Delhi. Fundamentals of Data Structures. Stackless recursion removal: merge sort Threaded binary tree : Introduction. New Delhi. Bubble. 1994 2 Ellis Horowitz and Sartaj Sahani. Generalized list. Stacks & Queues. Polynomial representation and manipulation using linked list. Insertion of a node. Open addressing (Linear probing and modification). The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Inorder. 1998 MM 50 Faculty of Engineering & Technology. Address Calculation using column & row major Ordering. Relative file and Indexed sequential file organizations. preoredr and postorder traversal. Conversion from Infix to Postfix & Prefix and Evaluation of Prefix expressions using Stack. Haridwar 31 Sessional 15 Computer Science & Engineering . Quick. Sorting methods (Insertion. Frequency count. File System : Files. BST traversal methods (Preorder. Representation of Stacks & Queues Using Arrays and their operations. Unit – III Trees : Logical level of binary search tree. Unit IV Searching and Sorting : Sequential & binary searches. Linked stacks and queue. Top-down and Bottom-up approaches to algorithm design. B. Polynomial addition. Insertion in Threaded tree. Height balanced (AVL) trees: Definition. Chaining. Analysis of Algorithm.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS302/ ECS404 Data Structure Objective: To prepare the students towards the use of object oriented design using complex data structures in programming.PHI. Ten questions are to be set taking two questions from each unit. Applications of Arrays. The student has to attempt FIVE questions selecting one question from each unit. Hashing schemes: hashing. Complexity measures in terms of time and space Arrays. File Organizations. Data Structures and Program Design in ‘C’. The height of an AVL tree. Collision functions. Unit V Removal of Recursion :General Method of removal of recursion. File Operations. Deletion of a node. File Directories. Threads. Insertion into and deletion from a BST and their implementation. GKV. Recursion removal by folding Nonrecursive quick sort.recursive algorithms for traverse methods. Hash functions. File system. Galgotia. Stacks and Queues : Representation of Array (Single & Multi Dimensional Arrays).

To study 8 bit and 4 bit analog to digital and digital to analog converter. To study the op-amp as a buffer amplifier and a difference amplifier.Time 2 Hrs L T P 0 0 2 Practical 35 Pass Marks 25 EEC351 Advanced Electronics Lab List of Practical 1 2 3 4 5 6 7 8 9 10 To study the characteristics of FET/ MOSFET/ UJT. To study the UJT relaxation oscillator. To study op-amp as a pulse generator. Faculty of Engineering & Technology. Haridwar 32 Computer Science & Engineering . Schmitt trigger and as a active Filters. To study the characteristics and parameter of op-amp. GKV. To study op-amp as a V to F and F to V converter and as a differentiaton. To study the op-amp as a comparator. To study the op-amp as a Voltage to current and current to voltage converter. To study op-amp as multi vibratos.

Faculty of Engineering & Technology. GKV.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS 351/ ECS454 Data Structure Lab The in charge of lab will decide the programs to be made based on the theory of the subject. Haridwar 33 Computer Science & Engineering .

MM 50 Time 2 Hrs L T P 0 0 2 Pass Marks 25 ECS 360 Seminar Objective: To increase the communication ability of students and to prepare them for presenting seminars on advanced topics of their branch. GKV. Faculty of Engineering & Technology. Haridwar 34 Computer Science & Engineering . The topic will be decided by mutual concern of faculty in charge and student. The students will be required to deliver a seminar on a topic of general interest in or any advanced topics related to the theory papers studied.

1987 2 Grewal. 1994 Faculty of Engineering & Technology. New Delhi. Relaxation techniques Ordinary Differential Equations: Taylor. Newton-Raphson iteration. Extension of Trapezodial and Simpson. Algebraic and Transcendental Equations. Errors in numerical computations: Absolute. Gaussian Quadrature formula. Numerical Differentiation and Integration: Newton. GreogoryNewton. B. Picard. Oxford 7 C. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Adams-bash Forth and Milne’s method. Jacobi’s and Gauss. Linear Simultaneous Algebric Equations: Gauss elemination. round-off and truncation errors. and other operators.. Errors in interpolation. Addison Wesley. Khanna. Significant digits. Divided differences. Numerical Methods in C++. Vikas 6 Flowers. Method of bisection.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EMA401/ EMA501 Numerical Analysis Objective: To expose the students to various Numerical methods for solving a variety of problems and to develop their skills in numerical computation by working on numerical examples with the awareness of different types of errors involved. rules to multiple integration.Seidal methods. Applied Numerical Analysis. TMH 4 Sastry. PHI 5 Vendamurthy . The student has to attempt FIVE questions selecting one question from each unit.Cotes formula. Eulers. Ten questions are to be set taking two questions from each unit. Wiley . Iyengar . NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisite: Nil References: 1 Jain. relative. Numerical Methods. Laplace and poisson equations by finite difference method. 3 Balaguruswamy. Stirling and Bessel and Lagrange’s formula. Numerical Methods in Engineering & Sciences. Numerical solution. Direct iterative method. Partial Differential Equations: Numerical solutions by difference Laplace Equations.Gerald (5/e). Largest eigen value and corresponding eigen vector. Numerical Methods. convergence. Interpolation:Finite differences operators.F. Haridwar 35 Computer Science & Engineering . System of ordinary differential equation. Introductory Method of Numerical Analysis.S. Numerical Methods for scientific & Engineering Computation. GKV. Runge-kutta.

iterative networks. Timing consideration. S-R. Modern Switching Theory and Digital design. J. IC 7483-4 bit parallel binary adder. and 4 bit parallel binary subtractor. f. Logic Design of Switching Circuits. Counters.K. Design of Pulse Mode Asynchronous Sequential circuits. D. Sequential logic circuits Prerequisite: EEC302 References: 1 Shiva S.. F. and realization using D Flip Flops. A. PHI Faculty of Engineering & Technology. & Memon. Design procedure of counters.J. Half and Full adder and circuits.T. Asynchrous. UNIT-I Arithmetic circuits. state reduction and assignment. Introduction to Switching Theory and Logic design. memory elements. UNIT-II 4 bit magnitude comparator (IC-7485).K. parallel binary adder. GR.D. Digital Design. PHI 6 M. Cascading of IC 7485. GKV.Lewin.IV A synchronous sequential circuits. using IC’s.Morris Mano. The previous year papers/ mode paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. PHI 7 Zvi Kohavi.C. design of sequence detector using iterative networks. and Peterson.V Algorithmic State Machines (ASM) ASM chart. and Binary divider. 4 bit serial adder/subtractor. Scott Foresman and Company 2 Hill F. NOTE : Ten questions are to be set taking two questions from each unit. F. Binary multiplier.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EEC407/ EEC603 Switching Theory and Logic Design Objective: To develop the skill of logic and design studied in digital electronics. Design with state equations. design of fundamental mode Asychronous sequential circuits. The student has to attempt FIVE questions selecting one question from each unit. F. serial binary adders sequential detectors. Introduction to Logic Design. UNIT-III Sequential Machines. John Wiley 3 Friedman.. Finite state model. UNIT. analogy between iterative networks.F. Synthesis of Synchronous Sequential circuits. Design with multiplexer. ELBL and Nelson 5 Lee S. UNIT. Haridwar 36 Computer Science & Engineering . control implementation. and sequential machines. Synchronous Sequential logic. analysis of clocked sequential circuits. T.S. computer Science 4 D. BDC adder.R.Theory and Design of Switching Circuits. Switching & Finite Automate Theory.

P.8 R.Jain. Haridwar 37 Computer Science & Engineering . GKV. TMH Faculty of Engineering & Technology. Modern Digital Electronics.

I/O processors. 1998. and instructions.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS 405 Computer Architecture and Organization Objective: To introduce students to the basics of computer architecture and the organization of the various parts of the computer system. stock handling. William Stallings. UNIT-II Introduction.PHI. Hierarchical structures. Virtual memory. UNIT.Computer Architecture. UNIT-I NOTE : Basic Computer System. peripheral devices. Assembly language. Architecture.IV Control memory. M.C. UNIT-III CPU organization. Codes. and data communication systems. inter register data transfer.V Hardwired and Micro program control Main memory organization. Mano . The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Prerequisite: Introduction to Programming References: 1.etal (4/e). M. Hardware. Haridwar 38 Computer Science & Engineering . CISC and RISC machines. Ten questions are to be set taking two questions from each unit.1996 Faculty of Engineering & Technology. multiprocessors. Architecture and advanced Architecture. Hamachar V. control function. Memory management. Control and execution. McGraw Hill. Computer Organization and Architecture. logic and shift micro instructions. Arithmetic. Micro programs. 3. Computer instructions. GKV. I/O interfaces. PHI 1998. Computer Organization. synchronous and asynchronous data transfers. timing. 2. ALU multi bus control unit-sequencing of control signals. The student has to attempt FIVE questions selecting one question from each unit. addressing methods. Processor bus organization. synchronous and asynchronous data transfers. UNIT.

Interpreters.. Compilers & Program Translators. general .. Intermediate code. Features of a macro facilityarguments. two pass assemblers. 1997.. Radhakrishnan T. 5 Aho Ullman. System programming. 4 D. parse tree. 1999. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Unit V Loaders: Basic loader functions. TMH.SIC.binders. Machine architecturememory. Ten questions are to be set taking two questions from each unit. Prerequisite: Fundamentals of computer. P.M. Generate. Machine Independent features. NOTE: Unit I Introduction: Classification of software. RISC. other loader schemes. Assembly Language Programming for the IBM PC. 6 Rajaraman V. assembler design options. design of macro processor and its data structure.L. Input & output etc. code generation.divison into passes. Unit III Assemblers: Basic assembler functions. overlays. Principles of Compiler Design. Haridwar 39 Computer Science & Engineering . References: 1 Beck L. general idea of operating system. architecture of real machines. absolute. Addision Wesley. Unit II Compiler: Functions (tasks) of a compiler. basic macro processor functions. addressing modes. Instruction set. triples. 1999. Machine dependent/ Independent features. 1998. Machine dependent/Independent features. Unit IV Macro Processors: Need of macros. linking. compiler-compilers. Pitman Publications. Machine structure: Von Neumann machine structure. 2 Calinagaert. Assemblers. single-pass and two pass macro processors. Instruction formats. loaders. recognizing Syntactic Units and Interpreting Meaning. Machine dependent/Independent features. AIX. storage allocation. discussion of real machine assembler. (3/e). system Programming & Operating Systems. direct-linking.MASM. 3 Donovan J. a simple assembly scheme.tokens. Compiler design options. registers. assembler design data-structure. System Software. The student has to attempt FIVE questions selecting one question from each unit.J. CISC. Dhamdhere (2/e). Intermediate form.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS 402 System Software Objective: The objective of this course is to familiarize students with basic functioning of System software provided with the machine. GKV. classification of system software on the basis of purpose. Implementation within assembler. dynamic binders. McGraw Hill. loader schemes. 1979. algorithm on first pass.compile & go. definition of macro & call. Faculty of Engineering & Technology. data formats. general idea of compiler phases.one pass assembler. quadruples. nested macros etc. symbol table. SPARC.. Statement of problems: recognize basic elements. P-code compilers.

derivation-public.Lippman & J. function name overloading. polymorphism by parameter. instantiation of objects. information hiding. C++ garbage collection. metaclass/ abstract classes. Object types. relating to other paradigms (functional. private & protected. Difference between C and C++. generic classes. overriding inheritance methods. state identity and behaviour of an object. new deleted operators. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. operator overloading parametric polymorphism. Object Oriented Design & Applications. using multiple inheritance. categorization of polymorphic techniques Method polymorphism. Cummings) Faculty of Engineering & Technology. default parameter value. data decomposition). The student has to attempt FIVE questions selecting one question from each unit. Haridwar 40 Computer Science & Engineering . generic function. encapsulation. dynamic memory allocation. polymorphism) Review of C.Lajoie (Addison Wesley) 2 Object Oriented Programming with C++ E.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS 403/ ECS505 Object Oriented Programming Using C++ Objective: To make the students learn object oriented style of computer programming and using it with help of C++. C++ class declaration. (Bengamin. Ten questions are to be set taking two questions from each unit.Balagurusamy (TMH) 3 Object Oriented Programming using C++ R. persistent objects. Inheritance. object& classes. Class hierarchy. exception handling. inheritance. NOTE: Unit I Unit II Unit III Unit IV Unit V Prerequisite: Nil References: 1 C++ Primer S. stream and files namespace. attributer methods. Objects. run time polymorphism Standard C++ classes.template function. Cin. constructors and destructors. abstract data types. aggregation. Encapsulation. basic terms and ideas (abstraction.B.Booch (2/e). GKV. polymorphism. Cout. composition Vs classification hierarchies.Lafore (Galgotia) 4 G.

Unit IV MARKETING MANAGEMENT Marketing definition -Market research -Need for marketing -Sales forecasting -Product life cycle Market segmentation.MBP . K. planning and control. Note : Ten questions are to be set taking two questions from each unit.BANKING AND FINANCIAL MANAGEMENT Nature and functions of money -Functions of commercial and central banking -Credit creation in the banks " Balance of payment and trade -The problem of foreign exchange -Exchange control . Coutter Mary. 4. 2.Devaluation and Revaluation -Source of industrial finance -Principles of accounting -Preparation of balance sheet . Chand & Co.1999 Edn. Nair N.Job evaluation and merit rating -Fatigue . Craig Peterson H & Cris Lewis W. 1996 Edn. Maheswari S.MM 100 Time 3 Hrs L T P 3 0 0 Sessional 30 Theory 70 Pass Marks 40 EHU401/EHU502/EHU801 INDUSTRIAL ECOMOMICS AND MANAGEMENT OBJECTIVE: The course aims at knowing l)How the micro and macro economic principles are useful for firms' decision making purposes. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper.'Modern Economic Theory" S.MBC.. Thankur Manab(r). S. ‘Modern Economic Theory'.Advanced techniques in management: MBE.Management accounting.MBO. Faculty of Engineering & Technology. 6... GKV. PHI. Haridwar 41 Computer Science & Engineering . The student has to attempt FIVE questions selecting one question from each unit. Unit I INDUSTRIAL ECONOMICS : Elasticity of demand and supply -Demand forecasting methods -consumption laws -Types of competitions -Time elements -Break even analysis -National income accounting -Keyenesion employment theory -Multiplier and accelerator -Trends in industrialisation in India -Economics of sale -Production. References: 1. 'Management' PHI 1998 Edn. Burtoon Genie. Unit V PERSONNEL MANAGEMENT AND INDUSTRIAL PSYCHOLOGY Selection and recruitment -Training and development .. Robbins(r) P . 'Personnel Management and Industrial Relations'. 4)and also how the basic & general management concepts ( with emphasis on marketing and personnel) are helpful for managerial purposes. Kooutsnnis. 3)The maintenance of accounts by business firms and also countries engaged in international trade. Unit III PRINCIPLES OF MANAGEMENT Managerial functions -Scientific management -Merits and demerits of different types of business organization . Ltd. 2)The latest trends in banking. 7. TMH-1996 Edn. Latha Nair.Chand & Co (r)Ltd(r) 1999 Edn. Unit II MONEY .MIS -Quantitative techniques in management.'Management Today'.. Dewtt.N.Stephen.K.G.Accidents -causes and prevention -The concepts of industrial relations and causes of industrial disputes -Worker participation -QWL -Quality work life. 'Managerial Economics' PHI-1996(r) Edn. 5.Cash flow statement . 3.: An Introduction to Accountancy' Vikas Publishing House Pvt (r) Ltd 1999 Edn.

Koontz Harold. Langranges. Simpson 3/8 rules. Inc(r) 1995 Edn. To implement Bessels function. MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS451 Numerical Analysis Lab Write Programs in C 1 2 3 4 5 6 To deduce errors involved in polynomial interpolation. O Donnel Cyril. TMH-1983 Edn. Haridwar 42 Computer Science & Engineering . Faculty of Engineering & Technology. Algebraic and transcendental equations using bisection. iterative.Wayne. Implement numerical differential using trapezoidal. Cascaio F. To show frequency chart. 9. 'Management'. also give rate of conversions of roots in tabular form for each of these methods. Weihirch Heinz. GKV. Linear square fit and polynomial fit. Newtons. Striling. method of false position. regression analysis. Mc Graw Hill. 'Managing Human Resources'.8. To implement method of least square curve fitting.

11 To verify the table foe decoder driver 7447/ 7448 and to operate a 7. 6 To design and test a S-R flip flop using NOR/ NAND gates and to verify the truth table of J-K flip flop(IC7476).debounce using NAND gates.) 2 To design and observe the output of TTL clock circuit for high and low frequencies using NAND gates. GKV.7404.7486. 7 To design and test D flip flop using gates and S-R flip flops.segment display through a counter using a low frequency clock. 4 To study a mono stable multi vibrator(IC74121 and IC74123) circuit design and test its performance. 12 To fabricate & test half and full (IC74831) adder and verify their truth tables. 3 Design and test the switch.7408. 10 To verify the truth table of demultiplexer(IC 74154). 8 To study the operation of 7490 and 7493 counters and construct a mod-6 counter using IC7493. Haridwar 43 Computer Science & Engineering .7432.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 EEC 451 Digital Electronics Lab List of Practical 1 To verify the truth tables of various types of gates(IC7400. 5 To design and test various circuit using IC 555 timer (Astable multi vibrator).LED etc. 9 To verify the truth table of multiplexer(IC 74150).7402. 13 To verify the truth tables of ALU using IC 74181. Faculty of Engineering & Technology.

memory allocation for objects. function overloading. Classes and objects: arrays within a class. single and multiple inheritance. Inheritance: derived classes. hierarchical inheritance. exception handling. use of files. template arguments. learning to use Visual C++ environment.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS 453/ ECS554 Object Oriented Programming Lab Programming exercise on the following topics. pointer to derived classes. constructors in derived classes. constructor and destructors. friend functions. Faculty of Engineering & Technology. parameter passing. classes containing objects of other classes. Haridwar 44 Computer Science & Engineering . static members. Templates: class and function templates. virtual functions. Polymorphism: pointers to objects. this pointer. GKV. operator overloading. call and return by reference. inline functions. returning objects. Functions in C++.

universal turning machines. & Ullman. 1973.. my-hill –nerode theorem.. Introduction: Sequential machine and automata. Formal grammars and their classification .Nelson. unrestricted grammars. 5 R.R. abstract. Papadilypriou. 1981 4 Salomon. H.K. relation between classes of languages. Languages and Computation Narosa Publishing House. Introduction to Computer Theory. PHI. The student has to attempt FIVE questions selecting one question from each unit. modification of turning machines. Daniel I. Meelay & Moore automata . Cohen.: Formal languages. 1998 3 Lewis. 1986 2 Hopcroft. Ten questions are to be set taking two questions from each unit. Haridwar 45 Computer Science & Engineering . Academic Press.H.A. introduction to recursive function theory. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Turning Machines: The turning machine model. Push Down and Linear Bounded Automata: Definitions. Finite State Acceptors: Regular sets and regular expressions. A. decision algorithms. complete languages and functions.E. pumping lemma closure properties. post correspondence problems. context sensitive language. Deterministic and non deterministic finite automata. static tables & diagrams. Properties of finite state languages. machine and languages. John Wiley & Sons. ambiguity. Chomosky Hierarchy: Regular grammars. J.Introduction to Automata Theory.D .:.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS 501/ ECS608 Theory of Automata & Formal Languages Objective: To expose the students to the concepts of theory of computations. C. Church’s machines undecidebility Properties of recursive and recursively enumerable languages. deterministic & non deterministic FSA. GKV. J. relationships between PDA and context free language. Finite state machine as transducer. Context Free Grammars: Derivation trees simplification forms. Introduction to Automata John Wiley & Sons Faculty of Engineering & Technology.J. Two way acceptors. Limitations of finite automatas. NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisites: Discrete Structures References: 1. Elements of the Theory of Computation. properties of CFLS. 18th print.

GKV. system programs. operating system design issues Protection: Mechanisms and policies. A. Concurrent Processes: Process concept. Ten questions are to be set taking two questions from each unit. methodologies for implementation of O/S service system calls. Performance criteria. scheduling algorithm. Addison Wesley. Batch. Virtual memory concept.S . implementation issues: hierarchy and device management.1989 Faculty of Engineering & Technology.. Process scheduling CPU Scheduling: Scheduling concept. multiprogramming with fixed partition. Addison Wesley. Multiprogramming with variable partition.M. distributed systems. 1998 2 Madnick & Donovan. Segmentation. Inter processes communication. An introduction to operating system concepts.TMH. Deadlock characterization. Haridwar 46 Computer Science & Engineering . implementation File system: File concept. prevention. The student has to attempt FIVE questions selecting one question from each unit. Critical section problem. resident monitor. Introduction: Operating System and function. Demand paging.S. Classical problems in concurrency. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Impact on Performance Device Management: Hardware organization. Principle of concurrency. PHI . Performance. Process generation. file sharing. multiprocessor scheduling. interactive. Interrupt mechanism. Semaphores. I/O Management and Disk Scheduling: I/O devices and the organization of I/O function. Evolution. I/O buffering.(2/e). devices scheduling policies Deadlock: System model. allocation of frames. Levels of scheduling. time sharing and real time system. file organization and access mechanism.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS502/ ECS607 Operating System Objective: To introduce basic concepts of operating system and its design. file directories. System protection. Cache memory organization. 1997 5 Deitel H. 1997 4 A. Operating System Concepts. Paging. Recovery from deadlock combined approach. Operating Systems. thrashing. disk I/O. Modern Operating System. evolution of operating systems. avoidance and detection. paged segmentation. Mcgraw Hill. Memory Management: Base machine. Operating Systems.1996 3 Tanenbaum. Godbole . paged replaced algorithm. NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisite: Computer Organization References: 1 Silberschatz & Galvin(5/e). Multiple base register. Product/ Consumer problem.

The student has to attempt FIVE questions selecting one question from each unit.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EEC 508 Microprocessors & Interfacing Objective: NOTE : To introduce the students to the architecture and programming of 16-bit Microprocessors and their successors. Addressing modes. and the techniques for their interfacing to various I/O devices.Socha. Microcomputer Systems The 8086/ 8088 Family. stacks subroutines. 8-bit microprocessors. Micro controllers and their applications. PHI.IBM PC Assembly Language and Programming.S.1999 2 Peter & J. overview of arithmetic and looping instructions in 8086. Ten questions are to be set taking two questions from each unit. Interfacing concepts and devices. Haridwar 47 Computer Science & Engineering .1997 5 Gaonkar R. UNIT. UNIT. PHI. 16-bit microprocessors. Interfacing of ADC and DAC. An introduction to Microprocessor Architecture. Use of programmable peripheral interfaces. Interfacing of keyboard and display controller. Serial I/O.V Use of counters and timer chips. PHI. 8085 instruction set and programming. Prerequisite: Computer system organization References: 1 Barry B. GKV. 1992 3 Liu & Gibson(2/e) . Wiley Eastern 6 Ram B. UNIT-III Architecture of 8086. Interfacing of switches and LED’s.IV Simple experiments on 8085 programming using kit.. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Interfacing of printer. Programmable interfacing devices. UNIT-I Microcomputers and microprocessors. Fundamentals of microprocessor and microcomputer Faculty of Engineering & Technology. Microprocessor architecture programming and application. UNIT-II Interrupt structure and I/O techniques. Instructions and timings. PHI. Serial communication. Peter Norton’s Assembly Language Book. Programmng and Interfacing. Programming of 8086 using kit. Brey(4/e). 1994 4 Peter Abel .(2/e).

Faculty of Engineering & Technology. GKV. Haridwar 48 Computer Science & Engineering .

Pulse duration and pulse position modulation. Synchronous. PPM.S. Channel capacity. Advantage of digital communication over analog communication. envelop detection. Digital and Analog Communication System. Multiplexing pulse modulation PAM. Base band and Radio frequency. Compression with PAM. generating repeaters. NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequistie: Signals and Systems References: 1 G. Instantaneous.System. Prentice Hall 3 K. Maxwell 5 Schwartz Mischa. Bandpass Digital System: Binary Modulation: OOK. McGraw Faculty of Engineering & Technology.Transmitter and receivers. 1996 4 Couch Leon W. Fourier Transform. Multilevel signaling. asynchronous and statistical IDM. Haridwar 49 Computer Science & Engineering . Fourier Series. bandwidth of PCM. McGraw 2 Roden H. Introduction: Elements of a communication system and its fundamental limitations. Frequency Modulation. MPSK. comparison of baseband width and bandpass transmission rates. PSK. Digital Systems: Brief introduction to DPCM & DM.S. PDM. GKV. quantization noise and PCM performance. multilevel DPSK. Modulation and Noise. Digital and Dass Comm. Digital and Analog signals and systems. Compression standards. Baseband Pulse: Sampling. Modulation and Demodulation.DPSK. Pulse transmission. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper.Shanmugham . Typical functions and their transforms. Base band signals and voice band pass communication. Generation and deduction of digital modulation signal bitrate and transmission bandwidth. detection of DSB and SSB.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EEC502 Principles of Analog & Digital Communication Objective: To expose the students fundamental principles of analog and digital communication techniques. Electronics Communication Systems. transmission. PCM.M. Angle modulation. Simple Communication System. Amplitude Modulation (A-M) methods. Uniform and nonuniform quantization techniques. The student has to attempt FIVE questions selecting one question from each unit.. Digital Analog Communication systems. Energy and power spectra transmission. Ten questions are to be set taking two questions from each unit.. Information. Pulse functions Signal transmission. John Wiley. A. flat flop. transfer function. Spectral Analysis. Matched filter principle. BPSK. Comparison of AM & FM. data modulation.Kennedy . Binary line coding. Spectral Analysis. Information theory and source coding. QAM. natural. Ideal frequency domain filter.

Modern Digital and Analog Communication Systems. ”Procedural Elements of Computer Graphics" McGraw Hill. Vectors. Windowing and Clipping: Viewing transformation. transformation routines. Event handling Echoing.(2/e). various. Image transformation. McGraw Hill. Rendering and Illumination Introduction to curve generation: Bezier. Transformations. 1998 7 S. ” Principles of Interactive Computer Graphics”. Line Generation : Points.. Segments: Segments table. Interactive techniques Three Dimensions: 3 D Geometry Primitives. lines. Primitive operations. The student has to attempt FIVE questions selecting one question from each unit. Pixels and frame buffers. Hermite and B-spline algorithms and their comparisons NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisite: Programming and Graphics References: 1 Rogers. Display procedures. GKV. Hiddenline methods. Vector and character generation Graphics Primitives: Display devices. Display control text Polygons: Polygons representation. input and output methods and the relevant fundamental algorithms for development of lines. Communication Systems. Filling polygons. Hidden line and Surfaces: Back face Removal algorithms. ”Computer Graphics”. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper.S. “Computer Graphics” Faculty of Engineering & Technology. John Wiley. Clipping. Deleting and Renaming a segment Visibility. 1994 MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS504 Interactive Computer Graphics Objective: The objective of the course is to give an overview of Graphics system. McGraw Hill. 2 Newman & Sproulle. 1987 3 Harringtons. curves. Display-file structure. Plains. Creating. 1987 4 Rogers & Adams (2/e). “Mathematical Elements of Computer Graphics” McGraw Hill 5 Heny Baper. Generalised clipping Multiple windowing. Haridwar 50 Computer Science & Engineering .Haykin (3/e). Transformations: Matrics Transformations. which finally extends to 2-D and 3-D Graphics and ultimately to visual realism. Interaction : Hardware Input device handling algorithms. Projection .Lathi (3/e).P. Oxford Univ. Clipping. Ten questions are to be set taking two questions from each unit. A programming Approach.6 B. Entering polygons.

Semaphore and message. memory paging and segmentation.passing solution to producer consumers and dining philosophers problems. GKV. Haridwar 51 Computer Science & Engineering . CPU scheduling.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS551 Operating System Lab Programming exercise in operating systems commands/ system calls. Faculty of Engineering & Technology. design of a simple multiprocessing operating systems.

Faculty of Engineering & Technology. Haridwar 52 Computer Science & Engineering .MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS552 Computer Graphics Lab The in charge of lab will decide the programs to be made based on the theory of the subject. GKV.

Faculty of Engineering & Technology.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 EEC551 Microprocessor Lab List of Practicals 1 2 3 4 5 6 Study of 8086 kit. Programming of addition. GKV. subtraction. Programming for A/D and D/A conversion. Programming for control of DC motor and stepper motor. Haridwar 53 Computer Science & Engineering . Communication between PC and 8086 microprocessor. multiplication & division. Programming of String operation and I/O operation.

F. Haridwar 54 Computer Science & Engineering . Faculty of Engineering & Technology. Line code generation. Hamming code generation and decoding. Generation and demodulation of PWM and PPM. PSK and FSK generation and detection.M. PLL-FM demodulation and other applications. GKV. generation.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 EEC552 Communication Lab Practical exercises based on Generation and detection of AM including DSB/AM. PCM and Delta Modulator implementation. Multiplier Applications.

GKV. Simple programming exercises to compute expressions with register and memory operands using various addressing modes. Sorting and searching with arrays. String Operations. Subroutines Recursion. Multiprecission operations. Faculty of Engineering & Technology. Haridwar 55 Computer Science & Engineering .MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS553 Assembly Language Programming Lab Study of 8086 Assembly language.

x to 802.mail. Ten questions are to be set taking two questions from each unit.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS601/ ECS706 Computer Networks Objective: NOTE : To familiarize students with basic concepts of Computer Networks. shortest path routing. Infrared and light wave transmission. Firewalls.Stallings (5/e).500. Congestion control and prevention policies. Error detection and Correction. IEEE standard 802. The student has to attempt FIVE questions selecting one question from each unit. data compression. FTP. The Physical Layer : Transmission media : Twisted pair. IP address.400. Source Routing Bridges. Sliding window protocol. Using Go-Back n. IP protocols. encryption. PHI 3 W. Definitions. Telnet. Synchronization. The Data Link Layer : Design Issues: Services provided to the Network Layer. Comer (3/e). Interworking with TCP/IP. 1997 2 James Martin . The Network Layer : Network layer design issues. Fields in header. interface. IEEE standard 802. NSFNET. Session Layer-RPC.based routing. Internetworking : connectionless Interworking. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Unit I Unit II Unit – III Unit – IV Unit V References: 1 Andrew S. SNMP. Narrowband ISDN: services. OSI reference model. Fiber optics. The Transport Layer :QOS. TCP/IP Reference Model. Transparent Bridges. Faculty of Engineering & Technology. Example Network – ARPANET. Flooding. Bridges : Bridges from 802.4 and Token Bus. Presentation layer: ASN. Example : The Data Link Layer in the Internet. Error control. Principles. E. Tanenbaum (3/e).4 and Token Ring. The Medium Access Sub layer : Static and Dynamic Channel Allocation in LANs and MANs. Flow control. Computer Networks. Data and Computer Communications. GKV. Specification of header. PHI. Framing. IEEE standard 802. Protocols and Architecture. The transport service. WWW. 1999 4 Douglas E. Simplex . PHI. architecture. Communication Satellite: Geosynchronous Satellites. Introduction : Uses of networks (goals and applications). Baseband and Broadband coaxial cable.3 and Ethernet.y. Establishing and releasing a connection. Haridwar 56 Computer Science & Engineering . X. Low Orbit Satellites. Broadcast routing. Internet control protocols. Multimedia. The Internet . TCP/UDP : Standards. Transport protocols : Addressing. Wireless Transmission : Radio transmission. DNS. dialog management The Application Layer : Network Security. Flow.Computer Networks & Distributed Processing. X. Microwave transmission.

Internet & Intranet Engineering.1999 Faculty of Engineering & Technology. TMH. GKV.PHI. 1996 5 D.Minoli. Haridwar 57 Computer Science & Engineering .

Introduction: The Software Problem. Detailed Design: Module Specification. Metrics.(5/e). 1997 3 Sommeruitle I.. Project Monitoring Plans. Structured Design Methodology. Risk Management. Design Notation and Specification. Verification. GKV. Problem Analysis. Module Level Concept. Software Engineering. Design Methodology. Software Configuration Management Process. Software Engineering – A Practitionar’s Approach . Metrics Testing: Testing Fundamentals. Planning: Cost Estimation. Software Requirements Analysis and Specification: Software Requirements. The Software Engineering Approach Software Process: Software Processes. Fundamentals of Software Engineering. Software Engineering. Functional Oriented Design: Design Principles. McGraw Hill. Process Management Process. An Integrated Approach to Software Engineering . Software Development Process. Design Notation and Specification.(4/e).. Software Engineering Problem. Narosa Publishing House. Quality Management Plan. The student has to attempt FIVE questions selecting one question from each unit. Testing Object Oriented Programs.MM 100 Time 3Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS604 Software Engineering Objective: To acquaint students with fundamental concepts in Software Engineering. Requirement Specification. Concepts. Staffing and Personnel Planning. 1996 4 Jalote Pankaj.1983 Faculty of Engineering & Technology. & Madrioli D. Metrics NOTE : Unit I Unit II Unit III Unit IV Unit V Prerequisites: Nil References: 1 GhezziC. Project Scheduling. Haridwar 58 Computer Science & Engineering . Validation.. Metrics. Addison Wesley. Jazayeri M. OOD. 1995 5 Shooman. R.S. Verification. Functional Testing. Testing Process. Verification. Coding: Programming Practice. Metrics. Metrics. M. Object Oriented Design: OOA. Detailed Design. Structural testing. PHI. McGraw Hill. Characteristics of Software Process. 1994 2 Pressman. Project Management Process. Ten questions are to be set taking two questions from each unit. Software Configuration Management plan. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper.

The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper Unit I Electronic Commerce: Frameworks. Technology and Security of Web Consumer Oriented E-Commerce: Consumer Oriented Application.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS 605 E-Commerce Objective: To introduce the students to principles of e commerce. NSFNET. Home Banking History and Implementation Approaches. Network Infrastructure For E-Commerce: Market forces influencing. Value Added Networks. EDI Software implementation. Organization Applications. GKV. Global Information Distribution Network. Unit III Inter Organizational Commerce and EDI: EDI. Internet Applications. E-Commerce Catalogs. EDI: Legal. Macroforces and Internal Commerce. WWW as the Architecture. Security and Privacy Issue. Charting on-Line Marketing Process. Data and Message Security. Information Filtering. Emerging Client Server Security Threats. Digital Token-Based EPS. Internet Based EDIs. Work-Flow Automation and Coordination. Standardization and EDI. Mercantile Model from consumer and Merchant’s Perspective. Anatomy of E-Commerce Applications. Credit card based EPS. EDI and E-Commerce. Components of I. Haridwar 59 Computer Science & Engineering . Intra Organizational E-Commerce: Internal Information System. Management Issues in Online Banking. Internet as Network Infrastructure: Internet Terminology. Risk and EPS. E-Commerce and Convergence. NOTE : Ten questions are to be set taking two questions from each unit. Smart Cards and EPS. Information Search and retrieval. EDI Envelop for Message Transport. Hypertext Publishing. Consumer Search and Resource Discovery: Search and Resource Discovery Paradigms. History of Internet. Challenge Response System. Unit V Advertising and Marketing on the Internet: Information based Marketing. Firewalls and Network Security. Unit II E-Commerce and WWW: Architectural Framework of E-Commerce. Encrypted Documents and EMail. Customization and Internal Commerce. Consumer Applications. Designing EPS. Advertising on Internet. EDI Applications in Business. Supply Chain Application Software. Faculty of Engineering & Technology. Future of Supply Chain Software E-Commerce and Banking: Changing Dynamics in Banking industry. Electronic Payment System: Types of EPS. The student has to attempt FIVE questions selecting one question from each unit. Unit IV Supply Chain Management: SCM Fundamentals. National Research and Educational Network.Way. Network Access Equipment. Globalization of Academic Internet. Open Versus Closed Models. Managing Retail Supply Chain. Consumer-Data Interface. Network Security and Firewalls: Client-Server Network Security. Mercantile Process Model.

Browser and Software Agents. Faculty of Engineering & Technology.B. 2. Applets. Technology behind Software Agents. GKV. Safe-Tcl. Electronic Commerce A Manager’s Guide Ravi Kalokaota and A.Software Agents: History.B. Characteristics and Properties of Software Agents. Haridwar 60 Computer Science & Engineering . Telescript Agent Language. References: 1. Whinston (Addison-Wesley 2000). Whinston( Addison-Wesley). Frontiers of Electronic Commerce Ravi Kalokaota and A.

view equivalence and view serializability.J. Boyce-Codd normal form. Addison Wesley. Views in SQL Unit III Functional Dependencies. Implications of Database approach. Haridwar 61 Computer Science & Engineering . GKV. Transaction and system concepts. Data models. Data Modeling using Entity-Relationship Model. Transaction support in SQL. Object-relational Features of Oracle8 Prerequisites: Nil References: 1 Elmasari and Navathe (2/e). Update operations and dealing with constraint violations. queries in SQL Insert. Relational decomposition. Galgotia. Object database standards. Addison – Wesley. Languages. Schema and Instances. Normal Forms based on Primary keys. Decomposition and dependency Preservation. Unit V Concepts of Object-Oriented Databases. Object Relational Database Systems.(6/e). Serializability of schedules. Desai. 1994 4 Date C. 1994 2 Bipin C. Database users. General Definition of Second and Third normal forms. 1998 3 Korth & Silberschatz (3/e). 1994 Faculty of Engineering & Technology. NOTE : Ten questions are to be set taking two questions from each unit. Characteristic of Database approach. and design. Unit II Relational Model Concepts. Shadow paging. McGraw. and schema changes in SQL2. Database Languages and Interfaces. Recovery concepts. An Introduction to Database Systems.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS 603 Database Management System Objective: To introduce the students to principles of Data Base Management System and its application. Delete and Update statements in SQL. Advantages of DBMS. The student has to attempt FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Locking techniques for concurrency control. Concurrency control based on Timestamp ordering. An Introduction to Database Systems. recovery techniques based on Deferred and Immediate update. Database System concepts. Fundamentals of Database Systems. Relational constraints and Relational database schema. Dealing with deadlock. Data definition constraints. desirable properties of transactions. DBMS architecture and Data independence. Unit I Introduction. Schedule of transaction. Decomposition and Loss-less Joins Unit IV Transaction processing.

Control and Layout Manager Prerequisites: Nil References: 1 E. Creating thread. Unit V Servlets : Background. Interfaces. Servlet API. Java’s built.servlet package. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Classes & Objects : Classes. Byte Stream. Stream Classes. Graphics. & interface File. Programming with Java. Java Features. URL. Unit III String Handling: I/O .MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS 602 Java Programming Objective: To develop the skill of programming using Java and to introduce its application. Creating multiple threads. Handling Mouse and Keyboard Event. throws. TMH 3 C. Unit I Java History. Cornell . Hostmann & G. Nested try statements. Networking : Networking basis. Applet Class: Applet basics. Main thread. Uncaught exceptions. File Handling & I/O. Objects & methods. Passing Parameters to applets. Resuming. Naughton & H. Life cycle of a servlet. Synchronization.in exceptions. Thread priorities. Variables. TMH. Decision making. Inetaddress. Reading initialization parameters. TCP/IP client sockets. Core Java 2 Vol I & Vol II. Java and the Net. GKV. Serialization . Java servlet development kit. finally. String handling. Interthread communication. Unit IV Event Handling: Delegation Event Model. Applet Display Methods. and stopping threads. Event Classes. Pearson Faculty of Engineering & Technology. Sources of Events. 2000 2 P. Java Environments. Arrays. Packages. Constants. Hardware & Software requirements. S. Suspending. applet skeleton. AWT: Working with Windows. Multiple catch clauses. applet architecture.& data types. Haridwar 62 Computer Science & Engineering . Exception types.Balagurswamy (2/e). Text. URLconnection. User defined exception subclasses. Using try & catch. Branching & looping. javax.Schildt (3/e). The student has to attempt FIVE questions selecting one question from each unit. Multithreaded Programming: Java thread model. NOTE : Ten questions are to be set taking two questions from each unit. Reading servlet parameters. Unit II Exception Handling Fundamentals. Character Stream. throw. Operators & Expressions. TCP/IP server sockets. Events Listener interfaces. Inheritance. The Complete Reference Java2. Java I/O Classes.

Special cases in Simplex Method. Dual Simplex Method. Pure birth & Pure Death processes. Integer Programming : Methods of Integer Programming. Non Traditional Transportation Model. Relationship between the Optimal Primal and Dual Solutions. Applications. Work Force Size Model. Latest Allowable Event Completion Time(TL). Economic Interpretation of Duality.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 EMA 601/EMA501 Optimization Techniques Objective: To acquaint students with various optimizing techniques. Convex Programming Problems. Transient and Steady State of Queuing System. Deterministic Dynamic Programming: Introduction. (M/M/s):(FIFO/ / ) (M/M/1):(FIFO/N/ ) Models. ( Maxwell Macmillan ) 2 Operations Research. Definition of Dual Problems. Unit III Game Theory*: Minimax-Maximin pure strategies. Branch and Bound Technique. Unit IV Queuing Theory: Definition of Queuing System.Simplex Method: Introduction. A Computer Oriented Algorithmic Approach Gillet. Time Estimates for Activities. Taha. Billy E. Graphical LP Solution. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. PERT: Probability Consideration in Project Scheduling. Haridwar 63 Computer Science & Engineering . Critical Path and Critical Path Calculations. (TMH) Faculty of Engineering & Technology. PERT calculations. Unit V Steepest Descent and Coryngate Gradient Method. References: 1 Operations Research. Earliest Expected Completion Time of Events (ET). Recursive Nature of Computing. (M/M/1):(FIFO/ / ). Notation. Unit II Transportation and Assignment Model: Definition of Transportation Model. PERT/CPM: Arrow (Network) Diagram Representation. Birth-Death process. Gupta.K. Graphical Solution of m x 2 and 2 x n Games. Standard LP Form and its basic Solutions. Hamdy A. Unit I Linear Programming : Introduction. Penalty function Method for mixed equality and Inequality constraints. Cutting-Plane Method: Fractional (Pure Integer) Method. Simplex Algorithm. Artificial Starting Solution. P. Transportation Algorithms. GKV. Applications of Dynamic Programming in Shortest Route Problem. The student has to attempt FIVE questions selecting one question from each unit. Mixed-Cut method. Man Mohan (Sultan Chand & Sons) 3 Introduction to Operations Research. Mixed strategies and Expected Payoff. Characteristics of Queuing Models. Concept of Dominance. NOTE : Ten questions are to be set taking two questions from each unit. Cargo Loading Problem. Kanti Swarup. Assignments Model. Primal Dual Computation. Their Characteristics and State Transition Sate Diagrams. Duality: Introduction. Forward and Backward Recursion. Construction of LP Model.

F. Haridwar 64 Computer Science & Engineering . G. & Liberman.4 Introduction to Operations Research.J.S. Hiller. GKV. Faculty of Engineering & Technology.

File Transfer between nodes on a network. Haridwar 65 Computer Science & Engineering . and sliding window data link protocols. GKV. Hamming codes.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS653 Computer Network Lab Program development for transmission error control. Implementation of routing algorithms security mechanisms and protocols. Simulation of MAC sublayer protocols. CRC generatin and checking. Faculty of Engineering & Technology.

Haridwar 66 Computer Science & Engineering . GKV.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS653 Java Programming Lab The in charge of lab will decide the programs to be made based on the theory of the subject Faculty of Engineering & Technology.

All programs are to developed in C/C++. Haridwar 67 Computer Science & Engineering . Faculty of Engineering & Technology. GKV.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS654 DBMS Lab The in charge of lab will decide the programs to be made based on the theory of the subject.

Error reporting. Associativity.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS701 Language Processor NOTE : Ten questions are to be set taking two questions from each unit. dynamic storage allocation Intermediate Code Generation: Intermediate representations. Implementation. peep hole optimization. type conversion.Sethi & J. type expression. Principles of Compiler Design A. Techniques & Tools A.Aho.D. Lexical Analysis: Interface with input. Regular definition.V.Principles. Boolean expressions and procedure calls. Various phases of a Compiler. LALR. assignments. polymorphic functions. symbol table. overloaded functions and operators. lexeme and patterns. operator precedence grammar. Difficulties in lexical analysis. Code Generation and Instruction Selection : Issues. R. Transition diagrams. parameter passing. Ullman(Narosa) 2 Compilers . The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. bottom up and top down evaluation of attributes. activation record. basic blocks and flow graphs. TOP down parsing.V. Ambiguity. Tool based approach to compiler construction. precedence.G. code generation. structural and name equivalence of types. R. control flow. GKV. YACC Syntax directed Definitions: Inherited and synthesized attributes. Haridwar 68 Computer Science & Engineering . transformation on the grammars. Token.Aho. LEX Syntax Analysis: CFGs. I.Ullman (Addison) 3 The Theory & Practice of Compiler Writing J. LR parses (SLR. The student has to attempt FIVE questions selecting one question from each unit. predictive parsing. LR). Implementation issues. dag representation of programmes. recursive descent parsing.attributed definitions Type Checking: Type system. Unit I Unit II Unit III Unit IV Unit V Compiler Structure: Analysis. translation of declarations. code generation from dags. dependency graphs.Trembley & P.and S.D. References: 1.Sethi & J. parser and symbol table. Run Time System: Storage organizations. activation tree. bottom up parsing. register allocation .Synthesis model of Compilation. Evaluation order. Sorenson (McGraw) Faculty of Engineering & Technology.

embedding of problems graphs into processor graphs.E. 1990 4 Quinn M.V. insertions and deletion for B-trees. J.m-way search trees. optimal search trees. data and control parallelism. 1985 6Brassard & Bratley. Program performance: time and space complexity. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper..A. NP-hard problems Parallel algorithms: Introduction. McGraw Hill. Prime’s and Sollin’s algorithms. Algorithmic Graph Theory. PHI. NOTE : Ten questions are to be set taking two questions from each unit. Graph Algorithms: Search methods. Introduction to the Design and Analysis of Algorithms. 1985 Faculty of Engineering & Technology. Algorithms. McGraw Hill.D. A. Divide and conquer.DFS and BFS. B-trees. 1998 2 Aho. Parallel Computing Theory & Practice. 1984 3 Mchugh J. Analyzing algorithms.. study of design strategies and bounds on the performance of algorithms.E. dynamic programming. Introduction : Definition and characteristics of Algorithms.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS702 Design and Analysis of Algorithms Objective: To generate appreciation for algorithm importance. GKV.optimality Criterion. path finding and shortest path algorithms. Sahni S. S. Recurrence equations and their solutions Algorithmic Techniques: Algorithm design strategies such as recursion. complexity analysis. analysis. branch and bound examples. Hopcroft. Bipartite graphs Infeasibility : P and NP classes.J. Mc-Graw Hill. greedy method. topological sorting. PHI. Data structures. The Design and Analysis of Computer Algorithms . insertion deletions. PHI.. parallel algorithms for matrix multiplication. Algorithms and applications in C++ .Kruskal’s . & Ullman. back tracking. Haridwar 69 Computer Science & Engineering . applications and analysis Search Trees: Balanced trees – AVL and 2-3 trees. Minimum cost spanning trees. 1994 5 Goodman. The student has to attempt FIVE questions selecting one question from each unit. Biconnectivity. J. Algorithms for building and maintaining these trees. Spanning trees. load balancing and scheduling problems Unit I Unit II Unit III Unit IV Unit V Prerequisites: Courses in Data structure References: 1. & Hedetniemi. Asymptotic notation.

window messages Unit IV Unit V Debugging in Visual C++. The student has to attempt FIVE questions selecting one question from each unit. GKV. Creating Window. “X window system programming”. menus. N. multi document interface(MDI). Steven “ Visual C++ Programming”. Prentice Hall 2 Holzener. mouse techniques Unit I Unit II Unit IIIReading key strokes in windows. Prentice Hall 3 Murray and Pappas. References: 1 Barkakati. scroll bars. “The visual C++ handbook” Faculty of Engineering & Technology. Object linking and embedding (OLE) Writing X applications. File handling in Window Dialogue boxes. constructing geographical user interface with X. list boxes. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Haridwar 70 Computer Science & Engineering .MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS703 Visual Programming NOTE : Ten questions are to be set taking two questions from each unit.

Production systems.F. (Addison Wesley) Clockskin. Unification algorithm. Conversion to clause form.). P. Means-End analysis. Problem Trees versus Problem graphs. A. W. GKV. Generate-and-test. Problem Reduction. Alpha-beta pruning. Semantic Nets.H. Breadth-First-Search.(Narosa) Petterson Faculty of Engineering & Technology. Introduction to Expert Systems and Programming in Prolog (Standard Prolog) References: 1. Problems as state space search. Problem characteristics. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper.I. Hill Climbing. Frames. Unit IV Game Playing : Minimax search. Knowledge representation and the frame problem. Constraint satisfaction. Heuristic search. Haridwar 71 Computer Science & Engineering . Techniques and its characteristics. The student has to attempt FIVE questions selecting one question from each unit. and Mellish.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS704 Artificial Intelligence NOTE : Ten questions are to be set taking two questions from each unit.Artificial Intelligence: 2. Unit V Structured Knowledge Representation : Introduction.I. Knowledge Representation using Predicate Logic: Representing simple facts using logic. Production system characteristics. ( McGraw Hill ) Winston. Resolution. Unit I Introduction : Definition and scope of Artificial Intelligence (A. Artificial Intelligence 3 Programming in Prolog 4 Artificial Intelligence Elaine R. Control Strategies. Resolution in clause form. C. Unit II Problem Solving : Problems and problem spaces.S. Secondary search. Unit III Problem Solving Methods : Forward versus backward reasoning.

Dynamic Mathematical Models. model determination from input-output observation. When to Simulate. Simulation of Continuous and Discrete System. Unit I Concept of System. Stochastic Activities. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Block-Structured Continuous Simulation Language. System Modeling. Static Physical Models. Numerical Evaluation of Continuous Probability Functions Continuous Uniformly Distributed Random Numbers. Simulation Languages: Continuous and Discrete Simulation Languages. Continuous and Discrete System. Discrete Probability Functions.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS705 Modeling and Simulation NOTE : Ten questions are to be set taking two questions from each unit. Static Mathematical Models. Basic Nature of Simulation. Monte Carlo Method. Case studies Simulation Introduction. A Uniform Random Number Generator. Discrete-System based Simulation Languages. Measure of Probability Functions. Comparison of Simulation and Analytical Methods. Steps involved in Simulation Studies. The student has to attempt FIVE questions selecting one question from each unit. Simulation of an Inventory Problem. Expression Based Languages. System Environment. Numerical Computation Technique for Continuous and Discrete Models. Narsingh Deo(PHI) Geoffrey Gordon(PHI) Unit II Unit III Unit IV Unit V References: 1 System Simulation with Digital Computer 2 System Simulation Faculty of Engineering & Technology. Generating Discrete Distributions. Types of System Simulation. Technique of Simulation. Uses and Purposes. Types of Model. Computer Generation of Random Numbers. Stochastic Variables. Haridwar 72 Computer Science & Engineering . Principles used in Modeling Derivation of models from Physical relations. Continuous Probability Functions. GKV. Non-Uniform Continuously Distributed Random Numbers. Dynamic Physical Models.

Haridwar 73 Computer Science & Engineering . GKV.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS751 Language Processor Lab The in charge of lab will decide the programs to be made based on the theory of the subject Faculty of Engineering & Technology.

Haridwar 74 Computer Science & Engineering . GKV.MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS752 Artificial Intelligence Lab The in charge of lab will decide the programs to be made based on the theory of the subject Faculty of Engineering & Technology.

Haridwar 75 Computer Science & Engineering .MM 50 Time 2 Hrs L T P 0 0 2 Sessional 15 Practical 35 Pass Marks 25 ECS753 Visual Programming Lab The in charge of lab will decide the programs to be made based on the theory of the subject Faculty of Engineering & Technology. GKV.

GKV. Faculty of Engineering & Technology.MM 100 Time 3 Hrs L T P 0 0 3 Sessional 30 Practical 70 Pass Marks 50 ECS760 Minor Project and Seminar The student has to take one project and required to present a seminar on it for final evaluation. Haridwar 76 Computer Science & Engineering .

Optimization using Hopfield Networks. G. Undecidability.MM 100 Time 3 Hrs L T P 3 1 0 Sessional 30 Theory 70 Pass Marks 40 ECS801 Artificial Neural Networks & Fuzzy Systems Objective: To impart a knowledge of fundamentals of Fuzzy systems . Union of Fuzzy sets. Prediction Networks. Fuzziness and certainty.l. Conventional set operations. Fuzzy propositions. average of maximum values and centre of maximums.) 2 Introduction to Artificial Neural Systems J.1966 4 Klir. Driankov . Chilukuri K. M.'The Fuzzy Systems Harldbook'. H. application of Neural algorithm Unit II Different faces of imprecision -inexactness. NOTE : Ten questions are to be set taking two questions from each unit.Mohan. Fuzzy compositional rules of inferencethe Min-Max rules implication and fuzzy additive rules of implication.Least square method. Methods of decompositions and defuzzification-composite moments. Fuzziness & imprecision. AP professional Cambridge. composite maximum. Probability & Fuzzy logic. Reintfank: An introduction to Fuzzy Control'. the complement of Fuzzy sets. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Hellendoon . Haridwar 77 Computer Science & Engineering . T. Properties of Fuzzy sets. Ambiguity. Supervised Learning: Single layer networks.1991.Ranka (Penram Int. S. GKV. Multilayer networks. New Delhi. 1994 6 D. Madras. Neural learning.Zurada (JAICO) 3 Zimmermann. Kishan Mehrotra. 'Fuzzy set theory and its applications'. Unit V METHODOLOGY OF FUZZY DESIGN Direct & Indirect methods with single and multiple experts. and Folger. uncertainty and information'.M.1996 Faculty of Engineering & Technology. Narosa Publishing House. New Delhi. Construction from sample data. Allied publishers limited. PHI. Artificial neuron models. H. Adaptive Fuzzy controllers-Membership function tuning using gradient descent References: 1 Elements of Artificial Neural network. Intersections of Fuzzy sets. Unit IV FUZZY REASONING Linguistic variables. Fuzzy representations. Unit III FUZZY SETS AND OPERATIONS Imprecise concepts. Fuzzy sets and crisp sets. Associated Learning. MA 02139. 5 EarlCox.J. Unsupervised Learning.. Fuzzy control and knowledge based systems. 'Fuzzy sets. The student has to attempt FIVE questions selecting one question from each unit. Back propagation algorithm. Unit I Introduction.

Evaluation : Routine progress monitoring of the project will take place by departmental committee. The project Sessional marks to be awarded on the basis of presentation and demonstration by departmental committee. GKV. After that topic should be finalized and a copy of that decision must be submitted to the office of Head of the department within 15 days of notification of Faculty in charge. when complete presentation of project need to be done. Faculty of Engineering & Technology. 75 marks of demonstration and 75 marks of viva-voce. Final examination will take place at the end of eighth semester. The student will be required to submit his Dissertation work till 10th April of the concerned year. Faculty in charge for each student will be notified within one week of start of Seventh Semester. Haridwar 78 Computer Science & Engineering . The report of the work is required to submit in the form of Dissertation. *Sessional 100 from Routine presentation ** Final 250 includes 100 marks of dissertation.MM 350 L T P 0 0 15 Sessional 100* Final 250** Pass Marks 175 ECS860 Major Project The student is required to undergo a project work for which the topic will be decided with mutual concern of faculty in charge (guide) and student.

Algorithm For Shortest Spanning Tree. Cut-sets and Cut Vertices. Counting Labeled and Unlabeled Trees. Chromatic Polynomial. Spanning Trees In A Weighted Graph.MM 100 Time 3 Hrs L T P 3 0 0 Sessional 30 Theory 70 Pass Marks 40 EMA802 Graph Theory NOTE : Ten questions are to be set taking two questions from each unit. Detection of Planarity. Matchings.vertices and separability. Covering and Four Colour Problem.Set Matrix. Thickness and Crossings. Isomorphism. Circuit Matrix. Matrix representation and coloring : Path Matrix. Isolated and Pendant Vertex. Chromatic Partitioning. The student has to attempt FIVE questions selecting one question from each unit. Swamy and K. S. GKV. minimal spanning tree. Pendant Vertices In A Tree. Thulasiraman (Wiley) Faculty of Engineering & Technology. Adjacency Matrix of Digraph. Unit I Introduction: Applications of Graphs. Incidence and Degree. Circuits and Cut-sets: Properties of Trees. Cut. Walks. Rooted and Binary Trees. Directed Path and Connectedness. Haridwar 79 Computer Science & Engineering . Hamiltonian Paths and Circuits. Trees. Digraphs and Binary Relations. Spanning Tree. The Traveling Salesman Problem. Fundamental circuits. Cut. Directed Tree: Arborecence. Geometric Dual. Paths and Circuits. Fundamental Circuits. Algorithms : Shortest path. Connectivity and Separativity Planar Graphs : Combinatorial Vs Geometric Graphs. Directed Graphs. Adjacency Matrix and Their Properties. N. Connectedness and components. Sub Graph. Center of A Tree. Unit II Unit III Unit IV Unit V References: 1 Graph Theory with Applications to Engineering and Computer Science N. Incidence Matrix. Networks and Algorithms M. Isomorphism. 2 Graphs. Euler Graphs. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Paired Comparison and Tournaments. Planar Graph. Deo (PHI). Chromatic Number. Components of A Graph. Kuratowski's Graphs. Finite and Infinite Graphs. Connected and Disconnected Graphs. Fundamental Cut-sets.

Distributed file servers. CAMBRIDGE. cube. finding maximum and minimum elements. associative algorithms such as pattern matching. PM2I.MM 100 Time 3 Hrs L T P 3 0 0 Sessional 30 Theory 70 Pass Marks 40 ECS 802 Parallel Processing NOTE : Ten questions are to be set taking two questions from each unit. servers and example systems such as Grapevine. parallel prefix on a list. linear array. mesh of tree. PEPE. Minsky's conjecture. Butterfly. Introduction to Distributed Network Systems: LAN. finding roots of trees in a forest etc. File server and Example Systems: XEROX. cube. summation of vector components etc.(PHI) 3 Computer Architecture and Parallel Processing Hwang. DOS.List ranking. ELECTRONIC MAIL. linear array. Merge splitting sorting. generalized hypercube. Introduction to Parallel Algorithms : addition on tree. Matrix multiplication on mesh. torus.( MH) Faculty of Engineering & Technology. distributed real time systems. Introduction to Static Networks : tree. The student has to attempt FIVE questions selecting one question from each unit. hypercube. Amdahl'slaw. star. Computational Models : Introduction to PRAM. mesh. Joel M. torus. Unit II Unit III Unit IV Unit V References: 1 Designing Efficient Algorithms for Parallel Computers Quinn. Associative Processing: Examples systems STARAN.(MH) 2. WAN. pyramid. clientserver computing.An Introduction to Distributed and Parallel Computing Crichlow. Bitonic Sorting on PSN. Procedure call mechanism and message passing example: DOS systems such as ACCENT OS and SODS/OS. Haridwar 80 Computer Science & Engineering . Parallel Sorting on linear array. EREW. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. GKV. CRCW. chordal ring. F.A. cube connected cycles. Mesh. and requirement for Bitonic Sorting. CREW. Unit I Introduction to Parallel Processing. PRAM Algorithms . Kai & Briggs. not smaller than search. ring. mesh. Perfect shuffle network ILLIAC-4. NOS. Michael J.

Netware C Interface for Windows. Datagram Communication. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. IPX/SPX implementation of DLL. The student has to attempt FIVE questions selecting one question from each unit. Connection Orientation Communication with SPX. Trivial File Transfer Protocol.MM 100 Time 3 Hrs L T P 3 0 0 Sessional 30 Theory 70 Pass Marks 40 ECS805 Network Programming NOTE : Ten questions are to be set taking two questions from each unit. Unix Domain Protocols. Sending Data over Connections. Remote Login. Socket System Calls. Reserved Ports. Unit I Unit II Unit III Unit IV Unit V Communication Protocol. Network Dependent UNRI() DLL. Ping. Other Window Extensions. API Window Socket and Blocking I/O. Socket Addresses. GKV. (Addison Wesley) Steven. Novell Network Systems. R. Programming Application: Time and Date Routine. Terminations. Novel IPX/SPX: Novel Windows Drivers. (PHI) Faculty of Engineering & Technology. IPX/SPX Procedure. Winsock Programming: Using the Windows Socket. Passing File Descriptor I/O Asynchronous and Multiplexing. Protocol Comparisons. References: 1 Windows Network Programming 2 Unix Network Programming Davis.IPX/SPX for LANs. Berkeley Sockets: Overview. Socket Implementation. UUCP. R. Haridwar 81 Computer Science & Engineering . Internet Protocols. System Network Architecture.

MM 100 Time 3 Hrs L T P 3 0 0

Sessional 30 Theory 70 Pass Marks 40

**ECS 804 Advanced Computer Networks
**

NOTE : Ten questions are to be set taking two questions from each unit. The student has to attempt

FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Unit I Review of reference models- OSI and TCP/IP, layered architecture, layer interfaces, services and protocols, Asynchronous transfer mode, ATM layer mode. Unit II ATM switching- input, output and central queuing, switching fabrics network layer- routing algorithms like shortest path, distance vector routing, link routing, link state routing, multicast routing etc. Unit III Congestion control: Traffic shaping- leaky, bucket, token bucket, choke packets, load shedding, etc. Internetworking: - connection oriented and connectionless, fragmentation Internet architecture and addressing Unit IV The IP protocol, ICMP, ARP, RARP, OSPF, BGP, CIDR, IPv6. Network layer in ATM networks. Routing , traffic shaping and policing. Transport layer-transport service. Quality of Service Unit V Connection Management, addressing. Flow control and buffering. Multiplexing. The Internet transport protocols- TCP and UDP. ATM ALL layer structure and protocols. Session layer: dialog management. Synchronization. Remote procedure call. Presentation layer- data representation , data compression. Networking security and cryptography. Cryptographic protocols. Application layer- DNS, SNMP, TELNET, FTP, TFTP, NFS , Electronic mail, SMTP, USENET news. World Wide Web References: 1 Computer Networks , Andrew S.Tanenbaum (PHI) 2 Computer Networks & Distributed Processing, James Martin(PHI) 3 Data Communications, Prakash C.Gupta 4 Interworking with TCP/IP, Principles, Protocols and Architecture,Douglas E.Comer (PHI)

Faculty of Engineering & Technology, GKV, Haridwar 82

Computer Science & Engineering

MM 100 Time 3 Hrs L T P 3 0 0

Sessional 30 Theory 70 Pass Marks 40

**ECS 806 Management Information System
**

NOTE : Ten questions are to be set taking two questions from each unit. The student has to attempt

FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Unit I Unit II Unit III Unit IV Unit V Introduction to MIS, role of IT in management, business and technology, Trends- personnel productivity and business operations, communications, organizing resources Object oriented design, testing and quality control, operations and transactions, design level, data quality, electronic data interchange Role of accounting, human resources and transaction processing. Databases and spread sheets, Commercial databases and query processing Networks and telecommunications, Internet access, location and security, integration of information, work group integration, dataware house. Decision support system, complex decision using artificial intelligence, Strategic analysis. Designing and maintaining information system, Information system and society. References: 1 Management Information Systems James O,Brien (Galgotia) 2 Information system for modern managers Mudick Robert G.etal (PHI)

Faculty of Engineering & Technology, GKV, Haridwar 83

Computer Science & Engineering

MM 100 Time 3 Hrs L T P 3 0 0

Sessional 30 Theory 70 Pass Marks 40

**ECS 809 Digital Image Processing
**

NOTE : Ten questions are to be set taking two questions from each unit. The student has to attempt

FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Unit I Introduction: Background, Digital Image Representation, Steps in Image Processing, Elements of Digital Image Processing Systems; Digital Image Fundamentals: Elements of Visual perception, A simple Image model, Sampling and Quantization, Basic Relationships between pixels, Imaging Geometry, Photographic film. Image Transforms: Introduction to Fourier Transform, Discrete Fourier Transform, Properties of the Two- Dimensional Fourier Transform, The Fast Fourier Transform, Separable Image Transform, The Hotelling Transform. Image Enhancement: Background, Enhancement by Point Processing, Spatial Filtering, Enhancement in the Frequency Domain, Generation of Spatial Masks from Frequency Domain Specifications, Color Image Processing. Image Restoration: Degradation Model, diagonalisation of Circulate and Block Circulate Matrices, Algebraic Approach to Restoration, Inverse Filtering, Least Mean Square (Wiener) Filter, Constrained Least Squares Restoration, Interactive Restoration; Image Compression: Fundamentals, Image Compression Models, Elements of Information Theory, Error-Free Compression, Lossy Compression, Image Compression Standards. Image Segmentation: Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding, Region-Oriented Segmentation, Use of Motion in Segmentation; Representation and Description: Representation Schemes, Boundary Descriptors, Regional Descriptors, Morphology, Relational Description.

Unit II

Unit III

Unit IV

Unit V

References: 1 Digital Image Processing, Rafael C. Gonzalez and Richard E. Wooks:,(Addison- Wesley) 2 Fundamentals of Digital Image Processing, A.K.Jain (PHI)

Faculty of Engineering & Technology, GKV, Haridwar 84

Computer Science & Engineering

MM 100 Time 3 Hrs L T P 3 0 0

Sessional 30 Theory 70 Pass Marks 40

**ECS807 Multimedia Technology
**

NOTE : Ten questions are to be set taking two questions from each unit. The student has to attempt

FIVE questions selecting one question from each unit. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Unit I Unit II Unit III Unit IV Introduction to multimedia, presentation, storage, information, transmission modes, data streams. Computer representation of sound and audio, MIDI standards, Speech generation, analysis, compression Image capture CCD camera, scanner, digital representation and processing, graphic animation. Vedio from grapher, full motion vedio picture compression, basic compression technique Multimedia operating System, real time systems resource and process management, Multimedia communication and networks, transport and session management, ISDN & ATM quality of service Multimedia databases using relational and object oriented models. Multimedia authoring and user interface, hyper text and hypermedia, integrated document management, Multimedia synchronization, reference model, case studies. Multimedia abstraction libraries, tool kits, web based programming, Application in communication and document services.

Unit V

References: 1 Multimedia Power Tools Peter Jerron and Michael Gosney (Macintosh) 2 Multimedia MAKING IT WORK Tay Vaughan (TMH) 3. Halsall, Fred---Multimedia Communication. 4. Stalling, William---ISDN, Broadband-ATM. 5. Handel, Rainer---ATM Networks, Concepts, Protocol, Applications. 6. Atul Puri, Tsuhan chen---Multimedia Systems Standards & Networks, Marcel Kekker, Inc.-Signal Processing & Communication Sons.

Faculty of Engineering & Technology, GKV, Haridwar 85

Computer Science & Engineering

S. References: 1 Advanced Computer Architecture Hwang K. vector processing in some systems Array Processing: SIMD array processors. case studies of pipelined systems Unit II Vector Processing: Characteristics and requirements. Arithmetic pipelines. Briggs.. binary tree. pipeline control. remedy measures.MM 100 Time 3 Hrs L T P 3 0 0 Sessional 30 Theory 70 Pass Marks 40 ECS 810 Advanced Computer Architecture NOTE : Ten questions are to be set taking two questions from each unit.job sequencing and collision prevention. data dependency hazards. (McGraw Hill) 4 Computer Architecture and Parallel Processing Hwang K. F. hypercube etc.mesh. Haridwar 86 Computer Science & Engineering . SIMD interconnection networks some algorithms for array processing. communications. concurrency. pipelined vector processing. data and control parallelism. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. general MIMD programming languages.(McGraw Hill) Faculty of Engineering & Technology. Unit I Pipelining: principles of linear pipelining. The student has to attempt FIVE questions selecting one question from each unit.( McGraw Hill). Unit III Parallel Processing: Introduction. A modern synthesis Dasgupta. Mapping and scheduling: Embedding of tasks graphs in processor graphs.speedup. scalability. Subrata (John wiley) 3 Introduction to Computer Architecture Stone. synchronization among processes. Unit IV Shared memory and message passing systems. speedup.A. branch handling. languages offering features for data parallelism such as C. load balancing on multicomputers. H. vectorization methods.loosely and tightly coupled systems. PRAM model of parallel computation. Parallel programming languages: creation and programming of parallel processes. Amdahl’s law. parallel algorithms multiprocessors and multicomputers: Processor organizations. dilation and loading. GKV. pipeline chaining. instruction pipelines. FORTRAN 90. 2 Computer Architecture. deterministic and nondeterministic models for static scheduling Unit V Dynamic scheduling: prevention of deadlocks.

GKV. Features Structures. The previous year papers/ model paper can be used as a guideline and the following syllabus should be strictly followed while setting the question paper. Well-formedness Conditions. Local Word Grouping: Introduction. Noun Group. Unit V LFG and Indian Languages: Context Free Grammer(CFG) and Indian Languages. Unit I Introduction to NLP and its Major Goals. Sangal (PHI) Faculty of Engineering & Technology. The student has to attempt FIVE questions selecting one question from each unit. Active Passive. V Chaitanya. Free Word Order and Vibhakti. Preferences over Parses. Natural Language Processing A Paninian Perspective. Strategy for Grammar Development.MM 100 Time 3 Hrs L T P 3 0 0 Sessional 30 Theory 70 Pass Marks 40 ECS807 Natural Language Processing NOTE : Ten questions are to be set taking two questions from each unit. Mathematical Aspects References: 1. Requirement of Computational Grammar. Introduction to Language Structure. Constraint Parser using Integer Programming and Matching and Assignment. Semantics in Stages. Lakshan Charts for Sense Disambiguation. Functional Specification. Overview of LFG. Computational Ascpects. Akshar Bharti. Control. Core Parser. Unit IV Machine Translation: Survey. Unit II Words and their Analyzer: Introduction. Morphological Generation and Analysis using Paradigms. Handling Wh-movement in Questions. Lexicalized Tree Substitution Grammar. Semantic Model. Overview of Language Analyzer. LFG Formalism. Haridwar 87 Computer Science & Engineering . Morphological Analysis. Tree Adjoining Grammar(TAG): Lexicalized Grammar and Locality. Unit III Paninian Grammar: Introduction. Lexicalized Tree Adjoining Grammar. Paninian Theory. Verb Group. R. Lexical Functional Grammar(LFG): Introduction. Paninian Parser: Introduction. Language Accessor.

- Advanced applications of hyperspectral imaging technology for food quality and safety analysis and assesment_parte 1.pdfby Karold Ragner Montejo Garcia

- Rgpv 1st Year (Sy) 1st & 2nd Sem
- Civil II 2013R anna university
- syllabus
- CUSAT EC I & II Sem Syllabus
- LED akademi
- Abstract
- Characteristic of an LED
- SRIM 09
- What Especially Is Kapton Film_
- ENG352 Manual Final
- Main Project Solar Final
- ajay
- IEEE Robotics
- BEE_NPTEL_notes
- C14-21
- Silabo Motores India Pune University India.docx
- wind_paper.pdfBBB
- Ex5308-AlexandraThedeby-HeatingAndCoolingWithSolarPoweredPeltierElements...
- Advanced applications of hyperspectral imaging technology for food quality and safety analysis and assesment_parte 1.pdf
- nvn
- Bsc. II Year Sem III & IV 2014-15 Onwards
- Ma Inn
- Verification of Very Strong Soupling in a Semiconductor Optical Microcavity
- In-Situ Thickness Measurement Methods
- DropTesting_BiodegradablePolymers
- 2006-9 IAC Paper
- Architecture-ion Trap Nature 2002
- 123____FLUKE

Are you sure?

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

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

Get the full title to continue

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

scribd