|Course Title||Computing 2|
|Units of Credit||6|
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, class prac/theory exams, and a final prac/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.
Lectures are Wed, Fri 09:00 - 12:00 Rupert Myers Theatre (K-M15-1001)
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||lecture, 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||
|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.
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.You will receive lab marks for successfully completing the lab exercises. The lab mark will be part of your final mark, but it's main purpose is not assessment, but to make sure you constantly practice. There will be no late submissions.
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, and you take the risk of being caught for plagiarism. If you are caught, you will be awarded an overall mark of zero for the assignment, and possibly the course, and receive an entry in the school plagiarism register. This does not look good on your academic record.
However, you should be aware that re-use of algorithms and data structures developed outside this course is allowed. You should not re-use code however, but if you feel it is justified, you should give credit to the original author or source.
Assignment related questions may be part of the exam
The final exam contributes 55% of the final mark for this course. There will be no second-chances to pass the final exam. Attendance at the exam will be treated as an indication by you that you are feeling well enough to sit that exam. If you are feeling so unwell on the day of the exam that you cannot attend, go to the doctor and get a medical certificate. If you put in a request for supplementary assessment after already attending the original exam, your request will not be granted. Also, if your special consideration request does not provide documented evidence that you personally have been severely affected by some unforeseen situation, then your request will not be granted.
|Component||Percentage of overall mark|
|Class Exams||10% (5 each)|
Your final mark in this course will be based on components from tutorials, 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. The following formula describes precisely how the mark will be computed and how the hurdle will be enforced:
okExam = (final exam > 22/55) (after scaling) mark = tutorials+labs+assignment1+assignment2+class exams+ final 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 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.
The following is a summary of the topics that will be covered in this course. The schedule is tentative and may change as the semester proceeds. There will be different levels of detail on the different topics (some will provide overviews, some will be more detailed).
|1||Introduction, Linked lists, Abstract Data Types||Chapter 3, Chapter 4|
|2||Work Complexity,Recursion and Trees||Chapter 2, Chapter 5|
|3||Sorting||Chapter 6.1-6.5, 7, 8|
|4||Graph Intro, Graph Search||Chapter 17, 18|
|5||DAGs, Minimum Spanning Trees, Shortest Path||Chapter 21|
|6||Symbol Tables, Binary Search Trees||Chapter 12|
|7||Balanced Trees, Binary Search Tables, HashTables||Chapter 13, Chapter 14|
A list of topics and references to the course textbooks will be given on the course web site. The course textbooks are:
These two books are available as a bundle from the UNSW bookshop. They are expensive, but have relevance well beyond this course, and will serve as a useful reference on the bookshelf of any serious programmer.
The following books might also serve as additional reference material on the C programming language:
Resource created Thursday 26 November 2015, 07:44:43 PM, last modified Tuesday 01 December 2015, 07:25:15 PM.