COMPTNG 60
Data Structures and Algorithms
Description: Lecture, three hours; discussion, one hour; laboratory, five hours. Enforced requisites: course 10B, Mathematics 31A, 31B, 61. Review of basic data structures: arrays, stacks, queues, lists, trees. Advanced data structures: priority queues, heaps, balanced trees. Sorting, searching techniques. Corresponding algorithms. P/NP or letter grading.
Units: 4.0
Units: 4.0
Last Name
- Last Name
- First Name
- Number of Ratings
- Avg. Overall
- Avg. Easiness
- Avg. Workload
- Avg. Clarity
- Avg. Helpfulness
1 of 1
No courses so far.
1 of 1
