SAMPLE. COS 161 Algorithms in Programming. Prof. Briggs Fall 2017

Transcription

1 COS 161 Algorithms in Programming Prof. Briggs Fall 2017 Office: Science 220, Portland Phone: Office hours: Tues/Thurs 1:00-2:30 and by appointment website: cs.usm.maine.edu/~briggs/webpage/fall2017.html Tutor Schedule is at Text: Reges and Stepp, Building Java Programs, Second Edition or third edition or fourth edition, if you like spending money; The third edition apparently has more material on stacks and queues, and a section on recursive backtracking but the second edition will be much cheaper and is adequate; I think you can find the second edition as a pdf online. Readings here are listed as for the second edition, and where the third has more material, it is given as Third(sections) in listings below More information about the differences is available at Supplementary material is available at the website for this course.

2 Other references: for Java: Oracles's site, Sestoft, Java Precisely, 3rd Edition(this is a concise account of the main features of the Java language with many good examples; highly recommended) for data structures: Weiss, Data Structures and Problem Solving Using Java for stacks and queues: en.wikipedia.org/wiki/stack_(data_structure) en.wikipedia.org/wiki/queue_(data_structure) Prerequisites: COS 160, some familiarity with using the net(if we ask you to do something, and you don't know how to do it, just ask us for help) Requirements: 14 lab exercises - 10% programming projects - 45% midterm exam - 20% final exam - 25% There will be five programming projects. Some class time will be given to discussing the assignments and responding to your questions, although it is not explicitly scheduled below. NOTE: submitted work must compile w/o syntax errors. I do not give credit for work that does not compile.

3 Due dates for the projects will be(always Saturdays and always at 8 AM) 9/9 Project 1, Part 1 9/23 Project 1, Part 2 10/7 Project 2 10/28 Project 3 11/11 Project 4, Part 1 11/25 Project 4, Part 2 12/9 Project 5 We will meet in the lab in Luther Bonney every Thursday after the lecture period. Those meetings provide an opportunity for you to solve simple problems under my supervision. There will be fourteen assigned lab exercises that will be graded. Students will work in teams of two or three on the exercises. Each team will submit one result and members of the team will receive the same grade. The grade is binary, either 0 or 1. These labs will collectively count for ten points of your final grade. The labs are intended as practice exercises and if you show up and make some headway on the lab, you will receive the point. Many are light, but the recursion labs are critical for learning how to design recursive solutions to problems. Note that the website contains both notes files and example programs illustrating Java features and programming concepts. Both are listed roughly in the order in which the course will use them.

4 Schedule of Lectures: The lecture topics, associated readings,and estimated dates for the lectures are given below. An entry such as Capetian Monarchs (3) /4-10/ Medieval Kingship (vassalage) means that we will spend 3 class periods discussing the Capetian kings of France, that the relevant readings are sections 1 through 6 and 9 of chapter 7 of the Reges and Stepp text, and the notes file on Medieval Kingship, and the example program on vassalage. We expect to cover the material from October 4 through October 13. Although the lectures may not follow this schedule exactly, the dates for the midterm examination is fixed(barring weather events). Topics Readings Dates Java Review(2) 1-7 8/29-8/31 Java Review Text File Techniques (Type Test Static Versus Instance) Two Dimensional Arrays(2) 7 9/5-9/7 Array Processing Techniques (Simple Table Example, arrayexamples)

5 The Eclipse integrated Eclipse 9/12 development platform(1) Notes(I-III) Modeling and Classes(3) 8 9/14-9/21 (Date.java Rational.zip) Inheritance, Multiple 9 9/26-10/3 Inheritance, and Interfaces; Dynamic(late) binding(3) Subtypes and Inheritance (Vessel Example Constructor Example Dynamic Dispatch Example) Abstract type constructions: 10 10/6-10/19 Products, Sets, Multisets, & Lists; Array implementatons Type Constructors:... of lists(3) Designing Classes =====> MIDTERM EXAMINATION(1) -- 10/17 Linked implementations of Lists /24-10/26 Nested class definitions(2) 16 (Doubly Linked List Example) Other Java Collections: Maps(1) /31 (String Multiset Examples Laboratory Database Example) Recursive algorithms; 12 11/2-11/21 recursing on integers; inductively defined sets(6) Third(12.5) All notes and example programs with

6 "Recursion" or "Recursive" in their titles Algorithm Comparison: 13 11/28-11/30 concepts and techniques; Analyis Notes(I-IV) Sorting and searching (Comparison of Insertion and (2) Merge Sorting Algorithms) Stacks; abstract description Third(14) 12/4 and array and linked implementations(1) Stacks and Queues Queues; abstract description Third(14) 12/6 and array and linked Stacks and Queues implementations(1) General Goals: This course extends the beginning programmer's knowledge of data structures to include array and linked implementations of stacks, queues, and lists, and of algorithms to include fundamental sorting and searching algorithms. These topics are presented in the context of a systematic software development methodology stressing modularity and procedural and data abstraction. Software validation and test data selection criteria are also discussed. The course also introduces several theoretical topics: recursion as a specification technique and a control structure, formal specification of code behavior using assertions, and the rigorous analysis of the time resource consumption of an algorithm.

7 The course extends the student's knowledge of the Java programming language to include its support for the object-oriented concepts of classes, inheritance and dynamic binding of method code, and its parameterized Collection classes. Because communication skills are critical to any individual's success students are encouraged to write carefully and their writing will contribute to their final grade for the course. Students successfully completing the course should be familiar with the fundamental data structures covered and their associated algorithms and should be comfortable with the idea of recursion. They should be able to apply these elements in their practice. They should also have a clear understanding of the goals and methods of precise specification and algorithm analysis.