# OC330671

Elite Note Taker

**87**Uploads

**44**Likes

**0**Blog Articles

All Activity

Uploads (87)

Blog Articles (0)

Homework Help (0)

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

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## [CISC 327] - Final Exam Guide - Comprehensive Notes for the exam (34 pages long!)

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## CISC 365 Lecture Notes - Lecture 13: American Broadcasting Company, Substring, Subsequence

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## CISC 365 Lecture Notes - Lecture 12: Brie, Dynamic Programming

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## CISC 365 Lecture Notes - Lecture 10: Huffman Coding, Bit Array, Binary Tree

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## CISC 365 Lecture Notes - Lecture 8: C Max, Message Passing, While Loop

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## CISC 365 Lecture Notes - Lecture 9: Daihatsu Delta, Merge Sort, If And Only If

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## CISC 365 Lecture Notes - Lecture 7: Boolean Expression, Metar

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## CISC 365 Lecture Notes - Lecture 5: Metar, Non-Deterministic Turing Machine, Halting Problem

2

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

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## CISC 365 Lecture Notes - Lecture 2: Brie, Fibonacci Heap

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## CISC 365 Lecture Notes - Lecture 1: The Algorithm

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## CISC 365 Lecture Notes - Lecture 3: Prims, Ion, Nyishi (Tribe)

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## CISC 327 Lecture Notes - Lecture 4: Capability Maturity Model, Software Quality Assurance, Quality Assurance

9

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

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## CISC 327 Lecture Notes - Lecture 6: Software Quality Assurance, Extreme Programming, Test Automation

6

Cisc 327: week 2: class 3: software quality assurance. Agile development: a group of software development methods. Welcome changing requirements, even

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

12

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

12

## CISC 235 Lecture Notes - Lecture 18: Popular Alternative, Tree Traversal, Binary Tree

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