BE (Computer) Syllabus

Contents
Contents ................................................................................................................................................................. 1
GENERAL POLICY ON........................................................................................................................................ 3
COURSE STRUCTURE, BE (COMPUTER) ......................................................................................................... 6
I/I........................................................................................................................................................................... 9
Course Title: Engineering Mathematics-I............................................................................................................ 9
Course Title: Engineering Chemistry ................................................................................................................ 11
Course Title: Engineering Drawing................................................................................................................... 14
Course Title: Programming in C ....................................................................................................................... 16
Course Title: Basic Electrical Engineering ........................................................................................................ 20
Course Title: Mechanical Workshop ................................................................................................................. 22
Course Title: Applied Mechanics...................................................................................................................... 24
Course Title: Engineering Project Work-I ......................................................................................................... 25
I/II ....................................................................................................................................................................... 26
Course Title: Engineering Mathematics-II ........................................................................................................ 26
Course Title: Engineering Physics .................................................................................................................... 29
Course Title: Logic Circuits ............................................................................................................................. 31
Course Title: Object Oriented Programming ..................................................................................................... 34
Course Title: Thermal Science .......................................................................................................................... 36
Course Title: Electromagnetics ......................................................................................................................... 38
Course Title: Engineering Project Work-II........................................................................................................ 40
II/I ....................................................................................................................................................................... 41
Course Title: Engineering Mathematics III........................................................................................................ 41
Course Title: Discrete Structures ...................................................................................................................... 43
Course Title: Database Management System..................................................................................................... 45
Course Title: Electronics Devices and Circuits .................................................................................................. 47
Course Title: Numerical Methods ..................................................................................................................... 49
Course Title: Web Programming and Technics ................................................................................................. 51
Course Title: Electrical Machine....................................................................................................................... 53
II/II ...................................................................................................................................................................... 56
Course Title: Applied Mathematics................................................................................................................... 56
Course Title: Theory of Computation................................................................................................................ 58
Course Title: Microprocessor............................................................................................................................ 59
Course Title: Instrumenttion ............................................................................................................................. 62
Course Title: ICT Project Management ............................................................................................................. 64
Course Title: Communication English .............................................................................................................. 65
Course Title: Engineering Project Work -III...................................................................................................... 68
III/I ...................................................................................................................................................................... 69
Course Title: Computer Graphics...................................................................................................................... 69
Course Title: Engineering Economics ............................................................................................................... 70
Course Title: Data Communication ................................................................................................................... 72
Course Title: Data Structure and Algorithm ...................................................................................................... 74
Course Title: Probability and Statistics ............................................................................................................. 76
Course Title: Software Engineering .................................................................................................................. 78
Course Title: Computer Organization and Architecture ..................................................................................... 80
III/II ..................................................................................................................................................................... 82
Course Title: Computer Networks .................................................................................................................... 82
Course Title: Microprocessor Based Instrumentation ........................................................................................ 84
Course Title: Distributed System ...................................................................................................................... 87
Course Title: Object Oriented Analysis and Design........................................................................................... 90
Course Title: Operating System ........................................................................................................................ 92
Course Title: Engineering Professional Practice ................................................................................................ 94
Course Title: Elective I..................................................................................................................................... 95
IV/I .................................................................................................................................................................... 100
Course Title: Digital Signal Analysis and Processing ........................................................................................ 96
Course Title: Organization and Management .................................................................................................. 100
Course Title: Artificial Intelligence................................................................................................................. 101
1
Course Title: Simulation and Modeling........................................................................................................... 103
Course Title: Computer Engineering Project-IV.............................................................................................. 104
Course Title: Elective II ................................................................................................................................. 105
Course Title: Elective III ................................................................................................................................ 106
IV/II................................................................................................................................................................... 107
Course Title: Computer Engineering Project-V ............................................................................................... 107
Course Title: Internship in Computer Engineering .......................................................................................... 108
Course Title: Computer Engineering Seminar ................................................................................................. 109
2
GENERAL POLICY ON
BACHELOR OF COMPUTER ENGINEERING PROGRAMS OF
MID WESTERN UNIVERSITY
Mid-Western University (MWU) is planning to offer various undergraduate (Bachelor level) programs in engineering
(electronics and communication and computer), Bachelor in Information Management and Bachelor of Science in
Computer Science and Information Technology. The following point list some basic information regarding the general
policy of Mid-Western University related to undergraduate computer engineering program. Mid-Western University
periodically reviews and updates its policies to uplift the standard of education.
1. Title:
The title of the program is Bachelor of Computer Engineering (B. E. Computer)
2. Objective:
The objective of the computer engineering program at Mid-Western University is to produce high quality computer
engineers and researchers.
3. Duration of the Program:
The program of study for B. E. Computer is over a period of eight semesters (four academic years). The academic
year begins in the September of each year.
4. Medium of Instruction and Examination:
The medium of instruction and examination in the computer engineering program shall be English.
5. Entry Requirement for New Students:
The entry requirement for students in B. E. computer is Intermediate in Science (I. Sc), or Higher Secondary level
(10+2) or Diploma in Engineering or Architecture or equivalent from a recognized institution with at least second
division marks at their Intermediate level. Besides the basic academic requirement, an entrance examination will be
held for all Nepalese applicants.
6. Admission Procedure:
The entrance test application form and the information brochure shall be provided on request at the Registrar's Office
(MWU) or at the concerned college. The concerned college scrutinizes the applications. The eligible candidates fare
informed to appear in the entrance test. The exact date for the entrance test is communicated to the applicants by the
college. The candidates shall be admitted on merit basis. The subjects and weightage for each subject of the Entrance
test will be
Physics: 20%; English: 15%; Mathematics: 30% Chemistry: 20% and Drawing 15%.
The college may also hold interviews for the candidates before their final selection for admission. Eligible foreign
national students may be admitted against limited seats on the basis of an interview to be conducted by the college.
The candidates, who are given provisional admission pending submission of the qualifying certificates, are required
to submit all necessary documents within a week of the beginning of regular classes. Otherwise, the admission will be
annulled.
7. The Credit System:
Each course is assigned a certain number of credits depending generally upon its lecture, tutorial and practical work
hours in a week. In theory subjects, one lecture per week is assigned one credit as a general rule.
8. Academic Schedule:
The academic session of the University consists of two semesters per year. The Fall semester starts in September and
the Spring Semester starts in February. For the Bachelor's program in engineering, student admission may commence
either in the Fall semester or in the Spring semester, as approved by the University. Mid-Western University publishes
its yearly academic calendar. The affiliated colleges are required to follow the calendar.
9. Student Evaluation:
The students' academic performance during a semester is evaluated using the system of continuous assessment
(evaluation of sessional work plus the final examination). The college and the University conduct the sessional works
and the final examinations, respectively.
3
Each course shall have sessional marks of 50% evaluated by the assigned teacher. Generally, each course will have a
written semester examination of 50% marks at the end of each semester. In the Practical courses, no final examination
will be conducted and the sessional marks shall be awarded on the basis of continual assessment. Normally, final
examinations are not conducted in elective courses and in courses which are offered as intensive courses conducted
by reputed international scholars.
To pass in a subject, a student must obtain a minimum of D grade in that subject in sessional work and the final
examination, separately.
Grading System:
The grade (marks) awarded to a student in a course is based on his/her consolidated performance in sessional and final
examinations. The letter grade in any particular subject is an indication of a student's relative performance in that
course. The pattern of grading is as follows:
Letter Range Grade Grade Point Description

A 85-100 4.0 Outstanding
A- 80-84 3.67 Distinction
B 75-79 3.33 Excellent
B- 70-74 3.00 Very Good
C 65-69 2.50 Good
C- 60-64 2.00 Average
D 55-59 1.50 Fair
D- 50-54 1 Satisfactory
F Below 50 0 Failing
Only in very rare and unusual circumstances, if a student cannot finish all the required work for the course, he/she
may be awarded an incomplete grade "I". If all the required work is not completed within the following semester, the
grade of I will automatically be converted to an "F". A student receiving an I grade do not need to register for that
subject in the following semester to complete the required works.
The performance of a student in a semester shall be evaluated in terms of the Semester Grade Point Average (SGPA)
which is the grade point average for the semester. The cumulative grade point average (CGPA) is the grade point
average for all completed semesters.
SGPA = total honor points earned in a semester / total number of credits registered in a semester
CGPA = total honor points earned / total number of credits completed
10. Attendance Requirement:
The students must attend every lecture, tutorial and practical classes. However, to accommodate for sickness and other
contingencies, the attendance requirement shall be a minimum of 80% of the classes actually held. If a student fails to
attend 80% of the classes in any particular subject, he/she shall not be allowed to take the final examination in that
subject. If a student is continuously absent from the college for more than four weeks without notifying the principal,
his/her name will be removed from the college roll.
11. Normal and Maximum Duration of Stay at the College:
The normal duration for completing the Bachelor of Computer Engineering program at the university will be four
years. The maximum duration for the completion of the requirements shall be the normal duration plus four
years.
12. Course Registration:
The academic record of a student is maintained in terms of the courses for which he/she registers in any semester, and
the grades he/she obtains in those courses. Registration for courses is done at the beginning of each semester. Since
registration is a very important procedural part of the credit system, it is absolutely essential that all students present
themselves at the college. In case of illness or any exceptional circumstance during the registration period, he/she
4
must inform the Principal of the same. Registration in absentia may be allowed only in rare cases, at the discretion of
the Principal.
However, the student's nominee cannot register for courses but will only be allowed to complete other formalities.
13. Repeating a Course:
A course may be taken only once for a grade, except when a student receives a D or F grade. Since passing of all core
courses individually is a degree requirement, the student must retake the failing core course when offered and must
successfully complete the course. Retaking a course in which a student has earned a D grade is optional. However, a
student cannot retake more than two courses in which he/she has received D grade. The grade earned on the retake
will be substituted for the grade earned first time the course was taken.
14. Transfer of Credit Hours:
A maximum of 15 credit hours of course work completed in an equivalent program of a recognized institution may be
transferred for credit. For transfer of credit, a student must have received a grade of B or better in the respective course.
Courses taken earlier than five years from the time of transfer may not be accepted for transfer of credit.
The concerned Subject Committee of the University will make an evaluation of the applicant for transfer of credit.
The awarding of transferred credit will be based on the applicant's score in the college or University, which he/she
attended previously.
15. Course Coding for Computer Engineering:
Each course is identified by two letters followed by a three-digit number. The two letters indicate the subject area
(e.g., SH for Science & Humanities, EL for Electrical Engineering, EX for Electronics & communication Engineering,
CO for Computer Engineering, ME for mechanical engineering, BAR for Architecture, CE for Civil Engineering, MS
for Management Science, etc). The first digit of each number indicates the level or academic year the course is
normally taken as SH501 is a first subject of the science and humanities, CO501 is a first subject of computer, CE501
is first subject of the civil, CE502 is the second subject of the civil and so on).
In the course description, figures in parenthesis following the course number, for example, (3-2-0), indicate the hours
per week devoted to lecture, tutorial, and practical, respectively.
16. Elective Courses:
The curriculum is oriented to have intensive study in the field of interest with course registration flexibility at least
for two courses. But in future, course registration flexibility shall be increased to more number of courses.
17. Award of Degree:
MWU awards B. E. Computer degree upon completion of all requirements as prescribed in the curriculum. MWU
awards grades as explained in the curriculum on the basis of individual student's relative performance. The minimum
credit hours needed for B. E. Computer degree is 150.
Cumulative Grade Point Average (CGPA) for the degree shall be awarded upon completion of all requirements.
18. Scrutinizing of Final Examination Paper:
Students may apply for re-totaling or rechecking of their grades as per University rule, upon payment of prescribed
fee.
19. Final Examination:
MWU conducts final examination at the end of each semester. The procedure of final examination conduction will be
as per the examination rules of the Mid Western University.
Note: The provisions of this document are not to be regarded as a binding contract between the University and the students.
The University reserves the right to change any provisions or requirements contained in this document at any
time, without pre-notification, within the students' term of residence.
5
COURSE STRUCTURE, BE (COMPUTER)
Year/ Semester: I/1

S.N. Course Code Course Description Credits Lecture Tutorials Laboratory Total
1. SH501 Engineering Mathematics I 3 3 2 - 5
2. SH502 Engineering Chemistry 3 3 1 3 7
3. ME501 Engineering Drawing 3 - - 6 6
4. CO501 Programming in C 4 3 1 3 7
5. EL501 Basic Electrical Engineering 3 3 1 3 7
6. ME502 Mechanical Workshop 2 1 - 3 4
7. CE501 Applied Mechanics 3 3 1 - 4
8. CO502 Engineering Project Work-I 1 3 3
Total 22 17 6 21 43
Year/Semester: I/II
1. SH503 Engineering Mathematics II 3 3 2 _ 5
2. SH504 Engineering Physics 3 4 1 2 7
3. EX501 Logic Circuits 3 3 1 3 7
4. CO503 Object Oriented Programming 4 3 1 3 7
5. ME503 Thermal Science 3 3 1 2 6
6. EX502 Electromagnetic 3 3 1 2 6
7. CO504 Engineering Project Work-II 2 - - 3 3
Total 21 18 7 15 41
Year/ Semester: II/1

1. SH505 Engineering Mathematics III 3 3 1 - 4
2. CO505 Discrete structure 3 3 1 - 4
3. CO506 Database Management System 4 3 1 3 7
4. EX503 Electronic Devices & Circuits 3 3 1 2 6
5. SH506 Numerical Methods 3 3 1 3 7
6. CO507 Web Programming and Technics 3 3 1 3 7
7. EL502 Electrical Machine 3 3 1 2 7
Total 22 21 7 10 41
Year/ Semester: II/II
6
1. SH507 Applied Mathematics 3 3 1 - 4
2. CO508 Theory of Computation 3 3 1 - 4
3. EX504 Microprocessor 3 3 1 3 7
4. EL503 Instrumentation 3 3 1 2 6
5. CO509 ICT Project Management 3 3 1 - 4
6. SH508 Communication English 3 3 1 2 6
7. CO510 Engineering Project Work-III 2 - - 3 3
Total 20 18 6 10 35
Year/ Semester: III/1

1. CO511 Computer Graphics 3 3 3 7
2. SH509 Engineering Economics 2 3 1 - 4
3. EX505 Data Communication 3 3 3 7
4. CO512 Data Structure and Algorithm 4 3 1 3 7
5. SH510 Probability and Statistics 3 3 1 - 4
6. CO513 Software Engineering 3 3 1 3 7
7. CO514 Computer Organization & Architecture 3 3 1 - 4
Total 21 21 5 12 38
Year/ Semester: III/II

1. CO515 Computer Network 3 3 1 3 7
2. EX506 Microprocessor Based Instrumentation 3 3 1 2 6
3. CO516 Distributed System 3 3 - 2 5
4. CO519 Object Oriented Analysis & Design 3 3 1 2 6
5. CO520 Operating System 3 3 2 5
6. CE502 Engineering Professional Practice 2 2 - - 2
7. *** Elective I(3 Credit) 3 3 1 3 7
Total 20 20 4 17 38
Year/ Semester: VI/1
7
1. EX507 Digital Signal Analysis & Processing 3 3 1 2 6
2. MS501 Organization and Management 2 2 - - 2
3. CO519 Artificial Intelligence 4 3 1 2 6
4. CO520 Simulation and Modeling 3 3 1 3 7
5. CO521 Engineering Project Work-IV 3 - - 6 6
6. *** Elective II (3 Credit) 3 3 - 3 6
7. *** Elective III (3 Credit) 3 3 - 3 6
Total 21 17 3 19 39
Year/ Semester: VI/II

1. CO522 Engineering Project Work-V 3 - - 3 3
2. CO523 Internship 4 3 Months 6 (Per Day) 36
3. CO524 Computer Engineering Seminar 2 3 3
Total 9 3 - 12 42
8
I/I
Course Title: Engineering Mathematics-I

Course Code: SH501
Year/Semester: I/I
Class Load: 5 Hrs. per Week (Theory: 3 Hrs, Tutorial 2Hrs)
Evaluation:
Theory Practical Total
Internal 50 - 50
Final (External) 50 - 50
Total 100 - 100
Course Objective:
To provide students a sound knowledge of calculus and analytic geometry to apply them in their relevant fields
1. Derivatives and their Applications (14 hours)

1.1. Introduction
1.2. Higher order derivatives
1.3. Mean value theorem
1.3.1. Rolle’s Theorem
1.3.2. Lagrange’s mean value theorem
1.3.3. Cauchy’s mean value theorem
1.4. Power series of single valued function
1.4.1. Taylor’s series
1.4.2. Maclaurin’s series
1.5. Indeterminate forms; L’Hospital rule
1.6. Asymptotes to Cartesian and polar curves
1.7. Pedal equations to Cartesian and polar curves; curvature and radius of curvature
2. Integration and its Applications (11 hours)

2.1. Introduction
2.2. Definite integrals and their properties
2.3. Improper integrals
2.4. Differentiation under integral sign
2.5. Reduction formula; Beta Gama functions
2.6. Application of integrals for finding areas, arc length, surface and solid of revolution in the plane for
Cartesian and polar curves
3. Plane Analytic Geometry (8 hours)

3.1. Transformation of coordinates: Translation and rotation
3.2. Ellipse and hyperbola; Standard forms, tangent, and normal
3.3. General equation of conics in Cartesian and polar forms
4. Ordinary Differential Equations and their Applications (12 hours)

4.1. First order and first degree differential equations
4.2. Homogenous differential equations
4.3. Linear differential equations
4.4. Equations reducible to linear differential equations; Bernoulli’s equation
4.5. First order and higher degree differential equation; Clairaut’s equation
4.6. Second order and first degree linear differential equations with constant coefficients.
4.7. Second order and first degree linear differential equations with variable coefficients; Cauchy’s
equations
4.8. Applications in engineering field
Reference books:
9
1. Erwin Kreyszig, Advance Engineering Mathematics , John Wiley and Sons Inc
2. Thomas,Finney,Calculus and Analytical geometry Addison- Wesley
3. M. B. Singh, B. C. Bajrachrya, Differential calculus, Sukunda Pustak Bhandar,Nepal
4. M. B. Singh, S. P. Shrestha, Applied Mathematics,
5. G.D. Pant, G. S. Shrestha, Integral Calculus and Differential Equations, Sunila Prakashan,Nepal
6. M. R. Joshi, Analytical Geometry, SukundaPustak Bhandar,Nepal
7. S. P. Shrestha, H. D. Chaudhary, P. R. Pokharel, A Textbook of Engineering Mathematics - Vol I
8. Santosh Man Maskey, Calculus, Ratna Pustak Bhandar, Nepal
Evolution Scheme:
The questions will cover all the chapter of the syllabus. The evolution scheme will be as indicated in the table below
Chapters Hours Marks distribution*
1 4 15
2 4 12
3 5 10
4 5 13
* There may be minor deviation in marks distribution.
10
Course Title: Engineering Chemistry
Course Code: SH502
Year/Semester: I/I
Class Load: 7 Hrs. per Week (Theory: 3 Hrs, Tutorial: 1 Hr, Practical: 3 Hrs)
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
To develop the basic concepts of Physical Chemistry, Inorganic Chemistry and Organic Chemistry relevant to
problems in engineering
1. Electro-chemistry and Buffer (6 hours)

1.1. Electro-chemical cells
1.2. Electrode Potential and Standard Electrode Potential
1.3. Measurement of Electrode Potential
1.4. Nernst equation
1.5. EMF of Cell
1.6. Application of Electrochemical and Electrolytic cells
1.7. Electrochemical Series and its Application
1.8. Buffer: its type and mechanism
1.9. Henderson’s equation for pH of buffer and related problems
1.10. Corrosion and its type
1.11. Factors influencing corrosion
1.12. Prevention of corrosion
2. Catalyst (4 hours)
2.1. Introduction
2.2. Action of Catalyst (Catalytic Promoters and Catalytic Poisons)
2.3. Characteristics of Catalyst
2.4. Types of Catalyst
2.5. Theories of Catalysis
2.6. Industrial Applications of Catalysts
3. Environmental Chemistry (5 hours)

3.1. Air Pollution
3.2. Air Pollutants i) gases SOx,NOx,CO,CO2,O3 and hydrocarbons ii)particulates dust, smoke and fly
ash
3.3. Effects of Air Pollutants on human beings and their possible remedies
3.4. Ozone depletion and its photochemistry
3.5. Water Pollution (Ref of surface water and pound water)
3.6. Water Pollutants (Ref of surface water) their adverse effect and remedies
3.7. Soil pollution
3.8. Pollutants of soil their adverse effects and possible remedies
4. Engineering Polymers (6 hours)

4.1. Inorganic polymers
4.2. General properties of inorganic polymers
4.3. Polyphosphazines
4.4. Sulpher Based Polymers
4.5. Chalcogenide Glasses
4.6. Silicones
4.7. Organic Polymers
4.8. Types of Organic Polymers
11
4.9. Preparation and application of
i) Polyurethane ii) Polystyrene iii) Polyvinylchloride iv) Teflon
v)Nylon 6,6 and vi) Bakelite vii) Epoxy Resin viii) Fiber Reinforced Polymer
4.10. Concept of bio-degradable, non-biodegradable and conducting polymers
5. 3-d Transition elements and their applications (5 hours)

5.1. Introduction
5.2. Electronic Configuration
5.3. Variable oxidation states
5.4. Complex formation tendency
5.5. Color formation
5.6. Magnetic properties
5.7. Alloy formation
5.8. Applications of 3-d transition elements
6. Coordination Complexes (5 hours)

6.1. Introduction
6.2. Terms used in Coordination Complexes
6.3. Werner’s Theory Coordination Complexes
6.4. Sidgwick’s model and Sidgwick’s effective atomic number rule
6.5. Nomenclature of coordination compounds (Neutral type, simple cation and complex anion and
complex cation and simple anion type)
6.6. Valence Bond Theory of Complexes
6.7. Application of valence bond theory in the formation of i) Tetrahedral Complexes
ii) Square planar Complexes and iii) Octahedral Complexes
6.8. Limitations of Valence Bond Theory
6.9. Applications of Coordination Complexes
7. Explosives (3 hours)
7.1. Introduction
7.2. Types of explosives: Primary, Low and High explosives
7.3. Preparation and application of TNT, TNG, Nitrocellulose and Plastic explosives
8. Lubricants and Paints (2 hours)

