Text book of design and analysis of algorithm (Record no. 7928)
| 000 -LEADER | |
|---|---|
| fixed length control field | nam a22 7a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200306132140.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 200306b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9789350164693 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | AEF |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Edition number | 23rd ed. |
| Classification number | 005.1 |
| Item number | DEO |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Deore, Y. A. |
| 9 (RLIN) | 1317 |
| 245 11 - TITLE STATEMENT | |
| Title | Text book of design and analysis of algorithm |
| Remainder of title | M. Sc.(Sem-I) (Computer Science) According to new CBCS syllabus w. e. f. 2019-20 |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | Pune: |
| Name of publisher, distributor, etc. | Vision publication, |
| Date of publication, distribution, etc. | 2019 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 240 p. : |
| Dimensions | 21 cm |
| 501 ## - WITH NOTE | |
| With note | 1. Basics of Algorithms<br/>• Algorithm definition and characteristics<br/>• Space complexity<br/>• Time complexity, worst case-best case-average case<br/>• complexity, asymptotic notation<br/>• Recursive and non-recursive algorithms<br/>• Sorting algorithms (insertion sort, heap sort, bubble sort)<br/>• Sorting in linear time: counting sort, the concept of the bucket and radix sort<br/>• Searching algorithms: Linear, Binary<br/><br/>2. Divide and conquer strategy<br/>• A general method, control abstraction<br/>• Binary search<br/>• Merge sort, Quicksort<br/>• Comparison between Traditional Method of Matrix Multiplication vs. Strassen’s Matrix Multiplication<br/><br/>3. Greedy Method<br/>• Knapsack problem<br/>• Job sequencing with deadlines,<br/>• Minimum-cost spanning trees: Kruskal and Prim’s algorithm<br/>• Optimal storage on tapes<br/>• Optimal merge patterns<br/>• Huffman coding<br/>• Shortest Path: Dijkstra’s Algorithm<br/><br/>4. Dynamic Programming<br/>• Principle of optimality<br/>• Matrix chain multiplication<br/>• 0/1 Knapsack Problem<br/>i) Merge & Purge<br/>ii) Functional Method<br/>• Bellman-Ford Algorithm<br/>• All pairs Shortest Path Floyd- Warshall Algorithm<br/>• Longest common subsequence,<br/>• String editing, Travelling Salesperson problem<br/><br/>5. Decrease and Conquer<br/>• Definition of Graph Representation of graph<br/>• By Constant - DFS and BFS<br/>• Topological sorting<br/>• Connected components and spanning trees<br/>• By Variable Size decrease Euclid’s algorithm<br/>• Articulation Point and Bridge edge<br/><br/>6. Backtracking<br/>• General method<br/>• Fixed Tuple vs. Variable Tuple Formulation<br/>• n- Queen’s problem<br/>• Graph colouring problem<br/>• Hamiltonian cycle<br/>• Sum of subsets<br/><br/>7. Branch and Bound<br/>• Introduction<br/>• FIFO BB Search, LIFO Search<br/>• Definitions of LCBB Search<br/>• Bounding Function, Ranking Function<br/>• Travelling Salesman problem Using Variable tuple<br/>• Formulation using LCBB<br/>• 0/1 knapsack problem using LCBB<br/><br/>8. Problem Classification <br/>• Nondeterministic algorithm<br/>• The class of P, NP, NP-hard and NP-Complete problems<br/>• Cook’s theorem |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer algorithms |
| 9 (RLIN) | 1327 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | FYMSc-Sem -I |
| 9 (RLIN) | 1149 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Algorithms |
| 9 (RLIN) | 1328 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer science |
| 9 (RLIN) | 1329 |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Chaudhari, P. P. |
| 9 (RLIN) | 1151 |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Paatil, S. |
| 9 (RLIN) | 1152 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | |
| Koha item type | |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Permanent Location | Current Location | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Barcode | Date last seen | Copy number | Cost, replacement price | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | 2020-03-03 | Bill No. : 1767 dated 01-03-2020 | 206.25 | 005.15 SAR | 5201 | 2020-03-06 | 1 | 275.00 | 2020-03-06 | ||||||
| AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | 2020-03-03 | Bill No. : 1767 dated 01-03-2020 | 206.25 | 005.15 SAR | 5202 | 2020-03-06 | 2 | 275.00 | 2020-03-06 | ||||||
| AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | 2020-03-03 | Bill No. : 1767 dated 01-03-2020 | 206.25 | 005.15 SAR | 5203 | 2020-03-06 | 3 | 275.00 | 2020-03-06 | ||||||
| AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | 2020-03-03 | Bill No. : 1767 dated 01-03-2020 | 206.25 | 005.15 SAR | 5204 | 2020-03-06 | 4 | 275.00 | 2020-03-06 | ||||||
| AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | AEF's Arihant college of Arts, Commerce and Science, Camp, Pune-01 | 2020-03-03 | Bill No. : 1767 dated 01-03-2020 | 206.25 | 005.15 SAR | 5205 | 2020-03-06 | 5 | 275.00 | 2020-03-06 |