This action might not be possible to undo. Are you sure you want to continue?
3 Engineering Mathematics I (3-2-0)
Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100
Course Objectives: After the completion of this course prospective engineers will be able to apply the concepts of calculus, analytic geometry and vectors in their professional courses. Course Contents: 1. Differential Calculus (15 hrs) Review of sets and functions, limit, continuity and differentiability of functions, higher order derivative, Leibnitz rule and its application, Rolle's theorem, Lagrange's and Cauchy mean value theorems, maxima and minima of a function of a single variable, indeterminate form and L-Hospitals rule, curvature, asymptotes and curve tracing. Integral Calculus (15 hrs) Review of techniques of integration (method of Substitution, integration by parts, special trigonometric forms and rational functions) standard integrals, definition and properties of definite integrals (area, arc length, volume and surfaces areas of revolution), Simpson's rule, trapezoidal rule and use of Popus theorem, moments of inertia and centroid. Analytic Geometry and Vector Algebra (15 hrs) Review of vectors and scalars, resolution of vectors, scalar, scalar and vector product of two and more vectors, vector equation of lines and planes, transformation of axes, parabola, ellipse, hyperbola and polar equation of conics. Textbook: 1. Thomas and Finney, Calculus and Analytic Geometry, Narosa Publishing House, New Delhi. Reference Books: 1. M.B. Singh and B.C. Bajracharya, A Text Book of Vector Analysis, Sukunda Pustak Bhawan, Bhotahity, Kathmandu 2. M.B. Singh and B.C. Bajracharya, Differential Calculus, Sukunda Pustak Bhawan, Bhotahity, Kathmandu 3. Lalji Prasad, Higher Co-ordinate Geometry, Para Mount Publication, Patna-4
CHM 103.4 Chemistry (4-1-2)
Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100
Course Objectives: 1. Analyse chemical behavior of materials 2. Analyse the water quality. 3. Analyse environmental aspects of various elements and compounds. Course Contents: 4. Atomic Structure (10 hrs) Bohr's Theory, Wave particle duality (De Broglie's equation), Hiesenberg uncertainty principle, Wave mechanical model of atom (qualitative concept only), Quantum number, Shape of s,p,d, orbitals. Ionic Equilibria and Electrochemistry (10 hrs) Strong and weak electrolytes, Ostwald dilution law and its limitation, pH and buffer, Electrochemical cell (galvanic cell), Symbolic representation of electrochemical cell, Electrode potential (standard reduction potential) and electrochemical series, Ernst equation, Corrosion. General Inorganic Chemistry (9 hrs) Ionization potential, Electronegativity, Electron affinity, Characteristic properties of S and P block elements, Silicones and silicates, Characteristic properties of transition elements. Chemical Bonding (8 hrs) Ionic, Covalent, Metallic and hydrogen bonds, Valance bond approach, Molecular orbital approach, Hybridization, General introduction of coordination compounds. General Organic Chemistry (11 hrs) Classification and Nomenclature of organic compounds, Inductive effect, Conjugation and Resonance, Hyperconjugation, Enantiomers and Diasteromers (stereoisomerism), Carbocations, Carbanions, Free radicals, Nucleophilic substitution, Electrophilic aromatic substitution, Elimination, Electrophilic and free radical addition reaction. Polymers and Polymerization (5 hrs) Polymers and polymerization, Addition polymerization and condensation polymerization, Thermoplastic polymers and thermosetting polymers, Synthetic fibers.
Environmental Chemistry (7 hrs) Introduction (concept & scope of environmental chemistry, Nomenclature, Enviromental segments, natural cycles of environment), Air pollution, Green house effect and global warming, Ozone hole and choloroflurocarbon (CFC), Water pollution, determination of alkalinity, Total hardness, free chlorine, dissolved oxygen, Chemical oxygen demand and biochemical oxygen demand. Laboratory Work: 1. To determine the alkalinity of given water sample. 2. To determine the hardness of given water sample. 3. To prepare standard buffer solutions using acetic acid and sodium acetate, and to measure the pH of the given unknown solutions by universal indicator. 4. To prepare standard buffer solutions using ammonium hydroxide and ammonium chloride, and to measure the pH of the given unknown solutions by universal indicator 5. To determine the amount of free chlorine in the given water sample. 6. To determine the dissolved oxygen (DO) of river water. 7. To estimate the chemical oxygen demand (COD) of river water. 8. To estimate the carbon monoxide in exhaust. 9. To estimate dust particle in air. Textbooks: 1. J.D. Lee, Concise Inorganic Chemistry, Chapman &Hall, London, 5th edition. 2. Morrison Boyd, Organic Chemistry, Prentice-Hall of India Ltd., New Delhi, 6th edition. 3. S.H. Maron and C.F. Prutton, Principals of Physical Chemistry. 4. Anil K. De, Environmental Chemistry, New age international (L.), Publishers, 3rd edition.
Reference Books: 1. B.S. Bahl, G.D. Tuli & A. Bahl, Essential of Physical Chemistry, S. Chand & Company Ltd., New Delhi, 24th edition. 2. Satya Prakash, Tuli, Basu, Madan, Advanced Inorganic Chemistry, S. Chand & Company Ltd., New Delhi, 16th edition. Bahl and B.S. Bahl, Advanced Organic Chemistry, S. Chand & Company Ltd, New Delhi. 3. V.R. Gowariker, N.V. Viswanathan, J. Sreedhar, Polymer Science, New age international limited, Publishers, New Delhi. 4. G.S. Mishra, Introduction to Polymer Chemistry, New age international limited, Publishers New Delhi 5. Bruce H. Mhan, University Chemistry, Narosa Publishing House, New Delhi. Lab Manual:
1. Mahto, Santosh K., Chemistry Lab Manual, nec publication.
ENG 104.2 Communication Technique (2-2-1)
Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100
Course Objectives: The main objectives of this course are: 1. To develop the ability to deliver technical knowledge orally in English. 2. To be able to comprehend and take notes after listening. 3. To fasten reading skills in technical and non-technical reading materials. 4. To develop summarizing skills in writings. 5. To write reports, letters, description on technical talks, seminar papers, memoranda, application and tender notices. Course Contents: 1. Review of Written English (1 hrs) Sentence structure (identification of sentence or its types and transformation of sentences). 2. Oral Communication and Note Taking (12 hrs) Types of English (Variety levels of English), Technical talk (Environmental Pollution, Construction, Water resources, Impact of computer in modern society, Impact of satellite communication, urban development). Technical Writing Skills (6 hrs) Preparation of short memoranda (Importance-formats), Business letters (Importance-purposes), Preparation of application (Job application-biodata), Description writing (Process, Mechanism, Place etc.), Seminar papers (Conduction of seminar, Preparation of circular, Presenting seminar paper), Preparation of proposals (Importance-types-formats), Preparation of reports (Importance-types-formats) Reading Skills (11 hrs) Comprehension questions and exercises (fro prescribed passages-Freedom, Kinship and the family, Marconi and the invention of Radio, R foundation, The turbo-prop engine, The use and misuse of Science and grief), Outlining or note making from any passages, Precis writing from any passages. Knowledge and Wisdom, Beauty and Custom Laboratory Work: 1. To familiarize the students with the audio-visual equipment. (Overhead projector, slide projector, dictaphone).
Effective Technical Communication. To conduct a meeting. 2. Some general rules of pronunciation. 4. Orient Longman. Writing with a Purpose. Word accent in English. To present a seminar paper.E. 6. To participate in a group discussion. Reporting Technical Information. Mc-Graw Hill 1982. Textbook: 1. To watch the visual cassettes and to get familiarized with the language (follow me – I). V. Narayanaswami. 3. 10. Andrea J. 6 . 2nd Edition. To prepare and practice to face an interview. Oxford University Press. Pearson Education Asia (LPE) ISBN: 8178082810 Reference Books: 1. Addision Wesley. Madras. Houp and T. Boston. Rutherford. 5. Strengthen your writing. 3.2. Attributes of good English. Champa Tickoo & Jaya Sasikumar. Anne Eisenberg. Allyn and Bacon. A handbook of pronunciation of English words (with 90-minute audio cassettes) Communication Skills in English. Bombay. 9.R. 7. Basic Communication Skills for Technology. 8. Pearsall. 5. To watch the visual cassettes and to get familiarized with the language (follow me – II) 4.
Header files and prototyping Arrays and Strings (9 hrs) Introduction to Arrays. 5. else-if and switch statements. break and continue statements. Returning multiple values from functions. Case. Operators Loops and Decisions (5 hrs) Introduction. Pointers and Arrays. String. Do while Loop. Double Indirection. identification of useful programming abstractions or paradigms. The if. Introduction (4 hrs) History of computing and computers. Functions related to the strings. Program Documentation Variables and data types (3 hrs) Constants and variables. Variable Types. 6. Nested Loop. Multidimensional Arrays.CMP 103. Pointer to Arrays 2. Returning a value from a function. the development of formal models of programs. For Loop. Sending a value to a function.3 Programming in C (3-0-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: The object of this course is to acquaint the students with the basic principles of programming and development of software systems. Initializing Arrays. Function related to Graphics Pointers (10 hrs) Pointers definition. the thrust is to identify and clarify concepts that apply in many programming contexts: Course Contents: 1. Pointer and Strings. C libraries. Text editing and file concepts. the verification of programs. using pointers. Variable declaration. While Loop. Pointer Arithmetic. Arguments. 7 . if else. External variables. It encompasses the use of programming systems to achieve specified goals. 3. Functions (6 hrs) Introduction. etc. the formalization of programming language semantics. 4. Traditional and structured programming concept. Macros. Problems analysis. Preprocessor directives. Simple input/output function. flow chart and algorithm. the specification of program.
Nested type Structure.7. The C Programming Language by Kerighan. structures and unions. 8 . Append). Brain and Dennis Ritchie 8. Structure and Unions (5 hrs) Definition of Structure. Creating a file in different modes (Read. Final project of 10 credit hours will be assigned to the students which will help students to put together most of the programming concepts developed in earlier exercises. Textbooks: 1. Write. pointers. Structure and Pointers. Arrays of Structure. functions. Unions Files and File Handling (3 hrs) Operating a file in different modes (Real. A book on C by A1 Kely and Ira Pohl 2. Append) Laboratory: Laboratory work at an initial stage will emphasize on the verification of programming concepts learned in class and use of loops. Write.
single phase energy meter Devices and Machines (16 hrs) Magnetic circuits. Reactive power. and S.terminology. Dependent and independent sources. Network Theory (10 hrs) Circuit concepts (lumped and distributed parameters. Basic Instrumentation (5 hrs) Classification and basic requirements. Equivalent circuit and phasor diagram.3 Basic Electrical Engineering (3-1-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: 1. Average value and RMS or effective value of any type of alternating voltage or current waveform. Dynamometers. Calculations of magnetic circuits. Concept of three phase power and its measurement by two wattmeter method. Advantages of 3-phase system. Phasor algebra. Line and Phase voltages/ current relations. . Analogy with electric circuits. Moving coil and induction type ammeters and voltmeters. Power factor and significance of power factor. Network theorems (Thevenin's Norton's. To analyze electric circuits (A. Kirchhoff's current and voltage laws. Star & delta connected supply and load circuits. Instantaneous power. Circuit elements (RLC) and their characteristics. To work on electrical instrumentation projects.C. 2. Effect of Q-factor in resonance. C). Testing of transformers (O. 3. Hysteresis and eddy-current effects in ferromagnetic materials.C. Concept of a balanced three phase supply. & D. Moving iron. Reactance. tests).C. Ideal and non-ideal sources. passive and active circuits). 3. 4. Constructional features. Steady state response of circuits concept of Admittance. Maximum power transfer) AC Circuit Analysis (14 hrs) Generation of alternating voltage Sinusoidal Functions. 9 2. Linear and non-linear parameters. Bandwidth. Efficiency and regulation. Star-delta transformation. Voltage divider and current divider formula. Superposition. Principle of Operation.ELE 105. Resonance in series and parallel RLC circuits. Nodal Method and Mesh method of network analysis. distinguish and use electrical devices and machines. To operate. Course Contents: 1. Single phase transformers. Average real-power.
Elementary principles of three phase synchronous generator. D. ii. Chand and Company Ltd. 3. Tiwari and A. To verify Kirchhoff's Current Law (KCL) & Kirchhoff's Voltage Law (KVL) 3. To determine efficiency and voltage regulation of a single-phase transformer by direct loading. S. P. Del Toro.. Theraja. Performance and operation. A Text Book of Electrical Technology. Characteristics of motors and generators. 4. brief explanation of armature reaction and communication. A First Course in Electrical Engineering. Machines. Principle of operation.K. 5. Varying the armature voltage with field current held constant armature control. H. 2. Nagrath. i.J. Allahabad. types of excitation. To verify superposition theorem. Starting. Basic Electrical Engineering. Theraja and A. Ltd. Electric Machinery. I. voltage and power across the passive components. To study open circuits and load test on a dc shunt generator (separately excited) i.S.C. Bhimbra. Wheeler and Co. Laboratory Work: 1. B. New Delhi. India. Generation of emf and torque. To study open circuits & short circuits tests on a single phase transformer. India Reference Books: 1. To determine V-I characteristics of a dc shunt generator. New Delhi. Tata McGraw Hill. To determine magnetization characteristics ii. Introduction to single phase induction motor. 10. S. To study the speed control of dc shunt motor by. New Delhi. Prentice Hall of India. Construction features of rotating electric machines. To verify Thevenin's Theorem. 2.L. To measure three phase power by using two wattmeter. 6. Gin Saroor. Principles of Electrical Engineering. 4. To verify maximum power transfer theorem. 9.N. Textbook: 1. V. Ltd. 10 . A. Varying the field current with armature voltage held constant field control.S. Khanna Publishers.Electromechanical energy-conversion principles.. New Delhi. Three phase induction motors. 8. To measure current. Speed control and selection of motors. Characteristics starting and speed control. 7.
3. Pradhan I. Basics of steel and cutting materials. nec Publication. Mechanical Workshop Materials (4 hrs) Introduction to mechanical workshop. To weld required metallic pieces together by using electric arc and gas welding. To turn a cylindrical job piece to prescribed dimension by using lathe machine. Course Manual on Workshop Technology. Important mechanical properties. Power saws. Course Contents: 1. Common non-ferrous metals. To provide surface finish to a metallic piece by using the shaper machine. To make knot & bolt of given size and type 7. To convert a metallic job piece into a prescribed form using mechanical bench tool. Drill presses. 4.5 hrs) Familiarization with Basic Machine Tools (5 hrs) Lathe. To convert a metallic job piece to prescribed dimension by using milling machine. Sheet metal working. Milling machine. Cutting actions and tooling (1.. to given shape and size. 2. 5. Textbook: 1.5 hrs) Filing. screw thread and screw thread cutting Joining Processes Riveting.1 Mechanical Workshop (0-0-3) Evaluation: Sessional Final Total Theory Practical 100 100 Total 100 100 Course Objectives: To provide instructions and practical experience in basic mechanical workshop methods. Shaping Machine and Grinding machines Practical: 1. Brazing. 4. 11 . Soldering. 3. 6.MEC 178. 2.5 hrs) Bench Tools and Basic Hand Operations (1. Welding Introduction to Machine Tools Elements of machine tools. Sawing.5 hrs) (1. To make tray/dust bin/ pen holder or similar item with sheet metal. 6. M. 5. Measurement and Measuring Equipment (1.
American Technical Society. Nelson and H. Porter. 4. Shop Theory. 3rd edition. Anderson and E. Industrial Press. 3. 23rd edition. McGraw-Hill Ryerson. New York. Technology for Machine Tools. Industrial Press. C. 1973.E. 2.W. Machine Shop Operation and Setups. McGraw-Hill 5th edition. Tatro. 1971.A. 5.Reference Books: 1. Jones and Gorton. Lascoe. Oswald. Oberg. Machinery's Handbook. 1942. Machine Shop Practice – Volume II. New York 12 .
Erwin Kreyszig. (revised new edition 1995) Prasad udranalaya. Y. Formation and solution of differential equations. Reference Books: 1. 2. Ordinary Differential Equations (10 hrs) Definition. Linear differential equation of higher order with constant coefficients. Straight line. Double integration in polar form. 13 . 3. Kathmandu. Method of variation of parameters. Chandrika Prasad. partial derivatives. Sphare.R. Series Solution and Special Functions (7 hrs) Solution in series of Second order differential equations with polynomial coefficients. Initial value problems. Cylindrical and spherical coordinate systems. Cylinder and conicoids 2. Separable. Bessel and Legendre equations and their series solutions. 5. Plane. Narosa Publishing House. Bhotahity. differential equations. Bajracharya. Laplace transform so that prospective engineers can use these knowledge in their professional courses. Application to the solution of linear differential equations with constant coefficients. calculus of several variables. Calculus and Analytic Geometry. Course Contents: 1. Sthapit and B. New Delhi. Laplace Transform (8 hrs) Definition and properties of Laplace and inverse Laplace transform. Mathematics for Engineers. extrema of functions of two and three variables. 4. Three Dimensional Geometry. Sukunda Pustak Bhawan. Three Dimensional Geometry (10 hrs) Rectangular. Textbooks: 1. Calculus of Several Variables (10 hrs) Reduction and change of order of integration. Advanced Engineering Mathematics.MTH 121. chain rule and total differentials. Beliavenue. area and volume by double integration. New Delhi. Exact and linear differential equation of first order. properties of Bessels function and Legendre polynomials. Thomas and Finney.C. 3. 1993. Standard equation of cone. Wiley Eastern Limited.3 Engineering Mathematics II (3-2-0) Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100 Course Objectives: The main objectives of this course is to provide the basic knowledge of solid geometry. Fifth edition. Allahabad.
S. Wave speed. 2. 5. Power and intensity. Travelling waves. NIcol prism. Half wave plate. Doppler effect. Plane. Waves in Elastic Media (5 hrs) Mechanical waves. Monochromatic aberration and its removal.4 Physics (4-2-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: The main objectives of this course is to make able: 1. To apply and analyze the Optical properties in different optical systems.2. Cardinal points. Power and intensity. Reflection. Displacement and pressure wave. Standing waves. Shrestha. To apply theory of wave propagation and knowledge of resonance. Simple Harmonic Motion (3 hrs) Equation of linear simple harmonic motion. 3. Full wave plate. Combination of lenses. elliptical and circular polarization. Production and uses of ultrasound. Double refraction. Sunita Prakashan. Optical fibers. To make use of fundamentals of electromagnetic equipment.D. Angular simple harmonic motion and its application in Physical (Bar) pendulum. Geometrical Optics (5 hrs) Review of mirror and thin lens formula. Resonance Sound Waves (6 hrs) Propagation and speed of sound wave. To use the knowledge of basic physics in different engineering fields. Effect of high speed. thin films. double slits. Pant and G. Energy consideration 2. Course Contents: 1. 4. 14 . To apply the theory of simple Harmonic motion in different elastic systems. Malus law. Application of SHM in suspended spring mass system and simple pendulum. Bhotahity. Optical activity and polarimeter. Beats. Chromatic aberration. Types of waves. 4. Reflection and refraction. 5. 3. Kathmandu PHY 102. diffraction grating. velocity of sound from air column method. Refraction and interference. Newton's rings Diffraction (3 hrs) Fraunhoffer diffraction at single slit and double slit. Physical Optics Interference (4 hrs) Coherent sources. G. Integral Calculus and Differential Equations. Polarization (4 hrs) Breuester's law.
Paramagnetism. Magnetic Properties of Matter (2 hrs) Poles. Dipoles. Force between parallel conductor. 11. Travelling waves. 3. Resonance. Waves on transmission line. 5. To find the refractive index of the material (of given prism) using a spectrometer. Magnetism (7 hrs) Magnetic field. Electromagnetic waves. Inductance. Lenz's law. and three magnetic vectors Electromagnetism (11 hrs) LC oscillation.6. 9. 2. Self induction. 4. Waveguide. Faradays law of induction. Flux linkage. 7. Ferromagnetism. Diamagnetism. To determine the value of the acceleration due to gravity (in the lab) and radius of gyration using bar pendulum.C. To determine the specific rotation of sugar solution using half-shade polarimeter. To determine the frequency of A. Maxwell's equation. To find the wavelength of sodium light by measuring the diameters of Newton's rings. Displacement current. To determine the pole strength of bar magnet by neutral point method keeping the magnet vertical. 8. To find the refractive index of the liquid using convex lens by parallax method. Electrical potential. Kirchhoff's law network equation. LR circuit. mains and compare the mass per unit length of two given wires. E and V of dipole. Waves in free space Experiments: 1. Resistance and resistivity. To determine the wavelength of sodium light using a plane diffraction grating. 15 . Textbooks: 8. 6. Biot & Savart's law. 7. Analog to SHM. Three electric vectors. Electricity and Magnetism Current Flow (4 hrs) Current and current density. Gauss's Law. Dielectrics and energy. Capacitance. Ampere's law. Ohm's law. Electromagnetic oscillation. Electrostatics (6 hrs) Electric field. Combination of resistances. Energy. Energy and Energy density in Magnetic field. To determine the Velocity of Sound in air at room temperature with the first resonance air column and two tuning forks. Magnetic force on a current. 10. To find the (low) resistance using Carry Foster Bridge. To find out the refractive index of the liquid using convex lens by parallax method.
Prentice Hall of India Ltd. David Halliday and Robert Resnik. New Delhi.N. Gupta. 3. Griffiths. Introduction to Electrodynamics. S. Reference Books: 1. Fundamental of Magnetism and Electricity. India.M. A. J.C. A Text Book of Optics. Vasudeva. Text Book of Physics. New Delhi.1. D. H.. 4. Poplai for Wiley Eastern Limited. Physics Practical Manual. Verma. 2. H. New Delhi. Subrahmanyam and BrijLal. S Chand and Company Ltd. Concepts of Physics. David J. nec Publication 16 .S.B. Physics I & II .K. Bharati Bhawan (P&D) 2. New Delhi. Surya Publication. Pradhan and S.. Lab Manual: 1. Karki.. Chand and Company Ltd.
proportional division of lines. serpentine. Freehand Technical Lettering Lettering strokes. standard English lettering forms. squares. 4. Techniques of instrument drawing. hyperbolas. proper use of T-squares. scales. drawings of various geometric figures. cycloid and helices (cylindrical and helical). auxiliary equipment and drawing materials. 2. polygons. Dimensioning Fundamentals and Techniques: size and location dimensioning. Doubly-curved and warped surfaces: Sphere. construction of angles. To develop ability of preparing working drawings Course Contents: 1. To draw projections. True length of lines: 17 . involutes. cubical. triangular. Methods of drawing standard curves such as ellipse. and planes in space.1 Engineering Drawing (0-0-5) Evaluation: Sessional Final Total Theory Practical 100 100 Total 100 100 Course Objectives: 1. securing paper. constructions using tangents and circular archs. Parallel lines. 3. triangles. some 50 items. inking pens. torus. triangular and oblique. triangles. hyperboloid.MEC 109. Practices and Techniques (10 hrs) Equipment and metals. paraboloid. compasses. Instrumental Drawing. pencil sharpening. letter proportions. The projection of points. square. truncated. measurement units. Solid geometrical construction: Classification and pictorial representation of solid regular objects such as: prisms. Pyramids: square. oblate ellipsoid. Cones: right and oblique. reducing and enlarging drawings. To develop sketching. uniformity and appearance of letters. Cylinders: right and oblique. conoid. Use of scales. dividers. erasing shields. freehand techniques. spirals. IS conversion. oblique. use of pencils and pens. Applied Geometry (20 hrs) Plane geometrical construction: Bisecting and trisecting lines and angles. inclined and vertical letters and numerals. upper and lower cases. Description of drawing instruments. To draw assembly of machine parts. General dimensioning practices: placement of dimensions aligned and unidirectional recommended practice. Basic Descriptive Geometry Introduction: Application of descriptive geometry principles to the solution of problems involving positioning of objects in three-dimensional space. lettering and drafting skills 2. parabolas. French curves.
18 . Broken section. standard dimensioning practice (IS system). intersection lines of two planes.horizontal. Intersection of a sphere and an oblique plane. True size of dihedral angles. Oblique projection' First and third angle projection. placement of dimension lines and general procedures. Bearing of a line. analysis in three views. Piercing point of a line and a geometric solid. Edge view of a plane. Fundamental techniques: size and location dimensioning. Point view of end view of a line. inclined and oblique lines. Revolved section. Visualizing objects from the given views. Angle between two non-intersecting (skew) lines. Constructing a development using auxiliary views. Development of truncated pyramid and cone. First and third angle projection. Drawing methods and types of auxiliary views. Multi-view Drawings Principal views: Methods for obtaining orthographic views: Projection of lines. 5. True size and shape of plane surfaces. Transition pieces for connecting different shapes. Perpendicular lines. Intersection of two cylinders. Specifying cutting planes for sections. Shortest distance between two skew lines. Development of a sphere. Development of a right or oblique prism. Sectional views Full section view. Dihedral angle between two planes. Shortest distance from a point to a line. Intersection of a cylinder and an oblique plane. True shape of an oblique plane. Projection of curved lines and boundaries. conventional practices. Phantom of hidden section. Auxiliary sectional views. Development and Intersections (10 hrs) Development: General concepts and practical considerations. pyramid and cone. ribs. Representation of holes. Angle between a line and a plane. Orthographic projection. Object orientation and selection of views for best representation. Systems and projection. Projection of curved lines and surfaces. Truelength lines. Intersections: Lines of intersection of geometric surfaces. cylinder. Interpolation of adjacent areas. Oblique projection. First and third angle projection. Intersection of prisms and pyramids. spokes. Machine Drawing (10 hrs) Introduction: production of complete design and assembly drawings. conventions for hidden lines. Auxiliary Views Basic concept and use of auxiliary views. Half section. Intersection of a line and plane. Theory of Projection Drawing (25hrs) Perspective projection drawing. Line of intersection between two planes. Symmetrical and unilateral auxiliary views. 3. Full and hidden lines. angles and plane surfaces. Orthographic drawings: Making an orthographic drawing. holes. Oblique projection. Principal lines of a plane. Axonometric projection. Limit 4. Intersection of a cylinder and cone. Triangulation method for approximately developed surfaces. Removed (detail) sections.
. representation and dimensioning. Engineering Drawing and Graphic Technology. Foster. French. Laboratory Work: Freehand technical lettering and use of drawing instruments. bill of materials. bill of materials. drawing numbers. springs bearings. Reference Books: 1. 2. clearance fit. Freehand sketching and visualization. joints. collars. 8th edition. Sectional views. Dimensioning. Thread and standard machine assembly elements: screw threads: ISO standards.dimensioning: nominal and basic size. Assembly drawings: drawing layout. Fasteners: type and drawing representation. Prentice Hall of India Ltd. machine and assembly drawings. Auxiliary views. Vierck and R. keys. limits of size. Geometrical and Projection drawing. Luzadder.J. C. allowance. Fundamentals of Engineering Drawing. tolerance.J. drawing layout. 19 . basic hole system and shaft systems. McGraw-Hill. 1981. Development and intersections. 1981. Projection and multiview drawings. Descriptive geometry. interference fit.
Varieties of Classes. Mechanisms for Creation and Initialization in C++. Integration of Components. Overloading.CMP 104. reusable Software. Varieties of Polymorphism. This course lays out the principles of objectoriented programming in C++ Programming Language. Polymorphism in Programming languages. Message-Passing Formalism. Classes. Software reusability Polymorphism (7 Hrs. Pure 20 . Stack Versus Heap Storage Allocation. 4. Introduction to Object Oriented Paradigm (8 Hrs.2 Object Oriented Programming in C++ (2-2-4) Evaluation: Sessional Final Total Course Objectives: Theory 30 50 80 Practical 20 20 Total 50 50 100 Object-oriented programming is an approach to thinking about computation and problem solving in Object Oriented Paradigms. Polymorphic Variables.) Encapsulation. Pointers. Message Passing Syntax in C++. Formalize the Interface. and Substitutability. Programming in the Small and Programming in the Large. Components and Behavior. Software Components.Its merit and demerits. Maintenance and Evolution 2. Issues in Creation and Initialization. The basic objective behind this course is: • • • To introduce the fundamentals of C++ programming To present the defensive programming style required by the C/C++ programming language To explore the facilities offered by C++ for object-oriented programming. A Way of Viewing the World-Agents. Inheritance and Substitutability. Implementing Components. Deferred Methods. Subtype. Coping with Complexity: The Nonlinear Behavior of Complexity: Abstraction Mechanisms. Course Contents: 1. Overriding.) 3. Composition and Inheritance. The Course helps the target audience to discover the basic concepts of object-oriented programming in C++. Computation as Simulation. Interface and Implementation.) Object-Oriented Programming as a New Paradigm. Memory recovery. Forms of Inheritance. Inheritance. Inheritance in C++. Case Study: Responsibility-Driven Design. Methods and Messages (8 Hrs. Case Study: The Eight Queen Puzzle in C++. Role of Behavior in OOP. Design the Representation for Components. Inheritance and Software Reusability (7 Hrs. Subclass. Classes and Methods in C++. CRC Cards.) Introduction to Inheritance. Object-Oriented Design: Responsibility Implies Noninterference. The is-a rule and the has-a rule.
Lafore. Eckel. development of small program to the development of fairly complex subroutines. S. 3. Galgotia Publications Ltd. 9.. Laboratory assignments will be offered in groups of two to four for evaluation purpose. Addison – Wesley. early binding and late binding C++ type conversion Exception handling Function templates. T. Object Oriented Programming in Turbo C++. Prentice Hall. Problem Solving with C++ . Pearson Education Asia.Polymorphism. Generic and Templates. the Laboratory Work must cover assignments and exercises from the following areas: 1. AddisonWesley. Pearson Education Asia (LPE). 6. 2nd Edition. India. 2. Data types – control structures. The exercises shall encompass a broad spectrum of real-life and scientific problems. C++ strings.. 10. Second Edition. Lippman. R. Case Study: Container Classes and The Standard Template Library Laboratory Work There shall be 20 exercises in minimum. abstract classes and multiple inheritance Friend functions. Budd. use of " Constant " keyword. 5. An Introduction to Object Oriented Programming. 1998 2. C++ Primer. 2001. 3. Composite data types. Textbooks: 1. Static class members Polymorphism. programs for engineering applications and problem solving situations. Addison Wesley. In general.. W. J. 7. as decided by the faculty. class templates and container classes. ISBN: 81-7808-228-4.The Object of Programming. 1999 2. Polymorphism in C++ and. 4.. Lajoie. 8. functions and scoping rules. friend classes and operator overloading. 2000 21 . ISBN: 81-7808-173-3 Reference Books: 1. 2nd Edition.. B.B. Thinking in C++. pointers and references Classes and data abstraction Inheritance. 3rd Ed. Savitch.
To make able to distinguish the cycles in various engines. Reversible process. Pressure. Processes and cycles. Second Law of thermodynamics (3 hrs) Heat Engines and Refrigerators. Work done in a quasi-equilibrium processes. Properties and state of a substance. Macroscopic vs. Efficiency of a Carnot cycle. Conservation of mass. First law as a rate equation. Entropy (4 hrs) 2. Tables and diagrams of thermodynamic properties Work and Heat (2 hrs) Definition of work. Specific volume. Concept and Definitions (2 hrs) Thermodynamic system. 4. and pumps. Steady state steady flow process. 6.MEC 189. First Law of Thermodynamics (4 hrs) First law for a cycle. Zeroth law of Thermodynamics. Equality of Temperature. Definition of heat. 2. Conservation of mass and the control volume. Second law. Equations of state for a simple compressible substance. microscopic point of view. thermodynamic temperature scale. 5. Properties of a Pure Substance (3 hrs) Vapour liquid solid phase equilibrium in a pure substance. Uniform state uniform flow process. Course Contents: 1. Factors causing irreversibility. First law for control volume. Carnot cycle. Specific heats. Internal energy. To make able to apply laws of thermodynamics in various systems. 3. 22 . 3. Enthalpy. To make able to calculate energy/quantity of heat transfer by conduction and radiation.2 Thermal Science (2-1-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: To provide working knowledge of theories and applications of thermal science 1. First law for a process. Comparison between heat and work.
Brayton cycle. nec Publication. Howell J. 4. Irreversibility. and R. Diesel cycle.O.J. Elements of Heat Transfer. specific volume and temperature 2. 2.. Bajracharya. Entropy of a pure substance.. I965. Bayazitoglu. To measure performance of a small internal combustion engine 5. Overall heat transfer coefficient. 3. IOE. To find out the efficiency of a compressor. Air Standard Cycles: Carnot cycle. 2nd Edition. Sonntag. Principles of Heat Transfer. Fundamentals of Engineering Thermodynamics. Buckius. To measure the heat transfer by thermal radiation. McGraw-Hill Book Company. 23 . Internal combustion engines: Otto cycle. G. Thermal conductivity. F. Concepts of reversibility.7. Newton's laws. To measure the pressure. Van Wylen.R. Kreith. Radioactive exchange between infinite parallel planes. Entropy change in reversible process. One-dimensional steady state heat conduction through a plane and composite wall. Laboratory Manual on Thermodynamics. Wiley Eastern Limited. Mechanism of forced and free convention. Entropy as a property of a system. Pradhan I. Fundamental of Thermodynamics and Heat Transfer.. Inequality of Clausius. 2. The reversible polytopic process for an ideal gas. Necati Ozisik. International Text book Company. Effect of pressure and temperature on Rankine cycle. To measure the performance of a refrigerator / Heat pump Textbooks: 1. Availability Some Power and Refrigeration Cycles (4 hrs) Vapor Power Cycles: Rankine cycle. Nusselt's number. Lab Manual: 1. Thermal resistance and conductance. Conduction: Fourier's law. Heat Transfer (8 hrs) Introduction and application. 8. Nepal Reference Books: 1.R. Fundamentals of Classical Thermodynamics. T. Lost work. Entropy change of an ideal gas. Black and gray bodies. and M. Simple empirical relations for plate and pipe. 1998. Principles of increase of entropy. Prandtl number. Modes of heat transfer. Dimensionless Parameters: Reynold's number. Basic laws of radiation. Scranton Pennsylvania.M. 6. McGrow-Hill Publishers. 1994. 1989. To measure the rate of heat transfer by conduction. 3. New Delhi. Y. and Richard E. Laboratory Work: 1.
Concept of particle and rigid bodies. To apply mechanics in wide range of engineering applications Course Contents: 1. polar moment of inertia. 24 . transmissibility and equivalent forces. equations of equilibrium for various force systems. moment of a force about a point. (2 hrs) 2. 5.3 Applied Mechanics (3-2-0) Evaluation: Sessional Final Total Theory 50 50 80 Practical Total 50 50 100 Course Objectives: 1. resolution of a force into a force and a couple. Introduction (2 hrs) Engineering Mechanics: definition and scope. Tangential and normal components. Kinematics of Particles (6 hrs) Rectilinear motion of particles. To understand Newton's Laws of motion 3. Coefficients of friction and angled of friction.MEC 119. Concept of statics and dynamics. types of forces. line and volume. Radial and transverse components. Distributed Forces (3 hrs) Center of gravity and centroid of area. System of units Forces on Particles and Rigid Bodies (5 hrs) Characteristics of forces. To develop knowledge of mechanical equilibrium 2. 6. Curvilinear motion of particle. simple relative motion Kinetics of Particles (4 hrs) 7. resultant of a system of forces Equations of Equilibrium (3 hrs) The free body diagram. resolution and composition of forces. 3. parallel axis theorem. 4. theory of couples. radius of gyration Friction Forces Laws of friction. Rectangular components of velocity and acceleration. moment of a force about an axis. General equations of equilibrium. Second moment of area.
Motion of mass center. Linear and angular momentum for a system of particles.Newton's second law of motion. Vector Mechanics for Engineers. 2. F. Power and efficiency. Potential energy. kinetic energy of system of particles. linear momentum of a particle. Beer. rotation about fixed axis. 25 .. Energy and Momentum Methods for Particles (5 hrs) Work done by force. principle of impulse and momentum. New Delhi. equation of motion for rigid bodies. McGraw-Hill Book Co. Kinetic energy of a particle. P. General plane motion. Textbooks: 1. Prentice Hall of India. Angular momentum of a particle. D'Alemberts principle. I. and E. System of Particles (5 hrs) Newton's law and system of particles. Equations of motion. kinetic energy of a rigid body in plane motion. Plane Motion of Rigid Bodies (3 hrs) Angular momentum of rigid bodies. constrianed motion on plane Work Energy Principles for Rigid Bodies (3 hrs) Principle of work and energy for rigid bodies. Kinematics of Rigid Bodies (4 hrs) Translation. Work energy principle. Steady stream of particles. Conservation of energy. conservation of energy. Shames. Principle of impulse and momentum for a system of particles. 10.. Dynamic equilibrium. Absolute and relative velocity in plane motion. New York. 9. 11. Conservation of momentum. Motion due to central force and conservation of angular momentum 8. conservation of energy. Johnston. H. USA (Asia Editions).R. Engineering Mechanics. Impulsive motion and impact. work of a couple. 12.
Gradient of a scalar field. 4. Fourier series of the functions of period 2p. Narosa Publishing House.3 Engineering Mathematics III (3-2-0) Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100 Course Objectives: The main objective of this course is to provide the basic concepts of linear algebra. System of linear equation. Surface and volume integral. 1990. Trigonometric series. Directional derivatives. Linear integral. vector calculus. Definition of power series and its interval of convergence. Infinite Series (8 hrs) Definitions of sequence and infinite series. Even and odd functions and their Fourier series.MTH 211. Eigen values and Eigen vectors. Introduction to vector spaces and linear transformation. Thomas and Finney. and their application. Linear Algebra (15 hrs) Review of definition and basic properties of matrices and determinants. Euler's formula. Reference Books: 1. Differentiation and integration of vector function of a scalar variable. 26 . Divergence and curl of a vector field. Rank of a matrix. Vector Calculus (17 hrs) Scalar and vector field. Inverse of a matrix. Calculus and Analytical Geometry. Fourier series of a function having arbitrary period. 2. The necessary condition for convergence of an infinite series. Half range functions. Course Contents: 1. alternating series test. Cramer's rule. infinite and Fourier series which are accepted as basic tools of engineering courses. Stoke's theorem. Expansion of functions using Taylor's and Maclaurin's theorems. Green's theorem. Fourier Series (5 hrs) Periodic function. Test of convergence. 3. New Delhi. Divergence theorem.
Search tree 7. Stack as an ADT. Applications of recursion. Advanced Engineering Mathematics. TOH and Fibonacci sequence. recursion example. 5. Primitive operations in queue Linear and circular queue and their application. Linked lists (5hrs) Definition and link list as an ADT. Queue as an ADT. basic operations in `linked list: node insertion deletion.3 Data Structure and Algorithm (3-1-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: 1.2. Trees (5hrs) Concept and definitions. Chandrika Prasad. post order and in order ) tree height 27 . Introduction to Data Structure (2hrs) Concept of data structure. Abstract date type Implementation of data Structure. 1996. Wiley-Easter Publication. New Delhi. Dynamic implementation. Recursion (4hrs) Principle of recursion. Course Contents: 1. Mathematics for Engineer. insertion and deletion after and before nodes linked stacks and Queues. tree search and insertion /deletions binary tree traversals (preorder . static and dynamic list structure . Enqueue and Dequeue. Queue (3hrs) Definition. The Stack (3hrs) Definition. 3. E. 2. Allahabad. Prasad Mudranalaya. Kreyszig. basic operation in binary tree. 4. To provide fundamental knowledge on date structure designing and implementation for storing information. Priority queue. List (5hrs) Definition . CMP 331. array implementation of lists. POP and PUSH operation. Stack application: Evaluation of Infix Postfix and prefix expressions. 6. Queues as list. 2. To provide the knowledge of various algorithms used in computer science. Comparison between recursion and iteration. 3. Doubly linked lists and its advantages. 1990.
Insertion and selection sort. Graphs (7hrs) Representation and applications . 5.level and depth . 2. Transitive closure . The Huffman algorithm . Tenenbaum Data Structures using C and C++ . Wars hall’s algorithm . Kruskal ‘s and Round Robin algorithms . Exchange sort Bubble and quick sort Merge and Radix sort Shall sort . Balancing algorithm. Graphs traversal and spanning forests . Text Books: 1. Implementation of trees . Dijkstra’s Algorithm . Searching (5hrs) Search technique essential of search. Implementation of linked list: singly and double linked. 10. 4. Implementation of Graphs: Graph traversals. 10. Augenstein and A. Graphs as an ADT . Introduction to Data Structure and Algroithms with C and C++ . B. balanced trees : AVL balanced trees . 8. prentice Hall India . Efficiency comparisons of different search technique. Solutions of TOH and Fibonacci Recursion. Implementations of linear and circular queues. 8. Binary sort. Implementation of merge sort. Implementation of hashing. Divide and conquer algorithm. Implementation of heap. Y Langsam . Heap sort as priority queue Efficiency of sorting big ‘O’ notation . Reference Books: 28 . Sequential search binary search. Sorting (5hrs) Internal and external sort. 9. tree search General search . collision resolution technique .Tree. Tree search . 3. Graphs types . 2. General search tree . 9. Hashing : Hash function and hash tables . MJ . 7.W Rowe .AVL tree Balancing of ALV 6.M . Game tree. Heuristic and Approximate algorithm. Prentice Hall India . Greedy algorithm . Algorithms (5hrs) Deterministic and no-deterministic algorithm. 11. G. Laboratory: There shall be lab exercises based on C or C++ 1. Shortest-path algorithm . Implementation of search: sequential tree and binary. Implementations of stack. Series and Parallel algorithm.
Frequency and temperature effects. Dielectric breakdown. Bratley fundamentals of Algroithms. Dielectric losses.2 Electrical Engineering Materials (2-2-0) Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100 Course Objectives: To provide a basic understanding of the electric and magnetic properties of materials used in electrical and electronics engineering. are discharges. Course Contents: 1. Polarization. Magnetic Materials (5 hrs) Ferromagnetism. Thermionic emission. Frequency and temperature effects. Work function. mica. prentice hall India . Lattice scattering.P. soft magnetic materials. rubber. Theory of Metals (3 hrs) Elementary quantum mechanical ideas. Diffusion coefficient. 2. ferromagnetism. transformer oil. Diffusion of electrons. Dielectric losses. materials such as As. eddy current losses. Cu. Al. The Fermi-Dirac distribution functions. G. Dielectric constant. Einstiein's relationship between mobility and diffusion coefficients. Free electron theory. Mn. Porcelain. PVC. Conduction in Liquid and Gases (2 hrs) Ionic conduction in electrolytes. Tondo. N. Density of states function. R. B. etc. hysteresis loop. Drift velocity of electrons in an electric field. 3. . Ferroelectricity and piezoelectricity.1. The Fermi level at equilibrium. ELE 226. Mean free time between collisions. Nylon. contact potential. electric breakdown.L. Polyethylene. 5. chemical and physical properties of common conduction. Ni29 2. etc. C. para magnetism. 4. Dielectric Materials (4 hrs) Macroscopic effects. Brassard and P. Free Electron Theory of Conduction in Metals (4 hrs) Thermal velocity of electrons at equilibrium. electrical conduction in gases. domain structure. properties of common dielectrics such as glass. Leung. Energy well model of a metal. data structure and program Design in C Prentice hall India .L Kruse. Au. bakelite. Fe-Si alloys.
Materials and Devices for Electrical Engineers and Physicists. 6. Colcaseer Ands. mobility and diffusion coefficients for electrons and holes in semiconductors.Fe alloys. Diehi-Nagle. hared magnetic materials such as carbon steels. generation PN. Femi level of energy at equilibrium. effective densities of states. Introduction to Microelectronic Fabrication-Volume IV. Femi-Dirac distribution function. intrinsic concentration. New York. energy band diagram for a p-n junction. acceptors and donors. Jaeger. energy band diagrams for uniformly-doped and graded p-and n-type materials. Semiconductor Materials Procession (4 hrs) Crystal growing. metal-semiconductor contacts. square loop materials for magnetic memory.A. Addison-Wesley Publishing Company Inc. relaxation oscillators.C. Reference Books: 1. R. contacts. ion implantation. metallization. 7. contact potentials. R. alnico alloys and barium farrites. concepts of lifetime. McGraw-Hill.. the planar process. Semiconducting Materials (8 hrs) Band structure of group iv materials. transport and continuity equations for electrons and holes. 1988. 1985. p-and n-type materials. concepts of diffusion length. doping by solid state diffusion. Energy gap. density of states function. oxidation Photolithography. 30 . hole and electron densities in an intrinsic crystal. ferrites for high frequency transformers. recombination of electrons and holes. 2. group iii and group iv impurities.
Partial fraction expansion. 31 . 4. 6. Response of RLC circuit to sinusoidal inputs. Resonance. Transient and steady-state responses of network to unit step. Time domain behavior from pole-zero locations.ELE 215. Network stability. Initial and final value theorem. Solutions of first and second order system. 2. ramp and sinusoidal forcing functions. Use of software in solving network differential equations. RLC circuit.3 Network Theory (3-1-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: 1. Inverse Laplace transform. Stability and Routh's Criteria. Formulation of circuit differential equations. Operational impedance. Transfer Functions (3 hrs) Transfer functions of network system. Poles and Zeros. RL and RC circuit. Circuit Dynamics (6 hrs) First order RL and RC circuits. To provide the basis for formula and solution of network equations 2. Complete response of RL and RC circuit. Laplace transform of common forcing functions. Review of Network Analysis Mesh and Nodal-pair (2 hrs) Circuit Differential Equations (Formulation and Solutions) (6 hrs) The differential operator. To understand the behavior of network 3. Damping factors and Q-factor. unit impulse. To develop one-port and two port networks with given network functions. Course Contents: 1. Review of Laplace Transform (6 hrs) Definition and properties. Fourier Series and Transform (3 hrs) 3. 5. Complete response (transient and steady state) of first order differential equations with or without initial conditions.
Transient and steady state responses of first order Passive network. Synthesis of one-port network function and verify the responses using oscilloscope. 2. HP. . Two-Port Passive Network (7 hrs) Properties of two-port network. 1. Effects of quality factor on frequency response. Measurement of Harmonic content of a waveform.1 Measurement of step. Properties of RL and RC network. Laboratory: 1. impulse and ramp response of RLC series and parallel network using oscilloscope. Short circuit and Open circuit parameters. 9.2 Measurement of sinusoidal response of RC and RL circuit using oscilloscope. Driving point functions. bandwidth. impulse and ramp response of RC and RL circuit using oscilloscope. 7. concept of ideal and non-ideal LP. Bode plots and its applications. 5. Reciprocity and symmetry. Hybrid parameter.2 Measurement of sinusoidal response of RLC series and parallel network using oscilloscope. and skirt. 2. 1. Transient and Steady state responses of second order Passive network. 4.Evaluation of Fourier coefficients for periodic non-sinusoidal waveform. roll-off.1 Measurement of step. Loss-less network synthesis of LC one-port network.1 Computer the Fourier coefficients of a periodic non-sinusoidal waveform and verify with the harmonic analyzer. Application of Fourier transforms for non-periodic waveforms. Equivalent T and π section representation.2 Elate Bode plots to pole-zero plots of transfer functions. Properties and synthesis of RLC one-port network. 3. Relation and transmission between sets of parameters.1 Amplitude response and phase response of first orders and second orders circuits. 4. 3. Synthesis of two-port LC and RC ladder network based on zero shifting and partial pole removal. 2. Reference Books: 32 8. Frequency Response of Network (4 hrs) Magnitude and phase responses. Half-power point. 6. Properties of resistively terminated loss-les ladder. Synthesis of RL and RC network. BP and BS filters. Conversion of a T network into a network and measurement of network response. Measurement of Frequency responses of first order and second order and second order circuits. One-port Passive Network (8 hrs) Properties of one-port passive network. Fourier Transform. 3. Positive Real Function.
India. A. Graphical analysis method. Current components. Ng. 33 3. Course Contents: 1. current gain. India. Bias compensation. The p-n junction as a diode. amplifier configuration and their expression for voltage gain. C. Wheeler and Company (P) Limited. Characteristics and Applications of Schottky diode.C. Bon-linear circuit analysis. CB. 2. 3. L. To provide a method for analysis of semiconductor devices.3 Electronic Devices (3-1-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: 1. M. Semiconductor diode (9 hrs) Review of conduction in semiconductors. input impedance and output impedance using re model . Analysis using KVL and KCL methods. Zener diode.E. Non-Linear Model (4 hrs) Basic properties of non-linear elements.analysis of transistor amplifier circuit using re model. CE and CC configurations BJT biasing and Thermal Stabilization (2 hrs) Types of biasing. Bias stability. Soni. Electrical Network Theory. Piecewise linear modeling.H.. 5. Avalanche effect. 2. Analytical expression for transistor characteristics. The Small Signal Low Frequency Analysis Model of BJT (8 hrs) Low frequency hybrid model. 4. analysis of a transistor amplifier circuit using hparameters Low frequency re model. Space. ELX 213.1. Theory of p-n junction. Transistor configurations and their hybrid model measurement of h-parameters. To understand the basics and working principles of electronic devices. BJT switching time. Van Valkenburg Network Analysis. tunnel diode. Course in Electrical Circuits Analysis. Diffusion capacitance. Varactor diode and Metal Oxide Varister. 2. Diode switching times. construction.charge of transition region capacitance and its effects. Maximum voltage rating. . The Ebers-Moll equations. 1995. Bi-polar Junction Transistor (BJT) (6 hrs) Construction of a BJT. Gupta. The transistor as an amplifier. Band structure of p-n junction. the effects of temperature in V-I characteristics. Reach-through. and J. K. M. Third Edition Prentice Hall of India. Dhanapat Rai & Sons. thermal runway and stability. Use and application of SPICE in analysis.
Measurement of input and output characteristics of CB. Small signal model and analysis.Millman and Halkias. 7. 8. 5. New York. Rectifier. J. Microelectronics Circuits. V-I characteristics. Measurement of input and output characteristics of nMOS. Electronics Devices and Circuits. Measurement of input and output characteristics of JFET.6.. 6. V-I characteristics. Study of half wave and full wave rectifier circuits. Configuration of JFET. inductor and capacitor filters-section and PI section filters. MN. Clippers. CE and CC configurations. harmonic components. McGraw Hill. Clampers and Rectifiers (6 hrs) Diode clippers and Clampers. 3. S. The Metal Oxide Semiconductor (2 hrs) Construction and types. A generalized FET Amplifier. second edition. Smith.Sedra and KC. transistor configurations and their high frequency model. The High Frequency model of BJT (2 hrs) High frequency model (t-model). 7. small model and analysis. 9. Microelectronic Circuits and Devices. Measurement of characteristics of pn Diode and Zener diode. Measurement of input and output characteristics of CMOS. 2. 2. Reference Books: 1. The Junction Field Effect Transistor (JFET) (6 hrs) Construction and types of JFET. 4. Horenstein. Rinebart and Winston Inc. half wave and full wave. 3. Biasing and load line. ripple factor. Holt. the pinch-off voltage and its importance. Laboratory: 1. high frequency current gain. 34 . Uni-junction transistor. load line and biasing. Familiarization with equipment. Prentice Hall on India. filters.
Tristate logic. practical design steps. Multilevel NAND and NOR circuits. MSI and LSI Components in Combinational Logic Design (5 hrs) 3. gray code. Karnaugh maps up to five variables. Boolean Algebra and Logic Gates (4 hrs) Basic definition. Basic properties and theorem of Boolean algebra. 6. Analysis procedure. Digital and analog system. Introduction (3 hrs) Numerical representation. Parity generation and checking. DeMorgan's Theorem. Binary Arithmetic 1's complement and 9's complements. 2. Universality of NAND and NOR gates. Course Contents: 1. Digital number system. hexadecimal number system and conversions. Combination Logic (4 hrs) Design procedure. Adders and subtractors. Alphanumeric characters. Number System and Codes (6 hrs) Binary to decimal and decimal to binary conversions. 2. 5. Minimum realization. To design a basic digital computer. 4. 35 . Modulo2 system and 2's complement. Simplification of Boolean Function (5 hrs) Venn diagram and test vectors. Code conversion. don't care conditions. Logic gates implementation. Logic gates and truth tables. Instruction codes. Parity method for error detection. To provide basic of logic systems. Binary Coded Decimal (BCD) and hexadecimal codes.3 Logic Circuits (3-1-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: 1.ELX 212. Octal.
Random Access Memory (RAM). Counters and Memory Unit (6 hrs) Registers. Analysis of clocked sequential circuits. M. Synchronous and asynchronous logic. Clock driven sequential circuits 9. Conversion of parallel data into serial format. Digital Design. 9. Reference Books: 1. Generation of timing signal for sequential system. Synchronous and Johnson Counters. Ripple. Design of adder/subtractor 6. 1998. State reduction and assignment. flip-flops and their types.Binary adder and subtractor. 8. Magnitude comparator. Decimal adder. Mano. Mano. Prentice Hall of India 1998. Design of flip-flop 7. Registers. Prentice Hall of India. 5. shift registers. Processor unit. Mano. Status register. Arithmetic Logic Units (6 hrs) Nibble adder. Encodes and decodes 3. 2. Read-only memory (ROM). Design of multiple input circuits. Design of accumulator. M. Adder/ substrata unit. Prentice Hall of India. Design of simple combination circuits. Design of shifter. 3. Digital Logic and Computer Design. generation of codes using registers. Decoder as memory devices. Familiarization with logic gates. Computer System Architecture. 1998. Sequential Logic (6 hrs) Event driven model and state diagram. Design of counter 8. 36 . 2. Multiplexer and demultiplexer. 10. M. Decoder and encoder. Programmable Logic Array (PLA) 7. Master slave flip-flops. JK and T flip-flops. Superposition of registers. Memory decoding. Laboratory Work: 1. Output hazards races. Edge triggered device. Design of arithmetic logic unit. Multiplexer and demultiplexer 4. errorcorrection code.
Fourier analysis of step and delta function. Complex Variables (8 hrs) Review of complex number system. separation of variables. The Laplacian in spherical coordinates and Legend's equation. 5. 4. separation of variable. Course Contents: 1. Partial Differential Equations (10 hrs) The diffusion equation in Cartesian coordinates. To provide basic knowledge of Linear Programming. Single sided and double sided Z-transform and its applications. To study wave and diffusion equations in Cartesian. Taylor series and Laurent series. 4. Ellipsoid. Frequency and phase spectra. The wave equation in Cartesian coordinates. Projection of areas. hyperboloids. Function of a complex variable.MTH 223. Complex integration. Fourier integral and inversion formula. and polar coordinates. Analytical Solid Geometry (4 hrs) Curves in space. and paraboloids. Residues. 2. 2. Properties of Z-transform.3 Engineering Mathematics IV (3-2-0) Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100 Course Objectives: 1. 3. To apply concepts of Fourier and Z-transform in the signal processing. Engineering applications. Taylor series. Tangent line. The Z-Transform (8 hrs) Region of convergence. 37 . the Laplacian in cylindrical coordinates and Bessel's equation. relationship to causality. Convolution 3. To understand complex variable. and tangent plane. The Fourier Integral (8 hrs) Review of Fourier series. cylindrical. Singularities and poles.
K. Advanced Engineering Mathematics. 3. Changing inequalities. 1993. 38 . Kreyszig. 6. New Delhi. A. Praseval's theorem. India Limited. Partial Differential Equations (7 hrs) The simplex method.and the product of transforms. Objective function and constraint conditions. Discrete-Time Control System. India Limited. Wiley-Easter Publication.V. 1990. Oppenheim. E. Discrete-Time Signal Processing. 2. Ogata. Solution of difference equations. Reference Books: 1. Prentice Hall. Prentice Hall. of solution. the conical form. 1990. Inverse of Z-transform. Optimal values of variables.
4. Output device. Measuring instruments. signal conversion (Analog-to. Dynamic parameter. 2.ELE 221. To give knowledge of measurements. Isolation amplifiers principles and essentials of isolation amplifiers. signal conditioning and transmission. bio-physical variable). To develop skills of instrumentation system. 1. Normal distribution. Mechanical. amplifier. Type of signals in instrumentation. performance parameters. Digital-to-analog) 39 2. error. Transducting.digital. voltage and currents). Course Contents: Introduction to Instrumentation System (3 hrs) Components of Instrumentation and their function. Probability of errors. calibrations and error in transducers Signal Conditioning and Processing. Review of Wheat stone. signal amplification. inductance and capacitance bridges. Course Objectives: To provide knowledge of instrumentation. 3. Signal Measurements (12 hrs) Units and standards of measurements. inductive. . input and output characteristics and applications of transducers (resistive. capacitative. 3. Op Amp in instrumentation.3 Instrumentation (3-2-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 1. instrumentation. Applications. and wave shaping. (8 hrs) Importance of signal conditioning. Types. Physical Variables and transducers (12 hrs) Physical variables and their types (Electrical. interference signals and their elimination. Principle of operation. Process. filtering.
1990 3.5. 1998.Wolf and R. Text Book: 1. Data Acquisition Systems (3 hrs) Components of Analog and Digital Data Acquisition System. 1996. India. Error measurements in instrumentation system. Process Instruments and Control Handbooks. 7. Deobelin. Transmission schemes. Student Reference Manual for Electronic Instrumentation Laboratories.S. C. Observation of interference in instrumentation and their remedy. Transmission of signal in different mediums. Dhanpat Rai and Sons.V.K. Tata McGraw Hill. Conversion of physical variables into electrical signal. McGraw Hill.S. and V. 3. 4. Conversion of analog signal into digital and digital into analog signal. Measurement System: Application and Design. S. Cooper. Use of Data Acquisition Systems. Helfrick and W. A. Strip-chart. Modern Electronic Instrumentation and Measurement Techniques. McGraw Hill 1985. X-Y display unit and Plotter. 1992. A Course in Electronic Measurements and Instrumentation. India. Sarma. 1996 Reference Books: 1.D.O. 2. Magnetic data recorders. Sawhney. Signal conditioning using active devices or Op Amp.M. Data transmission system and standards Output Devices (3 hrs) Indication instruments.M. 6. Prentice Hall of India. Considine. Measurement of physical variables using various Bridges. Prentice Hall of India. 40 . E. 4. Mani. G.R. 5. Modern trends in data acquisition system Laboratory: 1. 2.D. A. Rangan. 7. 5. Smith. Instrumentation Devices and Systems. D.F. 6. Data Transmission (4 hrs) Transmission types.
RC coupled amplifiers. 41 . frequency response analysis.ELX 225. expression for voltage gains and current gains. 4. 3. frequency and phase responses. Method of coupling. 2. Low Frequency Transistor Amplifier Circuits (6 hrs) Review of low frequency AC and DC models. Amplifier efficiency. Large Signal Amplifiers (4 hrs) Analysis of large signal model. feedback-amplifiers. Untuned Amplifiers (4 hrs) Classification of amplifiers. input and output impedance for RC coupled amplifier. emitter follower amplifier. Darlington-pair amplifier. Multistage amplifier.3 Electronic Circuits (3-1-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Contents: 1. design of biasing circuits. n-stage cascaded amplifiers. feedback loop stability. choice of configuration in a cascade. gain calculation. feedback configurations. distortion. harmonic distortion. effects of bypass capacitor in frequency response. Feedback Amplifiers (4 hrs) Negative feedback amplifiers. push-pull amplifiers. power dissipation and heat sinks. frequency response of RC stages. tuned power amplifiers. transformer coupled pushpull stages.
integrated voltage regulators for positive and negative output voltages. Antilogarithmic operations. Instrumentation amplifier and its application. 5. Laboratory: 1. Common mode and differential mode gain. Common mode and differential gain. concept of switched mode voltage regulators 6. Astable Multivibrator. Unipolar and Bipolar D/A Converter circuit. 7. 8.Amp) Characteristics and features of Op. proportional to absolute temperature(PTAT) device. Non ideal properties. Clock Pulse Generators. analog multiplier based on log-antilog principles. A/D and D/A conversions (6 hrs) Principle of A to D and D to A Conversion. Flash A/D Converter. (3 hrs) The basic logarithmic Amplifier.. Amp. 6.5. Measurement of characteristic of voltage and current amplifiers with feedback. stability considerations. phase shift oscillator. importance of positive feedback in oscillators circuits. instrumentation amplifier and logarithmic amplifier. 8. Measurement of frequency response of feedback amplifiers. Voltage gain. 3. Successive approximation R-2R ladder Circuit. RMS to dc conversion. Regulated power supplies (4 hrs) Regulated power supplies. 2. Applications of OpAmp in Comparators. Measurement of gain in single stage and multistage amplifiers. Applications. circuit design consideration. Applications. D/A and A/D conversion. Hartley and Colpits oscillator circuits and verify them. Oscillators (5 hrs) Sinusoidal oscillators. Design of RC phase shift. Design and study of characteristics of power amplifiers. 4.Delta A/D Converter. FET OpAmp and High frequency Applications. Sigma. Monostable Multivibrator. Op Amp parameters: Voltage gain. the multifunction converter circuit. Logarithmic Amplifier. Measurement of Regulation in series regulator against change in input voltage and load resistance. design of basic logarithmic amplifier circuit. on ideal properties. Basic concept of voltage controlled oscillators (VCO) Differential Amplifier (2 hrs) Characteristics and features. Circuit design considerations. Wien-Bridge oscillator. tuned LC oscillators. Operational Amplifiers (7 hrs) Fundamentals of Operational Amplifiers (Op. Schmitt Triggers. Characteristic of differential amplifier. Differential and Integrating Circuits. 42 . Extension of range. 10. 9. Integrated Precision Voltage Regulators. 7.
Albert Paul Malvino. Regular expressions. 2 Properties of Regular Sets (4 hrs) The pumping lemma for regular sets. Normal forms. CMP 224. Electronic Devices and Circuit Theory. (4 hrs) 3 4 5 Properties of Context-free languages (CFL) (6 hrs) The pumping lemma for CFL's Closure properties of CFL's. Theodore F. New York. context free language. Universal Book Stall. References 1. Closure properties of regular sets. Chruch's hypothesis. and complexity theory. Tata McGraw Hill. Holt. India 4. 2. Course Contents: 1 Finite Automata and Regular Expression (5 hrs) Finite state system.. 2.3 Theory of Computation (3-1-0) Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100 Course Objectives: To provide the knowledge of automate. Robert Boylestad & Louis Nashelsky. Simplification of context.fee grammars. Sedra and K. India.1. Smith. Pushdown Automata Pushdown automata and context-free grammars. Decision algorithms for CFL's. Electronic Devices and Circuits. Non-deterministic finite automata. Electronic Devices and Circuits. Prentice-Hall. Electronic Devices and Circuits.C. India. S. Prentice-Hall. Allen Mottershead. Context-free Grammars (8 hrs) Derivative trees. 43 6 (5 hrs) . Turing Machines Computable languages and functions. Rinehart and Inc. India. Bogart. Halkias. Electronic Principles. Text Books: Jacob Millman & Christos C. Decision algorithms for regular sets. Microelectronic Circuits. Tata McGraw Hill. India 3.
Register. write and out instruction.H Papadimitriou. Element of the Theory of Computation. indirect read. Academic Press. Recursive function theory Computational Complexity Theory Intractable Problems Computable languages and functions. addressing modes. stack and implied. RTL description of data transfer instructions. Functional Architecture of 8085.R Lewis. Instruction and machine cycle. 3 E. Direct. 8 Bit Microprocessor and Programming: (12 hrs) 8085 Pin configurations. Description of microprocessor architecture and Applications 2. Introduction to the Theory of Computation. absolute. 2 H. Engeler. Course Objectives: To understand the basic operation. RTL description of other instruction. Introduction: (6 hrs) Evolution of microprocessor.7 Undecidability (5 hrs) Properties of recursive and recursively languages. RTL description of logical instruction. indirect. Eastern Economy Edition. 16 Microprocessor and Assembly language Programming (15 hrs) 3. immediate. Calculator and stored program computer. To build a foundation for the microprocessor based system design.3 Microprocessors (3-1-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 1. McNaughton. timing diagram for register move. 2. fetch and execution overlap. Course Contents: 1. NP-complete problems. (4 hrs) (4 hrs) 8 9 References Book: 1 R. RTL description of branching instruction.Register transfer language. programming and application of microprocessor. Universal Turing machines and undecidable problem. fetch and execution cycle. Pretice Hall of India. ELX226. Prentice Hall of India. and C. Von Neumann and Harvard architecture. Formal languages and Automata. 44 . RTL description of arithmetic instructions. Elementary Computability.
miscible and non-miscible interrupts. 6. and Int 21h. A. Assembly instructions format. Data transfer wait interface. Prentice Hall 2. Microprocessor Architecture. 4. Mnemonics and operands. 0000 to 8085 Introduction to 8085 Microprocessor for Engineers and Scientists. Int 10h. Assembly language programming. using any type of Assembler. Programming and Interface. Gaonkar. input service routine requirements. Parallel communication. Int 21h and functions. 4. Traps and exceptions. Input/Output Interfaces: (5 hrs) Serial communication. Macro Assembler. SRAM and ROM interface requirements. Registers. Kip Irvine. 7. synchronous and Asynchronous data bus. bus timing. which should include the different functions of Int 10h. Prientice Hall 45 . Text Books: 1. Linking and assembler directives. modes. (2 hrs) 1. Introduction to advanced Microprocessor architecture: Introduction of RISC and CISC. Laboratory Works: 5. Maxwell Macmillan Reference Books: 1. Assembly language for the IBM PC. software interrupts. Program should comprise the use of all types of instructions and addressing The programming should include the concept of Arrays and the concept of Multiplications and Division operations on Microprocessor. Bus Structure and Memory Devices: (5 hrs) Bus structure. vectored. interrupts in parallel and serial interfaces. ROM. 2. RS -232 and IEE 488 -1978 general-purpose interface standard Interrupt: (5 hrs) Interrupt and vector descriptor table. Penram International 2. 3. Ramesh S. interrupt priority. Addressing Modes. Programming and Applications with 8085. The Intel Microprocessors 8086/8088………Pentium and Pentium Pro Architecture. K.Architecture of 16-bit microprocessor. Electrically programmable memory (EPROM) an electrically erasable and programmable Memory (EEPROM). chained and polled interrupts structures. static and dynamic RAM. Assembly language program using 8085 microprocessor kit. Programmable read only memory (PROM). address bus. Gosh.
Numerical Differentiation and Integration (5 hrs) Newton's differentiation formulas. solution of ordinary and partial differential equations related to engineering problems. Interpolation and Approximation (8 hrs) Lagrange's polynomials. Bisection method. 46 . Secant method and their convergence. 3. Newton's interpolation using difference and divided differences. Fixed point iteration and is convergence. Newton-Cote's quadrature formulas.3 Numerical Methods (3-1-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: To be familiar with the theory of numerical analysis for solving algebraic and transcendental equations. Solution of Nonlinear Equations (10 hrs) Review of calculus and Taylor's theorem.MTH 317. Maxima and minima of tabulated function. Romberg integration formulas. 2. Cubic spline interpolation. numerical differentiation and integration. Gaussian integration algorithm. Trial and error method. Newton's method. Errors in numerical calculations. Least squares method for linear and nonlinear data. Course Contents: 1.
W. Dolittle algorithm. Applied Numerical Analysis. 1st Edition. Solution of Linear Algebraic Equations (10 hrs) Review of the existence of solutions and properties of matrices. Inverse of matrix using Gauss elimination method. Iterative solutions. 47 . Gaussian elimination method. Szidarovszky. RungeKutta methods. 1985 2. Cambridge Press. 2nd edition.F. Linear algebraic equations. Solution of Partial Differential Equations (5 hrs) Review of partial differential equations. Gauss-Jordan method. Pivoting. B. C. Heun's method.O. 2nd Edition. An Introduction to Numerical Computations. 1998. Initial value problem. S. al. New York Reference Books: 1. Solution of Ordinary Differential Equations (7 hrs) Review of differential equations. Taylor series method. Gerald and P. Numerical Recipes in C. Brooks/Cole Publishing Co. W. Boundary value problems. 3. Yakwitz and F. Laboratory: The laboratory experiments will consist of program development and testing of non-linear equations. Laplacian equation and Poisson's equation. Press. Wheatley.. New York. Macmillan Publishing Co.H. Solution of the higher order equations. Textbook: 1. Solving eigen value problems using power method. Euler's method and its accuracy. Interpolation.. 4th Edition. ill-conditioning. Picard's method. Kinciad. Flannery et. 6. Cholesky's factorization.. Numerical integration and differentiation. 5.P. ordinary and partial differential equations. Shooting method and its algorithm. Engineering examples. Method of factorization. Chency and D. Deriving difference equations.4. Addison Wesley Publishing Company. Numerical Mathematics and Computing.
EEPROM Programming Programmable Peripheral Interface (8255 A) Introduction to 8255 A. and Memory. 1. Interrupts. Programmable Interval Timer (8253) (3 hrs) Introduction to 8253 and difference between 8253 and 8254. Programming. Addressing Modes. Functional Block Diagram. (4 hrs) . Different Modes of Operations (4 hrs) 3.3 Microprocessor System and Interfacing (3-1-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Objectives: This courses focus on the designing of different systems using Microcontroller and Microprocessors. Memory Management. Different Modes of Operation Interrupts 48 5. Internal Architecture.ELX 351. 2. I/0 Memory Mapping (3 hrs) Microcontroller (10 hrs) Introduction to Microcontroller and its Applications. Memory Mapping. Besides it extends the designing of circuits on Printed Circuit Board and various ways of data transmission schemes. Functional Block Diagram. 4. Address Decoding I/O Mapping. Interface with External Device.
Reset and power failure detection. Simple data transfer using PPI 3. Detection of faults. Probramming of 8259 Serial and Parallel Data communications (3 hrs) Serial Data communication. 5. Reliability. 8. Hall. Assembly language programming 2. "Microprocessor and Interfacing programming and hardware". Printer Port Connections Circuit Design and Layout (6 hrs) Converting requirements into design.R. noise coupling mechanism and prevention. 10. NewYork Oxford. Zero Modem connectioris. Examples of Varions ISR 6. 9. Assembly Language program and Interrupt Procedure Hardware interrupts and Applications. Functional Block Diagram. Redundant Architecture. fault tolerance. Tata McGraw Hill. lnterfacing of A/D converter using Printer port 7. New Delhi 2. 49 . Interfacing of A/D converter using PPI . Impedance matching. PCB design and development. Parallel Data communications. Oxford University Press.Interrupt Vector Tables. Programmable Interrut Controller (8259) (3 hrs) Introduction to 8259. RS-232 serial data standard and interface. isolators and transient suppressors Laboratory Exercises: The laboratory exercises deal with 8-bit or 12-bit A/D and D/A converters and communication with PC to PC using RS-232 port. K. Interfacing of A/D using Micro controller 6. "Electronic Instrument Design". and high speed design.V. Timing. Interfacing with the PC ISA Expansion BUS. D. Line filters. Grounding and shielding (6 hrs) Outline for grounding and shielding. l. Noise. PCI BUS (4 hrs) 7. There will be six exercises related with instrumentation. Different kinds of shielding mechanism. Handshake transfer using PPI 4. Types of Interrupts. Filtering and smoothing. Writing an interrupt Service Routine References: l. Protecting against electrostatic discharge. Demonstration of other interfacing techniques and devices 8. Fowler. Operations of Interrupt. Standard data bus and networks. Single point grounding and grouped loop.
Preemptable and 50 2. Client-Server and Evolution of Operating Systems: User driven. Critical Regions and conditions.3 Operating System (3-0-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 1. Definition of Process. Processes and Threads (12 hrs) Process Concepts: Introduction. off-line batch system. Dekker’s Algorithm. Parallel Processing. Duebelin. Deadlock and Indefinite Postponement: Introduction. To familiarize with the feature controlling of modern operating system. Peterson’s Algorithm. multiprocessor systems. files. Course objectives: To provide the basics of operating systems. "Measurement system application and design" Tata McGraw Hill. online timesharing system. Concurrent Process: Introduction. . system calls. Process states and transition. Operating System concepts: Processes. multi-computer/distributed systems. Message Passing. Virtual Machines. producer and consumer problem. Layered. monitors. 4. Locks.3. 1. IPC(Inter-Process Communication). E. Mutual Exclusion . 2. PCB (Process Control Block). simple batch system.O. Mutual Exclusion Primitives and Implementation. New Delhi Linear circuit data book dealing with A/D and D/A converters CMP 332. Real time Operating Systems. security and Operating System structure: Monolithic systems. directly coupled offline system. multi-programmed spooling system. operator driven. shell. Course Contents: Principles of Operation Systems (4 hrs) Introduction. Classical IPC problems. TSL (test and set lock).
variable partition multiprogramming. file attributes. Segmentation. Goals of I/O software. Principles of I/O hardware: I/O devices. Scheduling techniques: Priority scheduling. Distributed Operating Systems (5 hrs) 4. Scheduling objectives and criteria. file access. Direct mapping. WS Clock Page Replacement algorithm. file operations. memorymapped I/O. storage organization and hierarchy. Block mapping. Preemptive versus No preemptive Scheduling. ACL (Access Control List). RAID (Redundant Array of Inexpensive Disks) File Systems (3 hrs) File naming. Round Robin Scheduling.Nonpreemptable Resources. device drivers. DMA (Direct Memory Access). Policy versus Mechanism in Scheduling. Page tables. File system implementation. Quantum size. disk arm scheduling algorithms. thread usage. file types. First level interrupt handling. TLB(Translation Look aside Buffers). contiguous versus noncontiguous storage allocation. Second Chance Page Replacement algorithm. Context switching (Kernel mode and User mode). Shortest-Job-First(SJF) Scheduling. Page Fault. implementation of pure segmentation. 3. Multilevel Feedback Queues. Disk. logical and physical memory. advantages of threads. 7. deadlock prevention. Paging. Starvation. Working Set Page Replacement algorithm. Kernel implementation of processes Scheduling (4hrs) Introduction: Scheduling levels. file structure. disk hardware. fragmentation. Character User Interface and Graphical User Interface. . First-In-First-Out scheduling. sharing. security and Multi-media files. Clock Page Replacement algorithm. Kernel (2 hrs) Introduction. Shortest-Remaining-Time(SRT) scheduling. deadlock detection and recovery. First-In-First-Out algorithm. linked list allocation. I-nodes. Access Control Matrix. File descriptor. fixed partition multiprogramming. deadlock avoidance. Directories and directory hierarchy. deadlock modeling. 5. device independent I/O software. Memory Management (6 hrs) Introduction. Virtual Memory: Introduction. contiguous allocation. Segmentation with Paging. Least Recently Used Replacement algorithm. deadline scheduling. device controllers. Coalescing and Compaction. Principles of I/O software: Polled I/O versus Interrupt driven I/O. Optimal Page Replacement algorithm. Page Replacement algorithms. 6. Input/Output (3 hrs) Introduction. Conditions for deadlock. Highest-ResponseRation-Next(HRN) scheduling. thread model. Threads: Introduction. 51 . 8. Not Recently Used Page Replacement algorithm. relocation and protection.
RPC (Remote Procedure Call). Inter-process Communication Shell management in UNIX/LINUX and Shell programming Memory management in UNIX/LINUX Resource management 8. Communication in distributed systems. Networking. Prentice hall India. 5. Network architecture. 3. multiprocessing feature. 6. Pipelining. Sockets. An Introduction to Operating System. Laboratory: Housekeeping in DOS and Windows. Operating systems. Stallings. Design and Implementation. Second Edition. 7. Prentice hall India. Addison Wesley Reference Books: A.M. 2. Memory management. Device Programming Text Books: 1. Case Studies (6 hrs) DOS Operating System: System configurations. 1. Processes and Processors in distributed System. Goals. ATM (Asynchronous Transfer Mode). W. Window 2000: File System and disk management. Tanenbaum. scheduling in distributed system.S. taxonomy of MIMD computer system. Memory and I/O management in DOS and Windows Housekeeping in UNIX/LINUX 4. 52 . Graphical capabilities. Prentice hall India. Memory management. Tanenbaum. Operating Systems. Filters. Shell. 1. Group Communication. 2. H. 2.Introduction. hardware and software concepts. A. Client-Server Model. Modern Operating System. Clock synchronization. Dietel. Filing and disk management.S. Networking feature. Security. Unix/Linux Operating System: File systems and disk management.
CMP 364.3 Computer Graphics (3-1-3)
Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100
Course Objectives: To be familiar with the basic techniques used in computer graphics systems. Course Contents: 1 Introduction History of computer graphics, Applications of computer graphics. 2 (3 hrs)
Hardware Concepts (8 hrs) Keyboard, mouse, light pen, touch screen and tablet input hardware, Raster and vector display architecture, Architecture of simple non-graphical display terminals, Architecture of graphical display terminals including frame buffer and color manipulation techniques, Advanced raster graphic architecture. Two-Dimensional Algorithms (12 hrs) Direct and incremental line drawing algorithms, Bresenham algorithms, Twodimensional object to screen viewing transforms, Two-dimensional rotation, scaling and translation transforms, Recent transform concepts and advantages, Data structure concepts and CAP packages. Graphical Languages (6 hrs)
Need for machine independent graphical languages, Discussion of available languages and file formats, Detailed discussion of graphical languages to be used in projects. 5 Three-Dimensional Graphics (12 hrs) Three- dimensional object to screen perspective viewing transforms, Extension of two-dimensional transforms to three dimensions, Methods of generating nonplanar surfaces, Hidden line and hidden surface removal techniques, Need for shading in data visualization, Algorithms to simulate ambient, diffuse and specular reflections, Constant, Gouraud and Phong shading models, Specialized and future three dimensional display architectures. Project Development (4 hrs) Project planning and description, project development, Project report and presentation.
Develop a graphical project. The topic could be either initiated by the student or selected form a list provided by the instructor. An oral presentation with a demonstration should be part of the laboratory project report.
1 Hearn and Baker, Computer Graphics, Prentice- Hall of India Private Limited.
ELX 353.3 Integrated Digital Electronics (3-1-2)
Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100
Course Objectives: To study different types of Logic Gates, Memory and Switching Systems Course Contents: 1. Review of BJT and MOS (2 hrs) BJT and MOS transistor operation details, BJT inverter: Voltage transfer characteristics Noise margins and Fan out/Fan in calculation 2. Resistor-Transistor Logic (RTL) and Integrated-Injection Logic (IIL) (4 hrs) Resistor-Transistor Logic (RTL) Gate and Direct-Coupled TransistorLogic(DCTL) Gate Fan-out, Propagation Delay, and Input-Output Voltage Characteristic of Cascaded RTL Gates, RTL Buffer, RTL EX-OR Gate, and Manufacture's Specifications, Physical layout of IIL, IIL Decoder. Diode- Transistor Logic (DTL) (3 hrs) Diode-Transistor Logic (DTL), Fan-out, Input-Output Voltage Characteristic and Manufacturer's Specifications, High Threshold Logic (HTL), Input-Output Characteristic of the HTL Gate
Transistor-Transistor Logic (TTL) (5 hrs) The Input Transistor and Active Pull-up, Fan-out Noise Margin, and Input-Output Characteristics, Temperature Dependence and Noise Immunity, Power dissipations and propagation delay time, high speed TTL, Open collector configuration, Try state logic, Comparison between TTL and DTL. Emitter-Couple Logic (ECL) (4 hrs) ECL Gate, ECL-Transfer characteristic, OR and NOR Gates, Fan-out Speed of Operation, and Manufacturer's Specifications, Level Translation and ECL-Gate Interconnections with TTL. NMOS and CMOS Logic (6 hrs) Analytic Equations for MOSFETS, Speed calculations, Propagation delays, Power dissipation, Fan out, Noise margin and Transfer characteristic. Comparison of Logic Families Interfacing TTL and CMOS, Comparisons between logic families (2 hrs)
Memories (6 hrs) Random Access Memory (RAM) : BJT RAMs and MOS RAMs, Dynamic Random Access Memory (DRAM), Read-only Memory (ROM), Electrically Erasable and Programmable Read only Memory (EEPROM), Charged Coupled Device(CCD), Storage of Charge and Transfer of Charge, Comparison of different memory types. Switches (5 hrs) Diode Transmission Gates, Bipolar Junction Transistor Gates FET Gates and FET Gate with an Op- Amp Load, FET Gate Drivers, CMOS Gates, Application of Switches. VHDL (8 hrs) Background and basic concepts, structural specification of hardware and design organization, VHDL realization of basic digital circuits such as binary adder, multiplier, decoder, multiplexer, counters, sequence detectors
1 2 3 4 5 6 7
Laboratory: RTL and DTL and Modified DTL gates Bipolar transistor logic gates. NMOS logic gates. CMOS logic gates. Bipolar transistor switching. CMOS transistor switching. ECL: Realization of OR/NOR gate using discrete component
TTL- ECL interfacing Simulation of Various digital system using VHDL Text Books: 1 Taub. H and Schilling D. Digital Integrated Electronics, Tata McGraw Hill Company. 2 D.A Hodges and H.G Jackson, Analysis and Design of Digital Integrated Circuits, Tata McGraw-Hill. 3 Mano, M.Morris, Digital Logic and Computer Design, Prentice Hall
MTH 212.3 Probability and Statistics (3-2-0)
Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100
Course Objective: The main objective of this course is to provide basic concepts of probability a statistics. After completing this course, the student would be able to understand variables, probability distribution, point estimation and hypothesis testing and will be able to solve simple linear regression and correlation. Course Contents: 1. Introduction and Descriptive Statistics (5 hrs) Introduction, scope and limitation of statistics, Presentation and classification data-frequency distribution, Histogram, Pictorial and diagrammatic method Measures of central tendency and location-mean, median, quartiles and percentiles, Measures, of dispersion (variability) –Range, quartile deviation, Deviation, Standard deviation and coefficient of variation. 2. Probability (5 hrs)
Random experiment, sample space, event and types of events, counting rule various approaches to probability, laws of probability-additive, Multiplicative, conditional-probability and independence, Baye’s theorem.
B. Types of hypothesis. Function cumulative distribution functions. confidence interval for a population mean (small and large sample cases) 4. J. Speaman’s rank correlation coefficient Text Book: 1. probability and Statistics for Engineers. Acceptance and critical regions. paired t-test. 57 . Simple Linear Regression and Correlation (5 hrs) Simple linear probabilistic model principle of least squares method estimating [beta] and [beta1] coefficients-inferences about [beta1] coefficient. Concept and uses of standard error. Hypothesis Testing Based on Two Samples (2 hrs) Confidence interval for a population. Expected values of continuous random variables. Sums and average of random variables. 2.L. R2). New Delhi. Conditional probability function (discrete and continuous cases)..3. Beta and normal distribution. Prentic Hall of Indian Private Ltd. Sayami. Expectation and laws expectation. S. Kathmandu. Sum and Product. 1999. Sing. Negative exponential. Simple correlation. Johnson. Test for single proportion and difference of two proportions. 1997. Bivariate Random Variables and Joint Probability Distribution (3 hrs) Joint probability distribution. Richard A.Y and the prediction of future values. 6. Kathmandu. 5th Edition. 5. Hyper Geometric and negative binomial. : Statistical Methods (for all gratitude level students). Random Variable and Probability Distribution (12 hrs) Discrete random variable. Poisson. Criteria of good estimator Testing of Hypothesis (10 hrs) Concept of hypothesis. Sing publication. Level of significance. : Manual on Statistics Nepal Engineering College. Concept of point estimation. 8. The central limit theorem. procedure of testing of hypothesis. Probability density. continuous random variable. test for single mean of a population and difference of two population means. Marginal probability function. discrete probability distribution. Hypothesis testing procedures based on small samples ttest for mean for a normal population. Hypothesis testing procedure based on large samples (Z-test).M. Gamma. Point Estimation (3 hrs) Population and sample. Probability mass function. continuous probability distributionrectangular. inferences concerning muX. 1994 Reference Books: 1. types of errors. 7. t-test for the difference of mean of two normal populations. M. Parameter and statistic. Test of reliability of the fitted regression equation (coefficient of determination.
CMP 381. Statistics. Mathematical models: nature and assumptions. examples. Discrete System Simulation (10 hrs) 3 58 .3. Differential equation.3 Simulation and Modeling (3-1-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objective: To provide the knowledge of discrete and continuous system. Calibration and validation. Monte Carlo simulation method. 2 Continuous Systems (8 hrs) Continuous system model. Harry and Steven C. Cambridge University Press. Brools/Core publication Company. 5. David. analysis of simulation output and simulation output and simulation languages Course Objective: 1 Introduction to Modeling and Simulation (5 hrs) System concepts. 4. Digital-analog simulators. Hybrid computers. Monetery. 1996. Althoen. Jay L. Analog method. Hybrid simulation. California. Cambridge University Press. Stirzaker. generation of random variables. 1995. System modeling. Frank. Continuous System Simulation Languages (CSSLs). 1982. Probability and Statistics for Engineering and the Sciences. Devore. CSMP III. Elementary Probability. Feedback systems.
Feedback systems : typical applications. Data Communication Terminology. Data Transmission: (3 hrs) 59 . Perry. Elimination of internal bias. Delay calls. 2 To understand the basics of communication signals.D. Structural data and control statements. Simulation run statistics.M Law and R. Standards Organizations. Kelton. Simulation : A Problem-solving approach. CMM362.C Vansteenkiste. Recording distribution and transit times. 5 Laboratory: Develop a simulation model. Counters and summary statistics. Resources in GPSS. Discrete simulation languages. Pretice Hall of India. 3 To understand the requirements to get two computers exchange data.1991. Analog and Digital Data Transmission. Replication of runs. McGraw Hill. Course Contents: 1. An oral presentation with a demonstration should be part of the laboratory project report.A Spriest and G. 4 Analysis of Simulation Output (10 hrs) Estimation methods. Addison Wesley Publishing Company. Representation of time. Simulation Languages (12 hrs) Types of simulation languages.Discrete events. the topic could be either initiated by the student or selected from a list provided by the instructor. Simulation of programming tasks. Reference Books: 1 2 3 4 J. Academic Press. Applications 2. Generation of arrival patterns.M Law and W. applications. Discrete systems modeling and simulation with GYPSS. GPSS programs. G. hybrid simulation.F. A. Computer-Aided Modeling and Simulation. Simulation of a telephone system. Gorden.3: Data Communication (3-1-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: 1 To Appreciate the Concept of Data Communication. 4 To understand the basics of switching and networking. Measuring utilization and occupancy. SIMSCRIPT programs. Gathering statistics. Simulation Modeling and Analysis. A. System Simulation. Introduction: (3 hrs) Evolution of Data Communication systems.
Overview of Data Communication Networking: (3 hrs) Network Types. Impulse response. crosstalk. Multiplexing & Switching: (5 hrs) Multiplexing types and Application. Fourier series representation: Continuous time Fourier series and Discrete time Fourier series. Transmission Channel. Digital services and it’s Hierarchy. Encoding of Digital Data as Digital Signals & its Techniques. Unguided Transmission Media: Terrestrial Microwave. Local Area Networks: LAN Architecture. 5. Noise & Types. Error handling and Compression Techniques: (4 hrs) Attenuation & Distortion. Ethernet(CSMA/CD).Wait. Basic system properties: Linearity. Delay Distortion. Pulse Code and 4.Asynchronous & Synchronous Protocols and its types. interference. 6. 7. Topology.25. Stability and Time Invariance. Signals and Systems: (5 hrs) Signals and their classification: Periodic and non-periodic signals. Stop–and Wait ARQ. Multiplexing Vs Non-Multiplexing. The Telephone System: Analog services and its Hierarchy. Frequency. Error Control : Automatic Repeat Request (ARQ).Parallel and Serial Transmission. Fourier Transform: Continuous and Discrete time Fourier transform. Wide Area Networks: X. Continuous and Discrete time system. Transmission Media: (4 hrs) Electromagnetic Spectrum for Telecommunication. Types of data Compression Techniques Data Link Control and Protocol: (3 hrs) Flow Control: Stop . and Private Branch Exchange.& . 60 . LLC/MAC & Routing. Data Encoding & Modulation: (6 hrs) Encoding Vs Modulation. Analysis of Signals and System’s response: (6 hrs) Unit Step function and Impulse function. Circuit Switching. IEEE Standards. Causality. Synchronous/Asynchronous Communication. Sliding Window (ARQ). and Phase Shift Keying. Bit Rate/ Baud rate. Packet Switching. RS-232C and RS449 Interface Standards. 3. 9. Impairments. Co-axial Cable. Line Configuration. Characteristics of Unguided Communication Bands. Guided Transmission Media: Twisted–Pair Cable. Types of error & its Detection and Correction Methods. Frame Relay. ATM. Message Switching. Type of Propagation. VSAT. Antennas. Satellite Communication. 8. Energy and Power signals. Continuous and Discrete time signals. and Cellular Telephony. Deterministic and Random signals. Amplitude. Optical Fiber. 10. OSI layers and Functions. Sliding Window .
1. theory and practices in design and implementation of DBMS. 2. Needs of DBMS. Data independence. Data Models 61 2 (4hrs) . Database Manager and users.3 Database Management System (3-1-3) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Objectives: The objective of this course is to provide fundamental concept. and Phase Modulation) 11. Frequency Modulation and Demodulation. Behrouz Forouzan. Course Contents: 1 Introduction (4 hrs) Concept and applications. Oppeheim. Types and Standard Modems. and time allocated to lab work. Objectives and Evolution . needs and organizations of database. These projects are representative of the theory: Simulated USING MATLAB/other programming languages). Simulated Error Control Coding techniques. Data Communications and Distributed Networks. 6. Black . William Stallings.D. Motivation. Data and Computer Communications. Differential PSK. Multilevel Modulation. Higher-Data Rate Modems. Concept of DDL and DML. QPSK Modem. A. Simulated simple PCM coder that converts samples into a digital code. Amplitude Modulation and Demodulation. 5. Schema and Instances. Data abstraction. Signal Analysis using MATLAB( Maximum 3-Labs) 2.Delta Modulation. Analysis of Signal response using simple filters 3. Text Books: 1. Signals and Systems CMP 383. Laboratory: (The ability to complete the lab projects will depend on the facilities. 3. Modems: (3 hrs) Digital Modulation Methods. Frequency. Analog Modulation (Amplitude. U. 4. fifth education. 4. availability of components. Introduction to Data Communications and Networking.
Transaction model. Decomposition of relation schemes. Time-stamping-based protocols. The sequential and the indexed sequential file organizations. Transaction and Transaction processing. Equivalence of expressions. Query decomposition. Distributed Model. Network Data Model. hierarchical Data Model. Scheduling and Serializability. 6 7 Query Processing (3 hrs) Introduction to query processing. Multiple Granularity. Crash Recovery (4 hrs) Introduction to crash recovery and its importance. Join strategies. Normalization. Failure classification. Physical and Conceptural Model. Storage hierarchy. File organizations. (3 hrs) control. DDL and DML. Concurrency Control (4 hrs) Introduction. Relational languages SQL. Object-Oriented Model. Normal Forms. Security and integrity violations. Data Dictionary storage. Filing and File Structure (5 hrs) Needs of filing. Overview of storage devices. The relational calculus. Referential Integrity. hashing and hash function. Log-based recovery. structure of relational databases. An individual project should be given to each student. 62 . Security Needs of security. Deadlock handling. 10% of sessional marks should be allocated for evaluation. Locking and Lock based protocols. Schemas and Views. Buffer Management. Encryption and decryption. Integrity constraints. E-R Model. Access Authorization. Query Optimization. (3 hrs) 8 9 10 11 Laboratory: There shall be 12 laboratory exercised based on ORACLE to cover theoretical part studied. Query interpretation. User schema or views design. Security and Views. Shadow paging. Advanced Database Model Extended Relational Model. Heap piling. 3 Relational Model (4 hrs) Definitions and terminology. (3 hrs) 4 5 Relational Database Design (8 hrs) Introduction. QBE. Multivalued and Join Dependencies. The relational algebra. Organization of records into blocks. B-Tree index files.Logical. Backuprecovery.
maintenance and cross life cycle activities using object oriented concepts and models. The Prototyping Model. Linear Model. development. Relationship of software engineering to other areas of computer science and other disciplines. implementation. The software development life cycle. Spiral Model. design. Bhattacharaya. 3 G.C Everest. Database Management.F.E. Incremental Model. Evolutionary Models.Text Book: 1 A. Waterfall Model.K Majumdar and P. Introduction (5 hrs) History of software engineering. Benjamin/Cummings Publishing Co. role of software engineering in system design. Database Management Systems. CMP 388. McGraw Hill. 63 . etc. McGraw Hill. Database System Concepts. Korth and A. Inc.C Nevathe. Fundamentals of Database Systems. 2 R. The RAD Model. Silberschatz.3 Object Oriented Software Engineering (3-1-0) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Objectives: The course objective is to provide required knowledge on the various issues of software project management and related tasks including planning. India. Course Contents: 1. Reference Books: 1 H. Software Process Models. Mani and S. Tata McGraw Hill.
Software Reviews. Project Management Concepts (2 hrs) The Management Spectrum. Verifying and Debugging. Economic. Object Oriented Analysis (5 hrs) OO based Analysis. relationship. polymorphism. Unit Testing. Resources: human. Product Engineering. 5. Test Case Design. Software Reliability. representative qualities. Architectural Models (concepts: components. Feasibility: Importance. Unified approach. interfaces. services. Technical. environment. Identify 64 4.2. Deployment Diagram. Risk Refinement. Behavioral (STD). quality requirements based on application areas. messages. Software Configuration Management. instances) Class Diagram. Use case and CRC modeling. UML notations. Requirements Engineering: Requirement Elicitation. 10. People. Object Oriented Fundamentals (2 hrs) OO Paradigm: Classes. operations. Identification of class and objects. Project scheduling tracking Risk Analysis and Management (3 hrs) Software Risks. Symbolic execution. and Object Diagram. attributes. process). objects. Integration Testing. reusable software. Black-Box Testing. Analysis and Negotiation. Feasibility assessment. Systems Engineering Principles (5 hrs) Business Process Engineering. event. etc). Functional (DFD. Project Estimation. Validation Testing. Software Quality Assurance. Importance of Testing. Safety Risks and Hazards. Specification. patterns. inheritance. signal. Quality Concepts. . scenarios. System Testing. Collaboration Diagram. and Schedule Feasibility. Software Qualities (4 hrs) Classification of software qualities. The Product. methods. Monitoring and Management. Risk Mitigation. outsourcing. 8. The make/buy decision. use cases. 3. packages. Interaction Diagram. 9. Software Testing (4 hrs) Software Testing Fundamentals. Behavioral Models (concepts: interactions. State Transition Diagram. SCM Standards. Structural Models: (concepts: class. White Box Testing. and Management. deployment. etc. object. Operational. 6. encapsulation. Risk Identification. Use Case Diagram. Formal Technical Reviews. UML (6 hrs) Unified Modeling Language Fundamentals. The Process. Validation. The Project. Activity Diagram. CFD). Risk Projection. subject and subsystems definition. collaboration. Component Diagram. Identification of class and object semantics. UML based any CASE tool and its use. System Modeling (in detail): Data (ERD). Structure. hierarchy. etc. Project Planning (5 hrs) Software scope. 7. Domain and reuse analysis.
User interface component. Ltd. Jacobson. Resource management component. and D. Pressman. Prentice Hall of India. Object Oriented Design (4 hrs) Design Issues. STD diagrams. Pearson R. Fundaments of Software Engineering. To provide the knowledge on planning. To provide the knowledge to formulate project documentation and oral presentation for his/her final year project. G. Unified Approach to design. task management component. Ghazi. design. Applying UML and Patterns. M. Case Study: Reference Books: 1 2 Wesley R. Class. Mandrioli. State representation.User Guide. An individual case study should be given to each student on software project and should be analyzed with UML CASE tool and implemented in OO. 65 . McGraw Hill Publishing Co. Object-relationship modeling. 3 4 5 6 PRJ 300. Booch. Events and States identification. Inter-subsystem Communication. Larman. Fairly. The Unified Modeling Language. Object description. Component and interfaces. Design Patterns and reuse. Jazayeri. Collaboration. 3. Interaction. Systems behavior representation 11. To provide the knowledge of Visual Programming by carrying out a project. Object Oriented Analysis and Design with Applications 2/e Pearson C. Data management component. During the project students learn visual programming tool (JAVA/Visual C++/ Dot net or any current trend of visual tool). 1. 10% of sessional marks should be allocated for evaluation. S. Partitioning of analysis model. Concurrency and subsystem allocation. etc. McGraw Hill International Edition G. Elaboration and implementation of Use cases. Data structure. Object. Software Engineering. AddisonC. The mini project will be software based project and on any area relevant to the course.class and object relationship. 2. 5/e. J. Course requirements: A project proposal including a literature survey to be submitted. I. development and implementation of project.2 Minor project (0-0-4) Evaluation: Sessional Final Total Theory Practical 100 100 Total 100 100 Objectives: 1. Software Engineering: A Practitioner's Approach. Rumbaugh. Booch.
1. Utility and Demand. 66 . 4. oligopoly. Introduction and Basic Principles of Economics (6 hrs) Introduction. An oral presentation (15 minutes + 15 minutes for questions) to be given. 5. Tangible and Intangible Factors. 3. The mini project document shall include the following items. Studying Engineering Economics and important usages. Elasticity of Demand. Demand.3 Engineering Economics (3-2-0) Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100 Course Objective: After completing this course students will be able to use basic tools of economics and will also be able to conduct simple economic studies. Marginal Utility. A mid term progress report to be submitted. The final report to be submitted The oral defense to the final report should be given. Engineering Economics Techniques. Consumer and producer goods. Local and national market. Price and production. 2. monopoly. 1. MNG 410. 4. Implementation area.2. Students will also be able to make evaluation of engineering projects in the public and private sector and be able to make decisions related to investment. Law of Diminishing utility. Competition. Project team members Project supervisor(s) Technical description of the mini project Project task and time schedule System aspect of the project Baseline performance of the system Performance analysis methodology Reusability of modules in the software 6. the law of demand. 3.
Determination of Depreciation cost. Engineering Economy. Principals of Engineering Economy. partnership. Depreciation methods: Straight line method. Financial statements: The Balance Sheet. 7. Payback Period Method. IRR method. Effective Rate of Interest. Comparison of alternatives using capitalized worth method. Basic Methods of Engineering Economic Studies (5 hrs) Present worth and annual worth methods. law of supply. Straight line plus Average Interest Method. Risk on the investment of capital and Rule to safeguard capital investment. Service output method. private limited company. Bonds: Classification of Bonds. 4. use of Interest Tables. Gross profit. Analysis and interpretation of financial statements. public limited company. Nominal Rate of Interest. Rate of Return. Bond Amortization and Retirement. Minimum Attractive Rate of Return Method. Double Rate Declining Balance Method. Interest calculation: Simple Interest. Continuous compounding and continuous compounding Formula. law of supply and demand. Depreciation cost. Future worth method.Supply. Sum of the year digit method. Matheson Method. Stock: Common stock. methodology and application 2. public corporations. Law of Diminishing Returns. Estimate of expenses. Business 5. Depreciation (3 hrs) Introduction: Types of depreciation. Compound Interest. Capital and profit: The profit motive amount of capital required. Present worth and Future worth: Discount. Marginal Revenue and marginal cost. The PL Statement. Net profit. Break Even Analysis. Value of a Bond. Depletion. ownership Fundamental equation of accounting. 3. Cost Benefit Analysis (5 hrs) Conventional benefit /Cost Ratio. Comparison of mutually exclusive alternative Enterprise Financing and Capital Investment (6 hrs) Types of business organizations: Sole proprietorship. 6. Modified Benefit / Cost Ratio. Explicit Reinvestment Rate of Return (ERR) method. Basic Accounting Procedure (6 hrs) Accounting Terminologies. Estimate of income. sinking fund method. Asset and liabilities: Their types. Time Value of Money (6 hrs) Introduction. Interest Calculation for Uniform Gradient. preferred stock. 67 . Mutually exclusive investment alternatives in terms of Combination of projects.
Present Economy Study. Taxes on normal gain. Depreciation Rates for Buildings Equipment. Application of Cost Concept: Breakeven Analysis. William G. Engineering Economy. Method of Cost Accounting. Kaplan. Taxes on Capital gain. The Ledger. Paul De Garmo. MC Milan Publishing Company. Types of Journal entries. Reference Books: N. 8.Transaction: Debit and credit. Inventory of Materials. Incremental Cost. Personal Tax. Lifecycle Cost. VAT 4 assignments. Bonta delli. Pricing of Materials Issued 9. Elements of cost : Material.N. Sullivan and James A. Average Unit Cost Function. Recurring and Non-recurring cost. Cost Accounting : Comparison between cost accounting and General Accounting . Labour. Opportunity Cost. E. Relation between Journal and Ledger. Fixed Cost. Corporate Tax. Furniture etc. Double entry Book Keeping. Cash Cost Versus Book Cost. Borish and S. Direct. Taxation System in Nepal (4 hrs) Taxation Law. Cost Concept and Fundamentals of Cost Accounting (4 hrs) Cost Terminology: Sum Cost. Prime Cost and Production Cost. MC Gran Hill Publishing Company Tutorials: Text Book: CMP 472. The journal. Recaptured Depreciation. Economic Analysis for Engineering and Managerial Decision Making. Overhead expenses. Method of Overhead distribution. Standard Cost. Indirect and Overhead Cost.3 Computer Architecture (3-1-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Objectives: To study basic and Architectural Concepts of Computers 68 . Variable Cost. 3 quizzes and 3 case studies.
RISC and Cache Pipelining Techniques (7 hrs) Parallel processing. 7. RISC pipelining. virtual memory. Hardwired implementation. Stalling. introduction to pipelining. Pentium processor. Prentice-Hall India Limited. Control of CPU. examples of computer families. Register organization. Fetch. Programmed I/O . 5. RISC instructions. 1. Addressing modes and formats. Stack. mile stone in computer organization. Computer Organization and Architecture 17 edition. interconnection structures. Power PC processor. New Delhi. 4. future trends in computer 2. Enslow's classification. Cache memory. associative memory. Micro-instruction sequencing. instruction pipelining. Application of micro-programming. Control Unit Design (8 hrs) Micro-operations. Pipelining with RISC. cache coherence.Course Contents: 1. Placement. I/O channels and processors. Processor organization. Input/ Output Organization (6 hrs) External devices. Laboratory: The student should develop a project on computer Architecture. Central Processing unit: Case Study (8 hrs) Arithmetic and Logic unit. Processor to memory movement. 69 . Cache memory driving forces. Pipeling Hazards Multiprocessors Characteristics of multiprocessors. Reference Books: W. Interrupt Driven I/O Direct memory access. The topic could be either initiated by the student or selected from a list provided by the instructor. Flynn's. An oral presentation with a demonstration should be part of the laboratory project report. arithmetic pipelining. Instruction sets. External interfaces. Introduction (3 hrs) SSI and MSI circuits. Instruction cycle. I/O modules. Replacement & Update policies. 6. 8. (3 hrs) 3. auxiliary memory. Memory Organization (6 hrs) Main memory. Cache design issues. VLSI Technology. RISC (4 hrs) RISC and CISC systems. Micro-instruction execution.
1989 A. Addison Wesley. A. Prentice Hall India Limited. ELX-482. 3. Structured Computer Organization.2. UK. new Delhi. Computer Architecture and Design.3 Digital Signal Processing (3-0-2) Evaluation: Sessional Final Total Course Objectives: Theory 30 50 80 Practical 20 20 Total 50 50 100 70 . Wokingham.J Vande Goor.S Tanenbaum.
Linearity and Symmetry Properties. Circular correlation and Parseval's Theorem. To provide knowledge on digital signal processing techniques. Digital filters. 2. fixed point and floating binary point. To design and implement IIR and FIR digital filter. by partial fraction expansion. Frequency response. Stability of LTI systems. Relationship to causality. Efiicient computation of the DFT: Algorithm. pole-zero relationship stability. Z-transform function H(z)-transient and steady state sinusoidal response. Lattice and latticeladder for IIR. applications. Design of Digital Filter (10 hrs) 2. 3. finite precision implementations of discrete filters. Quantizaiton of filter coefficients and effects on location of poles. A/D and D/A conversion. Discrete-time Signals and System (6 hrs) Elementary discrete-time signals. Systems and Signal Processing (5 hrs) Basic elements of Digital Signal Processing. Linearity.1. Multiplication of two DFTs and Circular Convolution. Time reversal. Ztransform properties-delay advance. Scaling to prevent overflow and underflow. Implementation of LTI system. Circular time shift and Multiplication of two sequences circular frequency shift. Overflow and underflow error. One-side and two-side transforms. Parseval's theorem. Applications of FFT Algorithms. Frequency domain sampling and for reconstruction. 5. Shift invariance. 71 . Effect of Rounding and truncation. Cascaded and parallel form. Discrete Fourier Transform (7 hrs) Definition and application. Sampling continuous signals and spectral properties of sampled signals. Lattice for FIR. Need of Digital Signal Processing over Analog Signal Processing. pole perturbation. Linear Time-invariant systems characterized by constant coefficient difference equations. Course Contents: 1. ROC. Direct Form. Relationship of the DFT to other transforms. Implementation of Discrete-time System (8 hrs) Structures for FIR and IIR. Right-sided and two-sided sequences. Review of Z-Transform (6 hrs) Definition of the z-transform. 4. Properties of the Discrete Fourier Transform: Periodicity. Convolution. Inverse z-transform-by long division. 6. Limit cycle oscillations effect. Causality of discrete systems. Conversion between direct form and lattice and vice verse. Forward and Reverse transforms. Signals. and zeros. Representation of Numbers. Recursive and Non-recursive discrete-time systems. Left-side. Convolution sum and impulse response. Region of convergence.
Mitra. McGraw Hill. Digital Filter Implementation (4 hrs) Implementations using special purpose DSP processors. Oppenheim.K. Response of a non-recursive digital filter. 2. FIR Filter Design: Gibbs phenomena in FIR filter design. Comparison of FIR filter for different windowing method. 5.IIR Filter Design: IIR filter design by classical filter design using low pass approximations Butterworth. A. Prentice Hall of India. Study the behavior of a simple digital notch filter.G. Implementation in Impulse Invariant and Bilinear Transformation. Proakis and D. IIR filter design by Impulse-invariant method. dynamic range and noise behavior of a recursive digital filter. Response of a recursive digital.G. Comparison of implementations. Bandpass and Notch filters. Window functions. 7. Bandpass filters implemented using cascade second order sections and wave or ladder filters. Scaling. Design of FIR filter using window method. Matched z-transform method. Discrete-Time Signal Processing. Manolakis. 4. Rectangular. Design of Linear Phase FIR filters using window function. Digital Signal Processing. Blackman and Kaiser windows. Distributed arithmetic implementations. pipelined implementations. 2. Bit-serial arithmetic. Highpass. 3. Spectral transformations. 3. FIR filter design using the Remez exchange algorithm. A Computer-based Approach.V. 1990. Digital Signal Processing. J. Chebychev.3 Computer Network Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Objectives: 72 . Bilinear Transformation Method. Design of optimum equiripple linear-phase FIR filters. CMP 474. observation of nonlinear finite precision effects. Prentice Hall. S. Laboratory: 1. Hamming. Inverse Chebyshev. Reference Book: 1. Design of linear phase FIR filter by the frequency sampling method. 6. Applications of window functions to frequency response smoothing. Elliptic and BesselThompson filters.
Client Server Network Model. Duplex. Background study and Revision (1 hrs) Introduction and necessity of computer Networking. Media Access Control Layer (Carrier Sense Multiple Access/Collision Detection) 7. Introduction of Frame Relay. Bus. Physical Layer Devices (Hub. IP Addresses and Classes. Co-axial Cable. 6. 73 . Framing. Introduction 2. 5. TCP / IP Reference Model (6 hrs) Introduction of TCP / IP Model. SLIP and PPP. Virtual Circuit and Data grams Subject. computer communications and computer networks. Data Link Layers (6 hrs) Services and Data Link Layer Devices (Switch. electronic email. Wireless LAN Reference Model (6 hrs) Network software. Comparison with OSI Reference Model. HDLC. Repeaters). data flows. Flow Control and Error Control. Protocol Hierarchy and its need. This course also covers the telephone system. 8. Ring: Logical and Physical. Different types of multiplexing: Simplex. Introduction of OSI Reference Model Physical layers and its Design issues (5 hrs) Twisted Pair Cable. Types of networking: LAN. Bridge). and organization around ISO-OSI seven-layer architecture. Introduction of IPV6 Network Layer and Internet Layer (6 hrs) Network Layer and Design Issues. Extra-Net. Fiber Optics. Subnet and Subnet mask. 1. The course includes different kinds of networking topologies and their structure and design. Sliding Window Protocols. 4. Elementary Data link Protocols. Intra-Net and Inter-Net Network Architecture (3 hrs) Star. IPV4 Frame Format. Interfaces and Services. Base-band Cable. Wireless Networking. with review of each layer. networking protocols. ISDN. ATM. Peer-to-peer Network architecture model. Half Duplex Introduction to Network Topologies (3 hrs) Definition.25. use and prospect of LAN. Broad-band Cable. 3. WAN.Computer Networks involves the study of computer systems. PSTN and X. Clustered Star. MAN.
5. 10. Computer Networks by Andrew S.Vol. Data encryption. Reference Book: 1. keiser. FTP. Integrity & firewalls Introduction to Socket Programming: (3 hrs) Clint/Server Computing: . 3. Congestion Control. Computer networking by James F. DHCP. E. Distributed processing (Three-Tier Architecture). Tanenbaum Elective I (3 Credit) 74 .R. Computer networking by RS Rajesh. Principles of Cryptography (Symmetric Key & public key Encryption). TCP/IP Protocol by Behrouz A Foruldzan. Internet programming by KNJ Jamsa and ken cope. Traffic Shaping and Leaky Bucket Algorithm 9. KS Easwarakumar. Unit Network Programming by Stevens W. Text book: 1 Computer Networks by Andrew S. keith W. SMTP. 6. Introduction to socket calls & operating system calls. Distance Vector Routing Algorithm.of Routing. Servers Tools and Virtual private Networks Network Management and Security: (3 hrs) Introduction to Network management. Understanding Route interface and Basic Router using Route simulator.I and II.Distributed Applications (Web Technology). LAN by Gerd . Internet Network-Management framework (SMI & HIB) & SNMP protocol. 7. Examples of Clients. Understanding the socket Interface and window Socket API. 11. DNS. Ross. Setting up Client /Server Architecture system using Microsoft product and Linux 2. 3.Shortest path Routing Algorithm. PROXY. Tanenbaum. kurose. Data Encryption standard. R Balasubramaian. Date and Computer communications by William Stalling. TCP socket calls & UDP Socket calls. Network Severs and Protocols (3 hrs) HTTP. 2. Spanning Tree Routing. POP and IMAP. Laboratory: 1. 4. 8. Flow Based Routing Algorithm.
Compensation. Facilitation. Essentials of Mangement 2 Govinda Ram Agrawal. Organization and Management in Nepal. Function of management. Motivation and leadership (6 hrs) Concept of motivation and incentives. Principles of organization. Legal action 2 3 4 5 6 Reference Books: 1 Harold Koontz and Heinz Weihrich. Introduction to Industrial Relations (6 hrs) Meaning of trade union. Mediation. job analysis. functional and matrix. Types of organization-line. Formal and informal organization. Human Behavior and Conflict Management (7 hrs) Impact of diversity issues in Human Interactions. Leadership styles: Participative management. Theories of motivation. Intragroup and Intergroup Behavior.2 Organization and Management (2-0-0) Evaluation: Sessional Final Total Theory 50 50 100 Practical Total 50 50 100 Course Objectives: To make the students able to understand and analyze the professional environment where they have to practice their profession. Principles of organization. (McGraw Hill) 75 . Negotiation. Personnel Managemnt 4 Fred Luthans Organizational Behavior. introduction to wages and methods of wage payment . This course will also help them in bringing attitudinal as well as behavioral change. Recruitment and promotion. health and safety.MNG 411. Learning organization.B Mamoria. Performance appraisal. management by exception. Management by objectives. Arbitration. Trade union movement in Nepal Collective bargaining. Training. Organization chart. Characteristics of organization. Course Contents: 1 Introduction (2 hrs) Meaning of organization and management. 3 C. Personnel Management (6 hrs) Meaning and functions of personnel management. line and staff. Need of management Organization (4 hrs) meaning of organization. job description. Introduction to arbitration.
syntax. Problem types. resolution refutation system (RRS). truth tables. Problem solving (6 hrs) Defining problems as a state space search. Search techniques (9 hrs) Uninformed search techniques.3 Artificial Intelligence Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 1. 2.formed-formula. 2. unification. interpretation. alpha beta procedure Knowledge representation. applications of Artificial Intelligence.defined problems. breadth first search. 1. Problem formulation. Course Objectives: The main objectives of this course are: To provide basic knowledge of Artificial Intelligence To familiarize students with different search techniques To acquaint students with the fields related to AI and the applications of AI Course Contents: Introduction to AI (4 hrs) What is AI. conceptual dependencies and scripts 3. greedy search. rules of inference. reasoning in belief network Structured knowledge representation (4 hrs) Representations and Mappings. frames.CMP 421. horn clauses. validity. quantification. Statistical Reasoning-Probability and Bayes' theorem and causal networks. AI and related fields. 3. brief history of AI. Production systems. 76 . answer extraction from RRS.depth first search. depth limit search. rule based deduction system. Well. well. semantics. A* search Adversarial search techniques-minimax procedure. Game playing. tautology. inference and reasoning (12 hrs) Formal logic-connectives. 5. best first search. Approaches to Knowledge Representation. Definition and importance of Knowledge. Semantic nets. propositional logic. and search strategy comparison Informed search techniques-hill climbing. 4. Issues in Knowledge Representation. predicate logic. and learning. importance of AI. FOPL. Constraint satisfaction problem.
Laboratory exercises must cover the fundamental search techniques.6. Neural Network. Stuart Russel and Peter Norvig. Artificial Intelligence and Expert Systems. 1991. Patterson. 1996. Pearson Ivan Bratko. Machine Vision 7. W. References: E. McGraw Hill. 1984. 6. PROLOG Programming for Artificial Intelligence. Natural Language Processing. learning by analogy. Leon Sterling. Applications of AI (6 hrs) Expert Systems. Prentice Hall. Artificial Intelligence. The Art of PROLOG: Advanced Programming Techniques. Ehud Shapiro. 3. learning by training neural nets. Laboratory Work: Laboratory exercises should be conducted in either LISP or PROLOG. learning by simulating evolution. 1. 2001. explanation based learning. Addison Wesley. Addison Wesley. Machine learning (4 hrs) Concepts of learning. 2. D. learning by training perceptrons. Artificial Intelligence A Modern Approach. 77 . learning from examples. 2001. H. Prentice Hall. simple question answering. Artificial Intelligence. inference and reasoning. Rich and Knight. P. Winston. 4. 5.
Introduction to Pattern Recognition and Images (4 hrs) (3 hrs) 3. Segmentation (3 hrs) Segmentation by thresholding. Hadamard transform. Spatial operations. Tow-dimensional Systems (5 hrs) Fourier transform and Fast Fourier Transform. Grey Level Features Edges and Lines (6 hrs) Similarity and correlation. intensity level slicing. Image Enhancement and Restoration (8 hrs) Point operations. line and curve detection. Introduction to Digital Image Processing (4 hrs) Digital image representation. Problems with feature detectors. Digital image processing: Problems and application. Edge detection using templates. Digital negative. Equalization modification. 6. Model fitting. Edge detection using gradient models. High pass and band pass filtering. Haar transform. Regions for edges. Filtering spatial low pass. 9. Template matching. Predictive and inter-frame coding. Contrast stretching. Bit extraction. Averaging. Other image transforms. 8. Division of sample space. Frequency Approach and Transform Domain Advanced Topics (3 hrs) (4 hrs) 7.3 Image Processing & Pattern Recognition (3-1-2) Evaluation: Sessional Final Total Theory 30 50 80 Practical 20 20 Total 50 50 100 Course Contents: 1. Specification. Image Coding and Compression Pixel coding: run length. Directional smoothing. 78 . bit plan. Sampling and Quantization. Other image transforms and their properties: Cosine transform. Feature extraction. Magnification by replication and interpolation. Recognition and Classification (5 hrs) Recognition classification. Histogram modeling. Relationships between pixels. Median. 5. Elements of visual perception. Clipping and thresholding. Models. 4. Line detection.CMP 481. 10. 2.
Prentice Hall of India Pvt. P.Neural network and their application to pattern recognition. Elective II (3 credit) 79 . Digital Image Processing. K. 2. BSP Professional books. Ltd. M. 2.C. 1995. Wintz. Gonzalez and P. Jain. Dekker.. Monique and M. James. 1992. Hopfield nets. Fundamentals of Pattern Recognition. 1987. R. Pattern Recognition and Image Processing. Dekker.K. Digital Image Processing. M. perception Laboratory Work: Laboratory exercises using image processing and pattern recognition packages. Sing_tze Bow. Prentice Hall of India Pvt. 4. 1989. Fundamental of Digital Image Processing. A.. Pattern Recognition. Ltd. Reference Books: 1. Textbooks: 1. 1997. 3. hamming nets. AddisionWesley Publishing. 1996. Castlemann.
Evaluation: There are there stages in evaluation. they are: First stages: 10% of the mark shall be based on the followings: 1 project Proposal 2 Project plan 3 Budgeting Second stage: 70% of total mark shall be based on the following: Work performed (50 %) • System Design • Thoroughness • Understanding of methods used in the project • Amount of work performed • Level of achievement 80 . Suggested Materials: Relevant texts.5 Project (0-0-5) Evaluation: Sessional Final Total Theory Practical 100 100 Total 100 100 Course Objectives: The objective of this project work is to provide the students to plan and complete an individual engineering design project in the area of electronics under the supervision of Instructors.PRJ 400. Internet. Procedures: The project course involve working on a proposed design project under direct supervision of faculty members of Computer Engineering Department. Computer Journals and Proceeding. The project must be started at the beginning of seventh semester. But the evaluation will be made on eight semester. be selected in consultation with the industries. as possible. Manuals. Same project could be supervised by instructors of departments other than computer. to the local industries environment and may in fact. The selected project shall be electronic hardware based or electronics computer based but it should be relevant.
81 .• • • Ability to work with others Ability to identify problems Project planning skills. The defense will be evaluated by external examiner (external to the department or from industries). The oral defense will carry 20% of total marks. Documentation (20%) • Report organization • Writing style • Completeness of the report • Readability • Organization and analysis of data and results Third stage (20%): An oral defense of the project work to be conducted on the last week of final semester term.
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 reading from where you left off, or restart the preview.