|DMMR||St. Leonards Land (see "View")||Friday 8th, 2:30 - 4:30|
|INF2C-CS||See "View"||Wednesday 13th, 2:30 - 3:30|
|INF2A||Appleton and Pleasance, (see "View")||Friday 15th, 2:30 - 4:30|
|INF2C-SE||St. Leonards Land (see "View")||Monday 18th, 2:30 - 3:30|
General guide, mailing list archives
Honours hurdle: Entry to Honours requires passes at 50% or above at the first attempt in at least 40 credit points’ worth of the Informatics 2 courses listed together with passes in all remaining compulsory courses, or the permission of Head of School.
INF2 Feedback: The Google Form for feeding back to the INF2 Year Reps is here!
Tip: If you actually try and do well for the coursework, you’ll need less than 40% in the exam to pass the course.
85% non-calculator open book exam, 15% across 9 assessments. Pass: 40% overall.
- Useful notes: logic-1, inf1-cl
- Companion website for textbook
- List of topics per exam
- Trev tutor on DMMR and part 2 - similar to Khan academy
- Surjective and Injective functions
- Proof by Induction
- Strong Induction
- RSA Encryption Example - two parts: computing an example, generating the keys
- Introduction to Combinations, Introduction to Permutations
- Permutations: accounting for repetitions
- Relations and the different kinds of relations… and equivalence relations. This guy is great, isn’t he?
- Worksheet: Proofs involving functions - with sample proof + proving injectivity/surjectivity
- by Induction: solutions to an MEI question (todo)
- 2016 worksheet page
- Congrugence modulo (Khan Academy)
- Order of Complexity
- A great tutorial on Baye’s theorem — read from Anatomy of a Test
- Useful regex notes can be found here: inf1-cl
Assignment 2: given 17th Nov, due 1st Dec
- Exam: it’s a closed book written 2hr exam:
- 5 compulsory short questions (10% each)
- a choice of 2 out of 3 longer questions (25% each)
- Pass: 40% overall, no exam/coursework hurdle
- (do NOT forget honours hurdle mentioned at the top of the page!)
- Automata tutorial - covering most of the lectures
- EBNF to First/Follow Set Generator
- J&M 3ed draft
- Pump your lemma proof template
- 2017/18 coursework 1 - Microhaskell JUnit Tests
- Order of Complexity
- Viterbi Algorithm
- What is a Context Free Grammar?
- Part of Speech tags
Revision Hive Mind doc: CLICK ME
- Binary number system
- MIPS and Arrays:
- MIPS and The Stack:
Coursework 1 (2017/18) - Task B unit test (pig latin)
- Logic Design:
- Labs are drop in, and aren’t compulsory.
- Exam pass requirement: 40% overall (exam+coursework combined), and 40% in the exam
- No book is essential for this course.
- Exam, closed book:
- Pass requirement: 40% overall (exam+coursework combined), and 40% in the exam
- UML Basics: introduction, class diagram, sequence diagram
- Presentation about UML
- Software Requirements Document for a Curricular Information System
- Use Case Scenario/Diagram Example
- Checklist for last SE coursework:
- ☑ implement the code
- ☑ write javadoc for Displacement class
- ☑ Displacement tests
- ☑ ControllerImp tests
- ☑ log the code
- ☑ get a logged output
- ☑ plus submitting your team report and an individual diary-ish report
- 2016’s coursework content, “a restaurant order-management system”: