CS2103 · Data Structures and Algorithms
4 credits · 64 contact hours · Semester 3
Course content.
Abstract data typesAsymptotic analysisArrays, linked structures, stacks and queuesTrees, heaps, hash tables and graphsSorting and searchingGreedy methods and dynamic programmingImplementation trade-offs and complexity testing
Assessment.
Written examination 55%Programming assignments 30%Laboratory performance 15%







