Use the Tab and Up, Down arrow keys to select menu items.
An introduction to Computer Science, including algorithms, computability, complexity and object-oriented programming. Cosc121 is normally required as preparation for Cosc122.
This course develops a thorough understanding of basic data structures and algorithms that are commonly used in software development, and introduces students to broad concepts from Computer Science that enable them to develop effective programs. A series of labs and assignments will give students practice applying the ideas that they have learnt in lectures. Along the way, students will gain an understanding of why different data structures and algorithms are needed, the applications that they are suited for, and the advantages and disadvantages of their possible implementations.
Specifically, the goals of the course are:To provide students with a sound foundation in Computer ScienceTo give students experience with common algorithms and data structures used in Computer Science
RP: COSC121
COSC121
You need to attend three lectures and two hours of labs per week. The labs will be allocated via the online timetable system. Labs begin in the second week of term.Depending on final student numbers, some of the advertised lab/tutorial streams may not run. Final lab/tutorial options will be available for self-allocation closer to the start of the semester through My Timetable.The COSC122 test will be conducted in two streams, at the day and time indicated here. Details, and self-allocation to these streams, will be made available closer to the time of the test.
Tim Bell
Miller, Bradley N. , Ranum, David L; Problem solving with algorithms and data structures using Python ; Franklin, Beedle & Associates, 2006 (2nd edition, unless a new one becomes available during the year).
This can be bought from the bookshop, and is also available online at no charge at:http://interactivepython.org/ (register on the site for the course “COSC122”).
Library portalCourse Information on Learn STAR COSC122 Information
There are several important documents available online about departmental regulations, policies and guidelines at the following site. We expect all students to be familiar with these. Notices about this class will be posted to the class forum in the Learn system.COSC students will also be made members of a class called “CSSE Notices”, where general notices will be posted that apply to all classes (such as information about building access or job opportunities).
Every year several students fail the course because of dishonest practice. Please do not be among them. You are encouraged to discuss the general aspects of a problem with others. However, anything you submit for credit must be entirely your own work and not copied, with or without modification, from any other person. If you share details of your work with anybody else then you are likely to be in breach of the University's General Course and Examination Regulations and/or Computer Regulations (both of which are set out in the University Calendar) and/or the Computer Science Department's policy (see section 9). The Department treats cases of dishonesty very seriously and, where appropriate, will not hesitate to notify the University Proctor.If you need help with specific details relating to your work, or are not sure what you are allowed to do, then contact your tutors or lecturer for advice.
The Computer Science department's grading policy states that in order to pass a course you must meet two requirements:1. You must achieve an average grade of at least 50% over all assessment items.2. You must achieve an average mark of at least 45% on invigilated assessment items.If you satisfy both these criteria, your grade will be determined by the following University- wide scale for converting marks to grades: an average mark of 50% is sufficient for a C- grade, an average mark of 55% earns a C grade, 60% earns a B- grade and so forth. However if you do not satisfy both the passing criteria you will be given either a D or E grade depending on marks. Marks are sometimes scaled to achieve consistency between courses from year to year. AegrotatsIf factors beyond your control (such as illness or family bereavement) prevent you from completing some item of course work (including laboratory sessions), or prevent you from giving your best, then you may be eligible for aegrotat, impaired performance consideration or an extension on the assessment. Details of these may be found in the University Calendar. Supporting evidence, such as a medical certificate, is normally required. If in doubt, talk to your lecturer.
The topics covered in lectures will be as follows. The main references are for the current edition of the text book (2nd edition and online). Where a reference is given in square brackets, it is for the first edition.• Introduction to algorithms, and the relationship with Software Engineering• Algorithm analysis (Chapter 2 [4])• Basic data structures – stacks and queues (Chapter 3 [2])• Lists (Chapter 3 [7])• Recursion (Chapter 4 [3])• Searching (Chapter 5 [4])• Sorting (Chapter 5 [4])• Trees – binary trees and heaps (Chapter 6 [5])• Graphs (Chapter 7 [6])• Overview of major ideas in Computer Science
The course assumes that you are proficient in Python, as taught in COSC121. It is possible to take COSC121 and COSC122 concurrently, but if you don’t have significant computing experience (especially programming) then this is not advised.
Domestic fee $778.00
International fee $3,450.00
* All fees are inclusive of NZ GST or any equivalent overseas tax, and do not include any programme level discount or additional course-related expenses.
For further information see Computer Science and Software Engineering .