Introduction To Computational Thinking
AY2021/2022 Semester 1
Computational thinking (CT) is a problem solving process with the aid of computer; i.e. formulating a problem and expressing its solution in such a way that a computer can effectively carry it out. It includes a number of characteristics, such as breaking a problem into small and repetitive ordered steps, logically ordering and analyzing data and creating solutions that can be effectively implemented as algorithms running on computer. As such, CT is essential not only to the Computer Science discipline, but also can be used to support problem solving across all disciplines, including math, science, engineering, business, finance and humanities. The aim of this course is hence to take you students with no prior experience of thinking in a computational manner to a point where you can derive simple algorithms and code programs to solve some basic problems in your domain of studies. You will also learn current computer languages, such as Python, for the coding. In addition, the course will include topics on the internal operations of a processor, and raise awareness on the socio-ethical issues arising from the pervasiveness of computing technology.
| AUs | 3.0 AUs |
| Categories | Core |
| Not Available To Programme | ACBS, ACC, ADM, ARED, BCE, BCG, BEEC, BIE, BMS, BS, BSB, BSPY, BUS, CBE, CBEC, CE, CEE, CEEC, CHEM, CHIN, CNEL, CNLM, CS, CSC, CSEC, CVEC, DSAI, ECMA, ECON, ECPP, ECPS, EEE, EEEC, EESS, ELAH, ELH, ELHS, ELPL, ENE, ENEC, ENG(CEE), ENG(EEE), ENG(ENE), ENG(NULL), ESPP, HIST, HSCN, HSLM, IEEC, IEM, LMEL, LMPL, LMS, MACS, MAEC, MAEO, MAT, MATH, MS(ITG), MS(NULL), MS-2ndMaj/Spec(MSB), MTEC, PHIL, PHY, PLCN, PLHS, PPGA, PSLM, PSMA, PSY, REP, SCED, SOC, SSM |
| Mutually Exclusive With | BG2211, BS1009, CE1003, CE1103, CH2107, CV1014, CZ1003, CZ1103, EE1005, FE1008, MS1008, PS0001 |
| Exam |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| 830 | COMMON LEC (LE) 0830-0920 Mon ONLINE | 23110 TUT (MA14) 0830-1020 Fri N3.2-01-34 Wk2-13 | 23111 TUT (MA15) 0830-1020 Fri N3.2-01-34 Wk2-13 | 23112 TUT (MA16) 0830-1020 Fri N3.2-01-34 Wk2-13 | |||||||
| 900 | |||||||||||
| 930 | |||||||||||
| 1000 | |||||||||||
| 1030 | 23097 TUT (MA1) 1030-1220 Mon N3.2-01-34 Wk2-13 | 23098 TUT (MA2) 1030-1220 Mon N3.2-01-34 Wk2-13 | 23099 TUT (MA3) 1030-1220 Wed N3.2-01-34 Wk2-13 | 23100 TUT (MA4) 1030-1220 Wed N3.2-01-34 Wk2-13 | 23102 TUT (MA6) 1030-1220 Thu N3.2-01-34 Wk2-13 | 23103 TUT (MA7) 1030-1220 Thu N3.2-01-34 Wk2-13 | 23104 TUT (MA8) 1030-1220 Thu N3.2-01-34 Wk2-13 | 23113 TUT (MA17) 1030-1220 Fri N3.2-01-34 Wk2-13 | 23114 TUT (MA18) 1030-1220 Fri N3.2-01-34 Wk2-13 | 23115 TUT (MA19) 1030-1220 Fri N3.2-01-34 Wk2-13 | |
| 1100 | |||||||||||
| 1130 | |||||||||||
| 1200 | |||||||||||
| 1230 | |||||||||||
| 1300 | |||||||||||
| 1330 | 23105 TUT (MA9) 1330-1520 Thu N3.2-01-34 Wk2-13 | 23106 TUT (MA10) 1330-1520 Thu N3.2-01-34 Wk2-13 | 23107 TUT (MA11) 1330-1520 Thu N3.2-01-34 Wk2-13 | ||||||||
| 1400 | |||||||||||
| 1430 | |||||||||||
| 1500 | |||||||||||
| 1530 | 23101 TUT (MA5) 1530-1720 Thu N3.2-01-34 Wk2-13 | 23108 TUT (MA12) 1530-1720 Thu N3.2-01-34 Wk2-13 | 23109 TUT (MA13) 1530-1720 Thu N3.2-01-34 Wk2-13 | ||||||||
| 1600 | |||||||||||
| 1630 | |||||||||||
| 1700 | |||||||||||