zeus-hampton
Uploaded by
3 SLIDES
193 VUES
30LIKES

Foundations of Computational Models: Principles in Computer Science

DESCRIPTION

This course provides students with a comprehensive foundation in computer science and essential mathematical principles. It aims to strengthen students' capability to implement rigorous mathematical arguments and prepares them for advanced courses, such as Algorithm Analysis, Artificial Intelligence, and Compiler Design. Upon completion, students will be proficient in finite-state automata, context-free grammars, pushdown automata, regular expressions, and Turing machines, as well as understanding computability limits and computational efficiency concepts.

1 / 3

Télécharger la présentation

Foundations of Computational Models: Principles in Computer Science

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSCI – 340: Computational Models (Source: Textbook preface) The purpose of this course is to : • To familiarize students with the foundations and principles of computer science. • To strengthen the students’ ability to carry out formal rigorous mathematical arguments. • To teach material that is prerequisite to advanced computer science course such as Analysis of Algorithm, AI, and Compiler Design.

  2. Course Objectives The student who successfully completes this course should be able to: • Define, interpret, and construct finite-state automata; apply these formalisms to practical programming problems. • Define, interpret, and construct context-free grammars, pushdown automata; apply these formalisms to practical programming problems. • Define, interpret, and construct regular expressions; apply these formalisms to computer algorithms. • Understand the theory of Turing machines and its relevance to computability. • Understand the limits of algorithmic computability. • Understand the concepts of efficiency of computation, language families, and complexity classes P and NP. • Parsing Techniques. • Matrix Algebra

  3. Enforcement Of Objectives

More Related