School of Mathematics * Service Teaching * Foundation Studies * 0N1: MATH19861 * 0N1 FAQ

MATH19861 (0N1): Frequently Asked Questions

Last changed 29 November 2017

  1. How many questions will there be in the exam? ANSWER: 8. In January 2018 the examination paper will consist of 8 questions, each worth 10 marks. Any six of these questions should be answered. 
  2.  What is a marking scheme for the exam? ANSWER: You have to answer 6 question, each worht 10 points. The mark will be out of sixty and will count 60 percent of the credit for this unit. A mark of 60/60 for the exam plus 100 percent in coursework will allow 100 percent to be scored for the course unit.
  3. If I answer more than 6 questions but then pick the best 6 answers and eliminate the rest, will the 6 I picked be marked regardless if there are eliminated answers in between? ANSWER: Yes, they will, but please make sure that the questions are  crossed out in a very obvious, unmistakeable way  -- and crosss their numbers from the table on the front cover of the exam answerbook, if you put these numbers there.
  4. Will the formulae booklet provide the list of all the Boolean algebra required for the 0N1 exam, or must we learn all of them? ANSWER: In this particular course unit, no calculators or formula tables can be used in tutorial classes or in the examination. The last page of the examination paper will contain the list of basic logical equivalences (please see old exam papers online to check how the list looks). 
  5. In the exam, will the Boolean algebra list be in the last page too or just the list of logical equivalences? ANSWER: Only the list of logical equivalences. Boolean laws can be easily read from the table of fundamental logical equivalences.
  6. I was wondering if you were able to provide me with my tutorial teacher's name and email address. ANSWER: It is our policy not to disclose tutors' email addresses to students. You need to talk to your tutor at the next tutorial.
  7. Is the mock test an indication as to the topics that will come up on the exam or is it just a random paper? Answer: of course, it is just a random paper.
  8. I can't seem to find the solutions to the past papers. Where will they be or could you put some up please. ANSWER: at BB9 and at the course webpage.
  9. Are calculators allowed in the exam? ANSWER: No.
  10. For the exam paper [YEAR] question [NUMBER], shouldnt it be true because it is a [BLA-BLA]? ANSWER:  When asking questions about specific problems from past exams, tests, homeworks,  always include the full formulation of the problem, typed by yourself (not a smartphone photo). To answer a question sensibly, I have to be sure that a student understands what he/she is talking about, and ability to  reproduce the problem by hand is evidence of some, maybe partial, understading.
  11. "My second question is": Please ask only one question in an email.
  12. Should we consider 0 as part of the natural numbers or not? ANSWER: In this course, 0 is not a natural number. In some textbooks, however, natural numbers start with 0, it is convenitional, for example, in computer science.
  13. Old exam papers mention prime numbers. It was in the old iversion of the course, no longer taught. No prime numbers this year.

Email Policy:

    • Always check  this page, FAQ, before sendiing a question by email.
    • When sending e-mail messages to staff, students should include a meaningful subject line. This should always include the name of the mathematics module e.g. "0N1 Tutorial". Without a meaningful subject line (and especially with a blank subject line) messages are very likely to be mistaken for spam and deleted. 
    • Students are also STRONGLY encouraged to use university e-mail accounts when contacting staff. I reserve the right to delete, without reading, e-mail messages sent from e-maill addresses outside of the University.
    • If you ask questions, ask only one question in an email. If you  need to ask more questions, send them in separate emails with separate subject lines.

    Email: borovik >>at<<
Made with Nvu