CSIT 341 Data Structures
This course covers a review of fundamental data structures and an analysis of algorithmic, time, and space complexities. Topics include bitwise operations, pointers, dynamic memory allocation, arrays, matrices, and memory management. Students will study lists (single and doubly linked), stacks, queues, binary trees, and binary search trees. The course also explores recursion, tree traversals, balanced binary trees, expression trees, and advanced hierarchical structures such as n-ary trees, heaps, and priority queues. Additional topics include hashing, basic graph algorithms, and their applications.
Credits
3
Offered
Every Fall semester