8.1. Introduction
8.2. Function of Lubricants
8.3. Classification of Lubricants (Oils, Greases and Solid)
8.4. Paints
8.5. Types of Paint
8.6. Application of Paints
9. Stereochemistry (4 hours)
9.1. Introduction
9.2. Geometrical Isomerism (Cis Trans Isomerism) Z and E concept of Geometrical Isomerism
9.3. Optical Isomerism with reference to two asymmetrical carbon center molecules
9.4. Terms Optical activity, Enantiomers, Diastereomers, Meso structures, Racemic mixture and
Resolution
10. Reaction Mechanism in Organic reactions (4 hours)

10.1. Substitution reaction
10.2. Types of substitution reaction SN1 and SN2
10.3. Elimination reaction
10.4. Types of elimination reaction El and E2
10.5. Factors governing SN1, SN2, El and E2 reaction mechanism path
References
• Engineering Chemistry by Jain and Jain
• A Text Book of Engineering Chemistry by Shashi Chawala
• A New Concise Inorganic Chemistry by J.D. Lee
12
• Principles of Physical Chemistry by Marron and Prutton
• Essential of Physical Chemistry by Bahl and Tuli
• Advanced Inorganic Chemistry Vol 1 and 2 by Satya Prakash and Tuli
• Organic chemistry by Morrison and Boyd
• Selected Topics in Physical Chemistry by Moti Kaji Sthapit
• Environmental Engineering by Peavy, Rowe and Tchobanoglous
Chemistry Practical Course for all
Practical 3 Periods per Week
1. Compare the alkalinity of different water samples by double indicator method 6 Periods
2. Determine the temporary and permanent hardness of water by EDTA Complexo-metric method 3 Periods
3. Determine residual and combined chlorine present in the chlorinated sample of water by Iodometric method 6
Periods
4. Prepare organic polymer nylon 6,6/ Bakelite in the laboratory 3 Periods
5. Determine the pH of different sample of buffer solution by universal indicator method 6 Periods
6. Prepare inorganic complex in the laboratory 3 Periods
7. Determine surface tension of the given detergent solution and compare its cleansing
power with other detergent solutions 6 Periods
8. Construct an electrochemical cell in the laboratory and measure the electrode potential of it 3 Periods
9. Estimate the amount of iron present in the supplied sample of ferrous salt using standard potassium
permanganate solution (redox titration) 6 Periods
Evolution Scheme:
1 6 6
2 4 5
3 5 6
4 6 8
5 5 6
6 5 5
7 3 3
8 2 2
9 4 5
10 4 4
13
Course Title: Engineering Drawing
Course Code: ME501
Year/Semester: I/I
Class Load: 6 Hrs. per Week (Practical: 6 Hrs)
Evaluation:
Internal 100 100
Final (External) 50 50
Total 150 150
Course Objectives
1. To develop sketching, lettering and drafting skills
2. To draw projections, drawings of various geometric figures.
3. To draw assembly of machine parts.
4. To develop ability of preparing working drawings
Course Contents:
1. Instrumental Drawing, Practices and Techniques (10 hrs)
Equipment and metals, Description of drawing instruments, auxiliary equipment and drawing materials,
Techniques of instrument drawing, pencil sharpening, securing paper, proper use of T-squares, triangles,
scales, dividers, compasses, erasing shields, French curves, inking pens.
Freehand Technical Lettering
Lettering strokes, letter proportions, use of pencils and pens, uniformity and appearance of letters, freehand
techniques, inclined and vertical letters and numerals, upper and lower cases, standard English lettering
forms.
Dimensioning
Fundamentals and Techniques: size and location dimensioning, IS conversion; Use of scales, measurement
units, reducing and enlarging drawings; General dimensioning practices: placement of dimensions aligned
and unidirectional recommended practice, some 50 items.
2. Applied Geometry (20 hrs)
Plane geometrical construction: Bisecting and trisecting lines and angles, proportional division of lines,
construction of angles, triangles, squares, polygons, constructions using tangents and circular archs. Methods
of drawing standard curves such as ellipse, parabolas, hyperbolas, involutes, spirals, cycloid and helices
(cylindrical and helical); Solid geometrical construction: Classification and pictorial representation of solid
regular objects such as: prisms, square, cubical, triangular and oblique, Cylinders: right and oblique, Cones:
right and oblique, Pyramids: square, triangular, oblique, truncated; Doubly-curved and warped surfaces:
Sphere, torus, oblate ellipsoid, conoid, serpentine, paraboloid, hyperboloid.
Basic Descriptive Geometry
Introduction: Application of descriptive geometry principles to the solution of problems involving
positioning of objects in three-dimensional space; The projection of points, and planes in space; Parallel
lines; True length of lines: horizontal, inclined and oblique lines; Perpendicular lines; Bearing of a line; Point
view of end view of a line; Shortest distance from a point to a line; Principal lines of a plane; Edge view of
a plane; True shape of an oblique plane;
Intersection of a line and plane; Angle between a line and a plane; Angle between two non-intersecting (skew)
lines; Dihedral angle between two planes; Shortest distance between two skew lines.
3. Theory of Projection Drawing (25hrs)
14
Perspective projection drawing; Orthographic projection; Axonometric projection; Oblique projection; First
and third angle projection; Oblique projection; First and third angle projection; Oblique projection' First and
third angle projection; Systems and projection.
Multi-view Drawings
Principal views: Methods for obtaining orthographic views: Projection of lines, angles and plane surfaces,
analysis in three views; Projection of curved lines and surfaces; Object orientation and selection of views for
best representation; Full and hidden lines. Orthographic drawings: Making an orthographic drawing,
Visualizing objects from the given views; Interpolation of adjacent areas; True-length lines; Representation
of holes; conventional practices.
Sectional views
Full section view; Half section; Broken section; Revolved section; Removed (detail) sections; Phantom of
hidden section; Auxiliary sectional views; Specifying cutting planes for sections; conventions for hidden
lines, holes, ribs, spokes.
Auxiliary Views
Basic concept and use of auxiliary views; Drawing methods and types of auxiliary views; Symmetrical and
unilateral auxiliary views; Projection of curved lines and boundaries; Line of intersection between two
planes; True size of dihedral angles; True size and shape of plane surfaces.
4. Development and Intersections (10hrs)
Development: General concepts and practical considerations, Development of a right or oblique prism,
cylinder, pyramid and cone; Development of truncated pyramid and cone; Triangulation method for
approximately developed surfaces; Transition pieces for connecting different shapes; Development of a
sphere; Intersections: Lines of intersection of geometric surfaces; Piercing point of a line and a geometric
solid; intersection lines of two planes; Intersection of prisms and pyramids; Intersection of a cylinder and an
oblique plane; Intersection of a sphere and an oblique plane; Constructing a development using auxiliary
views; Intersection of two cylinders; Intersection of a cylinder and cone.
5. Machine Drawing (10hrs)
Introduction: production of complete design and assembly drawings; Fundamental techniques: size and
location dimensioning; placement of dimension lines and general procedures; standard dimensioning practice
(IS system); Limit dimensioning: nominal and basic size, allowance, tolerance, limits of size, clearance fit,
interference fit; basic hole system and shaft systems; Thread and standard machine assembly elements: screw
threads: ISO standards, representation and dimensioning; Fasteners: type and drawing representation, keys,
collars, joints, springs bearings; Assembly drawings: drawing layout, bill of materials, drawing layout, bill
of materials, drawing numbers.
Laboratory Work:
Freehand technical lettering and use of drawing instruments; Dimensioning; Geometrical and Projection
drawing; Descriptive geometry; Projection and Multiview drawings; Sectional views; Auxiliary views,
Freehand sketching and visualization; Development and intersections; machine and assembly drawings.
Reference Books:
1. Luzadder, Fundamentals of Engineering Drawing, Prentice Hall of India Ltd., 8th edition, 1981.
2. French, C.J. Vierck and R.J. Foster, Engineering Drawing and Graphic Technology, McGraw-Hill,
1981.
Evolution Scheme:
1 10 7
2 20 15
3 25 15
4 10 7
5 10 6
15
Course Title: Programming in C
Course Code: CO501
Year/Semester: I/I
Class Load: 7 Hrs. per Week (Theory: 3 Hrs, Tutorials 1, Practical: 3 Hrs)
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
The object of this course is to acquaint the students with the basic principles of programming and development of
software systems. It encompasses the use of programming systems to achieve specified goals, identification of useful
programming abstractions or paradigms, the development of formal models of programs, the formalization of
programming language semantics, the specification of program, the verification of programs, etc. the thrust is to
identify and clarify concepts that apply in many programming contexts:
Course Contents:
1.0 INTRODUCTION TO COMPUTER: (4 hours)
1.1. Introduction to computer
1.2. Computer System
1.3. Function of Computer
1.4. Features of Computer
1.5. Generation of Computer.
1.5.1 First to Fifth Generation
1.6. Block diagram of Computer.
1.6.1 Discussion on Input Device/ Output Device
1.6.2. CPU.
1.6.3. Memory and its types.
1.6.3 Uses of Computer,
1.6.4 Computer network
1.6.4.1 LAM,MAN,WAN
2.0 INTRODUCION OF PROGRAMMING: (4 hours)
2.1. Introduction to Programming and Programming Languages
2.2. History of C
2.3. Introduction to C
2.4. Importance/ Advantages of C
2.5. Basic Structure of C Program
2.6. Desirable program characteristic
2.7. Introduction to compiler and interpreter
2.8. Problem Solving using Computer
2.8.1 Problem analysis
2.8.2 Algorithm development
2.8.3 Flowchart
2.8.4 Coding
2.8.5 Compilation and Execution
2.8.6 Debugging and Testing
2.8.7 Documentation
3.0 DATA TYPES, OPERATORS AND SOME STATEMENT: (5 hours)
3.1. Character Sets
3.2. Identifiers & Keywords
3.3. Constant
3.2.1. String Constant
3.2.2. Numeric Constant
3.2.3. Character Constant
3.4. Symbolic Constant
16
3.5. Data Types
3.6. C Operators
3.6.1 Arithmetic Operators (+,-,*, /, %)
3.6.2 Assignment Operators
3.6.3 Logical Operators
3.6.4 Relational Operators
3.6.5 Increment and Decrement Operators
3.6.6 Bitwise Operators
3.6.7 Special Operators
3.7. Arithmetic Expression
3.8. Operator Precedence and Associativiity
3.9. Type Conversions in Expressions
3.10. Token in C
4.0 VARIABLES ,INPUTAND OUTPUT: (3 hours)
4.1. Variable Declaration
4.2. Statements
4.3. Simple C programs
4.4. Input Statement
4.5. Output Statement
4.6. Feature of stdio.h
5.0 CONTROL STRUCTURE: (6 hours)
5.1. Conditional Statements
5.2.1. if statement
5.2.2. if-else statement
5.2.3. switch statement
5.2. Loop Statements
5.2.1. for loop
5.2.2. while loop
5.2.3. do-while loop
5.3. Breaking Control Statements
5.2.1. break statement
5.2.2. continue statement
5.2.3. go-to statement
6.0 ARRAY: (5 hours)
6.1. One-Dimensional Array
6.2.1. One-Dimensional Array Notation
6.2.2. One-Dimensional Array Declaration
6.2.3. One-Dimensional Array Initialization
6.2. Multidimensional Array
6.2.1. Multidimensional Array Notation
6.2.2. Multidimensional Array Declaration
6.2.3. Multidimensional Array Initialization
6.2.4.
6.3. Processing with one dimensional Array and Multidimensional Array
6.4. Array and Strings
7.0 FUNCTION: (6 hours)
7.1. Defining Function
7.2. Use of Function
7.3. Types of Function
7.3.1. User-defined and Library Functions
7.4. Components Associated with Function
7.5. Category Of functions According to return value and Arguments
7.6. Different types of Function Calls
7.7. Return Statement
7.8. Recursive Function
7.9. Concept of Local, Global and Static Variables
17
8.0 POINTER (5 hours)
8.1. Introduction to Pointer
8.2. Pointer Declaration
8.2.1. Indirection Or Deference Operator
8.2.2. Address Operator
8.3. Pointer inialization
8.3.1. Bad Pointer
8.4. Pointer Arithmetic
8.5. Void Pointer
8.6. Null Pointer
8.7. Pointer Function
8.7.1. Passing Pointer to a Function
8.8. Pointer & Array
8.8.1. Array of Pointer
8.8.2. Relationship between pointer and 1-D array
8.9. Pointers to pointers
8.10. Dynamic Memory Allocation
8.11. Application Pointer
9.0 Structure and Unions (5 hours)
9.1. Defining a structure
9.2. Structure Inialization
9.3. Arrays of Structures, Structures with in Structures
9.3.1. Processing a Structure
9.3.2. Structures Pointers
9.3.3. Passing Structures to Functions
9.3.4. Union and its importance
10.0Data Files (5 hours)
10.1. Introduction
10.2. Opening and Closing a Data File
10.3. File Opening Modes
10.4. Library Functions for Reading /Writing from / To a File
10.5. Creating a Data File
10.6. End of File (EOF)
10.7. Processing a Data File
10.7.1. Record Input / Output
10.7.2. Direct/ Random Access
Laboratory:
Laboratory work at an initial stage will emphasize on the verification of programming concepts learned in class
and use of loops, functions, pointers, structures and unions. 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.
At last application software should be developed by the students
Reference Book:
1.0 “Let USC”,;Yashavant Kanetker.
2.0 Programming with C; Gottfried
3.0 E.Balaguruswamy,”Programming in C”,Tata McGraw –Hill.
4.0 E.Balaguruswamy “Graphic under C”
Evolution Scheme:
18
1 4 3
2 4 3
3 5 6
4 5 6
5 5 6
6 4 6
7 4 5
8 4 5
9 5 6
10 4 4
19
Course Title: Basic Electrical Engineering
Course Code: EL501
Year/Semester: I/I
Class Load: 7 Hrs. per Week (Theory: 3 Hrs, Tutorial: 1 Hr, Practical: 3 Hrs)
Evaluation:
Internal 50 50 100
Total 100 150
Course Objectives:
- Understand the basic fundamental concept of DC and AC electrical circuits.
- Understand the basic fundamental concept of 3-phase electrical circuits.
- Interpret, derive and analyze all the mathematical equations and derivations associated, elaborately.
1. General Electric System (5 hrs)
1.1 Constituent parts of an electric system (electric circuit)
1.2 Electric charge, flow of current in a circuit, associated units
1.3 Electromotive force and potential difference, associated units
1.4 Ohm’s law, resistance, resistivity, associated units
1.5 Temperature dependence of resistance, temperature coefficient of resistance
1.6 Independent sources of energy – Voltage and current
2. Analysis of Linear DC circuits (8 hrs.)
2.1 Series circuits
2.2 Parallel circuits
2.3 Kirchhoff’s laws
2.4 Power and Energy
2.5 Application of Kirchhoff’s laws for network solution
2.5.1 Nodal analysis
2.5.2 Mesh analysis
2.6 Star – Delta and Delta – Star transformations
3. Network Theorems (9 hrs.)
3.1 Superposition theorem
3.2 Reciprocity theorem
3.3 Thevenin’s theorem
3.4 Maximum power transfer theorem
3.5 Norton’s theorem
4. Inductance and capacitance in electric circuits (4 hrs.)
4.1 General concept of capacitors
4.1.1 Charge and capacitance
4.1.2 Charging of a capacitor, parallel plate capacitor
4.1.3 Capacitors in series and parallel
4.2 General concept of inductance
4.2.1 Expression for inductance of a coil
4.2.2 Self and mutually induced emf, magnetic coupling
4.2.3 Coupled coils in series and parallel
5. Alternating quantities (3 hrs.)
5.1 AC system, waveform, definition of ac terms
5.2 Phasor representation
5.3 Instantaneous, average and rms values of alternating current and voltage
6. Analysis of single phase ac circuits (10 hrs.)
20
6.1 Current , voltage and power in purely resistive circuits
6.2 Current , voltage and power in purely inductive circuits
6.3 Current , voltage and power in purely capacitive circuits
6.4 Series RL, RC and RLC circuit analysis
6.5 Active, reactive and apparent power and power factor calculation
6.6 Phasor representation,
6.7 Mathematical interpretation and derivation of complex impedance and admittance
6.8 Complete analysis of Parallel ac circuits
6.9 Power factor and its practical importance
6.10 Power factor improvement and its importance
7. Analysis of 3-phase circuits ( 6 hrs )
7.1 Basic concept and advantage of three-phase circuit
7.2 Star and delta connection of 3- phases, phasor representation
7.3 Phase and line quantities
7.4 Voltage and current calculation in 3- phase balanced and unbalanced loads
7.5 Active, reactive and apparent power and power factor calculation
PRACTICAL ASSIGNMENT
1. Measurement of voltage, current and power in dc circuit
- Verification of Ohm’s Law
- Temperature effects in resistance
2. Verification of Kirchhoff’s voltage and current law
3. Measurement of amplitude, frequency and time period using oscilloscope
- Calculate and verify average and rms values
- Calculate the phase difference in RL and RC circuits
4. Measurement of alternating quantities
- R, L, C, RL, RC and RLC circuits and Calculation of Power and power factor and draw phasor diagrams
5. Three-phase ac circuits
- Measurement of currents and voltages in 3-phase circuits
- Connect 3-phase loads in star and delta and measure line and phase values
- Draw phasor diagrams
6. Two wattmeter method for the measurement of power consumed by a star and delta connected balanced load
- Draw watt-Ratio curve
REFERENCES
1. ABC of Electrical Engineering – Jain and Jain
2. A Text Book of Electrical Technology – B.L.Theraja
3. A course in Electrical Technology ( Basic Electrical Engineering ) – J.B.Gupta
Evolution Scheme:
1 5 5
2 8 10
3 9 10
4 4 5
5 3 5
6 10 10
7 6 5
21
Course Title: Mechanical Workshop
Course Code: ME502
Year/Semester: I/I
Class Load: 4 Hrs. per Week (Theory: 1 Hrs, Practical: 3 Hrs)
Evaluation:
Internal - 50 50
Final (External) - - -
Total - 50 50
Course Objectives:
To provide instructions and practical experience in basic mechanical workshop methods.
Course Contents:
1. Mechanical Workshop Materials (4 hrs)

Introduction to mechanical workshop, Basics of steel and cutting materials, Common non-ferrous metals,
Important mechanical properties.
2. Measurement and Measuring Equipment (1.5 hrs)
3. Bench Tools and Basic Hand Operations (1.5 hrs)
Filing, Sawing, Sheet metal working, screw thread and screw thread cutting
4. Joining Processes (1.5 hrs)
Riveting, Soldering, Brazing, Welding
5. Introduction to Machine Tools (1.5 hrs)
Elements of machine tools, Cutting actions and tooling
6. Familiarization with Basic Machine Tools (5 hrs)
Lathe, Milling machine, Drill presses, Power saws, Shaping Machine and Grinding machines
Practical:
1. To convert a metallic job piece into a prescribed form using mechanical bench tool.
2. To turn a cylindrical job piece to prescribed dimension by using lathe machine.
3. To convert a metallic job piece to prescribed dimension by using milling machine.
4. To provide surface finish to a metallic piece by using the shaper machine.
5. To weld required metallic pieces together by using electric arc and gas welding, to given shape and size.
6. To make knot & bolt of given size and type
7. To make tray/dust bin/ pen holder or similar item with sheet metal.
Reference Books:
1. Anderson and E.E. Tatro, Shop Theory, McGraw-Hill 5th edition, 1942.
2. Lascoe, C.A. Nelson and H.W. Porter, Machine Shop Operation and Setups, American Technical Society,
1973.
3. Machine Shop Practice – Volume II, Industrial Press, New York, 1971.
4. Oswald, Technology for Machine Tools, McGraw-Hill Ryerson, 3rd edition.
5. Oberg, Jones and Gorton, Machinery's Handbook, 23rd edition, Industrial Press, New York
Evolution Scheme:
1 4 15
2 1.5 5
3 1.5 5
4 1.5 5
5 3 5
6 5 15
22
23
Course Title: Applied Mechanics
Course Code: CE501
Year/Semester: I/I
Class Load: 4 Hrs. per Week (Theory: 3 Hrs, Tutorial: 1 Hr)
Evaluation:
Internal 50 - 50
Total 100 - 100
Course Objectives:
1. To develop knowledge of mechanical equilibrium
2. To understand Newton's Laws of motion
3. To apply mechanics in wide range of engineering applications
Course Contents:
1. Introduction (2 hrs)
Engineering Mechanics: definition and scope, Concept of statics and dynamics, Concept of particle and rigid
bodies, System of units
2. Forces on Particles and Rigid Bodies (5 hrs)
Characteristics of forces, types of forces, transmissibility and equivalent forces, resolution and composition
of forces, moment of a force about a point, moment of a force about an axis, theory of couples, resolution of
a force into a force and a couple, resultant of a system of forces
3. Equations of Equilibrium (3 hrs)
The free body diagram, General equations of equilibrium, equations of equilibrium for various force systems.
4. Distributed Forces (3 hrs)
Center of gravity and centroid of area, line and volume. Second moment of area, parallel axis theorem, polar
moment of inertia, radius of gyration
5. Friction Forces (2 hrs)
Laws of friction, Coefficients of friction and angled of friction.
6. Kinematics of Particles (6 hrs)
Rectilinear motion of particles, Curvilinear motion of particle, Rectangular components of velocity and
acceleration, Tangential and normal components, Radial and transverse components, simple relative motion
7. Kinetics of Particles (4 hrs)
Newton's second law of motion, linear momentum of a particle, Equations of motion, Dynamic equilibrium,
Angular momentum of a particle, Motion due to central force and conservation of angular momentum
8. Energy and Momentum Methods for Particles (5 hrs)
Work done by force, Kinetic energy of a particle, Power and efficiency, Potential energy, conservation of
energy, principle of impulse and momentum, Impulsive motion and impact.
9. System of Particles (5 hrs)
Newton's law and system of particles, Linear and angular momentum for a system of particles; Conservation
of momentum, Motion of mass center, kinetic energy of system of particles, Work energy principle,
Conservation of energy, Principle of impulse and momentum for a system of particles, Steady stream of
particles.
10. Kinematics of Rigid Bodies (4 hrs)
Translation, rotation about fixed axis, General plane motion, Absolute and relative velocity in plane motion.
11. Plane Motion of Rigid Bodies (3 hrs)

