CS 220: Discrete Structures and their Applications

Slides:



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

Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
COMP 110 Introduction to Programming Tabitha Peck M.S. January 9, 2008 MWF 3-3:50 pm Philips 367.
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
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,
MTH213 Experimental Mathematics Introduction. Goals of the Course Introduction to high level programming language (Python) and extensive math libraries.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
COMP Introduction to Programming Yi Hong May 13, 2015.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Catie Welsh January 10, 2011 MWF 1-1:50 pm Sitterson 014.
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.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
Student Performance Improvement using Interactive Textbooks: A Three-University Cross-Semester Analysis Alex Edgcomb*, Frank Vahid*, Roman Lysecky°, Andre.
UMBC CMSC 341 Intro1 CMSC 341 Course Introduction.
Introduction to computers and programming Instructor: Alex Iskold.
1 CS1100 Fall Instructor: David Gries CS100M: Matlab No prior programming experience One semester of calculus Math & engineering type problems CS100J:
INTRODUCTION TO PROGRAMMING ISMAIL ABUMUHFOUZ | CS 146.
CS 162 Introduction to Computer Science II Winter, 2014: 60 Spring, 2014: 60 Summer, 2014: 71.
CS112: Course Overview George Mason University. Today’s topics Go over the syllabus Go over resources – Marmoset – Blackboard – Piazza – Textbook Highlight.
Logic & Proofs Summer Session II Instructor: Karin Howe.
CS 161 Introduction to Computer Science I Winter, 2014: 112 Spring, 2014: 131 Summer, 2014: 132.
Introduction to CIT Mar-16.
Course Information CSE 2031 Fall Instructor U.T. Nguyen Office: CSE Home page:
CIT 592 Discrete Math Lecture 1. By way of introduction … Arvind Bhusnurmath There are no bonus points for pronouncing my last name correctly Please call.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
Computer Science I ISMAIL ABUMUHFOUZ | CS 180. CS 180 Description BRIEF SUMMARY: This course covers a study of the algorithmic approach and the object.
CSc 120 Introduction to Computer Programing II
Lecture 00: Introduction
Computer Network Fundamentals CNT4007C
電腦圖學 Computer Graphic with Programming
Computer Engineering Department Islamic University of Gaza
IST256 : Applications Programming for Information Systems
CS101 Computer Programming I
INTERMEDIATE PROGRAMMING WITH JAVA
CSc 1302 Principles of Computer Science II
Introduction to Programming
Lab Introduction Installing Python
Computer Networks CNT5106C
Programming Language Design Concepts
COMPSCI 330 Design and Analysis of Algorithms
EE 312 Course Introduction
Principles of Computing – UFCFA Lecture-1
September 27 – Course introductions; Adts; Stacks and Queues
CS 201 – Data Structures and Discrete Mathematics I
CMSC 341 Fall 2008.
Course Information and Introductions
CS 201 – Data Structures and Discrete Mathematics I
Welcome to CS 1010! Algorithmic Problem Solving.
Computer Networks CNT5106C
Course Overview - Database Systems
Welcome to CS 1010! Algorithmic Problem Solving.
Foundations of Programming Languages – Course Overview
Welcome to CS 1301! Principles of Programming I.
EE422C Software Design and Implementation II
ELT & Vocabulary Learning
CMSC 341 Course Introduction July 2011 UMBC CMSC 341 Intro.
Automata and Formal Languages
C Programming Lecture 1 : Introduction
Lecture 1a- Introduction
Welcome to CS 410 – Introduction to Software Engineering Spring 2019
C Programming Lecture 1 : Introduction
Principles of Imperative Computation
Principles of Computing – UFCFA Week 1
Administrivia- Introduction
Computer Networks CNT5106C
CS114B Introduction to Computer Science II
Design and Analysis of Algorithms
Lecture 1a- Introduction
CS 232 Geometric Algorithms: Lecture 1
Presentation transcript:

CS 220: Discrete Structures and their Applications Course Introduction

About this course We will also write programs. This is a math course. Why is math important to us? What does it have to do with computer science? We need to be able to reason about our programs 1. Is our program correct? 2. How much time and space does it take We will also write programs. Programming language: Python! Math is a formal language which is helps us formulate problems and algorithms so that we can write programs, which are another very formal language!

Python We will use Python to demonstrate mathematical concepts. Why Python? Simple, easy to learn syntax Highly readable, compact code: almost like pseudo-code One of the most highly used programming languages What makes Python different from Java? Java is statically typed, i.e. variables are bound to types at compile time. This avoids run time errors, but makes java programs more rigid. Python is dynamically typed, i.e. a variable takes on some type at run time, and its type can change. This makes python programs more flexible, but can cause strange run time errors. image from: ftp://www.mindview.net/pub/eckel/LovePython.zip

About this course Course webpage: http://www.cs.colostate.edu/~cs220/ Slides/recitations/assignments are posted on the course webpage’s schedule page. Canvas will be used for grades and assignments Piazza will be our primary communication tool

Textbook Who reads the textbook anyhow? Most textbooks are expensive Are not in alignment with how most students interact with content → low usage

Textbook Zybooks online discrete math book: If you haven’t gotten access to it: Sign in or create an account at learn.zybooks.com Enter zyBook code COLOSTATECS220Spring2018 Subscribe A subscription is $48 and will last until June 13, 2018.

Textbook Zybooks online discrete math book: Demonstrated to be effective. A. Edgcomb, F. Vahid, R. Lysecky, A. Knoesen, R. Amirtharajah, and M.L. Dorf. Student Performance Improvement using Interactive Textbooks: A Three- University Cross-Semester Analysis, Proc. of ASEE Annual Conference, Seattle, 2015.

Components of the course Lectures Slides are posted ahead of time Zybooks reading assignments Help prepare/reinforce lecture Recitations Help you with written/programming assignments Reinforce material from lecture Written/Canvas assignments Do you understand the theory? Programming assignments Can you implement it? Tests What have you learned?

Grading Written/Canvas assignments Programming assignments (~3) Zybooks activities Recitation (attendance + completion) Midterm Final For the percentages see course website.

CS building Make sure you can get into the Unix lab (CSB 120)! If you have keycard access problems: CS students: talk to a CS accounting person (Kim or student employee) Non CS students: Key Desk at Facilities Management

Professional class behavior We all have to have respect for each other, independent of race, gender, ability Laptop usage: use the back row of the class THERE ARE NO STUPID QUESTIONS Your classmates will be grateful you asked. Questions outside of class: use Piazza rather than emailing your instructor/TA

Cheating What is cheating? What is not? Where is it defined? What is gained / lost when cheating? What are the consequences? When / how does it happen? How can cheating be avoided? Taking or giving work. Pretending authorship. NOT: Talking about a problem, an abstract solution. Professional Conduct (Syllabus) Gained: you get the points w/o doing the work. Lost: experience of doing the work, next task will be MUCH harder Loss of points, Univ. record Time trouble, time management “If everyone is thinking alike, then somebody isn't thinking.” General George S. Patton