Welcome to SoC!. CS1101S or CS1010? why are you here?

Slides:



Advertisements
Similar presentations
Steve Jobs...the man who changed the world.... Born: February 24, 1955, San Francisco Adopted by Justin and Clara Jobs.
Advertisements

CSC 205 Programming II Lecture 10 Towers of Hanoi.
Every Successful Innovator Knows This InnovationInnovation is actually a very simple phenomenon.simple Innovation is about Love:Love do what you love.
YOUR FIRST JOB. YOUR NEXT JOB. WHAT YOU NEED TO KNOW Akeem Oyewale.
10 Practical Ways a Live Your Life.
1 MKT201 – Buyer Behavior Final Review. 2 Agenda 1.Steve Jobs Stanford Commencement Speech A brief talk about culture and subculture (S10) 3.Final.
Creativity, Innovation & Entrepreneurship Professor Lachlan MacKinnon, University of Greenwich, London, U.K.
Steven Jobs By: Alberto Caicedo. The Bibliography An American entrepreneur, marketer, and inventor and cofounder and CEO of Apple Inc. Born in San Francisco,
“Your time is limited, so don’t waste it living someone else’s life. Don’t be trapped by dogma -- which is living with the results of other people’s thinking.
Fall 2008Programming Development Techniques 1 Topic 3 Linear Recursion and Iteration September 2008.
6.001 SICP – September Introduction
מבוא מורחב - שיעור 4 1 Lecture 4 Order of Growth Fun with recursion  Fast exponentiation  Hanoi towers.
Chapter 10 Recursion. Copyright © 2005 Pearson Addison-Wesley. All rights reserved Chapter Objectives Explain the underlying concepts of recursion.
CS 106 Introduction to Computer Science I 03 / 28 / 2008 Instructor: Michael Eckmann.
CS503: First Lecture, Fall 2008 Michael Barnathan.
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.
A-1 © 2000 UW CSE University of Washington Computer Programming I Lecture 1: Overview and Welcome Dr. Martin Dickey University of Washington.
“Do what you do so well that they will want to see it again and bring their friends.” Walt Disney.
Making Wise Choices What can I do today to prepare for college and career tomorrow? 1.
Career Awareness. Your time is limited, so don’t waste it living someone else’s life. … Don’t let the noise of others’ opinions drown out your own inner.
SCOTT WADE OLE KIRK CHRISTIANSEN STEVE JOBS Naomi Yessica / Livi Listyani / Hadi Cahyadi / / CREATIVE INSIGHT.
Welcome to SoC!.
Put your Best Foot Forward: How can I be a strong candidate for college and career? Chicago Champions College and Career Week October 7-15,
Why take CS1101S? (or why Scheme?)
Functional Programing Referencing material from Programming Language Pragmatics – Third Edition – by Michael L. Scott Andy Balaam (Youtube.com/user/ajbalaam)
Computer Science: A Structured Programming Approach Using C1 6-9 Recursion In general, programmers use two approaches to writing repetitive algorithms.
CS 330 Programming Languages 11 / 21 / 2006 Instructor: Michael Eckmann.
CS 326 Programming Languages, Concepts and Implementation Instructor: Mircea Nicolescu Lecture 7.
LEADERSHIP: IT’S ALL ABOUT PERSPECTIVE KIMBERLY B. MOORE, PHD ROTARY D5000 PRE-PETS TRAINING 21 FEBRUARY 2015.
Chapter 8 Recursion Modified.
Chapter 4 Recursion. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.1-2 Chapter Objectives Explain the underlying concepts of recursion.
Functional Programming and Lisp. Overview In a functional programming language, functions are first class objects. In a functional programming language,
Warm Up You come across a difficult problem in math. You begin thinking about your strategy, essentially thinking about thinking. This is known as…. Please.
Teaching like a Movie Director SoC Teaching Luncheon 9 May 2012.
Today’s topics Orders of growth of processes Relating types of procedures to different orders of growth.
A Scheme Workshop Ben Leong NUS School of Computing 31 July 2007.
A Scheme Workshop Ben Leong NUS School of Computing 28 July 2008.
Principles Of Programming Languages Lecture 2 Today Design-By-Contract Iteration vs. Recursion.
Principles Of Programming Languages Lecture 2 Outline Design-By-Contract Iteration vs. Recursion Scope and binding High-order procedures.
Some opinions about education in Britain
Welcome. With Your Host Dr. Katie Garnett Life is a Journey We must be willing to get rid of the life we've planned, so as to have the life that is waiting.
1 Peer-to-Peer Networked Virtual Environments Shun-Yun Hu ( 胡舜元 ) CSIE, National Central University, Taiwan 2007/10/18.
Principles Of Programming Languages Lecture 2 Today Design-By-Contract Iteration vs. Recursion If we have time: live demo!!!
Facebook Awareness. What is Facebook? Facebook, Myspace, Xange and any other social networking site that allows you to create a profile are all the same.
Inspiration What inspires you? There are a lot of things that can provide inspiration – seeing other people accomplish great things, seeing other people.
Recursive Algorithms A recursive algorithm calls itself to do part of its work The “call to itself” must be on a smaller problem than the one originally.
22C:19 Discrete Math Advanced Counting Fall 2010 Sukumar Ghosh.
Fall 2008Programming Development Techniques 1 Topic 5 Data Abstraction Note: This represents a change in order. We are skipping to chapter 2 without finishing.
1 Recursion Recursion is a powerful programming technique that provides elegant solutions to certain problems. Chapter 11 focuses on explaining the underlying.
CSC 108 Introduction to Computer Programming Which course should you take? – CSC 104 vs CSC 108 vs CSC 148 CSC the why and how of computing – you.
1 Binding names קשירת שמות A occurrence of a name z is bound by the innermost procedure that contains the name and either 1. z is a formal parameter of.
Nu Xu1/7STAR Analysis Meeting, Junior Meeting, April 16 th, 2012, BNL STAR STAR Experiment Nu Xu - Introduction: Structure of the QCD Matter - Near future.
CS50x Kansas City. Agenda Welcome! This is CS50x, Kansas City Edition Introduction to: LaunchCode CS50x Course Tools used in the course Programming How.
Principles Of Programming Languages Lecture 2 Today Design-By-Contract Data Structures: Lists and Pairs Iteration vs. Recursion If we have time: live.
서울대한양대 ( 안 산 ) 충남대 1년1년 컴퓨터기초 (C) 컴퓨터프로그래밍 (C, Java) 컴퓨터프로그래밍 (C) 2. 봄 프로그래밍 원리 (Scheme, ML) Structure & Interpretation of Computer Programs 프로그래밍 방법론.
CMSC201 Computer Science I for Majors Lecture 19 – Recursion
How we successfully handle primary/ secondary transition
Most Successful Entrepreneur Of All Time
Abdulmotaleb El Saddik University of Ottawa
YouTube & Language Learning
Career Awareness.
Recursive Thinking Chapter 9 introduces the technique of recursive programming. As you have seen, recursive programming involves spotting smaller occurrences.
Java Software Structures: John Lewis & Joseph Chase
Steve Jobs Commencement Address Stanford University
Recursive Thinking Chapter 9 introduces the technique of recursive programming. As you have seen, recursive programming involves spotting smaller occurrences.
HOW I FOUGHT CANCER A PERSONAL STORY
Unit 6 part 3 Test Javascript Test.
Graduation…….
Recursion as a Problem-Solving Technique
Steve Jobs This unit was created by the Louisiana Department of Education in partnership with LearnZillion. It includes approximately 36 days of instructional.
Presentation transcript:

