COMP SCI 1103 - Algorithm Design & Data Structures

North Terrace Campus - Semester 2 - 2017

Builds on the foundation provided by the COMP SCI 1101-1102 sequence to introduce the fundamental concepts of data structures and the algorithms that proceed from them, and aspects of software engineering. Topics include recursion, the underlying philosophy of object-oriented programming, fundamental data structures (including stacks, queues, linked lists, hash tables, and trees), the basics of algorithmic analysis, and an introduction to the principles of language translation. - Review of elementary programming concepts - Fundamental data structures: Stacks; queues; linked lists - Object-oriented programming: Object-oriented design; encapsulation and information hiding; classes; separation of behaviour and implementation; class hierarchies; inheritance; polymorphism - Fundamental computing algorithms: O(N log N) sorting algorithms; - Recursion: The concept of recursion; recursive mathematical functions; simple recursive procedures; divide-and-conquer strategies; recursive backtracking; implementation of recursion - Basic algorithmic analysis: Asymptotic analysis of upper and average complexity bounds; identifying differences among best, average, and worst case behaviours; big "O," little "o," omega, and theta notation; - Algorithmic strategies: Brute-force algorithms; greedy algorithms; divide-and-conquer; backtracking; branch-and-bound; heuristics; pattern matching and string/text algorithms; numerical approximation algorithms - Overview of programming languages: Programming paradigms - Software engineering: Software validation; testing fundamentals, including test plan creation and test case generation; object-oriented testing - Software evolution: Software maintenance; characteristics of maintainable software; reengineering; legacy systems; software reuse

  • General Course Information
    Course Details
    Course Code COMP SCI 1103
    Course Algorithm Design & Data Structures
    Coordinating Unit School of Computer Science
    Term Semester 2
    Level Undergraduate
    Location/s North Terrace Campus
    Units 3
    Contact Up to 6 hours per week
    Available for Study Abroad and Exchange Y
    Prerequisites COMP SCI 1009, COMP SCI 1102 or COMP SCI 1202
    Incompatible COMP SCI 1203, COMP SCI 2103, COMP SCI 2202, COMP SCI 2202B
    Restrictions Available to B Eng (Software Engineering) and other non-Engineering degree students only
    Course Description Builds on the foundation provided by the COMP SCI 1101-1102 sequence to introduce the fundamental concepts of data structures and the algorithms that proceed from them, and aspects of software engineering. Topics include recursion, the underlying philosophy of object-oriented programming, fundamental data structures (including stacks, queues, linked lists, hash tables, and trees), the basics of algorithmic analysis, and an introduction to the principles of language translation. - Review of elementary programming concepts - Fundamental data structures: Stacks; queues; linked lists - Object-oriented programming: Object-oriented design; encapsulation and information hiding; classes; separation of behaviour and implementation; class hierarchies; inheritance; polymorphism - Fundamental computing algorithms: O(N log N) sorting algorithms; - Recursion: The concept of recursion; recursive mathematical functions; simple recursive procedures; divide-and-conquer strategies; recursive backtracking; implementation of recursion - Basic algorithmic analysis: Asymptotic analysis of upper and average complexity bounds; identifying differences among best, average, and worst case behaviours; big "O," little "o," omega, and theta notation; - Algorithmic strategies: Brute-force algorithms; greedy algorithms; divide-and-conquer; backtracking; branch-and-bound; heuristics; pattern matching and string/text algorithms; numerical approximation algorithms - Overview of programming languages: Programming paradigms - Software engineering: Software validation; testing fundamentals, including test plan creation and test case generation; object-oriented testing - Software evolution: Software maintenance; characteristics of maintainable software; reengineering; legacy systems; software reuse
    Course Staff

    Course Coordinator: Dr Wanru Gao

    Course Timetable

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

  • Learning Outcomes
    Course Learning Outcomes
    On successful completion of this course students will be able to:

     
    1 competently program in C/C++ in the OO paradigm,
    2 manage memory usage in C/C++ programs,
    3 explain fundamental computing algorithms,
    4 analyse algorithms and identify key algorithmic strategies,
    5 demonstrate familiarity with fundamental software engineering practices,
    6 demonstrate knowledge of programming language design issues,
    7 demonstrate professional writing skills at an introductory level.
    8 demonstrate knowledge of ethical concepts in the context of software production.
    9 work competently in a group to learn software concepts.
    10 use abstract data types to help solve programming problems

     
    The above course learning outcomes are aligned with the Engineers Australia Stage 1 Competency Standard for the Professional Engineer.
    The course is designed to develop the following Elements of Competency: 1.1   1.2   1.3   1.4   1.5   1.6   2.1   2.2   3.1   3.2   3.6   

    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)
    Deep discipline knowledge
    • informed and infused by cutting edge research, scaffolded throughout their program of studies
    • acquired from personal interaction with research active educators, from year 1
    • accredited or validated against national or international standards (for relevant programs)
    1-6,10
    Critical thinking and problem solving
    • steeped in research methods and rigor
    • based on empirical evidence and the scientific approach to knowledge development
    • demonstrated through appropriate and relevant assessment
    1-2,4,10
    Teamwork and communication skills
    • developed from, with, and via the SGDE
    • honed through assessment and practice throughout the program of studies
    • encouraged and valued in all aspects of learning
    7,9
    Career and leadership readiness
    • technology savvy
    • professional and, where relevant, fully accredited
    • forward thinking and well informed
    • tested and validated by work based experiences
    1,5-6
    Intercultural and ethical competency
    • adept at operating in other cultures
    • comfortable with different nationalities and social contexts
    • Able to determine and contribute to desirable social outcomes
    • demonstrated by study abroad or with an understanding of indigenous knowledges
    8
    Self-awareness and emotional intelligence
    • a capacity for self-reflection and a willingness to engage in self-appraisal
    • open to objective and constructive feedback from supervisors and peers
    • able to negotiate difficult social situations, diffuse conflict and engage positively in purposeful debate
    9
  • Learning Resources
    Required Resources
    The textbook for this course is: "Problem Solving with C++", 9e Global Edition, Walter Savitch, ISBN-13:9781292018249, Addison-Wesley, 2015.
    Recommended Resources
    Students who have Java as a programming language and are entering this course are strongly encouraged to make use of the simple on-line resource that will be made available on the course website, closer to the start of term.
    Online Learning
    In this course, we use the myUni Learning Management System. The link for the course is at https://myuni-canvas.adelaide.edu.au/
  • Learning & Teaching Activities
    Learning & Teaching Modes
    The course has three contact activities: lectures, tutorials and practicals. Each of these activities will provide you with the resources necessary to understand the course material.
    Lectures will present information and provide an opportunity for the introduction and discussion of programming, algorithmic and other material. You should expect to attend all of these and participate in small group work.
    Tutorials will provide a small group discussion forum where you and a tutor will work through a problem set to identify key topics and give you necessary practice in formulating answers to key questions.
    Practicals are an in-lab activity session where you will work on the weekly course assignments in C++, while receiving feedback from practical markers who are stationed around the lab area. You will need to explain your work to the marker to ensure that you have understood everything that we're trying to pass on.
    Workload

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

    You are expected to allocate 3 hours per week for lectures, approximately 4 hours per week for practicals (as a minimum) and 1 hour per week (on average) for tutorials. On average, you should require no more than 10 hours per week for this course.

    Learning Activities Summary
    The weekly pattern is three one-hour lectures and a two-hour practical session, with a tutorial every fortnight. The outline course content is:

    Week 1
    Review of fundamental C/C++ programming techniques, pointer arithmetic and function pointers, memory errors and core dumps

    Week 2
    Abstract data types and class hierarchies

    Week 3
    Inheritance, friends, and overloading

    Week 4
    Using classes, OO Design principles, testing and design

    Week 5
    Principles of software re-use and maintenance, recursion

    Week 6
    Ethics, polymorphism, using ADTs to produce usable structures

    Week 7
    Introduction to complexity analysis, upper and lower complexity bounds, best-case and worst-case, big O, little o, omega and theta

    Week 8
    Complexity analysis, searching and sorting Algorithms

    Week 9
    Recursive complexity, linked lists and stacks

    Week 10
    Queues, other linked list based data structures

    Week 11
    Trees, algorithmic strategies

    Week 12
    Problem solving, programming paradigms, introduction to type systems

    The course is structured to take you from an introductory knowledge of C++ to a higher level, as well as addressing some key areas of computer programming and algorithm design.

    The summary of the areas covered in this course are:

    Review and development of previous knowledge of C++
    Fundamental data structures
    Object-oriented Programming
    Fundamental Computing Algorithms
    Recursion
    Basic Algorithmic Analysis
    Algorithmic Strategies
    Overview of programming languages
    Software Engineering
    Software Evolution
    Professional Skills Development
    Specific Course Requirements
    There are no specific course requirements, although students who have not undertaken COMP SCI 1102, but have instead entered via the Computer Science IB pathway, will be expected to undertake work on their own time to make the transition from Java to C++
    Small Group Discovery Experience
    N/A
  • 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 marks for this course are made up of:

    • Written Examination: 50%
    • Practical Examination: 20%
    • Practical Assignments: 30%
    Assessment Related Requirements
    Tutorials do not attract marks but attendance is recorded and students are expected to attend at least 80% of tutorials. Students must achieve an overall passing mark and least 40% in the prac exam. The components are:

    • Written Examination (Total 50%)
    • Practical Examination (Total 20%)
    • Practical Assignments (Total 30%)
    Assessment Detail
    Each weekly assignment is worth 3% of the final mark, to a total of 30%.

    Below are the CBOK mappings

     Abstraction  Design  Data and Information  Programming  Systems Development
    Prac Assignments  5  5  3  5  3
    Prac Exam  3  3  3
    Main Exam  3  3  3


    CBOK categories are explained in section 4 of the ICT core body of knowlege. Numbers assigned correspond to the Bloom taxonomy (see page 26 of the same document).

    Below are the mappings to learning outcomes and graduate attributes

    Component  Weight  Learning Outcomes  Graduate Attributes
    Prac Assignments  30% 1,2,4,5,6,8,9,11,12  1,2,3,4,5,6,7
    Prac Exam  20% 1,2,4,5,6,8,9,11,12  1,2,3,4,5,6,7
    Main Exam  50% 1,2,3,4,5,6,7,8,9,10,11,12  1,2,3,4,5,6,7,8



    Submission

    All programming submissions will be made through the school's web submission gateway, available on the school web site (http://www.cs.adelaide.edu.au). Other assignments may be submitted through other electronic means that will be clearly identified on the assignment rubric.

    Both electronic systems provide cover sheets for submitted work. No physical submissions of work will be accepted unless specifically requested by the lecturer.

    The School of Computer Science observes a strict lateness policy. Extensions may be requested in advance for medical or compassionate reasons but (1) all requests must be accompanied by documentation, (2) extensions awarded will be in proportion to the time lost that is supported by documentation, (3) extensions are almost never granted on the final day unless the issue is both severe and unforeseen, and (4) extensions are never granted because you have been busy, have managed your time poorly or are overloaded in other courses.

    Programming marks will be returned to you within 10 working days. If your work is considered to not be a sufficient attempt, you may be asked to resubmit the work. If we can identify that you are trending towards overall insufficient progress (and at risk of triggering the minimum performance threshold) then we may contact you to make you explicitly aware of this risk, however, you should be tracking your own progress and making your best attempt at every piece of work, rather than aiming to scrape by.

    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.

  • 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.