Skip to content

EugSh/technopolis_aads_2018

 
 

Repository files navigation

AaDS

Homework for Algorithms and Data structures on Java for students Technopolis in Peter the Great St.Petersburg Polytechnic University.


Deadline 18.12.2018

In all classes need implement all required methods.

Before pull request make sure than relevant tests is passed.


Points Test Task
2.5 T1_ADS 1 ArrayDequeSimple
1.0 T2_ASDIR 2 ArrayDequeSimple + Iterator Remove
7.5 T3_ADF 3 ArrayDequeFull
2.5 T4_LDS 4 LinkedDequeSimple
1.0 T5_LDSIR 5 LinkedDequeSimple + Iterator Remove
7.5 T6_LDF 6 LinkedDequeFull
2.5 T7_APQS 7 ArrayPriorityQueueSimple
1.0 T8_APQSIR 8 ArrayPriorityQueueSimple + Iterator Remove
2.5 T9_MPII 9 MergingPeekingIncreasingIterator + IntegerIncreasingSequencePeekingIterator
5.0 T10_AVL 10 AVLTree
5.0 T11_AVLI 11 AVLTreeIterable
1.0 T12_AVLIR 12 AVLTreeIterable + Iterator Remove
5.0 T13_RBA 13 RedBlackTree (add)
5.0 T14_TBAR 14 RedBlackTree (add + remove)
5.0 T15_OHT 15 OpenHashTable + Student
1.0 T16_OHTIR 16 OpenHashTable + Student + Iterator Remove

*Max points == 55

Run TestAllTask for check all task.


How to pull changes from master inside your fork

Make once:

git remote add base https://github.com/mikhail-nechaev/technopolis_aads_2018.git

or

git remote add base [email protected]:mikhail-nechaev/technopolis_aads_2018.git

and then

git pull base master

for more information see 2.5 Git Basics - Working with Remotes

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%