CPSC 331, Information Structures I, Winter 2016

Lectures Lecture L01: MWF 10:00-10:50 (ENA 03)
Instructor: Mike Jacobson
Office: ICT 612
Email: jacobs@cpsc.ucalgary.ca
Phone: (403) 210-9410
Office hours: M 12:00 - 14:00 or by appointment only
Course information sheet: available here

Tutorials T01 MW 16:00-16:50 in MS 176, Maryam Soleimani (email).

T02 MW 13:00-13:50 in MS 176, Maryam Soleimani (email).

T03 MW 11:00-11:50 in MS 156, Mahshid Marbouti (email).

T04 TuTh 9:00-9:50 in MS 160, Mahshid Marbouti (email).

Textbook
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,
Introduction to Algorithms,
Third Edition, MIT Press, 2009

This huge book includes material that could be covered in at least three of the courses in algorithms and data structures that are offered at the University of Calgary (namely, CPSC 331, 413, and 517). It does not include very much information about how to implement data structures or algorithms in any particular programming language, but it includes more information about the correctness of algorithms than most other references do and — sometimes — its presentation of an algorithm is somewhat simpler than presentations found elsewhere. This book is also a very good reference for students who are interested in learning more the design and analysis of algorithms, and is highly recommended as a standard reference for any aspiring computer professional.

Unfortunately the library does not have an electronic version fo the 3rd editition available, but University of Calgary students can read the 2nd edition online. Most of the content is the same or similar, but note that all references to the book made in the course will refer to the 3rd edition.

Midterm Test The midterm test will take place on Monday, March 7, 17:00-18:30, in ST 135.
Make-up tests will not be given under any circumstances. If you are unable to attend (and have a valid, documented excuse), you will receive a no-mark and your the proportion of your final grade made of up of your final exam will be adjusted accordingly.
In previous offerings of the course, there were two term tests. Samples of these are provided here.

Sample Term Test 1: (PDF) Solutions: (PDF)

Sample Term Test 2: (PDF) Solutions: (PDF)

Solutions to Test 1 from review session: (PDF)

Solutions to Test 2 from review session: (PDF)

Note that, as we will only have one term test, not all of the material on the 2nd sample test will be covered on our midterm.

Solutions to the midterm (PDF)

Final Exam The final exam will take place Wednesday, April 20, 8:00-11:00, location SB 148. Please note that no books or calculators will be permitted. Although we have the room for 3 hours, the exam itself should only take 2. The following sample final exam will give you a rough idea of the length and format. The exam is cummulative and will cover all course material.

Sample Final Exam: (PDF)
Solutions: (PDF)

Last updated:
http://www.cpsc.ucalgary.ca/~jacobs/Courses/cpsc331/W16/index.html

Lectures	Lecture L01: MWF 10:00-10:50 (ENA 03) Instructor: Mike Jacobson Office: ICT 612 Email: jacobs@cpsc.ucalgary.ca Phone: (403) 210-9410 Office hours: M 12:00 - 14:00 or by appointment only Course information sheet: available here
Tutorials	T01 MW 16:00-16:50 in MS 176, Maryam Soleimani (email). T02 MW 13:00-13:50 in MS 176, Maryam Soleimani (email). T03 MW 11:00-11:50 in MS 156, Mahshid Marbouti (email). T04 TuTh 9:00-9:50 in MS 160, Mahshid Marbouti (email).
Textbook	Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, Third Edition, MIT Press, 2009 This huge book includes material that could be covered in at least three of the courses in algorithms and data structures that are offered at the University of Calgary (namely, CPSC 331, 413, and 517). It does not include very much information about how to implement data structures or algorithms in any particular programming language, but it includes more information about the correctness of algorithms than most other references do and — sometimes — its presentation of an algorithm is somewhat simpler than presentations found elsewhere. This book is also a very good reference for students who are interested in learning more the design and analysis of algorithms, and is highly recommended as a standard reference for any aspiring computer professional. Unfortunately the library does not have an electronic version fo the 3rd editition available, but University of Calgary students can read the 2nd edition online. Most of the content is the same or similar, but note that all references to the book made in the course will refer to the 3rd edition.
Midterm Test	The midterm test will take place on Monday, March 7, 17:00-18:30, in ST 135. Make-up tests will not be given under any circumstances. If you are unable to attend (and have a valid, documented excuse), you will receive a no-mark and your the proportion of your final grade made of up of your final exam will be adjusted accordingly. In previous offerings of the course, there were two term tests. Samples of these are provided here. Sample Term Test 1: (PDF) Solutions: (PDF) Sample Term Test 2: (PDF) Solutions: (PDF) Solutions to Test 1 from review session: (PDF) Solutions to Test 2 from review session: (PDF) Note that, as we will only have one term test, not all of the material on the 2nd sample test will be covered on our midterm. Solutions to the midterm (PDF)
Final Exam	The final exam will take place Wednesday, April 20, 8:00-11:00, location SB 148. Please note that no books or calculators will be permitted. Although we have the room for 3 hours, the exam itself should only take 2. The following sample final exam will give you a rough idea of the length and format. The exam is cummulative and will cover all course material. Sample Final Exam: (PDF) Solutions: (PDF)