MAKERERE UNIVERSITY - Office of the Academic Registrar ...

Faculty of Technology 

MAKERERE UNIVERSITY 

FACULTY OF TECHNOLOGY 

REGULATIONS AND COURSE CURRICULA 

for 

PROPOSED PROGRAMME 

of 

Degree of Bachelor of Science 

in 

Computer Engineering 

(Day/Evening Programme) 

Kampala - May 2009 

Bachelor of Science in Computer Engineering 

i


CONTENTS 

1. BACKGROUND TO THE PROGRAMME...................................................................................................................... 1 

2. JUSTIFICATION FOR THE PROGRAMME ................................................................................................................. 1 

3. OBJECTIVES AND EDUCATIONAL OUTCOMES ..................................................................................................... 1 

3.1 Educational Objectives .............................................................................................. 1 

3.2 Program Outcomes .................................................................................................... 1 

4. TARGET GROUP ................................................................................................................................................................. 2 

5. REGULATIONS FOR THE DEGREE OF BACHELOR OF SCIENCE IN COMPUTER ENGINEERING ....... 2 

5.1 Admission to First Year............................................................................................. 2 

5.2 The Direct Entry Scheme .......................................................................................... 2 

5.3 The Mature Age Entry Scheme .................................................................................. 2 

5.4 Diploma Holders Entry Scheme ................................................................................. 2 

5.5 Admission to other Years .......................................................................................... 2 

6. CONDUCT OF THE PROGRAMME ............................................................................................................................... 3 

6.1 Type of Programme ................................................................................................... 3 

6.2 Programme Duration ................................................................................................. 3 

6.3 Course Credits ........................................................................................................... 3 

6.4 Type of Courses ......................................................................................................... 3 

6.5 Course Assessment .................................................................................................... 3 

6.6 Semester Course Load ............................................................................................... 3 

6.7 Board of Examiners ................................................................................................... 4 

6.8 Grading Of Courses ................................................................................................... 4 

6.9 Progression................................................................................................................ 4 

6.10 Re-Taking a Course ................................................................................................... 5 

6.11 Absence from Examination ....................................................................................... 5 

6.12 Certificate of Due Performance .................................................................................. 5 

6.13 Withdrawal ............................................................................................................... 5 

6.14 Approval 0f Examination Results .............................................................................. 5 

6.15 Publication of Examination Results ........................................................................... 5 

6.16 Appeals ..................................................................................................................... 6 

6.17 Change Of Course ..................................................................................................... 6 

6.18 Change of Academic Programme .............................................................................. 6 

6.19 Payment of Fees ........................................................................................................ 6 

6.20 Refund of Tuition Fees When a Student Has Withdrawn From Studies ...................... 6 

6.21 Other Specific Examinations Regulations .................................................................. 7 

7. REQUIREMENTS FOR AWARD OF THE BSc. DEGREE IN COMPUTER ENGINEERING ............................ 7 

7.1 Graduation Requirements .......................................................................................... 7 

7.2 Classification of a Degree .......................................................................................... 7 

8. PROGRAMME STRUCTURE ........................................................................................................................................... 7 

ANNEX I: RESOURCES ........................................................................................................................................................... 123 

A. Personnel .............................................................................................................. 123 

B. Equipment and Facilities ....................................................................................... 124 

ANNEX II COSTING ................................................................................................................................................................. 124 

Bachelor of Science in Computer Engineering 

ii


1. BACKGROUND TO THE PROGRAMME 

The Computer Society of the Institute for Electrical and Electronics Engineers (IEEE-CS) and the 

Association for Computing Machinery (ACM) define Computer Engineering as a discipline that 

embodies the science and technology of design, construction, implementation, and maintenance of 

software and hardware components of modern computing systems and computer-controlled 

equipment. This programme prepares students for careers that deal with computer systems from 

design through implementation. Computing systems are components of a wide range of products such 

as fuel injection systems in vehicles, medical devices such as x-ray machines, communication devices 

such as cell phones, and household devices such as alarm systems and washing machines. The work 

done by a Computer Engineer includes designing computing systems and computing components of 

products, developing and testing their prototypes, and commercializing the products. 

Despite the considerable investment by Uganda’s public and private sector in computer systems and 

related facilities, there is currently inadequate human resource capacity in the country to design, 

domesticate, prototype, test, deploy, and maintain these systems. 

The introduction of the Computer Engineering discipline at Makerere University is designed to 

address this situation. 

2. JUSTIFICATION FOR THE PROGRAMME 

There is a proliferation of computer systems and related products in the economy of Uganda and 

manifested in the Banking, Health, and Telecommunications Sectors, as well as in the Automobile, 

Service and Manufacturing Industries. The Computer Engineers trained on this programme will 

provide an invaluable human resource for commissioning, supporting, development, and maintenance 

of the systems. Further, the graduates of this programme, through establishment and creation of 

Business Enterprises, will provide the much needed base in Computer Systems Business Process 

Outsourcing for other Enterprises and Organizations whose core business is not Development and 

Support of Computer Systems. In so doing Uganda will eventually become a hub for provision of 

Computer Systems and Associated Support tailored for both regional and global markets. 

3. OBJECTIVES AND EDUCATIONAL OUTCOMES 

The primary focus of this programme is to produce entrepreneurship-oriented graduates who are 

capable of propping up new companies, out of the prototypes that they will have developed at the 

undergraduate level. This demands that the final year projects should benchmark world class 

standards, capable of leading to Computer Engineering and Information and Communication 

Technologies incubations. 

3.1 Educati onal Objectives 

The educational objectives of this programme are to: 

(a) Produce graduates who are able to practice computer engineering to serve Uganda and the 

regional industries, government agencies, or national and international industries. 

(b) Produce graduates with the necessary background and technical skills to work professionally 

in one or more of the following areas: computer hardware and software design, computerbased 

systems, computer network design, system integration, electronic design automation. 

(c) Prepare graduates for personal and professional success with awareness and commitment to 

their ethical and social responsibilities, both as individuals and in team environments. 

(d) Prepare graduates who are capable of entering and succeeding in an advanced degree 

program in a field such as engineering, science, or business. 

3.2 Program Outcomes 

The outcomes for the computer engineering program are: 

(a) To Understand - to understand fundamentals of computer hardware and software, 

electronics, electronic design automation, and mathematics, and how these are used in 

Bachelor of Science in Computer Engineering 1


computers and computer-based systems. An understanding that engineering knowledge 

should be applied in an ethically responsible manner for the good of society. 

(b) To Question - to critically evaluate alternate assumptions, approaches, procedures, 

tradeoffs, and results related to engineering problems. 

(c) To Design - to design and implement a computer system including processor, memory 

and I/O system, compiler, operating system, and local area network interface. 

(d) To Lead - to lead a small team of student engineers performing a laboratory exercise 

or design project; to participate in the various roles in a team and understand how they 

contribute to accomplishing the task at hand. 

(e) To Communicate - to use written and oral communications to document work and 

present project results. 

4. TARGET GROUP 

The target group for this programme will be the annual outputs of Advanced Level Certificate 

Education, or its equivalent, and those individuals in the working sector possessing appropriate entry 

requirement, who desire to acquire further training at Degree level. 

5. REGULATIONS FOR THE DEGREE OF BACHELOR OF SCIENCE 

IN COMPUTER ENGINEERING 

Studies and examinations for the degree of Bachelor of Science in Computer Engineering – B.Sc. 

(CMP) shall be governed by the general regulations and statutes of Makerere University and in 

addition by the regulations of the Faculty of Technology: 

5.1 Admission to First Year 

Admission into the first year is through any of the three avenues, the Direct Entry Scheme, the Mature 

Age Scheme and the Diploma Holders Scheme. 

5.2 The Direct Entry Scheme 

An applicant must have obtained two advanced level passes, one in Mathematics and one in Physics, 

at the same sitting of the Uganda Advanced Certificate of Education or its equivalent. For purposes of 

computing entry points, the advanced level subjects shall carry the following weights: 

 

 

 

 

Weight 3 - Mathematics, Physics 

Weight 2 - Best of Economics, Chemistry, or Technical Drawing 

Weight 1 - General Paper 

Weight 0.5 - Any other subject. 

5.3 The Mature Age Entry Scheme 

Admission may also be via the Mature Age Entry Scheme, after the passing of two special mature age 

University Examinations, one in aptitude and the other in specialised knowledge. 

5.4 Di ploma Holders Entry Scheme 

Holders of the Uganda National Examinations Board Ordinary Technical Diploma or its equivalent 

can be admitted to the programme. Applicants should have obtained a Credit Class diploma with at 

least a Credit Pass in Mathematics. 

5.5 Admission to other Years 

Admission other than to the first year of the programme shall require a special resolution of the 

Faculty Board and permission of the Senate. The Departments will work out all appropriate Credit 

transfers, which shall not exceed 40% of the minimum degree Credit Units. Persons holding Higher 

National Diploma from a recognised Institution can be admitted to 2 nd year, with the proviso that they 



will be required to take some courses from the 1 st year that the Faculty Board will have identified and 

deemed mandatory. 

6. CONDUCT OF THE PROGRAMME 

6.1 Type of Programme 

This programme shall be conducted through Course-work and Examinations. There shall be 

two types of Programmes, namely, Day Programme (DAY) and Evening Programme 

(EVENING). 

6.2 Programme Duration 

The minimum duration for this programme shall be four (4) years. The course is designated to be 

taken over a minimum period of eight semesters. The duration of a Semester is seventeen (17) weeks. 

There shall be university examinations to be conducted in the last two weeks of each semester. 

6.3 Course Credits 

The programme shall be conducted on credit unit (CU) basis. One credit unit shall be equivalent to 

one contact hour (CH) per week per semester, or a series of 15 contact hours. 

One Contact hour is equivalent to one hour of lectures (LH) or two hours of practical work (PH) or 

five hours of fieldwork/industrial training (FH). 

No course shall carry less than one credit unit. 

6.4 Type of Courses 

The Course content to be covered in this Programme shall be based on the Curriculum approved by 

the Makerere University Senate. The method of teaching and examination will adhere to the Senate 

approved syllabi. This programme shall be composed of of a set of prescribed Courses that shall be 

registered for by every student in order for him or her to qualify for the award of the Degree of 

Bachelor of Science in Computer Engineering. 

Courses in the programme shall be classified as follows: 

(a) 

(b) 

(c) 

(d) 

A core course is one which must be registered for and passed by a student in order to obtain a 

degree. 

An elective course is one which may be taken to make up the minimum requirements of the 

degree. 

An audited course is one which a student attends but is not examined in it. 

A pre-requisite course is one which must be taken and passed before a related higher level 

course. 

6.5 Course Assessment 

(a) 

(b) 

Each course shall be assessed on the basis of 100 total marks with proportions as follows: 

• Course Work 40% 

• Written Examination 60% 

Course work shall consist of laboratory work and progressive assessment (assignments/tests) 

each component assessed at 20%. 

(c) For a course without laboratory work, progressive assessment shall carry 40%. 

(d) 

A minimum of two coursework assignments/tests shall be required per Course. 

6.6 Semester Course Load 

6.6.1 Normal Semester Course Load 

The minimum number of Credit Units per Semester shall be fifteen (15). The maximum number of 

Credit Units per Semester shall be twenty one (21). 

6.6.2 Maximum Semester Course Load 



The maximum number of Credit Units per Semester shall be twenty eight (28) to cater for 

students who have courses to retake or those who are able to complete the requirements for their 

respective Academic Awards in less than the stipulated minimum duration. 

6.7 Board of Examiners 

(a) 

(b) 

(c) 

(d) 

There shall be a Faculty Board of examiners, composed of external and internal examiners 

appointed by Senate on the recommendation of the Board of the Faculty of Technology and 

chaired by the Dean of the Faculty of Technology. 

The Board of Examiners shall receive, consider and recommend to the Faculty Board the 

examination results of each candidate. 

The Faculty Board shall recommend the results of examinations to the Senate for consideration 

and approval. 

In an emergency, the Dean may act on behalf of the Faculty Board or the Board of Examiners 

but must report the action taken to the next Meeting of these Boards. In so doing the Dean 

shall, however, act in consultation with the relevant head of Department. 

6.8 Grading Of Courses 

Each course shall be graded out of a maximum of 100 marks and assigned appropriate letter grades and 

grade point average as follows: 

Table 1: 

Course Grade Criteria 

6.9 Progression 

Marks % Letter Grade Grade Point 

90.0 – 100.0 A+ 5.0 

80.0 - 89.9 A 5.0 

75.0 - 79.9 B+ 4.5 

70.0 -74.9 B 4.0 

65.0 - 69.9 C+ 3.5 

60.0 - 64.9 C 3.0 

55.0 - 59.9 D+ 2.5 

50.0 – 54.9 D 2.0 

45.0 - 49.9 E+ 1.5 

40.0 - 44.9 E- 1.0 

Below 40.0 F 0.0 

Progression of a student shall be classified as Normal, Probationary or Discontinuation. 

6.9.1 Normal Progress 

Normal Progress shall occur when a student has passed all the specified Courses. This occurs when a 

student passes each course taken with a minimum grade point (GP) of 2.0. 

6.9.2 Probationary Progress 

This is a warning stage and it will occur if: 

• A student fails the Core or Compulsory Course. 

• A student obtains the Cumulative Grade Point Average (CGPA) of less than two (2) at the end 

of any semester. 

• When the Grade Point Average of a student goes up in the following semester after the student 

has retaken and passed the failed Courses, then the probation shall be removed. 

6.9.3 Discontinuation 

(a) 

(b) 

When a student accumulates three consecutive probations based on CGPA he/she shall be 

discontinued; 

A student who has failed to obtain at least the Pass Mark (50%) during the Third Assessment in 

in the same Course or Courses he/she had retaken shall be discontinued from his/her studies at 



(c) 

the University; 

A student who has overstayed in an Academic Programme by more than Two (2) Years shall be 

discontinued from his/her studies at the University. 

6.10 Re-Taking a Course 

(a) 

(b) 

(c) 

(d) 

(e) 

(f) 

(g) 

(h) 

A student shall retake a Course when next offered again in order to obtain at least the Pass Mark 

(50%) if he/she had failed during the First Assessment in the Course or Courses. 

A student who has failed to obtain at least the Pass Mark (50%) during the Second Assessment 

in the same Course he/she has retaken shall receive a warning. 

A student may retake a Course when next offered again in order to improve his/her Pass Grade(s) 

got at the first Assessment in the Course were low. 

While retaking a Course or Courses, a student shall: 

(i) 

(ii) 

(iii) 

Attend all the prescribed lectures/tutorials/Practicals/Fieldwork in the Course; 

Satisfy all the requirements for the Coursework Component in the Course; and 

Sit for the University Examinations in the Course. 

A student shall not be allowed to accumulate more than five (5) Retake Courses at a time. 

A final year student whose final Examination Results have already been classified by the 

relevant College/Faculty/School/Institute Board and has qualified for the Award of a 

degree/Diploma/Certificate, shall not be permitted to retake any Course. 

When a student has retaken a course, the better of the two Grades he/she obtained in that Course 

shall be used in the computation of his/her Cumulative Grade Point Average (CGPA). 

Whenever a Course has been retaken, the Academic Transcript shall indicate so accordingly. 

A student who does not wish to retake a failed Elective Course shall be allowed to take a substitute 

Elective. 

6.11 Absence from Examination 

(a) 

(b) 

If the Board of the Faculty of Technology found out that a student has no justifiable reason for 

having been absent from a Particular examination, such a student shall receive a fail (F) Grade 

for the Course(s) he/she had not sat the examination in. The Course(s) in which the Fail (F) 

Grade was/were awarded shall also account in the calculation of the CGPA. 

If the Board of the Faculty of Technology is satisfied that a student was absent from a final 

examination due to justifiable reason(s) such as sickness or loss of a parent/guardian, and then a 

Course Grade of ABS shall be assigned to that Course(s). The student shall be permitted to 

retake the final examination when the Course would be next offered or at the next examination 

season, if the Lecturer concerned can make the appropriate arrangements for the examination. 

6.12 Certificate of Due Performance 

A student who does not have coursework marks shall be denied Certificate of due Performance and will 

not be allowed to sit the University Examinations. 

6.13 Withdrawal 

A student can apply to the Board of the Faculty of Technology for permission to withdraw from studies 

at any time of the semester. 

A student will be allowed only a maximum of two withdrawals in an Academic Programme and each 

withdrawal shall be a maximum of one academic year only. 

6.14 Approval 0f Examination Results 

Approval of all examination results will be by the Board of the Faculty of Technology, but the results 

shall not be regarded as final until they are confirmed by Senate ob submission of Appropriate Pass 

Lists to Senate. 

6.15 Publication of Examination Results 



The relevant faculty shall publish Provisional Examination Results of candidates in every examination 

soon after the meeting of the departmental Examinations Committee. The Examination Results shall be 

arranged and published in a manner as prescribed by the Senate. 

6.16 Appeals 

Any student or candidate aggrieved by a decision of the Board of the Faculty of Technology may appeal 

to the Senate Examinations Committee for reversal or moderation of the decision of the Board. 

6.17 Change Of Course 

A student may be permitted to change course(s) in an Academic Programme in order to substitute the 

Course(s) failed. The substitute Course(s) should be within the specified Course(s) for that Academic 

Programme. 

6.18 Change of Academic Programme 

(a) 

A student may be permitted to change from one Academic Programme to another on condition 

that: 

(i) 

(ii) 

(iii) 

He/She had satisfied the admission requirements for the Academic Programme applied 

for; 

He/She should not have been attending lectures/tutorials and other academic activities 

of the Academic Programme he/she would want to change from for more than one-half 

of the duration of the Programme; 

He/She had not been previously dismissed on disciplinary grounds from the University. 

(b) A student permitted to change his/her Programme may be allowed to transfer the Credits from the 

previous Academic Programme to the new Academic Programme, provided that the Credits being 

transferred are relevant to the new Academic Programme. 

6.19 Payment of Fees 

