Algorithms and Data Structures

CTIS 152 is where you learn to actually organize data in memory and reason about how programs manipulate it, moving from writing C that works to writing C that handles dynamic, structured information cleanly. You'll spend the semester building pointers, structs, linked lists, stacks, queues, trees, and basic search/sort routines from scratch, with three lab exams and a performance grade making sure you can code these under pressure rather than just recognize them on paper. It builds directly on your intro C background and becomes the foundation for almost everything downstream — file processing, databases, OO programming — since once you understand pointers and dynamic allocation here, the rest of the CTIS curriculum stops feeling like magic.