| Course Code | COMP1927 |
| Course Title | Computing 2 |
| Units of Credit | 6 |
| Course Website | http://cse.unsw.edu.au/~cs1927 |
| Handbook Entry | http://www.handbook.unsw.edu.au/undergraduate/courses/current/COMP1927.html |
This course explores data structures, algorithms and software implementation techniques.
You explore these ideas in tutorials and lab classes, but mainly via two assignments.
Assessment involves labs, tutes, on-line quizzes, a prac exam, and a theory exam.
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.
A summary of the critical things to know about COMP1927:
Now, please read the rest of this document.
Lecture Times (3 hours):
Please note that there is no lecture for the time slot Wednesday 11am to 12noon .
The complete course timetable is available here .
The aim of this course is to get you to think like a computer scientist . 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 to understand natural systems and processes. For example, a geologist 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 the introductory C programming courses COMP1917 or COMP1921. We cover additional aspects of the C programming language that were not covered in these course, and also look at some programming tools which were not covered (in detail) in COMP1917 or COMP1921. 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.
COMP1927 is a critical course in the study of computing at UNSW, since it deals with many concepts that are central to your 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.
After completing this course, students will:
This course contributes to the development of the following graduate capabilities:
| Graduate Capability | Acquired in |
| 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 | blog, 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 |
The official pre-requisite for this course is either COMP1917 or COMP1921.
Whether or not you satisfy the pre-requisite, we assume that:
Installing Linux, possibly as a virtual machine, on your own computer would be a major bonus.
Computer Science is, to a large extent, a practical discipline, and so COMP1927 has an emphasis on practice. Lectures will include exercises where we examine the practice of developing and analysing programs. Tutorials aim 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.
COMP1927 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 text book 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. An 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 learning tool, not an assessment tool, so, in an ideal world, I 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.
Each week there will be three hours (Tuesday 4-6pm, Wednesday 12-1pm) 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. Feel free to ask questions at any stage, but otherwise please respect the right of other people around you who are trying to listen and (shhhhhh) keep quiet.
Note that I will not post the lecture slides before the lecture, to encourage you to concentrate on the fresh material. However, I will always give you textbook references to read for each lecture in the previous lecture and the notes will always be available before the lecture.
There are three sources of material available for you to study in this course:
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. Ideally, students should run the entire tute themselves, with the tutor being a moderator and occasionally providing additional explanations or clarifications.
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 you 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.
Pairs will also be asked to do code reviews in the tutorials, to explain how they tackled a particular problem and describe interesting features of their solution.
If you complete all of the labs, to a high standard, a bonus mark is available.
In the assignments, you will work on more substantial (hundreds of lines of code) programming exercises The first assignment is an individual assignment; the second will be completed in groups. We expect all members of a pair or group to contribute to the assignments; part of your assignment mark will be tied to this. 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.
There will be a number of on-line quizzes during the semester, which you take in your own time. The primary aim of the quizzes is to review material from the previous couple of weeks' lectures, but they will also contribute towards your final mark.
Your final mark in this course will be based on components from the assignment work, labs, quizzes, and the exam. Note that the exam is a hurdle, so that if you fail the exam badly enough, you cannot pass the course. If your failure in the exam is due solely to failing the Prac part, and the rest of your marks are satisfactory (okEffort), you will be given a second chance to complete the Prac.
The following formula describes precisely how the mark will be computed and how the hurdle will be enforced:
quizzes = mark for online quizzes (out of 5)
labs = mark for lab exercises (out of 7)
ass1 = mark for assignment 1 (out of 9)
ass2 = mark for assignment 2 (out of 14)
pracExam = mark for Prac part of exam (out of 35)
theoExam = mark for Theory part of exam (out of 30)
exam = (pracExam+theoExam) (out of 65)
okEffort = (quizzes>=3 && labs>=4 && ass1>=4 && ass2>=6)
okExam = (exam > 26/65) (after scaling)
mark = quizzes+labs+ass1+ass2+exam
grade = HD|DN|CR|PS if mark >= 50 && okExam
= FL if mark < 50 && okExam
= UF if !okExam
Plagiarism is defined as using the words or ideas of others and presenting them as your own . UNSW and CSE treat plagiarism as serious academic misconduct.
In the context of Computing, plagiarism most frequently occurs as people submitting programs written by others as their own work. We use plagiarism-checking software to detect this. Such software has gotten quite sophisticated over the years, and is capable of recognising most techniques of attempting to disguise a copied program.
Similarly, getting other people do your prac work for you is treated as serious academic misconduct. Anyone discovered engaging in this will have their details forwarded to the UNSW Registrar for further investigation.
Make sure that you read and understand these. Ignorance is not accepted as an excuse for plagiarism.
Note that the penalty for academic misconduct can be as serious as being excluded from further study at UNSW, which will leave a serious black mark on your academic record.
How to avoid this? It's simple . Do all of your prac work yourself, or in conjunction with your allocated lab partner or assignment group. A side-effect of doing this is that you will learn how to program and have a much better chance of passing the Prac Exam.
There are several on-line resources to help you understand what plagiarism is and how it is dealt with at UNSW:
The (current and subject to change) schedule of lecture topics is:
| Week | Lectures | Tutes/Labs |
| Week 1 | Introduction, Data, Algorithms, ADTs, List Revision | - |
| Week 2 | Algorithmic Complexity, Sorting: Simple Algorithms | ADTs, Lists |
| Week 3 | Sorting: More Efficient Algorithms | |
| Week 4 | Sorting: External (File) Sorting Algorithms | Profile Analysis |
| Week 5 | Graphs: Definitions, Properties, Representation | Sort Detective |
| Week 6 | Graphs: Traversal, Searching | Sort Detective (cont) |
| Week 7 | Graphs: Weighted, Acyclic, MST, Cycles | Graph Construction, Geo Data |
| Week 8 | Graphs: MST & Shortest Path Algorithms | Weighted Graphs, Geo Data |
| Week 9 | Searching: Scanning, Binary Search, Trees | Shortest Path |
| Week 10 | Searching: Binary Search Trees | Tree Construction |
| Week 11 | Searching: Balanced Trees | Level-order Traversal |
| Week 12 | Searching: Hashing, Tries | Balanced Trees |
| Week 13 | - | Hash Tables |
Each topic will be dealt with in tutes/labs in the week after it's covered in lectures.
COMP1927 follows the contents of the pair of books:
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 text books. 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 I 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'll need for the course. Solutions for all tutorial questions and lab exercises will also be made available. I'll review quiz and assignment solutions in the lectures.
Resource created Thursday 28 January 2016, 08:20:36 PM, last modified Thursday 25 February 2016, 04:46:06 PM.