Faculty of Health, Engineering and Science
School: Computer and Security 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
2015
Enrolment Period
1
Version
1
Credit Points
15
Full Year Unit
N
Mode of Delivery
On Campus
Online
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:
- Apply complexity theory to algorithms.
- Define and employ multi-dimensional graphics/robotics methods.
- Define and utilise computational graph structures for appropriate problems.
- Discuss the relative merits of search techniques using various abstract data types.
- Discuss the relative merits of sort techniques using various abstract data types.
Unit Content
- Computability and difficult problems.
- Computational graphs: characteristics and abstract data types for applications.
- Multi-dimensional graphics/robotics mappings.
- Search techniques: binary array search, binary tree search, multi-way tree search, linear linked list search and sequential array search.
- 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 CAMPUSType | Description | Value |
---|
Assignment | Data Structures and Programming | 20% |
Assignment | Algorithms and Programming | 20% |
Examination | End of Semester Examination | 60% |
ONLINEType | Description | Value |
---|
Assignment | Data Structures and Programming | 20% |
Assignment | Algorithms and Programming | 20% |
Examination | End of Semester Examination | 60% |
Text References
- ^ Drozdek, A. (2008). Data Structures and Algorithms in Java (3rd ed.). Duquesne University: Cengage Learning Asia.
- Cormen, T.H., Leiserson, C.E., & Rivest, R.L. (1990). Introduction to Algorithms. New York: McGraw-Hill.
- Goodrich, M.T., & Tamassia, R. (2002). Algorithm Design: Foundations, Analysis, and Internet Examples. New York: John Wiley and Sons.
- Watt, D.A., & Brown, D.F. (2001). Java Collections: An Introduction to Abstract Data Types, Data Structures and Algorithms. New York: John Wiley and Sons.
- Hubbard, J.R. (2001). Schaum's Outline Series: Data Structures with Java. New York: McGraw-Hill.
- Sahni, S. (2000). Data Structures, Algorithms, and Applications in Java. New York: McGraw-Hill.
- Tenenbaum, A.M., & Augenstein, M.J. (1986). Data structures using Pascal (2nd ed.). Englewood Cliffs, New Jersey: Prentice-Hall.
- Aho, A.V., &Ullman, J.D. (1992). Foundations of computer science. Principles of computer science series. New York: Computer Science Press.
- Graham, R.L., D.E. Knuth, & O. Patashnik. (1994). Concrete mathematics: A foundation for computer science (2nd ed.). Reading, Massachusetts: Addison Welsey.
^ Mandatory reference
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
Faculty of Health, Engineering and Science
School: Computer and Security 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
2015
Enrolment Period
2
Version
1
Credit Points
15
Full Year Unit
N
Mode of Delivery
On Campus
Online
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:
- Apply complexity theory to algorithms.
- Define and employ multi-dimensional graphics/robotics methods.
- Define and utilise computational graph structures for appropriate problems.
- Discuss the relative merits of search techniques using various abstract data types.
- Discuss the relative merits of sort techniques using various abstract data types.
Unit Content
- Computability and difficult problems.
- Computational graphs: characteristics and abstract data types for applications.
- Multi-dimensional graphics/robotics mappings.
- Search techniques: binary array search, binary tree search, multi-way tree search, linear linked list search and sequential array search.
- 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 CAMPUSType | Description | Value |
---|
Assignment | Data Structures and Programming | 20% |
Assignment | Algorithms and Programming | 20% |
Examination | End of Semester Examination | 60% |
ONLINEType | Description | Value |
---|
Assignment | Data Structures and Programming | 20% |
Assignment | Algorithms and Programming | 20% |
Examination | End of Semester Examination | 60% |
Text References
- ^ Drozdek, A. (2008). Data Structures and Algorithms in Java (3rd ed.). Duquesne University: Cengage Learning Asia.
- Cormen, T.H., Leiserson, C.E., & Rivest, R.L. (1990). Introduction to Algorithms. New York: McGraw-Hill.
- Goodrich, M.T., & Tamassia, R. (2002). Algorithm Design: Foundations, Analysis, and Internet Examples. New York: John Wiley and Sons.
- Watt, D.A., & Brown, D.F. (2001). Java Collections: An Introduction to Abstract Data Types, Data Structures and Algorithms. New York: John Wiley and Sons.
- Hubbard, J.R. (2001). Schaum's Outline Series: Data Structures with Java. New York: McGraw-Hill.
- Sahni, S. (2000). Data Structures, Algorithms, and Applications in Java. New York: McGraw-Hill.
- Tenenbaum, A.M., & Augenstein, M.J. (1986). Data structures using Pascal (2nd ed.). Englewood Cliffs, New Jersey: Prentice-Hall.
- Aho, A.V., &Ullman, J.D. (1992). Foundations of computer science. Principles of computer science series. New York: Computer Science Press.
- Graham, R.L., D.E. Knuth, & O. Patashnik. (1994). Concrete mathematics: A foundation for computer science (2nd ed.). Reading, Massachusetts: Addison Welsey.
^ Mandatory reference
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