Draft Copy

Pokhara University
Faculty of Science and Technology

Course Code: MTH 150 Full Marks: 100

Course title: Algebra and Geometry (3-2-0) Pass Marks: 45
Nature of the course: Theory Total Lectures: 45 hours
Level: Bachelor Program: BE

1. Course Description
The course covers linear algebra, vector algebra, linear programing, two-dimensional and
three-dimensional analytical geometry.

2. General Objectives
To provide the sound knowledge of Algebra and Geometry of two and three dimensions.

3. Methods of Instruction
Lecture, Discussion, and Class Work

4. Contents in Detail

Specific Objectives Contents

• Solve system of linear Unit I: Matrix and System of linear equations (4 hrs.)
equations and find rank 1. System of linear equations, classification, matrix and
of a matrix vector representations, solution by Cramer’s and Gauss
elimination methods.
2. Rank of a matrix, elementary transformation on matrices,
equivalent matrices and their ranks, computation of rank
of matrix by reducing into echelon (triangular) form and
canonical (normal) form, rank of coefficient matrix and
consistency of system of equations.
• Solve the problems Unit II: Vector Space (7 hrs.)
related to vector space 1. Vectors and vector spaces, ℝ2 an d ℝ3 as vector spaces
and determine and their subspaces, Basis.
eigenvalues and 2. Linear dependence and independence, rank of matrix in
eigenvectors. terms of linearly independent column (row)vectors.
3. Linear transformation and transformation by matrix
multiplication as linear transformation, orthogonal matrix
and transformation by orthogonal matrix.
4. Eigenvalues and eigenvectors, characteristic equation and
computation of Eigenvalues and eigenvectors, properties
of
eigenvalues.
5. Cayley-Hamilton theorem (statement and verification
only), application to compute inverse of a matrix (up to
3 × 3 matrix).
6. Similar matrices and diagonalization of matrix (up to
2 × 2 matrices only).
• Solve linear programing Unit III: Linear Programing Problems (5 hrs.)
problems by Simple 1. Introduction, Model Formulation, Standard Form,
method. Solution by Simplex Method
2. Duality, Dual Simplex Method
3. Simplex method for mixed inequalities (Big-M method)
• S o l v e t h e p r o b l e m s Unit IV: Vector Algebra (6 hrs.)
related to product of 1. Review of vectors in terms of coordinates, scalar and
three and four vectors vector product of two vectors.
and 2. Vector and scalar product of three and four vectors with
physical interpretations.
3. Reciprocal system of vectors, properties of reciprocal
system of vectors and related problems.
• Test the convergence and Unit V: Infinite Series (5 hrs.)
divergence of the series 1. Infinite sequence and concept of convergence, infinite
series, convergence of series, invariance of convergence
(by addition or removal of certain finite numbers or
terms, by multiplication by any finite constant, sum and
product of convergent series), necessary condition for an
infinite series to be convergent (divergent test),
convergence of infinite geometric series.
2. Series with positive terms (or all terms negative) and
different convergence tests (theorems statement with
illustrations, proof not required). The hyper-harmonic
series (p-series) and its convergence, Comparison test,
ratio test, root test.
3. Alternating series (Series with negative and positive terms
alternatively) Leibnitz test, absolute convergence, power
series, interval of convergence and radius of convergence
• S o l v e t h e p r o b l e m s Unit VI: Two-dimensional Geometry (6 hrs.)
r e l a t e d c o o r d i n a t e 1. Transformation of coordinates: by transformation of origin, by
transformation, ellipse, transformation of axes by changing direction of axes,
combined transformation and use of transformation to reduce
hyperbola, and conic complex equation into standard equations.
section
2. Ellipse: Standard equation of ellipse with derivation, equation
of tangent and normal condition for tangency.

3. Hyperbola: Standard equation of a hyperbola with derivation,

rectangular hyperbola, conjugate hyperbola, equation of
tangent and normal condition for tangency.

4. General equation of Conic section in Cartesian and Polar

form
• S o l v e t h e p r o b l e m s Unit VII: Three-dimensional Geometry (12 hrs.)
related straight lines 1. Review coordinate in space and plane.
s p h e r e , c o n e , a n d 2. Straight line: Introduction, line in symmetrical form, line
cylinder passing through two given points, reduction of general equation
of a line into symmetrical form, angle between a plane and a
line, conditions for a line to lie on a plane, length of a
perpendicular from a given point to the line, coplanar lines,
condition for coplanarity of two lines, shortest distance its
length and equation.

3. Sphere: Equation of a sphere, condition for a general equation

