Linked Lists explained with illustration of Memory State! (I2204 chap04 complete)
Video Outline:
00:01:00 Section 1 –Local vs. Dynamic Memories: Stack & Heap
00:01:07 The Local Memory ( The Stack )
00:03:09 The Ampersand (&) Bug — TAB
00:05:30 Memory: Local: The Stack versus Dynamic: The Heap
00:07:09 The Heap
00:08:04 Dynamic Allocation Functions
00:09:01 Allocation
00:11:33 Deallocation
00:14:13 Exercise: Allocate & Fill
00:26:45 Section 2 – Linked Lists
00:26:48 Linked Lists
00:27:30 Why Linked Lists?
00:28:20 Disadvantages of Arrays
00:29:58 What Linked Lists Look Like
00:31:52 Example : List {1, 2, 3}
00:33:04 The Empty List — NULL
00:33:55 Section 3 – Seven Code Techniques from Nick Parlante
00:34:12 Nick Parlante
00:34:30 1) Iterate Down a List
00:39:06 2) Changing a Pointer With A Reference Pointer
00:41:40 Special Application: List Building
00:43:24 Push: add a node to the head of the list
00:46:10 Push Animation
00:51:25 3) Build — At Head With Push()
00:54:04 4) Build — With Tail Pointer
00:57:18 5) Build — Special Case + Tail Pointer
01:00:30 6) Build — Dummy Node
01:05:29 7) Build — Local References
01:08:58 Important Remark about Local References
01:12:16 Section 4 – Operations over Linked Lists
01:12:23 Operations over Linked Lists
01:13:58 Example: InsertNth
01:21:18 Section 5 – Linked Lists Variants
01:21:30 Doubly Linked List (DLL)
01:22:49 Circular Linked List (CLL)
01:24:00 Other Linked Lists
01:24:33 The End
Lebanese University Course Lectures
Faculty of Science - section 1 in Beirut Hadat
Applied Math Department
Computer Science - BS Degree - 2nd year
Course name: I2204 Imperative Programming
Course Playlist Link: • I2204 - Imperative Programming
Moodle course page Link: https://moodle.haidar.me/course/view....