CPSC 121: Models of Computation REVIEW. Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss,

Slides:



Advertisements
Similar presentations
Introduction to Proofs
Advertisements

PROOF BY CONTRADICTION
Snick  snack CPSC 121: Models of Computation 2011 Winter Term 1 Proof Techniques (Part A) Steve Wolfman, based on notes by Patrice Belleville and others.
Snick  snack CPSC 121: Models of Computation 2009 Winter Term 1 Introduction & Motivation Steve Wolfman, based on notes by Patrice Belleville and others.
Snick  snack CPSC 121: Models of Computation 2008/9 Winter Term 2 Proof Techniques Steve Wolfman, based on notes by Patrice Belleville and others 1.
Proof Points Key ideas when proving mathematical ideas.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
Lecture 14 Go over midterm results Algorithms Efficiency More on prime numbers.
Snick  snack CPSC 121: Models of Computation 2011 Winter Term 1 Introduction & Motivation Steve Wolfman, based on notes by Patrice Belleville and others.
Algorithms and Problem Solving. Learn about problem solving skills Explore the algorithmic approach for problem solving Learn about algorithm development.
Snick  snack CPSC 121: Models of Computation 2008/9 Winter Term 2 Proof Techniques Steve Wolfman, based on notes by Patrice Belleville and others.
Snick  snack CPSC 121: Models of Computation 2010 Winter Term 2 Proof Techniques Steve Wolfman, based on notes by Patrice Belleville and others 1.
CS 10051: Introduction to Computer Science What is the course about?
Snick  snack CPSC 121: Models of Computation 2011 Winter Term 1 Proof Techniques (Part B) Steve Wolfman, based on notes by Patrice Belleville and others.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
Snick  snack CPSC 121: Models of Computation 2010/11 Winter Term 2 Introduction & Motivation Steve Wolfman, based on notes by Patrice Belleville and others.
Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.
analysis, plug ‘n’ chug, & induction
C OMPUTER P ROGRAMMING 1 Introduction to Programming.
PROGRAMMING LANGUAGES The Study of Programming Languages.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Intro to Discrete Structures
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
MATH 224 – Discrete Mathematics
CS1502 Formal Methods in Computer Science Lecture Notes 16 Review for Exam2 continued Theory of Computation Introduction.
Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit.
Common Core Standards Madison City Schools Math Leadership Team.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
CPSC 121: Models of Computation Unit 0 Introduction George Tsiknis Based on slides by Patrice Belleville and Steve Wolfman.
Snick  snack CPSC 121: Models of Computation 2012 Summer Term 2 Introduction & Motivation Steve Wolfman, based on notes by Patrice Belleville and others.
CS404 Design and Analysis of Algorithms BBy DDr. M V S Peri Sastry BB.E, PhD(BITS-Pilani)
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Snick  snack CPSC 121: Models of Computation 2008/9 Winter Term 2 Introduction & Motivation Steve Wolfman, based on notes by Patrice Belleville and others.
Unit1: Modeling & Simulation Module5: Logic Simulation Topic: Unknown Logic Value.
CS/APMA 202 Spring 2005 Aaron Bloomfield. Sequences in Nature
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
Software Engineering Algorithms, Compilers, & Lifecycle.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
JavaScript/ App Lab Programming:
ICS 3UI - Introduction to Computer Science
Chapter 7. Propositional and Predicate Logic
CSCE 355 Foundations of Computation
Algorithms and Problem Solving
Module 2: Conditionals and Logical Equivalences
Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2012
CPSC 121: Models of Computation 2012 Summer Term 2
Non Deterministic Automata
GC211Data Structure Lecture2 Sara Alhajjam.
Unit 1. Sorting and Divide and Conquer
Algorithm and Ambiguity
Chapter 2.3 Binary Logic.
Ch. 11 Theory of Computation
CPSC 121: Models of Computation
CSCE 355 Foundations of Computation
Foundations of Computer Science
Non-Deterministic Finite Automata
CSE 311 Foundations of Computing I
UNIT 3 CHAPTER 1 LESSON 4 Using Simple Commands.
Non-Deterministic Finite Automata
This Lecture Substitution model
A Brief Summary for Exam 1
Algorithms and Problem Solving
Unit 3 lesson 2-5 The Need For Algorithms- Creativity in Algorithms – Simple Commands - Functions Day 18.
Chapter 7. Propositional and Predicate Logic
Introduction to programming
This Lecture Substitution model
This Lecture Substitution model
WRITING AN ALGORITHM, PSEUDOCODE, AND FLOWCHART LESSON 2.
Introduction to Proofs
Computer Science 210 Computer Organization
Presentation transcript:

CPSC 121: Models of Computation REVIEW

Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss, reason about, solve, and test – learn new modeling formalisms more easily – communicate clearly and unambiguously with other CS experts on complex topics – characterize algorithms (CS problem solutions), by proving their correctness or efficiency – critically read proofs: justifying why each step is correct and judging what the proof means – prove statements that require only simple insights beyond strategic choices or for which the insight is given/hinted – explain how computers work Review2

Modeling We have seen a number of models with different power: – propositional logic – predicate logic – combinational circuits – DFA's – NFA's – regular expressions – sequential circuits Review3

Problem Solving We have seen how to model problems in each of these models so that – the problem is more precise – we understand it better – we can reason about it – provide solution (if possible) Review4

Validating Solutions We've learnt how to prove arguments so we can support our solutions We have seen all proof techniques: – constructive/non-constructive proofs of existence – generalizing from the generic particular – antecedent assumption – proof by cases – proof by contrapositive or other equivalent – proof by contradiction – induction Review5

Reasoning about Algorithms We've acquired enough knowledge to be able to reason about simple algorithms (solutions) – we can prove that are correct for certain inputs – we can prove how efficient they are – we can compare them Review6

And that is what Computer Science is about!

CPSC Courses after 121 CPSC 210 : Software Construction – learn how to understand and design programs larger than those you've seen in 110 CPSC 213: Introduction to Computer Systems – learn how high level languages(Racket, Java, C++ ) are implemented using simple machine instructions CPSC 221: Basic Algorithms and Data Structures – learn how to design important algorithms and data structures which used by many programs Review8

The End