CSC 213 – Large Scale Programming Prof. Matthew Hertz WTC 207D / 888-2436

Slides:



Advertisements
Similar presentations
MGF1106 Math for Liberal Arts Sections Course website: Lecturer: Jim Wooland Lectures: TR 8:00 – 9:15, 101 HCB Labs: Mondays,
Advertisements

Prof. Matthew Hertz WTC 207D /
1 Math 140 Data Structures and Algorithms Course Overview Lecture # 00 01/20/15.
Today’s Agenda  Syllabus CS2336: Computer Science II.
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
CSC 395 – Software Engineering Prof. Matthew Hertz WTC 207D /
My Policies and Some Advice for Doing Well in this Course.
CSc 160 Overview of Fundamentals of Computer Programming II Spring (SO1) 2004.
Welcome to IIT and cs105!. CS Secs Jon Hanrath SB Office Hours: –MW 8:00 A.M. – 9:45 A.M. –W 5:00 P.M. – 6:00 P.M
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
Math 115b Section 5(Spring 06)  Instructor: Kerima Ratnayaka   Phone :  Office.
My Policies and Some Advice for Doing Well in this Course.
Csc111 :Programming with Java First semester H.
Math 115a– Section 4  Instructor: Kerima Ratnayaka   Phone :  Office : MTL 124B.
Dr. Tatiana Erukhimova [year] Overview of Today’s Class Folders Syllabus and Course requirements Tricks to survive Mechanics Review and Coulomb’s Law.
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
Spring 2008 Mark Fontenot CSE 1341 Principles of Computer Science I Note Set 1 1.
CSC 212 – DATA STRUCTURES Prof. Matthew Hertz WTC 207D /
Prof. Matthew Hertz WTC 207D /
7-Sep-15 Physics 1 (Garcia) SJSU Conceptual Physics (Physics 1) Prof. Alejandro Garcia Spring 2007.
Prof. Matthew Hertz WTC 207D /
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
Welcome to CS 3260 Dennis A. Fairclough. Overview Course Canvas Web Site Course Materials Lab Assignments Homework Grading Exams Withdrawing from Class.
Prof. Matthew Hertz WTC 207D /
Prof. Matthew Hertz SH 1029F /
Course Introduction CSCI Software Engineering II Fall 2014 Bill Pine.
Prof. Matthew Hertz SH 1029F /
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
Course Introduction Software Engineering
Welcome to IIT and cs115!.
Prof. Matthew Hertz WTC 207D /
CSCE 1040 Computer Science 2 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
Announcements  If you need more review of Java…  I have lots of good resources – talk to me  Use “Additional Help” link on webpage.
CSC 110 – Intro. to Computing Prof. Matthew Hertz WTC 207D /
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
Astronomy 114 Lab Section 211, Professor Weigel. Outline for Today About Goals for this class Attendance Syllabus Safety Star Project Apparent vs. Absolute.
Problem of the Day  Why are manhole covers round?
CS 140 Computer Programming (I) Second semester (3 credits) Imam Mohammad bin Saud Islamic University College of Computer Science and Information.
Introduction to Data Structures
COMP2012 Object-Oriented Programming and Data Structures Fall 2015.
CMSC 2021 CMSC 202 Computer Science II for Majors Fall 2002 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
Math 115b Section 3 (Spring 09)  Instructor: Kerima Ratnayaka   Phone :  Office.
Prof. Matthew Hertz WTC 207D /
CSC 213 – Large Scale Programming Prof. Matthew Hertz WTC 207D /
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
Mrs. Fawcett Room 223 Chemistry. Rules Be on time and in uniform Eat before you get here No distractions (cards, music, games, cell phones, etc.) Treat.
CIS 842: Specification and Verification of Reactive Systems Lecture ADM: Course Administration Copyright , Matt Dwyer, John Hatcliff, Robby. The.
CSCE 1030 Computer Science 1 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2001 Sections Ms. Susan Mitchell.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2003 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
Data Structures and Algorithms in Java AlaaEddin 2012.
Mrs. Fawcett Room 223 AP Chemistry. THIS IS A COLLEGE COURSE Hand-holding will be extremely limited. You are solely responsible for your grade. There.
Computer Networks CNT5106C
Math 115a Section 2(Summer 05)  Instructor: Kerima Ratnayaka   Phone :  Office.
Statistics Spring Introduction Dr. Robb T. Koether Office: Bagby 114 Office phone: Home phone: (before 11:00 p.m.) Office hours:
WELCOME TO MICRO ECONOMICS AB 224 Discussion of Syllabus and Expectations in the Class.
Spring 2008 Mark Fontenot CSE 1341 – Honors Principles of Computer Science I Note Set 1 1.
CS140 – Computer Programming 1 Course Overview First Semester – Fall /1438 – 2016/2017 CS140 - Computer Programming 11.
CS101 Computer Programming I
COMP9024: Data Structures and Algorithms
Computer Science 102 Data Structures CSCI-UA
CS 201 – Data Structures and Discrete Mathematics I
CS 201 – Data Structures and Discrete Mathematics I
CS210 Intermediate Programming with Data Structures
EE422C Software Design and Implementation II
Orientation CSC 111.
GC211 Data Structures and Algorithms in Java
Presentation transcript:

