1,234
edits
Changes
no edit summary
You can see the best submissions for this assignment [http://littlesvr.ca/dsa-html5-animations/ HERE]
= Teams =
== BTC640 ==
# Hyungryul (Steven) Chun, Raymond Hung, Jordan Kirkham, Sandra To, Stanley Tsang
# Kiu Kwan Leung, Dixon Lau, Krush Pachani
# Sukhbir Singh Ghotra, Gagandeep Singh Gill, Imtiaz Latif, Cheryl Mascarenhas
# Marius Stratulat, Aayush Dhamala, Amirreza Bijarchi, Nikita Kuznetsov, Carl Desautels
# Dmitry Garanin, Melvin Berena, Jude Fernandez, Calvin Au
# Ali Shoja, Shahan Saeed, Nan Zhou
# Diogo Monteiro
# Adam Joseph Chan, Aakash Dhawan, Edward Ka Kiu Sin
# Jessy Scott Cohoon, Lu Liu
= Overview =
If done properly the animations you create can be used to demonstrate data structures and algorithms in the DSA555/BTP500 courses in the following years.
Your code only needs to work in Firefox. == Plagiarism Rules == You may use any resources, including code from the internet or books. It will not be considered plagiarism as long as you mention where you got which code from. There is no minimum percentage of code in your assignment that you have to write completely by yourself. You may also copy code from other students, but only with their permission, and again you have to mention who you got what code from. If I see that some code has been copied and you haven't listed the source - I will consider it plagiarism, and treat it as explained in the Seneca Academic Policy. == Submission == Submit the following to Moodle: * A zip file with all your work so I can extract it and run it.* The file where you list the sources of your code, including a list of what each team member worked on. The deadline for this assignment is the 30th of march. Late penalty is 10% per day. Even if your assignment is 5 days late or more - you still need to submit a satisfactory assignment to pass the course. This assignment is worth 25% of your final grade. == Data Structures and Algorithms to Choose From == === Stack === Difficulty: 1
Inspiration: http://www.cosc.canterbury.ac.nz/mukundan/dsal/StackAppl.html
* The push/pop operations have to be animated.
=== Queue === Difficulty: 1
Inspiration: http://www.cosc.canterbury.ac.nz/mukundan/dsal/QueueAppl.html
* The enqueue/dequeue operations have to be animated.
=== Cyclic Queue === Difficulty: 1
Inspiration: http://www.cosc.canterbury.ac.nz/mukundan/dsal/CQueueAppl.html
This is the same as the Queue above, except all the space is preallocated, just not beeing used. Also both the front and rear of the queue may move upon enqueue/dequeue.
=== Singly Linked List === Difficulty: 1
Inspiration: http://www.cosc.canterbury.ac.nz/mukundan/dsal/LinkListAppl.html
* The prepend/remove/search operations have to be animated.
=== Bubble Sort === Difficulty: 3
Inspiration: http://math.hws.edu/TMCM/java/xSortLab/
* Show the known biggest elements in the array.
In the page beside the canvas there will be buttons : * Buttons for step, stop/go, and restart with random elements.* Fields for (optionally) manually populating the array with values. === Selection Sort ===
Same as the above, but a different algorithm.
=== Insertion Sort === Difficulty: 3
Same as the above, but a different algorithm.
=== MinHeap === Difficulty: 3
Inspiration: http://www.cosc.canterbury.ac.nz/mukundan/dsal/MinHeapAppl.html