{"id":218,"date":"2019-03-03T11:25:22","date_gmt":"2019-03-03T11:25:22","guid":{"rendered":"https:\/\/cs.uwc.ac.za\/?page_id=218"},"modified":"2023-03-26T10:32:21","modified_gmt":"2023-03-26T08:32:21","slug":"csc212","status":"publish","type":"page","link":"https:\/\/cs.uwc.ac.za\/?page_id=218","title":{"rendered":"CSC212"},"content":{"rendered":"<div class=\"art-layout-wrapper\">\n<div class=\"art-content-layout\">\n<div class=\"art-content-layout-row\">\n<div class=\"art-layout-cell art-content\">\n<div class=\"item-page\">\n<article class=\"art-post\">\n<div class=\"art-postcontent clearfix\">\n<div class=\"art-article\">\n<p align=\"justify\">CSC212 is a second semester course comprising two modules: Computer Architecture and Algorithms &amp; Complexity, spanning 13 weeks of lectures and\/or contact hours with lecturers.<\/p>\n<p align=\"justify\"><b>1. LECTURERS<\/b><\/p>\n<p align=\"justify\"><span class=\"ui-sortable\"><i>Prof. A Gerber <\/i><i>(<b>AG<\/b><\/i><i>)<\/i><i>\u00a0\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0<\/i><i>(<\/i><i><span id=\"cloak7de50c045ba2396b25cffd715e2b997b\"><a href=\"mailto:agerber@uwc.ac.za\">agerber@uwc.ac.za<\/a><\/span>)<\/i><\/span><\/p>\n<p align=\"justify\"><span class=\"ui-sortable\"><i>A\/Prof. Antoine Bagula\u00a0<\/i><i>(<\/i><i><b>AB<\/b><\/i><i>)<\/i><i>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (<span id=\"cloakde74ca05f4d47c1f4845157b03f5a7cb\"><a href=\"mailto:abagula@uwc.ac.za\">abagula@uwc.ac.za<\/a><\/span>)<\/i><\/span><\/p>\n<p align=\"justify\"><span class=\"ui-sortable\"><i>Dr. Omowunmi Isafiade\u00a0<\/i><i>(<\/i><i><b>OI<\/b><\/i><i>)<\/i><i>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (<span id=\"cloake8fca6ee3fa246f9c50cfdb24f8309bd\"><a href=\"mailto:oisafiade@uwc.ac.za\">oisafiade@uwc.ac.za<\/a><\/span>)<\/i><\/span><\/p>\n<p align=\"justify\">All queries about lectures should be addressed to the lecturer concerned. All queries about the running of practicals and tutorials should be addressed to the Teaching Assistants, lecturers could also be approached regarding missed tests and if the Teaching Assistant cannot help.<\/p>\n<p align=\"justify\"><b>2.<\/b>\u00a0<b>TEACHING ASSISTANTS\u00a0<\/b><b>(TA)<\/b><\/p>\n<p align=\"justify\">\n<p align=\"justify\"><i><span class=\"ui-sortable\">\u00a0<\/span><\/i><\/p>\n<p align=\"justify\">Your TA can help on the running of tutorials\/practicals, marking of assignments and tests and general questions about the course.<\/p>\n<p>&nbsp;<\/p>\n<p align=\"justify\"><b>3. BOOKS<\/b><\/p>\n<p align=\"justify\"><b>Prescribed\u00a0<\/b><b>(required)<\/b><b>:<\/b><\/p>\n<ul>\n<li>\n<p align=\"justify\">Computer Organization &amp; Architecture, Global Edition, 10\/E, by William Stallings, Publisher-Pearson . ISBN: 9781292096858<\/p>\n<\/li>\n<li>\n<p align=\"justify\">Notes will be available from the Department or the Department Web pages. Additional web resources will be provided if\/when required.<\/p>\n<\/li>\n<\/ul>\n<p align=\"justify\"><b>Purchase:<\/b><\/p>\n<ul>\n<li>\n<p align=\"justify\">Books are obtainable at: Campus Books, Juta, Atlas or Van Schaik<\/p>\n<\/li>\n<li>\n<p align=\"justify\">Books are also available on the reserve shelf of the UWC Library<\/p>\n<\/li>\n<\/ul>\n<p align=\"justify\"><b>4. SYLLABUS<\/b><\/p>\n<p align=\"justify\"><b>Algorithms and Complexity<\/b>\u00a0\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0\u00a0<span class=\"ui-sortable\"><i><b>RD<\/b><\/i><\/span><\/p>\n<p align=\"justify\">This course is the culmination of the study of Data Structures and their Algorithms. It is an introduction to Algorithms and their Complexity and their efficient implementation for manipulating data structures. The implementation language is Java and many examples in Java are developed in the practicals. The time and space complexity of algorithms are studied and the student should have a good grasp of the space and time efficiency of algorithms. The student should: (1) be able to verify the correctness of algorithms by induction proofs; (2) understand loop invariants; (3) calculate the asymptotic bounds for algorithms; (4) implement algorithms for manipulating data structures to execute efficiently on computing machinery; and (5) reproduce algorithms under examination conditions; and (6) understand what is meant by computability; (7) What do N = NP? or N \u2260 NP mean?<\/p>\n<p align=\"justify\">NB: For more info on\u00a0<b>Algorithms and Complexity<\/b>\u00a0please visit this link: http:\/\/cs.uwc.ac.za\/~regdodds\/index.html<\/p>\n<p align=\"justify\"><b>Computer Architecture<\/b>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<span class=\"ui-sortable\"><i><b>OI\u00a0<\/b><\/i><\/span><span class=\"ui-sortable\"><i><b>&amp;<\/b><\/i><\/span>\u00a0<span class=\"ui-sortable\"><i><b>AB<\/b><\/i><\/span><\/p>\n<p align=\"justify\">This is a practical and discussion-oriented introduction to high-level concepts in modern computer architecture. Topics include: assembler; principles and implementation of CPU architecture; pipelining; multicore architectures; caching; virtualization; CPU\/memory performance; storage and RAID; flash memory; and USB.<\/p>\n<p align=\"justify\"><span class=\"ui-sortable\"><i><b>Please note\u00a0<\/b><\/i><i><b>that\u00a0<\/b><\/i><i><b>this syllabus is subject to change and details will be updated regularly throughout the course.<\/b><\/i><\/span><\/p>\n<p align=\"justify\"><b>5. PRACTICAL WORK<\/b><\/p>\n<p align=\"justify\"><span class=\"ui-sortable\">Note: All practical work is done individually, unless otherwise specified by the lecturer concerned. Penalties for late hand-ins are: 10% per day. Work which is more than\u00a0<\/span><span class=\"ui-sortable\">4<\/span><span class=\"ui-sortable\">\u00a0days late will NOT be accepted. Remember\u00a0<\/span><span class=\"ui-sortable\">the\u00a0<\/span>plagiarism policy\u00a0<b>(see Section 8)<\/b>\u00a0and do not submit material that is not your own work. Tutors are available during tutorial sessions to assist with the open practical.<\/p>\n<p align=\"justify\">Marks and comments will usually be returned within 2 weeks.<\/p>\n<p align=\"justify\"><b>6. ATTENDANCE, EXEMPTIONS, EXTENSIONS<\/b><\/p>\n<p align=\"justify\">Lecture attendance is expected and some lectures will include in-class assessments,\u00a0<u><span class=\"ui-sortable\">which will count towards your course grade.<\/span><\/u><\/p>\n<p align=\"justify\">Exemption and extensions of deadlines for practicals, tutorials and weekly problem solving exercises will only be considered on medical or compassionate grounds. Medical grounds have to be supported by a Valid Medical Certificate signed by a qualified Medical Doctor,\u00a0<u>which clearly explains why the student is unable to complete their assignment.<\/u>\u00a0Compassionate grounds will normally require a letter of support from a parent\/guardian or counsellor.<\/p>\n<p align=\"justify\">Please submit your Medical Certificate to Ms Rene Abbot (<span id=\"cloak495294d6614afb0758fac13bae35f217\"><a href=\"mailto:rabbot@uwc.ac.za\">rabbot@uwc.ac.za<\/a><\/span>), administrative assistant at the reception, and alert the lecturer that you have done so via email. See the lecturer regarding compassionate grounds: do this before the deadline in question, or if that is not possible, immediately on your return to UWC.<span class=\"ui-sortable\">\u00a0It is vital to do this immediately as late applications after the deadlines have passed will not be considered.<\/span>\u00a0The TA cannot grant extensions and exemptions, so do not ask them.<\/p>\n<p align=\"justify\"><b>7.\u00a0<\/b><b>MISSED CLASS TESTS<\/b><\/p>\n<p align=\"justify\">Any student who misses a class test for Medical or Compassionate reasons will be required either to rewrite the test or to do an oral \u2013 exemption from class tests will not be granted. However, the lecturer concerned will make a final decision regarding this. The procedure to follow is:<\/p>\n<p align=\"left\"><b>A<\/b><b>.<\/b>\u00a0It is the student\u2019s responsibility to inform the Departmental Secretary and lecturer concerned as soon as possible and no later than 3 days after the test that you have missed the test and provide the following:<\/p>\n<p align=\"left\"><b>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 either<\/b><\/p>\n<ul>\n<li>\n<p align=\"left\">A Medical certificate, signed by a Medical doctor must be provided to the Departmental Secretary; this must clearly indicate that the student is\u00a0<u><span class=\"ui-sortable\">medically unable<\/span><\/u>\u00a0to write the test .<\/p>\n<\/li>\n<\/ul>\n<p align=\"left\"><b>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 or<\/b><\/p>\n<ul>\n<li>\n<p align=\"left\">In the case of Compassionate reasons please discuss this with the lecturer concerned no later than 3 days after the test.<\/p>\n<p align=\"left\">\n<\/li>\n<\/ul>\n<p align=\"left\"><b>B<\/b>. The re-test could be done within 10 days of the test (or by the end of the week following the test) which ever date comes first. It is usually arranged for 1 week after the original test.\u00a0<b>However,\u00a0<\/b><b>note that\u00a0<\/b><b>the lecturer\u00a0<\/b><b>concerned\u00a0<\/b><b>gives th<\/b><b>e<\/b><b>\u00a0final recommendation\u00a0<\/b><b>for a missed test<\/b><b>.<\/b><\/p>\n<p align=\"left\"><b>C<\/b>. In the case of an extended Medical situation please\u00a0<span class=\"ui-sortable\">contact the<\/span><span class=\"ui-sortable\">\u00a0lecturer concerned in good time.<\/span><\/p>\n<p align=\"left\"><b>8.\u00a0<\/b><b>PLAGIARISM (COPYING)<\/b><\/p>\n<p align=\"left\"><u>All forms of\u00a0<\/u><u>p<\/u><u>lagiarism<\/u>\u00a0(programs, essays, tutorials etc) are illegal and will be punished according to the University\u2019s rules. These rules are severe and can lead to rustication. The Computer Science Department checks all program submissions to ensure that the work submitted has not been copied. Work by other authors must be acknowledged as such under all circumstances. The department will assume that you have agreed to the plagiarism declaration for every of your hand-in.<\/p>\n<p align=\"left\">While we do encourage you to share, debate ideas and discuss your work, we however draw a careful line between that and plagiarism. Please pay close attention, we take it very seriously.<\/p>\n<p align=\"left\"><b>9.<\/b>\u00a0<b>PRIOR KNOWLEDGE\/COMPETENCIES<\/b><\/p>\n<ul>\n<li>\n<p align=\"justify\">Knowledge of a high level programming language<\/p>\n<\/li>\n<li>\n<p align=\"justify\">Understanding of programming structures<\/p>\n<\/li>\n<li>\n<p align=\"justify\">Some knowledge of stack mechanisms and procedure calls<\/p>\n<\/li>\n<\/ul>\n<p align=\"justify\"><b>10.<\/b>\u00a0<b>OUTCOMES\/COMPETENCIES<\/b><\/p>\n<ul>\n<li>\n<p align=\"justify\">Demonstrating and understanding of the interaction between low and high-level software and hardware.<\/p>\n<\/li>\n<li>\n<p align=\"justify\">Know the architecture of a typical RISC\/CISC processor at the conventional machine level and understand the fundamental limitations and bottlenecks in modern processors.<\/p>\n<\/li>\n<li>\n<p align=\"justify\">Have some knowledge of assembler language programming.<\/p>\n<\/li>\n<li>\n<p align=\"justify\">Understand how hardware components and their interconnection affect the performance of a computer.<\/p>\n<\/li>\n<\/ul>\n<p><b>11.\u00a0<\/b><b>SCHEDULE and NOTIONAL HOURS<\/b><\/p>\n<p>&nbsp;<\/p>\n<ul>\n<li>The class meets twice a week for a one hour lecture: 13 * 2 =\u00a0<b>26 hrs<\/b><\/li>\n<li>Practical session every week for one hour used for programming: 13 * 1 =\u00a0<b>13 hrs<\/b><\/li>\n<li><span class=\"ui-sortable\">You are expected to spend\u00a0<\/span><span class=\"ui-sortable\"><u>at least<\/u><\/span><span class=\"ui-sortable\">\u00a0<\/span><span class=\"ui-sortable\">two hours for every hour in class, studying and writing up assignments \u2013 this includes the time spent studying for tests and exams<\/span><span class=\"ui-sortable\"><b>:\u00a0<\/b><\/span><span class=\"ui-sortable\">13*2 * 2<\/span><span class=\"ui-sortable\">\u00a0\u00a0<\/span><span class=\"ui-sortable\">+ 7<\/span><span class=\"ui-sortable\"><b>\u00a0= 59 hrs<\/b><\/span><\/li>\n<li><span class=\"ui-sortable\">Tests and Pop quizzes are<\/span><span class=\"ui-sortable\">\u00a0<\/span><span class=\"ui-sortable\">spread throughout the term<\/span><span class=\"ui-sortable\"><b>:<\/b><\/span>\u00a0<span class=\"ui-sortable\"><b>during class<\/b><\/span><\/li>\n<li>Assessment in Exam\u00a0<b>2 hrs<\/b><span class=\"ui-sortable\">Total: 26 + 13 + 59 + 2 =\u00a0<\/span><span class=\"ui-sortable\"><b>100 notional hours<\/b><\/span><\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<table width=\"100%\" cellspacing=\"0\" cellpadding=\"5\">\n<colgroup>\n<col \/>\n<col \/>\n<col \/>\n<col \/>\n<col \/>\n<col \/><\/colgroup>\n<tbody>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>Period<\/b><\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"center\"><b>Monday<\/b><\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"center\"><b>Tuesday<\/b><\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"center\"><b>Wednesday<\/b><\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"center\"><b>Thursday<\/b><\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"center\"><b>Friday<\/b><\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>1<\/b><\/p>\n<p align=\"center\">08h30-09h30<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">CSC212<\/p>\n<p align=\"justify\">Complexity<\/p>\n<p align=\"justify\">CS\/ SunLab<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>2<\/b><\/p>\n<p align=\"center\">09h40-10h40<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">CSC212<\/p>\n<p align=\"justify\">Architecture<\/p>\n<p align=\"justify\">Sc8<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>3<\/b><\/p>\n<p align=\"center\">10h50-11h50<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"center\">CSC212<\/p>\n<p align=\"center\">Architecture\/<\/p>\n<p align=\"center\">Complexity<\/p>\n<p align=\"center\">Sc8<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">Group 1<\/p>\n<p align=\"justify\">Architecture<\/p>\n<p align=\"justify\">Thintana<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>4<\/b><\/p>\n<p align=\"center\">12h00-13h00<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">Group 2<\/p>\n<p align=\"justify\">Complexity<\/p>\n<p align=\"justify\">SunLab<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>LUNCH<\/b><\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">CSC212<\/p>\n<p align=\"justify\">Complexity<\/p>\n<p align=\"justify\">SC9\/SunLab<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">Group 2<\/p>\n<p align=\"justify\">Architecture<\/p>\n<p align=\"justify\">Thintana<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>5<\/b><\/p>\n<p align=\"center\">14h00-15h00<\/p>\n<\/td>\n<td rowspan=\"2\" bgcolor=\"#ffccff\" width=\"14%\">\n<p align=\"justify\">CSC212<\/p>\n<p align=\"justify\">Algorithms<\/p>\n<p align=\"justify\">Practical<\/p>\n<p align=\"justify\">CSC212<\/p>\n<p align=\"justify\">Algorithms<\/p>\n<p align=\"justify\">Practical<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">Group 1<\/p>\n<p align=\"justify\">Complexity<\/p>\n<p align=\"justify\">SunLab<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>6<\/b><\/p>\n<p align=\"center\">15h10-16h10<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\"><\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"14%\">\n<p align=\"center\"><b>7<\/b><\/p>\n<p align=\"center\">16h20-17h20<\/p>\n<\/td>\n<td bgcolor=\"#ffccff\" width=\"14%\">\n<p align=\"justify\">CSC212<\/p>\n<p align=\"justify\">Algorithms<\/p>\n<p align=\"justify\">Practical<\/p>\n<\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"14%\"><\/td>\n<td width=\"14%\">\n<p align=\"justify\">\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><b>Lecture and practical times are as set out on the Faculty timetable.<\/b><\/p>\n<table width=\"100%\" cellspacing=\"0\" cellpadding=\"5\">\n<colgroup>\n<col \/>\n<col \/>\n<col \/>\n<col \/><\/colgroup>\n<tbody>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\"><b>Week<\/b><\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\"><b>Date<\/b><\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\"><b>Topic (see chapters in the book)<\/b><\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\"><b>Assignments<\/b><\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">1<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">7<sup>th<\/sup>\u00a0\u2013 11<sup>th<\/sup>\u00a0August<\/p>\n<p align=\"justify\"><b>9<sup>th<\/sup>\u00a0August: Women&#8217;s day<\/b><\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Overview and Computer Evolution and Performance<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures and questions in Chapters 1 &amp; 2<\/p>\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">2<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">14<sup>th<\/sup>\u00a0\u2013 18<sup>th<\/sup>\u00a0August<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">A Top Level View of Computer Function and Interconnection<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<p align=\"justify\">Assembler Assignment 1<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">3<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">21<sup>st<\/sup>\u00a0&#8211; 25<sup>th<\/sup>\u00a0August<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Cache Memory<\/p>\n<p align=\"justify\">Hardware &amp; Software Architecture<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<p align=\"justify\">\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">4<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">28<sup>th<\/sup>\u00a0August &#8211; 1<sup>st<\/sup>\u00a0September<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Internal Memory<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter. Review the review questions &amp; problems of this chapter<\/p>\n<p align=\"justify\">Assembler Assignment 2<\/p>\n<p align=\"justify\">Prepare for test<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">5<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">4<sup>th<\/sup>\u00a0&#8211; 8<sup>th<\/sup>\u00a0September<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">External Memory<\/p>\n<p align=\"justify\">Introduction to Assembly Language<\/p>\n<p align=\"justify\"><b>Test 1 (Algorithms &amp; Complexity)<\/b><\/p>\n<p align=\"justify\"><b>TBC<\/b><\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter. Review the review questions &amp; problems of this chapter<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">6<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">11<sup>th<\/sup>\u00a0&#8211; 15<sup>th<\/sup>\u00a0September<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Input\/Output<\/p>\n<p align=\"justify\">Assembly Language Fundamentals<\/p>\n<p align=\"justify\"><b>Test 1 (Architecture)<\/b><\/p>\n<p align=\"justify\"><b>TBC<\/b><\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter. Review the review questions &amp; problems of this chapter.<\/p>\n<p align=\"justify\">Assembler Assignment 3<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">7<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">18<sup>th<\/sup>\u00a0&#8211; 22<sup>nd<\/sup>\u00a0September<\/p>\n<p align=\"justify\"><b><span class=\"ui-sortable\">24<\/span><sup><span class=\"ui-sortable\">th<\/span><\/sup><span class=\"ui-sortable\">September:Heritage day<\/span><\/b><\/p>\n<p align=\"justify\">\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Number Systems<\/p>\n<p align=\"justify\">Computer Arithmetic<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">8<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">25<sup>th<\/sup>\u00a0&#8211; 29<sup>th<\/sup>\u00a0September<\/p>\n<p align=\"justify\"><b><span class=\"ui-sortable\">25<\/span><sup><span class=\"ui-sortable\">th<\/span><\/sup><span class=\"ui-sortable\">September: Public Holiday<\/span><\/b><\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Digital Logic<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<p align=\"justify\"><span id=\"syllabus:j_id_jsp_1051708108_37\" class=\"ui-sortable\">Prepare for test<\/span><\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">9<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\"><span class=\"ui-sortable\">30<\/span><sup><span class=\"ui-sortable\">th<\/span><\/sup><span class=\"ui-sortable\">\u00a0September &#8211; 8<\/span><sup><span class=\"ui-sortable\">th<\/span><\/sup><span class=\"ui-sortable\">\u00a0October<\/span><\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Holiday<\/p>\n<\/td>\n<td width=\"28%\"><\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">10<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">9<sup>th<\/sup>\u00a0&#8211; 13<sup>th<\/sup>\u00a0October<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Instruction Sets<\/p>\n<p align=\"justify\">Addressing Modes&#8230;<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<p align=\"justify\">Assembler Assignment 4<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">11<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">16<sup>th<\/sup>\u00a0&#8211; 20<sup>th<\/sup>\u00a0October<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Instruction Sets<\/p>\n<p align=\"justify\">CISC \/ RISC<\/p>\n<p align=\"justify\"><b>Test 2 (Algorithms &amp; Complexity)<\/b><\/p>\n<p align=\"justify\"><b>TBC<\/b><\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">12<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">23<sup>rd<\/sup>\u00a0-27<sup>th<\/sup>\u00a0October<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\"><b>Test 2 (Architecture)<\/b><\/p>\n<p align=\"justify\"><b>TBC<\/b><\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">13<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">30<sup>th<\/sup>\u00a0October \u2013 3<sup>rd<\/sup>\u00a0November<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">Processor Structure &amp; Pipelining<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">14<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">6<sup>th<\/sup>\u00a0November \u2013 10<sup>th<\/sup>\u00a0November<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"justify\">RISC Machines<\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Read the chapter<\/p>\n<p align=\"justify\">Review the review questions &amp; problems of this chapter<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">15<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">15<sup>th\u00a0<\/sup>&#8211; 19<sup>th<\/sup>\u00a0November<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"center\"><b>Study Period<\/b><\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">Do review on lectures<\/p>\n<p align=\"justify\">Prepare for exams<\/p>\n<\/td>\n<\/tr>\n<tr valign=\"top\">\n<td width=\"8%\">\n<p align=\"justify\">16<\/p>\n<\/td>\n<td width=\"29%\">\n<p align=\"justify\">20<sup>th<\/sup>\u00a0November- 13<sup>th<\/sup>\u00a0December<\/p>\n<\/td>\n<td width=\"35%\">\n<p align=\"center\"><b>Assessment Period<\/b><\/p>\n<\/td>\n<td width=\"28%\">\n<p align=\"justify\">\u00a0Good luck for the course!<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p align=\"justify\">NB: Test dates will be confirmed by the lecturers concerned.<\/p>\n<p align=\"justify\"><b>12.\u00a0<\/b><span class=\"ui-sortable\"><b>ASSESSMENT EVENTS and METHODS<\/b><\/span><\/p>\n<ul>\n<li>\n<p align=\"justify\">Computer Architecture:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 50%<\/p>\n<\/li>\n<\/ul>\n<p align=\"justify\"><i><span class=\"ui-sortable\">PopQuizzes,\u00a0<\/span><\/i><i><span class=\"ui-sortable\">Assembler (programming),\u00a0<\/span><\/i><i><span class=\"ui-sortable\">Exam and Tests (1 &amp; 2) 100%<\/span><\/i><\/p>\n<ul>\n<li>\n<p align=\"justify\">Algorithms and Complexity \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0 50%<\/p>\n<\/li>\n<\/ul>\n<p align=\"justify\"><span class=\"ui-sortable\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/span><i><span class=\"ui-sortable\">TBC \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0\u00a0<\/span><\/i><i><span class=\"ui-sortable\">100%<\/span><\/i><\/p>\n<p align=\"justify\"><span class=\"ui-sortable\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0\u00a0<\/span><span class=\"ui-sortable\"><b>100%<\/b><\/span><\/p>\n<p align=\"justify\"><b>12b) POP QUIZZES<\/b><\/p>\n<p>A pop-quiz is an unannounced short, e.g. 5-10 minutes, individual quiz, in class, that cover material covered in class and also reading material announced in class, in this syllabus, including what is prescribed for the day of the lecture(s).\u00a0<b><span class=\"ui-sortable\">There is no make-up for a missed pop quiz.<\/span><\/b><\/p>\n<p>&nbsp;<\/p>\n<p><b>13) INFUSION OBJECTIVES<\/b><\/p>\n<p>&nbsp;<\/p>\n<ul>\n<li><b>Comprehension and Communication Skills:<\/b>\u00a0Discussion of problems in groups.<\/li>\n<li><b>Problem Solving:<\/b>\u00a0Reading of problems and effectively interpreting it.<\/li>\n<li><b>Programming Competency:<\/b>\u00a0Introduction to Assembly Language for Intel-based Computers.<\/li>\n<li><b>Team Work:<\/b>\u00a0Students will possibly work in teams when completing some projects\/ solving exercises<\/li>\n<li><b>Leadership:<\/b>\u00a0Within a team<\/li>\n<li><b>Ethics &amp; Professionalism:<\/b>\u00a0Professional conduct<\/li>\n<li><b>Responsibility:<\/b>\u00a0Time management: &#8211; Exercises\/pop quizzes must be completed during tut\/prac times, programming assignments completed in the student&#8217;s own time but within the stipulated deadline.<\/li>\n<li><b>Software Development:<\/b>\u00a0Use SDLC for all programming assignments.<\/li>\n<li><b>Research Methods:<\/b>\u00a0Using and referencing the web as well as articles in academic journals.<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<\/div>\n<\/div>\n<\/article>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<div id=\"themify_builder_content-218\" data-postid=\"218\" class=\"themify_builder_content themify_builder_content-218 themify_builder\">\n    <\/div>\n<!-- \/themify_builder_content -->\n","protected":false},"excerpt":{"rendered":"<p>CSC212 is a second semester course comprising two modules: Computer Architecture and Algorithms &amp; Complexity, spanning 13 weeks of lectures and\/or contact hours with lecturers. 1. LECTURERS Prof. A Gerber (AG)\u00a0\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0(agerber@uwc.ac.za) A\/Prof. Antoine Bagula\u00a0(AB)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (abagula@uwc.ac.za) Dr. Omowunmi Isafiade\u00a0(OI)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (oisafiade@uwc.ac.za) All queries about lectures should be addressed [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-218","page","type-page","status-publish","hentry","has-post-title","has-post-date","has-post-category","has-post-tag","has-post-comment","has-post-author",""],"_links":{"self":[{"href":"https:\/\/cs.uwc.ac.za\/index.php?rest_route=\/wp\/v2\/pages\/218","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cs.uwc.ac.za\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/cs.uwc.ac.za\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/cs.uwc.ac.za\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/cs.uwc.ac.za\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=218"}],"version-history":[{"count":8,"href":"https:\/\/cs.uwc.ac.za\/index.php?rest_route=\/wp\/v2\/pages\/218\/revisions"}],"predecessor-version":[{"id":3014,"href":"https:\/\/cs.uwc.ac.za\/index.php?rest_route=\/wp\/v2\/pages\/218\/revisions\/3014"}],"wp:attachment":[{"href":"https:\/\/cs.uwc.ac.za\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=218"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}