1 / 17

CSC2001 Data Structures and Algorithms 2012-2013

CSC2001 Data Structures and Algorithms 2012-2013. CSC2001 Data Structures and Algorithms 2012-2013. Lecture 1 Dr Peter Milligan Room 02.015.A Bernard Crossland Building. Course Goals. Learning outcomes :-

sonja
Download Presentation

CSC2001 Data Structures and Algorithms 2012-2013

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSC2001Data Structures and Algorithms2012-2013

  2. CSC2001Data Structures and Algorithms2012-2013 Lecture 1 Dr Peter Milligan Room 02.015.A Bernard Crossland Building

  3. Course Goals Learning outcomes :- • to enable the identification and design of appropriate data abstractions and their related operations, and • to develop efficient implementations of such abstractions and operations in a nominated programming language

  4. Course Goals Skills :- • problem solving • development of abstractions • efficient implementation of algorithms

  5. Data Abstraction How do we study data (and related operations)?

  6. Data Abstraction How do we study data (and related operations)? We introduce the concepts of • abstraction, and • ‘type hierarchy’

  7. The Concept of Type We will look at this, in detail, in chapter two. Basically, we want a generic framework within which we can discuss ‘types’ and any inter-relationships that may exist between ‘types’.

  8. Type Hierarchy To assist us in studying these ‘types’ we will develop a ‘type hierarchy’. This will consist of a series of layers where each layer represents a ‘family’ of ‘types’

  9. Each layer represents one ‘type family’ Member 1 Member 2 Member n

  10. Type Hierarchy As the diagram tries to show • each layer will have one or more family members • for families with several members we will expect commonalitiesbetween the members

  11. Type Hierarchy The commonalities may take the form of • common (or very similar) structure • common (or very similar) operations

  12. Type Hierarchy Commonality of structure will be reflected by the position of the ‘types’ in the hierarchy As we move up the hierarchy we will see increasing complexity in the ‘types’ in each layer

  13. Type Hierarchy Commonality in terms of operations will be considered by examining typical operations for all the types in the hierarchy and trying to split these into two groups

  14. Operations Generic Focussed Common to all Specific to certain types

  15. Type operations Examples of ‘common’ operations • create objects (variables) of the type • assign values to objects (variables) of the type

  16. Module Assessment The module is assessed by • practical assignments (worth20 marks) • a formal three hour examination paper (worth 80 marks)

  17. Module Assessment To pass the module you must Obtain an overall mark of 40% with a minimum of 28 marks obtained from the formal three hour written examination paper

More Related