Term and Credits
Fall 20162017
3 Credits
Room and Time
Monday 6:00pm8:50pm UC 149
Monday lecture will be recorded for online section
Instructor
Mark Boady
Electronic Mail Address: mwb33@drexel.edu
Office: University Crossings 138
Extention: 2158952347
Office Hours: Mon. 45pm, Tues. 24pm, Wed. 45pm
Teaching Assistant(s)
No One :(
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 or no 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
None
What Students Should Know Prior to this Course
What Students will be able to do upon Successfully Completing this Course:
Textbook
Algorithms (4th Edition)
Robert Sedgewick, Kevin Wayne
ISBN10: 032157351X
ISBN13: 8601400041420
See it on Amazon
Also available through the Drexel Bookstore
Supplemental Texts
Book of Proof (Second Edition)
Richard Hammack
Paperback: ISBN 9780989472104
Hardcover: ISBN 9780989472111
Available for Free online at: http://www.people.vcu.edu/~rhammack/BookOfProof/
Introduction to Theory of Computation
Anil Maheshwari and Michiel Smid
Available for Free online at: http://cglab.ca/~michiel/TheoryOfComputation/
Assignments
All homework assignments will be submitted electornically through learning.drexel.edu. The majority of assignments will be written. Some programming will be required late in the term. Written assignments must be submitted as PDFs. You may use any software to create a PDF, but the submitted file must be a PDF to be graded.
Tests
Tests will be completed through learning.drexel.edu. Tests will be posted online for approximately one week. A test will have a fixed time limit. The time limit will start when the student downloads the test. The answers much be submitted during the open period. The test may be started during the midterm week.
Lectures
Lectures will be recorded and posted to Echo360 Accessible through learning.drexel.edu.
Discussion Boards
A discussion board will be created in Piazza for students and linked in learning.drexel.edu. Students from both sectiosn will have access to the same discussion board.
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.
Academic Honesty Policy
The CCI Academic Honesty policy is in effect for this course. Please see the policy at http://drexel.edu/cci/resources/currentstudents/undergraduate/policies/csacademicintegrity/ .
Submitting Assignments
Assignments will be submitted to learning.drexel.edu by 11:59PM on the date they are due. Grades will be reported via learning.drexel.edu.
Written Assignments must be submitted as PDFs. They may be typed or scanned, but only PDF files will be accepted.
Assignments and exams will be returned on a regular basis to provide feedback to students.
Assignments may be submitted late at 10% penalty per day UNTIL 6pm on the first Monday following the due date. Selected assignment answers will be reviewed in class. Once the answers have been shown in class, the homework may no longer be submitted.
Special Circumstances: If you have a documented reason why you cannot submit a homework by the cutoff deadline, a special exception may be made. The Professor may also wave the late submission penalty for documented special exceptions.
Computer/Software Help
iCommons: http://drexel.edu/cci/about/ourfacilities/rushbuilding/iCommons/
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
Tentative Course Schedule
Please see the appropriate assignment webpages for a detailed description of course deliverables.
Week  Topic  Reading  Assignment 
1 (9/19/16)  Analysis of Algorithms  Chapter 1.4  
2 (9/26/16)  Proofs by Induction and Boolean Algebra  Chapter 2 and Chapter 10 from Book of Proof Second Edition by Richard Hammack. PDFs of both chapters are included in lectures area of learning.  
3 (10/3/16)  String Matching and Regular Expressions  Chapter 5.4  HW1 Due Monday 11:59PM 
4 (10/10/16)  No Lecture  Columbus Day  HW2 Due Monday 11:59PM  
5 (10/17/16)  Context Free Grammars  Introduction to Theory of Computation Chapter 2 2.12.5 pg 2147 Chapter 3 3.13.3 pg 91103 
HW3 Due Monday 11:59PM 
6 (10/24/16)  Midterm Online  No Class  
7 (10/31/16)  Turing Machines  Chapter 4 pg 137152 Chapter 5 5.1.5  pg 162164 

8 (11/7/16)  Mergesort and Quicksort  Chapters 1.31.4  HW4 Due Thursday 11:59PM 
9 (11/14/16)  Trees  Binary Search Trees and Heaps  Chapter 3.2 and 2.4  
10 (11/21/16)  Graphs  Undirected and MST  Pages: 51852, 524525, 530537, 604609, 616619, 624629  HW5 Due Monday 11:59PM 
11 (11/28/16)  Graphs  Directed and Shortest Paths  Pages: 538542, 566575, 638640, 646648, 652657  No HW for Thanksgiving! 
12 (12/5/16)  Final Online  No In Class Events this week  HW6 Due Monday 11:59PM 