Dr. David Matuszek Spring, 2003

Slides:



Advertisements
Similar presentations
Intro to CIT 594
Advertisements

John Hurley Cal State LA
Lecture 1: Overview CMSC 201 Computer Science 1 (Prof. Chang version)
Introduction to Computer Programming I CSE 113
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
10-Jun-15 About This Course. 2 MCIT Pizza 6:15 Thursday, Sept. 9 Levine 307.
Intro to CIT 594
1 Intro to CIT 594 ~matuszek/cit594.html.
Intro to CIT 594
Slide 1 CS3 Fall 2005 Lecture week 13: Introduction to the Big Project.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
Intro to CIT 594 ~matuszek/cit594.html.
Intro to CIT 594
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
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.
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
CS1201: Programming Language 2 C++(Course Introduction) Level 2 Nouf Aljaffan 1 st Term Nouf Aljaffan (C) CSC 1201 Course at KSU.
17-Dec-03 Intro to CIT 594 ~matuszek/cit594.html.
Bilgisayar Mühendisliği Bölümü CENG 102 – Computer Programming Melek OKTAY Syllabus Administrative Information.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
CMSC 2021 CMSC 202 Computer Science II for Majors Fall 2002 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
Lecture 1 Page 1 CS 111 Summer 2013 Introduction CS 111 Operating System Principles Peter Reiher.
Software Development CSCI-1302 Lakshmish Ramaswamy.
OO Data Structures SE Dr. Samir Tartir 2010/2011 Second Semester.
Intro to CIT 594
Lecture 1: Overview CMSC 201 Computer Science 1. Course Info This is the first course in the CMSC intro sequence, followed by 202 CS majors must pass.
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)
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
CSC 205 Java Programming II Introduction. Topics Syllabus Course goals and approach Review I Java language fundamentals.
Data Structures and Algorithms in Java AlaaEddin 2012.
CSc 120 Introduction to Computer Programing II
Course Overview - Database Systems
CSE 102/ISE 102 Introduction to Web Design and Programming
CS101 Computer Programming I
MATH/COMP 340: Numerical Analysis I
UMBC CMSC 104 – Section 01, Fall 2016
Chapter 7: User-Defined Functions II
Course Introduction – Fall 2014
CSc 020: Programming Concepts and Methodology II
Computer Science 102 Data Structures CSCI-UA
September 27 – Course introductions; Adts; Stacks and Queues
CS 201 – Data Structures and Discrete Mathematics I
CS 201 – Data Structures and Discrete Mathematics I
Course Overview - Database Systems
Introduction to Data Structures
CS212 Data Structures 2018 Second Semester.
Organizational Issues
Review for Final Exam.
Introduction to Programming Using C++
CS2013 Lecture 1 John Hurley Cal State LA.
Intro to CIT 594
Academic Integrity in CS 18000
Computer Programming 1 introduction to JAVA Lecture 1 Instructor: Ruba A. Salamah Islamic University of Gaza.
About This Course.
Review for Final Exam.
Tonga Institute of Higher Education IT 141: Information Systems
Organizational Issues
ECE 103 Engineering Programming Chapter 1 Introduction
CS2013 Lecture 1 John Hurley Cal State LA.
Intro to CIT 594
Intro to CIT 594
EECE.3220 Data Structures Instructor: Dr. Michael Geiger Spring 2017
Tonga Institute of Higher Education IT 141: Information Systems
CS Problem Solving and Object Oriented Programming Spring 2019
CS2013 LECTURE 1 John Hurley Cal State LA.
Presentation transcript:

Dr. David Matuszek Spring, 2003 Introduction to CSE121 Dr. David Matuszek Spring, 2003

About CSE121 Content of the course Textbooks Assignments, exams, grading Academic honesty

Course Content I: Overview This is a course in data structures We will use the Java language throughout Our focus is on programming Our focus is not on the Java language itself Our main topics will be “Pointer pushing,” that is, building and using complex data structures Information hiding, for better program design Recursion, a powerful programming technique Analysis of programs, using “big-O” notation

Course Content II: About Java Java is: A very large and complex programming language But it is also: A very popular, practical, “real world” language CSE121 is about data structures and algorithms CSE121 uses Java, it isn’t about Java I will teach some Java, but only as necessary You are expected to learn more Java on your own and in the labs

Course Content III: Prerequisites You are expected to know at least this much Java: Basic data types: int, double, char, boolean, etc. The difference between a class and an object The statement types: Variable declarations Assignment statements for, while, and do...while loops if, if...then, and switch statements try...catch...finally statements How to write and call simple methods, such as println

Textbooks Our main textbook is “Data Structures & Algorithms in Java (Second Edition),” by Robert Lafore This is an extremely lucid textbook The analysis part will need to be supplemented Our secondary textbook is “The Java Tutorial, Third Edition: A Short Course on the Basics,” by Mary Campione, Kathy Walrath, and Alison Huml This is pretty good as a textbook Sections are relatively independent, so it’s a very good book for when you need to learn about some particular language feature

Assignments There will be approximately one programming assignment per week Assignments will be submitted and returned the same way as was done last semester Assignments will be graded on: Whether it works (non-working assignments are automatically worth zero) Programming and commenting style How well you read and followed the instructions All assignments will be available on the Web

Exams There will be two “midterms” and a final Midterms will be 20% worth each The final will be 20% The remaining 40% of your grade will be from your programming assignments All exams will be cumulative!

Grading Exams will be difficult; the average will probably be less than 70% Programming assignment grades are expected to be substantially higher, with an average over 90% If you believe a grading error has occurred, you have one week from the time the work is returned to request a regrade Follow instructions on the “Grades” web page Spring break and snow days will not be counted All grades will be curved That is, it is not necessarily the case that 90% is an A, 80% is a B, or whatever scheme you are used to I expect roughly 1/4 As, 1/2 Bs, 1/4 Cs, and a few Fs

The Rules You may: You may not: Things to be especially careful about: discuss the assignments with one another help others debug their work use anything from the course textbooks or the course Web site You may not: work together on the same program copy another person’s code allow your code to be copied use any code from other textbooks or Web sites without permission Things to be especially careful about: Do not “lend” your programs, in any form, to anyone Do not ask to “borrow” someone else’s program Do not leave your programs where someone else may find them If you accidentally lose a diskette or listing, inform your TA at once If you are helping someone else, you can explain and show examples, but do not write any code for them

Consequences Anyone caught cheating will be reported to the Office of Student Conduct and will receive an F in the course There will be no second chances Dealing with cheating cases takes up a lot of our time which we would prefer to spend improving the course for honest students If you need to cheat, you will never do well in this field and will probably never be happy in it You should be aware: I am very good at catching cases of academic dishonesty I have never lost a case If you have lost a diskette or program listing, or think you may have accidentally broken a rule, tell your TA

The End