CSIT 341 Data Structures

Review of basic data structures and algorithmic complexities; recursion; topological order; Sorting and searching; Huffman codes; tries; binary trees; binary search trees; tree traversals; general trees, heaps, balanced trees; priority queues; hashing; graphs, graph algorithms.

Credits

3

Prerequisite

CSIT 205 or CSIT 221

Offered

Every semester