Algorithms : (Record no. 84392)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03942nam a22007695i 4500 |
001 - CONTROL NUMBER | |
control field | 9783110693607 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240730161507.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 240130t20212021gw fo d z eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783110693607 |
041 0# - LANGUAGE CODE | |
Language code of text/sound track or separate title | |
100 1# - AUTHOR NAME | |
Author | Dimri, Sushil C., |
245 10 - TITLE STATEMENT | |
Title | Algorithms : |
Sub Title | Design and Analysis / |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | 1 online resource (X, 168 p.) |
490 0# - SERIES STATEMENT | |
Series statement | De Gruyter Textbook |
520 ## - SUMMARY, ETC. | |
Summary, etc | Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem. |
700 1# - AUTHOR 2 | |
Author 2 | Malik, Preeti, |
700 1# - AUTHOR 2 | |
Author 2 | Ram, Mangey, |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | https://doi.org/10.1515/9783110693607?locatt=mode:legacy |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | https://www.degruyter.com/isbn/9783110693607 |
856 42 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | https://www.degruyter.com/document/cover/isbn/9783110693607/original |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks |
264 #1 - | |
-- | Berlin ; |
-- | Boston : |
-- | De Gruyter, |
-- | [2021] |
264 #4 - | |
-- | 2021 |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
588 0# - | |
-- | Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Jan 2024) |
650 #4 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Algorithmen. |
650 #4 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Datenstrukturen. |
650 #4 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Künstliche Intelligenz. |
650 #4 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Maschinelles Lernen. |
650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | COMPUTERS / Programming / Algorithms. |
912 ## - | |
-- | EBA_BACKALL |
912 ## - | |
-- | EBA_CL_CHCOMSGSEN |
912 ## - | |
-- | EBA_DGALL |
912 ## - | |
-- | EBA_EBACKALL |
912 ## - | |
-- | EBA_EBKALL |
912 ## - | |
-- | EBA_ECL_CHCOMSGSEN |
912 ## - | |
-- | EBA_EEBKALL |
912 ## - | |
-- | EBA_ESTMALL |
912 ## - | |
-- | EBA_STMALL |
912 ## - | |
-- | GBV-deGruyter-alles |
912 ## - | |
-- | PDA12STME |
912 ## - | |
-- | PDA13ENGE |
912 ## - | |
-- | PDA18STMEE |
912 ## - | |
-- | PDA5EBK |
No items available.