Download presentation
Presentation is loading. Please wait.
Published byPreston Johnston Modified over 9 years ago
1
Welcome to SoC!
2
CS1101S or CS1010? why are you here?
3
DDP folks You can sleep
4
Turing Programme Yes, you also can sleep
5
Developed at MIT in 1975 to teach programming methodology Scheme
6
Introduced at NUS 14 years ago Scheme 1994
7
What is Scheme?
8
(+ 5 3) (- (+ 5 3) (* 2 3)) prefix notation 8 2
9
(+ 5 6) (define a 5) (+ a 6) 11
10
Scheme is Expressive (define (square x) (* x x)) To square something, multiply it by itself (square 2) (square (square 3)) 4 3681
11
Congratulations! You know Scheme
12
Why Scheme?
13
Simple (didn’t you just learn it in 10 mins? )
14
Futile to Teach a Language (Here today, gone tomorrow)
15
Computational Thinking
16
Towers of Hanoi
24
Can you solve this for 1,000 discs?
25
How would we think about the problem?
26
What if we have one disc?
27
What if we have no discs? Do nothing!
28
Towers of Hanoi Suppose we know how to move 3 discs from A to C ABC
29
Towers of Hanoi Suppose we know how to move 3 discs from A to C ABC
30
Towers of Hanoi Claim: we can move 3 discs from A to B. Why? ABC
31
Towers of Hanoi Claim: we can move 3 discs from A to B. Why? ABC
32
Towers of Hanoi What do we do for 4 discs? ABC
33
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
34
Towers of Hanoi (define (print-move from to) (newline) (display "move top disk from ") (display from) (display " to ") (display to))
35
Recursion
36
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
37
“Star Wars” RPG
38
JFDI Academy
40
CS1101S or CS1010?
41
How to decide?
42
Puke Test
43
What is your pain threshold?
44
Scheme vs C Who would you marry? –Pretty but poor? –Rich but ugly?
45
Ask your friend
46
Ask a senior
47
Google is your Friend “cs1101s midterm review”
48
Why are you here?
49
What is the meaning of life?
51
CS1010 CS1101S CS1020CS2010 CS2020 CS1101R Scheme C JavaScript Java (4 MC) (5 MC) (1 MC)
52
many paths to success is not about how fast
53
“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...... “
54
......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 “
55
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
56
Please indicate preference by 12 noon tomorrow
57
QUESTIONS
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.