Far Western University

Faculty of Engineering
Bachelor of Computer Engineering

Course Title: Instrumentation Credit: 3

Course Code: EX 352 Number of Lectures / Week: 3
Year/Semester: Third Year / Fifth Semester Tutorials / Week: 1
Level: Bachelor of Engineering (Computer) Total Hours: 45

Course Objectives:

The students will be able to understand the method of interfacing instruments to

microprocessors. Focus is given to the various protocols for establishing communication between
instruments. The concept of programmable peripheral interface and its connection to
microprocessors is introduced through examples. The importance of data converters and data
acquisitions systems in instrumentation systems is also highlighted. Principles of grounding and
shielding during circuit design along with the actual process of creating printed circuit boards is
covered. The knowledge of estimating system reliability and designing fault tolerant systems is
also touched upon. The students are also provided fundamental knowledge regarding various
automation systems used in industry such as PLC and SCADA. Finally, with the help of a case
study students are exposed to the equipment and instruments used in industry.

Chapter
Contents Duration
Number
Microprocessor Based Instrumentation System
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 1.4 Interfacing with Microprocessor
[3 Hours]
1.4.1 Review of Address Decoding
1.4.2 Memory Interfacing
1.4.3 I/O Interfacing
1.5 Programmed I/O, Interrupt Driven I/O and Direct Memory Access
Programmable Peripheral Devices

2.1 Importance of Programmable Peripheral Interfaces (PPI)

2.2 8255 PPI
2.2.1 Pin Diagram, Block Diagram
2 2.2.2 Modes of Operation [3 Hours]
2.2.3 Control Word and Status Word
2.2.4 Simple I/O, Strobe I/O, Single and Double Handshake I/O
2.2.5 Interfacing examples of 8255 with 8085 microprocessor
2.2.5.1 Seven-Segment Display Interfacing
2.2.5.2 Stepper Motor Interfacing

Page 1 of 25
 Instrument Interfacing Protocols

3.1 Serial Protocols:

3.1.1 Recommended Standards (RS 232, RS 422, RS 485), Inter-
Integrated Circuit (I2C), Serial Communications Interface
(SCI), Serial Peripheral Interface (SPI), IEEE 1394
(FireWire), Universal Serial Bus (USB), High-Definition
Multimedia Interface (HDMI)

3.2 Parallel Protocols:

3 3.2.1 General Purpose Interface Bus (GPIB, IEEE-488), Versa [7 Hours]
Modular Eurocard (VME), VME eXtensions
for Instrumentation (VXI), Industry Standard Architecture
(ISA), Peripheral Component Interconnect (PCI), Peripheral
Component Interconnect express (PCIe), PCI eXtensions for
Instrumentation (PXI), Advanced Microcontroller Bus
Architecture (AMBA)

3.3 Wireless Protocols:

3.3.1 Infrared Data Association (IrDA), Bluetooth, Wi-Fi Direct,
IEEE 802.11, Zigbee, Z-Wave, Long Range (LoRa)
Data Acquisition Systems (DAS) and Data Converters

4.1 Objective of DAS

4.2 Signal Conditioning of the Inputs
4.3 Single Channel and Multi-Channel DAS
4.4 Computerized DAS
4 4.5 General Terms involved in A/D and D/A Converters [4 Hours]
4.6 Static and Dynamic Errors of Data Converters
4.7 Interfacing examples of A/D and D/A Converters with 8085
microprocessor
4.8 Selection of A/D and D/A Converters based on Design
Requirements
4.9 Data Logger and its applications
Grounding and Shielding

5.1 Outline for Grounding and Shielding

5.2 Noise, Noise Coupling Mechanism and Prevention
5.3 Single Point Grounding
5 5.4 Multi-point Grounding and Ground Loop [3 Hours]
5.5 Filtering and Smoothing
5.6 Decoupling Capacitors and Ferrite Beads
5.7 Line Filters, Isolators and Transient Suppressors
5.8 Different Kinds of Shielding Mechanisms
5.9 Electrostatic Discharge (ESD) and protection against ESD

Page 2 of 25
 Circuit Board Design

6.1 Concept of Printed Circuit Board (PCB):

6.1.1 Terminology & Types (Paper, Glass Epoxy, Aluminum
Clad, Single Layer, Double Layer, Multi Layered, Flexible)

6.2 PCB Design Considerations:

