Академический Документы
Профессиональный Документы
Культура Документы
Lecturer Information:
Name: Ms Aili Shigwedha
Email: ashigwedha@nust.na
Office phone: (061) 207 2664
Office location: F26, Engineering Building
Office hours: 07h30 – 16h30
Consultation hours: Mon (11h30-12h30), Tue (07h30-08h30), or by appointment only
This course aims at equipping the student with fundamental knowledge of and insight in
developing, analysing, and implementing common engineering solution algorithms. The course
introduces basic data types, control structures, functions, and object-oriented programming
techniques, including coding, debugging, testing and execution of applications using any modern
high-level programming language. The course will thus enable the student to acquire sound
knowledge of basic computer programming concepts.
2. COURSE DATA
Self-Study Hours: 40
NQF Level: 6
NQF Credits: 12
Professional Role:
After successfully completing this course, the student should be able to demonstrate competence
in designing, analysing, and implementing basic algorithms using high-level programming
languages to solve engineering problems.
Knowledge Areas:
Classification of Knowledge Basic Complimentary Computing & Engineering Engineering Mathematical
Areas Sciences Studies Information Design & Sciences Sciences
(Weighted by Percentage) Technologies Synthesis
50% 10% 10% 30%
Assessment Summary:
Diversified Continuous Evaluation Components Assessment component Individual Total
Weight (%) Weights (%)
A minimum of three (3) Examinations Examinations 20 60
A minimum of one (1) group Mini-Projects Mini-Projects vary 20
A minimum of two (2) Labs/Tutorials/Assignments Labs/Tutorials/Assignments vary 20
2
Learning Outcomes:
After successfully completion of this course, the student should be able to:
Apply program design techniques to develop solution algorithms.
Design and specify algorithms in pseudocode and/or flowchart syntax.
Analyse the effectiveness of simple solution algorithms and programs.
Convert computational problems into a series of easily managed steps.
Use a modern high-level programming language as a medium for the development of
software solutions to solve engineering and mathematical problems.
Understand and apply fundamental object-oriented concepts.
Process numerical data, and perform input and output operations on the data using industry
standard computational software.
Course Contents:
This offering will cover the following topics in depth:
Introduction to Programming
Introduction to Algorithm Development and Analysis
Introduction to Programming Fundamentals using Python programming language
Introduction to basic Object-Oriented Concepts
Introduction to basic numerical computation using MATLAB
3. CONTENT OUTCOMES
3
3.4. Object Oriented Programming Concepts
3.4.1 Discuss object-oriented programming (OOP) model
3.4.2 Introduce the concepts of objects, classes, and methods
3.4.3 Discuss constructors and constructor overloading concepts
3.4.4 Discuss methods and method overloading concepts
3.4.5 Explain the concept of encapsulation and inheritance
4. LEARNING STRATEGY
This course shall be presented as a series of lectures, laboratory work, tutorials, quizzes, as well
as class and group exercises/mini-projects. Use will be made throughout of notes, power-point
presentations, and the prescribed textbook, and practical components to illustrate theoretical
concepts.The main approach will be for the student to obtain theoretical knowledge and investigate
the practical applications of these concepts.
4.1. Lectures: During lectures, the lecturer presents the theoretical concepts of the course to the
students.
4.2. Tutorials and Quizzes: During tutorials or quiz session, the students under the guidance of
the lecturer/tutor practice the application of the theory presented in lectures to clarify areas of
weakness and deepen the use of analysis tools to be applied in the assignments and
exercises.
5. COURSE ASSESSMENT
The assessment strategy in this course is based on the ‘continuous and diversified
assessment’ system of evaluation. The following assessment categories are scheduled:
4
5.1. Examinations:
The first examination covers all the work completed since the start of the semester and
the end of the week preceding the week in which the first examination is scheduled.
The second examination covers all the work completed since the first examination was
done up to the end of the week preceding the week in which the second examination is
scheduled.
The third examination (if need be) covers all the work completed since the second
examination, and end of the week preceding the week in which the third examination is
scheduled.
5
Supplementary Regulations:
This offering makes use of the ‘continuous and diversified assessment’ system of
evaluation (CASS) as indicated below:
1. A student will have to appear for three compulsory examinations within the semester. These
examinations will be referred to as ‘First-opportunity Examinations’.
2. A student who fails and/or misses any or all of the first-opportunity examinations
scheduled in this course, during the semester, will be allowed to write only one
supplementary examination towards the end of the semester. The supplementary
examination will be administered in the most convenient way as outlined by the course
lecturer.
3. The supplementary examination is also open to those who wish to improve their marks. In
either case, the marks obtained in the relevant section(s) of the supplementary examination
will be used to replace the marks obtained in the corresponding attempted, missed and/or
failed first-opportunity examination(s).
4. The supplementary examination will be set on the whole syllabus of the course but it will be
divided into a number of sections corresponding to the number of examinations scheduled
in this course. The topics covered in each section of the supplementary examination will be
the same as those topics covered in the corresponding first-opportunity examination.
5. A student taking the supplementary examination will be allowed to attempt only those
sections which correspond to the failed first-opportunity examinations up to one (1) less
than the number of scheduled first-opportunity examinations in this course.
NOTE: This means that if three first opportunity examinations were administered, the student is only allowed to supplement a
maximum of two sections of the supplementary examination (i.e. only up to two second opportunity examinations allowed).
6
6. WORK PROGRAM
EVENTS
WEEK DATE SECTION Examinations Projects/Labs/Tutorials… Notable Events
1 06/02 - 08/02 3.1
2 11/02 - 15/02 3.2
3 18/02 - 22/02 3.2 Lab 1
4 25/02 - 01/03 3.2 Tutorial 1
5 04/03 - 08/03 3.3
6 11/03 - 15/03 3.3 EXAM 1
7 18/03 - 20/03 3.3 Lab 2
21/03 Public Holiday: Namibia Independence Day (21/03)
22/03
8 25/03 - 29/03 3.3 Lab 3
9 01/04 - 05/04 3.3 Tutorial 2
10 08/04 - 12/04 3.4 EXAM 2
11 15/04 – 18/04 3.4 Lab 4
19/04 – 22/04 Public Holiday: Good Friday (19/04), Easter Monday (22/04)
12 23/04 – 26/04 Mid-Semester Break
29/04 - 30/04 3.4 Lab 5
13 01/05 Public Holiday: Workers Day (01/05)
02/05 – 03/05
14 06/05 – 10/05 3.4 Tutorial 3
15 13/05 – 17/05 3.5 EXAM 3
16 20/05 – 24/05 3.5
17 27/05 – 31/05 3.5 Mini-Project due
18 03/06 – 07/06 2nd
Opp. Examinations
NB: The above dates are tentative and are thus subject to change based on the needs of the students at the lecturer’s prerogative.
Students will be notified ahead of time of any changes.
7
7. PRESCRIBED TEXT BOOK:
6.1. Padmanabhan T.R. (2016). Programming with Python. Singapore: Springer Nature.
6.2. Robertson L.A. ((2007), Simple Program Design: A step-by-step approach. 5th ed. Boston: Thomson Course
Technology.
8. RECOMMENDED READING:
8.1. Lutz M. (2013). Learning Python, 5th ed. USA: O’Reilly Media Inc.
8.2. Swaroop C.H. (2006). A Byte of Python. 4th ed. Boston: Prentice Hall
8.3. Wentworth P., Elkner J., Downey A.B., & Meyers C., (2012). How to think like a Computer Scientist: Learning
with Python 3. 3rd ed. South Africa: Rhodes University.
8.1. Palm III,W.J. (2005). Introduction to Matlab 7 for Engineers, USA: McGraw-Hill.
8.2. Chapman, (2008), MATLAB Programming for Engineers. 4th ed. USA: Thompson
_________________________ ___________
Head – (Home) Department Date
8
(ACKNOWLEDGEMENT BY STUDENT)
(To be completed by all students on the course, detached from the course outline and
kept on record in the department)
………………………………………………… …………………..
Signature of student Date