Please note that there is a general extension for Assignment 04. Please submit by 15 October. Best Regardsby hornet - COS451G
Please note that you need not implement the means-ends planner with goal-protection for Question 3. A trace, such as required for Question 2, should be submitted. Best Regards Tertia Horneby hornet - COS451G
Problem has been fixed now. You are most welcome to talk. Regards 451 teamby hornet - COS451G
No questions on Java or Unix will be included in the exam. Best of luck!! T Horneby hornet - COS3216
Hello there, We apologise for the delay. All the marks should be available by the end of this week. Best Regards Tertia Horne (321 lecturer)by hornet - COS3216
Hello, There are no complicated calculations involved in this module, so the use of calculators in the exam is not permitted. Best Regards Tertia Horne (COS101 Lecturer)by hornet - COS101S
Dear Student We aplologise for the delay in the marking process of Assignment 01. The majority of the first assignments have been marked and the Assignment Section is in the process of capturing the marks. Within the next week or so you should receive it. Regards 321 lecturersby hornet - COS3216
Hello there, Problem is, the 8th edition is now available. We are working on a plan to sort this out for next year. Best Regards T Horneby hornet - COS3216
Please note the erratum in Bratko, top of page 419. The list that is produced should be: Assignment 04, Question 2 The initial state space should read S = (In the question we did not state clear(b) and clear(c) as part of the initial state.)by hornet - COS451G
SGG 7th Edition: Because of the nature of the subject matter that constantly changes, new editions of the text book appear quite frequently, sometimes without us knowing about it in advance. The current 501 is based on the 6th edition but a table is provided on page 1 (of the 501) to highlight the differences in chapter contents. There is also a discussion in SGG 7th edition (pp.xi -xiii)by hornet - COS3216
Dear student, Please note that Assignment 01 is compulsory. This regulation was introduced by the Unisa Academic Planner. We apologise for any inconvenience this may cause. Best Regards Tertia Horne (Cos321 lecturer)by hornet - COS3216
Please note that the due date for Assignment 04 has been extended to 31 October. I will be on sick leave from 27 October until 10 November and will only be able to mark your assignments after that. Kind Regards Tertia Horneby hornet - COS451G
Details regarding the format of the exam paper were given in Tutorial Letter 105. Good luck with the exams! Best Regards Tertia Horneby hornet - COS101S
The October/November exam paper was sent out as part of Tutorial Letter 102. Kind Regards Tertia Horneby hornet - COS101S
The section on Infinite sets does not form part of the syllabus. Regards Tertia Horneby hornet - COS101S
Hi there, There are more than one correct answer, so the question will not be marked. You will get the credit. Our apologies! The COS101S teamby hornet - COS101S
The sequence is 2,5,10,17,26,... If I understand it correctly, you give the recursive formula as a sub n = (sqrt(a sub n-1 - 1) + 1)^2 Now take n = 3. (I use indexing to make reading easier.) a(3) = (sqrt(a(2) - 1) + 1)^2 = (sqrt(5-1) + 1)^2 = (2+1)^2 = 9 which is not correct. The correct recursive formula is a(1) = 2 and a(n) = a(n-1) + (2n - 1) E.g.by hornet - COS101S
Hi, With the recursive formula, the first term is explicitly given and then the recursive formula is given for n >= 2. Also refer to the solution to Example 6 on page 14. Regards Tertia Horneby hornet - COS101S
Hi, I will find out and get back to you as soon as possible. Regards Tertia Horneby hornet - COS101S
If n is divisible by 6, then n(n+6) is divisible by 6x6 = 36. This is our starting point. It follows that n is also divisible by 2 (2x3=6), thus n(n+6) is divisible by 2x2=4. Similarly, n is divisible by 3, thus n(n+6) is divisible by 3x3=9. Regardsby hornet - COS101S
Hi, See explanations below. "If any integer is divisable by 3, then the number n^2 + 3n is divisable by 9" "PROOF: ...By Proposition 1,n+3 is divisable by 3" 1.) How is this true? >> n is divisible by 3 and 3 is divisible by 3, so n+3 is divisible by 3. 2.) Is it "n which is divisable by 3 plus 3"? >> No, n is divisible by 3.by hornet - COS101S
Hi, For clarification, it means that x is positive or y is positive or both are positive. Regards Tertia Horneby hornet - COS101S
Hi, No. The text book by Labuschagne is not used anymore. Please refer to the 101 for the name of the new text book. Regards Tertia Horneby hornet - COS101S
Hi, You can also read the statement as follows: For every integer x, it is the case that 2x is not equal to 9. Regards Tertia Horne (COS101 lecturer)by hornet - COS101S
Erratum in the prescribed book, E&C: p. 20. The closed formula given as the solution to Practice Problem 2(b) is incorrect. The closed formula for sum b should be 5x2 to the power of n-1, i.e. 5.2^(n-1). Regards Tertia Horne Lecturer COS101Sby hornet - COS101S
The postgraduate brochure for 2008 is now available on osprey (prospective students). Regardsby hornet - COS451G
Hi, The Constraint Logic Programming module is a project module (COS498X). It is advisable that you take both COS407 and COS451 if you want to do the CLP project. Regards Tertia Horne (COS451 lecturer)by hornet - COS451G