Center for Adult and Continuing Studies

This course, students will be taught to work on complex data structures and algorithms. It includes key data structures including stacks, queues, linked lists, binary trees, recursion and examples using some fundamental algorithms of computer science. Java and Python programming languages will be used. Course is designed keeping in mind the need to make students understand concepts related to data representation and organization in development of software products and services. The students will learn advanced algorithmic concepts such as time and space complexity, searching algorithms and sorting algorithms etc. By the end of this course, students will be capable to select and implement data structures and algorithms that best suit specific computational tasks, with an understanding of the trade-offs between performance and resource consumption.

• Learn how recursive functions break down a problem into smaller subproblems.
• Understand the key components of a recursive function.
• Grasp the purpose and importance of sorting in computer science and data manipulation.
• Understand how sorting algorithms are used in searching, data analysis, and optimization.
• Grasp the concept of time complexity and how it is used to measure the performance of algorithms based on input size.