CSC 213 – Large Scale Programming Prof. Matthew Hertz WTC 207D /

Items to Discuss Course Goals Administration Syllabus Attendance Extra credit Late work/Make-ups Working together Grades

Course Goals Break down problems:  Design appropriate data structures  Develop appropriate solutions Deepen general facility in programming  Learn rigorous testing methods  Develop stronger debugging skills Develop skills for working in large systems

Textbook Michael Goodrich and Roberto Tamassia: Data Structures and Algorithms in Java, 3rd edition, Wiley, Yes, we are continuing to use this book  Discuss why this book is bad

Course Website c213s06 Contains lecture slides, announcements, quizzes, … Good place to check for information May not include everything said in class

Syllabus Detailed syllabus also on web Lectures will mix discussion of material with practices, exercises, and rockin’ good times

Attendance Class attendance is mandatory  Daily attendance will not be taken You are responsible for everything that happens in class Missing class is not an acceptable excuse Great way to earn a poor grade: skip class

Late work/Make-ups “Date due” means date due  Late work NOT accepted Make-ups will not be offered  Not needed since everyone attends class

Life happens When a catastrophe occurs…  Get a note from the Dean  Be prepared to show some documentation  Talk to the instructor as soon as you can We will find an workable solution

Help! Everyone will fall behind, not understand a detail, and/or have questions  Be mature: ask questions and seek out help  Talk to me so that I can change how I am presenting the material  Use all available resources  DO NOT leave programs to the last moment Best way to fail is to remain silent

Homework and Grading ItemWorth Midterm20% Final30% Homework25% Daily Quizzes10% Lab Grade15% Midterm will be given Mar. 23 th There will be more, smaller projects Daily quizzes will continue – mostly in-class

Homework To receive credit on code exercises:  Programs must compile  Programs must follow style standards  Programs should include some comments To receive credit on problem sets:  Programs should compile, follow style standards, include comments  Can receive significant partial credit for pseudo-code, pictures, explanations…

Programming Environments Continue to use any system you wish  Examples in lectures, labs will use Eclipse Link available on course web page I may be able to burn CDs as well  I really like Eclipse and recommend it

Style Guide Most companies have required style standards that all code must follow  Necessary for working in large systems  Makes code easier to read, follow  Limits problems when working on a team  Prevents many common errors For this semester, you get to use my style guidelines

Indentation Indentation is critical to writing legible code Always indent code within a set of braces Be consistent with your indentation Any guesses as the what the handout computes?

Braces Always use braces, even when not required by Java: for (int i = 0; i < n; i++); sum = sum + i; sumSquare = sumSquare + (i*i);

Braces Always use braces, even when not required by Java: for (int i = 0; i < n; i++); sum = sum + i; sumSquare = sumSquare + (i*i);

Increment/Decrement Operators Do not use the ++ & -- within a line // What gets stored at each line while (++k < n) { a[i++] = (2 * i) + 6; b[j] = (j++ * j) - 1; }

Statements Use variables to break up complex ideas // What is this computing? return ( (year % 4 == 0) && (year % 100 != 0)) || ( (year % 100 == 0) && (year % 400 == 0));

Statements Use variables to break up complex ideas boolean div4 = ((year % 4) == 0); boolean div100 = ((year % 100) == 0); boolean div400 = ((year % 400) == 0); return (div4 && !div100) || (div100 && div400);

Daily Quiz 1. Write the Node class for a binary tree 2. Give me your goals for this term: Get everyone using recursion happily Make class an enjoyable experience Beat my wife a darts

Coding Exercise Write a program that prints out the words to “99 bottles of beer”  Lyrics must be grammatically correct  Cannot use any fields  Cannot output anything from main() Must use other method; this method should accept a parameter Due before class on Jan. 19, 2006