# COMP1927 Data Structures and Algorithms

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

Updated On 02 Feb, 19

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

Updated On 02 Feb, 19

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

- On-demand Videos
- Login & Track your progress
- Full Lifetime acesses

4.1 ( 11 )

Lecture 22 of comp1927 computing2 data structures and algorithms

The difference between inside and outside (inside is drier when it is raining).

Lecture by Richard Buckland UNSW Computing 2009

Sam

Sep 12, 2018

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Dembe

March 29, 2019

Great course. Thank you very much.