6.2.1 Voltage Isolation and Current Capacity, Noise Reduction
Through PCB Layout, High and Low Power Circuit on
Single PCB, Component & I/O Placement – PCB Design for
Mixed Signal (Analog and Digital) Circuits
6 [7 Hours]
6.3 Schematics:
6.3.1 Schematic drawing from circuit, Placing, editing, and
connecting parts and electrical symbols, Libraries and parts,
Netlist creation, Exporting and importing schematic data

6.4 Layout Design:

6.4.1 PCB Workflow, Footprint generation for Surface Mount and
Through hole components, Importing, Components placing,
Details of layers, Routing guidelines, Copper Pour, Design
Rule Check, Adding reference texts, Gerber file generation
Instrumentation Reliability

7.1 Basic Concepts of Reliability:

7.1.1 Reliability Principles and Terminology, Definition of
Reliability, Meaning of failure, statistical nature of failure,
repairable and non-repairable failures, component failure
versus system failure

7.2 System Reliability:

7.2.1 Systems with components in series, systems with
components in parallel, series-parallel systems, fault tree
techniques, K-out-of-M Systems
7 [5 Hours]
7.3 Reliability Data Analysis:
7.3.1 The reliability function, bathtub curve, linear hazard model,
exponential hazard model, mean time between failures
(MTBF), Mean time to failure (MTTF), Mean time to repair
(MTTR), a-priori and a-posteriori concept

7.4 High Reliability Systems:

7.4.1 Reliability budgets, Redundancy with majority voting,
Level of redundancy

7.5 Fault Tolerant Hardware and Software

Page 3 of 25
 Instrumentation for Automation

8.1 Need for Automation in Industry

8.2 Benefits of Automation
8.3 Programmable Logic Controller (PLC)
8.3.1 PLC Architecture: Block Diagram and Working Principle
8.3.2 PLC Classification based on Type and Size
8.3.3 PLC Hardware: Addressing of PLC Input/Output, PLC
Wiring
8.3.4 PLC Programming: Ladder, Instruction List, Structured
8 Text, GRAFCET [7 Hours]
8.3.5 PLC Instructions: Data Transfer, Arithmetic, Data
Comparison, Data Manipulation, Timer Instructions,
Counter Instructions, Program Control Instructions, Pulse
Instruction, PID Instruction

8.4 Supervisory Control & Data Acquisition (SCADA)

8.4.1 Functional Block Diagram
8.4.2 Functions of SCADA
8.4.3 Communication between PLC and SCADA
8.4.4 SCADA Applications
Case Study
Examples chosen from industrial situations with particular attention
paid to the basic measurement requirements, accuracy, and specific
hardware and software employed.

Examples:

➢ Instrumentation for a power station including all electrical and

nonelectrical parameters.
9 ➢ Instrumentation for a wire and cable manufacturing and bottling [6 Hours]
plant.
➢ Instrumentation for a beverage manufacturing and bottling plant.
➢ Instrumentation for a complete textile plant; for example, a cotton
mill from raw cotton through to finished dyed fabric.
➢ Instrumentation for a process; for example, an oil seed processing
plant from raw seeds through to packaged edible oil product.
➢ Instruments required for a biomedical application such as a medical
clinic or hospital.
➢ Other industries can be selected with the consent of the Subject
teacher.

Page 4 of 25
List of Practical / Experiments

S.N. Experiment Name

1 Data transfer using 8255 PPI and 8085 processor
2 Interfacing 7-segment and stepper motor using 8255 PPI & 8085 processor
3 ADC 0816 interfacing with 8085 processor using 8255 PPI
4 DAC 0808 interfacing with 8085 processor using 8255 PPI
5 Ladder diagram implementation of basic logic gates
Ladder diagram for various discrete state systems
6 PLC Programming Experiments:
- Speed control of AC Servo Motor
- Water Level Control
7 Single-sided PCB Design - Layout & Hardware
8 Developing and implementing any control loop using SCADA system

References

1. Ramesh Gaonkar, “Microprocessor Architecture Programming and Applications with the

8085”, 4th edition, Prentice-Hall, Inc. Upper Saddle River, NJ, USA
2. Douglas V. Hall, “Microprocessors and interfacing programming and Hardware”, 2nd
Edition.
3. Barry B. Brey, “The intel microprocessors, architecture, Programming and interfacing”,
8th Edition.
4. M.M.S. Anand, “Electronic Instruments and Instrumentation technology”, Prentice hall of
India, New Delhi.
5. Colin Simpson, “Programmable Logic Controllers, Prentice Hall”, 1st Edition.
6. Gary Dunning, “Introduction to Programmable Logic Controllers”, 3rd Edition.
7. Walter C Boschart, “PCB design and technology” Tata McGraw-Hill publishing company
Ltd., New Delhi.
8. Sanjay Gupta, “P.C. Interfacing for data Acquisition & Process Control”, 2nd Edition.
9. Stuart A. Boyer, “SCADA: Supervisory Control And Data Acquisition” 4th Edition.
10. Kim R Fowler, “Electronic Instrument Design”, Oxford University- 1996.

