Prerequisites: instructor approval based on basic programing proficiency. This course teaches basic and advanced data structures such as linked lists, search trees, heaps, hash tables, etc ... It also covers algorithm design techniques like divide and conquer, transform and conquer, dynamic programming and greedy approaches. These techniques are applied to a variety of problems including sorting, graph problems, numerical problems, string processing. No degree credits for CS majors.