Information on this page, including unit offerings, is from the 2019 academic year.
Principles of Computer Science (ICT104)
|Organisational Unit||Information Technology, Mathematics and Statistics|
|Description||This unit is designed to develop the skills of problem solving and program design using the Java programming language. Major topics: algorithm design; procedural abstractions; the use of libraries as collection of black-box code modules; the concepts of pre- and post-conditions; strings, arrays, introduction to object-oriented concepts including data abstraction, encapsulation, classes and object references, inheritance; introduction to recursion; streams and file input and output; the definition and use of common classes -- lists, stacks and queues.|
|Unit Learning Outcomes||On successful completion of the unit you should be able to:
* Design, implement, test and document solutions to problems using the sequence, selection and iteration constructs of structured programming.
* Explain the object-oriented programming paradigm.
* Use the object-oriented programming approach to design, implement, test and document solutions to problems.
* Demonstrate understanding of the mechanics of parameter passing in the context of object-oriented programming.
* Explain how class mechanism supports encapsulation and information hiding.
* Design and implement appropriate classes for modelling a given problem.
* Explain the need for range checking and error handling and be able to write robust programs that implement these features.
* Design, implement and test the implementation of hierarchical relationship among objects using a simple class hierarchy and inheritance.
* Explain event-driven programming and be able to describe the behaviour of simple GUI programs.
* Write object-oriented programs that use each of the following: arrays, strings, files, lists, stacks and queues.
* Explain algorithm complexity and the need for selecting appropriate algorithms and structures for a given problem.
* Implement searching and sorting algorithms in a programming language.
* Explain the concept of recursion and be able to write recursive solutions for simple to intermediate problems.
|Timetabled Learning Activities||Lectures: 2 hours per week; computer laboratories: 2 hours per week.|
|Unit Learning Experiences||Students learn through lectures, laboratory work, assignment work and self-study. In each of the 12 teaching weeks, there is one 2-hour lecture and one 2-hour laboratory session. Each lecture usually covers one topic. The companion tutorial/lab session will consist of small programming exercises and/or other tasks that the students need to complete to enforce their understanding of the concepts covered in the topic and to master the relevant design and programming techniques. These small exercises are also designed to provide incremental help for the two assignments. In order to assess a small subset of the learning outcomes, each laboratory exercise will require the development of a solution for a small problem. There are also two assignments that the students need to complete over the period of the semester. The purpose of the assignments is to demonstrate a larger subset of the learning outcomes and to ensure that students can integrate the knowledge that they have acquired. Most of the materials and resources for students to complete the practical exercises and the two assignments will be available through LMS. Students are expected to spend approximately 10 hours per week (approximately 150 hours for the semester) on studying this unit.|
|Other Learning Experiences||Each student is expected to spend on average three hours per teaching week reading the lecture notes, books chapters and other recommended materials relevant to the topic covered in that week and spend a similar amount of time working on the lab exercises for that week. In addition, each student is required to complete two assignments and sit the final examination.|
|Assessment||Students demonstrate their learning through lab work, problem-based assignments (involving solution design, implementation, testing and documentation) and final examination.
Students are assessed on the basis of weekly lab work (10%), two assignments (20% each) and a final examination (50%).
The final grade for the unit will be reported as a letter grade and a mark. In order to pass the unit student must:
1) have an aggregate score for the combined assessment of 50% or better, and
2) achieve a satisfactory performance in the supervised component, which is the final examination. A satisfactory performance is normally considered to be 50% or higher.
|Prerequisites||ICT102 Introduction to Computer Science or ICT159 Foundations of Programming. External enrolment is restricted to students with independent access to adequate computing facilities and software or to students with access to the campus computers by attendance.|
|Appears in these Courses/Majors:
see individual structures for context
|Internet Access Requirements||Murdoch units normally include an online component comprising materials, discussions, lecture recordings and assessment activities. All students, regardless of their location or mode of study, need to have access to and be able to use computing devices with browsing capability and a connection to the Internet via Broadband (Cable, ADSL or Mobile) or Wireless. The Internet connection should be readily available and allow large amounts of data to be streamed or downloaded (approximately 100MB per lecture recording). Students also need to be able to enter into online discussions and submit assignments online.|
|No co-ordinators found for this unit.||Unit Contacts|
|No contacts found for this unit.|