CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections 0101-0104 Ms. Susan Mitchell.

Slides:



Advertisements
Similar presentations
Intro to CIT 594
Advertisements

COMP171 Data Structures and Algorithms Spring 2009.
COMP171 Data Structures and Algorithms Spring 2009.
June 13, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
General information CSE 230 : Introduction to Software Engineering
CMSC 132: Object-Oriented Programming II
CSCE156: Introduction to Computer Science II Instructor Stephen Scott Website
CMSC 132: Object-Oriented Programming II Nelson Padua-Perez William Pugh Department of Computer Science University of Maryland, College Park.
CSc 160 Overview of Fundamentals of Computer Programming II Spring (SO1) 2004.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
Topic R3 – Review for the Final Exam. CISC 105 – Review for the Final Exam Exam Date & Time and Exam Format The final exam is 120-minutes, closed- book,
COMP152 Object-Oriented Programming and Data Structures Spring 2011.
7/3/2015Data Structures and Algorithms1 Dick Steflik Fall 2012.
CSCE 3110 Data Structures and Algorithm Analysis.
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.
COMP 151: Computer Programming II Spring Course Topics Review of Java and basics of software engineering (3 classes. Chapters 1 and 2) Recursion.
WEEK 1 CS 361: ADVANCED DATA STRUCTURES AND ALGORITHMS Dong Si Dept. of Computer Science 1.
Data Structures, Algorithms, and Generic Programming Course Introduction Zhenhai Duan COP 4530/CGS 5425.
© 2004 Goodrich, Tamassia CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler.
Data Structures and Programming.  Today:  Administrivia  Introduction to 225, Stacks  Course website: 
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
CSc 2310 Principles of Programming (Java) Dr. Xiaolin Hu.
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
COMPE 226 Data Structures 2015 Fall Murat KARAKAYA Department of Computer Engineering.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Course ‘Data structures and algorithms – using Java’ Teaching materials and presentation experience Anastas Misev Institute of Informatics Faculty of Natural.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
CS 140 Computer Programming (I) Second semester (3 credits) Imam Mohammad bin Saud Islamic University College of Computer Science and Information.
Bilgisayar Mühendisliği Bölümü CENG 102 – Computer Programming Melek OKTAY Syllabus Administrative Information.
1 CSC 222: Computer Programming II Spring 2004 See online syllabus at: Course goals:
Data Structures (Second Part) Lecture 1 Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.
Introduction to Data Structures
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
1 WELCOME TO COMPUTER SCIENCE 1027b COMPUTER SCIENCE FUNDAMENTALS II Lecturers: Eric Schost (001) John Barron (002)
COMP2012 Object-Oriented Programming and Data Structures Fall 2015.
Course Information Sarah Diesburg Operating Systems COP 4610.
CMSC 2021 CMSC 202 Computer Science II for Majors Fall 2002 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
ICS102: Introduction To Computing King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science.
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
Introduction to ECE 2401 Data Structure Fall 2005 Chapter 0 Chen, Chang-Sheng
OO Data Structures SE Dr. Samir Tartir 2010/2011 Second Semester.
IST 210: Organization of Data
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
Intro to CIT 594
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2001 Sections Ms. Susan Mitchell.
1 Data Structures COP 4530 Spring 2010 MW 4:35 PM – 5:50 PM CHE 101 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2003 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
COMP1927 Course Introduction 16x1
CSC 205 Java Programming II Introduction. Topics Syllabus Course goals and approach Review I Java language fundamentals.
Course Info Instructor U.T. Nguyen Office: CSEB Office hours: Tuesday, 14:30-15:30 Thursday, 12:00-12:45 By.
Data Structures and Algorithms in Java AlaaEddin 2012.
Principles of Imperative Computation Lecture 1 January 15 th, 2012.
CMPT 238 Data Structures Instructor: Tina Tian. General Information Office: RLC 203A Office Hour: Tue and Fri 12:30 - 2:00PM.
Andy Wang Object Oriented Programming in C++ COP 3330
Computer Engineering Department Islamic University of Gaza
CSc 1302 Principles of Computer Science II
CSc 020: Programming Concepts and Methodology II
Computer Science 102 Data Structures CSCI-UA
September 27 – Course introductions; Adts; Stacks and Queues
FINAL EXAM INFORMATION
FINAL EXAM INFORMATION
Andy Wang Object Oriented Programming in C++ COP 3330
Intro to CIT 594
Introduction CSE 2320 – Algorithms and Data Structures
CSCE156: Introduction to Computer Science II
Presentation transcript:

CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell

CMSC 2022 Course Prerequisites CMSC 201, Computer Science (grade of B or better) MATH 151, Calculus I (grade of C or better)

