COMP SCI 1201 - Introduction to Programming for Engineers

North Terrace Campus - Semester 1 - 2014

Introduces the fundamental concepts of procedural programming. Topics include data types, control structures, functions, arrays, files, and the mechanics of running, testing, and debugging. This course covers introductory programming and problem solving in MATLAB and C or Fortran. - Algorithms and problem-solving: Problem-solving strategies; the role of algorithms in the problem-solving process; implementation strategies for algorithms; debugging strategies; the concept and properties of algorithms - Fundamental programming constructs: Syntax and semantics of a higher-level language; variables, types, expressions, and assignment; simple I/O; conditional and iterative control structures; functions and parameter passing; structured decomposition - Fundamental data structures: Primitive types; arrays; records; strings and string processing - Software development methodology: Fundamental design concepts and principles; testing and debugging strategies; test-case design (black box testing and requirements testing); unit testing; programming environments

  • General Course Information
    Course Details
    Course Code COMP SCI 1201
    Course Introduction to Programming for Engineers
    Coordinating Unit Computer Science
    Term Semester 1
    Level Undergraduate
    Location/s North Terrace Campus
    Units 3
    Contact Up to 6 hours per week
    Incompatible APP MATHS 1000, APP MATHS 2005, APP MATHS 2106, CHEM ENG 1002, CHEM ENG 1008, COMP SCI 1012, COMP SCI 1101, ENG 2002, MECH ENG 1100, MECH ENG 1101, MECH ENG 1102, MECH ENG 1103, MECH ENG 1104, MECH ENG 1105
    Restrictions Not suitable for BCompSc, BCompGr or BEng(Software Engineering) students
    Assessment Written exam, assignments
    Course Staff

    Course Coordinator: Dr Cruz Izu

    Course Timetable

    The full timetable of all activities for this course can be accessed from Course Planner.

    You can find a schedule of the topics, and the tutorial and practical exercises on the course website:
    www.cs.adelaide.edu.au/~first/ipe/14s1-ipe-adelaide
  • Learning Outcomes
    Course Learning Outcomes
    At the end of this course, you will be able to:
    1. Develop an algorithm that will solve a given (simple) problem
    2. Explain the operation of the standard algorithm control-constructs
    3. Be able to draw diagrams that explain the operation of an algorithm
    4. Translate an algorithm into MATLAB
    5. Translate an algorithm into C
    6. Run and debug the resulting program
    University Graduate Attributes

    This course will provide students with an opportunity to develop the Graduate Attribute(s) specified below:

    University Graduate Attribute Course Learning Outcome(s)
    Knowledge and understanding of the content and techniques of a chosen discipline at advanced levels that are internationally recognised. 1,2,3,4,5,6
    The ability to locate, analyse, evaluate and synthesise information from a wide variety of sources in a planned and timely manner. 1,6
    An ability to apply effective, creative and innovative solutions, both independently and cooperatively, to current and future problems. 1,6
    A proficiency in the appropriate use of contemporary technologies. 1,2,3,4,5,6
  • Learning Resources
    Required Resources
    There is no required text-book for this course.

    Recommended Resources
    The course requires exercise work involving use of computers.
    All the required software is installed on the computers at the University.
    The prac sessions will introduce you to using the systems.

    If you would like to be able to work at home, you may wish to install suitable software:
    • A student edition of MATLAB is available (just google "MATLAB student"); and
    • The GCC c-compiler is also available (google "CYGWIN").
    The University cannot offer help in installing this software on your system.
    If you are not confident you can do this task correctly, we advise you to use the University computers for the first few weeks.

    Online material about C and Matlab is widely available on the web.
    Like all things on the web some is good, a lot is ordinary, and some is bad... choose carefully!

    Online Learning
    Lectures will be recorded, and can be viewed using many devices.
    Be aware that occasionally the recordings fail --- technical problems with the equipment, or incompetence by the lecturer --- when this happens, there is no way to fix the problem.
    We strongly reccommend that you attend the lecture sessions.

    All example programs demonstrated in lectures will be made available online after the lecture via the course web-page: www.cs.adelaide.edu.au/~first/ipe/14s1-ipe-adelaide

    There is an online forum, where you can post questions you may have about the course, and can see and respond to questions posted by other students.
    You can find it here: http://forums.cs.adelaide.edu.au/course/view.php?name=14s1-ipe

  • Learning & Teaching Activities
    Learning & Teaching Modes
    The course is comprised of three main parts:
    • Formal lectures;
    • Group workshops; and
    • Individual practical exercises
    Each lecture session will contain a mixture of:
    • Explanation, to introduce new concepts;
    • Demonstration, to see the concept in action;
    • Brief exploration, where you can check your understanding; and
    • A short quiz, to formally check your progress.
    The workshop sessions are held in a computer lab in the presence of supervisors, and involve small groups working to solve simple problems.
    You can talk with your fellow group members, and to a lab supervisor to experiment and see ow things work.
    Attendance at sessions is recorded, but not assessed.

    The supervised practical sessions are an opportunity for you to apply the knowledge by yourself, to check that you understand.
    The supervisors can help you when you get "stuck", and will assess your work and assign a mark.


    Workload

    The information below is provided as a guide to assist students in engaging appropriately with the course requirements.

    There are two one-hour lecture sessions each week.

    There is one two-hour workshop each week, starting in week2.

    There is one two-hour supervised practical session each week, but you are encouraged to spend additional time working alone.
    Programming is like any skill --- if you want to get better, you need to practice.

    The above 6 hours constitutes formal "contact time", but we would expect you t spend an additinal 3-4 hours each week making sure you understand the material.

    Long-term data confirms that you cannot learn the material one week before the end of the semester...
    Learning Activities Summary
    A schedule of the topics that will be covered in each lecture, a list of workshop topics, and the practical exercises can all be found on the course website:
    www.cs.adelaid.edu.au/~first/ipe
  • Assessment

    The University's policy on Assessment for Coursework Programs is based on the following four principles:

    1. Assessment must encourage and reinforce learning.
    2. Assessment must enable robust and fair judgements about student performance.
    3. Assessment practices must be fair and equitable to students and give them the opportunity to demonstrate what they have learned.
    4. Assessment must maintain academic standards.

    Assessment Summary
    The course assessment has four components:
    • In-class quizzes (8%)
    • Assigned practical exercises (25%)
    • A final exam (67%)
    Assessment Related Requirements
    To pass the course, you must achieve:
    At least 40% of the available marks for the exam;
    At least 40% of the available marks for the exercises;
    At least 50% overall mark.

    If you do not achieve the minimum 40% level in both parts, your final mark will be capped at 44F (a fail).

    Assessment Detail
    There will be a programming assignment every week, beginning in week 2.
    All exercises are of equal weight, and contribute equally to your final mark.
    You must be present in the lab, and get your work marked by a lab supervisor, each week.

    There will be up to ten periodic quizzes, held during the lecture classes, at random times.
    Each quiz has an equal weighting.
    Your final mark will be based on the best n-2 quiz marks
    For example, if there are 9 quizzes, your mark will be based on your 7 best marks.

    Because the class is very large (about 300), it will not be possible to offer make-up quizzes for any reason.  If you miss a quiz, you will simply score zero --- make sure not to miss too many of them!


    Submission
    Every time you submit some work (either on paper, or electronically via the web), you are implicitly saying to the University "The work I have just submitted was (substantially) done by me".

    The core of this statement is "I didn't copy it" --- neither from another student, nor from any other person, nor from the web.

    In any submission you make, you are automatically permitted to use:
    • Any information given in lectures;
    • Anything shown to you by the workshop or lab supervisors;
    We are quite good at detecting copying, and the penalties are harsh --- see below.

    Course Grading

    Grades for your performance in this course will be awarded in accordance with the following scheme:

    M10 (Coursework Mark Scheme)
    Grade Mark Description
    FNS   Fail No Submission
    F 1-49 Fail
    P 50-64 Pass
    C 65-74 Credit
    D 75-84 Distinction
    HD 85-100 High Distinction
    CN   Continuing
    NFE   No Formal Examination
    RP   Result Pending

    Further details of the grades/results can be obtained from Examinations.

    Grade Descriptors are available which provide a general guide to the standard of work that is expected at each grade level. More information at Assessment for Coursework Programs.

    Final results for this course will be made available through Access Adelaide.

  • Student Feedback

    The University places a high priority on approaches to learning and teaching that enhance the student experience. Feedback is sought from students in a variety of ways including on-going engagement with staff, the use of online discussion boards and the use of Student Experience of Learning and Teaching (SELT) surveys as well as GOS surveys and Program reviews.

    SELTs are an important source of information to inform individual teaching practice, decisions about teaching duties, and course and program curriculum design. They enable the University to assess how effectively its learning environments and teaching practices facilitate student engagement and learning outcomes. Under the current SELT Policy (http://www.adelaide.edu.au/policies/101/) course SELTs are mandated and must be conducted at the conclusion of each term/semester/trimester for every course offering. Feedback on issues raised through course SELT surveys is made available to enrolled students through various resources (e.g. MyUni). In addition aggregated course SELT data is available.

    You can find prior student assessments of this course here:

    www.cs.adelaide.edu.au/~first/ipe

  • Student Support
  • Policies & Guidelines
  • Fraud Awareness

    Students are reminded that in order to maintain the academic integrity of all programs and courses, the university has a zero-tolerance approach to students offering money or significant value goods or services to any staff member who is involved in their teaching or assessment. Students offering lecturers or tutors or professional staff anything more than a small token of appreciation is totally unacceptable, in any circumstances. Staff members are obliged to report all such incidents to their supervisor/manager, who will refer them for action under the university's student’s disciplinary procedures.

The University of Adelaide is committed to regular reviews of the courses and programs it offers to students. The University of Adelaide therefore reserves the right to discontinue or vary programs and courses without notice. Please read the important information contained in the disclaimer.