CS112: Course Overview George Mason University. Today’s topics Go over the syllabus Go over resources – Marmoset – Blackboard – Piazza – Textbook Highlight.

Slides:



Advertisements
Similar presentations
Intro to CIT 594
Advertisements

CS112: Course Overview George Mason University. Today’s topics Go over the syllabus Go over resources – Marmoset – Blackboard – Piazza – Textbook Highlight.
Intro to CIT 594
June 13, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
Dr. Tatiana Erukhimova [year] Overview of Today’s Class Folders Syllabus and Course requirements Tricks to survive Mechanics Review and Coulomb’s Law.
September 7, Concepts of Programming Languages Hongwei Xi Comp. Sci. Dept. Boston University.
COMP 14 – 02: Introduction to Programming Andrew Leaver-Fay August 31, 2005 Monday/Wednesday 3-4:15 pm Peabody 217 Friday 3-3:50pm Peabody 217.
July 16, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
MathXL ® for School Teacher Training Series Creating Tests or Quizzes.
Introduction to Programming Environments for Secondary Education CS 1140 Dr. Ben Schafer Department of Computer Science.
Summer 2009 Math 1431 and Math 1432 begin. What to do… Watch the orientation video from the spring online classes. Please note that the spring classes.
Intro to CIT 594
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.
Welcome to CompSci 100! As You Arrive… Make sure you grab a syllabus packet. Read through it. I will be covering the most essential points in my talk,
CS211: Course Overview George Mason University. Today’s topics Go over the syllabus Go over resources – Marmoset – Piazza – Textbook Highlight important.
Spring 2008 Mark Fontenot CSE 1341 Principles of Computer Science I Note Set 1 1.
Spring 2008 Mark Fontenot CSE Honors Principles of Computer Science I Note Set 1 1.
Recitation Week #1 Chem Queens College Spring 2010.
PLEASE GRAB A SEAT ANYWHERE FOR NOW. Welcome to the CMSC 201 Class!!! Mr. Lupoli ITE 207.
MyMathLab How to Study Hints from Professor of Mathematics Jon Odell.
BIT 115: Introduction To Programming1 Sit in front of a computer Log in –Username: 230class –password: –domain: student Bring up the course web.
Presented by Janine Termine Welcome to E-Learning.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
CSE 501N Fall ‘09 00: Introduction 27 August 2009 Nick Leidenfrost.
COMP Introduction to Programming Yi Hong May 13, 2015.
EECE 310 Software Engineering Lecture 0: Course Orientation.
MGS 351 Introduction to Management Information Systems
BIOLOGY CP What topics will we be covering in this course?
CSc 2310 Principles of Programming (Java) Dr. Xiaolin Hu.
Course Introduction CSCI Software Engineering II Fall 2014 Bill Pine.
Presented by Janine Termine Welcome 095 Basic Algebra.
Welcome to IIT and cs115!.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 CIS 83 Fall 2011.
Presented by Janine Termine.   Professor : Janine Termine   Phone number:  Office: F127.
ECEN 301Discussion #1 – Syllabus1 All Sections MWF 1:00 – 1:50 PM 256 CB Lecture: MW Recitation: F Labs: M or Th Instructor: Prof. David Long Office: CB.
CS 101 Today’s class will start 5 minutes late. CS 101 Introduction to Computer Science Aaron Bloomfield University of Virginia Spring 2007.
Catie Welsh January 10, 2011 MWF 1-1:50 pm Sitterson 014.
Astronomy 114 Lab Section 211, Professor Weigel. Outline for Today About Goals for this class Attendance Syllabus Safety Star Project Apparent vs. Absolute.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
CS 101 Today’s class will start 5 minutes late (and we’ll be talking about lab scheduling problems then)
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
ENGR Welcome to ENGR Excellence – Impact - Innovation.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
June 19, Liang-Jun Zhang MTWRF 9:45-11:15 am Sitterson Hall 011 Comp 110 Introduction to Programming.
Using MyMathLab Features of MyMathLab You must already be registered or enrolled in a current MyMathLab class in order to use MyMathLab. If you are not.
Syllabus Talbot Middle School 8thGrade Science Syllabus
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note- taking materials.
CIS 842: Specification and Verification of Reactive Systems Lecture ADM: Course Administration Copyright , Matt Dwyer, John Hatcliff, Robby. The.
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.
Classroom logistics and practices PROGRAMMING FUNDAMENTALS.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
MGS 351 Introduction to Management Information Systems Lecture #1.
Welcome to Astronomy 113 “ It would seem that you have no useful skill or talent whatsoever, he said.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
Data Structures and Algorithms in Java AlaaEddin 2012.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
Welcome to CSCI 230 Computing I Dale Roberts, Lecturer Department of Computer and Information Science IUPUI.
n Taking Notes and Keeping a Journal n Listening Skills n Working Together n Managing Your Time.
Presented by Janine Termine Welcome 095 Basic Algebra.
Spring 2008 Mark Fontenot CSE 1341 – Honors Principles of Computer Science I Note Set 1 1.
1 Computer Science 1021 Programming in Java Geoff Draper University of Utah.
Introduction to CptS 111 Adam Carter. Meet your instructor Adam Carter "PhD Candidate" (ABD) Feel free to call me: – Adam (preferred) – Professor Carter.
Course Overview - Database Systems
Accelerated Introduction to Computer Science
Analysis of Algorithms
Intro to CIT 594
Intro to CIT 594
CS Problem Solving and Object Oriented Programming Spring 2019
Presentation transcript:

