IB Computer Science - Option D (Object-Oriented Programming) - HL

Need to cram? Buy my Option D Study Guide + Slides here: ($3.99):

Also available are my:

Link to JETS (IB Java Examination Tool Subset) Guide:

00:00 - Intro
03:12 - Linked Lists
05:20 - Linked Lists - Basic Coding Tasks
06:09 - Create and Initialize a LinkedList
11:10 - Display the Contents of a LinkedList
16:16 - Array to LinkedList
20:48 - LinkedList to Array
27:11 - Iterators (with Linked Lists)
32:42 - Find and Remove Element from LinkedList
38:29 - Combine 2 LinkedLists into 1 LinkedList
42:48 - Linked Lists on the IB Exam
44:34 - Linked Lists Pros and Cons (vs. Arrays)
47:13 - Linked Lists - Ideal Use Cases
48:18 - Array Lists
49:47 - Array Lists vs. Linked Lists
52:42 - 2D Arrays - Basic Coding Tasks
54:31 - Create and Initialize 2D Array
55:45 - Editing and Displaying Individual Elements
56:17 - Display All Elements in 2D Array
59:00 - Calculate Average of Integers in 2D Array
1:02:52 - 2D Arrays - Ideal Use Cases
1:04:28 - Stacks - Basic Coding Tasks
1:05:08 - Create and Initialize Stacks
1:07:06 - Display All Elements in Stack
1:14:56 - Find Maximum Value of Attribute in Stack
1:19:23 - Filter Contents of Stack Based on Criteria
1:23:17 - Find and Remove Value from Stack Based on Criteria
1:27:30 - Stacks on the IB Exam
1:29:19 - Stacks - Ideal Use Cases
1:32:39 - Recursion Intro
1:33:54 - Recursion - Tips
1:36:30 - Recursion Example #1 - Factorial
1:43:21 - Recursion Example #2 - Power (Exponents)
1:50:28 - Recursion Example #3 - Palindromes
1:59:35 - Recursion Trace Table Example
2:05:44 - Recursion - Ideal Use Cases
2:07:14 - Binary Search Trees - Basic Coding Tasks
2:08:00 - Creating and Initializing a Binary Tree
2:10:19 - Why Do We Use Recursion with Binary Trees?
2:11:26 - Output All Elements in Binary Tree
2:15:45 - Find Minimum Value in Binary Tree
2:18:32 - Binary Search Trees Pros & Cons
2:19:33 - Why Searching a Binary Tree is Faster
2:21:00 - Binary Search Trees - Ideal Use Cases
2:22:13 - Wrap Up

[you-le]

My CS HL exam went really well... You have defenietly played an important role in my exam across all of the three papers.
Just want to so say a huge thank you! Keep up the good work sir! Grateful :) 😊✨

[ianfong]

This video is so helpful, this channel is way underrated

[duncanfekete]

Thanks so much! Your videos have made CS HL so much more manageable. Do you think you could do a video covering pseudocode requirements for HL CS?

[gregtheegg]

I got an a* thanks to you, thanks bestie.

[saharshjn]

I have about 4 days till my Paper 2 HL, my school opted for option D but ofcourse I can choose in the paper. Would you recommend me to do Option C or A in the given time? I find D very difficult.

[carticactus]

2:16:00 this method only works with this specific tree right ? so there is a different method to find out the minimum value for each tree?

[aes]

Is coding part necessary to know for the collections? or can we just know how to explain it cause I am really confused about which method to use when or for what...