of second degree to represent a sphere, equation in diameter
form, plane section of a sphere, circle as intersection of a plane
and a sphere, intersection of two spheres, equation of a tangent
plane, condition of tangency and related problem.
4. Cone: Equation of a cone with given vertex and generator
intersecting given conic related problems, Equation of right
circular cone and related problems
5. Cylinder: Equation of a cylinder whose generator intersecting
x y z
a given conic and parallel to the line = = and related
l m m
problems, Equation of a right circular cylinder and related
problems

5. List of Tutorials
The following tutorial activities of 30 hours per group of maximum 24 students shall be
conducted to cover all the required contents of this course. This will enable the students to
complete the related mathematical problems under the supervision of the subject teacher.
a) Problems on solution of system of linear equations by Gauss method (1 hr)

b) Determining rank of a matrix and test the consistency then solve the linear equations (2
hrs)

c) Problems on vector space and subspace (1 hr)

d) Linear dependence and independence, Linear transformation (1 hr)

 e) Eigenvalues, eigenvectors and diagonalization, verifying Caley-Hamilton Theorem and
its application in finding the inverse (2 hrs)

f) Simplex method for standard problems (2 hr)

g) Duality in LPP (1 hr)

h) Simplex method for mixed inequalities (Big-M method) (1 hr)
i) Dot and vector product of 3 and 4 vectors with geometrical interpretation (2 hrs)
j) Reciprocal system of vectors (1 hr)
k) To test for convergence of a series by different tests (3 hrs)

l) Finding centre of convergence, radius of convergence and interval of convergence (2

hrs)

m) To solve the problems on transformation of coordinates (1 hr)

n) Problems on ellipse and hyperbola (3 hrs)

o) Problems on straight lines (3 hrs)

p) Problems on sphere (2 hrs)

q) Problems related to cone and cylinder (2 hrs)

6. Evaluation System and Students’ Responsibilities

Evaluation System
The internal evaluation of a student may consist of assignments, attendance, term-exams, and
project works etc. The internal evaluation scheme for this course is as follows:

Internal Evaluation Weight Marks External Evaluation Marks

Theory 50
Attendance & Class Participation 10%
Assignments 20%
Semester-End
Presentations/Quizzes 10% examination 50
Internal Assessment 60%
Total Internal 50
Full Marks: 50 + 50 = 100

Students’ Responsibilities
Each student must secure at least 45% marks in internal assessment evaluation with 80%
attendance in the class in order to appear in the Semester End Examination. Failing to get
such score will be given NOT QUALIFIED (NQ) to appear the Semester-End Examinations.
Students are advised to attend all the classes, formal exam, test, etc. and complete all the
assignments within the specified time period. Students are required to complete all the
requirements defined for the completion of the course.

7. Prescribed Books and References

Text Books
1. Kreyszig, E. Advanced Engineering Mathematics. New Delhi: John Wiley and Sons
Inc.
2. Thomas, G. & Finney, R. Calculus and Analytical Geometry. New Delhi: Narosa
Publishing House.

References
1. Swokoswski, E.W. Calculus with Analytic Geometry. Prindle, Weber and Schmidi.

2. Narayan, S. Analytical Solid Geometry. S. Chand and company.

3. Prasad, C. Algebra and Theory of Equations. Pothishala Pvt. Ltd.

4. Cheney, W. & Kincaid, D. Linear Algebra: Theory and applications. Jones and Bartlett
Publisher.

5. Vittal, P. R. Analytical Geometry 2D and 3D, Delhi: Pearson India.

 Pokhara University
Faculty of Science and Technology

Course No.: CMP 160 (3 Credits) Full marks: 100

Course title: Data Structure and Algorithms (3-1-3) Pass marks: 45
Nature of the course: Theory and Practical Total Lectures: 45 hrs
Level: Bachelor Program: BE (Computer/Software/
IT/Electronics and Communication)

1. Course Description

This course is designed to encompass the concepts of basic data structures- stack, queue,
linked list, tree, graph etc., basic algorithm design techniques- divide and conquer, greedy
algorithms etc. and algorithm analysis techniques to determine the cost of algorithms. It
presents the various search and sorting algorithms that follow the divide and conquer and
greedy strategy to solve the problems. This course also introduces the advance data structures
such as hash table and B tree. After completion of this course, students can design and choose
an appropriate data structure and efficient algorithm to achieve better performance.

2. General Objectives

• To acquaint the students with basic concepts of basic data structures such as stack,
queue, linked list, tree and graph.
• To acquaint the students with concepts of sorting and searching algorithms.
• To acquaint the students with the knowledge of algorithms design techniques and
algorithm analysis techniques.
• To develop the skills in students to choose the appropriate data structure and algorithm
design technique for a specified application..
• To acquaint the students with the knowledge of the recursion, a popular problem
solving technique, to solve the real world complex problems.

