This course covers a range of topics, including basic data structures such as arrays, linked lists, stacks, queues, trees, and graphs, as well as more complex data structures such as hash tables and heaps. Students will also learn about algorithm analysis and design, including sorting and searching algorithms. Additionally, students will gain knowledge of algorithmic problem-solving techniques, algorithmic complexity, and the big-O notation. Throughout the course, students will be required to complete programming assigWhat you will learn Arrays Algorithm Complexity Stacks Queues Linked Lists Trees Graphs Sorting Algorithms
Know More