Save this video free

11.3 - Encapsulation (2026-11-09)

Chris Bourke · 50:28 · Watch on YouTube

Part of University of Nebraska-Lincoln CSCE 155E. See all 9 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Chris Bourke finishes a C exercise that loads 28 book records from a CSV into a dynamically allocated array of structures, then queries the array for the highest-rated, lowest-rated, and oldest books. He uses a countdown to introduce recursion, explains base cases and stack overflow, and shows why naive recursive Fibonacci computation repeats work exponentially before beginning an iterative alternative.

Key takeaways

Chapters

0:00 From the Opening Song to the Book-Structure Exercise
2:26 Allocate an Array for 28 Books
5:16 Initialize Each Book from CSV Tokens
11:47 Find the Best, Worst, and Oldest Books
20:25 Replace a Countdown Loop with Recursion
27:45 Recursion, Self-Reference, and the Fibonacci Definition
31:30 Base Cases, Progress, and Stack Overflow
35:27 Implement and Test Recursive Fibonacci in C
42:15 Why Naive Fibonacci Recursion Is Exponential
45:55 Begin an Iterative Fibonacci Alternative

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:21 When I'm walking I strut my stuff and I'm so strung out. I'm high as a kite I just might stop to check you out. Let me go wild like a blister in the sun. Let me go wild. Big hands I know you're the one. Body and beats I stain my sheets I don't even know why. My girlfriend she's at the end she is starting to cry. Let me go wild like a blister in the sun. Let me go wild. Big hands I know you're the one. When I'm walking I strut my stuff and

1:25 I'm so strung out. I'm high as a kite I just might stop to check you When I'm walking I strut my stuff and I'm so strung out. I am high as a kite I just might stop to check you Body and beats I stain my sheets I don't even >> All right, so today we're going to finish up with the exercise that we were doing where we are loading up all this book data. And now that we have the infrastructure to support a book a structure along with all of the functions that we wrote for it. It's going to be a lot easier than the first time that we did it. Instead of keeping track of all these disparate pieces of data, we're going to be able to put that into one structure.

2:13 Not only that, but instead of keeping track of a single one, I want to load up everything and put it into an array and so I can ask other questions. What's the worst book? What's the oldest book? Etc. Etc. Right? And so what I've got here I just removed all that stuff and we're going to focus on putting all those books into an

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Chris Bourke.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.