ICT-2201: Data Structure and Algorithms

Description
This course introduces students to the basic data structures, and the analysis and design of basic algorithms and their role in the problem solving process, as well as techniques for developing, testing and debugging typical programs. Data structures to be covered include: arrays, linked lists, stacks, queues, lists, hash table and trees, heaps and graphs. The algorithms covered include recursion, sorting, selection, searching, and pattern matching. Lecture: 2 hrs/week; tutorial: 1 hrs/week; Lab: 2 hrs/week