Docstoc

BCS side 1

Document Sample
BCS side 1 Powered By Docstoc
					           The University of Adelaide – Singapore                                                                                             CRICOS Provider Number 00123M




   Computer Science
    BACHELOR OF COMPUTER SCIENCE (FINAL YEAR DEGREE)


Duration: 21 - 48 months                                   CORE COURSES                                             Level 3 Core:
Intake: January, April, July, October                      Computer Science Concepts                                Software Engineering and Project:
                                                                                                                    This course in software engineering provides an
Campus: The University of Adelaide –                       Data Structures & Algorithms*                            introduction to the production of high quality software
Singapore Campus                                                                                                    solutions to large tasks. Among the topics covered in
                                                           CORE COURSES (ADVANCED)
Number of Courses: 9 - 10                                                                                           this course are the following: models of the software
                                                           Computer Systems*                                        life-cycle, requirements analysis and specification,
Application Fee: S$107 (incl 7% GST) upon                                                                           program design techniques and paradigms, software
application submission. The application fee will           Mathematics for Information Technology I*
                                                                                                                    specification techniques, configuration management
be fully refunded if unsuccessful in meeting the           LEVEL 3 CORE                                             and version control, quality assurance, integration and
entry requirements.                                                                                                 testing, project management, risk analysis, case study
                                                           Software Engineering and Project*                        of ethical considerations in Software Engineering.
Fee per Course:
S$1,658.50 for Core (incl 7% GST)                          LEVEL 3 ELECTIVES (Choose 5):                            Level 3 Electives:
S$1,658.50 for Core (Advanced) (incl 7% GST)
                                                           Advanced Programming Paradigms                           Advanced Programming Paradigms: A selection
S$2,140 for Level 3 (incl 7% GST)
                                                                                                                    of topics from the following: Fundamental models
                                                           Computer Architecture                                    of computation, illustrated by the lambda calculus.
Total Tuition Fee: S$17,815.50 - S$19,474 (incl 7% GST)
                                                           Computer Networks and Applications                       Different approaches to programming: functional
Prerequisites/entry criteria: Diploma in IT related
                                                                                                                    and logic paradigms. Fundamental concepts of
disciplines and various engineering fields                 Distributed Systems                                      programming languages, including abstraction,
Faculty: Engineering, Computer and Mathematical Sciences   Event Driven Computing                                   binding, parameter passing, scope, control
                                                                                                                    abstractions. Programming models expressed
School: Computer Science                                   Operating Systems                                        via Scheme: substitution model; map/reduce
Website: www.adelaide.edu.au/sg                            Programming Techniques                                   programming; environment model; object oriented
                                                                                                                    model; a compositional programming model.
Email: registrar@naaec.com.sg                              * Compulsory courses
                                                                                                                    Introduction to parallel computing: data parallelism,
Program Overview: This program consists of a               COURSE DESCRIPTIONS                                      Java threads, and relationship to distributed
foundation of computer science and mathematics,                                                                     computing. Examples in application: map/reduce
with electives from a wide range of disciplines.           Core Courses:                                            programming in Google; flow-oriented programming
Graduates are able to design computer-based                Computer Science Concepts: Programming in                for composition of web-services. Ontologies in
solutions to the problems of information management        Java: variables, control structures, methods, classes,   the semantic web.
and processing in industry, commerce and the public        input/output; object oriented programming,               Computer Architecture: Fundamentals of computer
sector. It is a generalist program with courses that can   interfaces, inheritance. Introductory programming        design; quantifying cost and performance; instruction
be tailored to suit many career options.                   techniques in Java: recursion, finite state machines,    set architecture; program behaviour and measurement
Honours: Students who achieve excellent results in         searching, sorting and generics. Introduction to         of instruction set use; processor datapaths and
the Bachelor of Computer Science may be eligible           computability and computational complexity.              control; pipelining, handling pipeline hazards; memory
to apply for entry into the Honours degree. Honours                                                                 hierarchies and performance; I/O devices, controllers
                                                           Data Structures & Algorithms: Program
usually consists of an extra year of full-time study                                                                and drivers; I/O and system performance.
                                                           development techniques including basic ideas of
including a research component.                                                                                     Computer Networks and Applications: Introduction
                                                           correctness and proof; Recursion. Approaches to
