Computer Science 351 — Information about Tests

Tests

CPSC 351 — Information about Tests

Overview

Information about the CPSC 351 term tests and final examination will be made available at least a few weeks before each test is written.

Term Test #1: Finite Automata and Regular Languages

Term Test #2: Turing Machines and Computability

Final Examination


University of Calgary Extension of Logo
Department of Computer Science

cpsc 351 computer science faculty of science u of c

cpsc 351 introduction finite automata and regular languages turing machines computability discrete probability conclusion course outline more about course administration references assignments tests