COMP1927 Data Structures and Algorithms

0( 0 REVIEWS )
10 STUDENTS

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

Course Curriculum

Course Reviews

N.A

ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

FreeVideoLectures.com All rights reserved.

Setup Menus in Admin Panel