Techniques for designing and analyzing algorithms / (Record no. 62943)

MARC details
000 -LEADER
fixed length control field 02423dam a2200265 i 4500
001 - CONTROL NUMBER
control field 0000372252
003 - CONTROL NUMBER IDENTIFIER
control field 0001
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221214s2022 flu ob 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2021000963
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780367228897 (hardback)
Qualifying information (ebook)
Canceled/invalid ISBN 9780367228897
Qualifying information (hardback)
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Language of cataloging eng
Transcribing agency DLC
Description conventions rda
Modifying agency DLC
042 ## - AUTHENTICATION CODE
Authentication code pcc
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.1
Edition number 23
084 ## - OTHER CLASSIFICATION NUMBER
Classification number 518.1
Item number STI-T
Number source 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Stinson, Douglas R.
Fuller form of name (Douglas Robert),
Dates associated with a name 1956-
Relator term author.
245 10 - TITLE STATEMENT
Title Techniques for designing and analyzing algorithms /
Medium Book /
Statement of responsibility, etc. Douglas R. Stinson.
300 ## - PHYSICAL DESCRIPTION
Extent xii, 430 pages :
Dimensions 26 cm.
365 ## - TRADE PRICE
Price type code 01
Price amount 19,741.12
500 ## - GENERAL NOTE
General note Includes index
520 ## - SUMMARY, ETC.
Summary, etc. "Design and analysis of algorithms can be a difficult subject for students due to its sometimes-abstract nature and its use of a wide variety of mathematical tools. Here the author, an experienced and successful textbook writer, makes the subject as straightforward as possible in an up-to-date textbook incorporating various new developments appropriate for an introductory course. This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented. In addition, the text includes useful introductory material on mathematical background including order notation, algorithm analysis and reductions, and basic data structures. This will serve as a useful review and reference for students who have covered this material in a previous course. Features The first three chapters provide a mathematical review, basic algorithm analysis, and data structures. Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included. Proofs of correctness of algorithms are included when appropriate. The book presents a suitable amount of mathematical rigor. After reading and understanding the material in this book, students will be able to apply the basic design principles to various real-world problems that they may encounter in their future professional careers"--
Assigning source Provided by publisher.
521 ## - TARGET AUDIENCE NOTE
Target audience note All.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms
Form subdivision Textbooks.
852 ## - LOCATION
Accession No. 10001000062610
-- 19741.12
-- Allied Book Company
Former shelving location Books
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Date acquired Total checkouts Full call number Barcode Date last seen Date last checked out Price effective from Koha item type
        Junaid Zaidi Library, COMSATS University Islamabad Junaid Zaidi Library, COMSATS University Islamabad 09/09/2023 1 518.1 STI-T 62610 10001000062610 02/14/2024 11/01/2023 09/09/2023 Books