Malik Ram (112 results)

paperback. Condition: Very Good.

paperback. Condition: VeryGood. A copy that may have been read, very minimal wear and tear. May have a remainder mark.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

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

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

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

Condition: As New. Unread book in perfect condition.

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

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

Condition: New.

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

Condition: New.

Condition: New.

Paperback. Condition: 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.

Condition: As New. Unread book in perfect condition.

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

Condition: New. pp. 210.

Condition: New. pp. 210.

Condition: New.

Condition: New.

Taschenbuch. Condition: Neu. Neuware - - If you see moon, you see the beauty of God. If you see sun, you see the power of God. If you see yourself in the mirror, you see the best creation of God. Humans are the greatest creation of God. Mountains are God's majestic thoughts; Stars are God's brilliant thoughts; flowers are God's Beautiful thoughts. Humans are His own thoughts.- God gave you a life by selecting one sperm out of millions of choices. So, you are unique and original and only one master piece. Out of millions God selected one to be your life partner. Your life partner is the greatest wealth you got, save it.- Life is a gift from God; the way we live is our gift to God.- Soul uses human body as an instrument to do Karma. Through Karma, one realizes his own divinity through work and duty. 'Good Karma(s) are the invisible hinges on the doors of heaven.'- Man is free to attain any tendency that he may chose. In a garden there is mud, as well as fragrance of flowers. Worms creep in the mud, flies select muck and bees go straight to flowers. Honeybees detect fructose in the tiny hidden flowers. Poisonous snakes create venom out of harmless organic substance. Everyone receives the things of his or her choosing. Humans have a choice to make, be kind or cruel.- Concept of God is a fundamental element in the human constitution. While God gifted us with life, He did not promise, 'Skies always blue, Flowers in the pathways, Sun without rain, joy without sorrow. But God promised: Strength for the day, Rest for the labor; light for the way, Grace for the trails; Help from above, Unfailing Sympathy, Undying Love.'.…

Condition: New.

Condition: As New. Unread book in perfect condition.