CS112: Course Overview George Mason University

Today’s topics Go over the syllabus Go over resources – Marmoset – Blackboard – Piazza – Textbook Highlight important information

Introduction to programming This class is about programming, not a particular language – stress on algorithm design and testing – we happen to be using Python, which we must learn in order to run code – focus is on critical thinking, not mastery of python or efficiency concerns Programming is like solving small puzzles – in that sense, this class is like a math class

This class is hard and time consuming Recommend at least 15 hours outside of lecture, per week – you may consider choosing other classes this semester to negotiate your time constraints You need to start assignments immediately, after lecture – seek help immediately through Piazza – do not wait for office hours We grade based on performance, not effort – sadly, effort will not always produce the desired grade

Readings and homework Lecture will primarily be used for going over homework examples from the textbook – because talking at you is boring for everyone. Read the book. Come to lecture prepped, with questions, otherwise lecture is a waste of your time and money – not all homework exercises have solutions in the book: take notes during lecture Homework will help you with the projects

Programming Projects are in addition to homework questions will only be graded on Marmoset – must run and pass test cases for [partial] credit need to be started immediately seek help through Piazza if you are stuck for longer than 30 minutes are individual assignments – see the honor code policies cannot use Internet resources (unless specified): – you learn more by trying to solve the problems within the constraints we set, like jogging with weights – this class is about learning programming fundamentals, i.e. algorithm design, not knowing some esoteric feature or function of Python – (feel free to explore on your own as much as you like, as long as it’s not used for a project in this class)

Quizzes Will be on the material from the previous lecture(s) Will generally ask you to implement, in Python, a programming problem, or, Will have a multiple choice Python component, based on lecture material You must come to your lab section to take the quiz – turned in on Marmoset in lab – need to be present in lab

Course Pace Project 1 is not a coding project; pace picks up after Five programming projects –build upon each other Class gets progressively harder through Chapter 5, then plateaus

Piazza Piazza is required daily reading –I can see who reads posts and who doesn’t Please search for your question before asking: –use search bar, and look through ALL existing posts –will take off points for excessive violations (I give out lots of warning though, don’t be scared to post!) –we need to keep Piazza readable for all Please post to “All Instructors”, not just the professor –you’ll get a quicker response that way Never post code or solutions publicly –when in doubt, make it a private post

On a lighter note… Hopefully you will find this class challenging, but fun

Let’s get started Click on the link to Chapter 0: use the default username of guest to access the material there: –link to textbook –link to slides –link to videos –link to exercises