Linked List ADT in C 2/2 - Richard Buckland
By Richard Buckland - University of New South Wales
-
563
- Report An Inaccuracy In Lecture Information:
Lecture Description
This video explains a data-type used to represent an abstract "Pile of Cards" (using a C linked list). It is broken into 2 short parts - this is part 2.
This was used back in semester 1 of 2006 for the major project in UNSW's introductory programming course "Computing 1". The pile of cards was just an abstract linked list.
In it I try to explain: "Why are these type definitions used?" and "What is going on here with abstraction?"
background: I made the video when I got home after giving a lecture while suffering from a mild cold (or some similar excuse) and realised I'd done a poor job of explaining the types during the lecture.
Watching this video was a second chance for the poor students to understand what was going on with the types.
Course Description
These are the 2009 lectures of COMP1927 Algorithms and Data Structures, aka Computing2 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 were recorded August-November 2009 and are gradually being uploaded to youtube.
A selection of the course material is available at www.openlearning.net All of the course material will eventually be available (once all the videos are posted)
This course is followed by COMP2911 which looks at Design in computing, including OO design and algorithm design. In the first half of 2010 Richard's lectures for this course were also be recorded and will be posted next.
Course Index
Show:
