Search results for "Data Structures using C"
Items we need to order for you
R 1,954.00
R 580.00
Modular Calculus for the Average Cost of Data Structuring
This book introduces the first programming language for which average-case time analysis of its programs is guaranteed to be modular. The main time measure currently used for real-time languages (worst-case time) is well-known not to be modular in general, which makes average-case analysis notoriously difficult. Schellekens includes sample programs as well as derivations of the average-case time of these programs to illustrate this radically different approach.
R 3,033.21
R 554.00
Introduction to Computational Modeling Using C and Open-Source Tools
Introduction to Computational Modeling Using C and Open-Source Tools presents the fundamental principles of computational models from a computer science perspective. It explains how to implement these models using the C programming language. The software tools used in the book include the Gnu Scientific Library (GSL), which is a free software library of C functions, and the versatile, open-source GnuPlot for visualizing the data. All source files, shell scripts, and additional notes are located at ksuweb.kennesaw.edu/~jgarrido/compmodels.The book first presents an overview of problem solving and the introductory concepts, principles, and development of computational models before covering the programming principles of the C programming language. The author then applies programming principles and basic numerical techniques, such as polynomial evaluation, regression, and other numerical methods, to implement computational models. He also discusses more advanced concepts needed for modeling dynamical systems and explains how to generate numerical solutions. The book concludes with the modeling of linear optimization problems.Emphasizing analytical skill development and problem solving, this book helps you understand how to reason about and conceptualize the problems, generate mathematical formulations, and computationally visualize and solve the problems. It provides you with the foundation to understand more advanced scientific computing, including parallel computing using MPI, grid computing, and other techniques in high-performance computing.
R 9,345.38
R 2,985.33
Algorithms and Data Structures
This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application.This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.
R 2,373.96
Common-Sense Guide to Data Structures and Algorithms in Javascript, Volume 1
If you thought data structures and algorithms were all just theory, you're missing out on what they can do for your JavaScript code. Learn to use Big O notation to make your code run faster by orders of magnitude. Choose from data structures such as hash tables, trees, and graphs to increase your code's efficiency exponentially. With simple language and clear diagrams, this book makes this complex topic accessible, no matter your background. Every chapter features practice exercises to give you the hands-on information you need to master data structures and algorithms for your day-to-day work. Algorithms and data structures are much more than abstract concepts. Mastering them enables you to write code that runs faster and more efficiently, which is particularly important for today's web and mobile apps. Take a practical approach to data structures and algorithms, with techniques and real-world scenarios that you can use in your daily production code. The JavaScript edition uses JavaScript exclusively for all code examples, exercises, and solutions. Use Big O notation to measure and articulate the efficiency of your code, and modify your algorithm to make it faster. Find out how your choice of arrays, linked lists, and hash tables can dramatically affect the code you write. Use recursion to solve tricky problems and create algorithms that run exponentially faster than the alternatives. Dig into advanced data structures such as binary trees and graphs to help scale specialized applications such as social networks and mapping software. You'll even encounter a single keyword that can give your code a turbo boost. Practice your new skills with exercises in every chapter, along with detailed solutions. Use these techniques today to make your JavaScript code faster and more scalable. What You Need: Certain code examples take advantage of recently introduced JavaScript features. Therefore, it's important to use a JavaScript environment that supports ECMAScript 6+ or a newer version.
R 2,421.00
Algorithms and Data Structures
The papers in this volume were presented at the 9th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place during August 15 - 17, 2005, at the University of Waterloo, Waterloo, Canada. The workshop alternateswith the ScandinavianWorkshopon Algorithm Theory(SWAT), c- tinuing the traditionof SWAT and WADS startingwith SWAT 1988and WADS 1989. From 90 submissions, the Program Committee selected 37 papers for p- sentation at the workshop. In addition, invited lectures were given by the f- lowing distinguished researchers: Allan Borodin and Max J. Egenhofer. OnbehalfoftheProgramCommittee,wewouldliketoexpressoursincere- preciation to the many persons whose e?ort contributed to making WADS 2005 a success. These include the invited speakers,members of the ste- ing and ProgramCommittees, the authors who submitted papers, and the many referees who assisted the ProgramCommittee. We are indebted to Robert Kane forinstallingandmodifyingthesubmissionsoftware,maintainingthesubmission server and interacting with authors as well as for helping with the preparation of the program. August 2005 Frank Dehne, Alejandro Lop ' ez-Ortiz, and Jorg-R .. u ..diger Sack WADS Organization Organizing Institutions Steering Committee Frank Dehne Carleton University, Canada Ian Munro University of Waterloo, Canada J.. org-Rudig .. er Sack Carleton University, Canada Roberto Tamassia Brown University, Canada Program Co-chairs Frank Dehne Carleton University, Canada Alejandro Lop ' ez-Ortiz University of Waterloo, Canada J.. org-Rudig .. er Sack Carleton University, Canada Conference Chair Alejandro Lop ' ez-Ortiz University of Waterloo, Canada Program Committee Pankaj Agarwal Duke University, USA Michael Atkinson University of Otago, New Zealand Gill Barequet Technion, Israel Mark de Berg Tech.
R 1,583.55
R 1,221.00
Data Structure and Software Engineering
This title includes a number of Open Access chapters.Data structure and software engineering is an integral part of computer science. This volume presents new approaches and methods to knowledge sharing, brain mapping, data integration, and data storage. The author describes how to manage an organization’s business process and domain data and presents new software and hardware testing methods. The book introduces a game development framework used as a learning aid in a software engineering at the university level. It also features a review of social software engineering metrics and methods for processing business information. It explains how to use Pegasys to create and manage sequence analysis workflows.
R 4,020.83
R 1,172.00
R 2,211.00
R 1,221.00
Design of Dynamic Data Structures
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures.
R 1,538.58
Advanced Applications of Python Data Structures and Algorithms
Data structures are essential principles applicable to any programming language in computer science. Data structures may be studied more easily with Python than with any other programming language because of their interpretability, interactivity, and object-oriented nature. Computers may store and process data at an extraordinary rate and with outstanding accuracy. Therefore, it is of the utmost importance that the data is efficiently stored and is able to be accessed promptly. In addition, data processing should take as little time as feasible while maintaining the highest possible level of precision.Advanced Applications of Python Data Structures and Algorithms assists in understanding and applying the fundamentals of data structures and their many implementations and discusses the advantages and disadvantages of various data structures. Covering key topics such as Python, linked lists, datatypes, and operators, this reference work is ideal for industry professionals, computer scientists, researchers, academicians, scholars, practitioners, instructors, and students.
R 10,420.70
R 341.00
Practical Data Structures and Algorithms for Java Developers
Master data structures and algorithms in Java through a practical, engineering-focused approach that goes beyond theory. With modern examples and a structured approach, this book emphasizes not only how algorithms work, but how to choose, adapt, and apply them in real-world systems.To start, you will conquer fundamental concepts such as arrays and linked lists. From there, the book progresses through essential sorting and searching techniques such as QuickSort and Binary Search. Then, you will explore the implementation and use cases of stacks and queues, followed by tree and graph structures with traversal algorithms. The book ends with you tackling advanced topics, such as dynamic programming, tries, and advanced graph algorithms.Finally, you will be ready to put your skills to the test and apply your knowledge in real-world situations for performance optimization.What You Will Learn: Implement and optimize essential data structures in JavaSolve complex algorithmic problems with confidenceMaster best practices for writing efficient, scalable Java code for enterprise applicationsWho This Book Is For: Java developers with a basic understanding of programming concepts who want to deepen their knowledge of data structures and algorithms. Secondary audiences include students, competitive programmers, and software engineers preparing for technical interviews.
R 1,368.00
R 1,713.92
R 877.00
Advanced Applications of Python Data Structures and Algorithms
Data structures are essential principles applicable to any programming language in computer science. Data structures may be studied more easily with Python than with any other programming language because of their interpretability, interactivity, and object-oriented nature. Computers may store and process data at an extraordinary rate and with outstanding accuracy. Therefore, it is of the utmost importance that the data is efficiently stored and is able to be accessed promptly. In addition, data processing should take as little time as feasible while maintaining the highest possible level of precision.Advanced Applications of Python Data Structures and Algorithms assists in understanding and applying the fundamentals of data structures and their many implementations and discusses the advantages and disadvantages of various data structures. Covering key topics such as Python, linked lists, datatypes, and operators, this reference work is ideal for industry professionals, computer scientists, researchers, academicians, scholars, practitioners, instructors, and students.
R 7,924.74
R 1,600.01
R 550.00
Genetic Programming and Data Structures
Computers that `program themselves' has long been an aim of computer scientists. Recently genetic programming (GP) has started to show its promise by automatically evolving programs. Indeed in a small number of problems GP has evolved programs whose performance is similar to or even slightly better than that of programs written by people. The main thrust of GP has been to automatically create functions. While these can be of great use they contain no memory and relatively little work has addressed automatic creation of program code including stored data. This issue is the main focus of Genetic Programming, and Data Structures: Genetic Programming + Data Structures = Automatic Programming!. This book is motivated by the observation from software engineering that data abstraction (e.g., via abstract data types) is essential in programs created by human programmers. This book shows that abstract data types can be similarly beneficial to the automatic production of programs using GP. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! shows how abstract data types (stacks, queues and lists) can be evolved using genetic programming, demonstrates how GP can evolve general programs which solve the nested brackets problem, recognises a Dyck context free language, and implements a simple four function calculator. In these cases, an appropriate data structure is beneficial compared to simple indexed memory. This book also includes a survey of GP, with a critical review of experiments with evolving memory, and reports investigations of real world electrical network maintenance scheduling problems that demonstrate that Genetic Algorithms can find low cost viable solutions to such problems. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! should be of direct interest to computer scientists doing research on genetic programming, genetic algorithms, data structures, and artificial intelligence. In addition, this book will be of interest to practitioners working in all of these areas and to those interested in automatic programming.
R 4,653.57
Space-Efficient Data Structures, Streams, and Algorithms
This Festschrift volume, published in honour of J. Ian Munro, contains contributions written by some of his colleagues, former students, and friends. In celebration of his 66th birthday the colloquium "Conference on Space Efficient Data Structures, Streams and Algorithms" was held in Waterloo, ON, Canada, during August 15-16, 2013. The articles presented herein cover some of the main topics of Ian's research interests. Together they give a good overall perspective of the last 40 years of research in algorithms and data structures.
R 2,188.29
Manufacturing Data Structures
Manufacturing Data Structures "Comprehensive yeteasy-to-read.Manufacturing Data Structures is filled withanecdotes, yet stresses the importance of maintaining dataaccuracy. It is valuable reading for all manufacturing managers."Jim Carnall Manufacturing Manager, Eastman Kodak "An entertainingand informative look at an important aspect of day to day businessin the MRP II environment. It clearly shows how data structuringmethodology can be directly applied to process industries such asthe Personal Products/Health and Beauty business." Jeff L. StevensManager, Packaging Sciences, Chesebrough-Ponds Canada"Manufacturing Data Structures shows, in a very practical way, howmanufacturing data can be used as a competitive weapon. It's acomprehensive guide, filled with solutions to everyday problems."Jim Hendrickson Plant Manager, Reckitt & Colman "An excellentbook.Very useful on the subject of data foundations formanufacturing. It has suggested further opportunities forimprovement in my own organisation." R.A. Watson Rolls-Royce MotorCars "Manufacturing Data Structures will be of immense value to thepractitioner." Chris Cage ICI Pharmaceuticals
R 2,052.00
Algorithms and Data Structures in VLSI Design
One of the main problems in chip design is the enormous number of possible combinations of individual chip elements within a system, and the problem of their compatibility. The recent application of data structures, efficient algorithms, and ordered binary decision diagrams (OBDDs) has proven vital in designing the computer chips of tomorrow. This book provides an introduction to the foundations of this interdisciplinary research area, emphasizing its applications in computer aided circuit design.
R 2,015.00
Organic Structures from Spectra
The derivation of structural information from spectroscopic data is now an integral part of organic chemistry courses at all Universities. A critical part of any such course is a suitable set of problems to develop the students’ understanding of how organic structures are determined from spectra. The book builds on the very successful teaching philosophy of learning by hands-on problem solving; carefully graded examples build confidence and develop and consolidate a student’s understanding of organic spectroscopy. Organic Structures from Spectra, 6th Edition is a carefully chosen set of about 250 structural problems employing the major modern spectroscopic techniques, including Mass Spectrometry, 1D and 2D 13C and 1H NMR Spectroscopy and Infrared Spectroscopy. There are 25 problems specifically dealing with the interpretation of spin–spin coupling in proton NMR spectra and 10 problems based on the quantitative analysis of mixtures using proton and carbon NMR spectroscopy. The accompanying text is descriptive and only explains the underlying theory at a level that is sufficient to tackle the problems. The text includes condensed tables of characteristic spectral properties covering the frequently encountered functional groups. The examples themselves have been selected to include all important structural features and to emphasise connectivity arguments and stereochemistry. Many of the compounds were synthesised specifically for this book. In this collection, there are many additional easy problems designed to build confidence and to demonstrate basic principles. The Sixth Edition of this popular textbook: now incorporates many new problems using 2D NMR spectra (C–H Correlation spectroscopy, HMBC, COSY, NOESY and TOCSY);has been expanded and updated to reflect the new developments in NMR spectroscopy;has an additional 40 carefully selected basic problems;provides a set of problems dealing specifically with the quantitative analysis of mixtures using NMR spectroscopy;features proton NMR spectra obtained at 200, 400 and 600 MHz and 13C NMR spectra including routine 2D C–H correlation, HMBC spectra and DEPT spectra;contains a selection of problems in the style of the experimental section of a research paper;includes examples of fully worked solutions in the appendix;has a complete set of solutions available to instructors and teachers from the authors. Organic Structures from Spectra, Sixth Edition will prove invaluable for students of Chemistry, Pharmacy and Biochemistry taking a first course in Organic Chemistry.
R 2,147.00
