### General guide, mailing list archives Edit on GitHub

**Facebook Group Chat****Honours hurdles**: refer to your DRPS programme

### DMMR piazza, drive | drps, info, papers December exam Edit on GitHub

**Tip**: If you actually try and do well for the coursework, you’ll need less than 40% in the exam to pass the course.

**Online (flipped-classroom) version of this course. 10x better than the lectures.**

85% **non-calculator** open book exam, 15% across two courseworks. Pass: 40% overall.

In previous years the coursework was assigned weekly, much like the current tutorial questions. That’s now (2018) changed with only two five-question courseworks, each worth 7.5% of the final grade. You’ve still got the weekly tutorial question sheets, but they don’t count towards the final mark.

- Some inf1-cl links may be useful.
- Companion website for textbook
- List of topics per exam
- Trev tutor on DMMR and part 2 - similar to Khan academy
- Course notes by Edwin Onuonga (2017-18)
**Videos**- 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?

- Proofs:
- 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~~[Not examinable 2018]- A great tutorial on Baye’s theorem — read from
*Anatomy of a Test*

### INF2A - Processing Formal and Natural Languages piazza, schedule | drps, info, papers December exam Edit on GitHub

- Useful regex notes can be found here: inf1-cl
- 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

- Automata tutorial - covering most of the lectures
- EBNF to First/Follow Set Generator
- Test if your CFG is LL(1)
- J&M 3ed draft
- Pump your lemma proof template
- I hate the pumping lemma
- 2017/18 coursework 1 - Microhaskell JUnit Tests
- Order of Complexity
- What is a Context Free Grammar?
- Part of Speech tags
**Videos**- Fixing left recursion & factoring
- Playlist: computing first/follow sets and building an LL(1) parse table (step-by-step)
- Viterbi Algorithm
- NFAs and DFAs YouTube Playlist
- NLP course from Columbia some of the videos are very similar to what we have been doing

### INF2C - Computer Systems piazza, tutorials, labs | drps, info, papers December exam Edit on GitHub

- Binary number system
- MIPS - visit this page for lots of resources on MIPS
- Tools:
- Datapath:
- Logic Design:
- Caches:
**Logistics**- Labs are drop in, and aren’t compulsory.
- Exam pass requirement: 40% overall (exam+coursework combined), and 40% in the exam

### INF2C - Software Engineering piazza | drps, info, papers December exam Edit on GitHub

- No book is
*essential*for this course. - Exam,
**closed book**:- Pass requirement: 40% overall (exam+coursework combined), and 40% in the exam

**Detailed lecture notes**by Bora M. Alper: pdf, source- UML Basics: introduction, class diagram, sequence diagram
- Presentation about UML
- Software Requirements Document for a Curricular Information System
- Use Case Scenario/Diagram Example
- 2017’s coursework, “a tour guide app”:
- 2016’s coursework content, “a restaurant order-management system”: