Computational Thinking IS 101Y/CMSC 101 September 5, 2013 Carolyn Seaman Susan Martin University of Maryland Baltimore County.

Slides:



Advertisements
Similar presentations
CSTA K-12 Computer Science Standards (rev 2011)
Advertisements

Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Computational Thinking Trendy Phrase or Essential Skill Set? Barbara Fox bfox2014.wikispaces.com.
Reducibility Class of problems A can be reduced to the class of problems B Take any instance of problem A Show how you can construct an instance of problem.
CPE702 Complexity Classes Pruet Boonma Department of Computer Engineering Chiang Mai University Based on Material by Jenny Walter.
An Introductory Course for Social Entrepreneurs. Given the increasing rate of problems in the world we need more change makers and problem solvers than.
Discussion on the relationship between research and practice in Social Responsibility.
Team Task Choose 1 Progression to READ: Number and Operations--Fractions Ratios and Proportional Relationships Develop “Content” Knowledge.
Learning Objectives, Performance Tasks and Rubrics: Demonstrating Understanding and Defining What Good Is Brenda Lyseng Minnesota State Colleges.
1Marquette University Heather Bort and Dennis Brylow SIGCSE 2013 CS4Impact: Measuring Computational Thinking Concepts Present in CS4HS Participant Lesson.
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 Graphs.
Analysis of Algorithms CS 477/677
Mohammad Alshayeb 19 May Agenda Update on Computer Science Program Assessment/Accreditation Work Update on Software Engineering Program Assessment/Accreditation.
Welcome and Overview Richard Anderson University of Washington June 30, 20081IUCEE: Welcome and Overview.
Building a K-12 Program of Study for Computing – Curricula and Resources Friday, May 8, 2015 Kern-Cary, Green Lake Center, WI Dennis Brylow Joe Kmoch.
Test Preparation Strategies
Computational Thinking Related Efforts. CS Principles – Big Ideas  Computing is a creative human activity that engenders innovation and promotes exploration.
Moving forward with Scalable Game Design. The landscape of computer science courses…  Try your vegetables (sneak it in to an existing course)  Required.
 A set of objectives or student learning outcomes for a course or a set of courses.  Specifies the set of concepts and skills that the student must.
GRAPH Learning Outcomes Students should be able to:
Overview IS 101Y/CMSC 101 Computational Thinking and Design Thursday, August 28, 2014 Carolyn Seaman Susan Martin University of Maryland, Baltimore County.
People: Usability COMP 101 November 12, 2014 Carolyn Seaman Amanda Mancuso Susan Martin University of Maryland Baltimore County.
Abstraction IS 101Y/CMSC 101 Computational Thinking and Design Tuesday, September 17, 2013 Carolyn Seaman University of Maryland, Baltimore County.
Programming & Data Structures
Applying creativity in CS high school education - criteria, teaching example and evaluation Romeike, R. (2007). Applying creativity in CS high school education.
Design IS 101Y/CMSC 101 Computational Thinking and Design Tuesday, October 15, 2013 Carolyn Seaman University of Maryland, Baltimore County.
Southern Regional Education Board HSTW Ten Conditions that Result in Students Making Greater Effort to Succeed Gene Bottoms.
Master Action Plan By Asifa Naz Khan. Subject Specialist English, TICSS, Lahore.
Complexity Classes (Ch. 34) The class P: class of problems that can be solved in time that is polynomial in the size of the input, n. if input size is.
Welcome Parents! Algebra II Mrs. Holman Welcome to Solon High School and to your son or daughter’s year in Algebra II. I appreciate and welcome your participation.
+ Computer Science Principles: A New AP Concept Marie desJardins Google CS4HS Professional Development Workshop UMBC, August 6, 2012.
Algorithmic Problem Solving COMP 101 Computational Thinking and Design Thursday, September 4, 2014 Carolyn Seaman Susan Martin University of Maryland,
CSCE350 Algorithms and Data Structure Lecture 17 Jianjun Hu Department of Computer Science and Engineering University of South Carolina
AP CS: Principles Dr. Kelly Schultz Academically Talented Youth Program Western Michigan University.
Abstraction IS 101Y/CMSC 101 Computational Thinking and Design Tuesday, September 17, 2013 Marie desJardins University of Maryland, Baltimore County.
Abstraction IS 101Y/CMSC 101 Computational Thinking and Design Tuesday, September 9, 2014 Carolyn Seaman Susan Martin University of Maryland, Baltimore.
Computational Thinking in K-12 and Scalable Game Design Michael Shuffett.
Big Ideas IS 101Y/CMSC 101 September 3, 2013 Carolyn Seaman Susan Martin University of Maryland Baltimore County.
Presenter’s Guide to Multiple Representations in the Teaching of Mathematics – Part 1 By Guillermo Mendieta Author of Pictorial Mathematics
CSC 170 Computing: Science and Creativity
CSC 172 P, NP, Etc. “Computer Science is a science of abstraction – creating the right model for thinking about a problem and devising the appropriate.
CSE 024: Design & Analysis of Algorithms Chapter 9: NP Completeness Sedgewick Chp:40 David Luebke’s Course Notes / University of Virginia, Computer Science.
CSE 3813 Introduction to Formal Languages and Automata Chapter 14 An Introduction to Computational Complexity These class notes are based on material from.
More Computational Complexity Shirley Moore CS4390/5390 Fall August 29,
Algorithmic Problem Solving: Programming with Processing IS 101Y/CMSC 101 Computational Thinking and Design Thursday, September 11, 2014 Carolyn Seaman.
Hard problems in computer science Prof. Noah Snavely CS1114
CS 10K – Rise of CS Principles UTeach and Computer Science Principles: National Initiatives To Reform Introductory Curricula And Broaden Participation.
Computational Thinking IS 101Y/CMSC 101 September 5, 2013 Marie desJardins University of Maryland Baltimore County.
Pipelined and Parallel Computing Partition for 1 Hongtao Du AICIP Research Nov 3, 2005.
Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak
1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.
Computational Complexity Shirley Moore CS4390/5390 Fall 2013 August 27, 2013.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Welcome to the Computer Science classes Mrs. Whitlock AP night Chattahoochee High School.
Design IS 101Y/CMSC 101 Computational Thinking and Design Thursday, October 9, 2014 Carolyn Seaman Susan Martin University of Maryland, Baltimore County.
(AP)CS Principles CE21, CSPrinciples16/24/2016.
Mathematics 0580.
7 Big Ideas of Computing:
Looping and Random Numbers
WELCOME TO AP COMPUTER SCIENCE PRINCIPLES!
AP Computer Science Principals Course Importance and Overview
AP computer science PRINCIPLES
Computer Science Principles
Algorithmic Problem Solving: Programming with Processing IS 101Y/CMSC 101 Computational Thinking and Design Thursday, September 12, 2013 Carolyn Seaman.
Welcome to the Computer Science classes
Welcome to the Computer Science classes
AP Computer Science Principals Course Importance and Overview
Student/Faculty Research
Presentation transcript:

