VE281

This is a repository for Ve281 Data Structures and Algorithms.

---

Catalog

• Warning
• Project 1
• Project 2
• Project 3
• Project 4
• Project 5

---

Project 1:

The project description is in p1-description.

You are required to construct five sorting algorithms.

• bubble sort
• insertion sort
• selection sort
• merge sort
• quick sort in place
• quick sort extra

You can find the codes in p1-implementation.

Project 2:

The project description is in p2-description.

You are required to construct two selection algorithms.

• Randomized selection
• Deterministic selection

You can find the codes in p2-implementation.

Project 3:

The project description is in p3-description.

You are required to construct three priority queues and then solve a minimal-path-weight problem.

• binary heap
• unsorted heap
• fibonacci heap

You can find the codes in p3-implementation.

Project 4:

The project description is in p4-description.

You are required to construct some efficient and effective data structures to model a equity-transaction system.

Some feasible implementation may contain:

• vector
• map
• multi-map
• set
• multi-set

You can find the codes in p4-implementation.

Project 5:

The project description is in p5-description.

You are required to solve the Directed-Acyclic-Graph-Decision, Shortest-Path and Minimal-Spanning-Tree problems.

Some feasible algorithms could be

• topology sorting
• Dijkstra's algorithm
• Bellman-Ford Algorithm
• Prim’s Algorithm
• Kruskal’s Algorithm

You can find the codes in p5-implementation.

Warning:

For students who are currently taking Ve281, please abide by the Honor Code in case of unnecessary troubles.

CopyRight All Rights Reserved