This course provides a practical introduction to essential data structures (including stacks, queues, sets, trees, and graphs) and foundational algorithms for sorting, searching, and traversal. You’ll learn how to select and implement the right structure or algorithm for real-world problems, balancing efficiency and functionality.
The course also emphasizes algorithm complexity analysis, teaching you to use Big-O notation to evaluate and compare the performance of different approaches.
Through hands-on exercises using predefined software libraries, you will apply these fundamental concepts in real problem solving.
By the end, you’ll be equipped to choose data structures and algorithms effectively in your programming projects.
Course Master:
Term:
Fall 2025
Discipline:
CS (Computer Science)
Credits:
4 credits
Type:
Regular
Level:
Undergraduate
Can be taken twice for credit?:
No
Exam Date:
Thursday, December 11, 2025 - 19:00
Pre-requisites:
CS1040GE110 OR CS1040 OR CS1040CCD
Co-requisites:
None
