Chap14
•Download as PPT, PDF•
0 likes•259 views
This chapter discusses recursion, including recursive definitions, algorithms, and methods. It explores the concepts of base cases and general cases in recursion. The chapter covers tracing and designing recursive methods, as well as direct and indirect recursion. Examples of recursive functions like factorial, Fibonacci, and drawing Sierpinski gaskets are provided. Recursion is compared to iteration, and both approaches are discussed as solutions to problems.
Report
Share
Report
Share
![Chapter Objectives ,[object Object],[object Object],[object Object],Java Programming: From Problem Analysis to Program Design, 3e](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Chapter 13
The document discusses recursion, including recursive definitions, algorithms, and methods. It explores the concepts of base cases and general cases in recursion. Examples are provided of recursively calculating factorials, finding the largest value in an array, computing Fibonacci numbers, solving the Towers of Hanoi problem, and generating Sierpinski gaskets. Both direct and indirect recursion are covered. The chapter summary restates the key topics on recursion.
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.
Iterations and Recursions
The document discusses the differences between recursion and iteration. Recursion involves a method calling itself, with each call reducing the problem size until a base case is reached. Iteration uses loops to repeat a process. Examples include calculating factorials, Fibonacci numbers, and binary search recursively and iteratively. Some problems like directory traversal are simpler using recursion due to its divide-and-conquer approach, while iterations may be preferred for easier explanation or to avoid stack overflows with deep recursions.
Ch10 Recursion
The document discusses recursion, including:
1) Recursion is a programming technique where a method calls itself to solve a problem. It involves a base case and recursive calls.
2) Examples of recursive definitions and programs are given, such as computing factorials and sums recursively.
3) Recursion can be direct, where a method calls itself, or indirect through multiple method calls eventually leading back to the original method.
Network Security CS3-4
Random numo Galois Field
Polynomial Arithmetic
Example of Polynomial Arithmetic
bers, its types and usage.
TRNG, PRNG, CHPRNG
Review of BBS
Stream Ciphering
RC4 algorithm
Basic Number Theory
Extended Euclidean Algorithm
Relevance of Extended Euclidean Algorithm
Data Structures- Part2 analysis tools
This document discusses algorithm analysis tools. It explains that algorithm analysis is used to determine which of several algorithms to solve a problem is most efficient. Theoretical analysis counts primitive operations to approximate runtime as a function of input size. Common complexity classes like constant, linear, quadratic, and exponential time are defined based on how quickly runtime grows with size. Big-O notation represents the asymptotic upper bound of a function's growth rate to classify algorithms.
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.
Database structure Structures Link list and trees and Recurison complete
Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete
Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete
Recommended
Chapter 13
The document discusses recursion, including recursive definitions, algorithms, and methods. It explores the concepts of base cases and general cases in recursion. Examples are provided of recursively calculating factorials, finding the largest value in an array, computing Fibonacci numbers, solving the Towers of Hanoi problem, and generating Sierpinski gaskets. Both direct and indirect recursion are covered. The chapter summary restates the key topics on recursion.
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.
Iterations and Recursions
The document discusses the differences between recursion and iteration. Recursion involves a method calling itself, with each call reducing the problem size until a base case is reached. Iteration uses loops to repeat a process. Examples include calculating factorials, Fibonacci numbers, and binary search recursively and iteratively. Some problems like directory traversal are simpler using recursion due to its divide-and-conquer approach, while iterations may be preferred for easier explanation or to avoid stack overflows with deep recursions.
Ch10 Recursion
The document discusses recursion, including:
1) Recursion is a programming technique where a method calls itself to solve a problem. It involves a base case and recursive calls.
2) Examples of recursive definitions and programs are given, such as computing factorials and sums recursively.
3) Recursion can be direct, where a method calls itself, or indirect through multiple method calls eventually leading back to the original method.
Network Security CS3-4
Random numo Galois Field
Polynomial Arithmetic
Example of Polynomial Arithmetic
bers, its types and usage.
TRNG, PRNG, CHPRNG
Review of BBS
Stream Ciphering
RC4 algorithm
Basic Number Theory
Extended Euclidean Algorithm
Relevance of Extended Euclidean Algorithm
Data Structures- Part2 analysis tools
This document discusses algorithm analysis tools. It explains that algorithm analysis is used to determine which of several algorithms to solve a problem is most efficient. Theoretical analysis counts primitive operations to approximate runtime as a function of input size. Common complexity classes like constant, linear, quadratic, and exponential time are defined based on how quickly runtime grows with size. Big-O notation represents the asymptotic upper bound of a function's growth rate to classify algorithms.
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.
Database structure Structures Link list and trees and Recurison complete
Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete
Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete Database structure Structures Link list and trees and Recurison complete
Cis068 08
The document introduces stacks and recursion. It defines stacks as LIFO data structures and discusses how they are used in programming, particularly in method calls and the JVM. Recursion is introduced as a problem-solving technique that breaks problems down into smaller instances of the same problem. It notes recursion uses stacks to store information during method calls and provides examples of recursive algorithms and problems.
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.
Recursion
1. The document discusses recursion and provides examples of recursively defined problems and their solutions, including factorials, powers, greatest common divisor, Fibonacci series, Towers of Hanoi, and counting cells in a blob.
2. Recursion involves breaking a problem into smaller subproblems of the same type until reaching a base case that can be solved directly. The solutions to subproblems are then combined to solve the original problem.
3. Examples of recursively defined problems include mathematical formulas, searching and sorting algorithms like binary search, and problems like Towers of Hanoi that are naturally broken down recursively.
Analysis Of Algorithms I
The document discusses analyzing the running time of algorithms using Big-O notation. It begins by introducing Big-O notation and how it is used to generalize the running time of algorithms as input size grows. It then provides examples of calculating the Big-O running time of simple programs and algorithms with loops but no subprogram calls or recursion. Key concepts covered include analyzing worst-case and average-case running times, and rules for analyzing the running time of programs with basic operations and loops.
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.
Introduction to c programming
1.History of C Language, Structure of a C program, Statements, Basic Data Types, Variables &Constants, Input & Output statements, Operators and Precedence, Expressions, Simple C programs.
PYTHON FULL TUTORIAL WITH PROGRAMMS
1. The Python if statement is used to execute code conditionally based on the evaluation of an expression. It can be used with simple conditions, if-else statements, and nested if statements.
2. Python if-else statements allow executing one block of code if a condition is true and another block if the condition is false.
3. Nested if statements in Python allow checking multiple conditions, with inner if statements executing only if the outer conditions are met.
Recursion and Sorting Algorithms
These slides are part of a full series of slides which covers almost all the basic concepts of data structures and algorithms.
Part 3
Csit77406
This document introduces a four-valued logic proposed by the author. It begins by discussing other multi-valued logics proposed in the early 20th century. It then describes the author's four-valued logic, including its truth tables. It also compares it to other logics. The document outlines a C program the author wrote to discover possible logics based on input constraints. It provides an example of the input constraints used and shows the C source code. The document discusses properties checked by the program and outputs solutions if they satisfy the properties.
Data Structures- Part1 overview and review
This document provides an overview of the Data Structures I course. It outlines the course objectives of becoming familiar with problem solving, algorithms, data structures, and tracing algorithms. The course will cover fundamentals of data structures and algorithms, static and dynamic data structures, searching and sorting algorithms, recursion, abstract data types, stacks, queues and trees. Exams, labs, participation and quizzes will be used for grading. Pseudo-code is introduced as a way to express algorithms independent of a programming language. Examples of algorithms for determining even/odd numbers and computing weekly wages are provided.
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.
Data Structure
The binary search is faster than the sequential search. The complexity of binary search is O(log n) whereas the complexity of a sequential search is O(n). Stacks are used to evaluate algebraic or arithmetic expressions using prefix or postfix notations. Heap sort involves creating a max heap from the array and then replacing the root with the last element and rebuilding the heap for the remaining elements, repeating this process to sort the entire array.
Adobe
The document describes several Adobe interview test papers that the author took. It provides examples of questions asked in sections on coding (C/Java), data structures, algorithms, quantitative aptitude, and logical reasoning. Some example questions include finding the fourth smallest element in a binary search tree, reversing a linked list, checking if all computers are connected in a network, and problems involving arithmetic, triangles, and pie charts. The tests focused on fundamental concepts in coding, data structures, algorithms, and math.
C interview-questions-techpreparation
The document provides an interview questions and answers guide for C programming language. It includes questions on topics such as the definition of C language, differences between functions like printf and sprintf, static variables, unions, linked lists, storage classes in C, and hashing. For each question, it provides multiple detailed answers explaining concepts in C programming such as memory allocation, strings, pointers, macros and more.
Sample prac exam2013
This document provides instructions for a programming assignment involving a class called AverageOrderLocate. Students are asked to complete three methods within the class: averageOfPositives to calculate the average of positive numbers in an array, orderDescending to sort an array in descending order, and locateGuess to search a sorted array for a user-guessed number and output its position. The document outlines the parameters and functionality of each method. It also provides example output to help guide students in properly implementing and running the full program.
Recursion Pattern Analysis and Feedback
This presentation describes an approach to analysis of common recursion patterns in purely functional code. The goal is to recognize common patterns and provide the user with hints how to improve them using standard FP techniques (map, fold etc.). This presentation was given as part of the Advanced Functional Programming Seminar at Utrecht University.
Iteration, induction, and recursion
The document discusses various topics related to analyzing algorithms, including:
i. Analysis of running time and using recurrence equations to predict how long recursive algorithms take on different input sizes.
ii. Iteration, induction, and recursion as fundamental concepts in data structures and algorithms. Recursive programs can sometimes be simpler than iterative programs.
iii. Proving properties of programs formally or informally, such as proving statements are true for each iteration of a loop or recursive call of a function. This is often done using induction.
Programming with matlab session 4
Learning to write programs using selection
Condition: Relational and Logical Expressions , Conditional Statements (if statement) , Choosing from Multiple Alternatives
Exercises in writing conditions using relational, logical operations, writing programs involving if statement, if-else, if- elseif and switch case statements in MATLAB
Data structures using C
The document discusses key concepts related to data structures and algorithms in C including:
1. Data structures allow for efficient storage and retrieval of data through logical organization and mathematical modeling.
2. Algorithms must be correct, finite, and efficient to solve problems by taking input and producing output through a defined sequence of steps.
3. Common data structures covered include arrays, stacks, queues, linked lists, trees, and graphs. Abstract data types allow separation of implementation from interface.
A critical reassessment of
In this paper we analyze the cryptanalysis of the simplified data encryption standard algorithm using metaheuristics
and in particular genetic algorithms. The classic fitness function when using such an algorithm
is to compare n-gram statistics of a the decrypted message with those of the target message. We show that
using such a function is irrelevant in case of Genetic Algorithm, simply because there is no correlation
between the distance to the real key (the optimum) and the value of the fitness, in other words, there is no
hidden gradient. In order to emphasize this assumption we experimentally show that a genetic algorithm
perform worse than a random search on the cryptanalysis of the simplified data encryption standard
algorithm.
9781111530532 ppt ch13
The document discusses recursion, including recursive definitions, algorithms, and methods. It explores the concepts of base cases and general cases in recursion. Examples are provided of recursively calculating factorials, finding the largest value in an array, computing the Fibonacci sequence, solving the Towers of Hanoi problem, and generating Sierpinski gaskets. Both direct and indirect recursion are covered. The chapter summary restates the key topics on recursion.
Chap07
The document discusses user-defined methods in Java programming. It covers key concepts like value-returning and void methods, parameters, and scope. It provides examples of defining methods that return values or perform actions, and using reference variables and primitive data types as parameters. The document also explains how parameters are passed by value for primitive types but by reference for objects, and the scope rules for identifiers within methods and classes.
More Related Content
What's hot
Cis068 08
The document introduces stacks and recursion. It defines stacks as LIFO data structures and discusses how they are used in programming, particularly in method calls and the JVM. Recursion is introduced as a problem-solving technique that breaks problems down into smaller instances of the same problem. It notes recursion uses stacks to store information during method calls and provides examples of recursive algorithms and problems.
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.
Recursion
1. The document discusses recursion and provides examples of recursively defined problems and their solutions, including factorials, powers, greatest common divisor, Fibonacci series, Towers of Hanoi, and counting cells in a blob.
2. Recursion involves breaking a problem into smaller subproblems of the same type until reaching a base case that can be solved directly. The solutions to subproblems are then combined to solve the original problem.
3. Examples of recursively defined problems include mathematical formulas, searching and sorting algorithms like binary search, and problems like Towers of Hanoi that are naturally broken down recursively.
Analysis Of Algorithms I
The document discusses analyzing the running time of algorithms using Big-O notation. It begins by introducing Big-O notation and how it is used to generalize the running time of algorithms as input size grows. It then provides examples of calculating the Big-O running time of simple programs and algorithms with loops but no subprogram calls or recursion. Key concepts covered include analyzing worst-case and average-case running times, and rules for analyzing the running time of programs with basic operations and loops.
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.
Introduction to c programming
1.History of C Language, Structure of a C program, Statements, Basic Data Types, Variables &Constants, Input & Output statements, Operators and Precedence, Expressions, Simple C programs.
PYTHON FULL TUTORIAL WITH PROGRAMMS
1. The Python if statement is used to execute code conditionally based on the evaluation of an expression. It can be used with simple conditions, if-else statements, and nested if statements.
2. Python if-else statements allow executing one block of code if a condition is true and another block if the condition is false.
3. Nested if statements in Python allow checking multiple conditions, with inner if statements executing only if the outer conditions are met.
Recursion and Sorting Algorithms
These slides are part of a full series of slides which covers almost all the basic concepts of data structures and algorithms.
Part 3
Csit77406
This document introduces a four-valued logic proposed by the author. It begins by discussing other multi-valued logics proposed in the early 20th century. It then describes the author's four-valued logic, including its truth tables. It also compares it to other logics. The document outlines a C program the author wrote to discover possible logics based on input constraints. It provides an example of the input constraints used and shows the C source code. The document discusses properties checked by the program and outputs solutions if they satisfy the properties.
Data Structures- Part1 overview and review
This document provides an overview of the Data Structures I course. It outlines the course objectives of becoming familiar with problem solving, algorithms, data structures, and tracing algorithms. The course will cover fundamentals of data structures and algorithms, static and dynamic data structures, searching and sorting algorithms, recursion, abstract data types, stacks, queues and trees. Exams, labs, participation and quizzes will be used for grading. Pseudo-code is introduced as a way to express algorithms independent of a programming language. Examples of algorithms for determining even/odd numbers and computing weekly wages are provided.
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.
Data Structure
The binary search is faster than the sequential search. The complexity of binary search is O(log n) whereas the complexity of a sequential search is O(n). Stacks are used to evaluate algebraic or arithmetic expressions using prefix or postfix notations. Heap sort involves creating a max heap from the array and then replacing the root with the last element and rebuilding the heap for the remaining elements, repeating this process to sort the entire array.
Adobe
The document describes several Adobe interview test papers that the author took. It provides examples of questions asked in sections on coding (C/Java), data structures, algorithms, quantitative aptitude, and logical reasoning. Some example questions include finding the fourth smallest element in a binary search tree, reversing a linked list, checking if all computers are connected in a network, and problems involving arithmetic, triangles, and pie charts. The tests focused on fundamental concepts in coding, data structures, algorithms, and math.
C interview-questions-techpreparation
The document provides an interview questions and answers guide for C programming language. It includes questions on topics such as the definition of C language, differences between functions like printf and sprintf, static variables, unions, linked lists, storage classes in C, and hashing. For each question, it provides multiple detailed answers explaining concepts in C programming such as memory allocation, strings, pointers, macros and more.
Sample prac exam2013
This document provides instructions for a programming assignment involving a class called AverageOrderLocate. Students are asked to complete three methods within the class: averageOfPositives to calculate the average of positive numbers in an array, orderDescending to sort an array in descending order, and locateGuess to search a sorted array for a user-guessed number and output its position. The document outlines the parameters and functionality of each method. It also provides example output to help guide students in properly implementing and running the full program.
Recursion Pattern Analysis and Feedback
This presentation describes an approach to analysis of common recursion patterns in purely functional code. The goal is to recognize common patterns and provide the user with hints how to improve them using standard FP techniques (map, fold etc.). This presentation was given as part of the Advanced Functional Programming Seminar at Utrecht University.
Iteration, induction, and recursion
The document discusses various topics related to analyzing algorithms, including:
i. Analysis of running time and using recurrence equations to predict how long recursive algorithms take on different input sizes.
ii. Iteration, induction, and recursion as fundamental concepts in data structures and algorithms. Recursive programs can sometimes be simpler than iterative programs.
iii. Proving properties of programs formally or informally, such as proving statements are true for each iteration of a loop or recursive call of a function. This is often done using induction.
Programming with matlab session 4
Learning to write programs using selection
Condition: Relational and Logical Expressions , Conditional Statements (if statement) , Choosing from Multiple Alternatives
Exercises in writing conditions using relational, logical operations, writing programs involving if statement, if-else, if- elseif and switch case statements in MATLAB
Data structures using C
The document discusses key concepts related to data structures and algorithms in C including:
1. Data structures allow for efficient storage and retrieval of data through logical organization and mathematical modeling.
2. Algorithms must be correct, finite, and efficient to solve problems by taking input and producing output through a defined sequence of steps.
3. Common data structures covered include arrays, stacks, queues, linked lists, trees, and graphs. Abstract data types allow separation of implementation from interface.
A critical reassessment of
In this paper we analyze the cryptanalysis of the simplified data encryption standard algorithm using metaheuristics
and in particular genetic algorithms. The classic fitness function when using such an algorithm
is to compare n-gram statistics of a the decrypted message with those of the target message. We show that
using such a function is irrelevant in case of Genetic Algorithm, simply because there is no correlation
between the distance to the real key (the optimum) and the value of the fitness, in other words, there is no
hidden gradient. In order to emphasize this assumption we experimentally show that a genetic algorithm
perform worse than a random search on the cryptanalysis of the simplified data encryption standard
algorithm.
What's hot (20)
Similar to Chap14
9781111530532 ppt ch13
The document discusses recursion, including recursive definitions, algorithms, and methods. It explores the concepts of base cases and general cases in recursion. Examples are provided of recursively calculating factorials, finding the largest value in an array, computing the Fibonacci sequence, solving the Towers of Hanoi problem, and generating Sierpinski gaskets. Both direct and indirect recursion are covered. The chapter summary restates the key topics on recursion.
Chap07
The document discusses user-defined methods in Java programming. It covers key concepts like value-returning and void methods, parameters, and scope. It provides examples of defining methods that return values or perform actions, and using reference variables and primitive data types as parameters. The document also explains how parameters are passed by value for primitive types but by reference for objects, and the scope rules for identifiers within methods and classes.
Chapter 13 - Recursion
This chapter discusses recursion, including recursive definitions, algorithms, and methods. It covers key concepts like base cases, general cases, and tracing recursive calls. Examples are provided for recursive functions like factorial, finding the largest value in an array, Fibonacci numbers, Towers of Hanoi, and drawing Sierpinski gaskets. Both designing recursive methods and choosing between recursion and iteration are addressed.
Chap02
The document discusses the basic elements of a Java program, including methods, identifiers, data types, expressions, input/output statements, and packages. It covers primitive data types like int and float, arithmetic operators, strings, variables, and how to write a simple Java application program. The chapter objectives are to familiarize readers with these core programming concepts in Java.
9781111530532 ppt ch07
The document discusses user-defined methods in Java programming. It covers key concepts like value-returning and void methods, parameters, scope of identifiers, and method overloading. Examples are provided to illustrate how to define and call methods to perform tasks like finding the largest number in a data set. Reference variables can be used as parameters to allow methods to modify the values of objects in the caller's scope.
9781111530532 ppt ch07
The document discusses user-defined methods in Java programming. It covers key concepts like value-returning and void methods, parameters, scope of identifiers, and method overloading. Examples are provided to illustrate concepts like passing primitive and reference variables as parameters, and how scope rules apply to identifiers declared within methods.
Chap03
This chapter discusses objects, classes, and input/output in Java programming. It covers defining objects and reference variables, using predefined classes and methods, the String class, formatting output, parsing numeric strings, input/output dialog boxes, reading/writing to files. Examples are provided to demonstrate calculating movie ticket sales and donations, and reading/writing student grades to files.
Chap03
The document discusses various topics related to objects and input/output in Java programming including:
- Declaring reference variables and instantiating objects
- Using predefined classes and methods
- The String class and commonly used String methods
- Formatting output using printf and parsing numeric strings
- Using dialog boxes and the JOptionPane class for input/output
- Reading from and writing to files for input/output
9781439035665 ppt ch07
The document discusses user-defined methods in Java programming. It covers key concepts like value-returning and void methods, parameters, scope of identifiers, and method overloading. Examples are provided to demonstrate how to define and call methods, pass parameters by value and by reference, and overload methods by having different parameter lists.
9781111530532 ppt ch02
This chapter introduces the basic components of a Java program, including methods, data types, expressions, input/output, and control structures. It discusses primitive data types like int and float, arithmetic operators, variables, strings, and how to write a simple Java application. The chapter emphasizes proper syntax, formatting and debugging techniques to avoid bugs in programs.
9781439035665 ppt ch02
This chapter discusses the basic elements of a Java program, including methods, identifiers, data types, expressions, input/output statements, and packages. It explains how to write a simple Java application with a main method, import packages, declare variables, read input from the user, and print output. The chapter also covers arithmetic operators, strings, assignments, and programming style best practices.
Chap13
The document discusses advanced GUI and graphics topics in Java, including applets, fonts, colors, graphics, additional GUI components like text areas and combo boxes, layout managers, menus, and handling key and mouse events. It provides details on classes like Font, Color, Graphics, and components like JTextArea, JCheckBox, JComboBox. It compares applets to GUI applications and discusses how to convert between the two. The chapter aims to teach working with advanced GUI features in Java programs.
Chap05
This chapter discusses repetition and looping control structures in Java, including while, for, and do-while loops. It provides examples of using these loops, such as printing numbers in a range or calculating Fibonacci numbers recursively. The chapter also covers statements for early loop exit like break and continue, and nesting control structures for increased complexity.
Chap06
This chapter discusses graphical user interfaces (GUIs) and object-oriented design in Java. It covers basic GUI components like JFrame, JLabel, JTextField and JButton. It explains how to create windows and add components to them. It also discusses event-driven programming and handling events. Finally, it provides an overview of object-oriented design principles like identifying classes and methods from the problem statement.
Chap04
This chapter discusses control structures in Java programming, including selection structures like if/else statements and switch statements. It covers logical and relational operators, comparing strings, and how to properly use the syntax for if/else and switch statements. Examples are provided to demonstrate how to use these control structures to write programs that can evaluate conditions and branch the program flow accordingly.
9781111530532 ppt ch03
The document discusses key concepts in Chapter 3 of a Java programming textbook, including objects and reference variables, using predefined classes and methods, the String class, input/output, and formatting output. It explains how to declare and instantiate objects, call methods, use the String class, accept user input via dialog boxes, and format output with printf. The chapter objectives are to learn about objects, reference variables, predefined methods, the String class, input/output dialog boxes, formatting decimal output with String format, and file input/output.
9781111530532 ppt ch03
The document discusses key concepts in Chapter 3 of a Java programming textbook, including objects and reference variables, using predefined classes and methods, the String class, input/output, and formatting output. It explains how to declare and instantiate objects, call methods, use the String class, accept user input via dialog boxes, and format output with printf. The chapter objectives are to learn about objects, reference variables, predefined methods, the String class, input/output dialog boxes, formatting decimal output with String format, and file input/output.
05slide
This document discusses chapters and concepts from Liang's Introduction to Java Programming textbook. It covers defining and using methods in Java, including defining methods with parameters and return types, invoking methods by passing arguments, and how method calls are handled by the call stack. Key points covered include formal vs actual parameters, method signatures, return values, and reusing methods from other classes. Examples are provided to demonstrate calculating sums and finding maximum values using methods.
9781111530532 ppt ch08
The document discusses key concepts in object-oriented programming including classes, class members, access modifiers, constructors, and abstract data types. It provides examples of defining a Clock class with data members like hours, minutes, seconds and methods like setTime(), getHours(). It also discusses class diagrams, variable declaration, defining constructors, static members, and the toString() method. The Candy Machine programming example illustrates designing classes to model a candy vending machine problem.
Ase02.ppt
The document summarizes work on Caffeine, a tool for dynamic analysis of Java programs. It discusses:
1) The motivation for dynamic analysis to understand program behavior at runtime.
2) Models used in Caffeine including a trace model to record execution events and an execution model using Prolog predicates.
3) An example analysis counting the number of backtracks in a n-queens algorithm to illustrate using Caffeine.
Similar to Chap14 (20)
More from Terry Yoast
9781305078444 ppt ch12
This chapter introduces jQuery, a commonly used JavaScript library. It allows developers to select elements, traverse the DOM, manipulate elements, and handle events with minimal code. The chapter covers including the jQuery library, selecting elements with CSS selectors, DOM traversal methods, manipulation methods, specifying event handlers, and animation methods.
9781305078444 ppt ch11
This chapter discusses updating web pages with Ajax. It introduces the XMLHttpRequest object, which allows asynchronous JavaScript requests and responses between a client and server without reloading the page. It covers the steps to make HTTP requests and process responses, including opening and sending requests, receiving data, and handling synchronous vs asynchronous requests. It also discusses techniques for making cross-domain requests, such as using JSON-P or CORS.
9781305078444 ppt ch10
This chapter discusses programming for touchscreens and mobile devices in JavaScript. It covers using touch, pointer, and geolocation events to integrate mouse and touch interactions. It also provides ways to optimize mobile web apps, such as minimizing file sizes and loading scripts responsively. The chapter aims to help developers make their apps accessible and functional across different mobile platforms and input types.
9781305078444 ppt ch09
This chapter discusses managing state information and security in JavaScript. It covers saving state with query strings, hidden form fields, and cookies. Cookies are small pieces of information stored by the web server on the user's computer. The chapter also discusses JavaScript security issues and the same origin policy, which restricts how scripts can access other domains. Web storage is introduced as an alternative to cookies that is easier to use but has less browser support.
9781305078444 ppt ch08
This chapter discusses manipulating data in strings and arrays in JavaScript. It covers string and array properties and methods for parsing, formatting, searching, extracting, replacing, sorting, and combining strings and array elements. The chapter also covers defining and using regular expressions to validate user input.
9781305078444 ppt ch07
This chapter discusses object-oriented programming concepts in JavaScript like encapsulation and interfaces. It covers built-in JavaScript classes like Date, Number, and Math that can be used to manipulate dates, numbers, and perform math functions. The chapter also explains how to define custom JavaScript objects using object literals and constructor functions, and how to add methods and properties to objects.
9781305078444 ppt ch06
This chapter discusses enhancing and validating forms with JavaScript. It covers customizing browser-based validation, implementing custom validation functions to check for errors, and displaying error messages. Some key points covered include validating required fields, dependent fields, and content type with custom functions. It also discusses improving form usability with techniques like removing default selections and dynamically updating fields based on user inputs.
9781305078444 ppt ch05
This document provides an overview of working with the Document Object Model (DOM) and Dynamic HTML (DHTML) in JavaScript. It discusses the browser object model and DOM tree, and how to access and manipulate DOM elements using methods like getElementById(), getElementsByTagName(), and querySelectorAll(). It also covers adding, removing, and cloning DOM nodes. Finally, it discusses the Window, History, Location, and Screen objects and their properties and methods for manipulating the browser window and navigating between pages.
9781305078444 ppt ch04
This chapter discusses debugging and error handling in JavaScript. It covers recognizing different types of errors like syntax errors and logic errors. It also discusses various debugging techniques like using error messages, comments, alerts, console.log(), breakpoints, and the debugger tools in browsers to trace errors. Handling exceptions gracefully with try/catch blocks and implementing custom error handling is also covered.
9781305078444 ppt ch03
This chapter discusses arrays, loops, and conditional statements in JavaScript. It covers how to store data in arrays, access and modify array elements, and determine an array's length. The chapter also explains while, do/while, and for loops for repeatedly executing code. It describes if, if/else, and switch conditional statements for making decisions, including nesting statements and else if constructions.
9781305078444 ppt ch02
This chapter discusses functions, data types, and operators in JavaScript. It covers defining and calling functions, variable scope, built-in and custom functions, primitive and non-primitive data types including strings, numbers, Booleans, and null/undefined. The chapter also explains arithmetic, assignment, comparison, logical, and special operators as well as operator precedence.
9781305078444 ppt ch01
The document discusses the history and components of the World Wide Web and HTML. It introduces JavaScript as a client-side scripting language that allows for interactive web pages. Key points covered include the difference between client-side and server-side scripting, adding JavaScript to web pages using the <script> element, and structuring JavaScript code by placing it in the document body or an external .js file. The document also addresses writing valid JavaScript code that can be validated as XHTML.
9781337102087 ppt ch13
This document discusses overloading and templates in C++. It covers operator overloading, including restrictions and syntax for overloading operators as member and nonmember functions. It also discusses function templates and class templates, explaining that templates allow writing generic code for related functions and classes. Function templates simplify function overloading, while class templates create parameterized types. The document provides examples of overloading operators and creating function and class templates.
9781337102087 ppt ch18
This chapter discusses stacks and queues as data structures. It describes stack operations like push and pop and how to implement stacks as arrays and linked lists. It also covers queue operations and implementations as well as using stacks and queues to solve problems involving infix expressions, recursion removal, and simulations.
9781337102087 ppt ch17
This document discusses linked lists and their implementation in C++. It covers the basic properties of linked lists, including how they are composed of nodes that contain data and a pointer to the next node. The key operations of linked lists are described, such as traversing the list, inserting and deleting nodes, and building the list in both the forward and backward directions. Implementing linked lists as an abstract data type is also covered, including defining iterator classes to iterate through the list.
9781337102087 ppt ch16
This chapter discusses searching, sorting algorithms, and the vector type in C++. It covers sequential search, bubble sort, insertion sort, and binary search algorithms. It also introduces the vector type, which implements a dynamic list that can grow and shrink in size during program execution. Some key operations on vectors include accessing elements, inserting/deleting, and iterating through elements using a range-based for loop.
9781337102087 ppt ch15
The document discusses recursion, including recursive definitions, algorithms, and functions. It defines recursion as solving a problem by reducing it to smaller instances of itself. A recursive definition has a base case that directly solves the simplest problem, and a general case that reduces the problem to a smaller instance. Recursive algorithms are implemented using recursive functions, which call themselves directly or indirectly. The document also compares recursion to iteration and discusses factors like efficiency to consider when choosing an approach.
9781337102087 ppt ch14
The document discusses exception handling in C++. It covers try/catch blocks for handling exceptions, throwing exceptions, and creating custom exception classes. The key aspects are using try/catch blocks to handle exceptions, throwing exceptions within try blocks, and creating exception classes that inherit from the base exception class. Catch blocks specify the exception type and contain handling code. Exceptions not caught will terminate the program through stack unwinding.
9781337102087 ppt ch12
This chapter covers pointers, classes, virtual functions, and abstract classes in C++. It discusses pointer variables and how to declare and manipulate them. It covers using pointers with classes and structs, as well as dynamic variables created with new and delete. The chapter also explores pointers with inheritance and polymorphism through virtual functions and abstract classes. It addresses issues like shallow vs deep copying when using pointers with classes.
9781337102087 ppt ch11
This document provides an overview of inheritance and composition in C++. It discusses key concepts such as derived classes inheriting properties from base classes, redefining member functions of base classes in derived classes, how constructors and destructors work in inheritance hierarchies, and the differences between inheritance, aggregation, and composition relationships between classes. The document also covers stream class hierarchies and the three main types of inheritance: public, protected, and private.
More from Terry Yoast (20)
Recently uploaded
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Librarians are leading the way in creating future-ready citizens – now we need to update our spaces to match. In this session, attendees will get inspiration for transforming their library spaces. You’ll learn how to survey students and patrons, create a focus group, and use design thinking to brainstorm ideas for your space. We’ll discuss budget friendly ways to change your space as well as how to find funding. No matter where you’re at, you’ll find ideas for reimagining your space in this session.
Leveraging Generative AI to Drive Nonprofit Innovation
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
How to Manage Your Lost Opportunities in Odoo 17 CRM
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...Nguyen Thanh Tu Collection
https://app.box.com/s/tacvl9ekroe9hqupdnjruiypvm9rdanePengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
Walmart Business+ and Spark Good for Nonprofits.pdf
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
Wound healing PPT
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...Nguyen Thanh Tu Collection
https://app.box.com/s/y977uz6bpd3af4qsebv7r9b7s21935vdRHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Physical pharmaceutics notes for B.pharm students
PCOS corelations and management through Ayurveda.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Main Java[All of the Base Concepts}.docx
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
Recently uploaded (20)
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Leveraging Generative AI to Drive Nonprofit Innovation
Leveraging Generative AI to Drive Nonprofit Innovation
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering.pptx
How to Manage Your Lost Opportunities in Odoo 17 CRM
How to Manage Your Lost Opportunities in Odoo 17 CRM
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Walmart Business+ and Spark Good for Nonprofits.pdf
Walmart Business+ and Spark Good for Nonprofits.pdf
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Chap14
- 1. Java Programming: From Problem Analysis to Program Design, 3e Chapter 14 Recursion
- 5. Recursive Definitions (continued) Java Programming: From Problem Analysis to Program Design, 3e
- 13. Recursive Factorial Method Java Programming: From Problem Analysis to Program Design, 3e public static int fact( int num) { if (num = = 0) return 1; else return num * fact(num – 1); }
- 14. Recursive Factorial Method (continued) Java Programming: From Problem Analysis to Program Design, 3e
- 15. Largest Value in Array Java Programming: From Problem Analysis to Program Design, 3e
- 17. Largest Value in Array (continued) Java Programming: From Problem Analysis to Program Design, 3e public static int largest( int [] list, int lowerIndex, int upperIndex) { int max; if (lowerIndex == upperIndex) return list[lowerIndex]; else { max = largest(list, lowerIndex + 1, upperIndex); if (list[lowerIndex] >= max) return list[lowerIndex]; else return max; } }
- 18. Execution of largest (list, 0, 3) Java Programming: From Problem Analysis to Program Design, 3e
- 19. Execution of largest (list, 0, 3) Java Programming: From Problem Analysis to Program Design, 3e
- 20. Recursive Fibonacci Java Programming: From Problem Analysis to Program Design, 3e
- 21. Recursive Fibonacci (continued) Java Programming: From Problem Analysis to Program Design, 3e public static int rFibNum( int a, int b, int n) { if (n == 1) return a; else if (n == 2) return b; else return rFibNum(a, b, n -1) + rFibNum(a, b, n - 2); }
- 22. Recursive Fibonacci (continued) Java Programming: From Problem Analysis to Program Design, 3e
- 23. Towers of Hanoi Problem with Three Disks Java Programming: From Problem Analysis to Program Design, 3e
- 24. Towers of Hanoi: Three Disk Solution Java Programming: From Problem Analysis to Program Design, 3e
- 25. Towers of Hanoi: Three Disk Solution (continued) Java Programming: From Problem Analysis to Program Design, 3e
- 26. Towers of Hanoi: Recursive Algorithm Java Programming: From Problem Analysis to Program Design, 3e public static void moveDisks( int count, int needle1, int needle3, int needle2) { if (count > 0) { moveDisks(count - 1, needle1, needle2, needle3); System.out.println( " Move disk " + count + " from needle " + needle1 + " to needle " + needle3 + " . " ); moveDisks(count - 1, needle2, needle3, needle1); } }
- 28. Programming Example: Decimal to Binary Java Programming: From Problem Analysis to Program Design, 3e public static void decToBin( int num, int base) { if (num > 0) { decToBin(num / base, base); System.out.print(num % base); } }
- 29. Execution of decToBin(13, 2) Java Programming: From Problem Analysis to Program Design, 3e
- 30. Sierpinski Gaskets of Various Orders Java Programming: From Problem Analysis to Program Design, 3e
- 32. Programming Example: Sierpinski Gasket (continued) Java Programming: From Problem Analysis to Program Design, 3e private void drawSierpinski(Graphics g, int lev, Point p1, Point p2, Point p3) { Point midP1P2; Point midP2P3; Point midP3P1; if (lev > 0) { g.drawLine(p1.x, p1.y, p2.x, p2.y); g.drawLine(p2.x, p2.y, p3.x, p3.y); g.drawLine(p3.x, p3.y, p1.x, p1.y); midP1P2 = midPoint(p1, p2); midP2P3 = midPoint(p2, p3); midP3P1 = midPoint(p3, p1); drawSierpinski(g, lev - 1, p1, midP1P2, midP3P1); drawSierpinski(g, lev - 1, p2, midP2P3, midP1P2); drawSierpinski(g, lev - 1, p3, midP3P1, midP2P3); } }
- 33. Programming Example: Sierpinski Gasket Input Java Programming: From Problem Analysis to Program Design, 3e