csc 151 spring 2020 topic list recursion
play

CSC 151 Spring 2020 Topic: List Recursion March 6, 2020 Day 20 - PowerPoint PPT Presentation

Jan 20, 2023 •354 likes •465 views

CSC 151 Spring 2020 Topic: List Recursion March 6, 2020 Day 20 Agenda for today Peer Support Opportunities Quiz 6 Topics Exam 2 Reminders List Recursion Lab Reflection Wrap-up Peer Support Opportunities Orchestra

  1. CSC 151 Spring 2020 Topic: List Recursion March 6, 2020 Day 20

  2. Agenda for today • Peer Support Opportunities • Quiz 6 Topics • Exam 2 Reminders • List Recursion • Lab • Reflection • Wrap-up

  3. Peer Support Opportunities ● Orchestra Concert, Saturday at 2pm

  4. Quiz 6 Topics Recursion Verifying Preconditions

  5. Exam 2 Reminders Will be posted by 5:00pm today, due next Thursday. Open Notes/Book/Web with citations. You may only ask me for help – no one else. Getting Started: Download Starter Code Generate a random ID Read every problem carefully, as well as Exam Procedures Tips: Start Early – Don’t Panic Save Often Ask me for help There’s more to Life than CS: Do the Prologue & Epilogue, document your time

  6. List Recursion Assume we have the procedure (westernmost city1 city2) Finish the following recursive procedure: (define westernmost-city (lambda (zips) (if … … …. )))

  7. List Recursion Assume we have the procedure (westernmost city1 city2) Finish the following recursive procedure: (define westernmost-city (lambda (zips) (if (null? (cdr zips)) (car zips) (westernmost (car zips) (westernmost-city (cdr zips)) ) )))

  8. Lab Time Start with the person on the East side of the room.

  9. Reflection Time Our topic for Monday is Numeric Recursion. Given that today’s topic for reading was List Recursion , what do you think Numeric Recursion will look like? Try to be as specific as possible. Talk about the base case and recursive case. Can you guess a ‘common format’?

  10. Upcoming Work Please submit Exercise 6 by Monday at 10:30 pm. Include 6P documentation. To: csc-151-02-grader@grinnell.edu CC: Your lab partner Subject: CSC 151-02 Lab 3/6 Reading for Monday Finish today’s lab before Monday • Exam 2 Prologue due Sunday by 10:30 pm

Recommend

CSC 151 Spring 2020 Topic: Vectors April 3, 2020 Day 26 Announcements CS Table: - Virtually

CSC 151 Spring 2020 Topic: Vectors April 3, 2020 Day 26 Announcements CS Table: - Virtually

CSC 151 Spring 2020 Topic: Vectors April 3, 2020 Day 26 Announcements CS Table: - Virtually on WebEx, Tuesdays at 12:00pm Central Time. If youre looking for community/socialization, join us! Email sent through CS student mailing list.

462 views • 12 slides
Recursion & Induction CS16: Introduction to Algorithms & Data Structures Spring 2020

Recursion & Induction CS16: Introduction to Algorithms & Data Structures Spring 2020

Recursion & Induction CS16: Introduction to Algorithms & Data Structures Spring 2020 Outline Recursion Recurrence relations Plug & chug Induction Strong vs. weak induction 3 Scouting US CA IN RI NY Ind.

664 views • 48 slides
TOPIC 11 HTML (NOT AS ADVANCED) Max Fowler (Computer Science)

TOPIC 11 HTML (NOT AS ADVANCED) Max Fowler (Computer Science)

CS 105: TOPIC 10 LISTS (ADVANCED) TOPIC 11 HTML (NOT AS ADVANCED) Max Fowler (Computer Science) https://pages.github-dev.cs.illinois.edu/cs-105/web/ JULY 19, 2020 Week 6 Video Series Topics List Slices List Nesting List

242 views • 23 slides
More Recursion, Linked List Recursion, and Generating All Combinations Mark Redekopp 2 Tracing

