In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments.
In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments.
At UC San Diego Division of Extended Studies, we believe great social and economic prosperity comes from integrating the collective knowledge of the university, community leaders and professionals. Division of Extended Studies strives to combine local impact with national reputation and global reach.
Algorithms and data structures are the essential frameworks for solving almost any computer engineering problem.
Survey of advanced algorithms and data structures such as heaps and heapsort, quicksort, red-black trees, B-trees, hash tables, graph algorithms, divide and conquer algorithms, dynamic programming, and greedy algorithms. Methods for proving correctness and asymptotic analysis.
Models, algorithms, recurrences, summations, growth rates. Probabilistic tools, upper and lower bounds; worst-case and average-case analysis, amortized analysis, dynamization. Comparison-based algorithms: search, selection, sorting, hashing. Information extraction algorithms (graphs, databases).
Exploration of the design and implementation of data structures and algorithms fundamental to computer systems and applications and to software engineering.
This course covers and relates fundamental components of programs. Students use various data structures to solve computational problems, and implement data structures using a high-level programming language.
© 2025 coursetakers.com All Rights Reserved. Terms and Conditions of use | Privacy Policy