Computational Thinking IS 101Y/CMSC 101 September 5, 2013 Carolyn Seaman Susan Martin University of Maryland Baltimore County

What are important problems? Break into your groups Each group should come up with five problems/goals in world/life Could be important societal challenges Could be something important to you Could be something you enjoy Report out by random group member

Important problems

Computational Thinking

Computational Ideas Solving problems by “reduction, embedding, transformation, or simulation” Thinking recursively Parallel processing “type checking as the generalization of dimensional analysis” “virtues and dangers of aliasing” “cost and power of indirect addressing and procedure call”

Discussion Questions (one for each team, 60 second report-back) 1. How many of the computing terms used in the article were unfamiliar to you? At what point in your computing education do you think you’d be able to understand all the computing references in the article? 2. Dr. Wing uses the term “computer science” throughout the article. Based on what you know now, do you think the article equally applies to all computing disciplines we’re talking about this semester (CS, IS, BTA, CE)? 3. Do you think computational thinking is something that should be taught? When? To whom? 4. Do you think everyone is capable of computational thinking? 5. Can you come up with an example of something that is NOT computational thinking? Why is it not? 6. Do you think computational thinking is geeky? Why or why not? Is that good or bad? 7. Can you come up with an example of a situation where computational thinking would NOT be appropriate? 8. Do you think computational thinking is more or less important for people to learn than good writing skills? Why?

AP CS Principles: Big Ideas Did any of you take AP CS? Why/why not? Joint effort between CRA and College Board to develop new AP CS Principles course The computing content of this course generally follow that model

AP CS Principles: Big Ideas Computing is a creative activity. Abstraction reduces information to focus on relevant concepts. Data and information facilitate the creation of knowledge. Algorithms are used to express solutions to computational problems. Programming enables problem solving, expression, and knowledge creation. The Internet pervades modern computing. Computing has global impacts.

A Kidney Story Kidney disease affects 50,000 new Americans a year A great example of computational abstraction! Pairs Cycles Chains Two cycleThree cycle

A Big Kidney Story What about really big chains? How do you come up with an optimal series of swaps? Exercise taken from: NY Times, Feb 19, 2012

Kidney Exchange Consider the exchange below. A patient is connected to a donor if they are biologically compatible. A donor will only donate a kidney if his or her friend also receives a kidney. What is the optimal exchange for this situation? Why? What technique did you use to solve this problem? How would your technique scale if there were ten donors and patients? 100? Thousands?

Alternative Representation A graph data structure can capture the important relationships among patients and donors In the graph, there is an edge from one node to another if and only if the first node can receive a kidney from the second node. This representation is an abstraction of the matching problem In reality, the problem is more complex – edges are labeled with weights that represent the degree/quality of the match A legal exchange is a path that never visits any vertex twice A cycle returns to the starting vertex; a chain does not If every node was visited (every patient received a kidney and every donor donated one), this would be called a Hamiltonian cycle Discovering a Hamiltonian cycle is a famous NP-complete (i.e., computationally hard) problem What is the longest legal chain in this graph? Longest legal cycle?

Reminders Processing Assignment 1 is due next Tuesday, 9/10 Very important to complete this before class We will beginning to learning Processing, including in-class labs Bring your laptop! If that’s a problem, contact Dr. Seaman IMMEDIATELY Start early with the reading for next week!