Skip to content
docs.nickf.me
3. Exam 1 Review
Initializing search
Welcome to docs.nickf.me
Pitt
Projects
docs.nickf.me
Welcome to docs.nickf.me
Pitt
Pitt
CS0445
CS0445
1. Foundations
2. Basic Data Structures
3. Exam 1 Review
4. Exam 2 Review
ADTs
ADTs
1. Queues
2. Stacks
3. Lists
4. Hashmaps
5. Sets
Algorithms
Algorithms
1. Efficiency of Algorithms
2. Searching
3. Bubble Sort
4. Insertion Sort
5. Selection Sort
6. Shell Sort
7. Merge Sort
8. Count Sort
9. Radix Sort
10. Quick Sort
11. Quick3 Sort
12. Recursion Optimization
13. Brute Force Pattern Matching Algorithm
14. Knuth-Morris-Pratt Pattern Matching
15. Boyer-Moore Pattern Matching
16. Rabin-Karp Pattern Matching
17. Stability and In Place Sorting Algorithms
CS0447
CS0447
1. Number Bases and Arithmetic
2. Numerical Data Representation
Assembly
Assembly
1. Programs, Instructions, Registers
2. Memory and Addresses
3. Arrays
4. Control Flow
5. Functions
6. Bitwise Operations and Bitfields
7. Fractions and Floating Point
8. Multiplication and Division
Logic
Logic
Finite-State Machines
11. Pipelining
12. Extras
1. Logic Basics
2. Circuits and Plexers
3. Minimization and K-Maps
4. Sequential Logic
5. The Register File and Building an ALU
6. Program Counter
7. The Interconnect, Control, and Instruction Decoding
8. Single-Cycle CPU
9. Multicycle Design
Projects
Projects
Shower Thoughts
Shower Thoughts
Shower Thoughts
3. Exam 1 Review
Exam 1 covers foundations, queues, stacks, and lists.