Introduction to Structures CSLU 1100.Lo3 Fall 2007 Cameron McInally Fordham University.

Slides:



Advertisements
Similar presentations
Course Syllabus Development Abdullateef Haidar. Contents Introduction Introduction Some considerations Some considerations Components of course syllabus.
Advertisements

What’s wrong with this proof? If you figure it out, don’t call it out loud – let others ponder it as well. 1. Let a and b be non-zero such thata = b 2.
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
Welcome to MAT 142 TTh. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday 10:30 am – 11:30 am Wednesday 11:45 am – 12:45.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 10:30 am – 11:30 am Wednesday 9:40.
June 13, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Wednesday and Friday 10:40 am – 11:30 am and by appointment.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 8 am – 8:30 am Tuesday and Thursday.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
Welcome to MAT 142 MWF 7:40 SLN Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 9:15 am – 10: 15 am Tuesday and Thursday.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
If you don't have a syllabus, then raise your hand (and keep it up until we get you one.) Presentation: "Syllabus" Spring 2011 PHI 120 Sections 01-09:
MATH 330: Ordinary Differential Equations Fall 2014.
Welcome to MAT 142. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 10:30 am – 11:30 am Wednesday 9:40.
July 16, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
Spring 2012 MATH 250: Calculus III. Course Topics Review: Parametric Equations and Polar Coordinates Vectors and Three-Dimensional Analytic Geometry.
All Saints Catholic School Mrs. Holtz’s Fourth Grade Room 211.
BACK-TO-SCHOOL NIGHT SANDY O’BRIEN 4 TH GRADE, ROOM D5 August 26, 2014.
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.
COMPSCI 101 S Principles of Programming Lecture 1 – Introduction.
CHEMISTRY 10123/10125 Spring 2007 Instructor: Professor Tracy Hanna Phone: Office: SWR 418
Math Study Skills Brenda I. Mejias Academic Coordinator, Math & Science Student Support Services.
Math 125 Statistics. About me  Nedjla Ougouag, PhD  Office: Room 702H  Ph: (312)   Homepage:
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
CS 103 Discrete Structures Lecture 01 Introduction to the Course
1 COMS 161 Introduction to Computing Title: Course Introduction Date: August 25, 2004 Lecture Number: 1.
Welcome to 6 th Grade Orientation Mrs. Debbie Fischer And Mrs. Sturges - ELA Tuesday, October 25 th 6:15 – 8:30PM.
General Physics1 Welcome to Phys 130! Blackboard blackboard.siena.edu.
1 COMS 261 Computer Science I Title: Course Introduction Date: August 25, 2004 Lecture Number: 01.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
OPIM 3801: Principles of Project Management Instructor: Bob Day Associate Professor OPIM Dept.
Welcome to CS 101! Introduction to Computers Spring 2015 This slide is based on Dr. Keen slides for CS101 day sections, with some modifications.
CS 140 Computer Programming (I) Second semester (3 credits) Imam Mohammad bin Saud Islamic University College of Computer Science and Information.
PHY 1405 Conceptual Physics (CP 1) Spring 2010 Cypress Campus.
“They didn’t do it like that in my day!”. Does your child ask for help with their maths homework and start talking in another language, using words like.
Principles of Chemistry II (CHEM 1212) Section 01 (CRN 53642) MW 3:30 - 5:35 pm (B10) DR. AUGUSTINE OFORI AGYEMAN Assistant professor of chemistry Department.
Fall 2014 MATH 250: Calculus III. Course Topics Review: Parametric Equations and Polar Coordinates Vectors and Three-Dimensional Analytic Geometry.
Welcome to CIS 2168 ! Data Structures and Algorithms
1 Daily Announcements CS 202, Spring 2007 Aaron Bloomfield.
CSE 1105 Week 1 CSE 1105 Course Title: Introduction to Computer Science & Engineering Classroom Lecture Times: Section 001 W 4:00 – 4:50, 202 NH Section.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
PHYSICS 2326 (Fall, 2015) University Physics II
FERN TRIBBEY ICTM PRESIDENT. Standards for Mathematical Practice Describe mathematical “habits of mind” Standards for mathematical proficiency: reasoning,
PARENT FORUM TUESDAY 12 TH MAY PROBLEM SOLVING.
CS 139 – Algorithm Development MS. NANCY HARRIS LECTURER, DEPARTMENT OF COMPUTER SCIENCE.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
Welcome to CS 101! Introduction to Computers Fall 2015.
Welcome to the MTLC MATH 113 Summer 2014 Instructor Section 100: Dr. Allen Section 101: Dr. Allen.
Welcome to the MTLC MATH 110 Summer 2014 Instructors Section 100: Dr. Wang Section 101: Dr. Song.
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.
Physics of Animation (Art/Physics 123) Prof. Alejandro Garcia Fall 2009 Class is fully enrolled and I am not allowed to add students. Sorry.
PHYSICS 2325 (Spring, 2016) University Physics I Course Title:University Physics I Course Number:PHYS Class Number:87201 Semester:Spring 2016.
Introduction to Programming Welcome to Our Class.
Homework for Next Week Write a short (one page) story of something interesting that happened to you during the New Years Break, that you will share in.
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.
WELCOME TO OPEN HOUSE! September 6, 2012 AP BIOLOGY G119 Mrs. Vanderfin Please sign-in at the side counters.
Computer Science 20 Discrete Mathematics for Computer Science 1 All the Math you need for your Computer Science courses that you won’t learn in your Math.
Course Overview - Database Systems
Welcome to Computers in Civil Engineering 53:081 Spring 2003
Networking CS 3470, Section 1 Sarah Diesburg
COMP 283 Discrete Structures
Course Overview - Database Systems
Introduction to CS II Data Structures
COMS 261 Computer Science I
AP Biology.
Presentation transcript:

