Intro. to Computer Science II
Welcome to CS 112!
-
The first lectures of the semester will be held on Thursday, January 18, 2024.
For more information, consult the syllabus or contact Dr. Januario, Ms. Papadakis-Kanaris or Dr. Xi.
Labs will not be meeting during the first week. However, we encourage you to do Lab 0 on your own ASAP.
-
Most of the course materials are available on this site using the links in the navigation bar (on the left). Go to your lecture section’s site on Blackboard for:
- pre-lecture materials, including the pre-lecture tasks, if any
- post-lecture materials
- all course announcements.
Course information
- Exams
- Course description
- The second course for computer science majors and anyone seeking a rigorous introduction. Covers advanced programming techniques and data structures using the Java language. Topics include searching and sorting, recursion, algorithm analysis, linked lists, stacks, queues, trees, and hash tables.
- Prerequisites
- CS 111, or the equivalent. If you have not had significant prior experience with recursion, you are strongly encouraged to take CS 111 first.
- Instructors
-
- Tiago Januario, Lecturer
-
- Christine Papadakis-Kanaris, Senior Lecturer, Director of Masters Studies
-
- Hongwei Xi, Associate Professor
(see the staff page for contact information and office hours)
- Lectures
- section A1: TuTh, 11:00am - 12:15 pm
- section B1: TuTh, 12:30pm - 1:45 pm
- Labs
- All students must attend the one-hour weekly lab session for which they are enrolled.
- Requirements and grading
-
- Weekly problem sets (20% of the final grade)
- Exams: two midterm exams (35%) and a final exam (40%)
- Preparation and participation (5%)
-
To pass the course, you must have a passing average on the problem sets and a passing average across the three exams.
- Textbook
- You are not required to purchase a textbook. Instead, we will be assigning readings from freely available online resources.
- In-class software
- We will be using the Top Hat platform for post-class activities and attendance. More information will be provided in lecture.