The Resource Practical analysis of algorithms, Dana Vrajitoru, William Knight

# Practical analysis of algorithms, Dana Vrajitoru, William Knight Resource Information The item Practical analysis of algorithms, Dana Vrajitoru, William Knight represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri-St. Louis Libraries.This item is available to borrow from 1 library branch.

Label
Practical analysis of algorithms
Title
Practical analysis of algorithms
Statement of responsibility
Dana Vrajitoru, William Knight
Creator
Contributor
Author
Subject
Genre
Language
eng
Summary
Analysis of algorithms plays an essential role in the education and training of any serious programmer preparing to deal with real world applications. Practical Analysis of Algorithms introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Throughout the text, the explanations are aimed at the level of understanding of a typical upper-level student, and are accompanied by detailed examples and classroom-tested exercises. Topics and features: Includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background Describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations Examines recurrence relations, a very important tool used in the analysis of algorithms Discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities Reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort Introduces a variety of classical finite graph algorithms, together with an analysis of their complexity Provides an appendix on probability theory, reviewing the major definitions and theorems used in the book This clearly-structured and easy-to-read textbook/reference applies a unique, practical approach suitable for professional short courses and tutorials, as well as for students of computer science. Dr. Dana Vrajitoru is an Associate Professor of Computer Science at Indiana University South Bend, IN, USA. Dr. William Knight is an Emeritus Associate Professor at the same institution
Member of
GW5XE
Vrajitoru, Dana
Dewey number
005.1
Illustrations
illustrations
Index
index present
Language note
English
LC call number
QA76.9.A43
Literary form
non fiction
Nature of contents
• dictionaries
• bibliography
1939-
Knight, William
Series statement
• Computer algorithms
• Computer algorithms
Label
Practical analysis of algorithms, Dana Vrajitoru, William Knight
Instantiates
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
• cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
• txt
Content type MARC source
rdacontent
Contents
Introduction -- Mathematical Preliminaries -- Fundamental Notations in Analysis of Algorithms -- Recurrence Relations -- Deterministic Analysis of Algorithms -- Algorithms and Probabilities -- Finite Graph Algorithms -- Appendix: Probability Theory
Control code
891058143
Dimensions
unknown
Extent
1 online resource (xii, 466 pages)
File format
unknown
Form of item
online
Isbn
9783319098883
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
• c
Other control number
10.1007/978-3-319-09888-3
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)891058143
Label
Practical analysis of algorithms, Dana Vrajitoru, William Knight
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
• cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
• txt
Content type MARC source
rdacontent
Contents
Introduction -- Mathematical Preliminaries -- Fundamental Notations in Analysis of Algorithms -- Recurrence Relations -- Deterministic Analysis of Algorithms -- Algorithms and Probabilities -- Finite Graph Algorithms -- Appendix: Probability Theory
Control code
891058143
Dimensions
unknown
Extent
1 online resource (xii, 466 pages)
File format
unknown
Form of item
online
Isbn
9783319098883
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
• c
Other control number
10.1007/978-3-319-09888-3
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)891058143

#### Library Locations

• Thomas Jefferson Library
1 University Blvd, St. Louis, MO, 63121, US
38.710138 -90.311107