More Recursion, Linked List Recursion, and Generating All Combinations Mark Redekopp 2 Tracing

1 CSCI 103 More Recursion, Linked List Recursion, and Generating All Combinations Mark Redekopp 2 Tracing Recursive Algorithms 3 Tracing Recommendations Show the call tree Draw each instance of a recursive function as a box and

1.32k views • 62 slides
Recursion and Induction: Examples of Programming with Lists Greg Plaxton Theory in Programming

Recursion and Induction: Examples of Programming with Lists Greg Plaxton Theory in Programming

Recursion and Induction: Examples of Programming with Lists Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin Mutual Recursion The function divide0 splits a given list of

324 views • 18 slides
Recursion Contents Recursion in general Simple examples The need to move closer to a

Recursion Contents Recursion in general Simple examples The need to move closer to a

Lecture 4 Recursion Contents Recursion in general Simple examples The need to move closer to a solution List processing predicates Recursion in general Recursion is the idea of defining something in terms of itself. It

474 views • 15 slides
A Computational Understanding of Classical (Co)Recursion P a ul Downen a nd Zen a M. Ariol a PPDP

A Computational Understanding of Classical (Co)Recursion P a ul Downen a nd Zen a M. Ariol a PPDP

A Computational Understanding of Classical (Co)Recursion P a ul Downen a nd Zen a M. Ariol a PPDP 2020, September 8 10 Topic Topic Both programs and proofs with loops Topic Both programs and proofs with loops (Co)Recursion and

1.74k views • 145 slides
1 Recursive Definitions Infinite Recursion The recursive part of the LIST definition is used

1 Recursive Definitions Infinite Recursion The recursive part of the LIST definition is used

CSC 2014 Java Bootcamp Lecture 9 Recursion 2 Recursion Recursion is a fundamental programming technique that can provide an elegant solution certain kinds of problems RECURSIVE THINKING 3 4 Recursive Thinking Recursive Definitions

148 views • 4 slides
Machine Learning 2 DS 4420 - Spring 2020 Topic Modeling 2 Byron C. Wallace Last time: Topic

Machine Learning 2 DS 4420 - Spring 2020 Topic Modeling 2 Byron C. Wallace Last time: Topic

Machine Learning 2 DS 4420 - Spring 2020 Topic Modeling 2 Byron C. Wallace Last time: Topic Modeling! Word Mixtures Idea: Model text as a mixture over words (ignore order) gene 0.04 dna 0.02 genetic 0.01 .,, life 0.02

890 views • 37 slides
One-Slide Summary List Recursion Examples & Recursive Procedures Recursive functions

One-Slide Summary List Recursion Examples & Recursive Procedures Recursive functions

One-Slide Summary List Recursion Examples & Recursive Procedures Recursive functions that operate on lists have a similar structure. list-cruncher is a higher-order function that can be used to implement many others. Decisions in a

331 views • 9 slides
CS 251 Fall 2019 CS 251 Spring 2020 Principles of Programming Languages Principles of

CS 251 Fall 2019 CS 251 Spring 2020 Principles of Programming Languages Principles of

CS 251 Fall 2019 CS 251 Spring 2020 Principles of Programming Languages Principles of Programming Languages Ben Wood Ben Wood Tail Recursion +tail.rkt https://cs.wellesley.edu/~cs251/s20/ 1 Tail Recursion Topics Recursion is an

414 views • 25 slides
CSC 151 Spring 2020 Topic: Trees April 10, 2020 Day 29 Peer Support Opportunities Are there

CSC 151 Spring 2020 Topic: Trees April 10, 2020 Day 29 Peer Support Opportunities Are there

CSC 151 Spring 2020 Topic: Trees April 10, 2020 Day 29 Peer Support Opportunities Are there any online events happening where your classmates could support you? Let me know! Self-Checks Describe the series of steps that bst-find would use in

235 views • 11 slides
CS 251 Fall 2019 CS 251 Spring 2020 Topics Principles of Programming Languages Principles

