COMP2521 20T3
Course Outline

## Course Details

Course Code
COMP2521
Course Name
Data Structures and Algorithms
Units of Credit
6
Course Convenor
Course Website
https://webcms3.cse.unsw.edu.au/COMP2521/20T3/
Handbook Entry

## Course Summary

The goal of this course is to deepen your understanding of data structures and algorithms and how these can be employed effectively in the design of software systems. It is an important course in covering a range of core data structures and algorithms that will be used in context in later courses. You explore these ideas in lectures, tutorials, lab classes, quizzes and assignments. Assessment involves labs, quizzes, assignments and a final exam involving both practice and theory. At the end of the course, we want you to be a solid programmer, with knowledge of a range of useful data structures and programming techniques, capable of building significant software systems in a team environment, and ready to continue with further specialised studies in computing.

#### Topics

This course provides an introduction to the structure, analysis and usage of a range of fundamental data types and the core algorithms that operate on them. Key topics are:

• Analysis of algorithms
• Abstract data types
• Binary search trees
• Balanced search trees
• Graphs
• Hashing
• Heaps
• Sorting algorithms
• Text processing algorithms

#### Executive Summary

A summary of the critical things to know about COMP2521:

• attempt all of the quizzes, labs, tutorials, and assignments yourself
• always try to produce a better program than last time
• in lectures, think critically about what's being said/shown
• the textbook is a useful reference source beyond this course
• assessment:
• labs: 11%
• quizzes: 14%
• assignments: 35%
• final exam: 40%
• enjoy the course!

## Course Timetable

The complete course timetable is available at: webcms3:/timetable

## Course Aims

The aim of this course is to get you to think like a computer scientist. This certainly sounds like a noble goal... but what does it really mean? How does a scientist, let alone a computer scientist, actually think?

What many types of scientists try to do is understand natural systems and processes: a geologist, for example, tries to understand the structure of the earth; a biologist tries to understand living organisms; a chemist tries to understand materials and reactions, and so on.

Computer scientists don't, as the name might suggest, simply try to understand the structure and behaviour of computers, but are more concerned with understanding software systems (and the interaction between the software and the hardware on which it runs). Also, unlike other scientists, computer scientists frequently build the objects that they study.

During this course, we'll be looking at ways of creating, analysing and understanding software. Ultimately, you should be able to answer the question, is this piece of software any good? and be able to provide sound reasons to justify your answer.

This course follows on from introductory C programming courses: COMP1511, COMP1917, or COMP1921. We cover additional aspects of the C programming language that were not covered in those courses, and also look at some programming tools which were not covered (in detail) earlier. However, this course is not simply a second C programming course: the focus is on the ideas and abstractions behind the data structures and algorithms that are used.

COMP2521 is a critical course in the study of computing at UNSW, since it deals with many concepts that are central to future studies in the area. Whether you are studying Computer Science, Software Engineering, Bioinformatics, Computer Engineering, or even a discipline outside the realm of computing, understanding a range of algorithms and data structures and how to use them will make you a much more effective computing problem solver in the future.

### Student Learning Outcomes

After completing this course, students will:

• be familiar with fundamental data structures and algorithms
• be able to analyse the performance characteristics of algorithms
• be able to measure the performance behaviour of programs
• be able to choose/develop an appropriate data structure for a given problem
• be able to choose/develop appropriate algorithms to manipulate this data structure
• be able to reason about the effectiveness of data structures and algorithms for solving a given problem
• be able to package a set of data structures and algorithms as an abstract data type
• be able to develop and maintain software systems in C that contain thousands of lines of code

This course contributes to the development of the following graduate capabilities:

scholarship: understanding of their discipline in its interdisciplinary context lectures, assignments
scholarship: capable of independent and collaborative enquiry lab work, assignments
scholarship: rigorous in their analysis, critique, and reflection tutorials
scholarship: able to apply their knowledge and skills to solving problems tutorials, lab work, assignments
scholarship: ethical practitioners all course-work, by doing it yourself
scholarship: capable of effective communication tutorials
scholarship: digitally literate everywhere in CSE
leadership: enterprising, innovative and creative assignments
leadership: collaborative team workers lab work, assignments
professionalism: capable of operating within an agreed Code of Practice all prac work

## Assumed Knowledge

The official pre-requisite for this course is either COMP1511 or COMP1917 or COMP1921.

Whether or not you satisfy the pre-requisite, we assume that:

