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.

Slides:



Advertisements
Similar presentations
THE CORNELL NOTE TAKING SYSTEM
Advertisements

Intro to CIT 594
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
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.
Adapted from Prof. Necula CS 169 Project Planning1 Project Planning.
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.
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.
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.
CS3: Introduction to Symbolic Programming Spring 2006Nate Titterton Lecture 2: Introduction, and Conditionals.
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.
Feb. 27, 2001CSci Clark University1 CSci 250 Software Design & Development Lecture #13 Tuesday, Feb. 27, 2001.
Structural Decomposition CS 5010 Program Design Paradigms “Bootcamp” Lesson 2.1 © Mitchell Wand, This work is licensed under a Creative Commons.
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.
Prof. Matthew Hertz WTC 207D /
CSCI 1301 Principles of Computer Science I
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
Prof. Matthew Hertz WTC 207D /
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
A First Program CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington Credits: a significant part of.
Prof. Matthew Hertz SH 1029F /
Computer Networks Lecture 1: Logistics Based on slides from D. Choffnes Northeastern U. and P. Gill from StonyBrook University Revised Autumn 2015 by S.
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.
Documentation and Comments. What’s a comment? A comment is a simple form of documentation. Documentation is text that you the programmer write to explain.
Welcome to Physics 1D03.
THE CORNELL NOTE TAKING SYSTEM. Step #1: Prepare Cue Column --2 Inches-- Reduce ideas: Key terms Questions Names Quotes Record Column --6 Inches-- Record.
Agenda 8/30/06 Adv. Dig. Photography Attendance and Check In (who has sketchbooks and who has signed Class Expectations) Free Response Finish and Turn.
Algorithms and Data Structures TEACH THAT Algorithms and Data Structures An algorithm does something, solves some problem, in a mechanical way. It is.
Course Introduction CSE250. Course Overview This course will be difficult Work hard and start early You are adults and I will treat you as such – I won’t.
Lecture 1 Page 1 CS 111 Summer 2013 Introduction CS 111 Operating System Principles Peter Reiher.
The Art of Poetry by Jorge Luis Borges Type Your Name Here Type the Date Here English 2.
Faculty Purpose of CS 100 Prepare to live in an information world Prepare for more training in computing NOT - to learn to program (CS 142) NOT - to.
CS1101: Programming Methodology
CSCE 1030 Computer Science 1 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
CSC 213 – Large Scale Programming Prof. Matthew Hertz WTC 207D /
Unit 4 Review LISTENING, NOTE TAKING, AND REMEMBERING.
CS 101-E Announcements. 22 Jan 2007 Office Hours Office Hours Start this week, hours are posted on class website Start this week, hours are posted on.
Any questions on today’s homework? (Sections 1.6/1.7) Reminder: You should be doing this homework without using a calculator, because calculators can’t.
MTH221 November 6, /6/ DISCRETE MATHEMATICS FOR IT PROFESSIONALS Pair the class Set dates See students progress Assignments Final Exam Quizzes.
English 10 A Good things Would you rather.
BIT 142:Programming & Data Structures in C#. 2 Syllabus : Book info BIT 142 uses the book fairly extensively –I would recommend getting it The edition.
Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Slide 4- 1.
1 CS February 2009 Inside-out rule; use of this and super Developing methods (using String ops). Read sec. 2.5 on stepwise refinement Listen to.
CS3: Introduction to Symbolic Programming Spring 2006Nate Titterton Lecture 2: Introduction, and Conditionals.
CMSC201 Computer Science I for Majors Lecture 23 – Algorithms and Analysis Prof. Katherine Gibson Based on slides from previous iterations.
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.
CS1010 Discussion Group 11 Week 3 - Computational Thinking/Algorithms.
Midterm Review.
CMSC201 Computer Science I for Majors Lecture 11 – Program Design
Data Structures Algorithms: (Slides to be Adopted from Goodrich and aligned with Weiss' book) Instructor: Ganesh Ramakrishnan
FINAL EXAM INFORMATION
FINAL EXAM INFORMATION
CS 456/656 – Computer Networks
Modular Course Overview MATH1710, MATH 1720 MATH 1740 and MATH1750
Welcome to Physics 1D03.
Last Class We Covered Asymptotic Analysis Run “time” Big O
Announcements Nate’s office hours Card key problems?
Type Systems for Programming Languages
Introduction To CPSC 233 James Tam Event driven software
CS114B Introduction to Computer Science II
Review and Instructions
Presentation transcript:

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 labs You need to make an effort to keep up with lab work

Slide 2 Schedule Jan 24Conditionals Jan 31Review conditionals, work with case study Feb 7Working further with the case study (miniproject) Feb 14Beginning Recursion Feb 21More Recursion Feb 28MIDTERM EXAM

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

Slide 4 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 5 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 6

Slide 7 (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 8 You are writing big programs now. But, what can’t you do yet?

Slide 9 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 10 What does it mean to “understand a program”

Slide 11 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 12 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 13 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