welcome to soc!

Download Welcome to SoC!

If you can't read please download the document

Upload: urban

Post on 08-Jan-2016

70 views

Category:

Documents


1 download

DESCRIPTION

Welcome to SoC!. CS1101S or CS1010?. why are you here?. DDP folks. You can sleep. Turing Programme. Yes, you also can sleep. Scheme. Developed at MIT in 1975 to teach programming methodology. 1994. Scheme. Introduced at NUS 14 years ago. What is Scheme?. 8. (+ 5 3) - PowerPoint PPT Presentation

TRANSCRIPT

  • Welcometo SoC!

  • CS1101S or CS1010?why are you here?

  • DDP folksYou can sleep

  • Turing ProgrammeYes, you also can sleep

  • Developed at MIT in 1975 to teach programming methodologyScheme

  • Introduced at NUS 14 years agoScheme

  • What is Scheme?

  • (+ 5 3)

    (- (+ 5 3) (* 2 3))prefix notation82

  • (+ 5 6)

    (define a 5)

    (+ a 6)

    1111

  • Scheme is Expressive(define (square x) (* x x))

    To square something, multiply it by itself

    (square 2)

    (square (square 3))43681

  • Congratulations!You know Scheme

  • Why Scheme?

  • Simple(didnt you just learn it in 10 mins? )

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

  • Computational Thinking

  • Towers of Hanoi

  • Towers of Hanoi

  • Towers of Hanoi

  • Towers of Hanoi

  • Towers of Hanoi

  • Towers of Hanoi

  • Towers of Hanoi

  • Towers of Hanoi

  • Can you solve thisfor 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 HanoiSuppose we know how to move 3 discs from A to CABC

  • Towers of HanoiSuppose we know how to move 3 discs from A to CABC

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

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

  • Towers of HanoiWhat do we do for4 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 MapBASICINTERMEDIATEADVANCEDProcedural AbstractionHigher-Order ProceduresRecursionIterationWishful ThinkingOrder of GrowthData AbstractionSymbolic DataList ProcessingGeneric OperatorsObject-Oriented ProgrammingStreamsMemoizationDynamic ProgrammingMutation & StateFundamental concepts of computer programming

  • Star WarsRPG

  • JFDI Academy

  • CS1101S or CS1010?

  • How to decide?

  • PukeTest

  • 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 Friendcs1101s midterm review

  • Why are you here?

  • What is the meaning of life?

  • CS1010CS1101SCS1020CS2010CS2020CS1101RSchemeCJavaScriptJavaJavaJava(4 MC)(4 MC)(4 MC)(5 MC)(5 MC)(1 MC)

  • many paths tosuccess

  • 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