1 / 54

# - PowerPoint PPT Presentation

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.

## PowerPoint Slideshow about '' - PamelaLan

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

to SoC!

why are you here?

You can sleep

### Turing Programme

Yes, you also can sleep

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

(+ 5 3)

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

2

prefix notation

(+ 5 6)

(define a 5)

(+ a 6)

11

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

To square something, multiply it by itself

(square 2)

(square (square 3))

4

36

81

You know Scheme

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

(Here today, gone tomorrow)

for 1,000 discs?

What if we have no discs?

Do nothing!

A

B

C

Suppose we know how to move

3 discs from A to C

A

B

C

Suppose we know how to move

3 discs from A to C

A

B

C

Claim: we can move

3 discs from A to B. Why?

A

B

C

Claim: we can move

3 discs from A to B. Why?

A

B

C

What do we do for

4 discs?

(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

(define (print-move from to)

(newline)

(display "move top disk from ")

(display from)

(display " to ")

(display to))

Memoization

Streams

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

Test

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

• Or you can appeal at Undergrad Office

?

• Who would you marry?

• Pretty but poor?

• Rich but ugly?

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 NOTto take CS1101S

• If you don’t like personalised attention

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

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

• If you don’t like shuai prof :P

“cs1101s midterm review”

success

“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