Welcome to SoC! - PowerPoint PPT Presentation

Slide1 l.jpg
Download
1 / 54

Welcome to SoC!. CS1101S or CS1010?. why are you here?. DDP folks. You can sleep. Turing Programme. Yes, you also can sleep. Brief History. Scheme was developed at MIT in 1975 to teach programming methodology First introduced at NUS 13 years ago I took this class at MIT in 1994 . .

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

Download Presentation

Welcome to SoC!

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Slide1 l.jpg

Welcome

to SoC!


Slide2 l.jpg

CS1101S or CS1010?

why are you here?


Ddp folks l.jpg

DDP folks

You can sleep


Turing programme l.jpg

Turing Programme

Yes, you also can sleep


Brief history l.jpg

Brief History

  • Scheme was developed at MIT in 1975 to teach programming methodology

  • First introduced at NUS 13 years ago

  • I took this class at MIT in 1994.


Slide7 l.jpg

What is Scheme?


Slide8 l.jpg

8

(+ 5 3)

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

2

prefix notation


Slide9 l.jpg

11

(+ 5 6)

(define a 5)

(+ a 6)

11


Scheme is expressive l.jpg

Scheme is Expressive

(define (square x) (* x x))

To square something, multiply it by itself

(square 2)

(square (square 3))

4

36

81


Slide11 l.jpg

Congratulations!

You know Scheme


Slide12 l.jpg

Why Scheme?


Slide13 l.jpg

Simple

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


Slide14 l.jpg

Futile to Teach a Language

(Here today, gone tomorrow)


Slide15 l.jpg

Computational Thinking


Towers of hanoi l.jpg

Towers of Hanoi


Towers of hanoi17 l.jpg

Towers of Hanoi


Towers of hanoi18 l.jpg

Towers of Hanoi


Towers of hanoi19 l.jpg

Towers of Hanoi


Towers of hanoi20 l.jpg

Towers of Hanoi


Towers of hanoi21 l.jpg

Towers of Hanoi


Towers of hanoi22 l.jpg

Towers of Hanoi


Towers of hanoi23 l.jpg

Towers of Hanoi


Slide24 l.jpg

Can you solve this

for 1,000 discs?


Slide25 l.jpg

How would we think about the problem?


Slide26 l.jpg

What if we have one disc?


Slide27 l.jpg

What if we have no discs?

Do nothing!


Towers of hanoi28 l.jpg

Towers of Hanoi

A

B

C

Suppose we know how to move

3 discs from A to C


Towers of hanoi29 l.jpg

Towers of Hanoi

A

B

C

Suppose we know how to move

3 discs from A to C


Towers of hanoi30 l.jpg

Towers of Hanoi

A

B

C

Claim: we can move

3 discs from A to B. Why?


Towers of hanoi31 l.jpg

Towers of Hanoi

A

B

C

Claim: we can move

3 discs from A to B. Why?


Towers of hanoi32 l.jpg

Towers of Hanoi

A

B

C

What do we do for

4 discs?


Towers of hanoi33 l.jpg

Towers of Hanoi

(define (move-tower size from to extra)

(cond ((= size 0) #t)

(else

(move-tower (- size 1) from extra to)

(print-move from to)

(move-tower (- size 1) extra to from))))

from

extra

to


Towers of hanoi34 l.jpg

Towers of Hanoi

(define (print-move from to)

(newline)

(display "move top disk from ")

(display from)

(display " to ")

(display to))


Slide35 l.jpg

Recursion


Cs1101s road map l.jpg

Java

CS1101S Road Map

Memoization

Streams

ADVANCED

Dynamic Programming

Object-Oriented Programming

INTERMEDIATE

Symbolic Data

Higher-Order Procedures

Generic Operators

List Processing

BASIC

Mutation & State

Data Abstraction

Procedural Abstraction

Iteration

Recursion

Wishful Thinking

Order of Growth

Fundamental concepts of computer programming


Slide37 l.jpg

CS1101S or CS1010?


Slide38 l.jpg

How to decide?


Slide39 l.jpg

Puke

Test


Caveat l.jpg

Caveat

  • To enroll in CS1101S, min requirement of A grade for ‘A’ Level Math or equivalent.

  • Or you can appeal at Undergrad Office


Slide41 l.jpg

like

?


Scheme vs c l.jpg

Scheme vs C

  • Who would you marry?

    • Pretty but poor?

    • Rich but ugly?


Slide43 l.jpg

Ask your friend


Slide44 l.jpg

Ask a senior


10 reasons not to take cs1101s l.jpg

10 Reasons NOTto take CS1101S

  • If you hate Math

  • If you don’t like challenges

  • If you cannot manage self-studying and need to be spoonfed

  • If you just want to get a free A

  • If you are not interested in learning more


10 reasons not to take cs1101s46 l.jpg

10 Reasons NOTto take CS1101S

  • If you don’t like personalised attention

  • If you don’t wish to meet like-minded peers

  • If you don’t care about applying your knowledge

  • If you don’t take shocks well/if you fear evilness

  • If you don’t like shuai prof :P


Google is your friend l.jpg

Google is your Friend

“cs1101s midterm review”


Slide49 l.jpg

Why are you here?


Slide50 l.jpg

What is the meaning of life?


Slide51 l.jpg

many paths to

success


Slide52 l.jpg

“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......


Slide53 l.jpg

......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


Questions l.jpg

QUESTIONS


  • Login