Angular momentum of rigid bodies, equation of motion for rigid bodies, D'Alemberts principle, constrianed
motion on plane.
12. Work Energy Principles for Rigid Bodies (3 hrs)
24
Principle of work and energy for rigid bodies, work of a couple, kinetic energy of a rigid body in plane
motion, conservation of energy.
References:
i. Shames, I. H., Engineering Mechanics, Prentice Hall of India, New Delhi.
ii. Beer, F. P. and E.R. Johnston, Vector Mechanics for Engineers, McGraw-Hill Book Co., New York, USA
(Asia Editions).
Evolution Scheme:
1 2 2
2 5 5
3 3 4
4 3 4
5 2 2
6 6 8
7 4 5
8 5 5
9 5 5
10 4 4
11 3 3
12 3 3
Course Title: Engineering Project Work-I

Course Code: CO502
Year/Semester: I/I
Class Load: 4 Hrs. per Week/per group (Practical 4 Hrs)
Evaluation:
25
Internal - 25 25
Final (External) - 25 25
Total - 50 50
Course Objectives:
1. To provide the knowledge of C Programming by carrying out a project. During the project students learn how to
develop basic application using programming language.
2. To provide the knowledge on planning, design, development and implementation of project.
3. To provide the knowledge to formulate project documentation and oral presentation for his/her next year project.
Course requirements:
1. A project proposal including a literature survey to be submitted.
2. A mid-term progress report to be submitted. An oral presentation (15 minutes + 15 minutes for questions) to be
given.
3. The final report to be submitted
4. The oral defense to the final report should be given.
The project document shall include the following items.
1. Project team members should not be exceeded six.
2. Project supervisor(s)
3. Technical description of the project
4. Project task and time schedule
5. System aspect of the project
6. Baseline performance of the system
I/II
Course Title: Engineering Mathematics-II

Course Code: SH503
Year/Semester: I/II
Class Load: 5 Hrs. per Week (Theory: 3 Hrs, Tutorial: 2 Hrs)
Evaluation:
Internal 50 - 50
26
Total 100 - 100
Course Objectives:
• To develop the skill of solving differential equations and to provide knowledge of vector algebra and calculus
• To make students familiar with calculus of several variables and infinite series
1. Calculus of two or more variables (6 hours)
1.1. Introduction: limit and continuity
1.2. Partial derivatives
1.2.1. Homogeneous function, Euler’s theorem for the function of two and three variables
1.2.2. Total derivatives
1.3. Extrema of functions of two and three variables; Lagrange’s Multiplier
2. Multiple Integrals (6 hours)
2.1. Introduction
2.2. Double integrals in Cartesian and polar form; change of order of integration
2.3. Triple integrals in Cartesian, cylindrical and spherical coordinates;
2.4. Area and volume by double and triple integrals
3. Three Dimensional Solid Geometry (11 hours)
3.1. The straight line; Symmetric and general form
3.2. Coplanar lines
3.3. Shortest distance
3.4. Sphere
3.5. Plane Section of a sphere by planes
3.6. Tangent Planes and lines to the spheres
3.7. Right circular cone
3.8. Right circular cylinder
4. Solution of Differential Equations in Series and Special Functions (9 hours)
4.1. Solution of differential equation by power series method
4.2. Legendre’s equation
4.3. Legendre polynomial function; Properties and applications.
4.4. Bessel’s equation
4.5. Bessel’s function of first and second kind. Properties and applications
5. Vector Algebra and Calculus (8 hours)
5.1. Introduction
5.2. Two and three dimensional vectors
5.3. Scalar products and vector products
5.4. Reciprocal System of vectors
5.5. Application of vectors: Lines and planes
5.6. Scalar and vector fields
5.7. Derivatives – Velocity and acceleration
5.8. Directional derivatives
6. Infinite Series (5 hours)

6.1. Introduction
6.2. Series with positives terms
6.3. convergence and divergence
6.4. Alternating series. Absolute convergence
6.5. Radius and interval of convergence
Reference books:
1. Erwin Kreyszig, Advanced Engineering Mathematics , John Wiley and Sons Inc
2. Thomas, Finney, Calculus and Analytical geometry Addison- Wesley
27
3. M. B. Singh, B. C. Bajrachrya, Differential calculus, Sukunda Pustak Bhandar,Nepal
4. M. B. Singh, B. C. Bajrachrya, A text book of Vectors, Sukunda Pustak Bhandar,Nepal
5. M. B. Singh, S. P. Shrestha, Applied Mathematics,
6. G.D. Pant, G. S. Shrestha, Integral Calculus and Differential Equations, Sunila Prakashan, Nepal
7. Y. R. Sthapit, B. C. Bajrachrya, A text book of Three Dimensional Geometry, Sukunda Pustak Bhandar, Nepal
8. Santosh Man Maskey, Calculus, Ratna Pustak Bhandar, Nepal
Evolution Scheme:
1 6 8
2 6 8
3 11 12
4 9 10
5 8 8
6 5 4
28
Course Title: Engineering Physics
Course Code: SH504
Year/Semester: I/II
Class Load: 7 Hrs. per Week (Theory: 4 Hrs, Tutorial: 1 Hr, Practical 2Hrs)
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
To provide the concept and knowledge of physics with the emphasis of present day application . The background of
physics corresponding to Proficiency Certificate Level is assumed.
1. Oscillation: (7 hours)
1.1. Mechanical Oscillation: Introduction
1.2. Free oscillation
1.3. Damped oscillation
1.4. forced mechanical oscillation
1.5. EM Oscillation: Free, damped and Forced electromagnetic oscillation
2. Wave motion (2 hours)
2.1. Waves and particles,
2.2. Progressive wave,
2.3. Energy, power and intensity of progressive wave
3. Acoustics (3 hours)
3.1. Reverberation,
3.2. Sabine' Law
3.3. ultrasound and its applications
4. Physical Optics (12 hours)
4.1. Interference,
4.1.1. Intensity in double slit interference,
4.1.2. Interference in thin films,
4.1.3. Newton's rings,
4.1.4. Hadinger fringes
4.2. Diffraction,
4.2.1. Fresnel and Fraunhoffer’s diffraction,
4.2.2. intensity due to a single slit;
4.2.3. diffraction grating,
4.2.4. x-ray diffraction, x-ray for material test
4.3. Polarization,
4.3.1. double refraction,
4.3.2. Nichol prism, wave plates,
4.3.3. optical activity, specific rotation
5. Geometrical Optics (3 hours)
5.1. Lenses, combination of lenses,
5.2. cardinal points,
5.3. chromatic aberration
6. Laser and Fiber Optics (4 hours)
6.1. Laser production,
6.1.1. He-Ne laser,
6.1.2. Uses of laser
6.2. Fiber Optics,
29
6.2.1. self focusing,
6.2.2. applications of optical fiber
7. Electrostatics (8 hours)
7.1. Electric charge and force,
7.2. electric field and potential,
7.3. electrostatic potential energy,
7.4. capacitors, capacitor with dielectric,
7.5. charging and discharging of a capacitor
8. Electromagnetism (11 hours)
8.1. Direct current: Electric current,
8.1.1. Ohm's law, resistance and resistivity,
8.1.2. semiconductor and superconductor
8.2. Magnetic fields:
8.2.1. Magnetic force and Torque,
8.2.2. Hall effect,
8.2.3. cyclotron, synchrotron,
8.2.4. Biot-savart law,
8.2.5. Ampere’s circuit law; magnetic fields straight conductors,
8.2.6. Faraday’s laws, Induction and energy transformation, induced field,
8.2.7. LR circuit, induced magnetic field,
8.2.8. displacement current
9. Electromagnetic waves (5 hours)
9.1. Maxwell’s equations,
9.2. wave equations, speed,
9.3. E and B fields,
9.4. continuity equation,
9.5. energy transfer
10. Photon and matter waves (5 hours)
10.1. Quantization of energy;
10.2. electrons and matter waves;
10.3. Schrodinger wave equation;
10.4. probability distribution;
10.5. one dimensional potential well;
10.6. uncertainty principle;
References:
Fundamentals of Physics: Halliday, Resnick, Walker (Latest Edition)
A text book of Optics: Brij Lal and Subrahmanyam (Latest edition)
Modern Engineering Physics: A. S. Basudeva
Engineering Physics: R. K. Gaur and S. L. Gupta
Evolution Scheme:
1 7 6
2 2 2
3 3 2
4 12 10
5 3 2
6 4 3
7 8 8
8 11 9
9 5 4
10 5 4
30
Course Title: Logic Circuits
Course Code: EX501
Year/Semester: I/II
Evaluation:
Internal 50 50 100
Total 100 - 150
Course Objectives:
To introduce basic principles of digital logic design, its implementation and applications.
1 Introduction (5 hours)
1.1 Definitions for Digital Signals
1.2 Digital Computer
1.3 Number Systems
1.4 Binary Number System
1.5 Decimal Number system
1.6 Octal and Hexa-Decimal Number System
1.7 Conversion of number systems
1.8 1’s and 2’s compliment
1.9 Coding
1.9.1 ASCII Code
1.9.2 BCD
1.9.3 The Excess – 3 Code
1.9.4 The Gray Code
2 Digital Logic (3 hours)
2.1 The Basic Gates – NOT, OR, AND
2.2 Universal Logic Gates – NOR, NAND
2.3 AND-OR-INVERT Gates
2.4 Positive and Negative Logic
2.5 Introduction to HDL
3 Combinational Logic Circuits (5 hours)
3.1 Boolean Laws and Theorems
3.2 Sum-of-Products Method
3.3 Truth Table to Karnaugh Map
3.4 Pairs, Quads, and Octets
3.5 Karnaugh Simplifications
3.6 Don’t Care Conditions
3.7 Product-of-Sums Method
3.8 Product-of-Sums Simplification
4 Data Processing Circuits (4 hours)
4.1 Multiplexers
4.2 De-multiplexers
4.3 Decoder
4.4 BCD-to-Decimal Decoders
4.5 Seven-Segment Decoders
4.6 Encoder
4.7 Exclusive-OR Gates
4.8 Parity Generators and Checkers
4.9 Magnitude Comparator
4.10 Read-Only Memory
4.11 Programmable Array Logic
4.12 Programmable Logic Arrays
4.13 Troubleshooting with a Logic Probe
31
4.14 HDL Implementation of Data Processing Circuits
5 Arithmetic Circuits (4 hours)
5.1 Binary Addition
5.2 Binary Subtraction
5.3 Unsigned Binary Numbers
5.4 Sign-Magnitude Numbers
5.5 2’s Complement Representation
5.6 2’s Complement Arithmetic
5.7 Arithmetic Building Blocks
5.8 The Adder-Subtracter
5.9 Fast Adder
5.10 Arithmetic Logic Unit
5.11 Binary Multiplication and Division
5.12 Arithmetic Circuits Using HDL
6 Flip Flops (4 hours)
6.1 RS Flip-Flops
6.2 Gated Flip-Flops
6.3 Edge-Triggered RS Flip-Flops
6.4 Edge Triggered D Flip-Flops
6.5 Edge Triggered J K Flip-Flops
6.6 Flip-Flop Timing
6.7 J K Mater- Slave Flip-Flops
6.8 Switch Contacts Bounds Circuits
6.9 Various Representation of Flip-Flops
6.10 Analysis of Sequential Circuits
7 Registers (2 hours)
7.1 Types of Registers
7.2 Serial In – Serial Out
7.3 Serial In – Parallel Out
7.4 Parallel In – Serial Out
7.5 Parallel In – Parallel Out
7.6 Applications of Shift Registers
8 Counters (5 hours)
8.1 Asynchronous Counters
8.2 Decoding Gates
8.3 Synchronous Counters
8.4 Changing the Counter Modulus
8.5 Decade Counters
8.6 Pre-settable Counters
8.7 Counter Design as a Synthesis Problem
8.8 A Digital Clock
9 Sequential Machines (7 hours)
9.1 Synchronous machines
9.1.1 Clock driven models and state diagrams
9.1.2 Transition tables, Redundant states
9.1.3 Binary assignment
9.1.4 Use of flip-flops in realizing the models
9.2 Asynchronous machines
9.2.1 Hazards in asynchronous system and use of redundant branch
9.2.2 Allowable transitions
9.2.3 Flow tables and merger diagrams
9.2.4 Excitation maps and realization of the models
10 Digital Integrate Circuits (4 hours)
10.1 Switching Circuits
10.2 7400 TTL
32
10.3 TTL parameters
10.4 TTL Overview
10.5 Open Collector Gates
10.6 Three-state TTL Devices
10.7 External Drive for TTL Loads
10.8 TTL Driving External Loads
10.9 74C00 CMOS
10.10 CMOS Characteristics
10.11 TTL- to –CMOS Interface
10.12 CMOS- to- TTL Interface
11 Applications (2 hours)
11.1 Multiplexing Displays
11.2 Frequency Counters
11.3 Time Measurement
Practical:
1. DeMorgan’s law and it’s familiarization with NAND and NOR gates
2. Encoder, Decoder, and Multiplexer
3. Familiarization with Binary Addition and Subtraction
4. Construction of true complement generator
5. Latches, RS, Master-Slave and T type flip flops
6. D and JK type flip flops
7. Ripple Counter, Synchronous counter
8. Familiarization with computer package for logic circuit design
9. Design digital circuits using hardware and software tools
10. Use of PLAs and PLDs
References:
1 Donald P. Leach, Albert Paul Malvino and Goutam Saha, “ Digital Principles and Applications”, 6th edition , Tata
McGraw-Hill, 2006
2 David J Comer “Digital Logic And State Machine Design” 3rd edition, Oxfored University Press, 2002
3 William I. Fletcher “An Engineering Approach to Digital Design” Printice Hall of India, New Delhi 1990
4 William H. Gothmann, “Digital Electronics, An Introduction to Theory and Practice”, 2nd edition, PHI, 2009
M. Morris Mano, “Computer Logic Design” Printice Hall of India.
Evolution Scheme:
1 5 6
2 3 4
3 5 6
4 4 4
5 4 4
6 4 4
7 2 2
8 5 5
9 7 8
10 4 5
11 2 2
33
Course Title: Object Oriented Programming
Course Code: CO503
Year/Semester: I/II
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
• 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.
Course Contents:
1. Introduction to Object Oriented Programming (4 hours)
1.1. Basic of Object Oriented Programming(OOP)
1.2. Concept of Object Oriented Programming
1.2.1 Object
1.2.2 Class
1.2.3 Abstraction
1.2.4 Inheritance
1.2.5 Polymorphism
1.2.6 Message Passing
1.3. Example of Object Oriented programming
1.4. Feature of C++
1.5. Advantages and Disadvantages of OOP
1.6. Comparison between C and C++
2. C++ Languages Construct (7 hours)

2.1. C ++ Program Architecture
2.2. Character Set and Tokens
2.3. Variable declaration and Expression
2.4. Preprocessor directives
2.5. Input/Output Streams and Manipulators
2.6. Condition and Looping
2.7. Functions
2.7.1. Function Syntax
2.7.2. Function Overloading
2.7.3. Inline Function
2.7.4. Default Argument
2.7.5. Pass by Reference and Return by Reference
3. Classes and Object (8 hours)

3.1. C++ Classse
3.2. Objects and member Access
3.3. Defining Member Function
3.4. Constructor
3.5. Default Constructor
3.6. Parameterized Constructor
3.7. Copy Constructor
3.8. Destructor
3.9. Static Data Member and static Function
3.10. Friend Function
4. Operator Overloading (8 hours)

4.1. Overloadable Operators,
4.2. Syntax of Operator overloading,
4.2. Rules of Operator Overloading
4.3. Unary Operator Overloading
34
4.4. Binary Operator Overloading
4.5. Data Conversion: Basic to User defined and User Defined-User Defined
5. Inheritance (6 hours)
5.1. Base and Derived Class
5.2. Protected Access Specifier
5.3. Derived Class Declaration
5.4. Member Function Overriding
5.5. Forms of Inheritance: Single, Multiple, Multilevel, Hierarchical, Hybrid, Multipath
5.6. Multipath Inheritance and Virtual Base Class
5.7. Constructor Invocation in Single and Multiple Inheritances
5.8. Destructor in Single and Multiple Inheritance
6. Polymorphism and Dynamic binding (4 hours)

6.1. Need of Virtual Function
6.2. Pointer to Derived Class
6.3. Definition of Virtual Functions
6.4. Array of Pointers to Base Class
6.5. Pure Virtual functions and Abstract Class
6.6. Virtual Destructor
6.7. reinterpret_cast Operator
7. Console and File Input/Output (8 hours)

7.1. Stream Class Hierarchy for Console Input/Output
7.2. Unformatted Input/Output
7.3. Formatted Input/Output with ios member Functions and flags
7.4. File Input/Output with streams
7.5. File Stream Class Hierarchy
7.6. Opening and Closing Files
7.7. Read/Write from file
7.8. File Access Pointers and their manipulators
7.9. Testing Errors during File Operation
Laboratory/Practical:
There will be about 10 lab exercises covering the courses. At the end of the course students must complete a programmimg project
on object oriented programming with C++.
Reference books:
1. Ram Datta Bhatta, “A text book of Object Oriented Programming”, Vidyarthi Pustak Bhandar., Kathmandu.
2. E.Balagurusamy, “Object Oriented Programming with C++”, Mc Graw Hill Education.
3. Daya Sagar Baral and Diwakar Baral, “The Secrets of Object Oriented programming”, Bhundipuran Prakashan.
4. D Ravichandran, “Programming with C++”, Mc Graw Hill higher education
Herbert Schildt, “C++ Programming”, Thomson Course Technology.
Evolution Scheme:
1 4 4
2 7 9
3 8 8
4 8 9
5 6 6
6 4 4
7 8 10
35
Course Title: Thermal Science
Course Code: ME503
Year/Semester: I/II
Class Load: 5.5 Hrs. per Week (Theory: 3 Hrs, Tutorial: 1 Hr, Practical 1.5Hrs)
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives
1. To make able to apply laws of thermodynamics in various systems.

2. To make able to distinguish the cycles in various engines, and pumps.
3. To make able to calculate energy/quantity of heat transfer by conduction and radiation.
Course Contents:
1. Concept and Definitions (10 hrs)

Thermodynamic system. Macroscopic vs. microscopic point of view. Properties and state of a substance.
Processes and cycles. Specific volume. Pressure. Equality of Temperature. Zeroth law of Thermodynamics.
2. Properties of a Pure Substance (4 hrs)

Vapour liquid solid phae equilibrium in a pure substance. Equations of state for a simple compressible
substance. Tables and diagrams of thermodynamic properties.
3. Work and Heat (2 hrs)

Definition of work. Work done in a quasi-equilibrium processes. Definition of heat. Comparison between
heat and work.
4. First Law of Thermodynamics (5 hrs)

First law for a cycle. First law for a process. Internal energy. Enthalpy. Specific heats. First law as a rate
equation. Conservation of mass. Conservation of mass and the control volume. First law for control volume.
Steady state steady flow process. Uniform state uniform flow process.
5. Second Law of thermodynamics (6 hrs)

Heat Engines and Refrigerators. Second law; Reversible process; Factors causing irreversibility. Carnot
cycle. Efficiency of a Carnot cycle. thermodynamic temperature scale.
6. Entropy (5 hrs)
Inequality of Clausius. Entropy as a property of a system. Entropy of a pure substance. Entropy change in
reversible process. Lost work. Principles of increase of entropy; Entropy change of an ideal gas. The
reversible polytopic process for an ideal gas; Concepts of reversibility, Irreversibility, Availability
7. Some Power and Refrigeration Cycles (4 hrs)
Vapor Power Cycles: Rankine cycle, Effect of pressure and temperature on Rankine cycle; Air Standard
Cycles: Carnot cycle, Brayton cycle; Internal combustion engines: Otto cycle, Diesel cycle.
8. Heat Transfer (8 hrs)

