Better Informatics

Calculus and its Applications drps, piazza, webassign Edit

• Fox’s notes (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 Edit

• 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](/static/year1/Word Learning Models.pdf) - 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 Edit

• 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 | drps, info ,papers Edit

• 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)
• Functional Programming blog/tutorials by Kyle Cotton

INF1A - Logic tutorials | drps, info ,papers Edit

• 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
  • FSM Workbench (also contains subset construction)
  • simulator, regex/automaton converter
• Regular Expressions
  • regex/automaton converter
  • Learn Regex Interactively
  • Learn Regex The Easy Way
  • Learn about regular expressions (has a great cheatsheet)

Introduction to Linear Algebra drps Edit

the maths exams are open book, so take in past paper solutions (with an index) 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
• Subspaces, basis etc
• Cheat sheet PDFs of the definitions and theorems to save you time in the exam (no need to search through the textbook)
• 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)

Logic 1 course page, homework, tutorial videos Edit

• 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: P becomes ~~P
  • r, repetition: P becomes P
  • mp, modus ponus: P -> Q, P becomes Q
  • mt, modus tollens: P -> Q, ~Q becomes ~P
• Kinds of derivations:
  • dd, direct derivation (2,dd means 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
• Definitions:
  • 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.

Object Oriented Programming piazza, labs | drps, info ,papers Edit

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. 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.

Proofs and Problem Solving Edit

• 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