El Paso Community College Syllabus for COSC2336 Programming Fundamendals III Fall 2015

Transcription

1 El Paso Community College Syllabus for COSC2336 Programming Fundamendals III Fall 2015 Instructor s name: Rafael Escalante Ruiz Office: A1312 in Valle Verde Cell phone (call or text): (915) Office phone (office hours only): (915) rescal10@live.epcc.edu Class meeting times: Mon and Wed from 1pm to 2:20pm, on room A1723 Office hours: MW 2:30-4pm; TR 12-1pm and by appointment Class website: I Required Materials I.I Textbook Algorithms, by Robert Sedgewick and Kevin Wayne. Addison-Wesley Professional, 4th Edition, March 19, ISBN: Note Reading and programming assignments will be drawn from the book. You are required to obtain this book for use in this course. Note that photocopied textbooks are a violation of copyright law; any student caught with a photocopied book will be referred to the Dean of Students for discipline. I.II USB Drive This class will use a Linux Virtual Machine extensively. We will use a USB drive to transport the virtual machine. The USB drive must have a capacity of 16GB or greater; a thumb drive is OK (you can find these at around $10 at the bookstore I recommend a drive with fast transfer speeds such as the SanDisk Ultra or SanDisk Extreme), and if you have a portable hard disk lying around that s even better (but don t purchase one just for this class). 1

2 II Prerequisites and Course Objectives Course objectives: This is the third and final course in the fundamental computer science sequence. Students will learn about fundamental data structures and analysis and design of algorithms. Prerequisites: A minimum grade of C in COSC1437. III Course Requirements A letter grade is assigned to each student at the end of the course based on the numerical scores of these activities: Programming assignments 25% Homework and quizzes 15% Partial exams (3 exams, 13% each) Final comprehensive exam 21% Letter grades are assigned according to the following criteria: 90% or higher is an A 80-89% is a B 70-79% is a C 60-69% is a D below 60% is an F I reserve the right to adjust these criteria downward, e.g., so that 88% or higher results in an A, based on overall class performance. The criteria will not be adjusted upward, however. You must earn a C or better to be able to transfer this class. Additionally, any one of the following will result on a final grade of F, even if the overall average is greater than 60%: Obtaining an average of less than 60% on the programming assignments Obtaining a grade of less than 50% on the final exam Obtaining an average of less than 50% on the partial exams Not submitting ALL programming assignments by the end of the semester, even if they are too late to receive credit IV Instructor s Policies Late Work Homework up to a class day late will receive up to 80% of full credit, and it will not be accepted after that. Homework that is turned in late will not be graded immediately. Honors Program I participate in the Honors and Enhanced Honors program. Please contact me if you would like to participate. 2

3 Collaboration Collaboration among students is strongly encouraged. It is OK to: Talk with other students about approaches and ideas. Get ideas and extra information from the internet, books, etc. However, it is NOT OK to: Share code with another student (if a piece of code is submitted by two or more students, both students are guilty of cheating, regardless of who wrote the original code). Use code acquired from an outside source (the internet, a friend, etc.) Look at another student s code Debug another student s code I will use software to detect plagiarized programs and take appropriate disciplinary actions if necessary. Absences It is the students responsibility to make prior arrangements with the instructor if the student is unable to attend class the day of any exam. Exams will be administered at the assigned time and a student will be considered absent if not present at the assigned time. A grade of zero will be given if an exam is not taken and no prior arrangements to take the exam have been made. If prior arrangements have been made, the make-up test will be administered at the instructor s convenience. Past experience by students taking this course has shown that attendance at each class session is essential to stay up with the teaching. It will be the responsibility of the student to obtain lecture notes and assignments for classes that are missed prior to the next class period. Class Drops I will not drop students with failing grades; students should drop themselves from the class if so they desire. I am not able to provide a W grade for students that fail to drop themselves before the deadline. Academic Dishonesty Academic dishonesty shall constitute a violation of rules and regulations and is punishable as prescribed by College Board policies. Academic dishonesty shall include, but not be limited to, cheating on a test, plagiarism, and collusion. I take academic dishonesty extremely seriously. Cheating on an assignment or a test means automatically failing the assignment, test, or group of assignments with an F. Cell Phones Cell phones are prohibited in class. Personal Computing All non-programming or non-note-taking related activities on computing devices (either the schools or your own) are prohibited in the class, including but not limited to , Facebook, Twitter, forum boards, and gaming of any kind. Disabilities EPCC offers services to persons with disabilities to promote success in classes. If you have a disability that may impact your course work, please go to the Center for Students with Disabilities (CSD) to request accommodations. Your needs will be discussed privately with the CSD counselor and then privately with me, your instructor. Disabilities 3

4 covered include but are not limited to learning disabilities, hearing impairment, visual impairment, physical impairment, mental health, or a temporary impairment. The CSD office for Valle Verde is in room C112, with phone number V Goals for the Course Successful students will be expected to: Be able to apply basic software engineering principles: Use version control, construct and run unit tests, and be familiar with the UNIX command line. Apply mathematical skills to evaluate running time of algorithms Choose appropriate data structures to implement algorithms Use efficient algorithms to solve problems such as searching, sorting, and scheduling Solve optimization problems using either dynamic programming or greedy algorithms Apply fundamental graph algorithms such as depth-first search, breadth-first search to applications such as minimum spanning trees, and shortest paths VI Topics Covered 1. Software engineering principles: version control, unit testing, completing basic tasks with the UNIX command line. 2. Introduction to Design and Analysis of Algorithms 3. Growth of Functions 4. Divide and Conquer 5. Sorting Algorithms and their Applications 6. Hash Tables 7. Binary Search Trees 8. Balanced Search Trees: AVL and B Trees 9. Optimization Problems: Dynamic Programming 10. Optimization Problems: Greedy Algorithms 11. Graph Algorithms 12. NP-Completeness VII Student Learning Outcomes Upon successful completion of this course, students will be able to: 1. Describe, implement, and use the following data structures: (a) Heaps (b) Hash tables (c) Balanced trees (d) Graphs (e) Disjoint set forests 2. Describe, implement, and apply the following graph algorithms: (a) Connected components 4

5 (b) Breadth-first search (c) Depth-first search (d) Topological sorting (e) Minimum spanning trees (Kruskal and Primm s algorithms) (f) Single-source shortest paths 3. Trace the behavior of recursive programs using activation records. VIII Calendar Note: This is a tentative calendar. An updated calendar will be available at the class website ( Monday Aug 24th 1 Syllabus & class introduction. VM setup, UNIX command line, IntelliJ. 31st 3 Quiz 1. Homework 1 due. Read: 6. compareto. 7th No Class Institutional Holiday 14th 6 Quiz 3. Stacks and Queues in Practice. 21st 8 Test 1 Review 28th 10 Quiz and 19. Binary Trees, BSTs. Oct 5th 12 Quiz AVLs (handout, applet) and B-trees. Homework 4. 12th Hash Tables. Homework 5. 19th 16 Test 2 26th 18 Graphs and paths. Types, representation and algorithms. Homework 6. Wednesday 26th 2 Math background. Big-O notation and Complexity. Homework 1. Read: 5 Sep 2nd 4 Quiz 2. Sorting Algorithms ( 6). 9th 5 Complexity of operations and Big-O. 16th Implementation, Operations, Complexity and Big-O. 23rd 9 Test 1 30th 11 AVLs. Homework 3. Review 18 and 19 for quiz. Extra credit assignment. 7th 13 Quiz Priority Queues. Heap Sort. 14th 15 Quiz 7. Review for Test 2. 21st 17 Introduction to graphs. 28th 19 Quiz 8. BFS; DFS; Dijkstra s algorithm. 5

6 Monday Nov 2nd 20 Dijkstra s algorithm as a Greedy approach. 9th 22 Disjoint-set data structure (Union & Find) 16th 24 Test 3. 23rd 26 Algorithm design techniques: divide-and-conquer, dynamic programming. 30th 28 TBD Wednesday 4th 21 Quiz 9. MST, Primm s, Kruskal s, connected and strongly connected components 11th 23 Quiz 10. Homework 8. Review for Test 3. 18th 25 Algorithm design techniques: Random algorithms and backtracking 25th 27 Quiz 11. Discussion about the four techniques Dec 2nd 29 Review for final. 6