{"id":490,"date":"2013-10-06T17:06:42","date_gmt":"2013-10-06T17:06:42","guid":{"rendered":"http:\/\/josephpcohen.com\/gtfo\/?page_id=2"},"modified":"2015-03-28T18:43:25","modified_gmt":"2015-03-28T18:43:25","slug":"sample-page-2","status":"publish","type":"page","link":"https:\/\/josephpcohen.com\/teaching\/cs210\/","title":{"rendered":"Intermediate Computing with Data Structures CS210"},"content":{"rendered":"

Number CS210, Section: 01Q
\nSemester: Summer 2014
\nPre-requisites: CS110 or CS115L
\nStart-End Dates: 5\/27 \u2013 7\/24
\nInstructor: Joseph Paul Cohen ( joecohen -at- cs.umb.edu )
\nTeaching Assistant: Carla Aravena ( caravena -at- cs.umb.edu )
\nOffice Location: KDLab S-3-159 Map<\/a>
\nOffice Hours: Tuesday 4-5pm
\nCourse Room: M-2-417 ( NOT ROOM M-3-201 )
\nMeeting Time: MoTuTh 6:00PM – 7:30PM
\nLab\/Recitation Location: Web Lab S-3-28
\nLab\/Recitation Hours: Thursday 5-6pm<\/p>\n

DESCRIPTION<\/h5>\n

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. Efficient design, implementation and debugging techniques are stressed. 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. The language of instruction is Java.<\/p>\n

COURSE OUTCOMES<\/h5>\n

Students successfully completing this course will:
\nBe able to use data structures in conjunction with the algorithms required for an efficient program;
\nBe able to use both recursion and iteration in solutions for problems involving repetition;<\/p>\n

TEXTBOOK<\/h5>\n

Algorithms (4th Edition)\u00a0by Robert Sedgewick and Kevin Wayne
\nISBN-13: 978-0321573513 ISBN-10: 032157351X
\nhttp:\/\/algs4.cs.princeton.edu\/home\/<\/a><\/p>\n

GRADING POLICIES<\/h5>\n\n\n\n\n\n
Exams (3 total lowest grade is dropped):<\/td>\n40%<\/td>\n<\/tr>\n
Homeworks\/Projects:<\/td>\n50%<\/td>\n<\/tr>\n
Class participation\/attendance\/contribution:<\/td>\n10%<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
TURNING IN WORK<\/h5>\n

Turn in work by ssh-ing into users.cs.umb.edu and entering your cs210 directory. You can scp your work as well. Any issues email operator -at- cs.umb.edu from your cs.umb.edu account. For an account go to the UNIX\/Linux lab (S-3-159) and ask for the operator. <\/p>\n

FILE FORMATS<\/h5>\n

I will only accept text (.txt,.java,.html, …) files or pdf files.<\/p>\n

LATE HOMEWORK<\/h5>\n

I will only allow one late homework. This homework can be turned in one class late.<\/p>\n

COLLABORATION ON HOMEWORKS<\/h5>\n

You are encouraged to discuss homeworks with other students.
\nPlease only assist other students in finding the answer. Do not give answers to anyone.
\nIf you discussed a homework with someone document this on your homework.<\/p>\n

ACADEMIC DISHONESTY<\/h5>\n

The penalty for cheating is extremely severe. It can result in an F in this course. Cheating consists of, but not limited to:
\n– Using or copying a person’s work (outside class or class member) on an exam or assignment in any fashion.
\n– Allowing your own work to be copied or used by another person.
\n– Submitting as your own work something that has been written by another person.
\n– Using any unauthorized reference on an exam or assignment.
\n– Not acknowledging in writing on an assignment any help you have received.<\/p>\n

SCHEDULE (Subject to change)<\/h5>\n\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t
Week<\/th>Section<\/th>Topic<\/th>Homework\/Exam<\/th>\n<\/tr>\n<\/thead>\n
5\/26<\/td>1.1,1.2,1.3<\/td>Review, Recursion, Programming Model, Data Abstraction, Stacks And Queues<\/td>HW1<\/a> (Due 6\/2 @5pm)<\/td>\n<\/tr>\n
6\/2<\/td>1.4, 2.1<\/td>Analysis of Algorithms (Runtime)<\/td>HW2<\/a> (Due 6\/9 @5:30pm)
\nProject1<\/a> (Due 6\/16 @5:30pm)<\/td>\n<\/tr>\n
6\/9<\/td>2.2, 2.3, 2.4<\/td>Elementary Sorts, Mergesort<\/td>EXAM 1<\/a> (6\/12)<\/td>\n<\/tr>\n
6\/16<\/td>3.1, 3.2<\/td> QuickSort, QuickSelect<\/td>HW3<\/a> (Due 6\/23\/14 @6pm)<\/td>\n<\/tr>\n
6\/23<\/td>3.3, 3.4<\/td> Heaps, Priority Queues, Binary Search Trees<\/td>HW4<\/a> (Due 6\/26\/14 @5:30pm),
HW5<\/a> (Due 7\/1\/14 @5:30pm)<\/td>\n<\/tr>\n
6\/30<\/td>3.5<\/td>Balanced Search Trees, Hash Tables<\/td>HW6<\/a> (Due 7\/7\/14 @5:30pm)<\/td>\n<\/tr>\n
7\/7<\/td>4.1, 4.2<\/td>(Un)directed Graphs, DFS, BFS, Connected components, Topological sort<\/td>HW7<\/a> (Due 7\/14\/14 @5:30pm),
\nHW8<\/a> (Due 7\/15\/14 @5:30pm)<\/td>\n<\/tr>\n
7\/14<\/td>4.3, 4.4, 1.5<\/td>Shortest Paths, Minimum Spanning Trees<\/td>EXAM 2 (7\/14)<\/td>\n<\/tr>\n
7\/21<\/td>5.3<\/td>UnionFind, Substring Search<\/td>HW9<\/a> (Due 7\/24\/14 @6:00pm),
\nFINAL EXAM (7\/24)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n
Resources<\/h5>\n

UNIX Tutorial for Beginners<\/a><\/p>\n

Basic Linux and Package Management<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Number CS210, Section: 01Q Semester: Summer 2014 Pre-requisites: CS110 or CS115L Start-End Dates: 5\/27 \u2013 7\/24 Instructor: Joseph Paul Cohen ( joecohen -at- cs.umb.edu ) Teaching Assistant: Carla Aravena ( caravena -at- cs.umb.edu ) Office Location: KDLab S-3-159 Map Office Hours: Tuesday 4-5pm Course Room: M-2-417 ( NOT ROOM M-3-201 ) Meeting Time: MoTuTh 6:00PM… Read more »<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/pages\/490"}],"collection":[{"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/comments?post=490"}],"version-history":[{"count":2,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/pages\/490\/revisions"}],"predecessor-version":[{"id":542,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/pages\/490\/revisions\/542"}],"wp:attachment":[{"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/media?parent=490"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}