Introduction to Structures CSLU 1100.Lo3 Fall 2007 Cameron McInally Fordham University

Introduction A Discrete Math Course from a Computer Science perspective. Counts towards the mathematical reasoning requirement of the Fordham Core Curriculum. Also used periodically as a liberal arts course or transfer credit

Introduction About the instructor – Name: Cameron McInally – Office Hours: M 6:30-9:00pm and W 4:00-6:00pm. – Office: LL 819d – Phone: –

Introduction Objective: To provide students with the skills to solve analytical and algorithmic problems.

Introduction Desired Outcomes: Be able to analyze and understand common math notation Be able to develop solutions to mathematical problems Be able to use a well-defined methodology to reason about math Be able to develop solution to multi-step reasoning problems

Introduction Resources available to you: Textbook: Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns and Games Douglas E. Ensley, J. Winston Crawley Wiley, ISBN Website: All course materials will be accessible via: Instructor: That’s me

Introduction Attendance: Just short of mandatory. We are all busy people but I need to have you here for all 15 sessions. Unexcused absences or missing more than 2 classes will lower your course grade Homework: Expect to spend approximately 6 hours each week on work. You should work on it everyday but I will expect it done by Tuesday classes.

Introduction Computer Projects: Are designed to be challenging. Don’t give up, I don’t expect you to know how to do it already. By the end of the project, you will have mastered the skill. Exams: Keep these dates in mind Wednesday, February 6:00pm and Wednesday, May 6:00 pm. Exams cannot be made up.

Introduction Cheating: Don’t Cheat. The formal school policy is more extensive and you should read about it to know your rights and the rules. The work you do should be your own. You are only allowed help from authorized sources or when I explicitly permit it.

Introduction So, what is this course about? – This is a Discrete Math course that will teach you about CS reasoning. What is CS? – CS could stand for Computer Science here, but it does not. CS stands for Common Sense.

Introduction Why could CS stand for Computer Science? – These mathematical problems are fundamental to Computer Scientists. Why does CS stand for Common Sense? –Any math problem in this course can be completed with a basic pocket calculator. The problems require more thinking than formal mathematical skill.

Now onto the course “ Would you like to play a game?”

Directions 1.Place the cards face up in this order heart, club, diamond and spade (the heart should be on the bottom and the spade should be visible).

Directions 2.Turn the top card (the spade) face down)

Directions 3.Move any number of cards (one at a time) from the top to the bottom

Directions 4.Turn over the top two cards in one chunk

Directions 5.Move any number of cards (one at a time) from the top to the bottom

Directions 6.Turn over the top two cards in one chunk

Directions 7.Move any number of cards (one at a time) from the top to the bottom

Directions 8.Either turn over the entire stack or do not

Directions 9.Turn over the top card

Directions 10.Turn over the top two cards in one chunk

Directions 11.Turn over the top three cards in one chunk.

What is the only card facing the opposite way of the others? It’s a club!

The Josephus Game Get into a circle. Every 7 th person will be executed. We will continue until everyone has died. The last person alive win’s and gets to continue living. Where do you want to stand?

Play it on your own Josephus Game

Drawing Puzzles Try out the Drawing Game

Keeping Track of What Happened In some puzzles it is important to keep track of all the possibilities something can have. Suppose I am at the fair throwing balls at the dunk tank.

What can happen on my first throw? I could hit the target I could miss the target.

What if I make two throws? What could happen? I could hit the first throw, and hit the second throw I could hit the first throw and miss the second throw I could miss the first throw and hit the second throw I could miss the first throw and miss the second throw.

What will happen is I make 3 throws? Throw 1Throw 2Throw 3 Option #1Hit Option #2Hit Miss Option #3HitMissHit Option #4HitMiss Option #5MissHit Option #6MissHitMiss Option #7Miss Hit Option #8Miss

Tables can be very useful another option to represent possibilities is a game tree.

What can we learn from puzzles? Puzzles capture and illustrate the essential points of many mathematical reasoning tasks They can give us a concrete foundation on which to attach and understand a problem They are in fact the inspiration for many important mathematical and computer science breakthroughs.

Always Due in One Week Homework (Always Due in One Week) Complete Online Survey on the course website. Introduction