3. Methods of Instruction

Lecture, Discussion, Readings, Practical works and Project works.

4. Contents in Detail

Specific Objectives Contents

1
• Understand the data Unit 1: Introduction (5 hrs)
structure, ADTs and 1. Philosophy of Data Structures
algorithm design 1.1. Need of Data Structures
techniques. 1.2. Characteristics and Types
• Analyze the cost of 2. Abstract Data Type (ADT) and Data Structures
algorithms. 3. Algorithm Design Techniques
3.1. Divide and Conquer
3.2. Greedy Algorithms
3.3. Backtracking
4. Algorithm Analysis:
4.1. Best, Worst and Average Case Analysis
4.2. Rate of Growth
4.3. Asymptotic Notations- Big Oh, Big Omega and
Big Theta

• Implement the stack to Unit 2: Stack and Recursion (7 hrs)

solve various problems 1. Stack
like expression evaluation 1.1. Definition and Stack Operations
and conversion. 1.2. Stack ADT and its Array Implementation
• Use the recursion to solve 1.3. Expression Evaluation: Infix and Postfix
recursive problems. 1.4. Expression Conversion: Infix to Postfix and Postfix
to Infix
2. Recursion
2.1. Recursion- A problem Solving Technique
2.2. Principle of Recursion
2.3. Recursive Algorithms- Greatest Common Divisor,
Sum of Natural Numbers, Factorial of a Positive
integer, Fibonacci Series and Tower of Hanoi
2.4. Recursion and Stack
2.5. Recursion vs Iteration
2.6. Recursive Data Structures
2.7. Types of Recursion
2.8. Applications of Recursion

2
Implement the queue and Unit 3: Queue and Linked List (10 hrs)
linked list to solve various 1. Queue
problems. 1.1. Definition and Queue Operations
1.2. Queue ADT and its Array Implementation
1.3. Circular Queue and its Array Implementation
1.4. Double Ended Queue and Priority Queue
2. Linked List
2.1. List- Definition and List Operations
2.2. List ADT and its Array Implementation
2.3. Linked List- Definition and its Operations
2.4. Singly Linked List- Basic Operations, Singly
Linked List ADT and Implementation of Singly
Linked List
2.5. Doubly Linked List and Circular Linked List
2.6. Linked Implementation of Stack and Queue

• Understand the use and Unit 4: Tree (7 hrs)

applications of Tree. 1. Definition and Tree Terminologies
• Construct the binary 2. General Trees
search tree, AVL trees and 2.1. Definition and their Applications
B trees. 2.2. Game Tree
3. Binary Trees
3.1. Definition and Types
3.2. Array and Linked List Representation
3.3. Traversal Algorithms: pre-order, in-order and post-
order traversal
3.4. Application of Full Binary Tree: Huffman
algorithm
4. Binary Search Tree:
4.1. Definition and Operations on Binary Search Tree:
insertion, deletion, searching and traversing
4.2. Construction of Binary Search Tree
5. Balanced Binary Tree
5.1. Problem with unbalanced binary trees
5.2. Balanced Binary Search Tree
6. AVL tree
6.1. Definition and Need of AVL Tree
6.2. Construction of AVL tree: Insertion, Deletion on
AVL tree and Rotation Operations
7. B Tree: Definition, Need and Application

3
 • Understand and Unit 5: Sorting Algorithms (5 hrs)
implement the various 1. Internal/external Sort, Stable/Unstable Sort
internal and external 2. Insertion and selection Sort
sorting algorithms. 3. Bubble and Exchange Sort
4. Quick Sort and Merge Sort
5. Radix Sort
6. Shell Sort
7. Heap Sort as priority queue

• Understand and Unit 6: Searching Algorithms and Hashing (5 hrs)

implement the sequential 1. Sequential Search
and binary search 2. Binary Search
algorithms. 3. Hashing
• Design and implement the 3.1. Hash Function
hash system for storing 3.2. Hash Table
and searching data in hash 3.3. Hashing as a Data Structure and a Search
table. Technique
4. Collision in Hash Table
5. Collision Resolution Techniques
5.1. Open Hashing: Separate Chaining
5.2. Closed Hashing: Linear Probing, Quadratic
Probing and Double Hashing
6. Load Factor and Rehashing

• Understand the concept of Unit 7: Graphs (6 hrs)