CS 251 Fall 2019 CS 251 Spring 2020 Topics Principles of Programming Languages Principles

CS 251 Fall 2019 CS 251 Spring 2020 Topics Principles of Programming Languages Principles of Programming Languages Ben Wood Ben Wood Recursion is an elegant and natural match for many computations and data structures. Tail Recursion

549 views • 7 slides
One-Slide Summary List Writing recursive functions that operate on Recursion: recursive data

One-Slide Summary List Writing recursive functions that operate on Recursion: recursive data

One-Slide Summary List Writing recursive functions that operate on Recursion: recursive data structures takes practice . There are standard approaches to such problems. list? , member , sumlist , intsto , map and filter Practice are all

757 views • 6 slides
Recursion Mason Vail, Boise State University Computer Science Examples from Java Foundations, 3rd

Recursion Mason Vail, Boise State University Computer Science Examples from Java Foundations, 3rd

Recursion Mason Vail, Boise State University Computer Science Examples from Java Foundations, 3rd Ed., by Lewis, DePasquale, and Chase Recursive Definition 24, 88, 40, 37 A LIST is a: number or number comma LIST Infinite Recursion Base Case

255 views • 12 slides
CSC 151 Spring 2020 Topic: Project Introduction April 17, 2020 Day 32 Exam 3 Reminder Exam 3

CSC 151 Spring 2020 Topic: Project Introduction April 17, 2020 Day 32 Exam 3 Reminder Exam 3

CSC 151 Spring 2020 Topic: Project Introduction April 17, 2020 Day 32 Exam 3 Reminder Exam 3 epilogue and cover sheet are due tonight (Friday) at 10:30 pm Central Time! CSC 151 Project Project Overview Find and use a new data set Do some

224 views • 8 slides
Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline

Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline

Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline Writing recursive functions that operate on Review: Procedure Problem Solving recursive data structures takes practice . There Review: list,

417 views • 6 slides
Class 09: Recursion practice, how recursive programs work Recall the list-length procedure

Class 09: Recursion practice, how recursive programs work Recall the list-length procedure

Class 09: Recursion practice, how recursive programs work Recall the list-length procedure (define (list-length alon) (cond [(empty? alon) 0] [(cons? alon) (+ 1 (list-length (rest alon)))])) Why does it correctly compute the length of any

751 views • 56 slides
CSC 151 Spring 2020 Topic: Wrap Up May 6, 2020 Day 40 A Brief History/Review of Scheme 1958

CSC 151 Spring 2020 Topic: Wrap Up May 6, 2020 Day 40 A Brief History/Review of Scheme 1958

CSC 151 Spring 2020 Topic: Wrap Up May 6, 2020 Day 40 A Brief History/Review of Scheme 1958 1972 1991 1995 LISP C Python Java 1957 1975 1993 Fortran Scheme R LISP Scheme Why Scheme? Minimalism LISP programmers know the value

339 views • 12 slides
Summary of topics COMP2111 Week 3 Recursion Term 1, 2020 Recursive Data Types Recursion and

Summary of topics COMP2111 Week 3 Recursion Term 1, 2020 Recursive Data Types Recursion and

Summary of topics COMP2111 Week 3 Recursion Term 1, 2020 Recursive Data Types Recursion and induction Induction Structural Induction 1 2 Summary of topics Recursion Fundamental concept in Computer Science Recursion in algorithms:

789 views • 21 slides
Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for

Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for

Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for defining data structures or algorithms in terms of themselves . A recursive algorithm is a form of decomposition where rather than choosing an arbitrary

846 views • 22 slides
Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search

Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search

Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search Revisited Recursion Recursion Versus Iteration Simple Recursion Recursive Methods When solving a problem using recursion, the idea is to

626 views • 13 slides
Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that ends the recursion -A reduction case that reduces the problem What are the base and stopping cases for the Fibonacci numbers? (sum of the previous

296 views • 11 slides
Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that ends the recursion -A reduction case that reduces the problem What are the base and stopping cases for the Fibonacci numbers? (sum of the previous

279 views • 8 slides

More recommend