Professional Accreditation: Graduates may apply            Problem Solving. Notion of abstract data type,           to networks and digital communications with a focus
for membership to the Australian Computer                  representation of lists, stacks, queues, sets, trees,    on Internet protocols: Application layer architectures
Society, the Institute of Electrical and Electronic        binary search trees, self-balancing trees, skip lists    (client/server, peer-to-peer) and protocols (HTTP-web,
Engineers and the American-based Association               and hash tables. Notions of complexity and analysis;     SMTP-mail, etc), Transport layer operation: (reliable
for Computing Machinery.                                   Choosing data structures.                                                                             ,
                                                                                                                    transport, congestion and flow control, UDP TCP);
                                                                                                                    Network layer operation - (routing, addressing, IPv4
Assessments: Intensive lectures, project work,             Core Courses (Advanced):                                 and IPv6), Data Link layer operation (error detection/
practical assignments, examinations.                       Computer Systems: Information storage                    correction, access control, Ethernet, 802.11, PPP),
Professional Skills: Software engineering, systems         representation, Memory organisation and hierarchy,       Layer 2/3 protocols (ATM and MPLS); selected current
support, engineering design, network management,           Processor fundamentals, assembler programming,           topics such as: security, multimedia protocols, Quality
games programming, Internet commerce, quality              assembler operation, subroutine calling mechanisms,      of Service, mobility, wireless networking, emerging
improvement, administration, information and               linking/loading, Input-output and device controllers     protocols, network management.
data management.                                           requirements for supporting an operating system
                                                                                                                    Distributed Systems: A selection of topics from the
                                                           and device drivers.
                                                                                                                    following: the challenges faced in constructing client/
Likely Careers: IT and System Analyst, System
                                                           Mathematics for Information Technology I: This           server software: partial system failures, multiple
Engineer, Software Developer and more.
                                                           course provides an introduction to a number of           address spaces, absence of a single clock, latency of
                                                           areas of discrete mathematics with wide applicability.   communication, heterogeneity, absence of a trusted
                                                           Areas of application include: computer logic,            operating system, system management, binding and
                                                           analysis of algorithms, telecommunications,              naming. Techniques for meeting these challenges:
                                                           gambling and public key cryptography. It includes        RPC and middleware, naming and directory services,
                                                           discrete mathematics: sets, relations, logic, graphs,    distributed transaction processing, ‘thin’ clients, data
                                                           mathematical induction and difference equations;         replication, cryptographic security, mobile code.
                                                           probability and permutations and combinations;           Introduction to Java RMI.
                                                           information security and encryption: prime numbers,
                                                           congruences.




Ngee Ann-Adelaide Education Centre, 97 Tank Road, Level 4 Teochew Building, Singapore 238066                                                      Tel : +65 6738 2910
           The University of Adelaide – Singapore                                                                                           CRICOS Provider Number 00123M




Bachelor of Computer Science (Final Year Degree) continued.
Event Driven Computing: Event driven paradigm:          computer interaction issues. Practical projects cover   domains, access lists, capability systems, principle of
Finite State Automata, their behaviour and              the use of FSAs for control logic and GUI design.       minimum privilege.
implementation. Correspondence with regular             Operating Systems: OS purposes: resource                Programming Techniques: Program development:
expressions. Examples of embedded systems.              management and the extended virtual computer;           methods of specification, design, implementations,
Introduction to interconnected state machines, Petri    historical development. Processes: critical sections    testing and debugging, case studies, Graphs:
Nets, and concurrency. Concepts of state-space and      and mutual exclusion, semaphores, monitors,             construction, traversal, topological sorting, applications.
relationship to testing.                                classical problems, deadlock; process scheduling.       Sorting and searching: internal and external
Building Graphical User Interfaces: model view          Input and Output: hardware and software control.        algorithms, correctness and complexity analysis.
controller paradigm. Introduction to design patterns    Memory management: multi-programming; swapping;
for managing complexity in large systems. Building      virtual memory, paging and symbolic segmentation;
GUIs with the Java Swing library. Comparison/contrast   File System: operations, implementation,
with other GUI toolkits. Ease of use and human-         performance. Protection mechanisms: protection




 PREPARATORY COURSE TO BACHELOR OF COMPUTER SCIENCE

Duration: 5 weeks                                       Website: www.adelaide.edu.au/sg                         COURSES
Intake: January, April, July, October                   Email: registrar@naaec.com.sg                           Java Programming 1
Campus: The University of Adelaide –                    Program Overview: This course provides the              Java Programming 2
Singapore Campus                                        required level of understanding and up-to-date
                                                                                                                Introduction to Discrete Mathematics
                                                        knowledge for students to enter the Final Year of
Number of courses: 4
                                                        Bachelor of Computer Science degree program,            Information Encoding
Total Tuition Fee: S$1,284 (incl 7% GST)                upon achieving a satisfactory pass.
Prerequisites/entry criteria: Diploma in IT related     Assessments: One Multiple Choice Questions
disciplines and various engineering fields. Other       (MCQ) test per course, and One Programming Project
diplomas may be considered on a case-by-case basis.




Ngee Ann-Adelaide Education Centre, 97 Tank Road, Level 4 Teochew Building, Singapore 238066                                                    Tel : +65 6738 2910

				
DOCUMENT INFO
Shared By:
Categories:
Tags: side
Stats:
views:22
posted:3/27/2010
language:English
pages:2
Description: BCS side 1