CITS2200 Data Structures and Algorithms
- 6 points
Availability Location Mode Semester 1 UWA (Perth) Face to face
- Details for undergraduate courses
- Level 2 core unit in the Computer Science major sequence
- Level 2 core unit in the Software Engineering specialisation in the Engineering Science major sequence
- The area of knowledge for this unit is Mathematical and Physical Sciences
- Category B broadening unit for students
- Level 2 elective
- At the core of most computer applications is the storage and retrieval of information. The way that the stored data is structured has a strong impact on what can be retrieved, how quickly it can be retrieved and how much space it occupies. The use of generic structures, or abstract data types (ADTs), to encapsulate the data also facilitates software engineering principles of independent modification, extension and re-use. This unit studies the specification, implementation and time-and-space performance of a range of commonly used ADTs and corresponding algorithms in an object-oriented setting.
- Students are able to (1) undertake problem identification via abstraction; (2) describe common and important data structures and algorithms in the computing discipline; (3) implement a range of data structures and information literacy algorithms in a high-level programming language; (4) apply existing data structures and algorithms from pre-built software libraries; (5) design data structures and algorithms; and (6) critically assess the performance of different data structures and algorithms.
- Indicative assessments in this unit are as follows: (1) mid-semester test; (2) laboratories and project; and (3) final examination. Further information is available in the unit outline.
Supplementary assessment is not available in this unit except in the case of a bachelor's pass degree student who has obtained a mark of 45 to 49 overall and is currently enrolled in this unit, and it is the only remaining unit that the student must pass in order to complete their course.
- Unit Coordinator(s)
- Professor Amitava Datta
- Unit rules
- Contact hours
- 61 (lectures: 26 hours; practical classes: 11 hours; labs: 24 hours)
- Unit Outline
- Semester 1_2019 [SEM-1_2019]
Weiss, M. A. Data Structures and Problem Solving Using Java, 4th edn: Addison-Wesley 2010
Cormen, T. H. et al. Introduction to Algorithms, 3rd edn: MIT Press 2009
- The availability of units in Semester 1, 2, etc. was correct at the time of publication but may be subject to change.
- All students are responsible for identifying when they need assistance to improve their academic learning, research, English language and numeracy skills; seeking out the services and resources available to help them; and applying what they learn. Students are encouraged to register for free online support through GETSmart; to help themselves to the extensive range of resources on UWA's STUDYSmarter website; and to participate in WRITESmart and (ma+hs)Smart drop-ins and workshops.
- Books and other material wherever listed may be subject to change. Book lists relating to 'Preliminary reading', 'Recommended reading' and 'Textbooks' are, in most cases, available at the University Co-operative Bookshop (from early January) and appropriate administrative offices for students to consult. Where texts are listed in the unit description above, an asterisk (*) indicates that the book is available in paperback.