Skip to main content

Ctrl+K

IDATA 2302 — Algorithms and Data Structures

About This Course

Welcome!
Course Overview
Practicalities
Examination
Additional Resources

Modules

Foundations
Sequences
Recursion
Hashing
- 1. What Is Hashing?
- 2. Collisions
Trees
Graphs
Optimization
Computational Complexity
Beyond RAM

Lab Sessions

Setup
Foundations
Sequences
Recursion
Trees
Graphs
Optimization

Code Examples

Edge List Pattern in Ruby
Adjacency List in JavaScript
Adjacency Matrix in C

Recaps

Math Recap

Search

Ctrl+K

By NTNU

© Copyright 2021, NTNU.