Locked History Attachments

Diff for "CoreCourses/Syllabus"

Differences between revisions 3 and 4
Revision 3 as of 2009-02-17 20:40:37
Size: 2649
Comment:
Revision 4 as of 2009-02-17 20:41:02
Size: 2654
Comment:
Deletions are marked like this. Additions are marked like this.
Line 5: Line 5:
||<:> '''Topic''' ||<:> '''1911[[BR]]Computing 1''' ||<:> '''1921[[BR]]Computing 2''' ||<:> '''1917[[BR]]Higher Computing 1''' ||<:> '''1927[[BR]]Data Structures[[BR]]and Algorithms'''||<:> '''2911[[BR]]Design in Computing'''|| ||<:> '''Topic''' ||<:> '''1911[[BR]]Computing 1''' ||<:> '''1921[[BR]]Computing 2''' ||<:> '''1917[[BR]]Higher Computing 1''' ||<:> '''1927[[BR]]Data Structures[[BR]]and Algorithms'''||<:> '''2911[[BR]]Design in[[BR]]Computing'''||

Core Computing Syllabus

Topic

1911BRComputing 1

1921BRComputing 2

1917BRHigher Computing 1

1927BRData StructuresBRand Algorithms

2911BRDesign inBRComputing

Intro to labs

(./) week 0

(./) week 0

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

(./)

(./)

(./)

(./)

:Teaching/12WeekSyllabus:12 week semester home