lists cosc 450 programming paradigms 07 the definition of
play

Lists CoSc 450: Programming Paradigms 07 The definition of a list - PowerPoint PPT Presentation

Oct 09, 2023 •470 likes •1.33k views

CoSc 450: Programming Paradigms 07 Lists CoSc 450: Programming Paradigms 07 The definition of a list CoSc 450: Programming Paradigms 07 The definition of a list The empty list is a list. A nonempty list lst has two parts. (car

  1. CoSc 450: Programming Paradigms 07 Lists

  2. CoSc 450: Programming Paradigms 07 The definition of a list

  3. CoSc 450: Programming Paradigms 07 The definition of a list • The empty list is a list. • A nonempty list lst has two parts. • (car lst) — the first element of the list. • (cdr lst) — the rest of the list.

  4. CoSc 450: Programming Paradigms 07 The definition of a list • The empty list is a list. • A nonempty list lst has two parts. • (car lst) — the first element of the list. • (cdr lst) — the rest of the list. car is an element. cdr is a list.

  5. CoSc 450: Programming Paradigms 07 interleave (interleave ‘(a b c) ‘(d e f))

  6. CoSc 450: Programming Paradigms 07 interleave (interleave ‘(a b c) ‘(d e f)) (car ‘(a b c)) a

  7. CoSc 450: Programming Paradigms 07 interleave (interleave ‘(a b c) ‘(d e f)) (car ‘(a b c)) (cdr ‘(a b c)) a (b c)

  8. CoSc 450: Programming Paradigms 07 interleave (interleave ‘(a b c) ‘(d e f)) (car ‘(a b c)) (cdr ‘(a b c)) a (b c) (interleave ‘(d e f) ‘(b c)) (d b e c f)

  9. CoSc 450: Programming Paradigms 07 interleave (interleave ‘(a b c) ‘(d e f)) (car ‘(a b c)) (cdr ‘(a b c)) a (b c) (interleave ‘(d e f) ‘(b c)) (d b e c f) a

  10. CoSc 450: Programming Paradigms 07 add-to-end (add-to-end ‘(a b c d) ‘x)

  11. CoSc 450: Programming Paradigms 07 add-to-end (add-to-end ‘(a b c d) ‘x) (car ‘(a b c d)) a

  12. CoSc 450: Programming Paradigms 07 add-to-end (add-to-end ‘(a b c d) ‘x) (car ‘(a b c d)) (cdr ‘(a b c d)) a (b c d)

  13. CoSc 450: Programming Paradigms 07 add-to-end (add-to-end ‘(a b c d) ‘x) (car ‘(a b c d)) (cdr ‘(a b c d)) a (b c d) (add-to-end ‘(b c d) ‘x) (b c d x)

  14. CoSc 450: Programming Paradigms 07 add-to-end (add-to-end ‘(a b c d) ‘x) (car ‘(a b c d)) (cdr ‘(a b c d)) a (b c d) (add-to-end ‘(b c d) ‘x) (b c d x) a

  15. CoSc 450: Programming Paradigms 07 (define add-to-end (lambda (lst elt) (if (null? lst) (cons elt '()) (cons (car lst) (add-to-end (cdr lst) elt))))) What is the efficiency of add-to-end ?

  16. CoSc 450: Programming Paradigms 07 (define add-to-end (lambda (lst elt) (if (null? lst) (cons elt '()) (cons (car lst) (add-to-end (cdr lst) elt))))) What is the efficiency of add-to-end ? Θ ( n )

  17. CoSc 450: Programming Paradigms 07 (define my-reverse (lambda (lst) (if (null? lst) '() (add-to-end (my-reverse (cdr lst)) (car lst))))) What is the efficiency of my-reverse ?

  18. CoSc 450: Programming Paradigms 07 (define my-reverse (lambda (lst) (if (null? lst) '() (add-to-end (my-reverse (cdr lst)) (car lst))))) What is the efficiency of my-reverse ? Θ ( n 2 )

  19. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3)

  20. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (car ‘(a b c)) a

  21. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (car ‘(a b c)) (cdr ‘(a b c)) a (b c)

  22. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (car ‘(a b c)) (cdr ‘(a b c)) a (b c) (cons ‘a ‘(1 2 3)) (a 1 2 3)

  23. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (car ‘(a b c)) (cdr ‘(a b c)) a (b c) (cons ‘a ‘(1 2 3)) (a 1 2 3) (reverse-onto '(b c) '(a 1 2 3)) (c b a 1 2 3)

  24. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2)))))

  25. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2)))))

  26. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2)))))

  27. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2)))))

  28. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2)))))

  29. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2))))) What is the efficiency of reverse-onto ?

  30. CoSc 450: Programming Paradigms 07 (reverse-onto '(a b c) '(1 2 3)) (c b a 1 2 3) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2))))) What is the efficiency of reverse-onto ? Θ ( n )

  31. CoSc 450: Programming Paradigms 07 ;; Efficient version of reverse (define your-reverse (lambda (lst) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2))))) (reverse-onto lst '())))

  32. CoSc 450: Programming Paradigms 07 ;; Efficient version of reverse (define your-reverse (lambda (lst) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2))))) (reverse-onto lst '())))

  33. CoSc 450: Programming Paradigms 07 ;; Efficient version of reverse (define your-reverse (lambda (lst) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2))))) (reverse-onto lst '())))

  34. CoSc 450: Programming Paradigms 07 ;; Efficient version of reverse (define your-reverse (lambda (lst) (define reverse-onto (lambda (lst1 lst2) (if (null? lst1) lst2 (reverse-onto (cdr lst1) (cons (car lst1) lst2))))) (reverse-onto lst '())))

  35. CoSc 450: Programming Paradigms 07 (merge '(2 4 6 8) '(1 3 5 8 9)) (1 2 3 4 5 6 8 9)

  36. CoSc 450: Programming Paradigms 07 (merge '(2 4 6 8) '(1 3 5 8 9)) (1 2 3 4 5 6 8 9) (car ‘(2 4 6 8)) 2

  37. CoSc 450: Programming Paradigms 07 (merge '(2 4 6 8) '(1 3 5 8 9)) (1 2 3 4 5 6 8 9) (car ‘(2 4 6 8)) (car ‘(1 3 5 8 9)) 2 1

  38. CoSc 450: Programming Paradigms 07 (merge '(2 4 6 8) '(1 3 5 8 9)) (1 2 3 4 5 6 8 9) (car ‘(2 4 6 8)) (car ‘(1 3 5 8 9)) 2 1 (cdr ‘(1 3 5 8 9)) (3 5 8 9)

  39. CoSc 450: Programming Paradigms 07 (merge '(2 4 6 8) '(1 3 5 8 9)) (1 2 3 4 5 6 8 9) (car ‘(2 4 6 8)) (car ‘(1 3 5 8 9)) 2 1 (cdr ‘(1 3 5 8 9)) (3 5 8 9) (merge '(2 4 6 8) '(3 5 8 9)) (2 3 4 5 6 8 9)

  40. CoSc 450: Programming Paradigms 07 (merge '(2 4 6 8) '(1 3 5 8 9)) (1 2 3 4 5 6 8 9) (car ‘(2 4 6 8)) (car ‘(1 3 5 8 9)) 2 1 (cdr ‘(1 3 5 8 9)) (3 5 8 9) (merge '(2 4 6 8) '(3 5 8 9)) (2 3 4 5 6 8 9) 1

  41. CoSc 450: Programming Paradigms 07 (odd-part '(g i r a f f e)) (g r f e)

  42. CoSc 450: Programming Paradigms 07 (odd-part '(g i r a f f e)) (g r f e) (car ‘(g i r a f f e)) g

  43. CoSc 450: Programming Paradigms 07 (odd-part '(g i r a f f e)) (g r f e) (car ‘(g i r a f f e)) g (cdr ‘(g i r a f f e)) (i r a f f e)

  44. CoSc 450: Programming Paradigms 07 (odd-part '(g i r a f f e)) (g r f e) (car ‘(g i r a f f e)) g (cdr ‘(g i r a f f e)) (i r a f f e) (even-part ‘(i r a f f e)) (r f e)

  45. CoSc 450: Programming Paradigms 07 (odd-part '(g i r a f f e)) (g r f e) (car ‘(g i r a f f e)) g (cdr ‘(g i r a f f e)) (i r a f f e) (even-part ‘(i r a f f e)) (r f e) g

  46. CoSc 450: Programming Paradigms 07 A child at the county fair wins 5 tickets. The redemption store carries the following items, priced in tickets: a — apples, 3 tickets each b — balls, 3 tickets each c — cookies, 2 tickets each d — dolls, 1 ticket each e — ear muffs, 1 ticket each

  47. CoSc 450: Programming Paradigms 07 A child at the county fair wins 5 tickets. The redemption store carries the following items, priced in tickets: a — apples, 3 tickets each b — balls, 3 tickets each c — cookies, 2 tickets each d — dolls, 1 ticket each e — ear muffs, 1 ticket each In how many ways can the child spend her tickets?

  48. CoSc 450: Programming Paradigms 07 a b c d e (3 3 2 1 1)

  49. CoSc 450: Programming Paradigms 07 a b c d e (3 3 2 1 1) ac add ade aee

  50. CoSc 450: Programming Paradigms 07 a b c d e (3 3 2 1 1) ac bc add bdd ade bde aee bee

  51. CoSc 450: Programming Paradigms 07 a b c d e (3 3 2 1 1) ac bc ccd add bdd cce ade bde cddd aee bee cdde cdee ceee

  52. CoSc 450: Programming Paradigms 07 a b c d e (3 3 2 1 1) ac bc ccd ddddd add bdd cce dddde ade bde cddd dddee aee bee cdde ddeee cdee deeee ceee

  53. CoSc 450: Programming Paradigms 07 a b c d e (3 3 2 1 1) ac bc ccd eeeee ddddd add bdd cce dddde ade bde cddd dddee aee bee cdde ddeee cdee deeee ceee

  54. CoSc 450: Programming Paradigms 07 a b c d e (3 3 2 1 1) ac bc ccd eeeee ddddd add bdd cce dddde ade bde cddd dddee aee bee cdde ddeee cdee deeee ceee (count-combos ‘(3 3 2 1 1) 5) 20

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Trees CoSc 450: Programming Paradigms 08 The definition of a tree CoSc 450: Programming

Trees CoSc 450: Programming Paradigms 08 The definition of a tree CoSc 450: Programming

CoSc 450: Programming Paradigms 08 Trees CoSc 450: Programming Paradigms 08 The definition of a tree CoSc 450: Programming Paradigms 08 The definition of a tree The empty tree is a tree. A nonempty tree tree has three parts. root

348 views • 23 slides
CoSc 450: Programming Paradigms Paradigm A pattern of thinking that is frequently difficult to

CoSc 450: Programming Paradigms Paradigm A pattern of thinking that is frequently difficult to

CoSc 450: Programming Paradigms Paradigm A pattern of thinking that is frequently difficult to change. A world view. CoSc 450: Programming Paradigms Objective To learn three major programming models that complement the procedural and OO

245 views • 9 slides
Monitors CoSc 450: Programming Paradigms 07 Monitor Purpose: To consolidate the wait and signal

Monitors CoSc 450: Programming Paradigms 07 Monitor Purpose: To consolidate the wait and signal

CoSc 450: Programming Paradigms Chapter 7 Monitors CoSc 450: Programming Paradigms 07 Monitor Purpose: To consolidate the wait and signal operations in a single class. Instead of having semaphores and critical sections spread throughout the

889 views • 87 slides
Higher-Order Procedures CoSc 450: Programming Paradigms 05 In the functional paradigm,

Higher-Order Procedures CoSc 450: Programming Paradigms 05 In the functional paradigm,

CoSc 450: Programming Paradigms 05 Higher-Order Procedures CoSc 450: Programming Paradigms 05 In the functional paradigm, functions themselves can be processed as data. CoSc 450: Programming Paradigms 05 In the functional paradigm,

1.21k views • 73 slides
Compound Data and Data Abstraction CoSc 450: Programming Paradigms 06 The Game of Nim Rules:

Compound Data and Data Abstraction CoSc 450: Programming Paradigms 06 The Game of Nim Rules:

CoSc 450: Programming Paradigms 06 Compound Data and Data Abstraction CoSc 450: Programming Paradigms 06 The Game of Nim Rules: There are two piles of items. Players take turns. You take as many as you want from a single pile.

587 views • 45 slides
Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author

Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author

CoSc 450: Programming Paradigms 03 Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author calls iteration is more commonly called tail recursion. A good optimizing compiler can convert a

1.79k views • 117 slides
Orders of Growth and Tree Recursion CoSc 450: Programming Paradigms 04 Graphics primitive

Orders of Growth and Tree Recursion CoSc 450: Programming Paradigms 04 Graphics primitive

CoSc 450: Programming Paradigms 04 Orders of Growth and Tree Recursion CoSc 450: Programming Paradigms 04 Graphics primitive operations CoSc 450: Programming Paradigms 04 Graphics primitive operations y 1 x -1 0 1 -1 Co-ordinate

308 views • 11 slides
CoSc 450: Programming Paradigms 04 A Calculational Deductive System for Linear Temporal Logic J.

CoSc 450: Programming Paradigms 04 A Calculational Deductive System for Linear Temporal Logic J.

CoSc 450: Programming Paradigms 04 A Calculational Deductive System for Linear Temporal Logic J. STANLEY WARFORD, Pepperdine University, USA DAVID VEGA, The Aerospace Corporation, USA SCOTT M. STALEY, Ford Motor Company Research Labs (retired),

1.55k views • 143 slides
overview lists recursive functions in lambda calculus equational programming 2020 11 09

overview lists recursive functions in lambda calculus equational programming 2020 11 09

overview lists recursive functions in lambda calculus equational programming 2020 11 09 confluence lecture 5 about practical assignment 2 lists: idea pairs: definition definition of pairing operator: := lrz . z l r then: P Q =

366 views • 8 slides
One of three programming paradigms We can identify three paradigms: functional programming,

One of three programming paradigms We can identify three paradigms: functional programming,

Object-Oriented Analysis and Design One of three programming paradigms We can identify three paradigms: functional programming, imperative programming and object oriented approach. Object orientation is comparatively young compared to the other

157 views • 5 slides
What is Concurrent Programming? M. Ben-Ari Principles of Concurrent and Distributed Programming

What is Concurrent Programming? M. Ben-Ari Principles of Concurrent and Distributed Programming

CoSc 450: Programming Paradigms 01 What is Concurrent Programming? M. Ben-Ari Principles of Concurrent and Distributed Programming Second Edition Addison-Wesley, 2006 c Mordechai Ben-Ari 2006 Computer Time - 0 100 200 300 400

711 views • 15 slides
"Lisp Cycles", http://xkcd.com/297/ CS 152: Programming Language Paradigms Introduction

"Lisp Cycles", http://xkcd.com/297/ CS 152: Programming Language Paradigms Introduction

"Lisp Cycles", http://xkcd.com/297/ CS 152: Programming Language Paradigms Introduction to Scheme Prof. Tom Austin San Jos State University Key traits of Scheme 1. Functional 2. Dynamically typed 3. Minimal 4. Lots of lists!

1.03k views • 47 slides
"Lisp Cycles", http://xkcd.com/297/ CS 152: Programming Language Paradigms Introduction

"Lisp Cycles", http://xkcd.com/297/ CS 152: Programming Language Paradigms Introduction

"Lisp Cycles", http://xkcd.com/297/ CS 152: Programming Language Paradigms Introduction to Scheme Prof. Tom Austin San Jos State University Key traits of Scheme 1. Functional 2. Dynamically typed 3. Minimal 4. Lots of lists!

690 views • 52 slides
Programming paradigms using PGAS-based languages Marc Tajchman CEA - DEN/DM2S/SFME/LGLS Monday,

Programming paradigms using PGAS-based languages Marc Tajchman CEA - DEN/DM2S/SFME/LGLS Monday,

Programming paradigms using PGAS-based languages Marc Tajchman CEA - DEN/DM2S/SFME/LGLS Monday, June 9th 2011 CEA-EDF-Inria School - 9/6/2011 Programming paradigms using PGAS-based languages Outline General considerations PGAS definition

737 views • 50 slides
Recursion and Induction

Recursion and Induction

CoSc 450: Programming Paradigms 02 Recursion and Induction

529 views • 38 slides
Introduction Why study programming languages? Programming language COS 301 paradigms

Introduction Why study programming languages? Programming language COS 301 paradigms

P rogramming L anguages Introduction COS 301 Preliminaries Introduction Why study programming languages? Programming language COS 301 paradigms Programming domains School of Computing and Information Science University of Maine

951 views • 46 slides
12/ 5/ 2016 W E G C OL GE OF A R S & S CIE INBE R L E T NCE S W E G C OL GE OF A R S

12/ 5/ 2016 W E G C OL GE OF A R S & S CIE INBE R L E T NCE S W E G C OL GE OF A R S

12/ 5/ 2016 W E G C OL GE OF A R S & S CIE INBE R L E T NCE S W E G C OL GE OF A R S & S CIE INBE R L E T NCE S A D H OC C OMMIT E ON D E E R T E GR E E QUIR E ME NT S (CDR ) A D H OC C OMMIT E ON D E T E GR E E

295 views • 7 slides
CSE 341 : Programming Languages DrRacket programming environment (not Emacs) Installation /

CSE 341 : Programming Languages DrRacket programming environment (not Emacs) Installation /

Racket Next two units will use the Racket language (not ML) and the CSE 341 : Programming Languages DrRacket programming environment (not Emacs) Installation / basic usage instructions on course website Welcome to Racket Like ML,

457 views • 11 slides
Mak Making Induction Manif ing Induction Manifest in est in Modular Modular ACL2 CL2 Carl

Mak Making Induction Manif ing Induction Manifest in est in Modular Modular ACL2 CL2 Carl

Mak Making Induction Manif ing Induction Manifest in est in Modular Modular ACL2 CL2 Carl Eastlund Matthias Felleisen cce@ccs.neu.edu matthias@ccs.neu.edu Northeastern University Boston, MA, USA 1 Pr Prog ogram V am Verif erifica

544 views • 51 slides
Finite Set Theory based on Fully Ordered Lists Jared Davis UT Austin ACL2 Workshop 2004

Finite Set Theory based on Fully Ordered Lists Jared Davis UT Austin ACL2 Workshop 2004

Finite Set Theory based on Fully Ordered Lists Jared Davis UT Austin ACL2 Workshop 2004 Motivation (1/2) Unique representation for each set No mutual recursion needed for membership, subset, and set equality Unified notion of

689 views • 19 slides
Announcements Partners change Wednesday or Friday Send me email by tomorrow (Tuesday) noon, if

Announcements Partners change Wednesday or Friday Send me email by tomorrow (Tuesday) noon, if

Announcements Partners change Wednesday or Friday Send me email by tomorrow (Tuesday) noon, if you have a preference of when to change! Next Status Reports likely distributed on Friday Supplemental Problem 3 Several folks avoided the required

129 views • 9 slides
Exercises -> (map ((curry +) 3) (1 2 3 4 5)) ??? -> (exists? ((curry =) 3) (1 2 3 4

Exercises -> (map ((curry +) 3) (1 2 3 4 5)) ??? -> (exists? ((curry =) 3) (1 2 3 4

Exercises -> (map ((curry +) 3) (1 2 3 4 5)) ??? -> (exists? ((curry =) 3) (1 2 3 4 5)) ??? -> (filter ((curry >) 3) (1 2 3 4 5)) ??? ; tricky Answers -> (map ((curry +) 3) (1 2 3 4 5)) (4 5 6 7 8) ->

276 views • 23 slides
Lisp Functions, recursion and lists cs3723 1 Interacting with Scheme (define pi 3.14159)

Lisp Functions, recursion and lists cs3723 1 Interacting with Scheme (define pi 3.14159)

Lisp Functions, recursion and lists cs3723 1 Interacting with Scheme (define pi 3.14159) ; bind pi to 3.14159 (lambda (x) (* x x)) ; anonymous function (define sq (lambda (x) (* x x))) (define (sq x) (* x x)) ; (define sq (lambda

700 views • 20 slides
Principles of Program Analysis: Data Flow Analysis Transparencies based on Chapter 2 of the book:

Principles of Program Analysis: Data Flow Analysis Transparencies based on Chapter 2 of the book:

Principles of Program Analysis: Data Flow Analysis Transparencies based on Chapter 2 of the book: Flemming Nielson, Hanne Riis Nielson and Chris Hankin: Principles of Program Analysis. Springer Verlag 2005. c Flemming Nielson & Hanne

315 views • 14 slides

More recommend