COMP 102 Study Guide - Midterm Guide: Binary Logarithm, Merge Sort, Pagerank

• School: McGill University
• Department: Computer Science (Sci)
• Course: COMP 102
• Professor: Daniel Pomerantz

Document Summary

The difference engine - the initial value / increment / acceleration etc. If a polynomial is nth, then the n+1 number is always fixed. Implementing logical expressions: you are given the responsibility of building an automatic voting machine. Assume there are 2 candidates and 3 voters, everyone gets a single vote. The candidate with the most votes wins: what logical variables would you use, can you write a logical expression, which evaluates who wins (true = candidate a, Implementing variables: voters: v1(t|f), v2(t|f), v3(t|f, winner: winner. T: winner