Search Course Outline

Showing 25 course outlines from 4473 matches

801

COMPSCI 313

: Computer Architecture
2024 Semester Two (1245)
Modern processor architectures. Principles of modern processor design; pipelining; memory hierarchies; I/O and network interfacing; compiler and OS support; embedded processors; performance; multiprocessing.
Subject: Computer Science
Prerequisite: COMPSCI 210, PHYSICS 140
Restriction: SOFTENG 363, COMPSYS 304
802

COMPSCI 313

: Computer Architecture
2023 Semester Two (1235)
Modern processor architectures. Principles of modern processor design; pipelining; memory hierarchies; I/O and network interfacing; compiler and OS support; embedded processors; performance; multiprocessing.
Subject: Computer Science
Prerequisite: COMPSCI 210, PHYSICS 140
Restriction: SOFTENG 363, COMPSYS 304
803

COMPSCI 313

: Computer Architecture
2022 Semester Two (1225)
Modern processor architectures. Principles of modern processor design; pipelining; memory hierarchies; I/O and network interfacing; compiler and OS support; embedded processors; performance; multiprocessing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215, PHYSICS 140
Restriction: SOFTENG 363, COMPSYS 304
804

COMPSCI 313

: Computer Architecture
2021 Semester Two (1215)
Modern processor architectures. Principles of modern processor design; pipelining; memory hierarchies; I/O and network interfacing; compiler and OS support; embedded processors; performance; multiprocessing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215, PHYSICS 140
Restriction: SOFTENG 363, COMPSYS 304
805

COMPSCI 313

: Computer Architecture
2020 Semester Two (1205)
Modern processor architectures. Principles of modern processor design; pipelining; memory hierarchies; I/O and network interfacing; compiler and OS support; embedded processors; performance; multiprocessing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215, PHYSICS 140
Restriction: SOFTENG 363, COMPSYS 304
806

COMPSCI 315

: Data Communications Technologies
2025 Semester Two (1255)
The structure of data communications and networks, including the internet, covering all levels of the communications architecture. The layered protocol model, data transmission and coding, link-level and local area network protocols, wide-area internet working, routing, transport and security protocols. Basic application protocols as the foundation for distributed computing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
Restriction: COMPSCI 314
807

COMPSCI 315

: Data Communications Technologies
2024 Semester Two (1245)
The structure of data communications and networks, including the internet, covering all levels of the communications architecture. The layered protocol model, data transmission and coding, link-level and local area network protocols, wide-area internet working, routing, transport and security protocols. Basic application protocols as the foundation for distributed computing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
Restriction: COMPSCI 314
808

COMPSCI 315

: Data Communications Technologies
2023 Semester Two (1235)
The structure of data communications and networks, including the internet, covering all levels of the communications architecture. The layered protocol model, data transmission and coding, link-level and local area network protocols, wide-area internet working, routing, transport and security protocols. Basic application protocols as the foundation for distributed computing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
Restriction: COMPSCI 314
809

COMPSCI 315

: Data Communications Technologies
2022 Semester Two (1225)
The structure of data communications and networks, including the internet, covering all levels of the communications architecture. The layered protocol model, data transmission and coding, link-level and local area network protocols, wide-area internet working, routing, transport and security protocols. Basic application protocols as the foundation for distributed computing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
Restriction: COMPSCI 314
810

COMPSCI 315

: Data Communications Technologies
2021 Semester Two (1215)
The structure of data communications and networks, including the internet, covering all levels of the communications architecture. The layered protocol model, data transmission and coding, link-level and local area network protocols, wide-area internet working, routing, transport and security protocols. Basic application protocols as the foundation for distributed computing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
Restriction: COMPSCI 314
811

COMPSCI 315

: Data Communications Technologies
2020 Semester Two (1205)
The structure of data communications and networks, including the internet, covering all levels of the communications architecture. The layered protocol model, data transmission and coding, link-level and local area network protocols, wide-area internet working, routing, transport and security protocols. Basic application protocols as the foundation for distributed computing.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
Restriction: COMPSCI 314
812

COMPSCI 316

: Cyber Security
2025 Semester Two (1255)
Introduces various concepts related to software, system and network security. Covers a range of topics including attacks on privacy and attack surface, static and dynamic analysis of malware, hardware security (trusted computing base, secure boot, and attestation), network security and some hot topics in cryptography including elliptic curve, blockchain and bitcoin.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215 or COMPSYS 201
813

COMPSCI 316

: Cyber Security
2024 Semester Two (1245)
Introduces various concepts related to software, system and network security. Covers a range of topics including attacks on privacy and attack surface, static and dynamic analysis of malware, hardware security (trusted computing base, secure boot, and attestation), network security and some hot topics in cryptography including elliptic curve, blockchain and bitcoin.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215 or COMPSYS 201
814

COMPSCI 316

: Cyber Security
2023 Semester Two (1235)
Introduces various concepts related to software, system and network security. Covers a range of topics including attacks on privacy and attack surface, static and dynamic analysis of malware, hardware security (trusted computing base, secure boot, and attestation), network security and some hot topics in cryptography including elliptic curve, blockchain and bitcoin.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
815

COMPSCI 316

: Cyber Security
2022 Semester Two (1225)
Introduces various concepts related to software, system and network security. Covers a range of topics including attacks on privacy and attack surface, static and dynamic analysis of malware, hardware security (trusted computing base, secure boot, and attestation), network security and some hot topics in cryptography including elliptic curve, blockchain and bitcoin.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
816

COMPSCI 316

: Cyber Security
2021 Semester Two (1215)
Introduces various concepts related to software, system and network security. Covers a range of topics including attacks on privacy and attack surface, static and dynamic analysis of malware, hardware security (trusted computing base, secure boot, and attestation), network security and some hot topics in cryptography including elliptic curve, blockchain and bitcoin.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
817

COMPSCI 316

: Cyber Security
2020 Semester Two (1205)
Introduces various concepts related to software, system and network security. Covers a range of topics including attacks on privacy and attack surface, static and dynamic analysis of malware, hardware security (trusted computing base, secure boot, and attestation), network security and some hot topics in cryptography including elliptic curve, blockchain and bitcoin.
Subject: Computer Science
Prerequisite: COMPSCI 210, 215
818

COMPSCI 320

: Applied Algorithmics
2025 Semester Two (1255)
Fundamental design techniques used for efficient algorithmic problem-solving and software development. Methods that yield algorithms that are both provably correct and efficient. Efficiency of algorithms to provide a basis for deciding which algorithm is best for the job. Limits on the power of computers and the theory of NP-completeness. An introduction to methods whose correctness or performance is not guaranteed.
Subject: Computer Science
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
819

COMPSCI 320

: Applied Algorithmics
2024 Semester Two (1245)
Fundamental design techniques used for efficient algorithmic problem-solving and software development. Methods that yield algorithms that are both provably correct and efficient. Efficiency of algorithms to provide a basis for deciding which algorithm is best for the job. Limits on the power of computers and the theory of NP-completeness. An introduction to methods whose correctness or performance is not guaranteed.
Subject: Computer Science
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
820

COMPSCI 320

: Applied Algorithmics
2023 Semester Two (1235)
Fundamental design techniques used for efficient algorithmic problem-solving and software development. Methods that yield algorithms that are both provably correct and efficient. Efficiency of algorithms to provide a basis for deciding which algorithm is best for the job. Limits on the power of computers and the theory of NP-completeness. An introduction to methods whose correctness or performance is not guaranteed.
Subject: Computer Science
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
821

COMPSCI 320

: Applied Algorithmics
2022 Semester Two (1225)
Fundamental design techniques used for efficient algorithmic problem-solving and software development. Methods that yield algorithms that are both provably correct and efficient. Efficiency of algorithms to provide a basis for deciding which algorithm is best for the job. Limits on the power of computers and the theory of NP-completeness. An introduction to methods whose correctness or performance is not guaranteed.
Subject: Computer Science
Prerequisite: COMPSCI 220 and 15 points from COMPSCI 225, MATHS 254, 255
822

COMPSCI 320

: Applied Algorithmics
2021 Semester Two (1215)
Fundamental design techniques used for efficient algorithmic problem-solving and software development. Methods that yield algorithms that are both provably correct and efficient. Efficiency of algorithms to provide a basis for deciding which algorithm is best for the job. Limits on the power of computers and the theory of NP-completeness. An introduction to methods whose correctness or performance is not guaranteed.
Subject: Computer Science
Prerequisite: COMPSCI 220 and 15 points from COMPSCI 225, MATHS 254, 255
823

COMPSCI 320

: Applied Algorithmics
2020 Semester Two (1205)
Fundamental design techniques used for efficient algorithmic problem-solving and software development. Methods that yield algorithms that are both provably correct and efficient. Efficiency of algorithms to provide a basis for deciding which algorithm is best for the job. Limits on the power of computers and the theory of NP-completeness. An introduction to methods whose correctness or performance is not guaranteed.
Subject: Computer Science
Prerequisite: COMPSCI 220 and 15 points from COMPSCI 225, MATHS 254, 255
824

COMPSCI 331

: Large-Scale Software Development
2024 Semester One (1243)
Students will understand how to develop large-scale software systems, and learn about the issues associated with large-scale software systems and techniques for addressing them.
Subject: Computer Science
Prerequisite: COMPSCI 230, 235
Restriction: SOFTENG 325
825

COMPSCI 331

: Large-Scale Software Development
2023 Semester One (1233)
Students will understand how to develop large-scale software systems, and learn about the issues associated with large-scale software systems and techniques for addressing them.
Subject: Computer Science
Prerequisite: COMPSCI 230, 235