Description
This course builds upon the principles introduced in COMP 1405 and COMP 1406 and provides a general background for further study in Computer Science. The course will cover object-oriented programming concepts; the design and implementation of data structures (linked lists, stacks, queues, trees, heaps, hash tables, and graphs) and related algorithmic techniques (searching, sorting, recursion); and algorithm analysis. Students will be expected to complete a number of programming projects illustrating the concepts presented. Precludes additional credit for COMP 2002 (no longer offered), SYSC 2002 (no longer offered), SYSC 2100. Prerequisites: one of COMP 1406, COMP 1006, SYSC 2004, with a minimum grade of C-.
General Information
Instructor
Alexa Sharp (she/her)
alexasharp3@cunet.carleton.ca
alexasharp3@cunet.carleton.ca
Live Lecture
Wednesdays and Fridays 14:35pm - 15:55pm via zoom
Recorded Lecture
Posted on piazza within a few hours of the live lecture
Drills & Exams
on cuLearn (https://carleton.ca/culearn/)
Textbook
Pat Morin's Open Data Structures.
Free PDF and HTML versions of the book are available at opendatastructures.org.
Free PDF and HTML versions of the book are available at opendatastructures.org.
| Name | Office Hours | |
|---|---|---|
Forrest Buehlow (he/him) | When? Where? | |
feifei zhao | When? Where? | |
jojo | When? Where? | |
Huzaifa Patel (He/Him) | When? Where? | |
Alexa Sharp (she/her) | When? Where? | |
Ishtiaque Hossain (He/Him) | When? Where? | |
Daniil Kulik (he/him) | When? Where? | |
Songmi Wu (he/his) | When? Where? | |
William Da Silva (he/him) | When? Where? | |
Alina Shaikhet | When? Where? | |
Andrew | When? Where? |