CMPT 126: Introduction to Computing Science and Programming Fall 2007, Harbour Centre

Transcription

1 CMPT 126: Introduction to Computing Science and Programming Fall 2007, Harbour Centre Tamara Smyth, School of Computing Science, Simon Fraser University July 27, 2011 Meeting Time and Place Course Information Time Location (Harbour Centre) Section Lecture: TuTh 7:00PM-8:20PM HCC 1535 All Lab: W 6:30PM-8:20PM HCC 1330 E100 Course Description This course is a rigorous introduction to computing science and computer programming, suitable for students who already have some programming experience. It is a condensed version of the two-course sequence CMPT 120/CMPT 125. Students will learn fundamental concepts of computing science as well as develop basic skills in software development. Topics Elementary programming: data types and control structures Fundamental algorithms, and problem solving Abstract data types, elementary data structures Basic object-oriented programming and software design Elements of empirical and theoretical algorithms Computability and complexity Specification and program correctness 1

2 Grading Grading will be based on a combination of assignments, lab exercises, and exams. Details will be finalized in the first week of lectures, but are tentatively as follows: Labs 10% (1% for each lab) Midterm 20% (in class, week 7) Assignments 30% (in the form of 3 programming projects) Final Exam 35% (during the final exam schedule, TBA) Class Participation 5% Required texts Java Software Solutions, 5th edition, John Lewis and William Loftus, Addison-Wesley, 2007: note isbn CMPT 126 Course notes : available on-line. Office Hours Office hours with the instructor: after class or by appointment Office hours with the TA: TBA Prerequisites Students should feel comfortable writing small computer programs in some general purpose programming language. Students must consult with the self-evaluation on the Computing Science web site ( to decide whether they should follow the CMPT 120/125 course sequence or enroll in CMPT 126. Schedule and Online Lecture Notes Reading assignments for each class are specified and refer to the textbook, Java Software Solutions (JSS), 5th edition, unless otherwise indicated. Introduction Read Chapter 1 of JSS Course Overview Understanding the Computer CMPT 126: Introduction to Computing Science and Programming 2

3 Intro to Java programming Data and expressions: Read Chapter 2 of JSS Character strings Variable assignments Primitive data types and Expressions Program interaction: input and output (i/o) Control Structures: Conditionals and Loops: Read Chapter 5 of JSS Boolean expressions The if, switch, for, do, and while statements Comparing data Using Classes and Objects: Read Chapter 3 of JSS Creating objects in Java Using Java packages Create a simple GUI Creating a class: encapsulation, methods and constructors Arrays: Read Chapter 7 of JSS Writing Classses: Read Chapter 4 of JSS LayoutDemo.java: BorderPanel.java: FlowPanel.java: GridPanel.java: BoxPanel.java: IntroPanel.java: Fundamental Algorithms and Complexity: Sort and Search: Read Chapter 9 of JSS, sections 4 and 5 Implement other basic array functions, such as sum, min, max, etc. Implement insertion sort and selection sort on an array. [9.4] Implement linear search and binary search on an array. [9.5] Profiling algorithms CMPT 126: Introduction to Computing Science and Programming 3

4 Use O-notation to describe the worst case, average case and best case runningtimes of simple algorithms. Recursive Algorithms Read Chapter 11 of JSS. Recursion Towers of Hanoi Merger Sort Abstract Data types Read Chapter 12 Collections Dynamic Representation Object-Oriented Design Read Chapter 6 OOP: Static keyword, class relationships, interfaces, this reference Identify and differentiate classes and objects Use static and non-static class data and methods Understand class relationships Inheritance Read Chapter 8 Class hierarchies Polymorphism Read Chapter 9 Exception Handling Read Chapter 10 Review Labs Labs will be held every Wednesday and attendance is mandatory. Lab assignments will be explained at the beginning of the lab and may either be handed in at the end of the lab, or if the TA agrees there wasn t enough time to complete the lab in one session, the following week. Some labs may require a little homework. Some labs will allow for time to work on the larger assignments. In general, the marker will check the following: Source code is neatly and consistently formatted; Variables, class, and method names are sensible and easy to understand; All functions have documentation; CMPT 126: Introduction to Computing Science and Programming 4

5 The program is well-structured and not unnecessarily complicated; The output is exactly as shown Assignments Date Lab Sept. 12 lab1.ps / lab1.pdf. You will need the file asteroids.zip. Sept. 19 lab2.ps / lab2.pdf. Sept. 26 lab3.ps / lab3.pdf. Oct. 3 lab4.ps / lab4.pdf. Oct. 10 lab5.ps / lab5.pdf. Oct 17 lab6.ps / lab6.pdf. Oct. 24 Lab 6 Oct 31 lab7.ps / lab7.pdf. Nov. 7 lab8.ps / lab8.pdf. Nov. 14 lab9.ps / lab9.pdf. Nov. 21 lab10.ps / lab10.pdf. Nov. 28 Complete lab10 and Course Review with TA Assignment 1: a1.ps / a1.pdf. You will need the file csimage beta1.jar Assignment 2: a2.ps / a2.pdf. You will need the file mixed wordlist.zip. Assignment 3: a3.ps / a3.pdf CMPT 126: Introduction to Computing Science and Programming 5