Computer Science 351 — Information about 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 Expressions and Languages

• Information about the Test
• Practice Test

Term Test #2: Turing Machines, Recognizability and Decidability

• Information about the Test
• Practice Test

Final Examination

• Information about the Test
• Practice Examination

cpsc 351 computer science faculty of science u of c

cpsc 351 introduction finite automata and regular languages turing machines and their languages and functions computability probability for computer science conclusion recommended references course administation assignments tests