Evaluation Scheme:
Chapter Hours Marks Distribution*
1 3 4
2 3 6
3 7 8
4 4 6
5 3 6
6 7 8
7 5 6
8 7 10
9 6 6
* There may be minor variation in marks distribution

Page 5 of 25
Page 6 of 25
Internal Evaluation (Marks Weightage) Final Exam Total Remarks
(Marks
Weightage)
Assessment/Class Practical
Performance/Attendance/Quizzes/
Tutorials/Presentation
40 60 100 Internal marks will be of 40
if there are no practical
works in the course
20 20 60 100 Internal marks will be of 20
if there are practicals in the
course (20 marks will be
allocated for Practicals)

Page 7 of 25
 Far Western University

Faculty of Engineering
Bachelor in Computer Engineering

(Course of Study)
Course Title: Object Oriented Software Engineering
Credit: 3

Course Code: CT 354 Number of lecture/week: 3

Year/Semester: third / fifth Tutorial/week: 0

Total hours: 45
Level: Bachelor of Engineering (Computer)

Course Objectives:
To familiarize the software and object oriented software engineering and to provide systematic
approach planning, development, implementation and maintenance of object oriented software
engineering.

Duration
Specific
Contents (UNIT/CHAPTER) (Time
Objectives
allocated)

1. Introduction ( 4 Hrs)
Software life cycle models: Waterfall, RAD, Spiral, Open-source,
Agile process, Understanding software process, Process metric,
CMM levels

2. Object Oriented Concepts and Modeling ( 8 Hrs)

Introduction to class, Object, inheritance, polymorphism) , Object
Oriented Modeling , Object oriented system , Function/data
methods ,Object oriented analysis, Object oriented
construction , Object oriented testing , Identifying the elements
of an object model , Identifying classes and objects ,
Specifying the attributes , Defining operations , Finalizing the
object definition
 3. Basic and Advanced Structural Modeling (5 Hrs)
Classes Relationship, Common mechanism, Class diagram,
advanced classes, Advanced Relationship, Interface,
Object Diagram

4. Basic Behavioral Modeling ( 4 Hrs)

Interactions, Use cases, Use Case Diagram, Interaction Diagram,
Activity Diagram State chart Diagram

5. Architectural Modeling ( 4 Hrs)

Component, Components Diagram, Deployment Diagram

6. Object Oriented Design ( 8 Hrs)

Generic components of OO Design model, System Design process
,Partitioning the analysis model ,Concurrency and subsystem
allocation , Task Mgmt component, Data Mgmt component
,Resource Mgmt component , Inter sub-system communication ,
Object Design process

7. Object Oriented Analysis (6 Hrs)

Iterative Development, Unified process & UP Phases
Inception Elaboration Construction Transition,
Understanding requirements, UP Disciplines, Agile UP

8. Object Oriented Testing (6 Hrs)

Overview of Testing and object oriented Testing, Types of
Testing, Object oriented Testing strategies, Test case design for
OO software, Inter class test case design

References:

1. The Unified Modeling Language User Guide by Grady Booch, James Raumbaugh, Ivar
Jacobson.
2. Object Oriented Software Engineering by Ivar Jacobson
3. Software Engineering by Pressman
4. Software engineering by Sommer ville
 Far WesternUniversity
Faculty of Engineering
Bachelor in computer engineering
(Course of Study)

Course Title: Operating System Credit: 3

CourseCode: CT 356 Number of lecture/week:3

Year/Semester: Third/Fifth Tutorial/week:1
Level:Bachelor of Engineering(Computer) Totalhours:45

Course Introduction

The course aims to explore the importance of the operating system and its function.

Course Objectives

• Write all or parts of a simple operating system that performs interrupt processing (real or simulated),
CPU management (scheduling), and memory management.
• Compare several different approaches to memory management, file management and processor
management and also describe various problems related to concurrent operations and their solutions.
• Explain in detail virtual address translation and distinguish it from the use of cache.
• Discuss various file system organizations and their interaction with the rest of the operating system.
• Discuss various threats to system security and compare protection mechanisms which may be used
against the threats.

