CISC 102 Study Guide - Fall 2018, Comprehensive Quiz Notes - Complex Instruction Set Computing, Mathematical Induction, Empty Set
5 Nov 2018
School
Department
Course
Professor
34
CISC 102 Full Course Notes
Verified Note
34 documents
Document Summary
Weekly homework will be solved in class on due date. Quizzes and final exam are based on homework questions. If you miss a quiz, the weight of the final increases by 15% Attendance will not be taken but it is recommended to go. According to a recent poll, the preferred employer is google. Professor rappaport has interview tips from an applicant to google. #1 tip algorithm complexity: you need to know big-o. If you struggle with basic big-o complexity analysis, then you are almost guaranteed not to get hired. Mastering discrete mathematics is the direct pre-requisite to mastering algorithms and complexity. You should view this course as a language course. You will be learning the language of mathematics and computing. Note: big-o notation is a type of asymptotic notation. Describes limiting behaviour of a fn that tends towards a value/infinity. Key equation consists of the most important concepts in mathematics:
