CS2040S-tutorials

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

CS2040S-tutorials

★ 15 Open GitHub ↗

Tutorial Slides for CS2040S, Data Structures and Algorithms at NUS Computing.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

![](https://www.comp.nus.edu.sg/templates/t3_nus2015/images/assets/logos/logo.png)

# CS2040S Data Structures and Algorithms - Tutorials

This repository contains tutorial slides for CS2040S, *Data Structures and Algorithms* (AY 2022/2023 Semester 1), taught by Dr. Chong Ket Fah, National University of Sinapore. The slides are partly adopted from tutorial slides by [Wang Zhi Jian](wzhijian@u.nus.edu).

## Topics covered in each tutorial

- [Tutorial 1](./t1/t1.pdf): Asymptotic Analysis, Big-O notation, running time analysis of algorithms.
- [Tutorial 2](./t2/t2.pdf): Sorting algorithms, Quick Select algorithm, and their applications.
- [Tutorial 3](./t3/t3.pdf): Arrays, Linked lists and their variants, list ADT, stack ADT, queue ADT, Lisp expression, amortized analysis.
- [Tutorial 4](./t4/t4.pdf): Map ADT, hash tables, collision resolution, hash functions, bloom filter.
- [Tutorial 5](./t5/t5.pdf): Heaps, Priority Queue ADT.
- [Tutorial 6](./t6/t6.pdf): Union-Find Disjoint Set.
- [Tutorial 7](./t7/t7.pdf): Binary Search Trees, AVL trees, tree traversal, trie.
- [Tutorial 8](./t8/t8.pdf): Graph representation, graph traversal, cycle detection, topological ordering.
- [Tutorial 9](./t9/t9.pdf): Minimum Spanning Tree, Prim's & Kruskal's Algorithm.
- [Tutorial 10](./t10/t10.pdf): Shortest Paths, Bellman-Ford Algorithm.
- [Tutorial 11](./t11/t11.pdf): Dijkstra's Algorithm.

CS2040S-tutorials

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README