This course introduces students to data structures as it relates to how data is organized and processed, to equip students with the requisite skills in the analysis and implementation of algorithms for problem-solving. The topics treated here include Pointers and Structures: Recursion. Data Abstraction and Abstract Data Types (ADT). Fundamental Data Structures: Arrays and Lists. Linked Lists, Queues, Stacks. Searching Algorithms: Search algorithms, sequential search, and binary search. Sorting Algorithms: Quick Sort, Merge sort, Bubble sort. Graphs: Graph representation, Graph Traversals, Shortest Path algorithms. Trees: Concepts of trees, binary trees, binary search trees, binary tree traversal algorithms