Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CPSC 2380- Algorithms

This class was created by Brainscape user ૮꒰ ˶• ༝ •˶꒱ა ♡ 💗 ଘ(੭*ˊᵕˋ)੭* ੈ♡‧₊˚ ૮₍ ˶• ˔ ต ₎აପ૮๑ᵔ ᵕ ᵔ๑ აଓ 💗. Visit their profile to learn more about the creator.

By: ૮꒰ ˶• ༝ •˶꒱ა ♡ 💗 ଘ(੭*ˊᵕˋ)੭* ੈ♡‧₊˚ ૮₍ ˶• ˔ ต ₎აପ૮๑ᵔ ᵕ ᵔ๑ აଓ 💗
Start Studying

Decks in this class (13)

Chapter 0, 1 (intro)
Deciding on the proper algorithm,
What is an algorithm,
Fundamentals of algorithmic probl...
59  cards
Ch 1.1 and Dynamic Arrays 1.1
Use ___ to create dynamic arrays ...,
When we create a 2d dynamic array...,
Euclid s algorithm for computing ...
3  cards
1.2 Fundamentals of Algo Problem Solving
An input to an algorithm specifie...,
The central assumption of the ram...,
Algorithms designed to be execute...
13  cards
1.3- problem types
Sorting problem,
Sorting key,
A sorting algorithm is called ___...
16  cards
1.4- data structures
Defined as a particular scheme of...,
____ is a sequence of n items of ...,
Strings composed of zerosand ones...
45  cards
2.1- Analysis framework
Also called time complexity indic...,
Also called spacecomplexity refer...,
It is preferable to measure size ...
16  cards
2.2- Asymptotic Notation/ Basic Efficiency Classes
To compare and rank such ordersof...,
Class 1constant,
Class log nlogarithmic
9  cards
2.3- Math Analysis of Nonrecursive Algorithms
1 decide on a parameter or parame...,
Check whether all theelements in ...,
Algorithm binary n input a positi...
3  cards
2.4 Mathematical Analysis of Recursive Algorithms
Play an important rolenot only in...,
The method s idea and the reason ...,
General planning for analysis of ...
4  cards
Ch2 ppt Fundamentals of Analysis of Algorithm Efficiency
The time required by the algorithm,
The time required by the algorithm,
Analyzing the running time effici...
27  cards
Ch 3.1 brute force, exhaustive search, & selection sort
A straightforward approach to sol...,
Consider the exponentiation probl...,
The consecutive integer checking ...
32  cards
3.2- Sequential Search & Brute-Force String Matching
A simple extra trick is often emp...,
Improvement can be incorporated i...,
Sequential search provides an exc...
6  cards
3.1 stack and queue
Stack abstract data type,
Lifo last in first out,
Queues
6  cards

More about
CPSC 2380- Algorithms

  • Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study ૮꒰ ˶• ༝ •˶꒱ა ♡ 💗 ଘ(੭*ˊᵕˋ)੭* ੈ♡‧₊˚ ૮₍ ˶• ˔ ต ₎აପ૮๑ᵔ ᵕ ᵔ๑ აଓ 💗's CPSC 2380- Algorithms flashcards now!

How studying works.

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.

Learn more about spaced repetition

Add your own flashcards.

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!

What's Brainscape anyway?

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....

Looking for something else?

CPSC 355
  • 11 decks
  • 293 flashcards
  • 18 learners
Decks: High Level Architecture, Armv8 A Architecture, Binary Numbers And Integer Representatio, And more!
Algorithms
  • 17 decks
  • 374 flashcards
  • 176 learners
Decks: Two Sum, Sql Orm, Javascript, And more!
Find Flashcards
Make Flashcards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions