Computer Science
The School of Computer Science aims to teach fundamental principles and practical skills in information technology, and to establish the foundations for an entire career. Units of study in the Computer Science major are available at standard and advanced level.
About the major
A major in computer science covers the key concepts of computation. You will learn the principles and techniques needed to solve tasks efficiently with computation, and how to express those solutions in software. You will also discover how computation can be modelled and how to reason about the limits of what computation can achieve.
A major in computer science will provide you with the knowledge and skills needed to innovate in computer science, and create fundamentally new computer science solutions to future challenges.
Requirements for completion
The Computer Science major and minor requirements are listed in the Computer Science unit of study table.
Contact and further information
W https://sydney.edu.au/engineering/about/school-of-computer-science.html
E
Dr Ying Zhou
E
Learning Outcomes
Students who graduate from Computer Science will be able to:
- Develop a broad and coherent body of knowledge in computer science, including algorithms and one other subfield, and apply an integrated understanding of these concepts to solve relevant problems.
- Construct models of a computational process in appropriate formalisms at appropriate levels of abstraction and relate models in different formalisms to one another.
- Design and code programs that can work with the capabilities of the hardware and software stack; understand and explain to others how the underlying infrastructure affects application performance.
- Evaluate the correctness and efficiency of algorithms, both standard and novel, and communicate the evaluation effectively.
- Communicate concepts and findings in computer science through a range of modes for a variety of purposes and audiences, using evidence-based arguments that are robust to critique.
- Apply key ideas from the theory of computation and its limits, recognise tasks where efficient perfect solutions should not be expected and where approximate solutions are appropriate and communicate the implications for users who want to solve such tasks.
- Design, construct, and explain efficient solutions to a wide range of computational tasks, both by applying known data structures and algorithms, including those found in the literature of the field, and by designing new algorithms using a range of algorithm design techniques to produce runnable implementations of these solutions.
- Work effectively with clients to achieve an efficient computational solution to a task, working individually and as part of collaborative teams, with consideration of differences in social and cultural perspectives.