Slide 1 Announcements Nate's office hours: –Monday, 12-2 –329 Soda Card key issues? (I've been told that any requests made before September 1 st didn't.

Slides:



Advertisements
Similar presentations
Intro to CIT 594
Advertisements

Key Dates and arrangements for the remainder of Year 11.
Lecture 1: Overview CMSC 201 Computer Science 1 (Prof. Chang version)
Year 11 Tuesday March 3 rd To give information about exams, revision sessions and final practical exams. 2. To give some advice about revision.
James Tam Introduction To CPSC 233 James Tam Java Object-Orientation Event driven software.
CS3 Fall 2005 Lecture 11: Finish higher order functions Midterm Prep.
Slide 1 CS3 Week 8: Recursion. Slide 2 Midterm 1 You did great If you need a re- grade, see the person that graded that question Solutions are available.
Slide 1. Slide 2 Administrivia Mid-semester survey this week (Thur/Fri) –you NEED to do this. Interviews should be starting in a few weeks. I apologize.
Slide 1 Announcements Next Lab is “Catch Up” –Go back over the last two weeks and fill in places you missed We are going to start taking attendance in.
James Tam Introduction To CPSC 219 James Tam Administrative (James Tam) Contact Information -Office: ICT 707 -
Slide 1 CS3 Fall 2005 Lecture week 13: Introduction to the Big Project.
Lecturer: Fintan Costello Welcome to Hdip 001 Introduction to Programming.
CS3: Introduction to Symbolic Programming Spring 2006Nate Titterton Lecture 4: "Difference Between Dates" and data abstraction.
Announcements DS-533 Fall Week 1: August 25 Read: –Business Forecasting Chapter 2 Do problems: –3, 5, 7, 9, 12, Hand-in assignments –4, 8, 14.
Slide 1 Midterm 1 Midterm 1: Feb 28 th (next week). –In the lecture slot, plus 20 minutes (4:10-5:30 pm, 120 Latimer) –Everything we’ve covered, including.
Instructor Dr. Ken Rodham –3370 TMCB – –Office Hours: By Appointment.
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
Feb 28More complicated recursions March 7Tree recursion, etc. Number-spelling Miniproject (#2) March 14Higher order procedures March 21Spring Break March.
CS3: Introduction to Symbolic Programming Spring 2006Nate Titterton Lecture 2: Introduction, and Conditionals.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
Midterm Logistics Where? 2050 VLSB When? Monday, 4:10 to 5:40 What to do? –“Review problems” from Thursday/Friday in UCWise. –Two practice exams and solutions.
Slide 1 CS3 Fall 2005 Lecture 9: Higher Order Functions.
CS3 Fall 2005 Lecture week 15. Administrivia The final survey will be up tomorrow: –you NEED to do this to receive a grade on your project! Final: –Saturday,
Slide 1. Slide 2 Administrivia Nate's office hours are Wed, 2-4, in 329 Soda! TA Clint will be handing out a paper survey in class sometime this week.
Welcome to CS 115! Introduction to Programming. Class URL Please write this down!
CSCI 1301 Principles of Computer Science I
Math 125 Statistics. About me  Nedjla Ougouag, PhD  Office: Room 702H  Ph: (312)   Homepage:
MATH 112 (Tuesday) Spring 2015 Instructor:. Syllabus Keep your copy of the syllabus handy  Questions will arise throughout the semester  Answers can.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
Course Introduction CSCI Software Engineering II Fall 2014 Bill Pine.
Prof. Matthew Hertz SH 1029F /
© Xiaoying Gao, Peter Andreae Introduction to Computer Program Design COMP T2. Xiaoying (Sharon) Gao Computer Science Victoria University of Wellington.
Prof. Matthew Hertz WTC 207D /
Computer Science 10: Introduction to Computer Science Dr. Natalie Linnell with credit to Cay Horstmann and Marty Stepp.
1 My Experiences as Faculty Member and Researcher Dr. Kalim Qureshi.
CSCE 1040 Computer Science 2 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
CSE 113 Introduction to Computer Programming Lecture slides for Week 2 Wednesday, September 7 th, 2011 Instructor: Scott Settembre.
Life Styles Adapted from High Impact St. John’s & St. Mary’s Institute of Technology by Josephine Huang.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
CS 415 Daily Announcements. Friday, 26 August 2005 Readings: –Read Chapter 1 for next Monday –Read Algol 60 report for next Wednesday –Read some of chapter.
Fall 2o12 – August 27, CMPSC 202 First Day Handouts  Syllabus  Student Info  Fill out, include all classes and standard appointments  Return.
Lecture 1 Page 1 CS 111 Summer 2013 Introduction CS 111 Operating System Principles Peter Reiher.
© Xiaoying Gao, Peter Andreae Introduction to Computer Program Design COMP T2. Xiaoying (Sharon) Gao Computer Science Victoria University of Wellington.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
Welcome to PHY2049 Physics for Engineers and Scientists II Dr. Bindell SPRING 2009 Dr. J. B. Bindell.
CSCE 1030 Computer Science 1 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
Unit 4 Review LISTENING, NOTE TAKING, AND REMEMBERING.
BIT 143: Programming – Data Structures It is assumed that you will also be present for the slideshow for the first day of class. Between that slideshow.
James Tam Introduction To CPSC 233 James Tam Java Object-Orientation Event driven software.
James Tam Introduction To CPSC 233 James Tam Java Object-Orientation Graphical-user interfaces.
General Information Course Id: COSC6368 Artificial Intelligence Professor: Ricardo Vilalta Classroom:AH 110 Telephone: (713)
CS61A Lecture Colleen Lewis. Clicker poll Where do you think you’re learning the most? I assume you’ll learn the most in lab & disc (so.
Logical Operators.  Quiz  Let's look at the schedule  Logical Operators 2.
WELCOME TO MICRO ECONOMICS AB 224 Discussion of Syllabus and Expectations in the Class.
CS3: Introduction to Symbolic Programming Spring 2006Nate Titterton Lecture 2: Introduction, and Conditionals.
All materials copyright UMBC unless otherwise noted CMSC201 Computer Science I for Majors Lecture 02 – Algorithmic Thinking.
CMSC201 Computer Science I for Majors Lecture 02 – Algorithmic Thinking Prof. Katherine Gibson Based on slides by Shawn Lupoli and Max Morawski at UMBC.
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1010! Algorithmic Problem Solving.
Last Class We Covered Dictionaries Hashing Dictionaries vs Lists
Announcements Nate’s office hours Card key problems?
Type Systems for Programming Languages
Introduction To CPSC 233 James Tam Event driven software
Exam # 1 INFORMATION Scheduled for Thursday 7/20
AME Spring Lecture 11 - Thrust and aircraft range
CS201 – Course Expectations
CS a-spring-midterm2-survey
Presentation transcript:

Slide 1 Announcements Nate's office hours: –Monday, 12-2 –329 Soda Card key issues? (I've been told that any requests made before September 1 st didn't work. So, request if you did it early)

Slide 2 More Announcements Next Lab (Tue/Wed) is “Catch Up” –Go back over the last two weeks and fill in places you missed You NEED to come to labs –We are going to start taking attendance in labs You need to make an effort to keep up with lab work

Slide 3 Schedule Sep 5-9 Conditionals Sep Catch up; work with case study Sep Working further with the case study (miniproject) Sep Beginning Recursion Oct 3-7 MIDTERM #1 More recursion in lab

Slide 4 How is it going? (are you behind yet?) (working at home?)

Slide 5 Review What is Scheme? –(interpreter, editor) Functions Words and Sentences

Slide 6 Some programming “first-two” –takes a word, returns the first two letters (as a word) “two-first” –takes two words, returns the first letter of each (as a two-letter word)

Slide 7 Some nice comments "In English, when something is in quotes we think about it differently. Same in scheme" "In order to remember how to parenthesize a cond statement... think of each statement as an if without the 'if' "

Slide 8 Some review Quoting something means treating it literally: –you are interested in the thing follows, rather than what is named –Quoting is a shortcut to putting literal things right in your code. As your programs get bigger, you will do this less and less. Testing is an art –Programs get complicated very quickly; thinking up good tests is hard. –And yet it is crucial!

Slide 9 (define (walk light city cops-present) (cond ((equal? city 'berkeley) 'strut) ((equal? light 'green) 'go) ((equal? light 'not-working) 'go-if-clear) ((and (equal? light 'flashing-red) cops-present) 'wait) ((equal? light 'flashing-red) 'hurry) (else 'just-stand-there)))

Slide 10 You are writing big programs now. But, what can’t you do yet?

Slide 11 A video resource Weiner lecture archives The "course" is an earlier CS3 –Different emphasis; early lectures may work better than later ones –Very different lab experience –Same book

Slide 12 What does it mean to “understand a program”

Slide 13 Case Studies Reading!? A case study: –starts with a problem statement –ends with a solution –in between, a …story… (narrative) –How a program comes to be You will write “day-span”, which calculates the number of days between two dates in a year

Slide 14 You need to read this The lab will cover the case study through a variety of activities. –This will culminate in the first “mini-project” We just may base exam questions on it It will make you a better programmer! 4 out of 5 educational researchers say so.

Slide 15 Some important points There is a large "dead-end" in this text –Like occur in many programming projects –Good "style" helps minimize the impacts of these There is (often) a difference between good algorithms and between human thinking