Recursion transformer
•Download as PPTX, PDF•
0 likes•328 views
The document discusses how to transform a regular recursive function into a tail recursive function by using abstract syntax trees (ASTs). It provides an example of transforming a factorial function from a regular recursive version to a tail recursive version by passing an accumulator parameter. The algorithm detects which functions are recursive, traverses the AST to find return nodes, and transforms recursive calls by turning them inside out and adding an accumulator with an initial default value.
Report
Share
Report
Share
Recommended
Function
This document discusses defining and calling functions in C++. It explains that a function is defined with a return type, name, and parameters. Functions can be called by passing arguments matching the parameters. Default values can be set for parameters, allowing a function to be called with fewer arguments than parameters defined.
Aa5
This document contains 15 calculus assignment problems involving limits of functions and sequences of functions. The problems cover topics like pointwise and uniform convergence, continuity, differentiability, integrability, and finding limits of specific sequences of functions.
Weekends with Competitive Programming
1. Algorithm analysis helps determine which algorithm is most efficient in terms of time and space consumed by analyzing the rate of growth of the time and space complexity functions as the input size increases.
2. Big-O notation provides an asymptotic upper bound on the growth rate of an algorithm, while Omega and Theta notations provide asymptotic lower and tight bounds respectively.
3. Recurrence relations can be used to analyze the time complexity of recursive algorithms, where the running time T(n) is expressed as a function of smaller inputs.
Ruby basic2
This document provides an overview of Ruby basics including methods, regular expressions, blocks, and iterators. Key points include:
- Methods can take parameters without specifying types, and the last expression is returned unless explicitly stated.
- Regular expressions are built into Ruby and used with methods like =~ to check for patterns in strings and sub/gsub for substitution.
- Blocks are like anonymous functions that can be passed to methods, and are often used with iterators to loop through arrays and perform operations on each element.
- Common iterators like each take a block and call it once for each element in an array or other enumerable.
Reconstruction
This lab report describes reconstructing a sampled signal to its original continuous time signal. The students implemented the discrete time Fourier transform (DTFT) to reconstruct the signal using different reconstruction time periods. Decreasing the reconstruction frequency from the sampling frequency resulted in a reconstructed signal that differed from the original. The students analyzed the reconstruction process and effects of varying the reconstruction frequency relative to the sampling frequency.
20190221 fourier series
This document introduces Fourier transforms and angular frequency. It defines angular frequency as radians per second compared to regular frequency which is cycles per second. It demonstrates the difference between angular and regular frequency visually over time. It also discusses representing complex numbers as points on a plane using length and angle. The document then explains Fourier frequency units using carrier values and shows examples of applying Fourier transforms to collections of values, images, and inverse transforms. It provides references on FFT applications and an interactive guide to the Fourier transform.
Stack switching for fun and profit
This document summarizes micro-threading libraries like greenlet, Stackless Python, fibers, and continulets. It explains that greenlet allows lightweight context switching between micro-threads called greenlets. Stackless Python extends CPython with tasklets and channels. PyPy implements greenlets and Stackless using continulets, which are one-shot continuations. Continulets and stacklets provide low-level context switching between continuations. The fibers library provides a higher-level API inspired by greenlets but built on top of stacklets.
Strings1
This document discusses strings in C++. It explains that a string is a class that can be thought of as a new type of variable to store text. Strings store characters in an array and functions like length() can return the size. Strings can be concatenated using + or assigned using =. The getline() function reads a whole line of input including whitespace. Dot functions operate on specific string objects.
Recommended
Function
This document discusses defining and calling functions in C++. It explains that a function is defined with a return type, name, and parameters. Functions can be called by passing arguments matching the parameters. Default values can be set for parameters, allowing a function to be called with fewer arguments than parameters defined.
Aa5
This document contains 15 calculus assignment problems involving limits of functions and sequences of functions. The problems cover topics like pointwise and uniform convergence, continuity, differentiability, integrability, and finding limits of specific sequences of functions.
Weekends with Competitive Programming
1. Algorithm analysis helps determine which algorithm is most efficient in terms of time and space consumed by analyzing the rate of growth of the time and space complexity functions as the input size increases.
2. Big-O notation provides an asymptotic upper bound on the growth rate of an algorithm, while Omega and Theta notations provide asymptotic lower and tight bounds respectively.
3. Recurrence relations can be used to analyze the time complexity of recursive algorithms, where the running time T(n) is expressed as a function of smaller inputs.
Ruby basic2
This document provides an overview of Ruby basics including methods, regular expressions, blocks, and iterators. Key points include:
- Methods can take parameters without specifying types, and the last expression is returned unless explicitly stated.
- Regular expressions are built into Ruby and used with methods like =~ to check for patterns in strings and sub/gsub for substitution.
- Blocks are like anonymous functions that can be passed to methods, and are often used with iterators to loop through arrays and perform operations on each element.
- Common iterators like each take a block and call it once for each element in an array or other enumerable.
Reconstruction
This lab report describes reconstructing a sampled signal to its original continuous time signal. The students implemented the discrete time Fourier transform (DTFT) to reconstruct the signal using different reconstruction time periods. Decreasing the reconstruction frequency from the sampling frequency resulted in a reconstructed signal that differed from the original. The students analyzed the reconstruction process and effects of varying the reconstruction frequency relative to the sampling frequency.
20190221 fourier series
This document introduces Fourier transforms and angular frequency. It defines angular frequency as radians per second compared to regular frequency which is cycles per second. It demonstrates the difference between angular and regular frequency visually over time. It also discusses representing complex numbers as points on a plane using length and angle. The document then explains Fourier frequency units using carrier values and shows examples of applying Fourier transforms to collections of values, images, and inverse transforms. It provides references on FFT applications and an interactive guide to the Fourier transform.
Stack switching for fun and profit
This document summarizes micro-threading libraries like greenlet, Stackless Python, fibers, and continulets. It explains that greenlet allows lightweight context switching between micro-threads called greenlets. Stackless Python extends CPython with tasklets and channels. PyPy implements greenlets and Stackless using continulets, which are one-shot continuations. Continulets and stacklets provide low-level context switching between continuations. The fibers library provides a higher-level API inspired by greenlets but built on top of stacklets.
Strings1
This document discusses strings in C++. It explains that a string is a class that can be thought of as a new type of variable to store text. Strings store characters in an array and functions like length() can return the size. Strings can be concatenated using + or assigned using =. The getline() function reads a whole line of input including whitespace. Dot functions operate on specific string objects.
Algorithms
The document discusses iterative and recursive algorithms and structures. It covers the insertion sort and binary search algorithms, providing pseudocode examples. It also introduces the Blockly programming editor for visually building applications using blocks and discusses using it to solve a maze problem.
Simpson and lagranje dalambair math methods
This document contains C++ code implementing Simpson's rule and Lagrange interpolation. It includes functions for:
1) Calculating the integral of a function using Simpson's rule
2) Filling an array with function values at points and calculating the Lagrange polynomial
3) Drawing the function graphically
The main function provides menus to call the Simpson's rule or Lagrange interpolation methods and draw the results.
Recursive Function
This document discusses recursive functions, which are functions that call themselves repetitively until a certain condition is satisfied. It provides an introduction to recursive functions, noting that they contain statements to determine if the function should call itself again, a function call with arguments, a conditional statement like if/else, and a return statement. It then provides two examples of recursive functions as class work: writing a program to find the product of two numbers recursively and writing a program to calculate a^b recursively.
Secondary storage structure
This document discusses secondary storage structures, including different types of storage devices like magnetic tapes and disks. It describes the components and workings of tapes, floppy disks, and hard disks. Various disk scheduling algorithms are also covered, such as First Come First Serve, Shortest Seek Time First, SCAN, Look, C-SCAN, and C-LOOK. These algorithms differ in how they determine the order of requests to minimize the disk head's movement across tracks and reduce average seek and rotational latency times.
Union in C programming
Unions allow a variable to hold objects of different types in the same memory location. All members of a union share the same memory location, which is the size of the largest member. This means unions save memory by storing all members in one block, but the programmer must ensure the correct member is being accessed based on the data currently stored. The example program defines a union called Student containing different data types, reads values into members, and displays the members to demonstrate unions share the same memory location.
The Algebra of Functions
This document provides a summary of key concepts in algebra of functions including basic operations, composite functions, domains and ranges, the vertical line test, odd and even functions, standard composite results, and the principle domain of trigonometric functions. It defines domain as the initial values input into a function and range as the set of output values. A function is a relation where each domain value corresponds to exactly one range value, as tested by the vertical line test. Odd functions have rotational symmetry around the origin while even functions have reflectional symmetry across the y-axis. Standard results are given for composing odd and even functions.
Learning C++ - Functions in C++ 3
This document discusses functions in C++. It defines a function as having an output type, name, and arguments within parentheses. Functions can be called by passing arguments to the function name. Functions can also be called by reference by passing the address of a variable. Some important mathematical functions are provided in the C++ math library and their Fortran equivalents are shown.
Secondary storage structure-Operating System Concepts
Disk Structure (Magnetic)
Disk Attachment
Disk Scheduling Algorithms
FCFS, SSTF, SCAN, LOOK
Disk Management
Formatting, booting, bad sectors
Swap-Space Management
Performance optimization
Disk scheduling
Disk scheduling algorithms are used by the operating system to efficiently service requests to read from and write to disk drives. The key components that disk scheduling aims to optimize are seek time, which is the time to move the disk head to the desired cylinder, and rotational latency, which is the additional wait for the desired sector to rotate under the head. Common disk scheduling algorithms include first-come, first-served (FCFS), shortest seek time first (SSTF), SCAN, C-SCAN, and C-LOOK, with SSTF and LOOK often being reasonable default choices.
4. Recursion - Data Structures using C++ by Varsha Patil
The document discusses recursion in computer programming. It defines recursion as a function that calls itself or is called by another function. It categorizes different types of recursion such as direct, indirect, linear, tree, and tail recursion. It explains how recursive functions work by using a stack to store information from each function call. Examples of recursively-defined problems like factorials and Fibonacci numbers are provided. Guidelines for writing recursive functions and solving problems recursively are also outlined.
Numerical integration
This document discusses the history and applications of integration. It provides an overview of how integration was developed over time by mathematicians like Archimedes, Gauss, Leibniz, and Newton. It also outlines real-world uses of integration in engineering projects like designing the PETRONAS Towers and Sydney Opera House. The document then explains numerical integration methods like the Trapezoidal Rule, Simpson's Rule, and their variations. It provides formulas and examples of how to apply these rules to approximate definite integrals.
Functions in C++
Function overloading in C++ allows defining multiple functions with the same name as long as they have different parameters. This enables functions to perform different tasks based on the types of arguments passed. An example demonstrates defining multiple area() functions, one taking a radius and the other taking length and breadth. Inline functions in C++ avoid function call overhead by expanding the function code at the call site instead of jumping to another location. Demonstrated with an inline mul() and div() example.
Numerical integration
Integration is used in physics to determine rates of change and distances given velocities. Numerical integration is required when the antiderivative is unknown. It involves approximating the definite integral of a function as the area under its curve between bounds. The Trapezoidal Rule approximates this area using straight lines between points, while Simpson's Rule uses quadratic or cubic functions, achieving greater accuracy with fewer points. Both methods involve dividing the area into strips and summing their widths multiplied by the function values at strip points.
Ch10
This document discusses mass storage systems. It begins with an overview of disk structure, including details on disk performance characteristics like seek time and rotational latency. It then covers topics like disk scheduling algorithms, disk management in operating systems, swap space management, RAID structures, and implementing stable storage. RAID levels like mirroring and striping with parity are explained. The document provides information on technologies like solid-state disks, magnetic tape, storage arrays, and network-attached storage.
PowerPoint Tutorial Presentation - 100 Pictures
The document discusses 100 pictures from Microsoft Clip Art that can be used according to the Microsoft Service Agreement. It provides an email address for PowerPoint tips and tricks as well as 50 PowerPoint templates and welcomes comments from Jean-Luc.
Pandi
This document discusses mass storage structure and operating system services for mass storage. It covers disk structure, disk scheduling algorithms, disk management including swap space and file systems, RAID structure, and stable storage implementation. It also describes magnetic tape and compares its performance characteristics to disk drives.
Recursion
The document discusses recursion, which is a technique that solves a problem by solving smaller instances of the same problem. It provides examples of recursive functions, including factorial, combinations, multiplication, Fibonacci, and greatest common divisor (GCD). Recursive functions contain a base case with a straightforward solution and recursively define the problem in terms of smaller instances until reaching the base case. C uses a call stack to maintain the state of each recursive call.
Complexity Analysis of Recursive Function
This is an PPT of Data Structure. It include the following topic "Complexity Analysis of Recursive Function".
yield and return (poor English ver)
This document discusses the differences between using yield and return in computation expressions in F#. It presents several implementations of computation expressions to demonstrate how yield and return can be distinguished. The key differences are:
- yield continues the remaining computation expression, while return stops any remaining expressions from executing.
- Several approaches are presented: using exceptions, a state field on the builder, and passing state as an argument. The state argument approach provides a clear separation of yield and return without sharing state between uses of the builder.
- Continuations are also proposed as an implementation, where yield calls the continuation and return discards it. This approach makes the symmetry between yield and return very clear.
Dynamic programing
The document discusses the technique of dynamic programming. It begins with an example of using dynamic programming to compute the Fibonacci numbers more efficiently than a naive recursive solution. This involves storing previously computed values in a table to avoid recomputing them. The document then presents the problem of finding the longest increasing subsequence in an array. It defines the problem and subproblems, derives a recurrence relation, and provides both recursive and iterative memoized algorithms to solve it in quadratic time using dynamic programming.
Recursion.pdf
1) Recursion is a technique where a function calls itself to solve a problem. It breaks the problem down into smaller subproblems until it reaches a base case that can be solved directly.
2) A recursive function must have a base case where it does not call itself further, and a general case where it calls itself on a reduced problem. It works by repeatedly reducing the problem size until the base case is reached.
3) Examples of problems that can be solved recursively include calculating factorials, Fibonacci numbers, binary search of a sorted array, checking if a string is a palindrome, and solving the Towers of Hanoi puzzle.
Recursion
Recursion involves functions that call themselves during execution. This document discusses recursive functions like factorial, Fibonacci sequence, power, and printing patterns. Recursive functions have a base case that stops the recursion. The factorial function is defined recursively as n! = n * (n-1)!, and this recursive definition is evaluated step-by-step for fact(4). Recursive functions can also be used to define sequences like Fibonacci numbers.
More Related Content
Viewers also liked
Algorithms
The document discusses iterative and recursive algorithms and structures. It covers the insertion sort and binary search algorithms, providing pseudocode examples. It also introduces the Blockly programming editor for visually building applications using blocks and discusses using it to solve a maze problem.
Simpson and lagranje dalambair math methods
This document contains C++ code implementing Simpson's rule and Lagrange interpolation. It includes functions for:
1) Calculating the integral of a function using Simpson's rule
2) Filling an array with function values at points and calculating the Lagrange polynomial
3) Drawing the function graphically
The main function provides menus to call the Simpson's rule or Lagrange interpolation methods and draw the results.
Recursive Function
This document discusses recursive functions, which are functions that call themselves repetitively until a certain condition is satisfied. It provides an introduction to recursive functions, noting that they contain statements to determine if the function should call itself again, a function call with arguments, a conditional statement like if/else, and a return statement. It then provides two examples of recursive functions as class work: writing a program to find the product of two numbers recursively and writing a program to calculate a^b recursively.
Secondary storage structure
This document discusses secondary storage structures, including different types of storage devices like magnetic tapes and disks. It describes the components and workings of tapes, floppy disks, and hard disks. Various disk scheduling algorithms are also covered, such as First Come First Serve, Shortest Seek Time First, SCAN, Look, C-SCAN, and C-LOOK. These algorithms differ in how they determine the order of requests to minimize the disk head's movement across tracks and reduce average seek and rotational latency times.
Union in C programming
Unions allow a variable to hold objects of different types in the same memory location. All members of a union share the same memory location, which is the size of the largest member. This means unions save memory by storing all members in one block, but the programmer must ensure the correct member is being accessed based on the data currently stored. The example program defines a union called Student containing different data types, reads values into members, and displays the members to demonstrate unions share the same memory location.
The Algebra of Functions
This document provides a summary of key concepts in algebra of functions including basic operations, composite functions, domains and ranges, the vertical line test, odd and even functions, standard composite results, and the principle domain of trigonometric functions. It defines domain as the initial values input into a function and range as the set of output values. A function is a relation where each domain value corresponds to exactly one range value, as tested by the vertical line test. Odd functions have rotational symmetry around the origin while even functions have reflectional symmetry across the y-axis. Standard results are given for composing odd and even functions.
Learning C++ - Functions in C++ 3
This document discusses functions in C++. It defines a function as having an output type, name, and arguments within parentheses. Functions can be called by passing arguments to the function name. Functions can also be called by reference by passing the address of a variable. Some important mathematical functions are provided in the C++ math library and their Fortran equivalents are shown.
Secondary storage structure-Operating System Concepts
Disk Structure (Magnetic)
Disk Attachment
Disk Scheduling Algorithms
FCFS, SSTF, SCAN, LOOK
Disk Management
Formatting, booting, bad sectors
Swap-Space Management
Performance optimization
Disk scheduling
Disk scheduling algorithms are used by the operating system to efficiently service requests to read from and write to disk drives. The key components that disk scheduling aims to optimize are seek time, which is the time to move the disk head to the desired cylinder, and rotational latency, which is the additional wait for the desired sector to rotate under the head. Common disk scheduling algorithms include first-come, first-served (FCFS), shortest seek time first (SSTF), SCAN, C-SCAN, and C-LOOK, with SSTF and LOOK often being reasonable default choices.
4. Recursion - Data Structures using C++ by Varsha Patil
The document discusses recursion in computer programming. It defines recursion as a function that calls itself or is called by another function. It categorizes different types of recursion such as direct, indirect, linear, tree, and tail recursion. It explains how recursive functions work by using a stack to store information from each function call. Examples of recursively-defined problems like factorials and Fibonacci numbers are provided. Guidelines for writing recursive functions and solving problems recursively are also outlined.
Numerical integration
This document discusses the history and applications of integration. It provides an overview of how integration was developed over time by mathematicians like Archimedes, Gauss, Leibniz, and Newton. It also outlines real-world uses of integration in engineering projects like designing the PETRONAS Towers and Sydney Opera House. The document then explains numerical integration methods like the Trapezoidal Rule, Simpson's Rule, and their variations. It provides formulas and examples of how to apply these rules to approximate definite integrals.
Functions in C++
Function overloading in C++ allows defining multiple functions with the same name as long as they have different parameters. This enables functions to perform different tasks based on the types of arguments passed. An example demonstrates defining multiple area() functions, one taking a radius and the other taking length and breadth. Inline functions in C++ avoid function call overhead by expanding the function code at the call site instead of jumping to another location. Demonstrated with an inline mul() and div() example.
Numerical integration
Integration is used in physics to determine rates of change and distances given velocities. Numerical integration is required when the antiderivative is unknown. It involves approximating the definite integral of a function as the area under its curve between bounds. The Trapezoidal Rule approximates this area using straight lines between points, while Simpson's Rule uses quadratic or cubic functions, achieving greater accuracy with fewer points. Both methods involve dividing the area into strips and summing their widths multiplied by the function values at strip points.
Ch10
This document discusses mass storage systems. It begins with an overview of disk structure, including details on disk performance characteristics like seek time and rotational latency. It then covers topics like disk scheduling algorithms, disk management in operating systems, swap space management, RAID structures, and implementing stable storage. RAID levels like mirroring and striping with parity are explained. The document provides information on technologies like solid-state disks, magnetic tape, storage arrays, and network-attached storage.
PowerPoint Tutorial Presentation - 100 Pictures
The document discusses 100 pictures from Microsoft Clip Art that can be used according to the Microsoft Service Agreement. It provides an email address for PowerPoint tips and tricks as well as 50 PowerPoint templates and welcomes comments from Jean-Luc.
Pandi
This document discusses mass storage structure and operating system services for mass storage. It covers disk structure, disk scheduling algorithms, disk management including swap space and file systems, RAID structure, and stable storage implementation. It also describes magnetic tape and compares its performance characteristics to disk drives.
Recursion
The document discusses recursion, which is a technique that solves a problem by solving smaller instances of the same problem. It provides examples of recursive functions, including factorial, combinations, multiplication, Fibonacci, and greatest common divisor (GCD). Recursive functions contain a base case with a straightforward solution and recursively define the problem in terms of smaller instances until reaching the base case. C uses a call stack to maintain the state of each recursive call.
Viewers also liked (17)
Secondary storage structure-Operating System Concepts
Secondary storage structure-Operating System Concepts
4. Recursion - Data Structures using C++ by Varsha Patil
4. Recursion - Data Structures using C++ by Varsha Patil
Similar to Recursion transformer
Complexity Analysis of Recursive Function
This is an PPT of Data Structure. It include the following topic "Complexity Analysis of Recursive Function".
yield and return (poor English ver)
This document discusses the differences between using yield and return in computation expressions in F#. It presents several implementations of computation expressions to demonstrate how yield and return can be distinguished. The key differences are:
- yield continues the remaining computation expression, while return stops any remaining expressions from executing.
- Several approaches are presented: using exceptions, a state field on the builder, and passing state as an argument. The state argument approach provides a clear separation of yield and return without sharing state between uses of the builder.
- Continuations are also proposed as an implementation, where yield calls the continuation and return discards it. This approach makes the symmetry between yield and return very clear.
Dynamic programing
The document discusses the technique of dynamic programming. It begins with an example of using dynamic programming to compute the Fibonacci numbers more efficiently than a naive recursive solution. This involves storing previously computed values in a table to avoid recomputing them. The document then presents the problem of finding the longest increasing subsequence in an array. It defines the problem and subproblems, derives a recurrence relation, and provides both recursive and iterative memoized algorithms to solve it in quadratic time using dynamic programming.
Recursion.pdf
1) Recursion is a technique where a function calls itself to solve a problem. It breaks the problem down into smaller subproblems until it reaches a base case that can be solved directly.
2) A recursive function must have a base case where it does not call itself further, and a general case where it calls itself on a reduced problem. It works by repeatedly reducing the problem size until the base case is reached.
3) Examples of problems that can be solved recursively include calculating factorials, Fibonacci numbers, binary search of a sorted array, checking if a string is a palindrome, and solving the Towers of Hanoi puzzle.
Recursion
Recursion involves functions that call themselves during execution. This document discusses recursive functions like factorial, Fibonacci sequence, power, and printing patterns. Recursive functions have a base case that stops the recursion. The factorial function is defined recursively as n! = n * (n-1)!, and this recursive definition is evaluated step-by-step for fact(4). Recursive functions can also be used to define sequences like Fibonacci numbers.
Lecture 4 - Growth of Functions.ppt
The document discusses asymptotic analysis and asymptotic notation, which are used to characterize and compare the efficiency of algorithms. It introduces common asymptotic classifications like O, Ω, and Θ notation. These notations allow comparison of how fast functions grow relative to each other as their inputs increase. The chapter also covers standard functions like exponentials, logarithms, and factorials that are used in analyzing algorithms.
Lecture 4 - Growth of Functions (1).ppt
The document discusses asymptotic analysis and asymptotic notation, which are used to characterize and compare the efficiency of algorithms. It introduces common asymptotic classifications like O, Ω, and Θ notation. These notations allow comparison of how fast functions grow relative to each other as their inputs increase. The chapter also covers standard functions like exponentials, logarithms, and factorials that are used in analyzing algorithms.
recursion.ppt
This document discusses recursion versus iteration in Lisp and Common Lisp. It notes that the original Lisp language was purely functional and used recursion to solve problems since it lacked local variables and iteration. While recursion is more elegant and leads to less code in some cases, it is also harder to understand, debug, and less efficient due to function call overhead. However, recursion is necessary for some problems like tree and graph traversals. Common Lisp makes recursion easier through its runtime stack and debugger. Several examples of recursive functions are provided, including ones for lists, trees, searching, and factorials. Tail recursion is discussed as a way to make recursion more efficient.
Unit-I Recursion.pptx
Recursion is the process of defining a problem (or the solution to a problem) in terms of (a simpler version of) itself. For example, we can define the operation "find your way home" as: If you are at home, stop moving. Take one step toward home.
lecture4-recursion.pptx
Recursion is introduced, including definitions and examples of recursion in mathematics and programming. Key aspects of recursion covered include the recursive case, base case, and use of the call stack. The document discusses recursion compared to iteration, advantages and disadvantages of recursion, and techniques like memoization to improve recursive solutions. Examples of recursive algorithms like calculating factorials and Fibonacci numbers are provided to illustrate recursive concepts.
L16
The document discusses recursive definitions of sequences, functions, sets, and strings. It provides examples of recursively defining the Fibonacci sequence, factorial function, set of prices using quarters and dimes, and set of binary numbers. It also discusses recursively defining the length, empty string, concatenation, and reversal of strings.
Lecture9 recursion
The document discusses recursion and binary trees. It defines recursion as a function that calls itself, directly or indirectly. A recursive function must have a base case and recursively break the problem into smaller subproblems until the base case is reached. Binary trees are discussed as a data structure where each node has at most two children. Properties of binary trees like the root, left and right subtrees, ancestors and descendants are explained. Complete and strictly binary trees are defined, where a complete binary tree fills each level except possibly the last.
Lect5 v2
This document provides an overview of image transforms and enhancement in the frequency domain. It begins with clarifying homework assignments and recapping the previous lecture on the discrete Fourier transform (DFT). The document then covers the definition and properties of the 2D DFT, its implementation using the fast Fourier transform algorithm, and applications for image enhancement and feature correlation. Finally, it introduces the discrete cosine transform (DCT), covering its definition, visualization of its basis images, and fast implementation using the DFT.
Recursion and looping
Iteration uses loops to repeatedly execute a block of code a specified number of times or until a condition is met. Recursion provides an alternative approach by having a function call itself repeatedly until a base case is reached. Both approaches can solve problems but recursion uses more memory than iteration due to its use of function calls and stack. Whether to use iteration or recursion depends on the specific problem and considerations of processing speed and memory usage.
Strong functional programming
The document discusses life without bottom values (⊥) in programming languages. It explains how removing bottom values simplifies language design by avoiding issues like non-termination and making pattern matching and operators like & behave more intuitively. It also discusses how removing bottom values means the language is no longer Turing complete, and explores alternatives like codata to allow modeling infinite computations.
6-Python-Recursion PPT.pptx
The document discusses recursive functions and provides examples of recursive algorithms for calculating factorial, greatest common divisor (GCD), Fibonacci numbers, power functions, and solving the Towers of Hanoi problem. Recursive functions are functions that call themselves during their execution. They break down problems into subproblems of the same type until reaching a base case. This recursive breakdown allows problems to be solved in a top-down, step-by-step manner.
Evaluating definite integrals
This document contains lecture notes on evaluating definite integrals. It introduces the definition of the definite integral as a limit of Riemann sums, and properties of integrals such as additivity and comparison properties. It also states the Second Fundamental Theorem of Calculus, which relates definite integrals to indefinite integrals via the derivative of the integrand function. Examples are provided to illustrate how to use these properties and theorems to evaluate definite integrals.
functions
The document discusses functions and algorithms. It defines what a function is and provides examples. It also discusses different types of functions such as one-to-one, onto, and inverse functions. The document then discusses algorithms and complexity analysis. It provides examples of linear search algorithms and analyzes their worst case and average case time complexities.
Inverse function
This document defines and provides examples of one-to-one, onto, and bijective functions. A one-to-one function maps distinct inputs to distinct outputs. An onto function maps the entire domain onto the range. A bijective function is both one-to-one and onto. The inverse of a bijective function is also discussed. Examples include functions from integers to integers and reals to reals.
Sure interview algorithm-1103
The document discusses finding the longest common subsequence between two sequences and provides an algorithm using dynamic programming. It explains using a matrix to store the current alignment results, where each cell Aij is calculated based on the adjacent cells, with scores considered. There are two steps - find the length of the LCS using the matrix, then trace back to find the exact alignment. It also discusses the knapsack problem and how dynamic programming can be applied to optimize combination problems.
Similar to Recursion transformer (20)
Recently uploaded
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Uni Systems Copilot event_05062024_C.Vlachos.pdf
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
Essentials of Automations: The Art of Triggers and Actions in FME
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Removing Uninteresting Bytes in Software Fuzzing
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
20240607 QFM018 Elixir Reading List May 2024
Everything I found interesting about the Elixir programming ecosystem in May 2024
20240605 QFM017 Machine Intelligence Reading List May 2024
Everything I found interesting about machines behaving intelligently during May 2024
Securing your Kubernetes cluster_ a step-by-step guide to success !
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
GridMate - End to end testing is a critical piece to ensure quality and avoid...
End to end testing is a critical piece to ensure quality and avoid regressions. In this session, we share our journey building an E2E testing pipeline for GridMate components (LWC and Aura) using Cypress, JSForce, FakerJS…
Large Language Model (LLM) and it’s Geospatial Applications
Large Language Model (LLM) and it’s Geospatial Applications.
A tale of scale & speed: How the US Navy is enabling software delivery from l...
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
How to Get CNIC Information System with Paksim Ga.pptx
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Mind map of terminologies used in context of Generative AI
Mind map of common terms used in context of Generative AI.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentationsGraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
20240609 QFM020 Irresponsible AI Reading List May 2024
Everything I found interesting about the irresponsible use of machine intelligence in May 2024
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
Recently uploaded (20)
Monitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR Events
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...
Essentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FME
20240605 QFM017 Machine Intelligence Reading List May 2024
20240605 QFM017 Machine Intelligence Reading List May 2024
Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !
GridMate - End to end testing is a critical piece to ensure quality and avoid...
GridMate - End to end testing is a critical piece to ensure quality and avoid...
Large Language Model (LLM) and it’s Geospatial Applications
Large Language Model (LLM) and it’s Geospatial Applications
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
How to Get CNIC Information System with Paksim Ga.pptx
How to Get CNIC Information System with Paksim Ga.pptx
Mind map of terminologies used in context of Generative AI
Mind map of terminologies used in context of Generative AI
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024
20240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 2024
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024
Recursion transformer
- 1. Interpreter for recursion How to transform a regular recursive function into a tail recursive one.
- 2. Well, this is really hard… So we’re going to use ASTs (the result of parsing and lexing Python code)
- 3. Concrete version. Regular recursion. def fact(n): if n <= 1: return 1 else: return n * fact(n - 1) Tail recursion. def fact(n, accum): if n <= 1: return accum else: return fact(n - 1, accum * n)
- 4. Let’s generalize it! Concrete version. def fact(n): if n <= 1: return 1 else: return n * fact(n - 1) Generalized version. def f(n): if n <= 1: #base case return value 1 else: #recursive case return combiner( * f1(n), n f(n-1) fact(n-1)
- 5. HOWTO: Regular Tail. Regular recursion. def f(n): if n <= 1: #base case return value 1 else: #recursive case return combiner( * f1 (n), n f (n-1) fact(n-1) Tail recursion. def f(n, accum = 1): if n <= 1: #base case return accum else: #recursive case return f ( fact(n-1) n - 1 combiner( * f1(n), n accum
- 6. Algorithm. • Detect which functions are recursive. • Traverse the function’s AST, looking for return nodes. – If the return node is not recursive, record the return value: this is the default value for accum. – If the return node IS recursive, turn the recursive call inside out. • Compile and run!