OC330671

Elite Note Taker
87Uploads
44Likes
0Blog Articles
All Activity
Uploads (87)
Blog Articles (0)
Homework Help (0)
QUEEN'SCISC 365Robin W DawesFall

[CISC 365] - Final Exam Guide - Comprehensive Notes for the exam (60 pages long!)

OC33067160 Page
29 Nov 2016
6
Dijkstra"s algorithm works by building a set r (for reached) of vertices for which the shortest route from a has been found. On each iteration one more
View Document
QUEEN'SCISC 327James R CordyFall

[CISC 327] - Final Exam Guide - Comprehensive Notes for the exam (34 pages long!)

OC33067134 Page
29 Nov 2016
3
Cisc 327: week 1: class 3: software process models. Roughly, each layer of the spiral corresponds to one phase of the waterfall (although there are no
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 13: American Broadcasting Company, Substring, Subsequence

OC3306717 Page
21 Nov 2016
6
Review of the dynamic programming solution for subset sum. Let s = { } and let the target value be k. Suppose there is a subset s* of s that sums to k.
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 12: Brie, Dynamic Programming

OC3306716 Page
21 Nov 2016
3
We began our study of dynamic programming by considering a problem: Given a rectangular grid with rows numbered 0,,n and columns numbered 0,,m, With (0
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 11: Without Loss Of Generality, The Algorithm

OC3306712 Page
21 Nov 2016
4
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 10: Huffman Coding, Bit Array, Binary Tree

OC3306717 Page
21 Nov 2016
3
We have a set of activities to choose from, but some of them overlap. We want to choose the largest possible set of non-overlapping activities. A greed
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 8: C Max, Message Passing, While Loop

OC33067111 Page
21 Nov 2016
3
Fortunately, most of the reductions that we do in practice are far less arduous than the cnf-sat to k-clique reduction. For most new problems we are li
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 9: Daihatsu Delta, Merge Sort, If And Only If

OC3306716 Page
21 Nov 2016
1
Another surprising and satisfying application of the d&c method is the following algorithm for nding the closest pair of points in a set of points in t
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 7: Boolean Expression, Metar

OC3306713 Page
21 Nov 2016
4
Example of a demonstration that a problem is np-complete by reduction from cnf-sat. Cnf- sat - we already know this, thanks to cook and levin. We need
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 5: Metar, Non-Deterministic Turing Machine, Halting Problem

OC3306713 Page
21 Nov 2016
2
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 6: Boolean Expression, Np-Hardness, Metar

OC3306714 Page
21 Nov 2016
3
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 4: Kijiji, Subset Sum Problem

OC3306712 Page
21 Nov 2016
10
View Document
QUEEN'SCISC 327James R CordyFall

CISC 327 Study Guide - Comprehensive Midterm Guide: Software Quality Assurance, Quality Assurance, Software Development Process

OC33067134 Page
5 Oct 2016
18
Cisc 327: week 1: class 3: software process models. Roughly, each layer of the spiral corresponds to one phase of the waterfall (although there are no
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 2: Brie, Fibonacci Heap

OC3306712 Page
25 Sep 2016
19
To everyone"s amusement, we spent much of the lecture time locked in combat with the av equipment. We did manage to trace through the execution of dijk
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 1: The Algorithm

OC3306712 Page
25 Sep 2016
31
Dijkstra"s algorithm works by building a set r (for reached) of vertices for which the shortest route from a has been found. On each iteration one more
View Document
QUEEN'SCISC 365Robin W DawesFall

CISC 365 Lecture Notes - Lecture 3: Prims, Ion, Nyishi (Tribe)

OC3306713 Page
25 Sep 2016
7
We started with a sketch of the proof that dijkstra"s algorithm correctly nds the least-weight paths from a to all other vertices in the graph. Claim:
View Document
QUEEN'SCISC 327James R CordyFall

CISC 327 Lecture Notes - Lecture 4: Capability Maturity Model, Software Quality Assurance, Quality Assurance

OC3306717 Page
25 Sep 2016
9
View Document
QUEEN'SCISC 327James R CordyFall

CISC 327 Lecture Notes - Lecture 3: Spiral Model, Waterfall Model, Software Prototyping

OC3306716 Page
25 Sep 2016
17
Cisc 327: week 1: class 3: software process models. Roughly, each layer of the spiral corresponds to one phase of the waterfall (although there are no
View Document
QUEEN'SCISC 327James R CordyFall

CISC 327 Lecture Notes - Lecture 6: Software Quality Assurance, Extreme Programming, Test Automation

OC3306714 Page
25 Sep 2016
6
Cisc 327: week 2: class 3: software quality assurance. Agile development: a group of software development methods. Welcome changing requirements, even
View Document
QUEEN'SCISC 327James R CordyFall

CISC 327 Lecture Notes - Lecture 2: Visicorp, List Of Kings Of Rohan, Quality Control

OC3306718 Page
25 Sep 2016
7
View Document
QUEEN'SCISC 327James R CordyFall

CISC 327 Lecture Notes - Lecture 1: Radiation Therapy, Formal Methods, Campaign For Real Ale

OC3306717 Page
25 Sep 2016
12
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC 223 Study Guide - Final Guide: General Electric Cf6, Loop Invariant, Cision

OC33067115 Page
4 Apr 2016
35
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 223Kai T SalomaaWinter

CISC223 Final: CISC223_11

OC3306717 Page
26 Mar 2016
26
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_12

OC3306717 Page
26 Mar 2016
15
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_10

OC33067110 Page
26 Mar 2016
12
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_09

OC3306715 Page
26 Mar 2016
9
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_07

OC3306719 Page
26 Mar 2016
15
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_08

OC3306718 Page
26 Mar 2016
11
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_04

OC3306719 Page
26 Mar 2016
21
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_02

OC3306718 Page
26 Mar 2016
12
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_03

OC3306717 Page
26 Mar 2016
18
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_05

OC3306716 Page
26 Mar 2016
20
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_01

OC3306716 Page
26 Mar 2016
12
View Document
QUEEN'SCISC 223Kai T SalomaaWinter

CISC223 Final: CISC223_06

OC3306718 Page
26 Mar 2016
17
View Document
QUEEN'SCMPE 223Kai T SalomaaWinter

CMPE223 Lecture 11: week11

OC33067114 Page
26 Mar 2016
11
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 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 18: Popular Alternative, Tree Traversal, Binary Tree

OC3306712 Page
21 Mar 2016
27
The most popular alternative to bfs is depth-first search. As the name suggests, dfs always tries to move forward to a new level before backing up and
View Document
QUEEN'SCMPE 223Kai T SalomaaWinter

CMPE223 Lecture 10: week10

OC33067115 Page
18 Mar 2016
21
View Document