Final Review FOCS – Human Computer Interaction. Journal Entry: Unit #1 Entry #3 Go to and use the wayback machine to compare a.

Slides:



Advertisements
Similar presentations
Chapter 5: Tree Constructions
Advertisements

Lecture 15. Graph Algorithms
NP-Hard Nattee Niparnan.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
TOPIC LEARNING BTEC Level 3 Unit 28 Websites L01- All students will understand the web architecture and components which allow the internet and websites.
Greed is good. (Some of the time)
The Efficiency of Algorithms
Unit 2 Day 6 FOCS – Human Computer Interaction. Presentations 3 groups will present their solutions Presentations must include a description of how your.
Quick Review of Apr 10 material B+-Tree File Organization –similar to B+-tree index –leaf nodes store records, not pointers to records stored in an original.
Graphs Chapter 12. Chapter Objectives  To become familiar with graph terminology and the different types of graphs  To study a Graph ADT and different.
ITEC200 – Week 12 Graphs. 2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study.
CPSC 335 Computer Science University of Calgary Canada.
Graphs Intro G.Kamberova, Algorithms Graphs Introduction Gerda Kamberova Department of Computer Science Hofstra University.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
CPSC 411, Fall 2008: Set 4 1 CPSC 411 Design and Analysis of Algorithms Set 4: Greedy Algorithms Prof. Jennifer Welch Fall 2008.
Greedy Algorithms Reading Material: Chapter 8 (Except Section 8.5)
Graphs Chapter 12. Chapter 12: Graphs2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph.
Spring 2010CS 2251 Graphs Chapter 10. Spring 2010CS 2252 Chapter Objectives To become familiar with graph terminology and the different types of graphs.
1 Parallel Algorithms III Topics: graph and sort algorithms.
© 2006 Pearson Addison-Wesley. All rights reserved14 B-1 Chapter 14 (continued) Graphs.
Fall 2007CS 2251 Graphs Chapter 12. Fall 2007CS 2252 Chapter Objectives To become familiar with graph terminology and the different types of graphs To.
Greedy Algorithms Like dynamic programming algorithms, greedy algorithms are usually designed to solve optimization problems Unlike dynamic programming.
Design and Analysis of Algorithms Minimum Spanning trees
Unit 2 Day 10 FOCS – Human Computer Interaction. Journal Entry: Unit #2 Entry #9 Convert text to binary Convert the message ‘Poly pride’ into binary.
CS 106 Introduction to Computer Science I 10 / 15 / 2007 Instructor: Michael Eckmann.
CPSC 411, Fall 2008: Set 4 1 CPSC 411 Design and Analysis of Algorithms Set 4: Greedy Algorithms Prof. Jennifer Welch Fall 2008.
IMS Information Systems Development Practices
CS 106 Introduction to Computer Science I 10 / 16 / 2006 Instructor: Michael Eckmann.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Minimal Spanning Trees What is a minimal spanning tree (MST) and how to find one.
B-trees (Balanced Trees) A B-tree is a special kind of tree, similar to a binary tree. However, It is not a binary search tree. It is not a binary tree.
Minimum Spanning Trees
Copyright © Cengage Learning. All rights reserved. CHAPTER 10 GRAPHS AND TREES.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
Lecture 19 Greedy Algorithms Minimum Spanning Tree Problem.
Union-find Algorithm Presented by Michael Cassarino.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
©2003 Pearson Education, Inc., publishing as Longman Publishers. Study Skills Topic 5 Critical Thinking PowerPoint by JoAnn Yaworski.
Minimum Spanning Trees CS 146 Prof. Sin-Min Lee Regina Wang.
CHANGES ARE ON THE HORIZON FOR ALL SCHOOLS IN ALBERTA AND THAT’S A FACT MAY 11, 2011 LIBRARY ACTION GROUP.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
SNU OOPSLA Lab. 1 Great Ideas of CS with Java Part 1 WWW & Computer programming in the language Java Ch 1: The World Wide Web Ch 2: Watch out: Here comes.
Weighted Graphs Computing 2 COMP s1 Sedgewick Part 5: Chapter
ALGORITHMS.
Unit 2 Day 8 FOCS – Human Computer Interaction. Journal Entry: Unit #2 Entry #7 Cornrow Reflection Describe each step of the problem solving process that.
Graphs Chapter 12. Chapter 12: Graphs2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph.
Gutenberg to Zuckerberg. In communication, media (singular medium) are the storage and transmission channels or tools used to store and deliver information.
Unit 2 Day 11 FOCS – Human Computer Interaction. Tower Building Presentation Explain your solution.
Unit 1 Day 6 FOCS – Human Computer Interaction. Journal Entry: Unit #1 Entry #3 Go to and use the wayback machine to compare a.
Unit 2 Day 4 FOCS – Human Computer Interaction. Journal Entry: Unit #2 Entry #4 Using the numbers 3, 5, 8, and 9 and any mathematical operation you wish,
Wiki’s and Web 2.0 Tools Session 3. Wiki’s
DECISION 1. How do you do a Bubble Sort? Bubble Sort:  You compare adjacent items in a list;  If they are in order, leave them.  If they are not in.
Lists and Sorting Algorithms
Minimum Spanning Trees
Randomized Min-Cut Algorithm
Redraw these graphs so that none of the line intersect except at the vertices B C D E F G H.
THE CURRENT STATE OF ICT WEB 2.0. The term "Web 2.0" was first used in January 1999 by Darcy DiNucci describes World Wide Web sites that emphasize user-
Minimum Spanning Trees
EXPLORING COMPUTER SCIENCE Journal Entries, Portfolio Entries, And Check Your Understanding Unit 2 – Strand 2 Problem Solving This unit focuses on.
CSE 373 Data Structures and Algorithms
Algorithm Efficiency and Sorting
And the Final Subject is…
Minimum Spanning Tree.
Chapter 6 Network Flow Models.
CSE 373: Data Structures and Algorithms
CSE 373: Data Structures and Algorithms
Presentation transcript:

