COMP 1600 Implementation of Object-Oriented Systems

Slides:



Advertisements
Similar presentations
COSC2007 Data Structures II
Advertisements

Chapter 1 Introduction to Computers. What Is a Computer? What is a computer? An electronic machine, operating under the control of instructions stored.
1 CS 162 Introduction to Computer Science Chapter 7 Matrix Manipulation Herbert G. Mayer, PSU Status 9/21/2014.
Data Modeling and Database Design Chapter 1: Database Systems: Architecture and Components.
Tic Tac Toe Game Design Using OOP
Philosophy of Computing n Computers are ‘Automatic Formal Systems’ n A ‘Formal System’ is like a game in which tokens are manipulated according to definite.
Summer 2011 Wednesday, 07/13. Formal Systems: The ELI System The ELI-system uses only three letters of the alphabet: E, L, I. It has a single axiom, EI,
Lecture 1: Intro to Computers Yoni Fridman 6/28/01 6/28/01.
CS-557 Gregory Dudek CD Contents. CS-557 Gregory Dudek Course description Lecture schedule by week 1997 Image Gallery Assignments Page Morphing Notes.
Defining Digital Games Presentation by Dustin Dannenhauer Dr. Héctor Muñoz-Avila Assigned readings: Chapter 8 (Rules of Play Book)
Introduction (Chapter 1) CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
D I F Lesson 12: Futurism.
CPSC 321 Introduction to Logic Circuit Design Mihaela Ulieru (‘Dr. M’)
James Tam CPSC 203: Introduction To Computers (Independent Study) James Tam.
Chapter 1 What is Programming? Lecture Slides to Accompany An Introduction to Computer Science Using Java (2nd Edition) by S.N. Kamin, D. Mickunas, E.
Digital Image Processing CCS331 Relationships of Pixel 1.
PERFECT CUBES What does that mean?. CUBE  We could make a list of “perfect cubes” by thinking of numbers of objects where these objects could be arranged.
Getting Started with MATLAB (part2) 1. Basic Data manipulation 2. Basic Data Understanding 1. The Binary System 2. The ASCII Table 3. Creating Good Variables.
Copyright © 2012 by Nelson Education Limited. Chapter 5 Introduction to inferential Statistics: Sampling and the Sampling Distribution 5-1.
PERFECT SQUARES What does that mean?. SQUARE  You could make a list of “perfect squares” by thinking of numbers of objects where these objects could.
Exponents Math 7 Powerpoint. Location of Exponent An An exponent is a little number high and to the right of a regular or base number. 3 4 Base Exponent.
EET 2259 Programming for Electronics Technology Professor Nick Reeder.
Adversarial Search and Game-Playing
CST 1101 Problem Solving Using Computers
Algorithms and Problem Solving
Programming what is C++
1.2 Checkers - Dame (Board Game)
Computer Graphics Researched via:
Lecture 0 Software Engineering Course Introduction
Let there be light: Understanding electricity
Great Theoretical Ideas in Computer Science
Defining Rules and Levels of Rules (Chs. 11 & 12)
Next Level Tic-Tac-Toe
PHOTOGRAPHY VOCABULARY AND DEFINITIONS :
Microelectronic Circuits Spring, 2013
Chapter 3 Drawing In the World.
By : Leyton Boykin Entertainment in Rome.
COMP211 Computer Logic Design Introduction to the DE2 Board
PLAY ON AND SWITCH ON! Chess Game
Lesson 5 Functions I A function is a small program which accomplishes a specific task. For example, we invoke (call) the function, sqrt(x), in the library.
IPad Center.
Software Development CMSC 202.
David Kauchak CS52 – Spring 2016
Introduction to series circuits
Introduction to Computers
CS 4700: Foundations of Artificial Intelligence
Game Art and Design Unit 3 Lesson 3 Procedure and Rules
Bell Ringer What is a factor tree?
ARTIFICIAL INTELLIGENCE.
Game Art and Design Unit 3 Lesson 3 Procedures and Rules
EDCI 658 History of Education
Board: Objects, Arrays and Pedagogy
First Python Program Professor Hugh C. Lauer CS-1004 — Introduction to Programming for Non-Majors (Slides include materials from Python Programming: An.
Computer Basics: Inside a Computer Part II
Unit 1: Introduction to Operating System
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Duo By: Fernando & Vivian.
The Alpha-Beta Procedure
Programming Languages 2nd edition Tucker and Noonan
EA C461 – Artificial Intelligence Introduction
Welcome to AP Computer Science A!
Welcome to AP Computer Science A!
Knowledge Representation
Bell Ringer What is a factor tree?
ECE 352 Digital System Fundamentals
CS51A David Kauchak Spring 2019
CS51A David Kauchak Spring 2019
2019 SAIMC Puzzle Challenge General Regulations
Unit II Game Playing.
Definitions Quiz (1-10) PLTW Terms PLTW Vocabulary Set #12.
Presentation transcript:

COMP 1600 Implementation of Object-Oriented Systems Spring, 2017 David J. Stucki Pete Sanderson

I really hate this darn machine; I wish that they would sell it I really hate this darn machine; I wish that they would sell it. It won’t do what I want it to, but only what I tell it. —Programmer’s Lament

Course Info Syllabus Course Web Site Blackboard History Python & Labs CodeLab by turingscraft CodingBat by Nick Parlante Projects What do you know? (Introductions) Syllabus: http://faculty.otterbein.edu/dstucki/COMP1600/COMP1600StuckiSandersonSpring2017.pdf Web Site: http://faculty.otterbein.edu/dstucki/COMP1600/ Assignment: Read material in chapter 1 (pp. 1 – 44)

Philosophy of Computing Computers are ‘Automatic Formal Systems’ A ‘Formal System’ is like a game in which tokens are manipulated according to definite rules, in order to see what configurations can be obtained. I.e., they are Token-manipulation systems Digital Medium independent Not all formal systems are games and not all games are formal systems. For more information about this view of computers, see John Haugeland, “What is Mind Design?”, in Mind Design II, MIT press, 1997, pp. 8-15.

Token-Manipulation Systems Components a set of types of formal tokens or pieces one or more allowable starting positions a set of formal rules specifying how arrangements of tokens may or must be changed into others Self-contained Rules have a ‘local’ perspective: current  next

Digital Systems A process that makes things and then later identifies what was made is digital if it is positive and reliable. It is positive if the re-identification can be absolutely perfect. A positive technique is reliable if it not only can be perfect, but almost always is. chess, tic-tac-toe, go, checkers vs. baseball, billiards, tiddly-winks, marbles

Medium Independence Form, or structure, is what defines a formal system. Its substance, or material, is irrelevant insofar as it supports the requisite form. Chess Can be played with pieces of wood, plastic, ivory, patterns of light on a video monitor, sand-drawings, even helicopters on skyscrapers; but not frogs, shapes traced in water, or mountains. Fire, food, electrical circuits, billiards, baseball are not independent of substance

Automatic Formal Systems A formal system that “moves” by itself. A physical device or machine that has configurations and states which can be regarded as tokens and arrangements of some formal system, and in its normal operation it automatically manipulates these tokens in accord with the rules of that system. E.g., a Computer!

Implementation and Universality The most basic idea of computer science: “You can use one automatic formal system to implement another.” This is what programming is! One computer implements another when: some configurations of tokens and positions of the former can be regarded as the tokens and positions of the latter, and as the former follows its own rules, it automatically manipulates those tokens of the latter in accord with the latter’s rules.

Chess Assume the board is 8” square Place a penny exactly 4.0747 inches from the bottom and 1.9761 inches from the left Place a penny in the fourth rank (row) and second file (column).