Presentation is loading. Please wait.

Presentation is loading. Please wait.

Intro to Maths for CS 2012/13 REVISION WEEK John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.

Similar presentations


Presentation on theme: "Intro to Maths for CS 2012/13 REVISION WEEK John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK."— Presentation transcript:

1 Intro to Maths for CS 2012/13 REVISION WEEK John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK

2 EXAM (Main and Resit) Previously: DIFFERENT LECTURER, exam style, and coverage of material.

3 Structure and Style of Exam uTWO hours. Do TWELVE Questions out of eighteen. uSpend about 8 minutes per question, leaving about 24 minutes for initial planning and final extra checking. uStyle of questions is similar to: l Class Test 6 l Class Test 5 l Term 2 Week 7 exercise set

4 Material Needed for Exam uLecture material except when specified as optional. uRequired textbook reading: l Textbook sections relevant to my lecture material, and mostly specified in my lecture slides. uAll Answer Notes for exercises and tests. uAll Additional Notes hanging from my module webpages, except for material specified as being optional.

5 Content of Exam uIn principle, almost anything in the module except when specified as optional. uIf you can do all the questions in the Term 2 Week 7 exercise set and Class Tests 5 and 6, you should be well set up for the exam. uYou should make sure you can do everything in previous exercise sets and tests, except for the “Fun” quiz.

6 Content of Exam: Some Exclusions uYou will not be asked about: uRelevance to CS uUse of spreadsheets. uCalculation of maxima, minima and inflexions using derivatives. uPhase of trig functions uTrig equations uInverse trig functions (sin -1 x etc) uHyperbolic trig functions (sinh x etc) uLimits of functions: anything beyond the basic idea of a limit

7 Points about Test 6: some miscellanous things: following slides how to do some of the questions: whiteboard

8 Miscellaneous Points about Test 6 uSHOW YOUR WORKING: E.g.: l In finding prime factors or showing something is prime: mention each prime factor you consider and whether it divides into the given number or not, specifying the remainder in the case of factors above 5. l In showing that n and n+1 are co-prime, you need to explain why no integer bigger than 1 divides both. uIn Qn 4(a): the constant in the equation is 30, not 5. CHECK your answer by plugging in x=5 and making sure the equation gives 0. uLEARN the formula for solving quadratic equations, and make sure you have all the details right.

9 Miscellaneous on Test 6, contd uChain rule in differentiation: uE.g. tan(x 2 – x 3 ) uReplacement Phase: l Think of the expression as just: tan X and differentiate it with respect to X to get: sec 2 X l Now restore the expression that X replaced, to get: sec 2 (x 2 – x 3 ) uMultiplication Phase: l Multiply by the derivative of X with respect to x, to get finally: l [sec 2 (x 2 – x 3 )] (2x - 3x 2 )

10 Reminders on Studying uPrevious Exercise Sets and Tests: l Do all the questions on them repeatedly until you can do them confidently and smoothly. l Look at answers first if you need to, but then attempt the questions some time later. uExploit the textbook and its many exercises. uCreate your own exercises by varying the ones you’ve been given. uFeel free to email me or the demonstrators. Tell me if you need to see me. (I’m away May 1 to 5.)

11 QUESTIONS?


Download ppt "Intro to Maths for CS 2012/13 REVISION WEEK John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK."

Similar presentations


Ads by Google