Changes

Jump to: navigation, search

BTC640/Assignment1-Winter2012

1,473 bytes added, 04:38, 8 March 2012
no edit summary
= Overview =
You Degree students: you will need to work in teams (ideally 3 person teams) and implement a visual representation using Processing.js of one the algorithms listed below. Your team needs to accumulate a total difficulty of 3 - that can be any combination of the algorithms options listed below. Diploma students: you can work in teams in which case you need to accumulate a total difficulty of 2. You may also work on your own, in which case you only need a difficulty of 1. '''Email me as soon as possible with a list of team members, even if you're working on your own.'''
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. == 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/
* Fields for (optionally) manually populating the array with values.
=== Selection Sort === Difficulty: 3
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
Retrieved from "https://wiki.cdot.senecapolytechnic.ca/wiki/Special:MobileDiff/82626"

Navigation menu