Computational Thinking

(General Introduction)
Video 5.0a

Hon Wai Leong

Department of Computer Science
National University of Singapore
Email, FB: leonghw@comp.nus.edu.sg

Learn  CT  &  Develop  ITeMS

Q-Module: Tourist Problem) Page 1
Hon Wai Leong, SoC, NUS
Content of this video

q  Components of the CT Segment

q  Quick Self-Introduction

q  Quick intro to CS

q  CT is for Everyone, ITeMS

q  Problem Solving via “Asking Questions”

Q-Module: Tourist Problem) Page 2

Hon Wai Leong, SoC, NUS
Components of the CT Segment
q  (this video) Intro to CT Segment
q  Lectures 5 & 6 (few short videos each)

q  Tutorial (problem solving)

v  some discussed, some to be handed-in

q  Compulsory Readings (2)

q  Miscellaneous
v A few videos on CT related topics

Q-Module: Tourist Problem) Page 3

Hon Wai Leong, SoC, NUS
Content of Lecture Videos
q  Lecture 5:
v Problem Solving, the CS Way
v Tourist Problem (6 short fun videos)
v Problem Transformation

q  Lecture 6:
v Algorithm Design (abstraction, decomposition)
v Developing an ITeMS (IT-enabled MindSet)
v Computability and Efficiency

Q-Module: Tourist Problem) Page 4

Hon Wai Leong, SoC, NUS
 Assoc. Prof. Leong Hon Wai

Dept of Computer Science
School of Computing, NUS


(Recursive Arches)
Dec 2015, @StanfordU
Q-Module: Tourist Problem) Page 5
Hon Wai Leong, SoC, NUS
 What I do and like to do…
Research:
Design and analysis of algorithms
[ 算法设计与分析 ]
Transportation Logistics
Teaching:
Algorithms Design and Analysis
Discrete Mathematics

Computational Biology Graph Theory and Algorithms

[ 生物信息学 ] Problem Solving in Computing
Invitation to Computer Science
Selected Hobbies:
Mentor / Develop Talents
[ SMP, SRP, UROP, etc ]
National Olympiad in Informatics
[ 新加波信息学奥林匹克竞赛 ]
International Olympiad in [ 24 hours CodeJam ]
Informatics
[ 国际信息学奥林匹克竞赛 ] since 2007
Q-Module: Tourist Problem) Page 6
Hon Wai Leong, SoC, NUS
 Computational
Thinkerer
Dr. Melvin Zhang &
Prof Leong Hon Wai

@Maker Faire SG

25-26 June 2016
Q-Module: Tourist Problem) Page 7
Hon Wai Leong, SoC, NUS
Content

q  Components of the CT Segment

q  Self-Introduction

q  Quick intro to CS and CT

q  CT is for Everyone

q  Problem Solving via “Asking Questions”

Q-Module: Tourist Problem) Page 8

Hon Wai Leong, SoC, NUS
Quick look at Computer Science
q  A very young field
v First computers were built only in 40’s, 50’s

q  Yet, today CS is everywhere

v Everyone uses computing devices, software
v CS and IT has reached all areas, all sectors

q  But, the fundamental questions remain

the same.

Q-Module: Tourist Problem) Page 9

Hon Wai Leong, SoC, NUS
Questions asked in CS…

What is the nature of problem & computation

v What problems/questions are computable?
v What problems are not computable?

Incompleteness Theorems
v There are problems that are not computable.

Q-Module: Tourist Problem) Page 10

Hon Wai Leong, SoC, NUS
Search for Good Solutions…

Given a computable problem P,

v  Can we design an algorithm to solve P?
v  Can we design a faster algorithm for P?

What does it mean to have a fast algorithm?

v  Is there a limit to how fast it can go?
v  What is the fastest algorithm to solve P?

Q-Module: Tourist Problem) Page 11

Hon Wai Leong, SoC, NUS
What about the (big) data…

Given the data for problem P,

v  How to better organize (big) data?
v  Better data analytics
v  Better data visualization?

Q-Module: Tourist Problem) Page 12

Hon Wai Leong, SoC, NUS
Speed and Efficiency

How to measuring “speed” of an algorithm?

v  Running time of an algorithm express in math
v  Use it to compare different algorithms

Efficient algorithms vs intractable ones

v  Some algorithm are correct, but “forever” to run
v  They are impractical or intractable

Q-Module: Tourist Problem) Page 13

Hon Wai Leong, SoC, NUS
Content

q  Components of the CT Segment

q  Self-Introduction

q  Quick intro to CS

q  CT is for Everyone

q  Problem Solving via “Asking Questions”

Q-Module: Tourist Problem) Page 14

Hon Wai Leong, SoC, NUS
 Comm of ACM, 2006.

Q-Module: Tourist Problem) Page 15

Hon Wai Leong, SoC, NUS
Computational Thinking…

A definition:
“Computational thinking is a way of solving
problems, designing systems, and understanding
human behaviour that draws on concepts fundamental
to computer science. To flourish in today’s world,
computational thinking has to be a fundamental part
of the way people think and understand the world.”
(…Jeannette Wing, CMU, 2006)

Q-Module: Tourist Problem) Page 16

Hon Wai Leong, SoC, NUS
A “Computational Thinking” Wordle

Q-Module: Tourist Problem) Page 17

Hon Wai Leong, SoC, NUS
Computational Thinking involves

Problem
Abstraction
Formulation

Algorithm Decomposition
Design Composition

Finding a Thinking Abstractly

Pattern Thinking Algorithmically
Thinking Recursively
Thinking Concurrently
Q-Module: Tourist Problem) Page 18
Hon Wai Leong, SoC, NUS
Computational thinking: A digital age skill
for everyone
(A 4-min video from ISTE)
https://www.youtube.com/watch?v=VFcUgSYyRPg

Q-Module: Tourist Problem) Page 19

Hon Wai Leong, SoC, NUS
Develop ITeMS

Knows How to Leverage on IT

(what’s possible, what’s not)

ITeMS: IT Enabled MindSet

(Able to apply IT knowledge to solve problems)

“If you know what is possible,

you can always find the right people to do it.”

Q-Module: Tourist Problem) Page 20

Hon Wai Leong, SoC, NUS
Quick Summary:

We introduced the CT Segment

Gave quick intro to CS & CT
Argue for ITeMS

Q-Module: Tourist Problem) Page 21

Hon Wai Leong, SoC, NUS
 (End of video 5.0a)
Watch “Polya’s 4-Step PS Process”
in Video 5.0b
If you want to contact me,
Email: leonghw@comp.nus.edu.sg

Q-Module: Tourist Problem) Page 22

Hon Wai Leong, SoC, NUS