Final Review FOCS – Human Computer Interaction

Journal Entry: Unit #1 Entry #3 Go to and use the wayback machine to compare a website that you use to a version of it from 10 or more years ago. Describe the differences you see.

Web 2.0 Web 2.0 describes World Wide Web sites that use technology beyond the static pages of earlier Web sites.World Wide Web Although Web 2.0 suggests a new version of the World Wide Web, it does not refer to an update to any technical specification, but rather to cumulative changes in the way Web pages are made and used.World Wide Web A Web 2.0 site may allow users to interact and collaborate with each other in a social media dialogue as creators of user-generated content in a virtual community, in contrast to Web sites where people are limited to the passive viewing of content.social mediauser-generated contentvirtual communitycontent Examples of Web 2.0 include social networking sites, blogs, wikis, folksonomies,video sharing sites, hosted services, Web applications, andmashups. [3]social networking sitesblogswikisfolksonomiesvideo sharinghosted servicesWeb applicationsmashups [3]

Evaluating Websites Criteria that could be used to evaluate websites: Authorship Purpose Sources/Coverage Accuracy Objectivity Currency Appearance

Data What do you think about when you hear the word data? Where can it be found? Where does it come from? What are all the ways that you (or people in general) give off data?

Artificial Intelligence What is intelligence? Are computers intelligent? Can any computer based system be intelligent? What qualities would it have to have?

Know the information (details) in these articles prompt-netflix-to-cancel-contest/

