N_Asm Assembly recursion (sol)
•
0 likes•473 views
This document discusses recursion in assembly language programming. Recursion is when a procedure calls itself, either directly or indirectly. As an example, it describes how to calculate a factorial recursively by having the factorial procedure call itself with decreasing arguments until the base case is reached. The example assembly code shows how to implement a recursive factorial procedure to calculate the factorial of 3 by calling itself and multiplying the return values until the base case of 1 is reached.
Report
Share
Report
Share
Download to read offline
![http://www.tutorialspoint.com/assembly_prog ramming /assembly_recursion.htm Copyright © tutorialspoint.com
ASSEMBLY - RECURSION
A recursive procedure is one that calls itself. There are two kinds of recursion: direct and indirect. Indirect
recursion, the procedure calls itself and inindirect recursion, the first procedure calls a second procedure,
whichinturncalls the first procedure.
Recursioncould be observed innumerous mathematicalalgorithms. For example, consider the case of
calculating the factorialof a number. Factorialof a number is givenby the equation:
Fact (n) = n * fact (n-1) for n > 0
For example: factorialof 5 is 1 x 2 x 3 x 4 x 5 = 5 x factorialof 4 and this canbe a good example of showing a
recursive procedure. Every recursive algorithmmust have anending condition, i.e., the recursive calling of the
programshould be stopped whena conditionis fulfilled. Inthe case of factorialalgorithm, the end conditionis
reached whennis 0.
The following programshows how factorialnis implemented inassembly language. To keep the program
simple, we willcalculate factorial3.
section .text
global _start ;must be declared for using gcc
_start: ;tell linker entry point
mov bx, 3 ;for calculating factorial 3
call proc_fact
add ax, 30h
mov [fact], ax
mov edx,len ;message length
mov ecx,msg ;message to write
mov ebx,1 ;file descriptor (stdout)
mov eax,4 ;system call number (sys_write)
int 0x80 ;call kernel
mov edx,1 ;message length
mov ecx,fact ;message to write
mov ebx,1 ;file descriptor (stdout)
mov eax,4 ;system call number (sys_write)
int 0x80 ;call kernel
mov eax,1 ;system call number (sys_exit)
int 0x80 ;call kernel
proc_fact:
cmp bl, 1
jg do_calculation
mov ax, 1
ret
do_calculation:
dec bl
call proc_fact
inc bl
mul bl ;ax = al * bl
ret
section .data
msg db 'Factorial 3 is:',0xa
len equ $ - msg
section .bss
fact resb 1
Whenthe above code is compiled and executed, it produces the following result:
Factorial 3 is:
6](https://image.slidesharecdn.com/pzpzh6kst826aun1gah7-signature-f0bcef7f9817b10cd8e4303a3bd252588637176c0b8a4a51961fd9a43b349005-poli-140718025716-phpapp01/85/N_Asm-Assembly-recursion-sol-1-320.jpg)
Recommended
Csci101 lect02 selection_andlooping
This document summarizes selection and looping concepts in programming. It discusses if-else statements for program control based on conditions, relational and logical operators to write logical expressions, and for loops to repeatedly execute statements. Examples are provided to illustrate converting algorithms to programs for tasks like finding the maximum of two numbers, ordering numbers, calculating sums and factorials using for loops.
MolinaLeydi_FinalProject
The document describes a program that uses numerical root-finding methods (bisection, false position, and Newton-Raphson) to solve the Von Karman equation for the friction factor f given a Reynolds number. It outlines the requirements for the program, which include using a GUI, file I/O, exception handling, multiple objects, inheritance, and ensuring valid user input. Pseudocode is provided for the algorithms. Test cases are described to validate that the requirements are met.
Matlab Script - Loop Control
In this lecture we will discuss about another flow control method – Loop control.
A loop control is used to execute a set of commands repeatedly
The set of commands is called the body of the loop
MATLAB has two loop control techniques
Counted loops - executes commands a specified number of times
Conditional loops - executes commands as long as a specified expression is true
c++ programming Unit 4 operators
This document discusses operators in C++. It describes different types of operators - unary, binary, and ternary - and provides examples of common operators like arithmetic, relational, and logical operators. Specifically, it explains that operators operate on operands to produce results, and classifications of operators are based on the number of operands needed.
Loops in matlab
This document discusses MATLAB control structures for flow of execution including if/else statements, while loops, and for loops. It provides examples of basic syntax and use cases for each structure. Key points covered include evaluating conditional expressions, updating loop variables, and using for loops to iterate over array elements or ranges of indices.
Loops in c language
what are loop in general
what is loop in c language
uses of loop in c language
types of loop in c language
program of loop in c language
syantax of loop in c language
Probability
The document defines key concepts in statistics and probability. It explains that a statistical experiment is a process that can generate data and be repeated under similar conditions. The sample space is the set of all possible outcomes, while events are subsets of the sample space. Counting techniques like the fundamental principle of counting, permutations, and combinations are introduced to calculate the number of possible arrangements and selections. Probability is defined as the likelihood of an event occurring, which is calculated as the sum of the probabilities of each individual sample point.
Flowcharts
This document discusses flowcharts, which are graphical representations of algorithms or processes. It covers the overview, symbols, types, examples, and advantages/disadvantages of flowcharts. The main points are:
- Flowcharts show the logic and steps of an algorithm using standard symbols like rectangles, diamonds, and arrows. They help communicate and document processes.
- Common symbols include terminals, I/O, processes, decisions, and connectors to represent the start/end, inputs/outputs, steps, conditions, and connections.
- The three main types are sequential, selective, and iterative flowcharts depending on the control logic.
- Examples show flowcharts for addition, interest calculation, and determining even
Recommended
Csci101 lect02 selection_andlooping
This document summarizes selection and looping concepts in programming. It discusses if-else statements for program control based on conditions, relational and logical operators to write logical expressions, and for loops to repeatedly execute statements. Examples are provided to illustrate converting algorithms to programs for tasks like finding the maximum of two numbers, ordering numbers, calculating sums and factorials using for loops.
MolinaLeydi_FinalProject
The document describes a program that uses numerical root-finding methods (bisection, false position, and Newton-Raphson) to solve the Von Karman equation for the friction factor f given a Reynolds number. It outlines the requirements for the program, which include using a GUI, file I/O, exception handling, multiple objects, inheritance, and ensuring valid user input. Pseudocode is provided for the algorithms. Test cases are described to validate that the requirements are met.
Matlab Script - Loop Control
In this lecture we will discuss about another flow control method – Loop control.
A loop control is used to execute a set of commands repeatedly
The set of commands is called the body of the loop
MATLAB has two loop control techniques
Counted loops - executes commands a specified number of times
Conditional loops - executes commands as long as a specified expression is true
c++ programming Unit 4 operators
This document discusses operators in C++. It describes different types of operators - unary, binary, and ternary - and provides examples of common operators like arithmetic, relational, and logical operators. Specifically, it explains that operators operate on operands to produce results, and classifications of operators are based on the number of operands needed.
Loops in matlab
This document discusses MATLAB control structures for flow of execution including if/else statements, while loops, and for loops. It provides examples of basic syntax and use cases for each structure. Key points covered include evaluating conditional expressions, updating loop variables, and using for loops to iterate over array elements or ranges of indices.
Loops in c language
what are loop in general
what is loop in c language
uses of loop in c language
types of loop in c language
program of loop in c language
syantax of loop in c language
Probability
The document defines key concepts in statistics and probability. It explains that a statistical experiment is a process that can generate data and be repeated under similar conditions. The sample space is the set of all possible outcomes, while events are subsets of the sample space. Counting techniques like the fundamental principle of counting, permutations, and combinations are introduced to calculate the number of possible arrangements and selections. Probability is defined as the likelihood of an event occurring, which is calculated as the sum of the probabilities of each individual sample point.
Flowcharts
This document discusses flowcharts, which are graphical representations of algorithms or processes. It covers the overview, symbols, types, examples, and advantages/disadvantages of flowcharts. The main points are:
- Flowcharts show the logic and steps of an algorithm using standard symbols like rectangles, diamonds, and arrows. They help communicate and document processes.
- Common symbols include terminals, I/O, processes, decisions, and connectors to represent the start/end, inputs/outputs, steps, conditions, and connections.
- The three main types are sequential, selective, and iterative flowcharts depending on the control logic.
- Examples show flowcharts for addition, interest calculation, and determining even
Different loops in C
This presentation discusses different loops in C programming. It defines programming and structured programming. It then explains the three types of loops in C - for, while, and do/while loops. Sample programs are provided to demonstrate each loop, showing how they iterate and check their loop conditions. The for loop checks at the top of the loop. The while and do/while loops can check at the top or bottom of the loop respectively.
03 Analysis of Algorithms: Probabilistic Analysis
In this section of the course, we look at the way to use probability to analyze algorithms from the point of view of the worst case analysis.
In order to do this, we will look at:
1. What is the Probability of an Indicator function?
2. How to use the Indicator function to analyze a simple hiring algorithms.
3. How we can enforce the uniform probability property so algorithms based in probability can be simple and efficient.
Loops in C Programming | for Loop | do-while Loop | while Loop | Nested Loop
This file is based on the loops that could be used in C Programming. These are explained with some examples and sample programmings and screen shots.
NOTE: The software used in this programming is Notepad++ and the programs are compiled and run through gcc compiler using command prompt.
Conditional & Cast Operator
The document discusses the ternary operator in C programming, which returns one value if a condition is true and another value if it is false. It provides the syntax for the ternary operator and an example that uses it to print the smaller of two numbers. The document also covers type casting in C by converting the data type of a variable and provides the syntax and an example that casts a character to an integer.
Types of loops in c language
The document discusses the different types of loops in C language: while loop, do-while loop, and for loop. It provides the syntax and an example of each loop. The while loop checks the condition first and repeats the block of code as long as the condition is true. The do-while loop ensures the block of code executes at least once before checking the condition. The for loop allows initialization of a counter, specifies a condition to test, and how to change the counter between iterations of the loop.
Storage classes in C
Storage classes in C determine the scope, visibility, and lifetime of variables. The main storage classes are automatic, external, static, and register. Automatic variables are local to a function and destroyed when the function exits. External variables are declared outside of functions and visible throughout the program. Static variables persist for the duration of the program, while register variables attempt to store variables in CPU registers for faster access.
Functions in c++
Functions in C++ can be defined and called in various ways. The main() function is the entry point of a C++ program and returns an int value. Function prototypes declare the signature of functions without defining the body, allowing for forward declaration. Arguments can be passed by reference, allowing the called function to modify the original variables. Functions can return values by reference as well. Inline functions avoid the overhead of a function call by expanding the body directly where called.
Matlab tutorial 3
Matlab introductory course part 3 with the following agenda: Input /Output Control, Logical Structures, and Repetition Structures
Vocabulary
This document discusses various applications of derivatives including position, velocity, and acceleration which are the first and second derivatives of position functions. It also covers related rates, absolute and relative extrema found using derivatives, critical numbers where the derivative equals zero, concavity determined by the second derivative, and optimization problems which use derivatives to find unknown values.
Recursive IIR Implementation for Edge Detection
The document discusses the Deriche edge detector algorithm. It summarizes that the Deriche filter approximates Gaussian filters using recursive filters with a fixed number of coefficients. This allows edge detection to be done efficiently regardless of the Gaussian standard deviation. The algorithm uses an infinite impulse response filter form consisting of a causal and anti-causal filter. It optimizes the Canny edge detection criteria and becomes most effective when the value of omega approaches 0. The document provides code samples for implementing the Deriche edge detector.
Storage classes in c language
The document discusses storage classes in C programming which determine where a variable is stored in memory and the scope and lifetime of a variable. There are four main storage classes - automatic, external, static and register. Automatic variables are local to a block and vanish after the block ends. External variables can be accessed from other files. Static variables retain their value between function calls and last the lifetime of the program. Register variables are stored in CPU registers for faster access but there are limited registers.
Recursion.ppt
Recursion is a process where a function calls itself, either directly or indirectly. There must be a base case that does not call the function again in order to terminate the recursion. Each recursive call builds on previous results to eventually solve the overall problem. Recursive functions use more memory than iterative equivalents due to the stack of function calls, and can cause infinite recursion if base cases are not properly defined.
REINFORCEMENT LEARNING
This document provides an introduction to reinforcement learning. It defines reinforcement learning and compares it to machine learning. Key concepts in reinforcement learning are discussed such as policy, reward function, value function and environment. Examples of reinforcement learning applications include chess, robotics, petroleum refineries. Model-free and model-based methods are introduced. The document also discusses Monte Carlo methods, temporal difference learning, and Dyna-Q architecture. Finally, it provides examples of reinforcement learning problems like elevator dispatching and job shop scheduling.
Induction
The document discusses different types of induction used in mathematics and computing including numerical iteration, structural induction, and double induction. Numerical iteration involves repeating a process with the aim of approaching a desired goal. Structural induction can be used to prove properties of sets constructed recursively. Double induction involves performing induction on two variables sequentially.
Partial compute function
The document discusses the development of the theory of computation and partial recursive functions. It begins by motivating the need to formally define computable functions, as some problems were found to have no algorithmic solution. Gödel's approach is outlined, which defines some basic computable functions and rules for constructing new computable functions from existing ones. The rules include introduction and identification of variables, permutation of variables, composition, and primitive recursion. The document then discusses the need to prove that the rule of primitive recursion uniquely defines functions, as it uses implicit definition.
Recursion | C++ | DSA
The document discusses recursion and provides examples of recursive algorithms and code implementations. It defines recursion as a function calling itself directly or indirectly. Examples given include computing factorials recursively and calculating the sum of digits of a number recursively. Algorithms are presented for checking if a number is prime recursively and calculating the sum of the first N natural numbers recursively. Code snippets are included to demonstrate recursive implementations in C.
algo_vc_lecture8.ppt
This document discusses analyzing recursive algorithms and forming recurrence relations. It provides examples of writing recurrence relations for recursive functions. The key steps are:
1) Identify the base case(s) where recursive calls stop.
2) Express the work done and size of subproblems at each recursive call.
3) Derive the recurrence relation relating the function at different inputs sizes.
The recurrence relation captures the work at each level of recursion and sums the costs to determine overall runtime. Analyzing recurrences helps understand the asymptotic complexity of recursive algorithms.
Feedback linearization and Backstepping controllers for Coupled Tanks
This paper investigates the usage of some sophisticated and advanced nonlinear control algorithms inorder
to control a nonlinear Coupled Tanks System. The first control procedure is called the
Feedbacklinearisation control (FLC), this type of control has been found a successful in achieving a global
exponentialasymptotic stability, with very short time response, no significant overshooting is recordedand with a negligible norm of the error. The second control procedure is the approaches of Backsteppingcontrol (BC) which is a recursive procedure that interlaces the choice of a Lyapunov functionwith the design of feedback control, from simulation results it shown that this method preserves tracking, robust control and it can often solve stabilization problems with less restrictive conditions may beencountered in other methods. Finally both of the proposed control schemes guarantee theasymptoticstability of the closed loop system meeting trajectory tracking objectives
FEEDBACK LINEARIZATION AND BACKSTEPPING CONTROLLERS FOR COUPLED TANKS
This paper investigates the usage of some sophisticated and advanced nonlinear control algorithms inorder to control a nonlinear Coupled Tanks System. The first control procedure is called the Feedbacklinearisation control (FLC), this type of control has been found a successful in achieving a global exponentialasymptotic stability, with very short time response, no significant overshooting is recordedand with a negligible norm of the error. The second control procedure is the approaches of Backsteppingcontrol (BC) which is a recursive procedure that interlaces the choice of a Lyapunov functionwith the design of feedback control, from simulation results it shown that this method preserves tracking, robust control and it can often solve stabilization problems with less restrictive conditions may beencountered in other methods. Finally both of the proposed control schemes guarantee the asymptoticstability of the closed loop system meeting trajectory tracking objectives.
FEEDBACK LINEARIZATION AND BACKSTEPPING CONTROLLERS FOR COUPLED TANKS
This paper investigates the usage of some sophisticated and advanced nonlinear control algorithms in order to control a nonlinear Coupled Tanks System. The first control procedure is called the Feedback linearisation control (FLC), this type of control has been found a successful in achieving a global exponential asymptotic stability, with very short time response, no significant overshooting is recorded and with a negligible norm of the error. The second control procedure is the approaches of Back stepping control (BC) which is a recursive procedure that interlaces the choice of a Lyapunov function with the design of feedback control, from simulation results it shown that this method preserves tracking, robust control and it can often solve stabilization problems with less restrictive conditions may been countered in other methods. Finally both of the proposed control schemes guarantee the asymptoticstability of the closed loop system meeting trajectory tracking objectives.
Data Structures- Part5 recursion
The document discusses recursion, including:
1) Recursion involves breaking a problem down into smaller subproblems until a base case is reached, then building up the solution to the overall problem from the solutions to the subproblems.
2) A recursive function is one that calls itself, with each call typically moving closer to a base case where the problem can be solved without recursion.
3) Recursion can be linear, involving one recursive call, or binary, involving two recursive calls to solve similar subproblems.
Divide&Conquer & Dynamic Programming
The document discusses three fundamental algorithms paradigms: recursion, divide-and-conquer, and dynamic programming. Recursion uses method calls to break down problems into simpler subproblems. Divide-and-conquer divides problems into independent subproblems, solves each, and combines solutions. Dynamic programming breaks problems into overlapping subproblems and builds up solutions, storing results of subproblems to avoid recomputing them. Examples like mergesort and calculating Fibonacci numbers are provided to illustrate the approaches.
More Related Content
What's hot
Different loops in C
This presentation discusses different loops in C programming. It defines programming and structured programming. It then explains the three types of loops in C - for, while, and do/while loops. Sample programs are provided to demonstrate each loop, showing how they iterate and check their loop conditions. The for loop checks at the top of the loop. The while and do/while loops can check at the top or bottom of the loop respectively.
03 Analysis of Algorithms: Probabilistic Analysis
In this section of the course, we look at the way to use probability to analyze algorithms from the point of view of the worst case analysis.
In order to do this, we will look at:
1. What is the Probability of an Indicator function?
2. How to use the Indicator function to analyze a simple hiring algorithms.
3. How we can enforce the uniform probability property so algorithms based in probability can be simple and efficient.
Loops in C Programming | for Loop | do-while Loop | while Loop | Nested Loop
This file is based on the loops that could be used in C Programming. These are explained with some examples and sample programmings and screen shots.
NOTE: The software used in this programming is Notepad++ and the programs are compiled and run through gcc compiler using command prompt.
Conditional & Cast Operator
The document discusses the ternary operator in C programming, which returns one value if a condition is true and another value if it is false. It provides the syntax for the ternary operator and an example that uses it to print the smaller of two numbers. The document also covers type casting in C by converting the data type of a variable and provides the syntax and an example that casts a character to an integer.
Types of loops in c language
The document discusses the different types of loops in C language: while loop, do-while loop, and for loop. It provides the syntax and an example of each loop. The while loop checks the condition first and repeats the block of code as long as the condition is true. The do-while loop ensures the block of code executes at least once before checking the condition. The for loop allows initialization of a counter, specifies a condition to test, and how to change the counter between iterations of the loop.
Storage classes in C
Storage classes in C determine the scope, visibility, and lifetime of variables. The main storage classes are automatic, external, static, and register. Automatic variables are local to a function and destroyed when the function exits. External variables are declared outside of functions and visible throughout the program. Static variables persist for the duration of the program, while register variables attempt to store variables in CPU registers for faster access.
Functions in c++
Functions in C++ can be defined and called in various ways. The main() function is the entry point of a C++ program and returns an int value. Function prototypes declare the signature of functions without defining the body, allowing for forward declaration. Arguments can be passed by reference, allowing the called function to modify the original variables. Functions can return values by reference as well. Inline functions avoid the overhead of a function call by expanding the body directly where called.
Matlab tutorial 3
Matlab introductory course part 3 with the following agenda: Input /Output Control, Logical Structures, and Repetition Structures
Vocabulary
This document discusses various applications of derivatives including position, velocity, and acceleration which are the first and second derivatives of position functions. It also covers related rates, absolute and relative extrema found using derivatives, critical numbers where the derivative equals zero, concavity determined by the second derivative, and optimization problems which use derivatives to find unknown values.
Recursive IIR Implementation for Edge Detection
The document discusses the Deriche edge detector algorithm. It summarizes that the Deriche filter approximates Gaussian filters using recursive filters with a fixed number of coefficients. This allows edge detection to be done efficiently regardless of the Gaussian standard deviation. The algorithm uses an infinite impulse response filter form consisting of a causal and anti-causal filter. It optimizes the Canny edge detection criteria and becomes most effective when the value of omega approaches 0. The document provides code samples for implementing the Deriche edge detector.
Storage classes in c language
The document discusses storage classes in C programming which determine where a variable is stored in memory and the scope and lifetime of a variable. There are four main storage classes - automatic, external, static and register. Automatic variables are local to a block and vanish after the block ends. External variables can be accessed from other files. Static variables retain their value between function calls and last the lifetime of the program. Register variables are stored in CPU registers for faster access but there are limited registers.
What's hot (11)
Loops in C Programming | for Loop | do-while Loop | while Loop | Nested Loop
Loops in C Programming | for Loop | do-while Loop | while Loop | Nested Loop
Similar to N_Asm Assembly recursion (sol)
Recursion.ppt
Recursion is a process where a function calls itself, either directly or indirectly. There must be a base case that does not call the function again in order to terminate the recursion. Each recursive call builds on previous results to eventually solve the overall problem. Recursive functions use more memory than iterative equivalents due to the stack of function calls, and can cause infinite recursion if base cases are not properly defined.
REINFORCEMENT LEARNING
This document provides an introduction to reinforcement learning. It defines reinforcement learning and compares it to machine learning. Key concepts in reinforcement learning are discussed such as policy, reward function, value function and environment. Examples of reinforcement learning applications include chess, robotics, petroleum refineries. Model-free and model-based methods are introduced. The document also discusses Monte Carlo methods, temporal difference learning, and Dyna-Q architecture. Finally, it provides examples of reinforcement learning problems like elevator dispatching and job shop scheduling.
Induction
The document discusses different types of induction used in mathematics and computing including numerical iteration, structural induction, and double induction. Numerical iteration involves repeating a process with the aim of approaching a desired goal. Structural induction can be used to prove properties of sets constructed recursively. Double induction involves performing induction on two variables sequentially.
Partial compute function
The document discusses the development of the theory of computation and partial recursive functions. It begins by motivating the need to formally define computable functions, as some problems were found to have no algorithmic solution. Gödel's approach is outlined, which defines some basic computable functions and rules for constructing new computable functions from existing ones. The rules include introduction and identification of variables, permutation of variables, composition, and primitive recursion. The document then discusses the need to prove that the rule of primitive recursion uniquely defines functions, as it uses implicit definition.
Recursion | C++ | DSA
The document discusses recursion and provides examples of recursive algorithms and code implementations. It defines recursion as a function calling itself directly or indirectly. Examples given include computing factorials recursively and calculating the sum of digits of a number recursively. Algorithms are presented for checking if a number is prime recursively and calculating the sum of the first N natural numbers recursively. Code snippets are included to demonstrate recursive implementations in C.
algo_vc_lecture8.ppt
This document discusses analyzing recursive algorithms and forming recurrence relations. It provides examples of writing recurrence relations for recursive functions. The key steps are:
1) Identify the base case(s) where recursive calls stop.
2) Express the work done and size of subproblems at each recursive call.
3) Derive the recurrence relation relating the function at different inputs sizes.
The recurrence relation captures the work at each level of recursion and sums the costs to determine overall runtime. Analyzing recurrences helps understand the asymptotic complexity of recursive algorithms.
Feedback linearization and Backstepping controllers for Coupled Tanks
This paper investigates the usage of some sophisticated and advanced nonlinear control algorithms inorder
to control a nonlinear Coupled Tanks System. The first control procedure is called the
Feedbacklinearisation control (FLC), this type of control has been found a successful in achieving a global
exponentialasymptotic stability, with very short time response, no significant overshooting is recordedand with a negligible norm of the error. The second control procedure is the approaches of Backsteppingcontrol (BC) which is a recursive procedure that interlaces the choice of a Lyapunov functionwith the design of feedback control, from simulation results it shown that this method preserves tracking, robust control and it can often solve stabilization problems with less restrictive conditions may beencountered in other methods. Finally both of the proposed control schemes guarantee theasymptoticstability of the closed loop system meeting trajectory tracking objectives
FEEDBACK LINEARIZATION AND BACKSTEPPING CONTROLLERS FOR COUPLED TANKS
This paper investigates the usage of some sophisticated and advanced nonlinear control algorithms inorder to control a nonlinear Coupled Tanks System. The first control procedure is called the Feedbacklinearisation control (FLC), this type of control has been found a successful in achieving a global exponentialasymptotic stability, with very short time response, no significant overshooting is recordedand with a negligible norm of the error. The second control procedure is the approaches of Backsteppingcontrol (BC) which is a recursive procedure that interlaces the choice of a Lyapunov functionwith the design of feedback control, from simulation results it shown that this method preserves tracking, robust control and it can often solve stabilization problems with less restrictive conditions may beencountered in other methods. Finally both of the proposed control schemes guarantee the asymptoticstability of the closed loop system meeting trajectory tracking objectives.
FEEDBACK LINEARIZATION AND BACKSTEPPING CONTROLLERS FOR COUPLED TANKS
This paper investigates the usage of some sophisticated and advanced nonlinear control algorithms in order to control a nonlinear Coupled Tanks System. The first control procedure is called the Feedback linearisation control (FLC), this type of control has been found a successful in achieving a global exponential asymptotic stability, with very short time response, no significant overshooting is recorded and with a negligible norm of the error. The second control procedure is the approaches of Back stepping control (BC) which is a recursive procedure that interlaces the choice of a Lyapunov function with the design of feedback control, from simulation results it shown that this method preserves tracking, robust control and it can often solve stabilization problems with less restrictive conditions may been countered in other methods. Finally both of the proposed control schemes guarantee the asymptoticstability of the closed loop system meeting trajectory tracking objectives.
Data Structures- Part5 recursion
The document discusses recursion, including:
1) Recursion involves breaking a problem down into smaller subproblems until a base case is reached, then building up the solution to the overall problem from the solutions to the subproblems.
2) A recursive function is one that calls itself, with each call typically moving closer to a base case where the problem can be solved without recursion.
3) Recursion can be linear, involving one recursive call, or binary, involving two recursive calls to solve similar subproblems.
Divide&Conquer & Dynamic Programming
The document discusses three fundamental algorithms paradigms: recursion, divide-and-conquer, and dynamic programming. Recursion uses method calls to break down problems into simpler subproblems. Divide-and-conquer divides problems into independent subproblems, solves each, and combines solutions. Dynamic programming breaks problems into overlapping subproblems and builds up solutions, storing results of subproblems to avoid recomputing them. Examples like mergesort and calculating Fibonacci numbers are provided to illustrate the approaches.
Recursion
The document discusses recursion in computer programming. Recursion is when a function calls itself directly or indirectly. For a recursive function to terminate, it must have a base case or criteria where it no longer calls itself, and each recursive call must progress toward this base case. Recursive functions are implemented using stacks to store the state of each function call. While recursion can solve some problems more elegantly than iteration, it tends to use more memory due to the need to store activation records for each function call on the stack.
[ITP - Lecture 11] Loops in C/C++
This document discusses different types of loops in programming - for loops, while loops, and do-while loops. It provides examples of each loop type and explains their syntax and usage. The key points are:
- For loops allow specifying an initialization, condition, and increment in one line and are best for known iterations.
- While loops repeat until a condition is false and are useful when the number of iterations is unknown.
- Do-while loops are similar but check the condition after running the block once, guaranteeing it runs at least once.
- Loops can be nested, with inner loops running fully each time the outer loop increments.
Numerical analysis using Scilab: Error analysis and propagation
This tutorial provides a collection of numerical examples and advises on error analysis and its propagation. All examples are developed in Scilab.
ASE02.ppt
1) The presentation discusses Caffeine, a tool for dynamic analysis of Java programs that uses Prolog predicates to model execution events and perform analyses.
2) Caffeine models execution events like field accesses, method calls, and class loads. Queries can be written in Prolog to analyze program behavior, like counting method calls.
3) The implementation has performance issues due to overhead from event generation, requiring instrumentation tricks. Analyzing complex relationships like composition is discussed.
05 dataflow
This document provides lecture notes on dataflow analysis techniques. It introduces liveness analysis, neededness analysis, and reaching definitions analysis. Liveness analysis is extended to handle memory references. Neededness analysis is introduced to identify dead code by determining which variables are needed, rather than just live. Reaching definitions analysis is a forward dataflow analysis used for optimizations like constant propagation. Examples are provided and the analysis rules for each technique are specified.
Unit 3 principles of programming language
The document discusses concepts related to sequence control and subprograms in programming languages. It covers conditional statements, loops, exception handling, subprogram definition and activation, and subprogram environments. Key points include implicit and explicit sequence control using statements, precedence and associativity rules for expressions, stack-based implementation of subprogram calls, and static versus dynamic scoping of identifiers through referencing environments.
C Programming Unit-2
The document discusses various control flow statements in C programming such as decision control statements (if, if-else, switch-case), looping statements (for, while, do-while loops), break, continue, goto, and functions. It provides examples of using each statement type and explains their syntax and usage. Key aspects like scope of variables, parameter passing methods (call by value, call by reference), and storage classes (auto, static, extern) related to functions are also covered in the document.
3 recursion
The document discusses recursion, including recursive definitions, recursive programs/algorithms, and applications of recursion. It covers key concepts such as the anatomy of a recursive call, classifying recursions by the number of recursive calls, tail recursion, and avoiding excessive recursion. Examples of recursively defined sequences, functions, and algorithms are provided to illustrate recursive concepts.
3-Recursion.ppt
Slide about Recursive algorithms, applications of Recursive, Method call, implementation and Complexity
Copyright from FPT University
Similar to N_Asm Assembly recursion (sol) (20)
Feedback linearization and Backstepping controllers for Coupled Tanks
Feedback linearization and Backstepping controllers for Coupled Tanks
FEEDBACK LINEARIZATION AND BACKSTEPPING CONTROLLERS FOR COUPLED TANKS
FEEDBACK LINEARIZATION AND BACKSTEPPING CONTROLLERS FOR COUPLED TANKS
FEEDBACK LINEARIZATION AND BACKSTEPPING CONTROLLERS FOR COUPLED TANKS
FEEDBACK LINEARIZATION AND BACKSTEPPING CONTROLLERS FOR COUPLED TANKS
Numerical analysis using Scilab: Error analysis and propagation
Numerical analysis using Scilab: Error analysis and propagation
More from Selomon birhane
N_Asm Assembly system calls (sol)
System calls allow programs to interface with the kernel and perform tasks like input/output. In assembly, system calls are made by putting the system call number in the EAX register, arguments in registers like EBX and ECX, and calling the interrupt 80h. Common system calls include sys_write to output to the screen and sys_exit to terminate a program. The example code demonstrates using sys_write to prompt for user input, sys_read to get input, and sys_write again to display it before exiting with sys_exit.
N_Asm Assembly basic syntax (sol)
The document discusses the basic syntax of assembly language programs. It explains that an assembly program can be divided into three sections: the data section for declaring initialized data, the bss section for declaring variables, and the text section for storing the actual code. It provides examples of assembly language statements and describes the different parts of a statement. It also gives a short "Hello World" assembly language program as an example and explains how to compile and link an assembly program using NASM and LD.
N_Asm Assembly addressing modes (sol)
The document discusses different addressing modes in assembly language including register, immediate, direct memory, indirect, and direct-offset addressing. It also describes the MOV instruction which is used to move data between registers and memory locations. The MOV instruction supports five forms depending on whether the source and destination operands are registers or memory locations.
N_Asm Assembly arrays (sol)
The document discusses arrays in assembly language. It explains that data definition directives can be used to allocate storage for variables and initialize them with values. Arrays can be defined as one-dimensional using these directives by declaring multiple values separated by commas. For example, an array named NUMBERS is defined with six words initialized to the values 34, 45, 56, 67, 75, 89. The document also provides examples of initializing all values in an array to zero using repetition directives like TIMES and DW.
N_Asm Assembly arithmetic instructions (sol)
The document discusses various arithmetic instructions in assembly language including INC, DEC, ADD, SUB, MUL, DIV.
It explains the syntax and usage of each instruction, showing how they can increment, decrement, add, subtract, multiply or divide operands in registers or memory. Examples are given to illustrate how to perform basic arithmetic operations like addition and multiplication of numbers entered by the user.
N_Asm Assembly strings (sol)
This document discusses string processing in assembly language. It describes two common ways to store string lengths - explicitly storing the length or using a sentinel character. It then discusses five basic string instructions (MOVS, LODS, STOS, CMPS, SCAS) and how they can operate on bytes, words, or doublewords. Repetition prefixes like REP can be used to repeat string instructions until a counter in the CX register reaches zero, and the direction flag DF determines the direction of processing.
N_Asm Assembly numbers (sol)
The document discusses different ways of representing numerical data in assembly language programming. It explains that numbers are generally represented in binary format for arithmetic operations but displayed in ASCII format for human readability. It then describes four methods for processing numerical data: ASCII representation which stores numbers as ASCII characters; unpacked BCD representation which stores each decimal digit in a byte; packed BCD representation which stores two digits in a byte; and binary representation for direct arithmetic operations. It provides examples of how to convert between these representations and use specific instructions to perform addition and subtraction on ASCII and BCD formatted numbers.
N_Asm Assembly registers (sol)
The document discusses processor registers, which are internal memory locations used to temporarily store data and instruction addresses in order to speed up processor operations. There are different categories of registers that serve specific purposes, such as general purpose data registers (EAX, EBX, ECX, EDX) for arithmetic and logical operations, pointer registers (EIP, ESP, EBP) for addressing instructions and stack data, index registers (ESI, EDI) for indexed addressing, and control registers that store status flags. Understanding how registers are used is important for assembly language programming.
N_Asm Assembly variables (sol)
The document discusses variable declarations in assembly programming using NASM. It describes various define directives like DB, DW, DD, DQ, DT that are used to reserve storage space and optionally initialize variables. These directives allocate 1, 2, 4, 8 or 10 bytes respectively. Examples show how variables can be declared and initialized with integer, character, floating point and repeated values using directives like TIMES. Multiple variable definitions are stored in contiguous memory locations.
N_Asm Assembly macros (sol)
This document discusses macros in assembly programming. Macros allow programmers to define reusable blocks of code and assign them a name. This avoids having to repeatedly write out the same instructions. Macros are defined using the %macro and %endmacro directives. Common uses of macros include displaying strings, where the same registers need to be set up for each call. The example shows defining a "write_string" macro that handles writing a string to the screen by setting the necessary registers and making the system call.
Control system(smarajit ghosh) By sol
This document discusses the benefits of meditation for reducing stress and anxiety. It states that regular meditation practice can calm the nervous system and regulate stress levels. Meditation allows the body to relax while also providing mental clarity. Overall, meditating daily can help improve mood, decrease feelings of depression, and promote better emotional well-being over time.
Two ports
This document discusses different parameter representations for two-port networks:
- Z-parameters (open-circuit impedance parameters) relate terminal voltages to currents.
- Y-parameters (short-circuit admittance parameters) relate terminal currents to voltages.
- T-equivalent and Pi-equivalent models provide lumped-element representations of reciprocal networks.
- h-parameters and g-parameters describe the terminal characteristics of some electronic devices.
- Transmission (ABCD) parameters express source variables in terms of destination variables.
Conversion formulas are provided between the different parameter sets. Examples are included to illustrate determining the parameters for simple circuits.
More from Selomon birhane (12)
Recently uploaded
Why Choose Odoo 17 Community & How it differs from Odoo 17 Enterprise Edition
Why Choose Odoo 17 Community & How it differs from Odoo 17 Enterprise EditionEnvertis Software Solutions
Odoo ERP software
Odoo ERP software, a leading open-source software for Enterprise Resource Planning (ERP) and business management, has recently launched its latest version, Odoo 17 Community Edition. This update introduces a range of new features and enhancements designed to streamline business operations and support growth.
The Odoo Community serves as a cost-free edition within the Odoo suite of ERP systems. Tailored to accommodate the standard needs of business operations, it provides a robust platform suitable for organisations of different sizes and business sectors. Within the Odoo Community Edition, users can access a variety of essential features and services essential for managing day-to-day tasks efficiently.
This blog presents a detailed overview of the features available within the Odoo 17 Community edition, and the differences between Odoo 17 community and enterprise editions, aiming to equip you with the necessary information to make an informed decision about its suitability for your business.E-commerce Application Development Company.pdf
Your business can reach new heights with our assistance as we design solutions that are specifically appropriate for your goals and vision. Our eCommerce application solutions can digitally coordinate all retail operations processes to meet the demands of the marketplace while maintaining business continuity.
Need for Speed: Removing speed bumps from your Symfony projects ⚡️
No one wants their application to drag like a car stuck in the slow lane! Yet it’s all too common to encounter bumpy, pothole-filled solutions that slow the speed of any application. Symfony apps are not an exception.
In this talk, I will take you for a spin around the performance racetrack. We’ll explore common pitfalls - those hidden potholes on your application that can cause unexpected slowdowns. Learn how to spot these performance bumps early, and more importantly, how to navigate around them to keep your application running at top speed.
We will focus in particular on tuning your engine at the application level, making the right adjustments to ensure that your system responds like a well-oiled, high-performance race car.
How to write a program in any programming language
How to write a program in any programming language
E-Invoicing Implementation: A Step-by-Step Guide for Saudi Arabian Companies
Explore the seamless transition to e-invoicing with this comprehensive guide tailored for Saudi Arabian businesses. Navigate the process effortlessly with step-by-step instructions designed to streamline implementation and enhance efficiency.
Artificia Intellicence and XPath Extension Functions
The purpose of this presentation is to provide an overview of how you can use AI from XSLT, XQuery, Schematron, or XML Refactoring operations, the potential benefits of using AI, and some of the challenges we face.
Graspan: A Big Data System for Big Code Analysis
We built a disk-based parallel graph system, Graspan, that uses a novel edge-pair centric computation model to compute dynamic transitive closures on very large program graphs.
We implement context-sensitive pointer/alias and dataflow analyses on Graspan. An evaluation of these analyses on large codebases such as Linux shows that their Graspan implementations scale to millions of lines of code and are much simpler than their original implementations.
These analyses were used to augment the existing checkers; these augmented checkers found 132 new NULL pointer bugs and 1308 unnecessary NULL tests in Linux 4.4.0-rc5, PostgreSQL 8.3.9, and Apache httpd 2.2.18.
- Accepted in ASPLOS ‘17, Xi’an, China.
- Featured in the tutorial, Systemized Program Analyses: A Big Data Perspective on Static Analysis Scalability, ASPLOS ‘17.
- Invited for presentation at SoCal PLS ‘16.
- Invited for poster presentation at PLDI SRC ‘16.
Webinar On-Demand: Using Flutter for Embedded
Flutter is a popular open source, cross-platform framework developed by Google. In this webinar we'll explore Flutter and its architecture, delve into the Flutter Embedder and Flutter’s Dart language, discover how to leverage Flutter for embedded device development, learn about Automotive Grade Linux (AGL) and its consortium and understand the rationale behind AGL's choice of Flutter for next-gen IVI systems. Don’t miss this opportunity to discover whether Flutter is right for your project.
Neo4j - Product Vision and Knowledge Graphs - GraphSummit Paris
Dr. Jesús Barrasa, Head of Solutions Architecture for EMEA, Neo4j
Découvrez les dernières innovations de Neo4j, et notamment les dernières intégrations cloud et les améliorations produits qui font de Neo4j un choix essentiel pour les développeurs qui créent des applications avec des données interconnectées et de l’IA générative.
Microservice Teams - How the cloud changes the way we work
A lot of technical challenges and complexity come with building a cloud-native and distributed architecture. The way we develop backend software has fundamentally changed in the last ten years. Managing a microservices architecture demands a lot of us to ensure observability and operational resiliency. But did you also change the way you run your development teams?
Sven will talk about Atlassian’s journey from a monolith to a multi-tenanted architecture and how it affected the way the engineering teams work. You will learn how we shifted to service ownership, moved to more autonomous teams (and its challenges), and established platform and enablement teams.
openEuler Case Study - The Journey to Supply Chain Security
openEuler Case Study - The Journey to Supply Chain Security
SWEBOK and Education at FUSE Okinawa 2024
Takashi Kobayashi and Hironori Washizaki, "SWEBOK Guide and Future of SE Education," First International Symposium on the Future of Software Engineering (FUSE), June 3-6, 2024, Okinawa, Japan
OpenMetadata Community Meeting - 5th June 2024
The OpenMetadata Community Meeting was held on June 5th, 2024. In this meeting, we discussed about the data quality capabilities that are integrated with the Incident Manager, providing a complete solution to handle your data observability needs. Watch the end-to-end demo of the data quality features.
* How to run your own data quality framework
* What is the performance impact of running data quality frameworks
* How to run the test cases in your own ETL pipelines
* How the Incident Manager is integrated
* Get notified with alerts when test cases fail
Watch the meeting recording here - https://www.youtube.com/watch?v=UbNOje0kf6E
Unveiling the Advantages of Agile Software Development.pdf
Learn about Agile Software Development's advantages. Simplify your workflow to spur quicker innovation. Jump right in! We have also discussed the advantages.
Measures in SQL (SIGMOD 2024, Santiago, Chile)
SQL has attained widespread adoption, but Business Intelligence tools still use their own higher level languages based upon a multidimensional paradigm. Composable calculations are what is missing from SQL, and we propose a new kind of column, called a measure, that attaches a calculation to a table. Like regular tables, tables with measures are composable and closed when used in queries.
SQL-with-measures has the power, conciseness and reusability of multidimensional languages but retains SQL semantics. Measure invocations can be expanded in place to simple, clear SQL.
To define the evaluation semantics for measures, we introduce context-sensitive expressions (a way to evaluate multidimensional expressions that is consistent with existing SQL semantics), a concept called evaluation context, and several operations for setting and modifying the evaluation context.
A talk at SIGMOD, June 9–15, 2024, Santiago, Chile
Authors: Julian Hyde (Google) and John Fremlin (Google)
https://doi.org/10.1145/3626246.3653374
UI5con 2024 - Boost Your Development Experience with UI5 Tooling Extensions
The UI5 tooling is the development and build tooling of UI5. It is built in a modular and extensible way so that it can be easily extended by your needs. This session will showcase various tooling extensions which can boost your development experience by far so that you can really work offline, transpile your code in your project to use even newer versions of EcmaScript (than 2022 which is supported right now by the UI5 tooling), consume any npm package of your choice in your project, using different kind of proxies, and even stitching UI5 projects during development together to mimic your target environment.
Empowering Growth with Best Software Development Company in Noida - Deuglo
Do you want Software for your Business? Visit Deuglo
Deuglo has top Software Developers in India. They are experts in software development and help design and create custom Software solutions.
Deuglo follows seven steps methods for delivering their services to their customers. They called it the Software development life cycle process (SDLC).
Requirement — Collecting the Requirements is the first Phase in the SSLC process.
Feasibility Study — after completing the requirement process they move to the design phase.
Design — in this phase, they start designing the software.
Coding — when designing is completed, the developers start coding for the software.
Testing — in this phase when the coding of the software is done the testing team will start testing.
Installation — after completion of testing, the application opens to the live server and launches!
Maintenance — after completing the software development, customers start using the software.
Oracle Database 19c New Features for DBAs and Developers.pptx
Oracle Database 19c New Features for DBAs and Developers. This video you can watch from my youtube channel at https://youtu.be/m-F-mZA3MkU
Energy consumption of Database Management - Florina Jonuzi
Presentation from Florina Jonuzi at the GSD Community Stage Meetup on June 06, 2024
UI5con 2024 - Keynote: Latest News about UI5 and it’s Ecosystem
Learn about the latest innovations in and around OpenUI5/SAPUI5: UI5 Tooling, UI5 linter, UI5 Web Components, Web Components Integration, UI5 2.x, UI5 GenAI.
Recording:
https://www.youtube.com/live/MSdGLG2zLy8?si=INxBHTqkwHhxV5Ta&t=0
Recently uploaded (20)
Why Choose Odoo 17 Community & How it differs from Odoo 17 Enterprise Edition
Why Choose Odoo 17 Community & How it differs from Odoo 17 Enterprise Edition
Need for Speed: Removing speed bumps from your Symfony projects ⚡️
Need for Speed: Removing speed bumps from your Symfony projects ⚡️
How to write a program in any programming language
How to write a program in any programming language
E-Invoicing Implementation: A Step-by-Step Guide for Saudi Arabian Companies
E-Invoicing Implementation: A Step-by-Step Guide for Saudi Arabian Companies
Artificia Intellicence and XPath Extension Functions
Artificia Intellicence and XPath Extension Functions
Neo4j - Product Vision and Knowledge Graphs - GraphSummit Paris
Neo4j - Product Vision and Knowledge Graphs - GraphSummit Paris
Microservice Teams - How the cloud changes the way we work
Microservice Teams - How the cloud changes the way we work
openEuler Case Study - The Journey to Supply Chain Security
openEuler Case Study - The Journey to Supply Chain Security
Unveiling the Advantages of Agile Software Development.pdf
Unveiling the Advantages of Agile Software Development.pdf
UI5con 2024 - Boost Your Development Experience with UI5 Tooling Extensions
UI5con 2024 - Boost Your Development Experience with UI5 Tooling Extensions
Empowering Growth with Best Software Development Company in Noida - Deuglo
Empowering Growth with Best Software Development Company in Noida - Deuglo
Oracle Database 19c New Features for DBAs and Developers.pptx
Oracle Database 19c New Features for DBAs and Developers.pptx
Energy consumption of Database Management - Florina Jonuzi
Energy consumption of Database Management - Florina Jonuzi
UI5con 2024 - Keynote: Latest News about UI5 and it’s Ecosystem
UI5con 2024 - Keynote: Latest News about UI5 and it’s Ecosystem
N_Asm Assembly recursion (sol)
- 1. http://www.tutorialspoint.com/assembly_prog ramming /assembly_recursion.htm Copyright © tutorialspoint.com ASSEMBLY - RECURSION A recursive procedure is one that calls itself. There are two kinds of recursion: direct and indirect. Indirect recursion, the procedure calls itself and inindirect recursion, the first procedure calls a second procedure, whichinturncalls the first procedure. Recursioncould be observed innumerous mathematicalalgorithms. For example, consider the case of calculating the factorialof a number. Factorialof a number is givenby the equation: Fact (n) = n * fact (n-1) for n > 0 For example: factorialof 5 is 1 x 2 x 3 x 4 x 5 = 5 x factorialof 4 and this canbe a good example of showing a recursive procedure. Every recursive algorithmmust have anending condition, i.e., the recursive calling of the programshould be stopped whena conditionis fulfilled. Inthe case of factorialalgorithm, the end conditionis reached whennis 0. The following programshows how factorialnis implemented inassembly language. To keep the program simple, we willcalculate factorial3. section .text global _start ;must be declared for using gcc _start: ;tell linker entry point mov bx, 3 ;for calculating factorial 3 call proc_fact add ax, 30h mov [fact], ax mov edx,len ;message length mov ecx,msg ;message to write mov ebx,1 ;file descriptor (stdout) mov eax,4 ;system call number (sys_write) int 0x80 ;call kernel mov edx,1 ;message length mov ecx,fact ;message to write mov ebx,1 ;file descriptor (stdout) mov eax,4 ;system call number (sys_write) int 0x80 ;call kernel mov eax,1 ;system call number (sys_exit) int 0x80 ;call kernel proc_fact: cmp bl, 1 jg do_calculation mov ax, 1 ret do_calculation: dec bl call proc_fact inc bl mul bl ;ax = al * bl ret section .data msg db 'Factorial 3 is:',0xa len equ $ - msg section .bss fact resb 1 Whenthe above code is compiled and executed, it produces the following result: Factorial 3 is: 6