SIT221_LIBRARY

C# Classlibs for SIT221 Programming Tasks

Table of Contents

• Table of Contents
• About The Project
  • Built With
• License
• Data Structures
• Algorithms
• Design Patterns
• Submissions
• Contact

About The Project

This repository contains projects and files in prepation for and completion of SIT221 - Data Structures and Algorithms, at Deakin University in Trimester 2, 2020.

The code is primarily C# .NET, however some files are written in Go or Java.

Built With

• C# .NET

License

Distributed under the MIT License. See LICENSE for more information.

Data Structures

• Vector
• Doubly Linked List
• Stack - this generic implementation provides Push(), Pop() and Min() in Theta(1) time complexity
• Specialised Stack - this implements Push(), Pop() and Min() in Theta(1) time complexity
• AVL Tree
• Heap

Algorithms

• Bubblesort
• Insertionsort
• Seletionsort
• Mergesort (recursive)
• Mergesort Bottom Up (iterative)
• Randomised in-place Quicksort
• Binary Search
• AVL Tree rotations
• Heap operations

Design Patterns

• Iterator pattern

To run all unit tests, run:

dotnet test

Submissions

• Task 0.1
• Task 1.1P
• Task 2.1P
• Task 2.2C
• Task 3.1P
• Task 3.2D
• Task 4.1C
• [Task 4.2HD] - to come
• Task 5.1P
• Task 6.1C
• Task 6.2D
• Task 7.1P
• Task 8.1C
• Task 8.2HD
• Task 9.1P

Contact

Peter Stacey - @twitter_handle - pstacey AT deakin.edu.au

Project Link: https://github.com/pscompsci/SIT221_Library