C
C
CS61B Textbook
Search
⌃K
Contributors
DISCLAIMER
1. Introduction
2. Lists
3. Testing
4. Inheritance, Implements
5. Generics and Autoboxing
7. Packages and Access Control
9. Extends, Casting, Higher Order Functions
11. Subtype Polymorphism, Comparators, Comparable
12. Exceptions, Iterators, Object Methods
13. Asymptotics I
14. Disjoint Sets
15. Asymptotics II
16. ADTs and BSTs
17. B-Trees
18. Red Black Trees
19. Hashing I
20. Hashing II
21. Heaps and Priority Queues
22. Tree Traversals and Graphs
23. Graph Traversals and Implementations
24. Shortest Paths
25. Minimum Spanning Trees
26. Prefix Operations and Tries
27. Software Engineering I
28. Reductions and Decomposition
29. Basic Sorts
30. Quicksort
31. Software Engineering II
32. More Quick Sort, Sorting Summary
33. Software Engineering III
33.1 Candy Crush, SnapChat, and Friends
33.2 The Ledger of Harms
33.3 Your Life
33.4 Summary
33.5 Exercises
34. Sorting and Algorithmic Bounds
35. Radix Sorts
36. Sorting and Data Structures Conclusion
37. Software Engineering IV
38. Compression and Complexity
39. Compression, Complexity, P = NP
Powered By GitBook
Comment on page

33.5 Exercises

Note: there are no exercises for this chapter.
For the final exam, there is no need to specifically study this lecture. Any questions relevant to software engineering will be based more on experience with projects than specific terminology and lecture material.
Previous
33.4 Summary
Next
34. Sorting and Algorithmic Bounds
Last modified 7mo ago