Term and Credits
Spring 2019-2020
3 Credits
Room and Time
Videos and readings will be posted to learn.drexel.edu
Instructor
Mark Boady
Electronic Mail Address:
mwb33@drexel.edu
Office: 3675 Market Street Room 1058
Extention: 215-895-2347
Office Hours:
Monday 10-12 in Slack,
Wednesday 3-5 in Slack
Schedule a Meeting
Teaching Assistant(s)
Nicki Barari
Electronic Mail Address:
nb895@drexel.edu
CLC Website:
https://www.cs.drexel.edu/clc
Office: Online in Slack
Office Hours:
Wednesday 12PM-2PM in Slack,
Thursday 2-4PM in Slack
Schedule a Meeting
Course Description
Survey of basic mathematics concepts needed for the study of computer science at the graduate level: induction, iteration, recursion; analysis of program running time; graphs and trees; predicate logic; regular expressions, Context Free Grammars, and Turing Machines.
Course Objective and Goals
Audience and Purpose within Plan of Study
This course is for graduate students with little prior knowledge of data structures and algorithms. It serves to give such students a firm foundation for future graduate study, and it is a requirement of the Computer Science Minor and Computer Science Post Bachelor Certificate degree programs.
Prerequisites
CS570 is a required co/prerequisites.
What Students Should Know Prior to this Course
What Students will be able to do upon Successfully Completing this Course:
Textbook
No Textbook. Free Online Resources Only.Lectures/Readings
Homeworks
Quizzes
Research Papers
Slack Channel
Late Submissions
Special Circumstances
Academic Honesty Policy
The CCI Academic Honesty policy is in effect for this course. Please see the policy at http://drexel.edu/cci/resources/current-students/undergraduate/policies/cs-academic-integrity/.
Academic Honesty Violations will be reported to the University. Punishment will be determined by the severity of the incident. Punishments include, but are not limited to,
Grading and Policies
Final grades will be determined by your total points weighted according to this distribution. Grades may be curved but are generally computed via the formula below. It may be modified at the instructor's sole discretion, but letter grades will generally not be lower than those shown here.
University Policies
In addition to the course policies listed on this syllabus, course assignments or course website, the following University policies are in effect:
Topics
Please see the appropriate assignment webpages for a detailed description of course deliverables.
Week | Topic | Reading | Homework |
1 (4/6/20) | How does a computer work? | Chapter 1 of PDF | Homework 1 Due Monday 4/13/20 at 11:59PM |
2 (4/13/20) | Basic Algorithmic Structures | Chapter 2 of PDF | Homework 2 Due Monday 4/20/20 at 11:59PM |
3 (4/20/20) | Recursion | Chapter 3 of PDF | Homework 3 Due Monday 4/27/20 at 11:59PM |
4 (4/27/20) | Analysis of Algorithms | Chapter 4 of PDF | Homework 4 Due Monday 5/4/20 at 11:59PM |
5 (5/4/20) | Searching and Sorting (Part 1) | Chapter 5 of PDF | Homework 5 Due Monday 5/11/20 at 11:59PM |
Research Paper 1 Due Friday 5/8/20 at 11:59PM | |||
6 (5/11/20) | Searching and Sorting (Part 2) | Chapter 6 of PDF | Homework 6 Due Monday 5/18/20 at 11:59PM |
7 (5/18/20) | Linked Lists and Memory | Chapter 7 of PDF | Homework 7 Due Monday 5/25/20 at 11:59PM |
8 (5/25/20) Memorial Day |
Trees and Sets | Chapter 8 of PDF | Homework 8 Due Monday 6/1/20 at 11:59PM |
9 (6/1/20) | Graphs | Chapter 9 of PDF | Homework 9 Due Monday 6/8/20 at 11:59PM |
10 (6/8/20) | Research Paper 2 Due Friday June 12, 2020 at 11:59PM |