Through this course, Students will learn different aspects of operating system and its
functions and use the idea to design operating system.

Course Outline

Duration (Time
Specific Objectives Contents (UNIT/CHAPTER)
allocated)
Introduction to Chapter1. Introduction 6hr
Operating System Operating system and functions, Evolution,
Types of Operating System(Batch,
Interactive, Real Time), Booting, OS
Structures (Monolithic, Microkernel,
Layered, Virtual Machine), System Call,
Shell commands and programming,
Examples of OS
Process Management Chapter2. Process Management 8hr
Introduction to Process (Process
description, states and PCB), Concept of
Thread and Multithreading, Scheduling
 (preemptive and non preemptive ) ,
Scheduling criteria, Scheduling algorithms
used in batch system, interactive system
and real time system, Multiprocessor
Scheduling
Process Chapter3. Process Communication and 5hr
Communication and Synchronization
Synchronization Principles of Concurrency, Mutual
Exclusion and critical section, Mutual
Exclusion with Busy waiting, Semaphores
and Mutex, Message Passing and
Monitors, Classical Inter Process
Communication problems: Producers
Consumer problem, Dining Philosopher
problem, Sleeping Barber Problem
Memory Management Chapter4. Memory Management: 8hr
Background, Basic Hardware for
managing Memory, Address binding,
Swapping, Contiguous allocation (based
on fixed and variable partitions),
Relocation and protection problems,
Fragmentation, Non-contiguous allocation
(Paging + hardware support,
Segmentation) ,Multilevel Paging, Paging
with Segmentation, Page Faults and Page
Replacement Algorithms, Demand Paging,
Thrashing
Deadlock Management Chapter5. Deadlock Management 5hr
Introduction, Deadlock Conditions,
Deadlock Handling Strategies, Deadlock
Detection, Prevention, Avoidance,
Ignorance, Recovery
File System Chapter6. File System and I/o 8hr
Management Management
File system structure, Implementation,
Partition and mounting, Allocation methods
(Contiguous, Linked List, Indexed), Free space
Management (Bit vector, Linked list,
Grouping, Counting), File System
Performance, Efficiency reliability and file
sharing, Principle of I/O Hardware and
Software, I/O Software Layers, D|isk Arm
Scheduling, Error Handling
System Security Chapter7. System Security 5hr
Principle of least privilege, Threats and
vulnerabilities, Protection mechanisms - access and
capability control, Attacks, Cryptography and
Encryption Algorithms , User (subject)
authentication, Levels of security in "trusted"
systems, The confinement problem
Project work

If a single project is used, it should involve the writing of an operating system, most likely for a simulated
machine. Such a project would be worked on by teams of students (2 or 3 per team) and needs to include
authentication, memory management, device handling, CPU scheduling and some form of resource conflict
(preferably over files).
If multiple small projects are used, they need to encompass the same topics or provide equivalent alternatives,
such as interprocess communication instead of resource conflict or thread management instead of CPU
scheduling. Small projects may be worked on by students individually or in pairs.

Tutorials/Assignments

Four to five class assignments will be provided to the students along with class works in
classes.

Practical

Each practical lab is fully instructed and the lab manual consists of stepwise instruction
necessary for carrying out lab work. Each lab consists of sets of questions that has to be
answered and submitted to the instructor via eLearning.

SN Topics Hours Remarks

1 Unix Commands and Shell Programming 3
2 Process Scheduling Algorithms 3
3 Bankers Algorithms 3
4 Process Synchronization, Semaphores 3
5 Page Replacement Algorithms 3
6 Access control and Privilege, Authentication 3

References

• Silberschatz, Galvin, & Gagne, Operating Systems Concepts, Seventh Edition, Wiley,
2005
• Stalling William, “Operating Systems”, 6th Edition, Pearson Education
• Andrew S. Tanenbaum, “Modern Operating Systems”, 3 rd Edition, PHI
• Charles Crowley, “Operating Systems: A Design‐oriented Approach”, TMH

Evaluationscheme

The questions will cover all the chapters in the syllabus. The evaluation scheme will be as
possible as indicated in the table below:

Chapters Hours Marks distribution*

(Tentative %)
Chapter 1. Introduction 6 14
Chapter 2. Process Management 8 18
Chapter 3. Process Communication and 5 10
Synchronization
Chapter 4. Memory Management 8 18
Chapter 5. Deadlock Management 5 10
Chapter 6. File and I/O Management 8 18
Chapter 7. System Securities 5 12

