Intermediate Computing with Data Structures
CS210 -- 2020Spring

Monday, Wednesday 04:00PM-05:15PM

This page provides information on the CS210 course for the Spring semester of 2020. Please come back regularly during and after the courses. Specifically:




Instrcutor:

Haoyu Wang
Email: haoyu.wang001@umb.edu
Office location: Online Classroom
Office hours: 3:00-4:00PM Mon, Wed or by appointment

TA:

Diana Alisevich
Email: diana.alisevich001@umb.edu

Discussion Session

When Where
05:30PM-06:45PM, Mon/Wed TBD
Starting from the second week, there will be a discussion every week. The focus of the discussion for a particular week will be the current project assignment. The teaching assistant (TA) will systematically walk you through the checklist document for the project; the document includes simple programming exercises on concepts needed for the project, and guidelines on how to approach the computational problems in the project. Discussions of projects will be worthwhile only if you go into the discussions having read the project descriptions thoroughly and have at least a modest understanding of the problems involved. The TA will assume that you have done the reading in advance. The TA will also answer any specific questions you may have about the project, or the course material in general.

Supplemental Instruction

When Where
TBD TBD
As part of the College of Science and Mathematics Freshman Success Program, supplemental instruction (SI) is available to all CS210 students free of charge. The SI sessions will also start from the second week. The focus of the sessions for a particular week will be the material covered in class during the previous week. The SI leader will walk you through the relevant lecture notes and solve problems. In addition, the SI leader will answer any specific questions you may have about the current project assignment, or the course material in general. The SI sessions are optional, but highly recommended, especially if you feel like you are falling behind in the course. You may attend as few or as many sessions as you like. You will receive extra-credit points for attending and participating in the sessions (see the Grading section below).

Course Description:

The design and implementation of computer programs in a high-level language, with emphasis on proper design principles and advanced programming concepts, including dynamic data structures and recursion. The assignments are designed to introduce the student to a variety of topics in computing: data structures and ADTs, Lists, Stacks, Queues, Ordered Lists, Binary Trees, and searching and sorting techniques.

Textbook:

Robert Sedgewick and Kevin Wayne, Algorithms, 4th Edition
Online content
Algorithms, 4th edition textbook code and libraries

Calender:





Grades Structure:

Item Percentage
Projects (Best 5 of 6) 40
Tests (Best 2 of 3) 60
Participation 5 (Extra)

Grades Scale :

Score Grade
[93, 100] A
[90, 93) A-
[87, 90) B+
[83, 87) B
[80, 83) B-
[77, 80) C+
[73, 77) C
[70, 73) C-
[67, 70) D+
[63, 67) D
[60, 63) D-
[0, 60) F

Assignments:

Late projects submission are in principle not allowed except for very unusual situations. To apply a late submission of projects you have to have a compelling reason with supporting documentation and it has to be applied at least 4 days before the due date. Any application of late submission within the last 4 days before the due date will not be granted. And again, late projects submission are generally not allowed.
Homework Posted on Due Date
Homework #1
Exercise Go-Through (Password: wx4GJ^&Y)
Jan, 25 23:59PM, Feb 14

Programs Discussed in Class:

(pdf | IntelliJ Project )



Class Sessions :

Passcode:
Index Session Dates Topics Slides Recordings & PassWords
1 Mon, Jan 25 Course Mechanics
2 Wed, Jan 27 Basic Concepts 1.pdf Recordings 3#gUb&yT
3 Mon, Feb 1 Array,StdIn and StdOut 2.pdf 3.pdf Recordings dB%Bv0=H
4 Wed, Feb 3 Array 2.pdf Recordings 0Kb#aSs3
5 Mon, Feb 8 DST 3.pdf Recordings 8w%ky&*s
6 Wed, Feb 10 AOA 7.pdf Recordings fr^W^j*2
7 Mon, Feb 15 Presidents' Day -- --
8 Mon, Feb 17 Stack,Queue, Iterator 8.pdf Recordings 79!8%isT
9 Mon, Feb 22 Union Find 9.pdf
9.pdf
Recordings &Pg6k?7h
10 Wed, Feb 24 Elementary Sorts 9.pdf Recordings!9m#TmHm
11 Mon, Mar 1 Mergesort 10.pdf Recordings gjt9z!%#
12 Wed, March 3 Quicksort 11.pdf Recordings 1?$9q&Qd
13 Mon, Mar 8 Priority Queue 12.pdf Recordings@aC+@j5b
14 Wed, Mar 10 BST 14.pdf
14.pdf
RecordingskR8H.V0F
15 Mon, Mar 22 Sorting Applications, Inversions 13.pdf RecordingsQSB$3#DL
16 Wed, Mar 24 BALANCED SEARCH TREES 15.pdf Recordings 0$v?t7bX
17 Mon, Mar 29 Practice 1 Go-through Notes RecordingscHh#kH9f
18 Wen, March 31 Exam1
19 Mon, April 05 Hash Table hashtable.pdf Recordingss#m2E%ea
20 Wen, April 07 Search Application 20.pdf RecordingsN28c1g^5
21 Mon, April 12 Undirected Graph Undirected Graph.pdf Recordings7mNq1q2#
22 Wed, April 15 Directed Graph Directed Graph.pdf Recordings$dVJ0f&y











Accommodations:

Section 504 of the Americans with Disabilities Act of 1990 offers guidelines for curriculum modifications and adaptations for students with documented disabilities. If applicable, students may obtain adaptation recommendations from the Ross Center for Disability Services, Campus Center, UL Room 211, (617-287-7430). The student must present these recommendations and discuss them with each professor within a reasonable period, preferably by the end of Drop/Add period.

Student Conduct:

Students are required to adhere to the University Policy on Academic Standards and Cheating, to the University Statement on Plagiarism and the Documentation of Written Work, and to the Code of Student Conduct as delineated in the catalog of Undergraduate Programs. The Code is available online at:life_on_campus/student_conduct