Welcome to SoC!

CS1101S or CS1010? why are you here?

DDP folks You can sleep

Turing Programme Yes, you also can sleep

Developed at MIT in 1975 to teach programming methodology Scheme

Introduced at NUS 14 years ago Scheme 1994

What is Scheme?

(+ 5 3) (- (+ 5 3) (* 2 3)) prefix notation 8 2

(+ 5 6) (define a 5) (+ a 6) 11

Scheme is Expressive (define (square x) (* x x)) To square something, multiply it by itself (square 2) (square (square 3))

Congratulations! You know Scheme

Why Scheme?

Simple (didn’t you just learn it in 10 mins? )

Futile to Teach a Language (Here today, gone tomorrow)

Computational Thinking

Towers of Hanoi

Can you solve this for 1,000 discs?

How would we think about the problem?

What if we have one disc?

What if we have no discs? Do nothing!

Towers of Hanoi Suppose we know how to move 3 discs from A to C ABC

Towers of Hanoi Suppose we know how to move 3 discs from A to C ABC

Towers of Hanoi Claim: we can move 3 discs from A to B. Why? ABC

Towers of Hanoi Claim: we can move 3 discs from A to B. Why? ABC

Towers of Hanoi What do we do for 4 discs? ABC

Towers of Hanoi (define (move-tower size from to extra) (cond ((= size 0) ’ do-nothing) (else (move-tower (- size 1) from extra to) (print-move from to) (move-tower (- size 1) extra to from)))) fromextrato

Towers of Hanoi (define (print-move from to) (newline) (display "move top disk from ") (display from) (display " to ") (display to))

Recursion

CS1101S Road Map BASIC INTERMEDIATE ADVANCED Procedural Abstraction Higher-Order Procedures Recursion Iteration Wishful Thinking Order of Growth Data Abstraction Symbolic Data List Processing Generic Operators Object-Oriented Programming Streams Memoization Dynamic Programming Mutation & State Java Fundamental concepts of computer programming

“Star Wars” RPG

JFDI Academy

CS1101S or CS1010?

How to decide?

Puke Test

What is your pain threshold?

Scheme vs C Who would you marry? –Pretty but poor? –Rich but ugly?

Ask your friend

Ask a senior

Google is your Friend “cs1101s midterm review”

Why are you here?

What is the meaning of life?

CS1010 CS1101S CS1020CS2010 CS2020 CS1101R Scheme C JavaScript Java (4 MC) (5 MC) (1 MC)

many paths to success is not about how fast

“Your time is limited, so don't waste it living someone else's life. Don't be trapped by dogma - which is living with the results of other people's thinking. Don't let the noise of other's opinions drown out your own inner voice “

......And most important, have the courage to follow your heart and intuition. They somehow already know what you truly want to become. Everything else is secondary.” - Steve Jobs “

Caveat To enroll in CS1101S, min requirement of A grade for ‘A’ Level Math or equivalent. Or you can appeal at Undergrad Office For your own protection

Please indicate preference by 12 noon tomorrow

QUESTIONS