# Class Notes for Computing at Queen's University

QUEEN'SCISC 101Wendy L PowleyFall

## CISC 101 Lecture Notes - Lecture 12: Complex Instruction Set Computing

OC5374884 Page
7 Dec 2017
0
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 2: Tranche, Complex Instruction Set Computing, Null Set

OC25059473 Page
11 Sep 2018
0
We convert the hand shake problem into an official math problem using proper notation. The basic building block will be the set. A set is a collection
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 1: Complex Instruction Set Computing, Discrete Mathematics, Big O Notation

OC25059472 Page
11 Sep 2018
0
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 fina
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 8: Mathematical Induction, Complex Instruction Set Computing

OC25059473 Page
24 Sep 2018
0
A proposition is defined as a statement that is either true or false (e. g. sky is blue, earth is flat). In this course we"ll make declarative statemen
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 9: Mathematical Induction, Complex Instruction Set Computing

OC25059473 Page
28 Sep 2018
0
Think of a sequence of dominoes going on forever. All fall, so long as: domino 1 falls (p(1)) If the kth domino falls, it knocks over the k+1st domino.
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 6: Complex Instruction Set Computing, Binary Number

OC25059473 Page
19 Sep 2018
0
Humans use this system (base 10), using decimal digits 0,1,2,3,4,5,6,7,8,9. It"s equal to: 2 x 103 + 0 x 102 + 1 x 101 + 7 x 100. This can also be figu
View Document
QUEEN'SCISC 121Wendy L PowleyWinter

## CISC 121 Lecture 8: Functions, local variables, scope of variables, comments

OC25059473 Page
28 Jan 2019
0
Only the first encountered will be executed. return true def first_is_shorter(thing1, thing2): if len(thing1) < len(thing2): else: print (first_is_shor
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 12: Mathematical Induction, Injective Function, Bijection

OC25059473 Page
5 Oct 2018
0
We can define n! and (n+1)! using these explicit iterative formulae: n! This is a recursive definition of the factorial function. The factorial functio
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 13: Complex Instruction Set Computing

OC25059473 Page
12 Oct 2018
0
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 10: Mathematical Induction

OC25059473 Page
28 Sep 2018
0
Today, we went through the solutions to this week"s homework (week 3), so the note was very short. Solutions to weekly homework are always posted on th
View Document
QUEEN'SCISC 101Wendy L PowleyFall

## CISC 101 Lecture Notes - Lecture 9: Complex Instruction Set Computing

OC5374884 Page
7 Dec 2017
0
View Document
QUEEN'SCISC 102D. RappaportFall

## CISC 102 Lecture Notes - Lecture 11: Natural Number, Complex Instruction Set Computing, Modular Arithmetic

OC25059474 Page
2 Oct 2018
0
The sum of the first n odd numbers is n2. Testing some small values of n: n = 1 (1=12), n = 2 (1 + 3 = 4 = 22), n = 3 (1 + 3 + 5 = 9 = 32) Not a proof,
View Document
Showing 1 â€” 12 of 551 results

## Popular Courses

View all courses (60+)

## Popular Professors

View all professors (40+)

Class Notes (1,100,000)
CA (620,000)
Queen's (10,000)
CISC (500)