home > undergraduate > Computing for Engineers and Scientists 105  > Computing for Engineers and Scientists 105 Homepage

Computing for Engineers and Scientists 105 (600.105) 6 points / Semester 2 Handbook Description This unit introduces students to the process of taking an engineering or scientific problem, identifying its components, and then expressing the solution to these components in computational terms. MATLAB is used as the programming language. In the first part of the course students are taught standard programming constructs, data types, the use of operators, and control flow. The decomposition of programs into functions to aid design, modularity and code reuse is also emphasised. The second half of the course introduces the reading and writing of files, basic data structures, representation of surfaces, data visualisation, floating point arithmetic, numerical differentiation and integration, optimisation, and basic geometric algorithms. Prerequisites: TEE Applicable Mathematics or Calculus Unit Aims Students completing this unit will be able to demonstrate skills in MATLAB programming and will understand general programming constructs found in most procedural languages. They will be able to identify the components of simple problems and express them in computational terms. They will have an understanding of the limits of numerical precision in floating point calculations, and understand the issues involved in using text and binary files to store data. Students will know how to present and visualise simple data sets so that interpretation is facilitated. They will have an appreciation of how graph algorithms, optimisation algorithms, and simple geometric algorithms can be used to solve a wide variety of problems. Teaching Staff Lecturer Eun-Jung Holden Room G.16 Course Web Page http://undergraduate.csse.uwa.edu.au/units/600.105. Help Page www.csse.uwa.edu.au/run/help105 Textbook Stephen J. Chapman, MATLAB Programming for Engineers, Brooks/Cole, 2000. Partial notes will be provided at lectures and on the unit web-site. Note however, that these notes are not a substitute for lecture attendance. Contact Hours There are 5 formal contact hours per week for this course. Each week, students are required to attend two lectures, a one-hour tutorial, and a two-hour laboratory session. Tutorials and labs will commence in Week 2 of semester. Students should visit http://www.csse.uwa.edu.au/run/csbookings to book a tutorial and lab session. Type Time Day Location Lecture 3-4 Tuesday ENCM:ELT2 Lecture 12-1 Thursday ENCM:ELT2 Tutorial 3-4 Thursday CS Room 2.28 Tutorial 4-5 Thursday CS Room 2.28 Tutorial 10-11 Friday CS Room 2.28 Lab 10-12 Monday CS Lab 2.03 Lab 3-5 Monday CS Lab 2.03 Lab 11-1 Friday CS Lab 2.03 Lecture Details The topics that will be covered in each week are listed below. Topic Details 1 Introduction: Why Programming is Hard. 2 Basic Computer Hardware and the Operating System. 3 Operating Systems Continued and an Introduction to Programming Languages. 4 Introduction to Programming in Matlab. 5 Matrices in Matlab. 6 Control Flow, Relational, and Logical Operators. 7 Control Flow Continued. 8 Breaking Programs Down into Small Components: Writing Your Own Functions. 9 Functions Continued and Arguments: Pass by Value Versus Pass by Reference. 10 Namespaces, Constants, and Global Variables. 11 Graphics and Visualisation of Data in Matlab. 12 Representation and Visualisation of Surfaces. 13 Images, Colour Spaces, and Colour Maps. 14 Elementary Data Structures. 15 Elementary Data Structures Continued. 16 Reading and Writing Files. 17 Text Files, Formatted File Input/Output, and Design of Data Files. 18 Text Files Continued and Binary File I/O. 19 Floating Point Arithmetic and Numerical Accuracy. 20 Numerical Differentiation and Integration. 21 Graphs and Problems/Objects that can be Represented by Graphs. 22 Optimisation and Golden Section Search. 23 Optimisation Continued, Multidimensional Optimisation, and Simulated Annealing. 24 Simulated Annealing Continued, Combinatorial Problems, and Genetic Algorithms. 25 Basic Geometric Algorithms. 26 Revision. Assessment The assessment for this unit consists of two programming projects and one examination. Code submitted as part of assignments will be assessed on the basis of its correctness, design and clarity, error trapping, and documentation. All submitted project work will be tested electronically for plagiarism. Students who do not obtain a mark of at least 40% in the examination will be deemed to have failed the unit. You should note that the overall marks for the unit may be scaled in accordance with the Faculty Scaling Policy (see http://www.ecm.uwa.edu.au/for/staff/pol/assess) Assessment % of final mark Assessment Due Dates Project 1 15 week 8 Project 2 15 week 13 Examination 70 November Exam Period Unsatisfactory Progress Any student who does not demonstrate satisfactory progress in this unit, as defined in the FECM Policy on Assessment Practices and Procedures, may be refused admission to the final examinations. The final deadline for notification of unsatisfactory progress is the last day of Week 10. Penalties The School of Computer Science and Software Engineering has adopted a policy on minimum penalties for late items of assessment. This is the default policy of all units unless indicated otherwise, in writing, by the specific unit coordinator. This policy shall apply to all items of continuous assessment, whether submitted either physically or electronically. Immediately after the submission deadline for an item of continuous assessment, a penalty of 20 percent will be applied PER DAY or PART THEREOF. The minimum mark possible for late submission is zero. The percentage is based on the item´s total contribution to the unit´s assessment. For example, a project contributing 40% to the unit´s assessment will incur a penalty of 8 marks for each day late until it is submitted or a mark of zero results. A more detailed description is given in this School´s Policy on Late Submission. The Faculty does have an appeals procedure, the details of which can found at the Policy for Appeals. Plagiarism Plagiarism is broadly defined to be when any portion of the work presented for assessment, can be attributed to another party. The student making the submission should acknowledge what aspects of the presented work is not directly derived by them. For the purposes of plagiarism it is irrelevant that you have been given permission by someone to copy their work and present it as your own. You are directed to the School of Computer Science and Software Engineering Policy on Plagiarism and the Faculty of Engineering,Computing and Mathematics Policy on Plagiarism. Faculty Scaling Final assessment is subject to the Faculty Scaling Policy.     home > undergraduate > Computing for Engineers and Scientists 105  > Computing for Engineers and Scientists 105 Homepage    This information is correct as at 01-Jul-2005, but is subject to change from time to time. In particular, The University reserves the right to change the content and/or method of presentation and/or the method of assessment of any unit of study, to withdraw any unit of study or programme, and/or to vary arrangements for any programme. Copyright© 2005 School of Computer Science, & Software Engineering The University of Western Australia CRICOS Provider Code: 00126G Last updated: 01-Jul-2005