Please enable javascript to view this page in its intended format.
Delivery Mode: Online
Term Offered: Summer 2013 May-June
Session/Section: May 6 - June 17, 2013
Exam Dates: June 20-21, 2013
Corequisites:MATH 111/6.0 or MATH 121/6.0 or MATH 122/6.0 or MATH 110/6.0 or MATH 112/3.0 or MATH 120/6.0 or MATH 123/3.0 or MATH 124/3.0 or MATH 126/6.0.
Recommended: Some programming experience (such as high-school level programming or CISC 101/3.0 or CISC 110/3.0); see Introductory Courses in Departmental Notes.
This course is available to both Queen’s and non-Queen’s students. Non-Queen’s students (including interest students, visiting students, and new online degree students) must first apply for admission. The following is presented for informational purposes only and is subject to change.
Wendy Powley Learn more about the instructor...
E-mail: wendy@cs.queensu.ca
Introduction to design and analysis of algorithms. Recursion, backtracking, and exits. Sequences, linked lists and references. Binary search trees. Elementary searching and sorting. Assertions and loop invariants. Order-of-magnitude complexity. Numerical computation. Documentation, testing and debugging.
This course is an introduction to programming using Python. It is assumed that students have some prior experience in programming and understand the basics of a programming language such as variables, functions, iteration and loops. We will cover these concepts briefly in Python. In addition, we will cover topics such as recursion, searching and sorting techniques, data structures such as linked lists and binary search trees and computational complexity. Throughout the course you will learn good programming style, how to document your code and testing/debugging techniques.
More information: