COMP1511 Week 8 Lecture 2
COMP1511 is UNSW's Programming Fundamentals.
00:00:00 - Pre-lecture
00:04:47 - Lecture plan poll
00:11:55 - Visualisation of linked list
00:14:47 - Question: what is each node called?
00:18:20 - Question: how are arrays and linked lists different?
00:21:40 - Question: when do we free memory?
00:23:30 - Question: what does malloc return?
00:28:15 - Question: what is a memory leak?
00:32:15 - Memory leak, leak check, and free demo
00:44:30 - Run-through of the linked list code
00:53:05 - Time for a break!
01:05:50 - (Exam style question) boilerplate
01:16:08 - (Exam style question) starting the function
01:29:25 - (Exam style question) if the lengths are different
01:45:25 - Lecture feedback
Watch video COMP1511 Week 8 Lecture 2 online without registration, duration hours minute second in high quality. This video was added by user UNSW COMP1511 01 January 1970, don't forget to share it with your friends and acquaintances, it has been viewed on our site 1,610 once and liked it 14 people.