• you can program in the C programming language, and are familiar with arrays, strings, pointers, and dynamic memory allocation
• you are able to design, implement, debug, test and document small C programs (up to several hundred lines of code)
• you are familiar with the Linux environment on the CSE computers

Installing Linux, possibly as a virtual machine, on your own computer would be a major bonus.

## Teaching Rationale

Computer science is, to a large extent, a practical discipline, and so COMP2521 has an emphasis on practice. Lectures will include exercises where we examine the practice of developing and analysing programs. The aim of tutorials is to develop analysis and understanding via practical case studies. Lab classes also provide practice in program development and analysis. Assignments provide large case studies of software development.

## Teaching Strategies

COMP2521 involves lectures, tutorials, labs, assignments and a text book.

Lectures aim to convey basic information about the course content and to model the practices and techniques involved in software development (i.e., we do demos). The most important components of the course, however, are the tutorials, labs and assignments. Tutorials aim to clarify and refine the knowledge that you got from lectures, and from reading the textbook and notes. Labs and assignments are where you get to put together and practise all of the ideas from the lectures, tutes and text. The only way to develop the skills to do effective software development is by practising them. If you slack off on the assignments and lab exercises (or, worse, rely on someone else to do them for you), you're wasting the course's most valuable learning opportunities.

The university requires us to assess how well you have learned the course content, and the primary approach to achieving this is via a final exam. A final exam is the ultimate summative assessment tool; it gives you a chance, at the end of the course, to demonstrate everything that you've learned. Labs and assignments are a learningtool, not an assessment tool, so, in an ideal world, we would have them as pure learning exercises and award no marks for them. However, to give a more concrete incentive to do them (in a timely fashion), there are marks tied to them.

#### Lectures

Each week, there will be four hours of lectures during which theory, practical demonstrations and case studies will be presented. Lectures convey a small amount of information about the course content, but their main aim is to try to stimulate you to think about concepts and techniques. Lectures will be delivered online via Blackboard Collaborate.

#### Textbook vs Slides

• textbook: contains all material for the course (and more), available from the UNSW Bookstore, describes the material in lots of detail and is very well-written;
• slides: the material we use in lectures, available online after the lecture.

#### Tutorials

Tutorials aim to clarify ideas from lectures and to get you to think about design/analysis issues. There will be a number of exercises set for each tutorial class. The aim of the class is not to simply get the tutor to give you the answers; the aim is to focus on just one or two of the exercises and work through them in detail, discussing as many aspects, alternative approaches, fine details, etc. as possible. You must be active and ask questions in tutorials.

#### Lab Classes

Lab classes aim to give you practice in problem-solving and program development. Each week, there will be one or two small exercises to work on. These exercises will be released in the week preceding the lab class. Labs will be done in pairs, and you and your partner should discuss the exercises before going to the lab, to maximise the usefulness of the class. The exercises will need to be submitted (for our records) and will be assessed by your tutor. During the lab, your tutor will provide feedback on your approach to the problem and on the style of your solution.

#### Assignments

In the assignments, you will work on more substantial (hundreds of lines of code) programming exercises. All assignments will be completed individually. As noted above, assignments are the primary vehicle for learning the material in this course. If you don't do them, or simply copy and submit someone else's work, you have wasted a valuable learning opportunity.

## Assessment

Your final mark in this course will be based on components from the assignment work, quizzes, labs, and the final exam.

 Item Topics Due Marks Contributes to Quizzes All topics Weeks 2, 3, 4, 5, 7, 8, 9 14% 1, 2, 3, 4, 5, 6, 7 Assignment 1 Trees Week 7 15% 4, 5, 7, 8 Assignment 2 Graphs Week 10 20% 4, 5, 7, 8 Labs All topics Weeks 1, 2, 3, 5, 7, 8, 9 11% 1, 3, 4, 5 Final Exam All topics Exam period 40% 1, 2, 3, 4, 5, 6, 7, 8

Each quiz contributes 2 marks, and we will use your best 6 quiz marks to determine the mark out of 14. Similarly each lab contributes 5 marks, and we will use your best 6 lab marks to determine the mark out of 11.

The following formula describes precisely how the mark will be computed and how the hurdle will be enforced:

quizzes             = mark for quizzes               (out of  14)
labs                = mark for lab exercises         (out of  11)
ass1                = mark for assignment 1          (out of  15)
ass2                = mark for assignment 2          (out of  20)
finalExam           = mark for final exam            (out of  40)

okHurdle            = finalExam > 20 (that is, > 50% in the final exam)