1. Specify the problem - a first step to solving a problem is to identify it as specifically as possible. It involves evaluating the present state and determining how it differs from the goal state. 2. Analyze the problem - analyzing the problem involves learning as much as you can about it. It may be necessary to look beyond the obvious, surface situation, to stretch your imagination and reach for more creative options. seek other perspectives be flexible in your analysis consider various strands of impact brainstorm about all possibilities and implications research problems for which you lack complete information. Get help. 3. Formulate possible solutions - identify a wide range of possible solutions. try to think of all possible solutions be creative consider similar problems and how you have solved them 4. Evaluate possible solutions - weigh the advantages and disadvantages of each solution. Think through each solution and consider how, when, and where you could accomplish each. Consider both immediate and long-term results. Mapping your solutions can be helpful at this stage. 5. Choose a solution - consider 3 factors: compatibility with your priorities - amount of risk -practicality

Group Problem Solving Activity The group has an eight litre container full of toxic waste and two empty containers, one 3 litres and the other one 5 litres. They must split the eight litres into two of the containers, each with exactly four litres in them Pour the 8 litres into the 3 litres leaving503

Group Problem Solving Activity The group has an eight litre container full of toxic waste and two empty containers, one 3 litres and the other one 5 litres. They must split the eight litres into two of the containers, each with exactly four litres in them Pour the 8 litres into the 3 litres leaving503 Pour the three into the 5 litre leaving530 Pour the 5 litres into the 3 litres leaving233 Pour the three into the 5 litres leaving251 Pour the five back into the 8 leaving701 Pour the 1 from the 3 to the 5 leaving710 Pour the seven into the 3 leaving413 Pour the one from the 3 into the 5 leaving440

Handshake Algorithm Including you… If you shake everyone’s hand in the room, how many hands are you going to shake? There are N people in a room including you. If you shake everyone in the room’s hand, how many hands are you going to shake?

Cornrow History African Origins Middle Passage Civil War to Civil Rights Hip Hop Also be familiar with the cornrow math Symmetry/Translation/Iteration csdt.rpi.edu

How many numbers can you represent with a 3 digit (binary) number? Convert the number to decimal. Translate a binary message

Building a Tower Donald trump wants to build a tower 20 meters tall. Using the tower building rules, how many days would it take?

Selection Sort A selection sort is a type of sort in which a list is searched for the smallest item in the list and that item is placed in the first position. Then the remaining list is searched for the smallest item and that item is placed in the next position. This process is repeated until there are no items left.

Quicksort Quicksort is a type of sort in which one item is randomly chosed from a list. The remaining items are sorted into two lists, those that are smaller, and those that are bigger than the randomly selected number. The two subsequent lists are then sorted using the same method, and this is repeated until the size of the list is 1. (there is nothing left to sort.)

Minimal Spanning Trees Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees. We can also assign a weight to each edge, which is a number representing how unfavorable it is, and use this to assign a weight to a spanning tree by computing the sum of the weights of the edges in that spanning tree.connectedundirected graphspanning treesubgraphtreevertices A minimum spanning tree (MST) or minimum weight spanning tree is then a spanning tree with weight less than or equal to the weight of every other spanning tree.

Alternative Representation

Selection Sort 10, 5, 3, 8, 4, 1 Perform a selection sort on the data above. Show the list after each pass through the data After 1 st pass: 1, 10, 5, 3, 8, 4 How many passes will it take? How many comparisons will occur?

Quicksort 4, 10, 5, 3, 8, 1 A selection sort is being performed on the data above. Assume that the first number of the list is always chosen as the middle number. What will the list look like after the first pass? How many comparisons will occur before the list is sorted?

Draw this data using a graphical representation, then find the minimal spanning tree for this graph ABCD A-510- B5-34 C 3-2 D-42-

Building a Tower Donald trump wants to build a tower 50 meters tall. Using the tower building rules, how many days would it take?

Fill the barrels The group has an seven litere container full of toxic waste and two empty containers, one four liters and the other one two liters. They must split the seven liters into two of the containers, so that there are three liters in the 7 liter container and four liters in the 4 liter container 74 2 Pour the 7 liters into the 2 liters leaving502 5 liters in the 7 liter container