This course introduces the concept of abstract data types and the advantages of data abstraction. Various commonly used abstract data types including vector, list, stack, queue, tree, and set and their implementations using different data structures (array, pointer based structures, linked list, 2-3 tree, B-tree, etc.) will be discussed. Sample applications such as searching, sorting, etc., will also be used to illustrate the use of data abstraction in computer programming. Analysis of the performance of searching and sorting algorithms. Application of data structure principles.
Course
CSCI2100/ESTR2102 – Data Structures
IERG Required MIEG Required Undergraduate
Co-requisite(s):
Unit(s):
3
Pre-requisite(s):
AIST1110 or CSCI1120 or 1130 or 1510 or 1520 or 1530 or 1540 or 1550 or ESTR1100 or ESTR1102 or ESTR2306 or IERG2080
For senior-year entrants, the prerequisite will be waived.
Exclusion:
ESTR2102 or CSCI2520
Term Offered:
Term 2
Teacher:
Prof. Xiangyu Yue
Remarks: