CS 520 Computer Science Foundations - Syllabus

Term and Credits

Spring 2017-2018
3 Credits

Room and Time

Monday 6:00pm-8:50pm University Crossings Room 153

Videos lectures will be provided.

Instructor

Mark Boady
Electronic Mail Address: mwb33@drexel.edu
Office: University Crossings 138
Extention: 215-895-2347
Office Hours: Tuesday 2-4PM, Wednesday 3-5PM, Thursday by Appointment

Teaching Assistant(s)

Phuc Ngo
Electronic Mail Address: ptn32@drexel.edu
Office: Drexel CLC UC 152
Office Hours:Wed 6-8PM
https://www.cs.drexel.edu/clc

Reza Moradinezhad
Electronic Mail Address: rm976@drexel.edu
Office: Drexel CLC UC 152
Office Hours: Wed 12-2PM, Thursday 6-8PM
https://www.cs.drexel.edu/clc

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

1. Learn to analyze the running time of iterative and recursive algorithms.
2. Learn to prove properties of algorithms and data structures using induction.
3. Gain familiarity with basic data structures and algorithms related to them, such as trees and graphs.
4. Learn the limits and applications of regular expressions, context free grammars, and turing machines.
5. Learn relationships between languages and automata.
6. Learn to use logic to prove properties of algorithms.

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

1. Ability to read and understand code.
2. Basic understanding of program execution.

What Students will be able to do upon Successfully Completing this Course:

1. Students will be able to analyze algorithms.
2. Students will understand a set of fundamental algorithms and how to apply them.
3. Students will be able to prove properties of algorithms using induction, proof by contradiction, and predicate logic.
4. Students will be able to apply regular expressions and context free grammars to parse strings.
5. Students will be able to determine the applications and limits of data structures, algorithms, and languages.

Textbook

We will use free resources for this class.

Book of Proof (Second Edition)
Richard Hammack
Paperback: ISBN 978-0-9894721-0-4
Hardcover: ISBN 978-0-9894721-1-1
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/

Supplemental Texts

If you want a textbook about the Algorithms we will be studying, I recommend this one. It is not required. I just think its a great resource.

Algorithms (4th Edition)
Robert Sedgewick, Kevin Wayne
ISBN-10: 032157351X
ISBN-13: 860-1400041420
See it on Amazon

Course Material

Lectures

• Prerecorded videos will be posted for each lecture in learning.drexel.edu

Labs

• In Class Students must attend labs in person. Labs may be completed online, but must be started in class.
• Online Students will complete labs entirely online.
• Labs will be completed using an online autograding system.
• You may talk to/work with any other students during Labs.
• You may use any resources you will to complete labs.
• You may get assistance for the Professor and TAs on labs.

Presentatations

• You may use any resources to find content for presentations.
• You may work with other students to find content for presentations.
• You must prepare you slides independently.
• You must record your presentation individually.
• Presentations must be uploaded to the learning.drexel.edu as a forum post.

Presentation Reviews

• Presentations Reviews are to be completed independently.
• Your review will only be seen by the Professor and TAs.

Final Exam

• 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 answers much be submitted during the time limit.
• The test may be started at any point during the week.

Slack Channel

• This term, we will be using a Slack channel instead of a discussion board. If you don't receive an email to join the channel, email the Professor.

Late Submissions

• Each student has two "late passes".
• A student may exchange one of their late passes for an one day extention on any assignment.
• Contact the TA/Professor to request one of your late passes be used.
• You may use both late passes of the same assignment to get a 2 day extention.

Special Circumstances

• If you have a documented reason why you cannot submit an assignment by the deadline, a special exception may be made. The Professor may also wave the late submission penalty for documented special exceptions.

Course Policies

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,

• Failing grade for class
• Deduction of one letter grade
• Zero on Assignment/Exam Violation took place on

Grading and Policies

• Lab Assignments 30%
• Presentations 30%
• Presentation Reviews 15%
• Final Exam 25%

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.

• [100-97]A+
• (97-93] A
• (93-90]A-
• (90-87]B+
• (87-83] B
• (83-80]B-
• [80-77]C+
• (77-73] C
• (73-70]C-
• (70-67]D+
• (67-60]D
• (60-0]F

Computer/Software Help
iCommons: http://drexel.edu/cci/about/our-facilities/rush-building/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:

• Academic Honesty: http://www.drexel.edu/provost/policies/academic_dishonesty.asp
• Judicial Affairs Academic Integrity: http://drexel.edu/studentlife/community_standards/facultystaff/integrity/
• Official Final Exam Schedule: http://www.drexel.edu/registrar/scheduling/exams/
• Students with Disability Statement: http://drexel.edu/oed/disabilityResources/overview/
• Course Drop Policy: http://www.drexel.edu/provost/policies/course_drop.asp
• The instructor may, at his/her/their discretion, change any part of the course during the term, including assignments, grade brakdowns, due-dates, and the schedule. Such changes will be communicated to students via the course web site Announcements page. This page should be checked regularly and frequently for such changes and announcements. Other announcements, although rare, may include class cancellations and other urgent announcements.
• Drexel Student Learning Priorities: http://www.drexel.edu/provost/irae/assessment/outcomes/dslp/

Topics

1. Graphs
2. Searching
3. Sorting
4. Proof Methods
5. Computational Models: DFA, CFG, Turing Machines

Tentative Course Schedule

Please see the appropriate assignment webpages for a detailed description of course deliverables.