0% found this document useful (0 votes)
71 views8 pages

COMS1015A BCO - Course - Outline

This document outlines the course outline for the Basic Computer Organisation course at the University of the Witwatersrand. It provides details on the lecturer, course description and learning outcomes, assessment structure, textbook, and academic honesty policy. The course explores computation fundamentals like number representation, digital circuits, computer components, and the limits of computation.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
71 views8 pages

COMS1015A BCO - Course - Outline

This document outlines the course outline for the Basic Computer Organisation course at the University of the Witwatersrand. It provides details on the lecturer, course description and learning outcomes, assessment structure, textbook, and academic honesty policy. The course explores computation fundamentals like number representation, digital circuits, computer components, and the limits of computation.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

SCHOOL OF COMPUTER SCIENCE

AND APPLIED MATHEMATICS

Basic Computer Organisation (Full Time)


COMS1015A
Course Outline
2024

1 Lecturer and Course Coordinator

Professor R. Ajoodha
Associate Professor: School of CSAM
Director: WITS ExplainableAI Lab
Postgraduate Coordinator: Computer Science
CoE-MaSS: Focus Area Coordinator of Machine Intelligence and Learning
from Experience

Qualifications: PGDip(HE) (WITS- cum laude) | BSc.Hons. (WITS- cum


laude) | ATCL (cum laude) | M.Sc. (WITS- cum laude) | LTCL | Ph.D. (WITS)

Office: T.W.K. Mathematical Science Building, Office UG 17 (x76188)


E-mail: [email protected]

2 Course Description

This course serves as an introduction to computation, which is a method for converting input data into
output using a predetermined process. Imagine baking a cake: you start with various ingredients (input),
follow a specific baking recipe (procedure), and the result is a delicious cake (output).

Throughout the course, we explore computation as used by modern computers to operate. Initially, we
focus on the units of digital computation: bits. These bits are used to represent various forms of multimedia
data we encounter daily, such as images, music, and videos. The course investigates how computers strive
to manage, process, and share these bits efficiently, with an emphasis on their security and integrity.

Floor UG and 1, TWK Mathematical Sciences Building, Braamfontein Campus West, 1 Jan Smuts Avenue, Braamfontein 2000, South Africa
T +27 11 717 6188 | E [email protected] | www.wits.ac.za

IYUNIVESITHI YASEWITWATERSRAND | YUNIVESITHI YA WITWATERSRAND


We then explore digital circuits, particularly using logic gates. These gates manipulate bits according to
logical rules to perform various operations. Such operations include those of the Central Processing Unit
(CPU), the computer’s brain, which uses these logic gates to perform addition and other important functions.

The course also addresses the hardware aspects of computing components and how they can be pro-
grammed. This allows us to use the same hardware to solve many different problems by writing software.
Finally, we end the course by looking at the limits of computation. Here, we learn that there are certain
problems that cannot be computed.

3 Prior Knowledge Assumed

The prerequisites and co-requisites to register for this course are defined in the current Faculty Rules &
Syllabuses available here: https://www.wits.ac.za/students/academic-matters/rules-and-syllabuses/.

Students are not expected to be computer literate, however they should have a good grasp of high school
level mathematics, particularly in algebra and set theory. Students should also know how to use a non-
programmable scientific calculator. More importantly, students should demonstrate a strong curiosity and
willingness to learn.

4 Learning Outcomes

By the end of the topic, you are expected to be able to do the following:

1. Convert numbers into different number systems, perform base arithmetic, and represent numbers in
floating-point representation.

2. Encode, compress, transmit, and encrypt digital data and evaluate the effectiveness of these opera-
tions.

3. Design and optimise Boolean expressions and digital circuits to perform logical operations, and use
Boolean Algebra and Karnaugh maps to simplify logical expressions.

4. Investigate and interpret the architecture and operation of computing components.

5. Write, trace, and interpret low-level and high-level instructions to solve problems.

