Module Details
Module Code: |
PROG C7002 |
Full Title:
|
Data Structures
|
Valid From:: |
Semester 1 - 2009/10 ( September 2009 ) |
Language of Instruction: | |
Module Owner:: |
Caroline Sheedy
|
Module Description: |
Students completing this module will: be able to demonstrate the ability to implement, test and use a variety of basic data structures; be able to demonstrate the ability to select and apply appropriate data structures to the solution of a variety of problems
|
Module Learning Outcome |
On successful completion of this module the learner will be able to: |
# |
Module Learning Outcome Description |
MLO1 |
Demonstrate the ability to implement and test a variety of data structures |
MLO2 |
Demonstrate an understanding of the advantages and disadvantages of a variety of data structures |
MLO3 |
Demonstrate the ability to select and use appropriate data structures for the solution of a variety of problems |
MLO4 |
Demonstrate the ability to test drive solutions to a variety of problems |
Pre-requisite learning |
Module Recommendations
This is prior learning (or a practical skill) that is strongly recommended before enrolment in this module. You may enrol in this module if you have not acquired the recommended learning but you will have considerable difficulty in passing (i.e. achieving the learning outcomes of) the module. While the prior learning is expressed as named DkIT module(s) it also allows for learning (in another module or modules) which is equivalent to the learning specified in the named module(s).
|
No recommendations listed |
Module Indicative Content |
Maps
Implementation using arrays
|
inked lists
Singly-linked, doubly-linked and circular lists
|
Hash Tables
Hash functions, collisions, chaining
|
Stacks and Queues
Implementation using array and linked list
|
Recursion
Recursive and non-recursive solutions
|
Trees
Insertion, deletion, traversal and searching
|
Testing
Test, implement and refactor cycle
|
Module Assessment
|
Assessment Breakdown | % |
Course Work | 50.00% |
Final Examination | 50.00% |
Module Special Regulation |
|
AssessmentsFull-time
Reassessment Requirement |
A repeat examination
Reassessment of this module will consist of a repeat examination. It is possible that there will also be a requirement to be reassessed in a coursework element.
|
DKIT reserves the right to alter the nature and timings of assessment
Module Workload
Workload: Full-time |
Workload Type |
Contact Type |
Workload Description |
Frequency |
Average Weekly Learner Workload |
Hours |
Practical |
Contact |
|
Every Week |
4.00 |
4 |
Directed Reading |
Non Contact |
|
Every Week |
3.00 |
3 |
Independent Study |
Non Contact |
|
Every Week |
2.00 |
2 |
Total Weekly Learner Workload |
9.00 |
Total Weekly Contact Hours |
4.00 |
This module has no Part-time workload. |
Module Resources
|
Recommended Book Resources |
---|
-
Savitch, Walter. (2007), Absolute Java, 3rd. Addison-Wesley, [ISBN: 978-0321505040].
-
Waite, Mitchell & Lafore, Robert. (1998), Data Structures & Algorithms in Java, Waite Group Press, [ISBN: 1-57169-095-6].
-
Dale, Joyce & Weems. (2006), Object-Oriented Data Structures Using Java, Jones & Bartlett, [ISBN: 978-0763737467].
-
Sedgewick, Robert. (2004), Algorithms in Java., Addison Wesley, [ISBN: 978-0-201-36120-9].
-
Hubbard, John R. (2004), Schaum's Outline of Data Structures with Java, McGraw-Hill, [ISBN: 9780071476980].
-
Allen Weiss, Mark. (2006), Data Structures and Algorithm Analysis in Java, 3rd. Addison Wesley, [ISBN: 0-321-32213-4].
-
Collins, William. (2004), Data Structures and the Java Collections Framework, 2nd. McGraw-Hill, [ISBN: 978-0073022659].
| This module does not have any article/paper resources |
---|
Other Resources |
---|
-
website,
-
website,
-
website,
| |