x
Menu

COMP1927 Data Structures and Algorithms

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

Overview

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

Includes

Lecture 22:

4.1 ( 11 )


Lecture Details

Introduction to Searching (part II). Lectures 21-50 have been recorded and will be posted commencing July 2010. (see my comment below) The first few minutes of the video are the last few minutes of the break where we have been discussing task 2 - which will be a searching task. This is lecture 20 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW.

Ratings

5.0


1 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

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

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send