6. Evaluate, analyse, and interpret the limitations of computation through Turing machines and compu-
tational complexity.

Floor UG and 1, TWK Mathematical Sciences Building, Braamfontein Campus West, 1 Jan Smuts Avenue, Braamfontein 2000, South Africa
T +27 11 717 6188 | E [email protected] | www.wits.ac.za

IYUNIVESITHI YASEWITWATERSRAND | YUNIVESITHI YA WITWATERSRAND


5 Mark Breakdown and Structure of Assessments & Teaching Activities

The mark breakdown, structure of assessments, and teaching activities for the course is as follows:

Weight Assessment Notes


15% Tutorials In-person, Invigilated weekly on Moodle
20% Test 1 In-person, Invigilated on Moodle
25% Test 2 In-person, Invigilated on Moodle
40% Exam Written, Compulsory

Application for Missed Work


The school’s policy is that all students should complete all assigned work, or else be given a mark of
0% for any work that is missed. In exceptional cases we will excuse students where sufficient reasons
and supporting documents are provided. These application will be approved by a school committee on
whether a concession will be granted. In most cases for approved applications, the exam mark is used
as a replacement for missed work. The link to complete an application for missed work is as follows:
https://forms.gle/MDmWPmk2BFc8sk3w5.

Satisfactory Performance (SP) Requirements


According to Rule G.13 satisfactory performance in the work of the class means attendance and com-
pletion of prescribed laboratory activities, attendance at tutorials designated as compulsory in this CB&O,
submission of assignments, writing of scheduled tests unless excused in terms of due procedure.

Exam Sub-Minimum Requirements


Note that the exam requires a sub-minimum of 35% in order to pass the course. That means even if the
average mark of the course is above 50% and you obtained less than 35% for the exam, you will not have
satisfied the requirements to pass the course.

Special Lab Rules


For labs and tutorials, the use of external devices such as phones, tablets, or personal laptops is prohibited.
Only the computers provided in the lab may be used.

6 Prescribed Text

The course will reference the following textbook, which provides additional information about the topics
covered:

• Ajoodha, R. (2024). An Introduction to Computation. Pearson Publishing. (Not yet available)

• Dale, N. B., & Lewis, J. (2007). Computer science illuminated (fourth or later edition). Jones & Bartlett
Learning.

Floor UG and 1, TWK Mathematical Sciences Building, Braamfontein Campus West, 1 Jan Smuts Avenue, Braamfontein 2000, South Africa
T +27 11 717 6188 | E [email protected] | www.wits.ac.za

IYUNIVESITHI YASEWITWATERSRAND | YUNIVESITHI YA WITWATERSRAND


There are 5 copies of Computer science illuminated available in the WITS Library.

7 Learning Management System

The learning management system will be Moodle. A link to the course can be found here: https://courses.
ms.wits.ac.za/moodle/course/view.php?id=395. All students are expected to consult the course home page
at regular intervals.

8 Teaching and Learning Process

The teaching and learning process for this course is as follows:

Activity Duration Day and Time Venue


Lectures 2 × 45 minutes Monday, 8:00-10:00 SH6
Tutorials 45 minutes Wednesday, 12:30-13:15 MSL004/5/6/108/109/110
Test 1 2 hours 11 April 2024: 14:15-16:15 MSL004/5/6/108/109/110
Test 2 2 hours 9 May 2024: 14:15-16:15 MSL004/5/6/108/109/110
Exam 3 hours Issued by EGO Issued by EGO
Consultations 1 hour Mondays, 13:15-14:15 UG 17, MSB

Any changes to this schedule will be communicated through the LMS.

9 Academic Honesty Policy Summary

