1
Q
When we design a program, we organize it into ____. What are the two modules?
A
2
Q
We wish to keep information in a module ____
A
Private
3
Q
What does an interface define?
A
4
Q
What is an ADT? What are its parts?
A
5
Q
ADT descriptions are what? What do they do?
A
6
Q
The ADT Dictionary/Map has what three important methods?
A
7
Q
What are the two general principles of ADTs?
A
Information hiding and reusability
8
Q
What is information hiding?
A
9
Q
What is Re-usability?
A
10
Q
What is the Java Interface for an ADT Dictionary?
A
11
Q
What is the Java Implementation for an ADT Dictionary?
A
CS2210: DSA
flashcards
Decks in class (16)
# Cards
-
Week 1: Search Problem, Linear Search, Binary Search21
-
Week 2: Analysis of Algorithms24
-
Week 2: Recursive Algorithm Time Complexity17
-
Week 3: Hashing16
-
Week 3: Java ADT11
-
Week 4: Trees29
-
Week 4: Binary Search Trees16
-
Week 5: AVL Trees13
-
Week 5: Multi-Way Trees13
-
Week 5: 2,4 Trees10
-
Week 6: B-Trees8
-
Week 6: Graphs17
-
Week 6: Graph Traversals5
-
Week 6: Shortest Paths6
-
Week 6: Minimum Spanning Trees3
-
Week 6: Directed Graphs8
