Discrete Structures in Computer Science

Catalog description

A study of the treatment of discrete mathematical structures and relevant algorithms used in the programming and computer science. Topics include the list, tree, set, relational and graph data models and their representation and use in searching, sorting and traversal algorithms; also, simulation, recursive algorithms and programming, analysis of running time of algorithms, and an introduction to finite-state machines and automata. Three hours lecture, one hour laboratory. Pre-requisite of CS 230 is required.