mark      = quizzes + labs + ass1 + ass2 + finalExam
grade     = HD|DN|CR|PS  if mark >= 50 && okHurdle
= FL           if mark <  50
= UF           if mark >= 50 && !okHurdle


## Course Schedule

The schedule of lecture topics (subject to change) is:

Week Topics
1 Analysis of algorithms
2 Analysis of ADT (multiple) implementations
Trees, Binary search trees (BST)
3 Balanced search trees, Search tree algorithms
4 Graph ADT, Graph algorithms (1)
5 Graph algorithms (2)
6 ...
7 Hashing, Heaps, Sorting (1)
8 Sorting (2)
9 Text processing algorithms (1)
10 Text processing algorithms (2)
Course review and review exercises

Tutorial/Laboratories: Each topic will be dealt with in tutes/labs in the week after it is covered in lectures.

## Supplementary Exams

The document "Essential Advice for CSE Students" states the supplementary assessment policy for the School of CSE. Please take the time to read it carefully.

If you are granted a supplementary examination, then it will be centrally timetabled. If you think that you may be eligible for a supplementary exam, then make sure you are available on that day. It is your responsibility to check at the student office for details of supplementary examinations.

## Resources for Students

COMP2521 follows the contents of the pair of books:

• Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd Edition)
• Algorithms in C, Part 5: Graph Algorithms (3rd Edition)

These two books are available as a bundle from the UNSW bookshop. They are expensive, but are useful well beyond this course, and will serve as a useful reference on the bookshelf of any serious programmer.

You may also be able to find on-line resources related to the textbooks. Robert Sedgewick has a series of videos on the topics in this course, but unfortunately they all seem to be in Java (which he has used for the new edition of his book). If you find any useful on-line resources, please let me know and we will add them to the Resources section of the course web site (with credit to the finder).

This website also has links to the auxiliary material/documentation that you will need for the course. Solutions for all tutorial questions and lab exercises will also be made available. We will review quiz and assignment solutions in the lectures.

## Student Conduct

The Student Code of Conduct (Information, Policy) sets out what the University expects from students as members of the UNSW community. As well as the learning, teaching and research environment, the University aims to provide an environment that enables students to achieve their full potential and to provide an experience consistent with the University's values and guiding principles. A condition of enrolment is that students inform themselves of the University's rules and policies affecting them, and conduct themselves accordingly.

In particular, students have the responsibility to observe standards of equity and respect in dealing with every member of the University community. This applies to all activities on UNSW premises and all external activities related to study and research. This includes behaviour in person, as well as behaviour on social media, for example Facebook groups set up for the purpose of discussing UNSW courses or course work. Behaviour that is considered in breach of the Student Code of Conduct as discriminatory, sexually inappropriate, bullying, harassing, invading another's privacy, or causing any person to fear for their personal safety is serious misconduct and can lead to severe penalties, including suspension or exclusion from UNSW.

If you have any concerns, you may raise them with your lecturer, or approach the School Ethics Officer, the School Grievance Officer, or one of the student representatives.

Plagiarism is defined as using the words or ideas of others and presenting them as your own. UNSW and CSE treat plagiarism as academic misconduct, which means that it carries penalties as severe as being excluded from further study at UNSW. There are several on-line sources to help you understand what plagiarism is and how it is dealt with at UNSW:

Make sure that you read and understand these. Ignorance is not accepted as an excuse for plagiarism. In particular, you are also responsible that your assignment files are not accessible by anyone but you by setting the correct permissions in your CSE directory and code repository, if using. Note also that plagiarism includes paying or asking another person to do a piece of work for you, and then submitting it as your own work.

UNSW has an ongoing commitment to fostering a culture of learning informed by academic integrity. All UNSW staff and students have a responsibility to adhere to this principle of academic integrity. Plagiarism undermines academic integrity and is not tolerated at UNSW. Plagiarism at UNSW is defined as using the words or ideas of others and passing them off as your own.

If you haven't done so yet, please take the time to read the full text of UNSW's policy regarding academic honesty and plagiarism.

The pages below describe the policies and procedures in more detail:

You should also read the following page which describes your rights and responsibilities in the CSE context:

## Course Evaluation and Development

Student feedback on this course, and on the effectiveness of lectures, tutorials and labs in this course, is obtained via electronic survey (myExperience) at the end of each semester. Student feedback is taken seriously, and continual improvements are made to the course based in part on this feedback. Students are strongly encouraged to let the lecturer in charge know of any problems as soon as they arise. Suggestions and criticisms will be listened to openly, and every action will be taken to correct any issue or improve the students' learning experience.