cse2alg algorithms and data structures
ALGORITHMS AND DATA STRUCTURES
CSE2ALG
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. Students 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. Students 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 2 - UG
Available as ElectiveNo
Learning ActivitiesN/A
Capstone subjectNo
Subject particulars
Subject rules
PrerequisitesCSE1OOF
Co-requisitesN/A
Incompatible subjectsN/A
Equivalent subjectsN/A
Quota Management StrategyN/A
Quota-conditions or rulesN/A
Special conditionsN/A
Minimum credit point requirementN/A
Assumed knowledgeN/A
Learning resources
Data Structures using Java
Resource TypeBook
Resource RequirementPrescribed
AuthorBENDIGO: Malik, DS
YearN/A
Edition/Volume3RD EDN
PublisherTHOMAS NELSON AUST.
ISBNN/A
Chapter/article titleN/A
Chapter/issueN/A
URLN/A
Other descriptionN/A
Source locationN/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
Computer LaboratoryWeek: 11 - 22
One 2.00 hours computer laboratory 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 (1,500-word 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 final examination (3,000-word equiv)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 |
Chisholm 311 (Chisholm Institute), 2020, Semester 1, Day
Overview
Online enrolmentYes
Maximum enrolment sizeN/A
Subject Instance Co-ordinatorTian Feng
Class requirements
Computer LaboratoryWeek: 11 - 22
One 2.00 hours computer laboratory per week on weekdays during the day from week 11 to week 22 and delivered via face-to-face.
LectureWeek: 10 - 22
Two 1.00 hour 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 (1,500-word 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 final examination (3,000-word equiv)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 |