Course Introduction Bryce Boe 2013/09/30 CS24, Fall 2013.

Slides:



Advertisements
Similar presentations
Course Introduction Bryce Boe 2013/06/25 CS24, Summer 2013 C.
Advertisements

TA Orientation Fall 2010 Dr. Jan Chomicki Director of Graduate Studies Department of Computer Science & Engineering
June 13, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
CMSC 132: Object-Oriented Programming II
1 Foundations of Software Design Lecture 1: Course Overview Intro to Binary and Boolean Marti Hearst SIMS, University of California at Berkeley.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
CS 106 Introduction to Computer Science I 02 / 20 / 2008 Instructor: Michael Eckmann.
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
Csc111 :Programming with Java First semester H.
MATH 330: Ordinary Differential Equations Fall 2014.
CENG 213 Data Structures Department of Computer Engineering Middle East Technical University Fall 2014 CENG 213 Data Structures 1.
Introduction to Programming Environments for Secondary Education CS 1140 Dr. Ben Schafer Department of Computer Science.
METU Computer Engineering Department
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
Data Structures CS231 Instructor: Dr. Hammad Majeed Office: Academic Block 4 First Floor.
1 CS1130 Spring 2011: David Gries & Walker White Transition to Object-Oriented Programming Assumes programming knowledge in a language like Matlab, C,
Spring 2008 Mark Fontenot CSE 1341 Principles of Computer Science I Note Set 1 1.
COMP 151: Computer Programming II Spring Course Topics Review of Java and basics of software engineering (3 classes. Chapters 1 and 2) Recursion.
CSE Graphical User Interface Design & Implementation Jason Murphy Lecture 1 - Introduction.
Spring 2008 Mark Fontenot CSE Honors Principles of Computer Science I Note Set 1 1.
Course Introduction CS 2302 SPRING Course Introduction In this part we'll discuss course mechanics. Most of this will apply to all sections of the.
Course Introduction Bryce Boe 2012/08/06 CS32, Summer 2012 B.
Data Structures and Programming.  Today:  Administrivia  Introduction to 225, Stacks  Course website: 
CMPSC 16 Problem Solving with Computers I Spring 2014 Instructor: Lucas Bang Lecture 15: Linked data structures.
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
Syllabus and Class Policies MATH 130: Summer 2014.
CSc 2310 Principles of Programming (Java) Dr. Xiaolin Hu.
CSC 212 – Data Structures Prof. Matthew Hertz WTC 207D /
1 Introduction to Operating Systems 9/16/2008 Lecture #1.
Introduction to Information Systems and Technology MIS 213, Spring 2015 CIS 2005, CIS 1007.
Data Structures, Algorithms, and Generic Programming Breno de Medeiros COP 4530 / CGS 5425 (Fall 2006)
CS 140 Computer Programming (I) Second semester (3 credits) Imam Mohammad bin Saud Islamic University College of Computer Science and Information.
CSC 171 – FALL 2001 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
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.
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 CSE250. Course Overview This course will be difficult Work hard and start early You are adults and I will treat you as such – I won’t.
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
Overview Introductions Administrative Material – Syllabus & Outline What we’re going to cover in this class.
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.
LISA A. TOBLER, M.S. Introduction to Psychology PS124 Seminar #1.
Advanced Legal Writing Seminar: Wednesdays, 10:00 p.m. EST Office Hours: Mondays from 3 – 5 p.m. EST, and by appointment AIM sign-in: cssouthall
IST 210: Organization of Data
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
Simplify! 1 Frank Vahid Prof. of CS&E, Univ. of California, Riverside Alex Edgcomb Research Specialist, Univ. of California, Riverside Both also with zyBooks.com.
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.
COMP1927 Course Introduction 16x1
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
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.
Clinical Anatomy Lecture Intro. Outline Syllabus Dissection Project Contracts Set the Baseline.
CS 367 Introduction to Data Structures Charles N. Fischer Fall s367.html.
Principles of Imperative Computation Lecture 1 January 15 th, 2012.
IST 210: ORGANIZATION OF DATA Introduction IST210 1.
Data Structures By Dr. Mehedi Masud ِAssociate Professor, Computer Science Dept. College of Computers and Information Systems Taif University 1.
Spring 2008 Mark Fontenot CSE 1341 – Honors Principles of Computer Science I Note Set 1 1.
“Success consists of going from failure to failure without loss of enthusiasm.” Winston Churchill.
Syllabus and Class Policies MATH 130: Summer 2016.
CSc 120 Introduction to Computer Programing II
CS101 Computer Programming I
CSc 1302 Principles of Computer Science II
CS5040: Data Structures and Algorithms
September 27 – Course introductions; Adts; Stacks and Queues
Strings and Pointer Arrays
Administrative Issues
Presentation transcript:

