Review for Test 2 Chapters 5 (start at 5.4), 6.1, 7.1- 7.5, 12, 13, 15.1, Python.

Slides:



Advertisements
Similar presentations
Computational Models The exam. Models of computation. –The Turing machine. –The Von Neumann machine. –The calculus. –The predicate calculus. Turing.
Advertisements

Object-Oriented Programming Python. OO Paradigm - Review Three Characteristics of OO Languages –Inheritance It isn’t necessary to build every class from.
Adapted from Scott, Chapter 6:: Control Flow Programming Language Pragmatics Michael L. Scott.
Copyright © 1998 by Addison Wesley Longman, Inc. 1 Chapter One Preliminaries, including –Why study PL concepts? –Programming domains –PL evaluation criteria.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 330 Programming Language Structures Ch.2: Syntax and Semantics Fall 2005.
Chapter 1: Preliminaries
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 1 Overview A good programming language is.
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 12 Imperative Programming I really hate this.
Reasons to study concepts of PL
ISBN Chapter 1 Preliminaries. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.1-2 Chapter 1 Topics Motivation Programming Domains.
CS 354 Overview. Copyright © 2007 Addison-Wesley. All rights reserved. 1–2 Course Topics What is a programming language? What features do programming.
Programming Languages Structure
ISBN Lecture 01 Preliminaries. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.1-2 Lecture 01 Topics Motivation Programming.
Formal Aspects of Computer Science – Week 12 RECAP Lee McCluskey, room 2/07
ISBN Chapter 1 Topics Motivation Programming Domains Language Evaluation Criteria Influences on Language Design Language Categories Language.
Dr. Muhammed Al-Mulhem ICS An Introduction to Functional Programming.
Overview. Copyright © 2006 The McGraw-Hill Companies, Inc. Chapter 1 Overview A good programming language is a conceptual universe for thinking about.
CSE 425: Intro to Programming Languages and their Design A Few Key Ideas No particular language is a prerequisite for this course –However you should be.
1 Chapter 5: Names, Bindings and Scopes Lionel Williams Jr. and Victoria Yan CSci 210, Advanced Software Paradigms September 26, 2010.
CS 355 – Programming Languages
Computer Architecture Computational Models Ola Flygt V ä xj ö University
Imperative Programming
Chapter 1. Introduction.
CS 330 Programming Languages 09 / 04 / 2008 Instructor: Michael Eckmann.
Programming Languages –14 David Watt (Glasgow) Steven Wong (Singapore) Moodle : Computing Science → Level 3 → Programming Languages 3 © 2012 David.
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages.
Chapter 6 Programming Languages. © 2005 Pearson Addison-Wesley. All rights reserved 6-2 Chapter 6: Programming Languages 6.1 Historical Perspective 6.2.
ICS 313 Fundamentals of Programming Languages Instructor: Abdul Wahid Wali Lecturer, CSSE, UoH
Programming Languages Design Considerations (Qualities) Readability –Simplicity and Clarity –Orthogonality –Control Statements –Data Types and Structures.
Lecture on Programming Languages
Chapter 6 Programming Languages © 2007 Pearson Addison-Wesley. All rights reserved.
ISBN CS 354 Preliminaries. Copyright © 2006 Addison-Wesley. All rights reserved.1-2 Course Topics What is a programming language? What features.
ISBN Chapter 1 Preliminaries. Copyright © 2009 Addison-Wesley. All rights reserved.1-2 Chapter 1 Topics Reasons for Studying Concepts of.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
Theory of Programming Languages Introduction. What is a Programming Language? John von Neumann (1940’s) –Stored program concept –CPU actions determined.
Logical and Functional Programming
1-1 An Introduction to Functional Programming Sept
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 1 Overview A good programming language is.
CS 152: Programming Language Paradigms March 12 Class Meeting Department of Computer Science San Jose State University Spring 2014 Instructor: Ron Mak.
ISBN Chapter 16 Logic Programming Languages.
Programming Language Design Issues Programming Languages – Principles and Practice by Kenneth C Louden.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 330 Programming Language Structures Operational Semantics (Slides mainly.
Language Paradigms CS655.
Chapter 1. Introduction.
Programming Languages 2nd edition Tucker and Noonan
The language focusses on ease of use
CS 3723 Programming Languages
Programming paradigms
Concepts of Programming Languages
Basic 1960s It was designed to emphasize ease of use. Became widespread on microcomputers It is relatively simple. Will make it easier for people with.
Concepts of Programming Languages
Why study programming languages?
Basic 1964 PC general purpose Imperative Small Easy to use.
PROGRAMMING LANGUAGES
Types of Programming Languages
Chap. 6 :: Control Flow Michael L. Scott.
Final Review In Text: Chapters 1-3, 5-11,
Midterm Review In Text: Chapters 1-3, 5-7, 15, 16.
Chapter 1 Preliminary. Chapter 1 Preliminary 1.1 Reasons for Studying Concepts of Programming Languages Increased capacity to express ideas Improved.
Chap. 6 :: Control Flow Michael L. Scott.
CS 3304 Comparative Languages Fall 2011
Programming Languages 2nd edition Tucker and Noonan
Final Review In Text: Chapters 1-3, 5-12,
Programming Languages 2nd edition Tucker and Noonan
Final Review In Text: Chapters 1-3, 5-16.
Principles of Programming Languages
Overview of Programming Paradigms
Final Review In Text: Chapters 1-3, 5-16.
Reasons To Study Programming Languages
Presentation transcript:

Review for Test 2 Chapters 5 (start at 5.4), 6.1, , 12, 13, 15.1, Python

Detailed study guide is available from the course web page.

Chapter 5 - Types Array design & implementation issues; e.g., bounds checking – yes or no?, access functions for one and two-d arrays Parametric polymorphism

Chapter 6 – Type Systems A type system is the set of rules that defines the binding between a type, its values, and the operations that can be performed on the values. A type map is a function that binds the variables declared in a program to their type. Six type rules – be able to recognize them but you do not have to memorize them. You should be able to state a simple type rule.

Chapter 7 – Semantics Define semantics Be able to express infix expressions in other formats. Side effects Various “special” features – short circuit eval, assignment semantics, etc. Definition of Turing complete languages

Chapter 12 – Imperative Characteristics; relation to von Neumann computers Procedural abstractions and top-down refinement

OO Paradigm Three characteristics of OO programming languages –Be sure to understand the difference between “pure” polymorphism and parametric polymorphism OO terminology Python’s OO characteristics

Python Know the features that you needed for your program (especially for, range statement, lists, dictionaries) –No need to memorize I/O syntax Know basic characteristics of scripting languages Compare Python to C, C++, Java syntax.

Chapter 15 – Logic Programming Differences between logic programming paradigm and imperative/OO paradigm. –Program as facts and rules; Prolog provides the logic Be able to identify terms such as Horn clause, resolution, …

Format Same type questions as Test 1 GOOD LUCK!