Full Title:Data Structures
Module Code:PROG C7002
 
Credits: 5
Valid From:Semester 1 - 2009/10 ( September 2009 )
Module Delivered in No Programmes
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
Learning Outcomes:
On successful completion of this module the learner should be able to
  1. Demonstrate the ability to implement and test a variety of data structures
  2. Demonstrate an understanding of the advantages and disadvantages of a variety of data structures
  3. Demonstrate the ability to select and use appropriate data structures for the solution of a variety of problems
  4. Demonstrate the ability to test drive solutions to a variety of problems
 

Module Content & Assessment

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
Assessment Breakdown%
Course Work50.00%
End of Module Formal Examination50.00%

Full Time

Course Work
Assessment Type Assessment Description Outcome addressed % of total Marks Out Of Pass Marks Assessment Date Duration
Open-book Examination Practical Test 1,2,3,4 20.00 0 0 n/a 0
Open-book Examination Practical Test 1,2,3,4 30.00 0 0 n/a 0
No Project
No Practical
End of Module Formal Examination
Assessment Type Assessment Description Outcome addressed % of total Marks Out Of Pass Marks Assessment Date Duration
Formal Exam End-of-Semester Final Examination 1,2,3,4 50.00 0 0 End-of-Semester 0
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 & Resources

Workload: Full Time
Workload Type Workload Description Hours Frequency Average Weekly Learner Workload
Practical   4.00 Every Week 4.00
Directed Reading   3.00 Every Week 3.00
Independent Study   2.00 Every Week 2.00
Total Weekly Learner Workload 9.00
Total Weekly Contact Hours 4.00
This course has no Part Time workload.
Resources
Recommended Book Resources
  • Savitch, Walter 2007, Absolute Java, 3rd Ed., 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 Ed., Addison Wesley [ISBN: 0-321-32213-4]
  • Collins, William 2004, Data Structures and the Java Collections Framework, 2nd Ed., McGraw-Hill [ISBN: 978-0073022659]
This module does not have any article/paper resources
Other Resources