Introduction and application. Modes of heat transfer; Conduction: Fourier's law. Thermal conductivity. One-
dimmensional steady state heat conduction through a plane and composite wall. Thermal resistance and
conductance, Overall heat transfer coefficient. Basic laws of radiation. Black and gray bodies. Radioactive
exchange between infinite parallal planes. Newton's laws. Mechanism of forced and free convention.
Dimensionless Parameters: Reynld's number, Nusselt's number, Prandtl number. Simple empirical relations
for plate and pipe.
Laboratory Work:
a. To measure the pressure, specific volume and temperature
b. To find out the efficiency of a compressor.
36
c. To measure the rate of heat transfer by conduction.
d. To measure performance of a small internal combustion engine
e. To measure the heat transfer by thermal radiation.
f. To measure the performance of a refrigerator / Heat pump
Reference Books:
1. Howell J.R. and R.O. Buckius, Fundamentals of Engineering Thermodynamics, McGrow-Hill Publishers, 1994.
2. Van Wylen, G.J. and Richard E. Sonntag, Fundamentals of Classical Thermodynamics, Wiley Eastern Limited,
New Delhi, 1989.
3. Bayazitoglu, Y. and M. Necati Ozisik, Elements of Heat Transfer, McGraw-Hill Book Company, 1998.
4. Kreith, F., Principles of Heat Transfer, International Text book Company, Scranton Pennsylvania, 2nd Edition,
I965.
Evolution Scheme:
Chapters Hours Marks distribution
1 10 12
2 4 4
3 2 3
4 5 5
5 6 5
6 5 6
7 4 5
8 8 10
37
Course Title: Electromagnetics
Course Code: EX502
Year/Semester: I/II
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives:
• To understand the fundamental laws of static electric and magnetic fields
• To understand the functional laws of dynamic electric and magnetic fields
• To apply electromagnetic field and wave theory in the generation, transmission and measurement techniques
Course Contents:
1. Coulomb's Law and Electric Field intensity (3 hrs)
Coulomb's Law, Electric field intensity, field due to point charges and continuous charge distribution, Field
of a line charge and sheet of charge
2. Electric Flux Density and Gauss's Law (3 hrs)
Electric flux density, Gauss's law in integral form, application of gauss's law, Boundary condition at a
conductor surface
3. Divergence (2 hrs)
Concept of divergence, Maxwell's first equation and applications, vector operator, Divergence theorem
4. Energy and Potential (3 hrs)
Electric energy, Potential and potential difference, Potential field of a point charge and systems of charges,
Potential gradient, Electrical intensity as the negative gradient of a scalar potential, Conservative fields,
Electric energy density.
5. Electrostatic Field in Material Media (2 hrs)
Polarization, Free and bound charge densities, Relative permittivity, capacitance calculations
6. Boundary Value Problems in Electrostatics (6 hrs)
Laplace's and Poisson's equation, Uniqueness theorem, One dimensional boundary value problems, Two-
dimensional boundary value problems, Relaxation methods and numerical integration, Graphical field
plotting, Capacitance calculations.
7. Current and Current Density (2 hrs)
Conservation of charge, Continuity of current, Point form of Ohm's law, Relaxation time constant
8. Magnetostatics (3 hrs)
Biot-Svart's law, Magnetic intensity and magnetic induction, Ampere's circuital law, Applications
9. Curl (3 hrs)
Concept of curl, stokes theorem, Magnetic flux and magnetic flux density, Ampere's law in point form, scalar
and vector magnetic potentials, derivation of steady magnetic field laws, Boundary value problems.
10. Magnetic Force and Material Media (2 hrs)
Magnetic force, Magnetization and permeability, Magnetic boundary condition, Magnetic circuits
11. Time-Varying Force and Material Media (2 hrs)
Faraday's law, Inadequacy of ampere's law with direct current, Conflict with continuity equation,
displacement current, Maxwell's equation in point form Maxwell's equation in integral form, Retarded
potential.
38
12. Wave Equation (8 hrs)
Wave motion in free space, Perfect dielectric and losses medium, Wave impedance, Skin effect, AC
Resistance, Pointing vector, Reflections and refraction of uniform plane wave, Reflection and transmission
coefficient, standing wave ratio, Impedance matching, Radiation from a dipole antenna, Wave guides.
13. Transmission Lines (4 hrs)
Types of transmission mediums, characteristics impedance, Power and signal transmission capability of lines,
Field and Lumped circuit equivalents, Traveling and standing waves, Reflection termination and impedance
matching, Short and long lines, Graphical solution of the transmission lines.
14. Waves Guides (2 hrs)
Practical:
1. Teledeltos (electro-conductive) paper mapping of electrostatic fields
2. Determination of dielectric constant, display of magnetic hysteresis loop
3. Studies of wave propagation on a lumped parameter transmission lines
4. Microwave sources, detectors, transmission lines
5. Magnetic field measurements in a static magnetic circuit, inductance, leakage flux
Reference Books:
1. W.H. Hayt, Engineering Electromagntic, Tata McGraw Hill book company, New Delhi.
2. J.D Kraus and K.R Carver, Electromagnetic, Prentice Hall India Ltd, India.
Evolution Scheme:
1 3 3
2 3 4
3 2 2
4 3 3
5 2 2
6 6 8
7 2 2
8 3 3
9 3 3
10 2 2
11 2 2
12 8 10
13 4 4
14 2 2
39
Course Title: Engineering Project Work-II
Course Code: CO504
Year/Semester: I/II
Evaluation:
Internal - 50 50
Total - 100 100
Course Objectives:
1. To provide the knowledge of C Programming or Object Oriented Programing (C++) by carrying out a project.
During the project students learn how to develop basic application using programming language.
3. To provide the knowledge to formulate project documentation and oral presentation for his/her next year
project.
2. A mid-term progress report to be submitted. An oral presentation (15 minutes + 15 minutes for questions) to be
given.
The project document shall include the following items

1. Project team members should not be exceeded 6 students in each group.
40
II/I
Course Title: Engineering Mathematics III

Course Code: SH505
Year/Semester: II/I
Evaluation:
Internal 50 - 50
Total 100 - 100
Course Objectives:
The purpose of this course is to round out the students’ preparation for more sophisticated applications with an
introduction to linear algebra, Fourier series, Laplace Transforms, integral transformation theorems and linear
programming.
1. Determinants and Matrices
(11 hours)
1.1. Determinant and its properties
1.2. Solution of system of linear equations
1.3. Algebra of matrices
1.4. Complex matrices
1.5. Rank of matrices
1.6. System of linear equations
1.7. Vector spaces
1.8. Linear transformations
1.9. Eigen value and Eigen vectors
1.10. The Cayley-Hamilton theorem and its uses
1.11. Diagonalization of matrices and its applications
2. Line, Surface and Volume Integrals
(12 hours)
2.1. Line integrals
2.2. Evaluation of line integrals
2.3. Line integrals independent of path
2.4. Surfaces and surface integrals
2.5. Green’s theorem in the plane and its applications
2.6. Stoke’s theorem (without proof) and its applications
2.7. Volume integrals; Divergence theorem of Gauss (without proof) and its applications
3. Laplace Transform (8 hours)
3.1. Definitions and properties of Laplace Transform
3.2. Derivations of basic formulae of Laplace Transform
3.3. Inverse Laplace Transform: Definition and standard formulae of inverse Laplace Transform
3.4. Theorems on Laplace transform and its inverse
3.5. Convolution and related problems
3.6. Applications of Laplace Transform to ordinary differential equations
4. Fourier Series (5 hours)
4.1. Fourier Series
4.2. Periodic functions
4.3. Odd and even functions
4.4. Fourier series for arbitrary range
4.5. Half range Fourier series
41
5. Linear Programming (9 hours)
5.1. System of Linear Inequalities in two variables
5.2. Linear Programming in two dimensions: A Geometrical Approach
5.3. A Geometric introduction to the Simplex method
5.4. The Simplex method: Maximization with Problem constraints of the form “≤”
5.5. The Dual: Maximization with Problem Constraints of the form “≥”
5.6. Maximization and Minimization with mixed Constraints. The two- phase method (An alternative to the Big
M Method)
References :
E. Kreszig, "Advance Engineering Mathematics", Willey, New York.
M.M Gutterman and Z.N.Nitecki, "Differential Equation, a First Course", 2 nd Edition, saunders, New York.
Evolution Scheme:
1 11 12
2 12 12
3 8 10
4 5 6
5 9 10
42
Course Title: Discrete Structures
Course Code: CO505
Year/Semester: II/I
Evaluation:
Internal 50 - 50
Total 100 - 100
Course Objectives:
• To gain knowledge in discrete mathematics and finite state automata in an algorithmic approach
• To gain fundamental and conceptual clarity in the area of Logic, Reasoning, Algorithms, Recurrence
Relation, Graph Theory, and Theory of Automata.
1. Logic, Induction and Reasoning (12 hours)
1.1. Proposition and Truth function
1.2. Propositional Logic
1.3. Expressing statements in Logic Propositional Logic
1.4. The predicate Logic
1.5. Validity
1.6. Informal Deduction in Predicate Logic
1.7. Rules of Inference and Proofs
1.8. Informal Proofs and Formal Proofs
1.9. Elementary Induction and Complete Induction
1.10. Methods of Tableaux
1.11. Consistency and Completeness of the System
2. Finite State Automata (10 hours)
2.1. Sequential Circuits and Finite state Machine
2.2. Finite State Automata
2.3. Language and Grammars
2.4. Non-deterministic Finite State Automata
2.5. Language and Automata
2.6. Regular Expression and its characteristics
3. Recurrence Relation (8 hours)
3.1. Recursive Definition of Sequences
3.2. Solution of Linear recurrence relations
3.3. Solution to Nonlinear Recurrence Relations
3.4. Application to Algorithm Analysis
4. Graph Theory (15 hours)
4.1. Undirected and Directed Graphs
4.2. Walk Paths, Circuits, Components
4.3. Connectedness Algorithm
4.4. Shortest Path Algorithm
4.5. Bipartite Graphs, Planar Graphs, Regular Graphs
4.6. Planarity Testing Algorithms
4.7. Eulerian Graph
4.8. Hamiltonian Graph
4.9. Tree as a Directed Graph
4.10. Binary Tree, Spanning Tree
43
4.11. Cutsets and Cutvertices
4.12. Network Flows, Maxflow and Mincut Theorem
4.13. Data Structures Representing Trees and Graphs in Computer
4.14. Network Application of Trees and Graphs
4.15. Concept of Graph Coloring
References:
1. Kenth Rosen, “Discrete Mathematical Structures with Applications to Computer Science”, WCB/ McGraw Hill
2. G. Birkhoff, T.C. Bartee, “Modern Applied Algebra”, CBS Publishers.
3. R. Johnsonbaugh, “Discrete Mathematics”, Prentice Hall Inc.
4. G.Chartand, B.R.Oller Mann, “Applied and Algorithmic Graph Theory”, McGraw Hill
5. Joe L. Mott, Abrahan Kandel, and Theodore P. Baker, “Discrete Mathematics for Computer Scientists and
Mathematicians”, Prentice-Hall of India
Evolution Scheme:
1 12 12
2 10 10
3 8 8
4 15 20
44
Course Title: Database Management System
Course Code: CO506
Year/Semester: II/I
Evaluation:
Internal 50 50 100
Total 100 - 150
Course Objectives:
The objective of this course is to provide fundamental concept, theory and practices in design and implementation of
DBMS.
Course Contents:
1. Introduction (4 hrs.)
Concept and applications, Motivation, Objectives and Evolution , needs and organizations of database, Data
abstraction, Data independence, Schema and Instances, Concept of DDL and DML, Database Manager and users,
Needs of DBMS.
2. Data Models (4hrs)
Logical, Physical and Conceptural Model, E-R Model, Network Data Model, hierarchical Data Model
3. Relational Model (4 hrs)
Definitions and terminology, structure of relational databases, The relational algebra, The relational calculus,
Schemas and Views.
4. Relational languages (3 hrs)
SQL, DDL and DML, QBE.
5. Relational Database Design (8 hrs)
Introduction, Integrity constraints, Referential Integrity, Multivalued and Join Dependencies, Normalization,
Normal Forms, User schema or views design, Decomposition of relation schemes.
6. Security (3 hrs)
Needs of security, Security and integrity violations, Access control, Authorization, Security and Views,
Encryption and decryption
7. Query Processing (3 hrs)
Introduction to query processing, Query interpretation, Equivalence of expressions, Query Optimization, Join
strategies, Query decomposition
8. Filing and File Structure (5 hrs)
Needs of filing, Overview of storage devices, Organization of records into blocks, File organizations, The
sequential and the indexed sequential file organizations. B-Tree index files, hashing and hash function, Heap
piling, Data Dictionary storage, Buffer Management.
9. Crash Recovery (4 hrs)
Introduction to crash recovery and its importance, Failure classification, Backup-recovery, Storage hierarchy,
Transaction model, Log-based recovery, Shadow paging.
10. Concurrency Control (4 hrs)
Introduction, Transaction and Transaction processing, Scheduling and Serializability, Locking and Lock based
protocols, Time-stamping-based protocols, Deadlock handling, Multiple Granularity.
45
11. Advanced Database Model (3 hrs)
Extended Relational Model, Object-Oriented Model, Distributed Model.
Laboratory:
There shall be 12 laboratory exercised based on ORACLE to cover theoretical part studied. An individual project
should be given to each student. 10% of sessional marks should be allocated for evaluation.
Text Book:
1. A.K Majumdar and P. Bhattacharaya, Database Management Systems, Tata McGraw Hill, India.
2. H.F. Korth and A. Silberschatz, Database System Concepts, McGraw Hill.
3. R.E. Mani and S.C Nevathe, Fundamentals of Database Systems, Benjamin/Cummings Publishing Co. Inc.
4. G.C Everest, Database Management, McGraw Hill.
Evolution Scheme:
1 4 4
2 4 4
3 4 4
4 3 3
5 8 10
6 3 4
7 3 3
8 5 6
9 4 4
10 4 4
11 3 4
46
Course Title: Electronics Devices and Circuits
Course Code: EX503
Year/Semester: II/I
Evaluation:
Internal 50 -25 75
Total 100 - 125
Course Objectives:
• To introduce the fundamentals of analysis of electronic circuits
• To provide basic understanding of semiconductor devices and analog integrated circuits
1. Diodes (5 hours)
1.1 The Ideal Diode
1.2 Terminal Characteristics of Junction Diodes
1.3 Physical Operation of Diodes
1.4 Analysis of Diode Circuits
1.5 Small Signal Model and Its Application
1.6 Operation in the Reverse Breakdown Region - Zener Diodes
2. The Bipolar Junction Transistor (10 hours)
2.1 Operation of the npn transistor in the Active Mode
2.2 Graphical Representation of Transistor Characteristics
2.3 Analysis of Transistor Circuits at DC
2.4 Transistor as an Amplifier
2.5 Small Signal Equivalent Circuit Models
2.6 Graphical Load Line Analysis
2.7 Biasing BJT for Discrete-Circuit Design
2.8 Basic Single-Stage BJT Amplifier Configurations (C-B, C-E, C-C)
2.9 Transistor as a Switch – Cutoff and Saturation
2.10 A General Large-Signal Model for the BJT: The Ebers-Moll Model
3. Field-Effect Transistor (9 hours)
3.1 Structure and Physical Operation of Enhancement-Type MOSFET
3.2 Current-Voltage Characteristics of Enhancement-Type MOSFET
3.3 The Depletion-Type MOSFET
3.4 MOSFET Circuits at DC
3.5 MOSFET as an Amplifier
3.6 Biasing in MOS Amplifier Circuits
3.7 Junction Field-Effect Transistor
4. Output Stages and Power Amplifiers (9 hours)
4.1 Classification of Output Stages
4.2 Class A Output Stage
4.3 Class B Output Stage
4.4 Class AB Output Stage
4.5 Biasing the Class AB Stage
4.6 Power BJTs
4.7 Transformer-Coupled Push-Pull Stages *
47
4.8 Tuned Amplifiers
5. Signal Generator and Waveform-Shaping Circuits (6 hours)
5.1 Basic Principles of Sinusoidal Oscillator
5.2 Op Amp-RC Oscillator Circuits
5.3 LC and Crystal Oscillators
5.4 Generation of Square and Triangular Waveforms Using Astable Multivibrators
5.5 Integrated Circuit Timers
5.6 Precision Rectifier Circuits
6. Power Supplies, Breakdown Diodes, and Voltage Regulators (6 hours)
6.1 Unregulated Power Supply
6.2 Bandgap Voltage Reference, a Constant Current Diodes
6.3 Transistor Series Regulators
6.4 Improving Regulator Performance
6.5 Current Limiting
6.6 Integrated Circuit Voltage Regulator
Practical:
Bipolar Junction Transistor Characteristics and Single Stage Amplifier
Field-Effect Transistor Characteristics and Single Stage Amplifier
Power Amplifiers
Relaxation Oscillator and Sinusoidal Oscillator
Series and Shunt Voltage Regulators
References:
1. A.S. Sedra and K.C. Smith, “Microelectronic Circuits”, 6th Edition, Oxford University Press, 2006
2. David A. Bell, “ Electronics Device and Circuits ”, PHI; 3 rd Edition, 1999.
3. Robert Boylestad and Louis Nashelsky, “ Electronic Device and Circuit Theory”, PHI; 9 th Edition, 2007
4. Thomas L. Floyd, “Electronic Devices”, 8th Edition, Pearson Education Inc., 2007
5. Mark N. Horenstein, “Microelectronic Circuits and Devices”, PHI; 2nd Edition, 1997
6. Paul Horowitz and Winfield Fill, “The Art of Electornics”, Cambridge Publication; 2 Edition
7. Jacob Millman and Christos C. Halkias,and Satyabrata Jit “Millman’s Electronic Device and Circuits”, Tata
McGraw- Hill; 2nd Edition, 2007
Evolution Scheme:
1 5 6
2 10 12
3 9 10
4 9 10
5 6 6
6 6 6
48
Course Title: Numerical Methods
Course Code: SH506
Year/Semester: II/I
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
To be familiar with the theory of numerical analysis for solving algebraic and transcendental equations, solution of
ordinary and partial differential equations related to engineering problems, numerical differentiation and integration.
Course Contents:
1. Solution of Nonlinear Equations (10 hrs)

• Introduction
• Review of calculus and Taylor's theorem,
• Errors in numerical calculations,
• Bisection method,
• Regula-Falsi method,
• Newton's method,
• Secant method and their convergence,
• Fixed point iteration and its convergence.

2. Interpolation and Approximation (8 hrs)
• Linear interpolation
• Lagrange's polynomials,
• Newton's interpolation using difference and divided differences.
• Cubic spline interpolation,
• Least squares method for linear and nonlinear data.
3. Numerical Differentiation and Integration (5hrs)
• Newton's differentiation formulas,
• Newton-Cote's quadrature formulas,
• Trapezoidal rule, Simpson's 1/3 rule, Simpson’s 3/8 rule,
• Gaussian integration algorithm,
• Romberg integration formulas
4. Solution of Linear Algebraic Equations (10 hrs)
• Gauss elimination method with pivoting strategies,
• Gauss-Jordan method,
49
• LU decomposition method,
• Matrix inversion method, Iterative methods (Jacobi method, Gauss-Seidel method),
• Eigen value and Eigen vector using Power method
5. Solution of Ordinary Differential Equations (7 hrs)
• Euler’s Method,
• Heun's method,
• Runge-Kutta methods,
• Solution of the higher order equations,
• Boundary value problems
6. Solution of Partial Differential Equations (5 hrs)
• Review of partial differential equations,
• Deriving difference equations,
• Laplacian equation and Poisson's equation,
• engineering examples.
Laboratory:
The laboratory experiments will consist of program development and testing of non-linear equations, Interpolation,
Numerical integration and differentiation, Linear algebraic equations, ordinary and partial differential equations.
Textbook:
1. C.F. Gerald and P.O. Wheatley, Applied Numerical Analysis, 4th Edition, Addison Wesley Publishing Company,
New York
Reference Books:
1. W. Chency and D. Kinciad, Numerical Mathematics and Computing, 2nd edition, Brooks/Cole Publishing Co.,
1985
2. W.H. Press, B.P. Flannery et. al., Numerical Recipes in C, 1st Edition, Cambridge Press, 1998.
S. Yakwitz and F. Szidarovszky, An Introduction to Numerical Computations, 2nd Edition, Macmillan
Publishing Co., New York.
Evolution Scheme:
1 10 12
2 8 8
3 5 5
4 10 10
5 7 10
6 5 5
50
Course Title: Web Programming and Technics
Course Code: CO507
Year/Semester: II/II
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
• To introduce the key foundations of the Web, essential technologies and knowledge needed for web
application development, and to highlight the recent developments on the dynamic area of the Web.
1. Introduction. (2 hours)
1. History [History of the Web]
2. Internet and the web
3. Client/server computing paradigm
2. Web basics (6 hours)
1. Web documents and browsers
2. HTML, XHTML, forms, CSS
3. Crawling and information retrieval on the web
3. Server-side programming (12 hours)
1. Server-side scripting languages- PHP, JSP, Java Servlets
2. Backend database programming
3. Multi-tier architecture
4. Client-side scripting (2 hours)
1. JavaScript basics
2. JavaScript DOM
5. Web applications (4 hours)
1. Content management systems
2. Web application frameworks
3. Online information systems and solutions
6. Web 2.0 (6 hours)
1. Introduction [What Is Web 2.0]
2. Blogs, wikis, social networking and collective intelligence
3. Tagging-folksonomies
4. AJAX
7. Information representation and sharing – XML (5 hours)
1. хмl documents, DTD
2. Stylesheets and transformation – XSLT
3. Information syndication- RSS
8. Web services (3 hours)
1. Service-oriented architecture 8.2 SOAP, WSDL, REST
9. The Semantic Web (5 hours)
1. Introduction [Semantic Web – W3C]
2. RDF and Ontologies
3. Linked Open Data
51
4. Applications and Web 3.0
Practical:
Regular lab sessions can be conducted related to web design, programming, client-side scripting, working
with application framework, tools, etc.
A number of practical assignments can be given for hands-on experience on web application development.
References:
1. Slides and handouts
2. C. Jackson, “Web technologies: a computer Science Perspective
3. H. M. Deitel, “Internet and World Wide Web: How to Program”
4. G. McComb “Web Programming Languages”, John Wiley & Sons
5. Marty Hall, “Core Web Programming”, Prentice Hal PTR, Upper Saddle River, NJ 07458.
Evolution Scheme:
1 2 2
2 6 6
3 12 12
4 2 2
5 4 4
6 6 8
7 5 6
8 3 4
9 5 6
52
Course Title: Electrical Machine
Course Code: EL502
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
To impart knowledge on constructional details, operating principle and performance of Transformers, DC Machines,
1-phase and 3-phase Induction Machines, 3-phase Synchronous Machines and Fractional Kilowatt Motors
1. Magnetic Circuits and Induction (5hours)
1.1 Magnetic Circuits
1.2 Ohm’s Law for Magnetic Circuits
1.3 Series and Parallel magnetic circuits
1.4 Core with air gap
1.5 B-H relationship (Magnetization Characteristics)
1.6 Hysteresis with DC and AC excitation
1.7 Hysteresis Loss and Eddy Current Loss
1.8 Faraday’s Law of Electromagnetic Induction, Statically and Dynamically Induced EMF
1.9 Force on Current Carrying Conductor
2. Transformer (8 hours)
2.1 Constructional Details, recent trends
2.2 Working principle and EMF equation
2.3 Ideal Transformer
2.4 2.4No load and load Operation
2.5 Operation of Transformer with load
2.6 Equivalent Circuits and Phasor Diagram
2.7 Tests: Polarity Test, Open Circuit test, Short Circuit test and Equivalent Circuit Parameters
2.8 Voltage Regulation
2.9 Losses in a transformer
2.10 Efficiency, condition for maximum efficiency and all day efficiency
2.11 Instrument Transformers: Potential Transformer (PT) and Current Transformer (CT)
2.12 Auto transformer: construction, working principle and Cu saving
2.13 Three phase Transformers
3. DC Generator (6 hours)
3.1 Constructional Details and Armature Winding
3.2 Working principle and Commutator Action
3.3 EMF equation
3.4 Method of excitation: separately and self excited, Types of DC Generator
3.5 Characteristics of series, shunt and compound generator
3.6 Losses in DC generators
3.7 Efficiency and Voltage Regulation
4. DC Motor (6 hours)
4.1 Working principle and Torque equation
4.2 Back EMF
4.3 Method of excitation, Types of DC motor
53
4.4 Performance Characteristics of D.C. motors
4.5 Starting of D.C. Motors: 3 point and 4 point starters
4.6 Speed control of D.C. motors: Field Control, Armature Control
4.7 Losses and Efficiency
5. Three Phase Induction Machines (8 hours)

