COMP 2017 Programming Techniques (WSTC)
Credit Points 10
Legacy Code 700257
Coordinator Keembiyage De Silva Opens in new window
Description This unit is intended as a second unit of study in programming. It builds on a basic understanding of procedural programming as would be developed in a first unit. This unit continues the development of programming skills and methodologies required for professional programming and for further study in later computing units. Topics covered include multi-dimensional arrays, file I/O, searching and sorting, and an introduction to object-oriented programming involving classes and inheritance
School Computer, Data & Math Sciences
Student Contribution Band HECS Band 2 10cp
Check your HECS Band contribution amount via the Fees page.
Level Undergraduate Level 2 subject
Pre-requisite(s) COMP 1006
Equivalent Subjects COMP 2015 - Programming Techniques LGYA 5800 - Programming Principles 2
Incompatible Subjects COMP 2016 - Programming Techniques (Advanced)
Restrictions Students must be enrolled at Western Sydney University, The College. Students enrolled in the Extended Diploma programs must have passed 40 credit points in order to enrol in this subject. Students enrolled in the combined Diploma/Bachelor programs listed below must pass all College Preparatory subjects listed in the program structure before progressing to the Year 2 subjects.
- With a chosen programming language in mind, analyse a given problem and: (a) Develop an algorithm that applies structured programming techniques such as sequence, selection, iteration and modularisation that solve the given problem; (b) Choose suitable data types to store relevant data for the given problem; (c) Implement the solution algorithm using the chosen programming language, data types and control structures; (d) Test and debug the program code to produce a working computer program.
- Write and implement programs that use data structures such as arrays to solve problems in programming involving multiple data items.
- Demonstrate how different searching and sorting methods operate and be able to implement them in working computer programs.
- Store, retrieve and manipulate data programmatically from secondary storage.
- Use object-oriented methodology to analyse relatively simple problems and develop object-oriented computer program solutions.
(a) Data types
(b) I/O statements
(d) Problem solving techniques
(e) Decision making constructs
(f) Repetition structures
(g) Writing and using functions
(h) One-dimensional arrays
2. Multi-dimensional arrays
3. Character strings and textual data
4. Sorting and searching algorithms: sequential search, binary search, selection sort, bubble sort
5. Object-Oriented Programming including:
(a) Introduction to classes and objects
(b) Class construction
(c) Constructors and destructors
6. Data files
The following table summarises the standard assessment tasks for this subject. Please note this is a guide only. Assessment tasks are regularly updated, where there is a difference your Learning Guide takes precedence.
|Practical Exercises Two practical deliverables – 1 to 5 programming tasks per practical deliverable. Mostly developed in-class over 2 to 4 week period (15% per deliverable)||2 – 4 week duration||30||N||Individual|
|Programming Project One deliverable. Typically the solution files will be approximately 500 to 700 lines of code.||500 – 700 lines of code||40||N||Individual|
|Practical Programming Test (Partial open book)||90 mins||30||Y||Individual|
- Gaddis. T. (2013). Starting out with Java : from control structures through objects (5th Ed.). Boston : Pearson