1. Home
  2. Computer Science Methods [CSG2245]

School: Science

This unit information may be updated and amended immediately prior to semester. To ensure you have the correct outline, please check it again at the beginning of semester.

  • Unit Title

    Computer Science Methods

  • Unit Code

    CSG2245

  • Year

    2017

  • Enrolment Period

    1

  • Version

    1

  • Credit Points

    15

  • Full Year Unit

     N

  • Mode of Delivery

    On Campus
    Online

  • Unit Coordinator

    Dr Jitian XIAO

Description

This unit introduces fundamental computer science methods that enable the student to become conversant with, and to apply, algorithmic techniques to a range of computer science tasks.

Prerequisite Rule

Students must pass 2 units from CSP2348, ENS1161

Learning Outcomes

On completion of this unit students should be able to:

  1. Apply complexity theory to algorithms.
  2. Define and employ multi-dimensional graphics/robotics methods.
  3. Define and utilise computational graph structures for appropriate problems.
  4. Discuss the relative merits of search techniques using various abstract data types.
  5. Discuss the relative merits of sort techniques using various abstract data types.

Unit Content

  1. Computability and difficult problems.
  2. Computational graphs: characteristics and abstract data types for applications.
  3. Multi-dimensional graphics/robotics mappings.
  4. Search techniques: binary array search, binary tree search, multi-way tree search, linear linked list search and sequential array search.
  5. Sort techniques: AVL-tree sort, B-tree sort, binary tree sort, exchange sort, multi-way tree sort, heap sort, insertion sort, merge sort, quick sort, selection sort and shell sort.

Additional Learning Experience Information

Two hours of lectures per week, supplemented by one hour of other activities. These activities will include, workshop sessions and consultation.

Assessment

GS1 GRADING SCHEMA 1 Used for standard coursework units

Students please note: The marks and grades received by students on assessments may be subject to further moderation. All marks and grades are to be considered provisional until endorsed by the relevant Board of Examiners.

ON CAMPUS
TypeDescriptionValue
AssignmentData Structures and Programming 20%
AssignmentAlgorithms and Programming 20%
ExaminationEnd of Semester Examination60%
ONLINE
TypeDescriptionValue
AssignmentData Structures and Programming 20%
AssignmentAlgorithms and Programming 20%
ExaminationEnd of Semester Examination60%

Disability Standards for Education (Commonwealth 2005)

For the purposes of considering a request for Reasonable Adjustments under the Disability Standards for Education (Commonwealth 2005), inherent requirements for this subject are articulated in the Unit Description, Learning Outcomes and Assessment Requirements of this entry. The University is dedicated to provide support to those with special requirements. Further details on the support for students with disabilities or medical conditions can be found at the Access and Inclusion website.

Academic Misconduct

Edith Cowan University has firm rules governing academic misconduct and there are substantial penalties that can be applied to students who are found in breach of these rules. Academic misconduct includes, but is not limited to:

  • plagiarism;
  • unauthorised collaboration;
  • cheating in examinations;
  • theft of other students' work;

Additionally, any material submitted for assessment purposes must be work that has not been submitted previously, by any person, for any other unit at ECU or elsewhere.

The ECU rules and policies governing all academic activities, including misconduct, can be accessed through the ECU website.

CSG2245|1|1

School: Science

This unit information may be updated and amended immediately prior to semester. To ensure you have the correct outline, please check it again at the beginning of semester.

  • Unit Title

    Computer Science Methods

  • Unit Code

    CSG2245

  • Year

    2017

  • Enrolment Period

    2

  • Version

    1

  • Credit Points

    15

  • Full Year Unit

     N

  • Mode of Delivery

    On Campus
    Online

  • Unit Coordinator

    Dr Jitian XIAO

Description

This unit introduces fundamental computer science methods that enable the student to become conversant with, and to apply, algorithmic techniques to a range of computer science tasks.

Prerequisite Rule

Students must pass 2 units from CSP2348, ENS1161

Learning Outcomes

On completion of this unit students should be able to:

  1. Apply complexity theory to algorithms.
  2. Define and employ multi-dimensional graphics/robotics methods.
  3. Define and utilise computational graph structures for appropriate problems.
  4. Discuss the relative merits of search techniques using various abstract data types.
  5. Discuss the relative merits of sort techniques using various abstract data types.

Unit Content

  1. Computability and difficult problems.
  2. Computational graphs: characteristics and abstract data types for applications.
  3. Multi-dimensional graphics/robotics mappings.
  4. Search techniques: binary array search, binary tree search, multi-way tree search, linear linked list search and sequential array search.
  5. Sort techniques: AVL-tree sort, B-tree sort, binary tree sort, exchange sort, multi-way tree sort, heap sort, insertion sort, merge sort, quick sort, selection sort and shell sort.

Additional Learning Experience Information

Two hours of lectures per week, supplemented by one hour of other activities. These activities will include, workshop sessions and consultation.

Assessment

GS1 GRADING SCHEMA 1 Used for standard coursework units

Students please note: The marks and grades received by students on assessments may be subject to further moderation. All marks and grades are to be considered provisional until endorsed by the relevant Board of Examiners.

ON CAMPUS
TypeDescriptionValue
AssignmentData Structures and Programming 20%
AssignmentAlgorithms and Programming 20%
ExaminationEnd of Semester Examination60%
ONLINE
TypeDescriptionValue
AssignmentData Structures and Programming 20%
AssignmentAlgorithms and Programming 20%
ExaminationEnd of Semester Examination60%

Core Reading(s)

  • Drozdek, A. (2005). Data Structures and Algorithms in Java. (3rd ed.). Duquesne University: Cengage Learning Asia.

Disability Standards for Education (Commonwealth 2005)

For the purposes of considering a request for Reasonable Adjustments under the Disability Standards for Education (Commonwealth 2005), inherent requirements for this subject are articulated in the Unit Description, Learning Outcomes and Assessment Requirements of this entry. The University is dedicated to provide support to those with special requirements. Further details on the support for students with disabilities or medical conditions can be found at the Access and Inclusion website.

Academic Misconduct

Edith Cowan University has firm rules governing academic misconduct and there are substantial penalties that can be applied to students who are found in breach of these rules. Academic misconduct includes, but is not limited to:

  • plagiarism;
  • unauthorised collaboration;
  • cheating in examinations;
  • theft of other students' work;

Additionally, any material submitted for assessment purposes must be work that has not been submitted previously, by any person, for any other unit at ECU or elsewhere.

The ECU rules and policies governing all academic activities, including misconduct, can be accessed through the ECU website.

CSG2245|1|2