# Class Notes for Robin W Dawes

QUEEN'SCISC 235Robin W DawesWinter

## CISC235 Lecture 1: Week 1

OC9629362 Page
14 May 2016
17
Equivalently, how would you store a list of existing user-names, so that when a new user selects a user-name you can quickly determine if it has alread
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture 12: CISC_235_29-March-2016

OC8185752 Page
5 Apr 2016
0
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 21: Bit Array, The Algorithm, Bloom Filter

OC33067113 Page
1 Apr 2016
31
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 20: Minimum Spanning Tree, Binary Heap, Prims

OC33067111 Page
26 Mar 2016
25
The generic minimum spanning tree algorithm looks like this: Call a set of edges a safe if there is a mst containing a. Start with a safe set of edges
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 3: Sorting Algorithm, Merge Sort, Bubble Sort

OC3306714 Page
28 Feb 2016
17
We just learned about omega and theta classification for functions and algorithms, but we still haven"t talked about why it is useful to have this info
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 16: Adjacency Matrix, Adjacency List, Complex Instruction Set Computing

OC3306716 Page
15 Mar 2016
13
We saw most of the following definitions and notation in cisc: this information is included here for completeness. Graphs can be viewed as generalizati
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 1: Autocomplete

OC3306713 Page
28 Feb 2016
35
Before getting into the subject at hand, i gave the class a problem to think about: This is a 2- player game using 3 coins. The coins will be used to g
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 2: Random-Access Machine, Complex Instruction Set Computing, Time Complexity

OC3306716 Page
28 Feb 2016
33
We will prefer structure a to structure b if a has a lower order of complexity for the operations we need in our particular application. clarify which
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 15: Merge Sort, Heapsort, Priority Queue

OC33067110 Page
8 Mar 2016
16
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 6: Binary Tree

OC9629363 Page
14 May 2016
14
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 19: Directed Acyclic Graph, Topological Sorting, Critical Path Method

OC3306715 Page
21 Mar 2016
12
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 14: Donald Knuth, American Broadcasting Company

OC3306713 Page
8 Mar 2016
10
In most of our examples we used h(k) = k % m. this may not be a good choice. A well-designed hash function should try to incorporate all the informatio
View Document
Showing 1 — 12 of 25 results

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