CSE 260
3 credits
Second part of a two-semester sequence, CSE 160 and CSE 260. Applies object-oriented programming methodology to data storage and manipulation on complex data sets, such as, binary trees, heaps, priority queues, balanced trees and graphs. Recursive programming is heavily utilized. Fundamental sorting and searching algorithms are examined along with informal efficiency comparisons. Intermediate-level programming language concepts and paradigms, including functional programming, basics of type systems, program and data abstractions, and modularity.
| Section | Days | Time | Room | Instructor |
|---|---|---|---|---|
| LEC 01 | TuTh | 9:30AM–10:50AM | COMPUTER SCI 2120 WESTCAMPUS | Paul Fodor★ 4.8 |