IMPORTANT INFORMATION
Please register on myUnisa, activate your myLife e-mail account and
make sure that you have regular access to the myUnisa module
website, COS1521-2021-Y1, as well as your group website
Dear Student
This tutorial letter gives the most important information that you need regarding assessments,
assignments, assignment dates, the exam etc. Please refer to the Tutorial letter 101 for any
information that you cannot find in this tutorial letter. The assignment dates in the letter are the
correct ones. Please work on these dates and study programme.
1 ASSESSMENT
1.3 Assessment criteria
The assessment criteria are given for each specific outcome:
Specific outcome 1: Demonstrate how data are represented, manipulated and stored in a
computer using number systems, Boolean algebra, Karnaugh maps, truth tables and basic
logic circuits drawings, in the context of given problem statements.
Assessment criteria:
• Conversions between different number systems (binary, octal, decimal and hexadecimal);
• The application of different arithmetic methods in the binary number system;
• The identification of computer data includes the different internal representations;
• Explanations include the basic restrictions placed by computer architecture upon
numerical computations;
• The determination of outputs of basic combinational logic circuits for given inputs;
• Graphical representations of the combinational circuits for given Boolean functions;
• The simplifications of Boolean functions by implementing appropriate rules/methods;
• The determination of a Boolean function for a given problem statement using truth tables
(at most 4 variables);
• Boolean expressions and binary logic that describe the behaviour of logic circuits;
• The descriptions of the functioning of different types of combinational and sequential logic
circuits.
Specific outcome 2: Demonstrate an understanding of the basic functions of computers, the
software development process and units of hardware and software components.
Assessment criteria:
• Today’s computers are described in context of some short historical background, different
architectures and ethical scenarios/issues;
• Descriptions of software engineering and operating systems include the development of
software in a historical context;
• The description of a basic computer includes the three basic hardware subsystems and
their interconnecting functioning;
• The description of an operating system includes the functioning of its components;
• The descriptions of popular operating systems with references to different popular
operating platforms;
• The definition of an algorithm includes its relation to problem solving;
• Definitions of the three algorithm constructs include descriptions of their use in
algorithms;
• Descriptions of basic algorithms include their applications;
3
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller LADHU. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $2.67. You're not tied to anything after your purchase.