Educators teaching Algorithms and students taking the course consider running time analysis of recursive algorithms one of the most difficult topics in the course. The limited number of examples in the textbooks is not sufficient to grasp the topic for most of the learners. This text is designed to help students learn time performance analysis. It may be helpful for instructors teaching those courses as well by providing them a poll of test questions, or helping those to create projects that are variations of existing examples. The book provides 60 examples. They are grouped into decrease-by-constant, decrease-by-constant-factor, divide-and-conquer, and general-decrease type. Each example has a description of the problem, recursive algorithm implemented in Java, and full running time analysis consisting of problem size, basic operation, recurrence, and detailed derivation of solution for the recurrence. Most of the examples were given to students on tests, final exams, or were part of the assigned projects. The last chapter of the book provides templates for the following seven basic complexity categories: log n, n, n log n, n squared, n cubed, a raised to the power of n , and n!, together with a list of possible variations for each template that do not affect their asymptotic performance. In addition, we provide list of problems to illustrate each of the templates.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Irena Pevac is a professor of computer science at Central Connecticut State University. She has over twenty years of experience teaching Algorithms in undergraduate and graduate level courses. Other computer science courses that she taught are: introductory programming courses, data structures, database, artificial intelligence, theory of computation, and theoretical computer science. She published four books and over 40 papers in journals and conference proceedings. The domain of her research publications includes automata and formal languages, computability, artificial intelligence, theorem proving, database design, algorithm time performance, and teaching.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 37309455
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9781539088868
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: As New. Unread book in perfect condition. Codice articolo 37309455
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 37309455-n
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 37309455-n
Quantità: Più di 20 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Paperback. Condizione: new. Paperback. Educators teaching Algorithms and students taking the course consider running time analysis of recursive algorithms one of the most difficult topics in the course. The limited number of examples in the textbooks is not sufficient to grasp the topic for most of the learners. This text is designed to help students learn time performance analysis. It may be helpful for instructors teaching those courses as well by providing them a poll of test questions, or helping those to create projects that are variations of existing examples. The book provides 60 examples. They are grouped into decrease-by-constant, decrease-by-constant-factor, divide-and-conquer, and general-decrease type. Each example has a description of the problem, recursive algorithm implemented in Java, and full running time analysis consisting of problem size, basic operation, recurrence, and detailed derivation of solution for the recurrence. Most of the examples were given to students on tests, final exams, or were part of the assigned projects. The last chapter of the book provides templates for the following seven basic complexity categories: log n, n, n log n, n squared, n cubed, a raised to the power of n, and n!, together with a list of possible variations for each template that do not affect their asymptotic performance. In addition, we provide list of problems to illustrate each of the templates. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9781539088868
Quantità: 1 disponibili