This class was created by Brainscape user Adam A. Visit their profile to learn more about the creator.

By:
Adam A

- decks
- flashcards
- learners

Introduction

What does a problem,

What is each allowed input to the...,

What is an algorithm for problem p

33
cards

Big Everything and Proofs

Put the following in order of siz...,

What are the 5 different types of...,

Roughly speaks f n e of the follo...

32
cards

Little Everything

What is the intuition for little ...,

What is the little oh definition ...,

In general what do you need to do...

25
cards

Intro to Recurrence Relations

What is the definition of n,

What is the recursive algorithm f...,

What is the iterative algorithm f...

6
cards

Graphs and Trees

What is the definition of a graph,

What is adjacent and incident,

Define walk path cycle

24
cards

Mid-Term 2

In general what are the two prope...,

How do you prove the greedy choic...,

How do you prove the optimal sub ...

23
cards

matrices

What is the run time to matrix su...,

What is the naive algo for matrix...,

For matrice multiplication what h...

10
cards

Linear Programs

What is linear programming what d...,

Define the following from the pro...,

What is the definition of the hal...

19
cards

Binary Multiplication

Up to what size number n can two ...,

What is the efficiency of the fol...,

What is the algorithm for binary ...

19
cards

Intro - Dynamic Programming

What is tabulation what type of a...,

What is the code for fibonacci us...,

What is the run time of fibtabula...

27
cards

Dynamic Knapsack

As a review what is the input and...,

What do we need to output,

Why doesnt densest first solve th...

9
cards

Average Case

What is the intuition behind aver...,

What is the definition of expecta...,

Find the expectation of t for the...

13
cards

QuickSort

What is the general idea and base...,

What are the 3 pivot choices and ...,

What is the quicksort code for a ...

5
cards

Greedy choice proofs

What does it mean to say that alg...,

Prims algorithm what is the proof...

2
cards

Optimal Substructure proofs

What does the optimal substructur...,

To prove optimal substructure pro...,

What is the proof of the optimal ...

7
cards

Substitution Practice

Find the closed form express for ...,

Find the closed form expression f...,

Find the closed form of the follo...

4
cards

Palindromes

What is the definition of a palin...,

What is the definition of a subse...,

What is the definition of the lon...

8
cards

General Algos

What is the divide conquer and co...,

What is the recursive formula for...

2
cards

Finals

Prims algo,

Dynamic programming longest palin...,

Dynamic programming longest palin...

30
cards

comp 2080 algos

- Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study Adam A's Comp 2080 Algos flashcards for their University of manitoba class now!

Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.

Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!

Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.

We use an adaptive study algorithm that is proven to help you learn faster and remember longer....

- 21 decks
- 1523 flashcards
- 18 learners

Decks:
Acupuncture Techniques, Herb Category Drills, C H Cool The Blood Practice Questions, And more!