Sign in to confirm you’re not a bot

This helps protect our community. Learn more

Lecture 15, COMP1511 - Programming Fundamentals 2020 Term 2 (Live Streamed)

1.61K subscribers

926 views Streamed 4 years ago

Lecture 15 - Abstract Data Types - Queues We're going to look at what interesting things we can do with multi-file projects and how we can build our own types with their own specific capabilities and rules. In our first example we'll make a Queue.

...more

...more

Live chat replay

See what others said about this video while it was live.

COMP1511 - Programming Fundamentals Week 9 - Lecture 15

What did we learn last week? Linked Lists • A complete working implementation of Linked Lists • Inserting nodes • Removal of nodes • Cleaning our memory

What are we covering today? Abstract Data Types • A recap of Multiple File Projects • More detail on things like typedef • The ability to present capabilities of a type to us... ... without exposing any of the inner workings

Recap - Linked Lists Structures with pointers to their own type • We create Nodes in a Linked List by allocating memory • We receive a pointer to a Node • We connect Nodes together by aiming their pointers at each other A program's memory inot to scale

Removal from Linked Lists Removal • Find the node you wish to remove • Bypass it by taking the previous node's next and aiming it at the node after the node you want to remove • Then free the removed node and all its data

Using Multiple Files Linking the Files • A file that includes the Header (h) file will have access to its functions • It's own implementation (*.c) file will always #include it • Implementation files are never included! Compilation

Lecture 15, COMP1511 - Programming Fundamentals 2020 Term 2 (Live Streamed)

Lecture 15 - Abstract Data Types - Queues We're going to look at what interesting things we can do with multi-file projects and how we can build our own types with their own specific capabilities and rules. In our first example we'll make a Queue.

COMP1511 - Programming Fundamentals Week 9 - Lecture 15

What did we learn last week? Linked Lists • A complete working implementation of Linked Lists • Inserting nodes • Removal of nodes • Cleaning our memory

What are we covering today? Abstract Data Types • A recap of Multiple File Projects • More detail on things like typedef • The ability to present capabilities of a type to us... ... without exposing any of the inner workings

Recap - Linked Lists Structures with pointers to their own type • We create Nodes in a Linked List by allocating memory • We receive a pointer to a Node • We connect Nodes together by aiming their pointers at each other A program's memory inot to scale

Transcript

Follow along using the transcript.

Marc Chee

1.61K subscribers