(a) Privately-sponsored students are required to pay registration fees within the first three (30 

weeks at the beginning of an academic year in order for him/her to be registered and issued 

with the University Identity Card. 

(b) 

(c) 

(d) 

(e) 

A privately-sponsored student who fails to pay the registration fee at the end of the third week 

of the beginning of an academic year shall forfeit his/her place in the University in case the 

student is in the first year or be deregistered in the case of a continuing student. 

Tuition and other University fees are due on the first day of the academic year. Privatelysponsored 

students who can not pay full fees at the beginning of the academic year are 

required to pay at least 40% of the fees by the end of the sixth week of a semester and to 

complete payment of all tuition fees by the end of the twelfth week of a semester. 

A privately-sponsored student who shall not have paid at least 40% of the fees by the end of the 

sixth week shall be de-registered. 

A privately-sponsored student who shall not have completed paying fees by the end of the 

twelfth week will not be allowed to sit for University examinations. 

6.20 Refund of Tuition Fees When a Student Has Withdrawn From Studies 

A student who has been permitted to withdraw from studies shall be refunded the Tuition Fees already 

paid according to the following schedules: 

The time at which a Student 

has withdrawn in a Semester 

(a) By the end of the First week of a Semester 100% 

(b) By the end of the Second week of a Semester 80% 

(c) By the end of the Third week of a Semester 60% 

(d) By the end of the Fourth week of a Semester 40% 

(e) By the end of the Fifth week of a Semester 20% 

Percentage of the Tuition Fees already 

paid to be refunded to the Student 



(f) After the fifth week 0% 

Fees for Residence, Application, Faculty requirements, registration, Examinations, Identity Cards and 

the Guild charges are not refunded. 

In case an Academic Programme to which a student has been admitted is not conducted in a particular 

academic year, the University will refund the full tuition fees paid by the student. 

6.21 Other Specific Examinations Regulations 

Subject to General University Examinations Regulations, there are other specific regulations pertaining 

to this programme, details of which can be sought from the Faculty of Technology or Office of the 

Academic Registrar. 

The following additional letters shall be used, where appropriate: 

• W - Withdrawal from Course 

• I - Incomplete 

• AUD - Audited Course Only 

• The Course Pass Grade Point is 2.0 

• No Credit Unit shall be awarded for any Course in which a student fails. 

7. REQUIREMENTS FOR AWARD OF THE BSc. DEGREE IN 

COMPUTER ENGINEERING 

7.1 Graduation Requirements 

The Degree of Bachelor of Science in Computer Engineering shall be awarded to a Candidate who 

obtains a minimum of 144 credit units, gained from 38 Courses. Of these, 34 shall be core courses and 

4 shall be electives as indicated in Table 1. 

Table 1: 

Requirements for Graduation 

Year Core Courses Electives Courses 

ONE 11 0 

TWO 11 0 

THREE 6 2 

FOUR 6 2 

Total Courses 34 4 

The minimum requirements for graduation is 144 Credit Units 

7.2 Cl assification of a Degree 

The degrees obtained in the Faculty of Technology shall be classified according to the CGPA as 

follows:- 

CLASS 

CGPA 

First 4.40 - 5.0 

Second, Upper Division 3.60 - 4.39 

Second Lower Division Pass 2.80 - 3.59 

Pass 2.0 - 2.79 

8. PROGRAMME STRUCTURE 

The B.Sc. (CMP) Programme shall have the following structure: 

• Five Mathematics Courses 

• Thirty Five Computer Engineering Courses 

• Four Electrical Engineering Courses 

• Four Humanities 

These courses are categorised into core and elective courses as outlined in the table below 



COURSE OUTLINE 

YEAR 

SEMESTE 

R 

COURSE 

CODE 

COURSE NAME 

Bachelor of Science in Computer Engineering 8 

Lecture 

Hours 

(LH) 

Practical 

Hours 

(PH) 

Tutorial 

Hours 

(TH) 

Contact Hours 

(CH) 

Credit Units 

(CU) 

ONE ONE All Core Courses 

EMT1101 Engineering Mathematics I 45 00 30 60 4 

EMT1102 Information and Communications Technology 30 60 00 60 4 

CMP1101 Electronics I 45 30 00 45 4 

TEC1101 Communication Skills 30 00 30 45 3 

CMP 1102 Computer Engineering Ethics 45 00 00 45 3 18 

TWO 

All Core Courses 

EMT1201 Engineering Mathematics II 45 00 30 60 4 

CMP1201 Computer Programming Fundamentals 45 30 00 60 4 

CMP1202 Electronics II 45 30 00 60 4 

CMP1203 Computer Architecture and Organization 45 00 30 60 4 

ELE1201 Electricity and Magnetism 45 00 30 60 4 20 

RECESS TEC1301 Workshop Practice(Core Course) 00 300 00 30 2 2 

TWO ONE All Core Courses 

EMT2101 Engineering Mathematics III 45 00 30 60 4 

CMP2101 Software Engineering 45 00 30 60 4 

CMP2102 Electric Circuits and Signals 45 30 00 60 4 

CMP2103 Object Oriented Programming 45 30 00 60 4 

TEC2101 Sociology for Technology 45 00 00 45 3 19 

TWO 


CMP2201 Discrete Mathematics and Random Processes 45 00 30 60 4 

CMP2202 Analysis and Design of Algorithms 45 00 00 45 3 

CMP2203 Digital Logic 45 30 00 60 4 

CMP2204 Operating Systems Technologies 45 30 00 60 4 

CMP2205 Computer Networks 45 30 00 60 4 19 

RECESS CMP2301 Industrial Training I (Core Course) 00 300 00 30 2 2 

THREE ONE Core Courses 

ELE3101 Electromagnetic Fields 45 30 00 60 4 

ELE3102 Applied Digital Electronics 45 30 00 60 4


CMP3101 Database Systems 45 30 00 45 4 

Elective Courses (At Least One) 

EMT3102 Partial Differential Equations 45 00 30 60 4 

CMP3103 Computer Games Development 45 30 00 60 4 

CMP3104 Computer Based Medical Systems 45 30 00 60 4 

ELE3103 Applied Analogue Electronics 45 30 00 60 4 16 

TWO 

Core Courses 

CMP3201 Embedded Systems 45 30 00 60 4 

CMP3202 Human Computer Interaction 45 30 00 60 4 

CMP3203 Computer Systems Maintenance 45 30 00 60 4 


CMP3204 Distributed Information Systems 45 30 00 60 4 

CMP3205 Intelligent Systems 45 30 00 60 4 

CMP3206 Safety Critical System 45 30 00 60 4 

CMP3207 Sustainable Energy Systems 45 30 00 60 4 16 

RECESS CMP3301 Industrial Training II (Core Course) 00 300 00 0 2 2 

FOUR ONE Core Courses 

TEC4101 Research Methods 45 00 30 60 4 

CMP4101 Digital Signal Processing 45 30 00 60 4 

CMP4102 Instrumentation and Control Engineering 45 30 00 60 4 


TEC4102 Principles of Management 45 00 00 45 3 

CMP4103 Computer Systems and Network Security 30 30 00 45 3 

CMP4104 Digital Image and Video Processing 30 30 00 45 3 15 

TWO 


TEC4201 Entrepreneurship 60 0 60 4 

CMP4201 Research Project 00 120 30 45 4 

CMP4202 VLSI Systems Design 45 30 00 60 4 


CMP4203 Lasers and Photonics 30 30 00 45 3 

CMP4204 Wireless Technologies 30 30 00 45 3 

CMP4205 Audio and Speech Signal Processing 30 30 00 45 3 15 

TOTAL 144 



9. DETAILED COURSE DESCRIPTIONS 

EMT1101: Engineering Mathematics I 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 

LH PH TH CH WTM WE WCM CU 

45 00 30 60 100 60 40 4 

Rationale 

Engineering Mathematics is fundamental to the study of Computer Engineering. It 

provides the necessary analytical skills for the study of more advanced subjects such as 

Electronics, Discrete Mathematics and for the design of Algorithms among others. 

Applied Mathematics is an edifice of computing and is as such crucial for Computer 

Engineering. 

Objectives 

 

 

 

The purpose of this course is to provide an introductory treatment of 

mathematical concepts fundamental to Engineering. 

It consolidates and advances the material covered in Advanced Level 

Mathematics (UNEB). This course also provides the mathematical tools needed 

in other semesters’ course units. 

To develop the analytical and critical thinking abilities fundamental to problem 

solving in Engineering. 

Course Content 

1. Concept of a Function 

Definition, Properties, Range, Domain of the elementary (Algebraic and 

Transcendental) Functions of a Real Variable 

Concept of a limit of a function of a real variable 

Continuity 

Indeterminate forms and L’Hopital’s Rule 

2. Complex Variable Algebra 

Cartesian and Polar Algebra representations; 

Absolute Values; Products, Powers and Quotients; Extraction of Roots; 

De Moivre’s Theorem; 

Exponential and Hyperbolic Functions of the Complex Variable. 

3. Differential Calculus 

The Derivative: Definitions, notation, properties and Theorems; 

Differentiation of elementary functions of a real variable. 

Applications: Optimization, Curve Sketching, Approximations 

Multivariable Differentiation: Partial Derivatives, Optimization and 

approximations. 

4. Integral Calculus 

The Integral: Definition and Properties 

Fundamental theorem of Calculus 

Techniques of Integration 

Definite Integral; its interpretation as area under a curve 

Applications of the Definite Integral: Length of a curve, area bound between 

curves, volume of revolution, moments 



Improper Integrals and their evaluation using limits 

Integration of a Continuous Function; Inequalities; The Definite Integral as a 

Function of its Upper Limit 

Differentiation of an Integral Containing a Parameter; Double Integrals and 

their Applications 

5. Linear Transformations and Matrices 

Definitions and types of matrices 

Operations on Matrices: Sums, Products, Transposition of Matrices, Equality 

of Matrices; 

Determinants: Definition and Properties; Minors and Cofactors; Evaluation 

of Determinants by Cofactors; Rank of a Matrix; Inverse Matrices 

Solution of Systems of Linear Algebraic Equations; Consistent and 

Inconsistent Equations; Systems of Homogeneous Equations; Cramer’s Rule; 

The Gauss-Jordan Method, Gaussian Elimination. 

Learning Outcomes 

Firm grounding in the concepts learned at advanced level 

Recommended and Reference Books 

[1] C. Ray Wylie and Louis C. Barrett, Advanced Engineering Mathematics, 6th 

ed., McGraw Hill, New York, 1995. 

[2] Erwin Kreyszig, Advanced Engineering Mathematics, 8th ed., John Wiley and 

Sons. 

[3] Murray R Spiegel, Theory and Problems of Vector Analysis, SI (Metric) ed., 

McGraw Hill 

[4] K. A. Stroud, Engineering Mathematics, 5 th ed., Palgrave Macmillan, 2005 

[5] Bajpai, Calus, Fairley and Walker, Mathematics for Engineers and Scientists 

[6] Edward & Penney, Calculus, International ed., Prentice Hall, 2002 

[7] J.L. Smyrl, Introduction to University Mathematics, Edward Arnold, 1978 

EMT1102: Information and Communications Technology 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 

LH PH TH CH WTM WEM WCM CU 

30 60 00 60 100 60 40 4 

Rationale 

This course draws upon evolution of Information Communication Technologies as a 

precursor to applications of computers in day-to-day life. This is critical for any 

student going into the field of computer engineering. 

Objectives 

To provide an overview of the evolution of the computer 

To appreciate the societal importance and the trend towards the convergence of 

computing and communication technology 

To introduce students to components of computer hardware and software 

To expose the student to basic computer applications 


1. Introduction and Overview 

Definition of Information and Communication Technology 



History and Evolution of Computing and Information Communication 

Technology 

The changing role of Information and Communication Technology in society 

Current domains of application of Information Communication Technology: 

Mobile Communication, Broadcasting, Internet, Enterprise applications, 

Office automation, Specialised Applications (Engineering, Entertainment, 

Simulation etc.) 

2. The Computer 

Definition of a computer, Types of computers, Elements of Computer 

Information Systems (CIS) 

Introduction to components of the computer: the user, hardware and the 

software 

3. Personal Computer Hardware 

Motherboard, Child-boards, and Circuitry 

Central Processing Unit: Control Unit, Registers and the Arithmetic Logic 

Unit 

Storage: Memory and Auxiliary Storage 

Buses: Types, USB and its advantages 

Chassis 

Peripherals: Input and Output devices 

Expansion cards 

Power Supply and the Un-interruptible Power Supply (UPS) 

Connectors 

4. Firmware 

Definition 

Types of firmware: BIOS and others 

5. Software 

Definition 

Evolution 

System software(operating systems, device drivers, utilities and file 

management) 

Application software (definition and categorization) 

Software development tools 

Licensing (Proprietary, Shareware, freeware, General Public License (GPL)) 

6. Office Automation 

Definitions 

Benefits of office automation 

Overview of office automation tools (Personal Information Management, 

Office Suites) 

7. Word Processing 

Definition and Evolution 

Types of Word Processors 

Features of a word processor 

Word processing exercise 

8. Spreadsheets 

Definition and Evolution 

Limitations of spreadsheets 

Features of a spreadsheet 



Types of spreadsheet applications 

Spreadsheet exercises 

9. Presentations 

Definition 

Preparation 

Features of presentation packages 

Presentation exercise 

10. Email and Browsing the Internet 

Definition of the Internet 

Uses of the Internet 

Netiquette 

Internet Browsers 

Search engines and Web directories 

Email (Definition, Composing, Sending, Archiving, etc.) 

Email clients 

Information Literacy and lifelong learning (Definition and Implications of 

Internet Resources) 

Makerere Information Communication Technology Services 


On completion of this course the student should be able to: 

Discuss the evolution of the computing and information communication 

technology 

Identify the types of computers 

Identify the hardware components of the computer 

Execute basic office automation tasks including word processing, working with 

spreadsheets and preparing computer-aided presentations 

Browse the internet and use email 


Due to the volatile nature of the pertinent content, the student should be guided by the 

substantive instructor to access the reference materials. 

CMP1101: Electronics I 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Electronics is foundational material for computer engineering. The computer is an 

electronic device whose development is highly dependent on advances in the 

electronics industry. For this reason, it is mandatory for a student to have basic 

knowledge of the design of the electronic circuits used to implement computers. 

Objectives 

The course aims to provide the student with: 

 

An understanding of how complex devices such as semiconductor diodes are 

modelled and how the models are used in the design and analysis of useful 

circuits. 



The capability to design and construct circuits, take measurements of circuit 

behavior and performance, compare with predicted circuit models and explain 

discrepancies. 


1. History and Overview 

Reasons for study 

Influential people 

Important areas such as material properties, diodes, transistors, storage 

elements, interfaces and buses 

Issues and parameters in electronics design 

Circuit simulators; data conversion and circuits 

2. Electronic Properties of Materials 

Solid-state materials 

Electrons and holes; Doping, acceptors and donors 

p- and n-type material; Conductivity and resistivity 

Drift and diffusion currents, mobility and diffusivity 

3. Diodes and Diode Circuits 

Diode operation and i-v characteristics 

Regions of operation, models, and limitations 

Schottky, Zener, variable capacitance diodes 

Single diode circuits, the load line 

Multi-diode circuits 

Rectifiers 

dc/dc converters 

Diode logic: AND and OR functions 

4. MOS Transistors and Biasing 

NMOS field-effect transistor operation 

I-V characteristics 

Regions of operation, models, and limitations 

Enhancement and depletion-mode devices 

PMOS devices 

Transfer characteristic of FET with load resistor 

Biasing for logic and amplifier applications 

5. MOS Logic Families 

Logic level definitions 

NMOS logic design: Inverter, NOR, NAND, SOP, POS, complex gates 

PMOS logic 

CMOS logic: Inverter, NOR, NAND, SOP, POS, complex gates 

Dynamic logic 

CVS logic 

Cascade buffers 

NMOS and CMOS power/delay scaling 


 

Identify some contributors to electronics and relate their achievements to the 

knowledge area; describe a transistor and its functionality; identify some storage 

elements; articulate the purpose of buses; indicate the importance of designing 

data conversion circuits; identify two software products used for designing and 



 

 

 

 

simulating circuits; and describe how computer engineering uses or benefits from 

electronics. 

Indicate the properties of materials that lead to be useful for the construction of 

electronic circuits, giving reasons; and explain the uses of one particular material 

(as opposed to alternatives) to serve a stated purpose. 

Explain the properties of diodes; and outline the use of diodes in the construction 

of a range of circuits including rectifiers, ac/dc converters, and common logic 

functions. 

Indicate the areas of use of NMOS, PMOS, CMOS, and dynamic logic families; 

and demonstrate the ability to implement a range of logic functions using each of 

NMOS, PMOS, CMOS, and dynamic logic. 

Explain the differences between the different MOS logic families; and articulate 

the advantages of dynamic logic. 

Recommended and References Books 

[1] Agarwal, Anant, and Jeffrey H. Lang. Foundations of Analog and Digital 

Electronic Circuits. San Mateo, CA: Morgan Kaufmann Publishers, Elsevier, 

July 2005. ISBN: 9781558607354. 

[2] Earl D. Gates, Introduction to Electronics, 4 th ed., Thomson, 2004 

[3] D. C. Green, Electronics 4, 3 rd ed., Longman, 1995 

CMP1102: Computer Engineering Ethics 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 0 00 45 100 60 40 3 

Rationale 

Being a profession that commands a certain way of life, engineering subscribes to 

fundamental rules that the engineer must adhere to in practice. This course introduces 

the student to the practical imperatives of the engineering profession. With the ever 

increasing cases of computer crimes, it is important to expose the student with the 

implications and challenges associated with use of computers in society today. 

Objectives 

 

 

 

 

To develop an understanding of the social and professional context in which 

computer engineering education applies. 

To emphasize the ethical considerations associated with computer engineering. 

To sensitize the computer engineering student about the potential conflicts 

between the obligations to their employer and the obligations to the customer, 

user, and others affected by their work. 

To impress on the student that computer engineers must be cognizant of their 

responsibility to the public. 





Indicate some reasons for studying social and professional issues 

Highlight some people that influenced or contributed to the area of social and 

professional issues 

Indicate some important topic areas such social context of computing, 

professional and ethical responsibilities, risks and trade-offs, intellectual 

property, privacy, and codes of ethics and professional conduct 

Contrast between what is legal to what is ethical 

Explain the importance of ethical integrity in the practice of computer 

engineering 

Mention some ways a computer engineer may have to make conflicting ethical 

choices in practicing the engineering profession 

Explain the meaning of whistle blowing and the dilemma it sometimes places 

on computer engineers 

Explain professionalism relative to a practicing engineer 

Show that credentialing preserves the integrity of a professional 

Describe risk and its contrast with safety 

Explain the difference between a patent and a copyright 

Describe how privacy issues affect the practice of computer engineering 

Explore some additional resources associated with social and professional 

issues 

Explain the purpose and ro le of social and professional issues in 

computer engineering 

2. Public Policy 

Introduction to the social implications of computing 

Social implications of networked communication 

Growth of, control of, and access to the Internet 

Gender-related issues 

3. International issues 

Methods and Tools of Analysis 

Making and evaluating ethical arguments 

Identifying and evaluating ethical choices 

Understanding the social context of design 

Identifying assumptions and values 

4. Professional and Ethical Responsibilities 

Community values and the laws by which we live 

The nature of professionalism 

Various forms of professional credentialing and the advantages and 

disadvantages 

The role of the professional in public policy 

The role of licensure and practice in engineering 

Contrasts of licensure in engineering but not other disciplines 

Maintaining awareness of consequences 

Ethical dissent and whistle blowing 

Codes of ethics, conduct, and practice (NSPE, IEEE, ACM, SE, AITP, and 

so forth) 



Dealing with harassment and discrimination 

“Acceptable use” policies for computing in the workplace 

5. Risks and Liabilities 

Historical examples of software risks such as the Therac-25 case 

Product safety and public consumption 

Implications of software complexity 

Risk assessment and management 

6. Intellectual Property 

Foundations of intellectual property 

Copyrights, patents, and trade secrets 

Software piracy 

Software patents 

Transnational issues concerning intellectual property 

7. Privacy and Civil Liberties 

Ethical and legal basis for privacy protection 

Privacy implications of massive database systems 

Technological strategies for privacy protection 

Freedom of expression in cyberspace 

International and intercultural implications 

8. Computer Crime 

History and examples of computer crime 

“Cracking” (“hacking”) and its effects 

Viruses, worms, and Trojan horses 

Crime prevention strategies 

9. Economic Issues in Computing 

Costing out jobs with considerations on manufacturing, hardware, software, 

and engineering implications 

Cost estimates versus actual costs in relation to total costs 

Use of engineering economics in dealing with finances 

Entrepreneurship: prospects and pitfalls 

Monopolies and their economic implications 

Effect of skilled labor supply and demand on the quality of computing 

products 

Pricing strategies in the computing domain 

Differences in access to computing resources and the possible effects thereof 

10. Philosophical Frameworks 

Philosophical frameworks, particularly utilitarianism and deontological 

theories 

Problems of ethical relativism 

Scientific ethics in historical perspective 

Differences in scientific and philosophical approaches 


On completing this course the student should be able to: 

Identify some contributors to social and professional issues and relate their 

achievements to the knowledge area; Contrast between ethical and legal issues; 

Contrast between a patent and a copyright; Identify some ways of credentialing a 

person to practice computer engineering; Describe issues that contrast risk 

issues with safety issues; Identify some issues in computer engineering that 



address privacy; Describe whistle blowing and the conflicts between ethics and 

practice that may result from doing so; and Describe how computer engineering 

uses or benefits from social and professional issues. 

Interpret the social context of a particular implementation; Identify assumptions 

and values embedded in a particular design; Evaluate a particular implementation 

using empirical data; Describe positive and negative ways in which computing 

altars the modes of interaction between people; and Explain why 

computing/network access is restricted in some countries 

Analyze an argument to identify premises and conclusion; illustrate the use of 

example, analogy, and counter-analogy in ethical argument; detect use of basic 

logical fallacies in an argument; identify stakeholders in an issue and our 

obligations to them; and articulate the ethical tradeoffs in a technical decision. 

Identify progressive stages in a whistle-blowing incident; Specify the strengths 

and weaknesses of relevant professional codes as expressions of professionalism 

and guides to decision-making; Provide arguments for and against licensure in 

non-engineering professions; Identify ethical issues that arise in software 

development and determine how to address them technically and ethically; 

Develop a computer use policy with enforcement measures; 

Explain the limitations of testing as a means to ensure correctness; recognize the 

importance of product safety when designing computer systems; describe the 

differences between correctness, reliability, and safety; recognize unwarranted 

assumptions of statistical independence of errors; discuss the potential for hidden 

problems in reuse of existing components. 

Distinguish among patent, copyright, and trade secret protection; discuss the 

legal background of copyright in national and international law; explain how 

patent and copyright laws may vary internationally; and outline the historical 

development of software patents. 

Summarize the legal bases for the right to privacy and freedom of expression in 

one’s own nation; discuss how those concepts vary from country to country; 

describe current computer-based threats to privacy; and explain how the internet 

may change the historical balance in protecting freedom of expression. 

Outline the technical basis of viruses and denial-of-service attacks; enumerate 

techniques to combat “cracker” attacks; discuss several different “cracker” 

approaches and motivations; and identify the professional’s role in security and 

the tradeoffs involved. 

Describe the assessment of total job costs; evaluate the risks of entering one’s 

own business; apply engineering economic principles when considering fiscal 

arrangements; summarize the rationale for antimonopoly efforts; describe several 

ways in which shortages in the labor supply affect the information technology 

industry; and suggest and defend ways to address limitations on access to 

computing. 

Summarize the basic concepts of relativism, utilitarianism, and deontological 

theories; recognize the distinction between ethical theory and professional ethics; 

identify the weaknesses of the “hired agent” approach, strict legalism, naïve 

egoism, and naïve relativism as ethical frameworks 


[1] Kenneth E. Himma, Herman T. Tavani, 2008. The Handbook of Information and 

Computer Ethics. Wiley-Interscience. ISBN-10: 0471799599 , ISBN-13: 978- 

0471799597 

[2] J. Fernando Naveda and Stephen B. Seidman, 2006. IEEE Computer Society Real- 



World Software Engineering Problems: A Self-Study Guide for Today's Software 

Professional (Practitioners). Wiley-IEEE Computer Society Pr. ISBN-10: 

0471710512 , ISBN-13: 978-0471710516 

[3] Winn Schwartau, D. L. Busch, 2001. Internet & Computer Ethics for Kids: (and 

Parents & Teachers Who Haven't Got a Clue.). Interpact Press. ISBN-10: 

0962870056, ISBN-13: 978-0962870057 

[4] Mike W. Martin, Roland Schinzinger, 2004. Ethics in Engineering. McGraw-Hill 

Science/Engineering/Math; 4 Edition. ISBN-10: 0072831154, ISBN-13: 978- 

0072831153 

[5] Caroline Whitbeck, Woodie C. Flowers, 1998. Ethics in Engineering Practice and 

Research. Cambridge University Press ISBN-10: 0521479444, ISBN-13: 978- 

0521479448 

[6] Gail Dawn Baura, 2006.Engineering Ethics: An Industrial Perspective. Academic 

Press; 1 Edition.ISBN-10: 012088531X, ISBN-13: 978-0120885312 

TEC1101: Communication Skills 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


30 00 30 45 100 60 40 3 

Rationale 

The applications of engineering occur in society, as thus effective communication to 

varied audiences and clientele is a key virtue a computer engineer must possess. 

Communication is a tool through which work gets done, ideas get sold and defended. 

This course introduces to the students principles of organization, development, and 

writing of technical documents; and instils in them skills of listening, speaking and 

interaction. 

Objective 

To develop the skills of reading, listening, speaking and interaction 

To cultivate technical writing and documentation skills 

To enhance the student’s public and formal presentation skills 


1. Interpersonal Skills 

Reading both individual and public 

Listening Skills 

Speaking, Interaction, and Conversational Skills 

The Concept Team Work 

Inter-Office and Intra-Office Communication 

Conduct of Discussions and Dynamics of Meetings 

2. Writing and Documentation Skills 

Note-taking 

Writing Minutes 

Writing Notice of Meeting and Agenda 

Preparing Formal Documents (Resume, Application Letters, Acceptance 

Letters, Resignation Letters, Memos, Circulars, Responses, Letters of 

Introduction etc) 

Development of Technical and Academic Documents(Theses, Proposals, 



Dissertations, Laboratory Reports, Papers, Articles, Abstracts) 

3. Oral Presentation Principles 

Visual and Computer-assisted presentation 

Analysis and Design of Web Presentation 

Choice and use of appropriate presentation tools 

Organising and presenting effective talk 


Upon completion of this course, the student should be able to: 

Exhibit effective skills in reading, listening, speaking and interaction 

 

 

Prepare technical and academic documents 

Effectively deliver Public and Formal Oral Presentations using appropriate Visual 

and Computer aids 


[1] Ros Jay, How to Write Proposals & Reports that Get Results, Pearson-Prentice 

Hall, 2003 

[2] N. A. Saleemi, Business Communication and Report Writing Simplified, 1 st 

ed., N. A. Saleemi Publishers, 1997 

EMT1201: Engineering Mathematics II 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 30 60 100 60 40 4 

Rationale 

Against the foundation of the Calculus and Algebra covered in EMT1101, this course 

develops the fundamental aspects of Mathematical Analysis critical to Engineering. The 

major themes include; Ordinary Differential Equations, Real Analysis, Complex 

Variable Analysis, and Numerical Analysis. 

Objectives 

 

 

 

 

To introduce students to the concept of Single Predictor-Response mathematical 

modelling in areas such as electrical circuit problems and vibratory and 

oscillatory mechanical systems 

To expose students to analytical solutions of classical ordinary differential 

equations in mathematical physics. 

To expose students to the fundamentals of Real Analysis. 

To introduce students the foundations of Scientific Computing and Numerical 

Analysis. 


1. Ordinary Differential Equations 

Definition of Differential Equations 

Definition and Classification of Ordinary Differential Equations 

Formulation of Ordinary Differential Equations - electrical circuit problems 

and vibratory and oscillatory mechanical systems 

Solution Techniques for First Order ODE’s 

- Method of Separation of Variables 

- Methods for Exact Equations 



- Equation Reducible to Exact Form (The Integrating Factor) 

- Applications to electrical circuit problems and vibratory and oscillatory 

mechanical systems 

Solution Techniques for Higher Order ODE’s 

- The General n th Order ODE 

- Existence and Uniqueness of Solution of Linear Equations 

- Second Order Homogeneous ODE’s with Constant Coefficients (auxiliary 

equation and method of variation of parameters) 

- Second Order Non-Homogeneous ODE’s with Constant Coefficients (The 

Complimentary and Particular Solution, Method of Undetermined 

Coefficients) 

- Special Cases (Equations Reducible to 1 st Order or 2 nd Order with 

Constant Coefficients) 

- Applications to electrical circuit problems and vibratory and oscillatory 

mechanical systems 

Solutions of Systems of Linear First Order ODE’s 

2. Real Analysis 

Sequences - Definitions and Examples. Convergence of Sequences, 

Sequences of Real and Complex Numbers. Some Limit Theorems of 

Sequences. 

Series – Definition, Series as a Summation of Terms of a Sequence, 

Necessary Condition for Convergence, Sufficient Conditions for Convergence 

(Cauchy’s n th Root Test, D’Alembert Ratio Test, Comparison Test), 

Convergence of Series with Negative Terms, and Absolute Converge 

Power Series – Definitions, Maclaurin’s and Taylor’s Series and 

Approximations, Arithmetic Operations on Power Series (Sum, Products, 

Shifting of Summation Indices, and Differentiation), Convergence (Radius, 

Interval and Tests) 

Differentiability, Rolle’s Theorem, The Mean Value Theorem, Cauchy’s Mean 

Value Theorem, Proof of L’Hospital’s 

Proof of the Fundamental Theorem of Calculus 

Riemann Integral-Definition and Characteristics 

Fourier Series – Motivation, Definition, Existence, Fourier Series of General 

Functions (of period 2 or arbitrary), Fourier Series of Odd and Even 

Functions, Half-Range Fourier Series Expansions, Determination of Fourier 

Series without Integration. Dirichlet’s Theorem (Limit theorems). Application 

of Fourier Series to Electric Circuits. 

3. Scientific Computing and Numerical Analysis using MATLAB and 

Spreadsheets 

Definition and Rationale for Scientific Computing 

Error Analysis 

Numerical Solutions of Polynomial Algebraic Equations, Interpolation 

Formulae 

Numerical Differentiation and Integration, Trapezoidal and Simpson’s Rules 

of Integration 

Numerical Solutions of Ordinary Differential Equations: Euler method, 

Modified Euler method and Runge-Kutta 

4. Complex Variable Analysis 

Complex Variable Analysis 



Functions of a Complex Variable 

Mapping and Conformal Mapping 

Line Integrals 

Cauchy-Goursat Theorem 

Taylor and Laurent Series 

Residue Theory 

Complex Analysis Applied to Potential Theory 

Z-Transforms 


On completion of this course the student will: 

Be able to formulate Ordinary Differential models associated with Electric 

Circuits 

Obtain analytical and numerical solutions of Ordinary Differential Equations; 

Have acquired the analytical ability critical to engineering problem solving 


[1] Martin M. Lipschutz, Theory and Problems of Differential Geometry, 

McGraw-Hill, 1969 




Sons. 


McGraw Hill 

[5] Murray R. Spiegel, 1981. Applied Differential Equations. 3rd Edition. 

Prentice-Hall, Inc., Englewood Cliffs, N.J. 07632 

[6] Mary L. Boas, 1983. Mathematical Methods in the Physical Sciences. 2nd 

Edition. John Wiley & Sons, INC. New York 

[7] G. Stephenson, 1988. Mathematical Methods for Science Students. 2nd 

Edition. Longman Group UK 

[8] Thomas M. Creese and Robert M. Haralick, 1978. Differential Equations for 

Engineers. McGraw-Hill, N. Y. US 

[9] Shepley L. Ross, 1966. Introduction to Ordinary Differential Equations. 

Blaisdell Publishing Company, Massachusetts, US. 

[10] L. R. Mustoe, 1988. Worked Examples in Advanced Engineering 

Mathematics. John Wiley & Sons Ltd. Great Britain. 

CMP1201: Computer Programming Fundamentals 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Competency in a programming language is prerequisite to the study of computer 

engineering. Object-oriented programming, event-driven applications, and the use of 

extensive APIs (application programming interfaces) are fundamental tools that 

computer engineering students need early in their academic program. 

Objectives 



To introduce the student to the fundamental aspects of computer program 

writing 

To relate with the history and evolution of computer programming 

To expose the student to the state-of-the-art computer programming tools 

To provide the student with the basics of computer program design 



Indicate some reasons for studying programming fundamentals 

Influential people; important areas such as programming constructs, 

algorithms, problem solving, data structures, programming paradigms, 

recursion, object-oriented programming, event-driven programming, and 

concurrent programming 

Contrast between an algorithm and a data structure 

Distinguish between a variable, type, expression, and assignment 

Highlight the role of algorithms in solving problems 

Describe some of the fundamental data structures such as array, record, stack, 

and queue 

Explain how divide-and-conquer strategies lend themselves to recursion 

Explore some additional resources associated with programming 

fundamentals 

Explain the purpose and role of programming fundamentals in computer 

engineering 

2. Programming Languages 

Definition and History 

Characteristics (Pragmatics, Semantics and Syntax) 

Distinction between Text-based and Visual Programming 

Classification (Categorical, Chronological and Generational) 

Comparison of common programming languages (C, C++, C#, Java) 

Programming errors and warnings (syntax, logical, etc.) 

3. Programming Paradigms 

Definition and rationale of a programming paradigm 

Types: Structured, Unstructured, Procedural, Object-oriented, Event-Drive, 

Generic etc. 

Separation of behavior and implementation 

4. ISO/ANSI C++ Programming Fundamentals 

Bjarne Stroustrup Design rules 

Console applications basics (Source file, Basic I/O, Standard I/O Consoles, 

Function main( )) 

Fundamental data types 

Expressions and operators 

Control constructs (Conditional and Iterative) 

Pointers and Named collections (Arrays, Enumerators, Bit-fields, Unions) 

User-defined data types (Structures and Classes) 

Functions (In-built and User-defined) 

Object –oriented programming (Abstraction, Encapsulation, Inheritance, 

Composition, Polymorphism, Friend and Virtual Functions) 

File I/O 

5. Algorithms and Problem-Solving 



Problem-solving strategies 

The role of algorithms in the problem-solving process 

Implementation strategies for algorithms 

Debugging strategies 

The concept and properties of algorithms 

Structured decomposition 

6. The Integrated Development Environment (IDE) 

Definition 

Toolchains 

Advantages of IDEs 

Comparison of IDEs 

Using a typical IDE (Visual Studio) 



 

 

 

 

 

Describe how computer engineering uses or benefits from programming 

fundamentals. 

Identify the appropriate paradigm for a given programming problem. 

Use a suitable programming language to implement, test, and debug algorithms 

for solving simple problems. 

Describe the way a computer allocates and represents these data structures in 

memory. 

Outline the philosophy of object-oriented design and the concepts of 

encapsulation, subclassing, inheritance, and polymorphism. 


[1] Herbert Schildt, 2003. C++ from the Ground Up, Third Edition, McGraw- 

Hill/Osborne, ISBN 0-07-222897-0 

[2] Chuck Easttom, 2003. C++ Programming Fundamentals, Charles River 

Media, ISBN 158402371 

[3] Bjarne Stroustrup, 2000. The C++ Programming Language, Addison-Wesley, 

ISBN 0-201-70073-5 

[4] Michael T. Goodrich, Roberto Tamassio, David Mount, 1995. Data Structures 

and Algorithms in C++, John Wiley, ISBN 0-471-20208-8 

[5] Robert Sedgewick, 2001. Algorithms in C++, Addison – Wesley, ISBN 

0201510596 

[6] Nell Dale, 2003. C++ Data Structures, Jones and Bartlett Publishers 



CMP1202: Electronics II 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

This is a continuation of CMP1101: Electronics I. 

Objectives 


 

An understanding of how complex devices such as field-effect transistors are 

modelled and how the models are used in the design and analysis of useful 

circuits. 





1. Bipolar Transistors and Logic families 

npn and pnp transistor operation 

i-v characteristics 

Regions of operation, models, and limitation 

Transfer characteristic of BJT with load resistor 

Biasing for logic and amplifier applications 

Logic level definitions 

The differential pair as a current switch 

Transistor-transistor logic – inverters, NAND, other functions 

Emitter-coupled logic – OR/NOR gate, other functions 

Low voltage bipolar logic families 

2. Design Parameters and Issues 

Switching energy, power-delay product comparison 

Propagation delay, rise time, fall time 

Fan-in and fan-out 

Power dissipation, noise margin 

Power supply distribution 

Sources of signal coupling and degradation 

Transmission line effects 

passive, active, dc and ac termination 

Element tolerances 

Worst-case analysis of circuits 

Monte Carlo analysis 

Monte Carlo analysis in SPICE 

Six-sigma design 

3. Storage Elements 

Latches 

Flip-flops 



Static RAM cells 

Dynamic RAM cells 

Sense amplifiers 

4. Interfacing Logic Families and Standard Buses 

Terminal characteristics of various logic families 

Standard interface characteristics 

Level translations: TTL/CMOS, TTL/ECL, CMOS/ECL 

Single-ended to differential and differential to single-ended conversion 

Transmission line characteristics, reflections 

Bus termination: Passive, active, dc, ac 

4-20 mA current interfaces 

RS-XXX buses; IEEE-XXXX buses 

Low-level differential signaling 

RAMBUS 

DDR 

5. Circuit Modeling and Simulation 

DC analysis 

AC analysis 

Transient analysis 

Simulation control options 

Built-in solid-state device models 

Device parameter control 

Libraries 

Mixed-mode simulation 


Indicate the areas of use of bipolar logic families; and demonstrate the ability to 

implement a range of logic functions using bipolar logic. 

 

 

 

 

Incorporate design strategies in power distributions and transmission; and apply 

methods to minimize noise and other signal degradations. 

Compare and contrast the properties of different kinds of storage element to 

serve different purposes; and select (with reasons) appropriate kinds of storage 

elements for use in a range of possible devices. 

Explain the practical difficulties resulting from the distribution of signals; and 

explain ways to overcome these difficulties when interfacing different logic 

families. 

Explain with justification the ideal properties of operational amplifiers; design 

various amplifier structures and filters with ideal op-amps; understand 

characteristics of non-ideal op-amps; and design simple circuits with them. 

Explain with justification the benefits and the drawbacks associated with the 

simulation of circuits; identify aspects of circuits that are not readily amenable to 

simulation; and simulate a range of possible circuits using a suitable software 

package. 




[1] Agarwal, Anant, and Jeffrey H. Lang. Foundations of Analog and Digital 

Electronic Circuits. San Mateo, CA: Morgan Kaufmann Publishers, Elsevier, 

July 2005. ISBN: 9781558607354. 

[2] Earl D. Gates, Introduction to Electronics, 4 th ed., Thomson, 2004 

[3] D. C. Green, Electronics 4, 3 rd ed., Longman, 1995 

ELE1201: Electricity and Magnetism 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 15 60 100 60 40 4 

Rationale 

Electromagnetic interactions play a central role in determining the structure of the 

natural world and are the foundation of most current and emergent technology, 

therefore a basic understanding of electricity and magnetism (E&M) is important. In 

E&M the student is quickly introduced to a world in which almost all of the quantities 

are invisible; they are either microscopic such as electrons or abstractions such as field, 

flux, and potential. Integral calculus becomes a central mathematical tool, and students 

are asked to apply it in unfamiliar ways, such as calculating the path integral or surface 

integral of a quantity expressed as a vector dot product. It is necessary for students to 

think and visualize in three dimensions. 

Objectives 

This course aims to give the fundamentals of Electricity and Magnetism by 

introducing the basic concepts and applications of vector calculus. 

It aims to attach quantitative meaning to the previously qualitatively studied laws 

in this topic. 


1. Vector Algebra 

Definitions: Scalars, Vectors, Unit Vector, and Dimensionality 

Operations on Vectors: Addition, Subtraction, Multiplication, Dot and Cross 

Products 

Position and Distance vectors 

2. Vector Analysis 

Scalar and Vector Fields 

Classification of vector fields 

Scalar and Vector Functions 

Directional Derivatives of Scalar Functions and Derivatives of Vector 

Functions 

Gradient, Divergence, Curl and Laplacian of Vector Functions 

Physical Interpretation of the Divergence and the Curl of a Vector Field 

Green’s theorem, Line Integrals Independent of Path, Exact Differential 

Forms 

Differential length, Area and Volume; Line, surface and Volume integrals 

Coordinate systems and Transformation: Cartesian; Cylindrical; Spherical 

coordinate 

3. Electrostatic Fields 



Coulomb’s Law & Field Intensity 

Electric Field due to Continuous Charge Distribution 

Electric flux density 

Gauss’ Law-Maxwell Equation 

Electric potential 

Relationship between E and V 

Energy stored in Electric field 


The course participant is able to attach quantitative meaning to the basic laws of 

Electricity and Magnetism, and also able to give daily-life analogies to the concepts 

studied. The student applies the electricity and magnetism laws studied to explain real 

situations. 

Reference Material 

[1] Matthew N.O. Sadiku, Elements of Electromagnetics, 3rd ed.,Oxford University 

Press, 2001 

[2] Sears F., Zemansky M., Young H., Electricity,Magnetism and Optics. 


McGraw Hill 

[4] William H. Hayt, Jr., Engineering Electromagnetics, 5th ed., Tata McGraw-Hill, 

New Delhi, 1997 

CMP1203: Computer Architecture and Organization 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 30 60 100 40 100 4 

Rationale 

Computer architecture is a key component of computer engineering and the practicing 

computer engineer should have a practical understanding of this topic. It is concerned 

with all aspects of the design and organization of the central processing unit and the 

integration of the CPU into the computer system itself. 

Objectives 

 

 

 

To provide an overview of computer architecture and teach students the 

operation of a typical computing machine. 

To cover basic principles, while acknowledging the complexity of existing 

commercial systems. 

To reinforce topics that are common to other areas of computer engineering; for 

example, teaching register indirect addressing reinforces the concept of pointers 

in C. 

To expose the student to how various peripheral devices interact with, and how 

they are interfaced to a CPU. 






Influences on Computer Architecture Organization 

System organization and architecture, memory, interfacing, microprocessors, 

and performance; Differences between computer organization and 

architecture; binary arithmetic 

Components of computer design; CPU organization; Caching; 

Multiprocessing strategies 

2. Fundamentals of computer architecture 

Organization of the von Neumann machine, Instruction formats, The 

fetch/execute cycle; instruction decoding and execution , Registers and 

register files, Instruction types and addressing modes, Subroutine call and 

return mechanisms, Programming in assembly language, I/O techniques and 

interrupts 

3. Computer Arithmetic 

Representation of integers (positive and negative numbers), Algorithms for 

common arithmetic operations (addition, subtraction, multiplication, division) 

Significance of range, precision, and accuracy in computer arithmetic, 

Representation of real numbers (standards for floating-point arithmetic) 

Algorithms for carrying out common floating-point operations, Converting 

between integer and real numbers , Multi-precision arithmetic 

Hardware and software implementation of arithmetic unit 

The generation of higher order functions from square roots to transcendental 

functions 

4. Memory System Organization and Architecture 

Memory systems hierarchy, Coding, data compression, and data integrity , 

Electronic, magnetic and optical technologies 

Main memory organization and its characteristics and performance, Latency, 

cycle time, bandwidth, and interleaving, Cache memories (address mapping, 

line size, replacement and write-back policies), Virtual memory systems 

Memory technologies such as DRAM, EPROM, and FLASH, Reliability of 

memory systems; error detecting and error correcting systems 

5. Interfacing and Communication 

I/O fundamentals: handshaking, buffering 

I/O techniques: programmed I/O, interrupt-driven I/O, DMA 

Interrupt structures: vectored and prioritized, interrupt overhead, interrupts 

and reentrant code 

Memory system design and interfacing 

Buses: bus protocols, local and geographic arbitration 

6. Device Subsystems 

External storage systems 

Organization and structure of disk drives and optical memory 

Basic I/O controllers such as a keyboard and a mouse, RAID architectures, 

Video control, I/O Performance, SMART technology and fault detection 

Processor to network interfaces 

7. Processor System Design 

The CPU interface: clock, control, data and address buses 

Address decoding and memory interfacing 

Basic parallel and serial interfaces 



Timers 

System firmware 

8. Organization of the CPU 

Implementation of the von Neumann machine 

Single vs. multiple bus data paths 

Instruction set architecture 

Machine architecture as a framework for encapsulating design decisions 

Relationship between the architecture and the compiler 

Implementing instructions 

Control unit: hardwired realization vs. microprogrammed realization 

Arithmetic units, for multiplication and division 

Instruction pipelining 

Trends in computer architecture: CISC, RISC, VLIW 

Introduction to instruction-level parallelism (ILP) 

Pipeline hazards: structural, data and control, reducing the effects of hazards. 

9. Performance 

Metrics for computer performance; clock rate, MIPS, Cycles per instruction, 

benchmarks 

Strengths and weaknesses of performance metrics 

Averaging metrics: arithmetic, geometric and harmonic 

The role of Amdahl’s law in computer performance 

10. Distributed System Models 

Classification of models: parallel machine models (SIMD, MIMD, SISD, 

MISD) 

Flynn’s taxonomy, Handler’s classification, message passing , Granularity, 

levels of parallelism, 

Multiprocessors and multi-computers 

Topology, tightly coupled and loosely coupled architectures 

Processes: threads, clients, servers, code migration, software agents, 

Physical and logical clocks: clock synchronizing algorithms, Lamport 

timestamps, vector timestamps, 

Election Algorithms, 

Mutual Exclusion algorithms, 

Distributed transactions: models, classification, concurrency control 



Identify some contributors to computer architecture and organization and relate 

their achievements to the knowledge area; explain the reasons and strategies for 

different architectures; articulate differences between computer organization and 

computer architecture; identify some of the components of a computer; indicate 

some strengths and weaknesses inherent in different architectures; and describe 

how computer engineering uses or benefits from computer architecture and 

organization. 

Explain the organization of a von Neumann machine and its major functional 

units; explain how a computer fetches from memory and executes an instruction; 

articulate the strengths and weaknesses of the von Neumann architecture; explain 

the relationship between the representation of machine level operation at the 

binary level and their representation by a symbolic assembler; explain why a 



designer adopted a given different instruction formats, such as the number of 

addresses per instruction and variable length vs. fixed length formats; write small 

programs and fragments of assembly language code to demonstrate an 

understanding of machine level operations; implement some fundamental highlevel 

programming constructs at the machine-language level; and use computer 

simulation packages to investigate assembly language programming 

Appreciate how numerical values are represented in digital computers; 

understand the limitations of computer arithmetic and the effects of errors on 

calculations; and appreciate the effect of a processor’s arithmetic unit on its 

overall performance 

Identify the main types of memory technology; explain the effect of memory 

latency and bandwidth on performance; explain the use of memory hierarchy to 

reduce the effective memory latency; describe the principles of memory 

management; and understand how errors in memory systems arise and how to 

resolve them. 

Explain how to use interrupts to implement I/O control and data transfers; write 

small interrupt service routines and I/O drivers using assembly language; identify 

various types of buses in a computer system; describe data access from a 

magnetic disk drive; and analyze and implement interfaces. 

Compute the various parameters of performance for standard I/O types; explain 

the basic nature human computer interaction devices; and describe data access 

from magnetic and optical disk drives 

Understand how a CPU chip becomes a complete system; design an interface to 

memory; understand how to interface and use peripheral chips; write sufficient 

EPROM-based system software to create a basic stand-alone system; and specify 

and design simple computer interfaces. 

Understand the factors that contribute to computer performance; understand the 

limitations of performance metrics; select the most appropriate performance 

metric when evaluating a computer; and discuss the impact on control and 

datapath design for performance enhancements. 

Explain the differences between different paradigms and their usefulness and 

applicability; understand how client server model works in a decentralized 

fashion; understand how agents work and how they solve simple tasks; 

understand the concept of logical clocks vs. physical clocks and how they affect 

implementation of distributed systems and be familiar with simple election and 

mutual exclusion algorithms and their applicability. 

Discuss how various architectural enhancements affect system performance; 

discuss how to apply parallel processing approaches to design scalar and 

superscalar processors; discuss how to apply vector-processing techniques to 

enhance instruction sets for multimedia and signal processing; understand how 

each of the functional parts of a computer system affects its overall performance; 

and estimate the effect on system performance of changes to functional units. 


[1] Linda Null and Julia Lubor. The Essentials of Computer Organization and 

Architecture, Second Edition, Jones & Bartlett. ISBN-10: 0763737690, ISBN- 

13: 978-0763737696 

[2] Harold Lorin, 1982. Introduction to Computer Architecture and Organization, 

Wiley. 

ISBN 0471866792, 9780471866794 



[3] John L. Hennessy, 2002. Computer Architecture: A Quantitative Approach, 

3rd Edition, Morgan Kaufmann, ISBN-10 / ASIN: 1558605967, ISBN-13 / 

EAN: 9781558605961 

[4] William Stallings, 2002. Computer Organization and Architecture, 6th edition, 

Prentice Hall. ISBN-10 / ASIN: 0130351199, ISBN-13 / EAN: 

9780130351197 

[5] Computer Design and Architecture, 3rd Edition Revised and Expanded CRC. 

ISBN: 0824703685 

[6] Mostafa Abd-El-Barr, 2004. Fundamentals of Computer Organization and 

Architecture (Wiley Series on Parallel and Distributed Computing), Wiley- 

Interscience, ISBN-10 / ASIN: 0471467413, ISBN-13 / EAN: 

9780471467410 

[7] Douglas E. Comer, 2004. Essentials of Computer Architecture, US edition, 

Prentice Hall 

ISBN-10: 0131491792, ISBN-13: 978-0131491793 

TEC1301: Workshop Practice (Core) 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


00 300 00 30 100 0 100 2 

Rationale 

This course is designed to give the student practical exposure to setting up and 

repairing the hardware of a computer. The student is also introduced to practical work 

done outside Computer Engineering in preparation for multidisciplinary work. 

Objectives 

The course aims to: 

Provide the student with basic vocational skills. 

Enable the student to appreciate the work of technicians hence prepare him or 

her for managerial positions. 

Develop student’s technical reporting and writing on practical work. 


1. The Computer Workshop 

PC assembly 

PC cleaning (blowing) 

Computer repairs and upgrade 

Hardware troubleshooting 

Installation of motherboard, sound card, video card, DVD burner, modem, 

wireless network card, disk drives 

Installation and troubleshooting of printers, scanners, digital cameras 

Operating system installation 

BIOS configuration 

Network cable termination 

Data backup and recovery 

2. Manual Practice 

Introduction to tools 

Marking off 

Measurement 

Fitting 



3. Machine Shop Processes 

Turning 

Milling 

Grinding 

Drilling 

4. Fabrication Practice 

Joining processes (screw fastening, riveting, welding, adhesive bonding) 

Fabrication of items 

5. Electrical House Wiring 

Regulations 

Consumer circuits and wiring accessories 

Diagnosis and Repair of Electric appliances 

6. Repair of Electronic Equipment 

Radios 

TVs 

7. Building Construction 

Brickwork 

Concrete work 

Trusses and Plumbing 

8. Building Finishing Processes 

painting, 

varnishing and 

decorating 

TEC2101: Sociology for Technology 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 00 45 100 60 40 3 

Objective 

The objective of the course is to educate the engineer-to-be of the role that society 

plays in ensuring steady development such that one can be able to cope with the social 

dynamics in order to deliver projects effectively. 


1. Social structures 

Individual, family, and community 

Family kinship and neighbourhood structure, status and class 

Manifest and latent of institutions and groups; social norms, conflict and 

control 

Dynamics of social change with specific reference to E. Africa/Uganda 

Reflections of these issues in dwelling, community and development 

Introduction to Urban Sociology in developing countries like Uganda 

2. Industrialisation and its impact on society 

Assessment of impacts of appropriate technology, intermediate technology 

and high-technology on the development of society. 



Effects of industrialization on the environment; Impact of land tenure system 

on industrial development 

EMT2101: Engineering Mathematics III 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 30 60 100 40 100 4 

Rationale 

Drawing from the concepts covered in Engineering Mathematics I and II, this course is 

designed to consolidate and advance analytical techniques for solution of ordinary 

differential equations; and introduces concepts fundamental to the study of other 

courses in Computer Engineering. The major themes covered include integral 

transforms, series solutions to ordinary differential equations and special functions. 

Objectives 

 

 

 

Introduce the student to Integral Transforms and their application to the 

solution of Ordinary Differential Equations 

Introduce the Power Series solution technique to Ordinary Differential Equations 

Expose the student to some special functions fundamental to engineering 

specifically Gamma, Beta, Bessel and Legendre 


1. Fourier Integrals and Transformations 

Motivation for the Fourier Integral 

Definition of Fourier Integral as a limit to the Fourier Series with period 

tending to infinity 

Conditions for existence of a Fourier Integral representation (Dirichlet’s 

conditions, Existence of the absolute integral for the entire real axis) 

Complex exponential Fourier Integral representation, Standard Fourier 

Integral representation, Fourier Cosine and Sine Integral representations 

Definition of the Fourier Transform and its Inverse 

Frequency spectrum of periodic and continuous functions 

Distinction between the Fourier Transform and Integral 

Properties of the Fourier Transform Transform: Linearity, First Shift 

Theorem, Second Shift Theorem, t- duality, Time differentiation, 

Frequency Differentiation, Convolution, Correlation 

Fourier Transform of special functions: Delta function (Sifting property), 

Heaviside Step function, 

Applications: Parseval’s theorem, RCL circuits, Frequency shifting in 

Communication theory (carrier signals and Antenna design) 

Solution of Ordinary Differential Equations with constant coefficients 

2. Laplace Transformations 

Motivation for the Laplace transform 

Definition of the Laplace transform 

Comparison of the Laplace and Fourier Transforms 

Conditions for existence of the Laplace transform (Dirichlet’s conditions, 

Piecewise continuity of thee function) 



Properties of Laplace Transforms: Linearity, First Shift Theorem, Second 

Shift Theorem, Time differentiation, s-domain Differentiation, s-domain 

Integration 

Laplace Transforms of special functions: Delta function and Heaviside 

function 

Solutions of Ordinary Differential Equations by Laplace Transform 

Techniques 

Solutions of Simultaneous Linear Ordinary Differential Equations with 

constant coefficients 

Applications in RLC Circuit Analysis 

3. Power Series Solutions to Ordinary Differential Equations 

Motivation of the Power Series solution method 

Concept of the Power Series method (Ordinary points, Singular points) 

Series solutions about Ordinary points 

Series solutions about Regular Singular points (Method of Frobenius) 

4. Gamma and Beta Functions 

Integral Definition of Gamma and Beta Functions 

Properties of Gamma and Beta Functions 

Generalisation of the factorial by Means of the Gamma function 

Relations Between Gamma and Beta Functions 

Definition of Gamma Function for Negative Values of Argument 

5. Bessel Functions 

Bessel’s Equation and its Solutions. 

Familiarisation with Characteristics and Graphs of Bessel Functions 

Properties of Bessel Functions of the First Kind: Differentiation, Recurrence 

relationships, Generating functions 

Ordinary Differential Equations solvable using the notion of Bessel’s 

equations 

Integral Representations of Bessel Functions 

Integrals Involving Bessel Functions 

Laplace Transforms of Bessel functions 

6. Legendre Functions 

Legendre’s Equation and its Solutions 

Legendre’s Polynomials; the Generating Function for Legendre’s 

Polynomials; Orthogonality of Legendre’s Polynomials 

Rodriguez’s formula 

Orthogonality Relations for the Associated Legendre Functions, 

Familiarisation with Characteristics and Graphs of Legendre’s Polynomials 

and Associated Legendre Functions 

Integrals involving Legendre Polynomials 



Demonstrate a firm understanding of the solution techniques for Linear Ordinary 

Differential Equations, Properties of Integral Transforms and Special functions 

Use the Integral Transforms in Circuit Analysis 

References 






Sons. 

[3] Murray R. Spiegel, 1981. Applied Differential Equations. 3rd Edition. 

Prentice-Hall, Inc., Englewood Cliffs, N.J. 07632 

[4] Mary L. Boas, 1983. Mathematical Methods in the Physical Sciences. 2nd 

Edition. John Wiley & Sons, INC. New York 



[6] L. R. Mustoe, 1988. Worked Examples in Advanced Engineering 

Mathematics. John Wiley & Sons Ltd. Great Britain 

CMP2101: Software Engineering 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 30 60 100 40 100 4 

Rationale 

Software engineering is the discipline concerned with the application of theory, 

knowledge, and practice to build effectively and efficiently software systems that 

satisfy the requirements of users and customers. Software engineering is applicable to 

small, medium, and large-scale systems. It encompasses all phases of the life cycle of a 

software system. The life cycle includes requirement analysis and specification, design, 

construction, testing, and operation and maintenance. The development of programs 

benefits from the concepts and practices derived from software engineering. 

Software engineering employs engineering methods, processes, techniques, and 

measurement. It benefits from the use of tools for managing software development; 

analyzing and modeling software artifacts; assessing and controlling quality; and for 

ensuring a disciplined, controlled approach to software evolution and reuse. Software 

development, which can involve an individual developer or a team of developers, 

requires choosing the tools, methods, and approaches that are most applicable for a 

given development environment. 

Objectives 

 

 

To introduce the student to the evolution and scope of Software Engineering as 

a discipline and as a Profession 

To expose the student to the practical imperatives underpinning software 

development – requirements analysis, design, implementation, testing, 

deployment, user training and support, and maintenance 



Indicate some reasons for studying software engineering 

Highlight some people that influenced or contributed to the area of software 

engineering 

Indicate some important topic areas such as the software process, 

requirements, specifications, design, testing, validation, evolution, and project 

management 

Contrast software engineering with computer engineering 

Mention some examples that would use the software engineering approach 



Indicate the existence of formalized software processes such as the software 

life cycle 

Explain that requirements and specifications may change slightly as a software 

project evolves 

Indicate the importance of language selection when doing software design 

Highlight the importance of testing and validation in a software projects 

Explore some additional resources associated with software engineering 

Explain the purpose and role of software engineering in computer engineering 

2. Software Processes 

Software life cycle and process models (Waterfalls, Spiral, Extreme 

programming, Agile, RAD, RUP) 

Process assessment models 

Software process metrics 

3. Software Requirements and Specifications 

Requirements elicitation 

Requirements analysis modeling techniques 

Functional and nonfunctional requirements 

Prototyping 

Basic concepts of formal specification techniques 

Software Requirements Specification 

4. Software Design 

Fundamental design concepts and principles 

Software architecture (Software quality attributes – Runtime, Business, and 

Engineering; Architectural views and viewpoints; The technical architecting 

process; Organisational architecting; Architectural styles) 

Modeling with UML 

Structured design 

Object-oriented analysis and design 

Domain-driven development 

Design for reuse 

5. Software Verification and Validation 

Verification (Static and Dynamic) 

Validation planning 

Testing fundamentals, including test plan creation and test case generation 

Black-box and white-box testing techniques 

Unit, integration, validation, and system testing 

Object-oriented testing 

Inspections 

6. Software Evolution 

Software maintenance: the different forms of maintenance; the associated 

disciples and the role and the nature of configuration management and version 

control 

Impact analysis 

Regression testing 

Associated software support 

Characteristics of maintainable software 

Software re-use in its different forms – their strengths and weaknesses 



Reengineering 

Legacy systems 

Software retirement 

7. Software Tools and Environments 

Programming environments 

Requirements analysis and design modeling tools 

Testing tools 

Configuration management tools 

Tools based on databases – their design and development 

Additional possibilities including CASE tools 

Tool integration mechanisms 

8. Language Translation 

The range of tools that support software development for the computer 

engineer; the role of a formal semantics of a language 

Different possibilities regarding language translation: comparison of 

interpreters and compilers for high-level languages, and silicon compilers for 

hardware description languages, additional possibilities 

Language translation phases (lexical analysis, parsing, generation phase, 

optimization); separate compilation or translation - the benefits and the 

mechanisms; machine-dependent and machine-independent aspects of 

translation 

9. Software Project Management 

Team management: team processes; team organization and decision-making, 

roles and responsibilities in a software team; role identification and 

assignment; project tracking; team problem resolution 

Project scheduling 

Software measurement and estimation techniques 

Risk analysis 

Software quality assurance 

Software configuration management 

Project management tools 

Software project documentation 

10. Software Fault Tolerance 

Software reliability models 

Software fault-tolerance methods: N-version programming, recovery blocks, 

rollback and recovery 

Fault tolerance in operating systems and data structures 

Fault tolerance in database and distributed systems 


On completion of this course the student will be able to: 

Select, with justification, the software development models most appropriate for 

the development and maintenance of diverse software products; and explain the 

role of process maturity models. 

Apply key elements and common methods for elicitation and analysis to produce 

a set of software requirements for a medium-sized software system; use a 

common, non-formal method to model and specify (in the form of a requirements 

specification document) the requirements for a medium-size software system 

(e.g., structured analysis or object-oriented-analysis); conduct a review of a 



software requirements document using best practices to determine the quality of 

the document; and translate into natural language a software requirements 

specification written in a commonly used formal specification language. 

Evaluate the quality of multiple software designs based on key design principles 

and concepts; using a software requirement specification and a common program 

design methodology and notation, create and specify the software design for a 

medium-size software product (e.g., using structured design or object-oriented 

design); and using appropriate guidelines, conduct the review of a software 

design. 

Demonstrate the application of the different types and levels of testing (unit, 

integration, systems, and acceptance) to software products of medium size; 

undertake, as part of a team activity, an inspection of a medium-size code 

segment; and describe the role that tools can play in the validation of software. 

Identify the principal issues associated with software evolution and explain their 

impact on the software life cycle; develop a plan for re-engineering a mediumsized 

product in response to a change request; discuss the advantages and 

disadvantages of software reuse; and demonstrate the ability to exploit 

opportunities for software reuse in a variety of contexts. 

Select, with justification, an appropriate set of tools to support the software 

development of a range of software products; analyze and evaluate a set of tools 

in a given area of software development (e.g., management, modeling, or 

testing); and demonstrate the capability to use a range of software tools in 

support of the development of a software product of medium size. 

Compare and contrast compiled and interpreted execution models, outlining the 

relative merits of each; describe the phases of program translation from source 

code to executable code and the files produced by these phases; explain the 

differences between machine-dependent and machine-independent translation; 

and show the manner in which these differences are evident in the translation 

process. 

Demonstrate through involvement in a team project the central elements of team 

building and team management; prepare a project plan for a software project that 

includes estimates of size and effort, a schedule, resource allocation, 

configuration control, change management, and project risk identification and 

management; and compare and contrast the different methods and techniques 

used to assure the quality of a software product. 

Understand the concept of software faults and reliability of software; understand 

various redundancy methods used to allow software to detect software faults and 

produce correct results in the presence of software faults; and understand 

software fault tolerance approaches used in operating systems, database systems, 

and distributed systems. 


[1] Roger S. Pressman. Software Engineering: A Practitioner’s Approach, 

McGraw-Hill, 2004 ISBN 007301933X, 97800783019338 

[2] Ian Sommerville. Software Engineering, Pearson/Addison-Wesley, 2004. ISBN 

0321210263, 9780321210265 

[3] IEEE Std 1471-2000, IEEE Recommended Practice for Architectural 

Description of Software-Intensive Systems 

[4] IEEE Std 830-1998, IEEE Recommended Practice for Software Requirements 

Specifications (Revision of IEEE Std 830-1993) 



[5] Len Bass, Paul Clements, Rick Kazman, April 11, 2003. Software Architecture 

in Practice, Second Edition. Addison Wesley. ISBN: 0-321-15495-9 

[6] Jeff Garland &Richard Anthony, Large Scale Software Architecture, John 

Wiley and Sons, ISBN 0 470 84849 9 

[7] Stephen T. Albin, 2003. The Art of Software Architecture: Design Methods 

and Techniques, John Wiley & Sons, ISBN:0471228869 

[8] Bennett, S, 2005. Object-Oriented Systems Analysis and Design Using 

UML, 3rd Edition, McGraw-Hill, ISBN: 0077110005 , ISBN 13: 

9780077110000 

[9] Donald Yates and Tony Wakefield, 2004. Systems Analysis and Design, 

Second Edition, Prentice Hall, Pearson Education Limited. ISBN 0273 65536 1 

[10] IEEE Std 730 – 2002. IEEE Standard for Software Assurance Plans 

[11] IEEE Std 829- 1998. IEEE Standard for Software Test Documentation 

CMP2102: Electric Circuits and Signals 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 40 100 4 

Rationale 

Circuits and signals are foundational material for computer engineering. These areas 

provide the basic knowledge for the design of the circuits used to implement 

computers. Knowledge of the electrical circuits used to implement digital circuits and 

computers is crucial to the computer engineer. 

Objective 


An introduction of circuit analysis concepts and theorems used in DC and AC 

analysis, alongside laboratory work in order to enable one appreciate the 

practicality of theoretical aspects. 

Skills for the analysis of electrical circuits of continuous current. Different 

methods and techniques for the analysis and simplification of electric circuits are 

studied in detail, making the student able to identify the most adequate technique 

in each case. Circuits are analyzed and simulated using PSPICE and then 

constructed in laboratory to compare calculated and measured results. 

 

The ability to formulate and solve the differential equations describing time 

behavior of circuits containing energy storage elements. 






Indicate some reasons for studying circuits and systems 

Highlight some people that influenced or contributed to the area of circuits 

and systems 



Indicate some important topic areas such as electrical quantities, resistance, 

reactance, frequency response, sinusoids, convolution, discrete-time signals, 

Fourier representation, filters, and transforms 

Contrast between current and voltage 

Describe Ohm’s Law 

Explain reactive elements such as inductance and capacitance 

Indicate that frequency affects reactive elements, but not resistance elements ; 

Mention phase and the meaning of being “out of phase ” 

Distinguish how signal sampling can produce aliasing and quantizing 

Illustrate the design of a “square wave” from a trigonometric Fourier series 

Explore some additional resources associated with circuits and systems 

Explain the purpose and role of circuits and systems in computer engineering 

2. Electrical Quantities 

Charge 

Current 

Voltage 

Energy 

Power 

3. Resistive Circuits and Networks 

Ohm’s Law 

Kirchoff’s laws 

Independent and dependent sources 

Series and parallel elements 

Voltage and Current measurement 

Mesh and Nodal analysis 

Superposition 

Thevenin’s and Norton’s theorems 

Maximum power transfer 

4. Reactive Circuits and Networks 

Inductance 

Capacitance 

Mutual inductance 

Time constants for RL and RC circuits 

Transient response of RL, RC, and RLC circuits 

Damping 

Transformers 

5. Frequency Response 

Response of RL, RC, and RLC circuits 

Transfer functions 

Two-port circuits 

Parallel and series resonance. 

6. Sinusoidal Analysis 

Phasor representation of voltage and current 

Forced response to sinusoidal functions 

Impedance and Admittance 

Nodal and Mesh analysis 

Thevenin’s and Norton’s theorems 



Phasor diagrams 

Superposition 

Source transformations 

7. Convolution 

Impulse response 

Convolution integral 

Physically realizable systems 

Graphical methods 


On completion of this course the students will: 

 

Appreciate new concepts in AC and DC Circuit analysis and on completion of 

this course unit a student will be firmly convinced that the theorems and 

concepts hold practically; 

 

Become adept at using various methods of circuit analysis, including simplified 

methods such as series-parallel reductions, voltage and current dividers, and the 

node method; 

 

Appreciate the consequences of linearity, in particular the principle of 

superposition and Thevenin-Norton equivalent circuits. 


[1] Dorf and Svoboda, Electrical circuits: Introduction 

[2] D. R. Cunningham and S. A. Stuller, Basic Circuit Analysis, Jaico, 2005 

[3] W. H. Hayt, J. E. Kemmerly and S. M. Durbin, Engineering Circuit Analysis, 

6 th ed., Tata McGraw-Hill, New Delhi, 2006 

CMP2103: Objected Oriented Programming 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

In the object-oriented view of software, programs are considered to be collections of 

objects that interact by sending messages to one another and reacting to the answers to 

those messages. These ideas are at the forefront of modern software development. This 

course is designed to teach the fundamental ideas behind the object-oriented approach 

to programming; through the widely used Java programming language. The course 

concentrates on those aspects of the Java language that best demonstrate objectoriented 

principles and good practice. CMP2104 will give the student a solid basis for 

further study of the Java language and object-oriented software development. 



Objectives 

To build the students' skills geared towards professional Object Design and 

Programming with Java 

To introduce the students to how Object-Orientation works and how to best apply it in 

Java 

To develop the students' mastery in the areas of Inheritance, Encapsulation, Abstraction 

& Polymorphism in Java 

To provide students with extensive hands-on experience with Java programming 

To impart Exception Handling techniques mechanism 

To familiarize the students with the methods for manipulation of Java Object Collections 


3. History and Overview of Objected-Oriented-Programming 

Definition, Concept of Object-Orientedness 

History and Evolution of Objected-Oriented-Programming 

Object-Oriented-Programming Languages(Classification, Examples) 

Key Principles of an Object-Oriented-Programming Language 

Comparative Analysis of popular Object-Oriented-Programming Languages 

(Java, C++ and C#) 

4. Platforms for Object-Oriented-Programming 

The concept of a Computing Platform 

Java Platforms (Smart Card Edition, Standard Edition, Micro-Edition, 

Enterprise Edition) 

Open Source Platforms (PHP, Python) 

.NET Platform 

5. Fundamental Programming Structures in Java 

Primitive Data Types 

Variables 

Constants 

Assignments 

Initializations 

Operators 

Strings 

Control Flow 

6. Classes and Objects in Java 

Classes & Objects 

Object Oriented Programming Principles(Instantiation, Encapsulation, 

Specialization) 

Instance Variables 

Class Variables 

Constructors 

Instance Methods 

Class Methods 

Method Overloading 

The this keyword 

Passing and returning objects 

Garbage Collection in Java 

7. Object Design and Programming with Java 

Abstraction 



Inheritance 

Polymorphism 

Method Overriding 

Associations 

Delegation 

8. Java Interfaces 

Creating high levels of abstraction 

Purpose of Interfaces 

When to use them 

Interface Declaration 

Implementing an Interface 

Interface Inheritance 

9. Java Exception Handling 

Why Exceptions 

Standard Exception Handling Options 

Exception Class Hierarchy 

Checked vs. Unchecked Exceptions 

Catching an Exception: try and catch blocks 

Methods Which Throw Exceptions: the throws clause 

Handling vs. Declaring Exceptions 

System Exceptions vs. Application Exceptions 

Writing Custom Exceptions 

10. Java Collections API 

Arrays 

The Java Collections Framework 

Collections Interfaces 

Concrete Collections 

Iterating through Collections 

11. Java Input/Output API 

Streams & Files 

Input & Output Streams 

File Streams 

Object Streams 

Object Serialization 

Readers & Writers 


Knowledge and Understanding Upon successful completion of the module, a 

student will: Understand basic principles of object-oriented program design. 

Understand the basic and some advanced issues related to writing classes and 

methods - such as data, visibility, scope, method parameters, object references, 

and nested classes. Understand the basic ideas behind class hierarchies, 

polymorphism, and programming to interfaces. Get exposure to exceptions and 

basic I/O streams. Understand basic principles, main features and operations of 

abstract data types, in particular of lists, stacks, queues, trees, heaps, hash tables 

and graphs. Differentiate specifications of abstract data types from particular 

implementation techniques. Learn about fundamental algorithms associated with 

the above data types, including tree traversal, treesort, heapsort and graph 

traversal algorithms. 



Intellectual and Practical skills Upon successful completion of the module, a 

student will: Be able to solve a given application problem by going through the 

basic steps of program specifications, analysis, design, implementation and 

testing --- within the context of the object-oriented paradigm. Be able to 

competently read 'foreign' Java source code and object diagrams. Have 

developed solid Java programming skills and the ability to put in practice the 

acquired knowledge and understanding of the Java language and object-oriented 

design in relatively simple case studies. Be able to develop Java implementations 

of abstract data types using different approaches, and evaluate their differences. 

Be able to use abstract data types and related implementations in designing and 

implementing efficient solutions to straightforward application problems. 


[1] Timothy Budd, Understanding Object-Oriented Programming with Java, 2nd 

Edition Addison-Wesley Longman, 1999, ISBN: 0-201-61273-9, 

[2] Y. Daniel Liang, Introduction to Programming with C++, Prentice Hall, 2007 

[3] Schach Stephen, Object-Oriented and Classical Software Engineering, 7 th Edition, 

2006, McGraw-Hill. ISBN 0-073-19126-4. 

[4] Bruce E. Wampler, The Essence of Object-Oriented Programming, Addison-Wesley, 

2001. 

CMP2201: Discrete Mathematics and Random Processes 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 15 60 100 40 100 4 

Rationale 

The area is discrete mathematics is foundational material for computer engineering. 

The material is pervasive in the areas of data structures and algorithms. 


1. History and Overview of Discrete Mathematics 

Knowledge themes include sets, logic, functions, and graphs 

Contributors to the subject 

Purpose and role of discrete structures in computer engineering 

Contrasts between discrete-time models vs. continuous-time models 

2. Functions, Relations, and Sets 

Functions (one-to-one, onto, inverses, composition) 

 

 

 

 

3. Basic Logic 

Propositional logic 

Logical connectives 

Truth tables 

Use of logic to illustrate connectives 

Normal forms (conjunctive and disjunctive) 

Predicate logic 

Relations (reflexivity, symmetry, transitivity, equivalence relations) 

Discrete versus continuous functions and relations 

Sets (Venn diagrams, complements, Cartesian products, power sets) 

Cardinality and countability 



Universal and existential quantification 

Limitations of predicate logic 

Boolean algebra 

4. Applications of logic to computer engineering Proof Techniques 

Notions of implication, converse, inverse, negation, and contradiction 

The structure of formal proofs 

Direct proofs 

Proof by counterexample, contraposition, and contradiction 

Mathematical induction and strong induction 

5. Basics of Counting 

Permutations and combinations 

Counting arguments rule of products, rule of sums 

The pigeonhole principle 

Generating functions 

Applications to computer engineering 

6. Graphs and Trees 

Trees 

Undirected graphs 

Directed graphs 

Spanning trees 

Shortest path 

Euler and Hamiltonian cycles 

Traversal strategies 

7. Recursion 

Recursive mathematical definitions 

Developing recursive equations 

Solving recursive equations 

Applications of recursion to computer engineering 

8. Probability Basic 

Introduction: Basic concepts Random experiments & events 

Elementary Theorems 

Probabilistic Modelling 

Independence 

Transformations 

Moments 

Reliability and failure rates 

Transforms of PDF 

Tail inequalities 

A vector Random variable 

Joint CDF & Joint PDF Conditional Probabilities & Densities 

Expectation, Covariance & correlation coefficient 

Joint distributions. 

9. Estimation Theory 

Definitions: Estimators, Point-Estimators, Interval Estimators 

Properties of Point Estimators 



Types of Estimation: Estimation of a Distribution’s Unknown Parameter; 

Estimating the value of an inaccessible variable in terms of an accessible 

variable 

Maximum Likelihood Estimator 

Bayesian Estimator 

Mean Square Linear Estimator: Univariate Linear Regression; Orthogonality; 

Basic extension to Multivariate Linear Regression 

10. Random Processes 

Definition of a random process, qualitative discussion of examples of random 

processes: Poisson process 

Markov process, Brownian motion process 

Digital modulation using phase-shift keying 

Stationary and Ergodic processes 

Power spectral density (PSD): Properties of PSD, PSD applied to base band 

signals; PSD of white noise process 

Gaussian random processes and their application in communication theory. 


[1] Edgar.G. Goodaire, Michael M. Parmenter. Discrete Mathematics with Graph 

Theory, 3 rd Edition. 

[2] Hwei Hsu. Probability, Random Variables & Random Processes. Schaum’s 

Outlines. ISBN 0-07-030644-3 

[3] Yannis Viniotis. Probability & Random Processes for Electrical 

Engineers,McGraw Hill. 

[4] Papoulis. Probability, Random Variables & Stochastic Processes, 3 rd Edition., 

McGraw Hill. 

[5] Jorge I Aunon, V. Chandrasekar: Introduction to Probability & Random 

Processes, McGraw Hill 

[6] Venkatarama Krishnan, 2006. Probability and Random Processes (Wiley 

Survival Guides in Engineering and Science), Wiley-Interscience; 1 Edition. 

ISBN-10: 0471703540, ISBN-13: 978-0471703549 

[7] Donald G. Childers, 1997. Probability and Random Processes: Using Matlab 

with Applications to Continuous and Discrete Time Systems. Richard D Irwin. 

ISBN-10: 0256133611, ISBN-13: 978-0256133615 

[8] Leon Garcia, 1993. Probability and Random Processes for Electrical 

Engineering. Addison Wesley Publishing Company; 2 Sol Edition. ISBN-10: 

020155738X, ISBN-13: 978-0201557381 

[9] Roy D. Yates, David J. Goodman, 2004. Probability and Stochastic Processes: 

A Friendly Introduction for Electrical and Computer Engineers. Wiley; 2 

Edition. ISBN-10: 0471272140, ISBN-13: 978-0471272144 

[10] Seymour Lipschutz, Marc Lipson, 2007. Schaum's Outline of Discrete 

Mathematics, 3rd Ed. (Schaum's Outlines). McGraw-Hill; 3 Edition. ISBN-10: 

0071470387 . ISBN-13: 978-0071470384 

[11] Seymour Lipschutz, 1991. 2000 Solved Problems in Discrete Mathematics. 

McGraw-Hill; 1 Edition. ISBN-10: 0070380317. ISBN-13: 978-0070380318 

[12] Kenneth Rosen, 2006. Student's Solutions Guide to accompany Discrete Mathematics 

and Its Applications. McGraw-Hill Science/Engineering/Math; 6 Edition. ISBN-10: 

0073107794. ISBN-13: 978-0073107790 



CMP2202: Analysis and Design of Algorithms 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 00 45 100 40 100 3 

Rationale 

Algorithms are fundamental to computer engineering. The real-world performance of 

any software or hardware system depends on two things: (1) the algorithms chosen, 

and (2) the suitability and efficiency of the implementation. Good algorithm design is, 

therefore, crucial for the performance of all systems. Moreover, the study of algorithms 

provides insight into the intrinsic nature of the problem as well as possible solution 

techniques independent of programming language, computer hardware, or any other 

implementation aspect. 

Objectives 

Explain the role and purpose of algorithms in Computer Engineering 

Indicate how algorithms are part of many different computer applications 

Provide some knowledge themes such as relating complexity with algorithms 



Indicate some reasons for studying analysis, complexity, and algorithmic 

strategies 

Highlight some people that contributed or influenced the area of algorithms 

Mention some basic algorithms and some reasons for their differences 

Highlight how the use of theory influences algorithms 

Indicate how algorithms are part of many different computer applications 

Provide some knowledge themes such as relating complexity with algorithms 

Contrast complexities of different algorithmic strategies 

Explore some additional resources associated with algorithms 

Explain the purpose and role of algorithms in computer engineering 

2. Basic Algorithmic Analysis 

Asymptotic analysis of upper and average complexity bounds 

Identifying differences among best, average, and worst case behaviors 

Big “O,” little “o,” omega, and theta notation 

Empirical measurements of performance 

Time and space tradeoffs in algorithms Using recurrence relations to analyze 

recursive algorithms 

3. Algorithmic Strategies 

Brute-force/exhaustive search algorithms 

Greedy algorithms ; Divide-and-conquer 

At least one of: Backtracking, branch-and-bound, heuristics 

4. Computing algorithms 

Simple numerical algorithms 

Sequential and binary search algorithms 

Sorting algorithms 

Hash tables, including collision-avoidance strategies 



Binary search trees 

Representations of graphs (adjacency list, adjacency matrix) 

Depth- and breadth-first traversals 

Shortest-path algorithms (Dijkstra’s and Floyd’s algorithms) 

Transitive closure (Floyd’s algorithm) 

Minimum spanning tree (Prim’s and Kruskal’s algorithms) 

Topological sort 

5. Distributed algorithms 

Concurrency 

Scheduling 

Fault tolerance 

6. Algorithmic complexity 

Tractable and intractable problems 

Definition of the classes P and NP NP-completeness (Cook’s theorem) 

Standard NP-complete problems 

Uncomputable functions 

The halting problem 

Implications of uncomputability 

Deterministic ;finite Automata (DFA) 

Non-deterministic finite Automata (NFA) 

Equivalence of DFA’s and NFA’s 

Context-free grammars 

Pushdown automata (PDA) 


Design algorithms using the brute-force, greedy, and divide-and-conquer 

strategies. 

Design an algorithm using at least one other algorithmic strategy from the list of 

topics for this unit. 

Use and implement the fundamental abstract data types—specifically including 

hash tables, binary search trees, and graphs—necessary to solve algorithmic 

problems efficiently. 

Solve problems using efficient sorting algorithms, and fundamental graph 

algorithms, including depth-first and breadth-first search, single-source and allpairs 

shortest paths, transitive closure, topological sort, and at least one 

minimum spanning tree algorithm. 

Demonstrate the following abilities: to evaluate algorithms, to select from a 

range of possible options, to provide justification for that selection, and to 

implement the algorithm in simple programming contexts. 


[1] Michael T. Goodrich, Roberto Tamassio, David Mount, 1995. Data Structures 

and Algorithms in C++, John Wiley, ISBN 0-471-20208-8 

[2] Robert Secidgewick, 2001. Algorithms in C++, Addison – Wesley, ISBN 

0201510596 

[3] Nell Dale, 2003. C++ Data Structures, Jones and Bartlett Publishers 

[4] Thomas H. Cormen,Clara Lee, Erica Lin, 2002. Introduction to Algorithms, 

Second Edition, The MIT Press 

[5] Dasgupta, C. H. Papadimitriou, and U. V. Vazirani, Algorithms 



CMP2203: Digital Logic 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Digital Logic is the foundation of computer engineering. The logic design area covers 

the digital building blocks, tools, and techniques in the design of computers and other 

digital systems. This course is designed to introduce students to switching theory, 

combinational and sequential logic circuits, and memory elements. 

Objectives 

Explain the purpose and role of digital logic in computer engineering. 

Emphasize digital logic design as one of the topic areas that differentiate 

computer engineers from electrical engineers and computer scientists. 

Course Outline 



influential persons 

important topics such as logic circuits, switching, memory, registers, and 

digital systems; importance of Boolean algebra 

meaning and importance of sequential logic 

contrast the meaning of gates, circuits, combinational circuits, and modules 

2. Switching Theory 

Number systems and codes; Binary Arithmetic; Boolean and switching algebra 

Representation and manipulation of switching functions 

Minimization of switching functions 

Incompletely specified switching functions 

3. Combinational Logic Circuits 

Basic logic gates (AND,OR,NOT,NAND,NOR,XOR) 

Realization of switching functions with networks of logic gates 

2-level networks: AND-OR,OR-AND,NAND-NAND,NOR-NOR 

Multi-level networks 

properties of logic gates (technology, fan-in, fan-out, propagation delay) 

Elimination of timing hazards/glitches 

4. Modular Design of Combinational Circuits 

Design of medium scale combinational logic modules 

Multiplexers, demultiplexers, decoders, encoders, comparators 

Arithmetic functions (adders, subtracters, carry lookahead) 

Multipliers, dividers; Arithmetic and logic units (ALUs) 

Hierarchical design of combinational circuits using logic modules 

5. Memory Elements 

Unclocked and clocked memory devices (latches, flip flops); Level vs. edgesensitive, 

and master-slave devices ; Basic flip flops (SR, D, JK, T); 

Asynchronous flip flop inputs (preset, clear); Timing constraints (setup time, 



hold time) and propagation delays Data registers (selection, clocking, 

timing); Random-access memory (RAM) 

6. Sequential Logic Circuits 

Finite state machines (FSMs), clocked and unclocked; Mealy vs. Moore 

models of FSMs; Modeling FSM behavior: State diagrams and state tables, 

timing diagrams, algorithmic state machine charts 

Analysis of synchronous and asynchronous circuits 

Design of synchronous sequential circuits: State minimization, state 

assignment, next state and output equation realization 

Sequential functional units: Data registers, shift registers, counters, sequence 

detectors, synchronizers, debouncers, controllers 

7. Digital Systems Design 

Hierarchical, modular design of digital systems 

Synthesis of digital circuits from HDL models 

Design principles and techniques: Bridging conceptual levels – top 

down/bottom up, divide and conquer, iteration, satisfying a behavior with a 

digital structure 

Functional units, building blocks and LSI components: Adder, shifter, 

register, ALU, and control circuits, tri-state devices and buses 

Control concepts: Register transfer notation, major control state, sequences of 

micro-operations, conditional execution of micro-operations 

Timing concepts: System timing dependencies, sequencing, clock generation, 

distribution, and skew 

Programmable logic devices (PLDs) and field-programmable gate arrays 

(FPGAs), PLAs, ROMs, PALs, complex PLDs 

8. Modeling and Simulation 

Schematic capture 

Hierarchical schematic modeling for complex systems 

Digital system modeling with hardware description languages (VHDL, 

Verilog) 

Other modeling techniques (timing diagrams, register transfer languages, state 

diagrams, algorithmic state machines) 

Functional simulation of combinational and sequential circuits 

Timing models of digital circuit elements: Propagation delay, rise/fall time, 

setup and hold times, pulse widths 

Timing simulation to measure delays and study signals subject to timing 

constraints 

9. Formal Verification 

Relationship of good design practice to formal verification 

Comparison and contrast of formal verification, validation, testing, and 

reliability 

Verification by model checking ; Verification by proofs ; Verification by 

equivalence checking ; Verification by simulation and test-benches ; 

Verification by assertions and verification languages ;Verification by testing ; 

Economics of verification 

Other verification: signal integrity, specification, reliability, safety, power, 

cooling 

10. Faults Models and Testing 



Logical (stuck-at) faults (single and multiple) 

Other fault models (bridging, opens, delay faults) ; Yield and defect levels ; 

Test coverage ; Fault equivalence and dominance ; Fault simulation and fault 

grading 

Test generation algorithms such as the D-algorithm and PODEM 

Automatic Test Pattern Generation (ATPG): Pseudorandom techniques, 

deterministic test pattern generation 

Test generation algorithms for sequential circuits ; Memory testing ; PLA 

testing 

11. Design for Testability 

Testability measures (controllability, observability) 

Scan and partial scan design 

BIST and other design for testability techniques 

Boundary scan and the IEEE 1149.1 testability standard ; Ad-hoc methods 


Describe how computer engineering uses or benefits from digital logic. 

Work with binary number systems and arithmetic. 

Derive and manipulate switching functions that form the basis of digital circuits. 

Explain and apply fundamental characteristics of relevant electronic technologies, 

such as propagation delay, fan-in, fan-out, and power dissipation and noise 

margin. 

Analyze and design combinational logic networks in a hierarchical, modular 

approach, using standard and custom logic functions. 

Analyze circuits containing basic memory elements. 

Analyze the behavior of synchronous and asynchronous machines. 

Apply digital system design principles and descriptive techniques 


[1] Stephen Brown, Zvonko Vranesic, 2004. Fundamentals of Digital Logic with 

VHDL Design, McGraw-Hill Professional. ISBN 0072499389, 

9780072499384 

[2] Douglas A. Pucknell, 1990. Fundamentals of Digital Logic Design with VLSI 

Circuit Applications, Prentice-Hall 

[3] Ronald J. Tocci, 1995. Digital Systems: Principles & Applications, 6th ed., 

Prentice Hall. 

CMP2204: Operating System Technologies 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 40 100 4 

Rationale 

An operating system defines a software interface of the computer hardware and the 

architecture with which computer engineers can control and exploit the hardware to 

provide maximum benefit to the user. It also manages sharing of resources (hardware 

and software) among the computer’s users (user programs and systems programs). 

Many of the ideas involved in operating system use have wider applicability across the 



field of computer engineering such as concurrent programming. 

Objectives 

Student should understand the basic principles and the purposes of an operating 

system prior to a study of digital instrumentation and embedded systems. 

To addresses both the use of operating systems (externals) and their design and 

implementation (internals). 



Indicate some reasons for studying operating systems 

Highlight some people that influenced or contributed to the area of operating 

systems ; Indicate some important topic areas such as function and design, 

concurrency, scheduling, dispatch, memory management, device management, 

file systems, security, and protection ; Describe the purpose of an operating 

system 

Indicate the meaning of an interrupt 

Describe the meaning of concurrency and the reasons for its importance 

Illustrate the manner in which scheduling and dispatch take place in a 

computer through its operating system 

Describe the manner and importance of memory management 

Describe the manner and importance of device management 

Explore some additional resources associated with operating systems 

Explain the purpose and role of operating systems in computer engineering 

2. Design Principles 

Functionality of a typical operating system 

Mechanisms to support client-server models, hand-held devices 

Design issues (efficiency, robustness, flexibility, portability, security, 

compatibility) 

Influences of security, networking, multimedia, windows 

Structuring methods (monolithic, layered, modular, micro-kernel models) 

Abstractions, processes, and resources ; 

Concepts of application program interfaces (APIs) specific to operating 

systems 

Applications needs and the evolution of hardware/software techniques; 

Device organization; Interrupts: methods and implementations 

Concept of user/system state and protection, transition to kernel mode 

3. Concurrency 

States and state diagrams 

Structures (ready list, process control blocks, and so forth) 

Dispatching and context switching ; The role of interrupts 

Concurrent execution: advantages and disadvantages 

The “mutual exclusion” problem and some solutions 

Deadlock: causes, conditions, prevention 

Models and mechanisms (semaphores, monitors, condition variables, 

rendezvous) 

Producer-consumer problems and synchronization 

Multiprocessor issues (spin-locks, reentrancy) 

4. Scheduling And Dispatch 

Preemptive and non-preemptive scheduling 



Schedulers and policies 

Processes and threads 

Deadlines and real-time issues 

5. Memory Management 

Review of physical memory and memory management hardware 

Overlays, swapping, and partitions 

Paging and segmentation 

Placement and replacement policies 

Working sets and thrashing 

Caching 

6. Device Management 

Characteristics of serial and parallel devices 

Abstracting device differences 

Buffering strategies 

Direct memory access 

Recovery from failures 

7. Security and Protection 

Overview of system security 

Policy/mechanism separation 

Security methods and devices 

Protection, access, and authentication 

Models of protection 

Memory protection 

Encryption Recovery management 

8. File Systems 

Files: data, metadata, operations, organization, buffering, sequential, nonsequential 

Directories: contents and structure 

File systems: partitioning, mount/unmount, and virtual file systems 

Standard implementation techniques 

Memory-mapped files 

Special-purpose file systems 

Naming, searching, access, backups 

9. System Performance Evaluation 

Why and what system performance needs to be evaluated 

Policies for caching, paging, scheduling, memory management, security, and 

so forth 

Evaluation models: deterministic, analytic, simulation, or implementationspecific 

How to collect evaluation data (profiling and tracing mechanisms) 


Identify some contributors to operating systems and relate their achievements to 

the knowledge area; provide some reasons for a computer to have an operating 

system; describe concurrency and reasons for its importance; describe scheduling 

and illustrate how it works to improve computer performance; sketch an example 

of how and why a compute would need to manage memory; identify some 

devices an operating system would manage; and describe how computer 

engineering uses or benefits from operating systems. 



 

 

 

 

 

 

 

Demonstrate understanding of Operating Systems as an interface between user 

programs and the computer hardware; demonstrate understanding of the logical 

layers and the benefits of building these layers in a hierarchical fashion; relate 

system state to user protection; explain the range of requirements that a modern 

operating system has to address; define the functionality that a modern operating 

system must deliver to meet a particular need; and articulate design tradeoffs 

inherent in operating system design. 

Justify the presence of concurrency within the framework of an operating system; 

demonstrate the potential run-time problems arising from the concurrent 

operation of many (possibly a dynamic number of) tasks; summarize the range of 

mechanisms (at an operating system level) that are useful to realize concurrent 

systems and be able to describe the benefits of each; explain the different states 

that a task may pass through and the data structures needed to support the 

management of many tasks. 

Compare and contrast the common algorithms used for both preemptive and 

non-preemptive scheduling of tasks in operating systems; describe relationships 

between scheduling algorithms and application domains; and investigate the 

wider applicability of scheduling in such contexts as disk I/O, networking 

scheduling, and project scheduling. 

Introduce memory hierarchy and cost-performance tradeoffs; explain virtual 

memory and its realization in hardware and software; examine the wider 

applicability and relevance of the concepts of virtual entity and of caching; 

evaluate the trade-offs in terms of memory size (main memory, cache memory, 

auxiliary memory) and processor speed; and defend the different ways of 

allocating memory to tasks based on the relative merits of each. 

Identify the relationship between the physical hardware and the virtual devices 

maintained by the operating system; differentiate the mechanisms used in 

interfacing a range of devices (including hand-held devices, networks, 

multimedia) to a computer and explain the implications of these for the design of 

an operating system; and implement a simple device driver for a range of possible 

devices. 

Defend the need for protection and security, and the role of ethical 

considerations in computer use; summarize the features of an operating system 

used to provide protection and security, and describe the limitations of each of 

these; and compare and contrast current methods for implementing security. 

Summarize the full range of considerations that support file systems; compare 

and contrast different approaches to file organization, recognizing the strengths 

and weaknesses of each. 

Describe the performance metrics used to determine how a system performs; 

explain the main evaluation models used to evaluate a system. 


[1] David Groth, Dan Newland, 2001. A+ Operating System Technologies Study Guide. 

Published by John Wiley & Sons Australia, Limited, 2001. ISBN 0782128076, 

9780782128079 

[2] Charles J. Brooks, 2004. A+ Certification Operating System Technologies. Prentice 

Hall, ISBN 0131147730, 9780131147737 

[3] Andrew S. Tanenbaum, 2007. Modern Operating Systems (3rd Edition) (GOAL 

Series). Prentice Hall; 3 Edition ISBN-10: 0136006639, ISBN-13: 978-0136006633 



CMP2205: Computer Networks 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 40 100 4 

Rationale 

The number of computer networks is increasing dramatically. From small offices to 

entire countries, computer networks have become the heart of electronic 

communication today. Using established protocols, these local and wide area networks 

have become the conduit for servers and clients. Of interest today is data integrity and 

security as well as the “right” to the information communicated. 

Objectives 



Indicate some reasons for studying networks 

Highlight some people that influenced or contributed to the area of networks 

Indicate some important topic areas such as network architectures and 

protocols, network types (LAN, WAN, MAN, and wireless), data security, 

data integrity, and network performance; Describe some of the hardware and 

software components of networks 

Describe the operation of some network devices such as repeaters, bridges, 

switches, routers, and gateways 

Indicate some network topologies such as mesh, star, tree, bus, and ring 

Describe the purpose of network protocols ; Mention some popular protocols 

Explore some additional resources associated with networks 

Explain the purpose and role of networks in computer engineering 

2. Communications Network Architecture 

Network line configuration (point-to-point, multipoint) 

Networking and internetworking devices: Repeaters, bridges, switches, 

routers, gateways 

Network Topologies (mesh, star, tree, bus, ring) 

Connection-oriented and connectionless services 

3. Communications Network Protocols 

Network protocol (syntax, semantics, timing) 

Protocol suites (TCP/IP) 

Layered protocol software (stacks): Physical layer networking concepts 

Data link layer concepts 

Internetworking and routing 

Network Standards and standardization bodies 

4. Local and Wide Area Networks 

LAN topologies (bus, ring, star) 

LAN technologies (Ethernet, token Ring, Gigabit Ethernet) 

Error detection and correction 

Carrier sense multiple access networks (CSMA) 

Large networks and wide areas 



Circuit switching and packet switching 

Protocols (addressing, congestion control, virtual circuits, quality of service) 

5. Client-Server Computing 

Web technologies: Server-side programs 

Common gateway interface (CGI) programs 

Client-side scripts 

The applet concept 

Characteristics of web servers: Handling permissions 

File management 

Capabilities of common server architectures 

Support tools for web site creation and web management 

6. Data Security and Integrity 

Fundamentals of secure networks 

Cryptography 

Encryption and privacy: Public key, private key, symmetric key 

Authentication protocols 

Packet filtering 

Firewalls 

Virtual private networks 

Transport layer security 

7. Wireless and Mobile Computing 

Overview of the history, evolution, and compatibility of wireless standards 

The special problems of wireless and mobile computing 

Wireless local area networks and satellite-based networks 

Mobile Internet protocol 

Mobile aware adaptation 

Extending the client-server model to accommodate mobility 

Mobile data access: server data dissemination and client cache management 

The software packages to support mobile and wireless computing 

The role of middleware and support tools 

Performance issues 

Emerging technologies 

8. Performance Evaluation 

Privacy and public networks 

Virtual private networks 

Service paradigms: connection-oriented service 

Connectionless service 

Network performance characteristics: delay, throughput 

9. Data Communications 

Encoding and modulating: A/D and D/A conversion 

Interfaces and modems 

Transmission media 

Multiplexing 

Error detection and correction 

10. Network Management 

Overview of the issues of network management 

Use of passwords and access control mechanisms 



Domain names and name services 

Issues for Internet service providers (ISPs) 

Security issues and firewalls 

Quality of service issues: performance, failure recovery 

11. Compression and Decompression 

Analog and digital representations 

Encoding and decoding algorithms 

Lossless and lossy compression 

Data compression: Huffman coding and the Ziv-Lempel algorithm 

Audio compression and decompression 

Image compression and decompression 

Video compression and decompression 

Performance issues: timing, compression factor, suitability for real-time use 


Identify some contributors to networks and relate their achievements to the 

knowledge area; identify some components of a network; name some network 

devices and describe their purpose; describe advantages of a star topology over a 

ring topology; describe advantages of a ring topology over a star topology; 

define the meaning of a protocol; explain the importance of security when 

dealing with networks; and describe how computer engineering uses or benefits 

from networks. 

Understand fundamental concepts of networks and their topologies; and 

understand the concept of network architecture and its hardware components. 

Demonstrate understanding of the elements of a protocol, and the concept of 

layering; recognize the importance of networking standards, and their regulatory 

committees; describe the seven layers of the OSI model; compare and contrast 

the OSI model with the TCP/IP model; and demonstrate understanding of the 

differences between circuit switching and packet switching. 

Understand the basic concepts of LAN and WAN technologies and topologies; 

demonstrate understanding of different components and requirements of network 

protocols; demonstrate understanding of basic concepts of error detection and 

correction at the data link layer and below; and design and build a simple 

network by implementing (and designing) a simple network protocol that 

operates at the physical and data link layers of the OSI model. 

Explain the different roles and responsibilities of clients and servers for a range 

of possible applications; select a range of tools that will ensure an efficient 

approach to implementing various client-server possibilities; and design and build 

a simple interactive web-based application (e.g., a simple web form that collects 

information from the client and stores it in a file on the server). 

Understand common barriers to network security and the major issues involved 

in implementing proper security measures; describe the purpose of encryption 

and the function of public and private keys; compare and contrast the various 

types of firewalls; generate and distribute a PGP key pair and use the PGP 

package to send an encrypted e-mail message; and explain the concept of and 

necessity for transport layer security. 

Describe the main characteristics of mobile IP and explain how differs from IP 

with regard to mobility management and location management as well as 

performance; illustrate (with home agents and foreign agents) how e-mail and 

other traffic is routed using mobile IP; be aware of the many areas of interest that 



lie within this area, including networking, multimedia, wireless, and mobile 

computing, and distributed computing. 

Define performance metric; and describe how each affects a particular network 

and/or service paradigm. 

Demonstrate understanding of the fundamental concepts of data 

communications; understand signals and signal encoding methods to 

communication service methods and data transmission modes. 

Explain the issues for network management arising from a range of security 

threats, including viruses, worms, Trojan horses, and denial-of-service attack; 

summarize the strengths and weaknesses associated with different approaches to 

security; develop a strategy for ensuring appropriate levels of security in a system 

designed for a particular purpose; and implement a network firewall. 

Summarize the basic characteristics of sampling and quantization for digital 

representation. 

Select, giving reasons that are sensitive to the specific application and particular 

circumstances, the most appropriate compression techniques for text, audio, 

image, and video information; explain the asymmetric property of compression 

and decompression algorithms; illustrate the concept of run-length encoding; and 

illustrate how a program like the UNIX compress utility, which uses Huffman 

coding and the Ziv-Lempel algorithm, would compress a typical text file. 


[1] Andrew S. Tanenbaum1996. Computer Networks. Prentice Hall; 3rd Edition. 

ISBN-10: 0133499456, ISBN-13: 978-0133499452 

[2] James F. Kurose and Keith W, 2007.Computer Networking: A Top-Down. 

Addison Wesley; 4 Edition. ISBN-10: 0321497708, ISBN-13: 978- 

0321497703 

[3] Natalia Olifer and Victor Olifer, 2006. Computer Networks: Principles, 

Technologies and Protocols for Network Design. Wiley. ISBN-10: 

0470869828, ISBN-13: 978-0470869826 

[4] Douglas E. Comer, 2003. Computer Networks and Internets with Internet 

Applications. 4th Edition. Prentice Hall. ISBN-10: 0131433512, ISBN-13: 

978-0131433519 

[5] Larry L. Peterson, Bruce S. Davie, 2007.Computer Networks: A Systems 

Approach, Fourth Edition (The Morgan Kaufmann Series in Networking). 

Morgan Kaufmann; 4 Edition. ISBN-10: 0123705487, ISBN-13: 978- 

0123705488 

[6] Nader F. Mir, 2006. Computer and Communication Networks. Prentice Hall 

PTR; 1 Edition . ISBN-10: 0131747991, ISBN-13: 978-0131747999 

CMP2301: Industrial Training I 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Report 

Mark 

Weighted Field 

Assessment 

Mark 

Credit 

Units 


00 300 00 30 100 60 40 2 

Rationale 

This shall be carried out in a firm doing Computer Engineering or Related Work. This 

training goes on for ten weeks during which the student is supervised by a member of 

the teaching staff of the department. The student prepares a report discussing the 



training environment, lessons learnt, challenges faced and recommendations. This 

report has to be approved by both the training officer at the training firm and the 

student’s supervisor and should be handed in to the said concerned parties before the 

beginning of the academic year. 

Objectives 

By undertaking the Industrial Training programme, the student will be able to: 

Communicate effectively with fellow workers and supervisors in issues related to 

projects undertaken. 

Demonstrate and practice good working ethics and to internalize excellence. 

 

 

 

 

 

Attest and practice high-quality organizational skills in enhancing individual and 

group effectiveness and productivity. 

Demonstrate creativity and innovation in solving problems related to real-life 

projects. 

Exhibit pleasant interpersonal skills in developing understanding and appreciation 

of individual differences and interpersonal skills in building self-confidence. 

Work independently or under very minimal supervision. 

Demonstrate good planning, good management, constant monitoring and quality 

delivery of project undertaken. 

ELE3102: Electromagnetic Fields 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

This course introduces students to the Basic laws electromagnetic fields and 

elementary applications of vector analysis, steady-state electric and magnetic fields, 

boundary value problems, and transmission lines. 

Objectives 

 

 

To develop an understanding of electromagnetic-field fundamentals by 

emphasizing both mathematical analytical rigor and physical conceptual 

reasoning, as applied toward practical engineering problems. 

To develop the ability to analyze engineering systems based on electrostatic 

fields, steady electric currents, and magneto static fields in arbitrary material 

media, 

To apply vector calculus to solutions of a variety of static field problems 

To develop a solid grasp and an appreciation of Maxwell’s equations and use 

these equations to solve time-varying field problems. 


1. Electromagnetic Potentials and Topics for Circuits and System 

Poisson’s and Laplace equations 

 

Capacitance, conductance and inductance 



Magnetic circuits 

2. Transmission-Lines Essentials 

Transmission lines 

Lines terminated by reactive and non-linear resistive elements 

3. Transmission Lines for Communications 

Different matching configurations 

Smith Chart 

Lossy Lines 

4. Guided Wave Principles for Electronics and Optoelectronics 

Wave propagation in any direction 

TE and TM waves in parallel plate waveguide 

 

Dispersion and group velocity 

Reflection and refraction 

Dielectric waveguide 

5. Waveguides and Antennas Fundamentals 

Rectangular Waveguides 

Transverse Electromagnetic Waves (TEM) 

 

 

 

 

Transverse Magnetic (TM) Modes 

Transverse Electric (TE) Modes 

Wave Propagation in the Guide 

Power Transmission and Attenuation 

Waveguide Current and Mode Excitation 

Waveguide Resonators 


By the end of this course, students should be able to: 

Demonstrate a firm understanding of electromagnetic fields 

Solve realistic electromagnetic-field problems utilizing physical conceptual 

reasoning and mathematical synthesis of solutions, and not pure formulaic 

solving. 


[1] K. Lonngren, S. Savov, & R. Jost, Fundamentals of Electromagnetics with 

MATLAB, 2 nd Edition (Scitech Publishing, 2007). 

[2] R. Wolfson & J. Pasachoff, Physics for Scientists and Engineers (Addison- 

Wesley). 

[3] J. Stewart, Calculus, Third Edition (Brooks/Cole Publishing Company, 1995). 

[4] N. N. Rao, “Elements of Engineering Electromagnetics,” 6th Edition, Prentice 

Hall, 2004. 

[5] Field and Waves in Communication Electronics, third edition, Ramo, 

Whinnery, and Van Duzer, Wiley, 1994 

[6] William H. Hayt, Jr. John A. Buck, 2000. Engineering Electromagnetics. 6 th 

Edition MC Graw Hill. 

[7] Mathew N.O. Sadiku, 2006. Elements of Electromagnetics, 4 th Edition. ISBN 

13: 9780195300482, ISBN 10:0195300483 



ELE3104: Applied Digital Electronics 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

This course is designed to introduce the fundamental concepts of digital electronics, 

with laboratories aimed at giving students the practical experience in design and 

measurement pertinent to digital circuits. 

Objectives 

To advance the theory of digital electronics to areas of application 

To expose students to the state-of-the-art technologies in digital electronics 

To articulate the advantages and limitation of digital electronics technologies 

with view of stimulating research interests 

Subject Content 

Unsigned Number Systems (Decimal, Binary, Octal, Hex and Base Conversion) 

Codes (BCD, Gray, ASCII and Parity) 

Basic Digital Logic Gates (AND / OR) and Truth Tables 

Boolean Algebra (Postulate and Theorems, Equation Reductions and Circuit 

Implementations) 

DeMorgan’s Theorems (NAND and NOR Gates and Implementation) 

Sum of Product Circuits 

Karnaugh Maps and Circuit Simplifications 

Multiplexers, Demultiplexers, Decoders and other Medium Scale Integration 

(MSI) Circuits 

Basic SR Flip-Flops (NAND & NOR Implementations and Limitations) 

D Latch, Clocked and Edge Triggered D Flip-Flops 

Edge Triggered JK Flip-Flop 

One Shot Multivibrators and 555 Type Timers 

Ripple Counter 

Sequential Logic (Synchronous Counters, Shift Registers, and Basic State 

Machine Concepts) 

Memory Systems (RAM, ROM, PROM, EPROM etc) 

Programmable Logic (an extension of the PROM - PAL, PLA, and other PLD 

devices. FPGAs) 



Represent numerical values in various number systems and perform number 

conversions between different number systems. 

Demonstrate the knowledge of: operation of logic gates (AND, OR, NAND, 

NOR, XOR, XNOR) using IEEE/ANSI standard symbols; Boolean algebra 



 

 

 

including algebraic manipulation/simplification, and application of DeMorgan’s 

theorems; Karnaugh map reduction method. 

Demonstrate the knowledge of operation of basic types of flip-flops, registers, 

counters, decoders, encoders, multiplexers, and de-multiplexers. 

Analyze and design digital combinational circuits including arithmetic circuits 

(half adder, full adder, multiplier). 

Analyze sequential digital circuits. 

Demonstrate knowledge of the nomenclature and technology in the area of 

memory devices: ROM, RAM, PROM, PLD, FPGAs, etc 


[1] Agarwal, Anant and Jeffrey H. Lang, Foundations of Analog and Digital 

Electronic Circuits, Morgan Kaufmann Publishers, Elsevier, July 2005. 

[2] Ronald J. Tocci and Neal S. Widmer, Digital Systems: Principles and 

Applications, Prentice Hall, India, 2004 

[4] Douglas A. Pucknell, Fundamentals of Digital Logic Design with VLSI Circuit 

Applications, Prentice-Hall, 1990 

[5] Ronald J. Tocci, Digital Systems: Principles & Applications, 6th ed., Prentice 

Hall, 1995. 

CMP3101: Database Systems 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

This Course is designed to address the needs of the student undertaking computer 

engineering in database systems. 

Objectives 

To introduce the student to the fundamental concepts of data models 

 

To expose the student to the methods and techniques appropriate for a given 

problem 

To introduce the student to the selection and implementation of appropriate 

database solutions that reflect all suitable constraints, including scalability and 

usability. 


1. History and Overview of Database Systems 

Indicate some reasons for studying database systems 

Highlight some people that influenced or contributed to the area of 

database systems 

Indicate some important topic areas such as information systems, database 

systems and, data modeling 

Contrast the meanings between data, information, and knowledge 



Describe a database system and its components 

Mention the use of database query languages 

Describe the meaning and purpose of a data model 

Explore some additional resources associated with database systems 

Explain the purpose and role of database systems in computer engineering 

2. Fundamentals of Database Systems 

Components of database systems; problem of the accuracy of information 

Database management system (DBMS) functions: the different possibilities 

and the role they play in a database system 

Database architectures: the possibilities, the concept of, the importance of 

and the reality of data independence 

Use of a database query language 

3. Data Modeling 

Data modeling: the role of this, the benefits it brings and the common 

approaches; conceptual data model, physical data model, and 

representational data model 

Basic concepts: to include key, foreign key, record, relation 

Conceptual models: possibilities, entity-relationship model and UML; 

strengths and weaknesses; notational issues 

Object-oriented model: the main concepts and object identity, type 

constructors, encapsulation, inheritance, polymorphism, and versioning; 

basic approaches 

Relational data model: basic terminology, basic approaches, strengths and 

weaknesses 

4. Relational Databases 

Concepts of conceptual schema and relational schema: uses, comparisons, 

mapping conceptual schema to relational schema 

Entity integrity constraint and referential integrity constraint; definitions, 

uses 

Relational algebra and relational calculus 

Relational algebra operations from mathematical set theory (union, 

intersection, difference, and Cartesian product) contrasted with the 

relational algebra operations developed specifically for relational databases 

(select, product, join, and division). 

5. Database Query Languages 

Overview of database languages 

Structured query language (SQL): fundamental concepts including data 

definition, query formulation, update sub-language, constraints, integrity 

Query processing strategies; query optimization 

Query by example and 4th-generation environments 

Embedding non-procedural queries in a procedural language 

Introduction to object query language 

6. Relational Database Design 

 

 

Database design 

The concept of functional dependency 



Normal forms: first, second, third and Boyce-Codd normal forms; 

motivation for each of these, applicability; mechanisms for producing these 

normal forms 

Multi-valued dependency: fourth normal form; join dependency; fifth 

normal form 

Representation theory 

7. Transaction Processing 

Transactions: the purpose and the nature of transactions; creating a 

transaction using SQL; characteristics of efficient transaction execution; 

concept of commit 

Failure and recovery: the differing possibilities, their strengths and 

weaknesses 

Concurrency control: the special problems introduced by concurrency; the 

solution to these problems; isolation levels and their effects 

8. Distributed Databases 

Advantages offered by the introduction of distribution: the problems 

introduced 

Distributed data storage: techniques used for data fragmentation, 

replication, and allocation during the distributed database design process 

Distributed query processing: strategies for executing distributed queries 

Distributed transaction model 

Concurrency control: the different approaches including those based on the 

distinguished copy techniques and the voting method 

Homogeneous and heterogeneous solutions 

The client-server approach 

9. Physical Database Design 

Storage requirements for a range of data including characters, numbers, 

strings, text, sound, video and file structure 

Characteristics of storage to support a range of databases including use of 

CDs, memory in machines of different kinds; nature of the storage systems 

involved and the factors influencing choice 

Records and record types; fixed length and variable length; storage 

organization 

Files of different kinds and file structures: sequential files, indexed files, 

hashed files; signature files; files with dense index 

B-trees; definition, use in particular in implementing dynamic multi-level 

indices 

Data compression: reasons for using this, compression algorithms, 

strengths and weaknesses of each approach; software support 

Database efficiency and tuning: performance measures, monitoring 

performance 



 

Identify some contributors to database systems and relate their achievements to 

the knowledge area, explain how knowledge differs from information and data, 

and describe how computer engineering uses or benefits from database systems 

and information management. 



 

 

 

 

 

 

 

 

Explain the characteristics that distinguish the database approach from the 

traditional approach of programming with data files, cite the basic goals, 

functions, models, components, applications, and social impact of data 

management systems, describe the components of a database system and give 

examples of their use and use a query language to elicit information from a 

database. 

Categorize data models based on the types of concepts that they provide to 

describe the database structure and compare and contrast the basic principles of 

the relational data model and those of the object-oriented model as they apply to 

computer engineering applications. 

Prepare a relational schema from a conceptual model developed using the entityrelationship 

model, explain and demonstrate the concepts of entity integrity 

constraint and referential integrity constraint and demonstrate the successful 

formulation of queries in the relational algebra and queries in the tuple relational 

calculus. 

Create a relational database schema in SQL that incorporates key, entity 

integrity, and referential integrity constraints; demonstrate data definition in SQL 

and retrieving information from a database using the SQL SELECT statement, 

evaluate a set of query processing strategies and select the optimal strategy, and 

demonstrate the ability to embed object-oriented queries into an appropriate 

stand-alone programming language 

Determine the functional dependency between two or more attributes that are a 

subset of a relation, demonstrate the ability to transform a relation into a 

prescribed normal form, explain the impact of normalization on the efficiency of 

database operations and query optimization and describe a multi-valued 

dependency and the type of constraints it specifies. 

Explain the purpose of rollback and the way logging assures that proper rollback 

takes place; outline the special problems arising from the use of concurrency and 

the effect of effect of different isolation levels on the concurrency control 

mechanisms, and demonstrate the ability to apply suitable ideas on failure and 

recovery to an application taken from computer engineering. 

Evaluate simple strategies for executing a distributed query to select the strategy 

that minimizes the amount of data transfer, Explain how to use the two-phase 

commit protocol to deal with committing a transaction that accesses databases 

stored on multiple nodes, and compare and contrast the different approaches to 

distributed concurrency control. 

Cite examples of the application of primary, secondary, and clustering indexes, 

explain the theory and application of internal and external hashing techniques and 

its use in facilitating dynamic file expansion, describe the relationships among 

hashing, compression, and efficient database searches and explain how physical 

database design affects database transaction efficiency. 




[1] Hector Garcia-Molina, Jeff Ullman, and Jennifer Widom, 2008. Database 

Systems: The Complete Book (DS:CB), 2 nd Edition , Prentice Hall, ISBN-10: 

0130319953, ISBN-13: 9780130319951 

[2] Jeffrey D. Ullman, Jennifer Widom, 2007. A First Course in Database Systems. 

Prentice Hall, ISBN 013600637X 

[3] Rebecca Riordan, 2005. Designing Effective Database Systems. Addison- 

Wesley ISBN 0321290933. 

[4] Thomas M. Connolly, and Carolyn E. Begg, 2004. Database Systems: A 

Practical Approach to Design, Implementation. Addison-Wesley, ISBN 

0321294017 

CMP3103: Computer Games Development 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Computer games provide a contemporary gaming and entertainment platform as well 

as stimulating the mind of the developer toward high level of creativity. It is therefore 

imperative for the computer engineering student to be abreast with the fundamentals of 

computer games development. Using a comprehensive and analytical approach to 

game engine architectures, this is course designed to offer students the opportunity to 

learn the effective implementation game ideas, algorithms and graphics. 

Objectives 

The objectives of the Computer Games Development course are to: 

 

 

 

 

 

Provide students with the core programming language skills necessary for game 

development. 

Provide students with a thorough understanding of the main concepts involved in 

real-time 3D graphics programming. 

Provide students with a fuller understanding of current and emerging digital 

entertainment systems technologies 

Facilitate students in the development of expertise and interest in topic areas of 

digital entertainment systems 

Provide students with an understanding of current digital entertainment systems 

research issues 

Further develop students’ analytical, creative, problem‐ solving and research 

skills 


1. C++ Programming for Game Developers 

Template Classes and Template Functions 

Error Handling 

 

Number Systems, Data Representations, and Bit Operations 



 

 

 

 

 

 

The Standard Template Library 

Introduction to Windows Programming 

Menus and Drawing with GDI 

Dialog Boxes 

Timing, Animation, and Sprites 

Designing and Implementing a 2D Game 

2. Graphics Programming with DirectX 

3D Mathematics 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

The Transformation and Lighting Pipeline 

Initializing Direct3D 

Vertex and Index Buffers 

Single and MultiTexture Effects 

Camera Management Systems 

Compressed Textures 

Texturing & the Texture Blending Cascade 

Alpha Blending 

Loading GILES Scenes 

The D3DX Mesh Containers 

Progressive Meshes 

Scene Hierarchies 

Keyframe Animation 

Indexed / Non-Indexed Vertex Blending 

Software and Hardware Skinning Techniques 

Skeletal Animation 

Tree Animation and Rendering 

X Files 

Motion Blending 

Collision Detection and Response 

Quadtrees, Octrees, and kD-Trees 

Binary Space Partitioning (BSP) Trees and Potential Visibility Sets (PVS) 



Implement a game algorithm using C++. 

 

 

 

Write a game script 

implement game graphics, animations and voicing using state-of-the-art tools 

and technologies 

demonstrate a firm understanding of current digital entertainment systems 

research issues 



Recommended and Reference Book 

[1] Michael Dawson, 2004. Beginning C++ Game Programming (Game 

Development Series. Course Technology PTR; 1 edition. ISBN-10: 

1592002056,ISBN-13: 978-1592002054 

[2] Frank D. Luna, 2003. Introduction to 3D Game Programming with DirectX 9 

(Wordware Game and Graphics Library. Wordware Publishing, Inc.; 400 

edition. ISBN-10: 155622913, ISBN-13: 978-1556229138 

CMP3104: Computer Based Medical Systems 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

This course aims to prepare life scientists and engineers for the electronic age in 

healthcare. It is expected to fill a major gap in healthcare management, namely the 

management of biomedical technologies and emerging e-health applications. Students 

will acquire the necessary skills to integrate biomedical, information and 

communication technologies in order to enhance the existing healthcare processes and 

conform to international standards. 

Objectives 

By covering the course in Computer Based Medical Systems, the student will be well 

versed with the fundamentals of: 

Procurement, calibration and management of biomedical technologies: 

compliance with ISO-9000 and JCI standards, establishment and management 

of clinical engineering units. 

 

Systems integration of biomedical, information and communication technologies 

for developing hospital information systems, picture archival and 

communication systems, special departmental systems and e-health applications 

involving communication technologies and medical equipment, medical 

software and e-health systems development. 

Design of clinical trials, database development, design of data entry procedures 

and statistical analysis of clinical data. 


1. Health Regulations and Standards 

JCAHO Accreditation Standards 

 

 

 

 

 

ISO 9000 Quality Standards 

NFPA 99 standards for healthcare facilities 

Guidelines for the design and construction of hospitals and healthcare 

facilities 

Overview of Ugandan standardization in the healthcare sector 

Medical devices regulatory system in Uganda 



2. Design of Clinical Trials 

Formulating and testing a hypothesis; 

New chemical entity cycle; 

 

 

 

Overview of ICH (International Conference on Harmonization), GCP 

(Good Clinical Practice) 

analysis and design of a protocol, CRF (Case Report Form) and a complete 

trial, comparative review of laws, directives and conventions, ethical 

standards about clinical trials 

SOPs (Standard Operating Procedure), conducting, monitoring and 

auditing clinical trial processes; data management, reporting and 

documentation. 

3. Medical Informatics 

Overview of health information systems 

 

 

 

 

 

 

 

 

 

 

 

Medical language, coding and classification systems 

Computer based patient records 

Hospital information systems, technical choices, information systems in 

clinical departments 

Clinical support systems, nursing information systems, and health 

information resources 

Fundamentals of epidemiology, quality management fundamentals, and 

medical decision support systems 

Biomedical signal analysis 

Medical imaging 

Human-computer interfaces in healthcare 

Costs and benefits of information systems, 

Security in medical information systems; 

Standards for medical informatics 

4. Data Mining for Healthcare 

Data mining algorithms; association rules, predictive modeling, 

classification, clustering 

Data mining in healthcare, privacy, security handling, data access from 

distributed databases, data integration from multiple healthcare institutions 

and data mining for decision making. 

Case studies for hospital administrators, for clinicians and for medical 

researchers. 

5. Clinical Decision Support Systems 

Development and evaluation of clinical diagnostic decision support systems 

Legal and ethical issues 

Mathematical foundations of decision support systems 

Applications of clinical diagnostic decision support systems. 



6. Medical Imaging Systems and PACS 

Principles of radiological imaging 

Projection radiography 

 

 

 

 

 

 

 

Digital radiography 

Tomography 

Magnetic resonance imaging 

Nuclear medicine imaging 

Ultrasound and microscopic imaging 

Picture archiving and communication systems (PACS 

Basic image processing methods, image compression and computer assisted 

diagnosis. 

Hospital Information Systems (HIS) and Radiology Information Systems 

(RIS) 

PACS data management, telemedicine and Teleradiology 


[1] Institute of Medicine (U.S.). Committee on Improving the Patient Record, 

Richard S. Dick, Elaine B. Steen The Computer-based Patient Record: An 

Essential Technology for Healthcare. National Academy Press (1991) - ISBN 

0309044952 

[2] Katharina Kaiser, Silvia Miksch, Samson W. Tu. Computer-based Support for 

Clinical Guidelines and Protocols. IOS Press (2004) - ISBN 158603412X 

ELE3103: Applied Analogue Electronics 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

This course assumes that the student has knowledge of the bipolar junction transistor 

(BJT). Thus, concept of BJT is covered in the first lesson of the course. The first 

lesson is designed to give an overview of the analysis methods for analog electronics. 

Objectives 

Having undertaken this course the student should be able to: 

 

Understand the differences between the main type of semiconductor device and 

understand their main applications; 

Understand the basic principles of some fundamental analogue circuits; 

Design simple analogue circuits using semiconductor devices 


1. Overview of Analog Circuit Analysis 

The four types of electronic circuits and signals (digital, large signal analog, 

small signal analog and mixed) are shown. A key concept used throughout the 

course, the small signal linear model, is introduced. The characteristics and 

regions of operation of the BJT and its DC and ac models are presented, 

along with the DC analysis of basic PNP and NPN BJT circuits. A simple 



amplifier circuit is used to emphasize: a) the use of the small signal model to 

find the gain and phase relationship of the output to the input signal; b) 

superposition of small ac signals with DC bias voltage; and c) coupling 

capacitors used for isolation of the signal source from DC biasing. Using the 

general model of a small signal amplifier, the effect of the signal source internal 

resistance and load resistances on the overall gain of amplifier circuits is shown. 

A review of basic circuit analysis techniques including current division, voltage 

division, potential difference, node analysis and current and voltage sources 

from the point of view of I/V characteristics is given if necessary. 

2. Concepts of Input and Output Impedance, and Voltage Gain and Phase 

for Single-stage Amplifiers. 

The five basic equations for the impedance looking into the 3 terminals of BJT 

and MOSFET transistors, replaced by their small signal models, are derived 

using the v IN 

/i IN 

method. The six basic transistor circuit configurations (common 

source CS, common gate CG, and common drain CD for FET circuits; 

common emitter CE, common collector CC, and common base CB for BJT 

circuits) are introduced. 

3. DC and Small Signal Analysis of CE, CC, and CB Single Stage BJT 

Amplifiers. 

The DC bias or quiescent point (Q-Point) analysis for a BJT amplifier is 

reviewed and practiced. The impedance results from the v IN 

/i IN 

method are used 

to find the input impedance, output impedance, and signal gain of the three 

different types of BJT amplifiers (CE, CC and CB) using the impedance 

equations derived in lesson 2. The "input impedance" analysis method for a 

single stage CE BJT amplifier is compared with the classical "plug-in model" 

method. The basic concepts learned in lessons one and two are practiced and 

reinforced by finding the voltage gain of single stage amplifiers. A graphical 

presentation of how signal distortion is related to the Q point location is 

presented. 

4. DC and Small Signal Analysis of FET Amplifiers. 

The methods for finding the voltage gain and input and output impedance for 

the CS, CD, and CG FET amplifiers are presented. Emphasis is placed on using 

impedance concepts to find the voltage gain as well as the input and output 

impedance of amplifiers, without drawing the circuit models. The principles for 

setting the DC Q-point of an FET amplifier to meet small signal voltage gain 

specs are illustrated by a design example. The principles of the previous lessons 

are exercised by solving FET and BJT single stage amplifier problems. 

5. Review of the Single Stage BJT Amplifiers; Design of Single Stage BJT and 

FET Differential Amplifiers with Low Output Impedance and High Input 

Impedance. 

The basic single stage differential amplifier, with emphasis on its discrimination 

against external noise, is introduced. The principles for the differential mode 

(DM) and common mode (CM) signal analysis of both BJT and FET 

differential amplifiers are presented. The origin of internal noise due to the 

random motion of charge in electronic circuits is presented, including basic 

concepts as Johnson, shot and flicker noise, dependence on the bandwidth, and 

signal to noise power ratio (SNR) equations are introduced. 



6. Differential and Common Mode Analysis of Multistage Differential 

Amplifiers and the Common Mode Rejection Ratio. 

The virtual ground concept for the differential mode analysis is derived. The 

principles for analysis of multistage amplifiers using impedance concepts are 

emphasized. DC and small signal analyses methods for FET and BJT 

differential amplifiers with current source bias are studied. Basic DC current 

source circuits are introduced 

7. Design of Current Sources and Three-stage CMOS Differential Amplifiers 

with Active P-channel Loads. 

Basic current mirror circuits in integrated circuit (IC) amplifiers are studied 

further from both DC and small signal view-of-points. Small signal analyses of 

classical multi-transistor current sources are done to review the method of 

finding output impedance and to show that these circuits can increase the 

output resistance and also improve the R OUT 

I OUT 

figure of merit for current 

sources. The method of suppressing common mode gain in CMOS Differential 

Amplifiers using P-channel current mirror loads is studied. Finding the voltage 

gain of three stage CMOS Differential Amplifiers by inspection is practiced. 

8. Low and High Frequency Analysis of Single and Multistage Amplifiers. 

The fundamentals of the frequency and time response of RC circuits and Bode 

phase and gain plots, including the mathematics background, are reviewed. The 

short circuit time constant (SCTC) method for obtaining the low cutoff 

frequency of amplifiers is explained. Circuit problems exercising this method 

for the different configurations of single-stage amplifiers are solved. The high 

frequency models for the FET and BJT are presented along with gainbandwidth 

limitations. The high frequency response of common base, common 

gate, common collector, and common drain amplifiers (obtained by the open 

circuit time constant (OCTC) method) are compared. The Miller effect is 

derived and applied to the frequency response analysis of basic amplifier 

circuits. 

9. Analysis and Design of Multi-stage BJT and FET Circuits with Feedback 

Circuits with feedback to improve input and output impedance, noise 

suppression, frequency response, gain stability, and nonlinear distortion are 

studied, along with methods to find the loop gain are studied. The classical 

feedback theory using amplifier and feedback “boxes” is briefly discussed. The 

frequency response of common base, common gate, common collector, and 

common drain amplifiers are compared. The tradeoffs between frequency 

response, gain, and input impedance and other parameters are emphasized. 

10. Small Signal Parameters and Methods for Large Signal Analysis 

The concept of small signal parameters (z, y, h, and g) for analysis of two port 

electronic systems with the different feedback configurations (series-series, 

shunt-series, shunt-shunt, and series-shunt) is presented. The essential concepts 

and applications of two-port parameters for feedback systems and device 

characterization are listed. The graphical approach for large signal analysis of 

electronic circuits, as illustrated by analysis of the push-pull output stage of 

operational amplifier, is studied. There is at least one hour allocated to review 

for the final exam 




[1] R. C. Jaeger, Microelectronic Circuit Design, McGraw-Hill, New York, 1996; 

[2] A. S. Sedra and K. C. Smith, Microelectronic Circuits, Oxford University 

Press, New York, 1998 

EMT3202: Partial Differential Equations 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 15 60 100 60 40 4 

Rationale 

EMT1201 Engineering Mathematics II introduced Differential Equation and Solution 

Techniques for ODEs with Exact Solutions in terms of Elementary Functions 

(Algebraic, Trigonometric, Exponential, Logarithmic and Hyperbolic Functions) and 

EMT2101 Engineering Mathematics III Introduced the Power Series Solutions to 

ODEs, it was appreciated that the analysis of Engineering Systems containing lumped 

parameters often leads to ODEs in which time is the only independent variable. 

However, the assumption that all masses exit as conceptualized mass points; that all 

springs are weightless; or that elements of an electric circuit are concentrated in idea 

resistors, capacitors, and inductors, rather than continuously distributed, is frequently 

not sufficiently accurate. In such cases, a more realistic approach must take into 

account the fact that the independent variables depend not only on time but also on one 

or more space variables. With more than one independent variable manifested, the 

formulation of such problems leads to Partial, rather than Ordinary, Differential 

Equations. This course introduces the Course Participant to the Concept of Partial 

Differential Equations (PDEs). 

Objectives 

 

An important emphasis of the course is to develop problem solving skills and 

proof skills by working on specific problems in which it is natural to look at 

special or simpler cases in order to try to discover patterns. An integral part of 

the process of mathematical thinking is to wander into blind alleys, sometimes 

being frustrated, before ultimately obtaining a solution or proof. In this process 

mathematical scientists often work together with colleagues, and this group 

work and sharing of ideas often adds great value to a mathematical 

investigation. 

 

A major goal of the course is to give a balanced introductory treatment of the 

area of PDE so that a student appreciates the power of PDE modeling; and is 

aware of major techniques for their solution. The focus of the course is on 

analytical techniques for the classical linear PDE of physics and engineering 

(heat, wave and Laplace equations), and their frequent occurrence in 

applications. 




1. Definition of a Partial Differential Equation 

2. Derivation of Some Typical PDEs of Mathematical Physics 

The One-Dimensional Wave Equation (Vibrating String) 

The One-Dimensional Heat Conduction Equation 

The Telegraph or Transmission Line Equation 

The Two-Dimensional Wave Equation (Vibrating Membrane) 

The Two-Dimensional Heat Conduction Equation 

The Three-Dimensional Heat Conduction Equation 

3. Classification of Partial Differential Equations 

Homogeneous and Non Homogeneous PDE’s 

Linear and Non-Linear PDE’s 

N-Order PDE’s 

Parabolic, Elliptic and Hyperbolic PDE’s 

4. Classification of Boundary Conditions to PDE’s 

Homogeneous and Non Homogeneous BC’s 

Linear and Non-Linear BC’s 

Dirichlet BC’s 

Neumann BC’s 

Robin BC’s 

Cauchy BC’s 

5. Overview of Methods of Solving Boundary Value Problems 

6. Solutions of Boundary Value Problems Using the Method of Separation of Variables 

2nd Order Linear and Homogeneous BVP’s with Period BC’s 

Use of Fourier Series in the Solution of 2nd Order Linear and Homogeneous 

Dirichlet and Neumann BVP’s 

Solution of Non-Homogeneous BVP’s 

Direct Originality with Mixed BVP’s 

The Cauchy BVP’s 

Sturm-Liouville Problems 

7. Use of Laplace Transforms in Solving PDEs 

8. FDM Solutions of Boundary Value Problems involving PDEs 

Parabolic BVP’s 

Elliptic BVP’s 

Hyperbolic BVP’s 

Use of MATLAB in the Solution of PDE’s 


[1] Clarence Raymond Wylie and Louis C. Barrett, 1995. Advanced Engineering 

Mathematics. 6 th Ed. International Edition. McGraw-Hill, N. Y. US 

[2] Erwin Kreyszig, 1999. Advanced Engineering Mathematics. 8 th Edition. John 

Wiley & Sons, INC. New York 

[3] Murray R. Spiegel, 1981. Applied Differential Equations. 3 rd Edition. Prentice- 

Hall, Inc., Englewood Cliffs, N.J. 07632 

[4] G. Stephenson, 1988. Mathematical Methods for Science Students. 2 nd Edition. 

Longman Group UK 





[6] L. R. Mustoe, 1988. Worked Examples in Advanced Engineering Mathematics. 

John Wiley & Sons Ltd. Great Britain. 

CMP3201: Embedded Systems 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Almost every electronic appliance and device today uses embedded systems. Cell 

phones, automobiles, toasters, televisions, airplanes, medical equipment, and a host of 

other devices, products, and applications use embedded systems. Such systems include 

microcontrollers, embedded programs, and real-time operating systems. These systems 

require a conscious effort to produce the most reliable product possible requiring the 

utmost diligence in system design and in design methodologies. Indeed, these designs 

often reflect the design of low power systems and tool support. 

Objectives 

By covering the course in Embedded Systems, the student will be able to: 

 

 

 

 

 

 

Identify some contributors to embedded systems and relate their achievements to 

the knowledge area, describe the meaning of an embedded system, explain the 

reasons for the importance of embedded systems, describe the relationship between 

programming languages and embedded systems and describe how computer 

engineering uses or benefits from embedded systems. 

Understand the CPU in the context of a complete system with I/O and memory, 

understand how the CPU talks to the outside world through devices, and 

understand how memory system design (caches, memory management) affect 

program design and performance. 

Understand how high-level language programs convert into executable code, know 

the capabilities and limits of compilers, and comprehend basic representations of 

programs used to manipulate programs either in a compiler or by hand. 

Distinguish RTOSs from workstation/server OS, distinguish real-time scheduling 

from traditional OS scheduling, understand major real-time scheduling policies and 

understand interprocess communication mechanisms. 

Understand why low-power computing is important, identify sources of energy 

consumption and identify possible remedies for energy consumption at various 

levels of design abstraction. 

Understand the variety of sources of faults in embedded computing systems, 

identify strategies to find problems and identify strategies to minimize the effects of 

problems. 



 

 

Understand why real-world projects are not the same as class projects, identify 

important goals of the methodology and understand the importance of design 

tracking and documentation. 

Understand role of hardware and software tools in system development and 

understand how to use tools to support the methodology. 

Understand the use of multiple processors in embedded systems, identify trade-offs 

between CPUs and hardwired logic in multiprocessors, and understand basic design 

techniques. 


1. History and Overview of Embedded 

Indicate some reasons for studying embedded systems 

Highlight some people that influenced or contributed to the area of 

embedded systems 

Indicate some important topic areas such as mapping between language and 

hardware, classifications, influence of software engineering, applications 

and techniques, and tool support 

Contrast between an embedded system and other computer systems 

Mention the role of programming and its associated languages as applied to 

embedded systems 

Explore some additional resources associated with embedded systems 

Explain the purpose and role of embedded systems in computer engineering 

2. Embedded Microcontrollers 

Structure of a basic computer system: CPU, memory, I/O devices on a bus 

CPU families used in microcontrollers: 4-bit, 8-bit, 16-32-bit 

Basic I/O devices: timers/counters, GPIO, A/D, D/A 

Polled I/O vs. interrupt-driven I/O 

Interrupt structures: vectored and prioritized interrupts 

DMA transfers 

Memory management units 

Memory hierarchies and caches 

3. Embedded Programs 

The program translation process: compilation, assembly, linking 

Representations of programs: data flow and control flow 

Fundamental concepts of assembly language and linking: labels, address 

management 

Compilation tasks: mapping variables to memory, managing data structures, 

translating control structures, and translating expressions 

What can and cannot be controlled through the compiler; when writing 

assembly language makes sense 

4. Real-Time Operating Systems 

Scheduling policies 

Rate-monotonic scheduling: theory and practice 

Priority inversion 

Other scheduling policies such as EDF 

Message-passing vs. shared memory communication 

Interprocess communication styles such as mailbox and RPC 



5. Low-Power Computing 

Sources of energy consumption: toggling, leakage 

Instruction-level strategies for power management: function unit 

management 

Memory system power consumption: caches, off-chip memory 

Power consumption with multiple processes 

System-level power management: deterministic, probabilistic methods 

6. Reliable System Design 

Transient vs. permanent failures in hardware 

Sources of errors from software 

The role of design verification in reliable system design 

Fault-tolerance techniques 

Famous failures of embedded computers 

7. Design Methodologies 

Multi-person design projects 

Designing on-time and on-budget 

Design reviews 

Tracking error rates and sources 

Change management 

8. Tool Support 

Compilers and programming environments 

Logic analyzers 

RTOS tools 

Power analysis 

Software management tools 

Project management tools 

9. Embedded Multiprocessors 

Importance of multiprocessors as in performance, power, and cost 

Hardware/software partitioning for single-bus systems 

More general architectures 

Platform FPGAs as multiprocessors 

10. Networked Embedded Systems 

Why networked embedded systems 

Example networked embedded systems: automobiles, factory automation 

systems 

The OSI reference model 

Types of network fabrics 

Network performance analysis 

Basic principles of the Internet protocol 

Internet-enabled embedded systems 

11. Interfacing and Mixed-Signal Systems 

Digital-to-analog conversion 

Analog-to-digital conversion 

How to partition analog/digital processing in interfaces 

Digital processing and real-time considerations 




[1] Frank Vahid and Tony Givargis, 2002. Embedded System Design: A Unified 

Hardware/Software Introduction. John Wiley & Sons; ISBN: 0471386782. 

[2] Peter Marwedel, 2006. Embedded System Design. Birkhäuser, ISBN 

0387292373, 9780387292373 

[3] Arnold S. Berger, and Arnold S. Berger, 2001. Embedded Systems Design: 

An Introduction to Processes, Tools and Techniques. CMP Books; 1st edition. 

ISBN-10: 1578200733, ISBN-13: 978-1578200733 

[4] John Catsoulis, 2005. Designing Embedded Hardware. 2 nd Edition. O'Reilly 

Media, Inc. ISBN-10: 0596007558. ISBN-13: 978-0596007553. 

[5] Tammy Noergaard, 2005. Embedded Systems Architecture: A Comprehensive 

Guide for Engineers and Programmers. Newnes. ISBN-10: 0750677929. 

ISBN-13: 978-0750677929. 

CMP3202: Human Computer Interaction 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

The design and development of displays, alarms, and interfaces for small or large 

screens is an activity captured in the study of the human computer interface and in a 

study of human computer interaction. This discipline is increasingly software based and 

design needs require guidance by insights from psychology and informed by an 

appreciation of human diversity including matters such as colored blindness and 

deafness; in these circumstances, multimedia approaches often have a role to play. It is 

important to note that in certain applications there are crucial requirements for 

reliability and other kinds of performance that have implications for matters such as 

safety and security. Emphasis is placed on understanding human reactions to displays 

of various kinds and on human behavior in the context of interactive objects. Based on 

these, students need to understand the principles associated with the evaluation of 

interfaces including those that embody interaction. Students need to know the 

principles and guidelines that reflect best practice in the design, development, and 

maintenance of interfaces for multiple types of systems. 

Objectives 

By covering the course in Human Computer Interaction (HCI), the student will be able 

to: 

 

Identify some contributors to human-computer interaction and relate their 

achievements to the knowledge area, define HCI, explain the reasons for proper 

HCI designs in engineering, provide a good reason for having a small-screen 

graphical user interface, provide a good reason for having a large-screen graphical 

user interface, give an example on how one might evaluate an engineering design 

using some principles of HCI and describe how computer engineering uses or 

benefits from human-computer interaction. 



 

 

 

 

 

 

Develop a conceptual vocabulary for analyzing human interaction with software: to 

include terms such as affordance, conceptual model, and feedback, summarize the 

basic science of psychological and social interaction relevant to the development of 

human computer interfaces, differentiate between the role of hypotheses and 

experimental results recognizing the role of correlations, distinguish between the 

different interpretations that a given icon, symbol, word, or color can have in (a) 

different human cultures and (b) in the context of human diversity, and create and 

conduct a simple usability test for an existing software application, taking into 

account human diversity. 

Identify several fundamental principles for effective GUI design relevant for 

different applications in computer engineering, use a GUI toolkit to create a simple 

application that supports a graphical user interface, illustrate the effect of 

fundamental design principles on the structure of a graphical user interface, and 

conduct a simple usability test for each instance and compare the results. 

Recognize contexts in which to deploy the various technologies associated with 

intelligent systems and demonstrate an awareness of the capabilities as well as the 

limitations of the available techniques and technologies. 

For a range of contexts in which intelligent systems are deployed in a computer 

engineering context, identify the technical implications for devices, for computing 

power and for software, identify the potential for the use of intelligent systems in a 

range of computer engineering equipment, discuss the professional, legal and 

ethical implications of deploying intelligent systems in a range of computer 

engineering situations, describe situations from computer engineering applications 

when intelligent systems can be relied upon to deliver a required response, describe 

situations in which intelligent systems may or may not be reliable enough to deliver 

a required response, giving reasons for the answer, explain the necessity for 

heuristics in the general context of intelligent systems, and differentiate between the 

concepts of: optimal reasoning and human-like reasoning; of optimal behavior and 

human-like behavior. 

Discuss the full range of evaluation criteria appropriate for one of a range of 

computer engineering applications, conduct a walkthrough and a Keystroke Level 

Model analysis, summarize the features of the major guidelines and standards 

associated with human-centered software evaluation, and evaluate one of a range 

of existing interactive system with appropriate human-centered criteria and 

usability, giving reasons for selection of techniques. 

Explain the basic types and features of human-centered software development, 

indicate three functional and three usability requirements that may be useful in 

developing human-centered software, specify an interactive object using one of the 

common methods as well as appropriate standards or guidelines, and demonstrate 

the application of guidelines and fundamental principles in developing one of a 

range of possible computer engineering applications that rely on a human computer 

interface. 



 

 

Summarize common interaction styles, explain good design principles of each of 

the following: common widgets; sequenced screen presentations; simple error-trap 

dialog; a user manual, design, prototype, and evaluate a simple 2D GUI, and 

discuss the challenges that exist in moving from 2D to 3D interaction. 

Compare the event-driven paradigm with more traditional procedural control for 

the user interface, identify common differences as well as similarities in crossplatform 

user interface design, and demonstrate an ability to outline an approach to 

interface design for a computer engineering application that utilizes an 

appropriately chosen selection of technologies from event management, widgets, 

geometry management, and GUI builders. 

Understand the nature of graphical design and implement a simple graphical 

activity using a standard software package, appreciate the role of visualization 

technologies and demonstrate them through the development of a simple 

application, appreciate the benefits of virtual reality and the nature of the 

advantages this offers, and demonstrate a simple application of computer vision 

technology in a computer engineering context. 

Select system components which are suitable for the realization of multi-media 

interfaces of high quality, and design and develop a multi-media interface for a 

simple computer engineering application. 


1. History and Overview of HCI 

Indicate some reasons for studying human-computer interaction 

Highlight some people that influenced or contributed to the area of humancomputer 

interaction 

Indicate some important HCI considerations such as foundational elements, 

ergonomic designs, and graphical interfaces 

Contrast ways in which engineering design should reflect human interaction 

Mention some advantages of small-screen designs versus large-screen 

designs 

Describe how one would evaluate an engineering design vis-à-vis HCI 

compatibility 

Explore some additional resources associated with human-computer 

interaction 

Explain the purpose and role of human-computer interaction in computer 

engineering 

2. Foundations of Human-Computer Interaction 

Motivation: the importance of the human interface in computer 

engineering; issues of small screens and larger screens 

The range of possibilities: text-based systems, use of graphics, sound, 

animation, video; the possibilities of multimedia Strengths and weaknesses 

of individual approaches 

The web as an example of an interface 

 

 

Human-centered development and evaluation 

Human performance models: perception, movement, and cognition; culture, 

communication, and organizations 



Accommodating human diversity; the role of multimedia 

Principles of good human computer interaction design in the context of 

computer engineering; engineering tradeoffs 

Introduction to usability testing 

The role of and use of a range of tools 

3. Graphical User Interface 

Illustrations of developments of graphical user interfaces including: textual 

displays; interfaces that include alarms; displays that exhibit motion; 

displays that exhibit interaction 

Principles of design using graphical user interfaces (GUIs); principles 

associated with interaction including fault tolerance 

GUI toolkits 

Principles associated with use of sound and multimedia in different 

contexts; use of relevant tools 

Principles of design for web interfaces; web interfaces for small screen and 

mobile devices 

Use of relevant tools 

4. I/O Technologies 

The range of technologies and techniques that can be deployed in intelligent 

systems: vision, speech processing, specialized sensors 

Technologies for location aware computing, the role of geographical 

positioning systems, other possibilities 

Overview of the technologies involved: their strengths and the limitations 

Availability of software support and of relevant tools 

5. Intelligent Systems 

Illustrations of the deployment of intelligent systems in a computer 

engineering context 

The nature of intelligence deployed and the implications for sensors, for 

software (the nature of the software, the reliability of the software, the 

reasoning, the speed of response) 

The special case of mobile systems and location aware devices; illustrations 

of applications and benefits 

The problems associated with control passing to an agent and a user losing 

control as in a safety context 

Ethical issues 

History of artificial intelligence 

Philosophical questions about the nature of intelligence: the Turing test; 

Searle’s “Chinese Room” thought experiment 

Ethical issues in artificial intelligence; the concepts of the computable and 

the incomputable 

Fundamental definitions: Optimal vs. human-like reasoning, optimal vs. 

human-like behavior 

The nature of knowledge and knowledge based systems; consistency and 

completeness concerns; what is possible 

The issues associated with the ordering of information, the fundamental 

role of technologies such as search, inference, and the role of heuristics 

Modeling the world; guidance on effective approaches 

6. Human-Centered Software Evaluation 



Setting goals for evaluation 

The range of evaluation criteria including learning time, task time, 

completion time, acceptability; the strengths and weaknesses of the 

different criteria 

Evaluation without users: walkthroughs, Keystroke Level Model (KLM), 

guidelines, and standards 

Evaluation with users: usability testing, interview, survey, experiment 

7. Human-Centered Software Development 

General guidelines associated with the structure of large systems that 

embody significant HCI code; separation of concerns, issues of 

maintenance; differing development life cycles 

Approaches, characteristics, and overview of processes associated with 

human centered software; systems that offer interfaces in different natural 

languages 

Functionality and usability: task analysis, interviews, surveys 

Specifying presentation and interaction; techniques and approaches; 

software support 

Prototyping techniques and tools: Paper storyboards; inheritance and 

dynamic dispatch; prototyping languages and GUI builders 

Quality considerations 

Standards and guidelines 

8. Interactive Graphical User-Interface Design 

Choosing interaction styles and interaction techniques appropriate to 

applications 

HCI aspects of common widgets 

HCI aspects of screen design: layout, color, fonts, and labeling 

Handling human failure 

Beyond simple screen design: visualization, representation, metaphor 

Interfaces for computer engineering tools that utilize databases 

Multi-modal interaction: graphics, sound, and haptics 

3D interaction and virtual reality 

9. Graphical User-Interface Programming 

User interface management systems: different approaches; responsibilities 

of the application and of the application 

Kernel based and client server models for the user interface 

Dialogue independence and levels of analysis, Seeheim model 

Widget classes; aggregation of widgets 

Event management and user interaction 

Geometry management, constraint based approaches 

GUI builders and user interface programming environments; callbacks and 

their role in GUI builders 

Cross-platform design 

10. Graphics and Visualization 

Computer graphics: Design of models that represent information and 

support the creation and viewing of images; possibilities to include two 

dimensions, three dimensions, shading, animation; graphical display devices; 

packages that support graphical design 



Visualization: Nature of computer visualization; the role of visualization in 

communicating information in a dataset to an interested party; use of tools 

to accomplish this 

Virtual reality: Nature of and benefit of virtual reality; its limitations; 

components of a typical virtual reality situation, e.g. graphics, sound; the 

nature of interaction with a user; virtual environments 

Computer vision: Role in deducing properties and the structure of a three 

dimensional world from one or more two dimensional images; tools used 

for this and their role in computer engineering 

11. Multimedia Systems 

The use of multi-media in computer engineering applications; the benefit, 

especially in reinforcement and in a context of human diversity 

The implications of performance requirements associated with multi-media 

for the hardware, the software and communications aspects of computer 

based systems 

Considerations resulting from interaction of various kinds 

Design concerns associated with the development of multi-media interfaces 

Implementation issues; synchronization aspects, tools 

Quality considerations 

Guidelines and standards 


[1] Alan J. Dix, Janet E. Finlay, Gregory D. Abowd, Russell Beale, and Janet E. 

Finley, 1998. Human-Computer Interaction. 2 nd Edition. Prentice Hall. ISBN- 

10: 0132398648, ISBN-13: 978-0132398640 

[2] Dov Te'eni, Jane Carey, and Ping Zhang, 2006. Human Computer Interaction: 

Developing Effective Organizational Information Systems. John Wiley & Sons. 

ISBN 0471677655 

[3] Helen Sharp, Yvonne Rogers, Jennifer Preece, and Jenny Preece, 2007. 

Interaction Design: Beyond Human-computer Interaction. Wiley. ISBN 

0470018666 

[4] Andrew Sears, and Julie A. Jacko2008. The Human-Computer Interaction 

Handbook. Lawrence Erlbaum Associates. ISBN 0805858709 

CMP3203: Computer Systems Maintenance 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


30 60 00 60 100 60 40 4 

Rationale 

This course covers both hardware and software, providing students with the skills and 

knowledge to build, repair and upgrade computer systems. It also provides a useful 

introduction to networks and network security. 



Objectives 

By covering the course in Computer Systems Maintenance, the student will be able to 

effective carry out Personal Computer hardware and software installation, 

configuration and upgrading, diagnosis and troubleshooting, preventative maintenance, 

safety and environmental issues, and basic networking. 


1. Basic Concepts of a PC 

Identify the main and auxiliary components of a PC 

Compare a portable PC with a desktop PC 

Identify the factors affecting the performance of a CPU 

List the different types of microprocessors motherboards and their 

components 

List the types of ports I/O buses and power connectors 

Identify different types of RAM and RAscsM packages 

List various system resources 

Describe the hard drive geometry and commonly used data encoding 

techniques 

Identify different types of hard drive interfaces 

Identify different SCSI standards 

Identify the requirements for a SCSI device to function 

List different types of video cards and monitor components 

Identify different modes of communication for a modem 

Describe the factors affecting the functioning of a modem 

Identify the different types of printers 

Identify the working of a laser printer 

2. Installing and Configuring a PC 

Assembling a Computer (Installing Components of a PC and Running 

CMOS & Partitioning Hard Drive) 

Configuring a PC (Installing the Operating System, Printers & Modems) 

Networking a PC (Understanding Network Basics and Implementing 

Networks) 

Configuring a Network (Using Network Protocols & Utilities and Installing 

Network Components) 

3. Introduction to Operating Systems 

Introduction to Operating Systems (Operating Systems Overview and 

Functions of Operating Systems) 

Information and Memory Management 

Process Management (Process Scheduling and Inter-process 

Communication) 

Processor Management and Security (Parallel and Distributed Processing, 

and Security and Protection Issues) 

Overview of Different Operating Systems (Types of Operating Systems, 

Comparing DOS and Windows Operating System, Comparing Linux and 

Unix, Comparing Windows NT and Windows 2000) 

4. PC Configuration and Troubleshooting 

Configuring a PC (Installing OS and Tuning the System, and Installing 

External Drivers) 



 

 

Troubleshooting PC Problems (Troubleshooting Methodology, and 

Troubleshooting the Motherboard and File System) 

Troubleshooting Other Devices (Troubleshooting Display & Sound Card, 

Troubleshooting Input Devices, and Troubleshooting Storage Media 

Printer & Modem 

5. Troubleshooting PC Problems 

 

 

 

Preventative Maintenance of System (System Maintenance, Input Devices 

and Display, Storage Media and Power Supply, and Peripherals and Power 

Supply) 

Preventative Maintenance of Data (Disk Fragmentation and DriveSpace, 

and ScanDisk and Disk Cleanup) 

Troubleshooting Techniques (Troubleshooting System Unit, and Storage 

Media and Printer Troubleshooting) 

6. Troubleshooting PC Related Problems 

 

 

 

Troubleshooting Hardware and Software Problems (Troubleshooting using 

Diagnostic Software, Troubleshooting File System, and Troubleshooting 

Windows Problems) 

Troubleshooting System Cards and Input Devices (Troubleshooting Display 

and Sound Cards, and Troubleshooting Input Devices) 

Troubleshooting Other Devices (Troubleshooting Storage Media, and 

Troubleshooting Printers and Modems 


[1] Phillip A. Laplante, 1915. Easy PC Maintenance and Repair. Windcrest; 2 

Edition. ISBN-10: 0070364338. ISBN-13: 978-0070364332. 

CMP3204: Distributed Information Systems 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Many computer applications are confronted with ever increasing volumes of data 

which must be managed, accessed, and processed efficiently. Typical cases arise in the 

fields of e-Health, banking and insurance, e-Science, digital libraries, etc. From the 

data management point of view, this has led to a radical shift from centralized, 

monolithic database systems towards distributed information systems. For such 

systems, it is of utmost importance: 

 

To have sophisticated mechanisms and protocols for coordination and access of 

distributed resources 

 

To have appropriate infrastructure which support distributed applications 



This course is designed to provide a firm understanding of the basic problems 

associated with distributed information systems and expose the students to the different 

architectural paradigms, as well as practical experimentation with selected systems. 

Objectives 

 

 

 

To introduce the student to the concept of distributed information systems 

To expose the student to fundamentals of information integration and 

interoperability, federation/mediator/brokering architectures, agent-oriented 

systems agent-oriented systems, query formulation and processing, semistructured 

and multimedia data management, metadata, and knowledge 

management. 

To introduce the student to the practical imperatives of the languages and 

protocols for developing advanced/distributed/global information systems and 

their applications. 

To expose the student to recent advances in technology and research in database 

and intelligent systems 


1. Introduction 

What are Distributed Information Systems (IS) 

 

Evolution of IS 

IS Architectural Paradigms 

2. Distributed Transactions 

Atomicity and Concurrency Control in a Distributed Setting 

 

TP-lite: Application Login Inside Databases 

Practical Exercise: Distributed Transactions & 2PC in DBMSs and in Java 

3. Middleware 

Is middleware more then the “/” in client/server 

Practical Exercise: CORBA 

4. Container Architectures, J2EE 

Enterprise Java Beans 

Practical Exercise: JBoss 

5. Web Services 

How can Web Services be invoked 

 

How can Web Services be described 

Practical Exercise: SOAP & WSDL 

6. (Web) Service COMPOSITION 

How can (web) Services be Combined to Complex applications 

 

Demo: BPEL4WS / IBM WebSphere 

Practical Exercise: OSIRIS 

7. Semantic Web Services 

How can the Description of a Web Service (WS) be Enriched with 

Semantic Information 

 

Demo: OWL-S 



8. Message-Oriented Middleware 

Asynchronous interactions 

Demo: IBM WebSphere MQSeries 


On completion of this course, the student will be able to: 

Demonstrate a firm understanding of the concept of distributed information 

systems 

 

Appreciate and discuss the fundamentals of information integration and 

interoperability, federation/mediator/brokering architectures, agent-oriented 

systems agent-oriented systems, query formulation and processing, semistructured 

and multimedia data management, metadata, and knowledge 

management. 

Implement a distributed Information System using Java EE. 


[1] G. Alonso, F. Casati, H. Kuno, V. Machiraju. Web Services–Concepts, 

Architectures and Applications. Springer, 2004. ISBN 3-540-44008-9. 

[2] F. Berman, G. Fox, A. Hey (Eds.). Grid Computing. John Wiley & Sons, 2003, 

ISBN: 0-470-85319-0. 

[3] K. Birman: Reliable Distributed Systems – Technologies, Web Services, and 

Applications. Springer, 2005. ISBN: 0-387-21509-3. 

[4] J. Myerson. The complete book of Middleware. Auerbach, 2002. ISBN 0- 

8493-1272-8. 

[5] T. Özsu, P. Valduriez. Principles of Distributed Database Systems. Prentice 

Hall, 2nd Edition, 1999. ISBN: 0-13-659707-6. 

[6] M. Singh, M. Huhns: Service-Oriented Computing: Semantics, Processes, 

Agents. John W 

CMP3205: Intelligent Systems 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Theory and implementation of a variety of techniques used to simulate intelligent 

behavior. Expert systems, fuzzy logic, neural networks, evolutionary computation, and 

two-player game-tree search will be covered in depth. Knowledge representation, 

pattern recognition, hybrid approaches, and handling uncertainty will also be discussed 

Objective 

By covering the course in Intelligent Systems, the student will be able to: 

Appreciate the concepts of Artificial Intelligence and the diversity of approaches 

and definitions with which it is associated. 

Develop an understanding of heuristic methods. 

Learn the underlying theory and practice of evolutionary computation, including 

genetic algorithms and genetic programming. 



 

 

 

 

Appreciate knowledge engineering, develop expert systems, and understand 

fuzzy expert systems. 

Develop an understanding of and implement artificial neural networks. 

Implement a two-player strategy game with optimized adversarial search. 

Implement, observe and evaluate alternative approaches to intelligent systems 


1. Optimization Methods 

 

 

 

 

 

 

 

Gradient methods 

Linear Programming 

Constrained Problems and Lagrange Multiplier Method 

Search Method 

Ordinal Optimization 

Genetic Algorithms 

Applications 

2. Fundamentals of Neural Networks 

 

 

 

Basic concepts 

Back-propagation algorithm 

Applications 

3. Advanced Neural Networks 

 

 

 

Competitive learning 

Data clustering networks 

Application in hierarchical modeling for complex systems 

4. Knowledge Representation Methods 

 

 

 

Linguistic knowledge representation 

Mathematical foundation: Random Sets 

Applications 

5. Information Fusion Techniques 

 

 

 

Fusion of linguistic and stochastic information 

Application in intelligent segmentation 

Application in sensor fusion 


[1] Michael Negnevitsky, 2005. Artificial Intelligence: A Guide to Intelligent 

Systems. Addison-Wesley- ISBN 0321204662 

[2] George F. Luger, Peder Johnson, Jean E. Newman, Carl Stern, Ronald Yeo - 

Cognitive Science: The Science of Intelligent Systems. Academic Press (1994) 

- ISBN 0124595707 

[3] Jatinder N. D. Gupta, Guisseppi A. Forgionne, Manuel Mora. Intelligent 

Decision-making Support Systems: Foundations, Applications and Challenges. 

Springer (2006)-ISBN 1846282284 



CMP3206: Safety Critical System 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Computers are increasingly used in systems where safety is paramount, such as 

transport, power systems and medical applications. An understanding of the techniques 

necessary to implement robust approaches has become vitally important. 

Objectives 

 

The principal objective of this course is to give students an opportunity to 

acquire knowledge in the development of safety critical systems, including the 

theory and practice of applying safety analysis and formal specification 

techniques. 

Students will also gain experience in the use of such specifications in software 

development and testing. 


1. Standards, Safety Culture and Management 

Standards, Conformance and IEC61508 

Organizational Failure and MORT 

2. Requirements Analysis 

Requirements, Safety Cases and SMART 

Hazard analysis and FMECA 

3. Risk Analysis 

Probabilistic risk assessment, THERP and CREAM 

Fault Trees, Software Fault Trees and Software PRA 

4. Software Engineering 

Software Requirements and MIL-HDBK-338B 

Software Development and DO-178B 

5. Hardware Design 

Fault Tolerant Architectures and the Shuttle GPCs 

Microprocessors, PLCs and Electromagnetic Compatibility 

6. Static and Dynamic Testing 

Validation, Verification and DEF STAN 00-60 

Testing, Formal Reasoning and Mode Confusion 

7. Human Factors 

Slips, Lapses and Mistakes, GEMs and Risk Homeostasis 

Workload, Situation Awareness and CRM 

8. Accident and Incident Analysis 

Incident Reporting and Analysis, Eindhoven Classification Model 

Accident Investigation and Reporting 


[1] Safeware: System Safety and Computers, by Nancy G. Leveson, University of 

Washington (leveson@cs.washington.edu), Addison-Wesley, 1995. ISBN: 0- 



201-11972-2. 

[2] Computer Related Risks, by Peter G. Neumann, SRI, ACM Press Books 

(ACM Press / Addison-Wesley), 1995. ISBN: 0-201-55805-X. 

[3] Software in Safety Related Systems, by Brian A. Wichmann, NPL, Wiley, 

1992. ISBN: 0471-93474-7. 

[4] Safety-Critical Computer Systems, by Neil Storey, Addison-Wesley, 1996. 

ISBN: 0-201-42787-7. 

CMP3207: Sustainable Energy Systems 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


60 00 00 60 100 60 40 4 

Rationale 

The Sustainable Energy Systems course is designed to equip graduates and working 

professionals with a broad training in, and understanding of, energy production, 

delivery, consumption, efficiency, economics, policy and regulation. These are 

considered in the context of the sustainability of energy supply and consumption 

patterns, both locally and globally. A unique feature of the course is its broad approach 

to the development of sustainable routes to the generation and supply of energy within 

which renewable energy is a key theme. 

Objective 

By covering the course in Sustainable Energy Systems, the student will be able to: 

Understand and evaluate alternative modes of energy supply, including fossilfuelled, 

nuclear and renewables-based supply 

 

 

 

 

 

 

 

 

Appreciate the development of and constraints on carbon- and non carbon-based 

energy resources 

Understand the challenges and constraints on end-use efficiency of energy 

Appreciate the economic, policy and regulatory frameworks within which 

decisions on energy futures are made 

Be conversant with the problems of energy distribution and the constraints on 

present distribution systems. 

Critically analyse competing claims in the energy sector 

Evaluate options for energy supply, distribution, utilisation 

Articulate environmental sustainability of energy supply systems 

Analyse the technical-economic interaction of developments in the energy system 


1. Technologies for Sustainable Energy 

Principles of operation of sustainable energy conversion by (i) wind; (ii) 

wave; (iii) tidal; (iv) solar; (v) biomass; (vi) geothermal; (vii) combined heat 

and power systems; 

Principal aspects of engineering design underpinning these technologies; 



constraints on each technology, both imposed by physical fundamentals, 

and by current levels of technology and market, supported by quantitative 

evidence where possible; 

Fundamentals of grid connection of distributed generators and the problems 

and constraints associated with this; 

2. Energy Efficiency, Resource and Environment 

Availability of natural resources and the implications of finite fossil 

resources; 

The concept of proved reserves and R/P ratios; 

Techniques for energy efficiency in buildings, including passive solar design 

Relationships between energy use and climate change. 

3. Power Systems Engineering and Economics 

Iterative methods of solution to non-linear nodal network analysis and use a 

load flow package; 

Effects of AC network on transmission and distribution of electricity 

Principles of power system economics and how market-based solutions can 

be applied to a previously centrally-controlled industry 

Effects of network on marginal prices at different locations 

Taking human reactions into account when designing engineering solutions 


[1] Peter Gevorkian. Sustainable Energy Systems Engineering. - McGraw-Hill 

(2007) - ISBN 0071473599 

[2] Wissenschaftlicher Beirat der Bundesregierung Globale Umweltveränderungen 

(Germany. World in Transition: Towards Sustainable Energy Systems. ) - 

Earthscan (2004)- ISBN 1853838020 

[3] Naim Hamdia Afgan, Naim Afgan, Maria da Grac̦a. CarvalhoSustainable 

Assessment Method for Energy Systems: Indicators, Criteria, and Decision 

Making Procedure. Kluwer Academic (2000) - ISBN 0792378768 

CMP3301: Industrial Training II 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Report 

Mark 

Weighted Field 

Assessment 

Mark 

Credit 

Units 


00 300 00 30 100 60 40 2 

Rationale 

This shall be carried out in a firm doing Computer Engineering or Related Work. This 

training goes on for ten weeks during which the student is supervised by a member of 

the teaching staff of the department. The student prepares a report discussing the 

training environment, lessons learnt, challenges faced and recommendations. This 

report has to be approved by both the training officer at the training firm and the 

student’s supervisor and should be handed in to the said concerned parties before the 

beginning of the academic year. 

Objectives 

By undertaking the Industrial Training programme, the student will be able to: 

Communicate effectively with fellow workers and supervisors in issues related to 

projects undertaken. 



 

 

 

 

 

 

Demonstrate and practice good working ethics and to internalize excellence. 

Attest and practice high-quality organizational skills in enhancing individual and 

group effectiveness and productivity. 

Demonstrate creativity and innovation in solving problems related to real-life 

projects. 

Exhibit pleasant interpersonal skills in developing understanding and appreciation 

of individual differences and interpersonal skills in building self-confidence. 

Work independently or under very minimal supervision. 

Demonstrate good planning, good management, constant monitoring and quality 

delivery of project undertaken. 

TEC4101: Research Methods 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 30 60 100 60 40 4 

Rationale 

Research methodology is the study of how to perform scientific research. This course 

looks at strategies for performing research in Computer Engineering, from problem 

formulation to validation of a proposed solution. The course discusses some basic 

questions about the nature of science and of computer engineering, and gives the 

student experience with forming a research plan and with specific validation methods. 

The course spans multiple elements including time management, writing and 

presentation skills, and general considerations for experiment design and planning. 



Definition of Research 

Role of Research in the Computer Engineering Profession 

Types of Research (Basic Vs Applied; Primary Vs Secondary; Exploratory 

Vs Constructive Vs Empirical) 

Research Processes (The Scientific Vs Historical Research Process) 

Information Literacy Strategies 

Research Funding 

Research and Publishing 

2. Elements of General Academic Writing 

The Writing Process (Invention, Composition and Revision) 

Research Concept Note (Synopsis) 

Proposal 

Thesis Report 

Papers 

Abstracts 

Formatting Style (MLA Vs APA) 



3. Identifying and Formulating a Research Problem 

Definition of Research Problem 

Identify a Research Problem (Sources of Research Problems) 

Testing the Feasibility of the Research Problem 

Formulating a Research Problem 

Statement of the Problem 

Components of a Problem Statement 

References and Bibliography 

Appendices 

Pagination of Research Proposal 

4. Developing Other Proposal Components 

Formulating a Research Title 

Formulating and Stating the Research Objectives 

Stating the Research Justification 

Literature Review 

The Research Methodology 

The Research Resources Plan (Work plan, and Budget) 

5. Research Ethics 

Intellectual Property Rights (Makerere IPM Policy and other International 

IPM Policies) 

Research Ownership and Mandate of Researcher 

Research and Citations (Notation and Standards) 

Plagiarism (Definition, manifestation, and consequences) 

Authenticity of Facts and Opinions (Proper Research Language and 

avoiding weasel word and fallacies) 

Rights of Human and Animal Survey Respondents 

6. Data Collections and Analysis 

Designing and Executing a Survey 

Data Collections Instruments and Methods (Questionnaires Vs Interview 

Vs Check Lists) 

Designing Effective Questionnaires 

Case Studies 

Designing and Conducting Experiments 

Software for Data Analysis 

7. Presentation of Research 

Oral Presentation (Proposal and Viva Voce) 

Use of Presentation Aides 

Use of Graphics and Animations in Presenting Research 

Presentation Language 



Formulate a detailed statement of the problem, objectives and develop a 

comprehensive research proposal 

Execute bibliographic searches to obtain information about prior work. 

Analyse research literature to obtain relevant information, identify trends, and 

produce annotated bibliographies. 

Have appreciation of appropriate citation and attribution in research. 



Select an appropriate method of solution. 

Use appropriate tools for data capture and analysis. 

Design and conduct of experiments. 

Carry out technical writing and presentation of results for publication 


[1] John W. Creswell, (2006). Research Design: Qualitative, Quantitative, and Mixed 

Methods Approaches. Sage Publications, Inc; 3rd Edition. ISBN-10: 1412965578, 

ISBN-13: 978-1412965576 

[2] Donald H. McBurney and Theresa L. White, (2006). Research Methods, Wadsworth 

Publishing; 7 Edition. ISBN-10: 0495092088, ISBN-13: 978-0495092087 

[3] Anthony M. Graziano and Michael L. Raulin (2006). Research Methods: A 

Process of Inquiry. Allyn & Bacon; 6 Edition. ISBN-10: 0205484751, ISBN-13: 

978-0205484751 

[4] Kenneth Bordens and Bruce Barrington Abbott, (2007). Research Design and 

Methods: A Process Approach. McGraw-Hill Humanities/Social Sciences/Languages; 

7 Edition. ISBN-10: 0073129062, ISBN-13: 978-0073129068 

CMP4101: Digital Signal Processing 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

Computer Engineering benefits from Digital signal processing, through its application 

in the transformation, synthesis and analysis of data. For example, when modelling a 

communication channel, filters, generators and analyzers can be used to remove, add 

or measure noise in processing audio, images and video. The computer engineer to-be 

therefore has to have a thorough introduction to Digital signal processing. 



Indicate some reasons for studying digital signal processing and multimedia 

Highlight some people that influenced or contributed to the area of digital 

signal processing and multimedia 

Indicate some important topic areas such as digital audio, multimedia, wave 

tables, digital filters, image display, chromatic and achromatic lighting, and 

thresholds 

Contrast the meanings of analog and digital signals 

Explain the need for using transforms and why they are different for analog 

and discrete situations 

Indicate how the subject relates to simple graphics 

Contrast image processing from computer graphics 

Mention some techniques used in transformations such as Fourier, Laplace, 

and wavelet transforms 

Explore some additional resources associated with digital signal processing 

and multimedia 



Explain the purpose and role of digital signal processing and multimedia in 

computer engineering 

2. Theories and concepts 

The sampling theorem 

Nyquist frequency 

Aliasing 

Relationship between time and frequency domain 

Principle of causality such as discrete and continuous spectra 

3. Discrete Fourier transform 

Definition of the Discrete Fourier Transform (DFT) 

Relationship between original and transformed domains 

Algorithms of the DFT 

Linear convolutions 

Contrast DFT with the Fourier Transform and the Fast Fourier Transform 

(FFT) 

Filtering using DFT 

Filtering of long data sequences 

4. Digital spectra analysis 

Spectral views 

Spectrum analysis 

Spectra of periodic signals 

Spectra of the impulse and a square wave 

Filtering 

Interpolation 

5. Sampling 

Implications of assumptions of repeated time series 

Group sampling of time signals 

Size of group and how it affects spectra 

Sampled signals 

Periodic signals 

Non-periodic signals 

Spectrograms 

6. Transforms 

Concept and properties of the z–transform 

Inverse z–transforms 

Difference equations 

The Discrete Fourier Transform 

The Inverse DFT 

The Fast Fourier Transform Class 

The Inverse FFT method 

Fast Convolution using the FFT 

Power Spectral Density 

Frequency shifting using the FFT 

Filtering using FFT 

Additive and subtractive synthesis 

7. Digital filters 

Frequency response of discrete – time systems 



 

 

 

 

 

 

Recursive filter design 

Nonrecursive filter design 

Windowing 

FIR filters, frequency and phase response, time domain multi-tap filters, 

surface acoustic wave filters 

Poles and zeros in the z plane 

IIR filters, frequency and phase response 

Design of IIR Filters 

8. Discrete time signals 

 

 

 

 

Representation of signals 

Sampling of signals 

Quantizing 

Aliasing 

Difference Equations 

9. Window functions 

 

 

 

 

Definition of a window function 

Purpose of a window function 

Signal compression and transform properties 

Window functions and their impact on the spectra 

Window functions and the DFT 

10. Convolution 

 

 

 

Impulse response 

Convolution integral 

Physically realizable systems 

Graphical methods 


Identify some contributors to digital signal processing and multimedia and relate 

their achievements to the knowledge area. 

Know the difference between analog and discrete signals. 

Describe how computer engineering uses or benefits from digital signal 

processing and multimedia. 

Explain the purpose of a Fourier transform in signal processing. 

Describe the advantage of the FFT. 

Contrast how group size affects signal spectra. 

Understand the concept, properties and uses of the z–transform. 

Understand the relationship between z–transform and the conformal map 

Understand the Discrete Fourier transform and its significance. 

Understand frequency selective filters in the z–transform domain. 

Understand the definition of a window function. 

Understand the discrete-time representation of signals. 

Use the convolution technique to analyze circuits. 




[1] Emmanuel C. Ifeachor, Barrie W. Jervis, Digital Signal Processing; A practical 

Approach, 2 nd Edition, Prentice Hall, 2002. 

[2] Richard G. Lyons, Understanding Digital Signal Processing, 2 nd Edition, Pearson 

Education, 2004. 

[3] John G. Proakis, Dimitris G. Manolakis, Digital Signal Processing; Principles, 

Algorithms and Applications, 4 th ed., Prentice Hall, 2006. 

[4] S. Salivahanan, A. Vallararaj, C. Gnanapriya, Digital Signal Processing, Tata 

McGraw-Hill Publishing Company Limited, 2006. 

[5] A.V. Oppenheim and R.W. Schafer, Digital Signal Processing, Prentice Hall, 

Englewood Cliffs NJ, 1975. 

[6] Sanjit K. Mitra, Digital Signal Processing, 3 rd ed., 2006 

[7] Boaz Porat, A course in digital signal processing, John Wiley & Sons Inc., 1997. 

[8] Alan V. Oppenheim, Ronald W. Schafer, Discrete-time Signal Processing, Prentice- 

Hall, International ed., 1989. 

[9] Lawrence R. Rabiner, Bernard Gold, Theory and application of digital signal 

processing, Prentice-Hall Inc., 1975. 

TEC4102: Principles of Management 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 00 00 45 100 60 40 3 

Rationale 

This course will enable students to develop short and long-range plans to effectively 

accomplish organizational goals. Through the use of terminology, exercises and case 

studies, students will be able to give a critical appraisal of real life situations involving 

organizing, staffing and motivating others. The student will also learn tools to aid in 

problem solving, valuing diversity and coping with change. The principles learned in 

this course will allow the student to effectively work with and through others in an 

organization. The principles are relevant to any type of organization or group, 

empowering the student to lead others, negotiate, embrace change and better 

understand the role of business in society. Both principles and practices of management 

as an academic discipline as well as a profession are surveyed, examined, and reviewed. 

Students will acquire knowledge through the textbook, and the assigned reading 

material as well as the material accessible through the web and apply them to specific 

real world management phenomenon. The course focuses on the fundamentals of the 

practice of management, including administrative, organizational and behavioural 

theories. It explores the functions of management and the aspects of the organizational 

environment. 

Objectives 

 

 

 

 

 

to understand the roles and functions of managers at various (entry, middle and 

the top) levels 

to explain the relationships between organizational mission, goals, and objectives 

to comprehend the significance and necessity of managing stakeholders 

to conceptualize how internal and external environment shape organizations and 

their responses 

to demonstrate empirical understanding of various organizational processes and 



behaviours and the theories associated with them 

to demonstrate critical thinking skills in identifying ethical, global, and diversity 

issues in planning, organizing, controlling and leading functions of management 

to understand organizational design and structural issues 


1. Historical Perspectives of Management 

The behavioural approach to management 

The management science approach 

The contingency approach 

The system approach 

2. Principles of Planning 

Defining planning 

Purposes of planning 

Advantages and potential disadvantages of planning 

Management by objectives 

Planning tools 

Strategic planning 

Forecasting and budgeting 

3. The Management Task 

The Role of management 

Defining management 

The management process, management functions 

Management goal attainment 

Management and organizational resources 

4. Fundamentals of Organizing 

The definition of organizing 

The organizing process 

The organizing subsystem 

Classical organizing theory 

5. Leadership and Effective Communication 

Defining leadership; leader vs. manager 

Leadership behaviours 

Transformational Leadership 

Coaching 

Entrepreneurial leadership 

6. Controlling for Productivity 

Defining production and productivity 

Quality and productivity 

Operations management 

Operations control 

Using control tools to control organizations 

7. Managerial Ethics and Social Responsibility 

Fundamentals of social responsibility 

Areas of corporate social responsibility 

Social responsiveness and decision making 

Influencing individuals performing social responsibility activities 

A definition of ethics 



Creating an ethical workplace 

8. Making Good Business Decisions 

Types of decisions 

Elements of the decision situation 

The decision making process 

Decision making conditions 

Decision making tools 

Processes for making group decisions 


On completion of this course the students should be able to: 

Describe the functions of management. 

Outline the historical theories relating to modern management. 

Explain the role of management within a business setting. 

Outline managerial decision making. 

Identify the steps of problem solving and decision making in organizations 

Apply knowledge of managerial practices to case studies 

Recognize challenges in the achievement of good managerial performance 

Describe human resource planning and staffing processes needed to achieve 

optimal performance 

Prepare a business forecast and budget 

Illustrate how business ethics and social responsibility apply to organizations 

Define change and tress in organizations and prepare a plan to implement 

changes using case studies 

Describe formal and informal organizational communication processes and how 

to influence employees. 


[1] Charles W. L. Hill and Steven McShane (2006) Principles of Management. 

McGraw-Hill/Irwin; 1 st Edition. ISBN-10: 0073530123, ISBN-13: 978- 

0073530123 

[2] Gary Dessler(2003). Management: Principles and Practices for Tomorrow's 

Leaders, Prentice Hall; 3 rd Edition. ISBN-10: 0131009923, ISBN-13: 978- 

0131009929 

[3] Ellen A. Benowitz(2001). Principles of Management. Cliffs Notes. ISBN-10: 

076456384X, ISBN-13: 978-0764563843 

CMP4103: Computer Systems and Network Security 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


30 30 00 45 100 60 40 3 

Rationale 

With the multiplication of tasks that are performed on computers and the advent of 

globalization of computing in general, the topic of computer security becomes more 

and more important. We see in this course what is computer security, especially as it 

relates to the protection of information stored on the computers and exchanged 

between computers The Computer Engineering student will be equipped with 



knowledge and skills in advanced cryptography, access control, distributed 

authentication, TCP/IP security, firewalls, IPSec, Virtual Private Networks, intrusion 

detection systems, and advanced topics such as wireless security, identity management. 

Objectives 

To familiarize the student with the concept of system security analysis 

To introduce access control methods and various security models 

To equip the student with skills of identification and authentication in the 

security domain 

To introduce the various security concerns associated with the most popular 

operating systems - UNIX and Windows 

To introduce the concept of communication security 

To equip the student with various cryptography systems 

To introduce the student to the security concerns applicable to the internet 

To introduce the student to the various e-commerce security protocols 


1. Overview of Computer Security 

Threats, risks, vulnerabilities, safeguards, attacks, exploits 

Information states 

Security at the various states of information: processing, storage and 

transmission 

Definition of security based on current state and reachable states 

Comprehensive model of security 

Confidentiality, integrity and availability 

Risk management, corrective action, risk assessment 

Physical security, including TEMPEST security 

2. Access Control 

Access control matrix 

Access control lists 

Capabilities 

Role-based access control 

Application dependence 

3. Security Policies 

Types of policies 

Role of trust 

Information states and procedures 

Types of access control 

Separation of duties 


Importance for automated information systems (AIS) 

Security planning 

4. Confidentiality Policies 

Goals and definitions 

Bell-LaPadula model 

Multi-level security 

5. Integrity Policies 

Goals and definitions 



Information states and procedures 

Operating system integrity 

Biba model 

Clark-Wilson model 

6. Hybrid Policies 

Chinese Wall model 

Role-Based Access Control 

7. Basic Cryptography: user's viewpoint 

Encryption : Classical cryptosystems, Public key cryptosystems 

Message digests and authentication codes 

Application to access control 

8. Key Management 

Key exchange 

Session and interchange keys 

Cryptographic key infrastructures 

Storing, revoking and destructing keys 

Digital signatures 

Application to access control 

9. Cipher Techniques 

Stream and block ciphers 

Block chaining 

10. Authentication 

Passwords 

Challenge-response 

Biometrics 

Location 

Combinations 

Application to access control/authorization 

11. Design Principles 

Least privilege 

Fail-safe defaults 

Economy of mechanism 

Complete mediation 

Open design 

Separation of privilege 

Least common mechanism 

Psychological acceptability 

12. Information Flow 

Information flow models and mechanisms 

Compiler-based and execution-based mechanisms 

Security policies on information flow 

Relevance of security policies to information security and operations security 

Interdependence between information security and operations security 

13. Confinement Problem 

Isolation 

Covert channels 

14. Assurance and Software Engineering 



Security aspects of the life cycle 

Software security mechanisms to protect information 

Assurance and trust 

Building trusted operating systems 

15. Evaluating Systems 

Historical perspective 

TCSEC 

Common criteria 

Rainbow series 

NSTISSAM COMPUSEC/1-99 

Security certification and accreditation of federal information systems 

16. Malicious Logic 

Trojan horses 

Computer viruses 

Computer worms 

Logic bombs 

Defenses and countermeasures 

17. Vulnerability Analysis 

Detailed description of threats, vulnerabilities and exploiting vulnerabilities 

18. Auditing 

Auditing mechanisms 

Auditing system design 

Privacy issues 

Trails and logs 

Access control issues 


19. Intrusion Detection 

Principles 

Models 

Architecture 

Organization 

Intrusion response 

20. Network Security 

Policy development 

Network organization 

Firewalls 

Availability 

Access control issues 

Attacks anticipation 

Traffic analysis 

Public vs private 

21. Program Security 

Requirements and policy 

Common security-related programming problems 

Object reuse and access control 

22. Virtual Machines 

Virtual machine structure 



Virtual machine monitor 

23. Security Administration and Training 

Basic notions related to security administration: accountability, accreditation, 

security architecture, assessments, assurance, availability, integrity, 

confidentiality, authentication, non-repudiation, certification, configuration 

control, resource custidian, defense, domains, system security principles, 

information operations, records management, sensitivity, zoning, aggregation, 

end systems, operating systems and organizational security procedures, 

security tools, open systems interconnect, due care, facility support systems, 

media, alarms, signals, reports, non-repudiation, violations, modes of 

operation. 

Security countermeasures - education, training and awareness 

Surveillance 

Assessment 

Roles of various organizational personnel 

Personnel security practices and procedures 

Purposes of awareness, training and education 

Training of administrators and managers 

Protection of assets 

Security accreditation 

Administrative policies 

Password management and policies 

Assessment preparation 

Legal aspects 

Agency specific security policies, points of contact and control 

Security planning 

Contingency planning, disaster recovery 

Configuration management 

24. Privacy in Databases 

Publications of aggregate data from sensitive statistical databases 

Inference 

Privacy aspects of data mining 



Describe the functioning of various types of malicious code, such as viruses, 

worms, trapdoors. 

 

 

 

 

 

 

 

Enumerate set programming techniques that enhance security. 

Explain the various controls available for protection against internet attacks, 

including authentication, integrity check, firewalls, and intruder detection 

systems. 

Describe the different ways of providing authentication of a user or program. 

Describe the mechanisms used to provide security in programs, operating 

systems, databases and networks. 

Describe the background, history and properties of widely-used encryption 

algorithms such as DES, AES, and RSA. 

Describe legal, privacy and ethical issues in computer security. 

List and explain the typical set of tasks required of a system security 

administrator. 



 

 

 

 

 

 

 

Compare different access control, file protection or authentication mechanisms. 

Set up file protections in a UNIX or Windows file system to achieve a given 

purpose. 

Incorporate encryption, integrity check and/or authentication into a given 

program or algorithm. 

Distinguish between steganography and watermarking as document modification 

methods. 

Appraise a given code fragment for vulnerabilities. 

Appraise a given protocol for security flaws. 

Design a security protocol for a given application. 

Formulate a security plan for a given scenario, including risk analysis, 

organizational security policies, and planning for physical security and natural 

disasters. 


[1] Matt Bishop, 2005, Introduction to Computer Security, Addison Wesley 

[2] William Stallings, 2003, Network Security Essentials, 2nd edition. Prentice 

Hall. ISBN: 0130351288 

[3] William Stallings, 2004, Data & Computer Communications, 7th Edition, 

Prentice Hall 

[4] Saadat Malik, 2002, Network Security Principles and Practices (CCIE 

Professional Development). Pearson Education. ISBN: 1587050250 

[5] Kaufman, Perlman, and Speciner, Network Security, 2 nd edition, ISBN: 

0130460192. 

[6] Ross Anderson's, 2001, Security Engineering, 2nd edition. Wiley, ISBN 

0470068523 

[7] Charles P. Pfleeger, Shari Lawrence Pfleeger, 2003, Security in Computing, 

McGraw-Hill 3rd edition, Prentice Hall. 

CMP4102: Instrumentation and Control Engineering 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

The computer is an electronic device whose design and manufacture utilizes a great deal of 

instrumentation and control engineering concepts. A student of computer engineering has to be 

exposed to the relevance of these fundamental concepts in the design of computer circuitry. 

Objectives 

This course aims at: 

 

Enabling student understand that control systems are a daily phenomena, that 

virtually everything needs feedback, that electronic or electromechanical systems 

most times include a feedback loop, either explicitly or implicitly. 



 

 

 

 

 

Giving the student knowledge of analog and digital control engineering concepts. 

This course aims to help the student with: 

Knowledge of procedures for measuring and improving the reliability of digital 

components within measuring systems. 

Knowledge of the formal standards governing instrument calibration procedures 

and measurement system performance. 

An introduction on the topic of sensors and their use within instrumentation 

systems. 

Knowledge of the principles and theory of measurement 


1. Review of Measurement Specification 

Standards, units- instrument types 

performance characteristics: static and dynamic characteristic 

2. Measuring system 

3. Analogue Instruments 

Moving coil, 

iron instruments 

4. Digital Instruments 

Multimeters 

data analysers 

signal synthesisers. 

5. Counters and timers 

6. Measuring Errors 

Random errors 

Systematic errors 

7. Transducers 

Measurement of displacement 

velocity and acceleration 

time and frequency 

light, 

temperature, volume, pressure, flow and force 

8. Analogue Data Processing 

The operational amplifier 

Characteristics 

Configurations 

9. Simulation of differential equations and transfer function 

10. Data Acquisition and Conversion 

Sampling theorem 

Quantisation 

Multiplexing 

filtering sample and hold 

Bridge Circuits 

11. Introduction to design of feedback systems 

Properties and advantages of feedback systems 

12. Time-Domain And Frequency-Domain Performance Measures 

13. Stability And Degree Of Stability 

14. Complex Plane Analysis 

Algebra 

Applications to Control Engineering 

15. Stability Criteria 



Routh’s Criterion 

Root locus method 

Nyquist criterion 

16. Bode Plots 

Introduction 

Frequency response analysis 

17. Unit Circle 

PID Compensator 

time response 

18. State Space Analysis 

Observability 

Controllability and the corresponding vectors 

19. Digital Control System 

z transforms 

Jury Test 


The student will: 

Be able to comfortably check for stability of any system using any criteria. 

Understand the concept of control system engineering, why it is carried out and will 

appreciate its application in digital control. 

Acquire knowledge of the type of measuring instruments and be able to appreciate 

why certain instruments are m ore favourable in a particular environment and 

requirement (accuracy or precision among others); 

Understand the types of errors that occur during measurement and how best they can 

be minimised during experimental setup. 

Acquire concepts on sensors and their use in design of automated systems. 

Recommended Books and References 

[1] William L. Brogan, Modern Control Theory, 2 nd ed., Prentice-Hall, 1985 

[2] Nise, N. S, Control Systems Engineering, 3rd ed., New York, NY: Wiley, 2000. 

[3] Allan S. Morris, Measurement and Instrumentation Principles, 3 rd ed., Butterworth 

Heinemann, 2001 

[4] K. Ogata, Discrete- Time Control Systems 

CMP4104: Digital Image and Video Processing 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


30 30 00 45 100 60 40 3 

Rationale 

This course covers fundamental theories and techniques for efficient representation, 

processing, and communication of digital images and video. It presents the main 

concepts, results, and techniques that are the foundations of current academic research 

and industry practice in digital image processing. 



Objectives 

To equip the student with techniques applied in digital image and video 

processing such as filtering, enhancement and motion estimation 

To impart the computer engineering student with skills necessary to select 

appropriate image and compression techniques to achieve a particular practical 

goal. 

To introduce to the student the protocols used for transmission and storage of digital 

images and video. 

To introduce to the students the inherent limitations imposed by contemporary 

hardware and software on the processing of digital image and video. 



Digital image representation 

Visual perception, 

Image sampling and quantization. 

Basics of digital video 

Digital video formats. 

2. Image Enhancement 

Noise reduction methods 

Contrast enhancement methods 

Edge sharpening methods 

3. Image Restoration 

Inverse filtering 

Least squares restoration 

Constrained least squares method 

Iterative methods 

Extrapolation and super resolution methods 

4. Image Compression 

Concept and techniques for entropy coding 

Scalar and vector quantization methods for image coding 

JPEG image compression standard 

Sub band/wavelet image compression 

lossless image compression 

5. Motion analysis: 

Real vs apparent motion 

Motion modeling, 

Spatial-temporal constraint methods (optical flow equation), 

Block-matching methods 

Mesh-based methods 

Global motion estimation 

Multi-resolution approach 

Motion segmentation 

6. Video compression: 

Information bounds for lossless and lossy source coding 

Transform coding, predictive coding 

Motion compensated coding 

Scalable video coding 



Multiview/stereo/mesh coding 

Video compression standards and Applications 

Video Watermarking 



Understand the basic information of Video and images 

Understand the various compression techniques and work with either raw or 

compressed data 

Understand the frequency components of image and video data 

Implement data compression techniques 

Work with Image or Video File formats 

Perform motion-compensated predictive coding of video using forward, 

backward, and bidirectional predictive methods. 

Select an appropriate encoding method for each macro block in a video 

sequence. 

Know basic features of prominent image and video compression standards. 


[1] Y. Wang, J. Osternmann, Y. Zhang , 2002, Video Processing & 

Communication, Prentice Hall, ISBN 0-13-017547-1 

[2] A. Murat Tekalp , 1995, Digital Video Processing , Prentice-Hall, ISBN 0-13- 

190075-7 

[3] F. Halsall, 2001, Multimedia Communications, Addison-Wesley, ISBN: 

0201398184 

[4] B. J. Sheu and M. Ismail, 1998, Multimedia Technology for Applications, 

IEEE Press, ISBN: 0780311744 

[5] M-T & Reibman ,2001, Compressed Video Over Networks, Marcel 

Dekker,New York. 

[6] David A. Forsyth and Jean Ponce , 2002, Computer Vision: A Modern 

Approach , Prentice Hall; US ed edition , ISBN-10: 0130851981 

[7] Rafael C. Gonzalez & Richard E. Woods , 2002, Digital Image Processing, 

Addison-Wesley, 2nd edition, ISBN: 0201180758. 

[8] Yun Q. Shi & Huifang, 2000, Image and Video Compression for Multimedia 

Engineering: Fundamentals, Algorithms, and Standards, Sun. CRC Press, 

ISBN: 0-8493-3491-8. 

[9] Anil K. Jain, 1989, Fundamentals of Digital Image Processing, Prentice Hall, 

ISBN: 0013-336165-9. Handbook of Image and Video Processing, Al Bovik 

Ed., 2nd Edition, Academic Press, 2005. 

[9] Al Bovik Ed., 2005, Handbook of Image and Video Processing, 2nd Edition, 

Academic Press, 

CMP4204: Wireless Technologies 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


30 30 00 45 100 60 40 3 

Rationale 

Interest in wireless technology is booming and wireless networks are enjoying very fast 



growth. This course introduces students to advanced network concepts with 

application to wireless technologies. They will be introduced to various the wireless 

and mobile network- technologies and protocols with an emphasis on their utilization 

in various real world computing and communications situations. 

Objectives 

To recap the OSI and the TCP/IP models and their application in computer 

networks 

To introduce to the student various wireless and mobile network- technologies 

and protocols with an emphasis on impact to various layers of the OSI stack. 

To introduce the students to the established and next generation wireless systems 

and introduce the scenarios where they compare and (possibly) complement each 

other. 

To sensitize the computer engineering student about the potential security 

concerns that arise when utilizing wireless systems and how to deal with them 


1. Introduction to Wireless Communications 

Major wireless technologies are used today 

Applications of wireless technology 

Pros and Cons of wireless technology 

Wireless techniques used to transmit data 

Spread spectrum Technology ( FHSS and DSSS) 

2. Radio communication systems and standards 

Factors affecting the design of radio system 

Antenna Systems 

Frequency allocation and modulation Techniques 

Telecommunications Standards 

Telecommunications standards organizations 

3. Communications Models 

Difference between the OSI communications model and IEEE 802 

communication standards. 

TCP Communication model 

4. Low- Speed Wireless Local Area Network 

Introduction to WLAN 

Components and modes of a WLAN 

WLAN and wireless media 

The MAC frame format. 

Function of an IEEE 802.11b Network 

Discuss Mobile IP 

Tell how IEEE 802.11a networks function, and how they differ from IEEE 

802.11b networks 

5. High Speed WLAN 

Mobile IP Technology 

IEEE 802.11a networks 

Difference between IEEE 802.11a and IEEE 802.11b networks 

Advantages and Disadvantages of an IEEE 802.11g networks. 

HiperLAN/2 networks. 

Low speed and high speed WLANs 

6. Personal Area Network (Bluetooth) 



Introduction to Bluetooth 

Bluetooth network topology 

Piconet 

Bluetooth device profiles 

7. Installing and securing an Adhoc network. 

Installing, configuring and securing Infrastructure network 

Creating Adhoc networks using IEEE 802.11a, b and g client cards. 

Security features used in Adhoc networks 

Installing and securing an Adhoc network. 

Steps for setting up Infrastructure WLAN 

Providing security in an enterprise environment. 

8. Wireless MANs. 

Cellular, Voice and Data Networks 

Cellular networks 

Functioning of AMPs CDPD, GSM GPRS and CDMA based systems. 

9. Wireless WAN 

Wireless Internet 

WAP and its use in wireless internet. 

Introduction to WML 

Brief introduction to J2ME 



Understand different types of wireless local area network (WLAN) technologies. 

Understand the significance that specific layers the TCP/IP protocol have in 

wireless communications. 

Identify the different types of wireless communications protocols contained in 

the IEEE 802.11 WLAN standard. 

Identify the most critical antenna design parameters and understand their impact 

in wireless communications. 

Understand radio frequency (RF) propagation. 

Understand spread spectrum technology. 

Demonstrate the ability to design and implement a wireless data collection 

system. 

Demonstrate the ability to communicate and document technical information in a 

professional, structured, timely, and effective manner. 


[1] William Stallings, 2005, Wireless Communications and Networks, 2nd Edition, 

Pearson Prentice Hall 

[2] Jorge Olenewa, Mark Ciampa, Wireless# Guide to Wireless Communications, 

2 nd Edition, Thompson Course Technology. ISBN-13 978-1-4188-3699-3 

[3] William Stallings, 2004, Data & Computer Communications, 7th Edition, 

Prentice Hall 

[4] William C. Lee, 2005, Wireless and Cellular Telecommunications, 3rd edition, 

McGraw Hill 

[5] Fred Halsall, 2005, Computer Networking and the Internet, Addison Wesley 

[6] T.S. Rappaport, 2002, Wireless Communications: Principles & Practice, 2 nd 

Edition, Prentice Hall 

[7] W.C.Y. Lee, 1998, Mobile Communication Engineering, Theory and 



Applications", 2 nd Edition, McGraw-Hill 

[8] Fred Halsall, 2001, Multimedia Communications, Applications, Networks, 

Protocols and Standards, Addison Wesley 

CMP4205: Audio and Speech Signal Processing 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


30 30 00 45 100 60 40 3 

Rationale 

Speech processing has been one of the main application areas of digital signal 

processing for several decades now, and as new technologies like voice over IP, 

automated call centers, voice browsing and biometrics find commercial markets, 

speech seems set to drive a range of new digital signal processing techniques for some 

time to come. This course provides not only the technical details of ubiquitous 

techniques like linear predictive coding, Mel frequency cepstral coefficients, Gaussian 

mixture models and hidden Markov models, but the rationale behind their application 

to speech and an understanding of speech as a signal. 

Objectives 

To provide students with the knowledge of basic characteristics of speech signal 

in relation to production and hearing of speech by humans. 

To describe basic algorithms of speech analysis common to many applications. 

To give an overview of applications (recognition, synthesis, coding) and to 

inform about practical aspects of speech algorithms implementation. 

To give the student practical experience with the implementation of several 

components of speech processing systems. 


1. Introduction to Digital processing of speech signals 

Recording; sampling, quantization 

Speech spectra; continuous 

Fourier transform; what do we get when we sample 

Random signals, power spectral density 

Modification of speech ; linear filters 

Frequency response of a filter 

2. Pre-processing of speech: 

Dc removal, preemphasis, frames, basic parameters. 

Spectrogram. 

Speech production; articulatory organs - vocal cords and vocal tract vs. 

excitation and filter. 

Characteristics in time and frequency, 

Influence of excitation and filter 

What can be seen on long- and short-term spectrograms. 

How to separate excitation and filter; cepstrum, MFCC. 

3. Linear-predictive model: 



Separation of vocal tract characteristics from excitation - applications in 

coding and recognition 

Prediction of a sample from past samples - linear prediction (LP) 

Error of LP; Obtaining the error using a single filter 

Determination of vocal tract characteristics using LP analysis 

Spectrum estimated by LP 

Features derived from LP - LAR and LSF 

LPC-cepstrum 

4. Determination of fundamental frequency (F0) 

Terminology 

Characteristics of F0 for males, females and children 

Use in speech processing systems 

Methods based on autocorrelation function 

NCCF. Long-term predictor and cepstral analysis for F0 determination 

Reliability and problems of F0 detectors 

5. Coding I: 

Aims of coding 

Bit-rate, objective and subjective measurements of quality 

Classification of coders according to bit-rate 

Waveform coders. 

Vocoders - LPC. 

Vector quantization in speech coding 

6. Coding II. 

CELP, Coding in GSM networks: GSM, GSM-EFR, GSM-HR, Voice over 

IP 

Introduction to speech recognition - the task, classification of recognizers: 

isolated words - connected words - continuous speech, speaker dependent - 

speaker independent. 

Basic function blocks. 

Voice activity detection (VAD) for isolated words. 

7. Recognition using DTW. 

Recognition based on distance of speech frames - various definitions of 

distance. \ 

Timing: linear modification, dynamic programming (Dynamic Time Warping 

DTW). 

8. Hidden Markov models (HMM I.): 

Introduction, motivations and relation to DTW 

Structure of the model 

Gaussian distributions 

State sequences 

Probability of a sequence of states, Baum-Welch and Viterbi probabilities 

Training of models: Baum-Welch, recognition: Viterbi 

Token passing 

Connected words 

Continuous speech with large vocabulary: recognition of small units - 

phonemes 

Phonetics: vowels and consonants, characteristics, classification of phonemes 



International phoneme alphabets: IPA, SAMPA, TIMIT 

Co-articulation 

Applications in recognition: context-dependent triphones 

Large vocabulary, Language modeling, lattice rescoring, forced alignment 

9. Features for recognition 

Suppression of pitch, de-correlation, link with spectral envelope 

LPCC, MFCC, de-correlation: PCA, LDA, HLDA, channel robustness: 

normalization. - delta, delta-delta 

TRAPs a FeatureNet, neural nets 

Tools for speech processing 

10. Speech synthesis 

Structure of the synthesizer 

Conversion of written text to speech: text-to-speech 

Text normalization 

Prosody (melody, accents, timing) in synthesis 

Units for synthesis - manual and automatic selection, corpus-based synthesis 

Generation of signal in time and frequency domains: PSOLA and HNM. 

Applications, SW for synthesis: EPOS, MBROLA, Festival 

11. Further topics in speech processing 

Speaker identification/verification (principles, false acceptation, false rejection, 

cost function, optimal operation point, EER) 

 

 

 

 

 

 

Phoneme recognition 

LVCSR 

Recognizer merging 

Very Low Bit Rate coding 

audio-video recognition 

Speech databases 



Describe the key aspects of typical speech signals 

Express the speech signal in terms of its time domain and frequency domain 

representations and the different ways in which it can be modelled; 

Derive expressions for simple features used in speech classification applications; 

Explain the operation of example algorithms covered in lectures, and discuss the 

effects of varying parameter values within these; 

Synthesize block diagrams for speech applications, explain the purpose of the 

various blocks, and describe in detail algorithms that could be used to implement 

them; 

Implement selected components of speech processing systems, including speech 

recognition and speaker recognition, using a modeling software package 

Deduce the behavior of previously unseen speech processing systems and 

hypothesize about their merits. 




[1] Deller, J. R., Proakis, J. G. and Hansen, J. H. L, 1993, Discrete-Time 

Processing of Speech Signals, Macmillan, Toronto 

[2] Quatieri, T. F, 2002, Discrete-Time Speech Signal Processing, Prentice-Hall, 

New Jersey 

[3] O’Shaughnessy, D, 1987, Speech Communication: Human and Machine, 

Addison-Wesley, Reading, MA 

[4] Rabiner, L. R., and Juang, B.-H, 1993, Fundamentals of Speech Recognition, 

Prentice-Hall, New Jersey. 

[5] Rabiner, L. R., and Schafer, R. W, 1978, Digital processing of speech signals, 

Prentice-Hall, New Jersey 

[6] Huang, A. Acero, H. Hon, and R. Reddy, 2001, Spoken Language 

Processing: A Guide to Theory, Algorithm and System Development, Prentice- 

Hall 

CMP4201: Research Project 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


00 120 30 60 100 60 40 4 

Rationale 

This course involves the execution of a project oriented toward providing experience 

in establishment of objectives and criteria, synthesis, analysis, construction, testing, and 

evaluation; development of student creativity through the solution of open-ended 

problems; instruction in design methodology. The student(s) undertake the project 

proposed in TEC4101 Research Methods, which involves addressing a significant 

technical problem they embark on this under the guidance of a supervisor; student are 

expected to demonstrate an ability to apply the disciplined approaches of the course in 

addressing the solution to the problem; students produce a final thesis on the work and 

this together with a demonstration of the working system will form the assessment. 


On approval of the proposal developed in TEC4101 Research Methods, the student(s) 

proceeds with data collection, analysis, design and implementation during this 

semester. All work done is compiled into a report which reflects the capacity of the 

student to apply theoretical and practical knowledge in Computer Engineering. The 

student shall hand submit this dissertation which should represent original work in 

order to sit for the final written examinations. Each candidate shall also present the 

report orally to a panel of Examiners. A student who has made satisfactory progress in 

the project work but needs more time to complete the project shall be allowed a 

maximum of one month after the end of second semester of the final year within which 

to complete. Any student who fails to complete the project within the added one 

month shall be deemed a failure and will therefore start afresh on a new project when 

next offered. 


On completion of this course the student should be able to draw upon knowledge 

gained from all courses in the Computer Engineering Programme to: 

 

 

Organize and bring to fruition a major individual or team research project 

Sustain a self-disciplined and concerted effort on a single project over an 



 

 

extended period of time, the completion of which requires the meeting of 

multiple deadlines and fruitful interaction with supervisors, resource personnel, 

and fellow students 

Improve upon abilities to access, evaluate and synthesize information from 

primary literature and other credible relevant sources 

Improve upon oral and written communication skills 

TEC4201: Entrepreneurship 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


60 00 00 60 100 60 40 4 

Rationale 

Entrepreneurship is a specialized business course designed to provide students the 

skills needed to effectively organize, develop, create, and manage their own business. 

This course is based upon the Marketing Education Framework which includes 

business, management, and entrepreneurship; communication and interpersonal skills; 

economics; and professional development foundations. Emphasis is placed on the 

functions of marketing: distribution, financing, marketing information management, 

pricing, product/service management, promotion, and selling. Additional topics to be 

addressed are assessment of personal skills, the components of the free enterprise 

system and its place in our global economy, human relations and interpersonal skills, 

the importance of business ethics, and the role quality and service play in business. 

Students will develop a written business plan for a business of their choice. 

Objectives 

Increasingly, small 'start-up' firms are having a significant impact on cross-border 

commerce. Reflecting this development, this course has he following objectives. 

To help students understand the particular challenges of entrepreneurial action in 

international context. 

To provide an educational vehicle for developing a draft international business 

plan for future use in seeking venture capital and other support. 

To familiarization with all the classical elements of a Business Plan and 

development of skill in understanding the factors that venture capitalists look 

for in evaluating such plans. 

Students critically analyze entrepreneurial ventures from history and field’s 

literature to identify causal factors in success or failure of such ventures. 

To identify the distinctive bases of sustainable competitive advantage that are 

essential to the success of an entrepreneurial firm, never more crucially than in 

international context. 


1. Entrepreneurship Defined 

Venture, venture capitalist, and adventure 

Goal setting/planning 

Risk taking/resource management 

The role demands of business 



Reasons for failure (internal and external limits) 

2. Variety in Entrepreneurship 

The concept of "change agent" and "intrapreneurship" 

A manager verses an entrepreneur 

Adv. and disadvantages of working for self versus others 

Social ventures 

The profit motive versus living a dream 

3. Characteristics Successful Entrepreneurs Share 

Growth of women entrepreneurs 

Factors most and least important to entrepreneurs 

Surveys: Are you an entrepreneur 

4. Entrepreneurial Skills 

Seven steps to a successful venture 

Trying a venture 

Finding a mentor 

5. Innovation: 

The challenge of innovation and how to encourage it 

Student Project 

6. Identifying and Assessing Opportunity 

Profiling Entrepreneurs 

Market research 


7. You - the Idea Machine 

Examining the creative process 

Idea generation 

Left and Right brain thinkers 


8. Planning Your Venture 

Goal setting - vision 

Financial planning - costs, break-even, statements 

Market Strategy - target market, surveys, advertising 

9. Business Plan Generation 

The Major Course Project 


Upon completion of this course, a student should be able to: 

Identify and the describe the major steps and requirements for starting a smallscale 

business 

Develop a business plan 

Explain the role of finance and financial management in the health of a business 

Appreciate the levels and impact of risk and risk taking in a business 

Describe strategies for nurturing or growing a business 


[1] Peter F. Drucker(2006). Innovation and Entrepreneurship. Collins Business. 

ISBN-10: 0060851139, ISBN-13: 978-0060851132 

[2] Bruce Barringer and Duane Ireland (2007). Entrepreneurship: Successfully 

Launching New Ventures. Prentice Hall; 2 nd Edition. ISBN-10: 0132240572, 

ISBN-13: 978-0132240574 

[3] Robert Hisrich, Michael Peters and Dean Shepherd, (2006). Entrepreneurship. 



McGraw-Hill/Irwin; 7 th Edition. ISBN-10: 0073210560, ISBN-13: 978- 

0073210568 

CMP4202: VLSI Systems Design 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


45 30 00 60 100 60 40 4 

Rationale 

The design of the integrated circuits used to implement computers and associated hardware 

contains some core material. This core includes basic properties of materials, the structure of 

inverters, combinational and sequential logic structures, and memories and logic arrays. This is 

a very broad area and it is expected that there will be a great deal of variation between 

programs in the coverage of topics outside the core. 



Indicate some reasons for studying VLSI and ASIC design 

Highlight some people that influenced or contributed to the area of VLSI and ASIC 

design 

Indicate some important topic areas such as MOS transistors, inverter structure, 

circuit performance, combinational and sequential circuits, memory and array 

structures, chip I/O design, and application-specific integrated circuits 

Describe a transistor and relate it to a semiconductor 

Indicate the characteristics of a MOS transistor 

Describe CMOS transistors and contrast them with MOS technologies 

Describe some sequential logic circuits such as latches and clock distribution 

Describe the structure of memory design 

Contrast memory structures with array structures 

Contrast the advantages of SRAM and DRAM memory devices 

Describe at which point a circuit becomes a chip 

Provide some examples of application-specific integrated circuits 

Explore some additional resources associated with VLSI and ASIC design 

Explain the purpose and role of VLSI and ASIC design in computer engineering 

2. Electronic Properties Of Materials 

Solid-state materials 

Electronics and holes 

Doping, acceptors and donors 

p- and n-type material 

Conductivity and resistivity 

Drift and diffusion currents, mobility and diffusion 

3. Function Of The Basic Inverter Structure 

Connectivity, layout, and basic functionality of a CMOS inverter 

The CMOS inverter voltage transfer characteristic (VTC) 

Analysis of the CMOS VTC for switching threshold, V OH , V OL , V IH , V IL , and noise 

margins 

Effect of changing the inverter configuration on the CMOS VTC 

Connectivity and basic functionality of a Bipolar ECL inverter 



Connectivity and basic functionality of a Bipolar TTL inverter 

4. Combinational Logic structures 

Basic CMOS gate design 

Layout techniques for combinational logic structures 

Transistor sizing for complex CMOS logic devices 

Transmission gates 

Architectural building blocks (multiplexers, decoders, adders, counters, multipliers) 

5. Sequential Logic Structures 

Storage mechanisms in CMOS logic 

Dynamic latch circuits 

Static latch and flip-flop circuits 

Sequential circuit design 

Single and multiphase clocking 

Clock distribution, clock skew 

6. Semiconductor memories and logic arrays 

Latches 

Flip-flops 

Dynamic read-write memory (DRAM) circuits 

Static read-write memory (SRAM) circuits 

Memory system organization 

Read-only memory circuits 

EPROM/EEPROM/Flash memory circuits 

Programmable Logic Array (PLA) circuits 

FPGA and related devices 

Sense amplifiers 

7. Chip input/output circuits 

General I/O pad issues 

Bonding pads 

ESD Protection circuits 

Input, Output, Bidirectional, and analog pads 

VDD and VSS pads 


Identify some contributors to VLSI and ASIC design and relate their achievements to 

the knowledge area. 

Define a semiconductor. 

Explain the difference between MOS and CMOS transistors. 

Define a sequential circuit. 

Identify some memory devices related to VLSI circuits. 

Define the meaning of a chip. 

Give an example of an ASIC chip design. 

Describe how computer engineering uses or benefits from VLSI and ASIC design. 

Understand the current carrying mechanism and the I/V characteristics of intrinsic 

and doped semiconductor materials. 

Understand how these quantities reflect the ability of the inverter to operate in the 

presence of noise. 

Understand how changing the configuration of the inverter and the MOSFETS that 

make it up changes the VTC and thus the inverter’s operation. 

Understand the method to perform circuit design for CMOS logic gates. 

Understand the techniques, such as Euler paths and stick diagrams, used to optimize 

the layout of CMOS logic circuits. 



Understand how the size for each transistor in a CMOS logic gate can be determined. 

Understand how to use charge storage (capacitance) and feedback to store values in 

CMOS logic. 

Understand the circuit design, functionality, advantages, and disadvantages of 

dynamic latches in CMOS. 

Understand how we organize memory systems and why we do not typically organize 

them in the most simplistic arrangement such as in a one-dimensional word array. 

Understand the basic steps of photolithography, its limitations, and how that 

determines minimum line width and device sizes. 

Understand the processing steps required for fabrication of CMOS devises and the 

general results of each step. 

Recommended Books and References 

[1] David A. Hodges, Horace G. Jackson, and Resve A. Saleh, Analysis and 

Design of Digital Integrated Circuits, Third Edition, , McGraw-Hill, 2004. 

[2] Jan M. Rabaey, Anantha P. Chandrakasan, and Borivoje Nikolic, Digital 

Integrated Circuits, Second Edition, Prentice-Hall, 2002. 

[3] Neil H. E. Weste and Kamran Eshraghian, Principles of CMOS VLSI Design, 

Second Edition, Addison Wesley, 1993. 

[4] Neil H. E. Weste and David Harris, Principles of CMOS VLSI Design, Third 

Edition, Addison Wesley, 2004. 

[5] Sung-Mo (Steve) Kang and Yusuf Leblebici CMOS Digital Integrated Circuits 

Analysis and Design, Third Edition, , McGraw-Hill, 2002. 

[6] David A. Johns and Ken Martin, Analog Integrated Circuit Design, Wiley, 

1997. 

[7] Roubik Gregorian, Introduction to CMOS Op-Amps and Comparators, Wiley, 

1999. 

[8] R. Jacob Baker,CMOS: Circuit Design, Layout, and Simulation, Revised 

Second Edition, Wiley-IEEE Press, 2008. 

[9] R. Jacob Baker, CMOS Mixed-Signal Circuit Design, Second EditionWiley- 

IEEE Press, 2009. 

[10] Adel S. Sedra, Kenneth C. Smith, Microelectronic Circuits, Fifth Edition, 

Oxford University Press, 2003. 

[11] R. L. Geiger, P. E. Allen, and N. R. Strader, VLSI Design Techniques for 

Analog and Digital Circuits, McGraw-Hill, 1990. 

[12] John P. Uyemura, Brooks/Cole, Physical Design of CMOS Integrated Circuits 

Using L-Edit, 1995. 

[13] Clein, Newnes, CMOS IC Layout, Dan, 2000. 

[14] Ron Kielkowski, Inside SPICE: Overcoming the Obstacles of Circuit 

Simulation, Second Edition, McGraw-Hill, Inc., 1998. ISBN 0-07-913712-1 

[15] Daniel Foty, MOSFET Modeling with SPICE, Prentice Hall, 1997. 

[16] Yannis P. Tsividis, Operation and Modeling of the MOS Transistor, McGraw- 

Hill, 1987. 

[17] Ben Streetman, Sanyay Banerjee, Solid State Electronic Devices, Fifth Edition, 

Prentice Hall, 2000. 

[18] James D. Plummer, Michael D. Deal, Peter B. Griffin, Silicon VLSI 

Technology, Prentice Hall, 2000. 



CMP4203: Lasers and Photonics 

Period per 

Week 

Contact 

Hour per 

Semester 

Weighted 

Total Mark 

Weighted 

Exam Mark 

Weighted 

Continuous 

Assessment 

Mark 

Credit 

Units 


30 30 00 45 100 60 40 3 

Rationale 

The content is designed to provide the foundations with which the operation of laser devices 

may be 

understood at the mechanistic level. Together with skills acquired in related courses in the 

Computer Engineering degree program, this provides the student with the skill base to approach 

the next level of accomplishment, namely where they may be required to design and construct a 

laser-based device in a professional situation. 

Objectives 

The design, construction and application of laser systems of various types is of considerable 

significance in modern technology. This course undertakes the development of a working 

understanding of the principles and properties of lasers and gives an introduction to photonics 

which involves the control of light. 


1. Historical Development Of The Laser 

Evolution from Masers 

Gordon Gould and Prokhorov’s contributions 

2. Atomic Theory Pertaining to Laser Development 

Review of atomic theory 

Radiation and Infrared frequencies. 

Wavelength bands 

Gases in lasers. 

Solid state lasers 

3. Interaction of Light with Matter 

4. Optimal Mirror Cavities 

5. Three and Four Level Lasers 

6. Types of Lasers 

Molecular lasers 

Semiconductor lasers 

Gas lasers 

Chemical lasers 

Excimer lasers 

Solid-state lasers 

Fiber-hosted lasers 

Ruby, Nd:YAG, He-Ne Lasers 

7. Introduction To Optical Fibres 

History 

Optical fiber communication 

Fiber optic sensors 

Principle of operation 

Mechanisms of attenuation 

Manufacturing 

8. Q-Switching And Mode Locking 

Population Inversion 



Average power of the laser 

High peak powers 

Modelocked laser 

Non-linearity in optical materials 

9. Non-Linear Optical Processes 

Types and Differences 

Hamonic Generation 

Advantage over linear processes 


[1] Saleh, B. E. A., and M. C. Teich, Fundamentals of Photonics, New York, NY: 

Wiley, 1991. ISBN: 9780471839651. 

[2] J. Goodman, Introduction to Fourier Optics (2nd edition), McGraw-Hill, 1996 

[3] A Ghatak and K Thyagarajan, An Introduction to Fibre Optics, Cambridge 

University Press, 1998 

[4] W. J. Smith, Modern Lens Design, McGraw-Hill, 1993 

[5] K. T. V. Gratten and B T Meggitt, Optical Fibre Sensor Technology: 

Applications and Systems, Kluwer Academic Publishers, 1999 

[6] K. Barnham and D. D. Vvedensky, Low-Dimensional semiconductor 

structures, Cambridge University Press, 2001 

[7] P. S. Zory, Quantum Well Lasers (Quantum Electronics: Principles and 

Applications) Academic Press, 1993 

[8] O. Svelto, Principles of Lasers (4th edition), Plenum Press, 1998 

[9] L. A. Coldren and S. W. Corzine, Diode Lasers and Photonic Integrated 

Circuits, Wiley – Interscience, 1995 

[10] B. G. Streetman and S. Banerjee, Solid State Electronic Devices (5th Edition) 

Prentice-Hall 1999 

[11] R. W. Boyd, Nonlinear Optics, Academic Press, 1991 

[12] M. Born and E. Wolf, Principles of Optics: Electromagnetic Theory of 

Propagation, Interference and Diffraction of Light, Cambridge University 

Press, 1999 

[13] W. T. Welford, Geometrical Optics, North-Holland Press, 1962 

[14] J. M. Senior, Optical Fiber Communications, Principles and Practice, 

Prentice-Hall International 1985 

[15] W. T. Welford, Aberrations of Optical Systems (2nd edition), Adam Hilger, 

1991 

[16] H. A. Macleod, Thin Film Optical Filters (2nd edition), Adam Hilger, 1986 

[17] P. Hariharan, Basics of Interferometry, Academic Press, 1992 



ANNEX I: 

A. Personnel 

RESOURCES 

No. Name Highest Position Dept./ Faculty Specialisation 

1 S. S. Tickodri-Togboa Quali- PhD Assoc. Prof. Full-Time Telecommunications Engineering, 

Engineering Mathematics, ICT. 

2 E. Lugujjo PhD Assoc. Prof. Full-Time Electrical Engineering, Engineering 

Mathematics 

J. Byaruhanga PhD Assoc. Prof. Full-Time Maintenance Engineering 

3 M. K Musaazi PhD Senior. Lecturer Full-Time Electrical Engineering, Engineering 

Mathematics 

4 A Gidudu PhD Lecturer Full-Time GIS, ICT and Surveying 

6 S.B.Kucel PhD Lecturer Full-Time Mechanical Engineering, Energy 

Engineering, ICT 

7 Ms. D. Okello PhD Lecturer Full-Time Computer Engineering 

8 L.L. Kaluuba MSc Senior Lecturer Full-Time Computer Engineering 

9 M. Musinguzi PhD Lecturer Full-Time Geographic Information Systems, ICT 

Incubation 

10 P. Lating-Okidi PhD Lecturer Full- Time Mechanical Engineering, ICT 

Incubation 

11 Julius Butime PhD Lecturer Full-Time Electrical Engineering, 

Telecommunications, ICT 

12 D. Nsubuga Mubiru MSc Lecturer Full-Time Telecommunications, Electronics 

13 S. Sendegeya MSc Lecturer Full-Time Telecommunications, Electrical 

Engineering 

14 Charles Otine M.Sc. Assist. Lecturer Full-Time Software Engineering, Web 

Development 

15 P. Musasizi M.Sc. Assist. Lecturer Full-Time Mechanical Engineering, Systems 

Engineering 

16 Dominic Ssemukutu BSc Teaching Assistant Full-Time Mechanical Engineering, 

Managements 

17 Albert Lumu BSc. Lecturer Part- Time Electrical Engineering, Software 

Engineering 

18 Andrew Katumba BSc. Teaching Assistant Full-Time Electrical Engineering, Software 

Engineering 

19 David Wakyiku BSc. Teaching Assistant Full-Time Electrical Engineering, Computer 

Programming 

20 Mwikirize Cosmas BSc. Teaching Assistant Full-Time Electrical Engineering, Software 

Engineering 

21 Asiimwe Arthur 

Tumusiime 

BSc. Teaching Assistant Full-Time Electrical Engineering, Software 

Engineering 



B. Equipment and Facilities 

The following equipment and facilities are available and will be provided by the Faculty: 

 

 

 

 

 

 

Telecommunications and Electronics Labs, 

ICT labs for undergraduates and graduates (with a total of over 150 computers connected to the 

internet through Fibre-Optics network system (backbone) and hence ensuring faculty-wide 

Internet connectivity). 

Text books, 

Transport facilities for field visits and Industrial training, 

Faculty library, 

Lecture rooms. 

N.B.: Owing to the characteristically hands-on-nature of the Programme, students will be very 

much encouraged to acquire personal lap-top computers. Furthermore, because of the high 

rate of turn-out of literature in this area and the rather long time the process of acquiring 

literature through the University Library Book-bank system often takes, students will be 

advised to adopt intensive usage of internet resources. Occasionally this will require them to 

purchase some of the most current publications that will emerge during their Course as 

additional text-books. 

ANNEX II 

COSTING 

PROGRAMME COSTING BSC (COMPUTER ENGINEERING) 

A. SUMMARY 

EXPECTED INCOME 

I 

Tuition Fees 

Total Admission Number 140 

Number of Government-sponsored Students under DAY Programme 35 

Number of Privately-sponsored Students under DAY Programme 35 

Number of Privately-sponsored Students under EVENING Programme 70 

Total Number of Privately-sponsored Students under both Programmes 105 

Number of Semesters 2 

Amount Payable per Privately-sponsored Student per Semester 1,250,000/= 

Total Amount per Semester 131,250,000/= 

Total Amount per Year 262,500,000/= 

II 

DISTRIBUTION 

Faculty (35%) 91,875,000/= 

Central Activities (65%) 170,625,000/= 

Total 262,500,000/= 



B 

DETAILS OF PROGRAMME COSTING 

INCOME 

Faculty allocation 91,875,000/= 

EXPENDITURE 

I Teaching Expenses 

Lecture/tutorials/practical hours @50,000 x 1200 CH 60,000,000 /= 

II Administrative Activities 

Faculty Activities (Administration/Cleaning, Furniture, etc.) 31,875,000/= 

III Teaching Materials 

Item Quantity Amount(UGX) 

Field Trips Item 2,747,000 

Equipment and Computer Accessories Item 21,983,000 

Laboratory Costs Item 5,496,000 

Contingencies (Photocopying, Item 

Meetings, etc.) 

1,649,000

MAKERERE UNIVERSITY - Office of the Academic Registrar ...

Create successful ePaper yourself

Delete template?

Save as template?