School of Computing prospectus 2012 - Walter Sisulu University
School of Computing prospectus 2012 - Walter Sisulu University
School of Computing prospectus 2012 - Walter Sisulu University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Assessment<br />
and progression<br />
rules<br />
Introduction to Problem Solving<br />
Continuous Assessment (CA) (Compulsory): Two Assignments(30%),<br />
Two Tests (40%), 12 tutorial assessments(10%) and 12 Practical<br />
assessments(20%)<br />
Examination (Compulsory): One examination (EA). The contribution <strong>of</strong><br />
the examination (EA) to the overall assessment (OA) is 40%. OA = 60%(CA)<br />
+ 40%(EA).<br />
Re-examination (Not compulsory): To qualify for re-examination<br />
students must obtain an overall assessment <strong>of</strong> between 40 and 49%.<br />
Module Code Module Name NQF Level Credits Semester<br />
CSI 1102 Introduction to<br />
Problem solving<br />
Lectures per week Pracs per week Tutorials<br />
per week<br />
1 x 2 hrs 1 x 3 hrs(x 2 groups) 1 x 1hrs (x<br />
2 groups)<br />
31<br />
5 8 1<br />
Number<br />
<strong>of</strong> weeks<br />
14 84<br />
Notional<br />
hours<br />
Content / Syllabus Theory: The Basics <strong>of</strong> a C++ Program, Data Types, Arithmetic Operators<br />
and Operator Precedence Expressions, Type Conversion, Input, Increment<br />
and decrement Operators, Output Preprocessor directives, Creating a<br />
C++ Program. Input/Output, I/O Streams and Standard I/O devices, Using<br />
predefined functions in a program, Input failure, Control Structures, Relational<br />
Operators, Logical Operators and logical Expressions, Selection: if and if ….else<br />
Switch structures, Control structures , Looping, User defined functions, Value<br />
returning functions, Void functions without parameters, Void functions with<br />
parameters, Value parameters, Reference variables as parameters, Value and<br />
reference parameters and memory allocation, Scope <strong>of</strong> an identifier, Global<br />
variables, Static and automatic variables, Function overloading, Functions with<br />
default parameters, User defined simple data types, namespaces and the string<br />
type, Enumeration type, Arrays and strings, Applications <strong>of</strong> arrays (searching<br />
and sorting), List processing, Bubble sort, Selection sort, Insertion sort, Binary<br />
search, Vector type (class), Records, Pointers, linked lists<br />
Entry rules MATRICULATION: Certified for degree. At least 3 in mathematics, 2 in<br />
English and 2 in life orientation.<br />
Assessment<br />
and progression<br />
rules<br />
REQUIRED NSC SUBJECTS (Compulsory): Mathematics, English<br />
RECOMMENDED: IT, CAT<br />
OTHER (NBT): 3 in mathematics,<br />
Continuous Assessment (CA) (Compulsory): Two Assignments(30%),<br />
Two Tests (40%), 12 tutorial assessments(10%) and 12 Practical assessments(20%)<br />
Examination (Compulsory): One examination (EA). The contribution <strong>of</strong><br />
the examination (EA) to the overall assessment (OA) is 40%. OA = 60%(CA)<br />
+ 40%(EA).<br />
Re-examination (Not compulsory): To qualify for re-examination students<br />
must obtain an overall assessment <strong>of</strong> between 40 and 49%.<br />
<strong>2012</strong><br />
PROSPECTUS