graph to represent real 1. Definition, Terminologies and Types of Graphs
world problems and use it 2. Representation of Graphs: Adjacency Matrix, Incidence
for finding minimum cost Matrix and Adjacency list
solution. 3. Transitive Closure and Warshall’s Algorithm
4. Graph Traversals: Breadth-First Search, Depth-First
Search and Topological Sort
5. Minimum Spanning Tree: Kruskal’s Algorithm and
Prim’s Algorithm
6. Shortest-Paths Problems: Types, Single-Source Shortest
Path Problem- Dijkstra’s Algorithm

5. Practical Works

Laboratory work of 45 hours per group of maximum 24 students should cover

implementation of basic data structures, sorting algorithms and searching algorithms using C
language or C++ language. Students should complete the following implementations in
laboratory:

4
 SN Implementation Description
1 Implementation of stack using array.
2 Implementations of linear queue and circular queue using array.
3 Implementation of recursive algorithms- Greatest Common Divisor, Sum of Natural
Numbers and Tower of Hanoi
4 Implementation of linked list: singly and doubly linked lists.
5 Implementation of stack and queue using linked list.
6 Implementation of in-order, pre-order and post-order tree traversals.
7 Implementation of insertion sort, bubble sort and quick sort.
8 Implementation of sequential, binary search and hash system.
9 Implementation of breadth-first search to traverse a graph and Kruskal’s Algorithm
to find the minimum spanning tree of a graph.
10 Implementation of Dijkstra’s Algorithm.

Students should submit a project work that uses all the knowledge obtained from this course
to solve any problem chosen by themselves. The marks for the practical evaluation must be
based on the project work submitted by students.

6. List of Tutorials

The various tutorial activities that suit your course should cover all the content of the course
to give students a space to engage more actively with the course content in the presence of
the instructor. Students should submit tutorials as assignments or class works to the instructor
for evaluation. The following tutorial activities of 15 hours per group of maximum 24
students should be conducted to cover the content of this course:

A. Discussion-based Tutorials: (3 hrs)

a. Philosophy of data structure- Parking problem in narrow garage, Word Reversing
Problem, and Need of Data structure (Class discussion)
b. Algorithm Design Techniques (Class discussion).
c. Need of Algorithm Analysis (Oral Presentation).

B. Problem solving-based Tutorials: (6 hrs)

a. Design a system to generate the Huffman code for characters in a given text.
b. Design a hash system that implements simple hash function, hash table and resolution
solution techniques to minimize collisions.
c. Suppose you are given a task to design a network system of transportation link or
communication link or electricity transmission line (or choose any problem) in your

5
 city. Use the graph data structure to represent the problem and find the solution that has
minimum cost to implement the system.

C. Review and Question/Answer-based Tutorials: (6 hrs)

a. Case study on history of Fibonacci numbers and Tower of Hanoi and their recursive
solutions. (Oral Presentation in class).
b. Case study on “Amount of resource demand of common growth rate functions” and
“Comparison of algorithms using growth rates”.
c. Students ask questions within the course content, assignments and review key course
content in preparation for tests or exams.

7. Evaluation System and Students’ Responsibilities

Evaluation System

The internal evaluation of a student may consist of assignments, attendance, internal

assessment, lab reports, project works etc. The internal evaluation scheme for this course is as
follows:

Internal Evaluation Weight Marks External Evaluation Marks

Theory 30
Attendance & Class Participation 10%
Assignments 20%
Presentations/Quizzes 10%
Internal Assessment 60%
Semester-End 50
Practical 20 examination
Attendance & Class Participation 10%
Lab Report/Project Report 20%
Practical Exam/Project Work 40%
Viva 30%
Total Internal 50
Full Marks: 50 + 50 = 100

Student Responsibilities

Each student must secure at least 45% marks separately in internal assessment and practical
evaluation with 80% attendance in the class in order to appear in the Semester End
Examination. Failing to get such a score will be given NOT QUALIFIED (NQ) to appear for

6
the Semester-End Examinations. Students are advised to attend all the classes, formal exam,
test, etc. and complete all the assignments within the specified time period. Students are
required to complete all the requirements defined for the completion of the course.

8. Prescribed Books and References

Text Books
1. Langsam, Y., Augenstein, M. J., & Tenenbaum, A. M. (1996). Data Structures using C and
C++. Prentice Hall Press.
2. Rowe, G. W. (1997). Introduction to data structures and algorithms with C++. Prentice-
Hall, India.
3. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to
algorithms. MIT press.

References

1. Kruse, R. L., & Ryba, A. J. (1998). Data structures and program design in C++. Prentice
Hall, India..
2. Brassard, G., & Bratley, P. (1996). Fundamentals of algorithmics. Prentice-Hall, India.