Course Introduction Bryce Boe 2013/09/30 CS24, Fall 2013

First things first Everyone must receive 8/8 on lab 1 before midnight You should have attended the lab – If you didn’t see me after class

About Me (Bryce Boe) Ph.D. Candidate in Computer Science Education – Focus on automated assessment tools – Not (yet) deserving of the Doctor/Professor title B.S. UCSB 2008, M.S. UCSB 2013 Background in networking and security Third time teaching

How to make class smoother Feedback, feedback, feedback – “Bryce, X doesn’t make sense” – “It might be better if Y” – “I can’t read your handwriting” – “Your going way too fast”

Outline for today Review the syllabus Piazza Demo Command Line Arguments Demonstrate the submission and feedback process

SYLLABUS REVIEW

Problem Solving with Computers II Intermediate building blocks for solving problems using computers. Topics include data structures, object-oriented design and development, algorithms for manipulating these data structures and their runtime analyses. Data structures introduced include stacks, queues, lists, trees, and sets.

Course Info Instructor: Bryce Boe – Office Hours Tuesday, 15:30 – 16:30 in Phelps 1413 Wednesday, 11:00 – 12:00 in Phelps 1413 TAs: Dani, Geoff, and Jon – Current office hours online Website:

Required Text C++ Plus Data Structures, 5th edition – Nell Dale Content will supplement lectures

What do you already know?

What you should already know C – Primitive types (int, float, double, char) – Loops and conditionals – Functions (declaring and calling) – Arrays – Structures – Memory allocation and de-allocation – Pointers

Grading Distribution 42% Projects (3, split evenly) 20% Final (Monday, December 9) 18% Labs (10, split evenly) 16% Midterm (Wednesday, October 30) 04% Participation Final score will not be higher than 15% more than weighted average of midterm and final

Participation Earned by: – Participating in class – Answering questions on Piazza – Responding to questions on Piazza Participation points are relative to the overall class effort (less positive outliers)

Late Submission Policy Grading based off your latest (most recent) submission 1% off every 5 minute interval late (don’t be late for lab 1) Examples: – Submission at 00:00:00-00:04:59, 1% off – Submission at 00:45:00-00:49:59, 10% off – Submission at 04:05:00-04:09:59, 50% off – Submission on or after 08:15:00, 0%

Grading Petitions Applies only to tests Not required for grading “mistakes” Must meet the following conditions: – Wait 24 hours after the test was returned to you – Provide a written argument that: Clearly states why your answer is suitable for the question Acknowledges your understanding of the expected answer Compares the two

Attendance Lectures: – Strongly encouraged, not required Labs: – Encouraged but not required for subsequent labs – You may attend any lab if there is space – priority is given to those enrolled in the actual section

Lab and Project Partners All projects and most labs will be partner- based – You can have a partner starting with lab 2 (next Monday) You must use the same partner throughout the course – Instructor approval is required to change partners

Academic Integrity Discussion With those around you discuss the following questions: – What constitutes a violation of academic integrity? – What sort of collaboration between students are acceptable? – Why are we having this discussion?

Course Syllabus The official course syllabus is viewable on the course website: –

Online Interaction Avoid class-related s Class discussion and online interaction to take place on Piazza Piazza allows: – You to ask questions anonymously – Ask questions privately to the instructor and TA – You to respond to questions – Edit questions and answers

Piazza Tips Don’t use the answer field to update or respond to your question (edit the question or add a follow-up) If you figure out your own question, please go back and answer it (don’t delete or edit-away the question) Ask a new question rather than using the follow-up if it is in-fact a follow-up question

Piazza Demo

COMMAND LINE ARGUMENTS

What are command line arguments? The groups of characters entered at the command prompt./a.out – {“./a.out”}./fizzbuzz 16 – {“./fizzbuzz”, “16”}

How do programmatically handle command line arguments?

int main(int argc, char *argv[]) argc – contains the number of arguments to the program, i.e., the length of argv argv – an array of c-strings (char*), contains argc elements Example –./a.out (argc  1, argv  {“./a.out”})

What is the value?./a.out 15 – argc? – argv[0]? cp file_a file_b /tmp/ – argc? – argv[4]?

Submitting your work and receiving feedback Refer to ssion ssion

For Wednesday Begin reading Chapter 1 in the textbook

Questions?