Brainscape's Knowledge GenomeTM

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


See full index

Data Structures > Chapter 1 - 4 > Flashcards

Chapter 1 - 4 Flashcards

1
Q

Abstraction

A

The generic viewpoint of a system.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Abstract Data Type (ADT)

A

Data Type whose properties are specified independently

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Application

A

User level. Solves the problem. Create instances

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Abstract

A

What does the data type do?
Interface

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Implementation

A

How the data type works.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Preconditions

A

Things needed for the methods to work

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Postconditions

A

The results of the method

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Benefits of using interfaces

A

Noticing syntactical errors,
alternate implementations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Polymorphism

A

An object that can be referenced with different classes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Stack

A

LIFO struture

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Collection

A

An object that holds other objects

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Exceptional Situations/Deviant Cases

A

Where a exception is thrown, where the case is not normal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Balanced Expressions

A

When the open and closed expressions are correctly matched

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Self-referential class

A

a class that includes a reference to an object within of the same class

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Three complexity cases

A

Best Case, Average Case, Worst Case

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Best Case Complexity

A

The minimum number of steps required by an algorithm

17
Q

Average Case Complexity

A

The average number of steps required by an algorithm

18
Q

Worst Case Complexity

A

The maximum number of steps required by an algorithm

19
Q

Complexity case used for analysis

A

Worst Case Complexity

20
Q

O(1) Bounded Time

A

The amount of work is not dependent on the size of the problem

21
Q

O(log2N) Logarithmic Time

A

Algorithms that cut the time in half each step

22
Q

O(N) Linear Time

A

Number is proportional to the steps of N

23
Q

(O)NLogN

A

repeating algorithm (same as Log multiplied by N)

24
Q

(O)N^2 Quadric Time

A

nested for loops, multiple iterations within iterations

25
Q

(O)2^N Exponential Time

A

traveling sales man, worst case

26
Q

recursive definition

A

a method defined within itself, base case

Data Structures (1 decks)

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