* There may be minor variation in marks distribution

Final Exam
Internal Evaluation (Marks Weightage) (Marks Total Remarks
Weightage)
Assessment/Class
Performance/Attendance/Quizzes/ Practical
Tutorials/Presentation
Internal marks will be of
20 if there are practicals in
20 20 60 100
the course (20 marks will
be allocated for Practicals)
 Far Western University
Faculty of Engineering
Bachelor of Computer Engineering
(Course of Study 2075)

Course Title: Probability & Statistics Credit: 3

Course Code.: Number of lecture/week: 3
Nature of the Course: Theory Tutorial/week: 1
Year/Semester: III/V Total hours: 45

1. Course Introduction
Many computer processes are probabilistic. To understand and model them, having
fundamental understanding of the probability theory and collecting statistics is required.
Therefore, this course is introduced to provide the fundamental knowledge of the probability
and statistics with some application in computer engineering.
2. Course Objectives
This course aims to provide the fundamental knowledge of probability and statistics to
computer engineering undergraduate students. After carefully study of this course students
can able to
• Understand the role of statistics in engineering
• Understand and apply the basic probability and probability distribution
• Collect, visualize, and summarize the statistics
• Understand the estimation and hypothesis testing and apply it when necessary
• Understand the relationship between variables and apply it when necessary
3. Course Outline
This course provides the introductory concept of basic probability, random variable,
probability distributions, data collection, visualization and description, estimation, hypothesis
testing and bivariate relationships. Topics covered are; role of statistics in engineering, basic
probability, discrete random variables and probability distributions, continuous random
variables and probability distributions, joint probability distribution, random sampling and
data description, point estimation and interval estimation of single sample, test of hypothesis
for mean and proportion (single and double sample case), Simple linear regression and
correlation.

Specific Objective Contents (Unit/ Chapter) Duration

After carefully study of this chapter CHAPTER 1 2 hours
students can able to identify the role of Role of Statistics in Engineering
the statistics in the engineering problem 1.1The Engineering Methods and Statistical
solving process & discuss how Thinking
probability and probability models are
1.2Collecting Engineering Data
used in engineering and science. In
Basic Principles, Retrospective Study,
addition, students can able to identify
Observational Study, and Designed Experiments
the process of collecting engineering
data
After carefully study of this chapter CHAPTER 2 5 hours
students can able to Probability
• Understand the basic terminologies 2.1Sample Spaces and Events
 of the probability. Random Experiments, Sample Spaces, Events
• Calculate and interpret the 2.2 Interpretations of Probability
probability of single and joint event. Introduction and Axioms of Probability
• Interpret and calculate conditional 2.3 Addition and Multiplicative rules
probabilities of events and Bayes’ 2.4 Conditional Probability
theorem 2.5 Bayes’ Theorem
• Understand random variables 2.6 Random Variables
After careful study of this chapter CHAPTER 3 6 hours
students should be able to do the Discrete Random Variable and Probability
following: Distribution
• Determine probabilities from 3.1 Discrete Random Variables
probability mass functions and 3.2 Probability Distributions andProbability Mass
probability distribution function, Functions
and the reverse 3.3 Cumulative DistributionFunctions
• Calculate means and variances for 3.4 Mean and Variance of a Discrete
discrete random variables Random Variable
• Calculate probabilities, determine 3.5 Binomial Distribution
means and variances for each of the 3.6 Geometric and Negative Binomial Distribution
discrete probabilitydistributions 3.7 Poisson Distribution
presented
After careful study of this chapter CHAPTER 4 7 hours
students should be able to do the Continuous Random Variables & Probability
following: Distribution
• Determine probabilities from 4.1 Continuous Random Variables
probability density functions. 4.2 Probability Distributions
• Determine probabilities from and Probability Density Functions
cumulative distribution functions 4.3 Cumulative Distribution Functions
and the reverse 4.4 Mean and Variance of a Continuous Random
• Calculate means and variances for Variable
continuous random variables 4.5 Continuous Uniform Distribution
• Calculate probabilities, determine 4.6 Normal Distribution
means and variances for each of the 4.7 Normal Approximation to the Binomial and
continuous probabilitydistributions PoissonDistributions
presented 4.8 Exponential Distribution
4.9 Gamma Distribution
4.10 Beta Distribution
After careful study of this chapter CHAPTER 5 4 hours
student should be able to do the Joint Probability Distributions
following: 5.1 Jointly Distributed Random Variables
• Use joint probability mass functions Joint Probability Distributions, Marginal Probability
and joint probability density Distributions, and Independence of Random Variables
functions to calculate probabilities
• Calculate marginal distributions
from joint probability distributions
After careful study of this chapter CHAPTER 6 6 hours
students should be able to do the Random Sampling & Data Descriptions
following:
• Compute and interpret the mean,
6.1Data Summary and Dispersion (Mean, Median,
Mode, Range, Quartile Deviation, Inter-Quartile
variance, standard deviation, mode
Range, Standard Deviation, Coefficient of
median, and sample range
Variation)
• Construct and interpret visual data
6.2 Random Sampling
displays, including the stem-and-
6.3 Stem-and-Leaf Diagrams
leaf display, the histogram, the box
6.4 Frequency Distributions andHistograms
plot, time plots, the bar diagram and
6.5 Box Plots
pie diagrams
 6.6 Time Sequence Plots
