Just physically shipped M381 TMA01 to tutor.
This gives you a rough idea about the topics and available points per question. The qualifications 'easy, normal, hard and very hard' are of course my personal opinion.
1. Euclidean algorithm (12) - Normal
2. Mathematical induction (10) - Easy
3. Division (11) - Normal
4. Greatest common divisor (20) - Hard
5. Division (12) - Very hard
Number Theory (65)
6. URM trace and flow-chart (10) - Normal
7. URM programming (10) - Hard
8. Primitive recursion(5) - Hard
9. URM programming and primitive recursion (10) - Very hard
Mathematical Logic (35)
Counting very easy as -2 ( none this TMA ), easy as -1, normal as 0, hard as 1 and very hard as 2 yields a total which divided by the number of questions 9, added 10 and multiplied by 5 gives a hardness indicator ranging from 0 ( very easy ) to 100 ( very hard ). For M381 TMA01 (( 0 - 1 + 0 + 1 + 2 + 0 + 1 + 1 + 2 ) = 6 * 5 / 9 + 10 ) * 5 = 75.
So when I say that M381 TMA01 was hard you know exactly what I mean. ;-)
You may have noticed that the ratio ( Number Theory points / Mathematical Logic points ) is 2. This is because for this TMA we had to study 2 Number Theory OU booklets and 1 Mathematical Logic OU booklet. For TMA02 this is 2/2.
Tidak ada komentar:
Posting Komentar