cse4pf programming fundamentals
PROGRAMMING FUNDAMENTALS
CSE4PF
2018
Credit points: 15
Subject outline
In this subject, students are introduced to the steps involved in designing and creating a software solution to some practical problems. To enable students to design programs, the subject introduces methods to divide problems into smaller parts to enable methodicalanalysis andtheuse of simple techniques such as flow charts and pseudocodes. Various environments, tools and techniques commonly used in software development and two programming languages (JAVA and C) will be introduced in the subject.
SchoolSchool Engineering&Mathematical Sciences
Credit points15
Subject Co-ordinatorRabei Alhadad
Available to Study Abroad StudentsYes
Subject year levelYear Level 4 - UG/Hons/1st Yr PG
Exchange StudentsYes
Subject particulars
Subject rules
Prerequisites Must be admitted into the Postgraduate Enabling Program (PEP)
Co-requisitesN/A
Incompatible subjects CSE1PE
Equivalent subjectsN/A
Special conditions The subject is designed for LTM to be delivered in Master Bridging course only.
Learning resources
Readings
Resource Type | Title | Resource Requirement | Author and Year | Publisher |
---|---|---|---|---|
Readings | Simple Program Design | Recommended | Robertson, L | 5TH ED. THOMAS NELSON AUST. |
Graduate capabilities & intended learning outcomes
01. Critically analyse simple data processing problems to correctly identify the data and high-level processing involved and possible transformations.
- Activities:
- Assignments 1 and 2, Exam question. Analyse a simple data processing problem, design and test a logical solution (pseudocode), convert the solution to a computer program, test and document the program.
02. Apply basic programming constructs of sequence, selection and iteration to develop effective pseudocodes that solve simple data processing problems.
- Activities:
- Assignments 1 and 2, Exam question. Analyse a simple data processing problem, design and test a logical solution (pseudocode), convert the solution to a computer program, test and document the program.
03. Identify and use appropriate programming tools to develop effective computer programs from pseudocodes.
- Activities:
- Assignments 1 and 2 Convert a logical solution to a simple data processing problem into a computer program.
04. Specify and execute test plans for pseudocodes and programming codes.
- Activities:
- Assignments 1 and 2, Exam question. Test pseudocode and programming code to determine efficiency and effectiveness.
05. Develop external documentation for the process of converting simple data processing problems into computer programs.
- Activities:
- Assignments 1 and 2 Develop grammatically correct and correctly-spelt external documentation for the process of producing a product (a computer program) that solves a simple data processing problem.
06. Effectively use standard Unix commands for file management, account management and program compilations.
- Activities:
- Exam question Given an example of a Unix file hierarchy provide the appropriate commands to manage files and directories and compile computer programs.
Subject options
Select to view your study options…
Melbourne, 2018, Semester 1, Day
Overview
Online enrolmentNo
Maximum enrolment sizeN/A
Enrolment information
Subject Instance Co-ordinatorRabei Alhadad
Class requirements
Computer LaboratoryWeek: 10 - 22
One 2.0 hours computer laboratory per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
LectureWeek: 10 - 22
Two 1.0 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.
Assessments
Assessment element | Comments | % | ILO* |
---|---|---|---|
One 2.5-hour examination | Hurdle requirement: To pass the subject, a pass in the examination is mandatory. | 60 | 01, 02, 03, 04, 05, 06 |
One programming assignment (equivalent to 1000 words) | Real-Time programming assessment. | 20 | 01, 02, 03, 04, 05 |
Ten lab work assessment (equivalent to 1000 words in total) | Hand-in work assessment. | 20 | 01, 02, 03, 06 |