ANALYSIS OF ALGORITHMS I
Prerequisite: Comp. Sci. W3139 and W3203. Comp. Sci. E6232 is a continuation of this course and covers some of the topics described below. Representation and generation of combinatorial objects. Methods for the analysis of algorithms: counting and asymptotic evaluation. Analysis of sorting, searching, algorithms on graphs, operations on strings, arithmetic operations, matrix operations, Fourier transform. Models of computation: the Turing machine model, the random-access model, circuit complexity, and the VLSI model. Probabilistic algorithms.
Department: Computer Science(COMS)
Subject: Computer Science(COMS)
School: School of the Arts, Barnard College, Columbia College, School of General Studies, Graduate School of Arts and Sciences, School of International and Public Affairs, Continuing Education and Special Programs
Course ID: 4231