This course provides a comprehensive study of data structures and their applications in algorithmic problem solving and data analytics. Students will master pointers, dynamic memory, and structures, then advance to linear and non-linear data structures, including arrays, linked lists, stacks, queues, trees, graphs, and hashing. The course emphasizes algorithm analysis, efficiency, and practical applications such as searching, sorting, divide-and-conquer, and greedy algorithms, preparing students for analytical and computational problem-solving in IT environments.
- Teacher: PAULO DUGA