5.1 Three Phase Induction Motor
5.1.1 Constructional Details and Types
5.1.2 Operating Principle, Rotating Magnetic Field, Synchronous Speed, Slip, Induced EMF, Rotor
Current and its frequency, Torque Equation
5.1.3 Torque-Slip characteristics
5.2 Three Phase Induction Generator
5.2.1 Working Principle, voltage build up in an Induction Generator
5.2.2 Power Stages
6. Three Phase Synchronous Machines (6 hours)
6.1 Three Phase Synchronous Generator
6.1.1 Constructional Details, Armature Windings, Types of Rotor, Exciter
6.1.2 Working Principle
6.1.3 EMF equation, distribution factor, pitch factor
6.1.4 Armature Reaction and its effects
6.1.5 Alternator with load and its phasor diagram
6.2 Three Phase Synchronous Motor
6.2.1 Principle of operation
6.2.2 Starting methods
6.2.3 No load and Load operation, Phasor Diagram
6.2.4 Effect of Excitation and power factor control
7. Fractional Kilowatt Motors (6 hours)
7.1 Single phase Induction Motors: Construction and Characteristics
7.2 Double Field Revolving Theory
7.3 Split phase Induction Motor
7.1.1 Capacitors start and run motor
7.1.2 Reluctance start motor
7.4 Alternating Current Series motor and Universal motor
7.5 Special Purpose Machines: Stepper motor, Schrage motor and Servo motor
Practical:
1. Magnetic Circuits
- To draw B-H curve for two different sample of Iron Core
- Compare their relative permeability
2. Two Winding Transformers
- To perform turn ratio test
- To perform open circuit (OC) and short circuit (SC) test to determine equivalent circuit parameter of a
transformer and hence to determine the regulation and efficiency at full load
3. DC Generator
- To draw open circuit characteristic (OCC) of a DC shunt generator
- To draw load characteristic of shunt generator
4. DC Motor
- Speed control of DC Shunt motor by (a) armature control method (b) field control method
- To observe the effect of increasing load on DC shunt motor’s speed, armature current, and field current.
5. 3-phase Machines
- To draw torque-speed characteristics and to observe the effect of rotor resistance on torque-speed
characteristics of a 3-phase Induction Motor
- To study load characteristics of synchronous generator with (a) resistive load (b) inductive load and (c)
capacitive load
6. Fractional Kilowatt Motors
54
- To study the effect of a capacitor on the starting and running of a single-phase induction motor
- Reversing the direction of rotation of a single phase capacitor induct
References:
1 I.J. Nagrath & D.P.Kothari,” Electrical Machines”, Tata McGraw Hill
2 S. K. Bhattacharya, “Electrical Machines”, Tata McGraw Hill
3 B. L. Theraja and A. K. Theraja, “Electrical Technology (Vol-II)”, S. Chand
4 Husain Ashfaq ,” Electrical Machines”, Dhanpat Rai & Sons
5 A.E. Fitzgerald, C.Kingsley Jr and Stephen D. Umans,”Electric Machinery”, Tata McGraw Hill
6 B.R. Gupta & Vandana Singhal, “Fundamentals of Electrical Machines, New Age International
7 P. S. Bhimbra, “Electrical Machines”’ Khanna Publishers
8 Irving L.Kosow, “Electric Machine and Tranformers”, Prentice Hall of India.
9 M.G. Say, “The Performance and Design of AC machines”, Pit man & Sons.
10 Bhag S. Guru and Huseyin R. Hizirogulu, “Electric Machinery and Transformers” Oxford University Press,
2001.
Evolution Scheme:
1 5 6
2 8 10
3 6 6
4 6 6
5 8 10
6 6 6
7 6 6
55
II/II
Course Title: Applied Mathematics

Course Code: SH507
Evaluation:
Internal 50 - 50
Total 100 - 100
Course Objectives:
This course focuses on several branches of applied mathematics. The students are exposed to complex variable theory
and a study of the Fourier and Z-Transforms, topics of current importance in signal processing. The course concludes
with studies of the wave and heat equations in Cartesian and polar coordinates.
1. Complex Analysis (18 hours)

1.1 Complex Analytic Functions
1.1.1 Functions and sets in the complex plane
1.1.2 Limits and Derivatives of complex functions
1.1.3 Analytic functions. The Cauchy –Riemann equations
1.1.4 Harmonic functions and it’s conjugate
1.2 Conformal Mapping
1.2.1 Mapping
1.2.2 Some familiar functions as mappings
1.2.3 Conformal mappings and special linear functional transformations
1.2.4 Constructing conformal mappings between given domains
1.3 Integral in the Complex Plane
1.3.1 Line integrals in the complex plane
1.3.2 Basic Problems of the complex line integrals
1.3.3 Cauchy’s integral theorem
1.3.4 Cauchy’s integral formula
1.3.5 Supplementary problems
1.4 Complex Power Series, Complex Taylor series and Lauren series
1.4.1 Complex power series
1.4.2 Functions represented by power series
1.4.3 Taylor series, Taylor series of elementary functions
1.4.4 Practical methods for obtaining power series, Laurent series
1.4.5 Analyticity at infinity, zeros, singularities, residues, Cauchy's residue theorem
1.4.6 Evaluation of real integrals
2. The Z-Transform (9 hours)

2.1 Introduction
2.2 Properties of Z-Transform
2.3 Z- transform of elementary functions
2.4 Linearity properties
2.5 First shifting theorem, second shifting theorem, Initial value theorem,
2.6 Final value theorem, Convolution theorem
2.7 Some standard Z- transform
2.8 Inverse Z-Transform
2.9 Method for finding Inverse Z-Transform
2.10 Application of Z-Transform to difference equations
56
3. Partial Differential Equations (12 hours)
3.1 Linear partial differential equation of second order, their classification and solution
3.2 Solution of one dimensional wave equation, one dimensional heat equation, two dimensional heat
equation and Laplace equation (Cartesian and polar form) by variable separation method
4. Fourier Transform (6 hours)
4.1 Fourier integral theorem, Fourier sine and cosine integral; complex form of Fourier integral
4.2 Fourier transform, Fourier sine transform, Fourier cosine transform and their properties
4.3 Convolution, Parseval’s identity for Fourier transforms
4.4 Relation between Fourier transform and Laplace transform
References:
1. E. Kreyszig, “Advance Engineering Mathematics”, Fifth Edition, Wiley, New York.
2. A. V. Oppenheim, “Discrete-Time Signal Processing”, Prentice Hall, 1990.
3. K. Ogata, “Discrete-Time Control System”, Prentice Hall, Englewood Cliffs, New Jersey, 1987.
Evolution Scheme:
1 18 20
2 9 10
3 12 12
4 6 8
57
Course Title: Theory of Computation
Course Code: CO508
Evaluation:
Internal 50 - 50
Total 100 - 150
Course Objectives:
To provide the knowledge of automate, context free language, and complexity theory.
Course Contents:
1. Finite Automata and Regular Expression (5 hrs)
Finite state system, Non-deterministic finite automata, Regular expressions
2. Properties of Regular Sets (4 hrs)
The pumping lemma for regular sets, Closure properties of regular sets, Decision algorithms for regular sets
3. Context-free Grammars (8 hrs)
Derivative trees, Simplification of context- fee grammars, Normal forms.
4. Pushdown Automata (4 hrs)
Pushdown automata and context-free grammars
5. Properties of Context-free languages (CFL) (6 hrs)
The pumping lemma for CFL's Closure properties of CFL's, Decision algorithms for CFL's
6. Turing Machines (5 hrs)
Computable languages and functions, Chruch's hypothesis
7. Decidability (5 hrs)
Properties of recursive and recursively languages, Universal Turing machines and undecidable problem,
Recursive function theory
8. Computational Complexity Theory (4 hrs)
9. Intractable Problems (4 hrs)
Computable languages and functions, NP-complete problems
References Book:
1. R. McNaughton, Elementary Computability, Formal languages and Automata, Prentice Hall of India.
2. H.R Lewis, and C.H Papadimitriou, Element of the Theory of Computation, Eastern Economy Edition,
Pretice Hall of India.
3. E. Engeler, Introduction to the Theory of Computation, Academic Press.
Evolution Scheme:
1 5 6
2 4 4
3 8 10
4 4 4
5 6 6
6 5 6
7 5 6
8 4 4
58
9 4 4
Course Title: Microprocessor

Course Code: EX504
Class Load: 7 Hrs. per Week (Theory: 3 Hrs, Tutorial: 1 Hr, Practical 3 Hrs)
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
The objective of the course is to familiarize students with programming, hardware and application of microprocessor.
1. Introduction (4 hours)
1.1 Introduction and History of Microprocessors
1.2 Basic Block Diagram of a Computer
1.3 Organization of Microprocessor Based System
1.4 Bus Organization
1.5 Stored program Concept and Von Neumann Machine
1.6 Processing Cycle of a Stored Program Computer
1.7 Microinstructions and Hardwired/Microprogrammed Control Unit
1.8 Introduction to Register Transfer Language
2. Programming with 8085 Microprocessor (10 hours)
2.1 Internal Architecture and Features of 8085 microprocessor
2.2 Instruction Format and Data Format
2.3 Addressing Modes of 8085
2.4 Intel 8085 Instruction Set
2.5 Various Programs in 8085
2.5.1 Simple Programs with Arithmetic and Logical Operations
2.5.2 Conditions and Loops
2.5.3 Array and Table Processing
2.5.4 Decimal BCD Conversion
2.5.5 Multiplication and Division
3. Programming with 8086 Microprocessor (12 hours)
3.1 Internal Architecture and Features of 8086 Microprocessor
3.1.1 BIU and Components
3.1.2 EU and Components
3.1.3 EU and BIU Operations
3.1.4 Segment and Offset Address
3.2 Addressing Modes of 8086
3.3 Assembly Language Programming
3.4 High Level versus Low Level Programming
3.5 Assembly Language Syntax
3.5.1 Comments
3.5.2 Reserved words
3.5.3 Identifiers
3.5.4 Statements
3.5.5 Directives
3.5.6 Operators
3.5.7 Instructions
3.6 EXE and COM programs
3.7 Assembling, Linking and Executing
59
3.8 One Pass and Two Pass Assemblers
3.9 Keyboard and Video Services
3.10 Various Programs in 8086
3.10.1 Simple Programs for Arithmetic, Logical, String Input/Output
3.10.2 Conditions and Loops
3.10.3 Array and String Processing
3.10.4 Read and Display ASCII and Decimal Numbers
3.10.5 Displaying Numbers in Binary and Hexadecimal Formats
4. Microprocessor System (10 hours)
4.1 Pin Configuration of 8085 and 8086 Microprocessors
4.2 Bus Structure
4.2.1 Synchronous Bus
4.2.2 Asynchronous Bus
4.2.3 Read and Write Bus Timing of 8085 and 8086 Microprocessors
4.3 Memory Device Classification and Hierarchy
4.4 Interfacing I/O and Memory
4.4.1 Address Decoding
4.4.2 Unique and Non Unique Address Decoding
4.4.3 I/O Mapped I/O and Memory Mapped I/O
4.4.4 Serial and Parallel Interfaces
4.4.5 I/O Address Decoding with NAND and Block Decoders (8085, 8086)
4.4.6 Memory Address Decoding with NAND, Block and PROM Decoders (8085, 8086)
4.5 Parallel Interface
4.5.1 Modes: Simple, Wait, Single Handshaking and Double Handshaking
4.5.2 Introduction to Programmable Peripheral Interface (PPI)
4.6 Serial Interface
4.6.1 Synchronous and Asynchronous Transmission
4.6.2 Serial Interface Standards: RS232, RS423, RS422, USB
4.6.3 Introduction to USART
4.7 Introduction to Direct Memory Access (DMA) and DMA Controllers
5. Interrupt Operations (5 hours)
5.1 Polling versus Interrupt
5.2 Interrupt Processing Sequence
5.3 Interrupt Service Routine
5.4 Interrupt Processing in 8085
5.4.1 Interrupt Pins and Priorities
5.4.2 Using Programmable Interrupt Controllers (PIC)
5.4.3 Interrupt Instructions
5.5 Interrupt Processing in 8086
5.5.1 Interrupt Pins
5.5.2 Interrupt Vector Table and its Organization
5.5.3 Software and Hardware Interrupts
5.5.4 Interrupt Priorities
6. Advanced Topics (4 hours)
6.1 Multiprocessing Systems
6.1.1 Real and Pseudo-Parallelism
6.1.2 Flynn’s Classification
6.1.3 Instruction Level, Thread Level and Process Level Parallelism
6.1.4 Interprocess Communication, Resource Allocation and Deadlock
6.1.5 Features of Typical Operating System
6.2 Different Microprocessor Architectures
6.2.1 Register Based and Accumulator Based Architecture
6.2.2 RISC and CISC Architectures
6.2.3 Digital Signal Processors
60
Practical:
There will be about 12 lab exercises to program 8085 and 8086 microprocessors.
References:
1. Ramesh S. Gaonkar, “Microprocessor Architecture, Programming and Application with 8085”, 5th Edition
2002, Prentice Hall
2. Peter Abel, “IBM PC Assembly Language and Programming”, 5 th Edition 2001, Pearson Education Inc.
3. D. V. Hall, “Microprocessor and Interfacing, Programming and Hardware”, 2nd Edition 1999, Tata McGraw
Hill
4. John Uffenbeck, “Microcomputers and Microprocessors, The 8080, 8085 and Z-80 Programming, Interfacing
and Troubleshooting” 3rd Edition 1999, Prentice Hall
5. Walter A. Triebel and Avtar Singh, “The 8088 and 8086 Microprocessors, Programming, Interfacing, Software,
Hardware and Applications”, 4th Edition 2003, Prentice Hall
6. William Stalling, “Computer Organization and Architecture”, 8th Edition 2009, Prentice Hall
Evolution Scheme:
1 4 4
2 10 12
3 12 12
4 10 12
5 5 6
6 4 4
61
Course Title: Instrumenttion
Course Code: EL503
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives:
After completion of his course the students will be able to
- Have a clear knowledge of the basic laws governing the operation of the instruments, relevant circuits and
their working
- Understand general instrument system, error, calibration etc.
- Understand analog and digital techniques used for the conversion of data..
- Elaborate discussions on storage & display devices.
- Gain exposure to various transducers, conditioning circuits and data acquisition system.
1. Instrumentation Systems (4 hrs)

1.1 Introduction of instrumentation system, Block diagram, Functional elements of the instrumentation system
and their functions
1.2 Application of measurement instrumentation
1.3 Introduction of analog and digital instrumentation systems, comparison
1.4 Classification of measuring instruments – different aspects
2. Theory of measurement (6 hrs)
2.1 Introduction and importance of performance characteristics of measuring instruments
2.2 Static performance parameters – accuracy, precision, sensitivity, linearity, resolution, input impedance,
loading effect
2.3 Dynamic performance parameters - Speed of response, dynamic error, dynamic sensitivity, frequency
response, band width
2.4 Errors in measurement
2.5 Statistical analysis of errors in measurement
3. Transducer – Measurement of non-electrical quantities (8 hrs)
3.1 Introduction
3.2 Classification
3.3 Application
3.3.1 Measurement of mechanical variables – displacement, strain, velocity and acceleration
3.3.2 Measurement of process variables – temperature, pressure, liquid level, fluid flow, humidity
3.3.3 Measurement of bio-physical variables – blood pressure, myo-electric potential
4. Measurement of electrical quantities (4 hrs)
4.1 Measurement of voltage and current (moving coil and moving iron instruments)
4.2 Measurement of low, medium and high resistances
4.3 Ac bridges for the measurement of inductance and capacitance
5. Electrical signal processing and data transmission (4 hrs)
5.1 Basic Op-amp characteristics
5.2 Application of Op-amp circuits for signal conditioning – signal amplification, addition, subtraction,
multiplication, division, integration, differentiation, network isolation
5.3 Instrumentation amplifier
62
5.4 Electro-optic conversion devices, fiber optics, optical communication system, comparison with conventional
communication system
6. Data conversion : analog – digital and digital – analog conversions (7 hrs)

6.1 Analog and digital signal
6.2 Importance and need of data conversion
6.3 Digital to analog converters – Weighted resistor type, R-2R ladder type, DAC errors
6.4 Analog to digital conversion – Successive approximation type, ramp type, dual ramp type, flash type, ADC
errors
7. Digital instrumentation (4 hrs)
7.1 Sampling, sampled data, sample and hold circuits
7.2 Data Acquisition System (DAC) and its components
8. Electrical equipment (8 hrs)
8.1 Wattmeter
8.1.1 Types
8.1.2 working principles
8.2 Energy meter
8.2.1 Types
8.3 Frequency meter
8.3.1 Types
8.4 Power factor meter
8.5 Instrument transformers
LABORATORY ASSIGNMENT
1. Accuracy test in analog meters
2. Op-Amps in instrumentation
- Use of op-amp as a summer, inverter, integrator and differentiator
3. Study of transducers for the measurement of linear displacement and strain
-Use of resistive, inductive and capacitive transducers to measure displacement
-Use strain gauge transducer to measure force
4. Study of various transducers for measurement of angular displacement, angular velocity, pressure and flow
- Use optical, Hall effect and inductive transducer to measure angular displacement
- Use tacho-generator to measure angular velocity
- Use RTD transducers to measure pressure and flow
REFERENCES
1. A course in Electronics and Electrical Measurements and Instrumentation – J.B.Gupta
2. A course in Electrical and Electronics Measurements and Instrumentation – A.K.Sawhney
3. Measurement System, Application and Design – E.O.Deobelin, McGraw Hill
4. Electronic Instrumentation – H.S.Kalsi
Evolution Scheme:
1 4 4
2 6 8
3 8 10
4 4 4
5 4 4
6 7 8
7 4 4
8 8 8
63
Course Title: ICT Project Management

Course Code: CO509
Evaluation:
Internal 50 - 50
Total 100 - 100
Course Objectives:
• Main objective of this course is to provide exposure to the student in the area of Software Project Management
as a new management framework uniquely suited to the complexities of modern software development process.
• This course discusses the software engineering approach to modern software development process (Unified
Process).
Course Contents:
1. Software Management Practice and Software Economics (12 Hrs.)
Conventional Software Management Theory and Practice, Software Economics and Cost Estimation,
Improving Software Economics, Software Process, Team Effectiveness and Software Environment; Quality
Target, Principles of Conventional Software Engineering, Principles of Modern Software Management,
Iterative Process
2. Software Process Primitives and Process Management Framework (14 Hrs.)
Software Process Life-Cycle Phases, Various Elements of the Software Process (Management, Engineering
and Pragmatic), Technical and Management Perspective of Software Architecture, Software Process Workflow
and Iteration Workflow, Status Monitoring - Software Process Checkpoints and Milestones
3. Techniques of Planning, Controlling and Automating Software Process (15 Hrs.)
Iterative Process Planning (Process Work Breakdown Structure , Planning Guidelines, Cost and Schedule
Estimation Process, Iteration Planning Process), Project Organisation and Responsibilities, Process
Automation - Tools and Environment, Project Control and Process Automation, Process Customisation.
4. Modern Approach to Software Project and Economics (4 Hrs.)
Elements of Modern Software Projects and Management Principles, Next-Generation Software Economics and
Cost Models, Modern Process Transition - Paradigm Shifts
Reference Book:
Conway, K., Software Project Management - From Concept to Deployment, IDG Books, 2010
Royce, W., Software Project Management - A Unified Framework, Addison-Wesley, 2010
Evolution Scheme:
1 12 14
2 14 16
3 15 16
4 4 4
64
Course Title: Communication English
Course Code: SH508
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives:
• Make the students capable of producing professional writings such as research articles, technical proposals,
reports and project work.
• To familiarize the students with the native speakers' pronunciation with the use of audio-visual aids.
Unit I: Reading (15 hours)
1. Intensive Reading 8 hours
1.1. Comprehension
1.2. Note-taking
1.3. Summary writing
1.4. Contextual questions based on facts and imagination
1.5. Interpreting text
2. Extensive Reading 5 hours
2.1. Title/Topic Speculation
2.2. Finding theme
2.3. Sketching character
3. Contextual Grammar 2 hours
3.1. Sequence of tense
3.2. Voice
3.3. Subject-Verb agreement
3.4. Conditional Sentences
3.5. Preposition
Unit II: Writing (30 hours)
1. Introduction to technical writing process 2 hours
1.1. Composing and editing strategies
1.2. MLA and APA comparison
2. Writing notices with agenda and minutes 2 hours
2.1. Introduction
2.2. Purpose
2.3. Process
3. Writing Proposal 6 hours
3.1. Introduction
3.2. Parts of the proposal
3.2.1. Title page
3.2.2. Abstract/Summary
3.2.3. Statement of Problem
3.2.4. Rationale
3.2.5. Objectives
3.2.6. Procedure/Methodology
65
3.2.7. Cost estimate or Budget
3.2.8. Time management/Schedule
3.2.9. Summary
3.2.10. Conclusion
3.2.11. Evaluation or follow-up
3.2.12. Works cited
4. Reports
4.1. Informal Reports 6 hours
4.1.1. Memo Report
4.1.1.1. Introduction
4.1.1.2. Parts
4.1.2. Letter Report
4.1.2.1. Introduction
4.1.2.2. Parts
4.2. Project/Field Report 3 hours
4.2.1. Introduction
4.2.2. Parts
4.3. Formal report 9 hours
4.3.1. Introduction
4.3.2. Types of Formal Reports
4.3.2.1. Progress Report
4.3.2.2. Feasibility Report
4.3.2.3. Empirical/ Research Report
4.3.2.4. Technical Report
4.3.3. Parts and Components of Formal Report
4.3.3.1. Preliminary section
4.3.3.1.1. Cover page
4.3.3.1.2. Letter of transmittal/Preface
4.3.3.1.3. Title page
4.3.3.1.4. Acknowledgements
4.3.3.1.5. Table of Contents
4.3.3.1.6. List of figures and tables
4.3.3.1.7. Abstract/Executive summary
4.3.3.2. Main Section
4.3.3.2.1. Introduction
4.3.3.2.2. Discussion/Body
4.3.3.2.3. Summary/Conclusion
4.3.3.2.4. Recommendations
4.3.3.3. 4.3.3.3 Documentation
4.3.3.3.1. Notes (Contextual/foot notes)
4.3.3.3.2. Bibliography
4.3.3.3.3. Appendix
5. Writing Research Articles 2 hours

