cse5alg algorithms and data structures (pg)
ALGORITHMS AND DATA STRUCTURES (PG)
CSE5ALG
2020
Credit points: 15
Subject outline
This subject covers a range of important algorithms and data structures. Data structures for implementing containers are covered and include linear structures, tree structures and hash tables. Algorithms for insertion and deletion of elements, and algorithms for searching and sorting on these structures are covered where appropriate. Graphs and graph algorithms are also covered. You will learn the construction and workings of the data structures and algorithms covered. They will learn to analyse the effectiveness of each data structure and algorithm for specific problems and categories of problems. You will also implement in programs a wide range of the structures and algorithms covered.
SchoolEngineering and Mathematical Sciences
Credit points15
Subject Co-ordinatorTian Feng
Available to Study Abroad/Exchange StudentsYes
Subject year levelYear Level 5 - Masters
Available as ElectiveNo
Learning ActivitiesN/A
Capstone subjectNo
Subject particulars
Subject rules
Prerequisites CSE1IOO or CSE4IOO AND Enrolment in one of the following courses: SMIT or SMITCN or SMICT or SMCSC or SMBBS or SGBBS or SGIT or SGCS or SMITB
Co-requisitesN/A
Incompatible subjects CSE2ALG AND Students in the following courses are not permitted to enrol: SBCS, SBIT, SBCSGT, SVCSE, SZCSC, SBITP and SBBIY
Equivalent subjectsN/A
Quota Management StrategyN/A
Quota-conditions or rulesN/A
Special conditionsN/A
Minimum credit point requirementN/A
Assumed knowledgeN/A
Career Ready
Career-focusedNo
Work-based learningNo
Self sourced or Uni sourcedN/A
Entire subject or partial subjectN/A
Total hours/days requiredN/A
Location of WBL activity (region)N/A
WBL addtional requirementsN/A
Graduate capabilities & intended learning outcomes
Graduate Capabilities
Intended Learning Outcomes
Subject options
Select to view your study options…
Melbourne (Bundoora), 2020, Semester 1, Day
Overview
Online enrolmentYes
Maximum enrolment sizeN/A
Subject Instance Co-ordinatorTian Feng
Class requirements
Laboratory ClassWeek: 11 - 22
One 2.00 hours laboratory class per week on weekdays during the day from week 11 to week 22 and delivered via face-to-face.
LectureWeek: 10 - 22
One 2.00 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Assessments
Assessment element | Category | Contribution | Hurdle | % | ILO* |
---|---|---|---|---|---|
Assignment (1750 words equivalent) Assignment will focus on data structures and algorithms - design, implement and evaluate a solution | N/A | N/A | No | 30 | SILO2, SILO3, SILO4, SILO5 |
3 hour written examination (3000 words equivalent) To pass the subject, students also need to satisfy the hurdle requirement for the final examination, i.e. achieve at least 90 marks out of the total 180 marks to pass the examination. The final examination consists of fill-in-blank questions (about complexity analysis, 40 marks), tracing questions (about sorting algorithms, 40 marks) and drawing and analysis questions (about data structures, 100 marks). | N/A | N/A | Yes | 70 | SILO1, SILO2, SILO3, SILO5 |