6.7 Probability Plots
6.8 Bar and Pie Diagrams
After careful study of this chapter CHAPTER 7 5 hours
students should be able to do the Estimation
following: 7.1 General Concepts of PointEstimation and
• Explain the general concepts of Criteria of Good Estimator
estimating the parameters of a 7.2 Sampling Distributions
population or a probability 7.3 Sampling Distribution of
distribution Means (Central limit Theorem)
• Explain important properties of 7.4 Interval Estimation
point estimation Confidence Interval of single mean and
• Understand the central limit Proportion, Determination of Sample Size
theorem
• Construct and interpret the
confidence interval of mean and
proportions
After careful study of this chapter CHAPTER 9 6 hours
students should be able to do the Hypothesis Testing
following: 8.1 Steps in Performing Hypothesis Testing
• Structure engineering decision- 8.2 Critical Region and Level of Significance
making problems as hypothesis 8.3 Types of Error in Hypothesis Testing and
tests
Power of the test
• Test the hypotheses on the mean of
a normal distribution using either a
8.4 One Sample Test of Means (Small sample
Z-test or a t-test procedure (One and large sample cases)and Proportions (use
sample and two sample case) critical value approach and p-value approach)
• Test hypotheses on a population 8.5 Two Sample Test of Means (small sample
proportion (One sample and two and large sample cases) and Proportions (use
sample case) critical value approach and p-value approach)
After careful study of this chapter, CHAPTER 10 4 hours
students should be able to do the Simple Correlation and Regression
following: Analysis
• Use simple linear regression for 9.1 Simple Correlation Analysis (scatter plots,
building empirical models to Pearson’s coefficient of correlation, test for
engineering and scientific data
significance of correlation coefficient)
• Understand how the method of least
squares is used to estimate the
9.2 Simple Linear Regression Analysis
parameters in a linear regression (method of least square estimation, test for
model significance of regression coefficient,
• Test statistical hypotheses on coefficient of determination, assumption of
regression model parameters simple linear regression)
• Apply and calculate the correlation
coefficient

4. Project work:
Students are required to submit at least one project. It must be written in the format prescribed by
APA 6th edition.
5. Tutorials:
One tutorial class should be assigned every week. For tutorial work students are recommended to use
R3.5.1 or SAS or Minitab. Instructors are required to assign at least one assignment to the students
every week.
6. References:
Montgomery, D.C.&Runger, G.C. (2003). Applied Statisticsand Probabilityfor Engineers. New
York:John Wiley & Sons, Inc. (3rd and higher edition)
Ross, S.M. (2014). Introduction to Probability and Statistics for Engineers & Scientist. London:
ELSEVIER. (5th and higher edition)
Jonson, R.A. (2010). Probability & Statistics for Engineers. England; Pearson. (9th and higher
edition)
 Far Western University

Faculty of Engineering
Bachelor in Computer Engineering

(Course of Study)
Course Title: Computer Architecture and Design
Credit: 3

Course Code: CT 355 Number of lecture/week: 3

Year/Semester: Third/Fifth Tutorial/week: 0

Total hours: 45
Level: Bachelor of Engineering (Computer)

Course Objectives:
This course includes concepts of instruction set architecture, organization or micro-architecture,
and system architecture. To provide the basic computer and micro-programmed control unit,
memory and I/O organization of a typical computer system and benefits of pipelined systems

Duration
Specific
Contents (UNIT/CHAPTER) (Time
Objectives
allocated)

1: Introduction (3 Hrs)
1.1 Computer organization and architecture
1.2 Structure and Function
1.3 Computer components and Functions
1.5 Interconnection structure
1.6 Bus interconnection

