Introduction to Software Engineering 2
Expands the problem-solving techniques of SENG6110 to large problems, with an in-depth study of an object-oriented software analysis and design methodology. Software implementation techniques and standards are introduced with the aim of improving programming skills. Students use fundamental algorithmic techniques and structures such as stacks, queues, trees and heaps as tools for problem solving design and implementation.
- Semester 2 - 2015
1. To understand the Object-Oriented notions and how the notions are implemented in object-oriented programming languages.
2. To understand the need for the most appropriate data structure to provide the best solution to a problem
3. To understand and use Linear, Hierarchical and Graph Structures in problem solving and algorithms
4. To understand and use arrays and linked structures in implementing data structures
- Exposure of object-oriented language features such as inheritance, pointers, memory management, program components and constructions, tools eg makefiles; comparison of object-oriented programming language features.
- Stacks, Queues, Linked Lists, Deques, Doubly Linked Lists, Sequences
- Trees, binary search using tree
This course replaces the following course(s): . Students who have successfully completed are not eligible to enrol in SENG6120.
In Term Test: Class Exam
Written Assignment: Assignment 1
Written Assignment: Assignment 2
Written Assignment: Assignment 3
Formal Examination: Formal Examination *
* This assessment has a compulsory requirement.
In order to pass this course, each student must complete ALL of the following compulsory requirements:
Course Assessment Requirements:
- Formal Examination: Minimum Grade / Mark Requirement - Students must obtain a specified minimum grade / mark in this assessment item to pass the course. - Students must score 40% in the final exam to pass the course.
Face to Face On Campus 2 hour(s) per Week for Full Term
Face to Face On Campus 3 hour(s) per Week for Full Term