5.1. Introduction
5.2. Procedures
References
1. Adhikari, Usha : Yadv, Rajkumar : Shrestha, Rup Narayan ; (2000) Communicative Skills in english,Research
Training Unit, IOE, Pulchowk Campus
2. Khanal, Ramnath, (2008) Need-based Language Teaching (Analysis in Relation to Teaching of English for
Profession Oriented Learners) Kathmandu : D, Khanal.
3. Konar, Nira (2010), Communication Skills for Professional PHI Learning Private Limited, New Delhi.
4. Kumar, Ranjit (2006), Research Methodology, Pearson Education.
5. Laxminarayan, K.R (2001), English for Technical Communication. Chennai; Scitech
publications (India) Pvt. Ltd.
6. Mishra, Sunita et. al. (2004), Communication Skills for Engineers, Pearson
66
Education First Indian print.
7. Prasad, P. et. al (2007), The functional Aspects of Communication Skills S.K. Kataria & sons.
8. Rutherfoord, Andrea J. Ph.D (2001), Basic Communication Skills for Technology, Pearson
Education Asia.
9. Rizvi, M. Ashraf (2008), Effective Technical Communication. Tata Mc Graw Hill.
10. Reinking A James et. al (1999), Strategies for Successful Writing: A rhetoric, research guide, reader and
handbook, Prentice Hall Upper Saddle River, New Jersey.
11. Sharma R.C. et al. (2009), Business Correspondence and Report Writing: A Practical Approach to Business and
Technical communication. Tata Mc Graw Hill.
12. Sharma, Sangeeta et. al (2010) Communication skills for Engineers and Scientists, PHI Learning Private Limited,
New Delhi.
13. Taylor, Shirley et. al. (2009), Model Business letters, E-mails & other
Business documents, Pearson Education.
Language lab 30 hours

Listening 12 hours
Activity I General instruction on effective listening, factors influencing listening, and 2 hours
note-taking to ensure ttention.
(Equipment Required: Laptop, multimedia, laser pointer, overhead projector,
power point, DVD, video set, screen)
Activity II : Listening to recorded authentic instruction followed by exercises. 2 hours
(Equipment Required: Cassette player or laptop)
Activity III Listening to recorded authentic description followed by exercises. 4 hours
Activity IV Listening to recorded authentic conversation followed by exercises 4 hours

Speaking 18 hours
Activity I General instruction on effective speaking ensuring audience's attention, 2 hours
comprehension and efficient use of Audio-visual aids.
(Equipment Required: Laptop, multimedia, laser pointer, DVD, video, overhead

projector, power point, screen)
Activity II Making students express their individual views on the assigned topics 2 hours
(Equipment Required: Microphone, movie camera)
Activity III Getting students to participate in group discussion on the assigned topics 4 hours
Activity IV Making students deliver talk either individually or in group on the assigned 8 hours
topics
(Equipment Required: Overhead projector, microphone, power point, laser
pointer
multimedia, video camera, screen)
Activity V Getting students to present their brief oral reports individually on the topics of 2 hours
their choice.
(Equipment Required: Overhead projector, microphone, power point, laser
pointer
multimedia, video camera, screen)
Evolution Scheme:
Unit I 1 8 10
2 5 5
3 2 3
Unit II 1 2 3
67
2 2 3
3 6 4
4 18 20
5 2 2
Course Title: Engineering Project Work -III

Course Code: CO510
Evaluation:
Internal - 50 50
Total - 100 100
Course Objectives:
1. To provide the knowledge of any programming language to carrying out a project. During the project
students learn how to develop basic web application using programming language.
3. To provide the knowledge to formulate project documentation and oral presentation for his/her next year
project.
2. A mid-term progress report to be submitted. An oral presentation (15 minutes + 15 minutes for questions)
to be given.
The mini project document shall include the following items.

1. Project team members should not be exceeded six
68
III/I
Course Title: Computer Graphics

Course Code: CO511
Year/Semester: III/I
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
To be familiar with the basic techniques used in computer graphics systems.
Course Contents:
1 Introduction (3 hrs)
History of computer graphics, Applications of computer graphics
2 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.
3 Two-Dimensional Algorithms (12 hrs)
Direct and incremental line drawing algorithms, Bresenham algorithms, Two-dimensional object to screen
viewing transforms, Two-dimensional rotation, scaling and translation transforms, Recent transform
concepts and advantages, Data structure concepts and CAP packages.
4 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 non-planar 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.
6 Project Development (4 hrs)
Project planning and description, project development, Project report and presentation
Laboratory:
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.
Text Book:
1 Hearn and Baker, Computer Graphics, Prentice- Hall of India Private Limited.
Evolution Scheme:
1 3 4
69
2 8 8
3 12 12
4 6 8
5 12 12
6 4 6
Course Title: Engineering Economics

Course Code: SH509
Class Load: 3Hrs. per Week (Theory: 3 Hrs, 1 Tutorial)
Evaluation:
Internal 50 50
Total 100 100
Course Objectives:
The objective of this course is to develop students’ knowledge and skill in applying economic principles in engineering
field on developing products, systems and processes.
Course Contents:
1. Introduction (4hrs)
Meaning, importance and principles of Engineering Economy; Cost terminology
2. Time Value of Money (6 hrs)
Introduction; Simple Interest, Compound Interest, Concept of equivalence; Cash flow diagrams and tables; Use
of Interest Tables; Nominal and Effective Rate of Interest; Discount; Continuous compounding; Different types
of cash flows;
3. Project Evaluation (8 hrs)
Determining Minimum Attractive (Acceptable) Rate of Return (MARR); Payback Period Method; Present
Worth Method; Future Worth Method; Annual Worth Method; Rate of Return Methods -Internal Rate of
Return, Modified Rate of Return Method; Lifecycle Costing
4. Cost Benefit Analysis (4 hrs)
Meaning and importance of cost benefit analysis; Perspective and terminology for analyzing public projects;
Benefit- cost ratio method; Evaluating independent and mutually exclusive projects by B-C ratio; Limitations
of the B-C ratio.
5. Depreciation (4 hours)
Basic concept and terminology; Straight line method; Declining balance method; Sum of the year digit method;
Sinking fund method; Modified accelerated cost recovery system.
6. Replacement Analysis (8 hours)
Meaning and need for replacement analysis; Factors to be considered in replacement analysis; Determining
economic life of a new and existing assets; Comparison of useful life of new and existing assets; Comparison
and selection of mutually exclusive alternatives
7. Breakeven and Sensitivity Analysis (6 hours)
Break even analysis; Sensitivity analysis; Multiple factor sensitivity analysis
8. Basic Accounting (5 hours)
Balance sheet and PL statement; Basics of business transactions: Debit and credit, Double entry Book Keeping,
Journal, Types of Journal entries, Ledger, Relation between Journal and Ledger; Taxation Law - taxes on
normal gain, capital gain, personal tax, corporate tax and VAT.
References:
William G. Sullivan, Elin M. Wicks and C. Patrick Koelling, Engineering Economy, Pearson India
70
E. Paul De Garmo, William G. Sullivan and James A. Bonta delli, Engineering Economy, MC Milan
Publishing Company
N.N. Borish and S. Kaplan, Economic Analysis for Engineering and Managerial Decision Making, MC
Gran Hill Publishing Company
Evolution Scheme:
1 4 4
2 6 6
3 8 10
4 4 4
5 4 4
6 8 10
7 6 8
8 5 4
71
Course Title: Data Communication
Course Code: EX505
Year/Semester: II/I
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objective:
To familiarize student with the concept of data communication, communication signals and their characteristics,
transmission media and their characteristics, basics of multiplexing and switching.
1. Introduction 4hrs
1.1 Data and Signal
1.2 Analog and Digital Signal
1.3 Data Representation
1.4 Analog and Digital Data Communication System
1.5 Transmission Impairments (Attenuation, Noise, Distortion)
2. Signals and Systems 4hrs
2.1 Signal and Classification of Signals: Periodic and Non-periodic Signals, Deterministic and Random Signals,
Energy and Power Signals, Continuous Time and Discrete Time Signals
2.2 Systems and Basic Properties of Systems : System with and without memory, Linearity, Time Invariance,
Invertibility, Casuality, Stability
3. Signal Analysis 5hrs
3.1 Unit Impulse Function and Unit Step Function
3.2 LTI System and Impulse Response
3.3 Fourier Series Representation of Continuous Time Signal
3.4 Fourier Transform of Continuous Time Signal
3.5 Spectral Analysis of a Signal Bandwidth
4. Transmission Media 4hrs
4.1 Electromagnetic Spectrum for Communication and Type of Propagation
4.2 Guided Transmission Media: Copper Media (Twisted Pair and Coaxial) and Fiber Optics
4.3 Unguided Communication Bands and Antennas
4.4 Data Rate Limits : Nyquist Bit Rate for Noisy Channel, Shannon Capacity for Noisy Channel
4.5 Performance of Channel : Bandwidth, Throughput, Latency, Jitter, Bit Error Rate (BER)
5. Data Encoding and Modulation 12hrs
5.1 Baseband Communication (Analog/Digital)
5.2 Data Encoding and Modulation
5.3 Types of Analog Modulation : Amplitude Modulation, Frequency Modulation and Phase Modulation
5.4 Pulse Modulation System : Pulse Amplitude Modulation(PAM), Pulse Width Modulation(PWM)
5.5 Encoding Analog Data as Digital Signal : Pulse Code Modulation (PCM)
5.6 Encoding Digital Data as Digital Signals
5.7 Line Coding Schemes : NRZ, RZ, Manchester, AMI
5.8 Block Coding, Scrambling
72
5.9 Digital Modulation : Amplitude Shift Keying (ASK), Frequency Shift Keying (FSK), Phase Shift Keying
(PSK), Quadrature Amplitude Modulation (QAM)
6. Multiplexing and Spreading 6hrs
6.1 Multiplexing and Application
6.2 Frequency Division Multiplexing (FDM), Wavelength Division . Multiplexing (WDM)
6.3 Time Division Multiplexing (TDM)
6.4 Spread Spectrum
6.5 Code-Division Multiple Access (CDMA)
7. Switching 4hrs
7.1 Switching and Application
7.2 Circuit Switching and Packet Switching
7.3 Datagram Switching and Viral Circuit Switching
7.4 X.25, Frame Relay, ATM
8. Information Theory and Coding 6hrs
8.1 Introduction to Information Theory, Average Information
8.2 Source Coding – Human Coding
8.3 Error Detection and Correction Codes
8.4 Hamming Distance
8.5 Linear Block Coding
8.6 Cyclic Codes, CRC
8.7 Convolution Codes
Practical:
1. Signal Analysis using MATLAB
2. Bandwidth analysis of different signals using spectrum analyzer
3. Analog Modulation Generation Reconstruction
4. Pulse Modulation Generation Reconstruction
5. Conversion of given binary sequence into different line coding
6. Digital Modulation (ASK, FSK, PSK) Generation Reconstruction
References:
1. William Stalling, “Data and computer communications”
2. Behrouz A Forouzan, “Data communication and networking”
3. A.V. Oppenheim, “Signals and systems”
4. A.s. Tanenbaum, “Computer Networks”
Evolution Scheme:
1 4 4
2 4 4
3 5 6
4 4 4
5 12 16
6 6 6
7 4 4
8 6 6
73
Course Title: Data Structure and Algorithm
Course Code: CO512
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
• To provide fundamental knowledge of various data structures and their implementation
• To provide the fundamental knowledge of various algorithms and their analysis
1.0 Concept of data structure ( 2 hours )

1.1. Introduction: data types, data structures and abstract data types
1.2. Introduction to algorithms
2.0 The Stack and Queue ( 6 hours )
2.1. Stack operation
2.2. Stack application: Evaluation of Infix, Postfix and Prefix expressions
2.3. Operations in queue, Enqueue and Dequeue
2.4. Linear, circular and Priority queue
3.0 List ( 3 hours )
3.1. Definition
3.1.1. Static and dynamic list structure
3.1.2. Array implementation of lists
3.1.3. Queues as list
4.0 Linked lists ( 5 hours )
4.1. Dynamic implementation
4.2. Operations in linked list
4.3. Linked stacks and queues
4.4. Doubly linked lists and its applications
5.0 Recursion ( 4 hours )
5.1. Principle of recursion
5.2. TOH and Fibonacci sequence
5.3. Applications of recursion
6.0 Trees ( 7 hours )
6.1. Concept
6.2. Operation in Binary tree
6.3. Tree search, insertion/deletions
6.4. Tree traversals (pre-order, post-order and in-order)
6.5. Height, level and depth of a tree
6.6. AVL balanced trees and Balancing algorithm
6.7. The Huffman algorithm
74
6.8. B-Tree and Red Black Tree
7.0 Sorting ( 5 hours )
7.1. Types of sorting: internal and external
7.2. Insertion and selection sort
7.3. Exchange sort
7.4. Merge and Redix sort
7.5. Shell sort
7.6. Heap sort as a priority queue
7.7. Big ‘O’ notation and Efficiency of sorting
8.0 Searching ( 5 hours )
8.1. Search technique
8.2. Sequential, Binary and Tree search
8.3. General search tree
8.4. Hashing
8.4.1. Hash function and hash tables
8.4.2. Collision resolution technique
9.0 Growth Functions ( 2 hours)
9.1. Asymptotic notations:  , O,  , o,  notations and their properties
10.0 Graphs ( 6 hours )
10.1. Representation and applications
10.2. Transitive closure
10.3. Warshall’s algorithm
10.4. Graphs type
10.5. Graph traversal and Spanning forests
10.5.1. Depth First Traversal and Breadth First Traversal
10.5.2. Topological sorting: Depth first, Breadth first topological sorting
10.5.3. Minimum spanning trees, Prim’s, Kruskal’s and Round-Robin algorithms
10.6. Shortest-path algorithm
10.6.1. Greedy algorithm
10.6.2. Dijkstra’s Algorithm
Laboratory
There shall be 10 to 12 lab exercises based on C or C++
1. Implementation of stack
2. Implementations of linear and circular queues
2.1. Solutions of TOH and Fibonacci sequence by Recursion
3. Implementations of linked list: singly and doubly linked list
4. Implementation of trees: AVL trees, and balancing
5. Implementation of Merge sort
6. Implementation of search: sequential, Binary and Tree search
7. Implementation of Graphs: Graph Traversals
8. Implementation of hashing
9. Implementation of Heap
References
1. Y. Langsam, M. J. Augenstein and A. M Tenenbaum, “Data Structures using C and C++”, PHI
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, “Introduction to Algorithms”, PHI
3. G.W. Rowe, “Introduction to Data Structure and Algorithms with C and C++”, PHI
4. R. L. Kruse, B. P. Leung, C. L. Tondo, “Data Structure and Program design in C”, PHI
5. G. Brassard and P. Bratley, “Fundamentals of Algorithms”, PHI
Evolution Scheme:
1 2 2
2 6 6
75
3 3 3
4 5 6
5 7 8
6 5 6
7 5 6
8 5 5
9 2 2
10 6 6
Course Title: Probability and Statistics

Course Code: SH510
Evaluation:
Internal 50 - 50
Total 100 - 100
Course Objectives:
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.
3. Random Variable and Probability Distribution (12 hrs)
Discrete random variable, Probability mass function, Expectation and laws expectation, Sum and
Product, discrete probability distribution, Poisson, Hyper Geometric and negative binomial, continuous
random variable, Probability density, Function cumulative distribution functions, Expected values of
continuous random variables, continuous probability distribution-rectangular, Negative exponential,
Gamma, Beta and normal distribution.
4. Bivariate Random Variables and Joint Probability Distribution (3 hrs)
Joint probability distribution, Marginal probability function, Conditional probability function (discrete
and continuous cases), Sums and average of random variables, The central limit theorem.
5. Point Estimation (3 hrs)
Population and sample, Concept of point estimation, Parameter and statistic, Criteria of good estimator
6. Testing of Hypothesis (10 hrs)
Concept of hypothesis, Types of hypothesis, types of errors, Acceptance and critical regions, Concept
and uses of standard error, Level of significance, procedure of testing of hypothesis, Hypothesis testing
procedure based on large samples (Z-test), Test for single proportion and difference of two proportions,
test for single mean of a population and difference of two population means, Hypothesis testing
procedures based on small samples t-test for mean for a normal population, t-test for the difference of
mean of two normal populations, paired t-test.
76
7. Hypothesis Testing Based on Two Samples (2 hrs)
Confidence interval for a population, confidence interval for a population mean(small and large sample
cases)
8. 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, inferences concerning muX.Y and the prediction of
future values. Test of reliability of the fitted regression equation (coefficient of determination, R2),
Simple correlation, Speaman’s rank correlation coefficient .
References:
1. Johnson, Richard A., probability and Statistics for Engineers, 5th Edition, Prentic Hall of Indian Private
Ltd, New Delhi, 1994
2. Sayami, S.B. : Manual on Statistics Nepal Engineering College, Kathmandu, 1997.
3. Sing, M.L. : Statistical Methods (for all gratitude level students), J.M. Sing publication, Kathmandu,
1999.
4. Jay L. Devore, Probability and Statistics for Engineering and the Sciences, Brools/Core publication
Company, Monetery, California, 1982.
5. Stirzaker, David, Elementary Probability, Cambridge University Press, 1996.
6. Frank, Harry and Steven C. Althoen, Statistics, Cambridge University Press, 1995.
Evaluation Scheme:
1 5 6
2 5 6
3 12 12
4 3 4
5 3 4
6 10 10
7 2 3
8 5 5
77
Course Title: Software Engineering
Course Code: CO513
Evaluation:
Internal 50 50 100
Total 100 50 150
Course Objectives:
• To introduce the concepts and techniques required to direct and control the development of medium to large-
scale software, including project management, quality assurance, software process improvement and
software metrics:
• To broaden student's understanding of possible software development paradigms (e g . structured analysis
and design. object-oriented approaches);
• To explore some of the problems of software maintenance.
Course Contents:
l. Software Project Management Concepts (2 Hrs.)
Software: Crisis and Myths, Software Process and Process Models. Process technology, Product and Process,
People, Product, Process, Project.
2. Software Metrics (3 Hrs.)
Measures, Metrics, and Indicators: Software Measurement. Metrics for software quality, Statistical Quality
Control . Metrics for Small Organizations
3. Software Project Planning and Risk (3 Hrs.)
Objectives, Scope, Resources . Project Estimation, Decomposition Techniques . Empirical Estimation
Models, Risk Management Strategies. Software Risks. Risk Identification, Risk Projection
4. Software Quality Assurance (5 Hrs.)
Concepts, Software Quality Assurance. Software Reviews, Formal Technical Reviews. Formal Approaches
to SQA. Statistical Quality Assurance. Software Reliability, ISO 9000 Quality Standards. SQA Plan
5. Software Configuration Management (4 Hrs.)

