CmpSci 187: Programming with Data Structures Spring 2015

Save this PDF as:

Size: px
Start display at page:

Transcription

1 CmpSci 187: Programming with Data Structures Spring 2015 Lecture #9 John Ridgway February 26, Recursive Definitions, Algorithms, and Programs Recursion in General In mathematics and computer science we often have definitions of concepts that refer to themselves. We call them recursive. For example: A directory in most operating systems, for example, is something that contains things that are either files or directories. A statement in Java might be an if statement, and an if statement is made up of the words if and else, a boolean expression in parentheses, and one or two statements. A postfix expression is either an operand or two postfix expressions followed by an operator. Recursive Algorithms Recursive algorithms are algorithms that call themselves, but only on a smaller version of the same problem. They are most useful when applied to recursively defined concepts. Much of CMPSCI 250 is devoted to the relationship of recursive definitions and algorithms to inductive proofs here we will look at the definitions and algorithms. Computing Factorials The factorial of a non-negative integer n, written n!, is the product of all the numbers from 1 through n, inclusive, or n. 1

2 (The factorial of 0 is 1, because multiplying together an empty set of numbers is like not multiplying at all, or multiplying by 1.) For example, 5! = = 120. Here is a recursive definition of factorial : 0! = 1, and if n > 0, n! = n (n 1)! Computing Factorials (continued) If we use this definition to try to calculate 5!, we get that 5! = 5 4!. If we apply the definition again to 4!, we get that 5! = 5 4 3!. Continuing in the same way, we get 5! = ! = ! = ! = just as in the non-recursive definition. Recursive Code for Factorials The recursive definition is easy to turn into code, as is the original iterative definition: public static int factorial ( int n) { if (n == 0) { return 1; else { return n* factorial (n -1); public static int iterfact ( int n) { int x = 1; for ( int i =1; i <=n; i ++) {x *= i; return x; Clicker Question #1 public int foo ( int n) { if (n <= 1) { return 0; return 1 + foo (n -2); What is returned by the above recursive method if called with a positive integer n as parameter? A. n B. 0 C. n/2 D. the method never returns a value 2

3 Recursive Factorial Example What happens when we run the recursive code with a parameter of 5? That call makes a call on factorial(4), which calls factorial(3), which calls factorial(2), which calls factorial(1), which calls factorial(0). This returns 1 to the factorial(1), which returns 1 to factorial(2), which returns 2 to factorial(3), which returns 6 to factorial(4), which returns 24 to factorial(5), which returns 120, the right answer. 2 The Three Questions Three Fundamental Questions For a recursive algorithm to work correctly on a particular input, we need positive answers to the three questions that DJW pose in Section 4.2: Does the algorithm have a base case? Does every recursive call make progress toward the base case? Can we show that the general call to the algorithm gets the right answer if we assume that all the recursive calls get the right answer? Three Fundamental Questions (continued) A base case is where there is no further recursion. Our factorial algorithm has a base case of n = 0. We can often guarantee progress because some parameter gets smaller with every call. Our factorial algorithm always calls factorial(n-1), so we get smaller if we are positive. We can justify correctness, assuming correctness of the calls, by a recursive definition. This is clear for factorials. Clicker Question #2 public void clear ( Stack < Integer > s) { if (!s. empty ()) { s. pop (); clear (s); What is the base case of this recursive method? A. a StackUnderflowException is thrown B. s has a finite number of elements C. calling clear makes the stack smaller D. s is empty 3

4 3 The Towers of Hanoi Towers of Hanoi In the Towers of Hanoi game, there are three pegs and n rings of different sizes. Originally all n rings are on the first peg, with the largest at the bottom and the others in order of size above it. Towers of Hanoi We want to move all the rings to another peg, following the rules: we move one ring at a time; and no larger peg may ever be put atop a smaller peg. A Recursive Solution We can recursively solve the puzzle by defining the following procedure to move k rings from peg A to peg B. This turns out to take 2 k 1 moves. public void move ( peg A, peg B, int k) { if (k == 1) { else { move (A, C, k -1); move (C, B, k -1); A Recursive Solution We can recursively solve the puzzle by defining the following procedure to move k rings from peg A to peg B. This turns out to take 2 k 1 moves. 4

5 public void move ( peg A, peg B, int k) { if (k == 0) { // nothing to do else { move (A, C, k -1); move (C, B, k -1); Clicker Question #3 public void move ( peg A, peg B, int k) { if (k!= 0) { move (A, C, k -1); move (C, B, k -1); How do we know that this method will make progress toward its base case? A. we move at least one ring with each call B. the parameter k decreases with each call C. the base case has k equal to 1 D. each call has only two recursive calls 4 Counting Blobs Grids and Continents (Blobs) In games like CivilizationTM, the computer creates a map to play on, with land areas, water areas, different terrain for each area, and so forth. We re now going to look at a simple version of this where the world is a rectangular grid of squares, each one land or water. Squares are considered adjacent if they share a horizontal or vertical edge, not if they just meet at a corner. Grids and Continents (continued) A continent (called a blob in DJW) is a set of land squares such that you may travel by land from any square on the continent to any other square on the continent, but not to any other square. Again, you cannot jump diagonally across a corner in this process. We re going to look at the computational problem of counting the continents in a particular rectangular map. We ll be greatly helped by the use of recursion. 5

6 Continent Example On the left, land squares have an X and water squares have a -. On the right, the five continents have been identified and each land square labeled with the name of its continent. X-X--X--X-- A-A--B--C-- XXX--X----- AAA--B XX-X AA-B XX BB X---XXX ----D---EEE Clicker Question #4 How many continents does this grid have? Continent Example X-X--XXX---X-XXXX--X-- XXX--X--XXXXXX--X XXXX XX-X XX XXXXX XX-XXXX----X---XXX A. 3 B. 4 C. 5 D. 6 DJW s code only counts the continents without naming or marking them. We could traverse the grid, counting the squares. But this over-counts each continent, counting one for each square in it. The right idea is to traverse the grid; the first time you find one of the squares of a continent increment your counter, then mark all of the squares of the continent. Recursive Marking Use a boolean array visited that will hold true for every land square determined to be part of a continent. Set this visited value true for every square reachable from the target square by marking the target square then recursively marking any of its four neighbors that are in the grid and are unseen land squares. 6

7 Code to Mark Continents private void markblob ( int row, int col ) { visited [ row ][ col ] = true ; if (( row - 1) >= 0 && grid [ row - 1][ col ] &&! visited [ row - 1][ col ]) { markblob ( row - 1, col ); // same for ( row + 1, col ) // same for ( row, col - 1) // same for ( row, col + 1) Answering the Three Questions for markblob Base case: when we call markblob on a square that has no unseen land squares as neighbors, it just marks its target square and returns. Progress toward base case: every time we mark a square, we reduce the total number of unseen land squares in the grid, which started out as a finite number. And every call to markblob marks at least one such square, because we only ever call it on an unseen land square. The Third Question: Correctness General correctness: We want to be sure that when markblob(i,j) is called, it marks (i, j) and every unseen land square that can be reached from (i, j) by using unseen land squares. Suppose we are sure that this property is true for all the calls to markblob on neighbors of (i, j). Then if a square is reachable from (i, j), it must be either be (i, j) itself or be reachable from one of its neighbors. So if the neighbor calls do their job, so does the first call. 7

CMPSCI 187: Programming With Data Structures. Lecture #15: Thinking Recursively David Mix Barrington 10 October 2012

CMPSCI 187: Programming With Data Structures Lecture #15: Thinking Recursively David Mix Barrington 10 October 2012 Thinking Recursively Recursive Definitions, Algorithms, and Programs Computing Factorials

CMPSCI 187: Programming With Data Structures. Lecture #16: Thinking About Recursion David Mix Barrington 12 October 2012

CMPSCI 187: Programming With Data Structures Lecture #16: Thinking About Recursion David Mix Barrington 12 October 2012 Thinking About Recursion Review of the Grid Class Recursion on Linked Structures

Recursive Definitions

Recursion Objectives Explain the underlying concepts of recursion Examine recursive methods and unravel their processing steps Explain when recursion should and should not be used Demonstrate the use of

We cover recursion in 150. Why do it again in 151?

Recursion We cover recursion in 150. Why do it again in 151? First, good solutions to problems are often recursive. Here is a quick way to sort a list of objects: split the list in half, recursively sort

CS200: Recursion and induction (recap from cs161)

CS200: Recursion and induction (recap from cs161) Prichard Ch. 6.1 & 6.3 1 2 Backtracking n Problem solving technique that involves moves: guesses at a solution. n Depth First Search: in case of failure

CmpSci 187: Programming with Data Structures Spring 2015

CmpSci 187: Programming with Data Structures Spring 2015 Lecture #17, Implementing Binary Search Trees John Ridgway April 2, 2015 1 Implementing Binary Search Trees Review: The BST Interface Binary search

Recursive Thinking. Chapter 8: Recursion. Recursive Definitions. Recursion. Java Software Solutions for AP* Computer Science A 2nd Edition

Chapter 8: Recursion Presentation slides for Recursive Thinking Recursion is a programming technique in which a method can call itself to solve a problem Java Software Solutions for AP* Computer Science

Chapter 15: Recursion

Chapter 15: Recursion Starting Out with Java: From Control Structures through Objects Fifth Edition by Tony Gaddis Chapter Topics Chapter 15 discusses the following main topics: Introduction to Recursion

Summary. csci 210: Data Structures Recursion. Recursive algorithms. Recursion. Topics READING:

Summary csci 210: Data Structures Recursion Topics recursion overview simple eamples Sierpinski gasket counting blobs in a grid Hanoi towers READING: LC tetbook chapter 7 Recursion Recursive algorithms

csci 210: Data Structures Recursion

csci 210: Data Structures Recursion Summary Topics recursion overview simple eamples Sierpinski gasket counting blobs in a grid Hanoi towers READING: LC tetbook chapter 7 Recursion A method of defining

Recursion. EECS2030: Advanced Object Oriented Programming Fall 2017 CHEN-WEI WANG

Recursion EECS2030: Advanced Object Oriented Programming Fall 2017 CHEN-WEI WANG Recursion: Principle Recursion is useful in expressing solutions to problems that can be recursively defined: Base Cases:

Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 27, 2013

Recursive Sequences Lecture 24 Section 5.6 Robb T. Koether Hampden-Sydney College Wed, Feb 27, 2013 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 27, 2013 1 / 21 1 Recursive Sequences

Recursion: Factorial (1) Recursion. Recursion: Principle. Recursion: Factorial (2) Recall the formal definition of calculating the n factorial:

Recursion EECS2030: Advanced Object Oriented Programming Fall 2017 CHEN-WEI WANG Recursion: Factorial (1) Recall the formal definition of calculating the n factorial: 1 if n = 0 n! = n (n 1) (n 2) 3 2

CmpSci 187: Programming with Data Structures Spring 2015

CmpSci 187: Programming with Data Structures Spring 2015 Lecture #22, More Graph Searches, Some Sorting, and Efficient Sorting Algorithms John Ridgway April 21, 2015 1 Review of Uniform-cost Search Uniform-Cost

Recursion. Thinking Recursively. Tracing the Recursive Definition of List. CMPT 126: Lecture 10. Recursion

Recursion CMPT 126: Lecture 10 Recursion Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 25, 2007 Recursion is the process of defining something in terms of

recursive algorithms 1

COMP 250 Lecture 11 recursive algorithms 1 Oct. 2, 2017 1 Example 1: Factorial (iterative)! = 1 2 3 1 factorial( n ){ // assume n >= 1 result = 1 for (k = 2; k

Stack. 4. In Stack all Operations such as Insertion and Deletion are permitted at only one end. Size of the Stack 6. Maximum Value of Stack Top 5

What is Stack? Stack 1. Stack is LIFO Structure [ Last in First Out ] 2. Stack is Ordered List of Elements of Same Type. 3. Stack is Linear List 4. In Stack all Operations such as Insertion and Deletion

CMSC 150 LECTURE 7 RECURSION

CMSC 150 INTRODUCTION TO COMPUTING ACKNOWLEDGEMENT: THESE SLIDES ARE ADAPTED FROM SLIDES PROVIDED WITH INTRODUCTION TO PROGRAMMING IN JAVA: AN INTERDISCIPLINARY APPROACH, SEDGEWICK AND WAYNE (PEARSON ADDISON-WESLEY

CmpSci 187: Programming with Data Structures Spring 2015

CmpSci 187: Programming with Data Structures Spring 2015 Lecture #13, Concurrency, Interference, and Synchronization John Ridgway March 12, 2015 Concurrency and Threads Computers are capable of doing more

CMPSCI 187 / Spring 2015 Postfix Expression Evaluator

CMPSCI 187 / Spring 2015 Postfix Expression Evaluator Due on Thursday, 05 March, 8:30 a.m. Marc Liberatore and John Ridgway Morrill I N375 Section 01 @ 10:00 Section 02 @ 08:30 1 CMPSCI 187 / Spring 2015

COT 3100 Spring 2010 Midterm 2

COT 3100 Spring 2010 Midterm 2 For the first two questions #1 and #2, do ONLY ONE of them. If you do both, only question #1 will be graded. 1. (20 pts) Give iterative and recursive algorithms for finding

CompSci 105 S2 C - ASSIGNMENT TWO -

CompSci 105 S2 C - ASSIGNMENT TWO - The work done on this assignment must be your own work. Think carefully about any problems you come across, and try to solve them yourself before you ask anyone else

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Explain the steps in a proof by (strong) mathematical induction Use (strong) mathematical induction

Counting Problems; and Recursion! CSCI 2824, Fall 2012!

Counting Problems; and Recursion! CSCI 2824, Fall 2012!!! Assignments To read this week: Sections 5.5-5.6 (Ensley/Crawley Problem Set 3 has been sent out today. Challenge problem today!!!!! So, to recap

Michele Van Dyne Museum 204B CSCI 136: Fundamentals of Computer Science II, Spring

Michele Van Dyne Museum 204B mvandyne@mtech.edu http://katie.mtech.edu/classes/csci136 CSCI 136: Fundamentals of Computer Science II, Spring 2016 1 Review of Java Basics Data Types Arrays NEW: multidimensional

CMPSCI 187: Programming With Data Structures. Lecture 6: The StringLog ADT David Mix Barrington 17 September 2012

CMPSCI 187: Programming With Data Structures Lecture 6: The StringLog ADT David Mix Barrington 17 September 2012 The StringLog ADT Data Abstraction Three Views of Data Java Interfaces Defining the StringLog

Recursion. Jordi Cortadella Department of Computer Science

Recursion Jordi Cortadella Department of Computer Science Recursion Introduction to Programming Dept. CS, UPC 2 Principle: Reduce a complex problem into a simpler instance of the same problem Recursion

Recursion. Let s start by looking at some problems that are nicely solved using recursion. First, let s look at generating The Fibonacci series.

Recursion The programs we have discussed so far have been primarily iterative and procedural. Code calls other methods in a hierarchical manner. For some problems, it is very useful to have the methods

Solving a 2D Maze. const int WIDTH = 10; const int HEIGHT = 10;

Solving a 2D Maze Let s use a 2D array to represent a maze. Let s start with a 10x10 array of char. The array of char can hold either X for a wall, for a blank, and E for the exit. Initially we can hard-code

UNIT 5A Recursion: Basics. Recursion

UNIT 5A Recursion: Basics 1 Recursion A recursive function is one that calls itself. Infinite loop? Not necessarily. 2 1 Recursive Definitions Every recursive definition includes two parts: Base case (non

-The Hacker's Dictionary. Friedrich L. Bauer German computer scientist who proposed "stack method of expression evaluation" in 1955.

Topic 15 Implementing and Using "stack n. The set of things a person has to do in the future. "I haven't done it yet because every time I pop my stack something new gets pushed." If you are interrupted

CMPSCI 187: Programming With Data Structures. Lecture #31: Graphs David Mix Barrington 26 November 2012

CMPSCI 187: Programming With Data Structures Lecture #31: Graphs David Mix Barrington 26 November 2012 Graphs Graph Vocabulary Applications of Graphs Paths in Graphs The Weighted Graph Interface Implementing

Backtracking. Module 6. The Eight Queens Problem. CS 147 Sam Houston State University Dr. McGuire. Backtracking. Recursion Revisited

Module 6 Recursion Revisited CS 147 Sam Houston State University Dr. McGuire Backtracking Backtracking A strategy for guessing at a solution and backing up when an impasse is reached Recursion and backtracking

Massachusetts Institute of Technology Department of Mechanical Engineering

Massachusetts Institute of Technology Department of Mechanical Engineering 2.003J/1.053J Dynamics & Control I Fall 2007 Homework 5 Solution Problem 5.1 : Calculating the factorial of non-negative integer

Where does the insert method place the new entry in the array? Assume array indexing starts from 0(zero).

Suppose we have a circular array implementation of the queue,with ten items in the queue stored at data[2] through data[11]. The current capacity of an array is 12. Where does the insert method place the

A Look Back at Arithmetic Operators: the Increment and Decrement

A Look Back at Arithmetic Operators: the Increment and Decrement Spring Semester 2016 Programming and Data Structure 27 Increment (++) and Decrement (--) Both of these are unary operators; they operate

DEEPIKA KAMBOJ UNIT 2. What is Stack?

What is Stack? UNIT 2 Stack is an important data structure which stores its elements in an ordered manner. You must have seen a pile of plates where one plate is placed on top of another. Now, when you

Pace University. Fundamental Concepts of CS121 1

Pace University Fundamental Concepts of CS121 1 Dr. Lixin Tao http://csis.pace.edu/~lixin Computer Science Department Pace University October 12, 2005 This document complements my tutorial Introduction

DUKE UNIVERSITY Department of Computer Science. Test 2: CompSci 100e

DUKE UNIVERSITY Department of Computer Science Test 2: CompSci 100e Name (print): Community Standard acknowledgment (signature): Problem 1 value 14 pts. grade Problem 2 9 pts. Problem 3 10 pts. Problem

Recursion. Chapter 5

Recursion Chapter 5 Chapter Objectives To understand how to think recursively To learn how to trace a recursive method To learn how to write recursive algorithms and methods for searching arrays To learn

COMP 250 Fall Recursive algorithms 1 Oct. 2, 2017

Recursion Recursion is a technique for solving problems in which the solution to the problem of size n is based on solutions to versions of the problem of size smaller than n. Many problems can be solved

Linear Data Structure

Linear Data Structure Definition A data structure is said to be linear if its elements form a sequence or a linear list. Examples: Array Linked List Stacks Queues Operations on linear Data Structures Traversal

Recursion defining an object (or function, algorithm, etc.) in terms of itself. Recursion can be used to define sequences

Section 5.3 1 Recursion 2 Recursion Recursion defining an object (or function, algorithm, etc.) in terms of itself. Recursion can be used to define sequences Previously sequences were defined using a specific

LIFO : Last In First Out

Introduction Stack is an ordered list in which all insertions and deletions are made at one end, called the top. Stack is a data structure that is particularly useful in applications involving reversing.

Recursion Chapter 3.5

Recursion Chapter 3.5-1 - Outline Induction Linear recursion Example 1: Factorials Example 2: Powers Example 3: Reversing an array Binary recursion Example 1: The Fibonacci sequence Example 2: The Tower

Data Structures And Algorithms

Data Structures And Algorithms Recursion Eng. Anis Nazer First Semester 2016-2017 Recursion Recursion: to define something in terms of itself Example: factorial n!={ 1 n=0 n (n 1)! n>0 Recursion Example:

Lecture 6: Combinatorics Steven Skiena. skiena

Lecture 6: Combinatorics Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Learning to Count Combinatorics problems are

Stack ADT. ! push(x) puts the element x on top of the stack! pop removes the topmost element from the stack.

STACK Stack ADT 2 A stack is an abstract data type based on the list data model All operations are performed at one end of the list called the top of the stack (TOS) LIFO (for last-in first-out) list is

8/22/12. Outline. Backtracking. The Eight Queens Problem. Backtracking. Part 1. Recursion as a Problem-Solving Technique

Part 1. Recursion as a Problem-Solving Technique CS 200 Algorithms and Data Structures CS 200 Algorithms and Data Structures [Fall 2011] 2 Outline Backtracking Formal grammars Relationship between recursion

Practice Midterm Exam #2

Eric Roberts Handout #25 CS106B January 30, 2013 Practice Midterm Exam #2 Review session: Sunday, February 3, 7:00 9:00 P.M., Hewlett 201 (next door) Midterm #1: Tuesday, February 5, 3:15 5:15 P.M., Braun

11/2/2017 RECURSION. Chapter 5. Recursive Thinking. Section 5.1

RECURSION Chapter 5 Recursive Thinking Section 5.1 1 Recursive Thinking Recursion is a problem-solving approach that can be used to generate simple solutions to certain kinds of problems that are difficult

Recursion. notes Chapter 8

Recursion notes Chapter 8 1 Tower of Hanoi A B C move the stack of n disks from A to C can move one disk at a time from the top of one stack onto another stack cannot move a larger disk onto a smaller

Data Structure (CS301)

WWW.VUPages.com http://forum.vupages.com WWW.VUTUBE.EDU.PK Largest Online Community of VU Students Virtual University Government of Pakistan Midterm Examination Spring 2003 Data Structure (CS301) StudentID/LoginID

APCS Semester #1 Final Exam Practice Problems

Name: Date: Per: AP Computer Science, Mr. Ferraro APCS Semester #1 Final Exam Practice Problems The problems here are to get you thinking about topics we ve visited thus far in preparation for the semester

Programming with Recursion. What Is Recursion?

Chapter 7 Programming with Recursion Fall 2017 Yanjun Li CS2200 1 What Is Recursion? How is recursion like a set of Russian dolls? Fall 2017 Yanjun Li CS2200 2 What Is Recursion? Recursive call A method

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS 1. Define global declaration? The variables that are used in more

COMP 250 Winter stacks Feb. 2, 2016

Stack ADT You are familiar with stacks in your everyday life. You can have a stack of books on a table. You can have a stack of plates on a shelf. In computer science, a stack is an abstract data type

CSE 2123 Recursion. Jeremy Morris

CSE 2123 Recursion Jeremy Morris 1 Past Few Weeks For the past few weeks we have been focusing on data structures Classes & Object-oriented programming Collections Lists, Sets, Maps, etc. Now we turn our

Lecture P6: Recursion

Overview Lecture P6: Recursion What is recursion? When one function calls ITSELF directly or indirectly. Why learn recursion? Powerful programming tool to solve a problem by breaking it up into one (or

The Stack ADT. Stacks. The Stack ADT. The Stack ADT. Set of objects in which the location an item is inserted and deleted is prespecified.

The Stack ADT Stacks Set of objects in which the location an item is inserted and deleted is prespecified Stacks! Insert in order! Delete most recent item inserted! LIFO - last in, first out Stacks 2 The

CS 171: Introduction to Computer Science II. Stacks. Li Xiong

CS 171: Introduction to Computer Science II Stacks Li Xiong Today Stacks operations and implementations Applications using stacks Application 1: Reverse a list of integers Application 2: Delimiter matching

You will not be tested on JUnit or the Eclipse debugger. The exam does not cover interfaces.

Com S 227 Fall 2016 Topics and review problems for Exam 2 Thursday, November 10, 6:45 pm Locations, by last name: (same locations as Exam 1) A-C Curtiss 0127, first floor only D-N Hoover 2055 O-Z Troxel

CS 536 Midterm Exam Spring 2013

CS 536 Midterm Exam Spring 2013 ID: Exam Instructions: Write your student ID (not your name) in the space provided at the top of each page of the exam. Write all your answers on the exam itself. Feel free

Sequence structure. The computer executes java statements one after the other in the order in which they are written. Total = total +grade;

Control Statements Control Statements All programs could be written in terms of only one of three control structures: Sequence Structure Selection Structure Repetition Structure Sequence structure The

TOPICS TO COVER:-- Array declaration and use.

ARRAYS in JAVA TOPICS TO COVER:-- Array declaration and use. One-Dimensional Arrays. Passing arrays and array elements as parameters Arrays of objects Searching an array Sorting elements in an array ARRAYS

Problem with Scanning an Infix Expression

Operator Notation Consider the infix expression (X Y) + (W U), with parentheses added to make the evaluation order perfectly obvious. This is an arithmetic expression written in standard form, called infix

CS/Math 40: Introduction to Discrete Mathematics Fall 015 Instructors: Beck Hasti, Gautam Prakriya Reading 8 : Recursion 8.1 Recursion Recursion in computer science and mathematics refers to the idea of

Fundamentals of Recursion. Solving Problems Recursively. Recursive example. Recursive example

Solving Problems Recursively Recursion is an indispensable tool in a programmer s toolkit Allows many complex problems to be solved simply Elegance and understanding in code often leads to better programs:

Data Structures & Algorithm Analysis. Lecturer: Souad Alonazi

Data Structures & Algorithm Analysis Lec(3) Stacks Lecturer: Souad Alonazi What is a stack? Stores a set of elements in a particular order Stack principle: LAST IN FIRST OUT = LIFO It means: the last element

COMP110 Jump Around. Go ahead and get today s code in Eclipse as shown on next few slides. Kris Jordan

Go ahead and get today s code in Eclipse as shown on next few slides COMP110 Jump Around Fall 2015 Sections 2 & 3 Sitterson 014 November 19th, 2015 Kris Jordan kris@cs.unc.edu Sitterson 238 Classroom Materials

CH ALGORITHM ANALYSIS CH6. STACKS, QUEUES, AND DEQUES

CH4.2-4.3. ALGORITHM ANALYSIS CH6. STACKS, QUEUES, AND DEQUES ACKNOWLEDGEMENT: THESE SLIDES ARE ADAPTED FROM SLIDES PROVIDED WITH DATA STRUCTURES AND ALGORITHMS IN JAVA, GOODRICH, TAMASSIA AND GOLDWASSER

Lecture Chapter 6 Recursion as a Problem Solving Technique

Lecture Chapter 6 Recursion as a Problem Solving Technique Backtracking 1. Select, i.e., guess, a path of steps that could possibly lead to a solution 2. If the path leads to a dead end then retrace steps

Solving problems by recursion

Solving problems by recursion How can you solve a complex problem? Devise a complex solution Break the complex problem into simpler problems Sometimes, the simpler problem is similar to (but smaller than)

Recursive Definitions Structural Induction Recursive Algorithms

Chapter 4 1 4.3-4.4 Recursive Definitions Structural Induction Recursive Algorithms 2 Section 4.1 3 Principle of Mathematical Induction Principle of Mathematical Induction: To prove that P(n) is true for

DNHI Homework 3 Solutions List, Stacs and Queues

Solutions List, Stacs and Queues Problem 1 Given the IntegerQueue ADT below state the return value and show the content of the, initially empty, queue of Integer objects after each of the following operations.

Introduction to Object-Oriented Programming

Introduction to Object-Oriented Programming Recursion Christopher Simpkins chris.simpkins@gatech.edu CS 1331 (Georgia Tech) Recursion 1 / 11 Recursion A recursive processes or data structure is defined

Recursion vs Induction. CS3330: Algorithms The University of Iowa

Recursion vs Induction CS3330: Algorithms The University of Iowa 1 Recursion Recursion means defining something, such as a function, in terms of itself For example, let f(x) = x! We can define f(x) as

Chapter 10 Recursion

Chapter 10 Recursion Written by Dr. Mark Snyder [minor edits for this semester by Dr. Kinga Dobolyi] Recursion implies that something is defined in terms of itself. We will see in detail how code can be

Basics of Java: Expressions & Statements. Nathaniel Osgood CMPT 858 February 15, 2011

Basics of Java: Expressions & Statements Nathaniel Osgood CMPT 858 February 15, 2011 Java as a Formal Language Java supports many constructs that serve different functions Class & Interface declarations

COMP Logic for Computer Scientists. Lecture 25

COMP 1002 Logic for Computer Scientists Lecture 25 B 5 2 J Admin stuff Assignment 4 is posted. Due March 23 rd. Monday March 20 th office hours From 2:30pm to 3:30pm I need to attend something 2-2:30pm.

Exceptions and Design

Exceptions and Exceptions and Table of contents 1 Error Handling Overview Exceptions RuntimeExceptions 2 Exceptions and Overview Exceptions RuntimeExceptions Exceptions Exceptions and Overview Exceptions

STACKS. A stack is defined in terms of its behavior. The common operations associated with a stack are as follows:

STACKS A stack is a linear data structure for collection of items, with the restriction that items can be added one at a time and can only be removed in the reverse order in which they were added. The

Computer Science 252 Problem Solving with Java The College of Saint Rose Spring Topic Notes: Collections

Computer Science 252 Problem Solving with Java The College of Saint Rose Spring 2014 Topic Notes: Collections Our next major topic involves additional common mechanisms for naming collections of items.

COMP-202: Foundations of Programming. Lecture 13: Recursion Sandeep Manjanna, Summer 2015

COMP-202: Foundations of Programming Lecture 13: Recursion Sandeep Manjanna, Summer 2015 Announcements Final exams : 26 th of June (2pm to 5pm) @ MAASS 112 Assignment 4 is posted and Due on 29 th of June

Outline queue implementation: linked queue application of queues and stacks: data structure traversal double-ended queues application of queues: simulation of an airline counter random numbers recursion

C++ Basics. Data Processing Course, I. Hrivnacova, IPN Orsay

C++ Basics Data Processing Course, I. Hrivnacova, IPN Orsay The First Program Comments Function main() Input and Output Namespaces Variables Fundamental Types Operators Control constructs 1 C++ Programming

Introduction to the Java Basics: Control Flow Statements

Lesson 3: Introduction to the Java Basics: Control Flow Statements Repetition Structures THEORY Variable Assignment You can only assign a value to a variable that is consistent with the variable s declared

UNIT 3

UNIT 3 Presentation Outline Sequence control with expressions Conditional Statements, Loops Exception Handling Subprogram definition and activation Simple and Recursive Subprogram Subprogram Environment

Recursive Methods and Problem Solving. Chris Kiekintveld CS 2401 (Fall 2010) Elementary Data Structures and Algorithms

Recursive Methods and Problem Solving Chris Kiekintveld CS 2401 (Fall 2010) Elementary Data Structures and Algorithms Review: Calling Methods int x(int n) { int m = 0; n = n + m + 1; return n; int y(int

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms Chapter 4: Trees (Binary) Text: Read Weiss, 4.1 4.2 Izmir University of Economics 1 Preliminaries - I (Recursive) Definition: A tree is a collection of nodes. The

CSc 520 Principles of Programming Languages. 26 : Control Structures Introduction

CSc 520 Principles of Programming Languages 26 : Control Structures Introduction Christian Collberg Department of Computer Science University of Arizona collberg+520@gmail.com Copyright c 2008 Christian

There are three questions on this exam. You have 2 hours to complete it. Please indent your program so that it is easy for the grader to read.

There are three questions on this exam. You have 2 hours to complete it. Please indent your program so that it is easy for the grader to read. 1. Write a function named largestadjacentsum that iterates

Print words entered, but backwards. Solving Problems Recursively. Faster exponentiation. Exponentiation

Solving Problems Recursively Recursion is an indispensable tool in a programmer s toolkit Allows many complex problems to be solved simply Elegance and understanding in code often leads to better programs:

Chapter 6 Recursion. The Concept of Recursion

Data Structures for Java William H. Ford William R. Topp Chapter 6 Recursion Bret Ford 2005, Prentice Hall The Concept of Recursion An algorithm is recursive if it can be broken into smaller problems of

def F a c t o r i a l ( n ) : i f n == 1 : return 1 else : return n F a c t o r i a l ( n 1) def main ( ) : print ( F a c t o r i a l ( 4 ) )

116 4.5 Recursion One of the most powerful programming techniques involves a function calling itself; this is called recursion. It is not immediately obvious that this is useful; take that on faith for

Recursion. Data and File Structures Laboratory. DFS Lab (ISI) Recursion 1 / 27

Recursion Data and File Structures Laboratory http://www.isical.ac.in/~dfslab/2017/index.html DFS Lab (ISI) Recursion 1 / 27 Definition A recursive function is a function that calls itself. The task should

Stacks. Revised based on textbook author s notes.

Stacks Revised based on textbook author s notes. Stacks A restricted access container that stores a linear collection. Very common for solving problems in computer science. Provides a last-in first-out

Unit 5: Recursive Thinking

AP Computer Science Mr. Haytock Unit 5: Recursive Thinking Topics: I. Recursion II. Computational limits III. Recursion in graphics Materials: I. Hein ch. 3.2 II. Rawlins: Towers of Hanoi III. Lewis &