CMSC 2023 CMSC Gateway Warning! If you started your college education in Summer 1998 or later you are under the “CMSC Gateway” and must complete CMSC 201 and CMSC 202 with a grade of B or better. Because of the registrar’s rules regarding class sequences, students who received a C in CMSC 201 must retake CMSC 201 before taking CMSC 202. If you choose not to retake CMSC 201 or do not retake it before taking CMSC 202, you cannot graduate as a computer science major.

CMSC 2024 Enrolling in a Closed Section Fill out a “Closed Section Request Form” (pick up after class). Fill it out completely. Attach a transcript. Put it under my office door (ECS 225-L) or ask the receptionist in ECS 210 to put it in my mailbox by noon tomorrow. I will announce who may add the class at Thursday’s lecture. You will then need to register for the class.

CMSC 2025 Prerequisite Skills In order for you to maximize your chance for success in CMSC 202, you must have the following skills NOW.

CMSC 2026 Prerequisite Skills (con’t) Fluency in C or C++. This means: – Basic data types (int, float, char) – Control structures (if-else, while, for, do, switch) – Arithmetic, relational, and logical (Boolean) operators – Arrays (single and multi-dimensional)

CMSC 2027 Prerequisite Skills (cont’d) – Compound data types (struct) – Functions and parameter passing (by value and by reference) – Header files (e.g., string.h) – Stream I/O – File I/O (sequential access files) – Strings – Pointers

CMSC 2028 Prerequisite Skills (cont’d) – Creating working programs (designing, coding, compiling, linking, debugging) – Working with multi-file programs (separate compilation) – Program commenting and formatting – Top down design (problem decomposition/stepwise refinement)

CMSC 2029 Prerequisite Skills (cont’d) Familiarity with: – Abstract data types (ADTs) – List, stack, and queue ADTs – Singly-linked linear lists – Sorting and searching

CMSC CMSC 202 Overview Object-oriented design and programming techniques More in-depth coverage of: – Sorting and searching – Pointers and dynamic memory allocation – Abstract data types (ADTs) – Separate compilation (makefiles) – List, stack, and queue implementations

CMSC CMSC 202 Overview (con’t) New Topics: – Recursion – Asymptotic analysis (algorithm efficiency) – Error handling and exceptions – Tree data structures (general and binary) – Other?

CMSC CMSC 202 Overview (con’t) C++ syntax This will be accomplished mainly via assigned textbook readings and discussion sections. Some complex C++ topics will be discussed in lecture. C++ code samples will also be used in lecture to illustrate various concepts.

CMSC Course Web Page All materials for this class can be found at: Check the “News and Announcements” frequently.

CMSC Format Changes from CMSC 201 This class (sections ) is completely independent of the other class (sections ). However, there will be a few similarities: –Same topics –Same syllabus (general policies, etc. – see webpage) –Same number of projects and exams –Same semester-end grading system –Same coding standards

CMSC Format Changes from CMSC 201 (con’t) But there are major differences: –We will cover the same topics, but not necessarily in the same order or style. –We will not share lecture or discussion notes (if there are any). –We will have different exams and projects. –Discussion sections will also be different. –We will have different TAs. So, you must attend the lecture and discussion section for which you are enrolled.

CMSC Format Changes from CMSC 201 (con’t) Regular lecture notes will not be posted on the web. References and other material will be posted on an as-needed basis. No exam review questions will be posted on the web.

CMSC Syllabus You are required to read the Syllabus for this class

CMSC Syllabus Overview Textbooks C++: How to Program, by Deitel and Deitel, 3rd edition Grading 5 Projects (10% each) = 50 % 2 Midterm exams (15% each) = 30 % 1 Final exams (20%) = 20 % You have exactly one week after a grade is received to discuss your grade with me.

CMSC Syllabus Overview (con’t) Final grades will be determined as follows: 90 <= A <= 100 % 80 <= B < 90 % 70 <= C < 80 % 60 <= D < 70 % 0 <= F < 60 % Final grades will not be curved. Don’t ask. A grade of “I” (Incomplete) will only be given under dire circumstances.

CMSC Syllabus Overview (con’t) Midterm Exams Not cumulative, but you must be able to apply the knowledge from previous exams Final Exam Cumulative

CMSC Syllabus Overview (con’t) Programming Projects – Do your own work!!! – Are checked against all other students’ projects – Submitted electronically Project 0 to test that submission works is mandatory – Projects are due at midnight (not 1second after!) on the due date – If ResNet or your personal connection goes down, get into the lab to complete your project! – The system does go down -- no excuse!

CMSC Syllabus Overview (con’t) Every project will have a design component worth 10% of the total project grade. Designs may not be submitted late. You must use the Linux system and the g++ compiler.

CMSC Academic Integrity Please take the time to read the “Letter To My Students” under the Academic Integrity link.