Chat with other students Better Informatics Feedback Uploading to Drive? Resit exams publication have been released.
General ( handbook )
- Private files…
- View the Quizlet class (see next item to join)
- year issues - google doc
- mailing list archives - ug1-students
- if you have any learning disability go to disability service, you have to arrange few weeks before the exams, it takes few hours and can help you significantly during the exams.
- Course outline
- MathBase timetable
- Notes from an awesome person who did the course last year, Joe (src)
- SympyGamma - a tool similar to WolframAlpha, but also offering explanation for derivations.
- Answers for Essential calculus
- Riemann sums online calculator
- Lots of formulae
- Amazing mindmap
- Tests of Convergence: cheat sheet, flow chart
Computation and Logic ( course page, tutorials )
- Likely exam topics
- Venn diagrams, Karnaugh maps, truth table
- Conversion to CNF and Clausal form
- Resolution (see “Understanding Resolution”, Dagmara’s notes)
- Explaining how you would use resolution to determine whether a claim is correct
- Arrow rule + a number of binary options
- Gentzen rules
- Counter example to an attempted Gentzen proof
- Definition of sound and complete
- NFA to DFA conversion
- Representing an FSM by a regular expression
- NOT refutation
- Solution to the original 4d on the take home exam
- The venn diagram generator (based on the official version)
- Definitions (also available on Quizlet)
- CNF cheat sheet
- Propositional formula to CNF converter
- Visualizing satisfiability, validity & entailment
- Finite State Machines
- Last year’s blog
- SQLite Browser is a useful tool exploring and creating SQL databases that can be saved to a single file.
- DbDesigner allows you to design databases online, and convert them to their related SQL queries.
- DTD examples
- XPath Tester
- XPath Tutorial
- A Level Database Wikibook (make sure you visit this on the desktop)
- Visgean’s incomplete notes covering most of the coursework
Functional Programming ( course page, piazza, tutorials )
- Tip by a tutor for the final exam: the exam is open book, so taking in a copy of the previous year’s exam paper and solutions may be beneficial
- Past papers
- Exam allocations
- Tree traversal algorithms (view in desktop mode!)
- Learn You A Haskell (official online book, downloadable for exam)
- Basic/library function list, Handy basic function cheat sheet
- Troubleshooting for Haskell (including Haskell-mode on Emacs)
Introduction to Linear Algebra ( drps )
- Tip from a (current) 3rd year: the maths exams are also open book, so I’d recommend taking in past papers with solutions as they reuse questions a lot. They might not necessarily be the same, but they’ll likely be close enough to give you a hand.
- No bullshit concept maps good for seeing the big picture in the course
- Linear algebra explained in 4 pages good resource to give you general idea. Might be worthwhile to go through it before the start of the course.
- Explanatory videos from Mathapptician
- Khan Academy videos
- Essence of Linear Algebra (videos)
- Answers for Poole (3rd edition, 4th edition)
- 42 - calc app capable of Eigenstuff and other linear algebra
- The Exam - 3 hours - Open Book
Section A: 40% - 6 questions - conceptual questions, a bit like Tophat
Section B: 60% - 4 questions (pick 3) - longer, conceptual questions
You may bring:
- the Poole textbook
- any non-graphical calculator
- any notes (written / printed notes, nothing bound)
Automarker service - use this to mark your past papers
About the exam
- The exam is 2 hours. It used to be 3 hours in previous years. They will not pressure you for time, don’t worry.
- There is a mock exam in week 11.
- All code must compile for ANY credit at all. If you miss a single semicolon, you get 0 marks. Trip-check if it compiles and is the right file before submitting!
Your code must also pass the very basic tests (JUnit tests, these will be provided in the exam for you to check) to get any credit at all.
- The course will follow the book A Concise Introduction to Pure Mathematics, by Martin Liebeck, 4th Ed. 015, CRC Press, £25.99
- To pass the course you must achieve an average of more than 40% AND at least 40% in the examination.
Logic 1 ( course page, homework, tutorial videos )
- These notes assume you have done INF1-CL.
- if P, then Q
- P is the antecedent
- Q is the consequent
- English to implication
P -> Q: If P, Q
P -> Q: P, only if Q
Q -> P: P, if Q
Q -> P: Only if P, Q
- Inference rules:
dn, double negation:
mp, modus ponus:
P -> Q,
mt, modus tollens:
P -> Q,
- Kinds of derivations:
dd, direct derivation (
2,ddmeans that rule 2 is the derivation)
- When a line (which is not a show line) is introduced whose sentence is the same as the sentence on the (closest previous uncancelled) show line, one may, as the next step, write “dd” following the justification for that line, draw a line through the word “Show”, and draw a box around all the lines below the show line, including the current line.
cd, conditional derivation
id, indirect derivation
- An argument is a sequence of sentences, consisting of premises and a conclusion, where the conclusion is what is trying to be established, and the premises, taken together, are alleged to support the conclusion.