Courses / Module

On successful completion of the module, students should be able to:

• Describe a variety of structures for storing data such as binary search trees, balanced binary trees and hash tables
• Outline a range of algorithms in the areas of data compression, cryptography and graph theory
• Explain various object-oriented programming concepts such as encapsulation, inheritance and polymorphism
• Design, develop, test and debug object-oriented programs in Java
• Apply knowledge of algorithm complexity and data structuring techniques to problem solving

• 24 Lecture hours, 24 Laboratory hours, 6 Tutorial hours and 71 Independent Study hours.

Delivery methods	Hours
Lectures	24
Labs / Practicals	24
Tutorials	6
Planned learning activities	0
Independent student activities	71
Total	125

• Module Graded (numeric value) or Ungraded (Pass/Not Passed): Graded
• Continuous Assessment detail(s): Continuous Assessment up to 50%

Assessment type	Weighting	Duration
Continuous Assessment	50%
University scheduled written examination	50%	120 minutes
Other	0%
Total	100%	120 minutes

• Pass standard: 40%

• Are Supplemental registrations permitted? Yes
• University scheduled written examination (Autumn): 120 minutes
• Is Supplemental Continuous Assessment registration permitted? No
• Is Supplemental Continuous Assessment capped? No

• CS210 or equivalent.

For a full timetable search, go to NUIM Timetable. Venue locations can be found here.

 

 

 

Cached results will be refreshed in 49 minute(s).