2: Register Transfer and Microoperations (5 Hrs.)

2.1. Microoperation, Register Transfer
Language, Register Transfer, Control
Function
2.2. Arithmetic Microoperations: Binary Adder,
Binary Adder-subtractor, Binary
Incrementer, Arithmetic Circuit
2.3. Logic Microoperations, Hardware
Implementation, Applications of Logic
 Microoperations.
2.4. Shift Microoperations: Logical Shift,
Circular shift, Arithmetic Shift, Hardware
Implementation of Shifter.

3: Basic Computer Organization and Design (6 Hrs.)

3.1. Instruction Code, Operation Code, Stored
Program Concept
3.2. Registers and memory of Basic Computer,
Common Bus System for Basic Computer.
3.3. Instruction Cycle of Basic computer,
Determining Type of Instruction, Memory
Reference Instructions, Input-Output
Instructions, Program Interrupt & Interrupt
Cycle.
3.4. Description and Flowchart of Basic
Computer

4: Central Processing Unit (3 Hrs.)

4.1 Major Components of CPU, CPU
Organization
4.2 Instruction Formats, Addressing Modes,
Data Transfer and manipulation, Program
Control, Subroutine Call and Return, Types
of Interrupt
4.3 RISC vs CISC, Pros and Cons of RISC and
CISC, Overlapped Register Windows

5: Control Unit (6 Hrs.)

5.1. Microprogrram and hardwiredcontrol unit
5.2 Control Word, Microprogram, Control
Memory, Control Address Register,
Sequencer
5.3 Address Sequencing, Conditional Branch,
Mapping of Instructions, Subroutines,
Microinstruction Format, Symbolic
Microinstructions
5.4 Design of Control Unit

6: Pipelining (5 Hrs.)
6.1. Parallel Processing, Multiple Functional
Units, Flynn’s Classification
6.2. Pipelining: Concept and Demonstration
with Example, Speedup Equation, Floating
Point addition and Subtraction with
Pipelining
6.3. Instruction Level Pipelining: Instruction
Cycle, Three & Four-Segment Instruction
 Pipeline, Pipeline Conflicts and Solutions
6.4. Vector Processing, Applications, Vector
Operations, Matrix Multiplication

7: Computer Arithmetic (6 Hrs.)

7.1 Fixed Point representation, Representing
Negative Numbers, Floating Point
Representation, Arithmetic with
Complements, Overflow, Detecting
Overflow
7.2 Addition and Subtraction with Signed
Magnitude Data, Addition and Subtraction
with Signed 2’s Complement Data
7.3 Booth Multiplication algorithm, restoring
and non restoring Division algorithm

8: Memory Organization (4 Hrs.)

8.1 Memory characteristics,
8.2 Memory Hierarchy
8.3 Cache memory principles: Locality of
Reference, Hit & Miss Ratio, Mapping,
Write Policies
8.2 Memory mapping function

9: Input Output Organization (4 Hrs.)

9.1Input-Output Interface: I/O Bus and
Interface Modules, I/O vs. Memory Bus,
Isolated vs. Memory-Mapped I/O
9.2 Asynchronous Data Transfer: Strobe,
Handshaking
9.3 Modes of Transfer: Programmed I/O,
Interrupt-Initiated I/O, Direct memory Access
9.4 Priority Interrupt: Polling, Daisy-Chaining,
Parallel Priority Interrupt
9.5 Direct Memory Access, Input-Output
Processor, DMA vs. IOP

10: Multiprocessor (3 Hrs.)

10.1 Multiprocessor characteristics
10.2 Interconnection structures and
interprocessor communication and
synchronization
Laboratory Works:
The laboratory work includes implementing and simulating the algorithms, studied in the course,
by using high level languages like C or VHDL. The laboratory works should include at least
following concepts;
• Simulate features like overflow, data representation by using VHDL
• Simulate design of different units by using VHDL
• Simulate pipelining by using VHDL
• Implement algorithms for computer arithmetic using high level language like C or C++

Text Books:
1. M. Morris Mano, “Computer System Architecture”, Prentice-Hall of India, Pvt. Ltd.,
Third edition, 2007

References :
1. William Stallings, “Computer Organization and Architecture”, Prentice-Hall of India,
Pvt. Ltd., Seventh edition, 2005.
2. Vincent P. Heuring and Harry F. Jordan, “Computer System Design and Architecture”,
Prentice-Hall of India, Pvt. Ltd., Second edition, 2003.
 Far Western University
