Java程序辅导

01. Explain (i) the overall objectives of the field of Algorithms and Data Structures, and (ii) the theoretical and experimental techniques for evaluating algorithms and data structures.

Activities:

Students attend lectures and labs. Each lab is generally devoted to one major algorithm or data structure, and consists of a number of short questions, and a progamming question where the algorithm and data structure is aplied to solved a practical problem.

02. Thoroughly understand a range of data structures, and searching and sorting algorithms: how they work, their strengths and weaknessess, and conditions appropriate for their applications.

Activities:

Students attend lectures and labs. Each lab is generally devoted to one major algorithm or data structure, and consists of a number of short questions, and a progamming question where the algorithm and data structure is aplied to solved a practical problem.

03. Explain each algorithm or data structure, implement them in Java, and determine, both theoretically and experimentally, their efficiency in relation to real-world problems.

Activities:

Students attend lectures and labs. Each lab is generally devoted to one major algorithm or data structure, and consists of a number of short questions, and a progamming question where the algorithm and data structure is aplied to solved a practical problem.

04. Determine, on the basis of a critical analysis, the most suitable technique to use, where there are multiple techniques that could be used.

Activities:

Students attend lectures and labs. Each lab is generally devoted to one major algorithm or data structure, and consists of a number of short questions, and a progamming question where the algorithm and data structure is aplied to solved a practical problem.

05. Analyze a problem, design a suitable solution, implement the solution (in Java) and evaluate its performance using multiple appropriate measures. The problem generally involves application domains that require large amounts of data storage and/or processing.

Activities:

Students attend lectures and labs. Each lab is generally devoted to one major algorithm or data structure, and consists of a number of short questions, and a progamming question where the algorithm and data structure is aplied to solved a practical problem.

Subject options

Select to view your study options…

- CampusMelbourne

- Study modeDay

Start date between: and   

Melbourne, 2015, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Enrolment information

Subject Instance Co-ordinatorKinh Nguyen

Class requirements

Laboratory Class
One 2.0 hours laboratory class per week and delivered via face-to-face.

Lecture
Two 1.0 hours lecture per week and delivered via face-to-face.

Assessments

Assessment element	Comments	%	ILO*
Assignment (data structures and algorithms - design, implement and evaluate a solution)		30	02, 03, 04, 05
Exam (3-hour)	Hurdle requirement: In order to pass the subject, students must obtain an overall pass grade, pass the examination, pass the assignment component, and attend at least 70% of the laboratory classes.	70	01, 02, 03, 05