Software Configuration Management, SCM Process. Identification of Objects in the Software Configuration.
Version Control, Change Control. Configuration Audit. Status Reporting. SCM Standards
6. Analysis Concepts and Principles (5 Hrs.)
Requirements Analysis, Analysis Principles. Software Prototyping. Specification and Specification Review,
Analysis Modeling: Elements of Analysis Model. Data Modeling Functional Modeling and Information
Flow, Behavioral Modeling. Structured Analysis- Data Dictionary
7. Design Concepts and Principles (6 Hrs)
78
Design Process, Principles and Concepts, Architectural and Component Level Design: Software
Architecture. Data Design. Architectural Styles. Mapping Requirements into a Software Architecture,
Transform Mapping. Transaction Mapping. Structured Programming. Comparison of Design Notation
8. Software Testing Techniques and Strategies (7 Hrs)
Testing Fundamentals, Test Case Design. White Box Testing. Basis Path Testing, Control Structure Testing.
Black-Box Testing. Unit Testing, Integration Testing, Validation Testing, System Testing
9. Object-Oriented Concepts and Principles (4 Hrs)
Object-Oriented Paradigm. Object-Oriented Concepts. Identifying the Elements of an Object Model.
Management of Object-Oriented Software Projects
10. Object-Oriented Analysis and Design (6 Hrs.)
Domain Analysis. Components of the OO Analysis Model. The OOA Process. Design for Object-Oriented
Systems. The System Design Process, The Object Design Process, Design Patterns
Laboratory Exercises:
The Laboratory Exercise includes System Analysis. Design. Development, Testing. Debugging of a small
Real Life problem and then attempting to visualize various Software Engineering activities. like Revision
Control System. Version Management. Library Building, etc. using some of the Software Engineering Tool
or CASE Tool
Fieldwork (3 Days)
Demonstration of the attempting to visualize various Software Engineering activities in different software
company and in field (attendance in fieldwork is compulsory).
Reference Book:
1. Mall. R.. Foundations of Software Engineering. PHI. 2009
2. Pressman. R. S., Software Engineering a practitioners Approach. 5 th Edition. McGraw Hill. 2010
3. Somnterville. I .Software Engineering,. Addison –Wesley.
Evaluation Scheme
1 2 2
2 3 4
3 3 4
4 5 6
5 4 4
6 5 6
7 6 6
8 7 8
9 4 4
10 6 6
79
Course Title: Computer Organization and Architecture
Course Code: CO514
Evaluation:
Internal 50 - 50
Total 100 - 100
Course Objectives:
To study basic and Architectural Concepts of Computer
Course Contents:
SSI and MSI circuits, mile stone in computer organization, examples of computer families, future trends in
computer, designing for performance, Pentium and power PC evolution
2. Central Processing unit (8 hrs)
Arithmetic and Logic unit, addition, subtraction , multiplication and division algorithms, Instruction sets,
Addressing modes and formats, Stack, Processor organization, Register organization, Instruction cycle,
Pentium processor, Power PC processor.
3. Control Unit Design (8 hrs)
Micro-operations, Control of CPU, Hardwired implementation, Micro-instruction sequencing, Micro-
instruction execution, Application of micro-programming, program control, RISC and CICS.
4. Input/ Output Organization (7 hrs)
External devices, I/O modules, Programmed I/O, Interrupt Driven I/O Direct memory access, I/O channels
and processors, External interfaces, Data communication processor, bus architecture.
5. Memory organization (8 hrs)
computer memory system overview, Semiconductor main memory Cache memory, Advanced DRAM
organization, Magnetic disk, RAID, Optical memory, Magnetic tape, Memory management hardware.
6. Operating System Support (6 hrs)

Operating system overview, scheduling, memory management: Concept of Virtual Memory,
Partitioning, Paging, Segmentation
7. Pipeline and vector processing (5 hrs)
Parallel processing, introduction to pipelining, arithmetic pipelining, instruction pipelining, RISC pipelining,
vector processing, array processing
Reference Books:
1. W. Stalling, Computer Organization and Architecture, Prentice-Hall India Limited, New Delhi.
2. A.J Vande Goor, Computer Architecture and Design.
3. A.S Tanenbaum, Structured Computer Organization, Prentice Hall India Limited, new Delhi.
80
4. G. Wilkinson, Computer Architecture Design and Performance.
Evaluation Scheme:
1 3 4
2 8 10
3 8 8
4 7 8
5 8 8
6 6 6
7 5 6
81
III/II
Course Title: Computer Networks

Course Code: CO515
Year/Semester: III/II
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives:
Computer Networks involves the study of computer systems, computer communications and computer networks. The
course includes different kinds of networking topologies and their structure and design. This course also covers the
telephone system, electronic email, data flows, networking protocols, and organization around ISO-OSI seven-layer
architecture, with review of each layer.
1. Background study and Revision (1 hrs)

Introduction and necessity of computer Networking; Different types of multiplexing: Simplex, Duplex, Half
Duplex
2. Introduction to Network Topologies (3 hrs)
Definition, use and prospect of LAN; Types of networking: LAN, WAN, MAN, Extra-Net, Intra-Net and
Inter-Net
3. Network Architecture (3 hrs)
Star, Clustered Star, Bus, Ring: Logical and Physical, Client Server Network Model; Peer-to-peer Network
architecture model; Wireless LAN
4. Reference Model (6 hrs)
Network software, Protocol Hierarchy and its need, Interfaces and Services; Introduction of OSI Reference
Model
5. Physical layers and its Design issues (5 hrs)
Twisted Pair Cable; Co-axial Cable; Base-band Cable; Broad-band Cable; Fiber Optics; Wireless Networking;
Physical Layer Devices (Hub, Repeaters); Introduction of Frame Relay, ATM, ISDN, PSTN and X.25.
6. Data Link Layers (6 hrs)
Services and Data Link Layer Devices (Switch, Bridge); Framing, Flow Control and
Error Control; Elementary Data link Protocols; Sliding Window Protocols; HDLC,
SLIP and PPP; Media Access Control Layer (Carrier Sense Multiple Access/Collision Detection)
7. TCP / IP Reference Model (6 hrs)
Introduction of TCP / IP Model; Comparison with OSI Reference Model; IPV4 Frame Format; IP Addresses
and Classes; Subnet and Subnet mask; Introduction of IPV6
8. Network Layer and Internet Layer (6 hrs)
Network Layer and Design Issues; Virtual Circuit and Data grams Subject; Introduction of Routing- Shortest
path Routing Algorithm, Flow Based Routing Algorithm, Distance Vector Routing Algorithm, Spanning Tree
Routing; Congestion Control; Traffic Shaping and Leaky Bucket Algorithm
9. Network Severs and Protocols (3 hrs)
HTTP, DHCP; SMTP, DNS, PROXY, FTP, POP and IMAP; Examples of Clients, Servers Tools and Virtual
private Networks
10. Network Management and Security: (3 hrs)
Introduction to Network management, Internet Network-Management framework (SMI & HIB) & SNMP
protocol; Data encryption, Data Encryption standard; Principles of Cryptography (Symmetric Key & public
key Encryption), Integrity & firewalls
11. Introduction to Socket Programming: (3 hrs)
Clint/Server Computing: - Distributed Applications (Web Technology), Distributed processing (Three-Tier
Architecture); Introduction to socket calls & operating system calls; TCP socket calls & UDP Socket calls.
Laboratory:
82
1. Setting up Client /Server Architecture system using Microsoft product and Linux
2. Understanding Route interface and Basic Router using Route simulator.
3. Understanding the socket Interface and window Socket API.
Fieldwork (3 Days)
Demonstration of the attempting to visualize various V-SATactivities in different software company and in field
(attendance in fieldwork is compulsory).
Reference Book:
1. Computer Networks by Andrew S. Tanenbaum.
2. Date and Computer communications by William Stalling.
3. Computer networking by James F. kurose, keith W. Ross.
4. Internet programming by KNJ Jamsa and ken cope.
5. Computer networking by RS Rajesh, KS Easwarakumar, R Balasubramaian.
6. Unit Network Programming by Stevens W.R- Vol.I and II.
7. TCP/IP Protocol by Behrouz A Foruldzan.
8. LAN by Gerd . E. keiser.
9. Computer Networks by Andrew S. Tanenbaum
Evaluation Scheme:
1 2 2
2 3 4
3 3 4
4 6 6
5 5 6
6 8 8
7 8 6
8 6 6
9 3 4
10 3 4
83
Course Title: Microprocessor Based Instrumentation
Course Code: EX506
Evaluation:
Internal 50 25 100
Total 100 25 125
Course Objectives:
• Continuation of Instrumentation I with emphasis on advance system design and case studies
• To introduce and apply the knowledge of microprocessor, A/D, D/A converter to design Instrumentation
system
• To provide the concept on interfacing with microprocessor based system and circuit design techniques.
1. Microprocessor Based Instrumentation System 4hrs

1.1 Basic Features of Microprocessor Based System
1.2 Open Loop and Closed Loop Microprocessor Based System
1.3 Benefits of Microprocessor Based System
1.4 Microcomputer on Instrumentation Design
1.5 Interfacing with Microprocessor
1.5.1 PC Interfacing Techniques
1.5.2 Review of Address Decoding
1.5.3 Memory Interfacing
1.5.4 Programmed I/O, Interrupt Driven I/O and Direct Memory Access (DMA)
2. Parallel Interfacing With Microprocessor Based System 3hrs
2.1 Methods of Parallel Data Transfer: Simple Input and Output, Strobe I/O, Single Handshake I/O, & Double
Handshake I/O
2.2 8255 As General Purpose Programmable I/O Device and its interfacing examples
2.3 Parallel Interfacing with ISA and PCI bus
3. Serial Interfacing With Microprocessor Based System 6hrs
3.1 Advantages of Serial Data Transfer over Parallel
3.2 Synchronous and Asynchronous Data Transfer
3.3 Errors in Serial Data Transfer
3.4 Simplex, Half Duplex and Full Duplex Data Communication
3.5 Parity and Baud Rates
3.6 Introduction Serial Standards RS232, RS423, RS422
3.7 Universal Serial Bus
3.7.1The Standards:- USB 1.1 and USB 2.0
3.7.2 Signals, Throughput & Protocol
3.7.3 Devices, Hosts and On-The-Go
3.7.4 Interface Chips: USB Device and USB Host
4. Interfacing A/D and D/A Converters 4hrs
4.1 Introduction
4.2 General Terms Involved in A/D and D/A Converters
4.3 Examples of A/D and D/A Interfacing
4.4 Selection of A/D and D/A Converters Based on Design Requirements
5. Data Acquisition and Transmission 6hrs
5.1 Analog and Digital Transmission
5.2 Transmission Schemes
5.2.1 Fiber Optics
5.2.2 Satellite
84
5.2.3 Bluetooth Devices
5.3 Data Acquisition System
5.3.1 Data Loggers
5.3.2 Data Acquisition and Storage
6. Grounding and Shielding 8hrs
6.1 Outline for Grounding and Shielding
6.2 Noise, Noise (Energy) Coupling Mechanism and Prevention
6.3 Single Point Grounding and Ground Loop
6.4 Filtering and Smoothing
6.5 Decoupling Capacitors and Ferrite Beads
6.6 Line Filters, Isolators and Transient Suppressors
6.7 Different kinds of Shielding Mechanism
6.8 Protecting Against Electrostatics Discharge
6.9 General Rules for design
7. Circuit Design 4hrs
7.1 Converting Requirement into Design
7.2 Reliability and Fault Tolerance
7.3 High Speed Design
7.3.1 Bandwidth, Decoupling, Ground Bounce, Crosstalk, Impedance Matching, and Timing
7.4 Low Power Design
7.5 Reset and Power Failure Detection and Interface Unit
8. Circuit Layout 6hrs
8.1 Circuits Boards and PCBs
8.2 Component Placement
8.3 Routing Signal Tracks
8.3.1 Trace Density, Common Impedance, Distribution of signals and Return, Transmission Line Concerns,
Trace Impedance and Matching, and Avoiding Crosstalk
8.4 Ground, Returns and Shields
8.5 Cables and Connectors
8.6 Testing and Maintenance
9. Software For Instrumentation and Control Applications 6hrs
9.1 Types of software, Selection and Purchase
9.2 Software Models and Their Limitations
9.3 Software Reliability
9.4 Fault Tolerance
9.5 Software Bugs and Testing
9.6 Good Programming Practice
9.7 User Interface
9.8 Embedded and Real Time Software
Practical:
The laboratory exercises deal interfacing techniques using microprocessors, microcontrollers. There will be about
six lab sessions which should cover at following:
1. Simple and Handshake data transfer using PPI
2. Basic I/O device interfacing like keyboard, seven segments, motors etc.
3. Analog to Digital interfacing
4. Digital to Analog interfacing
5. Design exercise (small group project)
85
References:
• D. V. Hall, “Microprocessor and Interfacing, Programming and Hardware”
• K. R. Fowler, “Electronic Instrument Design: Architecting for the Life Cycle”
• Ramesh S. Gaonkar, “Microprocessor Architecture, Programming and Application with 8085”
• A. K. Ray & K.M. Bhurchandi, “Advanced Microprocessors and Peripheral”
• E.O. Duebelin, “Measurement System Application and Design”
• John Hyde, “USB Design by Example”, Intel Press
• PCI bus, USB, 8255, Bluetooth datasheets
• D.M. Consodine
• S. Walf and R. F. Smith
Evaluation:
1 4 4
2 3 3
3 6 8
4 4 4
5 6 8
6 8 8
7 4 4
8 6 7
9 4 4
86
Course Title: Distributed System
Course Code: CO516
Class Load: 5 Hrs. per Week (Theory: 3 Hrs, Practical 2Hrs)
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives:
The objective of the course is to be familiar with different aspect of the distributed system, middleware, system level
support and different issues in designing distributed algorithms.
1. Introduction (4 hours)
1.1 Introduction to Distributed Systems
1.2 Examples of Distributed Systems
1.3 Main Characteristics
1.4 Advantages and Disadvantages of Distributed System
1.5 Design Goals
1.6 Main Problems
1.7 Models of Distributed System
1.8 Resource Sharing and the Web Challenges
1.9 Types of Distributed System: Grid, Cluster, Cloud
2. Distributed Objects and File System (7 hours)
2.1 Introduction
2.2 Communication between distributed objects
2.3 Remote Procedure Call
2.4 Events And Notifications
2.5 Java RMI Case Study
2.6 Introduction to DFS
2.7 File Service Architecture
2.8 Sun Network File System
2.9 Introduction to Name Services
2.10 Name Services and DNS
2.11 Directory and Discovery Services
2.12 Comparison of Different Distributed File Systems
3. Operating System Support (3 hours)
3.1 The operating system layer
3.2 Protection
3.3 Process and threads
3.4 Communication and invocation
3.5 Operating system architecture
4. Distributed Heterogeneous Applications and CORBA (3 hours)

4.1 Heterogeneity in Distributed Systems
4.2 Middleware
4.3 Objects in Distributed Systems
4.4 The CORBA approach
4.5 CORBA services
5. Time and State in Distributed Systems (5 hours)
5.1 Time in Distributed Systems,
5.1.1 Physical Clocks
5.1.2 Logical Clocks
5.1.3 Vector Clocks
5.1.4 Clock Synchronization
5.2 Causal Ordering of Messages
87
5.3 Global State and State Recording
5.4 Distributed debugging
6. Coordination and Agreement (4 hours)
6.1 Mutual Exclusion in Distributed Systems
6.2 Algorithms for Mutual Exclusion
6.3 Distributed Elections
6.4 Multicast communication
6.5 Consensus
7. Replication (4 hours)
7.1 Reasons for Replication
7.2 Object Replication
7.3 Replication as Scaling Technique
7.4 Fault Tolerant Services
7.5 High Available Services
7.6 Transaction with Replicated Data
8. Transaction and Concurrency Control (6 hours)
8.1 Transactions
8.2 Nested Transaction
8.3 Locks
8.4 Optimistic Concurrency Control
8.5 Timestamp Ordering
8.6 Comparison of Methods For Concurrency Control
8.7 Introduction to Distributed Transactions
8.8 Flat and Nested Distributed Transactions
8.9 Atomic Commit Protocols
8.10 Concurrency Control in Distributed Transactions
8.11 Distributed Deadlocks
8.12 Transaction Recovery
9. Fault Tolerance (4 hours)
9.1 Introduction to Fault Tolerance
9.2 Process Resilience
9.3 Reliable Client Server Communication
9.4 Distributed Commit
9.5 Recovery
10. Case Studies (5 hours)
10.1 CORBA
10.2 Mach
10.3 JINI
10.4 TIB/Rendezvous
Laboratory Exercises:
1. Implementation of Election Algorithm.
2. Simulation for Clock Synchronization in Distributed System using Lamport’s Algorithm.
3. Implementation of Banker’s Algorithm for avoiding Deadlock
4. Experiment on DFS
5. Case Study – CORBA,JINI, Mach, TIB/Rendezvous
Reference Books:
1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems Concepts and Design”, Third
Edition, Pearson Education.
2. A.S. Tanenbaum, M. VanSteen, “Distributed Systems”, Pearson Education.
3. Mukesh Singhal, “Advanced Concepts in Operating Systems”, McGraw-Hill Series in Computer Science.
88
Evaluation Scheme:
1 4 4
2 7 8
3 3 3
4 3 3
5 5 6
6 4 4
7 4 4
8 6 6
9 4 4
10 5 4
89
Course Title: Object Oriented Analysis and Design
Course Code: CO517
Evaluation:
Internal 50 25 75
Total 100 - 125
Course Objectives:
This course clarifies the use of object orientation (OO) paradigm for modeling, design and implementation of software
systems. The major objective of the course is to prepare the students both theoretically and practically for using object-
oriented technologies in their further study and development work. Special attention is paid to systematic approach to
development of complex software systems.
1. Introduction to Object Orientation 3 hours

1.1 Real world domains, complex problems, and abstraction
1.2 Instances and concepts; Class-object concepts
1.3 Generalized Object-Oriented Software development cycle
2. Object Oriented Analysis 12 hours
1.1 Object Model. The Notion of Encapsulation and Information Hiding
1.2 Object Identity: Entity and Attributes
1.3 Data and Knowledge: The Notion of Inheritance
1.4 Relationships between Objects: Association, Generalization/Specialization, Aggregation, etc.
1.5 Objects and States. Dynamic Behavior of Objects
1.6 Functional Dependencies in a System
1.7 User Requirements Analysis
1.8 Process Modeling: The Notion of Message Passing
3. UML & Diagrams 12 hours

3.1 Introduction to the Unified Modeling Language (UML)
3.2 Class Diagram
3.3 Object Diagram
3.4 Use case Diagram
3.5 Interaction Diagram / Collaboration Diagram
3.6 Activity Diagrams
3.7 State chart (or Sequence) Diagrams and State Machines
3.8 Component Diagram
3.9 Deployment Diagram
4. Unified Process (UP) of Software Development 10 hours

4.1 Software development process
4.2 Phases of the UP development process
4.3 Workflows of UP
4.4 Best practices in UP
4.5 Other Issues
5. Reuse / components 8 hours

5.1 Reuse and Component model
5.2 Design Patterns
5.3 Frameworks
5.4 Pattern Catalogues and Pattern languages
5.5 Product quality
5.6 Process quality
90
Laboratory: Using either Rational Rose or any other open source UML tool (such as Argo UML, etc.), students
should practice enough on different diagrams and their experimental use for different modeling activities.
References:
1. Perdita Stevens and Rob Pooley, Using UML : Software Engineering with Objects and Components,
Pearson, 2005.
2. Grady Booch, James Rumbaugh and Ivar Jacobson, The Unified Modeling Language User Guide, Addison
Wesley, 1999.
3. Grady Booch, Object Oriented Analysis and Design with Applications, Second edition, Addison Wesley,
1997.
Evaluation Scheme:
1 3 3
2 12 15
3 12 14
4 10 10
5 8 8
91
Course Title: Operating System
Course Code: CO518
Evaluation:
Internal 50 25 75
Total 100 - 125
Course Objectives:
1. To provide the basics of operating systems.
2. To familiarize with the feature controlling of modern operating system.
Course Contents:
1. Principles of Operation Systems (4 hrs)
Introduction, Operating System concepts: Processes, files, shell, system calls, security and Operating System
structure: Monolithic systems, Layered, Virtual Machines, Client-Server and Evolution of Operating
Systems: User driven, operator driven, simple batch system, off-line batch system, directly coupled off-line
system, multi-programmed spooling system, online timesharing system, multiprocessor systems, multi-
computer/distributed systems, Real time Operating Systems.
2. Processes and Threads (12 hrs)

Process Concepts: Introduction, Definition of Process, Process states and transition, PCB (Process Control
Block), Concurrent Process: Introduction, Parallel Processing, IPC(Inter-Process Communication), Critical
Regions and conditions, Mutual Exclusion , Mutual Exclusion Primitives and Implementation, Dekker’s
Algorithm, Peterson’s Algorithm, TSL (test and set lock), Locks, producer and consumer problem, monitors,
Message Passing, Classical IPC problems, Deadlock and Indefinite Postponement: Introduction, Preemptable
and Nonpreemptable Resources, Conditions for deadlock, deadlock modeling, deadlock prevention, deadlock
avoidance, deadlock detection and recovery, Starvation, Threads: Introduction, thread model, thread usage,
advantages of threads.
3. Kernel (2 hrs)
Introduction, Context switching (Kernel mode and User mode), First level interrupt handling, Kernel
implementation of processes
4. Scheduling (4hrs)
Introduction: Scheduling levels, Scheduling objectives and criteria, Quantum size,
Policy versus Mechanism in Scheduling, Preemptive versus No preemptive Scheduling, Scheduling
techniques: Priority scheduling, deadline scheduling, First-In-First-Out scheduling, Round Robin
Scheduling, Shortest-Job-First(SJF) Scheduling, Shortest-Remaining-Time(SRT) scheduling, Highest-
Response-Ration-Next(HRN) scheduling, Multilevel Feedback Queues.
5. Memory Management (6 hrs)

Introduction, storage organization and hierarchy, contiguous versus noncontiguous storage allocation, logical
and physical memory, fragmentation, fixed partition multiprogramming, variable partition
multiprogramming, relocation and protection, Coalescing and Compaction, Virtual Memory: Introduction,
Paging, , Page tables, Block mapping, Direct mapping, TLB(Translation Look aside Buffers), Page Fault,
Page Replacement algorithms,
Optimal Page Replacement algorithm, Not Recently Used Page Replacement algorithm, First-In-First-Out
algorithm, Second Chance Page Replacement algorithm, Least Recently Used Replacement algorithm, Clock
Page Replacement algorithm, Working Set Page Replacement algorithm, WS Clock Page Replacement
algorithm, Segmentation, implementation of pure segmentation, Segmentation with Paging.
92
6. Input / Output (3 hrs)
Introduction, Principles of I/O hardware: I/O devices, device controllers, memory-mapped I/O, DMA (Direct
Memory Access), Principles of I/O software: Polled I/O versus Interrupt driven I/O, Character User Interface
and Graphical User Interface, Goals of I/O software, device drivers, device independent I/O software, Disk,
disk hardware, disk arm scheduling algorithms, RAID (Redundant Array of Inexpensive Disks)
7. File Systems (3 hrs)