Faculty of Engineering
Bachelor in computer engineering
(Course of Study)

Course Title: Computer Graphics Credit: 3

Course Code: EX 353 Number of lecture/week: 3

Year/Semester: Third/Fifth Tutorial/week: 1
Level: Bachelor of Engineering (Computer) Total hours: 45

Course Introduction

This course will provide the principles of:

• Creation of image of real world object

• Manipulation of the image
• Give realistic representation of created image

Course Objectives

Through this course, Students will learn how to create image of real world object by using
the concept of drawing line, circle, ellipse and curve. Students will learn to manipulate the
object by using transformation and will use the concept to represent the object in three
dimension. They will learn to give realistic representation of image by using the concept of
illumination and surface rendering.

Course Outline

Duration
Specific Objectives Contents (UNIT/CHAPTER)
(Time allocated)
Introduction and Chapter 1. Introduction 3hr
applications History of computer graphics, applications,
Raster and Random displays, Display
architectures
Scan Conversion Chapter 2. Scan Conversion 8hr
Scan Conversion of a Point, Scan
Conversion of a straight line: DDA and
Bresenham’s Algorithm, Scan Converting
a Circle and Ellipse: Mid Point Algorithm
Two Dimensional Chapter 3. 2 Dimensional 7hr
Transformation Transformation
2D Transformation: Translation, Scaling,
Rotation, Shearing, Reflection
2D Viewing Pipeline, World to Screen
 Viewing Transformation, Clipping (Cohen
Sutherland and Liang Barskey Algorithm)
Three Dimensional Chapter 4. 3D Transformation 7hr
Transformation 3D Transformation: Translation, Scaling,
Rotation, Shearing, Reflection
3D Viewing Pipeline, World to Screen
Viewing Transformation, Projections
(Parallel and Perspective)

Three Dimensional Chapter 5. Surface and Curve Modeling 6hr

Object Representation Polygon Surface, Surface Normal and
Spatial Orientation of Surface, Octree
Representation, BSP Tree, Bezier Curve
and properties, Hermite Interpolation,
Parametric Cubic Curve, Spline
Visible Surface Chapter 6. Visible Surface Detection 6hr
Detection Object and Image Space Techniques, Back
face detection, Z Buffer and A Buffer
Method, Scanline method
Illumination and Chapter 7. Illumination and Surface 8hr
Surface Rendering Rendering
Algorithms to simulate Ambient, Diffuse
and Specular Reflections
Constant, Gouraud and Phong Shading
Models

Project work

There will be final project at the end of the course. The project will be designed to build the
real-world 3D object using the mathematical concepts of projections, visible surface
detection and rendering.

Tutorials/Assignments

Four to five class assignments will be provided to the students along with class works in
classes.

Practical

Each practical lab is fully instructed and the lab manual consists of stepwise instruction
necessary for carrying out lab work. Each lab consists of sets of questions that has to be
answered and submitted to the instructor via eLearning.

SN Topics Hours Remarks

1 C- programming (Graphics: line, circle and ellipse) 3
2 DDA Line Drawing Algorithm 3
3 Bresenham’s Line Drawing Algorithm 3
4 Mid Point Circle Drawing Algorithm 3
5 Mid Point Ellipse Drawing Algorithm 3
6 2D Transformation: Translation, Scaling, Rotation 3
7 Parallel and Perspective Projection 3
8 Bezier Curve 3

References

Donald Hearn and M. Pauline Baker, “Computer Graphics C Version

Foley, Van Dam, Feiner, Hughes “Computer Graphics Principles and Practice”

Evaluation scheme

The questions will cover all the chapters in the syllabus. The evaluation scheme will be as
possible as indicated in the table below:

Chapters Hours Marks distribution*

(Tentative %)
Chapter 1. Introduction 3 10
Chapter 2. Scan Conversion 8 15
Chapter 3. 2D Graphics 7 15
Chapter 4. 3D Graphics 7 15
Chapter 5. Surface/Curve Modeling 6 15
Chapter 6. Visible Surface Detection 6 15
Chapter 7. Illumination and Surface 8 15
Rendering

* There may be minor variation in marks distribution

Final Exam
Internal Evaluation (Marks Weightage) (Marks Total Remarks
Weightage)
Assessment/Class
Performance/Attendance/Quizzes/ Practical
Tutorials/Presentation
Internal marks will be of
20 if there are practicals in
20 20 60 100
the course (20 marks will
be allocated for Practicals)