Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

cmsc 132

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

By: Kelli Webber
Start Studying

Decks in this class (19)

#2 enum + cmsc131 review
Enumerated types 1,
Enum example 2,
3 enumerated type methods 3
6  cards
#3 cmsc131 review
Overloading 1,
Scope 2,
Characteristics of a static method 3
8  cards
#4 inheritance + cmsc131 review
Keyword extends 1,
Original class is called 2,
Class defined from original class...
10  cards
#5 inheritance (2.1 +2.2)
Override 1,
Dynamic dispatch late binding dyn...,
Nonstatic how is overriding deter...
15  cards
#6 inheritance + cmsc131 review
Object class 1,
2 methods of the object class 2,
What does default tostring do 3
5  cards
#7 abstract classes + cmsc 131 review
Initialization block 1,
Initialization block vs 2,
Order of initialization 3
5  cards
#8 abstract classes + error-handling + exceptions
How is an abstract method similar...,
Where are abstract methods implem...,
What makes a class abstract 3
7  cards
#9 error-handling + exceptions + generics
How to exit the program if an err...,
Error handling with exceptions 2,
Exceptions are objects derived fr...
9  cards
#12 inner classes + linear data structures
Nested class static nested class 1,
List 2,
1st element in list 3
6  cards
#10 generics + wild card
Define a generic class 1,
Instantiate something of a generi...,
What types can be used in generic 3
12  cards
#11 inner classes
Type erasure 1,
Advantage of generics 2,
Inner class 3
10  cards
#13 linear data structures
Special cases list 5 of them 1
1  cards
#14  linear data structures
Array advantages 1,
Array drawbacks 2,
Linked list advantages 3
7  cards
#15  linear data structures + algorithm analysis
Purpose of an equals method 1,
Getclass 2,
Instanceof 3
6  cards
#16 algorithm analysis
Upper bound 1,
Big o formal definition 2,
Asymptotic complexity 3
4  cards
#18 algorithm analysis
Types of cases 1,
Best case 2,
Worst case 3
5  cards
#19 algorithm analysis
Sequential or linear search 1,
Binary search 2,
Amortized 3
3  cards
#20 algorithm analysis and recursion
Upper bound 1,
Lower bound 2,
Exact bound both lower and upper 3
6  cards
O(n)
Smallest to largest 1,
Big o 2,
Big theta 3
4  cards

More about
cmsc 132

  • Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study Kelli Webber's cmsc 132 flashcards for their University of Maryland-College Park class 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?

Find Flashcards
Make Flashcards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions