01219nam a2200265 i 4500991003615829707536190304s sz b 001 0 eng d9783319713588b14360573-39ule_instDip. di Studi UmanisticiitaLiterature, belief and knowledge in early modern England :knowing faith /Subha Mukherji, Tim Stuart-Buttle, editorsCham :Palgrave Macmillan,[2018]XVII, 300 p. :ill. ;22 cmCrossroads of knowledge in early modern literatureContiene riferimenti bibliografici. IndiceTeoria della conoscenzaReligione e letteraturaStuart-Buttle,Timauthorhttp://id.loc.gov/vocabulary/relators/aut1358688Mukherji, Subhaauthorhttp://id.loc.gov/vocabulary/relators/aut785869.b1436057306-03-1904-03-19991003615829707536LE012 820 MUK 01.0112007000293508le012pE125.00-l- 02020.i1588156806-03-19Literature, belief and knowledge in early modern England3370348UNISALENTOle01204-03-19ma -engsz 0002940nam 2200493 450 991055425210332120231110230111.03-11-069360-710.1515/9783110693607(CKB)4100000011768962(DE-B1597)545598(OCoLC)1241451913(DE-B1597)9783110693607(MiAaPQ)EBC6510014(Au-PeEL)EBL6510014(EXLCZ)99410000001176896220211005d2021 uy 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierAlgorithms design and analysis /Sushil C. Dimri, Preeti Malik, Mangey RamBerlin ;Boston :De Gruyter,[2021]©20211 online resource (X, 168 p.)De Gruyter Textbook3-11-069341-0 Frontmatter -- Preface -- Contents -- Chapter 1 Introduction -- Chapter 2 Sorting techniques -- Chapter 3 Algorithm design techniques -- Chapter 4 Advanced graph algorithm -- Chapter 5 Number theory, classification of problems, and random algorithms -- Chapter 6 Tree and heaps -- Chapter 7 Lab session -- Further reading -- IndexAlgorithms 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, Brach 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.De Gruyter Textbook Computer algorithmsComputer algorithms.005.1Dimri Sushil C.1217346Malik PreetiRam MangeyMiAaPQMiAaPQMiAaPQBOOK9910554252103321Algorithms2815415UNINA