CS 204 • Midterm I • Advanced Programming

Features

Examples

How do computers work?

Preprocessors 1

Preprocessors 2

Macros

Introduction

Definition and Declaration

Assignment and Dereference

Be Careful!

Pointer of Pointers - new Keyword

Pointers with Arrays

sizeof() - malloc() - free()

delete Keyword

Pointers as Function Parameters

Pointers of Functions

Pointers of User-Defined Classes

Static Array vs Dynamic Array

2D Static Arrays

2D Dynamic Arrays

Efficiency of Pointers

Macros (2013)

Preprocessors / Macros (2025)

Preprocessors / Macros (2024)

Preprocessors / Macros (2017)

Preprocessors (2021)

Pointers (2021)

Pointers (2025)

Pointers (2013)

Pointers (2017)

Pointers (2016)

Pointers (2019)

Pointers (2024)

Pointers (2025)

Pointers (2025)

Pointers (2015)

Pointers (2017)

Pointers (2025)

Pointers (2025)

Preprocessors / Linked List / Basics (2024)

Pointers / Preprocessors (2025)

Pointers / Basics (2025)

Basics (2024)

Pointers / Preprocessors / Macros (2017)

Arrays / Pointers / Basics (2017)

Some Background Information

What is a linkedlist?

Reminder: Structs

Constructing Linkedlists

Head and Tail Pointers

Printing a Linkedlist

Adding a Node to the End

Adding a Node in between Two Nodes (Add to a Sorted List)

Finding a Node in the List

Deleting a Node

Deleting the List

What is a Circular Linkedlist?

Constructing the List

Adding a Node to the Beginning/End

Adding a Node in between Two Nodes (Add to a Sorted List)

Counting Number of Elements

Finding a Node in the List

Deleting a Node

Constructing the List

Adding a Node to the Beginning

Adding a Node In Between two Nodes (Add to a Sorted List)

Adding a Node to End of the List

Deleting a Node from the Beginning

Deleting a Node in between Two Nodes (Deleting from a Sorted List)

Deleting a Node from the End

Finding a Node in the List

2D Linkedlists

Hybrid Linkedlists

Constructing the List

Adding a PRIMARY NODE to the End of List

Adding a PRIMARY NODE in Between two Nodes

Adding a SECONDARY NODE to the End of a Row

Adding a SECONDARY NODE in Between two Nodes

Deleting a SECONDARY NODE

Deleting ALL SECONDARY NODES in a Row

Deleting a PRIMARY NODE

Clearing the List

Definition of Recursion

An Example: Factorials

Another Example: Fibonacci Numbers

Binary Search Operation

Binary Search Trees (BST)

Insertion in BST

Searching in BST

Displaying a BST

Linked List (2024)

Linked List (2016)

Linked List (2019)

Doubly Linked List (2017)

Doubly Linked List (2015)

Doubly Linked List (2021)

Doubly Linked List (2025)

Circular Linked Lists (2013)

Recursion & Binary Tree (2016)

Recursion (2017)

Preprocessor/Macro 1

Preprocessor/Macro 2

Pointers 1

Pointers 2

Pointers 3

Linked Lists 1

Linked Lists 2

Linked Lists 3

Linked Lists 4

Linked Lists 5

Linked Lists 6

Linked Lists 7

Linked Lists 8

Linked Lists 9

Linked Lists 10

Recursion 1

Recursion 2

Binary Tree 1

Binary Tree 2

Pointers

Preprocessors / Macro

Doubly Linked List

Basics

Basics

Stack

True / False

Pointers

Circular Linked List