Faculty of Science

Objectives

To focus on the theoretical analysis of the most important areas of algorithm design and analysis. It provides an integrated treatment of both sequential and parallel algorithms.

Contents

Comparison-based algorithms; searching; selection; sorting; hashing; information-extraction algorithms; graph; probabilistic algorithms; parallel algorithms; geometric algorithms; Connectivity; spanning trees; Formal methods for proving correctness.