0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (1)
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 3 of 3 matches in All Departments

Elementary Approach To Design And Analysis Of Algorithms, An (Hardcover): Lekh Rej Vermani, Shalini Vermani Elementary Approach To Design And Analysis Of Algorithms, An (Hardcover)
Lekh Rej Vermani, Shalini Vermani
R3,030 Discovery Miles 30 300 Ships in 10 - 15 working days

'The book under review is an interesting elaboration that fills the gaps in libraries for concisely written and student-friendly books about essentials in computer science ... I recommend this book for anyone who would like to study algorithms, learn a lot about computer science or simply would like to deepen their knowledge ... The book is written in very simple English and can be understood even by those with limited knowledge of the English language. It should be emphasized that, despite the fact that the book consists of many examples, mathematical formulas and theorems, it is very hard to find any mistakes, errors or typos.'zbMATHIn computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks.As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing 'output' and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single-Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.

Course In Discrete Mathematical Structures, A (Paperback): Lekh Rej Vermani, Shalini Vermani Course In Discrete Mathematical Structures, A (Paperback)
Lekh Rej Vermani, Shalini Vermani
R1,768 Discovery Miles 17 680 Ships in 12 - 17 working days

This book provides a broad introduction to some of the most fascinating and beautiful areas of discrete mathematical structures. It starts with a chapter on sets and goes on to provide examples in logic, applications of the principle of inclusion and exclusion and finally the pigeonhole principal. Computational techniques including the principle of mathematical introduction are provided, as well as a study on elementary properties of graphs, trees and lattices. Some basic results on groups, rings, fields and vector spaces are also given, the treatment of which is intentionally simple since such results are fundamental as a foundation for students of discrete mathematics. In addition, some results on solutions of systems of linear equations are discussed.

Course In Discrete Mathematical Structures, A (Hardcover, New): Lekh Rej Vermani, Shalini Vermani Course In Discrete Mathematical Structures, A (Hardcover, New)
Lekh Rej Vermani, Shalini Vermani
R3,529 Discovery Miles 35 290 Ships in 12 - 17 working days

This book provides a broad introduction to some of the most fascinating and beautiful areas of discrete mathematical structures. It starts with a chapter on sets and goes on to provide examples in logic, applications of the principle of inclusion and exclusion and finally the pigeonhole principal. Computational techniques including the principle of mathematical introduction are provided, as well as a study on elementary properties of graphs, trees and lattices. Some basic results on groups, rings, fields and vector spaces are also given, the treatment of which is intentionally simple since such results are fundamental as a foundation for students of discrete mathematics. In addition, some results on solutions of systems of linear equations are discussed.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Loot
Nadine Gordimer Paperback  (2)
R383 R318 Discovery Miles 3 180
Lucky Lubricating Clipper Oil (100ml)
R49 R29 Discovery Miles 290
Seagull Clear Storage Box (14lt)
R170 R158 Discovery Miles 1 580
Maped Color'Peps Infinity Colour Pencils…
R118 R102 Discovery Miles 1 020
Bestway Solar Float Lamp
R265 Discovery Miles 2 650
Casio LW-200-7AV Watch with 10-Year…
R999 R884 Discovery Miles 8 840
Colleen Pencil Crayons - Assorted…
R101 Discovery Miles 1 010
Pet Mall Pet Bed Rectangle Fur 100cm X…
R2,950 Discovery Miles 29 500
Sony NEW Playstation Dualshock 4 v2…
 (22)
R1,428 Discovery Miles 14 280
Bostik Clear (50ml)
R57 Discovery Miles 570

 

Partners