File naming, file structure, file types, file access, file attributes, file operations, File descriptor, Access
Control Matrix, sharing, ACL (Access Control List), Directories and directory hierarchy, File system
implementation, contiguous allocation, linked list allocation, I-nodes, security and Multi-media files.
8. Distributed Operating Systems (5 hrs)

Introduction, Goals, Network architecture, hardware and software concepts, Communication in distributed
systems, ATM (Asynchronous Transfer Mode), Client-Server Model, RPC (Remote Procedure Call), Group
Communication, Processes and Processors in distributed System, taxonomy of MIMD computer system,
Clock synchronization, scheduling in distributed system.
Case Studies (6 hrs)

DOS Operating System: System configurations, Filing and disk management, Graphical capabilities,
Memory management.
Unix/Linux Operating System: File systems and disk management, Filters, Pipelining, Sockets, Shell,
Memory management, Networking feature, multiprocessing feature.
Window 2000: File System and disk management, Networking, Security.
Laboratory:
1. Housekeeping in DOS and Windows.
2. Memory and I/O management in DOS and Windows
3. Housekeeping in UNIX/LINUX
4. Inter-process Communication
5. Shell management in UNIX/LINUX and Shell programming
6. Memory management in UNIX/LINUX
7. Resource management
8. Device Programming
Reference Books:
1. A.S. Tanenbaum, Operating systems, Design and Implementation, Prentice hall India.
2. H.M. Dietel, An Introduction to Operating System, Addison Wesley
3. A.S. Tanenbaum, Modern Operating System, Second Edition, Prentice hall India.
4. W. Stallings, Operating Systems, Prentice hall India.
Evaluation Scheme:
1 4 4
2 12 14
3 2 2
4 4 4
5 6 6
6 3 3
7 3 3
8 5 6
Case Studies 6 8
93
Course Title: Engineering Professional Practice
Course Code: CE502
Class Load: 2 Hrs. per Week (Theory: 2 Hrs)
Evaluation:
Internal 25 - 15
Total 50 - 50
Course Objectives:
To introduce the ethical and legal environment in which engineering is practiced for the benefit of society
1.0 Background Perspective : ( 10 hours)

1.1 Impacts and consequences of technology on society: effects of major technological developments
such as energy generation (conventional and non-conventional), electronic and print media,
industrial revolution and mechanization, IT and communication satellites
1.2 Cultural motivation and limitations, eastern Vs western philosophy of change and development
1.3 Political and social limitations
1.4 Individual freedoms Vs societal goals
1.5 Exponential growth
1.6 Alternative use of scarce resources, causes of international tensions
1.7 Risk and overall cost/benefit ration analysis in engineering decision making
1.8 Education and training of technologists, scientists and engineers for achieving MDGs and high HDI
1.9 Impacts of E-Waste
1.10 Evolution of Value System (Hindu, Buddhist, Muslim Ethics and transformation of social-cultural
values)
1.11 Introduction to Technology
1.12 Appropriate Technology
1.13 Role of Appropriate Technology in Transformation of Society
1.14 Importance of Technology Transfer
1.15 Impact of Technology on Society
2.0 Ethics and Professionalism: (3 hours)

2.1 Perspective on morals, ethics and professionalism
2.2 Codes of ethics and guidelines for professional engineering practice
2.3 Relationship of the engineering professional to basic science and technology; relationship to other
professions
2.4 Codes of Conducts for professional engineering practice in Nepal (NEC/NEA/SCAEF).
3.0 Roles of Professional Association (3 hour)

3.1 Regulation of the practice of the profession, licensing, guidance for training new entrants into the
profession, advice and assistance to engineering colleges, upgrading and maintaining the
professional and technical competence of members, providing technical expertise as required for
the guidance and assistance of legislators, seeing to the matter of safety and general welfare of the
public in engineering works
3.2 Act as Watch-dog for provision or applications of Works Norms,Proceedural guidelines and
Manuals, works specifications and strict adherance to those while practicing
3.3 Role of Ombudsman in professional practice
4.0 Legal Aspects of Professional Engineering in Nepal (6 hours)

4.1 The Nepalese legal system as it affects the practice of engineering
4.2 Provision for private practice and for employee engineers
4.3 Contract law
4.4 Tendering
4.5 Contract documents
4.6 Liability and negligence
94
4.7 Relationship to foreign firms working in Nepal
4.8 Foreign Investment Act and Technology Transfer
5.0 The Roles and Practice of Professional Engineering in other Countries: (2 hours)
5.1 SAARC countries
5.2 ASEAN Countries
5.3 Eastern Europe Countries
5.4 Western Europe
5.5 North America
6.0 Case Studies Involving Professional Ethical Issues Chosen from a wide range of topics (9 hours)
6.1 Intellectual property rights: copyrights and patent protection
6.2 Personal privacy and large computerized data bases
6.3 Industrialization Vs protection of the environment
6.4 Risk/benefit considerations in public transportation
6.5 Engineers and the community development
6.6 Science and technology for telemedicine
6.7 Engineers in international cooperation and development for progress, peace and prosperity
Reference Book:
1. Carson Morrison and Philip Hughes, "Professional Engineering Practice – Ethical Aspects", McGraw-
Hill Ryerson Ltd., Toronto, 1982
2. Relevant documents published by GoN
Evaluation Scheme:
The questions will cover all the chapters of the syllabus. The evaluation scheme will be as indicated in the table below.
1 10 10
2 3 2
4 6 6
5 2 2
6 9 10
* There may be minor variation in marks distribution
Course Title: Elective I

Course Code: ***
95
Evaluation:
Internal 50 50 100
Total 100 - 150
Course Objectives:
Course Title: Digital Signal Analysis and Processing

Course Code: EX507
Year/Semester: IV/I
96
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives:
To introduce digital signal processing techniques and algorithms:
1. Discrete time signals and systems: 8hrs

Discrete time signal, basic signal types, energy signal, power signal, periodicity of discrete time signal, transformation
of independent variable, discrete time Fourier series and properties, discrete time Fourier transform and properties,
discrete time system properties, linear time invariant (LTI) system, convolution sum, properties of LTI system,
frequency response of LTI system, sampling of continuous time signal, spectral properties of sampled signal.
2. Z-transform: 4hrs
Definition, convergence of Z-transform and region of convergence, properties of Z-transform (linearity, time shift,
multiplication by exponential sequence, differentiation, time reversal, convolution, multiplication), inverse z-
transform by long division and partial fraction expansion.
3. Analysis of system in frequency domain: 6hrs
Frequency response of LTI system, response to complex exponential, linear constant co-efficient difference equation
and corresponding system function, relationship of frequency response to pole-zero of system, linear phase of LTI
system and its relationship to causality.
4. Discrete filter structures: 8hrs
FIR filter, Structures for FIR filter (direct form, cascade, frequency sampling, lattice), IIR filter, structures for IIR
filter (direct form I, direct form II, cascade, lattice, lattice ladder), quantization effect ( truncation, rounding), limit
cycles and scaling.
5. FIR filters design: 6hrs
Filter design by window method, commonly used windows ( rectangular window, Hanning window, Hamming
window), filter design by Kaiser window, filter design by frequency sampling method, filter design using optimum
approximation, Remez exchange algorithm.
6. IIR filter design: 6hrs
Filter design by impulse invariance method, filter design using bilinear transformation, design of digital low pass
Butterworth filter, properties of Chebyshev filter, properties of elliptic filter, properties of Bessel filter, Spectral
transformation.
7. Discrete Fourier transforms: 7hrs
Discrete Fourier transform (DFT) representation, properties of DFT (linearity, time shift, frequency shift, conjugation
and conjugate symmetry, duality, convolution, multiplication), circular convolution, Fast Fourier Transform (FFT)
algorithm (decimation in time algorithm, decimation in frequency algorithm), computational complexity of FFT
algorithm.
References
Alan V. Oppenheim, Ronald W. Schafer, John R. Buck, “Discrete-Time Signal Processing”, Pearson Education.
1. John G. Proakis, Dimitris G. Manolakis, “Digital Signal Processing”, Prentice Hall.
Evaluation Scheme:
97
1 8 10
2 4 4
3 6 6
4 8 10
5 6 6
6 6 6
7 7 8
98
99
IV/I
Course Title: Organization and Management

Course Code: MS501
Year/Semester: IV/I
Class Load: 2Hrs. per Week (Theory: 2 Hrs)
Evaluation:
Internal 25 - 25
Total 50 - 50
Course Objectives:
To make the students able to understand and analyze the professional environment where they have to practice their
profession. This course will also help them in bringing attitudinal as well as behavioral change.
Course Contents:
1 Introduction (2 hrs)
Meaning of organization and management, Function of management, Need of management
2 Organization (4 hrs)
meaning of organization, Characteristics of organization, Principles of organization, Principles of
organization, Formal and informal organization, Organization chart, Types of organization-line, line and
staff, functional and matrix.
3 Motivation and leadership (6 hrs)
Concept of motivation and incentives, Theories of motivation, Leadership styles: Participative management,
Management by objectives, management by exception, Learning organization.
4 Personnel Management (6 hrs)
Meaning and functions of personnel management, job analysis, job description, Recruitment and promotion,
Performance appraisal, introduction to wages and methods of wage payment , Training.
5 Introduction to Industrial Relations (6 hrs)
Meaning of trade union, Trade union movement in Nepal Collective bargaining, health and safety,
Compensation, Introduction to arbitration
6 Human Behavior and Conflict Management (7 hrs)
Impact of diversity issues in Human Interactions, Intragroup and Intergroup Behavior, Negotiation,
Facilitation, Mediation, Arbitration, Legal action
Reference Books:
1 Harold Koontz and Heinz Weihrich, Essentials of Mangement
2 Govinda Ram Agrawal, Organization and Management in Nepal.
3 C.B Mamoria, Personnel Managemnt
Evaluation Scheme:
1 2 2
2 4 4
3 6 4
4 6 4
5 6 4
6 7 8
100
Course Title: Artificial Intelligence
Course Code: CO519
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives:
The main objectives of this course are:
1. To provide basic knowledge of Artificial Intelligence
2. To familiarize students with different search techniques
3. To acquaint students with the fields related to AI and the applications of AI
1.1 Definition of AI,
1.2 Importance of AI,
1.3 AI and related fields,
1.4 Brief history of AI,
1.5 Applications of Artificial Intelligence,
1.6 Definition and importance of Knowledge, and learning.
2. Problem solving (4 hrs)

2.1 Defining problems as a state space search,
2.2 Problem formulation,
2.3 Problem types, Well-defined problems, Constraint satisfaction problem,
2.4 Game playing, Production systems.
3. Search techniques (5 hrs)

3.1 Uninformed search techniques- depth first search, breadth first search, depth limit search, and search
strategy comparison,
3.2 Informed search techniques-hill climbing, best first search, greedy search, A* search Adversarial
search techniques-minimax procedure, alpha beta procedure
4. Knowledge representation, inference and reasoning (8 hrs)

4.1 Formal logic-connectives, truth tables, syntax, semantics, tautology, validity, well- formed-
formula,
4.2 Propositional logic, predicate logic, FOPL, interpretation, quantification, horn clauses,
4.3 Rules of inference, unification, resolution refutation system (RRS), answer extraction from RRS,
rule based deduction system,
4.4 Statistical Reasoning-Probability and Bayes' theorem and causal networks, reasoning in belief
network
5. Structured knowledge representation (4 hrs)

5.1 Representations and Mappings,
5.2 Approaches to Knowledge Representation,
5.3 Issues in Knowledge Representation,
5.4 Semantic nets, frames,
5.5 Conceptual dependencies and scripts
6. Machine learning (6 hrs)

6.1 Concepts of learning,
6.2 Learning by analogy, Inductive learning, Explanation based learning
6.3 Neural networks,
6.4 Genetic algorithm
101
6.5 Fuzzy learning
6.6 Boltzmann Machines
7. Applications of AI (14 hrs)

7.1 Neural networks
7.1.1 Network structure
7.1.2 Adaline network
7.1.3 Perceptron
7.1.4 Multilayer Perceptron, Back Propagation
7.1.5 Hopfield network
7.1.6 Kohonen network
7.2 Expert System
7.2.1 Architecture of an expert system
7.2.2 Knowledge acquisition, induction
7.2.3 Knowledge representation, Declarative knowledge, Procedural knowledge
7.2.4 Development of expert systems
7.3 Natural Language Processing and Machine Vision
7.3.1 Levels of analysis: Phonetic, Syntactic, Semantic, Pragmatic
7.3.2 Introduction to Machine Vision
Laboratory Work:
Laboratory exercises should be conducted in either LISP or PROLOG.
Laboratory exercises must cover the fundamental search techniques, simple question answering, inference
and reasoning.
References:
1. E. Rich and Knight, Artificial Intelligence, McGraw Hill, 2009.
2. D. W. Patterson, Artificial Intelligence and Expert Systems, Prentice Hall, 2010.
3. P. H. Winston, Artificial Intelligence, Addison Wesley, 2008.
4. Stuart Russelata and Peter, Artificial Intelligence A Modern Approach, Pearson, 2010
Evaluation Scheme:
1 4 4
2 4 4
3 5 6
4 8 8
5 4 6
6 6 6
7 14 16
102
Course Title: Simulation and Modeling
Course Code: CO520
Year/Semester: IV/I
Evaluation:
Internal 50 25 75
Total 100 25 125
Course Objectives:
To provide the knowledge of discrete and continuous system, generation of random variables, analysis of simulation
output and simulation output and simulation languages
Course Contents:
1 Introduction to Modeling and Simulation (5 hrs)
System concepts, System modeling, Mathematical models: nature and assumptions, Calibration and
validation, Monte Carlo simulation method.
2 Continuous Systems (8 hrs)
Continuous system model, Differential equation, Analog method, Hybrid computers, Digital-analog
simulators, Continuous System Simulation Languages (CSSLs), CSMP III, Hybrid simulation, Feedback
systems, examples.
3 Discrete System Simulation (10 hrs)
Discrete events, Representation of time, Generation of arrival patterns, Simulation of a telephone system,
Delay calls, Simulation of programming tasks, Gathering statistics, Counters and summary statistics,
Measuring utilization and occupancy, Recording distribution and transit times, Discrete simulation
languages.
4 Analysis of Simulation Output (10 hrs)
Estimation methods, Simulation run statistics, Replication of runs, Elimination of internal bias.
5 Simulation Languages (12 hrs)
Types of simulation languages, Discrete systems modeling and simulation with GYPSS, Resources in GPSS,
GPSS programs, applications, Structural data and control statements, hybrid simulation, Feedback systems
: typical applications, SIMSCRIPT programs.
Laboratory:
Develop a simulation model, the topic could be either initiated by the student or selected from a list provided
by the instructor. An oral presentation with a demonstration should be part of the laboratory project report.
Reference Books:
1 J.A Spriest and G.C Vansteenkiste, Computer-Aided Modeling and Simulation, Academic Press.
2 G. Gorden, System Simulation, Pretice Hall of India.
3 A.M Law and W.D. Kelton, Simulation Modeling and Analysis, McGraw Hill.
Evaluation Scheme:
1 5 6
2 8 8
3 10 12
4 10 12
5 12 12
103
Course Title: Computer Engineering Project-IV
Course Code: CO521
Year/Semester: IV/I
Evaluation:
Internal - 100 100
Total - 150 150
Course Objectives:
1. To provide the knowledge of Visual Programming by carrying out a project. During the project students
learn visual programming tool (JAVA/Visual C++/ Dot net or any current trend of visual tool),
2. To provide the knowledge on planning, design, development and implementation of
project.
3. To provide the knowledge to formulate project documentation and oral presentation for his/her final year
project.
2. A mid-term progress report to be submitted. An oral presentation (15 minutes + 15 minutes for questions)
to be given.
The project document shall include the following items.

1. Project team members should not be exceeded four.
3. Technical description of the mini project
7. Performance analysis methodology
8. Reusability of modules in the software
9. Implementation area.
104
Course Title: Elective II
Course Code: ****
Year/Semester: IV/I
Evaluation:
Internal 50 50 100
Total 100 - 150
Course Objectives
105
Course Title: Elective III
Course Code: *****
Year/Semester: IV/I
Evaluation:
Internal 50 50 100
Total 100 - 150
Course Objectives:
106
IV/II
Course Title: Computer Engineering Project-V

Course Code: CO522
Year/Semester: IV/II
Evaluation:
Internal - 100 100
Total - 150 150
Course Objectives:
Computer Engineering Project V is the continuation of Computer Engineering Project IV. In Project V, students are
required to complete Project IV falling under different categories of project works:
At the initial phase, the faculty may conduct a number of lectures and discussions as to the approach of the project. In
the later phase, the student will be left on his/their won to pursue his/their work and to consult the faculty whenever
any problem crops up. The student should then compile both the works of Computer Engineering Project IV and V
and submit a draft report, prior to the final report, so that the supervisor can review the work, and correct the mistakes,
if necessary. The final draft of the report of the report shall be submitted to the Head of Department in duplicate.
107
Course Title: Internship in Computer Engineering
Course Code: CO523
Class Load: 6 Hrs. per Day/per group/per student (Practical 6 Hrs)
Evaluation:
Internal - 100 100
Total - 150 150
Course Objective: Internship in Computer Engineering is solely designed to provide students with the on-site
working experience in various sectors of Computer Engineering. Each student is required to work a period of 3 months
in a software Company, an industry or an organization or in a research institute where he/she will have the opportunity
to experience job training.
Before commencing the internship, the student should submit a formal proposal to the Supervisor. Internship should
be accepted and the organization in the student wants to pursue his/her internship should be approved by the Campus
Chief.
Students are to work in the direction, management, and guidance of the organization of their choice. Student progress
and quality of work is determined and reported by the organization. University faculty will make at-least one random
on-site visit of the organization to determine the quality of work and the level of service offered by the student.
Duration of Internship: The duration of the internship shall in no case be less than 3 months.
Evaluation Process:
i. Internal Evaluation is based on the observation made during the organization visit, where the faculty conducts
a thorough study of the daily log book, professional discipline, professional growth, etc. of the student
ii. The final evaluation is based on the observation made by the organization during the course of internship
108
Course Title: Computer Engineering Seminar
COURSE CODE:CO524
Teaching Schedule Examination Scheme
Final Internal Assessments Total
Hours/ Week Remarks
Marks
Lecture Practical Tutorial Theory Marks Practical Marks Theory Marks Practical Marks
0 0 0 - - - 50 50
Course Objective:
Seminar in Computer Engineering is solely designed to provide students with a unique opportunity to present
themselves as a confident professional, where they present their personal accomplishment over their tenure as an
engineering intern. It is intended that each individual student will present his/her experience before the respective
peers (comprising of the university faculty and the on-site job supervisor).
The student successfully completing his/her internship tenure is considered eligible for the civil engineering seminar.
The schedule for the seminar will be announced to the student after a thorough review of student’s progress and
readiness by the office of the academic director and the time availability of all the peers.
Duration of The Seminar: The duration of the internship shall in no case be less than 1hours.
Evaluation Process:
i. Internal Evaluation is based on the observation made during the organization visit, where the faculty conducts
a thorough study of the daily log book, professional discipline, professional growth, etc. of the student.
ii. The final evaluation is based on the observation of the peers on the basis of the student’s convincing ability
of his experiences and ideas.
109

BE (Computer) Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BE (Computer) Syllabus

Uploaded by

Copyright:

Available Formats

Contents

Letter Range Grade Grade Point Description

Year/ Semester: I/1

Year/ Semester: II/1

Year/ Semester: II/II

Year/ Semester: III/1

Year/ Semester: III/II

Year/ Semester: VI/1

Year/ Semester: VI/II

Course Title: Engineering Mathematics-I

1. Derivatives and their Applications (14 hours)

2. Integration and its Applications (11 hours)

3. Plane Analytic Geometry (8 hours)

4. Ordinary Differential Equations and their Applications (12 hours)

1. Electro-chemistry and Buffer (6 hours)

3. Environmental Chemistry (5 hours)

4. Engineering Polymers (6 hours)

5. 3-d Transition elements and their applications (5 hours)

6. Coordination Complexes (5 hours)

8. Lubricants and Paints (2 hours)

10. Reaction Mechanism in Organic reactions (4 hours)

Chemistry Practical Course for all

Practical 3 Periods per Week

3. Theory of Projection Drawing (25hrs)

1. Mechanical Workshop Materials (4 hrs)

11. Plane Motion of Rigid Bodies (3 hrs)

Course Title: Engineering Project Work-I

Course Title: Engineering Mathematics-II

6. Infinite Series (5 hours)

6.2. Fiber Optics,

2. C++ Languages Construct (7 hours)

3. Classes and Object (8 hours)

4. Operator Overloading (8 hours)

6. Polymorphism and Dynamic binding (4 hours)

7. Console and File Input/Output (8 hours)

Herbert Schildt, “C++ Programming”, Thomson Course Technology.

1. To make able to apply laws of thermodynamics in various systems.

1. Concept and Definitions (10 hrs)

2. Properties of a Pure Substance (4 hrs)

3. Work and Heat (2 hrs)

4. First Law of Thermodynamics (5 hrs)

5. Second Law of thermodynamics (6 hrs)

8. Heat Transfer (8 hrs)

The project document shall include the following items

Course Title: Engineering Mathematics III

1. Solution of Nonlinear Equations (10 hrs)

• Fixed point iteration and its convergence.

5. Solution of Ordinary Differential Equations (7 hrs)

5. Three Phase Induction Machines (8 hours)

Course Title: Applied Mathematics

1. Complex Analysis (18 hours)

2. The Z-Transform (9 hours)

Course Title: Microprocessor

1. Instrumentation Systems (4 hrs)

6. Data conversion : analog – digital and digital – analog conversions (7 hrs)

Course Title: ICT Project Management

5. Writing Research Articles 2 hours

Language lab 30 hours

Activity IV Listening to recorded authentic conversation followed by exercises 4 hours

(Equipment Required: Laptop, multimedia, laser pointer, DVD, video, overhead

Course Title: Engineering Project Work -III

The mini project document shall include the following items.

Course Title: Computer Graphics