====== Schedule (CMPU-102-51, Spring 2013) ======

^ Date  ^Topic ^Lecture Notes^
^1/24	|Introduction: Objects and Classes| {{courses:cs102-201301:cmpu102-lecture01.pdf|Lecture 1}}|
^1/29	|Data Types, Variables, Expressions, Assignment| {{courses:cs102-201301:cmpu102-lecture02.pdf|Lecture 2}}|
^1/31	|Methods, Parameters and Signatures| {{courses:cs102-201301:cmpu102-lecture03.pdf|Lecture 3}}|
^2/5	|Blocks, Conditional and Switch Statements| {{courses:cs102-201301:cmpu102-lecture04.pdf|Lecture 4}}|
^2/7	|Looping Constructs| {{courses:cs102-201301:cmpu102-lecture05.pdf|Lecture 5}}|
^2/12	|Arrays: Definition, Access, Traversal| {{courses:cs102-201301:cmpu102-lecture06.pdf|Lecture 6}}|
^2/14	|Strings, Input & Output Streams| {{courses:cs102-201301:cmpu102-lecture07.pdf|Lecture 7}}|
^2/19	|Reading from and Writing to Files| {{courses:cs102-201301:cmpu102-lecture08.pdf|Lecture 8}}|
^2/21	|Class Declaration, Data Encapsulation, Visibility| {{courses:cs102-201301:cmpu102-lecture09.pdf|Lecture 9}}|
^2/26   |Inheritance, Abstract Classes, Interfaces| {{courses:cs102-201301:cmpu102-lecture10.pdf|Lecture 10}}|
^2/28	|Exceptions and the Run Time Stack| {{courses:cs102-201301:cmpu102-lecture11.pdf|Lecture 11}}|
^3/5	|Mid Term Review: {{courses:cs102-201301:cmpu102-midterm-resources.zip|Resources}} | {{courses:cs102-201301:cs102-midterm-review.pdf|Review Notes}}|
^3/7    |{{courses:cs102-201301:cmpu102-mid-term-exam.zip|Mid Term Exam}} {{courses:cs102-201301:cmpu102-mid-term-exam-solutions.zip|Solutions}}  | None|
^3/12   |Break| None|
^3/14   |Break| None|
^3/19   |Break| None|
^3/21	|Break| None|
^3/26	|Linked Lists| {{courses:cs102-201301:cmpu102-lecture12.pdf|Lecture 12}}|
^3/28	|Generic Programming| {{courses:cs102-201301:cmpu102-lecture13.pdf|Lecture 13}}|
^4/2	|Stacks| {{courses:cs102-201301:cmpu102-lecture14.pdf|Lecture 14}}|
^4/4	|Queues| {{courses:cs102-201301:cmpu102-lecture15.pdf|Lecture 15}}|
^4/9	|Binary Search Trees| {{courses:cs102-201301:cmpu102-lecture16.pdf|Lecture 16}}|
^4/11   |Containers and Iterators| {{courses:cs102-201301:cmpu102-lecture17.pdf|Lecture 17}}|
^4/16	|Sorting Algorithms| {{courses:cs102-201301:cmpu102-lecture18.pdf|Lecture 18}}|
^4/18	|Computational Complexity| {{courses:cs102-201301:cmpu102-lecture19.pdf|Lecture 19}}|
^4/23   |Threads and Synchronization |{{courses:cs102-201301:cmpu102-lecture20.pdf|Lecture 20}}|
^4/25	|Event-Driven Programming: Applets| {{courses:cs102-201301:cmpu102-lecture21.pdf|Lecture 21}}|
^4/30   |Graphs and Search Algorithms| {{courses:cs102-201301:cmpu102-lecture22.pdf|Lecture 22}}|
^5/2    |Programming with Libraries| {{courses:cs102-201301:cmpu102-lecture23.pdf|Lecture 23}}|
^5/7    |Review | None|
^TBA    |{{courses:cs102-201301:cmpu102-final-exam-s13.zip|Final Exam}} | {{courses:cs102-201301:cmpu102-final-resources.zip|Resources}} |

\\ \\ \\