COMP1927 Data Structures and Algorithms

The University of New South Wales Course , Prof. Richard Buckland

Lecture 1:

Download:    MP4,FLV & 3GP
 
Lecture Details :

A selection of the course material is available at https://wiki.cse.unsw.edu.au/openlearning/computing2

This is the first lecture of COMP1927 Algorithms and Data Structures, which is the second computing course taken by first year computing students at UNSW. This course follows immediately on from COMP1917 (also available on youtube).

These lectures are currently being recorded (August-November 2009).

Course Description :

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

Other Resources


COURSE Reviews

5 Stars 37
4 Stars 8
3 Stars 3
2 Stars 3
1 Stars 8
4.1 Overall Ratings
Top