SENG6120
Introduction to Software Engineering 2
10 Units
Available in 2013
| Callaghan Campus | Semester 2 |
|---|
Previously offered in 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004
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.
| Objectives | * To understand the Object-Oriented notions and how the notions are implemented in object-oriented programming languages. * To understand the need for the most appropriate data structure to provide the best solution to a problem * To understand and use Linear, Hierarchical and Graph Structures in problem solving and algorithms * To understand and use arrays and linked structures in implementing data structures |
||||||
|---|---|---|---|---|---|---|---|
| Content | 1. 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. 2. Stacks, Queues, Linked Lists, Deques, Doubly Linked Lists, Sequences 3. Trees, binary search using tree 4. Hashing |
||||||
| Replacing Course(s) | N/A | ||||||
| Transition | N/A | ||||||
| Industrial Experience | 0 | ||||||
| Assumed Knowledge | SENG6110 | ||||||
| Modes of Delivery | Internal Mode | ||||||
| Teaching Methods | Lecture
Computer Lab |
||||||
| Assessment Items |
|
||||||
| Contact Hours | Lecture: for 3 hour(s) per Week for Full Term Computer Lab: for 2 hour(s) per Week for Full Term |
||||||
| Compulsory Components |
|
||||||
| Timetables | 2013 Course Timetables for SENG6120 |