Introduction
In addition to skills and knowledge, The University of the Witwatersrand aims to teach students appropriate
Ethical and Professional Standards of Conduct. The Wits Academic Honesty Policy exists to inform stu-
dents and Faculty of their obligations in upholding the highest standards of professional and ethical integrity.
All student work is subject to the Wits Academic Honesty Policy. Professional and Academic practice pro-
vides guidance about how to properly cite, reference, and attribute the intellectual property of others. Any
attempt to deceive a faculty member or to help another student to do so will be considered a violation of
this standard.

Instructor’s Intended Purpose


The student’s work must match the instructor’s intended purpose for an assignment. While the instructor
will establish the intent of an assignment, each student must clarify outstanding questions of that intent for
a given assignment.

Floor UG and 1, TWK Mathematical Sciences Building, Braamfontein Campus West, 1 Jan Smuts Avenue, Braamfontein 2000, South Africa
T +27 11 717 6188 | E [email protected] | www.wits.ac.za

IYUNIVESITHI YASEWITWATERSRAND | YUNIVESITHI YA WITWATERSRAND


Unauthorized/Excessive Assistance
The student may not give or get any unauthorized or excessive assistance in the preparation of any work.

Authorship
The student must clearly establish authorship of their work. Work presented without (or incorrect) author-
ship will be given a grade of zero. Referenced work must be clearly documented, cited, and attributed,
regardless of media or distribution. Even in the case of work licensed as public domain or Copy-left, (See:
http://creativecommons.org/) the student must provide attribution of that work to uphold the standards of
intent and authorship.

Declaration
Online submission of, or placing one’s name on an exam, assignment, or any course document is a state-
ment of academic honour that the student has not received or given inappropriate assistance in completing
it and that the student has complied with the Academic Honesty Policy in that work.

Consequences
An instructor may impose a sanction on the student that varies depending upon the instructor’s evaluation
of the nature and gravity of the offense. Possible sanctions include but are not limited to, the following: (1)
Require the student to redo the assignment; (2) Require the student to complete another assignment; (3)
Assign a grade of zero to the assignment; (4) Assign a final grade of “F" for the course. A student may
appeal these decisions according to the Academic Grievance Procedure (See the relevant section in the
Student Handbook). Multiple violations of this policy will result in a referral to the Conduct Review Board for
possible additional sanctions.

The full text of the Academic Honesty Policy is provided https://www.wits.ac.za/media/wits-university/about-wits/


documents/Academic-misconduct-policy.pdf.

10 Data for Research Disclosure

Any and all results of in-class and out-of-class assignments and examinations are data sources for research
and may be used in published research. All such use will always be anonymous.

11 Course Structure

The table below shows the tentative schedule for the course on a weekly basis. This schedule is subject to
change depending on public holidays and other factors.

Floor UG and 1, TWK Mathematical Sciences Building, Braamfontein Campus West, 1 Jan Smuts Avenue, Braamfontein 2000, South Africa
T +27 11 717 6188 | E [email protected] | www.wits.ac.za

IYUNIVESITHI YASEWITWATERSRAND | YUNIVESITHI YA WITWATERSRAND


Week Week Topic General Topic Block
1 Number Systems Numbers Block 1
2 Number Systems Numbers Block 1
3 Data Representation Data Block 1
4 Data Management and Security Data Block 1
5 Data Management and Security Data Block 1
6 TEST WEEK TEST WEEK Block 1
BREAK
7 Logic Gates and Circuits Logic Block 2
8 Logic Gates and Circuits Logic Block 2
9 Computing Components and Operation Hardware Block 2
10 Software Software Block 2
11 Software Software Block 2
12 Limits of Computation Limits Block 2

12 Lecture Synopsis

Below is an overview of each topic and lecture for the course.

12.1 Number Systems

This lecture explores number systems, with a particular focus on the Binary number system, which is used
to represent data and instructions in most modern computing devices. You will learn how to convert integers
and real numbers between different number systems using the positional numeral principle. The lecture
also covers base arithmetic in any number system.

12.2 Data Representation

This lecture addresses how digital data is represented in computing, using the basic building blocks of
bits and bytes. We will cover the digital encoding of various data types such as numbers, text, sound,
images, and video. In representing numbers, we introduce One’s Complement and Two’s Complement
and discuss how real numbers are represented in computers using the IEEE standard. We then look at
encoding text data using ASCII and UNICODE character sets, and also examine how to encode data as
text using Base-64. For sound, we explore digital audio conversion, including sampling and quantisation, to
represent sound. The representation of images and video is also discussed, including colour models and
video digitisation, which covers frame rate and resolution.

Floor UG and 1, TWK Mathematical Sciences Building, Braamfontein Campus West, 1 Jan Smuts Avenue, Braamfontein 2000, South Africa
T +27 11 717 6188 | E [email protected] | www.wits.ac.za

IYUNIVESITHI YASEWITWATERSRAND | YUNIVESITHI YA WITWATERSRAND


12.3 Data Management and Security

In this lecture, our focus is on how computers manage and protect multimedia data through compression,
error correction, and encryption techniques. We will introduce various data compression algorithms de-
signed to reduce file sizes while preserving essential information. Furthermore, we will evaluate these
algorithms using principles from information theory. We will also examine data transmission in modern
computing environments, including the use of parity checks and checksums for error detection. Finally, we
will turn our attention to data security, focusing on protective measures such as encryption and hashing to
safeguard data against unauthorised access or alteration.

12.4 Logic Gates and Circuits

In this lecture, we will look at digital logic design, starting with binary logic, truth tables, and the application
of logic gates. We will explore how binary logic is used to construct digital electronics and decision-making
circuits. The discussion then transitions to Boolean Algebra, including methods for organising and simpli-
fying logical expressions. We will review various combinational circuits, discussing their design and role
in data processing, introduce Karnaugh Maps for logic minimisation, and conclude with an overview of
sequential circuits.

12.5 Computing Components and Operation

In this lecture, we investigate the computing components in modern computing and their operations. We
begin by discussing classical computer architectures, such as the Von Neumann model and the Harvard
Model. We then examine central components like the CPU and GPU, including processes such as the
fetch-execute cycle and the graphics pipeline. The discussion extends to memory and storage solutions.
We also cover the role of the motherboard in bringing all the components together. The lecture concludes
by discussing how different hardware setups cater to a spectrum of user requirements.

12.6 Software

This lecture focuses on software. We begin by discussing the use of pseudocode for algorithm concep-
tualisation. We then introduce low-level programming languages, which offer direct control over computer
hardware, in contrast to high-level languages known for their abstraction from hardware functions. We also
briefly examine system and application software. The lecture concludes with an overview of the Software
Development Life Cycle (SDLC) and various methodologies, such as Waterfall and Agile.

Floor UG and 1, TWK Mathematical Sciences Building, Braamfontein Campus West, 1 Jan Smuts Avenue, Braamfontein 2000, South Africa
T +27 11 717 6188 | E [email protected] | www.wits.ac.za

IYUNIVESITHI YASEWITWATERSRAND | YUNIVESITHI YA WITWATERSRAND


12.7 Limits of Computation

In this final lecture, we will explore the boundaries of computation, focusing on the feasibility of a universal
algorithm to solve all mathematical problems and acknowledging the existence of unsolvable issues. We
will briefly explore computational complexity, which analyses the growth rates of algorithms as the input
size increases. We will categorise computational challenges into P and N P classes, using examples of
problems we have already encountered in the course. The lecture then examines the physical limitations of
computing, as suggested by Moore’s Law. The course concludes by discussing heuristics and the potential
of quantum computing as a promising field for addressing these challenges.

Floor UG and 1, TWK Mathematical Sciences Building, Braamfontein Campus West, 1 Jan Smuts Avenue, Braamfontein 2000, South Africa
T +27 11 717 6188 | E [email protected] | www.wits.ac.za

IYUNIVESITHI YASEWITWATERSRAND | YUNIVESITHI YA WITWATERSRAND

You might also like