7
 Pokhara University
Faculty of Science and Technology

Course Code: ELE 172 (3 Credits) Full Marks: 100

Course Title: Instrumentation (3-1-2) Pass Marks: 45
Nature of the course: Theory & Practical Total Lectures: 45 hours
Level: Bachelor Program: BE

1. Course Description
This course is designed to provide students with basic concepts of Instrumentation and
Measurements. After completion of this course the students will understand the fundamental
concept of Analog and Digital instrumentation with signal conditioning, wave shaping and
filtering. The theory part shall provide instruction on instrumentation and the practical part
would be validation of most of the analyses and calculations covered in theory.

2. General Objectives
The course is designed with the following general objectives:
• To provide comprehensive idea about Analog and Digital Instrumentation.
• To provide comprehensive idea about signal conditioning and Data Acquisition
System.

3. Methods of Instruction
3.1. General Instructional Techniques: Lectures, Tutorials, discussion, question-answer,
brain storming, etc.
3.2. Specific Instructional Techniques: All the units of the course are practical oriented.
Both the theory and practical classes are to be synchronized and a practical work shall
be assigned for every theory unit.

4. Contents in Detail

Specific Objectives Contents

1
Explain the Basic of Unit 1: Introduction to Instrumentation System (10 hrs)
Instrumentation, Bridge 1. Typical applications of Instrument systems
Measurement and 2. Functional elements of Instrumentation and Measuring
systems i.e., Input elements (Transducers and
Transducers
Electrodes), intermediate elements (signal conditioning)
and output elements (Data display and storage).
3. Errors and uncertainties in Measurements and Static
performance characteristics of instruments:
3.1. Introduction to errors and uncertainties in the
measurement of performance parameters of
instruments.
3.2. Static performance parameters: Accuracy,
Precision, Resolution, Threshold, Sensitivity,
Linearity, Hysteresis, Dead band, Backlash, Drift,
Span
3.3. Impedance loading and matching
3.4. Errors: Statistical analysis of error in measurement
3.5. Standards of measurement
4. Bridge Measurement:
4.1. DC bridges- Wheat-stone bridge
4.2. AC bridges – Kelvin, Hay, Maxwell, Schering and
Wien bridges
4.3. Wagner ground Connection
5. Physical Variable and Transducer
5.1. Physical Variable and their types (Electrical,
Mechanical, Process and Biophysical)
5.2. Transducer principle and operation
5.3. Input and output characteristics and application of
transducers
5.3.1. Resistive
5.3.2. Capacitive
5.3.3. Inductive
6. Measurement of mechanical variables, displacement,
strain. velocity. acceleration and vibration
7. Measurement of process variables temperature
pressure, level, fluid flow, chemical constituents in
gases or liquids, pH and humidity
8. Measurement of bio physical variables blood pressure
and myoelectric potentials
9. Calibration and error in transducers
10. Measurement of voltage & current (moving coil &
moving iron instruments
11. Measurement of low, high & medium resistances

2
‐
‐
 Explain the basis of Analog Unit II: Principle of Analog Instruments (7 hrs)
instruments and Principle of 1. Review of DC/AC voltmeter and Ammeter: The D'
equipment used in Arsonval Principle
2. DC Multirange Ammeters and Extending Ammeter
measurement of electrical
ranges
quantities
3. DC Multirange Voltmeters and Extending Voltmeters
ranges
4. AC voltmeter and multi range voltmeter
5. Ohm Meter and Multirange
6. Electronic Multimeter
7. Multimeter as a micro ammeter and dc ammeter Types
pf voltmeter: Differential type and True rms
8. Wattmeter: Types and Working principles
9. Energy Meter: Types and Working Principle
10. Power Factor Meter
11. Instrument Transformer

Explain about the Signal Unit III: Electrical Signal Processing and Data
conditioning and Acquisition (7 hrs)
transmission system 1. Basic Op amp characteristics
2. Instrumentation amplifier
3. Signal amplification, attenuation, integration,
differentiation, network isolation, wave shaping
4. Effect of noise, analog filtering, digital filtering
5. Data Acquisition System
5.1. Analog Data Acquisition System
5.2. Digital Data Acquisition system
5.3. Single channel Data Acquisition system:
5.4. Multi-channel Data Acquisition system
5.5. PC based Data acquisition system
6. Series and Parallel transmission:
3.6.1 Features and application of RS232 cable
3.6.2 Features and application of IEEE 1248 B
7. Optical communication, fibre optics, electro optic
conversion devices

3
‐
‐
• Explain about the analog to Unit IV: Date Converter and Connectors (8 hrs)
Digital and Digital to 1. Analog to Digital Converter (ADC) and Digital to
Analog converter in depth analog Converter (DAC): Principle and Specification
2. Quantization Error
3. Types of ADC
3.1. Flash type ADC
3.2. Counter type ADC
3.3. Successive Approximation Type ADC
3.4. Dual Slope ADC
3.5. Introduction to Delta-Sigma ADC
4. Types of DAC
4.1. Weighted Resistor DAC
4.2. R-2R Ladder DAC
4.3. PWM Type DAC
5. Probes and Connectors
5.1. Test Leads: Twisted pair unshielded test leads
5.2. Shielded Cables
5.3. Connectors
5.4. Low Capacitive Probes
5.5. High Voltage Probes
5.6. Current Probes
• Compare different types of Unit V: Wave Analyzers and Digital Instruments (8 hrs)
wave analyzer and 1. Wave Analyzer
principle of Digital 1.1. Frequency Selective Wave Analyzer
1.2. Heterodyne Wave Analyzer
instrumentation.
2. Spectrum Analyzer
2.1. Basic Spectrum Analyzer using Swept Receiver
Design
2.2. IRF Spectrum Analyzer
3. Distortion Analyzer: Harmonic Distortion Analyzer-
Fundamental Suppression Type
4. Measurements of Frequency and Time: Decimal Count
Assembles
5. Frequency Counter
6. Period Counter
7. Error: Counter Error and Signal Related Error
8. Digital Voltmeter
8.1. Ramp type digital voltmeter
8.2. Integrating type digital voltmeter
8.3. Servo Potentiometer type digital Voltmeter
8.4. Successive Approximation type digital Voltmeter
9. Vector Voltmeter
10. Digital Multimeter
11. Computer Based Digital Instruments: IEEE 488 GPIB
Instrument

4
 Differentiate different types Unit VI: Recorders, Displays and Storage Devices (5 hrs)
of output devices used in 1. Oscilloscopes:
instrumentation 1.1. Cathode Ray Tube, Vertical and Horizontal
Deflection Systems, Delay lines, Probes and
Transducers,
1.2. Specification of an Oscilloscope
1.3. Oscilloscope measurement Techniques
2. Special Oscilloscopes – Storage Oscilloscope,
Sampling Oscilloscope
3. Recorders Basic recording systems. Strip chart
recorders. Galvanometer and Potentiometer type
recorders (direct and null type)
4. Indicators and display Devices - Nixie, LED, LCD and
seven segment and dot matrix displays.
5. Magnetic tape and disc recorders
6. Data loggers, Dot matrix and laser printers
7. Compact disc/Optical disc recorders

5. List of Tutorials
The following tutorial activities of 15 hours per group of maximum 24 students should be
conducted to cover all the required contents of this course:

Unit Tutorial
I Error Calculation
Calculation of Dynamic behavior of instrumentation
Calculation of Different Bridge Measurements
Calculation of Transducers
II Torque calculation of Wattmeter and Energy Meter
Range Extension of Analog Voltmeter and Ammeter
III Calculation and Design of Signal conditioning circuits
Calculation and design of wave shaping circuits and filters
IV Calculation of Resolution and Quantization error
Calculation for ADC and DAC
V Calculation on Counter Error and Signal Related Error

6. Laboratory Works
1.Accuracy test in Analog Meter
2.Operational amplifier in circuits: Use of Op-amp as

5
 3.summer, inverter, integrator and differentiator
4. Use of Capacitive, inductive transducer to measure displacement
5. Use strain gauge transducer to measure force
6. Study of Various transducer for measurement of angular displacement. angular
Velocity, pressure and flow
7. Use optical, Hall effect and inductive transducer to measure angular displacement
8. Use tacho generator to measure angular velocity
9. Use RTD transducers to measure pressure and flow
10. Digital to Analog Conversion to Perform static testing of D/A converter
11. Analog to Digital Conversion to Perform static testing of A/D converter

7. Evaluation System and Students’ Responsibilities

Evaluation System
In addition to the formal exam(s), the internal evaluation of a student may consist of quizzes,
assignments, lab reports, projects, class participation, etc. The tabular presentation of the
internal evaluation is as follows.

Internal Evaluation Weight Marks External Evaluation Marks

Theory 30
Attendance & Class Participation 10%
Assignments 20%
Presentations/Quizzes 10%
Internal Assessment 60%
Practical 20 Semester-End 50
Attendance & Class Participation 10% examination
Lab Report/Project Report 20%
Practical Exam/Project Work 40%
Viva 30%
Total Internal 50
Full Marks: 50 + 50 = 100

Student Responsibilities
Each student must secure at least 45% marks in internal evaluation with 80% attendance in
the class in order to appear in the Semester End Examination. Failing to get such score will
be given NOT QUALIFIED (NQ) and the student will not be eligible to appear the Semester-
End Examinations. Students are advised to attend all the classes, formal exam, test, etc. and

6
‐
complete all the assignments within the specified time period. Students are required to
complete all the requirements defined for the completion of the course.

8. Prescribed Books and References

Text Book
Helfrick, A. D. & Cooper, W. D. Modern Electronic Instrumentation and Measurements
Techniques. Prentice Hall of India

Reference Books
1. Nihal Kularatna, Digital and Analogue Instrumentation testing and measurement, The
Institution of Engineering and Technology, London, United Kingdom n First published
2003 Reprinted 2008
2. A K. Sawhney, A Course in Elec. & Electronics Measurements & Instrumentation,
Dhanpat Rai and Sons India, 1998
3. Joshph J.Carr,Elements of Electronics Instrumentation and Measurement-3rd Edition
by.Pearson Education.

7
 Pokhara University
Faculty of Science and Technology

Course No.: CMP 162 (3 Credits) Full Marks: 100

Course Title: Object Oriented Programming in C++ (3-1-3) Pass Marks: 45
Nature of the Course: Theory and Practical Total Lectures: 45 hrs
Level: Bachelor Program: BE (Computer / Software/
Information Technology)

1. Course Description

This course is designed to encompass the concept of Object Oriented Programming to implement its
important features such as data abstraction, encapsulation, inheritance, polymorphism, generic
programming, exception handling and file handling using the object-oriented programming language
called the C++ language.

2. General Objectives

● To familiarize the students with the basic concepts of Object Oriented Programming.
● To acquaint the students with the knowledge of features of C++.
● To develop the skills in students to solve the problems using Object Oriented concepts using C+
+.

3. Methods of Instruction

Lectures, Discussions, Readings, Practical works, and Project works.

4. Contents in Detail

Specific Objectives Contents

● Understand the Unit 1: Object Oriented Concepts (8hrs)
basic concepts of 1. Object Oriented Programming Paradigm
Object Oriented 2. A way of viewing World Agent
Analysis and 3. Procedure Oriented vs Object-Oriented Programming
Design. 4. Features of Object Oriented Programming: Class and Object, Data
Abstraction, Encapsulation, Inheritance, Polymorphism, Message
passing
5. Computation as Simulation, Coping with Complexity and Abstraction
Mechanisms
6. Object Oriented Analysis and Design: Introduction, Responsibility
Driven Design (RDD), Component Responsibility and Collaborator
(CRC) Cards, Responsibility Implies Non-Interference, Programming in
Small and Programming in Large

● Implement the use Unit 2: Classes and Objects (8hrs)

of class, object, and 1. Introduction to C++: Origin of C++, Basic C++ Program Structure,
method, Data Console Input/output Streams and Manipulators
Abstraction, 2. Structure in C and C++
Encapsulation, 3. Classes and Objects
message passing, 4. Array of Objects
data hiding in C++. 5. Class Diagram and Object Diagram
● Understand and 6. Access Specifiers and Visibility Mode
implement the 7. State and Behavior, Methods and Responsibilities
concept of 8. Implementation of Data Abstraction, Encapsulation, Message Passing
constructor, and Data Hiding
destructor, memory 9. Memory Allocation for Objects
allocation and 10. Constructor: Default Constructor, Parameterized Constructor, Copy
advanced functions Constructor
in C++. 11. Constructor Overloading
12. Destructors
13. Dynamic Memory Allocation: new and delete.
14. Dynamic Constructor
15. Functions: Inline function, Default argument, Passing and Returning by
Value, Pointer and Reference, Static Data Member and Static Member
Function
16. Friend Function and Friend Class
● Understand and Unit 3: Inheritance (8hrs)
implement the 1. Introduction to Inheritance
concept of software 2. Inheritance Relationship Diagram
reusability using 3. Inheritance Mode: Public, Private & Protected
inheritance in C++. 4. Types of Inheritance: Single, Multilevel, Hierarchical, Multiple and
Hybrid
5. Ambiguity Resolution
6. Multipath Inheritance and Virtual Base Class
7. Constructor and Destructor in Derived Class
8. Subclass, Subtype and Principle of Substitutability
9. Composition and its Implementation
10. Composition Relationship Diagram
11. Software Reusability

● Understand and Unit 4: Polymorphism (9 hrs)

implement the 1. Introduction to Polymorphism
concept of 2. Types of Polymorphism: Compile Time Polymorphism: Function
polymorphism in Overloading, Operator Overloading Runtime Polymorphism: Virtual
C++. Function
3. Overloading Unary and Binary Operators
4. Function Overriding
5. this Pointer and Object Pointer
6. Pure Virtual Function, Abstract Class
7. Virtual Destructor
8. Type Conversion: Basic to User-Defined, User-Defined to Basic, User-
defined to User-Defined

● Understand and Unit 5: Templates (5 hrs)

implement the basic 1. Generic Programming
concept of generic 2. Class Template and Function Template
programming and 3. Standard Template Library (STL): Container, Algorithm, Iterator
Standard Template
Library (STL) in
C++.
 ● Understand and Unit 6: Exception Handling and Stream I/O (7 hrs)
implement file 1. Exception Handling: Error and Exception, Exception Handling
stream operations Mechanism (try, throw, and catch), Multiple Exception Handling
and exception 2. File Handling: Stream Class Hierarchy, Opening and Closing a File,
handling in C++. Reading and Writing Object

5. Practical Works

Laboratory works of 45 hours per group of maximum 24 students should cover all the concepts of
Object Oriented Programming in C++ language studied in the lectures. Students should submit a final
project that uses all the constructs and features of Object Oriented Programming language using C++.
The evaluation of the practical works should also be based on project work.

6. List of Tutorials

The various tutorial activities that suit this course should cover all the contents of this course to give
students a space to engage more actively with the course content in the presence of the instructor.
Students should submit tutorials as assignments to the instructor for evaluation. The following tutorial
activities of 15 hours per group of maximum 24 students should be conducted to cover the content of
this course.

A. Discussion based tutorials (3hrs)

1. Evolution of Object Oriented Programming Paradigm.

2. The way of viewing the world in Object Oriented Programming.
3. The features of Object Oriented Programming.
4. Object Oriented Analysis and Design.

B. Problem solving base tutorials (8 hrs)

1. Write a program to illustrate class, access specifiers, objects, encapsulation, data hiding and data
abstraction in C++.
2. Write a C++ program to illustrate the array of objects.
3. Write a C++ program to illustrate dynamic memory allocation.
4. Write a C++ program to illustrate the use of static data members and static member functions.
5. Write a C++ program to illustrate the use of friend function and friend class.
6. Write a C++ program to illustrate the use of virtual base class.
7. Write a C++ program to illustrate the overloading of unary and binary operators using and
without using friend function.
8. Write a C++ program to illustrate the use of STL-Vector and its operations.
 9. Write a C++ program to illustrate how to catch all the exceptions.
10. Write a C++ program to illustrate reading and writing into multiple files.

C. Review and Question/Answer-based Tutorials (4hrs)

1. Case Study on origin of C++ languages.

2. Case study on “Responsibility Driven Design- Interactive Intelligent Kitchen Helper”.
3. Students ask questions within the course content, assignments and review key course content in
preparation for tests or exams.

7. Evaluation system and Students’ Responsibilities

Evaluation System

The internal evaluation of a student may consist of assignments, attendance, internal assessment, lab
reports, project works etc. The internal evaluation scheme for this course is as follows:

Internal Evaluation Weight Marks External Evaluation Marks

Theory 30 Semester-End 50
examination
Attendance & Class Participation 10%

Assignments 20%

Presentations/Quizzes 10%

Internal Assessment 60%

Practical 20

Attendance & Class Participation 10%

Lab Report/Project Report 20%

Practical Exam/Project Work 40%

Viva 30%

Total Internal 50

Full Marks: 50 + 50 = 100

Student Responsibilities
Each student must secure at least 45% marks separately in internal assessment and practical evaluation
with 80% attendance in the class in order to appear in the Semester End Examination. Failing to get such
a score will be given NOT QUALIFIED (NQ) to appear for the Semester-End Examinations. Students
are advised to attend all the classes, formal exam, test, etc. and complete all the assignments within the
specified time period. Students are required to complete all the requirements defined for the completion
of the course.

Text Books:

1. Lafore, R. (2001). Object-oriented programming in Turbo C++. Galgotia publications.

2. Budd, T. (2008). Introduction to object-oriented programming. Pearson Education India.
3. Balagurusamy, E., Balagurusamy, E., & Balagurusamy, E. (2008). Object oriented programming
with C++ (Vol. 4). Tata McGraw-Hill.

References:

1. Parsons, D. (2001). Object-oriented Programming with C++. Cengage Learning EMEA.

2. Schildt, H. (2003). C++: The complete reference. McGraw-Hill.