# Class Notes for Robin W Dawes

- 25 Results
- About QUEEN'S

## CISC235 Lecture 1: Week 1

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## CISC 235 Lecture Notes - Lecture 20: Minimum Spanning Tree, Binary Heap, Prims

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## CISC 235 Lecture Notes - Lecture 3: Sorting Algorithm, Merge Sort, Bubble Sort

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## CISC 235 Lecture Notes - Lecture 16: Adjacency Matrix, Adjacency List, Complex Instruction Set Computing

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## CISC 235 Lecture Notes - Lecture 1: Autocomplete

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## CISC 235 Lecture Notes - Lecture 2: Random-Access Machine, Complex Instruction Set Computing, Time Complexity

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## CISC 235 Lecture Notes - Lecture 19: Directed Acyclic Graph, Topological Sorting, Critical Path Method

12

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

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