Malik ram (130 risultati)

paperback. Condizione: Very Good.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New.

Condizione: New.

Hardcover. Condizione: New. ISBN:9781032765976,152pp.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PF. Condizione: New.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Brand New. 492 pages. 9.00x6.00x1.10 inches. In Stock.

Condizione: New. In English.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Very Good. 2nd EDITION. 2nd Edition, First Printing. Not price-clipped. Published by National Book Trust, 1980. Octavo. Paperback. Books are very good with shelf/edgewear. 100% positive feedback. 30 day money back guarantee. NEXT DAY SHIPPING! Excellent customer service. Please email with any questions. All books packed carefully and ship with free delivery confirmation/tracking. All books come with free bookmarks. Ships from Sag Harbor, New York. …

Condizione: New.

Paperback. Condizione: New. 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.…

Paperback. Condizione: New. 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.…

Condizione: New.

Paperback. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 3-4 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Brand New. 492 pages. 6.00x1.25x9.00 inches. In Stock.

Condizione: New.