Skip to main content
Data Structures and Algorithms:
BRIDGES
Sydney Melech
x
Search Results:
No results.
☰
Contents
👤
Assignments
Practice
Peer Instruction (Instructor)
Peer Instruction (Student)
Change Course
Instructor's Page
Progress Page
Edit Profile
Change Password
Log Out
You!
Choose avatar
▻
✔️
You!
😺
👤
👽
🐶
🐼
🌈
Font family
▻
✔️
Open Sans
AaBbCc 123 PreTeXt
Roboto Serif
AaBbCc 123 PreTeXt
Adjust font
▻
Size
12
Smaller
Larger
Width
100
narrower
wider
Weight
400
thinner
heavier
Letter spacing
0
/200
closer
f a r t h e r
Word spacing
0
/50
smaller gap
larger gap
Line Spacing
135
/100
closer
together
further
apart
Light/dark mode
▻
✔️
default
pastel
twilight
dark
midnight
Reading ruler
▻
✔️
none
underline
L-underline
grey bar
light box
sunrise
sunrise underline
Motion by:
✔️
follow the mouse
up/down arrows - not yet
eye tracking - not yet
<
Prev
^
Up
Next
>
🔍
\(\newcommand{\R}{\mathbb R} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \definecolor{fillinmathshade}{gray}{0.9} \newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}} \)
Front Matter
1
Introduction
1.1
About BRIDGES
1.2
Setting up Bridges
1.3
Hello World program
1.4
Simple Smiley Face
2
Object-oriented Programming
2.1
Introduction to Object-oriented Programming
2.2
Principles of Object-oriented Programming
2.2.1
Encapsulation
2.2.2
Inheritancr
2.2.3
Polymorphism
2.2.4
Abstraction
2.3
The Unified Modeling Language
2.4
Testing vs Debugging
2.5
Unit Testing
2.5.1
Why do we need unit testing?
2.5.2
What is Unit Testing?
2.5.3
What is JUnit?
2.6
JUint Example
2.7
Bridges Game API Tutorial
3
Introduction to Data Structures and Algorithms
3.1
Data Structures and Algorithms
3.1.1
Introduction
3.1.2
Philosophy of Data Structures
3.1.3
Selecting a Data Structure
3.2
Abstract Data Types
3.2.1
Abstract Data Types
3.3
Abstract Data Types and Generics
3.3.1
Algorithms
3.3.2
Guideline of Data Structure Selection
3.3.3
Learn more about ADT
3.4
Pattern Tutorial
4
Algorithm Analysis
4.1
Problems, Algorithms, and Programs
4.1.1
Problems
4.1.2
Algorithms
4.1.3
Programs
4.1.4
More about Problems, Algorithms, and Programs
4.2
Best, Worst, and Average Cases
4.2.1
More about Best, Worst, and Average cases
4.3
Faster Computer, or Faster Algorithm
4.4
Algorithm Analysis Lecture
4.5
Complexity Matters
5
Linked Nodes and Linked Lists
5.1
Pointers Syntax
5.1.1
Syntax
5.1.2
Declaring a Reference Variable
5.1.3
Reference Rules
5.1.4
Java Reference Vs Pointers
5.2
Linked Nodes
5.3
Doubly Linked Lists
5.4
Linked List Lecture
5.5
Linked List Tutorial
5.6
Exercises
5.6.1
Linked Lists Vs Array Lists Exercise 1
5.6.2
Linked Lists Vs Array Lists Exercise 2
6
Stacks
6.1
Stack Terminology and Implementation
6.2
Linked Stacks
6.3
Stacks and Queues Lecture
7
Queues
7.1
Queue Terminology
7.2
Array-Based vs Linked Queues
7.3
Snake with Queues Tutorial
7.3.1
Goals
7.3.2
Programming Tasks
7.3.3
Getting Started
7.3.4
Visualizing the Program
8
Searching and Sorting
8.1
Introduction to Sorting
8.2
Sorting Terminology
8.3
Comparing Records
8.4
Insertion Sort
8.5
Selection Sort
8.6
Searching and Sorting Algorithm Lecture
8.7
Binary Search Lab 1
8.8
Binary Search Lab 2
8.8.1
Goals
8.8.2
Tasks
8.9
Sorting Benchmark
8.9.1
Goals
8.9.2
Tasks
9
Recursion
9.1
Introduction to Recursion
9.2
Tracing Recursive Code
9.3
Recursion Lecture
9.4
Quicksort Algorithm Practice
9.4.1
Goals
9.4.2
Tasks
10
Binary Trees
10.1
Binary Trees Introduction
10.2
Binary Trees Definitions and Properties
10.3
Binary Tress Traversals
10.3.1
Binary Tress Traversals
10.3.2
Preorder Traversal
10.3.3
Postorder Traversal
10.3.4
Inorder Traversal
10.3.5
Implementation
10.3.6
Examples of Preorder, Postorder, and Inorder Traversals
10.4
Binary Search Trees
10.5
Binary Trees Lecture
10.6
Binary Search Tree Exercise
10.6.1
Goals
10.6.2
Programming Tasks
10.6.3
Building The BST
11
Hashing
11.1
Introduction to Hashing
11.2
Open Hashing
11.3
Bucket Hashing
11.4
Collision Resolution
11.5
Hash Tables and Hash Maps Lecture
11.6
HashMap Lab
11.6.1
Counting word appearances using a Dictionary and a custom implementation
11.6.2
Getting Started
11.6.3
Tasks to Complete
11.6.4
Functionality Information
12
Graphs
12.1
Graphs Chapter Introduction
12.2
Graph Traversals
12.3
Graphs Leture
12.4
Earthquake Tracker Assignment
12.4.1
Goals
12.4.2
Programming Tasks
12.4.3
Place Earthquakes on the map
12.4.4
Build a graph based on distances
12.4.5
Show just the graph
Backmatter
Section
5.4
Linked List Lecture
Here is the link to download the lecture on linked lists:
Slides
1
You have attempted
of
activities on this page.
uncc.instructure.com/courses/16965/files/21470945/download?download_frd=1
