Exams  official list
General handbook
don’t stress yourself out too much, first year doesn’t count towards your degree
 LaundryView
 Common Outside Course Options for Informatics Students
 Year 1 Google Drive
 mailing list archives  ug1students
 if you have a learning disability go to the disability service! make sure you go there long before the exams, it only takes few hours and can help you quite a bit.
 Semester 2: Programming Club
Calculus and its Applications piazza, webassign, drps
 Course outline
 MathBase timetable
 Notes from an awesome person who did the course last year, Joe (src)
 Cheat sheet PDFs of the definitions and theorems to save you time in the exam (no need to search through the textbook)
 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
Cognitive Science piazza  drps, info, papers April/May exam
 Book about neural networks  recommended by the lecturer
 3Blue1Brown  really clear videos explaining neural networks and backprop
 Visualising Clustering  video from Google
 Deduction vs Induction
 Word learning models  concept map with key ideas
 Amazing flash cards  key definitions
 Full course notes and posters  2018
Priority reading list
All of the readings are examinable, but if you want to prioritise, here is the recommended order:
 Chapters 1, 2, 3, 4 and 7 of Pinker’s “Words and Rules”, minus places where there’s no relevance to lecture content
 Chapter 4 of Harley’s “Psychology of Language”
 Any academic paper covering something you’re not sure you fully understand. For example, if you’re not 100% clear on perceptrons, have a look at the Gurney reading
Data and Analysis fb, tutorials, piazza  drps, info, papers April/May exam
you can pass by just learning the slides
 Last year’s blog
 Past exam solutions
 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
 DA Quizlet
INF1A  Functional Programming 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 Haskellmode on Emacs)
INF1A  Logic tutorials
 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
 boolexman (boolean expression manipulator)
 Visualizing satisfiability, validity & entailment
 Soundness and Completeness
 Finite State Machines
 Regular Expressions
Object Oriented Programming piazza, labs  drps, info, papers April/May exam
the key to passing is practicing
 Allocations: tutorials, labs
 Offline version of lab work
 Online book
 Enable auto complete on Eclipse
 Past papers, and their additional files
 Some past paper answers
 Automarker service  use this to mark your past papers
 Lambda functions tutorial
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. Tripcheck 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.
Proofs and Problem Solving
 Printable notes with all of the course material
 Twelvefold way for combinatorics problems.
 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.
 Cheatsheet with all the notations, definitions, theorems, propositions, and examples from the textbook (condensed into 38 pages) grouped by sections: pdf, source