Introduction to Computer Science II

Welcome!

The first lectures of the semester will be held on January 22, 2019.

Labs will meet as scheduled during the first week.

For more information, consult the syllabus or contact Ms. Papadakis-Kanaris.

Most of the course materials are available on this site using the links in the navigation bar.

The lecture materials (including pre-lecture tasks) and the course announcements are found on Blackboard.

Course information

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

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

Lectures

section A1: TuTh, 9:30-10:45 pm, COM 101 section B1: TuTh, 11:00-12:15 am, CAS B12

Labs

All students must attend a one-hour lab session.

The labs are held in either EMA 304. Please check your schedule for the location of your lab.

The A and B lab sections are interchangeable, but students enrolled in the C lecture must enroll in a C lab.

Requirements

• Weekly problem sets and final project (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

None required