What is CS?.

Slides:

Advertisements

Similar presentations

What is CS? And what is it not?. Ten Reasons to Study Computer Science 1.Computing is part of everything we do 2.Allows you to solve complex problems.

Advertisements

Begin $100 $200 $300 $400 $500 OrderOfOperationsEquationsIntegersSubstitutionsI’ll Take it Exponents.

What is Intractable? Some problems seem too hard to solve efficiently. Question 1: Does an efficient algorithm exist?  An O(a ) algorithm, where a > 1,

CPE702 Complexity Classes Pruet Boonma Department of Computer Engineering Chiang Mai University Based on Material by Jenny Walter.

Solving Equations = 4x – 5(6x – 10) -132 = 4x – 30x = -26x = -26x 7 = x.

The Theory of NP-Completeness

Technical Question Technical Question

VAVLPVCTYMAUS PSABLADDERZSB EBSANTESHTICL RLDUDSKTTVSRA EDEARCENEAUOD CRFNORSASINTD TPEUUOCPTDATP UNRTMTRBEEXME MIEUSUULSNSNN USNMEMNISAIIT AESXSVPENNISI.

C OMPUTER P ROGRAMMING 1 Introduction to Programming.

QPLNHTURBIOTS CADAIASOINCOS OSTPOSTLGVAGT AJRLFKLEROUEA CLARITYSOLSTB HTEAMVSRUVAHI INTERACTPELEL NAPKSOCIALIRI GSOCIOGRAMTST CONFORMITYYTY 14 WORDS ANSWERS.

1 Lower Bounds Lower bound: an estimate on a minimum amount of work needed to solve a given problem Examples: b number of comparisons needed to find the.

3.6 Solving Absolute Value Equations and Inequalities

CS404 Design and Analysis of Algorithms BBy DDr. M V S Peri Sastry BB.E, PhD(BITS-Pilani)

Searching & Sorting. Algorithms Step by step recipe to do a task…

Young CS 331 D&A of Algo. NP-Completeness1 NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and.

Prerequisite Skills VOCABULARY CHECK Copy and complete the statement. 2. The graph of a linear inequality in two variables is the set of all points in.

Flowcharts C++ Lab. Algorithm An informal definition of an algorithm is: a step-by-step method for solving a problem or doing a task. Input data A step-by-step.

CPSC 121: Models of Computation REVIEW. Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss,

Limitation of Computation Power – P, NP, and NP-complete

University of British Columbia

Algebra 1Predicting Patterns & Examining Experiments

In a System of Equations you need to solve for both x and y values

IGCSE 6 Cambridge Effectiveness of algorithms Computer Science

Algebra 1 Review - Station 1

1.5 Intractable problems.

3.3: The Quadratic Formula

Computer Science 210 Computer Organization

Notes Over 9.6 An Equation with One Solution

ASU 101: The ASU Experience Computer Science Perspective

Evaluate the expression ( i) + ( i) and write the result in the form a + bi. Choose the answer from the following: i i i.

Warm-Up Solve the system by substitution..

Analysis and design of algorithm

Solve a system of linear equation in two variables

Problem solving Strategies

An Introduction to the Problem Solving Process

An Introduction to the Problem Solving Process

Solving Quadratic Equations by Factoring March 16, 2015

3.5 Solving systems of equations in 3 variables

UNIT 3 CHAPTER 1 LESSON 4 Using Simple Commands.

Searching & Sorting.

Laws of Exponents Product Rule Quotient Rule

Computer Programming.

Algorithms Key Revision Points.

Chapter 11 Limitations of Algorithm Power

Graph the equation..

Notes Over 9.1 Finding Square Roots of Numbers

Problem: we can’t solve the differential equation!!!

Solving Equations involving Decimal Coefficients

Introduction to programming

NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979.

Laws of Exponents Product Rule Quotient Rule

Equations Objectives for today’s lesson :

Solving for x and y when you have two equations

Bell work Build the following expressions to find which is greater:

CS 150: Computing - From Ada to the Web

Using Number Sense to Solve One-Step Equations

Solving Equations with Absolute Values

Trial & Improvement Friday, 24 May 2019.

Solving Quadratic Equations by Factorisation

6.6 Solve Radical Equations

Algorithms CSCI 235, Spring 2019 Lecture 36 P vs

Solving Equations Using Algebra Tiles

Trigonometric Equations

Solving By Substitution

Title: select a descriptive title

11-5 Solving Rational Equations

Solving Quadratic Equations by Factoring March 11, 2016

Computer Science 210 Computer Organization

Presentation transcript:

What is CS?

What is Computer Science Grandparent definition: Computer Science studies solving problems using computers

What is Computer Science Better definition: Computer science is the study of what can be efficiently computed

Computed Computed : solved with an algorithm Algorithm : Step by step instructions to solve a problem

Limits of Computation Not every answer can be computed

Other Undecidable Things Can we tile a plane using a given set of tiles?

Other Undecidable Things Are there integer solutions to equations: a2 + b2 = c2 : many solutions a3 + b3 = c3 : no solutions x2 – 61y2 = 1 : (226153980, 1766319049)

What is Computer Science Better definition: Computer science is the study of what can be efficiently computed

Efficiency Practically solvable problems are ones we can compute efficiently Hard problems Knapsack problem Traveling Salesman Problem

Efficiency Hard can be good

Efficiency Different algorithms may solve the same problem at different speeds

Efficiency I'm thinking of a number between 1 and 100 You try to guess it I'll give too low/too high hints

Efficiency I'm thinking of a number between 1 and 100 Method #1 You try to guess it I'll give too low/too high hints Method #1 1, 2, 3….

Efficiency I'm thinking of a number between 1 and 100 Method #2 You try to guess it I'll give too low/too high hints Method #2 50, 75, 63…

Possible Unchecked Numbers Efficiency I'm thinking of a number between 1 and 100 Method #1 : max of 100 guesses Method #2 : max of 7 guesses Guess # Possible Unchecked Numbers 100 1 50 2 25 3 12 4 6 5 7

Efficiency I'm thinking of a number between 1 and 100 Method #1 : max of 100 guesses Method #2 : max of 7 guesses I'm thinking of a number between 1 and 1,000,000 Method #1 : max of 1,000,000 guesses Method #2 : max of 20 guesses

Why Computer Science Computer science is the study of what can be efficiently computed. General tools to find efficient solutions to computational problems

Why Computer Science General tools to find efficient solutions to computational problems Applicable in any field involving computation

Programming Programming is how we express algorithms for computers The language of CS Programming is: First skill you must acquire to study CS (CS161/162/260) The skill most CS grads use to pay the bills