Introduction to Computer Science II

Welcome to CS 112!

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
• all post-lecture materials
• all course announcements

Course information

Exams

• information about midterm 1 on 3/2

• information about midterm 2 on 4/6

• information about the final exam on 5/12

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

• Christine Papadakis-Kanaris, Lecturer, Director of Masters Studies
• David G. Sullivan, Ph.D., Master Lecturer

(see the staff page for contact information and office hours)

Lectures

section A1: TuTh, 12:30-1:45 pm, LAW AUD

section B1: MWF, 1:25-2:15 pm, KCB 101

section C1: TuTh, 2:00-3:15 pm, LAW AUD

Labs

All students must attend a one-hour weekly lab session.

Requirements and grading

• Weekly problem sets (25% of the final grade)
• Exams: two midterm exams (30%) and a final exam (35%)
• Preparation and participation (10%)

To pass the course, you must earn a passing grade for each of these three components.

Textbook

You are not required to purchase a textbook. Instead, we will be assigning readings from freely available online resources. If you are interested in purchasing a Java reference book, we will recommend some possible titles in lecture.

In-Class Software

We will be using the Top Hat platform for in-class activities and attendance. More information will be provided in lecture.