Practical Analysis of Algorithms (Record no. 51696)

000 -LEADER
fixed length control field 03775nam a22005175i 4500
001 - CONTROL NUMBER
control field 978-3-319-09888-3
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200420220217.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 140903s2014 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783319098883
-- 978-3-319-09888-3
082 04 - CLASSIFICATION NUMBER
Call Number 005.1
100 1# - AUTHOR NAME
Author Vrajitoru, Dana.
245 10 - TITLE STATEMENT
Title Practical Analysis of Algorithms
300 ## - PHYSICAL DESCRIPTION
Number of Pages XII, 466 p. 245 illus.
490 1# - SERIES STATEMENT
Series statement Undergraduate Topics in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Introduction -- Mathematical Preliminaries -- Fundamental Notations in Analysis of Algorithms -- Recurrence Relations -- Deterministic Analysis of Algorithms -- Algorithms and Probabilities -- Finite Graph Algorithms -- Appendix: Probability Theory.
520 ## - SUMMARY, ETC.
Summary, etc 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.
700 1# - AUTHOR 2
Author 2 Knight, William.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-319-09888-3
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2014.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer programming.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithms.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer logic.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Logics and Meanings of Programs.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming Techniques.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithms.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 1863-7310
912 ## -
-- ZDB-2-SCS

No items available.