Algorithms, Part I
offered by Princeton University

Private University
500 acre campus
Estd. 1746

Algorithms, Part I
at
Princeton University
Overview

Algorithm Mastery Begins: In-Depth Exploration in Part 1 - Unveiling Core Concepts and Strategies for Effective Problem-Solving and Optimization.

Duration	54 hours
Mode of learning	Online
Schedule type	Self paced
Difficulty level	Intermediate
Official Website	Go to Website
Course Level	UG Certificate

Algorithms, Part I
at
Princeton University
Highlights

Interactive Learning through real life examples
Doubt support Available

Algorithms, Part I
at
Princeton University
Course details

Skills you will learn

Java Data structures

More about this course

Algorithms, Part I is an introduction to fundamental data types, algorithms, and data structures, with emphasis on applications and scientific performance analysis of Java implementations.
Specific topics covered include union-find algorithms; basic iterable data types (stack, queues, and bags); sorting algorithms (quicksort, mergesort, heapsort) and applications; priority queues; binary search trees; red-black trees; hash tables; and symbol-table applications.
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations.
Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.

Algorithms, Part I
at
Princeton University
Curriculum

Course Introduction

Union-Find

Analysis of Algorithms

Stacks and Queues

Elementary Sorts

Mergesort

Quicksort

Priority Queues

Elementary symbol Tables

Balanced Search Trees

Algorithms, Part I
at
Princeton University
Faculty details

Robert Sedgewick

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton, where he was the founding chair of the Department of Computer Science. He received the Ph.D. degree from Stanford University, in 1975.

Kevin Wayne

Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization.