|
Size: 3855
Comment:
|
Size: 3879
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 6: | Line 6: |
| || Intro to labs || (./) week 0 || || (./) week 0 || || || Compiling [[BR]] gcc and/or eclipse || (./) || || (./) || || |
|| [#Introtolabs Intro to labs]] || (./) week 0 || || (./) week 0 || || || [#Compiling Compiling] [[BR]] gcc and/or eclipse || (./) || || (./) || || |
| Line 51: | Line 51: |
| == Intro to labs == == Compiling - gcc and/or eclipse == == Problem Solving - topdown, systematic == == Problem Solving - abstraction == == if/then/else, chained ifs, while loops, function calls == == primative types == == typecasting == == pointers == == pass by reference/pass by value == == arrays == == arrays 2D+ == == strings (basic) == == strings (advanced) - subtle problems with terminating byte == == pointer arithmetic (brief) == == structure of memory == == dynamic memory allocation == == stack frames == == stack overflow security == == recursion (intro) == == linked lists == == adts (intro) == == trees (intro building traversing) == == graphs (intro using adjacency matrix) == == adts (using, constructing) == == stacks, queues == == recursion == == time and space complexity == == big oh notation == == analysing complexity (a priori) == == analysing complexity (a postori) == == big oh notation == == bfs dfs search == == trees and tree algorithms == == self balancing trees == == graphs and graph algorithms == == c99 extensions == == for, switch == == intro to unstructured commands == == style == == documentation == == unit testing == == systematic debugging == == programming in groups == |
[[Anchor(Introtolabs)]] ==== Intro to labs ==== finding labs, logging in, booking terminals, selecting gui, reading email, starting browser, starting x terminal, printing, ssh and pico and sftp from home [[Anchor(Compiling)]] ==== Compiling - gcc and/or eclipse ==== ==== Problem Solving - topdown, systematic ==== ==== Problem Solving - abstraction ==== ==== if/then/else, chained ifs, while loops, function calls ==== ==== primative types ==== ==== typecasting ==== ==== pointers ==== ==== pass by reference/pass by value ==== ==== arrays ==== ==== arrays 2D+ ==== ==== strings (basic) ==== ==== strings (advanced) - subtle problems with terminating byte ==== ==== pointer arithmetic (brief) ==== ==== structure of memory ==== ==== dynamic memory allocation ==== ==== stack frames ==== ==== stack overflow security ==== ==== recursion (intro) ==== ==== linked lists ==== ==== adts (intro) ==== ==== trees (intro building traversing) ==== ==== graphs (intro using adjacency matrix) ==== ==== adts (using, constructing) ==== ==== stacks, queues ==== ==== recursion ==== ==== time and space complexity ==== ==== big oh notation ==== ==== analysing complexity (a priori) ==== ==== analysing complexity (a postori) ==== |
Core Computing Syllabus
Topic |
1911BRComputing 1 |
1921BRComputing 2 |
1917BRHigher Computing 1 |
||
[#Introtolabs Intro to labs]] |
|
|
|
|
|
[#Compiling Compiling] BR gcc and/or eclipse |
|
|
|
|
|
Problem SolvingBRtopdown, systematic |
|
|
|
|
|
Problem SolvingBRabstraction |
|
|
|
|
|
if/then/else, chained ifs, while loops, function calls |
|
|
|
||
primative types |
|
|
|
|
|
typecasting |
|
|
|
|
|
pointers |
|
|
|
|
|
pass by reference/pass by value |
|
|
|
|
|
arrays |
|
|
|
|
|
arrays 2D+ |
|
|
|
|
|
strings (basic) |
|
|
|
|
|
strings (advanced) BR subtle problems with terminating byte |
|
|
|
|
|
pointer arithmetic (brief) |
|
|
|
|
|
structure of memory |
|
|
|
|
|
dynamic memory allocation |
|
|
|
|
|
stack frames |
|
|
|
|
|
stack overflow security |
|
|
|
|
|
recursion (intro) |
|
|
|
|
|
linked lists |
|
|
|
|
|
adts (intro) |
|
|
|
|
|
trees (intro building traversing) |
|
|
|
|
|
graphs (intro using adjacency matrix) |
|
|
|
|
|
adts (using, constructing) |
|
|
|
|
|
stacks, queues |
|
|
|
|
|
recursion |
|
|
|
|
|
time and space complexity |
|
|
|
|
|
big oh notation |
|
|
|
|
|
analysing complexity (a priori) |
|
|
|
|
|
analysing complexity (a postori) |
|
|
|
|
|
big oh notation |
|
|
|
|
|
bfs dfs search |
|
|
|
|
|
trees and tree algorithms |
|
|
|
|
|
self balancing trees |
|
|
|
|
|
graphs and graph algorithms |
|
|
|
|
|
c99 extensions |
|
|
|
|
|
for, switch |
|
|
|
|
|
intro to unstructured commands |
|
|
|
|
|
style |
|
|
|
|
|
documentation |
|
|
|
|
|
unit testing |
|
|
|
|
|
systematic debugging |
|
|
|
|
|
programming in groups |
|
|
|
|
week 0 Intro to labs
finding labs, logging in, booking terminals, selecting gui, reading email, starting browser, starting x terminal, printing, ssh and pico and sftp from home
Compiling - gcc and/or eclipse
Problem Solving - topdown, systematic
Problem Solving - abstraction
if/then/else, chained ifs, while loops, function calls
primative types
typecasting
pointers
pass by reference/pass by value
arrays
arrays 2D+
strings (basic)
strings (advanced) - subtle problems with terminating byte
pointer arithmetic (brief)
structure of memory
dynamic memory allocation
stack frames
stack overflow security
recursion (intro)
linked lists
adts (intro)
trees (intro building traversing)
graphs (intro using adjacency matrix)
adts (using, constructing)
stacks, queues
recursion
time and space complexity
big oh notation
analysing complexity (a priori)