Class and Office Hours Structural Programming and Data Structures - PDF document

Class and Office Hours Structural Programming and Data Structures Winter 2000 Class: Mondays, Wednesdays and Fridays from 14:00 to 14:50 CMPUT 102: Introduction Dr. Osmar R. Zaïane Office Hours: Tuesdays and Thursdays from 11:00 to 11:45 By appointment: E-mail zaiane@cs.ualberta.ca Tel: 492 7569 University of Alberta  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 1  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 2 2 Course Requirements • Pure Math 30 and CS 30 or equivalent. A basic knowledge of computer programming is required. Students should understand variables, assignment, arithmetic expressions, if statements and loops. Students who do not have a basic knowledge of computer programming should enrol in CMPUT 101. • There are two routes that can be followed to take Computing Science courses, even for students who want to specialize in Computing Science:  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 3 3  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 4 4 Course Objectives Evaluation and Grading The objects of the course are to introduce the students to the Your final grade will depend on the entire profile of the grades in issues of Computer Science problem solving by writing your lecture section and a particular composite score does not computer programs in a high-level programming language guarantee a particular final grade. However, your composite called Java. Students are introduced to concepts and simple score will be computed using the following weights: algorithms and techniques for constructing elegant and robust solutions to problems. • Lab Exercises 10% After completing the course, students should • Assignment 1 5% understand and use the concepts: object, primitive • Assignment 2 5% value, message, method, selection control structure • Lab Examination 10% (if, switch), repetition control structures (while, • Term Examination 1 15% for), variable, object reference, method parameter, • Term Examination 2 20% container (Arrays, Vectors, Stacks etc.), searching, • Final Examination 35% sorting, recursion and inheritance.  Dr. Osmar R. Zaïane, 2000  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 5 5 Structural Programming and Data Structures University of Alberta 6 6 1

More About Evaluation Notes and Textbook Re-examination. Course home page : None, except as per regulation. http://www.cs.ualberta.ca/~zaiane/courses/cmput102/ Collaboration. Textbook : Collaborate on assignments; do not merely copy. Introduction to Programming Using Java: An Object-Oriented Approach, Java 2 Update Plagiarism. by David Arnow and Gerald Weiss. Work submitted by a student that is the work of another student or Addison Wesley, 2000 a tutor is considered plagiarism. Read Sections 26.1.4 and 26.1.5 of the University of Alberta calendar. Cases of plagiarism are immediately referred to the Dean of Science, who determines what course of action is appropriate.  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 7 7  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 8 8  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 9 9  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 10 10 On-line Resources Legend of Link Icons Link to an HTML page (default) Link to a text file • CMPUT 114/102 web page Link to a page to be displayed in a new browser window • Course slides Link to a Portable Document Format (PDF) file Link to a Postscript (PS) file • Web links Link to slides presentation • Glossary Link to a compressed (gz or zip) file Link to an image • Student submitted resources Link to a video • Student spaces Link to a C/C++ program listing Link to a Java class file • U-Chat Link to a data file • Frequently asked questions Link to password protected html page Link to a page under construction  Dr. Osmar R. Zaïane, 2000  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 11 11 Structural Programming and Data Structures University of Alberta 12 2

Course Schedule Course Content (Tentative, subject to changes) There are 14 weeks from January 10 th to April 12 th . • Introduction • Vectors Week 7 is reading week (Feb. 21-25) • Objects • Testing/Debugging • Methods • Arrays There are 9 lab exercises ( one each week ) • Tracing Programs • Searching One lab exam week 11 • Object State • Files I/O Assignment 1 distribution week 5 • Sharing resources • Sorting Assignment 1 due week 9 • Selection • Inheritance Assignment 2 distribution week 8 • Repetition • Recursion Assignment 2 due week 12 Midterm 1 week 6 Midterm 2 week 10 Final Exam Week 15 (April 19)  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 13 13  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 14 14 Course Content Quick Tour of the Course • Introduction • Vectors Web Site • Objects • Testing/Debugging • Methods • Arrays • Tracing Programs • Searching • Object State • Files I/O • Sharing resources • Sorting • Selection • Inheritance • Repetition • Recursion http://www.cs.ualberta.ca/~zaiane/courses/cmput102/ Lecture 1 – Lecture 2 – Lecture 3  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 15 15  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 16 16 Objectives of Lecture 1 Outline of Lecture 1 A Simple Java Application A Simple Java Application • Get a rough initial idea about the • Kinds of Java programs programming process by: • Run Adventure Version 8 – Creating and running a simple Java application. • Code Warrior application demonstration – Using a programming environment to create • Review - (Edit, Compile)+, Load, Run and run the application. • Application template • There is no need to try to understand any of • Write Adventure Version 0 the code.  Dr. Osmar R. Zaïane, 2000  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 17 Structural Programming and Data Structures University of Alberta 18 3

Kinds of Java Programs Outline of Lecture 1 • There are three kinds of Java programs: – Applications • Kinds of Java programs – Applets – Libraries • Run Adventure Version 8 • An application is a Java program that is run by • Code Warrior application demonstration using a Java interpreter program. • Review - (Edit, Compile)+, Load, Run • An applet is a Java program that is run by a • Application template Java-enabled web browser. • Write Adventure Version 0 • A library is a set of Java classes that can be used by another Java program.  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 19  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 20 The Adventure Application Try Adventure Version 8 • We will write an application called the Arithmetic Adventure game in these lectures. • Start Code Warrior. • Open an existing project called Adventure8. • We will use it as a running example throughout the course, slowly adding • Run. functionality to it.  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 21  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 22 Demonstration Application Outline of Lecture 1 • Start Code Warrior. • Create a new project called Adventure0. • Kinds of Java programs • Open the java source file. • Run Adventure Version 8 • Edit the code. • Code Warrior application demonstration • Save as… Adventure.java • Review - (Edit, Compile)+, Load, Run • Java Application Settings - Java Target. • Application template • Make. • Write Adventure Version 0 • Run. • Demonstrate a compilation error.  Dr. Osmar R. Zaïane, 2000  Dr. Osmar R. Zaïane, 2000 Structural Programming and Data Structures University of Alberta 23 Structural Programming and Data Structures University of Alberta 24 4